forked from toffaletti/libten
-
Notifications
You must be signed in to change notification settings - Fork 0
/
json.cc
424 lines (389 loc) · 11.9 KB
/
json.cc
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
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
#include "ten/json.hh"
#include "ten/error.hh"
#include "ten/logging.hh"
#include <boost/lexical_cast.hpp>
#include <sstream>
#include <deque>
namespace ten {
using namespace std;
//----------------------------------------------------------------
// to/from JSON strings and streams
//
extern "C" {
static int ostream_json_dump_callback(const char *buffer, size_t size, void *osptr) {
ostream *o = (ostream *)osptr;
o->write(buffer, size);
return 0;
}
} // "C"
ostream & operator << (ostream &o, const json_t *j) {
if (j)
json_dump_callback(j, ostream_json_dump_callback, &o, JSON_ENCODE_ANY);
return o;
}
string json::dump(unsigned flags) const {
ostringstream ss;
if (_p)
json_dump_callback(_p.get(), ostream_json_dump_callback, static_cast<ostream *>(&ss), flags);
return ss.str();
}
json json::load(const char *s, size_t len, unsigned flags) {
json_error_t err;
json j(json_loadb(s, len, flags, &err), json_take);
if (!j)
throw errorx("%s", err.text);
return j;
}
//
// metaprogramming for conversions
//
// json integer
template <class T> inline T integral_cast(const json &j) {
if (!j.is_integer()) throw errorx("not integral: %s", j.dump().c_str());
auto i = j.integer();
if ((numeric_limits<T>::is_signed
? i < numeric_limits<T>::min()
: i < 0)
|| i > numeric_limits<T>::max())
throw errorx("%lld: out of range for %s", i, typeid(T).name());
return static_cast<T>(i);
};
template <> short json_traits_conv<short >::cast(const json &j) { return integral_cast<short >(j); }
template <> int json_traits_conv<int >::cast(const json &j) { return integral_cast<int >(j); }
template <> long json_traits_conv<long >::cast(const json &j) { return integral_cast<long >(j); }
template <> long long json_traits_conv<long long >::cast(const json &j) { return integral_cast<long long >(j); }
template <> unsigned json_traits_conv<unsigned >::cast(const json &j) { return integral_cast<unsigned >(j); }
#if ULONG_MAX < LLONG_MAX
template <> unsigned long json_traits_conv<unsigned long>::cast(const json &j) { return integral_cast<unsigned long>(j); }
#endif
// json string
template <> string json_traits_conv<string>::cast(const json &j) {
if (!j.is_string()) throw errorx("not string: %s", j.dump().c_str());
return j.str();
}
// json real
template <> double json_traits_conv<double>::cast(const json &j) {
if (!j.is_real()) throw errorx("not real: %s", j.dump().c_str());
return j.real();
}
template <> float json_traits_conv<float>::cast(const json &j) {
if (!j.is_real()) throw errorx("not real: %s", j.dump().c_str());
auto n = j.real();
if (n < numeric_limits<float>::min() || n > numeric_limits<float>::max())
throw errorx("out of range for float: %g", n);
return j.real();
}
// json boolean
template <> bool json_traits_conv<bool>::cast(const json &j) {
if (!j.is_boolean()) throw errorx("not boolean: %s", j.dump().c_str());
return j.boolean();
}
//
// simple visit of all objects
//
#ifdef TEN_JSON_CXX11
void json::visit(const json::visitor_func_t &visitor) {
if (is_object()) {
for (auto kv : obj()) {
if (!visitor(get(), kv.first, kv.second.get()))
return;
json(kv.second).visit(visitor);
}
}
else if (is_array()) {
for (auto j : arr()) {
json(j).visit(visitor);
}
}
}
#else
void json::visit(const json::visitor_func_t &visitor) {
if (is_object()) {
for (auto kv = obj().begin(); kv != obj().end(); ++kv) {
if (!visitor(get(), (*kv).first, (*kv).second.get()))
return;
json((*kv).second).visit(visitor);
}
}
else if (is_array()) {
for (auto j = arr().begin(); j != arr().end(); ++j) {
(*j).visit(visitor);
}
}
}
#endif
//
// path
//
static ostream & operator << (ostream &o, const vector<string> &v) {
for (size_t i = 0; i < v.size(); ++i) {
if (i) o << " ";
o << v[i];
}
return o;
}
static void add_result(json &result, json r) {
if (r.is_array())
result.concat(r);
else
result.push(r);
}
static bool next_path_token(const string &path, size_t &i, string &tok) {
size_t start = i;
bool inquotes = false;
while (i < path.size()) {
switch (path[i]) {
case '/':
case '*':
case '[':
case ']':
case ':':
case ',':
case '=':
if (!inquotes)
goto done;
break;
case '"':
if (inquotes) {
++i;
goto done;
}
inquotes = true;
break;
}
++i;
}
done:
if (start == i) ++i;
tok.assign(path.substr(start, i - start));
VLOG(5) << "tok: " << tok;
return !tok.empty();
}
#ifdef TEN_JSON_CXX11
static void recursive_elements(json root, json &result, const string &match) {
if (root.is_object()) {
for (auto kv : root.obj()) {
if (kv.first == match)
add_result(result, kv.second);
recursive_elements(json(kv.second), result, match);
}
}
else if (root.is_array()) {
for (auto el : root.arr())
recursive_elements(el, result, match);
}
}
static void match_node(json root, json &result, const string &match) {
if (root.is_object()) {
if (match == "*") {
for (auto kv : root.obj())
add_result(result, kv.second);
}
else {
add_result(result, root[match]);
}
}
else if (root.is_array()) {
for (auto r : root.arr())
match_node(r, result, match);
}
}
#else
static void recursive_elements(json root, json &result, const string &match) {
if (root.is_object()) {
for (auto kv = root.obegin(); kv != root.oend(); ++kv) {
if ((*kv).first == match)
add_result(result, (*kv).second);
recursive_elements(json((*kv).second), result, match);
}
}
else if (root.is_array()) {
for (auto el = root.abegin(); el != root.aend(); ++el)
recursive_elements(*el, result, match);
}
}
static void match_node(json root, json &result, const string &match) {
if (root.is_object()) {
if (match == "*") {
for (auto kv = root.obegin(); kv != root.oend(); ++kv) {
add_result(result, (*kv).second);
}
}
else {
add_result(result, root[match]);
}
}
else if (root.is_array()) {
for (auto el = root.abegin(); el != root.aend(); ++el) {
match_node(*el, result, match);
}
}
}
#endif
static void select_node(json &result, deque<string> &tokens) {
tokens.pop_front(); // remove '/'
if (tokens.empty()) {
return;
} else if (tokens.front() == "/") {
// recursive decent!
tokens.pop_front();
string match = tokens.front();
tokens.pop_front();
json tmp(json::array());
recursive_elements(result, tmp, match);
result = tmp;
} else {
string match = tokens.front();
if (match == "[") return;
tokens.pop_front();
json tmp(json::array());
match_node(result, tmp, match);
result = (tmp.asize() == 1) ? tmp[0] : tmp;
}
}
#ifdef TEN_JSON_CXX11
static void slice_op(json &result, deque<string> &tokens) {
tokens.pop_front();
vector<string> args;
while (!tokens.empty() && tokens.front() != "]") {
args.push_back(tokens.front());
tokens.pop_front();
}
if (tokens.empty())
throw errorx("path query missing ]");
tokens.pop_front(); // pop ']'
DVLOG(5) << "args: " << args;
if (args.size() == 1) {
try {
size_t index = boost::lexical_cast<size_t>(args.front());
result = result[index];
} catch (boost::bad_lexical_cast &e) {
string key = args.front();
auto tmp(json::array());
for (auto r : result.arr()) {
if (r[key])
add_result(tmp, r);
}
result = tmp;
}
} else if (args.size() == 3) {
string op = args[1];
if (op == ":") {
// TODO: make slice ranges work
//ssize_t start = boost::lexical_cast<ssize_t>(args[0]);
//ssize_t end = boost::lexical_cast<ssize_t>(args[2]);
}
else if (op == "=") {
string key = args[0];
json filter(json::load(args[2]));
DVLOG(5) << "filter: " << filter;
json tmp(json::array());
for (auto r : result.arr()) {
if (r[key] == filter)
add_result(tmp, r);
}
result = tmp;
}
}
}
json json::path(const string &path) {
size_t i = 0;
string tok;
deque<string> tokens;
while (next_path_token(path, i, tok))
tokens.push_back(tok);
json result = *this;
while (!tokens.empty()) {
if (tokens.front() == "/") {
// select current node
select_node(result, tokens);
}
else if (tokens.front() == "*") {
tokens.pop_front();
if (result.is_object()) {
auto tmp(json::array());
for (auto kv : result.obj())
tmp.push(kv.second);
result = tmp;
}
}
else if (tokens.front() == "[") {
slice_op(result, tokens);
}
}
return result;
}
#else
static void slice_op(json &result, deque<string> &tokens) {
tokens.pop_front();
vector<string> args;
while (!tokens.empty() && tokens.front() != "]") {
args.push_back(tokens.front());
tokens.pop_front();
}
if (tokens.empty())
throw errorx("path query missing ]");
tokens.pop_front(); // pop ']'
DVLOG(5) << "args: " << args;
if (args.size() == 1) {
try {
size_t index = boost::lexical_cast<size_t>(args.front());
result = result[index];
} catch (boost::bad_lexical_cast &e) {
string key = args.front();
auto tmp(json::array());
for (auto r = result.abegin(); r != result.aend(); ++r) {
if ((*r)[key])
add_result(tmp, *r);
}
result = tmp;
}
} else if (args.size() == 3) {
string op = args[1];
if (op == ":") {
// TODO: make slice ranges work
//ssize_t start = boost::lexical_cast<ssize_t>(args[0]);
//ssize_t end = boost::lexical_cast<ssize_t>(args[2]);
}
else if (op == "=") {
string key = args[0];
json filter(json::load(args[2]));
DVLOG(5) << "filter: " << filter;
json tmp(json::array());
for (auto r = result.abegin(); r != result.aend(); ++r) {
if ((*r)[key] == filter)
add_result(tmp, *r);
}
result = tmp;
}
}
}
json json::path(const string &path_) {
size_t i = 0;
string tok;
deque<string> tokens;
while (next_path_token(path_, i, tok))
tokens.push_back(tok);
json result = *this;
while (!tokens.empty()) {
if (tokens.front() == "/") {
// select current node
select_node(result, tokens);
}
else if (tokens.front() == "*") {
tokens.pop_front();
if (result.is_object()) {
auto tmp(json::array());
for (auto kv = result.obegin(); kv != result.oend(); ++kv)
tmp.push((*kv).second);
result = tmp;
}
}
else if (tokens.front() == "[") {
slice_op(result, tokens);
}
}
return result;
}
#endif
} // TS