style: apply rustfmt formatting across core crates

Co-Authored-By: Claude Sonnet 4.6 <noreply@anthropic.com>

Author: milindsrivastava1997

crates/core/src/intent_algebra/expr.rs

@@ -1,38 +1,51 @@
 use std::rc::Rc;
 use std::time::Duration;
 
-use crate::types::AccuracyTarget;
 use super::schema::{HasSchema, L3Schema, SchemaCatalog};
+use crate::types::AccuracyTarget;
 
 // ── Stub leaf / supporting types ──────────────────────────────────────────────
 // Full definitions will be added as the respective layers are implemented.
 
 /// A row-level filter predicate (WHERE clause / PromQL label matcher).
-#[derive(Debug, Clone)] pub struct Predicate;
+#[derive(Debug, Clone)]
+pub struct Predicate;
 /// One item in a SELECT projection list.
-#[derive(Debug, Clone)] pub struct ProjectItem;
+#[derive(Debug, Clone)]
+pub struct ProjectItem;
 /// A GROUP BY key reference.
-#[derive(Debug, Clone)] pub struct GroupKey;
+#[derive(Debug, Clone)]
+pub struct GroupKey;
 /// A reference to a column by name.
-#[derive(Debug, Clone)] pub struct ColumnRef;
+#[derive(Debug, Clone)]
+pub struct ColumnRef;
 /// A set of partitioning keys (sharding hint for L5 stage allocator).
-#[derive(Debug, Clone)] pub struct PartitionKeys;
+#[derive(Debug, Clone)]
+pub struct PartitionKeys;
 /// One key in an ORDER BY clause.
-#[derive(Debug, Clone)] pub struct SortKey;
+#[derive(Debug, Clone)]
+pub struct SortKey;
 /// An analytic window frame (ROWS / RANGE BETWEEN …).
-#[derive(Debug, Clone)] pub struct WindowFrame;
+#[derive(Debug, Clone)]
+pub struct WindowFrame;
 /// PromQL vector-match modifiers (`on`/`ignoring` + `group_left`/`group_right`).
-#[derive(Debug, Clone)] pub struct VectorMatch;
+#[derive(Debug, Clone)]
+pub struct VectorMatch;
 /// Reference to a metric by name (PromQL / OTLP).
-#[derive(Debug, Clone)] pub struct MetricRef;
+#[derive(Debug, Clone)]
+pub struct MetricRef;
 /// Closed time interval for a time-series scan.
-#[derive(Debug, Clone)] pub struct TimeRange;
+#[derive(Debug, Clone)]
+pub struct TimeRange;
 /// Label matchers applied to a time-series scan.
-#[derive(Debug, Clone)] pub struct LabelFilter;
+#[derive(Debug, Clone)]
+pub struct LabelFilter;
 /// Reference to a relational table by name.
-#[derive(Debug, Clone)] pub struct TableRef;
+#[derive(Debug, Clone)]
+pub struct TableRef;
 /// Join key specification (USING / ON column reference).
-#[derive(Debug, Clone)] pub struct JoinKey;
+#[derive(Debug, Clone)]
+pub struct JoinKey;
 
 // ── Enum supporting types ─────────────────────────────────────────────────────
 
