Spaces:
Running
Running
File size: 5,621 Bytes
b110593 |
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 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 |
// _ _
// __ _____ __ ___ ___ __ _| |_ ___
// \ \ /\ / / _ \/ _` \ \ / / |/ _` | __/ _ \
// \ V V / __/ (_| |\ V /| | (_| | || __/
// \_/\_/ \___|\__,_| \_/ |_|\__,_|\__\___|
//
// Copyright © 2016 - 2024 Weaviate B.V. All rights reserved.
//
// CONTACT: [email protected]
//
package segmentindex
import (
"testing"
"github.com/stretchr/testify/assert"
"github.com/stretchr/testify/require"
"github.com/weaviate/weaviate/entities/lsmkv"
)
func TestTree(t *testing.T) {
type elem struct {
key []byte
start uint64
end uint64
}
tree := NewTree(4)
elements := []elem{
{
key: []byte("foobar"),
start: 17,
end: 18,
},
{
key: []byte("abc"),
start: 4,
end: 5,
},
{
key: []byte("zzz"),
start: 34,
end: 35,
},
{
key: []byte("aaa"),
start: 1,
end: 2,
},
{
// makes the tree slightly imbalanced to the right, which in turn assures
// that we have a nil node in between
key: []byte("zzzz"),
start: 100,
end: 102,
},
}
t.Run("inserting", func(t *testing.T) {
for _, elem := range elements {
tree.Insert(elem.key, elem.start, elem.end)
}
})
t.Run("exact get", func(t *testing.T) {
key, start, end := tree.Get([]byte("foobar"))
assert.Equal(t, []byte("foobar"), key)
assert.Equal(t, uint64(17), start)
assert.Equal(t, uint64(18), end)
key, start, end = tree.Get([]byte("abc"))
assert.Equal(t, []byte("abc"), key)
assert.Equal(t, uint64(4), start)
assert.Equal(t, uint64(5), end)
key, start, end = tree.Get([]byte("zzz"))
assert.Equal(t, []byte("zzz"), key)
assert.Equal(t, uint64(34), start)
assert.Equal(t, uint64(35), end)
key, start, end = tree.Get([]byte("aaa"))
assert.Equal(t, []byte("aaa"), key)
assert.Equal(t, uint64(1), start)
assert.Equal(t, uint64(2), end)
key, start, end = tree.Get([]byte("zzzz"))
assert.Equal(t, []byte("zzzz"), key)
assert.Equal(t, uint64(100), start)
assert.Equal(t, uint64(102), end)
})
t.Run("marshalling and then reading the byte representation", func(t *testing.T) {
bytes, err := tree.MarshalBinary()
require.Nil(t, err)
dTree := NewDiskTree(bytes)
t.Run("get", func(t *testing.T) {
n, err := dTree.Get([]byte("foobar"))
assert.Nil(t, err)
assert.Equal(t, []byte("foobar"), n.Key)
assert.Equal(t, uint64(17), n.Start)
assert.Equal(t, uint64(18), n.End)
n, err = dTree.Get([]byte("abc"))
assert.Nil(t, err)
assert.Equal(t, []byte("abc"), n.Key)
assert.Equal(t, uint64(4), n.Start)
assert.Equal(t, uint64(5), n.End)
n, err = dTree.Get([]byte("zzz"))
assert.Nil(t, err)
assert.Equal(t, []byte("zzz"), n.Key)
assert.Equal(t, uint64(34), n.Start)
assert.Equal(t, uint64(35), n.End)
n, err = dTree.Get([]byte("aaa"))
assert.Nil(t, err)
assert.Equal(t, []byte("aaa"), n.Key)
assert.Equal(t, uint64(1), n.Start)
assert.Equal(t, uint64(2), n.End)
n, err = dTree.Get([]byte("zzzz"))
assert.Nil(t, err)
assert.Equal(t, []byte("zzzz"), n.Key)
assert.Equal(t, uint64(100), n.Start)
assert.Equal(t, uint64(102), n.End)
})
t.Run("seek", func(t *testing.T) {
n, err := dTree.Seek([]byte("foobar"))
assert.Nil(t, err)
assert.Equal(t, []byte("foobar"), n.Key)
assert.Equal(t, uint64(17), n.Start)
assert.Equal(t, uint64(18), n.End)
n, err = dTree.Seek([]byte("f"))
assert.Nil(t, err)
assert.Equal(t, []byte("foobar"), n.Key)
assert.Equal(t, uint64(17), n.Start)
assert.Equal(t, uint64(18), n.End)
n, err = dTree.Seek([]byte("abc"))
assert.Nil(t, err)
assert.Equal(t, []byte("abc"), n.Key)
assert.Equal(t, uint64(4), n.Start)
assert.Equal(t, uint64(5), n.End)
n, err = dTree.Seek([]byte("ab"))
assert.Nil(t, err)
assert.Equal(t, []byte("abc"), n.Key)
assert.Equal(t, uint64(4), n.Start)
assert.Equal(t, uint64(5), n.End)
n, err = dTree.Seek([]byte("zzz"))
assert.Nil(t, err)
assert.Equal(t, []byte("zzz"), n.Key)
assert.Equal(t, uint64(34), n.Start)
assert.Equal(t, uint64(35), n.End)
n, err = dTree.Seek([]byte("z"))
assert.Nil(t, err)
assert.Equal(t, []byte("zzz"), n.Key)
assert.Equal(t, uint64(34), n.Start)
assert.Equal(t, uint64(35), n.End)
n, err = dTree.Seek([]byte("aaa"))
assert.Nil(t, err)
assert.Equal(t, []byte("aaa"), n.Key)
assert.Equal(t, uint64(1), n.Start)
assert.Equal(t, uint64(2), n.End)
n, err = dTree.Seek([]byte("a"))
assert.Nil(t, err)
assert.Equal(t, []byte("aaa"), n.Key)
assert.Equal(t, uint64(1), n.Start)
assert.Equal(t, uint64(2), n.End)
n, err = dTree.Seek([]byte("zzzz"))
assert.Nil(t, err)
assert.Equal(t, []byte("zzzz"), n.Key)
assert.Equal(t, uint64(100), n.Start)
assert.Equal(t, uint64(102), n.End)
n, err = dTree.Seek([]byte("zzza"))
assert.Nil(t, err)
assert.Equal(t, []byte("zzzz"), n.Key)
assert.Equal(t, uint64(100), n.Start)
assert.Equal(t, uint64(102), n.End)
n, err = dTree.Seek([]byte("zzzzz"))
assert.Equal(t, lsmkv.NotFound, err)
})
t.Run("get all keys (for building bloom filters at segment init time)", func(t *testing.T) {
expected := [][]byte{
[]byte("aaa"),
[]byte("abc"),
[]byte("foobar"),
[]byte("zzz"),
[]byte("zzzz"),
}
keys, err := dTree.AllKeys()
require.Nil(t, err)
assert.ElementsMatch(t, expected, keys)
})
})
}
|