-
Notifications
You must be signed in to change notification settings - Fork 6
/
trie_test.go
170 lines (163 loc) · 2.97 KB
/
trie_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
package trie
import (
"testing"
"github.com/stretchr/testify/assert"
)
func TestCollect(t *testing.T) {
table := []struct {
name string
trie *Trie
dict []string
search string
expected []string
}{
{
name: "Valid Prefix",
dict: []string{"hello"},
trie: New(),
search: "h",
expected: []string{
"hello",
},
},
{
name: "Invalid Prefix",
dict: []string{"hello"},
trie: New(),
search: "x",
expected: []string{},
},
{
name: "With Fuzzy",
dict: []string{"hello"},
trie: New(),
search: "elo",
expected: []string{
"hello",
},
},
{
name: "Without Fuzzy",
dict: []string{"hello"},
trie: New().WithoutFuzzy(),
search: "elo",
expected: []string{},
},
{
name: "With Normalisation To",
dict: []string{"héllö"},
trie: New(),
search: "hello",
expected: []string{
"héllö",
},
},
{
name: "With Normalisation From",
dict: []string{"hello"},
trie: New(),
search: "héllö",
expected: []string{
"hello",
},
},
{
name: "Case Insensitive To",
dict: []string{"HeLlO"},
trie: New(),
search: "hello",
expected: []string{
"HeLlO",
},
},
{
name: "Case Insensitive From",
dict: []string{"hello"},
trie: New(),
search: "HeLlO",
expected: []string{
"hello",
},
},
{
name: "Case Sensitive To",
dict: []string{"HeLlO"},
trie: New().CaseSensitive(),
search: "hello",
expected: []string{},
},
{
name: "Case Sensitive From",
dict: []string{"hello"},
trie: New().CaseSensitive(),
search: "HeLlO",
expected: []string{},
},
{
name: "Default levenshtein",
dict: []string{"hello"},
trie: New(),
search: "hallo",
expected: []string{
"hello",
},
},
{
name: "No levenshtein",
dict: []string{"hello"},
trie: New().WithoutLevenshtein(),
search: "hallo",
expected: []string{},
},
{
name: "Custom levenshtein",
dict: []string{"hello"},
trie: New().CustomLevenshtein(map[uint8]uint8{
0: 0,
10: 1,
20: 2,
}),
search: "hallo",
expected: []string{},
},
}
for _, tt := range table {
t.Run(tt.name, func(t *testing.T) {
tt.trie.Insert(tt.dict...)
actual := tt.trie.SearchAll(tt.search)
assert.ElementsMatch(t, actual, tt.expected)
})
}
}
func BenchmarkInsert(b *testing.B) {
t := New()
b.ReportAllocs()
b.ResetTimer()
for n := 0; n < b.N; n++ {
t.Insert("hello")
}
}
// prevent compiler optimization
var result []string
func BenchmarkSearch(b *testing.B) {
t := New()
t.Insert("hallo you")
b.ReportAllocs()
b.ResetTimer()
var r []string
for n := 0; n < b.N; n++ {
r = t.Search("hello", 1)
}
result = r
}
func BenchmarkSearchAll(b *testing.B) {
t := New()
t.Insert("hallo you")
b.ReportAllocs()
b.ResetTimer()
var r []string
for n := 0; n < b.N; n++ {
r = t.SearchAll("hello")
}
result = r
}