Expand description
Stack-only expression graph construction and evaluation.
Due to the stack-only limitation, the expression graph must be strictly a tree, as we would otherwise require multiple mutable references to some nodes.
Notably, this does not prevent us from using some input arrays more than once, because we only require immutable references to the inputs, and we can have as many of these as we like.
Structs§
- Accumulator
- A many-to-one adapter for the output of an expression.
- Expr
- A node in an elementwise array expression applying an (MxN)-to-(1xN) operator.
Traits§
- Accumulator
Fn - (1xN)-to-(1x1) incremental-evaluation operation such as a cumulative sum or product.
- Binary
Fn - (2xN)-to-(1xN) elementwise array operation.
- Ternary
Fn - (3xN)-to-(1xN) elementwise array operation such as fused multiply-add.
- UnaryFn
- (1xN)-to-(1xN) elementwise array operation.