Struct OrderedSet

pub struct OrderedSet<V, S = RandomState>(/* private fields */)
where
    V: Hash + Eq;

A newtype wrapping indexmap::IndexSet

Implementations

impl<V> OrderedSet<V>

where V: Hash + Eq,

pub fn new() -> Self

pub fn with_capacity(capacity: usize) -> Self

pub fn size(&self) -> usize

Return the number of key-value pairs in the map.

Computes in O(1) time.

pub fn is_empty(&self) -> bool

Returns true if the map contains no elements.

Computes in O(1) time.

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

Insert a value pair in the set.

If an equivalent value already exists in the set: ???

If no equivalent value existed in the set: the new value is inserted, last in order, and false

Computes in O(1) time (amortized average).

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

Delete the value from the set and return true if successful

Return false if value is not in map.

Computes in O(n) time (average).

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

Checks if a given value is present in the set

Return true if value is present in set, false otherwise.

Computes in O(n) time (average).

pub fn get_index(&self, index: usize) -> Option<&V>

Get a key-value pair by index Valid indices are 0 <= index < self.len() Computes in O(1) time.

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

Return an iterator over the values of the set, in their order

Trait Implementations

impl<V, S: Clone> Clone for OrderedSet<V, S>

where V: Hash + Eq + Clone,

fn clone(&self) -> OrderedSet<V, S>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<V: Hash + Eq + Debug> Debug for OrderedSet<V>

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

Formats the value using the given formatter.

impl<V: Hash + Eq> Default for OrderedSet<V>

fn default() -> Self

Returns the “default value” for a type.

impl<V: Eq + Hash + Trace, S: BuildHasher> Finalize for OrderedSet<V, S>

fn finalize(&self)

impl<'a, V, S> IntoIterator for &'a OrderedSet<V, S>

where V: Hash + Eq, S: BuildHasher,

type Item = &'a V

The type of the elements being iterated over.

type IntoIter = Iter<'a, V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.

impl<V, S> IntoIterator for OrderedSet<V, S>

where V: Hash + Eq, S: BuildHasher,

type Item = V

The type of the elements being iterated over.

type IntoIter = IntoIter<V>

Which kind of iterator are we turning this into?

fn into_iter(self) -> IntoIter<V>

Creates an iterator from a value.

impl<V: Eq + Hash + Trace, S: BuildHasher> Trace for OrderedSet<V, S>

unsafe fn trace(&self)

Marks all contained Gcs.

unsafe fn root(&self)

Increments the root-count of all contained Gcs.

unsafe fn unroot(&self)

Decrements the root-count of all contained Gcs.

fn finalize_glue(&self)

Runs Finalize::finalize() on this object and all contained subobjects