@jaepil/uqa 0.1.0

package/dist/types/src/planner/cardinality.d.ts

@@ -0,0 +1,110 @@
+import type { IndexStats } from "../core/types.js";
+import type { ColumnStats } from "../sql/table.js";
+import { Operator } from "../operators/base.js";
+export declare class GraphStats {
+    numVertices: number;
+    numEdges: number;
+    labelCounts: Map<string, number>;
+    avgOutDegree: number;
+    degreeDistribution: Map<number, number>;
+    minTimestamp: number | null;
+    maxTimestamp: number | null;
+    graphName: string;
+    vertexLabelCounts: Map<string, number>;
+    labelDegreeMap: Map<string, number>;
+    constructor(opts?: {
+        numVertices?: number;
+        numEdges?: number;
+        labelCounts?: Map<string, number>;
+        avgOutDegree?: number;
+        degreeDistribution?: Map<number, number>;
+        minTimestamp?: number | null;
+        maxTimestamp?: number | null;
+        graphName?: string;
+        vertexLabelCounts?: Map<string, number>;
+        labelDegreeMap?: Map<string, number>;
+    });
+    /**
+     * Compute statistics from a graph store instance.
+     */
+    static fromGraphStore(graphStore: unknown, graph?: string): GraphStats;
+    private static _fromNamedGraph;
+    labelSelectivity(label: string | null): number;
+    edgeDensity(): number;
+}
+export declare class CardinalityEstimator {
+    private readonly _columnStats;
+    private readonly _graphStats;
+    private readonly _graphStore;
+    constructor(columnStatsOrOpts?: Map<string, ColumnStats> | {
+        columnStats?: Map<string, ColumnStats>;
+        graphStats?: GraphStats;
+        graphStore?: unknown;
+    } | null, opts?: {
+        graphStats?: GraphStats;
+        graphStore?: unknown;
+    });
+    estimate(op: Operator, stats: IndexStats): number;
+    private _intersectionDamping;
+    private static _vectorSelectivity;
+    /**
+     * Estimate cardinality of a join operand, handling untyped objects.
+     */
+    estimateJoinSide(side: unknown, stats: IndexStats, n: number): number;
+    /**
+     * Approximate cardinality via random walk sampling (Section 6.3, Paper 2).
+     * Returns estimated number of pattern matches, or -1 if sampling
+     * is unavailable (no graph store or empty graph).
+     */
+    sampleGraphCardinality(pattern: {
+        vertexPatterns?: {
+            variable: string;
+            constraints: ((v: unknown) => boolean)[];
+        }[];
+        edgePatterns?: {
+            sourceVar: string;
+            targetVar: string;
+            label: string | null;
+        }[];
+    }, sampleSize?: number): number;
+    estimateJoin(leftCard: number, rightCard: number, domainSize: number): number;
+    private _filterSelectivity;
+    private static _equalitySelectivity;
+    static histogramFraction(boundaries: unknown[], low: unknown, high: unknown): number;
+    private _rangeSelectivity;
+    private _gtSelectivity;
+    private _ltSelectivity;
+    estimateGraphPattern(patternSize: number, edgeLabels?: string[]): number;
+    estimatePathQuery(pathLength: number, edgeLabel?: string): number;
+    estimateTraverse(hops: number, label?: string | null): number;
+    estimatePatternMatch(vertexCount: number, edgeCount: number, edgeLabels?: string[]): number;
+    /**
+     * Estimate cardinality for cross-paradigm operators that combine
+     * text retrieval, graph traversal, and vector similarity.
+     */
+    estimateCrossParadigm(op: Operator, stats: IndexStats, paradigm: string): number;
+    /**
+     * Estimate cardinality for temporal graph pattern queries.
+     * Takes into account the time range selectivity.
+     */
+    estimateTemporalPattern(vertexCount: number, edgeCount: number, edgeLabels: string[], timeRangeStart: number | null, timeRangeEnd: number | null): number;
+    /**
+     * Estimate cardinality for temporal traversal with time-filtered edges.
+     */
+    estimateTemporalTraverse(hops: number, label: string | null, timeRangeStart: number | null, timeRangeEnd: number | null): number;
+    /**
+     * Estimate cardinality for weighted regular path queries.
+     * Weighted RPQ considers edge weights/probabilities alongside the
+     * structural path pattern.
+     */
+    estimateWeightedRPQ(pathLength: number, edgeLabels: string[], weightThreshold: number | null): number;
+    /**
+     * Estimate cardinality for bounded regular path queries.
+     * A bounded RPQ has min/max repetition constraints.
+     */
+    estimateBoundedRPQ(minLength: number, maxLength: number, edgeLabel: string | null): number;
+}
+export declare function columnEntropy(cs: ColumnStats): number;
+export declare function mutualInformationEstimate(csX: ColumnStats, csY: ColumnStats, jointSelectivity: number): number;
+export declare function entropyCardinalityLowerBound(n: number, entropies: number[]): number;
+//# sourceMappingURL=cardinality.d.ts.map

