[−][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
nibble_ops | Utility methods to work on radix 16 nibble. |
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. |
TrieBuilder | Get trie root and insert visited node in a hash_db.
As for all |
TrieFactory | Trie factory. |
TrieRoot | Calculate the trie root of the trie. |
TrieRootPrint | Calculate the trie root of the trie. Print a debug trace. |
TrieRootUnhashed | Get the trie root node encoding. |
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. |
ProcessEncodedNode | Visitor trait to implement when using |
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. |
TrieConfiguration | This traits associates a trie definition with prefered methods. It also contains own default implementations and can be use to allow switching implementation. |
TrieIterator | A trie iterator that also supports random access ( |
TrieLayout | Trait with definition of trie layout. Contains all associated trait needed for a trie definition or implementation. |
TrieMut | A key-value datastore implemented as a database-backed modified Merkle tree. |
Functions
trie_visit | Function visiting trie from key value inputs with a |
Type Definitions
CError | Alias accessor to |
DBValue | |
Partial | Representation of a nible slice (right aligned). It contains a right aligned padded first byte (first pair element is the number of nibbles (0 to max nb nibble - 1), second pair element is the padded nibble), and a slice over the remaining bytes. |
Result | Trie result type.
Boxed to avoid copying around extra space for the |
TrieHash | Alias accessor to hasher hash output type from a |
TrieItem | Trie-Item type used for iterators over trie data. |