-
Notifications
You must be signed in to change notification settings - Fork 0
/
coverset_test.go
182 lines (148 loc) · 5.68 KB
/
coverset_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
package covertree
import (
"math"
"testing"
)
func TestCoverSet(t *testing.T) {
t.Run("child()", func(t *testing.T) {
expectResults := func(t *testing.T, actualResults, expectedResults coverSet) {
t.Helper()
if expected, actual := len(expectedResults.layers), len(actualResults.layers); expected != actual {
t.Fatalf("Expected %d layers in cover set but found %d instead", expected, actual)
}
if expected, actual := expectedResults.totalItemCount, actualResults.totalItemCount; expected != actual {
t.Errorf("Expected cover set to have total item count of %d but was %d", expected, actual)
}
if expected, actual := expectedResults.visibleItemCount, actualResults.visibleItemCount; expected != actual {
t.Errorf("Expected cover set to have visible item count of %d but was %d", expected, actual)
}
for layerNum := 0; layerNum < len(expectedResults.layers); layerNum++ {
expectedLayer := expectedResults.layers[layerNum]
actualLayer := actualResults.layers[layerNum]
if expected, actual := len(expectedLayer), len(actualLayer); expected != actual {
t.Errorf("Expected layer %d to contain %d items but found %d instead", layerNum, expected, actual)
} else {
for itemNum := range expectedLayer {
expectedItem := expectedLayer[itemNum]
actualItem := actualLayer[itemNum]
if expected, actual := expectedItem.withDistance.Item, actualItem.withDistance.Item; expected != actual {
t.Errorf("Expected item %d of layer %d to be %v but was %v", itemNum, layerNum, expected, actual)
}
if expected, actual := expectedItem.withDistance.Distance, actualItem.withDistance.Distance; expected != actual {
t.Errorf("Expected item %d of layer %d to have distance %g but was %g", itemNum, layerNum, expected, actual)
}
}
}
}
}
t.Run("returns the child coverset which excludes non-covering items", func(t *testing.T) {
var cs coverSet
cs.addLayer(makeCoverSetLayer([]itemWithChildren{
{withDistance: ItemWithDistance{"a", 0.0}},
{withDistance: ItemWithDistance{"b", 10.0}},
{withDistance: ItemWithDistance{"c", 1.0}},
}))
child, _, _ := cs.child("a", 2.0, 0, nil, nil)
var expectedCoverSet coverSet
expectedCoverSet.totalItemCount = 1
expectedCoverSet.addLayer(makeCoverSetLayer([]itemWithChildren{
{withDistance: ItemWithDistance{"a", 0.0}},
{withDistance: ItemWithDistance{"c", 1.0}},
}))
expectResults(t, child, expectedCoverSet)
})
t.Run("promotes covering children at the requested level and excludes non-covering children", func(t *testing.T) {
var cs coverSet
cs.addLayer(makeCoverSetLayer([]itemWithChildren{
{withDistance: ItemWithDistance{"a", 0.0}, children: LevelsWithItems{items: map[int][]interface{}{3: {"c", "d"}}}},
{withDistance: ItemWithDistance{"b", 10.0}},
}))
mockDistFunc := func(a, b interface{}) float64 {
if a == "c" || b == "c" {
return 5.0
}
return 6.0
}
store := NewInMemoryStore(nil)
child, _, _ := cs.child("a", 5.0, 3, mockDistFunc, store.LoadChildren)
var expectedCoverSet coverSet
expectedCoverSet.totalItemCount = 1
expectedCoverSet.addLayer(makeCoverSetLayer([]itemWithChildren{
cs.layers[0][0],
}))
expectedCoverSet.addLayer(makeCoverSetLayer([]itemWithChildren{
{withDistance: ItemWithDistance{"c", 5.0}},
}))
expectResults(t, child, expectedCoverSet)
})
})
t.Run("closest()", func(t *testing.T) {
expectResults := func(t *testing.T, actualResults, expectedResults []ItemWithDistance) {
if expected, actual := len(expectedResults), len(actualResults); expected != actual {
t.Errorf("Expected %d results but found %d instead", expected, actual)
}
if len(expectedResults) < len(actualResults) {
for i, c := range expectedResults {
if expected, actual := c.Item, actualResults[i].Item; expected != actual {
t.Errorf("Expected result %d to be %v but was %v", i, expected, actual)
}
if expected, actual := c.Distance, actualResults[i].Distance; expected != actual {
t.Errorf("Expected result %d to have distance %g but was %g", i, expected, actual)
}
}
}
}
t.Run("returns the specified number of items from closest to furthest", func(t *testing.T) {
cs := coverSet{
layers: []coverSetLayer{
makeCoverSetLayer([]itemWithChildren{
{withDistance: ItemWithDistance{"a", 5.0}},
{withDistance: ItemWithDistance{"c", 3.0}},
{withDistance: ItemWithDistance{"b", 4.0}},
{withDistance: ItemWithDistance{"e", 1.0}},
{withDistance: ItemWithDistance{"d", 2.0}},
}),
},
}
results := cs.closest(3, math.MaxFloat64)
expectResults(t, results, []ItemWithDistance{
{"e", 1.0},
{"d", 2.0},
{"c", 3.0},
})
})
t.Run("returns all available results up to the number requested", func(t *testing.T) {
cs := coverSet{
layers: []coverSetLayer{
makeCoverSetLayer([]itemWithChildren{
{withDistance: ItemWithDistance{"a", 5.0}},
{withDistance: ItemWithDistance{"c", 3.0}},
{withDistance: ItemWithDistance{"b", 4.0}},
}),
},
}
results := cs.closest(4, math.MaxFloat64)
expectResults(t, results, []ItemWithDistance{
{"c", 3.0},
{"b", 4.0},
{"a", 5.0},
})
})
t.Run("returns all available results up to the distance limit", func(t *testing.T) {
cs := coverSet{
layers: []coverSetLayer{
makeCoverSetLayer([]itemWithChildren{
{withDistance: ItemWithDistance{"a", 5.0}},
{withDistance: ItemWithDistance{"c", 3.0}},
{withDistance: ItemWithDistance{"b", 4.0}},
}),
},
}
results := cs.closest(3, 4.0)
expectResults(t, results, []ItemWithDistance{
{"c", 3.0},
{"b", 4.0},
})
})
})
}