forked from monochromegane/gannoy
-
Notifications
You must be signed in to change notification settings - Fork 0
/
file_test.go
193 lines (177 loc) · 4.31 KB
/
file_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
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
package gannoy
import (
"os"
"testing"
)
func TestFileCreateAndFind(t *testing.T) {
name := "test_file_create_and_find.tree"
defer os.Remove(name)
file := newFile(name, 2, 3, 6)
nodes := []Node{
// Leaf node
Node{
key: 10,
nDescendants: 1,
parents: []int{2, 3},
children: []int{0, 0},
v: []float64{1.1, 1.2, 1.3},
},
// Bucket node
Node{
key: 20,
nDescendants: 3,
parents: []int{2, 3},
children: []int{5, 6, 7},
},
// Branch node
Node{
key: 30,
nDescendants: 2,
parents: []int{2, 3},
children: []int{5, 6},
v: []float64{1.1, 1.2, 1.3},
},
}
// Create
for i, node := range nodes {
id, err := file.Create(node)
if id != i {
t.Errorf("File create should return id: %d, but %d", i, id)
}
if err != nil {
t.Errorf("File create should not return error.")
}
}
// Find
for id, node := range nodes {
found, err := file.Find(id)
if err != nil {
t.Errorf("File find should not return error.")
}
if found.id != id {
t.Errorf("File find should return created node with id %d, but %d", found.id, id)
}
if found.key != node.key {
t.Errorf("File find should return created node with key %d, but %d", found.key, node.key)
}
if found.nDescendants != node.nDescendants {
t.Errorf("File find should return created node with nDescendants %d, but %d", found.nDescendants, node.nDescendants)
}
for i, parent := range found.parents {
if parent != node.parents[i] {
t.Errorf("File find should return created node with parents %v, but %v", found.parents, node.parents)
}
}
for i, child := range found.children {
if child != node.children[i] {
t.Errorf("File find should return created node with children %v, but %v", found.children, node.children)
}
}
for i, v := range found.v {
if v != node.v[i] {
t.Errorf("File find should return created node with v %v, but %v", found.v, node.v)
}
}
if found.free != node.free {
t.Errorf("File find should return created node with free %d, but %d", found.free, node.free)
}
}
}
func TestFileUpdate(t *testing.T) {
name := "test_file_update.tree"
defer os.Remove(name)
file := newFile(name, 2, 3, 4)
node := Node{
key: 10,
nDescendants: 1,
parents: []int{2, 3},
v: []float64{1.1, 1.2, 1.3},
}
// Create
id, _ := file.Create(node)
// Found
found, _ := file.Find(id)
// Update
found.v = []float64{2.1, 2.2, 2.3}
err := file.Update(found)
if err != nil {
t.Errorf("File update should not return error.")
}
updated, _ := file.Find(id)
for i, v := range updated.v {
if v != found.v[i] {
t.Errorf("File update should return updated node with v %v, but %v", found.v, updated.v)
}
}
}
func TestUpdateParent(t *testing.T) {
name := "test_file_update_parent.tree"
defer os.Remove(name)
file := newFile(name, 2, 3, 4)
node := Node{
key: 10,
nDescendants: 1,
parents: []int{2, 3},
v: []float64{1.1, 1.2, 1.3},
}
// Create
id, _ := file.Create(node)
// Update parent
newParents := []int{20, 30}
for i, newParent := range newParents {
err := file.UpdateParent(id, i, newParent)
if err != nil {
t.Errorf("File update parent should not return error.")
}
}
// Found
updated, _ := file.Find(id)
for i, newParent := range newParents {
if updated.parents[i] != newParent {
t.Errorf("File update parent should not return error.")
}
}
}
func TestFileIterate(t *testing.T) {
name := "test_file_iterate.tree"
defer os.Remove(name)
file := newFile(name, 2, 3, 4)
nodes := []Node{
// Leaf node
Node{
key: 10,
nDescendants: 1,
parents: []int{2, 3},
v: []float64{1.1, 1.2, 1.3},
},
// Bucket node
Node{
key: 20,
nDescendants: 3,
parents: []int{2, 3},
children: []int{5, 6, 7},
},
// Branch node
Node{
key: 30,
nDescendants: 2,
parents: []int{2, 3},
children: []int{5, 6},
v: []float64{1.1, 1.2, 1.3},
},
}
// Create
for _, node := range nodes {
file.Create(node)
}
// Iterate
iterator := make(chan Node)
go file.Iterate(iterator)
i := 0
for node := range iterator {
if nodes[i].key != node.key {
t.Errorf("File iterate should return node (key: %d), but %d", nodes[i].key, node.key)
}
i++
}
}