-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathedit_test.go
86 lines (61 loc) · 1.2 KB
/
edit_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
package main
import (
"testing"
)
func TestLevenshtein(t *testing.T) {
var words = []struct{
first string
second string
dist int
}{
{"california", "California", 1},
{"rules", "ralse", 3},
}
for _, word := range words {
out := Levenshtein(word.first, word.second)
if out != word.dist {
t.Errorf("should be %d, got %d", word.dist, out)
}
}
}
var result int
func BenchmarkLevenshtein(b *testing.B) {
var r int
for n:= 0; n < b.N; n++ {
r = Levenshtein("asdfadsf", "lkjlkjhjhlkjl")
}
result = r
}
func TestLevenshteinNew(t *testing.T) {
var words = []struct{
first string
second string
dist int
}{
{"california", "California", 1},
{"rules", "ralse", 3},
}
for _, word := range words {
out := LevenshteinNew(word.first, word.second)
if out != word.dist {
t.Errorf("should be %d, got %d", word.dist, out)
}
}
}
func BenchmarkLevenshteinNew(b *testing.B) {
var r int
for n:= 0; n < b.N; n++ {
r = LevenshteinNew("asdfadsf", "lkjlkjhjhlkjl")
}
result = r
}
func Testmin(t *testing.T) {
}
func TestEdit(t *testing.T) {
}
func TestPrettyPrint(t *testing.T) {
}
func TestGenerateLevenshteinRules(t *testing.T) {
}
func TestReverseRecurse(t *testing.T) {
}