-
Notifications
You must be signed in to change notification settings - Fork 0
/
spellchebk_test.go
193 lines (175 loc) · 3.8 KB
/
spellchebk_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 spellchebk
import (
"bytes"
"encoding/gob"
"reflect"
"testing"
)
func TestTrueDLDistance(t *testing.T) {
tt := []struct {
name string
word1 string
word2 string
expected int
}{
{
name: "letters",
word1: "CA",
word2: "ABC",
expected: 2,
},
{
name: "neat",
word1: "testing",
word2: "isneat",
expected: 6,
},
{
name: "sports",
word1: "touchdown",
word2: "downtouch",
expected: 8,
},
{
name: "number words",
word1: "seven",
word2: "eight",
expected: 5,
},
}
for _, tc := range tt {
t.Run(tc.name, func(t *testing.T) {
result := TrueDLDistance(tc.word1, tc.word2)
if result != tc.expected {
t.Errorf("expected %d but got %d for distance between %s and %s", tc.expected, result, tc.word1, tc.word2)
}
})
}
}
func TestAdd(t *testing.T) {
tree := BKtree{}
tree.add("sail", TrueDLDistance)
tree.add("mail", TrueDLDistance)
tree.add("rail", TrueDLDistance)
tree.add("snape", TrueDLDistance)
// tree should look like this now
// sail
// / \
// 1 3
// / \
// mail snape
// /
// 1
// /
// rail
if tree.Word != "sail" {
t.Error("expected \"sail\" to be the root")
}
if tree.Children[0].Word != "mail" {
t.Error("expected \"mail\" to be the 0th child of the root")
}
if tree.Children[0].Children[0].Word != "rail" {
t.Error("expected \"rail\" to be the 0th child of the 0th child of the root")
}
if tree.Children[1].Word != "snape" {
t.Error("expected \"snape\" to be the 1st child of the root")
}
err := tree.add("snape", TrueDLDistance)
if err == nil {
t.Error("expected adding \"snape\", which is already in the tree, to throw an error")
}
}
func TestSearch(t *testing.T) {
c := NewSpellChecker()
c.Add("sail") // sail is the root
c.Add("mail") // mail has a dist of 1 (depending on distfunc)
c.Add("rail") // rail has a dist of 1 (depending on distfunc)
c.Add("snape") // snape has a dist of 3 (depending on distfunc)
c.Add("far off") // far off has a dist of 6 (depending on distfunc)
tt := []struct {
query string
tolerance int
expected []SearchResult
}{
{
query: "nail",
tolerance: 1,
expected: []SearchResult{
{
Word: "sail",
Distance: 1,
},
{
Word: "mail",
Distance: 1,
},
{
Word: "rail",
Distance: 1,
},
},
},
{
query: "snape",
tolerance: 0,
expected: []SearchResult{
{
Word: "snape",
Distance: 0,
},
},
},
{
query: "rail",
tolerance: 0,
expected: []SearchResult{
{
Word: "rail",
Distance: 0,
},
},
},
{
query: "not here",
tolerance: 0,
expected: nil,
},
}
for _, tc := range tt {
t.Run(tc.query, func(t *testing.T) {
result := c.Search(tc.query, tc.tolerance)
if !reflect.DeepEqual(result, tc.expected) {
t.Errorf("search for \"%s\" expected: %v got: %v", tc.query, tc.expected, result)
}
})
}
}
func TestGob(t *testing.T) {
encode := NewSpellChecker()
encode.Add("test123")
var b bytes.Buffer
e := gob.NewEncoder(&b)
d := gob.NewDecoder(&b)
err := e.Encode(encode)
if err != nil {
t.Errorf("failed to encode to gob: %s", err)
}
encode.Search("thing", 1)
if err != nil {
t.Errorf("failed search encoded: %s", err)
}
var decode *SpellChecker
err = d.Decode(&decode)
if err != nil {
t.Errorf("failed to decode to gob: %s", err)
}
// Because gob can't encode functions you must set the distance func again
decode.DistanceFunc = TrueDLDistance
decode.Search("thing", 1)
if err != nil {
t.Errorf("failed search decode: %s", err)
}
if !reflect.DeepEqual(encode.Tree, decode.Tree) {
t.Errorf("decoded gob does not match original, expected: %v got: %v", encode, decode)
}
}