-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathnemo_hash.go
More file actions
405 lines (369 loc) · 10.5 KB
/
nemo_hash.go
File metadata and controls
405 lines (369 loc) · 10.5 KB
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
package gonemo
// #include "nemo_c.h"
// #include <stdlib.h>
import "C"
import (
"errors"
"unsafe"
)
// HSet Set a field with value on hash table named as key
// Return 1 if the field does not exist,otherwise return 0
func (nemo *NEMO) HSet(key []byte, field []byte, value []byte) (int, error) {
var cErr *C.char
var iExist C.int
C.nemo_HSet(nemo.c,
goByte2char(key), C.size_t(len(key)),
goByte2char(field), C.size_t(len(field)),
goByte2char(value), C.size_t(len(value)),
&iExist,
&cErr,
)
if cErr != nil {
res := errors.New(C.GoString(cErr))
C.free(unsafe.Pointer(cErr))
return 0, res
}
return int(iExist), nil
}
// HGet Get a value of a field in hash table named as key
func (nemo *NEMO) HGet(key []byte, field []byte) ([]byte, error) {
var cErr *C.char
var cVal *C.char
var cLen C.size_t
C.nemo_HGet(nemo.c,
goByte2char(key), C.size_t(len(key)),
goByte2char(field), C.size_t(len(field)),
&cVal, &cLen,
&cErr,
)
if cErr != nil {
res := errors.New(C.GoString(cErr))
C.free(unsafe.Pointer(cErr))
return nil, res
}
val := C.GoBytes(unsafe.Pointer(cVal), C.int(cLen))
C.free(unsafe.Pointer(cVal))
return val, nil
}
// HDel Delete muli fileds in hash table named as key
// Return the count of deleted keys which don't contain unexisted keys
func (nemo *NEMO) HDel(key []byte, fields ...[]byte) (int64, error) {
var cErr *C.char
var cRes C.int64_t
l := len(fields)
cfieldlist := make([]*C.char, l)
cfieldlen := make([]C.size_t, l)
for i, field := range fields {
cfieldlist[i] = goBytedup2char(field)
cfieldlen[i] = C.size_t(len(field))
}
C.nemo_HMDel(nemo.c,
goByte2char(key), C.size_t(len(key)),
C.int(l),
(**C.char)(unsafe.Pointer(&cfieldlist[0])),
(*C.size_t)(unsafe.Pointer(&cfieldlen[0])),
&cRes,
&cErr,
)
if cErr != nil {
res := errors.New(C.GoString(cErr))
C.free(unsafe.Pointer(cErr))
return 0, res
}
return int64(cRes), nil
}
// HExists Return true if the field has been set in the hash table named as key
func (nemo *NEMO) HExists(key []byte, field []byte) (bool, error) {
var cIfExist C.bool
var cErr *C.char
C.nemo_HExists(nemo.c,
goByte2char(key), C.size_t(len(key)),
goByte2char(field), C.size_t(len(field)),
&cIfExist, &cErr,
)
if cErr != nil {
res := errors.New(C.GoString(cErr))
C.free(unsafe.Pointer(cErr))
return false, res
}
return bool(cIfExist), nil
}
// HKeys Return all fields in the hash table named as key
func (nemo *NEMO) HKeys(key []byte) ([][]byte, error) {
var n C.int
var fieldlist **C.char
var fieldlistlen *C.size_t
var cErr *C.char
C.nemo_HKeys(nemo.c, goByte2char(key), C.size_t(len(key)), &n, &fieldlist, &fieldlistlen, &cErr)
if cErr != nil {
res := errors.New(C.GoString(cErr))
C.free(unsafe.Pointer(cErr))
return nil, res
}
if n == 0 {
return nil, nil
}
return cstr2GoMultiByte(int(n), fieldlist, fieldlistlen), nil
}
// HVals Returns all values int the hash table named as key
func (nemo *NEMO) HVals(key []byte) ([][]byte, error) {
var n C.int
var vallist **C.char
var vallistlen *C.size_t
var cErr *C.char
C.nemo_HVals(nemo.c, goByte2char(key), C.size_t(len(key)), &vallist, &vallistlen, &n, &cErr)
if cErr != nil {
res := errors.New(C.GoString(cErr))
C.free(unsafe.Pointer(cErr))
return nil, res
}
if n == 0 {
return nil, nil
}
return cstr2GoMultiByte(int(n), vallist, vallistlen), nil
}
// HGetall Return all field,value pairs in the hash table named as key
func (nemo *NEMO) HGetall(key []byte) ([][]byte, [][]byte, error) {
var n C.int
var fieldlist **C.char
var fieldlistlen *C.size_t
var vallist **C.char
var vallistlen *C.size_t
var cErr *C.char
C.nemo_HGetall(nemo.c, goByte2char(key), C.size_t(len(key)), &n, &fieldlist, &fieldlistlen, &vallist, &vallistlen, &cErr)
if cErr != nil {
res := errors.New(C.GoString(cErr))
C.free(unsafe.Pointer(cErr))
return nil, nil, res
}
if n == 0 {
return nil, nil, nil
}
return cstr2GoMultiByte(int(n), fieldlist, fieldlistlen), cstr2GoMultiByte(int(n), vallist, vallistlen), nil
}
// HLen Return the element count of a hash table
func (nemo *NEMO) HLen(key []byte) (int64, error) {
var cLen C.int64_t
var cErr *C.char
C.nemo_HLen(nemo.c, goByte2char(key), C.size_t(len(key)), &cLen, &cErr)
if cErr != nil {
res := errors.New(C.GoString(cErr))
C.free(unsafe.Pointer(cErr))
return 0, res
}
return int64(cLen), nil
}
// HMGet Get multi values of multi fields in a hash table
func (nemo *NEMO) HMGet(key []byte, fields [][]byte) ([][]byte, []error) {
l := len(fields)
cfieldlist := make([]*C.char, l)
cfieldlen := make([]C.size_t, l)
cvallist := make([]*C.char, l)
cvallen := make([]C.size_t, l)
cErrs := make([]*C.char, l)
errs := make([]error, l)
var ErrOK *C.char
for i, filed := range fields {
cfieldlist[i] = goBytedup2char(filed)
cfieldlen[i] = C.size_t(len(filed))
}
vp := C.nemo_HMGet(nemo.c, goByte2char(key), C.size_t(len(key)), C.int(l),
(**C.char)(unsafe.Pointer(&cfieldlist[0])),
(*C.size_t)(unsafe.Pointer(&cfieldlen[0])),
(**C.char)(unsafe.Pointer(&cvallist[0])),
(*C.size_t)(unsafe.Pointer(&cvallen[0])),
(**C.char)(unsafe.Pointer(&cErrs[0])),
&ErrOK,
)
for _, field := range cfieldlist {
C.free(unsafe.Pointer(field))
}
for i, cerr := range cErrs {
if cerr == nil {
errs[i] = nil
} else {
errs[i] = errors.New(C.GoString(cerr))
C.free(unsafe.Pointer(cerr))
}
}
res := cArray2goMSliceObj(l, cvallist, cvallen)
FreeCppSSVector(vp)
return res, errs
}
// HMGetUnSafe Get multi values of multi fields in a hash table
// The second return value is the cpp vector pointer
// Must use func 'FreeCppSSVector' to free the cpp vector object if you don't use the value slice array
func (nemo *NEMO) HMGetUnSafe(key []byte, fields [][]byte) ([][]byte, unsafe.Pointer, []error) {
l := len(fields)
cfieldlist := make([]*C.char, l)
cfieldlen := make([]C.size_t, l)
cvallist := make([]*C.char, l)
cvallen := make([]C.size_t, l)
cErrs := make([]*C.char, l)
errs := make([]error, l)
var ErrOK *C.char
for i, filed := range fields {
cfieldlist[i] = goBytedup2char(filed)
cfieldlen[i] = C.size_t(len(filed))
}
vp := C.nemo_HMGet(nemo.c, goByte2char(key), C.size_t(len(key)), C.int(l),
(**C.char)(unsafe.Pointer(&cfieldlist[0])),
(*C.size_t)(unsafe.Pointer(&cfieldlen[0])),
(**C.char)(unsafe.Pointer(&cvallist[0])),
(*C.size_t)(unsafe.Pointer(&cvallen[0])),
(**C.char)(unsafe.Pointer(&cErrs[0])),
&ErrOK,
)
for _, field := range cfieldlist {
C.free(unsafe.Pointer(field))
}
for i, cerr := range cErrs {
if cerr == nil {
errs[i] = nil
} else {
errs[i] = errors.New(C.GoString(cerr))
C.free(unsafe.Pointer(cerr))
}
}
return cArray2goMSlice(l, cvallist, cvallen), vp, errs
}
// HMSet Set multi fields with multi values in a hash table
// Return every result of every single set like HSet
func (nemo *NEMO) HMSet(key []byte, fields [][]byte, vals [][]byte) ([]int, error) {
var cErr *C.char
l := len(fields)
if len(vals) != l {
return nil, errors.New("key len != val len")
}
cfieldlist := make([]*C.char, l)
cfieldlen := make([]C.size_t, l)
cvallist := make([]*C.char, l)
cvallen := make([]C.size_t, l)
creslist := make([]C.int, l)
goreslist := make([]int, l)
for i, field := range fields {
cfieldlist[i] = goBytedup2char(field)
cfieldlen[i] = C.size_t(len(field))
}
for i, val := range vals {
cvallist[i] = goBytedup2char(val)
cvallen[i] = C.size_t(len(val))
}
C.nemo_HMSet(nemo.c, goByte2char(key), C.size_t(len(key)), C.int(l),
(**C.char)(unsafe.Pointer(&cfieldlist[0])),
(*C.size_t)(unsafe.Pointer(&cfieldlen[0])),
(**C.char)(unsafe.Pointer(&cvallist[0])),
(*C.size_t)(unsafe.Pointer(&cvallen[0])),
(*C.int)(unsafe.Pointer(&creslist[0])),
&cErr,
)
for _, field := range cfieldlist {
C.free(unsafe.Pointer(field))
}
for _, val := range cvallist {
C.free(unsafe.Pointer(val))
}
if cErr != nil {
res := errors.New(C.GoString(cErr))
C.free(unsafe.Pointer(cErr))
return nil, res
}
for i := range goreslist {
goreslist[i] = int(creslist[i])
}
return goreslist, nil
}
// HSetnx Set an existed field with value in a hash table
// Return 1 if the field does not exist, otherwise 0
func (nemo *NEMO) HSetnx(key []byte, field []byte, value []byte) (int64, error) {
var cErr *C.char
var cRes C.int64_t
C.nemo_HSetnx(nemo.c,
goByte2char(key), C.size_t(len(key)),
goByte2char(field), C.size_t(len(field)),
goByte2char(value), C.size_t(len(value)),
&cRes, &cErr,
)
if cErr != nil {
res := errors.New(C.GoString(cErr))
C.free(unsafe.Pointer(cErr))
return 0, res
}
return int64(cRes), nil
}
// HStrlen Return the value length of a filed in a hash table
func (nemo *NEMO) HStrlen(key []byte, field []byte) (int64, error) {
var cLen C.int64_t
var cErr *C.char
C.nemo_HStrlen(nemo.c, goByte2char(key), C.size_t(len(key)),
goByte2char(field), C.size_t(len(field)),
&cLen, &cErr,
)
if cErr != nil {
res := errors.New(C.GoString(cErr))
C.free(unsafe.Pointer(cErr))
return 0, res
}
return int64(cLen), nil
}
// HIncrby Increment a filed by a integer
// If origin key or member does not exist,new key will be set as "by"
// If origin member is not a integer, return an error
func (nemo *NEMO) HIncrby(key []byte, field []byte, by int64) ([]byte, error) {
var cRes *C.char
var cLen C.size_t
var cErr *C.char
C.nemo_HIncrby(nemo.c,
goByte2char(key), C.size_t(len(key)),
goByte2char(field), C.size_t(len(field)),
C.int64_t(by), &cRes, &cLen, &cErr,
)
if cErr != nil {
res := errors.New(C.GoString(cErr))
C.free(unsafe.Pointer(cErr))
return nil, res
}
Res := C.GoBytes(unsafe.Pointer(cRes), C.int(cLen))
C.free(unsafe.Pointer(cRes))
return Res, nil
}
// HGetIndexInfo get a index info of the meta key
func (nemo *NEMO) HGetIndexInfo(key []byte) ([]byte, int, error) {
var cErr *C.char
var cIndex *C.char
var cLen C.size_t
var cRes C.int32_t
cCppStr := C.nemo_HGetIndexInfo(nemo.c,
goByte2char(key), C.size_t(len(key)),
&cIndex, &cLen,
&cRes,
&cErr,
)
if cErr != nil {
res := errors.New(C.GoString(cErr))
C.free(unsafe.Pointer(cErr))
C.nemo_delCppStr(cCppStr)
return nil, 0, res
}
index := []byte("")
if cRes == 0 {
index = C.GoBytes(unsafe.Pointer(cIndex), C.int(cLen))
}
C.nemo_delCppStr(cCppStr)
return index, int(cRes), nil
}
// HSetIndexInfo set a index info of the meta key
func (nemo *NEMO) HSetIndexInfo(key []byte, index []byte) error {
var cErr *C.char
C.nemo_HSetIndexInfo(nemo.c,
goByte2char(key), C.size_t(len(key)),
goByte2char(index), C.size_t(len(index)),
&cErr,
)
if cErr != nil {
res := errors.New(C.GoString(cErr))
C.free(unsafe.Pointer(cErr))
return res
}
return nil
}