trienode

Documentation

Index

• type MergedNodeSet
  • func NewMergedNodeSet() *MergedNodeSet
  • func NewWithNodeSet(set *NodeSet) *MergedNodeSet
  • func (set *MergedNodeSet) Merge(other *NodeSet) error
• type Node
  • func New(hash common.Hash, blob []byte) *Node
  • func (n *Node) IsDeleted() bool
  • func (n *Node) Size() int
• type NodeSet
  • 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) Size() (int, int)
  • func (set *NodeSet) Summary() string
• type WithPrev
  • func NewWithPrev(hash common.Hash, blob []byte, prev []byte) *WithPrev
  • func (n *WithPrev) Size() int
  • func (n *WithPrev) Unwrap() *Node

Types

type MergedNodeSet

type MergedNodeSet struct {
	Sets map[common.Hash]*NodeSet
}

MergedNodeSet represents a merged node set for a group of tries.

func NewMergedNodeSet

func NewMergedNodeSet() *MergedNodeSet

NewMergedNodeSet initializes an empty merged set.

func NewWithNodeSet

func NewWithNodeSet(set *NodeSet) *MergedNodeSet

NewWithNodeSet constructs a merged nodeset with the provided single set.

func (*MergedNodeSet) Merge

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

Merge merges the provided dirty nodes of a trie into the set. The assumption is held that no duplicated set belonging to the same trie will be merged twice.

type Node

type Node struct {
	Hash common.Hash // Node hash, empty for deleted node
	Blob []byte      // Encoded node blob, nil for the deleted node
}

Node is a wrapper which contains the encoded blob of the trie node and its unique hash identifier. It is general enough that can be used to represent trie nodes corresponding to different trie implementations.

func New

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

New constructs a node with provided node information.

func (*Node) IsDeleted

func (n *Node) IsDeleted() bool

IsDeleted returns the indicator if the node is marked as deleted.

func (*Node) Size

func (n *Node) Size() int

Size returns the total memory size used by this node.

type NodeSet

type NodeSet struct {
	Owner  common.Hash
	Leaves []*leaf
	Nodes  map[string]*WithPrev
	// contains filtered or unexported fields
}

NodeSet contains a set of nodes collected during the commit operation. Each node is keyed by path. It's not thread-safe to use.

func NewNodeSet

func NewNodeSet(owner common.Hash) *NodeSet

NewNodeSet initializes a node set. The owner is zero for the account trie and the owning account address hash for storage tries.

func (*NodeSet) AddLeaf

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

AddLeaf adds the provided leaf node into set. TODO(rjl493456442) how can we get rid of it?

func (*NodeSet) AddNode

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

AddNode adds the provided node into set.

func (*NodeSet) ForEachWithOrder

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

ForEachWithOrder iterates the nodes with the order from bottom to top, right to left, nodes with the longest path will be iterated first.

func (*NodeSet) Hashes

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

Hashes returns the hashes of all updated nodes. TODO(rjl493456442) how can we get rid of it?

func (*NodeSet) Size

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

Size returns the number of dirty nodes in set.

func (*NodeSet) Summary

func (set *NodeSet) Summary() string

Summary returns a string-representation of the NodeSet.

type WithPrev

type WithPrev struct {
	*Node
	Prev []byte // Encoded original value, nil means it's non-existent
}

WithPrev wraps the Node with the previous node value attached.

func NewWithPrev

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

NewWithPrev constructs a node with provided node information.

func (*WithPrev) Size

func (n *WithPrev) Size() int

Size returns the total memory size used by this node. It overloads the function in Node by counting the size of previous value as well.

func (*WithPrev) Unwrap

func (n *WithPrev) Unwrap() *Node

Unwrap returns the internal Node object.