/
mem.go
183 lines (158 loc) · 4.12 KB
/
mem.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
/*
Copyright 2011 The Perkeep Authors
Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at
http://www.apache.org/licenses/LICENSE-2.0
Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License.
*/
package sorted
import (
"errors"
"log"
"sync"
"github.com/syndtr/goleveldb/leveldb/comparer"
"github.com/syndtr/goleveldb/leveldb/iterator"
"github.com/syndtr/goleveldb/leveldb/memdb"
"github.com/syndtr/goleveldb/leveldb/util"
"go4.org/jsonconfig"
)
// NewMemoryKeyValue returns a KeyValue implementation that's backed only
// by memory. It's mostly useful for tests and development.
func NewMemoryKeyValue() KeyValue {
kv := new(memKeys)
kv.Wipe()
return kv
}
var _ Wiper = (*memKeys)(nil)
// memKeys is a naive in-memory implementation of KeyValue for test & development
// purposes only.
type memKeys struct {
mu sync.Mutex // guards db
db *memdb.DB
}
func (mk *memKeys) Wipe() error {
mk.mu.Lock()
defer mk.mu.Unlock()
mk.db = memdb.New(comparer.DefaultComparer, 128)
return nil
}
// memIter converts from leveldb's iterator.Iterator interface, which
// operates on []byte, to Perkeep's index.Iterator, which operates
// on string.
type memIter struct {
lit iterator.Iterator // underlying leveldb iterator
k, v *string // if nil, not stringified yet
}
func (s *memIter) Next() bool {
s.k, s.v = nil, nil
return s.lit.Next()
}
func (s *memIter) Close() error {
s.lit.Release()
return s.lit.Error()
}
func (s *memIter) KeyBytes() []byte {
return s.lit.Key()
}
func (s *memIter) ValueBytes() []byte {
return s.lit.Value()
}
func (s *memIter) Key() string {
if s.k != nil {
return *s.k
}
str := string(s.KeyBytes())
s.k = &str
return str
}
func (s *memIter) Value() string {
if s.v != nil {
return *s.v
}
str := string(s.ValueBytes())
s.v = &str
return str
}
func (mk *memKeys) Get(key string) (string, error) {
mk.mu.Lock()
defer mk.mu.Unlock()
k, err := mk.db.Get([]byte(key))
if err == memdb.ErrNotFound {
return "", ErrNotFound
}
return string(k), err
}
func (mk *memKeys) Find(start, end string) Iterator {
mk.mu.Lock()
defer mk.mu.Unlock()
var startB, endB []byte
if start != "" {
startB = []byte(start)
}
if end != "" {
endB = []byte(end)
}
lit := mk.db.NewIterator(&util.Range{Start: startB, Limit: endB})
return &memIter{lit: lit}
}
func (mk *memKeys) Set(key, value string) error {
if err := CheckSizes(key, value); err != nil {
log.Printf("Skipping storing (%q:%q): %v", key, value, err)
return nil
}
mk.mu.Lock()
defer mk.mu.Unlock()
return mk.db.Put([]byte(key), []byte(value))
}
func (mk *memKeys) Delete(key string) error {
mk.mu.Lock()
defer mk.mu.Unlock()
err := mk.db.Delete([]byte(key))
if err == memdb.ErrNotFound {
return nil
}
return err
}
func (mk *memKeys) BeginBatch() BatchMutation {
return &batch{}
}
func (mk *memKeys) CommitBatch(bm BatchMutation) error {
b, ok := bm.(*batch)
if !ok {
return errors.New("invalid batch type; not an instance returned by BeginBatch")
}
mk.mu.Lock()
defer mk.mu.Unlock()
for _, m := range b.Mutations() {
if m.IsDelete() {
if err := mk.db.Delete([]byte(m.Key())); err != nil && err != memdb.ErrNotFound {
return err
}
} else {
// TODO(mpl): we need to force a reindex when we have a proper solution
// for storing these too large attributes, if ever.
if err := CheckSizes(m.Key(), m.Value()); err != nil {
log.Printf("Skipping storing (%q:%q): %v", m.Key(), m.Value(), err)
continue
}
if err := mk.db.Put([]byte(m.Key()), []byte(m.Value())); err != nil {
return err
}
}
}
return nil
}
func (mk *memKeys) Close() error { return nil }
func init() {
RegisterKeyValue("memory", func(cfg jsonconfig.Obj) (KeyValue, error) {
if err := cfg.Validate(); err != nil {
return nil, err
}
return NewMemoryKeyValue(), nil
})
}