-
Notifications
You must be signed in to change notification settings - Fork 1
/
table_database.rb
407 lines (371 loc) · 12.4 KB
/
table_database.rb
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
406
407
require "oklahoma_mixer/error"
require "oklahoma_mixer/array_list"
require "oklahoma_mixer/hash_map"
require "oklahoma_mixer/query"
require "oklahoma_mixer/hash_database"
require "oklahoma_mixer/table_database/c"
module OklahomaMixer
class TableDatabase < HashDatabase
module Paginated
attr_accessor :current_page, :per_page, :total_entries
def total_pages
(total_entries / per_page.to_f).ceil
end
def out_of_bounds?
current_page > total_pages
end
def offset
(current_page - 1) * per_page
end
def previous_page
current_page > 1 ? (current_page - 1) : nil
end
def next_page
current_page < total_pages ? (current_page + 1) : nil
end
end
################################
### Getting and Setting Keys ###
################################
def store(key, value, mode = nil, &dup_handler)
if mode == :add and dup_handler.nil?
super
elsif dup_handler
warn "block supersedes mode argument" unless mode.nil?
k = cast_key_in(key)
callback = lambda { |old_value_pointer, old_size, returned_size, _|
old_value = cast_from_null_terminated_colums(
*old_value_pointer.get_bytes(0, old_size)
)
replacement, size = cast_to_null_terminated_colums( yield( key,
old_value,
value ) )
returned_size.put_int(0, size)
pointer = Utilities.malloc(size)
pointer.put_bytes(0, replacement) unless pointer.address.zero?
pointer
}
try(:putproc, k, cast_to_null_terminated_colums(value), callback, nil)
value
else
Utilities.temp_map do |map|
map.update(value) { |string|
cast_to_bytes_and_length(string)
}
result = super(key, map, mode, &dup_handler)
result == map ? value : result
end
end
end
alias_method :[]=, :store
def fetch(key, *default)
if value = try( :get, cast_key_in(key),
:failure => lambda { |value| value.address.zero? },
:no_error => {22 => nil} )
cast_value_out(value)
else
if block_given?
warn "block supersedes default value argument" unless default.empty?
yield key
elsif not default.empty?
default.first
else
fail IndexError, "key not found"
end
end
end
def generate_unique_id
try(:genuid, :failure => -1)
end
alias_method :uid, :generate_unique_id
#################
### Iteration ###
#################
def each
try(:iterinit)
loop do
pointer = try( :iternext3,
:failure => lambda { |value| value.address.zero? },
:no_error => {22 => nil} )
return self unless pointer
value = cast_value_out(pointer)
key = value.delete("")
yield [key, value]
end
end
alias_method :each_pair, :each
###############
### Queries ###
###############
def all(options = { }, &iterator)
query(options) do |q|
mode = results_mode(options)
if not iterator.nil? and not read_only?
results = self
callback = lambda { |key_pointer, key_size, doc_map, _|
if mode != :docs
key = cast_key_out(key_pointer.get_bytes(0, key_size))
end
if mode != :keys
map = HashMap.new(doc_map)
doc = map.to_hash { |string| cast_to_encoded_string(string) }
end
flags = case mode
when :keys then iterator[key]
when :docs then iterator[doc]
when :aoh then iterator[doc.merge!(:primary_key => key)]
else iterator[[key, doc]]
end
Array(flags).inject(0) { |returned_flags, flag|
returned_flags | case flag.to_s
when "update"
if mode != :keys
map.replace(doc) { |key_or_value|
cast_to_bytes_and_length(key_or_value)
}
end
lib::FLAGS[:TDBQPPUT]
when "delete" then lib::FLAGS[:TDBQPOUT]
when "break" then lib::FLAGS[:TDBQPSTOP]
else 0
end
}
}
unless lib.qryproc(q.pointer, callback, nil)
error_code = lib.ecode(@db)
error_message = lib.errmsg(error_code)
fail Error::QueryError,
"#{error_message} (error code #{error_code})"
end
results
else
query_results(lib.qrysearch(q.pointer), mode, &iterator)
end
end
end
def first(options = { })
all(options.merge(:limit => 1)).first
end
def count(options = { })
count = 0
all(options.merge(:select => :keys)) { count += 1 }
count
end
def paginate(options)
mode = results_mode(options)
results = (mode != :hoh ? [ ] : { }).extend(Paginated)
fail Error::QueryError, ":page argument required" \
unless options.include? :page
results.current_page = (options[:page] || 1).to_i
fail Error::QueryError, ":page must be >= 1" if results.current_page < 1
results.per_page = (options[:per_page] || 30).to_i
fail Error::QueryError, ":per_page must be >= 1" if results.per_page < 1
results.total_entries = 0
all(options.merge(:limit => nil)) do |kv|
if results.total_entries >= results.offset and
results.size < results.per_page
if mode == :hoh
results[kv.first] = kv.last
else
results << kv
end
end
results.total_entries += 1
end
results
end
def union(q, *queries, &iterator)
search([q] + queries, lib::SEARCHES[:TDBMSUNION], &iterator)
end
def intersection(q, *queries, &iterator)
search([q] + queries, lib::SEARCHES[:TDBMSISECT], &iterator)
end
alias_method :isect, :intersection
def difference(q, *queries, &iterator)
search([q] + queries, lib::SEARCHES[:TDBMSDIFF], &iterator)
end
alias_method :diff, :difference
###############
### Indexes ###
###############
def add_index(column, type, keep = false)
type = case type.to_s
when "lexical", "string" then lib::INDEXES[:TDBITLEXICAL]
when "decimal", "numeric" then lib::INDEXES[:TDBITDECIMAL]
when "token" then lib::INDEXES[:TDBITTOKEN]
when "qgram" then lib::INDEXES[:TDBITQGRAM]
else
fail Error::IndexError, "unknown index type"
end
type |= lib::INDEXES[:TDBITKEEP] if keep
try( :setindex,
cast_to_bytes_and_length(column_name(column)).first,
type,
:no_error => {21 => false} )
end
def remove_index(column)
try( :setindex,
cast_to_bytes_and_length(column_name(column)).first,
lib::INDEXES[:TDBITVOID],
:no_error => {2 => false} )
end
def optimize_index(column)
try( :setindex,
cast_to_bytes_and_length(column_name(column)).first,
lib::INDEXES[:TDBITOPT],
:no_error => {2 => false} )
end
alias_method :defrag_index, :optimize_index
#######
private
#######
def tune(options)
super
if options.values_at(:bnum, :apow, :fpow, :opts).any?
optimize(options.merge(:tune => true))
end
if options.values_at(:rcnum, :lcnum, :ncnum).any?
setcache(options)
end
end
def setcache(options)
try( :setcache,
options.fetch(:rcnum, 0).to_i,
options.fetch(:lcnum, 0).to_i,
options.fetch(:ncnum, 0).to_i )
end
def cast_value_in(value)
value.pointer
end
def cast_value_out(pointer, no_free = false)
map = HashMap.new(pointer)
map.to_hash { |string| cast_to_encoded_string(string) }
ensure
map.free if map and not no_free
end
def cast_from_null_terminated_colums(string)
Hash[*string.split("\0").map { |s| cast_to_encoded_string(s) }]
end
def cast_to_null_terminated_colums(hash)
cast_to_bytes_and_length(hash.to_a.flatten.join("\0"))
end
def column_name(column)
case column
when :primary_key, :pk then ""
else column
end
end
def query(options = { })
query = Query.new(@db)
conditions = Array(options[:conditions])
conditions = [conditions] unless conditions.empty? or
conditions.first.is_a? Array
conditions.each do |condition|
fail Error::QueryError,
"condition must be column, operator, and expression" \
unless condition.size.between? 3, 4
query.condition( column_name(condition.first),
*condition[1..-1] ) { |string|
cast_to_bytes_and_length(string).first
}
end
unless options[:order].nil?
order = options[:order] == "" ? [""] : Array(options[:order])
fail Error::QueryError, "order must have a field and can have a type" \
unless order.size.between? 1, 2
order[0] = column_name(order[0])
query.order(*order) { |string|
cast_to_bytes_and_length(string).first
}
end
unless options[:limit].nil?
query.limit(options[:limit], options[:offset])
end
if block_given?
yield query
else
query
end
ensure
query.free if query and block_given?
end
def results_mode(options)
case options[:select].to_s
when /\A(?:primary_)?keys?\z/i then :keys
when /\Adoc(?:ument)?s?\z/i then :docs
else
case options[:return].to_s
when /\Ah(?:ash_)?o(?:f_)?h(?:ash)?e?s?\z/i then :hoh
when /\Aa(?:rray_)?o(?:f_)?a(?:rray)?s?\z/i then :aoa
when /\Aa(?:rray_)?o(?:f_)?h(?:ash)?e?s?\z/i then :aoh
else
if RUBY_VERSION < "1.9" and not options[:order].nil? then :aoa
else :hoh
end
end
end
end
def query_results(results, mode, &iterator)
keys = ArrayList.new(results)
if iterator.nil?
results = mode == :hoh ? { } : [ ]
iterator = lambda do |key_and_value|
if mode == :hoh
results[key_and_value.first] = key_and_value.last
else
results << key_and_value
end
end
else
results = self
end
keys.each do |key|
flags = Array( case mode
when :keys
iterator[cast_key_out(key)]
when :docs
iterator[self[cast_key_out(key)]]
when :aoh
k = cast_key_out(key)
iterator[self[k].merge!(:primary_key => k)]
else
k = cast_key_out(key)
v = self[k]
iterator[[k, v]]
end ).map { |flag| flag.to_s }
if flags.include? "delete"
if read_only?
warn "attempted delete from a read only query"
else
delete(key)
end
elsif v and flags.include? "update"
if read_only?
warn "attempted update from a read only query"
else
self[k] = v
end
end
break if flags.include? "break"
end
results
ensure
keys.free if keys
end
def search(queries, operation, &iterator)
qs = queries.map { |q| query(q) }
Utilities.temp_pointer(qs.size) do |pointer|
pointer.write_array_of_pointer(qs.map { |q| q.pointer })
query_results( lib.metasearch(pointer, qs.size, operation),
results_mode(queries.first),
&iterator)
end
ensure
if qs
qs.each do |q|
q.free
end
end
end
end
end