Struct InnerNodeCompressed

#[repr(C, align(8))]
pub struct InnerNodeCompressed<K, V, const PREFIX_LEN: usize, const SIZE: usize> {
    pub header: Header<PREFIX_LEN>,
    pub keys: [MaybeUninit<u8>; SIZE],
    pub child_pointers: [MaybeUninit<OpaqueNodePtr<K, V, PREFIX_LEN>>; SIZE],
}

Node type that has a compact representation for key bytes and children pointers.

Fields

header: Header<PREFIX_LEN>

The common node fields.

keys: [MaybeUninit<u8>; SIZE]

An array that contains single key bytes in the same index as the child_pointers array contains the matching child tree.

This array will only be initialized for the first header.num_children values.

child_pointers: [MaybeUninit<OpaqueNodePtr<K, V, PREFIX_LEN>>; SIZE]

An array that contains the child data.

This array will only be initialized for the first header.num_children values.

Implementations

impl<K, V, const PREFIX_LEN: usize, const SIZE: usize> InnerNodeCompressed<K, V, PREFIX_LEN, SIZE>

pub fn initialized_portion(&self) -> (&[u8], &[OpaqueNodePtr<K, V, PREFIX_LEN>])

Return the initialized portions of the keys and child pointer arrays.

fn lookup_child_inner( &self, key_fragment: u8, ) -> Option<OpaqueNodePtr<K, V, PREFIX_LEN>>

where Self: SearchInnerNodeCompressed,

Generalized version of InnerNode::lookup_child for compressed nodes

fn write_child_inner( &mut self, key_fragment: u8, child_pointer: OpaqueNodePtr<K, V, PREFIX_LEN>, )

where Self: SearchInnerNodeCompressed,

Writes a child to the node by check the order of insertion

Panics

• This functions assumes that the write is gonna be inbound (i.e the check for a full node is done previously to the call of this function)

pub unsafe fn write_child_unchecked( &mut self, key_fragment: u8, child_pointer: OpaqueNodePtr<K, V, PREFIX_LEN>, )

Writes a child to the node without bounds check or order

Safety

• This functions assumes that the write is gonna be inbound (i.e the check for a full node is done previously to the call of this function)

unsafe fn write_child_at( &mut self, idx: usize, key_fragment: u8, child_pointer: OpaqueNodePtr<K, V, PREFIX_LEN>, )

Writes a child to the node without bounds check or order

Safety

• This functions assumes that the write is gonna be inbound (i.e the check for a full node is done previously to the call of this function)

fn remove_child_inner( &mut self, key_fragment: u8, ) -> Option<OpaqueNodePtr<K, V, PREFIX_LEN>>

where Self: SearchInnerNodeCompressed,

Removes child if it exists

fn change_block_size<const NEW_SIZE: usize>( &self, ) -> InnerNodeCompressed<K, V, PREFIX_LEN, NEW_SIZE>

Grows or shrinks the node

fn grow_node48(&self) -> InnerNode48<K, V, PREFIX_LEN>

Transform node into a InnerNode48

fn inner_iter(&self) -> InnerNodeCompressedIter<'_, K, V, PREFIX_LEN>

Get an iterator over the keys and values of the node

fn inner_range_iter( &self, bound: impl RangeBounds<u8>, ) -> InnerNodeCompressedIter<'_, K, V, PREFIX_LEN>

where Self: SearchInnerNodeCompressed,

Get an iterator over a range of keys and values of the node.

Trait Implementations

impl<K, V, const PREFIX_LEN: usize, const SIZE: usize> Clone for InnerNodeCompressed<K, V, PREFIX_LEN, SIZE>

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, V, const PREFIX_LEN: usize, const SIZE: usize> Debug for InnerNodeCompressed<K, V, PREFIX_LEN, SIZE>

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

Formats the value using the given formatter.

impl<K: AsBytes, V, const PREFIX_LEN: usize, const SIZE: usize> FuzzySearch<K, V, PREFIX_LEN> for InnerNodeCompressed<K, V, PREFIX_LEN, SIZE>

where Self: InnerNode<PREFIX_LEN, Key = K, Value = V>,

fn fuzzy_search( &self, arena: &mut StackArena, key: &[u8], old_row: &mut &mut [usize], new_row: &mut &mut [MaybeUninit<usize>], nodes_to_search: &mut Vec<OpaqueNodePtr<K, V, PREFIX_LEN>>, max_edit_dist: usize, ) -> bool

fn fuzzy_search_prefix( &self, key: &[u8], old_row: &mut &mut [usize], new_row: &mut &mut [MaybeUninit<usize>], max_edit_dist: usize, ) -> bool

where Self: InnerNode<PREFIX_LEN>, Self::Key: AsBytes,