-
Notifications
You must be signed in to change notification settings - Fork 496
Expand file tree
/
Copy pathExpressionJSONHelpers.cxx
More file actions
875 lines (796 loc) · 24.1 KB
/
ExpressionJSONHelpers.cxx
File metadata and controls
875 lines (796 loc) · 24.1 KB
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
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
// Copyright 2019-2025 CERN and copyright holders of ALICE O2.
// See https://alice-o2.web.cern.ch/copyright for details of the copyright holders.
// All rights not expressly granted are reserved.
//
// This software is distributed under the terms of the GNU General Public
// License v3 (GPL Version 3), copied verbatim in the file "COPYING".
//
// In applying this license CERN does not waive the privileges and immunities
// granted to it by virtue of its status as an Intergovernmental Organization
// or submit itself to any jurisdiction.
#include "ExpressionJSONHelpers.h"
#include <rapidjson/reader.h>
#include <rapidjson/prettywriter.h>
#include <rapidjson/istreamwrapper.h>
#include <rapidjson/ostreamwrapper.h>
#include <rapidjson/error/en.h>
#include <stack>
#include <iostream>
#include "Framework/VariantHelpers.h"
namespace o2::framework
{
namespace
{
using nodes = expressions::Node::self_t;
enum struct Nodes : int {
NLITERAL = 0,
NBINDING = 1,
NOP = 2,
NNPH = 3,
NCOND = 4,
NPAR = 5
};
enum struct ToWrite {
FULL,
LEFT,
RIGHT,
COND,
POP
};
struct Entry {
expressions::Node* ptr = nullptr;
ToWrite toWrite = ToWrite::FULL;
};
std::array<std::string_view, 11> validKeys{
"projectors",
"kind",
"binding",
"index",
"arrow_type",
"value",
"hash",
"operation",
"left",
"right",
"condition"};
struct ExpressionReader : public rapidjson::BaseReaderHandler<rapidjson::UTF8<>, ExpressionReader> {
using Ch = rapidjson::UTF8<>::Ch;
using SizeType = rapidjson::SizeType;
enum struct State {
IN_START, // global start
IN_LIST, // opening brace of the list
IN_ROOT, // after encountering the opening of the expression object
IN_LEFT, // in "left" key - subexpression
IN_RIGHT, // in "right" key - subexpression
IN_COND, // in "condition" key - subexpression
IN_NODE_LITERAL, // in literal node
IN_NODE_BINDING, // in binding node
IN_NODE_OP, // in operation node
IN_NODE_CONDITIONAL, // in conditional node
IN_ERROR // generic error state
};
std::stack<State> states;
std::stack<Entry> path;
std::ostringstream debug;
std::vector<expressions::Projector> result;
std::unique_ptr<expressions::Node> rootNode = nullptr;
std::unique_ptr<expressions::Node> node = nullptr;
expressions::LiteralValue::stored_type value;
atype::type type;
Nodes kind;
std::string binding;
BasicOp operation;
uint32_t hash;
size_t index;
std::string previousKey;
std::string currentKey;
ExpressionReader()
{
debug << ">>> Start" << std::endl;
states.push(State::IN_START);
}
bool StartArray()
{
debug << "StartArray()" << std::endl;
if (states.top() == State::IN_START) {
states.push(State::IN_LIST);
return true;
}
states.push(State::IN_ERROR);
return false;
}
bool EndArray(SizeType)
{
debug << "EndArray()" << std::endl;
if (states.top() == State::IN_LIST) {
states.pop();
return true;
}
states.push(State::IN_ERROR);
return false;
}
bool Key(const Ch* str, SizeType, bool)
{
debug << "Key(" << str << ")" << std::endl;
previousKey = currentKey;
currentKey = str;
if (std::find(validKeys.begin(), validKeys.end(), currentKey) == validKeys.end()) {
states.push(State::IN_ERROR);
return false;
}
if (states.top() == State::IN_START) {
if (currentKey.compare("projectors") == 0) {
return true;
}
}
if (states.top() == State::IN_ROOT) {
if (currentKey.compare("kind") == 0) {
return true;
} else {
states.push(State::IN_ERROR); // should start from root node
return false;
}
}
if (states.top() == State::IN_LEFT || states.top() == State::IN_RIGHT || states.top() == State::IN_COND) {
if (currentKey.compare("kind") == 0) {
return true;
}
}
if (states.top() == State::IN_NODE_LITERAL || states.top() == State::IN_NODE_OP || states.top() == State::IN_NODE_BINDING || states.top() == State::IN_NODE_CONDITIONAL) {
if (currentKey.compare("index") == 0) {
return true;
}
if (currentKey.compare("left") == 0) {
// this is the point where the node header is parsed and we can create it
// create a new node instance here and set a pointer to it in a parent (current stack top), based on its state
// push the new node into the stack with LEFT state
switch (states.top()) {
case State::IN_NODE_LITERAL:
node = std::make_unique<expressions::Node>(expressions::LiteralNode{value, type});
break;
case State::IN_NODE_BINDING:
node = std::make_unique<expressions::Node>(expressions::BindingNode{hash, type}, binding);
break;
case State::IN_NODE_OP:
node = std::make_unique<expressions::Node>(expressions::OpNode{operation}, expressions::LiteralNode{-1});
break;
case State::IN_NODE_CONDITIONAL:
node = std::make_unique<expressions::Node>(expressions::ConditionalNode{}, expressions::LiteralNode{-1}, expressions::LiteralNode{-1}, expressions::LiteralNode{true});
break;
default:
states.push(State::IN_ERROR);
return false;
}
if (path.empty()) {
rootNode = std::move(node);
path.emplace(rootNode.get(), ToWrite::LEFT);
} else {
auto* n = path.top().ptr;
switch (path.top().toWrite) {
case ToWrite::LEFT:
n->left = std::move(node);
path.top().toWrite = ToWrite::RIGHT;
path.emplace(n->left.get(), ToWrite::LEFT);
break;
case ToWrite::RIGHT:
n->right = std::move(node);
path.top().toWrite = ToWrite::COND;
path.emplace(n->right.get(), ToWrite::LEFT);
break;
case ToWrite::COND:
n->condition = std::move(node);
path.pop();
path.emplace(n->condition.get(), ToWrite::LEFT);
break;
default:
states.push(State::IN_ERROR);
return false;
}
}
states.push(State::IN_LEFT);
return true;
}
if (currentKey.compare("right") == 0) {
if (states.top() == State::IN_LEFT) {
states.pop();
}
// move the stack state of the node to RIGHT state
path.top().toWrite = ToWrite::RIGHT;
states.push(State::IN_RIGHT);
return true;
}
if (currentKey.compare("condition") == 0) {
if (states.top() == State::IN_RIGHT) {
states.pop();
}
// move the stack state of the node to COND state
path.top().toWrite = ToWrite::COND;
states.push(State::IN_COND);
return true;
}
}
if (states.top() == State::IN_NODE_LITERAL) {
if (currentKey.compare("arrow_type") == 0 || currentKey.compare("value") == 0) {
return true;
}
}
if (states.top() == State::IN_NODE_BINDING) {
if (currentKey.compare("binding") == 0 || currentKey.compare("hash") == 0 || currentKey.compare("arrow_type") == 0) {
return true;
}
}
if (states.top() == State::IN_NODE_OP) {
if (currentKey.compare("operation") == 0) {
return true;
}
}
debug << ">>> Unrecognized" << std::endl;
states.push(State::IN_ERROR);
return false;
}
bool StartObject()
{
// opening brace encountered
debug << "StartObject()" << std::endl;
// the first opening brace in the input
if (states.top() == State::IN_START) {
return true;
}
// the opening of an expression
if (states.top() == State::IN_LIST) {
states.push(State::IN_ROOT);
return true;
}
// if we are looking at subexpression
if (states.top() == State::IN_LEFT || states.top() == State::IN_RIGHT || states.top() == State::IN_COND) { // ready to start a new node
return true;
}
// no other object starts are expected
states.push(State::IN_ERROR);
return false;
}
bool EndObject(SizeType)
{
// closing brace encountered
debug << "EndObject()" << std::endl;
// we are closing up an expression
if (states.top() == State::IN_NODE_LITERAL || states.top() == State::IN_NODE_OP || states.top() == State::IN_NODE_BINDING || states.top() == State::IN_NODE_CONDITIONAL) { // finalize node
// finalize the current node and pop it from the stack (the pointers should be already set
states.pop();
// subexpression
if (states.top() == State::IN_LEFT || states.top() == State::IN_RIGHT || states.top() == State::IN_COND) {
states.pop();
return true;
}
// expression
if (states.top() == State::IN_ROOT) {
result.emplace_back(std::move(rootNode));
states.pop();
return true;
}
}
// we are closing the list
if (states.top() == State::IN_START) {
return true;
}
// no other object ends are expectedd
states.push(State::IN_ERROR);
return false;
}
bool Null()
{
// null value
debug << "Null()" << std::endl;
// the subexpression can be empty
if (states.top() == State::IN_LEFT || states.top() == State::IN_RIGHT || states.top() == State::IN_COND) {
// empty node, nothing to do
// move the path state to the next
if (path.top().toWrite == ToWrite::LEFT) {
path.top().toWrite = ToWrite::RIGHT;
} else if (path.top().toWrite == ToWrite::RIGHT) {
path.top().toWrite = ToWrite::COND;
} else if (path.top().toWrite == ToWrite::COND) {
path.pop();
}
states.pop();
return true;
}
states.push(State::IN_ERROR); // no other contexts allow null
return false;
}
bool Bool(bool b)
{
debug << "Bool(" << b << ")" << std::endl;
// can be a value in a literal node
if (states.top() == State::IN_NODE_LITERAL && currentKey.compare("value") == 0) {
value = b;
return true;
}
states.push(State::IN_ERROR); // no other contexts allow booleans
return false;
}
bool Int(int i)
{
debug << "Int(" << i << ")" << std::endl;
// can be a value in a literal node
if (states.top() == State::IN_NODE_LITERAL && currentKey.compare("value") == 0) { // literal
switch (type) {
case atype::INT8:
value = (int8_t)i;
break;
case atype::INT16:
value = (int16_t)i;
break;
case atype::INT32:
value = i;
break;
case atype::UINT8:
value = (uint8_t)i;
break;
case atype::UINT16:
value = (uint16_t)i;
break;
case atype::UINT32:
value = (uint32_t)i;
break;
default:
states.push(State::IN_ERROR);
return false;
}
return true;
}
// can be a node kind designator
if (states.top() == State::IN_ROOT || states.top() == State::IN_LEFT || states.top() == State::IN_RIGHT || states.top() == State::IN_COND) {
if (currentKey.compare("kind") == 0) {
kind = (Nodes)i;
switch (kind) {
case Nodes::NLITERAL:
case Nodes::NNPH:
case Nodes::NPAR: {
states.push(State::IN_NODE_LITERAL);
debug << ">>> Literal node" << std::endl;
return true;
}
case Nodes::NBINDING: {
states.push(State::IN_NODE_BINDING);
debug << ">>> Binding node" << std::endl;
return true;
}
case Nodes::NOP: {
states.push(State::IN_NODE_OP);
debug << ">>> Operation node" << std::endl;
return true;
}
case Nodes::NCOND: {
states.push(State::IN_NODE_CONDITIONAL);
debug << ">>> Conditional node" << std::endl;
return true;
}
}
}
}
// can be node index
if (states.top() == State::IN_NODE_BINDING || states.top() == State::IN_NODE_CONDITIONAL || states.top() == State::IN_NODE_LITERAL || states.top() == State::IN_NODE_OP) {
if (currentKey.compare("index") == 0) {
index = (size_t)i;
return true;
}
}
// can be a node type designator
if (states.top() == State::IN_NODE_LITERAL || states.top() == State::IN_NODE_BINDING) {
if (currentKey.compare("arrow_type") == 0) {
type = (atype::type)i;
return true;
}
}
// can be a node operation designato
if (states.top() == State::IN_NODE_OP && currentKey.compare("operation") == 0) {
operation = (BasicOp)i;
return true;
}
states.push(State::IN_ERROR); // no other contexts allow ints
return false;
}
bool Uint(unsigned i)
{
debug << "Uint(" << i << ")" << std::endl;
// can be node hash
if (states.top() == State::IN_NODE_BINDING && currentKey.compare("hash") == 0) {
hash = i;
return true;
}
// any positive value will be first read as unsigned, however the actual type is determined by node's arrow_type
debug << ">> falling back to Int" << std::endl;
return Int(i);
}
bool Int64(int64_t i)
{
debug << "Int64(" << i << ")" << std::endl;
// can only be a literal node value
if (states.top() == State::IN_NODE_LITERAL && currentKey.compare("value") == 0) {
switch (type) {
case atype::UINT64:
value = (uint64_t)i;
break;
case atype::INT64:
value = (int64_t)i;
break;
default:
states.push(State::IN_ERROR);
return false;
}
return true;
}
states.push(State::IN_ERROR); // no other contexts allow int64s
return false;
}
bool Uint64(uint64_t i)
{
debug << "Uint64(" << i << ")" << std::endl;
// any positive value will be first read as unsigned, however the actual type is determined by node's arrow_type
debug << ">> falling back to Int64" << std::endl;
return Int64(i);
}
bool Double(double d)
{
debug << "Double(" << d << ")" << std::endl;
// can only be a literal node value
if (states.top() == State::IN_NODE_LITERAL) {
switch (type) {
case atype::FLOAT:
value = (float)d;
break;
case atype::DOUBLE:
value = d;
break;
default:
states.push(State::IN_ERROR);
return false;
}
return true;
}
states.push(State::IN_ERROR); // no other contexts allow doubles
return false;
}
bool String(const Ch* str, SizeType, bool)
{
debug << "String(" << str << ")" << std::endl;
// can only be a binding node
if (states.top() == State::IN_NODE_BINDING && currentKey.compare("binding") == 0) {
binding = str;
return true;
}
states.push(State::IN_ERROR); // no strings are expected
return false;
}
};
} // namespace
std::vector<expressions::Projector> o2::framework::ExpressionJSONHelpers::read(std::istream& s)
{
rapidjson::Reader reader;
rapidjson::IStreamWrapper isw(s);
ExpressionReader ereader;
bool ok = reader.Parse(isw, ereader);
if (!ok) {
throw framework::runtime_error_f("Cannot parse serialized Expression, error: %s at offset: %d", rapidjson::GetParseError_En(reader.GetParseErrorCode()), reader.GetErrorOffset());
}
return std::move(ereader.result);
}
namespace
{
void writeNodeHeader(rapidjson::Writer<rapidjson::OStreamWrapper>& w, expressions::Node const* node)
{
w.Key("kind");
w.Int((int)node->self.index());
w.Key("index");
w.Uint64(node->index);
std::visit(overloaded{
[&w](expressions::LiteralNode const& node) {
w.Key("arrow_type");
w.Int(node.type);
w.Key("value");
std::visit(overloaded{
[&w](bool v) { w.Bool(v); },
[&w](float v) { w.Double(v); },
[&w](double v) { w.Double(v); },
[&w](uint8_t v) { w.Uint(v); },
[&w](uint16_t v) { w.Uint(v); },
[&w](uint32_t v) { w.Uint(v); },
[&w](uint64_t v) { w.Uint64(v); },
[&w](int8_t v) { w.Int(v); },
[&w](int16_t v) { w.Int(v); },
[&w](int v) { w.Int(v); },
[&w](int64_t v) { w.Int64(v); }},
node.value);
},
[&w](expressions::BindingNode const& node) {
w.Key("binding");
w.String(node.name);
w.Key("hash");
w.Uint(node.hash);
w.Key("arrow_type");
w.Int(node.type);
},
[&w](expressions::OpNode const& node) {
w.Key("operation");
w.Int(node.op);
},
[](expressions::ConditionalNode const&) {
}},
node->self);
}
void writeExpression(rapidjson::Writer<rapidjson::OStreamWrapper>& w, expressions::Node* n)
{
std::stack<Entry> path;
path.emplace(n, ToWrite::FULL);
while (!path.empty()) {
auto& top = path.top();
if (top.toWrite == ToWrite::FULL) {
w.StartObject();
writeNodeHeader(w, top.ptr);
top.toWrite = ToWrite::LEFT;
continue;
}
if (top.toWrite == ToWrite::LEFT) {
w.Key("left");
top.toWrite = ToWrite::RIGHT;
auto* left = top.ptr->left.get();
if (left != nullptr) {
path.emplace(left, ToWrite::FULL);
} else {
w.Null();
}
continue;
}
if (top.toWrite == ToWrite::RIGHT) {
w.Key("right");
top.toWrite = ToWrite::COND;
auto* right = top.ptr->right.get();
if (right != nullptr) {
path.emplace(right, ToWrite::FULL);
} else {
w.Null();
}
continue;
}
if (top.toWrite == ToWrite::COND) {
w.Key("condition");
top.toWrite = ToWrite::POP;
auto* cond = top.ptr->condition.get();
if (cond != nullptr) {
path.emplace(cond, ToWrite::FULL);
} else {
w.Null();
}
continue;
}
if (top.toWrite == ToWrite::POP) {
w.EndObject();
path.pop();
continue;
}
}
}
} // namespace
void o2::framework::ExpressionJSONHelpers::write(std::ostream& o, std::vector<o2::framework::expressions::Projector>& projectors)
{
rapidjson::OStreamWrapper osw(o);
rapidjson::Writer<rapidjson::OStreamWrapper> w(osw);
w.StartObject();
w.Key("projectors");
w.StartArray();
for (auto& p : projectors) {
writeExpression(w, p.node.get());
}
w.EndArray();
w.EndObject();
}
namespace
{
std::shared_ptr<arrow::DataType> arrowDataTypeFromId(atype::type type, int list_size = 1, atype::type element = atype::NA)
{
switch (list_size) {
case -1:
return arrow::list(expressions::concreteArrowType(element));
case 1:
return expressions::concreteArrowType(type);
default:
return arrow::fixed_size_list(expressions::concreteArrowType(element), list_size);
}
}
struct SchemaReader : public rapidjson::BaseReaderHandler<rapidjson::UTF8<>, SchemaReader> {
using Ch = rapidjson::UTF8<>::Ch;
using SizeType = rapidjson::SizeType;
enum struct State {
IN_START,
IN_LIST,
IN_FIELD,
IN_ERROR
};
std::stack<State> states;
std::ostringstream debug;
std::shared_ptr<arrow::Schema> schema = nullptr;
std::vector<std::shared_ptr<arrow::Field>> fields;
std::string currentKey;
std::string name;
atype::type type;
atype::type element;
int list_size = 1;
SchemaReader()
{
debug << ">>> Start" << std::endl;
states.push(State::IN_START);
}
bool StartArray()
{
debug << "StartArray()" << std::endl;
if (states.top() == State::IN_START && currentKey.compare("fields") == 0) {
states.push(State::IN_LIST);
return true;
}
states.push(State::IN_ERROR);
return false;
}
bool EndArray(SizeType)
{
debug << "EndArray()" << std::endl;
if (states.top() == State::IN_LIST) {
// finalize schema
schema = std::make_shared<arrow::Schema>(fields);
states.pop();
return true;
}
states.push(State::IN_ERROR);
return false;
}
bool Key(const Ch* str, SizeType, bool)
{
debug << "Key(" << str << ")" << std::endl;
currentKey = str;
if (states.top() == State::IN_START) {
if (currentKey.compare("fields") == 0) {
return true;
}
}
if (states.top() == State::IN_FIELD) {
if (currentKey.compare("name") == 0) {
return true;
}
if (currentKey.compare("type") == 0) {
return true;
}
if (currentKey.compare("size") == 0) {
return true;
}
if (currentKey.compare("element") == 0) {
return true;
}
}
states.push(State::IN_ERROR);
return false;
}
bool StartObject()
{
debug << "StartObject()" << std::endl;
if (states.top() == State::IN_START) {
return true;
}
if (states.top() == State::IN_LIST) {
states.push(State::IN_FIELD);
list_size = 1;
element = atype::NA;
type = atype::NA;
return true;
}
states.push(State::IN_ERROR);
return false;
}
bool EndObject(SizeType)
{
debug << "EndObject()" << std::endl;
if (states.top() == State::IN_FIELD) {
states.pop();
// add a field
fields.emplace_back(std::make_shared<arrow::Field>(name, arrowDataTypeFromId(type, list_size, element)));
return true;
}
if (states.top() == State::IN_START) {
return true;
}
states.push(State::IN_ERROR);
return false;
}
bool Uint(unsigned i)
{
debug << "Uint(" << i << ")" << std::endl;
if (states.top() == State::IN_FIELD) {
if (currentKey.compare("type") == 0) {
type = (atype::type)i;
return true;
}
if (currentKey.compare("element") == 0) {
element = (atype::type)i;
return true;
}
if (currentKey.compare("size") == 0) {
list_size = i;
return true;
}
}
states.push(State::IN_ERROR);
return false;
}
bool String(const Ch* str, SizeType, bool)
{
debug << "String(" << str << ")" << std::endl;
if (states.top() == State::IN_FIELD) {
if (currentKey.compare("name") == 0) {
name = str;
return true;
}
}
states.push(State::IN_ERROR);
return false;
}
bool Int(int i)
{
debug << "Int(" << i << ")" << std::endl;
if (states.top() == State::IN_FIELD && currentKey.compare("size") == 0) {
list_size = i;
return true;
}
return Uint(i);
}
};
} // namespace
std::shared_ptr<arrow::Schema> o2::framework::ArrowJSONHelpers::read(std::istream& s)
{
rapidjson::Reader reader;
rapidjson::IStreamWrapper isw(s);
SchemaReader sreader;
bool ok = reader.Parse(isw, sreader);
if (!ok) {
throw framework::runtime_error_f("Cannot parse serialized Schema, error: %s at offset: %d", rapidjson::GetParseError_En(reader.GetParseErrorCode()), reader.GetErrorOffset());
}
return sreader.schema;
}
namespace
{
void writeSchema(rapidjson::Writer<rapidjson::OStreamWrapper>& w, arrow::Schema* schema)
{
for (auto& f : schema->fields()) {
w.StartObject();
w.Key("name");
w.String(f->name().c_str());
auto fixedList = dynamic_cast<arrow::FixedSizeListType*>(f->type().get());
if (fixedList != nullptr) {
w.Key("size");
w.Int(fixedList->list_size());
w.Key("element");
w.Int(fixedList->field(0)->type()->id());
}
auto varList = dynamic_cast<arrow::ListType*>(f->type().get());
if (varList != nullptr) {
w.Key("size");
w.Int(-1);
w.Key("element");
w.Int(varList->field(0)->type()->id());
}
w.Key("type");
w.Int(f->type()->id());
w.EndObject();
}
}
} // namespace
void o2::framework::ArrowJSONHelpers::write(std::ostream& o, std::shared_ptr<arrow::Schema>& schema)
{
rapidjson::OStreamWrapper osw(o);
rapidjson::Writer<rapidjson::OStreamWrapper> w(osw);
w.StartObject();
w.Key("fields");
w.StartArray();
writeSchema(w, schema.get());
w.EndArray();
w.EndObject();
}
} // namespace o2::framework