Struct dock_runtime::trust_registry::types::IssuersWith

pub struct IssuersWith<T, Entry>(pub BoundedBTreeMap<Issuer, Entry, <T as Limits>::MaxIssuersPerSchema>)
where
         T: Limits,
         Entry: Eq + Clone + Debug;

A map from Issuer to some value.

Tuple Fields

0: BoundedBTreeMap<Issuer, Entry, <T as Limits>::MaxIssuersPerSchema>

Methods from Deref<Target = BoundedBTreeMap<Issuer, Entry, <T as Limits>::MaxIssuersPerSchema>>

pub fn retain<F>(&mut self, f: F)where F: FnMut(&K, &mut V) -> bool,

Exactly the same semantics as BTreeMap::retain.

The is a safe &mut self borrow because retain can only ever decrease the length of the inner map.

pub fn clear(&mut self)

Clears the map, removing all elements.

pub fn get_mut<Q>(&mut self, key: &Q) -> Option<&mut V>where K: Borrow<Q>, Q: Ord + ?Sized,

Return a mutable reference to the value corresponding to the key.

The key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.

pub fn try_insert(&mut self, key: K, value: V) -> Result<Option<V>, (K, V)>

Exactly the same semantics as BTreeMap::insert, but returns an Err (and is a noop) if the new length of the map exceeds S.

In the Err case, returns the inserted pair so it can be further used without cloning.

pub fn remove<Q>(&mut self, key: &Q) -> Option<V>where K: Borrow<Q>, Q: Ord + ?Sized,

Remove a key from the map, returning the value at the key if the key was previously in the map.

The key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.

pub fn remove_entry<Q>(&mut self, key: &Q) -> Option<(K, V)>where K: Borrow<Q>, Q: Ord + ?Sized,

Remove a key from the map, returning the value at the key if the key was previously in the map.

The key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.

pub fn iter_mut(&mut self) -> IterMut<'_, K, V>

Gets a mutable iterator over the entries of the map, sorted by key.

See BTreeMap::iter_mut for more information.

Methods from Deref<Target = BTreeMap<K, V, Global>>

pub fn get<Q>(&self, key: &Q) -> Option<&V>where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

Returns a reference to the value corresponding to the key.

The key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.

Examples

Basic usage:

use std::collections::BTreeMap;

let mut map = BTreeMap::new();
map.insert(1, "a");
assert_eq!(map.get(&1), Some(&"a"));
assert_eq!(map.get(&2), None);

pub fn get_key_value<Q>(&self, k: &Q) -> Option<(&K, &V)>where K: Borrow<Q> + Ord, Q: Ord + ?Sized,

Returns the key-value pair corresponding to the supplied key.

The supplied key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.

Examples

use std::collections::BTreeMap;

let mut map = BTreeMap::new();
map.insert(1, "a");
assert_eq!(map.get_key_value(&1), Some((&1, &"a")));
assert_eq!(map.get_key_value(&2), None);

pub fn first_key_value(&self) -> Option<(&K, &V)>where K: Ord,

Returns the first key-value pair in the map. The key in this pair is the minimum key in the map.

Examples

Basic usage:

use std::collections::BTreeMap;

let mut map = BTreeMap::new();
assert_eq!(map.first_key_value(), None);
map.insert(1, "b");
map.insert(2, "a");
assert_eq!(map.first_key_value(), Some((&1, &"b")));

pub fn last_key_value(&self) -> Option<(&K, &V)>where K: Ord,

Returns the last key-value pair in the map. The key in this pair is the maximum key in the map.

Examples

Basic usage:

use std::collections::BTreeMap;

let mut map = BTreeMap::new();
map.insert(1, "b");
map.insert(2, "a");
assert_eq!(map.last_key_value(), Some((&2, &"a")));

pub fn contains_key<Q>(&self, key: &Q) -> boolwhere K: Borrow<Q> + Ord, Q: Ord + ?Sized,

Returns true if the map contains a value for the specified key.

The key may be any borrowed form of the map’s key type, but the ordering on the borrowed form must match the ordering on the key type.

Examples

Basic usage:

use std::collections::BTreeMap;

let mut map = BTreeMap::new();
map.insert(1, "a");
assert_eq!(map.contains_key(&1), true);
assert_eq!(map.contains_key(&2), false);

pub fn range<T, R>(&self, range: R) -> Range<'_, K, V>where T: Ord + ?Sized, K: Borrow<T> + Ord, R: RangeBounds<T>,

