trienode

Aug 4, 2023

Changes in this version

+ type MergedNodeSet struct

+ Sets map[common.Hash]*NodeSet

+ func NewMergedNodeSet() *MergedNodeSet

+ func NewWithNodeSet(set *NodeSet) *MergedNodeSet

+ func (set *MergedNodeSet) Merge(other *NodeSet) error

+ type Node struct

+ Blob []byte

+ Hash common.Hash

+ func New(hash common.Hash, blob []byte) *Node

+ func (n *Node) IsDeleted() bool

+ func (n *Node) Size() int

+ type NodeSet struct

+ Leaves []*leaf

+ Nodes map[string]*WithPrev

+ Owner common.Hash

+ func NewNodeSet(owner common.Hash) *NodeSet

+ func (set *NodeSet) AddLeaf(parent common.Hash, blob []byte)

+ func (set *NodeSet) AddNode(path []byte, n *WithPrev)

+ func (set *NodeSet) ForEachWithOrder(callback func(path string, n *Node))

+ func (set *NodeSet) Hashes() []common.Hash

+ func (set *NodeSet) Merge(owner common.Hash, nodes map[string]*WithPrev) error

+ func (set *NodeSet) Size() (int, int)

+ func (set *NodeSet) Summary() string

+ type WithPrev struct

+ Prev []byte

+ func NewWithPrev(hash common.Hash, blob []byte, prev []byte) *WithPrev

+ func (n *WithPrev) Size() int

+ func (n *WithPrev) Unwrap() *Node