-
Notifications
You must be signed in to change notification settings - Fork 76
/
python.py
485 lines (418 loc) · 15.1 KB
/
python.py
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
# BSD 3-Clause License; see https://github.com/scikit-hep/uproot4/blob/main/LICENSE
"""
This module defines a :doc:`uproot.language.Language` for expressions passed to
:ref:`uproot.behaviors.TBranch.HasBranches.arrays` (and similar).
The :doc:`uproot.language.python.PythonLanguage` evaluates Python code. It is
the default language.
"""
from __future__ import absolute_import
import ast
import numpy
import uproot
def _expression_to_node(expression, file_path, object_path):
try:
node = ast.parse(expression)
except SyntaxError as err:
raise SyntaxError(
err.args[0] + "\nin file {0}\nin object {1}".format(file_path, object_path),
err.args[1],
)
if len(node.body) != 1 or not isinstance(node.body[0], ast.Expr):
raise SyntaxError(
"expected a single expression\nin file {0}\nin object {1}".format(
file_path, object_path
)
)
return node
def _attribute_to_dotted_name(node):
if isinstance(node, ast.Attribute):
tmp = _attribute_to_dotted_name(node.value)
if tmp is None:
return None
else:
return tmp + "." + node.attr
elif isinstance(node, ast.Name):
return node.id
else:
return None
def _walk_ast_yield_symbols(node, keys, aliases, functions, getter):
if (
isinstance(node, ast.Call)
and isinstance(node.func, ast.Name)
and node.func.id == getter
):
if len(node.args) == 1 and isinstance(node.args[0], ast.Str):
yield node.args[0].s
else:
raise TypeError(
"expected a constant string as the only argument of {0}; "
"found {1}".format(repr(getter), ast.dump(node.args))
)
elif isinstance(node, ast.Name):
if node.id in keys or node.id in aliases:
yield node.id
elif node.id in functions or node.id == getter:
pass
else:
raise KeyError(node.id)
elif isinstance(node, ast.Attribute):
name = _attribute_to_dotted_name(node)
if name is None:
for y in _walk_ast_yield_symbols(
node.value, keys, aliases, functions, getter
):
yield y
elif name in keys or name in aliases:
yield name
else:
# implicitly means functions and getter can't have dots in their names
raise KeyError(name)
elif isinstance(node, ast.AST):
for field_name in node._fields:
x = getattr(node, field_name)
for y in _walk_ast_yield_symbols(x, keys, aliases, functions, getter):
yield y
elif isinstance(node, list):
for x in node:
for y in _walk_ast_yield_symbols(x, keys, aliases, functions, getter):
yield y
else:
pass
def _ast_as_branch_expression(node, keys, aliases, functions, getter):
if (
isinstance(node, ast.Call)
and isinstance(node.func, ast.Name)
and node.func.id == getter
and len(node.args) == 1
and isinstance(node.args[0], ast.Str)
):
return node
elif isinstance(node, ast.Name):
if node.id in keys or node.id in aliases:
return ast.parse("get({0})".format(repr(node.id))).body[0].value
elif node.id in functions:
return ast.parse("function[{0}]".format(repr(node.id))).body[0].value
else:
raise KeyError(node.id)
elif isinstance(node, ast.Attribute):
name = _attribute_to_dotted_name(node)
if name is None:
value = _ast_as_branch_expression(
node.value, keys, aliases, functions, getter
)
new_node = ast.Attribute(value, node.attr, node.ctx)
new_node.lineno = getattr(node, "lineno", 1)
new_node.col_offset = getattr(node, "col_offset", 0)
return new_node
elif name in keys or name in aliases:
return ast.parse("get({0})".format(repr(name))).body[0].value
else:
# implicitly means functions and getter can't have dots in their names
raise KeyError(name)
elif isinstance(node, ast.AST):
args = []
for field_name in node._fields:
field_value = getattr(node, field_name)
args.append(
_ast_as_branch_expression(field_value, keys, aliases, functions, getter)
)
new_node = type(node)(*args)
new_node.lineno = getattr(node, "lineno", 1)
new_node.col_offset = getattr(node, "col_offset", 0)
return new_node
elif isinstance(node, list):
return [
_ast_as_branch_expression(x, keys, aliases, functions, getter) for x in node
]
else:
return node
def _expression_to_function(
expression, keys, aliases, functions, getter, scope, file_path, object_path
):
if expression in keys:
return lambda: scope[getter](expression)
else:
node = _expression_to_node(expression, file_path, object_path)
try:
expr = _ast_as_branch_expression(
node.body[0].value, keys, aliases, functions, getter
)
except KeyError as err:
raise uproot.KeyInFileError(
err.args[0],
keys=sorted(keys) + list(aliases),
file_path=file_path,
object_path=object_path,
)
function = ast.parse("lambda: None").body[0].value
function.body = expr
expression = ast.Expression(function)
expression.lineno = getattr(function, "lineno", 1)
expression.col_offset = getattr(function, "col_offset", 0)
return eval(compile(expression, "<dynamic>", "eval"), scope)
def _vectorized_erf(complement):
a1 = 0.254829592
a2 = -0.284496736
a3 = 1.421413741
a4 = -1.453152027
a5 = 1.061405429
p = 0.3275911
def erf(values):
t = 1.0 / (numpy.absolute(values) * p + 1)
y = 1.0 - ((((a5 * t + a4) * t + a3) * t + a2) * t + a1) * t * numpy.exp(
numpy.negative(numpy.square(values))
)
if complement:
return 1.0 - numpy.copysign(y, values)
else:
return numpy.copysign(y, values)
return erf
def _vectorized_gamma(logarithm):
cofs = (
76.18009173,
-86.50532033,
24.01409822,
-1.231739516e0,
0.120858003e-2,
-0.536382e-5,
)
stp = 2.50662827465
def lgamma(values):
x = values - 1.0
tmp = x + 5.5
with numpy.errstate(invalid="ignore"):
tmp = (x + 0.5) * numpy.log(tmp) - tmp
ser = 1.0
with numpy.errstate(divide="ignore"):
for cof in cofs:
x = x + 1.0
ser = ser + cof / x
with numpy.errstate(invalid="ignore"):
return tmp + numpy.log(stp * ser)
if logarithm:
return lgamma
else:
return lambda values: numpy.exp(lgamma(values))
_lgamma = _vectorized_gamma(True)
class PythonLanguage(uproot.language.Language):
"""
Args:
functions (None or dict): Mapping from function name to function, or
None for ``default_functions``.
getter (str): Name of the function that extracts branches by name;
needed for branches whose names are not valid Python symbols.
Default is "get".
PythonLanguage is the default :doc:`uproot.language.Language` for
interpreting expressions passed to
:ref:`uproot.behaviors.TBranch.HasBranches.arrays` (and similar). This
interpretation assumes that the expressions have Python syntax and
semantics, with math functions loaded into the namespace.
Unlike standard Python, an expression with attributes, such as
``some.thing``, can be a single identifier, so that a ``TBranch`` whose
name contains dots does not need to be loaded with ``get("some.thing")``.
"""
default_functions = {
"abs": numpy.absolute,
"absolute": numpy.absolute,
"acos": numpy.arccos,
"arccos": numpy.arccos,
"acosh": numpy.arccosh,
"arccosh": numpy.arccosh,
"asin": numpy.arcsin,
"arcsin": numpy.arcsin,
"asinh": numpy.arcsinh,
"arcsinh": numpy.arcsinh,
"atan": numpy.arctan,
"atan2": numpy.arctan2,
"arctan": numpy.arctan,
"arctan2": numpy.arctan2,
"atanh": numpy.arctanh,
"arctanh": numpy.arctanh,
"cbrt": numpy.cbrt,
"ceil": numpy.ceil,
"conj": numpy.conjugate,
"conjugate": numpy.conjugate,
"copysign": numpy.copysign,
"cos": numpy.cos,
"cosh": numpy.cosh,
"erf": _vectorized_erf(False),
"erfc": _vectorized_erf(True),
"exp": numpy.exp,
"exp2": numpy.exp2,
"expm1": numpy.expm1,
"fabs": numpy.fabs,
"factorial": lambda x: numpy.round(numpy.exp(_lgamma(numpy.round(x) + 1))),
"floor": numpy.floor,
"fmax": numpy.fmax,
"fmin": numpy.fmin,
"gamma": _vectorized_gamma(False),
"hypot": numpy.hypot,
"imag": numpy.imag,
"isfinite": numpy.isfinite,
"isinf": numpy.isinf,
"isnan": numpy.isnan,
"lgamma": _lgamma,
"log": numpy.log,
"log10": numpy.log10,
"log1p": numpy.log1p,
"log2": numpy.log2,
"logical_and": numpy.logical_and,
"logical_or": numpy.logical_or,
"neg": numpy.negative,
"nextafter": numpy.nextafter,
"real": numpy.real,
"rint": numpy.rint,
"round": numpy.round,
"signbit": numpy.signbit,
"sin": numpy.sin,
"sinh": numpy.sinh,
"sqrt": numpy.sqrt,
"tan": numpy.tan,
"tanh": numpy.tanh,
"tgamma": lambda x: numpy.exp(_lgamma(x)),
"trunc": numpy.trunc,
"where": numpy.where,
}
def __init__(self, functions=None, getter="get"):
if functions is None:
self._functions = self.default_functions
else:
self._functions = dict(functions)
self._getter = getter
def __repr__(self):
return "uproot.language.python.PythonLanguage()"
def __eq__(self, other):
return isinstance(other, PythonLanguage)
@property
def functions(self):
"""
Mapping from function name to function (dict).
"""
return self._functions
@property
def getter(self):
"""
Name of the function that extracts branches by name; needed for
branches whose names are not valid Python symbols.
"""
return self._getter
def getter_of(self, name):
"""
Returns a string, an expression in which the ``getter`` is getting
``name`` as a quoted string.
For example, ``"get('something')"``.
"""
return "{0}({1})".format(self._getter, repr(name))
def free_symbols(self, expression, keys, aliases, file_path, object_path):
"""
Args:
expression (str): The expression to analyze.
keys (list of str): Names of branches or aliases (for aliases that
refer to aliases).
aliases (list of str): Names of aliases.
file_path (str): File path for error messages.
object_path (str): Object path for error messages.
Finds the symbols in the expression that are in ``keys`` or ``aliases``,
in other words, ``TBranch`` names or alias names. These expressions may
include dots (attributes). Known ``functions`` and the ``getter`` are
excluded.
"""
if expression in keys:
return [expression]
else:
node = _expression_to_node(expression, file_path, object_path)
try:
return list(
_walk_ast_yield_symbols(
node, keys, aliases, self._functions, self._getter
)
)
except KeyError as err:
raise uproot.KeyInFileError(
err.args[0], file_path=file_path, object_path=object_path
)
def compute_expressions(
self,
hasbranches,
arrays,
expression_context,
keys,
aliases,
file_path,
object_path,
):
"""
Args:
hasbranches (:doc:`uproot.behaviors.TBranch.HasBranches`): The
``TTree`` or ``TBranch`` that is requesting a computation.
arrays (dict of arrays): Inputs to the computation.
expression_context (list of (str, dict) tuples): Expression strings
and a dict of metadata about each.
keys (list of str): Names of branches or aliases (for aliases that
refer to aliases).
aliases (list of str): Names of aliases.
file_path (str): File path for error messages.
object_path (str): Object path for error messages.
Computes an array for each expression.
"""
values = {}
def getter(name):
if name not in values:
values[name] = _expression_to_function(
aliases[name],
keys,
aliases,
self._functions,
self._getter,
scope,
file_path,
object_path,
)()
return values[name]
scope = {self._getter: getter, "function": self._functions}
for _, context in expression_context:
for branch in context["branches"]:
array = arrays[branch.cache_key]
name = branch.name
while branch is not hasbranches:
if name in keys:
values[name] = array
branch = branch.parent
if branch is not hasbranches:
name = branch.name + "/" + name
name = "/" + name
if name in keys:
values[name] = array
output = {}
for expression, context in expression_context:
if context["is_primary"] and not context["is_cut"]:
output[expression] = _expression_to_function(
expression,
keys,
aliases,
self._functions,
self._getter,
scope,
file_path,
object_path,
)()
cut = None
for expression, context in expression_context:
if context["is_primary"] and context["is_cut"]:
cut = _expression_to_function(
expression,
keys,
aliases,
self._functions,
self._getter,
scope,
file_path,
object_path,
)()
break
if cut is not None:
cut = cut != 0
for name in output:
output[name] = output[name][cut]
return output
python_language = PythonLanguage()