-
Notifications
You must be signed in to change notification settings - Fork 0
/
utils.go
635 lines (555 loc) · 12.1 KB
/
utils.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
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
// SPDX-License-Identifier: Apache-2.0
// Copyright 2023 The Prime Citizens
package cli
import (
"io"
"math"
"strconv"
"strings"
"time"
"unicode/utf8"
"unsafe"
)
// noescape hides a pointer from escape analysis.
//
// see $GOROOT/src/runtime/stubs.go
//
//go:nosplit
func noescape[T any](p *T) *T {
x := uintptr(unsafe.Pointer(p)) // this line is required
return (*T)(unsafe.Pointer(x ^ 0))
}
func noescapeSlice[T any](p []T) (ret []T) {
ret = unsafe.Slice(noescape(unsafe.SliceData(p)), cap(p))
return ret[:len(p)]
}
// wstr writes string s to out without escaping content of s to heap.
func wstr(out io.Writer, s string) (int, error) {
return out.Write(unsafe.Slice(noescape(unsafe.StringData(s)), len(s)))
}
func callWriteFlagRule[R Rule](rule R, out io.Writer, args ...string) (int, error) {
return rule.WriteFlagRule(out, noescapeSlice(args)...)
}
func replaceFuncW(
w io.Writer,
text string,
match func(r rune) bool,
writeReplace func(w io.Writer, matched string) (int, error),
) (n int, err error) {
return replaceFuncWEx(
w, text, writeReplace, match, func(w io.Writer, matched string, writeReplace func(w io.Writer, matched string) (int, error)) (int, error) {
return writeReplace(w, matched)
},
)
}
// replaceFuncWEx is like replaceFuncWEx, but takes an extra argument.
func replaceFuncWEx[Arg any](
w io.Writer,
text string,
arg Arg,
match func(r rune) bool,
writeReplace func(w io.Writer, matched string, arg Arg) (int, error),
) (n int, err error) {
var (
x, lastMatchedIdx int
lastMismatchedIdx = len(text)
wasMatched = true
)
for i, c := range text {
if match(c) {
if !wasMatched {
// this matches, prev mismatched,
//
// i is the end of latest match
x, err = wstr(w, text[lastMatchedIdx:i])
n += x
if err != nil {
return
}
wasMatched = true
lastMismatchedIdx = i
}
} else {
if wasMatched {
// this mismatch, prev matched
//
// i is the end of latest mismatch
if lastMismatchedIdx < i {
x, err = writeReplace(w, text[lastMismatchedIdx:i], arg)
n += x
if err != nil {
return
}
}
lastMatchedIdx = i
wasMatched = false
}
}
}
if wasMatched {
x, err = writeReplace(w, text[lastMismatchedIdx:], arg)
} else {
x, err = wstr(w, text[lastMatchedIdx:])
}
n += x
return
}
type uinteger interface {
~uint | ~uint8 | ~uint16 | ~uint32 | ~uint64 | ~uintptr
}
type sinteger interface {
~int | ~int8 | ~int16 | ~int32 | ~int64
}
// integer is the type union of both signed and unsigned integers.
type integer interface {
uinteger | sinteger
}
// float is the type union of floating-point types.
type float interface {
~float32 | ~float64
}
// num is the type union of all number types.
type num interface {
integer | float | ~complex64 | ~complex128
}
// parseNum parses a string as number.
func parseNum(str string, assumeFloat bool) (neg bool, uv uint64, isFloat bool, err error) {
str, neg = strings.CutPrefix(str, "-")
if !assumeFloat {
uv, err = strconv.ParseUint(str, 0, 64)
if err == nil {
return neg, uv, false, nil
}
}
// maybe it's a float?
fv, err := strconv.ParseFloat(str, 64)
if err == nil {
return neg, math.Float64bits(fv), true, nil
}
return neg, math.Float64bits(math.NaN()), true, strconv.ErrSyntax
}
func parseDuration(s string, base time.Time) (neg bool, dur uint64, err error) {
var (
n = len(s)
start int
adjust int
unit uint64
uv uint64
x time.Time
uvneg bool
isFloat bool
c byte
)
for i := 0; i < n; i++ {
c = s[i]
switch c {
case 'y': // year
uvneg, uv, isFloat, err = parseNum(s[start:i+adjust], isFloat)
if err != nil {
return
}
if isFloat {
err = &ErrInvalidValue{
Type: "year (integer-only)",
Partial: true,
Value: s,
}
return
}
if uvneg {
x = base.AddDate(-int(uv), 0, 0)
neg, dur = uintPlus(neg, dur, true, uint64(base.Sub(x)))
} else {
x = base.AddDate(int(uv), 0, 0)
neg, dur = uintPlus(neg, dur, false, uint64(x.Sub(base)))
}
base = x
if i+1 < n && s[i+1] == 'r' {
// allow `yr`
i++
}
goto Reset
case 'm': // minute, month or ms
if i+1 < n {
i++
if s[i] == 's' {
// ms
unit = uint64(time.Millisecond)
adjust = -1
break
} else if s[i] != 't' {
// minute
unit = uint64(time.Minute)
i--
break
}
} else {
// minute
unit = uint64(time.Minute)
break
}
// month (mt)
adjust = -1
fallthrough
case 'M': // month
uvneg, uv, isFloat, err = parseNum(s[start:i+adjust], isFloat)
if err != nil {
return
}
if isFloat {
err = &ErrInvalidValue{
Type: "month (integer-only)",
Partial: true,
Value: s,
}
return
}
if uvneg {
x = base.AddDate(0, -int(uv), 0)
neg, dur = uintPlus(neg, dur, true, uint64(base.Sub(x)))
} else {
x = base.AddDate(0, int(uv), 0)
neg, dur = uintPlus(neg, dur, false, uint64(x.Sub(base)))
}
base = x
goto Reset
case '.': // 1.1s
if isFloat {
return false, 0, &ErrInvalidValue{
Type: "floating-point",
Partial: true,
Value: s,
}
}
isFloat = true
continue
default:
if c < '0' || c > '9' {
return false, 0, &ErrInvalidValue{
Type: "numeric",
Partial: true,
Value: s,
}
}
if i+1 != n {
continue
}
// no unit at the end, assume seconds
i++
fallthrough
case 's':
unit = uint64(time.Second)
case 'n':
if i+1 < n && s[i+1] == 's' {
unit = uint64(time.Nanosecond)
i++
adjust = -1
break
}
err = &ErrInvalidValue{
Type: "unit (ns)",
Partial: true,
Value: s,
}
return
case 'u':
if i+1 < n && s[i+1] == 's' {
unit = uint64(time.Microsecond)
i++
adjust = -1
break
}
err = &ErrInvalidValue{
Type: "unit (us)",
Partial: true,
Value: s,
}
return
case 'h':
unit = uint64(time.Hour)
if i+1 < n && s[i+1] == 'r' {
// allow `hr`
i++
adjust = -1
}
case 'd':
unit = uint64(time.Hour) * 24
case 'w':
unit = uint64(time.Hour) * 24 * 7
}
// got a unit
uvneg, uv, isFloat, err = parseNum(s[start:i+adjust], isFloat)
if err != nil {
return
}
if isFloat {
neg, dur = uintPlus(neg, dur, uvneg, uint64(math.Float64frombits(uv)*float64(unit)))
} else {
neg, dur = uintPlus(neg, dur, uvneg, uv*unit)
}
Reset:
start, isFloat, adjust = i+1, false, 0
}
return
}
// parseTime parses time string s in following format preference
//
// - 15:04
// - 2006-01-02
// - 2006-01-02T15:04:05
// - 2006-01-02T15:04:05Z07:00
// - 15:04:05
// - 15
func parseTime(s string, base time.Time) (t time.Time, err error) {
loc := base.Location()
// clock: hour:min
t, err = time.ParseInLocation("15:04", s, loc)
if err == nil {
y, mt, d := base.Date()
hr, m, sec := t.Clock()
return time.Date(y, mt, d, hr, m, sec, 0, loc), nil
}
// date without time
t, err = time.ParseInLocation("2006-01-02", s, loc)
if err == nil {
return
}
// date without timezone
t, err = time.ParseInLocation("2006-01-02T15:04:05", s, loc)
if err == nil {
return
}
// date with timezone
t, err = time.ParseInLocation(time.RFC3339, s, loc)
if err == nil {
return t.In(loc), nil
}
// clock: hour:min:sec
t, err = time.ParseInLocation("15:04:05", s, loc)
if err == nil {
y, mt, d := base.Date()
hr, m, sec := t.Clock()
return time.Date(y, mt, d, hr, m, sec, 0, loc), nil
}
// clock: hour
t, err = time.ParseInLocation("15", s, loc)
if err == nil {
y, mt, d := base.Date()
return time.Date(y, mt, d, t.Hour(), 0, 0, 0, loc), nil
}
err = &ErrInvalidValue{
Type: "time",
Value: s,
}
return
}
// parseSize parses a size string with units like K, G, TB... to an int64 with
// byte as the unit.
func parseSize(s string) (neg bool, sz uint64, err error) {
var (
start int
uv uint64
uvneg bool
isFloat bool
hasDot bool
c byte
)
for i := 0; i < len(s); i++ {
c = s[i]
switch c {
default:
if c < '0' || c > '9' {
return false, 0, &ErrInvalidValue{
Type: "numeric",
Partial: true,
Value: s,
}
}
if i+1 != len(s) {
continue
}
// no unit at the end, assume byte
c = 'b'
i++
fallthrough
case 'B', 'b', 'K', 'k', 'M', 'm', 'G', 'g', 'T', 't', 'P', 'p', 'E', 'e':
if i == 0 {
return false, 0, &ErrInvalidValue{
Type: "numeric",
Partial: true,
Value: s,
}
}
uvneg, uv, isFloat, err = parseNum(s[start:i], hasDot)
if err != nil {
return
}
if isFloat {
neg, sz = uintPlus(neg, sz, uvneg, uint64(math.Float64frombits(uv)*float64(sizeUnitInteger(c))))
} else {
neg, sz = uintPlus(neg, sz, uvneg, uv*sizeUnitInteger(c))
}
if i+1 < len(s) {
switch s[i+1] {
case 'B', 'b':
i++
}
}
start, hasDot = i+1, false
case '.': // 1.1g
if hasDot {
return false, 0, &ErrInvalidValue{
Type: "floating-point",
Partial: true,
Value: s,
}
}
hasDot = true
}
}
return
}
func uintPlus(aNeg bool, aVal uint64, bNeg bool, bVal uint64) (bool, uint64) {
switch {
case aNeg && bNeg, !aNeg && !bNeg:
return aNeg, aVal + bVal
case aNeg && !bNeg:
if bVal > aVal {
return false, bVal - aVal
}
return true, aVal - bVal
case !aNeg && bNeg:
if aVal > bVal {
return false, aVal - bVal
}
return true, bVal - aVal
}
panic("unreachable")
}
func sizeUnitInteger(c byte) uint64 {
const (
B = 1
KB = 1024 * B
MB = 1024 * KB
GB = 1024 * MB
TB = 1024 * GB
PB = 1024 * TB
EB = 1024 * PB
)
switch c {
case 'B', 'b':
return B
case 'K', 'k':
return KB
case 'M', 'm':
return MB
case 'G', 'g':
return GB
case 'T', 't':
return TB
case 'P', 'p':
return PB
case 'E', 'e':
return EB
default:
return 0 // overflow
}
}
func sizeUnitText(i int) byte {
switch i {
case 1:
return 'K'
case 2:
return 'M'
case 3:
return 'G'
case 4:
return 'T'
case 5:
return 'P'
case 6:
return 'E'
default:
return 0 // overflow
}
}
const (
sizeStaticLev = 64
)
// isSimilar returns true if the Levenshtein distance between known and
// toCompare is less than min(3, len(known)).
//
// The result can only be true when min(len(known), min(toCompare)) < 64.
func isSimilar(known, toCompare string, nocase bool) bool {
switch {
case len(known) == 0:
return len(toCompare) == 0
case len(toCompare) == 0:
return len(known) < 3
case len(known) < sizeStaticLev:
// optimize for more inner loop.
if len(toCompare) < len(known) {
return max63Lev(toCompare, known, nocase) < min(3, len(known))
} else {
return max63Lev(known, toCompare, nocase) < min(3, len(known))
}
case len(toCompare) < sizeStaticLev:
return max63Lev(known, toCompare, nocase) < min(3, len(known))
default:
return false
}
}
// levenshteinDistance returns the Levenshtein distance between two strings.
//
// len(max63) < 64 is assumed.
func max63Lev(y, max63 string, nocase bool) int {
var (
runeX, runeY rune
dX, dY, col, offX int
buf = [2][sizeStaticLev]int{
0: {
0, 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,
},
1: {0: 1},
}
mat = [2][]int{
0: buf[0][:],
1: buf[1][:],
}
)
for row, offY := 1, 0; offY < len(y); row, offY = row+1, offY+dY {
if runeY = rune(y[offY]); runeY < utf8.RuneSelf {
dY = 1
} else {
runeY, dY = utf8.DecodeRuneInString(y[offY:])
}
mat[0][0] = row
for col, offX = 1, 0; offX < len(max63); col, offX = col+1, offX+dX {
if runeX = rune(max63[offX]); runeX < utf8.RuneSelf {
dX = 1
} else {
runeX, dX = utf8.DecodeRuneInString(max63[offX:])
}
if (!nocase && runeX == runeY) ||
(nocase && strings.EqualFold(y[offY:offY+dY], max63[offX:offX+dX])) {
mat[1][col] = mat[0][col-1]
continue
}
mat[1][col] = min(min(mat[0][col], mat[1][col-1]), mat[0][col-1]) + 1
}
mat[0], mat[1] = mat[1], mat[0]
}
return mat[0][col-1]
}
func min(a, b int) int {
if a < b {
return a
}
return b
}