forked from rivo/uniseg
-
Notifications
You must be signed in to change notification settings - Fork 0
/
word_test.go
151 lines (146 loc) · 3.8 KB
/
word_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
package uniseg
import "testing"
// Test all official Unicode test cases for word boundaries using the byte slice
// function.
func TestWordCasesBytes(t *testing.T) {
for testNum, testCase := range wordBreakTestCases {
/*t.Logf(`Test case %d %q: Expecting %x, getting %x, code points %x"`,
testNum,
strings.TrimSpace(testCase.original),
testCase.expected,
decomposed(testCase.original),
[]rune(testCase.original))*/
var (
word []byte
index int
)
state := -1
b := []byte(testCase.original)
WordLoop:
for index = 0; len(b) > 0; index++ {
if index >= len(testCase.expected) {
t.Errorf(`Test case %d %q failed: More words %d returned than expected %d`,
testNum,
testCase.original,
index,
len(testCase.expected))
break
}
word, b, state = FirstWord(b, state)
cluster := []rune(string(word))
if len(cluster) != len(testCase.expected[index]) {
t.Errorf(`Test case %d %q failed: Word at index %d has %d codepoints %x, %d expected %x`,
testNum,
testCase.original,
index,
len(cluster),
cluster,
len(testCase.expected[index]),
testCase.expected[index])
break
}
for i, r := range cluster {
if r != testCase.expected[index][i] {
t.Errorf(`Test case %d %q failed: Word at index %d is %x, expected %x`,
testNum,
testCase.original,
index,
cluster,
testCase.expected[index])
break WordLoop
}
}
}
if index < len(testCase.expected) {
t.Errorf(`Test case %d %q failed: Fewer words returned (%d) than expected (%d)`,
testNum,
testCase.original,
index,
len(testCase.expected))
}
}
}
// Test all official Unicode test cases for word boundaries using the string
// function.
func TestWordCasesString(t *testing.T) {
for testNum, testCase := range wordBreakTestCases {
/*t.Logf(`Test case %d %q: Expecting %x, getting %x, code points %x"`,
testNum,
strings.TrimSpace(testCase.original),
testCase.expected,
decomposed(testCase.original),
[]rune(testCase.original))*/
var (
word string
index int
)
state := -1
str := testCase.original
WordLoop:
for index = 0; len(str) > 0; index++ {
if index >= len(testCase.expected) {
t.Errorf(`Test case %d %q failed: More words %d returned than expected %d`,
testNum,
testCase.original,
index,
len(testCase.expected))
break
}
word, str, state = FirstWordInString(str, state)
cluster := []rune(string(word))
if len(cluster) != len(testCase.expected[index]) {
t.Errorf(`Test case %d %q failed: Word at index %d has %d codepoints %x, %d expected %x`,
testNum,
testCase.original,
index,
len(cluster),
cluster,
len(testCase.expected[index]),
testCase.expected[index])
break
}
for i, r := range cluster {
if r != testCase.expected[index][i] {
t.Errorf(`Test case %d %q failed: Word at index %d is %x, expected %x`,
testNum,
testCase.original,
index,
cluster,
testCase.expected[index])
break WordLoop
}
}
}
if index < len(testCase.expected) {
t.Errorf(`Test case %d %q failed: Fewer words returned (%d) than expected (%d)`,
testNum,
testCase.original,
index,
len(testCase.expected))
}
}
}
// Benchmark the use of the word break function for byte slices.
func BenchmarkWordFunctionBytes(b *testing.B) {
str := []byte(benchmarkStr)
for i := 0; i < b.N; i++ {
var c []byte
state := -1
for len(str) > 0 {
c, str, state = FirstWord(str, state)
resultRunes = []rune(string(c))
}
}
}
// Benchmark the use of the word break function for strings.
func BenchmarkWordFunctionString(b *testing.B) {
str := benchmarkStr
for i := 0; i < b.N; i++ {
var c string
state := -1
for len(str) > 0 {
c, str, state = FirstWordInString(str, state)
resultRunes = []rune(c)
}
}
}