package/dist/types/src/planner/cardinality.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cardinality.d.ts","sourceRoot":"","sources":["../../../../src/planner/cardinality.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAwBhD,qBAAa,UAAU;IACrB,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,MAAM,CAAC;IACjB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACjC,YAAY,EAAE,MAAM,CAAC;IACrB,kBAAkB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACxC,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,YAAY,EAAE,MAAM,GAAG,IAAI,CAAC;IAC5B,SAAS,EAAE,MAAM,CAAC;IAClB,iBAAiB,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACvC,cAAc,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBAExB,IAAI,CAAC,EAAE;QACjB,WAAW,CAAC,EAAE,MAAM,CAAC;QACrB,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,WAAW,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAClC,YAAY,CAAC,EAAE,MAAM,CAAC;QACtB,kBAAkB,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACzC,YAAY,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAC7B,YAAY,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;QAC7B,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,iBAAiB,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QACxC,cAAc,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KACtC;IAaD;;OAEG;IACH,MAAM,CAAC,cAAc,CAAC,UAAU,EAAE,OAAO,EAAE,KAAK,SAAK,GAAG,UAAU;IAqClE,OAAO,CAAC,MAAM,CAAC,eAAe;IAuC9B,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,MAAM;IAK9C,WAAW,IAAI,MAAM;CAItB;AAMD,qBAAa,oBAAoB;IAC/B,OAAO,CAAC,QAAQ,CAAC,YAAY,CAA2B;IACxD,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAoB;IAChD,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAU;gBAGpC,iBAAiB,CAAC,EACd,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,GACxB;QACE,WAAW,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QACvC,UAAU,CAAC,EAAE,UAAU,CAAC;QACxB,UAAU,CAAC,EAAE,OAAO,CAAC;KACtB,GACD,IAAI,EACR,IAAI,CAAC,EAAE;QAAE,UAAU,CAAC,EAAE,UAAU,CAAC;QAAC,UAAU,CAAC,EAAE,OAAO,CAAA;KAAE;IAsB1D,QAAQ,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,UAAU,GAAG,MAAM;IA8EjD,OAAO,CAAC,oBAAoB;IAyB5B,OAAO,CAAC,MAAM,CAAC,kBAAkB;IAOjC;;OAEG;IACH,gBAAgB,CAAC,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,EAAE,MAAM,GAAG,MAAM;IAcrE;;;;OAIG;IACH,sBAAsB,CACpB,OAAO,EAAE;QACP,cAAc,CAAC,EAAE;YAAE,QAAQ,EAAE,MAAM,CAAC;YAAC,WAAW,EAAE,CAAC,CAAC,CAAC,EAAE,OAAO,KAAK,OAAO,CAAC,EAAE,CAAA;SAAE,EAAE,CAAC;QAClF,YAAY,CAAC,EAAE;YACb,SAAS,EAAE,MAAM,CAAC;YAClB,SAAS,EAAE,MAAM,CAAC;YAClB,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;SACtB,EAAE,CAAC;KACL,EACD,UAAU,SAAM,GACf,MAAM;IA6BT,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,GAAG,MAAM;IAK7E,OAAO,CAAC,kBAAkB;IAgE1B,OAAO,CAAC,MAAM,CAAC,oBAAoB;IAenC,MAAM,CAAC,iBAAiB,CAAC,UAAU,EAAE,OAAO,EAAE,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,GAAG,MAAM;IA8BpF,OAAO,CAAC,iBAAiB;IAoBzB,OAAO,CAAC,cAAc;IAqBtB,OAAO,CAAC,cAAc;IAuBtB,oBAAoB,CAAC,WAAW,EAAE,MAAM,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM;IAiCxE,iBAAiB,CAAC,UAAU,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,MAAM,GAAG,MAAM;IAiBjE,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,GAAE,MAAM,GAAG,IAAW,GAAG,MAAM;IAkBnE,oBAAoB,CAClB,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM,EACjB,UAAU,GAAE,MAAM,EAAO,GACxB,MAAM;IAiBT;;;OAGG;IACH,qBAAqB,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,UAAU,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM;IAkEhF;;;OAGG;IACH,uBAAuB,CACrB,WAAW,EAAE,MAAM,EACnB,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,EAAE,EACpB,cAAc,EAAE,MAAM,GAAG,IAAI,EAC7B,YAAY,EAAE,MAAM,GAAG,IAAI,GAC1B,MAAM;IA6BT;;OAEG;IACH,wBAAwB,CACtB,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,GAAG,IAAI,EACpB,cAAc,EAAE,MAAM,GAAG,IAAI,EAC7B,YAAY,EAAE,MAAM,GAAG,IAAI,GAC1B,MAAM;IA4BT;;;;OAIG;IACH,mBAAmB,CACjB,UAAU,EAAE,MAAM,EAClB,UAAU,EAAE,MAAM,EAAE,EACpB,eAAe,EAAE,MAAM,GAAG,IAAI,GAC7B,MAAM;IA2BT;;;OAGG;IACH,kBAAkB,CAChB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,GAAG,IAAI,GACvB,MAAM;CAoBV;AAID,wBAAgB,aAAa,CAAC,EAAE,EAAE,WAAW,GAAG,MAAM,CAiCrD;AAED,wBAAgB,yBAAyB,CACvC,GAAG,EAAE,WAAW,EAChB,GAAG,EAAE,WAAW,EAChB,gBAAgB,EAAE,MAAM,GACvB,MAAM,CAYR;AAED,wBAAgB,4BAA4B,CAAC,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,GAAG,MAAM,CAKnF"}

