|
A11 (C++ runtime)
Native C++ implementation of the A11 streaming action runtime
|
#include <cpp/a11/flow/graph.h>
Public Attributes | |
| std::string | name |
| vocabulary::StageArgument | takes = vocabulary::StageArgument::kNone |
| long long | count = 0 |
kNumber: the count. | |
| std::string | text |
kString/kOptionalString: the text. Also the field name for at. | |
| ExprId | expr = kNone |
kExpression: the expression, with it bound. | |
| RefId | stream = kNone |
kStream: the stream then reads after this one. | |
| LogTail | log |
kLog/kLogFormat: what was written after the stage name. | |
| bool | indexed = false |
Whether at was written as an index rather than a field name. | |
| long long | index = 0 |
| bool | named_or_indexed = false |
Whether at should try its name and then its index, which is what a destructuring let needs: let name, age = user is by field over a record and by position over a pair, and only the value knows which it is. | |
| absl::Duration | duration |
kDuration: how long timeout waits for the next value, or pace leaves between two of them. | |
| bool | descending = false |
sort: whether the order is reversed. | |
| syntax::Constant | start |
fold: what the first pass carries, the name it is bound to, and the ref that name resolves to inside the fold's expression. | |
| std::string | carried |
| RefId | carry = kNone |
| bool | tolerant = false |
try: a value this stage cannot do is dropped rather than ending the pipeline. | |
| RefId | failures = kNone |
try ... into ref: where a tolerated failure goes, as a status record. | |
| int | parallel = 1 |
parallel n: how many values this stage may work on at once. | |
| bool | ordered = true |
| Whether values leave in the order they arrived. | |
| std::string a11::flow::graph::Stage::carried |
| long long a11::flow::graph::Stage::count = 0 |
kNumber: the count.
| bool a11::flow::graph::Stage::descending = false |
sort: whether the order is reversed.
| absl::Duration a11::flow::graph::Stage::duration |
kDuration: how long timeout waits for the next value, or pace leaves between two of them.
try ... into ref: where a tolerated failure goes, as a status record.
| long long a11::flow::graph::Stage::index = 0 |
| bool a11::flow::graph::Stage::indexed = false |
Whether at was written as an index rather than a field name.
| LogTail a11::flow::graph::Stage::log |
kLog/kLogFormat: what was written after the stage name.
| std::string a11::flow::graph::Stage::name |
| bool a11::flow::graph::Stage::named_or_indexed = false |
Whether at should try its name and then its index, which is what a destructuring let needs: let name, age = user is by field over a record and by position over a pair, and only the value knows which it is.
| bool a11::flow::graph::Stage::ordered = true |
Whether values leave in the order they arrived.
A parallel stage puts them back in order unless unordered said not to.
| int a11::flow::graph::Stage::parallel = 1 |
parallel n: how many values this stage may work on at once.
| syntax::Constant a11::flow::graph::Stage::start |
fold: what the first pass carries, the name it is bound to, and the ref that name resolves to inside the fold's expression.
The ref is how the accumulator reaches [Evaluate]: a name in an expression is a ref, and this is the one the runtime fills in per value rather than reading a stream for.
| vocabulary::StageArgument a11::flow::graph::Stage::takes = vocabulary::StageArgument::kNone |
| std::string a11::flow::graph::Stage::text |
kString/kOptionalString: the text. Also the field name for at.
| bool a11::flow::graph::Stage::tolerant = false |
try: a value this stage cannot do is dropped rather than ending the pipeline.