Struct OrderedSet 

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

Mutable insertion-ordered set with caller-defined key equivalence.

Implementations

impl<K, E> OrderedSet<K, E>

where E: KeyEquivalence<K>,

pub fn new(equivalence: E) -> Self

Construct an empty set using equivalence for membership.

pub fn len(&self) -> usize

Return the number of members.

pub fn is_empty(&self) -> bool

Return whether the set contains no members.

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

Return whether an equivalent member is present.

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

Insert key, returning whether it was newly added.

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

Remove an equivalent member, returning whether it was present.

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

Create a live insertion-order iterator.

pub fn compact(&self, max_work: usize) -> CompactionResult

Compact tombstones under the table’s position and work rules.

Trait Implementations

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

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

Formats the value using the given formatter.