plugeth/trie/node.go

41 lines
1.2 KiB
Go
Raw Normal View History

2015-01-08 10:47:04 +00:00
package trie
2014-11-18 11:02:13 +00:00
import "fmt"
var indices = []string{"0", "1", "2", "3", "4", "5", "6", "7", "8", "9", "a", "b", "c", "d", "e", "f", "[17]"}
type Node interface {
Value() Node
Copy() Node // All nodes, for now, return them self
Dirty() bool
fstring(string) string
Hash() interface{}
RlpData() interface{}
}
// Value node
func (self *ValueNode) String() string { return self.fstring("") }
func (self *FullNode) String() string { return self.fstring("") }
func (self *ShortNode) String() string { return self.fstring("") }
func (self *ValueNode) fstring(ind string) string { return fmt.Sprintf("%x ", self.data) }
2015-01-29 22:17:43 +00:00
func (self *HashNode) fstring(ind string) string { return fmt.Sprintf("< %x > ", self.key) }
2014-11-18 11:02:13 +00:00
// Full node
func (self *FullNode) fstring(ind string) string {
resp := fmt.Sprintf("[\n%s ", ind)
for i, node := range self.nodes {
if node == nil {
resp += fmt.Sprintf("%s: <nil> ", indices[i])
} else {
resp += fmt.Sprintf("%s: %v", indices[i], node.fstring(ind+" "))
}
}
return resp + fmt.Sprintf("\n%s] ", ind)
}
// Short node
func (self *ShortNode) fstring(ind string) string {
return fmt.Sprintf("[ %x: %v ] ", self.key, self.value.fstring(ind+" "))
2014-11-18 11:02:13 +00:00
}