80 lines
		
	
	
		
			2.2 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
			
		
		
	
	
			80 lines
		
	
	
		
			2.2 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
| // 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 (
 | |
| 	"testing"
 | |
| 
 | |
| 	"github.com/ethereum/go-ethereum/common"
 | |
| 	"github.com/ethereum/go-ethereum/ethdb"
 | |
| )
 | |
| 
 | |
| func TestIterator(t *testing.T) {
 | |
| 	trie := newEmpty()
 | |
| 	vals := []struct{ k, v string }{
 | |
| 		{"do", "verb"},
 | |
| 		{"ether", "wookiedoo"},
 | |
| 		{"horse", "stallion"},
 | |
| 		{"shaman", "horse"},
 | |
| 		{"doge", "coin"},
 | |
| 		{"dog", "puppy"},
 | |
| 		{"somethingveryoddindeedthis is", "myothernodedata"},
 | |
| 	}
 | |
| 	v := make(map[string]bool)
 | |
| 	for _, val := range vals {
 | |
| 		v[val.k] = false
 | |
| 		trie.Update([]byte(val.k), []byte(val.v))
 | |
| 	}
 | |
| 	trie.Commit()
 | |
| 
 | |
| 	it := NewIterator(trie)
 | |
| 	for it.Next() {
 | |
| 		v[string(it.Key)] = true
 | |
| 	}
 | |
| 
 | |
| 	for k, found := range v {
 | |
| 		if !found {
 | |
| 			t.Error("iterator didn't find", k)
 | |
| 		}
 | |
| 	}
 | |
| }
 | |
| 
 | |
| // Tests that the node iterator indeed walks over the entire database contents.
 | |
| func TestNodeIteratorCoverage(t *testing.T) {
 | |
| 	// Create some arbitrary test trie to iterate
 | |
| 	db, trie, _ := makeTestTrie()
 | |
| 
 | |
| 	// Gather all the node hashes found by the iterator
 | |
| 	hashes := make(map[common.Hash]struct{})
 | |
| 	for it := NewNodeIterator(trie); it.Next(); {
 | |
| 		if it.Hash != (common.Hash{}) {
 | |
| 			hashes[it.Hash] = struct{}{}
 | |
| 		}
 | |
| 	}
 | |
| 	// Cross check the hashes and the database itself
 | |
| 	for hash, _ := range hashes {
 | |
| 		if _, err := db.Get(hash.Bytes()); err != nil {
 | |
| 			t.Errorf("failed to retrieve reported node %x: %v", hash, err)
 | |
| 		}
 | |
| 	}
 | |
| 	for _, key := range db.(*ethdb.MemDatabase).Keys() {
 | |
| 		if _, ok := hashes[common.BytesToHash(key)]; !ok {
 | |
| 			t.Errorf("state entry not reported %x", key)
 | |
| 		}
 | |
| 	}
 | |
| }
 |