Expand description
Lazy evaluation IR for TidyView.
A LazyView captures a chain of operations as a tree of ViewNodes.
On .collect(), the tree is optimized by rule-based passes, then executed.
§Determinism
- All plan transformations are pure, deterministic functions.
- No HashMap/HashSet usage – only Vec and BTreeSet for column tracking.
- Execution delegates to TidyView/TidyFrame methods which already guarantee deterministic output (Kahan summation, BTreeMap groups, stable sorts).
Structs§
- Batch
- A chunk of up to
BATCH_SIZErows for vectorized processing. - Lazy
View - A lazy view that captures operations without executing them.
Enums§
Functions§
- execute_
batched - Execute an optimized ViewNode tree using batch processing where possible.
- optimize
- Apply all optimization passes to a ViewNode tree.