Struct dock_runtime::trust_registry::TrustRegistryStoredSchemas

pub struct TrustRegistryStoredSchemas<T>(pub BoundedBTreeSet<TrustRegistrySchemaId, <T as Limits>::MaxSchemasPerRegistry>)
where
         T: Limits;

Set of schemas that belong to the TrustRegistry

Tuple Fields

0: BoundedBTreeSet<TrustRegistrySchemaId, <T as Limits>::MaxSchemasPerRegistry>

Methods from Deref<Target = BoundedBTreeSet<TrustRegistrySchemaId, <T as Limits>::MaxSchemasPerRegistry>>

pub fn clear(&mut self)

Clears the set, removing all elements.

pub fn try_insert(&mut self, item: T) -> Result<bool, T>

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

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

pub fn remove<Q>(&mut self, item: &Q) -> boolwhere T: Borrow<Q>, Q: Ord + ?Sized,

Remove an item from the set, returning whether it was previously in the set.

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

pub fn take<Q>(&mut self, value: &Q) -> Option<T>where T: Borrow<Q> + Ord, Q: Ord + ?Sized,

Removes and returns the value in the set, if any, that is equal to the given one.

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

Methods from Deref<Target = BTreeSet<T, Global>>

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

Constructs a double-ended iterator over a sub-range of elements in the set. 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

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

let mut set = BTreeSet::new();
set.insert(3);
set.insert(5);
set.insert(8);
for &elem in set.range((Included(&4), Included(&8))) {
    println!("{elem}");
}
assert_eq!(Some(&5), set.range(4..).next());

pub fn difference<'a>( &'a self, other: &'a BTreeSet<T, A> ) -> Difference<'a, T, A>where T: Ord,

Visits the elements representing the difference, i.e., the elements that are in self but not in other, in ascending order.

Examples

use std::collections::BTreeSet;

let mut a = BTreeSet::new();
a.insert(1);
a.insert(2);

let mut b = BTreeSet::new();
b.insert(2);
b.insert(3);

let diff: Vec<_> = a.difference(&b).cloned().collect();
assert_eq!(diff, [1]);

pub fn symmetric_difference<'a>( &'a self, other: &'a BTreeSet<T, A> ) -> SymmetricDifference<'a, T>where T: Ord,

Visits the elements representing the symmetric difference, i.e., the elements that are in self or in other but not in both, in ascending order.

Examples

use std::collections::BTreeSet;

let mut a = BTreeSet::new();
a.insert(1);
a.insert(2);

let mut b = BTreeSet::new();
b.insert(2);
b.insert(3);

let sym_diff: Vec<_> = a.symmetric_difference(&b).cloned().collect();
assert_eq!(sym_diff, [1, 3]);

pub fn intersection<'a>( &'a self, other: &'a BTreeSet<T, A> ) -> Intersection<'a, T, A>where T: Ord,

Visits the elements representing the intersection, i.e., the elements that are both in self and other, in ascending order.

Examples

use std::collections::BTreeSet;

let mut a = BTreeSet::new();
a.insert(1);
a.insert(2);

let mut b = BTreeSet::new();
b.insert(2);
b.insert(3);

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

pub fn union<'a>(&'a self, other: &'a BTreeSet<T, A>) -> Union<'a, T>where T: Ord,

Visits the elements representing the union, i.e., all the elements in self or other, without duplicates, in ascending order.

Examples

use std::collections::BTreeSet;

let mut a = BTreeSet::new();
a.insert(1);

let mut b = BTreeSet::new();
b.insert(2);

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

pub fn contains<Q>(&self, value: &Q) -> boolwhere T: Borrow<Q> + Ord, Q: Ord + ?Sized,

Returns true if the set contains an element equal to the value.

The value may be any borrowed form of the set’s element type, but the ordering on the borrowed form must match the ordering on the element type.

Examples

use std::collections::BTreeSet;

let set = BTreeSet::from([1, 2, 3]);
assert_eq!(set.contains(&1), true);
assert_eq!(set.contains(&4), false);

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

Returns a reference to the element in the set, if any, that is equal to the value.

The value may be any borrowed form of the set’s element type, but the ordering on the borrowed form must match the ordering on the element type.

