Enum InsertPosition

pub enum InsertPosition {
    BelowLeaf,
    AlreadyExists,
    ReplaceNode,
}

Result of key lookup in tree

Found node is passed somewhere else (probably remembered in a “walk” stack).

Variants

BelowLeaf

Found node that is a leaf; its key is a prefix of the target key (but not equal to it)

Inserting the target key must convert the found node into an inner node and insert the target key as leaf.

AlreadyExists

Found node with target key

ReplaceNode

Found node to replace with target key

Parent node is a prefix of target key, but this node is not.

To insert a new node needs to replace the current one, using the shared prefix of this node and the target key as node key. (This node key could still be the target key.)

Trait Implementations

impl Clone for InsertPosition

fn clone(&self) -> InsertPosition

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for InsertPosition

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

Formats the value using the given formatter.

impl<N> From<InsertPositionWith<N>> for InsertPosition

fn from(value: InsertPositionWith<N>) -> Self

Converts to this type from the input type.

impl PartialEq for InsertPosition

fn eq(&self, other: &InsertPosition) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Copy for InsertPosition

impl Eq for InsertPosition

impl StructuralPartialEq for InsertPosition