Skip to content

Commit 1906a4a

Browse files
ggevayclaude
andcommitted
compute: document the bucketing refinement in RelaxMustConsolidate
Co-Authored-By: Claude Opus 5.5 <[email protected]>
1 parent 0fca2b0 commit 1906a4a

1 file changed

Lines changed: 4 additions & 2 deletions

File tree

‎src/compute-types/src/plan/transform/relax_must_consolidate.rs‎

Lines changed: 4 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -18,7 +18,8 @@ use crate::plan::{ArrangementStrategy, LirRelationExpr, LirRelationNode, ReduceP
1818

1919
/// A transformation that takes the result of single-time physical monotonicity
2020
/// analysis and refines, as appropriate, the setting of the `must_consolidate`
21-
/// flag in monotonic `LirRelationExpr` nodes with forced consolidation.
21+
/// flag in monotonic `LirRelationExpr` nodes with forced consolidation. Where it
22+
/// clears the flag, it also sets the node's temporal bucketing strategy to `Direct`.
2223
#[derive(Debug)]
2324
pub struct RelaxMustConsolidate;
2425

@@ -36,7 +37,8 @@ impl BottomUpTransform for RelaxMustConsolidate {
3637
}
3738

3839
fn action(plan: &mut LirRelationExpr, _plan_info: &Self::Info, input_infos: &[Self::Info]) {
39-
// Look at `input_infos` and type of `LirRelationExpr` node and refine the `must_consolidate` flag.
40+
// Look at `input_infos` and type of `LirRelationExpr` node and refine the `must_consolidate`
41+
// flag and the temporal bucketing strategy.
4042
// Note that the LIR nodes we care about have a single input.
4143
match (&mut plan.node, input_infos) {
4244
(

0 commit comments

Comments
 (0)