plugeth/trie/iterator.go

111 lines
1.9 KiB
Go
Raw Normal View History

2014-10-31 13:45:03 +00:00
package trie
2014-10-10 14:56:28 +00:00
2015-01-08 10:47:04 +00:00
import "bytes"
2014-10-10 14:56:28 +00:00
type Iterator struct {
trie *Trie
Key []byte
2015-01-08 10:47:04 +00:00
Value []byte
2014-10-10 14:56:28 +00:00
}
func NewIterator(trie *Trie) *Iterator {
2015-01-08 10:47:04 +00:00
return &Iterator{trie: trie, Key: make([]byte, 32)}
2014-10-10 14:56:28 +00:00
}
2015-01-08 10:47:04 +00:00
func (self *Iterator) Next() bool {
self.trie.mu.Lock()
defer self.trie.mu.Unlock()
2014-10-10 14:56:28 +00:00
2015-01-08 10:47:04 +00:00
key := RemTerm(CompactHexDecode(string(self.Key)))
k := self.next(self.trie.root, key)
2014-10-10 14:56:28 +00:00
2015-01-08 10:47:04 +00:00
self.Key = []byte(DecodeCompact(k))
2014-10-10 14:56:28 +00:00
2015-01-08 10:47:04 +00:00
return len(k) > 0
2014-10-10 14:56:28 +00:00
}
2015-01-08 10:47:04 +00:00
func (self *Iterator) next(node Node, key []byte) []byte {
if node == nil {
2014-10-10 14:56:28 +00:00
return nil
2015-01-08 10:47:04 +00:00
}
2014-10-10 14:56:28 +00:00
2015-01-08 10:47:04 +00:00
switch node := node.(type) {
case *FullNode:
if len(key) > 0 {
k := self.next(node.branch(key[0]), key[1:])
if k != nil {
return append([]byte{key[0]}, k...)
2014-10-10 14:56:28 +00:00
}
}
2015-01-08 10:47:04 +00:00
var r byte
2014-10-10 14:56:28 +00:00
if len(key) > 0 {
r = key[0] + 1
}
for i := r; i < 16; i++ {
2015-01-08 10:47:04 +00:00
k := self.key(node.branch(byte(i)))
if k != nil {
return append([]byte{i}, k...)
2014-10-10 14:56:28 +00:00
}
}
2015-01-08 10:47:04 +00:00
case *ShortNode:
k := RemTerm(node.Key())
if vnode, ok := node.Value().(*ValueNode); ok {
if bytes.Compare([]byte(k), key) > 0 {
self.Value = vnode.Val()
2014-10-10 14:56:28 +00:00
return k
}
} else {
2015-01-08 10:47:04 +00:00
cnode := node.Value()
2014-10-10 14:56:28 +00:00
var ret []byte
2015-01-08 10:47:04 +00:00
skey := key[len(k):]
2014-10-10 14:56:28 +00:00
if BeginsWith(key, k) {
2015-01-08 10:47:04 +00:00
ret = self.next(cnode, skey)
2014-10-10 14:56:28 +00:00
} else if bytes.Compare(k, key[:len(k)]) > 0 {
2015-02-07 16:03:22 +00:00
return self.key(node)
2014-10-10 14:56:28 +00:00
}
if ret != nil {
return append(k, ret...)
}
}
}
return nil
}
2015-01-08 10:47:04 +00:00
func (self *Iterator) key(node Node) []byte {
switch node := node.(type) {
case *ShortNode:
// Leaf node
if vnode, ok := node.Value().(*ValueNode); ok {
k := RemTerm(node.Key())
self.Value = vnode.Val()
2014-10-10 14:56:28 +00:00
2015-01-08 10:47:04 +00:00
return k
} else {
k := RemTerm(node.Key())
return append(k, self.key(node.Value())...)
}
case *FullNode:
if node.Value() != nil {
self.Value = node.Value().(*ValueNode).Val()
2014-10-10 14:56:28 +00:00
2015-01-08 10:47:04 +00:00
return []byte{16}
}
2014-10-10 14:56:28 +00:00
2015-01-08 10:47:04 +00:00
for i := 0; i < 16; i++ {
k := self.key(node.branch(byte(i)))
if k != nil {
return append([]byte{byte(i)}, k...)
}
}
}
return nil
2014-10-10 14:56:28 +00:00
}