@quereus/quereus 4.4.1 → 4.6.0

package/dist/src/planner/stats/index.d.ts

@@ -4,8 +4,24 @@
  */
 import type { ScalarPlanNode } from '../nodes/plan-node.js';
 import type { TableSchema } from '../../schema/table.js';
+/**
+ * Resolves the attribute id of a column reference appearing in a predicate to the
+ * name of the base-table column whose statistics describe it.
+ *
+ * Returns undefined when the attribute was minted above the base table (a computed
+ * projection, an aggregate or window output, a set-operation output) — such a column
+ * has no base-table statistics, whatever it happens to be named.
+ */
+export type ColumnStatsResolver = (attributeId: number) => string | undefined;
 /**
  * Statistics provider interface for optimizer
+ *
+ * The `resolve` parameter on the selectivity family identifies a predicate's columns
+ * by attribute identity rather than by the name in their AST. A caller holding a plan
+ * tree MUST pass one: without it a provider falls back to the syntactic name, and a
+ * computed column aliased to a base column's name silently borrows that column's
+ * statistics. It stays optional only for callers with no plan context (direct unit
+ * tests over hand-built nodes).
  */
 export interface StatsProvider {
     /**
@@ -18,17 +34,35 @@ export interface StatsProvider {
      * Get selectivity estimate for a predicate on a table
      * @param table Table schema
      * @param predicate Predicate expression
+     * @param resolve Attribute id → base-column name; see {@link ColumnStatsResolver}
      * @returns Selectivity factor (0.0 to 1.0), or undefined if unknown
      */
-    selectivity(table: TableSchema, predicate: ScalarPlanNode): number | undefined;
+    selectivity(table: TableSchema, predicate: ScalarPlanNode, resolve?: ColumnStatsResolver): number | undefined;
+    /**
+     * Selectivity derived from REAL statistics only, with no heuristic fallback.
+     *
+     * `selectivity` always answers, substituting a fabricated per-nodeType guess when
+     * the catalog cannot say anything. Callers that must distinguish "the statistics
+     * say 0.25" from "nobody knows, here is 0.1" use this instead; undefined means the
+     * backing statistics could not answer. A provider that never fabricates may alias
+     * this to `selectivity`; one that only ever guesses should leave it unimplemented,
+     * which reads as "no real statistics".
+     *
+     * @param table Table schema
+     * @param predicate Predicate expression
+     * @param resolve Attribute id → base-column name; see {@link ColumnStatsResolver}
+     * @returns Selectivity factor (0.0 to 1.0), or undefined if real statistics cannot answer
+     */
+    statsOnlySelectivity?(table: TableSchema, predicate: ScalarPlanNode, resolve?: ColumnStatsResolver): number | undefined;
     /**
      * Get join selectivity estimate
      * @param leftTable Left table schema
      * @param rightTable Right table schema
      * @param joinCondition Join condition
+     * @param resolve Attribute id → base-column name; see {@link ColumnStatsResolver}
      * @returns Join selectivity factor, or undefined if unknown
      */
-    joinSelectivity?(leftTable: TableSchema, rightTable: TableSchema, joinCondition: ScalarPlanNode): number | undefined;
+    joinSelectivity?(leftTable: TableSchema, rightTable: TableSchema, joinCondition: ScalarPlanNode, resolve?: ColumnStatsResolver): number | undefined;
     /**
      * Get number of distinct values for a column
      * @param table Table schema

package/dist/src/planner/stats/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/planner/stats/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAKzD;;GAEG;AACH,MAAM,WAAW,aAAa;IAC7B;;;;OAIG;IACH,SAAS,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,GAAG,SAAS,CAAC;IAElD;;;;;OAKG;IACH,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,cAAc,GAAG,MAAM,GAAG,SAAS,CAAC;IAE/E;;;;;;OAMG;IACH,eAAe,CAAC,CAAC,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,aAAa,EAAE,cAAc,GAAG,MAAM,GAAG,SAAS,CAAC;IAErH;;;;;OAKG;IACH,cAAc,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC;IAE5E;;;;;;OAMG;IACH,gBAAgB,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,cAAc,GAAG,MAAM,GAAG,SAAS,CAAC;CACxG;AAED;;;GAGG;AACH,qBAAa,kBAAmB,YAAW,aAAa;IAEtD,OAAO,CAAC,QAAQ,CAAC,gBAAgB;IACjC,OAAO,CAAC,QAAQ,CAAC,kBAAkB;gBADlB,gBAAgB,GAAE,MAAa,EAC/B,kBAAkB,GAAE,MAAY;IAMlD,SAAS,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,GAAG,SAAS;IAQjD,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,cAAc,GAAG,MAAM,GAAG,SAAS;IAO9E,eAAe,CAAC,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,EAAE,cAAc,GAAG,MAAM,GAAG,SAAS;IAWpH,cAAc,CAAC,KAAK,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAU1E,gBAAgB,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,cAAc,GAAG,MAAM,GAAG,SAAS;IAQtG,OAAO,CAAC,4BAA4B;CAmBpC;AAED;;GAEG;AACH,eAAO,MAAM,oBAAoB,oBAA2B,CAAC;AAE7D;;GAEG;AACH,wBAAgB,mBAAmB,CAClC,YAAY,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAClC,cAAc,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAClC,aAAa,CAWf"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/planner/stats/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAKzD;;;;;;;GAOG;AACH,MAAM,MAAM,mBAAmB,GAAG,CAAC,WAAW,EAAE,MAAM,KAAK,MAAM,GAAG,SAAS,CAAC;AAE9E;;;;;;;;;GASG;AACH,MAAM,WAAW,aAAa;IAC7B;;;;OAIG;IACH,SAAS,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,GAAG,SAAS,CAAC;IAElD;;;;;;OAMG;IACH,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,cAAc,EAAE,OAAO,CAAC,EAAE,mBAAmB,GAAG,MAAM,GAAG,SAAS,CAAC;IAE9G;;;;;;;;;;;;;;OAcG;IACH,oBAAoB,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,cAAc,EAAE,OAAO,CAAC,EAAE,mBAAmB,GAAG,MAAM,GAAG,SAAS,CAAC;IAExH;;;;;;;OAOG;IACH,eAAe,CAAC,CAAC,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,aAAa,EAAE,cAAc,EAAE,OAAO,CAAC,EAAE,mBAAmB,GAAG,MAAM,GAAG,SAAS,CAAC;IAEpJ;;;;;OAKG;IACH,cAAc,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAAC;IAE5E;;;;;;OAMG;IACH,gBAAgB,CAAC,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,cAAc,GAAG,MAAM,GAAG,SAAS,CAAC;CACxG;AAED;;;GAGG;AACH,qBAAa,kBAAmB,YAAW,aAAa;IAEtD,OAAO,CAAC,QAAQ,CAAC,gBAAgB;IACjC,OAAO,CAAC,QAAQ,CAAC,kBAAkB;gBADlB,gBAAgB,GAAE,MAAa,EAC/B,kBAAkB,GAAE,MAAY;IAMlD,SAAS,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,GAAG,SAAS;IAQjD,WAAW,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,cAAc,GAAG,MAAM,GAAG,SAAS;IAO9E,eAAe,CAAC,SAAS,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,EAAE,cAAc,EAAE,cAAc,GAAG,MAAM,GAAG,SAAS;IAWpH,cAAc,CAAC,KAAK,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS;IAU1E,gBAAgB,CAAC,KAAK,EAAE,WAAW,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,EAAE,cAAc,GAAG,MAAM,GAAG,SAAS;IAQtG,OAAO,CAAC,4BAA4B;CAmBpC;AAED;;GAEG;AACH,eAAO,MAAM,oBAAoB,oBAA2B,CAAC;AAE7D;;GAEG;AACH,wBAAgB,mBAAmB,CAClC,YAAY,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,EAClC,cAAc,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAClC,aAAa,CAWf"}

package/dist/src/planner/stats/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/planner/stats/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAEtD,MAAM,GAAG,GAAG,YAAY,CAAC,iBAAiB,CAAC,CAAC;AAgD5C;;;GAGG;AACH,MAAM,OAAO,kBAAkB;IAEZ;IACA;IAFlB,YACkB,mBAA2B,IAAI,EAC/B,qBAA6B,GAAG;QADhC,qBAAgB,GAAhB,gBAAgB,CAAe;QAC/B,uBAAkB,GAAlB,kBAAkB,CAAc;QAEjD,GAAG,CAAC,wEAAwE,EAC3E,gBAAgB,EAAE,kBAAkB,CAAC,CAAC;IACxC,CAAC;IAED,SAAS,CAAC,KAAkB;QAC3B,iEAAiE;QACjE,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,IAAI,IAAI,CAAC,gBAAgB,CAAC;QAC9D,GAAG,CAAC,0CAA0C,EAC7C,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACnE,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED,WAAW,CAAC,KAAkB,EAAE,SAAyB;QACxD,4CAA4C;QAC5C,MAAM,WAAW,GAAG,IAAI,CAAC,4BAA4B,CAAC,SAAS,CAAC,CAAC;QACjE,GAAG,CAAC,kCAAkC,EAAE,SAAS,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;QACzE,OAAO,WAAW,CAAC;IACpB,CAAC;IAED,eAAe,CAAC,SAAsB,EAAE,UAAuB,EAAE,cAA8B;QAC9F,gDAAgD;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC;QACpE,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC;QAEtE,yDAAyD;QACzD,MAAM,WAAW,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC;QAC5D,GAAG,CAAC,wCAAwC,EAAE,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC5F,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;IACnC,CAAC;IAED,cAAc,CAAC,KAAkB,EAAE,UAAkB;QACpD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,CAAC,SAAS;YAAE,OAAO,SAAS,CAAC;QAEjC,+DAA+D;QAC/D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC;QAC1D,GAAG,CAAC,+BAA+B,EAAE,KAAK,CAAC,IAAI,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;QACvE,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED,gBAAgB,CAAC,KAAkB,EAAE,SAAiB,EAAE,SAAyB;QAChF,wDAAwD;QACxD,MAAM,eAAe,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,kBAAkB,CAAC;QACtF,MAAM,gBAAgB,GAAG,eAAe,GAAG,GAAG,CAAC,CAAC,6BAA6B;QAC7E,GAAG,CAAC,qCAAqC,EAAE,SAAS,EAAE,gBAAgB,EAAE,eAAe,CAAC,CAAC;QACzF,OAAO,gBAAgB,CAAC;IACzB,CAAC;IAEO,4BAA4B,CAAC,SAAyB;QAC7D,uCAAuC;QACvC,QAAQ,SAAS,CAAC,QAAQ,EAAE,CAAC;YAC5B,KAAK,UAAU;gBACd,+CAA+C;gBAC/C,OAAO,GAAG,CAAC,CAAC,2BAA2B;YACxC,KAAK,IAAI;gBACR,OAAO,GAAG,CAAC,CAAC,aAAa;YAC1B,KAAK,SAAS;gBACb,OAAO,IAAI,CAAC,CAAC,gBAAgB;YAC9B,KAAK,MAAM;gBACV,OAAO,GAAG,CAAC,CAAC,mBAAmB;YAChC,KAAK,QAAQ,CAAC;YACd,KAAK,WAAW;gBACf,OAAO,GAAG,CAAC,CAAC,oCAAoC;YACjD;gBACC,OAAO,IAAI,CAAC,kBAAkB,CAAC;QACjC,CAAC;IACF,CAAC;CACD;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,IAAI,kBAAkB,EAAE,CAAC;AAE7D;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAClC,YAAkC,EAClC,cAAoC;IAEpC,OAAO,IAAI;QACV,SAAS,CAAC,KAAkB;YAC3B,OAAO,YAAY,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,oBAAoB,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC/E,CAAC;QAED,WAAW,CAAC,KAAkB,EAAE,SAAyB;YACxD,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,IAAI,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;YAClD,OAAO,cAAc,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,oBAAoB,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QACvF,CAAC;KACD,CAAC;AACH,CAAC"}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/planner/stats/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAEtD,MAAM,GAAG,GAAG,YAAY,CAAC,iBAAiB,CAAC,CAAC;AAoF5C;;;GAGG;AACH,MAAM,OAAO,kBAAkB;IAEZ;IACA;IAFlB,YACkB,mBAA2B,IAAI,EAC/B,qBAA6B,GAAG;QADhC,qBAAgB,GAAhB,gBAAgB,CAAe;QAC/B,uBAAkB,GAAlB,kBAAkB,CAAc;QAEjD,GAAG,CAAC,wEAAwE,EAC3E,gBAAgB,EAAE,kBAAkB,CAAC,CAAC;IACxC,CAAC;IAED,SAAS,CAAC,KAAkB;QAC3B,iEAAiE;QACjE,MAAM,QAAQ,GAAG,KAAK,CAAC,aAAa,IAAI,IAAI,CAAC,gBAAgB,CAAC;QAC9D,GAAG,CAAC,0CAA0C,EAC7C,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QACnE,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED,WAAW,CAAC,KAAkB,EAAE,SAAyB;QACxD,4CAA4C;QAC5C,MAAM,WAAW,GAAG,IAAI,CAAC,4BAA4B,CAAC,SAAS,CAAC,CAAC;QACjE,GAAG,CAAC,kCAAkC,EAAE,SAAS,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;QACzE,OAAO,WAAW,CAAC;IACpB,CAAC;IAED,eAAe,CAAC,SAAsB,EAAE,UAAuB,EAAE,cAA8B;QAC9F,gDAAgD;QAChD,MAAM,QAAQ,GAAG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC;QACpE,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,gBAAgB,CAAC;QAEtE,yDAAyD;QACzD,MAAM,WAAW,GAAG,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC;QAC5D,GAAG,CAAC,wCAAwC,EAAE,SAAS,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC;QAC5F,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,WAAW,CAAC,CAAC;IACnC,CAAC;IAED,cAAc,CAAC,KAAkB,EAAE,UAAkB;QACpD,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,CAAC,SAAS;YAAE,OAAO,SAAS,CAAC;QAEjC,+DAA+D;QAC/D,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,SAAS,GAAG,GAAG,CAAC,CAAC,CAAC;QAC1D,GAAG,CAAC,+BAA+B,EAAE,KAAK,CAAC,IAAI,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC;QACvE,OAAO,QAAQ,CAAC;IACjB,CAAC;IAED,gBAAgB,CAAC,KAAkB,EAAE,SAAiB,EAAE,SAAyB;QAChF,wDAAwD;QACxD,MAAM,eAAe,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,IAAI,IAAI,CAAC,kBAAkB,CAAC;QACtF,MAAM,gBAAgB,GAAG,eAAe,GAAG,GAAG,CAAC,CAAC,6BAA6B;QAC7E,GAAG,CAAC,qCAAqC,EAAE,SAAS,EAAE,gBAAgB,EAAE,eAAe,CAAC,CAAC;QACzF,OAAO,gBAAgB,CAAC;IACzB,CAAC;IAEO,4BAA4B,CAAC,SAAyB;QAC7D,uCAAuC;QACvC,QAAQ,SAAS,CAAC,QAAQ,EAAE,CAAC;YAC5B,KAAK,UAAU;gBACd,+CAA+C;gBAC/C,OAAO,GAAG,CAAC,CAAC,2BAA2B;YACxC,KAAK,IAAI;gBACR,OAAO,GAAG,CAAC,CAAC,aAAa;YAC1B,KAAK,SAAS;gBACb,OAAO,IAAI,CAAC,CAAC,gBAAgB;YAC9B,KAAK,MAAM;gBACV,OAAO,GAAG,CAAC,CAAC,mBAAmB;YAChC,KAAK,QAAQ,CAAC;YACd,KAAK,WAAW;gBACf,OAAO,GAAG,CAAC,CAAC,oCAAoC;YACjD;gBACC,OAAO,IAAI,CAAC,kBAAkB,CAAC;QACjC,CAAC;IACF,CAAC;CACD;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,IAAI,kBAAkB,EAAE,CAAC;AAE7D;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAClC,YAAkC,EAClC,cAAoC;IAEpC,OAAO,IAAI;QACV,SAAS,CAAC,KAAkB;YAC3B,OAAO,YAAY,EAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,oBAAoB,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC/E,CAAC;QAED,WAAW,CAAC,KAAkB,EAAE,SAAyB;YACxD,MAAM,GAAG,GAAG,GAAG,KAAK,CAAC,IAAI,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;YAClD,OAAO,cAAc,EAAE,GAAG,CAAC,GAAG,CAAC,IAAI,oBAAoB,CAAC,WAAW,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;QACvF,CAAC;KACD,CAAC;AACH,CAAC"}

package/dist/src/planner/stats/selectivity-combine.d.ts

@@ -0,0 +1,53 @@
+/**
+ * Selectivity combinators.
+ *
+ * Pure numeric helpers that fold a list of per-conjunct / per-disjunct
+ * selectivities into a single factor. No plan-node knowledge lives here — the
+ * caller ({@link CatalogStatsProvider}) walks the boolean structure and hands
+ * these functions plain numbers.
+ *
+ * ## Why exponential backoff rather than plain independence
+ *
+ * The textbook conjunction model assumes independent predicates and multiplies:
+ * `Πsᵢ`. That collapses fast — five conditions at 0.1 each give 1e-5, i.e. "no
+ * rows" for any realistic table. Real-world predicates are correlated far more
+ * often than not (`city = 'Seattle' and state = 'WA'`), so the plain product
+ * systematically *under*-estimates surviving rows and pushes the optimizer into
+ * pathological plans (nested loops over what is actually a large intermediate).
+ *
+ * Instead we sort ascending (most selective first) and damp each subsequent
+ * factor by taking successive square roots:
+ *
+ * ```
+ * s₁ · s₂^(1/2) · s₃^(1/4) · s₄^(1/8)
+ * ```
+ *
+ * This is the model SQL Server has used by default since 2014. It needs no
+ * correlation statistics, degrades gracefully as conjunct count grows, and is
+ * identical to plain independence for a single conjunct. Conjuncts past
+ * {@link BACKOFF_CONJUNCT_LIMIT} are dropped rather than multiplied in: they are
+ * the *least* selective ones, so their damped exponent would contribute almost
+ * nothing anyway.
+ *
+ * Disjunction uses straight independence (`1 - Π(1 - sᵢ)`), which errs toward
+ * over-estimating rows — the safe direction for plan choice.
+ */
+/** How many conjuncts participate in the damped product; the rest are dropped. */
+export declare const BACKOFF_CONJUNCT_LIMIT = 4;
+/**
+ * Combine AND-ed selectivities using exponential backoff (see file doc-comment).
+ *
+ * Inputs and result are clamped to [0, 1]; input order does not matter. An empty
+ * list is not expected — callers gate on a non-empty list — and returns 1 (the
+ * conjunctive identity: no reduction claimed).
+ */
+export declare function combineConjunctive(selectivities: readonly number[]): number;
+/**
+ * Combine OR-ed selectivities assuming independence: `1 - Π(1 - sᵢ)`.
+ *
+ * Inputs and result are clamped to [0, 1]. An empty list is not expected —
+ * callers gate on a non-empty list — and returns 0 (the disjunctive identity:
+ * nothing survives).
+ */
+export declare function combineDisjunctive(selectivities: readonly number[]): number;
+//# sourceMappingURL=selectivity-combine.d.ts.map

package/dist/src/planner/stats/selectivity-combine.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"selectivity-combine.d.ts","sourceRoot":"","sources":["../../../../src/planner/stats/selectivity-combine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH,kFAAkF;AAClF,eAAO,MAAM,sBAAsB,IAAI,CAAC;AAOxC;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,aAAa,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAW3E;AAED;;;;;;GAMG;AACH,wBAAgB,kBAAkB,CAAC,aAAa,EAAE,SAAS,MAAM,EAAE,GAAG,MAAM,CAQ3E"}

package/dist/src/planner/stats/selectivity-combine.js

@@ -0,0 +1,75 @@
+/**
+ * Selectivity combinators.
+ *
+ * Pure numeric helpers that fold a list of per-conjunct / per-disjunct
+ * selectivities into a single factor. No plan-node knowledge lives here — the
+ * caller ({@link CatalogStatsProvider}) walks the boolean structure and hands
+ * these functions plain numbers.
+ *
+ * ## Why exponential backoff rather than plain independence
+ *
+ * The textbook conjunction model assumes independent predicates and multiplies:
+ * `Πsᵢ`. That collapses fast — five conditions at 0.1 each give 1e-5, i.e. "no
+ * rows" for any realistic table. Real-world predicates are correlated far more
+ * often than not (`city = 'Seattle' and state = 'WA'`), so the plain product
+ * systematically *under*-estimates surviving rows and pushes the optimizer into
+ * pathological plans (nested loops over what is actually a large intermediate).
+ *
+ * Instead we sort ascending (most selective first) and damp each subsequent
+ * factor by taking successive square roots:
+ *
+ * ```
+ * s₁ · s₂^(1/2) · s₃^(1/4) · s₄^(1/8)
+ * ```
+ *
+ * This is the model SQL Server has used by default since 2014. It needs no
+ * correlation statistics, degrades gracefully as conjunct count grows, and is
+ * identical to plain independence for a single conjunct. Conjuncts past
+ * {@link BACKOFF_CONJUNCT_LIMIT} are dropped rather than multiplied in: they are
+ * the *least* selective ones, so their damped exponent would contribute almost
+ * nothing anyway.
+ *
+ * Disjunction uses straight independence (`1 - Π(1 - sᵢ)`), which errs toward
+ * over-estimating rows — the safe direction for plan choice.
+ */
+/** How many conjuncts participate in the damped product; the rest are dropped. */
+export const BACKOFF_CONJUNCT_LIMIT = 4;
+/** Clamp a selectivity into the valid [0, 1] range. */
+function clamp(selectivity) {
+    return Math.min(1, Math.max(0, selectivity));
+}
+/**
+ * Combine AND-ed selectivities using exponential backoff (see file doc-comment).
+ *
+ * Inputs and result are clamped to [0, 1]; input order does not matter. An empty
+ * list is not expected — callers gate on a non-empty list — and returns 1 (the
+ * conjunctive identity: no reduction claimed).
+ */
+export function combineConjunctive(selectivities) {
+    if (selectivities.length === 0)
+        return 1;
+    const sorted = selectivities.map(clamp).sort((a, b) => a - b);
+    const participating = sorted.slice(0, BACKOFF_CONJUNCT_LIMIT);
+    let result = 1;
+    for (let i = 0; i < participating.length; i++) {
+        result *= Math.pow(participating[i], 1 / Math.pow(2, i));
+    }
+    return clamp(result);
+}
+/**
+ * Combine OR-ed selectivities assuming independence: `1 - Π(1 - sᵢ)`.
+ *
+ * Inputs and result are clamped to [0, 1]. An empty list is not expected —
+ * callers gate on a non-empty list — and returns 0 (the disjunctive identity:
+ * nothing survives).
+ */
+export function combineDisjunctive(selectivities) {
+    if (selectivities.length === 0)
+        return 0;
+    let complement = 1;
+    for (const s of selectivities) {
+        complement *= 1 - clamp(s);
+    }
+    return clamp(1 - complement);
+}
+//# sourceMappingURL=selectivity-combine.js.map

package/dist/src/planner/stats/selectivity-combine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"selectivity-combine.js","sourceRoot":"","sources":["../../../../src/planner/stats/selectivity-combine.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH,kFAAkF;AAClF,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,CAAC;AAExC,uDAAuD;AACvD,SAAS,KAAK,CAAC,WAAmB;IACjC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC,CAAC;AAC9C,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,aAAgC;IAClE,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEzC,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9D,MAAM,aAAa,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,sBAAsB,CAAC,CAAC;IAE9D,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/C,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1D,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC;AACtB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,kBAAkB,CAAC,aAAgC;IAClE,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEzC,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;QAC/B,UAAU,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5B,CAAC;IACD,OAAO,KAAK,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC;AAC9B,CAAC"}

package/dist/src/planner/stats/table-cardinality.d.ts

@@ -0,0 +1,28 @@
+/**
+ * Shared base-table row-count helper.
+ *
+ * Statistics-first: prefer the `ANALYZE`-collected `rowCount` over the static
+ * `TableSchema.estimatedRows` field (which `SchemaManager` hardcodes to 0 at
+ * CREATE TABLE and never updates). `undefined` means "nobody knows" and must
+ * stay `undefined` — callers apply their own fallback (e.g. NaiveStatsProvider's
+ * default of 1000); folding that default in here would change every
+ * un-analyzed table's cardinality.
+ *
+ * `TableReferenceNode.estimatedRows` and `CatalogStatsProvider.tableRows` both
+ * call this so the logical/physical estimate and the stats-provider estimate
+ * cannot drift apart.
+ *
+ * NOTE: `rowCount` is a snapshot from the last `ANALYZE` — rows written
+ * afterwards are invisible until the next one.
+ *
+ * NOTE: a real 0 (analyzed, empty table) is distinct from `undefined`, but the
+ * `estimatedRows || default` spellings in `rule-select-access-path`,
+ * `rule-grow-retrieve` and `IndexSeekNode.computePhysical` collapse the two and
+ * substitute their default — so an analyzed empty table reaches
+ * `getBestAccessPlan` as "unknown" (1000) while a SeqScan over it reports 0.
+ * Harmless today (any plan over 0 rows is cheap); switch those to `??` if an
+ * empty-table plan ever costs out wrong.
+ */
+import type { TableSchema } from '../../schema/table.js';
+export declare function catalogRowCount(table: TableSchema): number | undefined;
+//# sourceMappingURL=table-cardinality.d.ts.map

package/dist/src/planner/stats/table-cardinality.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"table-cardinality.d.ts","sourceRoot":"","sources":["../../../../src/planner/stats/table-cardinality.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAEzD,wBAAgB,eAAe,CAAC,KAAK,EAAE,WAAW,GAAG,MAAM,GAAG,SAAS,CAEtE"}

package/dist/src/planner/stats/table-cardinality.js

@@ -0,0 +1,29 @@
+/**
+ * Shared base-table row-count helper.
+ *
+ * Statistics-first: prefer the `ANALYZE`-collected `rowCount` over the static
+ * `TableSchema.estimatedRows` field (which `SchemaManager` hardcodes to 0 at
+ * CREATE TABLE and never updates). `undefined` means "nobody knows" and must
+ * stay `undefined` — callers apply their own fallback (e.g. NaiveStatsProvider's
+ * default of 1000); folding that default in here would change every
+ * un-analyzed table's cardinality.
+ *
+ * `TableReferenceNode.estimatedRows` and `CatalogStatsProvider.tableRows` both
+ * call this so the logical/physical estimate and the stats-provider estimate
+ * cannot drift apart.
+ *
+ * NOTE: `rowCount` is a snapshot from the last `ANALYZE` — rows written
+ * afterwards are invisible until the next one.
+ *
+ * NOTE: a real 0 (analyzed, empty table) is distinct from `undefined`, but the
+ * `estimatedRows || default` spellings in `rule-select-access-path`,
+ * `rule-grow-retrieve` and `IndexSeekNode.computePhysical` collapse the two and
+ * substitute their default — so an analyzed empty table reaches
+ * `getBestAccessPlan` as "unknown" (1000) while a SeqScan over it reports 0.
+ * Harmless today (any plan over 0 rows is cheap); switch those to `??` if an
+ * empty-table plan ever costs out wrong.
+ */
+export function catalogRowCount(table) {
+    return table.statistics?.rowCount ?? table.estimatedRows;
+}
+//# sourceMappingURL=table-cardinality.js.map

package/dist/src/planner/stats/table-cardinality.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"table-cardinality.js","sourceRoot":"","sources":["../../../../src/planner/stats/table-cardinality.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAIH,MAAM,UAAU,eAAe,CAAC,KAAkB;IACjD,OAAO,KAAK,CAAC,UAAU,EAAE,QAAQ,IAAI,KAAK,CAAC,aAAa,CAAC;AAC1D,CAAC"}

package/dist/src/planner/util/column-origins.d.ts

@@ -0,0 +1,79 @@
+/**
+ * Column origin attribution.
+ *
+ * Maps every output attribute id reachable under a relational subtree back to the
+ * base-table column that minted it. `rule-filter-selectivity` uses this to route
+ * each conjunct of a filter-over-join predicate to the statistics of the table its
+ * columns actually come from, instead of declining the whole filter because its
+ * source spans more than one table.
+ *
+ * ## Identity — not schema — distinguishes the two sides of a self-join
+ *
+ * `ColumnOrigin.relation` is an opaque token standing for ONE instance of a relation
+ * in the plan. `from t a join t b` yields two distinct TableReferenceNodes sharing
+ * ONE `TableSchema` object, so a caller asking "how many relations does this
+ * expression touch?" must key on `relation` identity. Keying on `table` collapses the
+ * two sides and mis-classifies `a.age > b.age` as a single-table predicate
+ * comparing a column to a constant.
+ *
+ * ## Attributes minted above a base table are deliberately absent
+ *
+ * Computed projections, aggregate outputs, `values` rows and join existence flags
+ * never appear in the map. A predicate over one of them has no base-table column
+ * statistics to consult, so the caller must treat it as unknown rather than
+ * mis-attribute it by column name.
+ *
+ * ## Row-merging operators are opaque
+ *
+ * A set operation and a recursive CTE both *forward* their left / base-case branch's
+ * attribute ids (see `analysis/attribute-provenance.ts`), but the rows behind those
+ * ids come from every branch. `union all` of a 4-distinct-value column with a
+ * 1000-distinct-value one publishes the left branch's id while carrying both
+ * distributions, so attributing it to the left base table alone would hand the
+ * caller one branch's statistics as if they described the whole relation. The walk
+ * therefore stops at such a node and records nothing beneath it — a conjunct over a
+ * union reads as unknown, exactly like one over a computed projection.
+ *
+ * `rule-async-gather-union-all` rewrites a unionAll set operation into an
+ * `AsyncGatherNode` that forwards the same ids, so `isRowMerging` recognises that
+ * gather too — see `row-population.ts`.
+ *
+ * ## A CTE reference republishes its body's columns under its own relation instance
+ *
+ * `CTEReferenceNode` mints FRESH attribute ids for every column it republishes
+ * (`cte-reference-node.ts`), so the walk cannot simply descend through it: nothing
+ * above would land in the map. It instead maps the body's origins positionally onto
+ * the reference's own ids — but under a relation token minted PER REFERENCE, because
+ * two references to one `with` clause share a single body subtree. Pairing them with
+ * the body's own relation tokens would make both arms of a CTE self-join the same
+ * relation, and `rule-filter-selectivity` would read `a.qty > b.qty` as a
+ * single-relation predicate comparing a column to a constant.
+ */
+import type { RelationalPlanNode } from '../nodes/plan-node.js';
+import type { TableSchema } from '../../schema/table.js';
+/**
+ * Identity of one *instance* of a relation in the plan — compared by reference and
+ * never dereferenced. A `TableReferenceNode` is its own instance; a CTE reference
+ * mints one per (reference, underlying relation) pair so that two references to the
+ * same `with` clause stay distinguishable.
+ */
+export type RelationInstance = object;
+/** Where a single attribute came from: a column of a specific relation instance. */
+export interface ColumnOrigin {
+    /** The relation instance that published this attribute — identity is significant. */
+    readonly relation: RelationInstance;
+    readonly table: TableSchema;
+    readonly columnIndex: number;
+    readonly columnName: string;
+}
+/**
+ * Attribute id → originating base-table column, for every base column reachable
+ * under `node` via `getRelations()`.
+ *
+ * The walk descends relations only, so scalar subqueries hanging off a join
+ * condition or a filter predicate are NOT traversed — their columns stay out of
+ * the map and any conjunct referencing them reads as unknown. It also stops at a
+ * row-merging operator and at a CTE reference (see the file doc-comment).
+ */
+export declare function collectColumnOrigins(node: RelationalPlanNode): Map<number, ColumnOrigin>;
+//# sourceMappingURL=column-origins.d.ts.map

package/dist/src/planner/util/column-origins.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"column-origins.d.ts","sourceRoot":"","sources":["../../../../src/planner/util/column-origins.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkDG;AAKH,OAAO,KAAK,EAAY,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAC1E,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AAEzD;;;;;GAKG;AACH,MAAM,MAAM,gBAAgB,GAAG,MAAM,CAAC;AAEtC,oFAAoF;AACpF,MAAM,WAAW,YAAY;IAC5B,qFAAqF;IACrF,QAAQ,CAAC,QAAQ,EAAE,gBAAgB,CAAC;IACpC,QAAQ,CAAC,KAAK,EAAE,WAAW,CAAC;IAC5B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,UAAU,EAAE,MAAM,CAAC;CAC5B;AAKD;;;;;;;;GAQG;AACH,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,kBAAkB,GAAG,GAAG,CAAC,MAAM,EAAE,YAAY,CAAC,CAExF"}

package/dist/src/planner/util/column-origins.js

@@ -0,0 +1,150 @@
+/**
+ * Column origin attribution.
+ *
+ * Maps every output attribute id reachable under a relational subtree back to the
+ * base-table column that minted it. `rule-filter-selectivity` uses this to route
+ * each conjunct of a filter-over-join predicate to the statistics of the table its
+ * columns actually come from, instead of declining the whole filter because its
+ * source spans more than one table.
+ *
+ * ## Identity — not schema — distinguishes the two sides of a self-join
+ *
+ * `ColumnOrigin.relation` is an opaque token standing for ONE instance of a relation
+ * in the plan. `from t a join t b` yields two distinct TableReferenceNodes sharing
+ * ONE `TableSchema` object, so a caller asking "how many relations does this
+ * expression touch?" must key on `relation` identity. Keying on `table` collapses the
+ * two sides and mis-classifies `a.age > b.age` as a single-table predicate
+ * comparing a column to a constant.
+ *
+ * ## Attributes minted above a base table are deliberately absent
+ *
+ * Computed projections, aggregate outputs, `values` rows and join existence flags
+ * never appear in the map. A predicate over one of them has no base-table column
+ * statistics to consult, so the caller must treat it as unknown rather than
+ * mis-attribute it by column name.
+ *
+ * ## Row-merging operators are opaque
+ *
+ * A set operation and a recursive CTE both *forward* their left / base-case branch's
+ * attribute ids (see `analysis/attribute-provenance.ts`), but the rows behind those
+ * ids come from every branch. `union all` of a 4-distinct-value column with a
+ * 1000-distinct-value one publishes the left branch's id while carrying both
+ * distributions, so attributing it to the left base table alone would hand the
+ * caller one branch's statistics as if they described the whole relation. The walk
+ * therefore stops at such a node and records nothing beneath it — a conjunct over a
+ * union reads as unknown, exactly like one over a computed projection.
+ *
+ * `rule-async-gather-union-all` rewrites a unionAll set operation into an
+ * `AsyncGatherNode` that forwards the same ids, so `isRowMerging` recognises that
+ * gather too — see `row-population.ts`.
+ *
+ * ## A CTE reference republishes its body's columns under its own relation instance
+ *
+ * `CTEReferenceNode` mints FRESH attribute ids for every column it republishes
+ * (`cte-reference-node.ts`), so the walk cannot simply descend through it: nothing
+ * above would land in the map. It instead maps the body's origins positionally onto
+ * the reference's own ids — but under a relation token minted PER REFERENCE, because
+ * two references to one `with` clause share a single body subtree. Pairing them with
+ * the body's own relation tokens would make both arms of a CTE self-join the same
+ * relation, and `rule-filter-selectivity` would read `a.qty > b.qty` as a
+ * single-relation predicate comparing a column to a constant.
+ */
+import { TableReferenceNode } from '../nodes/reference.js';
+import { CTEReferenceNode } from '../nodes/cte-reference-node.js';
+import { isRowMerging } from './row-population.js';
+/**
+ * Attribute id → originating base-table column, for every base column reachable
+ * under `node` via `getRelations()`.
+ *
+ * The walk descends relations only, so scalar subqueries hanging off a join
+ * condition or a filter predicate are NOT traversed — their columns stay out of
+ * the map and any conjunct referencing them reads as unknown. It also stops at a
+ * row-merging operator and at a CTE reference (see the file doc-comment).
+ */
+export function collectColumnOrigins(node) {
+    return collect(node, new Map());
+}
+function collect(node, bodies) {
+    const origins = new Map();
+    // Plan trees are DAGs (a CTE instance can be shared), so dedupe by identity.
+    const visited = new Set();
+    const stack = [node];
+    while (stack.length > 0) {
+        const n = stack.pop();
+        if (visited.has(n))
+            continue;
+        visited.add(n);
+        if (n instanceof TableReferenceNode) {
+            addBaseColumns(n, origins);
+            continue;
+        }
+        if (n instanceof CTEReferenceNode) {
+            // Deliberately NOT descended: the body publishes ids this node does not
+            // expose, and the body may be shared with a sibling reference.
+            addCTEColumns(n, origins, bodies);
+            continue;
+        }
+        if (isRowMerging(n))
+            continue;
+        for (const rel of n.getRelations())
+            stack.push(rel);
+    }
+    return origins;
+}
+/** Zip a table reference's attributes with its schema columns (1:1 by construction). */
+function addBaseColumns(ref, out) {
+    // TableReferenceNode builds its attributes by mapping `tableSchema.columns`
+    // positionally (see reference.ts), so index i describes the same column in both
+    // lists — the same zip `computePhysical` uses to seed update lineage.
+    const attrs = ref.getAttributes();
+    ref.tableSchema.columns.forEach((col, i) => {
+        const attr = attrs[i];
+        if (!attr)
+            return;
+        out.set(attr.id, { relation: ref, table: ref.tableSchema, columnIndex: i, columnName: col.name });
+    });
+}
+/**
+ * Re-publish a CTE body's origins under this reference's own attribute ids and its
+ * own relation instances.
+ *
+ * `CTEReferenceNode.buildAttributes` maps `CTENode.getAttributes()` one for one and
+ * `CTENode` forwards its source's attribute ids verbatim, so index i names the same
+ * column on both sides. Columns the body computed (or could not attribute) simply
+ * have no entry, exactly as for the equivalent inline subquery.
+ */
+function addCTEColumns(ref, out, bodies) {
+    const body = ref.source;
+    // A recursive CTE's rows come from its base case AND its recursive case, so no
+    // base-table column describes them — same reasoning as a set operation.
+    if (isRowMerging(body))
+        return;
+    const bodyOrigins = bodyOriginsOf(body, bodies);
+    if (bodyOrigins.size === 0)
+        return;
+    // One fresh instance per underlying relation, minted for THIS reference: two
+    // references to one CTE must never share an instance.
+    const instances = new Map();
+    const bodyAttrs = body.getAttributes();
+    ref.getAttributes().forEach((attr, i) => {
+        const bodyAttr = bodyAttrs[i];
+        const origin = bodyAttr && bodyOrigins.get(bodyAttr.id);
+        if (!origin)
+            return;
+        let instance = instances.get(origin.relation);
+        if (!instance) {
+            instance = {};
+            instances.set(origin.relation, instance);
+        }
+        out.set(attr.id, { ...origin, relation: instance });
+    });
+}
+function bodyOriginsOf(body, bodies) {
+    const cached = bodies.get(body);
+    if (cached)
+        return cached;
+    const computed = collect(body, bodies);
+    bodies.set(body, computed);
+    return computed;
+}
+//# sourceMappingURL=column-origins.js.map

package/dist/src/planner/util/column-origins.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"column-origins.js","sourceRoot":"","sources":["../../../../src/planner/util/column-origins.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAkDG;AAEH,OAAO,EAAE,kBAAkB,EAAE,MAAM,uBAAuB,CAAC;AAC3D,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAwBnD;;;;;;;;GAQG;AACH,MAAM,UAAU,oBAAoB,CAAC,IAAwB;IAC5D,OAAO,OAAO,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;AACjC,CAAC;AAED,SAAS,OAAO,CAAC,IAAwB,EAAE,MAAuB;IACjE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwB,CAAC;IAChD,6EAA6E;IAC7E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAY,CAAC;IACpC,MAAM,KAAK,GAAyB,CAAC,IAAI,CAAC,CAAC;IAE3C,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACvB,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,SAAS;QAC7B,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEf,IAAI,CAAC,YAAY,kBAAkB,EAAE,CAAC;YACrC,cAAc,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC3B,SAAS;QACV,CAAC;QACD,IAAI,CAAC,YAAY,gBAAgB,EAAE,CAAC;YACnC,wEAAwE;YACxE,+DAA+D;YAC/D,aAAa,CAAC,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;YAClC,SAAS;QACV,CAAC;QACD,IAAI,YAAY,CAAC,CAAC,CAAC;YAAE,SAAS;QAC9B,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,YAAY,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrD,CAAC;IAED,OAAO,OAAO,CAAC;AAChB,CAAC;AAED,wFAAwF;AACxF,SAAS,cAAc,CAAC,GAAuB,EAAE,GAA8B;IAC9E,4EAA4E;IAC5E,gFAAgF;IAChF,sEAAsE;IACtE,MAAM,KAAK,GAAG,GAAG,CAAC,aAAa,EAAE,CAAC;IAClC,GAAG,CAAC,WAAW,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,CAAC,WAAW,EAAE,WAAW,EAAE,CAAC,EAAE,UAAU,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IACnG,CAAC,CAAC,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,aAAa,CAAC,GAAqB,EAAE,GAA8B,EAAE,MAAuB;IACpG,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC;IACxB,+EAA+E;IAC/E,wEAAwE;IACxE,IAAI,YAAY,CAAC,IAAI,CAAC;QAAE,OAAO;IAE/B,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAChD,IAAI,WAAW,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO;IAEnC,6EAA6E;IAC7E,sDAAsD;IACtD,MAAM,SAAS,GAAG,IAAI,GAAG,EAAsC,CAAC;IAChE,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC;IACvC,GAAG,CAAC,aAAa,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QACvC,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,MAAM,GAAG,QAAQ,IAAI,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QACxD,IAAI,CAAC,MAAM;YAAE,OAAO;QACpB,IAAI,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC9C,IAAI,CAAC,QAAQ,EAAE,CAAC;YACf,QAAQ,GAAG,EAAE,CAAC;YACd,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC1C,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,MAAM,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,IAAwB,EAAE,MAAuB;IACvE,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAChC,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC;IAC1B,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACvC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC3B,OAAO,QAAQ,CAAC;AACjB,CAAC"}

package/dist/src/planner/util/fd-utils.d.ts

@@ -328,18 +328,42 @@ export interface EqualityFds {
  *
  * Non-equality conjuncts contribute nothing.
  *
- * **Collation gate.** Every extracted fact is a VALUE-level claim (a pinned
- * column has one value across rows; `col1 = col2` rows are value-equal), so a
- * conjunct only contributes when its comparison is value-discriminating
- * (`isValueDiscriminatingEquality`): for textual operands the effective
- * comparison collation must be BINARY. A NOCASE/RTRIM comparison — via a
- * `COLLATE` wrapper on either side or a non-BINARY declared column collation —
- * passes value-DIFFERENT rows ('Bob' = 'bob' NOCASE), so its facts would
- * over-claim (false ≤1-row keys, false EC-driven inferences, wrong insert
+ * **Collation gate (all shapes).** Every extracted fact is a VALUE-level claim
+ * (a pinned column has one value across rows; `col1 = col2` rows are
+ * value-equal), so a conjunct only contributes when its comparison is
+ * value-discriminating (`isValueDiscriminatingEquality`): for textual operands
+ * the effective comparison collation must be BINARY. A NOCASE/RTRIM comparison —
+ * via a `COLLATE` wrapper on either side or a non-BINARY declared column
+ * collation — passes value-DIFFERENT rows ('Bob' = 'bob' NOCASE), so its facts
+ * would over-claim (false ≤1-row keys, false EC-driven inferences, wrong insert
  * defaults — ticket `collation-blind-equality-fact-extraction`). Declared-
  * collation covered-key ≤1-row detection is NOT lost: it flows through the
  * independent (and collation-sound) `extractConstraints` path in
  * `FilterNode.computePhysical`.
+ *
+ * **Semantic-ordering gate (`col1 = col2` ONLY).** A few logical types compare
+ * by meaning rather than by stored text (`timespan`: 'PT1H' = 'PT60M'; `json`:
+ * '{"a":1}' = '{ "a" : 1 }'). For a MIXED pair — `d timespan = s text` — the
+ * mirror FDs and the equivalence class are both FALSE: two surviving rows can
+ * agree on `d` (same elapsed time) while disagreeing on `s` (distinct strings),
+ * because the two columns have no common notion of "same value". So the col=col
+ * arm additionally requires `semanticOrderingsAgree` on the two declared logical
+ * types, mirroring the two join-side extractors that mint the same kind of fact
+ * (`extractEquiPairsFromCondition` in `nodes/join-node.ts`, `extractEquiPairs`
+ * in `rules/join/equi-pair-extractor.ts`). Same-type pairs (`timespan =
+ * timespan`) stay admitted — under the type's own identity both facts hold.
+ * Invariant OPT-051; ticket `debt-filter-equality-facts-ignore-semantic-ordering`.
+ *
+ * **The constant-pin arms are deliberately NOT semantic-ordering-gated.** This is
+ * intentional, not an oversight. `where d = 'PT60M'` keeps every row whose `d` is
+ * one hour whatever text it stores, and under the engine's identity for a
+ * `timespan` column — the same identity `distinct`/`group by`/`unique` use —
+ * those rows all hold *the same value*, so `∅ → d` is true. The
+ * `ConstantBinding` claim is likewise true as defined (see its declaration in
+ * `nodes/plan-node.ts`): the column *compares equal to* the bound value under its
+ * own comparison. Gating this arm would decline EVERY constant pin on a
+ * `timespan`/`json` column (a literal never declares a semantic-ordering type),
+ * losing real optimizations to "fix" a claim that is not wrong.
  */
 export declare function extractEqualityFds(predicate: ScalarPlanNode, attrIdToIndex: ReadonlyMap<number, number>): EqualityFds;
 /**

package/dist/src/planner/util/fd-utils.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"fd-utils.d.ts","sourceRoot":"","sources":["../../../../src/planner/util/fd-utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,KAAK,EAAE,eAAe,EAAE,aAAa,EAAE,gBAAgB,EAAE,oBAAoB,EAAe,cAAc,EAAE,mBAAmB,EAAE,SAAS,EAAE,kBAAkB,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACrN,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAW7D;;;;GAIG;AACH,eAAO,MAAM,gBAAgB,KAAK,CAAC;AAEnC;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAC7B,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,EAC1B,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GACtC,GAAG,CAAC,MAAM,CAAC,CAkBb;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAC7B,GAAG,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,EACzC,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GACtC,oBAAoB,EAAE,CAYxB;AAED,2EAA2E;AAC3E,wBAAgB,UAAU,CACzB,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,EAC1B,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,EAC3B,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GACtC,OAAO,CAOT;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAC3B,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,EAC1B,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GACtC,GAAG,CAAC,MAAM,CAAC,CAgBb;AAuGD,MAAM,WAAW,YAAY;IAC5B;;;;OAIG;IACH,QAAQ,CAAC,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;IAChD,GAAG,CAAC,EAAE,MAAM,CAAC;CACb;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,KAAK,CACpB,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,EACxC,IAAI,EAAE,oBAAoB,EAC1B,IAAI,GAAE,YAAiB,GACrB,oBAAoB,EAAE,CAwCxB;AAuCD,4DAA4D;AAC5D,wBAAgB,QAAQ,CACvB,CAAC,EAAE,aAAa,CAAC,oBAAoB,CAAC,EACtC,CAAC,EAAE,aAAa,CAAC,oBAAoB,CAAC,EACtC,IAAI,GAAE,YAAiB,GACrB,oBAAoB,EAAE,CAMxB;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,UAAU,CACzB,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,EACxC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAClC,oBAAoB,EAAE,CA+BxB;AAuDD;;;;;GAKG;AACH,wBAAgB,QAAQ,CACvB,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,EACxC,MAAM,EAAE,MAAM,GACZ,oBAAoB,EAAE,CAaxB;AAqBD;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,oBAAoB,GAAG,oBAAoB,CAIzE;AAED,yDAAyD;AACzD,wBAAgB,iBAAiB,CAChC,OAAO,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,EAC7C,MAAM,EAAE,MAAM,GACZ,MAAM,EAAE,EAAE,CAGZ;AAQD;;;GAGG;AACH,wBAAgB,iBAAiB,CAChC,CAAC,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,EACvC,CAAC,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,GACrC,MAAM,EAAE,EAAE,CA2BZ;AAED,4DAA4D;AAC5D,wBAAgB,cAAc,CAC7B,OAAO,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,EAC7C,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,GACP,MAAM,EAAE,EAAE,CAGZ;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,YAAY,CAC3B,GAAG,EAAE,SAAS,MAAM,EAAE,EACtB,WAAW,EAAE,MAAM,GACjB,oBAAoB,GAAG,SAAS,CAQlC;AAED;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC/B,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,EAC1B,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GAAG,SAAS,EACpD,WAAW,EAAE,MAAM,GACjB,OAAO,CAOT;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,mBAAmB,CAClC,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,EAC1B,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GAAG,SAAS,EACpD,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,OAAO,GACZ,OAAO,CAYT;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,iBAAiB,CAChC,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GAAG,SAAS,EACpD,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,OAAO,GACZ,MAAM,EAAE,EAAE,CAiBZ;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CACxB,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GAAG,SAAS,EACpD,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,OAAO,GACZ,OAAO,CAOT;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,cAAc,CAC7B,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GAAG,SAAS,EACpD,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,OAAO,GACZ,OAAO,CAGT;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,WAAW,EAAE,MAAM,GAAG,oBAAoB,GAAG,SAAS,CAKjF;AAED;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC7B,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,EACxC,WAAW,EAAE,MAAM,GACjB,oBAAoB,EAAE,CAGxB;AAYD;;;;GAIG;AACH,MAAM,WAAW,MAAM;IACtB,OAAO,IAAI,YAAY,CAAC;IACxB,QAAQ,CAAC,EAAE,kBAAkB,CAAC;CAC9B;AAyCD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,wBAAgB,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,CAiClE;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAUtE;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAEnD;AAED;;;;GAIG;AACH,YAAY,EAAE,eAAe,EAAE,aAAa,EAAE,CAAC;AAE/C;;;;;;;;;GASG;AACH,MAAM,WAAW,WAAW;IAC3B,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,CAAC;IAClD,QAAQ,CAAC,UAAU,EAAE,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC9D,QAAQ,CAAC,gBAAgB,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC;CAC1D;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,wBAAgB,kBAAkB,CACjC,SAAS,EAAE,cAAc,EACzB,aAAa,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GACxC,WAAW,CA0Db;AAmWD;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,qBAAqB,CACpC,SAAS,EAAE,cAAc,EACzB,KAAK,EAAE,cAAc,EACrB,GAAG,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,EACzC,QAAQ,EAAE,aAAa,CAAC,eAAe,CAAC,EACxC,aAAa,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,EAC1C,mBAAmB,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO,EAC7C,eAAe,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO,EACzC,mBAAmB,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,MAAM,GAC1C,OAAO,CAST;AA0PD;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CACpC,CAAC,EAAE,aAAa,CAAC,eAAe,CAAC,EACjC,CAAC,EAAE,aAAa,CAAC,eAAe,CAAC,GAC/B,eAAe,EAAE,CAenB;AASD;;;;;GAKG;AACH,wBAAgB,4BAA4B,CAC3C,QAAQ,EAAE,aAAa,CAAC,eAAe,CAAC,EACxC,GAAG,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,GACvC,eAAe,EAAE,CA0BnB;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CACtC,QAAQ,EAAE,aAAa,CAAC,eAAe,CAAC,EACxC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAClC,eAAe,EAAE,CAYnB;AAED,sEAAsE;AACtE,wBAAgB,qBAAqB,CACpC,QAAQ,EAAE,aAAa,CAAC,eAAe,CAAC,EACxC,MAAM,EAAE,MAAM,GACZ,eAAe,EAAE,CAMnB;AAMD,YAAY,EAAE,gBAAgB,EAAE,CAAC;AAuCjC;;;;;GAKG;AACH,wBAAgB,sBAAsB,CACrC,CAAC,EAAE,aAAa,CAAC,gBAAgB,CAAC,EAClC,CAAC,EAAE,aAAa,CAAC,gBAAgB,CAAC,GAChC,gBAAgB,EAAE,CAOpB;AASD;;;GAGG;AACH,wBAAgB,wBAAwB,CACvC,OAAO,EAAE,aAAa,CAAC,gBAAgB,CAAC,EACxC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAClC,gBAAgB,EAAE,CAQpB;AAED,+EAA+E;AAC/E,wBAAgB,sBAAsB,CACrC,OAAO,EAAE,aAAa,CAAC,gBAAgB,CAAC,EACxC,MAAM,EAAE,MAAM,GACZ,gBAAgB,EAAE,CAGpB;AAMD,YAAY,EAAE,mBAAmB,EAAE,SAAS,EAAE,CAAC;AAE/C;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,KAAK,CAAC;AAiCpC,MAAM,WAAW,aAAa;IAC7B,GAAG,CAAC,EAAE,MAAM,CAAC;CACb;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CACrB,IAAI,EAAE,aAAa,CAAC,mBAAmB,CAAC,EACxC,IAAI,EAAE,mBAAmB,EACzB,IAAI,GAAE,aAAkB,GACtB,mBAAmB,EAAE,CAMvB;AAaD,8EAA8E;AAC9E,wBAAgB,SAAS,CACxB,CAAC,EAAE,aAAa,CAAC,mBAAmB,CAAC,EACrC,CAAC,EAAE,aAAa,CAAC,mBAAmB,CAAC,EACrC,IAAI,GAAE,aAAkB,GACtB,mBAAmB,EAAE,CAMvB;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAC1B,IAAI,EAAE,aAAa,CAAC,mBAAmB,CAAC,EACxC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAClC,mBAAmB,EAAE,CAcvB;AAED;;;GAGG;AACH,wBAAgB,SAAS,CACxB,IAAI,EAAE,aAAa,CAAC,mBAAmB,CAAC,EACxC,MAAM,EAAE,MAAM,GACZ,mBAAmB,EAAE,CAOvB"}
+{"version":3,"file":"fd-utils.d.ts","sourceRoot":"","sources":["../../../../src/planner/util/fd-utils.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAGH,OAAO,KAAK,EAAE,eAAe,EAAE,aAAa,EAAE,gBAAgB,EAAE,oBAAoB,EAAe,cAAc,EAAE,mBAAmB,EAAE,SAAS,EAAE,kBAAkB,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACrN,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAW7D;;;;GAIG;AACH,eAAO,MAAM,gBAAgB,KAAK,CAAC;AAEnC;;;;;;;;GAQG;AACH,wBAAgB,cAAc,CAC7B,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,EAC1B,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GACtC,GAAG,CAAC,MAAM,CAAC,CAkBb;AAED;;;;;;;GAOG;AACH,wBAAgB,cAAc,CAC7B,GAAG,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,EACzC,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GACtC,oBAAoB,EAAE,CAYxB;AAED,2EAA2E;AAC3E,wBAAgB,UAAU,CACzB,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,EAC1B,MAAM,EAAE,WAAW,CAAC,MAAM,CAAC,EAC3B,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GACtC,OAAO,CAOT;AAED;;;;GAIG;AACH,wBAAgB,YAAY,CAC3B,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,EAC1B,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GACtC,GAAG,CAAC,MAAM,CAAC,CAgBb;AAuGD,MAAM,WAAW,YAAY;IAC5B;;;;OAIG;IACH,QAAQ,CAAC,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,CAAC;IAChD,GAAG,CAAC,EAAE,MAAM,CAAC;CACb;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,KAAK,CACpB,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,EACxC,IAAI,EAAE,oBAAoB,EAC1B,IAAI,GAAE,YAAiB,GACrB,oBAAoB,EAAE,CAwCxB;AAuCD,4DAA4D;AAC5D,wBAAgB,QAAQ,CACvB,CAAC,EAAE,aAAa,CAAC,oBAAoB,CAAC,EACtC,CAAC,EAAE,aAAa,CAAC,oBAAoB,CAAC,EACtC,IAAI,GAAE,YAAiB,GACrB,oBAAoB,EAAE,CAMxB;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,wBAAgB,UAAU,CACzB,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,EACxC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAClC,oBAAoB,EAAE,CA+BxB;AAuDD;;;;;GAKG;AACH,wBAAgB,QAAQ,CACvB,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,EACxC,MAAM,EAAE,MAAM,GACZ,oBAAoB,EAAE,CAaxB;AAqBD;;;;;;;GAOG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,oBAAoB,GAAG,oBAAoB,CAIzE;AAED,yDAAyD;AACzD,wBAAgB,iBAAiB,CAChC,OAAO,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,EAC7C,MAAM,EAAE,MAAM,GACZ,MAAM,EAAE,EAAE,CAGZ;AAQD;;;GAGG;AACH,wBAAgB,iBAAiB,CAChC,CAAC,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,EACvC,CAAC,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,GACrC,MAAM,EAAE,EAAE,CA2BZ;AAED,4DAA4D;AAC5D,wBAAgB,cAAc,CAC7B,OAAO,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,EAC7C,CAAC,EAAE,MAAM,EACT,CAAC,EAAE,MAAM,GACP,MAAM,EAAE,EAAE,CAGZ;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,YAAY,CAC3B,GAAG,EAAE,SAAS,MAAM,EAAE,EACtB,WAAW,EAAE,MAAM,GACjB,oBAAoB,GAAG,SAAS,CAQlC;AAED;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAC/B,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,EAC1B,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GAAG,SAAS,EACpD,WAAW,EAAE,MAAM,GACjB,OAAO,CAOT;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,mBAAmB,CAClC,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,EAC1B,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GAAG,SAAS,EACpD,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,OAAO,GACZ,OAAO,CAYT;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,iBAAiB,CAChC,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GAAG,SAAS,EACpD,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,OAAO,GACZ,MAAM,EAAE,EAAE,CAiBZ;AAED;;;;;;;GAOG;AACH,wBAAgB,SAAS,CACxB,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GAAG,SAAS,EACpD,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,OAAO,GACZ,OAAO,CAOT;AAED;;;;;;;;;;;;GAYG;AACH,wBAAgB,cAAc,CAC7B,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,GAAG,SAAS,EACpD,WAAW,EAAE,MAAM,EACnB,KAAK,EAAE,OAAO,GACZ,OAAO,CAGT;AAED;;;;;GAKG;AACH,wBAAgB,WAAW,CAAC,WAAW,EAAE,MAAM,GAAG,oBAAoB,GAAG,SAAS,CAKjF;AAED;;;;;;;;;GASG;AACH,wBAAgB,cAAc,CAC7B,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,EACxC,WAAW,EAAE,MAAM,GACjB,oBAAoB,EAAE,CAGxB;AAYD;;;;GAIG;AACH,MAAM,WAAW,MAAM;IACtB,OAAO,IAAI,YAAY,CAAC;IACxB,QAAQ,CAAC,EAAE,kBAAkB,CAAC;CAC9B;AAyCD;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AACH,wBAAgB,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,SAAS,CAAC,SAAS,MAAM,EAAE,CAAC,EAAE,CAiClE;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAUtE;AAED;;;;;;;;;;;;;GAaG;AACH,wBAAgB,cAAc,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO,CAEnD;AAED;;;;GAIG;AACH,YAAY,EAAE,eAAe,EAAE,aAAa,EAAE,CAAC;AAE/C;;;;;;;;;GASG;AACH,MAAM,WAAW,WAAW;IAC3B,QAAQ,CAAC,GAAG,EAAE,aAAa,CAAC,oBAAoB,CAAC,CAAC;IAClD,QAAQ,CAAC,UAAU,EAAE,aAAa,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC9D,QAAQ,CAAC,gBAAgB,EAAE,aAAa,CAAC,eAAe,CAAC,CAAC;CAC1D;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqDG;AACH,wBAAgB,kBAAkB,CACjC,SAAS,EAAE,cAAc,EACzB,aAAa,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GACxC,WAAW,CA8Db;AA2WD;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAgB,qBAAqB,CACpC,SAAS,EAAE,cAAc,EACzB,KAAK,EAAE,cAAc,EACrB,GAAG,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,EACzC,QAAQ,EAAE,aAAa,CAAC,eAAe,CAAC,EACxC,aAAa,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,EAC1C,mBAAmB,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO,EAC7C,eAAe,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO,EACzC,mBAAmB,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,MAAM,GAC1C,OAAO,CAST;AA0PD;;;;;;GAMG;AACH,wBAAgB,qBAAqB,CACpC,CAAC,EAAE,aAAa,CAAC,eAAe,CAAC,EACjC,CAAC,EAAE,aAAa,CAAC,eAAe,CAAC,GAC/B,eAAe,EAAE,CAenB;AASD;;;;;GAKG;AACH,wBAAgB,4BAA4B,CAC3C,QAAQ,EAAE,aAAa,CAAC,eAAe,CAAC,EACxC,GAAG,EAAE,aAAa,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,GACvC,eAAe,EAAE,CA0BnB;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CACtC,QAAQ,EAAE,aAAa,CAAC,eAAe,CAAC,EACxC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAClC,eAAe,EAAE,CAYnB;AAED,sEAAsE;AACtE,wBAAgB,qBAAqB,CACpC,QAAQ,EAAE,aAAa,CAAC,eAAe,CAAC,EACxC,MAAM,EAAE,MAAM,GACZ,eAAe,EAAE,CAMnB;AAMD,YAAY,EAAE,gBAAgB,EAAE,CAAC;AAuCjC;;;;;GAKG;AACH,wBAAgB,sBAAsB,CACrC,CAAC,EAAE,aAAa,CAAC,gBAAgB,CAAC,EAClC,CAAC,EAAE,aAAa,CAAC,gBAAgB,CAAC,GAChC,gBAAgB,EAAE,CAOpB;AASD;;;GAGG;AACH,wBAAgB,wBAAwB,CACvC,OAAO,EAAE,aAAa,CAAC,gBAAgB,CAAC,EACxC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAClC,gBAAgB,EAAE,CAQpB;AAED,+EAA+E;AAC/E,wBAAgB,sBAAsB,CACrC,OAAO,EAAE,aAAa,CAAC,gBAAgB,CAAC,EACxC,MAAM,EAAE,MAAM,GACZ,gBAAgB,EAAE,CAGpB;AAMD,YAAY,EAAE,mBAAmB,EAAE,SAAS,EAAE,CAAC;AAE/C;;;;GAIG;AACH,eAAO,MAAM,iBAAiB,KAAK,CAAC;AAiCpC,MAAM,WAAW,aAAa;IAC7B,GAAG,CAAC,EAAE,MAAM,CAAC;CACb;AAED;;;;;GAKG;AACH,wBAAgB,MAAM,CACrB,IAAI,EAAE,aAAa,CAAC,mBAAmB,CAAC,EACxC,IAAI,EAAE,mBAAmB,EACzB,IAAI,GAAE,aAAkB,GACtB,mBAAmB,EAAE,CAMvB;AAaD,8EAA8E;AAC9E,wBAAgB,SAAS,CACxB,CAAC,EAAE,aAAa,CAAC,mBAAmB,CAAC,EACrC,CAAC,EAAE,aAAa,CAAC,mBAAmB,CAAC,EACrC,IAAI,GAAE,aAAkB,GACtB,mBAAmB,EAAE,CAMvB;AAED;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAC1B,IAAI,EAAE,aAAa,CAAC,mBAAmB,CAAC,EACxC,OAAO,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAClC,mBAAmB,EAAE,CAcvB;AAED;;;GAGG;AACH,wBAAgB,SAAS,CACxB,IAAI,EAAE,aAAa,CAAC,mBAAmB,CAAC,EACxC,MAAM,EAAE,MAAM,GACZ,mBAAmB,EAAE,CAOvB"}