Struct content_tree::NodeLeaf

pub struct NodeLeaf<E: ContentTraits, I: TreeIndex<E>, const INT_ENTRIES: usize, const LEAF_ENTRIES: usize> { /* fields omitted */ }

A leaf node in the B-tree. Except the root, each child stores MAX_CHILDREN/2 - MAX_CHILDREN entries.

The details in a leaf node are private. This is exposed to allow consumers to build custom indexes, allowing for fast cursor creation without needing to iterate through the tree.

See diamond-types for an example of this.

Implementations

impl<E: ContentTraits, I: TreeIndex<E>, const IE: usize, const LE: usize> NodeLeaf<E, I, IE, LE>

pub fn find_offset<F>(
    &self,
    offset: usize,
    stick_end: bool,
    entry_to_num: F
) -> Option<(usize, usize)> where
    F: Fn(E) -> usize, 

pub fn next_leaf(&self) -> Option<NonNull<Self>>

pub fn prev_leaf(&self) -> Option<NonNull<Self>>

pub fn adjacent_leaf_by_traversal(
    &self,
    direction_forward: bool
) -> Option<NonNull<Self>>

pub fn len_entries(&self) -> usize

pub fn update_parent_count(&mut self, amt: I::IndexUpdate)

pub fn flush_index_update(&mut self, marker: &mut I::IndexUpdate)

pub fn has_root_as_parent(&self) -> bool

pub fn count_items(&self) -> I::IndexValue

pub fn splice_out(&mut self, idx: usize)

Remove a single item from the node

pub fn clear_all(&mut self)

impl<E: ContentTraits + Searchable, I: TreeIndex<E>, const IE: usize, const LE: usize> NodeLeaf<E, I, IE, LE>

pub fn find(&self, loc: E::Item) -> Option<UnsafeCursor<E, I, IE, LE>>

Trait Implementations

impl<E: Debug + ContentTraits, I: Debug + TreeIndex<E>, const INT_ENTRIES: usize, const LEAF_ENTRIES: usize> Debug for NodeLeaf<E, I, INT_ENTRIES, LEAF_ENTRIES>

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

Formats the value using the given formatter.