Gate and vocabulary#
Check a candidate’s code and graph before it is evaluated. See The vocabulary and Gate, review and evaluation.
Check candidates; see the module docstring for the order of the checks. |
|
A candidate whose graph was built: the graph, its fingerprint and its statistics. |
|
A candidate refused by the gate, with the reasons sent back to the proposer. |
|
A factor graph in topological order; the last node is the factor. |
|
What candidates may write with; build it with |
|
The field or operator files are wrong; the message lists every problem. |
|
The factors the Gate checks originality against. |
|
One proposed factor. |
Intraday stages#
Split an intraday family’s candidate into its intraday and daily stages, and the session aggregations it may reduce a session with. See Intraday families.
Return |
|
A graph split into its stages; see the module docstring. |
|
The name of the session column of an aggregation subtree, from the hash of what it computes. |
|
The base of the session aggregations: a reduction of its inputs over each session's bars. |
|
The mean of |
|
The sum of |
|
The number of the session's bars where |
|
The unbiased standard deviation of |
|
The unbiased skewness of |
|
The least value of |
|
The greatest value of |
|
The first value of |
|
The last value of |
|
The mean of |
|
The correlation of |
|
|