pub trait TrieIterableNode<K, V>where
    K: Hash + Eq,
{ fn get_children(&self) -> HashMap<&K, &Self, RandomState>; fn get_values(&self) -> &[V]Notable traits for &[u8]impl Read for &[u8]impl Write for &mut [u8]; }
Expand description

Trait defining the properties a graph node must have in order to be used by the generic Trie Iterator.

Required Methods

Returns a map from a graph’s node to the children of that node, indexed by their Trie-equivalent prefix.

Returns the vector of values that a graph’s node is storing.