Expand description
Trie interface and implementation.
Re-exports
pub use self::triedb::TrieDB;pub use self::triedb::TrieDBIterator;pub use self::triedbmut::TrieDBMut;pub use self::triedbmut::ChildReference;pub use self::sectriedbmut::SecTrieDBMut;pub use self::sectriedb::SecTrieDB;pub use self::recorder::Recorder;pub use self::recorder::Record;Modules
Structs
A Trie implementation which hashes keys and uses a generic HashDB backing database.
Additionaly it stores inserted hash-key mappings for later retrieval.
Itarator over inserted pairs of key values.
A mutable Trie implementation which hashes keys and uses a generic HashDB backing database.
Additionaly it stores inserted hash-key mappings for later retrieval.
Trie lookup helper object.
Nibble-orientated view onto byte-slice, allowing nibble-precision offsets.
Trie factory.
Enums
Trie Errors.
All different kinds of tries. This is used to prevent a heap allocation for every created trie.
Trie types
Traits
Trait modelling datastore keyed by a hash defined by the Hasher.
Trait for immutable reference of HashDB.
Trait describing an object that can hash a slice of bytes. Used to abstract
other types over the hashing algorithm. Defines a single hash method and an
Out associated type with the necessary bounds.
Trait for trie node encoding/decoding
Description of what kind of query will be made to the trie.
A key-value datastore implemented as a database-backed modified Merkle tree.
A trie iterator that also supports random access (seek()).
A key-value datastore implemented as a database-backed modified Merkle tree.