Struct BtreeNode 

#[repr(C, align(8))]
pub struct BtreeNode<'a, K, V> { /* private fields */ }

Implementations

impl<'a, K, V> BtreeNode<'a, K, V>

where K: Copy + Display + PartialOrd, V: Copy + Display,

pub fn from_slice(buf: &[u8]) -> Self

pub fn new(v: V, size: usize) -> Option<Self>

pub fn copy_from_slice(v: V, buf: &[u8]) -> Option<Self>

pub fn as_ref(&self) -> &[u8]

pub fn as_mut(&mut self) -> &mut [u8]

pub fn is_large(&self) -> bool

pub fn set_large(&mut self)

pub fn clear_large(&mut self)

pub fn get_flags(&self) -> u8

pub fn set_flags(&mut self, flags: usize)

pub fn get_level(&self) -> usize

pub fn set_level(&mut self, level: usize)

pub fn get_key(&self, index: usize) -> K

pub fn set_key(&mut self, index: usize, key: &K)

pub fn get_val(&self, index: usize) -> V

pub fn set_val(&mut self, index: usize, val: &V)

pub fn get_nchild(&self) -> usize

pub fn set_nchild(&mut self, c: usize)

pub fn set_nchild_use_p(&self, c: usize)

pub fn get_capacity(&self) -> usize

pub fn has_free_slots(&self) -> bool

pub fn get_nchild_min(&self) -> usize

pub fn is_overflowing(&self) -> bool

pub fn node_key(&self) -> &K

pub fn id(&self) -> Option<&V>

pub fn set_id(&mut self, v: V)

pub fn init(&mut self, flags: usize, level: usize, nchild: usize)

pub fn init_root(&mut self, level: usize, is_large: bool)

pub fn is_dirty(&self) -> bool

pub fn mark_dirty(&mut self)

pub fn clear_dirty(&mut self)

pub fn move_left( left: &BtreeNode<'_, K, V>, right: &BtreeNode<'_, K, V>, n: usize, )

pub fn move_right( left: &BtreeNode<'_, K, V>, right: &BtreeNode<'_, K, V>, n: usize, )

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

pub fn insert(&mut self, index: usize, key: &K, val: &V)

pub fn delete(&mut self, index: usize, key: &mut K, val: &mut V)

Trait Implementations

impl<'a, K: Debug, V: Debug> Debug for BtreeNode<'a, K, V>

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

Formats the value using the given formatter.

impl<'a, K, V> Display for BtreeNode<'a, K, V>

where K: Copy + Display + PartialOrd, V: Copy + Display,

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

Formats the value using the given formatter.

impl<'a, K, V> Drop for BtreeNode<'a, K, V>

fn drop(&mut self)

Executes the destructor for this type.

impl<'a, K, V> PartialEq for BtreeNode<'a, K, V>

fn eq(&self, other: &Self) -> 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.