forked from lovoo/goka
-
Notifications
You must be signed in to change notification settings - Fork 0
/
memory.go
156 lines (127 loc) · 2.68 KB
/
memory.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
package storage
import (
"bytes"
"fmt"
"strings"
"github.com/syndtr/goleveldb/leveldb/util"
)
type memiter struct {
current int
keys []string
storage map[string][]byte
}
func (i *memiter) exhausted() bool {
return len(i.keys) <= i.current
}
func (i *memiter) Next() bool {
i.current++
if string(i.Key()) == offsetKey {
i.current++
}
return !i.exhausted()
}
func (*memiter) Err() error {
return nil
}
func (i *memiter) Key() []byte {
if i.exhausted() {
return nil
}
return []byte(i.keys[i.current])
}
func (i *memiter) Value() ([]byte, error) {
if i.exhausted() {
return nil, nil
}
return i.storage[i.keys[i.current]], nil
}
func (i *memiter) Release() {
// mark the iterator as exhausted
i.current = len(i.keys)
}
func (i *memiter) Seek(key []byte) bool {
seek := make(map[string][]byte)
keys := []string{}
for k, v := range i.storage {
if strings.Contains(k, string(key)) {
keys = append(keys, k)
seek[k] = v
}
}
i.current = -1
i.storage = seek
i.keys = keys
return !i.exhausted()
}
type memory struct {
storage map[string][]byte
offset *int64
recovered bool
}
// NewMemory returns a new in-memory storage.
func NewMemory() Storage {
return &memory{
storage: make(map[string][]byte),
recovered: false,
}
}
func (m *memory) Has(key string) (bool, error) {
_, has := m.storage[key]
return has, nil
}
func (m *memory) Get(key string) ([]byte, error) {
value, _ := m.storage[key]
return value, nil
}
func (m *memory) Set(key string, value []byte) error {
if value == nil {
return fmt.Errorf("cannot write nil value")
}
m.storage[key] = value
return nil
}
func (m *memory) Delete(key string) error {
delete(m.storage, key)
return nil
}
func (m *memory) Iterator() (Iterator, error) {
keys := make([]string, 0, len(m.storage))
for k := range m.storage {
keys = append(keys, k)
}
return &memiter{-1, keys, m.storage}, nil
}
func (m *memory) IteratorWithRange(start, limit []byte) (Iterator, error) {
keys := []string{} // using slice as keys has an unknown size
if len(limit) == 0 {
limit = util.BytesPrefix(start).Limit
}
for k := range m.storage {
if bytes.Compare([]byte(k), start) > -1 && bytes.Compare([]byte(k), limit) < 1 {
keys = append(keys, k)
}
}
return &memiter{-1, keys, m.storage}, nil
}
func (m *memory) MarkRecovered() error {
return nil
}
func (m *memory) Recovered() bool {
return m.recovered
}
func (m *memory) SetOffset(offset int64) error {
m.offset = &offset
return nil
}
func (m *memory) GetOffset(defValue int64) (int64, error) {
if m.offset == nil {
return defValue, nil
}
return *m.offset, nil
}
func (m *memory) Open() error {
return nil
}
func (m *memory) Close() error {
return nil
}