# Packages
No description provided by the author
# Functions
HashDomains for each variable in contract each domain will represented as 6 bytes, support 4 level domain at most such as, 4a56b7 000000 000000 000000, 4a56b8 1c9812 000000 000000, 4a56b8 3a1289 000000 000000, support iterator with same prefix.
HashDomainsPrefix is same as HashDomains, but without tail zeros.
NewTrie if rootHash is nil, create a new Trie, otherwise, build an existed trie.
# Structs
Entry in log, [key, old value, new value].
Iterator to traverse leaf node in a trie.
IteratorState represents the intermediate statue in iterator.
Trie is a Merkle Patricia Trie, consists of three kinds of nodes, Branch Node: 16-elements array, value is [hash_0, hash_1, ..., hash_f, hash] Extension Node: 3-elements array, value is [ext flag, prefix path, next hash] Leaf Node: 3-elements array, value is [leaf flag, suffix path, value].
# Type aliases
Action represents operation types in Trie.
MerkleProof is a path from root to the proved node every element in path is the value of a node.