Enum set_trie::Entry

pub enum Entry<'a, K, T> where
    K: Ord,  {
    Created(CreatedEntry<'a, K, T>),
    Existing(ExistingEntry<'a, K, T>),
}

A view into a node of a SetTrie, either created or already existing.

Variants

Created(CreatedEntry<'a, K, T>)

Indicates that the entry was created.

Existing(ExistingEntry<'a, K, T>)

Indicates that the entry already existed.

Implementations

impl<'a, K, T> Entry<'a, K, T> where
    K: Ord, 

#[must_use]pub fn items(&self) -> &Vec<T>

Returns all associated items of an entry.

#[must_use]pub fn items_mut(&mut self) -> &mut Vec<T>

Mutably returns all associated items of an entry.

#[must_use]pub fn entry<IK: IntoIterator<Item = K>>(
    self,
    keys: IK
) -> EntryBuilder<'a, K, T, IK::IntoIter>

Provides a view into a child of the entry. If you are sequentially inserting longer keys, reusing the entry is more efficient than starting from the root.

// Equivalent to first inserting 0..1, then 0..2 etc.

let mut trie = set_trie::SetTrie::new();
let mut current = trie.entry(0..1).or_insert(0);
    for i in 1..5000 {
        current = {
            current.entry(i-1..i).or_insert(i)
        }
    }