Struct HashSet 

pub struct HashSet<V: Storable<D> + Serializable, D: DB = DefaultDB, A: Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)> = SizeAnn>(pub HashMap<V, (), D, A>);

A set. Uses HashMap under the hood.

Tuple Fields

0: HashMap<V, (), D, A>

Implementations

impl<V: Storable<D> + Serializable, D: DB, A: Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>> HashSet<V, D, A>

pub fn new() -> Self

Creates an empty set

pub fn insert(&self, value: V) -> Self

Insert object value. Overwrites any preexisting object under the same value

pub fn remove(&self, value: &V) -> Self

Remove object

pub fn member(&self, value: &V) -> bool

Check if the set contains a value.

pub fn is_subset(&self, other: &HashSet<V, D, A>) -> bool

Check if a HashSet is the subset of another HashSet.

pub fn union(&self, other: &HashSet<V, D, A>) -> HashSet<V, D, A>

where V: Clone,

Union with another set

pub fn iter(&self) -> impl Iterator<Item = Arc<Sp<V, D>>> + '_

where V: Clone,

Iterate over the key value pairs in the hash set

pub fn size(&self) -> usize

Number of elements in the set

pub fn is_empty(&self) -> bool

Returns true if empty

pub fn ann(&self) -> A

Retrieve the annotation on the root of the trie

Trait Implementations

impl<V, D: DB, A> Clone for HashSet<V, D, A>

where V: Clone + Storable<D> + Serializable, A: Clone + Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T: Serializable + Storable<D> + Clone + PartialEq + Eq + PartialOrd + Ord + Hash, D: DB, A: Storable<D> + Annotation<(Sp<T, D>, Sp<(), D>)>> Container<D> for HashSet<T, D, A>

type Item = T

The contained type

fn iter_items(self) -> impl Iterator<Item = Self::Item>

Gets an iterator over the Container’s items

fn once(item: Self::Item) -> Self

Wrap a single item in a `Container``

impl<V: Debug + Storable<D> + Serializable, D: DB, A: Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>> Debug for HashSet<V, D, A>

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

Formats the value using the given formatter.

impl<V: Storable<D> + Serializable, D: DB, A: Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>> Default for HashSet<V, D, A>

fn default() -> Self

Returns the “default value” for a type.

impl<V: Storable<D> + Serializable, D: DB, A: Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>> Deserializable for HashSet<V, D, A>

fn deserialize(__reader: &mut impl Read, recursion_depth: u32) -> Result<Self>

const LIMIT_RECURSION: bool = true

fn check_rec(depth: &mut u32) -> Result<(), Error>

impl<V: Storable<D> + Serializable, D: DB, A: Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>> Distribution<HashSet<V, D, A>> for Standard

where Standard: Distribution<V>,

fn sample<R: Rng + ?Sized>(&self, rng: &mut R) -> HashSet<V, D, A>

Generate a random value of T, using rng as the source of randomness.

fn sample_iter<R>(self, rng: R) -> DistIter<Self, R, T>

where R: Rng, Self: Sized,

Create an iterator that generates random values of T, using rng as the source of randomness.

fn map<F, S>(self, func: F) -> DistMap<Self, F, T, S>

where F: Fn(T) -> S, Self: Sized,

Create a distribution of values of ‘S’ by mapping the output of Self through the closure F

impl<V, D, A> FromIterator<V> for HashSet<V, D, A>

where V: Storable<D> + Serializable, D: DB, A: Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>,

fn from_iter<T: IntoIterator<Item = V>>(iter: T) -> Self

Creates a value from an iterator.

impl<V, D: DB, A> Hash for HashSet<V, D, A>

where V: Hash + Storable<D> + Serializable, A: Hash + Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>,

fn hash<__H: Hasher>(&self, __state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<V, D: DB, A> Ord for HashSet<V, D, A>

where V: Ord + Storable<D> + Serializable, A: Ord + Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>,

fn cmp(&self, __other: &Self) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<V, D: DB, A> PartialEq for HashSet<V, D, A>

where V: PartialEq + Storable<D> + Serializable, A: PartialEq + Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>,

fn eq(&self, __other: &Self) -> bool

Tests for self and other values to be equal, and is used by ==.

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

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

impl<V, D: DB, A> PartialOrd for HashSet<V, D, A>

where V: PartialOrd + Storable<D> + Serializable, A: PartialOrd + Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>,

fn partial_cmp(&self, __other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<T: Storable<D> + Serializable, D: DB, A: Storable<D> + Annotation<(Sp<T, D>, Sp<(), D>)>> Semigroup for HashSet<T, D, A>

fn append(&self, other: &Self) -> Self

The associative binary operator

impl<V: Storable<D> + Serializable, D: DB, A: Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>> Serializable for HashSet<V, D, A>

fn serialize(&self, __writer: &mut impl Write) -> Result<()>

fn serialized_size(&self) -> usize

impl<V: Serialize + Serializable + Storable<D>, D: DB, A: Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>> Serialize for HashSet<V, D, A>

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

Serialize this value into the given Serde serializer.

impl<V: Storable<D> + Serializable, D: DB, A: Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>> Storable<D> for HashSet<V, D, A>

fn children(&self) -> Vec<ArenaKey<<D as DB>::Hasher>>

Provides an iterator over hashes of child Sps, if any. These hashes will be passed back into from_binary_repr when deserializing.

fn to_binary_repr<W: Write>(&self, writer: &mut W) -> Result<(), Error>

Serializes self, omitting any children.

fn from_binary_repr<R: Read>( reader: &mut R, child_hashes: &mut impl Iterator<Item = ArenaKey<<D as DB>::Hasher>>, loader: &impl Loader<D>, ) -> Result<Self, Error>

Instantiates self, given hashes of any children, and loader that loads children given their hash.

fn check_invariant(&self) -> Result<(), Error>

An invariant to check on deserialization. Should be invoked from within from_binary_repr.

fn as_child(&self) -> ArenaKey<<D as DB>::Hasher>

Represents self as a ArenaKey

impl<V: Storable<D> + Serializable + Tagged, D: DB, A: Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)> + Tagged> Tagged for HashSet<V, D, A>

fn tag() -> Cow<'static, str>

Retrieves the tag of Self. Returns a [Cow] as type arguments require allocation, but no allocation is preferred.

fn tag_unique_factor() -> String

A decomposition of this tag into primitive types (any type whose representation is not defined through other types), tuples (via (a,b)), and sum types (via [a,b]).

impl<V, D: DB, A> Eq for HashSet<V, D, A>

where V: Eq + Storable<D> + Serializable, A: Eq + Storable<D> + Annotation<(Sp<V, D>, Sp<(), D>)>,