package/dist/types/src/planner/cost-model.d.ts

@@ -0,0 +1,16 @@
+import type { IndexStats } from "../core/types.js";
+import type { Operator } from "../operators/base.js";
+export interface GraphStats {
+    numVertices: number;
+    avgOutDegree: number;
+    labelSelectivity(label: string | null): number;
+}
+/**
+ * Operator cost estimation for query optimization (Definition 6.2.1, Paper 1).
+ */
+export declare class CostModel {
+    private _graphStats;
+    constructor(graphStats?: GraphStats | null);
+    estimate(op: Operator, stats: IndexStats): number;
+}
+//# sourceMappingURL=cost-model.d.ts.map

package/dist/types/src/planner/cost-model.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cost-model.d.ts","sourceRoot":"","sources":["../../../../src/planner/cost-model.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AA6DrD,MAAM,WAAW,UAAU;IACzB,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;IACrB,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,GAAG,MAAM,CAAC;CAChD;AAMD;;GAEG;AACH,qBAAa,SAAS;IACpB,OAAO,CAAC,WAAW,CAAoB;gBAE3B,UAAU,CAAC,EAAE,UAAU,GAAG,IAAI;IAI1C,QAAQ,CAAC,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,UAAU,GAAG,MAAM;CAsRlD"}

package/dist/types/src/planner/executor.d.ts

@@ -0,0 +1,48 @@
+import { PostingList } from "../core/posting-list.js";
+import type { ExecutionContext } from "../operators/base.js";
+import type { Operator } from "../operators/base.js";
+export interface ExecutionStats {
+    operatorName: string;
+    elapsedMs: number;
+    resultCount: number;
+    children: ExecutionStats[];
+}
+/**
+ * Executes an operator tree against an ExecutionContext, collecting
+ * per-operator timing statistics.
+ */
+export declare class PlanExecutor {
+    private readonly _context;
+    private _lastStats;
+    constructor(context: ExecutionContext);
+    /**
+     * Execute the operator tree and return the resulting PostingList.
+     */
+    execute(op: Operator): PostingList;
+    /**
+     * Return a human-readable EXPLAIN string for the operator tree.
+     */
+    explain(op: Operator): string;
+    /**
+     * Return the execution statistics from the last execute() call.
+     */
+    get lastStats(): ExecutionStats | null;
+    private _executeWithStats;
+    private _explainNode;
+    private _operatorName;
+    private _operatorDetails;
+    /**
+     * Recursive EXPLAIN with full cost and cardinality estimation.
+     * Produces a detailed plan tree with estimated rows and cost per node.
+     */
+    explainAnalyze(op: Operator, opts?: {
+        verbose?: boolean;
+    }): string;
+    private _explainAnalyzeNode;
+    /**
+     * Return a structured EXPLAIN output as a tree of objects.
+     */
+    explainTree(op: Operator): Record<string, unknown>;
+    private _explainTreeNode;
+}
+//# sourceMappingURL=executor.d.ts.map

package/dist/types/src/planner/executor.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"executor.d.ts","sourceRoot":"","sources":["../../../../src/planner/executor.ts"],"names":[],"mappings":"AAYA,OAAO,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AACtD,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAC7D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAqBrD,MAAM,WAAW,cAAc;IAC7B,YAAY,EAAE,MAAM,CAAC;IACrB,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,cAAc,EAAE,CAAC;CAC5B;AAMD;;;GAGG;AACH,qBAAa,YAAY;IACvB,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAmB;IAC5C,OAAO,CAAC,UAAU,CAA+B;gBAErC,OAAO,EAAE,gBAAgB;IAIrC;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,QAAQ,GAAG,WAAW;IAMlC;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,QAAQ,GAAG,MAAM;IAI7B;;OAEG;IACH,IAAI,SAAS,IAAI,cAAc,GAAG,IAAI,CAErC;IAMD,OAAO,CAAC,iBAAiB;IAgFzB,OAAO,CAAC,YAAY;IAwCpB,OAAO,CAAC,aAAa;IAerB,OAAO,CAAC,gBAAgB;IA6FxB;;;OAGG;IACH,cAAc,CAAC,EAAE,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE;QAAE,OAAO,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,MAAM;IAKlE,OAAO,CAAC,mBAAmB;IAqB3B;;OAEG;IACH,WAAW,CAAC,EAAE,EAAE,QAAQ,GAAG,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAIlD,OAAO,CAAC,gBAAgB;CAmDzB"}

package/dist/types/src/planner/join-enumerator.d.ts

