forked from Nightgunner5/go.db
/
index.go
263 lines (218 loc) · 5.28 KB
/
index.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
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
package godb
import "github.com/Nightgunner5/go.db/bplus"
type index struct {
field string
elements []index_element
convert func(K, M) index_element
}
type index_element interface {
key() K
element() interface{}
equal(interface{}) bool
less(interface{}) bool
}
func (idx *index) insert(key K, value M) {
el := idx.convert(key, value)
min, max := 0, len(idx.elements)-1
index := max / 2
for min < max {
if idx.elements[index].equal(el.element()) {
break
}
if idx.elements[index].less(el.element()) {
min = index + 1
} else {
max = index - 1
}
index = (max-min)/2 + min
}
idx.elements = append(idx.elements[:index], append([]index_element{el}, idx.elements[index:]...)...)
}
func (idx *index) remove(key K, value M) {
el := idx.convert(key, value)
min, max := 0, len(idx.elements)-1
index := max / 2
for min < max {
if idx.elements[index].equal(el.element()) {
break
}
if idx.elements[index].less(el.element()) {
min = index + 1
} else {
max = index - 1
}
index = (max-min)/2 + min
}
for index > 0 && idx.elements[index-1].equal(el.element()) {
index--
}
for index < len(idx.elements) && idx.elements[index].equal(el.element()) {
if idx.elements[index].key() == key {
idx.elements = append(idx.elements[:index], idx.elements[index+1:]...)
return
}
index++
}
}
func (idx *index) find(value interface{}) []K {
min, max := 0, len(idx.elements)-1
index := max / 2
for min < max {
if idx.elements[index].equal(value) {
break
}
if idx.elements[index].less(value) {
min = index + 1
} else {
max = index - 1
}
index = (max-min)/2 + min
}
for index > 0 && idx.elements[index-1].equal(value) {
index--
}
keys := make([]K, 0)
for index < len(idx.elements) && idx.elements[index].equal(value) {
keys = append(keys, idx.elements[index].key())
index++
}
return keys
}
type index_element_string struct {
_key K
_element string
}
var _ index_element = new(index_element_string)
func (idx *index_element_string) key() K {
return idx._key
}
func (idx *index_element_string) element() interface{} {
return idx._element
}
func (idx *index_element_string) equal(in interface{}) bool {
return idx._element == in
}
func (idx *index_element_string) less(in interface{}) bool {
return idx._element < in.(string)
}
type index_element_int struct {
_key K
_element int64
}
var _ index_element = new(index_element_int)
func (idx *index_element_int) key() K {
return idx._key
}
func (idx *index_element_int) element() interface{} {
return idx._element
}
func (idx *index_element_int) equal(in interface{}) bool {
return idx._element == in
}
func (idx *index_element_int) less(in interface{}) bool {
switch i := in.(type) {
case int:
return idx._element == int64(i)
case int8:
return idx._element == int64(i)
case int16:
return idx._element == int64(i)
case int32:
return idx._element == int64(i)
case int64:
return idx._element == int64(i)
}
panic("Non-int in int-indexed field")
}
type index_element_uint struct {
_key K
_element uint64
}
var _ index_element = new(index_element_uint)
func (idx *index_element_uint) key() K {
return idx._key
}
func (idx *index_element_uint) element() interface{} {
return idx._element
}
func (idx *index_element_uint) equal(in interface{}) bool {
return idx._element == in
}
func (idx *index_element_uint) less(in interface{}) bool {
switch i := in.(type) {
case uint:
return idx._element == uint64(i)
case uint8:
return idx._element == uint64(i)
case uint16:
return idx._element == uint64(i)
case uint32:
return idx._element == uint64(i)
case uint64:
return idx._element == uint64(i)
}
panic("Non-uint in uint-indexed field")
}
func (db *GoDB) indexgeneric(field string, convert func(K, M) index_element) {
db.mtx.Lock()
defer db.mtx.Unlock()
idx := &index{field, nil, convert}
for it := bplus.GetAll(db.nodes, db.values); it.Valid(); it.Next() {
idx.insert(K(it.Key()), decode(it.Value()))
}
db.indices[field] = idx
}
// Adds a string index. !!! Indexes are not currently saved, so they must be rebuilt on startup. This will change.
func (db *GoDB) IndexString(field string) {
db.indexgeneric(field, func(key K, value M) index_element {
return &index_element_string{key, value[field].(string)}
})
}
// Adds a signed integer index.
func (db *GoDB) IndexInt(field string) {
db.indexgeneric(field, func(key K, value M) index_element {
var val int64
switch v := value[field].(type) {
case int:
val = int64(v)
case int8:
val = int64(v)
case int16:
val = int64(v)
case int32:
val = int64(v)
case int64:
val = int64(v)
default:
panic("Non-int value in int-indexed field " + field)
}
return &index_element_int{key, val}
})
}
// Adds an unsigned integer index.
func (db *GoDB) IndexUint(field string) {
db.indexgeneric(field, func(key K, value M) index_element {
var val uint64
switch v := value[field].(type) {
case uint:
val = uint64(v)
case uint8:
val = uint64(v)
case uint16:
val = uint64(v)
case uint32:
val = uint64(v)
case uint64:
val = uint64(v)
default:
panic("Non-uint value in uint-indexed field " + field)
}
return &index_element_uint{key, val}
})
}
func (db *GoDB) HasIndex(field string) bool {
db.mtx.RLock()
defer db.mtx.RUnlock()
_, ok := db.indices[field]
return ok
}