Struct cairo_lang_utils::ordered_hash_set::OrderedHashSet

pub struct OrderedHashSet<Key: Hash + Eq, S = RandomState>(/* private fields */);

Implementations

impl<Key: Hash + Eq> OrderedHashSet<Key>

pub fn new() -> Self

Creates an empty OrderedHashSet.

The hash set is initially created with a capacity of 0, so it will not allocate until it is first inserted into.

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

Returns an iterator over the values of the set, in their order.

pub fn insert(&mut self, key: Key) -> bool

Inserts the value into the set.

If an equivalent item already exists in the set, returns false. Otherwise, returns true.

pub fn extend<I: IntoIterator<Item = Key>>(&mut self, iter: I)

Extends the set with the content of the given iterator.

pub fn contains<Q: ?Sized + Hash + Equivalent<Key>>(&self, value: &Q) -> bool

Returns true if an equivalent to value exists in the set.

pub fn len(&self) -> usize

Returns the number of elements in the set.

pub fn is_empty(&self) -> bool

Returns true if the set contains no elements.

pub fn clear(&mut self)

Remove all elements in the set, while preserving its capacity.

Computes in O(n) time.

pub fn shift_remove<Q: ?Sized + Hash + Equivalent<Key>>( &mut self, value: &Q ) -> bool

Removes the value from the set, preserving the order of elements.

Returns true if the value was present in the set.

pub fn swap_remove<Q: ?Sized + Hash + Equivalent<Key>>( &mut self, value: &Q ) -> bool

Removes the value by swapping it with the last element, thus the order of elements is not preserved, but the resulting order is still deterministic.

Returns true if the value was present in the set.

pub fn difference<'a, S2>( &'a self, other: &'a OrderedHashSet<Key, S2> ) -> Difference<'a, Key, S2>

where S2: BuildHasher,

pub fn is_subset<S2: BuildHasher>( &self, other: &OrderedHashSet<Key, S2> ) -> bool

Returns true if all elements of self are contained in other.

pub fn is_superset<S2: BuildHasher>( &self, other: &OrderedHashSet<Key, S2> ) -> bool

Returns true if all elements of other are contained in self.

impl<Key: Hash + Eq, S: BuildHasher> OrderedHashSet<Key, S>

pub fn union<'a, S2: BuildHasher>( &'a self, other: &'a OrderedHashSet<Key, S2> ) -> Union<'a, Key, S>

Return an iterator over all values that are either in self or other.

Values from self are produced in their original order, followed by values that are unique to other in their original order.

Trait Implementations

impl<Key: Clone + Hash + Eq, S: Clone> Clone for OrderedHashSet<Key, S>

fn clone(&self) -> OrderedHashSet<Key, S>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<Key: Debug + Hash + Eq, S: Debug> Debug for OrderedHashSet<Key, S>

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

Formats the value using the given formatter.

impl<Key: Hash + Eq> Default for OrderedHashSet<Key>

fn default() -> Self

Returns the “default value” for a type.

impl<'de, K: Hash + Eq + Deserialize<'de>> Deserialize<'de> for OrderedHashSet<K>

fn deserialize<D: Deserializer<'de>>(deserializer: D) -> Result<Self, D::Error>

Deserialize this value from the given Serde deserializer.

impl<Key: Hash + Eq> FromIterator<Key> for OrderedHashSet<Key>

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

Creates a value from an iterator.

impl<'a, Key: Hash + Eq> IntoIterator for &'a OrderedHashSet<Key>

type Item = &'a Key

The type of the elements being iterated over.

type IntoIter = <&'a IndexSet<Key> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<Key: Hash + Eq> IntoIterator for OrderedHashSet<Key>

type Item = Key

The type of the elements being iterated over.

type IntoIter = <IndexSet<Key> as IntoIterator>::IntoIter

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<Key: Hash + Eq> PartialEq for OrderedHashSet<Key>

fn eq(&self, other: &Self) -> 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<K: Hash + Eq + Serialize> Serialize for OrderedHashSet<K>

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

Serialize this value into the given Serde serializer.

impl<'a, Key: Hash + Eq + Clone> Sub for &'a OrderedHashSet<Key>

type Output = OrderedHashSet<Key>

The resulting type after applying the - operator.

fn sub(self, rhs: Self) -> Self::Output

Performs the - operation.

impl<Key: Hash + Eq> Eq for OrderedHashSet<Key>