@@ -0,0 +1,76 @@
+import type { JoinGraph, JoinPlan } from "./join-graph.js";
+export declare class DPccp {
+    private readonly _graph;
+    private _dp;
+    private readonly _allMask;
+    constructor(graph: JoinGraph);
+    /**
+     * Find the optimal join plan for all relations in the graph.
+     *
+     * Returns the JoinPlan covering all relations with minimum cost.
+     * Falls back to greedy for large queries.
+     */
+    optimize(): JoinPlan;
+    /**
+     * Core DPccp: enumerate all connected subgraph complement pairs.
+     *
+     * Builds connected subgraphs incrementally via BFS extension
+     * instead of generating all C(n,k) subsets and filtering.
+     * Each connected subgraph S is formed by extending a smaller
+     * connected subgraph with an adjacent vertex whose index exceeds
+     * min(S), ensuring each subgraph is generated exactly once.
+     *
+     * Uses a Uint8Array lookup table (indexed by bitmask) for O(1)
+     * connectivity checks instead of hash-based set lookups.
+     */
+    private _enumerateCsgCmpPairs;
+    /**
+     * Try all valid splits of subsetMask into (s1, s2).
+     *
+     * Enumerates only submasks that contain the lowest set bit
+     * (canonical half) using the identity:
+     * rest = subsetMask ^ lowestBit; iterate submasks of
+     * rest and OR in lowestBit.  This skips the entire
+     * non-canonical half without branch checks.
+     *
+     * Connectivity is checked via O(1) Uint8Array indexing.
+     */
+    private _enumerateSplits;
+    /**
+     * Consider joining plan1 and plan2 via the given edges.
+     */
+    private _emitCsgCmpPair;
+    /**
+     * Check if the subgraph induced by subset is connected.
+     */
+    private _isConnected;
+    /**
+     * Handle disconnected join graphs by cross-joining components.
+     *
+     * When the join graph is not fully connected (e.g. FROM a, b
+     * with no join predicate), identify connected components and
+     * join them with cross products.
+     */
+    private _joinDisconnectedComponents;
+    /**
+     * Find all connected components of the join graph.
+     */
+    private _findConnectedComponents;
+    /**
+     * Build a JoinGraph containing only the given nodes.
+     */
+    private _buildSubgraph;
+    /**
+     * Remap plan relation indices from subgraph back to original graph.
+     */
+    private _remapPlan;
+    /**
+     * Greedy join ordering for large queries (> MAX_DP_RELATIONS).
+     *
+     * At each step, pick the pair of existing plans with the lowest
+     * join cost and merge them.  This is O(n^3) in the number of
+     * relations.
+     */
+    private _greedyOptimize;
+}
+//# sourceMappingURL=join-enumerator.d.ts.map

package/dist/types/src/planner/join-enumerator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"join-enumerator.d.ts","sourceRoot":"","sources":["../../../../src/planner/join-enumerator.ts"],"names":[],"mappings":"AAuBA,OAAO,KAAK,EAAE,SAAS,EAAY,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AA0BrE,qBAAa,KAAK;IAChB,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAY;IACnC,OAAO,CAAC,GAAG,CAAwB;IACnC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAS;gBAEtB,KAAK,EAAE,SAAS;IAM5B;;;;;OAKG;IACH,QAAQ,IAAI,QAAQ;IA8CpB;;;;;;;;;;;OAWG;IACH,OAAO,CAAC,qBAAqB;IAsD7B;;;;;;;;;;OAUG;IACH,OAAO,CAAC,gBAAgB;IAuCxB;;OAEG;IACH,OAAO,CAAC,eAAe;IA+CvB;;OAEG;IACH,OAAO,CAAC,YAAY;IAoBpB;;;;;;OAMG;IACH,OAAO,CAAC,2BAA2B;IAmDnC;;OAEG;IACH,OAAO,CAAC,wBAAwB;IA4BhC;;OAEG;IACH,OAAO,CAAC,cAAc;IAmCtB;;OAEG;IACH,OAAO,CAAC,UAAU;IAelB;;;;;;OAMG;IACH,OAAO,CAAC,eAAe;CA0FxB"}

package/dist/types/src/planner/join-graph.d.ts

@@ -0,0 +1,61 @@
+import type { Operator } from "../operators/base.js";
+import type { ColumnStats } from "../sql/table.js";
+export interface JoinEdge {
+    leftNode: number;
+    rightNode: number;
+    leftField: string;
+    rightField: string;
+    selectivity: number;
+}
+export interface JoinNode {
+    index: number;
+    alias: string;
+    operator: Operator | null;
+    table: unknown;
+    cardinality: number;
+    columnStats: Map<string, ColumnStats> | null;
+}
+export interface JoinPlan {
+    relations: Set<number>;
+    cardinality: number;
+    cost: number;
+    left: JoinPlan | null;
+    right: JoinPlan | null;
+    joinEdge: JoinEdge | null;
+}
+export declare class JoinGraph {
+    private _nodes;
+    private _edges;
+    private _adjacency;
+    /**
+     * Add a relation node to the graph.
+     * @returns The index of the new node.
+     */
+    addNode(alias: string, operator: Operator | null, table: unknown, cardinality: number, columnStats?: Map<string, ColumnStats> | null): number;
+    /**
+     * Add a join edge between two nodes.
+     * @param selectivity  Fraction of the cross product retained (default 0.1).
+     */
+    addEdge(leftNode: number, rightNode: number, leftField: string, rightField: string, selectivity?: number): void;
+    /** Return the neighbor node indices for the given node. */
+    neighbors(node: number): number[];
+    /**
+     * Return all edges that connect a node in setA to a node in setB.
+     */
+    edgesBetween(setA: Set<number>, setB: Set<number>): JoinEdge[];
+    /** Total number of nodes in the graph. */
+    get length(): number;
+    /** Access nodes by index. */
+    getNode(index: number): JoinNode;
+    /** Return all nodes. */
+    get nodes(): readonly JoinNode[];
+    /** Return all edges. */
+    get edges(): readonly JoinEdge[];
+    /**
+     * Estimate join selectivity between two nodes using column statistics.
+     * Returns 1/max(distinct_count_left, distinct_count_right) when stats are
+     * available, otherwise falls back to the default selectivity of 0.01.
+     */
+    estimateJoinSelectivity(leftNode: number, rightNode: number, leftField: string, rightField: string): number;
+}
+//# sourceMappingURL=join-graph.d.ts.map

