[−][src]Crate trie_db
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
node | |
recorder | Trie query recorder. |
sectriedb | |
sectriedbmut | |
triedb | |
triedbmut | In-memory trie representation. |
Structs
FatDB | A |
FatDBIterator | Itarator over inserted pairs of key values. |
FatDBMut | A mutable |
Lookup | Trie lookup helper object. |
NibbleSlice | Nibble-orientated view onto byte-slice, allowing nibble-precision offsets. |
TrieFactory | Trie factory. |
Enums
TrieError | Trie Errors. |
TrieKinds | All different kinds of tries. This is used to prevent a heap allocation for every created trie. |
TrieSpec | Trie types |
Traits
HashDB | Trait modelling datastore keyed by a hash defined by the |
HashDBRef | Trait for immutable reference of HashDB. |
Hasher | Trait describing an object that can hash a slice of bytes. Used to abstract
other types over the hashing algorithm. Defines a single |
MaybeDebug | |
NodeCodec | 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. |
TrieIterator | A trie iterator that also supports random access ( |
TrieMut | A key-value datastore implemented as a database-backed modified Merkle tree. |
Type Definitions
DBValue | |
Result | Trie result type. Boxed to avoid copying around extra space for the |
TrieItem | Trie-Item type used for iterators over trie data. |