-
Notifications
You must be signed in to change notification settings - Fork 0
/
util.go
85 lines (74 loc) · 1.39 KB
/
util.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 edb
import (
"bytes"
"strings"
"go.etcd.io/bbolt"
)
func must[T any](v T, err error) T {
if err != nil {
panic(err)
}
return v
}
func ensure(err error) {
if err != nil {
panic(err)
}
}
func nonNil[T any](v *T) *T {
if v == nil {
panic("nil")
}
return v
}
func splitByte(s string, sep byte) (string, string, bool) {
i := strings.IndexByte(s, sep)
if i < 0 {
return s, "", false
} else {
return s[:i], s[i+1:], true
}
}
func rpad(s string, n int, pad rune) string {
rem := n - len(s)
if rem <= 0 {
return s
}
return s + strings.Repeat(string(pad), rem)
}
func boltSeek(c *bbolt.Cursor, prefix []byte, reverse bool) ([]byte, []byte) {
if reverse {
return boltSeekLast(c, prefix)
} else {
return c.Seek(prefix)
}
}
func boltSeekLast(c *bbolt.Cursor, prefix []byte) ([]byte, []byte) {
// NOTE: this could be made much faster by incrementing the prefix temporarily, but then we'd need to deal with overflow
k, _ := c.Seek(prefix)
if k == nil {
return nil, nil
}
for k != nil && bytes.HasPrefix(k, prefix) {
k, _ = c.Next()
}
if k == nil {
return c.Last()
} else {
return c.Prev()
}
}
func boltFirstLast(c *bbolt.Cursor, reverse bool) ([]byte, []byte) {
if reverse {
return c.Last()
} else {
return c.First()
}
}
func boltAdvance(c *bbolt.Cursor, reverse bool) ([]byte, []byte) {
if reverse {
return c.Prev()
} else {
return c.Next()
}
}