-
Notifications
You must be signed in to change notification settings - Fork 618
/
sets.go
253 lines (231 loc) · 6.29 KB
/
sets.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
package rosedb
import (
"github.com/flower-corp/rosedb/ds/art"
"github.com/flower-corp/rosedb/logfile"
"github.com/flower-corp/rosedb/logger"
"github.com/flower-corp/rosedb/util"
)
// SAdd add the specified members to the set stored at key.
// Specified members that are already a member of this set are ignored.
// If key does not exist, a new set is created before adding the specified members.
func (db *RoseDB) SAdd(key []byte, members ...[]byte) error {
db.setIndex.mu.Lock()
defer db.setIndex.mu.Unlock()
if db.setIndex.trees[string(key)] == nil {
db.setIndex.trees[string(key)] = art.NewART()
}
idxTree := db.setIndex.trees[string(key)]
for _, mem := range members {
if len(mem) == 0 {
continue
}
if err := db.setIndex.murhash.Write(mem); err != nil {
return err
}
sum := db.setIndex.murhash.EncodeSum128()
db.setIndex.murhash.Reset()
ent := &logfile.LogEntry{Key: key, Value: mem}
valuePos, err := db.writeLogEntry(ent, Set)
if err != nil {
return err
}
entry := &logfile.LogEntry{Key: sum, Value: mem}
_, size := logfile.EncodeEntry(ent)
valuePos.entrySize = size
if err := db.updateIndexTree(idxTree, entry, valuePos, true, Set); err != nil {
return err
}
}
return nil
}
// SPop removes and returns one or more random members from the set value store at key.
func (db *RoseDB) SPop(key []byte, count uint) ([][]byte, error) {
db.setIndex.mu.Lock()
defer db.setIndex.mu.Unlock()
if db.setIndex.trees[string(key)] == nil {
return nil, nil
}
idxTree := db.setIndex.trees[string(key)]
var values [][]byte
iter := idxTree.Iterator()
for iter.HasNext() && count > 0 {
count--
node, _ := iter.Next()
if node == nil {
continue
}
val, err := db.getVal(idxTree, node.Key(), Set)
if err != nil {
return nil, err
}
values = append(values, val)
}
for _, val := range values {
if err := db.sremInternal(key, val); err != nil {
return nil, err
}
}
return values, nil
}
// SRem remove the specified members from the set stored at key.
// Specified members that are not a member of this set are ignored.
// If key does not exist, it is treated as an empty set and this command returns 0.
func (db *RoseDB) SRem(key []byte, members ...[]byte) error {
db.setIndex.mu.Lock()
defer db.setIndex.mu.Unlock()
if db.setIndex.trees[string(key)] == nil {
return nil
}
for _, mem := range members {
if err := db.sremInternal(key, mem); err != nil {
return err
}
}
return nil
}
// SIsMember returns if member is a member of the set stored at key.
func (db *RoseDB) SIsMember(key, member []byte) bool {
db.setIndex.mu.RLock()
defer db.setIndex.mu.RUnlock()
if db.setIndex.trees[string(key)] == nil {
return false
}
idxTree := db.setIndex.trees[string(key)]
if err := db.setIndex.murhash.Write(member); err != nil {
return false
}
sum := db.setIndex.murhash.EncodeSum128()
db.setIndex.murhash.Reset()
node := idxTree.Get(sum)
return node != nil
}
// SMembers returns all the members of the set value stored at key.
func (db *RoseDB) SMembers(key []byte) ([][]byte, error) {
db.setIndex.mu.RLock()
defer db.setIndex.mu.RUnlock()
return db.sMembers(key)
}
// SCard returns the set cardinality (number of elements) of the set stored at key.
func (db *RoseDB) SCard(key []byte) int {
db.setIndex.mu.RLock()
defer db.setIndex.mu.RUnlock()
if db.setIndex.trees[string(key)] == nil {
return 0
}
return db.setIndex.trees[string(key)].Size()
}
// SDiff returns the members of the set difference between the first set and
// all the successive sets. Returns error if no key is passed as a parameter.
func (db *RoseDB) SDiff(keys ...[]byte) ([][]byte, error) {
db.setIndex.mu.RLock()
defer db.setIndex.mu.RUnlock()
if len(keys) == 0 {
return nil, ErrWrongNumberOfArgs
}
if len(keys) == 1 {
return db.sMembers(keys[0])
}
firstSet, err := db.sMembers(keys[0])
if err != nil {
return nil, err
}
successiveSet := make(map[uint64]struct{})
for _, key := range keys[1:] {
members, err := db.sMembers(key)
if err != nil {
return nil, err
}
for _, value := range members {
h := util.MemHash(value)
if _, ok := successiveSet[h]; !ok {
successiveSet[h] = struct{}{}
}
}
}
if len(successiveSet) == 0 {
return firstSet, nil
}
res := make([][]byte, 0)
for _, value := range firstSet {
h := util.MemHash(value)
if _, ok := successiveSet[h]; !ok {
res = append(res, value)
}
}
return res, nil
}
// SUnion returns the members of the set resulting from the union of all the given sets.
func (db *RoseDB) SUnion(keys ...[]byte) ([][]byte, error) {
db.setIndex.mu.RLock()
defer db.setIndex.mu.RUnlock()
if len(keys) == 0 {
return nil, ErrWrongNumberOfArgs
}
if len(keys) == 1 {
return db.sMembers(keys[0])
}
set := make(map[uint64]struct{})
unionSet := make([][]byte, 0)
for _, key := range keys {
values, err := db.sMembers(key)
if err != nil {
return nil, err
}
for _, val := range values {
h := util.MemHash(val)
if _, ok := set[h]; !ok {
set[h] = struct{}{}
unionSet = append(unionSet, val)
}
}
}
return unionSet, nil
}
func (db *RoseDB) sremInternal(key []byte, member []byte) error {
idxTree := db.setIndex.trees[string(key)]
if err := db.setIndex.murhash.Write(member); err != nil {
return err
}
sum := db.setIndex.murhash.EncodeSum128()
db.setIndex.murhash.Reset()
val, updated := idxTree.Delete(sum)
if !updated {
return nil
}
entry := &logfile.LogEntry{Key: key, Value: sum, Type: logfile.TypeDelete}
pos, err := db.writeLogEntry(entry, Set)
if err != nil {
return err
}
db.sendDiscard(val, updated, Set)
// The deleted entry itself is also invalid.
_, size := logfile.EncodeEntry(entry)
node := &indexNode{fid: pos.fid, entrySize: size}
select {
case db.discards[Set].valChan <- node:
default:
logger.Warn("send to discard chan fail")
}
return nil
}
// sMembers is a helper method to get all members of the given set key.
func (db *RoseDB) sMembers(key []byte) ([][]byte, error) {
if db.setIndex.trees[string(key)] == nil {
return nil, nil
}
var values [][]byte
idxTree := db.setIndex.trees[string(key)]
iterator := idxTree.Iterator()
for iterator.HasNext() {
node, _ := iterator.Next()
if node == nil {
continue
}
val, err := db.getVal(idxTree, node.Key(), Set)
if err != nil {
return nil, err
}
values = append(values, val)
}
return values, nil
}