forked from peterbourgon/diskv
-
Notifications
You must be signed in to change notification settings - Fork 0
/
lru_index_test.go
124 lines (106 loc) · 2.72 KB
/
lru_index_test.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
package diskv
import (
"bytes"
"os"
"reflect"
"testing"
"time"
)
func TestLruIndexOrder(t *testing.T) {
defer os.RemoveAll("index-test-db-1")
d := New(Options{
BasePath: "index-test",
CacheSizeMax: 1024,
Index: newLruIndex("index-test-db-1"),
})
defer d.EraseAll()
v := []byte{'1', '2', '3'}
d.Write("a", v)
if !d.isIndexed("a") {
t.Fatalf("'a' not indexed after write")
}
d.Write("b", v)
d.Write("m", v)
d.Write("d", v)
d.Write("A", v)
d.Write("d", v)
expectedKeys := []string{"a", "b", "m", "A", "d"}
keys := make([]string, 0)
for _, key := range d.Index.Keys("", 100) {
keys = append(keys, key)
}
if !cmpStrings(keys, expectedKeys) {
t.Fatalf("got %s, expected %s", keys, expectedKeys)
}
}
func TestLruIndexLoad(t *testing.T) {
defer os.RemoveAll("index-test-db-2")
d1 := New(Options{
BasePath: "index-test",
CacheSizeMax: 1024,
Index: newLruIndex("index-test-db-2"),
})
val := []byte{'1', '2', '3'}
keys := []string{"a", "b", "c", "d", "e", "f", "g"}
for _, key := range keys {
d1.Write(key, val)
}
d1.Index.(*lruIndex).db.Close()
d1.Index = nil
d2 := New(Options{
BasePath: "index-test",
CacheSizeMax: 1024,
Index: newLruIndex("index-test-db-2"),
})
defer d2.EraseAll()
// check d2 has properly loaded existing d1 data
for _, key := range keys {
if !d2.isIndexed(key) {
t.Fatalf("key '%s' not indexed on secondary", key)
}
}
// cache one
if readValue, err := d2.Read(keys[0]); err != nil {
t.Fatalf("%s", err)
} else if bytes.Compare(val, readValue) != 0 {
t.Fatalf("%s: got %s, expected %s", keys[0], readValue, val)
}
// make sure it got cached
for i := 0; i < 10 && !d2.isCached(keys[0]); i++ {
time.Sleep(10 * time.Millisecond)
}
if !d2.isCached(keys[0]) {
t.Fatalf("key '%s' not cached", keys[0])
}
// kill the disk
d1.EraseAll()
// cached value should still be there in the second
if readValue, err := d2.Read(keys[0]); err != nil {
t.Fatalf("%s", err)
} else if bytes.Compare(val, readValue) != 0 {
t.Fatalf("%s: got %s, expected %s", keys[0], readValue, val)
}
// but not in the original
if _, err := d1.Read(keys[0]); err == nil {
t.Fatalf("expected error reading from flushed store")
}
}
func TestLruIndexKeysEmptyFrom(t *testing.T) {
defer os.RemoveAll("index-test-db-3")
d := New(Options{
BasePath: "index-test",
CacheSizeMax: 1024,
Index: newLruIndex("index-test-db-3"),
IndexLess: strLess,
})
defer d.EraseAll()
keys := []string{"a", "c", "z", "b", "x", "b", "y"}
for _, k := range keys {
d.Write(k, []byte("1"))
}
want := []string{"a", "c", "z", "x", "b", "y"}
have := d.Index.Keys("", 99)
if !reflect.DeepEqual(want, have) {
t.Errorf("want %v, have %v", keys, have)
}
}