Struct InnerNode

pub struct InnerNode<K: Key, A: Argument<K>> { /* private fields */ }

Tree’s inner node, it contains a list of keys and a list of child node id N is the maximum number of keys in a node C is the maximum child node id in a node

Implementations

impl<K: Key, A: Argument<K>> InnerNode<K, A>

pub fn len(&self) -> usize

Size of keys in inner node

pub const fn max_capacity() -> u16

Max key capacity

pub const fn split_origin_size() -> usize

The size of the origin node after split

pub const fn split_new_size() -> usize

The size of the new node after split

pub fn able_to_lend(&self) -> bool

whether this node is able to lend a key to its sibling

pub fn is_full(&self) -> bool

whether this node is full, if yes, then the next insert need to split

pub fn new_from_iter( keys: impl IntoIterator<Item = K>, childs: impl IntoIterator<Item = NodeId>, arguments: impl IntoIterator<Item = A>, ) -> Box<Self>

Create a new inner node from keys and childs iterator

pub fn locate_child<Q>(&self, k: &Q) -> (usize, NodeId)

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

returns the child index for k

pub fn push(&mut self, k: K, child: NodeId, argument: A)

pub fn key(&self, idx: usize) -> &K

Trait Implementations

impl<K: Key, A: Argument<K>> Clone for InnerNode<K, A>

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 + Key, A: Debug + Argument<K>> Debug for InnerNode<K, A>

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

Formats the value using the given formatter.

impl<K: Key, A: Argument<K>> Drop for InnerNode<K, A>

fn drop(&mut self)

Executes the destructor for this type.