Constructs a double-ended iterator over a sub-range of elements in the map. The simplest way is to use the range syntax min..max, thus range(min..max) will yield elements from min (inclusive) to max (exclusive). The range may also be entered as (Bound<T>, Bound<T>), so for example range((Excluded(4), Included(10))) will yield a left-exclusive, right-inclusive range from 4 to 10.

Panics

Panics if range start > end. Panics if range start == end and both bounds are Excluded.

Examples

Basic usage:

use std::collections::BTreeMap;
use std::ops::Bound::Included;

let mut map = BTreeMap::new();
map.insert(3, "a");
map.insert(5, "b");
map.insert(8, "c");
for (&key, &value) in map.range((Included(&4), Included(&8))) {
    println!("{key}: {value}");
}
assert_eq!(Some((&5, &"b")), map.range(4..).next());

pub fn iter(&self) -> Iter<'_, K, V>

Gets an iterator over the entries of the map, sorted by key.

Examples

Basic usage:

use std::collections::BTreeMap;

let mut map = BTreeMap::new();
map.insert(3, "c");
map.insert(2, "b");
map.insert(1, "a");

for (key, value) in map.iter() {
    println!("{key}: {value}");
}

let (first_key, first_value) = map.iter().next().unwrap();
assert_eq!((*first_key, *first_value), (1, "a"));

pub fn keys(&self) -> Keys<'_, K, V>

Gets an iterator over the keys of the map, in sorted order.

Examples

Basic usage:

use std::collections::BTreeMap;

let mut a = BTreeMap::new();
a.insert(2, "b");
a.insert(1, "a");

let keys: Vec<_> = a.keys().cloned().collect();
assert_eq!(keys, [1, 2]);

pub fn values(&self) -> Values<'_, K, V>

Gets an iterator over the values of the map, in order by key.

Examples

Basic usage:

use std::collections::BTreeMap;

let mut a = BTreeMap::new();
a.insert(1, "hello");
a.insert(2, "goodbye");

let values: Vec<&str> = a.values().cloned().collect();
assert_eq!(values, ["hello", "goodbye"]);

pub fn len(&self) -> usize

Returns the number of elements in the map.

Examples

Basic usage:

use std::collections::BTreeMap;

let mut a = BTreeMap::new();
assert_eq!(a.len(), 0);
a.insert(1, "a");
assert_eq!(a.len(), 1);

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

Examples

Basic usage:

use std::collections::BTreeMap;

let mut a = BTreeMap::new();
assert!(a.is_empty());
a.insert(1, "a");
assert!(!a.is_empty());

pub fn lower_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>where K: Borrow<Q> + Ord, Q: Ord,

🔬This is a nightly-only experimental API. (btree_cursors)

Returns a Cursor pointing at the first element that is above the given bound.

If no such element exists then a cursor pointing at the “ghost” non-element is returned.

Passing Bound::Unbounded will return a cursor pointing at the first element of the map.

Examples

Basic usage:

#![feature(btree_cursors)]

use std::collections::BTreeMap;
use std::ops::Bound;

let mut a = BTreeMap::new();
a.insert(1, "a");
a.insert(2, "b");
a.insert(3, "c");
a.insert(4, "c");
let cursor = a.lower_bound(Bound::Excluded(&2));
assert_eq!(cursor.key(), Some(&3));

pub fn upper_bound<Q>(&self, bound: Bound<&Q>) -> Cursor<'_, K, V>where K: Borrow<Q> + Ord, Q: Ord,

🔬This is a nightly-only experimental API. (btree_cursors)

Returns a Cursor pointing at the last element that is below the given bound.

If no such element exists then a cursor pointing at the “ghost” non-element is returned.

Passing Bound::Unbounded will return a cursor pointing at the last element of the map.

Examples

Basic usage:

#![feature(btree_cursors)]

use std::collections::BTreeMap;
use std::ops::Bound;

let mut a = BTreeMap::new();
a.insert(1, "a");
a.insert(2, "b");
a.insert(3, "c");
a.insert(4, "c");
let cursor = a.upper_bound(Bound::Excluded(&3));
assert_eq!(cursor.key(), Some(&2));

Trait Implementations

impl<T> CanUpdate<IssuersWith<T, VerificationPrices<T>>> for Convenerwhere T: Limits,

fn can_add(&self, _entity: &IssuersWith<T, VerificationPrices<T>>) -> bool

