Struct Entry 

pub struct Entry<const KEY_LEN: usize, V = ()> { /* private fields */ }

Reference-counted handle to a heap-allocated leaf node in a PATCH trie.

Entry is the unit of insertion for the memory-only path: it owns a shared Leaf<KEY_LEN, V> and can be inserted into multiple PATCH instances (each PATCH gets its own Head pointing at the shared refcounted Leaf). The archive-backed counterpart is ArchiveEntry, which only exists for V = () since archive bytes carry no value field.

Implementations

impl<const KEY_LEN: usize> Entry<KEY_LEN>

pub fn new(key: &[u8; KEY_LEN]) -> Self

Creates a new entry with the given key and a unit value.

impl<const KEY_LEN: usize, V> Entry<KEY_LEN, V>

pub fn with_value(key: &[u8; KEY_LEN], value: V) -> Self

Creates a new entry with the given key and associated value.

pub fn value(&self) -> &V

Returns a reference to the value stored in this entry.

Trait Implementations

impl<const KEY_LEN: usize, V> Clone for Entry<KEY_LEN, V>

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const KEY_LEN: usize, V: Debug> Debug for Entry<KEY_LEN, V>

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

Formats the value using the given formatter.

impl<const KEY_LEN: usize, V> Drop for Entry<KEY_LEN, V>

fn drop(&mut self)

Executes the destructor for this type.

fn pin_drop(self: Pin<&mut Self>)

🔬This is a nightly-only experimental API. (pin_ergonomics)

Execute the destructor for this type, but different to Drop::drop, it requires self to be pinned.