diff options
| author | Felix Lange <fjl@twurst.com> | 2017-01-05 22:58:00 +0800 |
|---|---|---|
| committer | Felix Lange <fjl@twurst.com> | 2017-01-06 21:15:22 +0800 |
| commit | d3b751e4d94f95f6cc89544852f2d5811e075665 (patch) | |
| tree | 14e3417894593f9922551dcb24c3a9d3383f69a2 /core/state/sync_test.go | |
| parent | 7731061903bb992f7630ab389863951efb360258 (diff) | |
| download | dexon-d3b751e4d94f95f6cc89544852f2d5811e075665.tar.gz dexon-d3b751e4d94f95f6cc89544852f2d5811e075665.tar.zst dexon-d3b751e4d94f95f6cc89544852f2d5811e075665.zip | |
trie: remove dependency on ethdb
This removes the core/types -> leveldb dependency.
Diffstat (limited to 'core/state/sync_test.go')
| -rw-r--r-- | core/state/sync_test.go | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/core/state/sync_test.go b/core/state/sync_test.go index 8111320e6..2a30c86f4 100644 --- a/core/state/sync_test.go +++ b/core/state/sync_test.go @@ -138,7 +138,7 @@ func testIterativeStateSync(t *testing.T, batch int) { } results[i] = trie.SyncResult{Hash: hash, Data: data} } - if _, index, err := sched.Process(results); err != nil { + if _, index, err := sched.Process(results, dstDb); err != nil { t.Fatalf("failed to process result #%d: %v", index, err) } queue = append(queue[:0], sched.Missing(batch)...) @@ -168,7 +168,7 @@ func TestIterativeDelayedStateSync(t *testing.T) { } results[i] = trie.SyncResult{Hash: hash, Data: data} } - if _, index, err := sched.Process(results); err != nil { + if _, index, err := sched.Process(results, dstDb); err != nil { t.Fatalf("failed to process result #%d: %v", index, err) } queue = append(queue[len(results):], sched.Missing(0)...) @@ -206,7 +206,7 @@ func testIterativeRandomStateSync(t *testing.T, batch int) { results = append(results, trie.SyncResult{Hash: hash, Data: data}) } // Feed the retrieved results back and queue new tasks - if _, index, err := sched.Process(results); err != nil { + if _, index, err := sched.Process(results, dstDb); err != nil { t.Fatalf("failed to process result #%d: %v", index, err) } queue = make(map[common.Hash]struct{}) @@ -249,7 +249,7 @@ func TestIterativeRandomDelayedStateSync(t *testing.T) { } } // Feed the retrieved results back and queue new tasks - if _, index, err := sched.Process(results); err != nil { + if _, index, err := sched.Process(results, dstDb); err != nil { t.Fatalf("failed to process result #%d: %v", index, err) } for _, hash := range sched.Missing(0) { @@ -283,7 +283,7 @@ func TestIncompleteStateSync(t *testing.T) { results[i] = trie.SyncResult{Hash: hash, Data: data} } // Process each of the state nodes - if _, index, err := sched.Process(results); err != nil { + if _, index, err := sched.Process(results, dstDb); err != nil { t.Fatalf("failed to process result #%d: %v", index, err) } for _, result := range results { |