package/dist/types/src/planner/join-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"join-graph.d.ts","sourceRoot":"","sources":["../../../../src/planner/join-graph.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AACrD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAMnD,MAAM,WAAW,QAAQ;IACvB,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,CAAC;IAClB,SAAS,EAAE,MAAM,CAAC;IAClB,UAAU,EAAE,MAAM,CAAC;IACnB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,MAAM,WAAW,QAAQ;IACvB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;IAC1B,KAAK,EAAE,OAAO,CAAC;IACf,WAAW,EAAE,MAAM,CAAC;IACpB,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,GAAG,IAAI,CAAC;CAC9C;AAED,MAAM,WAAW,QAAQ;IACvB,SAAS,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,QAAQ,GAAG,IAAI,CAAC;IACtB,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC;IACvB,QAAQ,EAAE,QAAQ,GAAG,IAAI,CAAC;CAC3B;AAMD,qBAAa,SAAS;IACpB,OAAO,CAAC,MAAM,CAAkB;IAChC,OAAO,CAAC,MAAM,CAAkB;IAChC,OAAO,CAAC,UAAU,CAAuC;IAEzD;;;OAGG;IACH,OAAO,CACL,KAAK,EAAE,MAAM,EACb,QAAQ,EAAE,QAAQ,GAAG,IAAI,EACzB,KAAK,EAAE,OAAO,EACd,WAAW,EAAE,MAAM,EACnB,WAAW,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,GAAG,IAAI,GAC5C,MAAM;IAcT;;;OAGG;IACH,OAAO,CACL,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,EAClB,WAAW,SAAM,GAChB,IAAI;IAmBP,2DAA2D;IAC3D,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE;IAMjC;;OAEG;IACH,YAAY,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,QAAQ,EAAE;IAe9D,0CAA0C;IAC1C,IAAI,MAAM,IAAI,MAAM,CAEnB;IAED,6BAA6B;IAC7B,OAAO,CAAC,KAAK,EAAE,MAAM,GAAG,QAAQ;IAQhC,wBAAwB;IACxB,IAAI,KAAK,IAAI,SAAS,QAAQ,EAAE,CAE/B;IAED,wBAAwB;IACxB,IAAI,KAAK,IAAI,SAAS,QAAQ,EAAE,CAE/B;IAED;;;;OAIG;IACH,uBAAuB,CACrB,QAAQ,EAAE,MAAM,EAChB,SAAS,EAAE,MAAM,EACjB,SAAS,EAAE,MAAM,EACjB,UAAU,EAAE,MAAM,GACjB,MAAM;CAkBV"}

package/dist/types/src/planner/join-order.d.ts

@@ -0,0 +1,24 @@
+import type { JoinEdge, JoinNode, JoinPlan } from "./join-graph.js";
+/**
+ * Greedy join-order optimizer.
+ *
+ * For each step, picks the cheapest pair (lowest estimated intermediate
+ * cardinality) from the remaining relations and fuses them.
+ * Works well for star schemas and small numbers of relations (< ~8).
+ * For larger join graphs, use the DPccp enumerator instead.
+ */
+export declare class JoinOrderOptimizer {
+    /**
+     * Find a join ordering for the given relations and join predicates.
+     *
+     * @param relations  The base relation nodes.
+     * @param predicates The join predicates (edges).
+     * @returns A JoinPlan tree, or null if no valid plan can be formed.
+     */
+    optimize(relations: JoinNode[], predicates: JoinEdge[]): JoinPlan | null;
+    /**
+     * Find the first edge connecting any node in setA to any node in setB.
+     */
+    private _findEdge;
+}
+//# sourceMappingURL=join-order.d.ts.map

package/dist/types/src/planner/join-order.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"join-order.d.ts","sourceRoot":"","sources":["../../../../src/planner/join-order.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,iBAAiB,CAAC;AAMpE;;;;;;;GAOG;AACH,qBAAa,kBAAkB;IAC7B;;;;;;OAMG;IACH,QAAQ,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,UAAU,EAAE,QAAQ,EAAE,GAAG,QAAQ,GAAG,IAAI;IAoGxE;;OAEG;IACH,OAAO,CAAC,SAAS;CAgBlB"}

package/dist/types/src/planner/optimizer.d.ts

