-
Notifications
You must be signed in to change notification settings - Fork 78
/
Copy pathtree.mjs
2809 lines (2312 loc) · 98.7 KB
/
tree.mjs
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
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
import { BIT, isArrayProto, isRootCollection, isObject, isFunc, isStr, getMethods,
create, createHistogram, createTGraph, prROOT,
clTObject, clTObjString, clTHashList, clTPolyMarker3D, clTH1, clTH2, clTH3, kNoStats } from './core.mjs';
import { kChar, kShort, kInt, kFloat,
kCharStar, kDouble, kDouble32,
kUChar, kUShort, kUInt,
kLong64, kULong64, kBool, kFloat16,
kOffsetL, kOffsetP, kObject, kAny, kObjectp, kTString,
kStreamer, kStreamLoop, kSTLp, kSTL, kBaseClass, clTBasket,
R__unzip, TBuffer, createStreamerElement, createMemberStreamer } from './io.mjs';
import * as jsroot_math from './base/math.mjs';
// branch types
const kLeafNode = 0, kBaseClassNode = 1, kObjectNode = 2, kClonesNode = 3,
kSTLNode = 4, kClonesMemberNode = 31, kSTLMemberNode = 41,
// branch bits
// kDoNotProcess = BIT(10), // Active bit for branches
// kIsClone = BIT(11), // to indicate a TBranchClones
// kBranchObject = BIT(12), // branch is a TObject*
// kBranchAny = BIT(17), // branch is an object*
// kAutoDelete = BIT(15),
kDoNotUseBufferMap = BIT(22), // If set, at least one of the entry in the branch will use the buffer's map of classname and objects.
clTBranchElement = 'TBranchElement', clTBranchFunc = 'TBranchFunc';
/**
* @summary Class to read data from TTree
*
* @desc Instance of TSelector can be used to access TTree data
*/
class TSelector {
/** @summary constructor */
constructor() {
this._branches = []; // list of branches to read
this._names = []; // list of member names for each branch in tgtobj
this._directs = []; // indication if only branch without any children should be read
this._break = 0;
this.tgtobj = {};
}
/** @summary Add branch to the selector
* @desc Either branch name or branch itself should be specified
* Second parameter defines member name in the tgtobj
* If selector.addBranch('px', 'read_px') is called,
* branch will be read into selector.tgtobj.read_px member
* If second parameter not specified, branch name (here 'px') will be used
* If branch object specified as first parameter and second parameter missing,
* then member like 'br0', 'br1' and so on will be assigned
* @param {string|Object} branch - name of branch (or branch object itself}
* @param {string} [name] - member name in tgtobj where data will be read
* @param {boolean} [direct] - if only branch without any children should be read */
addBranch(branch, name, direct) {
if (!name)
name = isStr(branch) ? branch : `br${this._branches.length}`;
this._branches.push(branch);
this._names.push(name);
this._directs.push(direct);
return this._branches.length - 1;
}
/** @summary returns number of branches used in selector */
numBranches() { return this._branches.length; }
/** @summary returns branch by index used in selector */
getBranch(indx) { return this._branches[indx]; }
/** @summary returns index of branch
* @private */
indexOfBranch(branch) { return this._branches.indexOf(branch); }
/** @summary returns name of branch
* @private */
nameOfBranch(indx) { return this._names[indx]; }
/** @summary function called during TTree processing
* @abstract
* @param {number} progress - current value between 0 and 1 */
ShowProgress(/* progress */) {}
/** @summary call this function to abort processing */
Abort() { this._break = -1111; }
/** @summary function called before start processing
* @abstract
* @param {object} tree - tree object */
Begin(/* tree */) {}
/** @summary function called when next entry extracted from the tree
* @abstract
* @param {number} entry - read entry number */
Process(/* entry */) {}
/** @summary function called at the very end of processing
* @abstract
* @param {boolean} res - true if all data were correctly processed */
Terminate(/* res */) {}
} // class TSelector
// =================================================================
/** @summary Checks array kind
* @desc return 0 when not array
* 1 - when arbitrary array
* 2 - when plain (1-dim) array with same-type content
* @private */
function checkArrayPrototype(arr, check_content) {
if (!isObject(arr)) return 0;
const arr_kind = isArrayProto(Object.prototype.toString.apply(arr));
if (!check_content || (arr_kind !== 1))
return arr_kind;
let typ, plain = true;
for (let k = 0; k < arr.length; ++k) {
const sub = typeof arr[k];
if (!typ)
typ = sub;
if ((sub !== typ) || (isObject(sub) && checkArrayPrototype(arr[k]))) {
plain = false;
break;
}
}
return plain ? 2 : 1;
}
/**
* @summary Class to iterate over array elements
*
* @private
*/
class ArrayIterator {
/** @summary constructor */
constructor(arr, select, tgtobj) {
this.object = arr;
this.value = 0; // value always used in iterator
this.arr = []; // all arrays
this.indx = []; // all indexes
this.cnt = -1; // current index counter
this.tgtobj = tgtobj;
if (isObject(select))
this.select = select; // remember indexes for selection
else
this.select = []; // empty array, undefined for each dimension means iterate over all indexes
}
/** @summary next element */
next() {
let obj, typ, cnt = this.cnt;
if (cnt >= 0) {
if (++this.fastindx < this.fastlimit) {
this.value = this.fastarr[this.fastindx];
return true;
}
while (--cnt >= 0) {
if ((this.select[cnt] === undefined) && (++this.indx[cnt] < this.arr[cnt].length))
break;
}
if (cnt < 0) return false;
}
while (true) {
obj = (cnt < 0) ? this.object : (this.arr[cnt])[this.indx[cnt]];
typ = obj ? typeof obj : 'any';
if (typ === 'object') {
if (obj._typename !== undefined) {
if (isRootCollection(obj)) {
obj = obj.arr;
typ = 'array';
} else
typ = 'any';
} else if (Number.isInteger(obj.length) && (checkArrayPrototype(obj) > 0))
typ = 'array';
else
typ = 'any';
}
if (this.select[cnt + 1] === '$self$') {
this.value = obj;
this.fastindx = this.fastlimit = 0;
this.cnt = cnt + 1;
return true;
}
if ((typ === 'any') && isStr(this.select[cnt + 1])) {
// this is extraction of the member from arbitrary class
this.arr[++cnt] = obj;
this.indx[cnt] = this.select[cnt]; // use member name as index
continue;
}
if ((typ === 'array') && ((obj.length > 0) || (this.select[cnt + 1] === '$size$'))) {
this.arr[++cnt] = obj;
switch (this.select[cnt]) {
case undefined: this.indx[cnt] = 0; break;
case '$last$': this.indx[cnt] = obj.length - 1; break;
case '$size$':
this.value = obj.length;
this.fastindx = this.fastlimit = 0;
this.cnt = cnt;
return true;
default:
if (Number.isInteger(this.select[cnt])) {
this.indx[cnt] = this.select[cnt];
if (this.indx[cnt] < 0) this.indx[cnt] = obj.length - 1;
} else {
// this is compile variable as array index - can be any expression
this.select[cnt].produce(this.tgtobj);
this.indx[cnt] = Math.round(this.select[cnt].get(0));
}
}
} else {
if (cnt < 0)
return false;
this.value = obj;
if (this.select[cnt] === undefined) {
this.fastarr = this.arr[cnt];
this.fastindx = this.indx[cnt];
this.fastlimit = this.fastarr.length;
} else
this.fastindx = this.fastlimit = 0; // no any iteration on that level
this.cnt = cnt;
return true;
}
}
// unreachable code
// return false;
}
/** @summary reset iterator */
reset() {
this.arr = [];
this.indx = [];
delete this.fastarr;
this.cnt = -1;
this.value = 0;
}
} // class ArrayIterator
/** @summary return TStreamerElement associated with the branch - if any
* @desc unfortunately, branch.fID is not number of element in streamer info
* @private */
function findBrachStreamerElement(branch, file) {
if (!branch || !file || (branch._typename !== clTBranchElement) || (branch.fID < 0) || (branch.fStreamerType < 0)) return null;
const s_i = file.findStreamerInfo(branch.fClassName, branch.fClassVersion, branch.fCheckSum),
arr = (s_i && s_i.fElements) ? s_i.fElements.arr : null;
if (!arr) return null;
let match_name = branch.fName,
pos = match_name.indexOf('[');
if (pos > 0) match_name = match_name.slice(0, pos);
pos = match_name.lastIndexOf('.');
if (pos > 0) match_name = match_name.slice(pos + 1);
function match_elem(elem) {
if (!elem) return false;
if (elem.fName !== match_name) return false;
if (elem.fType === branch.fStreamerType) return true;
if ((elem.fType === kBool) && (branch.fStreamerType === kUChar)) return true;
if (((branch.fStreamerType === kSTL) || (branch.fStreamerType === kSTL + kOffsetL) ||
(branch.fStreamerType === kSTLp) || (branch.fStreamerType === kSTLp + kOffsetL)) &&
(elem.fType === kStreamer)) return true;
console.warn(`Should match element ${elem.fType} with branch ${branch.fStreamerType}`);
return false;
}
// first check branch fID - in many cases gut guess
if (match_elem(arr[branch.fID]))
return arr[branch.fID];
for (let k = 0; k < arr.length; ++k) {
if ((k !== branch.fID) && match_elem(arr[k]))
return arr[k];
}
console.error(`Did not found/match element for branch ${branch.fName} class ${branch.fClassName}`);
return null;
}
/** @summary return class name of the object, stored in the branch
* @private */
function getBranchObjectClass(branch, tree, with_clones = false, with_leafs = false) {
if (!branch || (branch._typename !== clTBranchElement)) return '';
if ((branch.fType === kLeafNode) && (branch.fID === -2) && (branch.fStreamerType === -1)) {
// object where all sub-branches will be collected
return branch.fClassName;
}
if (with_clones && branch.fClonesName && ((branch.fType === kClonesNode) || (branch.fType === kSTLNode)))
return branch.fClonesName;
const s_elem = findBrachStreamerElement(branch, tree.$file);
if ((branch.fType === kBaseClassNode) && s_elem && (s_elem.fTypeName === kBaseClass))
return s_elem.fName;
if (branch.fType === kObjectNode) {
if (s_elem && ((s_elem.fType === kObject) || (s_elem.fType === kAny)))
return s_elem.fTypeName;
return clTObject;
}
if ((branch.fType === kLeafNode) && s_elem && with_leafs) {
if ((s_elem.fType === kObject) || (s_elem.fType === kAny))
return s_elem.fTypeName;
if (s_elem.fType === kObjectp)
return s_elem.fTypeName.slice(0, s_elem.fTypeName.length - 1);
}
return '';
}
/** @summary Get branch with specified id
* @desc All sub-branches checked as well
* @return {Object} branch
* @private */
function getTreeBranch(tree, id) {
if (!Number.isInteger(id)) return;
let res, seq = 0;
function scan(obj) {
obj?.fBranches?.arr.forEach(br => {
if (seq++ === id) res = br;
if (!res) scan(br);
});
}
scan(tree);
return res;
}
/** @summary Special branch search
* @desc Name can include extra part, which will be returned in the result
* @param {string} name - name of the branch
* @return {Object} with 'branch' and 'rest' members
* @private */
function findBranchComplex(tree, name, lst = undefined, only_search = false) {
let top_search = false, search = name, res = null;
if (!lst) {
top_search = true;
lst = tree.fBranches;
const pos = search.indexOf('[');
if (pos > 0) search = search.slice(0, pos);
}
if (!lst || (lst.arr.length === 0)) return null;
for (let n = 0; n < lst.arr.length; ++n) {
let brname = lst.arr[n].fName;
if (brname.at(-1) === ']')
brname = brname.slice(0, brname.indexOf('['));
// special case when branch name includes STL map name
if ((search.indexOf(brname) !== 0) && (brname.indexOf('<') > 0)) {
const p1 = brname.indexOf('<'), p2 = brname.lastIndexOf('>');
brname = brname.slice(0, p1) + brname.slice(p2 + 1);
}
if (brname === search) {
res = { branch: lst.arr[n], rest: '' };
break;
}
if (search.indexOf(brname) !== 0)
continue;
// this is a case when branch name is in the begin of the search string
// check where point is
let pnt = brname.length;
if (brname[pnt - 1] === '.') pnt--;
if (search[pnt] !== '.') continue;
res = findBranchComplex(tree, search, lst.arr[n].fBranches);
if (!res) res = findBranchComplex(tree, search.slice(pnt + 1), lst.arr[n].fBranches);
if (!res) res = { branch: lst.arr[n], rest: search.slice(pnt) };
break;
}
if (top_search && !only_search && !res && (search.indexOf('br_') === 0)) {
let p = 3;
while ((p < search.length) && (search[p] >= '0') && (search[p] <= '9')) ++p;
const br = (p > 3) ? getTreeBranch(tree, parseInt(search.slice(3, p))) : null;
if (br) res = { branch: br, rest: search.slice(p) };
}
if (!top_search || !res)
return res;
if (name.length > search.length)
res.rest += name.slice(search.length);
return res;
}
/** @summary Search branch with specified name
* @param {string} name - name of the branch
* @return {Object} found branch
* @private */
function findBranch(tree, name) {
const res = findBranchComplex(tree, name, tree.fBranches, true);
return (!res || res.rest) ? null : res.branch;
}
/** summary Returns number of branches in the TTree
* desc Checks also sub-branches in the branches
* return {number} number of branches
* private
function getNumBranches(tree) {
function count(obj) {
if (!obj?.fBranches) return 0;
let nchld = 0;
obj.fBranches.arr.forEach(sub => { nchld += count(sub); });
return obj.fBranches.arr.length + nchld;
}
return count(tree);
}
*/
/**
* @summary object with single variable in TTree::Draw expression
*
* @private
*/
class TDrawVariable {
/** @summary constructor */
constructor(globals) {
this.globals = globals;
this.code = '';
this.brindex = []; // index of used branches from selector
this.branches = []; // names of branches in target object
this.brarray = []; // array specifier for each branch
this.func = null; // generic function for variable calculation
this.kind = undefined;
this.buf = []; // buffer accumulates temporary values
}
/** @summary Parse variable
* @desc when only_branch specified, its placed in the front of the expression */
parse(tree, selector, code, only_branch, branch_mode) {
const is_start_symbol = symb => {
if ((symb >= 'A') && (symb <= 'Z')) return true;
if ((symb >= 'a') && (symb <= 'z')) return true;
return (symb === '_');
}, is_next_symbol = symb => {
if (is_start_symbol(symb)) return true;
if ((symb >= '0') && (symb <= '9')) return true;
return false;
};
if (!code) code = ''; // should be empty string at least
this.code = (only_branch?.fName ?? '') + code;
let pos = 0, pos2 = 0, br;
while ((pos < code.length) || only_branch) {
let arriter = [];
if (only_branch) {
br = only_branch;
only_branch = undefined;
} else {
// first try to find branch
pos2 = pos;
while ((pos2 < code.length) && (is_next_symbol(code[pos2]) || code[pos2] === '.')) pos2++;
if (code[pos2] === '$') {
let repl = '';
switch (code.slice(pos, pos2)) {
case 'LocalEntry':
case 'Entry': repl = 'arg.$globals.entry'; break;
case 'Entries': repl = 'arg.$globals.entries'; break;
}
if (repl) {
code = code.slice(0, pos) + repl + code.slice(pos2 + 1);
pos += repl.length;
continue;
}
}
br = findBranchComplex(tree, code.slice(pos, pos2));
if (!br) { pos = pos2 + 1; continue; }
// when full id includes branch name, replace only part of extracted expression
if (br.branch && (br.rest !== undefined)) {
pos2 -= br.rest.length;
branch_mode = undefined; // maybe selection of the sub-object done
br = br.branch;
}
// when code ends with the point - means object itself will be accessed
// sometime branch name itself ends with the point
if ((pos2 >= code.length - 1) && (code.at(-1) === '.')) {
arriter.push('$self$');
pos2 = code.length;
}
}
// now extract all levels of iterators
while (pos2 < code.length) {
if ((code[pos2] === '@') && (code.slice(pos2, pos2 + 5) === '@size') && (arriter.length === 0)) {
pos2 += 5;
branch_mode = true;
break;
}
if (code[pos2] === '.') {
// this is object member
const prev = ++pos2;
if ((code[prev] === '@') && (code.slice(prev, prev + 5) === '@size')) {
arriter.push('$size$');
pos2 += 5;
break;
}
if (!is_start_symbol(code[prev])) {
arriter.push('$self$'); // last point means extraction of object itself
break;
}
while ((pos2 < code.length) && is_next_symbol(code[pos2])) pos2++;
// this is looks like function call - do not need to extract member with
if (code[pos2] === '(') { pos2 = prev - 1; break; }
// this is selection of member, but probably we need to activate iterator for ROOT collection
if (arriter.length === 0) {
// TODO: if selected member is simple data type - no need to make other checks - just break here
if ((br.fType === kClonesNode) || (br.fType === kSTLNode))
arriter.push(undefined);
else {
const objclass = getBranchObjectClass(br, tree, false, true);
if (objclass && isRootCollection(null, objclass))
arriter.push(undefined);
}
}
arriter.push(code.slice(prev, pos2));
continue;
}
if (code[pos2] !== '[') break;
// simple []
if (code[pos2 + 1] === ']') { arriter.push(undefined); pos2 += 2; continue; }
const prev = pos2++;
let cnt = 0;
while ((pos2 < code.length) && ((code[pos2] !== ']') || (cnt > 0))) {
if (code[pos2] === '[') cnt++; else if (code[pos2] === ']') cnt--;
pos2++;
}
const sub = code.slice(prev + 1, pos2);
switch (sub) {
case '':
case '$all$': arriter.push(undefined); break;
case '$last$': arriter.push('$last$'); break;
case '$size$': arriter.push('$size$'); break;
case '$first$': arriter.push(0); break;
default:
if (Number.isInteger(parseInt(sub)))
arriter.push(parseInt(sub));
else {
// try to compile code as draw variable
const subvar = new TDrawVariable(this.globals);
if (!subvar.parse(tree, selector, sub)) return false;
arriter.push(subvar);
}
}
pos2++;
}
if (arriter.length === 0)
arriter = undefined;
else if ((arriter.length === 1) && (arriter[0] === undefined))
arriter = true;
let indx = selector.indexOfBranch(br);
if (indx < 0) indx = selector.addBranch(br, undefined, branch_mode);
branch_mode = undefined;
this.brindex.push(indx);
this.branches.push(selector.nameOfBranch(indx));
this.brarray.push(arriter);
// this is simple case of direct usage of the branch
if ((pos === 0) && (pos2 === code.length) && (this.branches.length === 1)) {
this.direct_branch = true; // remember that branch read as is
return true;
}
const replace = 'arg.var' + (this.branches.length - 1);
code = code.slice(0, pos) + replace + code.slice(pos2);
pos += replace.length;
}
// support usage of some standard TMath functions
code = code.replace(/TMath::Exp\(/g, 'Math.exp(')
.replace(/TMath::Abs\(/g, 'Math.abs(')
.replace(/TMath::Prob\(/g, 'arg.$math.Prob(')
.replace(/TMath::Gaus\(/g, 'arg.$math.Gaus(');
this.func = new Function('arg', `return (${code})`);
return true;
}
/** @summary Check if it is dummy variable */
is_dummy() { return (this.branches.length === 0) && !this.func; }
/** @summary Produce variable
* @desc after reading tree branches into the object, calculate variable value */
produce(obj) {
this.length = 1;
this.isarray = false;
if (this.is_dummy()) {
this.value = 1; // used as dummy weight variable
this.kind = 'number';
return;
}
const arg = { $globals: this.globals, $math: jsroot_math }, arrs = [];
let usearrlen = -1;
for (let n = 0; n < this.branches.length; ++n) {
const name = `var${n}`;
arg[name] = obj[this.branches[n]];
// try to check if branch is array and need to be iterated
if (this.brarray[n] === undefined)
this.brarray[n] = (checkArrayPrototype(arg[name]) > 0) || isRootCollection(arg[name]);
// no array - no pain
if (this.brarray[n] === false) continue;
// check if array can be used as is - one dimension and normal values
if ((this.brarray[n] === true) && (checkArrayPrototype(arg[name], true) === 2)) {
// plain array, can be used as is
arrs[n] = arg[name];
} else {
const iter = new ArrayIterator(arg[name], this.brarray[n], obj);
arrs[n] = [];
while (iter.next()) arrs[n].push(iter.value);
}
if ((usearrlen < 0) || (usearrlen < arrs[n].length)) usearrlen = arrs[n].length;
}
if (usearrlen < 0) {
this.value = this.direct_branch ? arg.var0 : this.func(arg);
if (!this.kind) this.kind = typeof this.value;
return;
}
if (usearrlen === 0) {
// empty array - no any histogram should be filled
this.length = 0;
this.value = 0;
return;
}
this.length = usearrlen;
this.isarray = true;
if (this.direct_branch)
this.value = arrs[0]; // just use array
else {
this.value = new Array(usearrlen);
for (let k = 0; k < usearrlen; ++k) {
for (let n = 0; n < this.branches.length; ++n) {
if (arrs[n])
arg[`var${n}`] = arrs[n][k];
}
this.value[k] = this.func(arg);
}
}
if (!this.kind) this.kind = typeof this.value[0];
}
/** @summary Get variable */
get(indx) { return this.isarray ? this.value[indx] : this.value; }
/** @summary Append array to the buffer */
appendArray(tgtarr) { this.buf = this.buf.concat(tgtarr[this.branches[0]]); }
} // class TDrawVariable
/**
* @summary Selector class for TTree::Draw function
*
* @private
*/
class TDrawSelector extends TSelector {
/** @summary constructor */
constructor() {
super();
this.ndim = 0;
this.vars = []; // array of expression variables
this.cut = null; // cut variable
this.hist = null;
this.histo_drawopt = '';
this.hist_name = '$htemp';
this.hist_title = 'Result of TTree::Draw';
this.graph = false;
this.hist_args = []; // arguments for histogram creation
this.arr_limit = 1000; // number of accumulated items before create histogram
this.htype = 'F';
this.monitoring = 0;
this.globals = {}; // object with global parameters, which could be used in any draw expression
this.last_progress = 0;
this.aver_diff = 0;
}
/** @summary Set draw selector callbacks */
setCallback(result_callback, progress_callback) {
this.result_callback = result_callback;
this.progress_callback = progress_callback;
}
/** @summary Parse parameters */
parseParameters(tree, args, expr) {
if (!expr || !isStr(expr)) return '';
// parse parameters which defined at the end as expression;par1name:par1value;par2name:par2value
let pos = expr.lastIndexOf(';');
while (pos >= 0) {
let parname = expr.slice(pos + 1), parvalue;
expr = expr.slice(0, pos);
pos = expr.lastIndexOf(';');
const separ = parname.indexOf(':');
if (separ > 0) { parvalue = parname.slice(separ + 1); parname = parname.slice(0, separ); }
let intvalue = parseInt(parvalue);
if (!parvalue || !Number.isInteger(intvalue)) intvalue = undefined;
switch (parname) {
case 'num':
case 'entries':
case 'numentries':
if (parvalue === 'all')
args.numentries = tree.fEntries;
else if (parvalue === 'half')
args.numentries = Math.round(tree.fEntries / 2);
else if (intvalue !== undefined)
args.numentries = intvalue;
break;
case 'first':
if (intvalue !== undefined) args.firstentry = intvalue;
break;
case 'mon':
case 'monitor':
args.monitoring = (intvalue !== undefined) ? intvalue : 5000;
break;
case 'player':
args.player = true;
break;
case 'dump':
args.dump = true;
break;
case 'maxseg':
case 'maxrange':
if (intvalue) tree.$file.fMaxRanges = intvalue;
break;
case 'accum':
if (intvalue) this.arr_limit = intvalue;
break;
case 'htype':
if (parvalue && (parvalue.length === 1)) {
this.htype = parvalue.toUpperCase();
if (['C', 'S', 'I', 'F', 'L', 'D'].indexOf(this.htype) < 0)
this.htype = 'F';
}
break;
case 'hbins':
this.hist_nbins = parseInt(parvalue);
if (!Number.isInteger(this.hist_nbins) || (this.hist_nbins <= 3))
delete this.hist_nbins;
else
this.want_hist = true;
break;
case 'drawopt':
args.drawopt = parvalue;
break;
case 'graph':
args.graph = intvalue || true;
break;
}
}
pos = expr.lastIndexOf('>>');
if (pos >= 0) {
let harg = expr.slice(pos + 2).trim();
expr = expr.slice(0, pos).trim();
pos = harg.indexOf('(');
if (pos > 0) {
this.hist_name = harg.slice(0, pos);
harg = harg.slice(pos);
}
if (harg === 'dump')
args.dump = true;
else if (harg.indexOf('Graph') === 0)
args.graph = true;
else if (pos < 0) {
this.want_hist = true;
this.hist_name = harg;
} else if ((harg[0] === '(') && (harg.at(-1) === ')')) {
this.want_hist = true;
harg = harg.slice(1, harg.length - 1).split(',');
let isok = true;
for (let n = 0; n < harg.length; ++n) {
harg[n] = (n % 3 === 0) ? parseInt(harg[n]) : parseFloat(harg[n]);
if (!Number.isFinite(harg[n])) isok = false;
}
if (isok) this.hist_args = harg;
}
}
if (args.dump) {
this.dump_values = true;
args.reallocate_objects = true;
if (args.numentries === undefined) args.numentries = 10;
}
return expr;
}
/** @summary Parse draw expression */
parseDrawExpression(tree, args) {
// parse complete expression
let expr = this.parseParameters(tree, args, args.expr), cut = '';
// parse option for histogram creation
this.hist_title = `drawing '${expr}' from ${tree.fName}`;
let pos;
if (args.cut)
cut = args.cut;
else {
pos = expr.replace(/TMath::/g, 'TMath__').lastIndexOf('::'); // avoid confusion due-to :: in the namespace
if (pos > 0) {
cut = expr.slice(pos + 2).trim();
expr = expr.slice(0, pos).trim();
}
}
args.parse_expr = expr;
args.parse_cut = cut;
// let names = expr.split(':'); // to allow usage of ? operator, we need to handle : as well
const names = [];
let nbr1 = 0, nbr2 = 0, prev = 0;
for (pos = 0; pos < expr.length; ++pos) {
switch (expr[pos]) {
case '(': nbr1++; break;
case ')': nbr1--; break;
case '[': nbr2++; break;
case ']': nbr2--; break;
case ':':
if (expr[pos + 1] === ':') { pos++; continue; }
if (!nbr1 && !nbr2 && (pos > prev)) names.push(expr.slice(prev, pos));
prev = pos + 1;
break;
}
}
if (!nbr1 && !nbr2 && (pos > prev)) names.push(expr.slice(prev, pos));
if ((names.length < 1) || (names.length > 3)) return false;
this.ndim = names.length;
let is_direct = !cut;
for (let n = 0; n < this.ndim; ++n) {
this.vars[n] = new TDrawVariable(this.globals);
if (!this.vars[n].parse(tree, this, names[n])) return false;
if (!this.vars[n].direct_branch) is_direct = false;
}
this.cut = new TDrawVariable(this.globals);
if (cut)
if (!this.cut.parse(tree, this, cut)) return false;
if (!this.numBranches()) {
console.warn('no any branch is selected');
return false;
}
if (is_direct) this.ProcessArrays = this.ProcessArraysFunc;
this.monitoring = args.monitoring;
// force TPolyMarker3D drawing for 3D case
if ((this.ndim === 3) && !this.want_hist && !args.dump)
args.graph = true;
this.graph = args.graph;
if (args.drawopt !== undefined)
this.histo_drawopt = args.drawopt;
else
this.histo_drawopt = (this.ndim === 2) ? 'col' : '';
return true;
}
/** @summary Draw only specified branch */
drawOnlyBranch(tree, branch, expr, args) {
this.ndim = 1;
if (expr.indexOf('dump') === 0) expr = ';' + expr;
expr = this.parseParameters(tree, args, expr);
this.monitoring = args.monitoring;
if (args.dump) {
this.dump_values = true;
args.reallocate_objects = true;
}
if (this.dump_values) {
this.hist = []; // array of dump objects
this.leaf = args.leaf;
// branch object remains, therefore we need to copy fields to see them all
this.copy_fields = ((args.branch.fLeaves && (args.branch.fLeaves.arr.length > 1)) ||
(args.branch.fBranches && (args.branch.fBranches.arr.length > 0))) && !args.leaf;
this.addBranch(branch, 'br0', args.direct_branch); // add branch
this.Process = this.ProcessDump;
return true;
}
this.vars[0] = new TDrawVariable(this.globals);
if (!this.vars[0].parse(tree, this, expr, branch, args.direct_branch)) return false;
this.hist_title = `drawing branch ${branch.fName} ${expr?' expr:'+expr:''} from ${tree.fName}`;
this.cut = new TDrawVariable(this.globals);
if (this.vars[0].direct_branch) this.ProcessArrays = this.ProcessArraysFunc;
return true;
}
/** @summary Begin processing */
Begin(tree) {
this.globals.entries = tree.fEntries;
if (this.monitoring)
this.lasttm = new Date().getTime();
}
/** @summary Show progress */
ShowProgress(/* value */) {}
/** @summary Get bins for bits histogram */
getBitsBins(nbits, res) {
res.nbins = res.max = nbits;
res.fLabels = create(clTHashList);
for (let k = 0; k < nbits; ++k) {
const s = create(clTObjString);
s.fString = k.toString();
s.fUniqueID = k + 1;