Checks whether the new entity can be added.

fn can_remove(&self, _entity: &IssuersWith<T, VerificationPrices<T>>) -> bool

Checks whether the existing entity can be removed.

fn can_replace( &self, _new: &IssuersWith<T, VerificationPrices<T>>, _existing: &IssuersWith<T, VerificationPrices<T>> ) -> bool

Checks whether the provided entity can replace the existing one.

impl<T> CanUpdate<IssuersWith<T, VerificationPrices<T>>> for IssuerOrVerifierwhere T: Limits,

fn can_add(&self, _new: &Entity) -> bool

Checks whether the new entity can be added.

fn can_replace(&self, _new: &Entity, _current: &Entity) -> bool

Checks whether the provided entity can replace the existing one.

fn can_remove(&self, _entity: &Entity) -> bool

Checks whether the existing entity can be removed.

impl<T> CanUpdateKeyed<IssuersWith<T, VerificationPrices<T>>> for Convenerwhere T: Limits,

fn can_update_keyed<U>( &self, _entity: &IssuersWith<T, VerificationPrices<T>>, _update: &U ) -> boolwhere U: KeyedUpdate<IssuersWith<T, VerificationPrices<T>>>,

Checks whether the underlying keyed update can be applied, i.e. all associated updates are valid.

impl<T> CanUpdateKeyed<IssuersWith<T, VerificationPrices<T>>> for Issuerwhere T: Limits,

fn can_update_keyed<U>( &self, entity: &IssuersWith<T, VerificationPrices<T>>, update: &U ) -> boolwhere U: KeyedUpdate<IssuersWith<T, VerificationPrices<T>>>,

Checks whether the underlying keyed update can be applied, i.e. all associated updates are valid.

impl<T> CanUpdateKeyed<IssuersWith<T, VerificationPrices<T>>> for IssuerOrVerifierwhere T: Limits,

fn can_update_keyed<U>( &self, entity: &IssuersWith<T, VerificationPrices<T>>, update: &U ) -> boolwhere U: KeyedUpdate<IssuersWith<T, VerificationPrices<T>>>,

Checks whether the underlying keyed update can be applied, i.e. all associated updates are valid.

impl<T, Entry> Clone for IssuersWith<T, Entry>where T: Limits, Entry: Eq + Clone + Debug,

fn clone(&self) -> IssuersWith<T, Entry>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<T, Entry> Debug for IssuersWith<T, Entry>where T: Limits, Entry: Eq + Clone + Debug,

