trie

Jul 4, 2018

Changes in this version

+ var ErrAlreadyProcessed = errors.New("already processed")

+ var ErrNotRequested = errors.New("not requested")

+ func CacheMisses() int64

+ func CacheUnloads() int64

+ func VerifyProof(rootHash types.Hash, key []byte, proofDb DatabaseReader) (value []byte, err error, nodes int)

+ type Database struct

+ func NewDatabase(diskdb mintdb.Database) *Database

+ func (db *Database) Commit(node types.Hash, report bool) error

+ func (db *Database) Dereference(child types.Hash, parent types.Hash)

+ func (db *Database) DiskDB() DatabaseReader

+ func (db *Database) Insert(hash types.Hash, blob []byte)

+ func (db *Database) Node(hash types.Hash) ([]byte, error)

+ func (db *Database) Nodes() []types.Hash

+ func (db *Database) Reference(child types.Hash, parent types.Hash)

+ func (db *Database) Size() types.StorageSize

+ type DatabaseReader interface

+ Get func(key []byte) (value []byte, err error)

+ Has func(key []byte) (bool, error)

+ type Iterator struct

+ Err error

+ Key []byte

+ Value []byte

+ func NewIterator(it NodeIterator) *Iterator

+ func (it *Iterator) Next() bool

+ type LeafCallback func(leaf []byte, parent types.Hash) error

+ type MissingNodeError struct

+ NodeHash types.Hash

+ Path []byte

+ func (err *MissingNodeError) Error() string

+ type NodeIterator interface

+ Error func() error

+ Hash func() types.Hash

+ Leaf func() bool

+ LeafBlob func() []byte

+ LeafKey func() []byte

+ Next func(bool) bool

+ Parent func() types.Hash

+ Path func() []byte

+ func NewDifferenceIterator(a, b NodeIterator) (NodeIterator, *int)

+ func NewUnionIterator(iters []NodeIterator) (NodeIterator, *int)

+ type SecureTrie struct

+ func NewSecure(root types.Hash, db *Database, cachelimit uint16) (*SecureTrie, error)

+ func (t *SecureTrie) Commit(onleaf LeafCallback) (root types.Hash, err error)

+ func (t *SecureTrie) Copy() *SecureTrie

+ func (t *SecureTrie) Delete(key []byte)

+ func (t *SecureTrie) Get(key []byte) []byte

+ func (t *SecureTrie) GetKey(shaKey []byte) []byte

+ func (t *SecureTrie) Hash() types.Hash

+ func (t *SecureTrie) NodeIterator(start []byte) NodeIterator

+ func (t *SecureTrie) Prove(key []byte, fromLevel uint, proofDb mintdb.Putter) error

+ func (t *SecureTrie) Root() []byte

+ func (t *SecureTrie) TryDelete(key []byte) error

+ func (t *SecureTrie) TryGet(key []byte) ([]byte, error)

+ func (t *SecureTrie) TryUpdate(key, value []byte) error

+ func (t *SecureTrie) Update(key, value []byte)

+ type SyncResult struct

+ Data []byte

+ Hash types.Hash

+ type Trie struct

+ func New(root types.Hash, db *Database) (*Trie, error)

+ func (t *Trie) Commit(onleaf LeafCallback) (root types.Hash, err error)

+ func (t *Trie) Delete(key []byte)

+ func (t *Trie) Get(key []byte) []byte

+ func (t *Trie) Hash() types.Hash

+ func (t *Trie) NodeIterator(start []byte) NodeIterator

+ func (t *Trie) Prove(key []byte, fromLevel uint, proofDb mintdb.Putter) error

+ func (t *Trie) Root() []byte

+ func (t *Trie) SetCacheLimit(l uint16)

+ func (t *Trie) TryDelete(key []byte) error

+ func (t *Trie) TryGet(key []byte) ([]byte, error)

+ func (t *Trie) TryUpdate(key, value []byte) error

+ func (t *Trie) Update(key, value []byte)

+ type TrieSync struct

+ func NewTrieSync(root types.Hash, database DatabaseReader, callback LeafCallback) *TrieSync

+ func (s *TrieSync) AddRawEntry(hash types.Hash, depth int, parent types.Hash)

+ func (s *TrieSync) AddSubTrie(root types.Hash, depth int, parent types.Hash, callback LeafCallback)

+ func (s *TrieSync) Commit(dbw mintdb.Putter) (int, error)

+ func (s *TrieSync) Missing(max int) []types.Hash

+ func (s *TrieSync) Pending() int

+ func (s *TrieSync) Process(results []SyncResult) (bool, int, error)