@@ -0,0 +1,62 @@
+import type { IndexStats } from "../core/types.js";
+import type { ColumnStats } from "../sql/table.js";
+import type { IndexManager } from "../storage/index-manager.js";
+import type { Operator } from "../operators/base.js";
+import type { GraphStats } from "./cardinality.js";
+import { CardinalityEstimator } from "./cardinality.js";
+export declare class QueryOptimizer {
+    readonly stats: IndexStats;
+    readonly estimator: CardinalityEstimator;
+    private readonly _costModel;
+    private readonly _graphStats;
+    private readonly _indexManager;
+    private readonly _tableName;
+    constructor(stats: IndexStats, opts?: {
+        columnStats?: Map<string, ColumnStats>;
+        indexManager?: IndexManager;
+        tableName?: string;
+        graphStats?: GraphStats;
+    });
+    optimize(op: Operator): Operator;
+    private _simplifyAlgebra;
+    private _recurseSimplify;
+    private static _isEmptyOperator;
+    private _pushFiltersDown;
+    /**
+     * Push filter predicates into graph pattern constraints.
+     * When a FilterOperator sits above a PatternMatchOperator or TraverseOperator
+     * and filters on vertex/edge properties, the filter can be pushed into the
+     * graph operator's own constraint set, reducing intermediate results.
+     */
+    private _pushGraphPatternFilters;
+    /**
+     * Push vertex-property filters into BFS pruning within TraverseOperator.
+     * This converts a Filter(TraverseOp) into TraverseOp(vertexPredicate=...).
+     */
+    private _pushFilterIntoTraverse;
+    /**
+     * Push filters below graph join operators when the filter predicate
+     * only references columns from one side of the join.
+     */
+    private _pushFilterBelowGraphJoin;
+    /**
+     * Fuse intersected pattern match operations into a single combined
+     * pattern when they share variables or graph context.
+     */
+    private _fuseJoinPattern;
+    private _mergeVectorThresholds;
+    private _vectorsClose;
+    private _reorderIntersect;
+    private _reorderFusionSignals;
+    /**
+     * Compute graph-aware signal cost for fusion operator reordering.
+     * Graph operators get discounted costs when graph statistics are available
+     * because they can leverage graph indexes for faster execution.
+     */
+    private _graphAwareSignalCost;
+    private _applyIndexScan;
+    private _recurseGeneric;
+    private _recurseChildren;
+    private static _filterAppliesTo;
+}
+//# sourceMappingURL=optimizer.d.ts.map

package/dist/types/src/planner/optimizer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"optimizer.d.ts","sourceRoot":"","sources":["../../../../src/planner/optimizer.ts"],"names":[],"mappings":"AAwBA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,iBAAiB,CAAC;AACnD,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,6BAA6B,CAAC;AAChE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAsBrD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AAOxD,qBAAa,cAAc;IACzB,QAAQ,CAAC,KAAK,EAAE,UAAU,CAAC;IAC3B,QAAQ,CAAC,SAAS,EAAE,oBAAoB,CAAC;IACzC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAY;IACvC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAoB;IAChD,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAsB;IACpD,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAgB;gBAGzC,KAAK,EAAE,UAAU,EACjB,IAAI,CAAC,EAAE;QACL,WAAW,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAAC;QACvC,YAAY,CAAC,EAAE,YAAY,CAAC;QAC5B,SAAS,CAAC,EAAE,MAAM,CAAC;QACnB,UAAU,CAAC,EAAE,UAAU,CAAC;KACzB;IAaH,QAAQ,CAAC,EAAE,EAAE,QAAQ,GAAG,QAAQ;IAmBhC,OAAO,CAAC,gBAAgB;IAwFxB,OAAO,CAAC,gBAAgB;IA2BxB,OAAO,CAAC,MAAM,CAAC,gBAAgB;IAW/B,OAAO,CAAC,gBAAgB;IA+BxB;;;;;OAKG;IACH,OAAO,CAAC,wBAAwB;IA0EhC;;;OAGG;IACH,OAAO,CAAC,uBAAuB;IA8D/B;;;OAGG;IACH,OAAO,CAAC,yBAAyB;IA+DjC;;;OAGG;IACH,OAAO,CAAC,gBAAgB;IA4DxB,OAAO,CAAC,sBAAsB;IA+C9B,OAAO,CAAC,aAAa;IAYrB,OAAO,CAAC,iBAAiB;IAkBzB,OAAO,CAAC,qBAAqB;IAqB7B;;;;OAIG;IACH,OAAO,CAAC,qBAAqB;IAmD7B,OAAO,CAAC,eAAe;IAiCvB,OAAO,CAAC,eAAe;IAqBvB,OAAO,CAAC,gBAAgB;IAuExB,OAAO,CAAC,MAAM,CAAC,gBAAgB;CAgBhC"}

package/dist/types/src/planner/parallel.d.ts

