-
Notifications
You must be signed in to change notification settings - Fork 0
/
tx.go
173 lines (151 loc) · 3.44 KB
/
tx.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
package redibolt
import (
bolt "go.etcd.io/bbolt"
"golang.org/x/exp/maps"
)
func NewTx(tx *bolt.Tx) Tx {
return &rtx{tx}
}
type rtx struct {
boltTx *bolt.Tx
}
func (t *rtx) DEL(key ...string) (err error) {
for _, k := range key {
_ = t.boltTx.DeleteBucket([]byte(k))
}
return
}
func (t *rtx) HDEL(key string, field string) (err error) {
b := t.boltTx.Bucket([]byte(key))
if b == nil {
return
}
return t.boltTx.Bucket([]byte(key)).Delete([]byte(field))
}
func (t *rtx) HEXISTS(key string, field string) (exists bool, err error) {
b := t.boltTx.Bucket([]byte(key))
if b == nil {
return
}
return b.Get([]byte(field)) != nil, nil
}
func (t *rtx) HGET(key string, field string) (val string, err error) {
b := t.boltTx.Bucket([]byte(key))
if b == nil {
return
}
return string(b.Get([]byte(field))), nil
}
func (t *rtx) HGETALL(key string) (kvMap map[string]string, err error) {
kvMap = make(map[string]string)
b := t.boltTx.Bucket([]byte(key))
if b == nil {
return
}
_ = b.ForEach(func(k, v []byte) error {
kvMap[string(k)] = string(v)
return nil
})
return
}
func (t *rtx) HKEYS(key string) (keys []string, err error) {
b := t.boltTx.Bucket([]byte(key))
if b == nil {
return
}
err = b.ForEach(func(k, v []byte) error {
keys = append(keys, string(k))
return nil
})
return
}
func (t *rtx) HLEN(key string) (count int, err error) {
b := t.boltTx.Bucket([]byte(key))
if b == nil {
return
}
return b.Stats().KeyN, nil
}
func (t *rtx) HMGET(key string, fields ...string) (vals []string, err error) {
b := t.boltTx.Bucket([]byte(key))
if b == nil {
return
}
for _, field := range fields {
vals = append(vals, string(b.Get([]byte(field))))
}
return
}
func (t *rtx) HMSET(key string, fields map[string]string) (err error) {
b, err := t.boltTx.CreateBucketIfNotExists([]byte(key))
if err != nil {
return err
}
for k, v := range fields {
if err = b.Put([]byte(k), []byte(v)); err != nil {
return
}
}
return
}
func (t *rtx) HSET(key string, field string, value string) (err error) {
b, err := t.boltTx.CreateBucketIfNotExists([]byte(key))
if err != nil {
return err
}
return b.Put([]byte(field), []byte(value))
}
func (t *rtx) SADD(key string, member ...string) (err error) {
for _, m := range member {
if err = t.HSET(key, m, ""); err != nil {
return
}
}
return
}
func (t *rtx) SCARD(key string) (count int, err error) {
return t.HLEN(key)
}
func (t *rtx) SISMEMBER(key string, member string) (isMember bool, err error) {
return t.HEXISTS(key, member)
}
func (t *rtx) SMEMBERS(key string) (members []string, err error) {
return t.HKEYS(key)
}
func (t *rtx) SREM(key string, member ...string) (err error) {
for _, m := range member {
if err = t.HDEL(key, m); err != nil {
return
}
}
return
}
func (t *rtx) SDIFF(key string, diffKeys ...string) (members []string, err error) {
runner := make(map[string]struct{})
members, err = t.SMEMBERS(key)
if err != nil {
return
}
for _, k := range members {
runner[k] = struct{}{}
}
for _, k := range diffKeys {
diffMembers, err := t.SMEMBERS(k)
if err != nil {
return nil, err
}
for _, m := range diffMembers {
delete(runner, m)
}
}
return maps.Keys(runner), nil
}
func (t *rtx) SMOVE(source string, destination string, member string) error {
if isMember, err := t.SISMEMBER(source, member); err != nil || !isMember {
return err
}
if err := t.SADD(destination, member); err != nil {
return err
}
return t.SREM(source, member)
}