Crate patricia_trie

Source
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§

node
recorder
Trie query recorder.
sectriedb
sectriedbmut
triedb
triedbmut
In-memory trie representation.

Structs§

FatDB
A Trie implementation which hashes keys and uses a generic HashDB backing database. Additionaly it stores inserted hash-key mappings for later retrieval.
FatDBIterator
Itarator over inserted pairs of key values.
FatDBMut
A mutable Trie implementation which hashes keys and uses a generic HashDB backing database. Additionaly it stores inserted hash-key mappings for later retrieval.
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§

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 (seek()).
TrieMut
A key-value datastore implemented as a database-backed modified Merkle tree.

Type Aliases§

DBValue
Result
Trie result type. Boxed to avoid copying around extra space for the Hashers Out on successful queries.
TrieItem
Trie-Item type used for iterators over trie data.