aboutsummaryrefslogtreecommitdiffstats
path: root/trie/node.go
blob: 9d49029ded94f7d0c27cdbb8f0be4ba2b4b29796 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
// Copyright 2014 The go-ethereum Authors
// This file is part of the go-ethereum library.
//
// The go-ethereum library is free software: you can redistribute it and/or modify
// it under the terms of the GNU Lesser General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// The go-ethereum library is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU Lesser General Public License for more details.
//
// You should have received a copy of the GNU Lesser General Public License
// along with the go-ethereum library. If not, see <http://www.gnu.org/licenses/>.

package trie

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(*Trie) Node // All nodes, for now, return them self
    Dirty() bool
    fstring(string) string
    Hash() interface{}
    RlpData() interface{}
    setDirty(dirty bool)
}

// 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) }

//func (self *HashNode) fstring(ind string) string  { return fmt.Sprintf("< %x > ", self.key) }
func (self *HashNode) fstring(ind string) string {
    return fmt.Sprintf("%v", self.trie.trans(self))
}

// 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+"  "))
}