Core expression language.
- Utility functions to transform parts of a single
MirRelationExprinto canonical form.
EXPLAINsupport for structures defined in this crate.
- id 🔒
- linear 🔒
- relation 🔒
- scalar 🔒
- A set of virtual nodes that are used to recover some high-level concepts that are desugared to non-trival terms in some IRs.
- Visitor support for recursive data types.
- Describes an aggregation expression.
- Specification for an ordering by a column.
- An interpreter that:
- Filter characteristics that are used for ordering join inputs. This can be created for a
Vec<MirScalarExpr>, which represents an AND of predicates.
- Characteristics of a join order candidate collection.
- Any column in a join expression exists in two contexts:
- Maximum iterations for a LetRec.
- The identifier for a local component of a dataflow.
- A compound operator that can be applied row-by-row.
- Predicates partitioned into temporal and non-temporal.
MirRelationExprthat claims to have been optimized, e.g., by an
- An approximation of the set of values an expression might have, including whether or not it might be null or an error value. This is generally an overapproximation, in the sense that ResultSpec::may_contain may return true even if the argument is not included in the set. (However, it should never return false when the value is included!)
- Instructions for finishing the result of a query.
- A wrapper type which indicates it is safe to simply evaluate all expressions.
- Unique identifier for an instantiation of a source.
- An interpreter that traces how information about the source columns flows through the expression.
- Describe a window frame, e.g.
RANGE UNBOUNDED PRECEDINGor
ROWS BETWEEN 5 PRECEDING AND CURRENT ROW.
- An opaque identifier for a dataflow component. In other words, identifies the target of a
- Describe a join implementation in dataflow.
- Identify whether the given aggregate function is Lag or Lead, since they share implementations.
- An abstract syntax tree which defines a collection.
- Unique identifier for each part of a whole source. Kafka -> partition None -> sources that have no notion of partitioning (e.g file sources)
- Specifies WindowFrame’s
- Describe how frame bounds are interpreted
- A recursion limit to be used for stack-safe traversals of
- A trait for types that describe how to build a collection.
order. If that doesn’t produce a strict ordering, call
- Given the permutations (see
dataflow::plan::AvailableCollections) corresponding to two collections with the same key arity, computes the permutation for the result of joining them.
- Recursively memoize parts of
expr, storing those parts in
- Augment non-nullability of columns, by observing either
- Return the map associating columns in the logical, unthinned representation of a collection to columns in the thinned representation of the arrangement corresponding to