fn fmt(&self, fmt: &mut Formatter<'_>) -> Result<(), Error>

Formats the value using the given formatter.

impl<T, Entry> Decode for IssuersWith<T, Entry>where T: Limits, Entry: Eq + Clone + Debug, BoundedBTreeMap<Issuer, Entry, <T as Limits>::MaxIssuersPerSchema>: Decode,

fn decode<__CodecInputEdqy>( __codec_input_edqy: &mut __CodecInputEdqy ) -> Result<IssuersWith<T, Entry>, Error>where __CodecInputEdqy: Input,

Attempt to deserialise the value from input.

fn decode_into<I>( input: &mut I, dst: &mut MaybeUninit<Self> ) -> Result<DecodeFinished, Error>where I: Input,

Attempt to deserialize the value from input into a pre-allocated piece of memory.

fn skip<I>(input: &mut I) -> Result<(), Error>where I: Input,

Attempt to skip the encoded value from input.

fn encoded_fixed_size() -> Option<usize>

Returns the fixed encoded size of the type.

impl<T, Entry> Default for IssuersWith<T, Entry>where T: Limits, Entry: Eq + Clone + Debug,

fn default() -> IssuersWith<T, Entry>

Returns the “default value” for a type.

impl<T, Entry> Deref for IssuersWith<T, Entry>where T: Limits, Entry: Eq + Clone + Debug,

type Target = BoundedBTreeMap<Issuer, Entry, <T as Limits>::MaxIssuersPerSchema>

The resulting type after dereferencing.

fn deref(&self) -> &<IssuersWith<T, Entry> as Deref>::Target

Dereferences the value.

impl<T, Entry> DerefMut for IssuersWith<T, Entry>where T: Limits, Entry: Eq + Clone + Debug,

fn deref_mut(&mut self) -> &mut <IssuersWith<T, Entry> as Deref>::Target

Mutably dereferences the value.

impl<'de, T, Entry> Deserialize<'de> for IssuersWith<T, Entry>where T: Limits, Entry: Eq + Clone + Debug + Deserialize<'de>,

fn deserialize<D>( deserializer: D ) -> Result<IssuersWith<T, Entry>, <D as Deserializer<'de>>::Error>where D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T, Entry> Encode for IssuersWith<T, Entry>where T: Limits, Entry: Eq + Clone + Debug, BoundedBTreeMap<Issuer, Entry, <T as Limits>::MaxIssuersPerSchema>: Encode,

fn size_hint(&self) -> usize

If possible give a hint of expected size of the encoding.

fn encode_to<__CodecOutputEdqy>(&self, __codec_dest_edqy: &mut __CodecOutputEdqy)where __CodecOutputEdqy: Output + ?Sized,

Convert self to a slice and append it to the destination.

fn encode(&self) -> Vec<u8, Global>

Convert self to an owned vector.

fn using_encoded<R, F>(&self, f: F) -> Rwhere F: FnOnce(&[u8]) -> R,

Convert self to a slice and then invoke the given closure with it.

fn encoded_size(&self) -> usize

Calculates the encoded size.

impl<T, Entry> From<BoundedBTreeMap<Issuer, Entry, <T as Limits>::MaxIssuersPerSchema>> for IssuersWith<T, Entry>where T: Limits, Entry: Eq + Clone + Debug,

fn from( value: BoundedBTreeMap<Issuer, Entry, <T as Limits>::MaxIssuersPerSchema> ) -> IssuersWith<T, Entry>

Converts to this type from the input type.

impl<T, Entry> From<IssuersWith<T, Entry>> for BoundedBTreeMap<Issuer, Entry, <T as Limits>::MaxIssuersPerSchema>where T: Limits, Entry: Eq + Clone + Debug,

fn from( wrapper: IssuersWith<T, Entry> ) -> BoundedBTreeMap<Issuer, Entry, <T as Limits>::MaxIssuersPerSchema>

Converts to this type from the input type.

impl<T, Entry> MaxEncodedLen for IssuersWith<T, Entry>where T: Limits, Entry: Eq + Clone + Debug, BoundedBTreeMap<Issuer, Entry, <T as Limits>::MaxIssuersPerSchema>: MaxEncodedLen,

fn max_encoded_len() -> usize

Upper bound, in bytes, of the maximum encoded size of this item.

impl<T, Entry> PartialEq<IssuersWith<T, Entry>> for IssuersWith<T, Entry>where T: Limits, Entry: Eq + Clone + Debug,

fn eq(&self, other: &IssuersWith<T, Entry>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

This method tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T, Entry> Serialize for IssuersWith<T, Entry>where T: Limits, Entry: Eq + Clone + Debug + Serialize,

fn serialize<S>( &self, serializer: S ) -> Result<<S as Serializer>::Ok, <S as Serializer>::Error>where S: Serializer,

Serialize this value into the given Serde serializer.

impl<T> TryFrom<UnboundedIssuersWith<UnboundedVerificationPrices>> for IssuersWith<T, VerificationPrices<T>>where T: Limits,

type Error = Error<T>

The type returned in the event of a conversion error.

fn try_from( _: UnboundedIssuersWith<UnboundedVerificationPrices> ) -> Result<IssuersWith<T, VerificationPrices<T>>, <IssuersWith<T, VerificationPrices<T>> as TryFrom<UnboundedIssuersWith<UnboundedVerificationPrices>>>::Error>

Performs the conversion.

impl<T, Entry> TypeInfo for IssuersWith<T, Entry>where T: Limits + 'static, Entry: Eq + Clone + Debug + TypeInfo + 'static, BoundedBTreeMap<Issuer, Entry, <T as Limits>::MaxIssuersPerSchema>: TypeInfo + 'static,

type Identity = IssuersWith<T, Entry>

The type identifying for which type info is provided.

fn type_info() -> Type<MetaForm>

Returns the static type identifier for Self.

impl<T, Entry> EncodeLike<IssuersWith<T, Entry>> for IssuersWith<T, Entry>where T: Limits, Entry: Eq + Clone + Debug, BoundedBTreeMap<Issuer, Entry, <T as Limits>::MaxIssuersPerSchema>: Encode,

impl<T, Entry> Eq for IssuersWith<T, Entry>where T: Limits, Entry: Eq + Clone + Debug,