forked from apaxa-go/helper
-
Notifications
You must be signed in to change notification settings - Fork 0
/
word-gen.go
545 lines (472 loc) · 11.9 KB
/
word-gen.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
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
//replacer:generated-file
package boundaryh
// Computes first wSequence.
// Returns:
// "c" - wSequence class (see "wSequence rules").
// "pos" - point to first rune of next sequence (in other words "pos" is length of current wSequence).
func wFirstSequenceInString(s string) (c wClass, pos int) {
l := len(s)
if l == 0 {
return wClassOther, 0
}
if l > 1 && s[0] == crRune && s[1] == lfRune { // WB3
return wClassNewline, 2
}
c, pos = wFirstClassInString(s)
if l == 1 {
return
}
if c == wClassZWJ {
c1, delta := wFirstClassInString(s[pos:])
if c1 == wClassGlueAfterZWJ || c1 == wClassEBG { // WB3c
c = c1
pos += delta
}
}
if c == wClassNewline {
return
}
l1 := wClassOther
l1Pos := 0
for pos < l { // WB4
l0, delta := wFirstClassInString(s[pos:])
switch {
case l1 == wClassZWJ && (l0 == wClassGlueAfterZWJ || l0 == wClassEBG): // preserve following WB3c
pos = l1Pos
return
case !l0.isWB4():
return
}
l1 = l0
l1Pos = pos
pos += delta
}
return
}
// Computes last wSequence.
// Analogue to wFirstSequenceInString.
// "pos" points to first rune in sequence.
func wLastSequenceInString(s string) (c wClass, pos int) {
l := len(s)
if l == 0 {
return wClassOther, 0
}
if l > 1 && s[l-2] == crRune && s[l-1] == lfRune { // WB3
return wClassNewline, l - 2
}
c, pos = wLastClassInString(s)
if pos == 0 {
return
}
for pos > 0 && c.isWB4() { // WB4
c, pos = wLastClassInString(s[:pos])
}
if (c == wClassGlueAfterZWJ || c == wClassEBG) && pos > 0 { // WB3c
c1, pos1 := wLastClassInString(s[:pos])
if c1 == wClassZWJ {
pos = pos1
}
}
return
}
// Returns position at which it is safe to begin analysis.
func wSequenceBeginInString(s string, pos int) int {
pos = toRuneBeginInString(s, pos)
if pos == 0 {
return 0
}
c, cDelta := wFirstClassInString(s[pos:])
l0, l0Pos := wLastClassInString(s[:pos])
r0 := wClassOther
if pos+cDelta < len(s) {
r0, _ = wFirstClassInString(s[pos+cDelta:])
}
switch {
case s[pos-1] == crRune && s[pos] == lfRune: // WB3
pos--
case c == wClassZWJ && (r0 == wClassGlueAfterZWJ || r0 == wClassEBG): // WB3c
case l0 == wClassZWJ && (c == wClassGlueAfterZWJ || c == wClassEBG): // WB3c
pos = l0Pos
case c.isWB4(): // WB4
for pos > 0 {
c, l0Pos = wLastClassInString(s[:pos])
if c == wClassNewline {
break
}
pos = l0Pos
if !c.isWB4() {
break
}
}
}
return pos
}
// True if l0 is RI and it opens RI sequence in string <s..., l0, ...> (may be joined with next RI).
func wIsOpenRIInString(s string, l1, l0 wClass) (r bool) {
r = l0 == wClassRI
if !r {
return
}
r = l1 != wClassRI
if r {
return
}
for len(s) > 0 {
c, pos := wLastSequenceInString(s)
if c != wClassRI {
break
}
r = !r
s = s[:pos]
}
return
}
// s must be valid (len>1).
// l0Pos must be valid (in s; really begin of sequence).
func wordEndInString(s string, l0Pos int) int {
l := len(s)
l1, l1Pos := wLastSequenceInString(s[:l0Pos])
l0, r0Delta := wFirstSequenceInString(s[l0Pos:])
lOddRI := wIsOpenRIInString(s[:l1Pos], l1, l0)
r0Pos := l0Pos + r0Delta
r0, r1Delta := wFirstSequenceInString(s[r0Pos:])
for r0Pos < l {
r1, r2Delta := wFirstSequenceInString(s[r0Pos+r1Delta:])
if wDecision(l1, l0, lOddRI, r0, r1) {
return r0Pos
}
l1 = l0
l0 = r0
r0 = r1
r0Pos += r1Delta
r1Delta = r2Delta
lOddRI = l0 == wClassRI && !lOddRI
}
return l
}
// WordEndInString computes word which contains pos-th rune.
// Returns (index of word's last rune)+1.
// In other words, returns first word's boundary on the right of pos-th rune.
func WordEndInString(s string, pos int) int {
l := len(s)
if pos < 0 || pos >= l {
return InvalidPos
}
if pos == l-1 {
return l
}
pos = wSequenceBeginInString(s, pos)
return wordEndInString(s, pos)
}
// s must be valid (len>1).
// r0Pos must be valid (in s; really begin of sequence).
func wordBeginInString(s string, r0Pos int) int {
r0, r1Delta := wFirstSequenceInString(s[r0Pos:])
r1, _ := wFirstSequenceInString(s[r0Pos+r1Delta:])
l0, l0Pos := wLastSequenceInString(s[:r0Pos])
for r0Pos >= 0 {
l1, l1Pos := wLastSequenceInString(s[:l0Pos])
lOddRI := wIsOpenRIInString(s[:l1Pos], l1, l0)
if wDecision(l1, l0, lOddRI, r0, r1) {
return r0Pos
}
r1 = r0
r0 = l0
l0 = l1
r0Pos = l0Pos
l0Pos = l1Pos
}
return 0
}
// WordBeginInString computes word which contains pos-th rune.
// Returns word's first rune index.
// In other words, returns first word's boundary on the left of pos-th rune.
func WordBeginInString(s string, pos int) int {
l := len(s)
if pos < 0 || pos >= l {
return InvalidPos
}
if pos == 0 {
return 0
}
pos = wSequenceBeginInString(s, pos)
return wordBeginInString(s, pos)
}
// FirstWordInString computes first word.
// Returns (index of word's last rune)+1.
// Result also may be treated as length of the first word.
// First word may retrieved by "s[:r]".
func FirstWordInString(s string) int {
return WordEndInString(s, 0)
}
// LastWordInString computes last word.
// Returns index of word's first rune.
// Last word may retrieved by "s[r:]".
func LastWordInString(s string) int {
return WordBeginInString(s, len(s)-1)
}
// WordAtInString computes word which contains pos-th rune and return their boundary.
// word may retrieved by "s[r.From:r.To]".
func WordAtInString(s string, pos int) Boundary {
return Boundary{WordBeginInString(s, pos), WordEndInString(s, pos)}
}
// WordsInString computes all words and returns theirs boundaries.
func WordsInString(s string) (boundaries []Boundary) {
boundaries = make([]Boundary, 0, len(s)) // TODO memory efficient
for pos := 0; pos < len(s); {
length := FirstWordInString(s[pos:])
boundaries = append(boundaries, Boundary{pos, pos + length})
pos += length
}
return
}
// WordBreaksInString computes all words and returns all breaks.
func WordBreaksInString(s string) (breaks []int) {
l := len(s)
if l == 0 {
return
}
breaks = make([]int, 1, len(s)) // TODO memory efficient
breaks[0] = 0
for pos := 0; pos < l; {
length := FirstWordInString(s[pos:])
pos += length
breaks = append(breaks, pos)
}
return
}
// Computes first wSequence.
// Returns:
// "c" - wSequence class (see "wSequence rules").
// "pos" - point to first rune of next sequence (in other words "pos" is length of current wSequence).
func wFirstSequence(bytes []byte) (c wClass, pos int) {
l := len(bytes)
if l == 0 {
return wClassOther, 0
}
if l > 1 && bytes[0] == crRune && bytes[1] == lfRune { // WB3
return wClassNewline, 2
}
c, pos = wFirstClass(bytes)
if l == 1 {
return
}
if c == wClassZWJ {
c1, delta := wFirstClass(bytes[pos:])
if c1 == wClassGlueAfterZWJ || c1 == wClassEBG { // WB3c
c = c1
pos += delta
}
}
if c == wClassNewline {
return
}
l1 := wClassOther
l1Pos := 0
for pos < l { // WB4
l0, delta := wFirstClass(bytes[pos:])
switch {
case l1 == wClassZWJ && (l0 == wClassGlueAfterZWJ || l0 == wClassEBG): // preserve following WB3c
pos = l1Pos
return
case !l0.isWB4():
return
}
l1 = l0
l1Pos = pos
pos += delta
}
return
}
// Computes last wSequence.
// Analogue to wFirstSequence.
// "pos" points to first rune in sequence.
func wLastSequence(bytes []byte) (c wClass, pos int) {
l := len(bytes)
if l == 0 {
return wClassOther, 0
}
if l > 1 && bytes[l-2] == crRune && bytes[l-1] == lfRune { // WB3
return wClassNewline, l - 2
}
c, pos = wLastClass(bytes)
if pos == 0 {
return
}
for pos > 0 && c.isWB4() { // WB4
c, pos = wLastClass(bytes[:pos])
}
if (c == wClassGlueAfterZWJ || c == wClassEBG) && pos > 0 { // WB3c
c1, pos1 := wLastClass(bytes[:pos])
if c1 == wClassZWJ {
pos = pos1
}
}
return
}
// Returns position at which it is safe to begin analysis.
func wSequenceBegin(bytes []byte, pos int) int {
pos = toRuneBegin(bytes, pos)
if pos == 0 {
return 0
}
c, cDelta := wFirstClass(bytes[pos:])
l0, l0Pos := wLastClass(bytes[:pos])
r0 := wClassOther
if pos+cDelta < len(bytes) {
r0, _ = wFirstClass(bytes[pos+cDelta:])
}
switch {
case bytes[pos-1] == crRune && bytes[pos] == lfRune: // WB3
pos--
case c == wClassZWJ && (r0 == wClassGlueAfterZWJ || r0 == wClassEBG): // WB3c
case l0 == wClassZWJ && (c == wClassGlueAfterZWJ || c == wClassEBG): // WB3c
pos = l0Pos
case c.isWB4(): // WB4
for pos > 0 {
c, l0Pos = wLastClass(bytes[:pos])
if c == wClassNewline {
break
}
pos = l0Pos
if !c.isWB4() {
break
}
}
}
return pos
}
// True if l0 is RI and it opens RI sequence in string <bytes..., l0, ...> (may be joined with next RI).
func wIsOpenRI(bytes []byte, l1, l0 wClass) (r bool) {
r = l0 == wClassRI
if !r {
return
}
r = l1 != wClassRI
if r {
return
}
for len(bytes) > 0 {
c, pos := wLastSequence(bytes)
if c != wClassRI {
break
}
r = !r
bytes = bytes[:pos]
}
return
}
// bytes must be valid (len>1).
// l0Pos must be valid (in bytes; really begin of sequence).
func wordEnd(bytes []byte, l0Pos int) int {
l := len(bytes)
l1, l1Pos := wLastSequence(bytes[:l0Pos])
l0, r0Delta := wFirstSequence(bytes[l0Pos:])
lOddRI := wIsOpenRI(bytes[:l1Pos], l1, l0)
r0Pos := l0Pos + r0Delta
r0, r1Delta := wFirstSequence(bytes[r0Pos:])
for r0Pos < l {
r1, r2Delta := wFirstSequence(bytes[r0Pos+r1Delta:])
if wDecision(l1, l0, lOddRI, r0, r1) {
return r0Pos
}
l1 = l0
l0 = r0
r0 = r1
r0Pos += r1Delta
r1Delta = r2Delta
lOddRI = l0 == wClassRI && !lOddRI
}
return l
}
// WordEnd computes word which contains pos-th rune.
// Returns (index of word's last rune)+1.
// In other words, returns first word's boundary on the right of pos-th rune.
func WordEnd(bytes []byte, pos int) int {
l := len(bytes)
if pos < 0 || pos >= l {
return InvalidPos
}
if pos == l-1 {
return l
}
pos = wSequenceBegin(bytes, pos)
return wordEnd(bytes, pos)
}
// bytes must be valid (len>1).
// r0Pos must be valid (in bytes; really begin of sequence).
func wordBegin(bytes []byte, r0Pos int) int {
r0, r1Delta := wFirstSequence(bytes[r0Pos:])
r1, _ := wFirstSequence(bytes[r0Pos+r1Delta:])
l0, l0Pos := wLastSequence(bytes[:r0Pos])
for r0Pos >= 0 {
l1, l1Pos := wLastSequence(bytes[:l0Pos])
lOddRI := wIsOpenRI(bytes[:l1Pos], l1, l0)
if wDecision(l1, l0, lOddRI, r0, r1) {
return r0Pos
}
r1 = r0
r0 = l0
l0 = l1
r0Pos = l0Pos
l0Pos = l1Pos
}
return 0
}
// WordBegin computes word which contains pos-th rune.
// Returns word's first rune index.
// In other words, returns first word's boundary on the left of pos-th rune.
func WordBegin(bytes []byte, pos int) int {
l := len(bytes)
if pos < 0 || pos >= l {
return InvalidPos
}
if pos == 0 {
return 0
}
pos = wSequenceBegin(bytes, pos)
return wordBegin(bytes, pos)
}
// FirstWord computes first word.
// Returns (index of word's last rune)+1.
// Result also may be treated as length of the first word.
// First word may retrieved by "bytes[:r]".
func FirstWord(bytes []byte) int {
return WordEnd(bytes, 0)
}
// LastWord computes last word.
// Returns index of word's first rune.
// Last word may retrieved by "bytes[r:]".
func LastWord(bytes []byte) int {
return WordBegin(bytes, len(bytes)-1)
}
// WordAt computes word which contains pos-th rune and return their boundary.
// word may retrieved by "bytes[r.From:r.To]".
func WordAt(bytes []byte, pos int) Boundary {
return Boundary{WordBegin(bytes, pos), WordEnd(bytes, pos)}
}
// Words computes all words and returns theirs boundaries.
func Words(bytes []byte) (boundaries []Boundary) {
boundaries = make([]Boundary, 0, len(bytes)) // TODO memory efficient
for pos := 0; pos < len(bytes); {
length := FirstWord(bytes[pos:])
boundaries = append(boundaries, Boundary{pos, pos + length})
pos += length
}
return
}
// WordBreaks computes all words and returns all breaks.
func WordBreaks(bytes []byte) (breaks []int) {
l := len(bytes)
if l == 0 {
return
}
breaks = make([]int, 1, len(bytes)) // TODO memory efficient
breaks[0] = 0
for pos := 0; pos < l; {
length := FirstWord(bytes[pos:])
pos += length
breaks = append(breaks, pos)
}
return
}