Struct LeafNode

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

Implementations

impl<K: Key, V> LeafNode<K, V>

pub fn new() -> Box<Self>

pub fn len(&self) -> usize

pub const fn max_capacity() -> u16

Returns the maximum capacity of the leaf node

pub fn is_full(&self) -> bool

pub fn able_to_lend(&self) -> bool

pub fn in_range<Q>(&self, k: &Q) -> bool

where Q: Ord + ?Sized, K: Borrow<Q>,

pub fn key_range(&self) -> (Option<K>, Option<K>)

pub fn is_size_minimum(&self) -> bool

pub fn set_prev(&mut self, id: Option<LeafNodeId>)

pub fn prev(&self) -> Option<LeafNodeId>

pub fn set_next(&mut self, id: Option<LeafNodeId>)

pub fn next(&self) -> Option<LeafNodeId>

pub fn set_data(&mut self, data: impl Iterator<Item = (K, V)>)

pub fn data_at(&self, slot: usize) -> (&K, &V)

pub fn value_at_mut(&mut self, slot: usize) -> &mut V

Get mut ref for value at slot

pub fn try_data_at(&self, idx: usize) -> Option<(&K, &V)>

pub fn locate_slot<Q>(&self, k: &Q) -> Result<usize, usize>

where Q: Ord + ?Sized, K: Borrow<Q>,

pub fn locate_slot_with_value<Q>(&self, k: &Q) -> (usize, Option<&V>)

where Q: Ord + ?Sized, K: Borrow<Q>,

pub unsafe fn take_data(&mut self, slot: usize) -> (K, V)

This should never called with same slot

pub fn keys(&self) -> &[K]

pub fn values(&self) -> &[V]

Trait Implementations

impl<K: Key, V> Clone for LeafNode<K, V>

where V: Clone,

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<K: Debug, V: Debug> Debug for LeafNode<K, V>

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

Formats the value using the given formatter.