From 87c5033edf4757fe5fdaaed9239e1552d4009c0b Mon Sep 17 00:00:00 2001
From: Roy Crihfield <roy@manteia.ltd>
Date: Tue, 22 Feb 2022 16:13:29 +0800
Subject: [PATCH] add test cases

---
 iterator_test.go | 79 ++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 79 insertions(+)

diff --git a/iterator_test.go b/iterator_test.go
index 3a26f64..58a637a 100644
--- a/iterator_test.go
+++ b/iterator_test.go
@@ -1,9 +1,15 @@
 package iterator_test
 
 import (
+	"bytes"
+	"fmt"
 	"testing"
 
+	"github.com/ethereum/go-ethereum/core/rawdb"
+	"github.com/ethereum/go-ethereum/core/state"
+
 	iter "github.com/vulcanize/go-eth-state-node-iterator"
+	fixt "github.com/vulcanize/go-eth-state-node-iterator/fixture"
 )
 
 func TestMakePaths(t *testing.T) {
@@ -18,3 +24,76 @@ func TestMakePaths(t *testing.T) {
 		}
 	}
 }
+
+func TestIterator(t *testing.T) {
+	edb, err := rawdb.NewLevelDBDatabaseWithFreezer(
+		fixt.ChainDataPath, 1024, 256, fixt.AncientDataPath,
+		"eth-pg-ipfs-state-snapshot", false,
+	)
+	if err != nil {
+		t.Fatal(err)
+	}
+	defer edb.Close()
+
+	height := uint64(1)
+	hash := rawdb.ReadCanonicalHash(edb, height)
+	header := rawdb.ReadHeader(edb, hash, height)
+	if header == nil {
+		t.Fatalf("unable to read canonical header at height %d", height)
+	}
+	sdb := state.NewDatabase(edb)
+	tree, err := sdb.OpenTrie(header.Root)
+	if err != nil {
+		t.Fatal(err)
+	}
+
+	t.Run("in bounds", func(t *testing.T) {
+		type testCase struct {
+			lower, upper []byte
+		}
+		cases := []testCase{
+			{nil, []byte{0}},
+			{[]byte{1}, []byte{2}},
+			{[]byte{3, 0}, []byte{4, 2, 0}},
+			{[]byte{5, 6, 9}, []byte{7}},
+			{[]byte{8}, []byte{8}},
+			{[]byte{8}, []byte{7}},
+		}
+
+		runCase := func(t *testing.T, tc testCase) {
+			it := iter.NewPrefixBoundIterator(tree, tc.lower, tc.upper)
+			for it.Next(true) {
+				if bytes.Compare(it.Path(), tc.lower) < 0 {
+					t.Fatalf("iterator outside lower bound: %v", it.Path())
+				}
+				if bytes.Compare(tc.upper, it.Path()) <= 0 {
+					t.Fatalf("iterator outside upper bound: %v", it.Path())
+				}
+			}
+		}
+		for _, tc := range cases {
+			t.Run("case", func(t *testing.T) { runCase(t, tc) })
+		}
+	})
+
+	t.Run("trie is covered", func(t *testing.T) {
+		allPaths := fixt.Block1_Paths
+		cases := []uint{1, 2, 4, 8, 16, 32}
+		runCase := func(t *testing.T, nbins uint) {
+			iters := iter.SubtrieIterators(tree, nbins)
+			ix := 0
+			for b := uint(0); b < nbins; b++ {
+				it := iters[b]
+				for ; it.Next(true); ix++ {
+					if !bytes.Equal(allPaths[ix], it.Path()) {
+						t.Fatalf("wrong path value\nexpected:\t%v\nactual:\t\t%v",
+							allPaths[ix], it.Path())
+					}
+				}
+			}
+		}
+		for _, tc := range cases {
+			t.Run(fmt.Sprintf("%d bins", tc), func(t *testing.T) { runCase(t, tc) })
+		}
+	})
+}