Enum Entry 

pub enum Entry<'a, P, Tag, K>
where
    P: Pointer,
    P::Target: AvlItem<Tag>,
{
    Vacant(VacantEntry<'a, P, Tag, K>),
    Occupied(OccupiedEntry<'a, P, Tag>),
}

Result of a search operation in an AvlTree.

Variants

Vacant(VacantEntry<'a, P, Tag, K>)

Occupied(OccupiedEntry<'a, P, Tag>)

Implementations

impl<'a, P, Tag, K> Entry<'a, P, Tag, K>

where P: Pointer, P::Target: AvlItem<Tag>,

pub fn unwrap_occupied(self) -> OccupiedEntry<'a, P, Tag>

where K: Debug,

pub fn unwrap_vacant(self) -> VacantEntry<'a, P, Tag, K>

where P::Target: Debug,

pub fn try_occupied(self) -> Option<OccupiedEntry<'a, P, Tag>>

pub fn try_vacant(self) -> Option<VacantEntry<'a, P, Tag, K>>

impl<'a, P, Tag> Entry<'a, P, Tag, Last>

where P: Pointer, P::Target: AvlItem<Tag>,

pub unsafe fn append_unchecked(self, node: P) -> Self

Append node to the last entry, return the new entry.

For efficient batch insert without redundant seeking to the last, only rotation will be triggered after insert.

Safety

You have to make sure the node append in total ordering

pub fn append<F>(self, node: P, cmp_f: F) -> Result<Self, P>

where F: FnOnce(&P::Target, &P::Target) -> Ordering,

Append node to the last entry with check, return the new entry.

For efficient batch insert without redundant seeking to the last, only rotation will be triggered after insert.

Arguments:

• node: the node to insert
• cmp_f: compare P::Target of the entry and node. If it returns Ordering::Less, insert node and return Ok; otherwise return Err(node)

impl<'a, P, Tag> Entry<'a, P, Tag, First>

where P: Pointer, P::Target: AvlItem<Tag>,

pub unsafe fn prepend_unchecked(self, node: P) -> Self

Prepend node to the first entry, return the new entry.

For efficient batch insert without redundant seeking to the first, only rotation will be triggered after insert.

Safety

You have to make sure the node append in total ordering

pub fn prepend<F>(self, node: P, cmp_f: F) -> Result<Self, P>

where F: FnOnce(&P::Target, &P::Target) -> Ordering,

Prepend node to the first entry with check, return the new entry.

For efficient batch insert without redundant seeking to the first, only rotation will be triggered after insert.

Arguments:

• node: the node to insert
• cmp_f: compare P::Target of the node and entry. If it returns Ordering::Less, insert node and return Ok; otherwise return Err(node)

Trait Implementations

impl<'a, P, Tag, K> From<Entry<'a, P, Tag, K>> for Option<OccupiedEntry<'a, P, Tag>>

where P: Pointer, P::Target: AvlItem<Tag>,

fn from(ent: Entry<'a, P, Tag, K>) -> Option<OccupiedEntry<'a, P, Tag>>

Converts to this type from the input type.

impl<'a, P, Tag, K> From<Entry<'a, P, Tag, K>> for Option<VacantEntry<'a, P, Tag, K>>

where P: Pointer, P::Target: AvlItem<Tag>,

fn from(ent: Entry<'a, P, Tag, K>) -> Option<VacantEntry<'a, P, Tag, K>>

Converts to this type from the input type.