New creates a trie with an existing root node from db.

NewDatabase creates a new trie database to store ephemeral trie content before its written out to disk or garbage collected.

NewDatabaseWithConfig creates a new trie database to store ephemeral trie content before its written out to disk or garbage collected.

NewDifferenceIterator constructs a NodeIterator that iterates over elements in b that are not in a.

NewFromBinary initialises a serialized stacktrie with the given db.

NewIterator creates a new key-value iterator from a node iterator.

NewSecure creates a trie with an existing root node from a backing database and optional intermediate in-memory node pool.

NewStackTrie allocates and initializes an empty trie.

NewUnionIterator constructs a NodeIterator that iterates over elements in the union of the provided NodeIterators.

VerifyProof checks merkle proofs.

VerifyRangeProof checks whether the given leaf nodes and edge proof can prove the given trie leaves range is matched with the specific root.

Config defines all necessary options for database.

Database is an intermediate write layer between the trie data structures and the disk database.

Iterator is a key-value trie iterator that traverses a Trie.

MissingNodeError is returned by the trie functions (TryGet, TryUpdate, TryDelete) in the case where a trie node is not present in the local database.

SecureTrie wraps a trie with key hashing.

StackTrie is a trie implementation that expects keys to be inserted in order.

Trie is a Merkle Patricia Trie.

NodeIterator is an iterator to traverse the trie pre-order.

LeafCallback is a callback type invoked when a trie operation reaches a leaf node.