Examples

use std::collections::BTreeSet;

let set = BTreeSet::from([1, 2, 3]);
assert_eq!(set.get(&2), Some(&2));
assert_eq!(set.get(&4), None);

pub fn is_disjoint(&self, other: &BTreeSet<T, A>) -> boolwhere T: Ord,

Returns true if self has no elements in common with other. This is equivalent to checking for an empty intersection.

Examples

use std::collections::BTreeSet;

let a = BTreeSet::from([1, 2, 3]);
let mut b = BTreeSet::new();

assert_eq!(a.is_disjoint(&b), true);
b.insert(4);
assert_eq!(a.is_disjoint(&b), true);
b.insert(1);
assert_eq!(a.is_disjoint(&b), false);

pub fn is_subset(&self, other: &BTreeSet<T, A>) -> boolwhere T: Ord,

Returns true if the set is a subset of another, i.e., other contains at least all the elements in self.

Examples

use std::collections::BTreeSet;

let sup = BTreeSet::from([1, 2, 3]);
let mut set = BTreeSet::new();

assert_eq!(set.is_subset(&sup), true);
set.insert(2);
assert_eq!(set.is_subset(&sup), true);
set.insert(4);
assert_eq!(set.is_subset(&sup), false);

pub fn is_superset(&self, other: &BTreeSet<T, A>) -> boolwhere T: Ord,

Returns true if the set is a superset of another, i.e., self contains at least all the elements in other.

Examples

use std::collections::BTreeSet;

let sub = BTreeSet::from([1, 2]);
let mut set = BTreeSet::new();

assert_eq!(set.is_superset(&sub), false);

set.insert(0);
set.insert(1);
assert_eq!(set.is_superset(&sub), false);

set.insert(2);
assert_eq!(set.is_superset(&sub), true);

pub fn first(&self) -> Option<&T>where T: Ord,

Returns a reference to the first element in the set, if any. This element is always the minimum of all elements in the set.

Examples

Basic usage:

use std::collections::BTreeSet;

let mut set = BTreeSet::new();
assert_eq!(set.first(), None);
set.insert(1);
assert_eq!(set.first(), Some(&1));
set.insert(2);
assert_eq!(set.first(), Some(&1));

pub fn last(&self) -> Option<&T>where T: Ord,

Returns a reference to the last element in the set, if any. This element is always the maximum of all elements in the set.

Examples

Basic usage:

use std::collections::BTreeSet;

let mut set = BTreeSet::new();
assert_eq!(set.last(), None);
set.insert(1);
assert_eq!(set.last(), Some(&1));
set.insert(2);
assert_eq!(set.last(), Some(&2));

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

Gets an iterator that visits the elements in the BTreeSet in ascending order.

Examples

use std::collections::BTreeSet;

let set = BTreeSet::from([1, 2, 3]);
let mut set_iter = set.iter();
assert_eq!(set_iter.next(), Some(&1));
assert_eq!(set_iter.next(), Some(&2));
assert_eq!(set_iter.next(), Some(&3));
assert_eq!(set_iter.next(), None);

Values returned by the iterator are returned in ascending order:

use std::collections::BTreeSet;

let set = BTreeSet::from([3, 1, 2]);
let mut set_iter = set.iter();
assert_eq!(set_iter.next(), Some(&1));
assert_eq!(set_iter.next(), Some(&2));
assert_eq!(set_iter.next(), Some(&3));
assert_eq!(set_iter.next(), None);

pub fn len(&self) -> usize

Returns the number of elements in the set.

Examples

use std::collections::BTreeSet;

let mut v = BTreeSet::new();
assert_eq!(v.len(), 0);
v.insert(1);
assert_eq!(v.len(), 1);

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

Examples

use std::collections::BTreeSet;

let mut v = BTreeSet::new();
assert!(v.is_empty());
v.insert(1);
assert!(!v.is_empty());

Trait Implementations

impl<T> CanUpdateKeyed<TrustRegistryStoredSchemas<T>> for Convenerwhere T: Limits,

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

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

impl<T> CanUpdateKeyed<TrustRegistryStoredSchemas<T>> for IssuerOrVerifierwhere T: Limits,

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

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

