-
Notifications
You must be signed in to change notification settings - Fork 0
/
set.go
183 lines (151 loc) · 4.02 KB
/
set.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
package lazydb
import (
"github.com/billsjc123/LazyDB/ds"
"github.com/billsjc123/LazyDB/logfile"
"log"
)
// SAdd add the values the set stored at key.
func (db *LazyDB) 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)] = ds.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}
valPos, err := db.writeLogEntry(valueTypeSet, ent)
if err != nil {
return err
}
entry := &logfile.LogEntry{Key: sum, Value: mem}
_, size := logfile.EncodeEntry(ent)
valPos.entrySize = size
if err := db.updateIndexTree(valueTypeSet, idxTree, entry, valPos, false); err != nil {
return err
}
}
return nil
}
// SIsMember returns if the argument is the one value of the set stored at key.
func (db *LazyDB) 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 values of the set value stored at key.
func (db *LazyDB) SMembers(key []byte) ([][]byte, error) {
db.setIndex.mu.RLock()
defer db.setIndex.mu.RUnlock()
return db.sMembers(key)
}
// Helper for getting all members of the given set key.
func (db *LazyDB) 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.getValue(idxTree, node.Key(), valueTypeSet)
if err != nil {
return nil, err
}
values = append(values, val)
}
return values, nil
}
func (db *LazyDB) 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, Stat: logfile.SDelete}
pos, err := db.writeLogEntry(valueTypeSet, entry)
if err != nil {
return err
}
// delete invalid entry
db.sendDiscard(val, updated, valueTypeSet)
// also merge the delete entry
_, size := logfile.EncodeEntry(entry)
node := &Value{fid: pos.fid, entrySize: size}
select {
case db.discardsMap[valueTypeSet].valChan <- node:
default:
log.Fatal("send discard fail")
}
return nil
}
// SPop removes and returns members from the set value store at key.
func (db *LazyDB) SPop(key []byte, num 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() && num > 0 {
num--
node, _ := iter.Next()
if node == nil {
continue
}
val, err := db.getValue(idxTree, node.Key(), valueTypeSet)
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.
func (db *LazyDB) 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
}