queue_classic 2.1.2 → 2.1.3
Sign up to get free protection for your applications and to get access to all the features.
- data/lib/queue_classic.rb +1 -1
- data/lib/queue_classic/queries.rb +3 -3
- data/readme.md +3 -7
- data/test/worker_test.rb +2 -2
- metadata +17 -2
- data/lib/queue_classic/okjson.rb +0 -598
data/lib/queue_classic.rb
CHANGED
@@ -4,8 +4,8 @@ module QC
|
|
4
4
|
|
5
5
|
def insert(q_name, method, args, chan=nil)
|
6
6
|
QC.log_yield(:action => "insert_job") do
|
7
|
-
s="INSERT INTO #{TABLE_NAME} (q_name, method, args) VALUES ($1, $2, $3)"
|
8
|
-
res = Conn.execute(s, q_name, method,
|
7
|
+
s = "INSERT INTO #{TABLE_NAME} (q_name, method, args) VALUES ($1, $2, $3)"
|
8
|
+
res = Conn.execute(s, q_name, method, MultiJson.encode(args))
|
9
9
|
Conn.notify(chan) if chan
|
10
10
|
end
|
11
11
|
end
|
@@ -16,7 +16,7 @@ module QC
|
|
16
16
|
{
|
17
17
|
:id => r["id"],
|
18
18
|
:method => r["method"],
|
19
|
-
:args =>
|
19
|
+
:args => MultiJson.decode(r["args"])
|
20
20
|
}
|
21
21
|
end
|
22
22
|
end
|
data/readme.md
CHANGED
@@ -10,7 +10,7 @@ Features:
|
|
10
10
|
* Support for multiple queues with heterogeneous workers.
|
11
11
|
* JSON data format.
|
12
12
|
* Forking workers.
|
13
|
-
* [Fuzzy-FIFO support](http://www.cs.tau.ac.il/~shanir/nir-pubs-web/Papers/Lock_Free.pdf)
|
13
|
+
* [Fuzzy-FIFO support](http://www.cs.tau.ac.il/~shanir/nir-pubs-web/Papers/Lock_Free.pdf).
|
14
14
|
|
15
15
|
Contents:
|
16
16
|
|
@@ -51,14 +51,10 @@ p_queue = QC::Queue.new("priority_queue")
|
|
51
51
|
p_queue.enqueue("Kernel.puts", ["hello", "world"])
|
52
52
|
```
|
53
53
|
|
54
|
-
QueueClassic uses [
|
54
|
+
QueueClassic uses [MultiJSON](https://github.com/intridea/multi_json) to encode the job's payload.
|
55
55
|
|
56
56
|
```ruby
|
57
|
-
|
58
|
-
OkJson.encode({"test" => "test"})
|
59
|
-
|
60
|
-
# NOT OK
|
61
|
-
OkJson.encode({:test => "test"})
|
57
|
+
MultiJson.dump({"test" => "test"})
|
62
58
|
```
|
63
59
|
|
64
60
|
### Working Jobs
|
data/test/worker_test.rb
CHANGED
@@ -90,8 +90,8 @@ class WorkerTest < QCTest
|
|
90
90
|
worker.work
|
91
91
|
assert_equal(
|
92
92
|
1,
|
93
|
-
QC::Conn.execute("SELECT count(*) from pg_stat_activity")["count"].to_i,
|
94
|
-
"Multiple connections --
|
93
|
+
QC::Conn.execute("SELECT count(*) from pg_stat_activity where datname = current_database()")["count"].to_i,
|
94
|
+
"Multiple connections found -- are there open connections to #{ QC::Conn.db_url } in other terminals?"
|
95
95
|
)
|
96
96
|
end
|
97
97
|
|
metadata
CHANGED
@@ -1,7 +1,7 @@
|
|
1
1
|
--- !ruby/object:Gem::Specification
|
2
2
|
name: queue_classic
|
3
3
|
version: !ruby/object:Gem::Version
|
4
|
-
version: 2.1.
|
4
|
+
version: 2.1.3
|
5
5
|
prerelease:
|
6
6
|
platform: ruby
|
7
7
|
authors:
|
@@ -27,6 +27,22 @@ dependencies:
|
|
27
27
|
- - ~>
|
28
28
|
- !ruby/object:Gem::Version
|
29
29
|
version: 0.14.1
|
30
|
+
- !ruby/object:Gem::Dependency
|
31
|
+
name: multi_json
|
32
|
+
requirement: !ruby/object:Gem::Requirement
|
33
|
+
none: false
|
34
|
+
requirements:
|
35
|
+
- - ~>
|
36
|
+
- !ruby/object:Gem::Version
|
37
|
+
version: 1.7.2
|
38
|
+
type: :runtime
|
39
|
+
prerelease: false
|
40
|
+
version_requirements: !ruby/object:Gem::Requirement
|
41
|
+
none: false
|
42
|
+
requirements:
|
43
|
+
- - ~>
|
44
|
+
- !ruby/object:Gem::Version
|
45
|
+
version: 1.7.2
|
30
46
|
description: queue_classic is a queueing library for Ruby apps. (Rails, Sinatra, Etc...)
|
31
47
|
queue_classic features asynchronous job polling, database maintained locks and no
|
32
48
|
ridiculous dependencies. As a matter of fact, queue_classic only requires pg.
|
@@ -40,7 +56,6 @@ files:
|
|
40
56
|
- sql/ddl.sql
|
41
57
|
- sql/drop_ddl.sql
|
42
58
|
- lib/queue_classic/conn.rb
|
43
|
-
- lib/queue_classic/okjson.rb
|
44
59
|
- lib/queue_classic/queries.rb
|
45
60
|
- lib/queue_classic/queue.rb
|
46
61
|
- lib/queue_classic/setup.rb
|
data/lib/queue_classic/okjson.rb
DELETED
@@ -1,598 +0,0 @@
|
|
1
|
-
# encoding: UTF-8
|
2
|
-
#
|
3
|
-
# Copyright 2011, 2012 Keith Rarick
|
4
|
-
#
|
5
|
-
# Permission is hereby granted, free of charge, to any person obtaining a copy
|
6
|
-
# of this software and associated documentation files (the "Software"), to deal
|
7
|
-
# in the Software without restriction, including without limitation the rights
|
8
|
-
# to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
9
|
-
# copies of the Software, and to permit persons to whom the Software is
|
10
|
-
# furnished to do so, subject to the following conditions:
|
11
|
-
#
|
12
|
-
# The above copyright notice and this permission notice shall be included in
|
13
|
-
# all copies or substantial portions of the Software.
|
14
|
-
#
|
15
|
-
# THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
16
|
-
# IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
17
|
-
# FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
18
|
-
# AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
19
|
-
# LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
20
|
-
# OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
|
21
|
-
# THE SOFTWARE.
|
22
|
-
|
23
|
-
# See https://github.com/kr/okjson for updates.
|
24
|
-
|
25
|
-
require 'stringio'
|
26
|
-
|
27
|
-
# Some parts adapted from
|
28
|
-
# http://golang.org/src/pkg/json/decode.go and
|
29
|
-
# http://golang.org/src/pkg/utf8/utf8.go
|
30
|
-
module QC
|
31
|
-
module OkJson
|
32
|
-
extend self
|
33
|
-
|
34
|
-
|
35
|
-
# Decodes a json document in string s and
|
36
|
-
# returns the corresponding ruby value.
|
37
|
-
# String s must be valid UTF-8. If you have
|
38
|
-
# a string in some other encoding, convert
|
39
|
-
# it first.
|
40
|
-
#
|
41
|
-
# String values in the resulting structure
|
42
|
-
# will be UTF-8.
|
43
|
-
def decode(s)
|
44
|
-
ts = lex(s)
|
45
|
-
v, ts = textparse(ts)
|
46
|
-
if ts.length > 0
|
47
|
-
raise Error, 'trailing garbage'
|
48
|
-
end
|
49
|
-
v
|
50
|
-
end
|
51
|
-
|
52
|
-
|
53
|
-
# Parses a "json text" in the sense of RFC 4627.
|
54
|
-
# Returns the parsed value and any trailing tokens.
|
55
|
-
# Note: this is almost the same as valparse,
|
56
|
-
# except that it does not accept atomic values.
|
57
|
-
def textparse(ts)
|
58
|
-
if ts.length < 0
|
59
|
-
raise Error, 'empty'
|
60
|
-
end
|
61
|
-
|
62
|
-
typ, _, val = ts[0]
|
63
|
-
case typ
|
64
|
-
when '{' then objparse(ts)
|
65
|
-
when '[' then arrparse(ts)
|
66
|
-
else
|
67
|
-
raise Error, "unexpected #{val.inspect}"
|
68
|
-
end
|
69
|
-
end
|
70
|
-
|
71
|
-
|
72
|
-
# Parses a "value" in the sense of RFC 4627.
|
73
|
-
# Returns the parsed value and any trailing tokens.
|
74
|
-
def valparse(ts)
|
75
|
-
if ts.length < 0
|
76
|
-
raise Error, 'empty'
|
77
|
-
end
|
78
|
-
|
79
|
-
typ, _, val = ts[0]
|
80
|
-
case typ
|
81
|
-
when '{' then objparse(ts)
|
82
|
-
when '[' then arrparse(ts)
|
83
|
-
when :val,:str then [val, ts[1..-1]]
|
84
|
-
else
|
85
|
-
raise Error, "unexpected #{val.inspect}"
|
86
|
-
end
|
87
|
-
end
|
88
|
-
|
89
|
-
|
90
|
-
# Parses an "object" in the sense of RFC 4627.
|
91
|
-
# Returns the parsed value and any trailing tokens.
|
92
|
-
def objparse(ts)
|
93
|
-
ts = eat('{', ts)
|
94
|
-
obj = {}
|
95
|
-
|
96
|
-
if ts[0][0] == '}'
|
97
|
-
return obj, ts[1..-1]
|
98
|
-
end
|
99
|
-
|
100
|
-
k, v, ts = pairparse(ts)
|
101
|
-
obj[k] = v
|
102
|
-
|
103
|
-
if ts[0][0] == '}'
|
104
|
-
return obj, ts[1..-1]
|
105
|
-
end
|
106
|
-
|
107
|
-
loop do
|
108
|
-
ts = eat(',', ts)
|
109
|
-
|
110
|
-
k, v, ts = pairparse(ts)
|
111
|
-
obj[k] = v
|
112
|
-
|
113
|
-
if ts[0][0] == '}'
|
114
|
-
return obj, ts[1..-1]
|
115
|
-
end
|
116
|
-
end
|
117
|
-
end
|
118
|
-
|
119
|
-
|
120
|
-
# Parses a "member" in the sense of RFC 4627.
|
121
|
-
# Returns the parsed values and any trailing tokens.
|
122
|
-
def pairparse(ts)
|
123
|
-
(typ, _, k), ts = ts[0], ts[1..-1]
|
124
|
-
if typ != :str
|
125
|
-
raise Error, "unexpected #{k.inspect}"
|
126
|
-
end
|
127
|
-
ts = eat(':', ts)
|
128
|
-
v, ts = valparse(ts)
|
129
|
-
[k, v, ts]
|
130
|
-
end
|
131
|
-
|
132
|
-
|
133
|
-
# Parses an "array" in the sense of RFC 4627.
|
134
|
-
# Returns the parsed value and any trailing tokens.
|
135
|
-
def arrparse(ts)
|
136
|
-
ts = eat('[', ts)
|
137
|
-
arr = []
|
138
|
-
|
139
|
-
if ts[0][0] == ']'
|
140
|
-
return arr, ts[1..-1]
|
141
|
-
end
|
142
|
-
|
143
|
-
v, ts = valparse(ts)
|
144
|
-
arr << v
|
145
|
-
|
146
|
-
if ts[0][0] == ']'
|
147
|
-
return arr, ts[1..-1]
|
148
|
-
end
|
149
|
-
|
150
|
-
loop do
|
151
|
-
ts = eat(',', ts)
|
152
|
-
|
153
|
-
v, ts = valparse(ts)
|
154
|
-
arr << v
|
155
|
-
|
156
|
-
if ts[0][0] == ']'
|
157
|
-
return arr, ts[1..-1]
|
158
|
-
end
|
159
|
-
end
|
160
|
-
end
|
161
|
-
|
162
|
-
|
163
|
-
def eat(typ, ts)
|
164
|
-
if ts[0][0] != typ
|
165
|
-
raise Error, "expected #{typ} (got #{ts[0].inspect})"
|
166
|
-
end
|
167
|
-
ts[1..-1]
|
168
|
-
end
|
169
|
-
|
170
|
-
|
171
|
-
# Scans s and returns a list of json tokens,
|
172
|
-
# excluding white space (as defined in RFC 4627).
|
173
|
-
def lex(s)
|
174
|
-
ts = []
|
175
|
-
while s.length > 0
|
176
|
-
typ, lexeme, val = tok(s)
|
177
|
-
if typ == nil
|
178
|
-
raise Error, "invalid character at #{s[0,10].inspect}"
|
179
|
-
end
|
180
|
-
if typ != :space
|
181
|
-
ts << [typ, lexeme, val]
|
182
|
-
end
|
183
|
-
s = s[lexeme.length..-1]
|
184
|
-
end
|
185
|
-
ts
|
186
|
-
end
|
187
|
-
|
188
|
-
|
189
|
-
# Scans the first token in s and
|
190
|
-
# returns a 3-element list, or nil
|
191
|
-
# if s does not begin with a valid token.
|
192
|
-
#
|
193
|
-
# The first list element is one of
|
194
|
-
# '{', '}', ':', ',', '[', ']',
|
195
|
-
# :val, :str, and :space.
|
196
|
-
#
|
197
|
-
# The second element is the lexeme.
|
198
|
-
#
|
199
|
-
# The third element is the value of the
|
200
|
-
# token for :val and :str, otherwise
|
201
|
-
# it is the lexeme.
|
202
|
-
def tok(s)
|
203
|
-
case s[0]
|
204
|
-
when ?{ then ['{', s[0,1], s[0,1]]
|
205
|
-
when ?} then ['}', s[0,1], s[0,1]]
|
206
|
-
when ?: then [':', s[0,1], s[0,1]]
|
207
|
-
when ?, then [',', s[0,1], s[0,1]]
|
208
|
-
when ?[ then ['[', s[0,1], s[0,1]]
|
209
|
-
when ?] then [']', s[0,1], s[0,1]]
|
210
|
-
when ?n then nulltok(s)
|
211
|
-
when ?t then truetok(s)
|
212
|
-
when ?f then falsetok(s)
|
213
|
-
when ?" then strtok(s)
|
214
|
-
when Spc then [:space, s[0,1], s[0,1]]
|
215
|
-
when ?\t then [:space, s[0,1], s[0,1]]
|
216
|
-
when ?\n then [:space, s[0,1], s[0,1]]
|
217
|
-
when ?\r then [:space, s[0,1], s[0,1]]
|
218
|
-
else numtok(s)
|
219
|
-
end
|
220
|
-
end
|
221
|
-
|
222
|
-
|
223
|
-
def nulltok(s); s[0,4] == 'null' ? [:val, 'null', nil] : [] end
|
224
|
-
def truetok(s); s[0,4] == 'true' ? [:val, 'true', true] : [] end
|
225
|
-
def falsetok(s); s[0,5] == 'false' ? [:val, 'false', false] : [] end
|
226
|
-
|
227
|
-
|
228
|
-
def numtok(s)
|
229
|
-
m = /-?([1-9][0-9]+|[0-9])([.][0-9]+)?([eE][+-]?[0-9]+)?/.match(s)
|
230
|
-
if m && m.begin(0) == 0
|
231
|
-
if m[3] && !m[2]
|
232
|
-
[:val, m[0], Integer(m[1])*(10**Integer(m[3][1..-1]))]
|
233
|
-
elsif m[2]
|
234
|
-
[:val, m[0], Float(m[0])]
|
235
|
-
else
|
236
|
-
[:val, m[0], Integer(m[0])]
|
237
|
-
end
|
238
|
-
else
|
239
|
-
[]
|
240
|
-
end
|
241
|
-
end
|
242
|
-
|
243
|
-
|
244
|
-
def strtok(s)
|
245
|
-
m = /"([^"\\]|\\["\/\\bfnrt]|\\u[0-9a-fA-F]{4})*"/.match(s)
|
246
|
-
if ! m
|
247
|
-
raise Error, "invalid string literal at #{abbrev(s)}"
|
248
|
-
end
|
249
|
-
[:str, m[0], unquote(m[0])]
|
250
|
-
end
|
251
|
-
|
252
|
-
|
253
|
-
def abbrev(s)
|
254
|
-
t = s[0,10]
|
255
|
-
p = t['`']
|
256
|
-
t = t[0,p] if p
|
257
|
-
t = t + '...' if t.length < s.length
|
258
|
-
'`' + t + '`'
|
259
|
-
end
|
260
|
-
|
261
|
-
|
262
|
-
# Converts a quoted json string literal q into a UTF-8-encoded string.
|
263
|
-
# The rules are different than for Ruby, so we cannot use eval.
|
264
|
-
# Unquote will raise an error if q contains control characters.
|
265
|
-
def unquote(q)
|
266
|
-
q = q[1...-1]
|
267
|
-
a = q.dup # allocate a big enough string
|
268
|
-
rubydoesenc = false
|
269
|
-
# In ruby >= 1.9, a[w] is a codepoint, not a byte.
|
270
|
-
if a.class.method_defined?(:force_encoding)
|
271
|
-
a.force_encoding('UTF-8')
|
272
|
-
rubydoesenc = true
|
273
|
-
end
|
274
|
-
r, w = 0, 0
|
275
|
-
while r < q.length
|
276
|
-
c = q[r]
|
277
|
-
case true
|
278
|
-
when c == ?\\
|
279
|
-
r += 1
|
280
|
-
if r >= q.length
|
281
|
-
raise Error, "string literal ends with a \"\\\": \"#{q}\""
|
282
|
-
end
|
283
|
-
|
284
|
-
case q[r]
|
285
|
-
when ?",?\\,?/,?'
|
286
|
-
a[w] = q[r]
|
287
|
-
r += 1
|
288
|
-
w += 1
|
289
|
-
when ?b,?f,?n,?r,?t
|
290
|
-
a[w] = Unesc[q[r]]
|
291
|
-
r += 1
|
292
|
-
w += 1
|
293
|
-
when ?u
|
294
|
-
r += 1
|
295
|
-
uchar = begin
|
296
|
-
hexdec4(q[r,4])
|
297
|
-
rescue RuntimeError => e
|
298
|
-
raise Error, "invalid escape sequence \\u#{q[r,4]}: #{e}"
|
299
|
-
end
|
300
|
-
r += 4
|
301
|
-
if surrogate? uchar
|
302
|
-
if q.length >= r+6
|
303
|
-
uchar1 = hexdec4(q[r+2,4])
|
304
|
-
uchar = subst(uchar, uchar1)
|
305
|
-
if uchar != Ucharerr
|
306
|
-
# A valid pair; consume.
|
307
|
-
r += 6
|
308
|
-
end
|
309
|
-
end
|
310
|
-
end
|
311
|
-
if rubydoesenc
|
312
|
-
a[w] = '' << uchar
|
313
|
-
w += 1
|
314
|
-
else
|
315
|
-
w += ucharenc(a, w, uchar)
|
316
|
-
end
|
317
|
-
else
|
318
|
-
raise Error, "invalid escape char #{q[r]} in \"#{q}\""
|
319
|
-
end
|
320
|
-
when c == ?", c < Spc
|
321
|
-
raise Error, "invalid character in string literal \"#{q}\""
|
322
|
-
else
|
323
|
-
# Copy anything else byte-for-byte.
|
324
|
-
# Valid UTF-8 will remain valid UTF-8.
|
325
|
-
# Invalid UTF-8 will remain invalid UTF-8.
|
326
|
-
# In ruby >= 1.9, c is a codepoint, not a byte,
|
327
|
-
# in which case this is still what we want.
|
328
|
-
a[w] = c
|
329
|
-
r += 1
|
330
|
-
w += 1
|
331
|
-
end
|
332
|
-
end
|
333
|
-
a[0,w]
|
334
|
-
end
|
335
|
-
|
336
|
-
|
337
|
-
# Encodes unicode character u as UTF-8
|
338
|
-
# bytes in string a at position i.
|
339
|
-
# Returns the number of bytes written.
|
340
|
-
def ucharenc(a, i, u)
|
341
|
-
case true
|
342
|
-
when u <= Uchar1max
|
343
|
-
a[i] = (u & 0xff).chr
|
344
|
-
1
|
345
|
-
when u <= Uchar2max
|
346
|
-
a[i+0] = (Utag2 | ((u>>6)&0xff)).chr
|
347
|
-
a[i+1] = (Utagx | (u&Umaskx)).chr
|
348
|
-
2
|
349
|
-
when u <= Uchar3max
|
350
|
-
a[i+0] = (Utag3 | ((u>>12)&0xff)).chr
|
351
|
-
a[i+1] = (Utagx | ((u>>6)&Umaskx)).chr
|
352
|
-
a[i+2] = (Utagx | (u&Umaskx)).chr
|
353
|
-
3
|
354
|
-
else
|
355
|
-
a[i+0] = (Utag4 | ((u>>18)&0xff)).chr
|
356
|
-
a[i+1] = (Utagx | ((u>>12)&Umaskx)).chr
|
357
|
-
a[i+2] = (Utagx | ((u>>6)&Umaskx)).chr
|
358
|
-
a[i+3] = (Utagx | (u&Umaskx)).chr
|
359
|
-
4
|
360
|
-
end
|
361
|
-
end
|
362
|
-
|
363
|
-
|
364
|
-
def hexdec4(s)
|
365
|
-
if s.length != 4
|
366
|
-
raise Error, 'short'
|
367
|
-
end
|
368
|
-
(nibble(s[0])<<12) | (nibble(s[1])<<8) | (nibble(s[2])<<4) | nibble(s[3])
|
369
|
-
end
|
370
|
-
|
371
|
-
|
372
|
-
def subst(u1, u2)
|
373
|
-
if Usurr1 <= u1 && u1 < Usurr2 && Usurr2 <= u2 && u2 < Usurr3
|
374
|
-
return ((u1-Usurr1)<<10) | (u2-Usurr2) + Usurrself
|
375
|
-
end
|
376
|
-
return Ucharerr
|
377
|
-
end
|
378
|
-
|
379
|
-
|
380
|
-
def surrogate?(u)
|
381
|
-
Usurr1 <= u && u < Usurr3
|
382
|
-
end
|
383
|
-
|
384
|
-
|
385
|
-
def nibble(c)
|
386
|
-
case true
|
387
|
-
when ?0 <= c && c <= ?9 then c.ord - ?0.ord
|
388
|
-
when ?a <= c && c <= ?z then c.ord - ?a.ord + 10
|
389
|
-
when ?A <= c && c <= ?Z then c.ord - ?A.ord + 10
|
390
|
-
else
|
391
|
-
raise Error, "invalid hex code #{c}"
|
392
|
-
end
|
393
|
-
end
|
394
|
-
|
395
|
-
|
396
|
-
# Encodes x into a json text. It may contain only
|
397
|
-
# Array, Hash, String, Numeric, true, false, nil.
|
398
|
-
# (Note, this list excludes Symbol.)
|
399
|
-
# X itself must be an Array or a Hash.
|
400
|
-
# No other value can be encoded, and an error will
|
401
|
-
# be raised if x contains any other value, such as
|
402
|
-
# Nan, Infinity, Symbol, and Proc, or if a Hash key
|
403
|
-
# is not a String.
|
404
|
-
# Strings contained in x must be valid UTF-8.
|
405
|
-
def encode(x)
|
406
|
-
case x
|
407
|
-
when Hash then objenc(x)
|
408
|
-
when Array then arrenc(x)
|
409
|
-
else
|
410
|
-
raise Error, 'root value must be an Array or a Hash'
|
411
|
-
end
|
412
|
-
end
|
413
|
-
|
414
|
-
|
415
|
-
def valenc(x)
|
416
|
-
case x
|
417
|
-
when Hash then objenc(x)
|
418
|
-
when Array then arrenc(x)
|
419
|
-
when String then strenc(x)
|
420
|
-
when Numeric then numenc(x)
|
421
|
-
when true then "true"
|
422
|
-
when false then "false"
|
423
|
-
when nil then "null"
|
424
|
-
else
|
425
|
-
raise Error, "cannot encode #{x.class}: #{x.inspect}"
|
426
|
-
end
|
427
|
-
end
|
428
|
-
|
429
|
-
|
430
|
-
def objenc(x)
|
431
|
-
'{' + x.map{|k,v| keyenc(k) + ':' + valenc(v)}.join(',') + '}'
|
432
|
-
end
|
433
|
-
|
434
|
-
|
435
|
-
def arrenc(a)
|
436
|
-
'[' + a.map{|x| valenc(x)}.join(',') + ']'
|
437
|
-
end
|
438
|
-
|
439
|
-
|
440
|
-
def keyenc(k)
|
441
|
-
case k
|
442
|
-
when String then strenc(k)
|
443
|
-
else
|
444
|
-
raise Error, "Hash key is not a string: #{k.inspect}"
|
445
|
-
end
|
446
|
-
end
|
447
|
-
|
448
|
-
|
449
|
-
def strenc(s)
|
450
|
-
t = StringIO.new
|
451
|
-
t.putc(?")
|
452
|
-
r = 0
|
453
|
-
|
454
|
-
# In ruby >= 1.9, s[r] is a codepoint, not a byte.
|
455
|
-
rubydoesenc = s.class.method_defined?(:encoding)
|
456
|
-
|
457
|
-
while r < s.length
|
458
|
-
case s[r]
|
459
|
-
when ?" then t.print('\\"')
|
460
|
-
when ?\\ then t.print('\\\\')
|
461
|
-
when ?\b then t.print('\\b')
|
462
|
-
when ?\f then t.print('\\f')
|
463
|
-
when ?\n then t.print('\\n')
|
464
|
-
when ?\r then t.print('\\r')
|
465
|
-
when ?\t then t.print('\\t')
|
466
|
-
else
|
467
|
-
c = s[r]
|
468
|
-
case true
|
469
|
-
when rubydoesenc
|
470
|
-
begin
|
471
|
-
c.ord # will raise an error if c is invalid UTF-8
|
472
|
-
t.write(c)
|
473
|
-
rescue
|
474
|
-
t.write(Ustrerr)
|
475
|
-
end
|
476
|
-
when Spc <= c && c <= ?~
|
477
|
-
t.putc(c)
|
478
|
-
else
|
479
|
-
n = ucharcopy(t, s, r) # ensure valid UTF-8 output
|
480
|
-
r += n - 1 # r is incremented below
|
481
|
-
end
|
482
|
-
end
|
483
|
-
r += 1
|
484
|
-
end
|
485
|
-
t.putc(?")
|
486
|
-
t.string
|
487
|
-
end
|
488
|
-
|
489
|
-
|
490
|
-
def numenc(x)
|
491
|
-
if ((x.nan? || x.infinite?) rescue false)
|
492
|
-
raise Error, "Numeric cannot be represented: #{x}"
|
493
|
-
end
|
494
|
-
"#{x}"
|
495
|
-
end
|
496
|
-
|
497
|
-
|
498
|
-
# Copies the valid UTF-8 bytes of a single character
|
499
|
-
# from string s at position i to I/O object t, and
|
500
|
-
# returns the number of bytes copied.
|
501
|
-
# If no valid UTF-8 char exists at position i,
|
502
|
-
# ucharcopy writes Ustrerr and returns 1.
|
503
|
-
def ucharcopy(t, s, i)
|
504
|
-
n = s.length - i
|
505
|
-
raise Utf8Error if n < 1
|
506
|
-
|
507
|
-
c0 = s[i].ord
|
508
|
-
|
509
|
-
# 1-byte, 7-bit sequence?
|
510
|
-
if c0 < Utagx
|
511
|
-
t.putc(c0)
|
512
|
-
return 1
|
513
|
-
end
|
514
|
-
|
515
|
-
raise Utf8Error if c0 < Utag2 # unexpected continuation byte?
|
516
|
-
|
517
|
-
raise Utf8Error if n < 2 # need continuation byte
|
518
|
-
c1 = s[i+1].ord
|
519
|
-
raise Utf8Error if c1 < Utagx || Utag2 <= c1
|
520
|
-
|
521
|
-
# 2-byte, 11-bit sequence?
|
522
|
-
if c0 < Utag3
|
523
|
-
raise Utf8Error if ((c0&Umask2)<<6 | (c1&Umaskx)) <= Uchar1max
|
524
|
-
t.putc(c0)
|
525
|
-
t.putc(c1)
|
526
|
-
return 2
|
527
|
-
end
|
528
|
-
|
529
|
-
# need second continuation byte
|
530
|
-
raise Utf8Error if n < 3
|
531
|
-
|
532
|
-
c2 = s[i+2].ord
|
533
|
-
raise Utf8Error if c2 < Utagx || Utag2 <= c2
|
534
|
-
|
535
|
-
# 3-byte, 16-bit sequence?
|
536
|
-
if c0 < Utag4
|
537
|
-
u = (c0&Umask3)<<12 | (c1&Umaskx)<<6 | (c2&Umaskx)
|
538
|
-
raise Utf8Error if u <= Uchar2max
|
539
|
-
t.putc(c0)
|
540
|
-
t.putc(c1)
|
541
|
-
t.putc(c2)
|
542
|
-
return 3
|
543
|
-
end
|
544
|
-
|
545
|
-
# need third continuation byte
|
546
|
-
raise Utf8Error if n < 4
|
547
|
-
c3 = s[i+3].ord
|
548
|
-
raise Utf8Error if c3 < Utagx || Utag2 <= c3
|
549
|
-
|
550
|
-
# 4-byte, 21-bit sequence?
|
551
|
-
if c0 < Utag5
|
552
|
-
u = (c0&Umask4)<<18 | (c1&Umaskx)<<12 | (c2&Umaskx)<<6 | (c3&Umaskx)
|
553
|
-
raise Utf8Error if u <= Uchar3max
|
554
|
-
t.putc(c0)
|
555
|
-
t.putc(c1)
|
556
|
-
t.putc(c2)
|
557
|
-
t.putc(c3)
|
558
|
-
return 4
|
559
|
-
end
|
560
|
-
|
561
|
-
raise Utf8Error
|
562
|
-
rescue Utf8Error
|
563
|
-
t.write(Ustrerr)
|
564
|
-
return 1
|
565
|
-
end
|
566
|
-
|
567
|
-
|
568
|
-
class Utf8Error < ::StandardError
|
569
|
-
end
|
570
|
-
|
571
|
-
|
572
|
-
class Error < ::StandardError
|
573
|
-
end
|
574
|
-
|
575
|
-
|
576
|
-
Utagx = 0x80 # 1000 0000
|
577
|
-
Utag2 = 0xc0 # 1100 0000
|
578
|
-
Utag3 = 0xe0 # 1110 0000
|
579
|
-
Utag4 = 0xf0 # 1111 0000
|
580
|
-
Utag5 = 0xF8 # 1111 1000
|
581
|
-
Umaskx = 0x3f # 0011 1111
|
582
|
-
Umask2 = 0x1f # 0001 1111
|
583
|
-
Umask3 = 0x0f # 0000 1111
|
584
|
-
Umask4 = 0x07 # 0000 0111
|
585
|
-
Uchar1max = (1<<7) - 1
|
586
|
-
Uchar2max = (1<<11) - 1
|
587
|
-
Uchar3max = (1<<16) - 1
|
588
|
-
Ucharerr = 0xFFFD # unicode "replacement char"
|
589
|
-
Ustrerr = "\xef\xbf\xbd" # unicode "replacement char"
|
590
|
-
Usurrself = 0x10000
|
591
|
-
Usurr1 = 0xd800
|
592
|
-
Usurr2 = 0xdc00
|
593
|
-
Usurr3 = 0xe000
|
594
|
-
|
595
|
-
Spc = ' '[0]
|
596
|
-
Unesc = {?b=>?\b, ?f=>?\f, ?n=>?\n, ?r=>?\r, ?t=>?\t}
|
597
|
-
end
|
598
|
-
end
|