mirror of
https://gitlab.com/pulsechaincom/erigon-pulse.git
synced 2024-12-25 04:57:17 +00:00
60 lines
1.0 KiB
Go
60 lines
1.0 KiB
Go
|
package ptrie
|
||
|
|
||
|
type FullNode struct {
|
||
|
trie *Trie
|
||
|
nodes [17]Node
|
||
|
}
|
||
|
|
||
|
func NewFullNode(t *Trie) *FullNode {
|
||
|
return &FullNode{trie: t}
|
||
|
}
|
||
|
|
||
|
func (self *FullNode) Dirty() bool { return true }
|
||
|
func (self *FullNode) Value() Node {
|
||
|
self.nodes[16] = self.trie.trans(self.nodes[16])
|
||
|
return self.nodes[16]
|
||
|
}
|
||
|
|
||
|
func (self *FullNode) Copy() Node { return self }
|
||
|
|
||
|
// Returns the length of non-nil nodes
|
||
|
func (self *FullNode) Len() (amount int) {
|
||
|
for _, node := range self.nodes {
|
||
|
if node != nil {
|
||
|
amount++
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return
|
||
|
}
|
||
|
|
||
|
func (self *FullNode) Hash() interface{} {
|
||
|
return self.trie.store(self)
|
||
|
}
|
||
|
|
||
|
func (self *FullNode) RlpData() interface{} {
|
||
|
t := make([]interface{}, 17)
|
||
|
for i, node := range self.nodes {
|
||
|
if node != nil {
|
||
|
t[i] = node.Hash()
|
||
|
} else {
|
||
|
t[i] = ""
|
||
|
}
|
||
|
}
|
||
|
|
||
|
return t
|
||
|
}
|
||
|
|
||
|
func (self *FullNode) set(k byte, value Node) {
|
||
|
self.nodes[int(k)] = value
|
||
|
}
|
||
|
|
||
|
func (self *FullNode) get(i byte) Node {
|
||
|
if self.nodes[int(i)] != nil {
|
||
|
self.nodes[int(i)] = self.trie.trans(self.nodes[int(i)])
|
||
|
|
||
|
return self.nodes[int(i)]
|
||
|
}
|
||
|
return nil
|
||
|
}
|