This repository has been archived by the owner on Apr 21, 2023. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 7
/
ordered_set.go
82 lines (65 loc) · 2.01 KB
/
ordered_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
package badger
import (
"fmt"
"strings"
"github.com/dgraph-io/badger"
"github.com/pkg/errors"
)
type OrderedSet struct {
keyspace string
keyCode string
iterator string
}
func NewOrderedSet(ns, key string) *OrderedSet {
k := strings.Join([]string{"/", ns, key}, "")
return &OrderedSet{
keyspace: ns,
keyCode: k,
iterator: iteratorFromKeyCode(k),
}
}
func (r *OrderedSet) Get(txn *badger.Txn, keyvals ...interface{}) ([][]byte, error) {
key := fmt.Sprintf(r.keyCode, keyvals...)
return getOrderedVals(txn, key)
}
func (r *OrderedSet) Put(txn *badger.Txn, vals [][]byte, keyvals ...interface{}) error {
key := fmt.Sprintf(r.keyCode, keyvals...)
return addOrderedVals(txn, key, vals)
}
func (r *OrderedSet) Add(txn *badger.Txn, val []byte, keyvals ...interface{}) error {
key := fmt.Sprintf(r.keyCode, keyvals...)
return addOrderedVals(txn, key, [][]byte{val})
}
func (r *OrderedSet) Count(txn *badger.Txn, keyvals ...interface{}) int {
key := fmt.Sprintf(r.iterator, keyvals...)
return countVals(txn, key)
}
func (r *OrderedSet) Delete(txn *badger.Txn, keyvals ...interface{}) error {
key := fmt.Sprintf(r.keyCode, keyvals...)
return delVals(txn, key)
}
func (r *OrderedSet) RemoveFromSet(txn *badger.Txn, val []byte, keyvals ...interface{}) error {
key := fmt.Sprintf(r.keyCode, keyvals...)
return removeFromVals(txn, key, val)
}
func (r *OrderedSet) Iterator(txn *badger.Txn, keyvals ...interface{}) *SetIterator {
seek := []byte(fmt.Sprintf(r.iterator, keyvals...))
return NewSetIterator(txn, seek)
}
func (r *OrderedSet) First(txn *badger.Txn, keyvals ...interface{}) ([][]byte, error) {
seek := []byte(fmt.Sprintf(r.iterator, keyvals...))
it := NewSetIterator(txn, seek)
defer it.Close()
if !it.Next() {
return nil, errors.New("not found")
}
return it.Value(), nil
}
func (r *OrderedSet) Last(txn *badger.Txn, keyvals ...interface{}) ([][]byte, error) {
seek := []byte(fmt.Sprintf(r.iterator, keyvals...))
it := NewSetIterator(txn, seek)
defer it.Close()
for it.Next() {
}
return it.Value(), nil
}