Struct OrderedSet 

pub struct OrderedSet<K> { /* private fields */ }

Efficient Ordered Set implementatoin that keeps track of the order of insertions and deletions.

Every operation is O(1).

Implementations

impl<K> OrderedSet<K>

where K: Clone + Hash + Eq,

pub fn new() -> Self

pub fn first(&self) -> Option<&K>

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

Insert a key into the set.

Returns true if the key was already present in the set.

pub fn pop_next(&mut self) -> Option<K>

Pops the next element inserted into the set.

Returns None if the set is empty.

pub fn remove(&mut self, key: &K) -> bool

Removes a key from the set.

Returns true if the key was present in the set.

pub fn is_empty(&self) -> bool

Returns true if the set is empty.

pub fn contains(&self, key: &K) -> bool

Returns true if the set contains the key.

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

Returns an iterator over the keys in the set.

pub fn len(&self) -> usize

Trait Implementations

impl<K: Clone> Clone for OrderedSet<K>

fn clone(&self) -> OrderedSet<K>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug> Debug for OrderedSet<K>

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

Formats the value using the given formatter.

impl<K: Default> Default for OrderedSet<K>

fn default() -> OrderedSet<K>

Returns the “default value” for a type.

impl<K> IntoIterator for OrderedSet<K>

where K: Clone + Hash + Eq,

type Item = K

The type of the elements being iterated over.

type IntoIter = OrderedSetIntoIterator<K>

Which kind of iterator are we turning this into?

fn into_iter(self) -> Self::IntoIter

Creates an iterator from a value.