1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84
use super::sparse_array::SparseArray; #[derive(Clone, Debug)] pub struct InternalNode<TK: PartialEq + AsRef<[u8]>, TV> { pub index: usize, pub nibbles: SparseArray<Node<TK, TV>>, } #[derive(Clone, Debug)] pub struct LeafNode<TK: PartialEq + AsRef<[u8]>, TV> { pub key: TK, pub val: TV, } #[derive(Clone, Debug)] pub enum Node<TK: PartialEq + AsRef<[u8]>, TV> { Empty, Internal(InternalNode<TK, TV>), Leaf(LeafNode<TK, TV>), } impl<TK: PartialEq + AsRef<[u8]>, TV> Default for Node<TK, TV> { fn default() -> Self { Node::Empty } } impl<TK: PartialEq + AsRef<[u8]>, TV> Node<TK, TV> { #[inline] pub fn is_internal(&self) -> bool { match *self { Node::Internal(_) => true, _ => false, } } #[inline] pub fn as_internal(&self) -> &InternalNode<TK, TV> { match *self { Node::Internal(ref internal) => internal, _ => unsafe { debug_unreachable!() }, } } #[inline] pub fn as_mut_internal(&mut self) -> &mut InternalNode<TK, TV> { match *self { Node::Internal(ref mut internal) => internal, _ => unsafe { debug_unreachable!() }, } } #[inline] pub fn is_leaf(&self) -> bool { match *self { Node::Leaf(_) => true, _ => false, } } #[inline] pub fn as_leaf(&self) -> &LeafNode<TK, TV> { match *self { Node::Leaf(ref leaf) => leaf, _ => unsafe { debug_unreachable!() }, } } #[inline] pub fn as_mut_leaf(&mut self) -> &mut LeafNode<TK, TV> { match *self { Node::Leaf(ref mut leaf) => leaf, _ => unsafe { debug_unreachable!() }, } } #[inline] pub fn is_empty(&self) -> bool { match *self { Node::Empty => true, _ => false, } } }