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;
Modules§
Structs§
- FatDB
- A
Trie
implementation which hashes keys and uses a genericHashDB
backing database. Additionaly it stores inserted hash-key mappings for later retrieval. - FatDB
Iterator - Itarator over inserted pairs of key values.
- FatDB
Mut - A mutable
Trie
implementation which hashes keys and uses a genericHashDB
backing database. Additionaly it stores inserted hash-key mappings for later retrieval. - Lookup
- Trie lookup helper object.
- Nibble
Slice - Nibble-orientated view onto byte-slice, allowing nibble-precision offsets.
- Trie
Factory - Trie factory.
Enums§
- Trie
Error - Trie Errors.
- Trie
Kinds - All different kinds of tries. This is used to prevent a heap allocation for every created trie.
- Trie
Spec - Trie types
Traits§
- Node
Codec - Trait for trie node encoding/decoding
- Query
- Description of what kind of query will be made to the trie.
- Trie
- A key-value datastore implemented as a database-backed modified Merkle tree.
- Trie
Iterator - A trie iterator that also supports random access (
seek()
). - TrieMut
- A key-value datastore implemented as a database-backed modified Merkle tree.