-
Notifications
You must be signed in to change notification settings - Fork 0
/
coversetlayer_test.go
121 lines (101 loc) · 3.74 KB
/
coversetlayer_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
package covertree
import (
"math/rand"
"sort"
"testing"
)
func TestCoverSetLayer(t *testing.T) {
t.Run("constrainedToDistance()", func(t *testing.T) {
t.Run("returns a new coverSetLayer containing only items within the specified distance", func(t *testing.T) {
items := []itemWithChildren{
{
withDistance: ItemWithDistance{
Item: "item1",
Distance: 0.0,
},
},
{
withDistance: ItemWithDistance{
Item: "item2",
Distance: 1.0,
},
},
{
withDistance: ItemWithDistance{
Item: "item3",
Distance: 2.0,
},
},
}
layer := makeCoverSetLayer(items)
result := layer.constrainedToDistance(1.0)
if expected, actual := 2, len(result); expected != actual {
t.Fatalf("Expected constrained layer to contain %d items but found %d", expected, actual)
}
for i := range result {
if expected, actual := items[i], result[i]; expected.withDistance.Item != actual.withDistance.Item {
t.Errorf("Expected '%s' with distance %v to be in position %d but found %s with distance %v instead", expected.withDistance.Item, expected.withDistance.Distance, i, actual.withDistance.Item, actual.withDistance.Distance)
}
}
result = layer.constrainedToDistance(1.5)
if expected, actual := 2, len(result); expected != actual {
t.Fatalf("Expected constrained layer to contain %d items but found %d", expected, actual)
}
for i := range result {
if expected, actual := items[i], result[i]; expected.withDistance.Item != actual.withDistance.Item {
t.Errorf("Expected '%s' with distance %v to be in position %d but found %s with distance %v instead", expected.withDistance.Item, expected.withDistance.Distance, i, actual.withDistance.Item, actual.withDistance.Distance)
}
}
result = layer.constrainedToDistance(0.99)
if expected, actual := 1, len(result); expected != actual {
t.Fatalf("Expected constrained layer to contain %d items but found %d", expected, actual)
}
for i := range result {
if expected, actual := items[i], result[i]; expected.withDistance.Item != actual.withDistance.Item {
t.Errorf("Expected '%s' with distance %v to be in position %d but found %s with distance %v instead", expected.withDistance.Item, expected.withDistance.Distance, i, actual.withDistance.Item, actual.withDistance.Distance)
}
}
})
})
t.Run("makeCoverSetLayer()", func(t *testing.T) {
t.Run("creates layer with items in sorted order by distance", func(t *testing.T) {
items := []itemWithChildren{
{
withDistance: ItemWithDistance{
Item: "item1",
Distance: rand.Float64(),
},
},
{
withDistance: ItemWithDistance{
Item: "item2",
Distance: rand.Float64(),
},
},
{
withDistance: ItemWithDistance{
Item: "item3",
Distance: rand.Float64(),
},
},
}
rand.Shuffle(len(items), func(i, j int) {
items[i], items[j] = items[j], items[i]
})
layer := makeCoverSetLayer(items)
itemsSorted := make([]itemWithChildren, len(items))
copy(itemsSorted, items)
sort.Slice(itemsSorted, func(i, j int) bool {
return itemsSorted[i].withDistance.Distance < itemsSorted[j].withDistance.Distance
})
if expected, actual := len(items), len(layer); expected != actual {
t.Fatalf("Expected cover set layer to contain %d items but found %d", expected, actual)
}
for i, expected := range itemsSorted {
if actual := layer[i]; expected.withDistance.Item != actual.withDistance.Item {
t.Errorf("Expected '%s' with distance %v to be in position %d but found %s with distance %v instead", expected.withDistance.Item, expected.withDistance.Distance, i, actual.withDistance.Item, actual.withDistance.Distance)
}
}
})
})
}