@@ -55,20 +68,39 @@ pub enum SetOpKind {
 #[derive(Debug, Clone, PartialEq, Eq)]
 pub enum BinaryOpKind {
     // Arithmetic
-    Add, Sub, Mul, Div, Mod,
+    Add,
+    Sub,
+    Mul,
+    Div,
+    Mod,
     // Comparison
-    Eq, NotEq, Lt, LtEq, Gt, GtEq,
+    Eq,
+    NotEq,
+    Lt,
+    LtEq,
+    Gt,
+    GtEq,
     // Boolean / PromQL set operators
-    And, Or, Unless,
+    And,
+    Or,
+    Unless,
 }
 
 #[derive(Debug, Clone, PartialEq, Eq)]
 pub enum WindowFuncKind {
-    RowNumber, Rank, DenseRank,
-    Lag, Lead,
-    FirstValue, LastValue,
+    RowNumber,
+    Rank,
+    DenseRank,
+    Lag,
+    Lead,
+    FirstValue,
+    LastValue,
     NthValue(u64),
-    Sum, Avg, Count, Min, Max,
+    Sum,
+    Avg,
+    Count,
+    Min,
+    Max,
 }
 
 /// Which data model a `Source` or `AggIntent` operates over.
@@ -141,23 +173,38 @@ impl Source {
 #[derive(Debug, Clone)]
 pub enum AggIntent {
     // ── Data-model-agnostic ───────────────────────────────────────────────────
-    Count { accuracy: AccuracyTarget },
+    Count {
+        accuracy: AccuracyTarget,
+    },
     Sum,
     Min,
     Max,
-    Quantile { q: f64, accuracy: AccuracyTarget },
+    Quantile {
+        q: f64,
+        accuracy: AccuracyTarget,
+    },
     /// Heavy-hitter top-k. Distinct from generic `Sort + Limit` — a
     /// dedicated sketch (SpaceSaving, CMS-with-heap) computes it as a single
     /// primitive. Recognised by L1→L2→L3 lowering on `ORDER BY count DESC
     /// LIMIT k` / PromQL `topk(k, …)`.
-    TopK { k: usize, by: Vec<ColumnRef>, accuracy: AccuracyTarget },
-    Cardinality { accuracy: AccuracyTarget },
+    TopK {
+        k: usize,
+        by: Vec<ColumnRef>,
+        accuracy: AccuracyTarget,
+    },
+    Cardinality {
+        accuracy: AccuracyTarget,
+    },
 
     // ── Time-series streaming derivatives ────────────────────────────────────
     // Include PromQL counter-reset adjustment; not equivalent to Sum/Count
     // over a Window. Kept distinct so delta-set aggregators bind directly.
-    Rate { window: Duration },
-    Increase { window: Duration },
+    Rate {
+        window: Duration,
+    },
+    Increase {
+        window: Duration,
+    },
 }
 
 impl AggIntent {
@@ -197,15 +244,24 @@ pub struct L3Node {
 pub enum QueryExpr {
     // ── Base relations ────────────────────────────────────────────────────────
     /// Outermost leaf. `source` carries the data-model-specific leaf shape.
-    Scan { source: Source, predicates: Vec<Predicate> },
+    Scan {
+        source: Source,
+        predicates: Vec<Predicate>,
+    },
     /// Reference to a named `LetBinding` sub-expression; resolved at plan time.
     Ref(String),
 
     // ── Filtering & projection ────────────────────────────────────────────────
     /// σ — row-level filter. Output schema = child schema (unchanged).
-    Filter { child: Rc<L3Node>, pred: Predicate },
+    Filter {
+        child: Rc<L3Node>,
+        pred: Predicate,
+    },
     /// π — column projection. Output schema = child schema projected to `cols`.
-    Project { child: Rc<L3Node>, cols: Vec<ProjectItem> },
+    Project {
+        child: Rc<L3Node>,
+        cols: Vec<ProjectItem>,
+    },
 
     // ── Aggregation ───────────────────────────────────────────────────────────
     /// γ + α — GROUP BY + aggregate intents. Concrete operator (HashAgg /
@@ -231,13 +287,21 @@ pub enum QueryExpr {
     // ── Distributed-execution structure ───────────────────────────────────────
     /// Logical-only partitioning marker. Output schema = child schema.
     /// Carries a sharding hint for the L5 stage allocator.
-    Partition { child: Rc<L3Node>, keys: PartitionKeys },
+    Partition {
+        child: Rc<L3Node>,
+        keys: PartitionKeys,
+    },
     /// δ — SQL `DISTINCT` / row deduplication.
-    Distinct { child: Rc<L3Node>, cols: Vec<ColumnRef> },
+    Distinct {
+        child: Rc<L3Node>,
+        cols: Vec<ColumnRef>,
+    },
     /// ⊕ — exact union of sub-results from independent stages or shards.
     /// Sketch unions are a separate node in `SummaryExpr` because they carry
     /// sketch-family / params type constraints.
-    Merge { children: Vec<Rc<L3Node>> },
+    Merge {
+        children: Vec<Rc<L3Node>>,
+    },
 
     // ── Joins ─────────────────────────────────────────────────────────────────
     /// Logical join. L4 picks the physical alternative (HashJoin /
@@ -261,11 +325,21 @@ pub enum QueryExpr {
     // ── Ordering & limiting ───────────────────────────────────────────────────
     /// Generic order-by for non-heavy-hitter cases (`ORDER BY name LIMIT 10`).
     /// Heavy-hitter shapes lower to `AggIntent::TopK` instead.
-    Sort { child: Rc<L3Node>, keys: Vec<SortKey> },
-    Limit { child: Rc<L3Node>, n: u64, offset: u64 },
+    Sort {
+        child: Rc<L3Node>,
+        keys: Vec<SortKey>,
+    },
+    Limit {
+        child: Rc<L3Node>,
+        n: u64,
+        offset: u64,
+    },
 
     // ── Subquery / CTE ────────────────────────────────────────────────────────
-    Subquery { child: Rc<L3Node>, alias: String },
+    Subquery {
+        child: Rc<L3Node>,
+        alias: String,
+    },
     /// SQL `WITH name AS (expr) … body`; lowering target for PromQL
     /// recording-rule bindings. The `expr` sub-DAG may be referenced N times
     /// via `Ref(name)` in `body`, giving the DAG its fan-in.

crates/core/src/intent_algebra/mod.rs

@@ -3,8 +3,7 @@ pub mod schema;
 
 pub use expr::{
     AggIntent, BinaryOpKind, ColumnRef, DataModel, GroupKey, JoinKey, JoinKind, L3Node,
-    LabelFilter, MetricRef, PartitionKeys, Predicate, ProjectItem, QueryExpr, SetOpKind,
-    SortKey, Source, TableRef, TimeRange, TimeWindowKind, VectorMatch, WindowFrame,
-    WindowFuncKind,
+    LabelFilter, MetricRef, PartitionKeys, Predicate, ProjectItem, QueryExpr, SetOpKind, SortKey,
+    Source, TableRef, TimeRange, TimeWindowKind, VectorMatch, WindowFrame, WindowFuncKind,
 };
 pub use schema::{HasSchema, L3DataType, L3Field, L3Schema, SchemaCatalog};

crates/core/src/sketch_algebra/expr.rs

@@ -1,8 +1,8 @@
 use std::rc::Rc;
 
-use crate::intent_algebra::{ColumnRef, GroupKey, L3Node};
 use super::schema::L4Schema;
-use super::sketch::{SummaryKind, SummaryParams, SketchQuery};
+use super::sketch::{SketchQuery, SummaryKind, SummaryParams};
+use crate::intent_algebra::{ColumnRef, GroupKey, L3Node};
 
 // ── L4 DAG node ───────────────────────────────────────────────────────────────
 
@@ -63,10 +63,7 @@ pub enum SummaryExpr {
     /// linear-inverse property (CMS, theta, count-based). Catalog flag
     /// `subtractable` must be true for the sketch family.
     /// Output schema: one `Sketch(s, p)` field (same family + params as inputs).
-    SummarySubtract {
-        left: Rc<L4Node>,
-        right: Rc<L4Node>,
-    },
+    SummarySubtract { left: Rc<L4Node>, right: Rc<L4Node> },
 
     /// Delete a key from a sketch (CMS update with −1, deletable Bloom
     /// filter). Catalog flag `deletable` must be true. Output schema =
@@ -90,7 +87,5 @@ pub enum SummaryExpr {
     /// agree on `(sketch, params)` and the catalog flag `mergeable` must
     /// be true. Inserted by the L5 stage allocator on cut edges.
     /// Output schema: one `Sketch(s, p)` field (same family + params as inputs).
-    SummaryMerge {
-        children: Vec<Rc<L4Node>>,
-    },
+    SummaryMerge { children: Vec<Rc<L4Node>> },
 }

crates/core/src/sketch_algebra/mod.rs

@@ -4,4 +4,4 @@ pub mod sketch;
 
 pub use expr::{L4Node, SummaryExpr};
 pub use schema::{L4DataType, L4Field, L4Schema};
-pub use sketch::{SummaryKind, SummaryParams, SketchQuery};
+pub use sketch::{SketchQuery, SummaryKind, SummaryParams};

crates/core/src/sketch_algebra/schema.rs

@@ -1,5 +1,5 @@
-use crate::intent_algebra::L3DataType;
 use super::sketch::{SummaryKind, SummaryParams};
+use crate::intent_algebra::L3DataType;
 
 // ── L4 data types ─────────────────────────────────────────────────────────────
 

crates/core/src/sketch_algebra/sketch.rs

@@ -50,13 +50,30 @@ pub enum SummaryParams {
     Increase,
     Rate,
     // Approximate sketches — algorithm-specific tuning parameters
-    Kll { k: u32 },
-    Cms { width: u32, depth: u32 },
-    Hll { precision: u8 },
-    DDSketch { alpha: f64 },
-    CmsWithHeap { width: u32, depth: u32, heap_size: u32 },
-    Kmv { k: u32 },
-    Theta { k: u32 },
+    Kll {
+        k: u32,
+    },
+    Cms {
+        width: u32,
+        depth: u32,
+    },
+    Hll {
+        precision: u8,
+    },
+    DDSketch {
+        alpha: f64,
+    },
+    CmsWithHeap {
+        width: u32,
+        depth: u32,
+        heap_size: u32,
+    },
+    Kmv {
+        k: u32,
+    },
+    Theta {
+        k: u32,
+    },
 }
 
 // ── Sketch read-out queries ───────────────────────────────────────────────────