/
hash_storage.rb
204 lines (144 loc) · 4.19 KB
/
hash_storage.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
#--
# Copyright (c) 2005-2011, John Mettraux, jmettraux@gmail.com
#
# Permission is hereby granted, free of charge, to any person obtaining a copy
# of this software and associated documentation files (the "Software"), to deal
# in the Software without restriction, including without limitation the rights
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
# copies of the Software, and to permit persons to whom the Software is
# furnished to do so, subject to the following conditions:
#
# The above copyright notice and this permission notice shall be included in
# all copies or substantial portions of the Software.
#
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
# THE SOFTWARE.
#
# Made in Japan.
#++
require 'rufus/json'
require 'ruote/util/misc'
require 'ruote/storage/base'
require 'monitor'
module Ruote
# An in-memory storage.
#
class HashStorage
include StorageBase
include MonitorMixin
attr_reader :h
def initialize (options={})
super()
# since were including MonitorMixin, this super() is necessary
@options = options
purge!
put(options.merge('type' => 'configurations', '_id' => 'engine'))
end
def put (doc, opts={})
i = @h.size
synchronize do
pre = get(doc['type'], doc['_id'])
if pre && pre['_rev'] != doc['_rev']
return pre
end
if pre.nil? && doc['_rev']
return true
end
doc = if opts[:update_rev]
doc['_rev'] = pre ? pre['_rev'] : -1
doc
else
doc.merge('_rev' => doc['_rev'] || -1)
end
doc['put_at'] = Ruote.now_to_utc_s
doc['_rev'] = doc['_rev'] + 1
@h[doc['type']][doc['_id']] = Rufus::Json.dup(doc)
nil
end
rescue => e
puts "=" * 80
File.open('doc.json', 'wb') do |f|
f.puts Rufus::Json.pretty_encode(doc)
end
raise e
end
def get (type, key)
synchronize do
Ruote.fulldup(@h[type][key])
end
end
def delete (doc)
drev = doc['_rev']
raise ArgumentError.new("can't delete doc without _rev") unless drev
synchronize do
prev = get(doc['type'], doc['_id'])
return true if prev.nil?
doc['_rev'] ||= 0
return prev if prev['_rev'] != drev
@h[doc['type']].delete(doc['_id'])
nil # success
end
end
def get_many (type, key=nil, opts={})
# NOTE : no dup here for now
synchronize do
keys = key ?
Array(key).map { |k| k.is_a?(String) ? "!#{k}" : k } : nil
docs = keys ?
@h[type].values.select { |doc|
Ruote::StorageBase.key_match?(keys, doc)
} :
@h[type].values
docs = docs.sort_by { |d| d['_id'] }
return docs.size if opts[:count]
docs = docs.reverse if opts[:descending]
skip = opts[:skip] || 0
limit = opts[:limit] || docs.size
docs[skip, limit]
end
end
# Returns a sorted list of all the ids for a given type.
#
def ids (type)
@h[type].keys.sort
end
# Purges the storage completely.
#
def purge!
@h = %w[
variables
msgs
expressions
errors
schedules
configurations
workitems
].inject({}) { |h, k|
h[k] = {}
h
}
@h['configurations']['engine'] = @options
end
def add_type (type)
@h[type] = {}
end
def purge_type! (type)
@h[type] = {}
end
def dump (type)
s = "=== #{type} ===\n"
@h[type].inject(s) do |s1, (k, v)|
s1 << "\n"
s1 << "#{k} :\n"
v.keys.sort.inject(s1) do |s2, k1|
s2 << " #{k1} => #{v[k1].inspect}\n"
end
end
end
end
end