# Functions
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.
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 db.
NewTrieSync creates a new trie data download scheduler.
NewUnionIterator constructs a NodeIterator that iterates over elements in the union of the provided NodeIterators.
VerifyProof checks merkle proofs.
# Variables
ErrAlreadyProcessed is returned by the trie sync when it's requested to process a node it already processed previously.
ErrNotRequested is returned by the trie sync when it's requested to process a node it did not request.
# Structs
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.
SyncResult is a simple list to return missing nodes along with their request hashes.
Trie is a Merkle Patricia Trie.
TrieSync is the main state trie synchronisation scheduler, which provides yet unknown trie hashes to retrieve, accepts node data associated with said hashes and reconstructs the trie step by step until all is done.
# Interfaces
Database must be implemented by backing stores for the trie.
DatabaseReader wraps the Get method of a backing store for the trie.
DatabaseWriter wraps the Put method of a backing store for the trie.
NodeIterator is an iterator to traverse the trie pre-order.
# Type aliases
TrieSyncLeafCallback is a callback type invoked when a trie sync reaches a leaf node.