Struct OrderedTable 

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

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

Replacement retains an entry’s logical position. Deletion leaves a tombstone, and reinserting an equivalent key appends a new entry. Iterators are live rather than snapshots: they skip entries deleted before visitation and observe entries appended before iteration ends.

Implementations

impl<K, V, E> OrderedTable<K, V, E>

where E: KeyEquivalence<K>,

pub fn new(equivalence: E) -> Self

Construct an empty table using equivalence for all key lookup.

pub fn len(&self) -> usize

Return the number of live entries.

pub fn is_empty(&self) -> bool

Return whether the table contains no live entries.

pub fn get(&self, key: &K) -> Option<V>

where V: Clone,

Return a clone of the value for the equivalent key, if present.

pub fn insert(&self, key: K, value: V) -> Option<V>

Insert a key/value pair, returning the replaced value when present.

An equivalent live key is replaced in place. A key equivalent only to a tombstone is a new insertion and therefore appears at the end.

pub fn remove(&self, key: &K) -> Option<V>

Delete an equivalent key, returning its value when present.

pub fn iter(&self) -> OrderedTableIter<K, V>

Create a live insertion-order iterator.

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

Compact tombstones when doing so is position-safe and within max_work.

Work is bounded by the current slot count. The operation is all-or-none: it does not begin unless that count fits the supplied budget, and it never runs while an iterator holds a position in this table.

Trait Implementations

impl<K: Debug, V: Debug, E: Debug> Debug for OrderedTable<K, V, E>

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

Formats the value using the given formatter.