Skip to main content

Module lazy

Module lazy 

Source
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_SIZE rows for vectorized processing.
LazyView
A lazy view that captures operations without executing them.

Enums§

JoinType
The kind of join.
ViewNode
A node in the lazy evaluation tree.

Functions§

execute_batched
Execute an optimized ViewNode tree using batch processing where possible.
optimize
Apply all optimization passes to a ViewNode tree.