diff options
| author | Péter Szilágyi <peterke@gmail.com> | 2017-01-06 21:42:03 +0800 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2017-01-06 21:42:03 +0800 |
| commit | 8f9daaa3ba71c3b6bdcc24adfdc987e6f3a2e184 (patch) | |
| tree | 92a336065bddcd620798e8f552432e3ed62ee14a /trie/sync_test.go | |
| parent | e0ee0cc66a4416edd47232649f4d4bca4a5e3c07 (diff) | |
| parent | d3b751e4d94f95f6cc89544852f2d5811e075665 (diff) | |
| download | dexon-8f9daaa3ba71c3b6bdcc24adfdc987e6f3a2e184.tar dexon-8f9daaa3ba71c3b6bdcc24adfdc987e6f3a2e184.tar.gz dexon-8f9daaa3ba71c3b6bdcc24adfdc987e6f3a2e184.tar.bz2 dexon-8f9daaa3ba71c3b6bdcc24adfdc987e6f3a2e184.tar.lz dexon-8f9daaa3ba71c3b6bdcc24adfdc987e6f3a2e184.tar.xz dexon-8f9daaa3ba71c3b6bdcc24adfdc987e6f3a2e184.tar.zst dexon-8f9daaa3ba71c3b6bdcc24adfdc987e6f3a2e184.zip | |
Merge pull request #3518 from fjl/ethclient-dependency-cleanup
core/types: dependency cleanup
Diffstat (limited to 'trie/sync_test.go')
| -rw-r--r-- | trie/sync_test.go | 12 |
1 files changed, 6 insertions, 6 deletions
diff --git a/trie/sync_test.go b/trie/sync_test.go index 5292fe5cb..5edbd0746 100644 --- a/trie/sync_test.go +++ b/trie/sync_test.go @@ -122,7 +122,7 @@ func testIterativeTrieSync(t *testing.T, batch int) { } results[i] = SyncResult{hash, 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)...) @@ -152,7 +152,7 @@ func TestIterativeDelayedTrieSync(t *testing.T) { } results[i] = SyncResult{hash, 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(10000)...) @@ -190,7 +190,7 @@ func testIterativeRandomTrieSync(t *testing.T, batch int) { results = append(results, SyncResult{hash, 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{}) @@ -231,7 +231,7 @@ func TestIterativeRandomDelayedTrieSync(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 _, result := range results { @@ -272,7 +272,7 @@ func TestDuplicateAvoidanceTrieSync(t *testing.T) { results[i] = SyncResult{hash, 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(0)...) @@ -304,7 +304,7 @@ func TestIncompleteTrieSync(t *testing.T) { results[i] = SyncResult{hash, data} } // Process each of the trie 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 { |