CacheMisses retrieves a global counter measuring the number of cache misses the trie had since process startup.

CacheUnloads retrieves a global counter measuring the number of cache unloads the trie did since process startup.

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.

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

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.

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

VerifyProof checks merkle proofs.

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.

SecureTrie wraps a trie with key hashing.

Trie is a Merkle Patricia Trie.

DatabaseReader wraps the Get and Has method of a backing store for the 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.