VDB-327 Constantinople prep (#135)

* Bump geth to 1.8.20 for Constantinople

* Fix conflicting import/toml source for logrus

vendor/github.com/allegro/bigcache/iterator_test.go

@@ -0,0 +1,150 @@
+package bigcache
+
+import (
+	"fmt"
+	"testing"
+	"time"
+
+	"github.com/stretchr/testify/assert"
+)
+
+func TestEntriesIterator(t *testing.T) {
+	t.Parallel()
+
+	// given
+	keysCount := 1000
+	cache, _ := NewBigCache(Config{
+		Shards:             8,
+		LifeWindow:         6 * time.Second,
+		MaxEntriesInWindow: 1,
+		MaxEntrySize:       256,
+	})
+	value := []byte("value")
+
+	for i := 0; i < keysCount; i++ {
+		cache.Set(fmt.Sprintf("key%d", i), value)
+	}
+
+	// when
+	keys := make(map[string]struct{})
+	iterator := cache.Iterator()
+
+	for iterator.SetNext() {
+		current, err := iterator.Value()
+
+		if err == nil {
+			keys[current.Key()] = struct{}{}
+		}
+	}
+
+	// then
+	assert.Equal(t, keysCount, len(keys))
+}
+
+func TestEntriesIteratorWithMostShardsEmpty(t *testing.T) {
+	t.Parallel()
+
+	// given
+	clock := mockedClock{value: 0}
+	cache, _ := newBigCache(Config{
+		Shards:             8,
+		LifeWindow:         6 * time.Second,
+		MaxEntriesInWindow: 1,
+		MaxEntrySize:       256,
+	}, &clock)
+
+	cache.Set("key", []byte("value"))
+
+	// when
+	iterator := cache.Iterator()
+
+	// then
+	if !iterator.SetNext() {
+		t.Errorf("Iterator should contain at least single element")
+	}
+
+	current, err := iterator.Value()
+
+	// then
+	assert.Nil(t, err)
+	assert.Equal(t, "key", current.Key())
+	assert.Equal(t, uint64(0x3dc94a19365b10ec), current.Hash())
+	assert.Equal(t, []byte("value"), current.Value())
+	assert.Equal(t, uint64(0), current.Timestamp())
+}
+
+func TestEntriesIteratorWithConcurrentUpdate(t *testing.T) {
+	t.Parallel()
+
+	// given
+	cache, _ := NewBigCache(Config{
+		Shards:             1,
+		LifeWindow:         time.Second,
+		MaxEntriesInWindow: 1,
+		MaxEntrySize:       256,
+	})
+
+	cache.Set("key", []byte("value"))
+
+	// when
+	iterator := cache.Iterator()
+
+	// then
+	if !iterator.SetNext() {
+		t.Errorf("Iterator should contain at least single element")
+	}
+
+	// Quite ugly but works
+	for i := 0; i < cache.config.Shards; i++ {
+		if oldestEntry, err := cache.shards[i].getOldestEntry(); err == nil {
+			cache.onEvict(oldestEntry, 10, cache.shards[i].removeOldestEntry)
+		}
+	}
+
+	current, err := iterator.Value()
+
+	// then
+	assert.Equal(t, ErrCannotRetrieveEntry, err)
+	assert.Equal(t, "Could not retrieve entry from cache", err.Error())
+	assert.Equal(t, EntryInfo{}, current)
+}
+
+func TestEntriesIteratorWithAllShardsEmpty(t *testing.T) {
+	t.Parallel()
+
+	// given
+	cache, _ := NewBigCache(Config{
+		Shards:             1,
+		LifeWindow:         time.Second,
+		MaxEntriesInWindow: 1,
+		MaxEntrySize:       256,
+	})
+
+	// when
+	iterator := cache.Iterator()
+
+	// then
+	if iterator.SetNext() {
+		t.Errorf("Iterator should not contain any elements")
+	}
+}
+
+func TestEntriesIteratorInInvalidState(t *testing.T) {
+	t.Parallel()
+
+	// given
+	cache, _ := NewBigCache(Config{
+		Shards:             1,
+		LifeWindow:         time.Second,
+		MaxEntriesInWindow: 1,
+		MaxEntrySize:       256,
+	})
+
+	// when
+	iterator := cache.Iterator()
+
+	// then
+	_, err := iterator.Value()
+	assert.Equal(t, ErrInvalidIteratorState, err)
+	assert.Equal(t, "Iterator is in invalid state. Use SetNext() to move to next position", err.Error())
+}