/
compress_test.go
70 lines (64 loc) · 1.37 KB
/
compress_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
package kvfile_compress
import (
"bytes"
"io"
"testing"
)
func TestKvCompress(t *testing.T) {
var buf bytes.Buffer
keys := [][]byte{
[]byte("test-1"),
[]byte("test-2"),
[]byte("test-3"),
}
vals := [][]byte{
[]byte("val-1"),
[]byte("val-2"),
[]byte("val-3"),
}
// we write the keys in sequential order, use that here:
var index int
err := WriteCompress(&buf, keys, func(wr io.Writer, key []byte) (uint64, error) {
nw, err := wr.Write(vals[index])
if err != nil {
return 0, err
}
index++
return uint64(nw), nil
})
if err != nil {
t.Fatal(err.Error())
}
bufReader := bytes.NewReader(buf.Bytes())
rdr, rdrRelease, err := BuildCompressReader(bufReader)
if err != nil {
t.Fatal(err.Error())
}
defer rdrRelease()
keyExists, err := rdr.Exists(keys[0])
if err != nil {
t.Fatal(err.Error())
}
if !keyExists {
t.Fatalf("expected key to exist: %s", string(keys[0]))
}
keyExists, err = rdr.Exists([]byte("does-not-exist"))
if err != nil {
t.Fatal(err.Error())
}
if keyExists {
t.Fatal("expected key to not exist")
}
for i := 0; i < len(keys); i++ {
data, found, err := rdr.Get(keys[i])
if err != nil {
t.Fatal(err.Error())
}
if !found {
t.Fatalf("expected key to exist: %s", string(keys[i]))
}
if !bytes.Equal(data, vals[i]) {
t.Fatalf("value mismatch %s: got %v expected %v", string(keys[i]), data, vals[i])
}
}
}