@@ -0,0 +1,43 @@
+import type { PostingList } from "../core/posting-list.js";
+import type { ExecutionContext } from "../operators/base.js";
+import type { Operator } from "../operators/base.js";
+/**
+ * Executes multiple independent operator branches.
+ *
+ * The current implementation runs branches sequentially on the main thread.
+ * When Web Worker support is added, branches will be dispatched to a pool
+ * of workers for true parallelism.
+ */
+export declare class ParallelExecutor {
+    private readonly _maxWorkers;
+    private _shutdown;
+    /**
+     * @param maxWorkers  Maximum number of concurrent workers (reserved for
+     *                    future Web Worker support; currently unused).
+     */
+    constructor(maxWorkers?: number);
+    /**
+     * Whether parallel execution is actually enabled.
+     * Returns false in the current sequential implementation.
+     */
+    get enabled(): boolean;
+    /**
+     * Execute each operator independently and return their results.
+     *
+     * In the sequential implementation, operators are executed one after
+     * another on the main thread.
+     *
+     * @param operators Array of independent operators to execute.
+     * @param context   The shared execution context.
+     * @returns         Array of PostingList results, one per operator.
+     */
+    executeBranches(operators: Operator[], context: ExecutionContext): PostingList[];
+    /**
+     * Release all resources.
+     *
+     * In the sequential implementation this is a no-op but it marks the
+     * executor as shut down to prevent further use.
+     */
+    shutdown(): void;
+}
+//# sourceMappingURL=parallel.d.ts.map

package/dist/types/src/planner/parallel.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parallel.d.ts","sourceRoot":"","sources":["../../../../src/planner/parallel.ts"],"names":[],"mappings":"AAgBA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,yBAAyB,CAAC;AAC3D,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAC7D,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,sBAAsB,CAAC;AAMrD;;;;;;GAMG;AACH,qBAAa,gBAAgB;IAC3B,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAS;IACrC,OAAO,CAAC,SAAS,CAAkB;IAEnC;;;OAGG;gBACS,UAAU,SAAI;IAI1B;;;OAGG;IACH,IAAI,OAAO,IAAI,OAAO,CAIrB;IAED;;;;;;;;;OASG;IACH,eAAe,CAAC,SAAS,EAAE,QAAQ,EAAE,EAAE,OAAO,EAAE,gBAAgB,GAAG,WAAW,EAAE;IAYhF;;;;;OAKG;IACH,QAAQ,IAAI,IAAI;CAGjB"}

package/dist/types/src/scoring/bayesian-bm25.d.ts

@@ -0,0 +1,22 @@
+import type { IndexStats } from "../core/types.js";
+import type { BM25Params } from "./bm25.js";
+import { BM25Scorer } from "./bm25.js";
+export interface BayesianBM25Params {
+    readonly bm25: BM25Params;
+    readonly alpha: number;
+    readonly beta: number;
+    readonly baseRate: number;
+}
+export declare function createBayesianBM25Params(opts?: Partial<BayesianBM25Params>): BayesianBM25Params;
+export declare class BayesianBM25Scorer {
+    private readonly _bm25;
+    private readonly _transform;
+    constructor(params: BayesianBM25Params, indexStats: IndexStats);
+    get bm25(): BM25Scorer;
+    idf(docFreq: number): number;
+    score(termFreq: number, docLength: number, docFreq: number): number;
+    scoreWithIdf(termFreq: number, docLength: number, idfVal: number): number;
+    combineScores(scores: number[]): number;
+    upperBound(docFreq: number): number;
+}
+//# sourceMappingURL=bayesian-bm25.d.ts.map

package/dist/types/src/scoring/bayesian-bm25.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bayesian-bm25.d.ts","sourceRoot":"","sources":["../../../../src/scoring/bayesian-bm25.ts"],"names":[],"mappings":"AAcA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAC5C,OAAO,EAAE,UAAU,EAAoB,MAAM,WAAW,CAAC;AAEzD,MAAM,WAAW,kBAAkB;IACjC,QAAQ,CAAC,IAAI,EAAE,UAAU,CAAC;IAC1B,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;IACvB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC3B;AAED,wBAAgB,wBAAwB,CACtC,IAAI,CAAC,EAAE,OAAO,CAAC,kBAAkB,CAAC,GACjC,kBAAkB,CAOpB;AAED,qBAAa,kBAAkB;IAC7B,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAa;IACnC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAA+B;gBAE9C,MAAM,EAAE,kBAAkB,EAAE,UAAU,EAAE,UAAU;IAS9D,IAAI,IAAI,IAAI,UAAU,CAErB;IAED,GAAG,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;IAI5B,KAAK,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM;IAInE,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM;IAOzE,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM;IAMvC,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;CAIpC"}

package/dist/types/src/scoring/bm25.d.ts

@@ -0,0 +1,20 @@
+import type { IndexStats } from "../core/types.js";
+export interface BM25Params {
+    readonly k1: number;
+    readonly b: number;
+    readonly boost: number;
+}
+export declare function createBM25Params(opts?: Partial<BM25Params>): BM25Params;
+export declare class BM25Scorer {
+    private readonly _params;
+    private readonly _totalDocs;
+    private readonly _avgDocLength;
+    constructor(params: BM25Params, indexStats: IndexStats);
+    get params(): BM25Params;
+    idf(docFreq: number): number;
+    score(termFreq: number, docLength: number, docFreq: number): number;
+    scoreWithIdf(termFreq: number, docLength: number, idfVal: number): number;
+    combineScores(scores: number[]): number;
+    upperBound(docFreq: number): number;
+}
+//# sourceMappingURL=bm25.d.ts.map