impl<T> Clone for TrustRegistryStoredSchemas<T>where T: Limits,

fn clone(&self) -> TrustRegistryStoredSchemas<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T> Debug for TrustRegistryStoredSchemas<T>where T: Limits,

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

Formats the value using the given formatter.

impl<T> Decode for TrustRegistryStoredSchemas<T>where T: Limits, BoundedBTreeSet<TrustRegistrySchemaId, <T as Limits>::MaxSchemasPerRegistry>: Decode,

fn decode<__CodecInputEdqy>( __codec_input_edqy: &mut __CodecInputEdqy ) -> Result<TrustRegistryStoredSchemas<T>, 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> Default for TrustRegistryStoredSchemas<T>where T: Limits,

fn default() -> TrustRegistryStoredSchemas<T>

Returns the “default value” for a type.

impl<T> Deref for TrustRegistryStoredSchemas<T>where T: Limits,

type Target = BoundedBTreeSet<TrustRegistrySchemaId, <T as Limits>::MaxSchemasPerRegistry>

The resulting type after dereferencing.

fn deref(&self) -> &<TrustRegistryStoredSchemas<T> as Deref>::Target

Dereferences the value.

impl<T> DerefMut for TrustRegistryStoredSchemas<T>where T: Limits,

fn deref_mut(&mut self) -> &mut <TrustRegistryStoredSchemas<T> as Deref>::Target

Mutably dereferences the value.

impl<'de, T> Deserialize<'de> for TrustRegistryStoredSchemas<T>where T: Limits,

fn deserialize<__D>( __deserializer: __D ) -> Result<TrustRegistryStoredSchemas<T>, <__D as Deserializer<'de>>::Error>where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<T> Encode for TrustRegistryStoredSchemas<T>where T: Limits, BoundedBTreeSet<TrustRegistrySchemaId, <T as Limits>::MaxSchemasPerRegistry>: 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> From<BoundedBTreeSet<TrustRegistrySchemaId, <T as Limits>::MaxSchemasPerRegistry>> for TrustRegistryStoredSchemas<T>where T: Limits,

fn from( value: BoundedBTreeSet<TrustRegistrySchemaId, <T as Limits>::MaxSchemasPerRegistry> ) -> TrustRegistryStoredSchemas<T>

Converts to this type from the input type.

impl<T> From<TrustRegistryStoredSchemas<T>> for BoundedBTreeSet<TrustRegistrySchemaId, <T as Limits>::MaxSchemasPerRegistry>where T: Limits,

fn from( wrapper: TrustRegistryStoredSchemas<T> ) -> BoundedBTreeSet<TrustRegistrySchemaId, <T as Limits>::MaxSchemasPerRegistry>

Converts to this type from the input type.

impl<T> MaxEncodedLen for TrustRegistryStoredSchemas<T>where T: Limits, BoundedBTreeSet<TrustRegistrySchemaId, <T as Limits>::MaxSchemasPerRegistry>: MaxEncodedLen,

fn max_encoded_len() -> usize

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

impl<T> PartialEq<TrustRegistryStoredSchemas<T>> for TrustRegistryStoredSchemas<T>where T: Limits,

fn eq(&self, other: &TrustRegistryStoredSchemas<T>) -> 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> Serialize for TrustRegistryStoredSchemas<T>where T: Limits,

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> TypeInfo for TrustRegistryStoredSchemas<T>where T: Limits + 'static, BoundedBTreeSet<TrustRegistrySchemaId, <T as Limits>::MaxSchemasPerRegistry>: TypeInfo + 'static,

type Identity = TrustRegistryStoredSchemas<T>

The type identifying for which type info is provided.

fn type_info() -> Type<MetaForm>

Returns the static type identifier for Self.

impl<T> EncodeLike<TrustRegistryStoredSchemas<T>> for TrustRegistryStoredSchemas<T>where T: Limits, BoundedBTreeSet<TrustRegistrySchemaId, <T as Limits>::MaxSchemasPerRegistry>: Encode,

impl<T> Eq for TrustRegistryStoredSchemas<T>where T: Limits,