[−][src]Struct byte_trie::AdaptiveNode
A byte-driven representation of an adaptive compressed trie node.
Largest key's value can be a u8
, here supplied by BytesKey
.
Methods
impl<K: BytesKey, V> AdaptiveNode<K, V>
[src]
pub fn new(key: K, value: Option<V>) -> Self
[src]
pub fn insert(&mut self, key: K, value: Option<V>)
[src]
Insert a key into the node.
This may cause the node to shrink key size, split into an empty parent, increase the child node size, or simply just add a new child.
pub fn insert_node(&mut self, new: Self)
[src]
Insert a node into a node.
This may cause the node to shrink key size, split into an empty parent, increase the child node size, or simply just add a new child.
Trait Implementations
impl<K: BytesKey, V> Default for AdaptiveNode<K, V>
[src]
impl<K: Debug + BytesKey, V: Debug> Debug for AdaptiveNode<K, V>
[src]
Auto Trait Implementations
impl<K, V> Send for AdaptiveNode<K, V> where
K: Send,
V: Send,
K: Send,
V: Send,
impl<K, V> Sync for AdaptiveNode<K, V> where
K: Sync,
V: Sync,
K: Sync,
V: Sync,
Blanket Implementations
impl<T> From for T
[src]
impl<T, U> Into for T where
U: From<T>,
[src]
U: From<T>,
impl<T, U> TryFrom for T where
U: Into<T>,
[src]
U: Into<T>,
type Error = Infallible
The type returned in the event of a conversion error.
fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>
[src]
impl<T> Borrow for T where
T: ?Sized,
[src]
T: ?Sized,
impl<T> Any for T where
T: 'static + ?Sized,
[src]
T: 'static + ?Sized,
impl<T> BorrowMut for T where
T: ?Sized,
[src]
T: ?Sized,
fn borrow_mut(&mut self) -> &mut T
[src]
impl<T, U> TryInto for T where
U: TryFrom<T>,
[src]
U: TryFrom<T>,