FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
librime-lua-script/lua/tools/json.lua at main · shewer/librime-lua-script · GitHub
shewer
librime-lua-script
Repository navigation
Code
Issues
4
(4)
Pull requests
Actions
Projects
Wiki
Security and quality
Insights
Expand file tree
Breadcrumbs
librime-lua-script
/
lua
/
tools
/
json.lua
Copy path
More file actions
More file actions
Latest commit
History
History
History
executable file
·
400 lines (339 loc) · 9.78 KB
Breadcrumbs
librime-lua-script
/
lua
/
tools
/
json.lua
Copy path
File metadata and controls
executable file
·
400 lines (339 loc) · 9.78 KB
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
--
--
json.lua
--
--
Copyright (c) 2018 rxi
--
--
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.
--
local
json
=
{
_version
=
"
0.1.1
"
}
----
---------------------------------------------------------------------------
--
Encode
----
---------------------------------------------------------------------------
local
encode
local
escape_char_map
=
{
[
"
\\
"
]
=
"
\\\\
"
,
[
"
\"
"
]
=
"
\\\"
"
,
[
"
\b
"
]
=
"
\\
b
"
,
[
"
\f
"
]
=
"
\\
f
"
,
[
"
\n
"
]
=
"
\\
n
"
,
[
"
\r
"
]
=
"
\\
r
"
,
[
"
\t
"
]
=
"
\\
t
"
,
}
local
escape_char_map_inv
=
{ [
"
\\
/
"
]
=
"
/
"
}
for
k
,
v
in
pairs
(
escape_char_map
)
do
escape_char_map_inv
[
v
]
=
k
end
local
function
escape_char
(
c
)
return
escape_char_map
[
c
]
or
string.format
(
"
\\
u%04x
"
,
c
:
byte
())
end
local
function
encode_nil
(
val
)
return
"
null
"
end
local
function
encode_table
(
val
,
stack
)
local
res
=
{}
stack
=
stack
or
{}
--
Circular reference?
if
stack
[
val
]
then
error
(
"
circular reference
"
)
end
stack
[
val
]
=
true
if
val
[
1
]
~=
nil
or
next
(
val
)
==
nil
then
--
Treat as array -- check keys are valid and it is not sparse
local
n
=
0
for
k
in
pairs
(
val
)
do
if
type
(
k
)
~=
"
number
"
then
error
(
"
invalid table: mixed or invalid key types
"
)
end
n
=
n
+
1
end
if
n
~=
#
val
then
error
(
"
invalid table: sparse array
"
)
end
--
Encode
for
i
,
v
in
ipairs
(
val
)
do
table.insert
(
res
,
encode
(
v
,
stack
))
end
stack
[
val
]
=
nil
return
"
[
"
..
table.concat
(
res
,
"
,
"
)
..
"
]
"
else
--
Treat as an object
for
k
,
v
in
pairs
(
val
)
do
if
type
(
k
)
~=
"
string
"
then
error
(
"
invalid table: mixed or invalid key types
"
)
end
table.insert
(
res
,
encode
(
k
,
stack
)
..
"
:
"
..
encode
(
v
,
stack
))
end
stack
[
val
]
=
nil
return
"
{
"
..
table.concat
(
res
,
"
,
"
)
..
"
}
"
end
end
local
function
encode_string
(
val
)
return
'
"
'
..
val
:
gsub
(
'
[%z
\1
-
\31
\\
"]
'
,
escape_char
)
..
'
"
'
end
local
function
encode_number
(
val
)
--
Check for NaN, -inf and inf
if
val
~=
val
or
val
<=
-
math.huge
or
val
>=
math.huge
then
error
(
"
unexpected number value '
"
..
tostring
(
val
)
..
"
'
"
)
end
return
string.format
(
"
%.14g
"
,
val
)
end
local
type_func_map
=
{
[
"
nil
"
]
=
encode_nil
,
[
"
table
"
]
=
encode_table
,
[
"
string
"
]
=
encode_string
,
[
"
number
"
]
=
encode_number
,
[
"
boolean
"
]
=
tostring
,
}
encode
=
function
(
val
,
stack
)
local
t
=
type
(
val
)
local
f
=
type_func_map
[
t
]
if
f
then
return
f
(
val
,
stack
)
end
error
(
"
unexpected type '
"
..
t
..
"
'
"
)
end
function
json
.
encode
(
val
)
return
(
encode
(
val
) )
end
----
---------------------------------------------------------------------------
--
Decode
----
---------------------------------------------------------------------------
local
parse
local
function
create_set
(...)
local
res
=
{}
for
i
=
1
,
select
(
"
#
"
,
...
)
do
res
[
select
(
i
,
...
) ]
=
true
end
return
res
end
local
space_chars
=
create_set
(
"
"
,
"
\t
"
,
"
\r
"
,
"
\n
"
)
local
delim_chars
=
create_set
(
"
"
,
"
\t
"
,
"
\r
"
,
"
\n
"
,
"
]
"
,
"
}
"
,
"
,
"
)
local
escape_chars
=
create_set
(
"
\\
"
,
"
/
"
,
'
"
'
,
"
b
"
,
"
f
"
,
"
n
"
,
"
r
"
,
"
t
"
,
"
u
"
)
local
literals
=
create_set
(
"
true
"
,
"
false
"
,
"
null
"
)
local
literal_map
=
{
[
"
true
"
]
=
true
,
[
"
false
"
]
=
false
,
[
"
null
"
]
=
nil
,
}
local
function
next_char
(
str
,
idx
,
set
,
negate
)
for
i
=
idx
,
#
str
do
if
set
[
str
:
sub
(
i
,
i
)]
~=
negate
then
return
i
end
end
return
#
str
+
1
end
local
function
decode_error
(
str
,
idx
,
msg
)
local
line_count
=
1
local
col_count
=
1
for
i
=
1
,
idx
-
1
do
col_count
=
col_count
+
1
if
str
:
sub
(
i
,
i
)
==
"
\n
"
then
line_count
=
line_count
+
1
col_count
=
1
end
end
error
(
string.format
(
"
%s at line %d col %d
"
,
msg
,
line_count
,
col_count
) )
end
local
function
codepoint_to_utf8
(
n
)
--
http://scripts.sil.org/cms/scripts/page.php?site_id=nrsi&id=iws-appendixa
local
f
=
math.floor
if
n
<=
0x7f
then
return
string.char
(
n
)
elseif
n
<=
0x7ff
then
return
string.char
(
f
(
n
/
64
)
+
192
,
n
%
64
+
128
)
elseif
n
<=
0xffff
then
return
string.char
(
f
(
n
/
4096
)
+
224
,
f
(
n
%
4096
/
64
)
+
128
,
n
%
64
+
128
)
elseif
n
<=
0x10ffff
then
return
string.char
(
f
(
n
/
262144
)
+
240
,
f
(
n
%
262144
/
4096
)
+
128
,
f
(
n
%
4096
/
64
)
+
128
,
n
%
64
+
128
)
end
error
(
string.format
(
"
invalid unicode codepoint '%x'
"
,
n
) )
end
local
function
parse_unicode_escape
(
s
)
local
n1
=
tonumber
(
s
:
sub
(
3
,
6
),
16
)
local
n2
=
tonumber
(
s
:
sub
(
9
,
12
),
16
)
--
Surrogate pair?
if
n2
then
return
codepoint_to_utf8
((
n1
-
0xd800
)
*
0x400
+
(
n2
-
0xdc00
)
+
0x10000
)
else
return
codepoint_to_utf8
(
n1
)
end
end
local
function
parse_string
(
str
,
i
)
local
has_unicode_escape
=
false
local
has_surrogate_escape
=
false
local
has_escape
=
false
local
last
for
j
=
i
+
1
,
#
str
do
local
x
=
str
:
byte
(
j
)
if
x
<
32
then
decode_error
(
str
,
j
,
"
control character in string
"
)
end
if
last
==
92
then
--
"\\" (escape char)
if
x
==
117
then
--
"u" (unicode escape sequence)
local
hex
=
str
:
sub
(
j
+
1
,
j
+
5
)
if
not
hex
:
find
(
"
%x%x%x%x
"
)
then
decode_error
(
str
,
j
,
"
invalid unicode escape in string
"
)
end
if
hex
:
find
(
"
^[dD][89aAbB]
"
)
then
has_surrogate_escape
=
true
else
has_unicode_escape
=
true
end
else
local
c
=
string.char
(
x
)
if
not
escape_chars
[
c
]
then
decode_error
(
str
,
j
,
"
invalid escape char '
"
..
c
..
"
' in string
"
)
end
has_escape
=
true
end
last
=
nil
elseif
x
==
34
then
--
'"' (end of string)
local
s
=
str
:
sub
(
i
+
1
,
j
-
1
)
if
has_surrogate_escape
then
s
=
s
:
gsub
(
"
\\
u[dD][89aAbB]..
\\
u....
"
,
parse_unicode_escape
)
end
if
has_unicode_escape
then
s
=
s
:
gsub
(
"
\\
u....
"
,
parse_unicode_escape
)
end
if
has_escape
then
s
=
s
:
gsub
(
"
\\
.
"
,
escape_char_map_inv
)
end
return
s
,
j
+
1
else
last
=
x
end
end
decode_error
(
str
,
i
,
"
expected closing quote for string
"
)
end
local
function
parse_number
(
str
,
i
)
local
x
=
next_char
(
str
,
i
,
delim_chars
)
local
s
=
str
:
sub
(
i
,
x
-
1
)
local
n
=
tonumber
(
s
)
if
not
n
then
decode_error
(
str
,
i
,
"
invalid number '
"
..
s
..
"
'
"
)
end
return
n
,
x
end
local
function
parse_literal
(
str
,
i
)
local
x
=
next_char
(
str
,
i
,
delim_chars
)
local
word
=
str
:
sub
(
i
,
x
-
1
)
if
not
literals
[
word
]
then
decode_error
(
str
,
i
,
"
invalid literal '
"
..
word
..
"
'
"
)
end
return
literal_map
[
word
],
x
end
local
function
parse_array
(
str
,
i
)
local
res
=
{}
local
n
=
1
i
=
i
+
1
while
1
do
local
x
i
=
next_char
(
str
,
i
,
space_chars
,
true
)
--
Empty / end of array?
if
str
:
sub
(
i
,
i
)
==
"
]
"
then
i
=
i
+
1
break
end
--
Read token
x
,
i
=
parse
(
str
,
i
)
res
[
n
]
=
x
n
=
n
+
1
--
Next token
i
=
next_char
(
str
,
i
,
space_chars
,
true
)
local
chr
=
str
:
sub
(
i
,
i
)
i
=
i
+
1
if
chr
==
"
]
"
then
break
end
if
chr
~=
"
,
"
then
decode_error
(
str
,
i
,
"
expected ']' or ','
"
)
end
end
return
res
,
i
end
local
function
parse_object
(
str
,
i
)
local
res
=
{}
i
=
i
+
1
while
1
do
local
key
,
val
i
=
next_char
(
str
,
i
,
space_chars
,
true
)
--
Empty / end of object?
if
str
:
sub
(
i
,
i
)
==
"
}
"
then
i
=
i
+
1
break
end
--
Read key
if
str
:
sub
(
i
,
i
)
~=
'
"
'
then
decode_error
(
str
,
i
,
"
expected string for key
"
)
end
key
,
i
=
parse
(
str
,
i
)
--
Read ':' delimiter
i
=
next_char
(
str
,
i
,
space_chars
,
true
)
if
str
:
sub
(
i
,
i
)
~=
"
:
"
then
decode_error
(
str
,
i
,
"
expected ':' after key
"
)
end
i
=
next_char
(
str
,
i
+
1
,
space_chars
,
true
)
--
Read value
val
,
i
=
parse
(
str
,
i
)
--
Set
res
[
key
]
=
val
--
Next token
i
=
next_char
(
str
,
i
,
space_chars
,
true
)
local
chr
=
str
:
sub
(
i
,
i
)
i
=
i
+
1
if
chr
==
"
}
"
then
break
end
if
chr
~=
"
,
"
then
decode_error
(
str
,
i
,
"
expected '}' or ','
"
)
end
end
return
res
,
i
end
local
char_func_map
=
{
[
'
"
'
]
=
parse_string
,
[
"
0
"
]
=
parse_number
,
[
"
1
"
]
=
parse_number
,
[
"
2
"
]
=
parse_number
,
[
"
3
"
]
=
parse_number
,
[
"
4
"
]
=
parse_number
,
[
"
5
"
]
=
parse_number
,
[
"
6
"
]
=
parse_number
,
[
"
7
"
]
=
parse_number
,
[
"
8
"
]
=
parse_number
,
[
"
9
"
]
=
parse_number
,
[
"
-
"
]
=
parse_number
,
[
"
t
"
]
=
parse_literal
,
[
"
f
"
]
=
parse_literal
,
[
"
n
"
]
=
parse_literal
,
[
"
[
"
]
=
parse_array
,
[
"
{
"
]
=
parse_object
,
}
parse
=
function
(
str
,
idx
)
local
chr
=
str
:
sub
(
idx
,
idx
)
local
f
=
char_func_map
[
chr
]
if
f
then
return
f
(
str
,
idx
)
end
decode_error
(
str
,
idx
,
"
unexpected character '
"
..
chr
..
"
'
"
)
end
function
json
.
decode
(
str
)
if
type
(
str
)
~=
"
string
"
then
error
(
"
expected argument of type string, got
"
..
type
(
str
))
end
local
res
,
idx
=
parse
(
str
,
next_char
(
str
,
1
,
space_chars
,
true
))
idx
=
next_char
(
str
,
idx
,
space_chars
,
true
)
if
idx
<=
#
str
then
decode_error
(
str
,
idx
,
"
trailing garbage
"
)
end
return
res
end
return
json
Back
|
FazBrowse Home
|
New Git URL