package/dist/types/src/scoring/bm25.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bm25.d.ts","sourceRoot":"","sources":["../../../../src/scoring/bm25.ts"],"names":[],"mappings":"AAYA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,kBAAkB,CAAC;AAEnD,MAAM,WAAW,UAAU;IACzB,QAAQ,CAAC,EAAE,EAAE,MAAM,CAAC;IACpB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAC;IACnB,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;CACxB;AAED,wBAAgB,gBAAgB,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,UAAU,CAAC,GAAG,UAAU,CAMvE;AAED,qBAAa,UAAU;IACrB,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAa;IACrC,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAS;IACpC,OAAO,CAAC,QAAQ,CAAC,aAAa,CAAS;gBAE3B,MAAM,EAAE,UAAU,EAAE,UAAU,EAAE,UAAU;IAMtD,IAAI,MAAM,IAAI,UAAU,CAEvB;IAED,GAAG,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;IAK5B,KAAK,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,GAAG,MAAM;IAInE,YAAY,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM;IAQzE,aAAa,CAAC,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM;IAQvC,UAAU,CAAC,OAAO,EAAE,MAAM,GAAG,MAAM;CAGpC"}

package/dist/types/src/scoring/calibration.d.ts

@@ -0,0 +1,68 @@
+/**
+ * Calibration diagnostics for evaluating how well predicted relevance
+ * probabilities match actual relevance rates.
+ *
+ * Provides log loss, expected calibration error (ECE), Brier score,
+ * full calibration reports, and reliability diagram data.
+ */
+export declare class CalibrationMetrics {
+    /**
+     * Negative log-likelihood (log loss).
+     *
+     * Strictly proper scoring rule that penalizes the probabilistic
+     * model directly. Lower is better.
+     *
+     * L = -(1/N) * sum[ y_i * log(p_i) + (1 - y_i) * log(1 - p_i) ]
+     *
+     * @param probabilities - Predicted probabilities in (0, 1).
+     * @param labels - Binary relevance labels (0 or 1).
+     * @returns Log loss value.
+     */
+    static logLoss(probabilities: number[], labels: number[]): number;
+    /**
+     * Expected Calibration Error.
+     *
+     * Measures how well predicted probabilities match actual relevance
+     * rates. Lower is better. Perfect calibration = 0.
+     *
+     * @param probabilities - Predicted probabilities.
+     * @param labels - Binary relevance labels.
+     * @param nBins - Number of bins for bucketing (default 10).
+     * @returns ECE value.
+     */
+    static ece(probabilities: number[], labels: number[], nBins?: number): number;
+    /**
+     * Brier score: mean squared error between probabilities and labels.
+     *
+     * Decomposes into calibration + discrimination. Lower is better.
+     *
+     * @param probabilities - Predicted probabilities.
+     * @param labels - Binary relevance labels.
+     * @returns Brier score value.
+     */
+    static brier(probabilities: number[], labels: number[]): number;
+    /**
+     * Full calibration diagnostic report.
+     *
+     * Returns a dict with keys: ece, brier, nSamples, nBins, reliability,
+     * and any additional diagnostics from the bayesian_bm25 package.
+     *
+     * @param probabilities - Predicted probabilities.
+     * @param labels - Binary relevance labels.
+     * @param nBins - Number of bins (default 10).
+     * @returns Calibration report dict.
+     */
+    static report(probabilities: number[], labels: number[], nBins?: number): Record<string, unknown>;
+    /**
+     * Compute reliability diagram data: (avgPredicted, avgActual, count) per bin.
+     *
+     * Perfect calibration means avgPredicted == avgActual for every bin.
+     *
+     * @param probabilities - Predicted probabilities.
+     * @param labels - Binary relevance labels.
+     * @param nBins - Number of bins (default 10).
+     * @returns Array of [avgPredicted, avgActual, count] tuples.
+     */
+    static reliabilityDiagram(probabilities: number[], labels: number[], nBins?: number): [number, number, number][];
+}
+//# sourceMappingURL=calibration.d.ts.map

package/dist/types/src/scoring/calibration.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"calibration.d.ts","sourceRoot":"","sources":["../../../../src/scoring/calibration.ts"],"names":[],"mappings":"AAyBA;;;;;;GAMG;AAEH,qBAAa,kBAAkB;IAC7B;;;;;;;;;;;OAWG;IACH,MAAM,CAAC,OAAO,CAAC,aAAa,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM;IAYjE;;;;;;;;;;OAUG;IACH,MAAM,CAAC,GAAG,CAAC,aAAa,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,KAAK,SAAK,GAAG,MAAM;IAIzE;;;;;;;;OAQG;IACH,MAAM,CAAC,KAAK,CAAC,aAAa,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,MAAM;IAI/D;;;;;;;;;;OAUG;IACH,MAAM,CAAC,MAAM,CACX,aAAa,EAAE,MAAM,EAAE,EACvB,MAAM,EAAE,MAAM,EAAE,EAChB,KAAK,SAAK,GACT,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;IAY1B;;;;;;;;;OASG;IACH,MAAM,CAAC,kBAAkB,CACvB,aAAa,EAAE,MAAM,EAAE,EACvB,MAAM,EAAE,MAAM,EAAE,EAChB,KAAK,SAAK,GACT,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,EAAE;CAG9B"}