@quereus/quereus 4.4.1 → 4.5.0

package/dist/src/planner/rules/access/rule-key-set-seek.js

@@ -0,0 +1,408 @@
+/**
+ * Rule: Key-set seek — materialize the semi-join key set, then seek the target with it
+ *
+ * Pattern (anchored on the physical hash semi join `join-physical-selection` builds):
+ *
+ *   BloomJoinNode (semi, exactly one equi-pair, no residual)
+ *     ├─ left:  (FilterNode | trivial ProjectNode | AliasNode)*
+ *     │           over  SeqScan(fullScan) | ordering-only IndexScan(plan=0)
+ *     └─ right: uncorrelated, deterministic, side-effect-free key source
+ *
+ * On a successful match the left chain is rebuilt with the leaf replaced by a
+ * `KeySetSemiJoinNode(leaf, right)` — the semi join slides below the peeled
+ * wrappers (a filter and a semi-filter commute; a trivial Project / Alias
+ * preserves rows and attribute ids):
+ *
+ *   HashJoin(semi, Project(Filter(leaf)), right)
+ *     →  Project(Filter(KeySetSemiJoin(leaf, right)))
+ *
+ * The new node ALWAYS builds the key set and ALWAYS probes each target row
+ * against it — the runtime pushdown only changes how many rows the target
+ * emits, so a skipped or over-fetching seek can cost performance but never
+ * correctness. Every gate below exists to make an UNDER-fetch (rows the seek
+ * fails to return, which the probe cannot resurrect) impossible.
+ *
+ * The rule declines (returns null, keeping the hash semi join) on all of:
+ *   - join type ≠ semi, >1 equi-pair, or a residual condition
+ *   - a correlated, non-deterministic, or side-effect-bearing key source
+ *   - side effects anywhere in the left chain
+ *   - any non-peelable node between the join and the access leaf
+ *   - a leaf that is not an unconstrained every-row walk — pushed constraints
+ *     / limit / offset mean replacing its FilterInfo would silently drop the
+ *     module-enforced predicates or directives
+ *     (backlog/feat-key-set-seek-over-pushed-constraints)
+ *   - a leaf whose emission order absorbed a SortNode (`orderingLoadBearing`):
+ *     the dropped Sort's order now rides the leaf's walk order through the
+ *     order-preserving hash join, and a pushed multi-seek would emit in
+ *     seek-key order instead
+ *   - target/key logical types that differ (a cross-type seek key can miss
+ *     rows `=` considers equal — backlog/feat-key-set-seek-cross-type-keys)
+ *   - a semantic-ordering key type ('PT1H' ≡ 'PT60M' but byte-distinct: a
+ *     raw-value seek under-fetches)
+ *   - a collation cover that is MISMATCH_UNSAFE (a finer index under-fetches;
+ *     a BINARY join over a coarser index is admitted — the probe trims the
+ *     over-fetch)
+ *   - the module declining either runtime-set probe, naming different indexes
+ *     across them, claiming a composite seek, attaching a JS residualFilter,
+ *     or naming an index the engine cannot resolve / whose leading key column
+ *     is not the seek column
+ *   - the module answering a synthesized probe with a plan `validateAccessPlan`
+ *     rejects (a module bug — logged, then declined like any other gate rather
+ *     than failing a query the user's own predicate would have run fine)
+ *   - a break-even of zero (the module's own costs say a scan wins at every
+ *     key count)
+ *
+ * NOTE: the three `getBestAccessPlan` probes run on every qualifying hash semi
+ * join optimization, uncached. Cheap for both shipped modules; if a third-party
+ * module with an expensive planner ever shows up in optimization profiles,
+ * memoize by (table, seek column).
+ *
+ * NOTE: the `orderingLoadBearing` decline is conservative — a future enhancement
+ * could re-sort the pushed output by the leaf's advertised order, or push when
+ * the seek index IS the walk index (see
+ * `backlog/feat-key-set-seek-merge-semi-join`).
+ */
+import { createLogger } from '../../../common/logger.js';
+import { isRelationalNode } from '../../nodes/plan-node.js';
+import { BloomJoinNode } from '../../nodes/bloom-join-node.js';
+import { KeySetSemiJoinNode, RUNTIME_SET_MAX_KEYS } from '../../nodes/key-set-semi-join-node.js';
+import { SeqScanNode, IndexScanNode } from '../../nodes/table-access-nodes.js';
+import { AliasNode } from '../../nodes/alias-node.js';
+import { ProjectNode } from '../../nodes/project-node.js';
+import { FilterNode } from '../../nodes/filter.js';
+import { ColumnReferenceNode } from '../../nodes/reference.js';
+import { PlanNodeCharacteristics } from '../../framework/characteristics.js';
+import { isCorrelatedSubquery } from '../../cache/correlation-detector.js';
+import { hasSemanticOrdering, normalizeCollationName } from '../../../util/comparison.js';
+import { effectiveCollationOfTypes } from '../../analysis/comparison-collation.js';
+import { classifyConstraintCover } from './rule-select-access-path.js';
+import { resolveIndexDescriptor } from '../../../vtab/index-descriptor.js';
+import { validateAccessPlan, } from '../../../vtab/best-access-plan.js';
+const log = createLogger('optimizer:rule:key-set-seek');
+/**
+ * A Project is "trivial" iff every projection is a bare ColumnReferenceNode —
+ * it preserves row count, order, and attribute ids, so the semi join commutes
+ * below it. Same predicate as `rule-monotonic-limit-pushdown`.
+ */
+function isTrivialProject(project) {
+    return project.projections.every(p => p.node instanceof ColumnReferenceNode);
+}
+/**
+ * Walk down from `chainRoot` toward the access leaf, descending only through
+ * Alias / trivial Project / Filter wrappers (each commutes with a semi join).
+ * Returns null when anything else appears before an admissible leaf.
+ */
+function peelToLeaf(chainRoot) {
+    let cursor = chainRoot;
+    let safety = 16;
+    while (safety-- > 0) {
+        if (cursor instanceof SeqScanNode || cursor instanceof IndexScanNode)
+            return cursor;
+        if (cursor instanceof AliasNode) {
+            cursor = cursor.source;
+            continue;
+        }
+        if (cursor instanceof ProjectNode && isTrivialProject(cursor)) {
+            cursor = cursor.source;
+            continue;
+        }
+        if (cursor instanceof FilterNode) {
+            cursor = cursor.source;
+            continue;
+        }
+        return null;
+    }
+    return null;
+}
+/**
+ * Rebuild the chain `chainRoot → … → oldLeaf` with `oldLeaf` replaced by
+ * `newLeaf`, reconstructing each intermediate node via `withChildren` (same
+ * shape as `rule-monotonic-limit-pushdown`'s rebuildChain).
+ */
+function rebuildChain(chainRoot, oldLeaf, newLeaf) {
+    if (chainRoot === oldLeaf) {
+        return newLeaf;
+    }
+    const newChildren = chainRoot.getChildren().map(child => isRelationalNode(child) ? rebuildChain(child, oldLeaf, newLeaf) : child);
+    return chainRoot.withChildren(newChildren);
+}
+/**
+ * Structural + purity admission of the join itself: a single-pair, residual-free
+ * hash SEMI join whose key source may be drained exactly once (uncorrelated,
+ * deterministic, pure) and whose probe chain carries no write.
+ */
+function admitJoin(node) {
+    if (node.joinType !== 'semi')
+        return false;
+    if (node.equiPairs.length !== 1)
+        return false;
+    if (node.residualCondition !== undefined)
+        return false;
+    // The key source is drained exactly once; a correlated, impure, or
+    // non-deterministic source must keep its per-execution semantics. Same
+    // admission test as the set probe and the decorrelation rule.
+    if (PlanNodeCharacteristics.subtreeHasSideEffects(node.right)) {
+        log('decline: key source has side effects');
+        return false;
+    }
+    if (!PlanNodeCharacteristics.isDeterministic(node.right)) {
+        log('decline: key source is non-deterministic');
+        return false;
+    }
+    if (isCorrelatedSubquery(node.right)) {
+        log('decline: key source is correlated');
+        return false;
+    }
+    // The left chain is re-rooted below its wrappers — refuse to touch a chain
+    // carrying a write.
+    if (PlanNodeCharacteristics.subtreeHasSideEffects(node.left)) {
+        log('decline: left chain has side effects');
+        return false;
+    }
+    return true;
+}
+/**
+ * The probe-side access leaf, when it is one whose `FilterInfo` may be replaced
+ * wholesale at runtime.
+ *
+ * It must read every row with nothing pushed into it: a plain full scan, or an
+ * ordering-only index walk (plan=0) — which reads every row exactly like a full
+ * scan and differs only in emission order, a property nothing above this hash
+ * join could depend on (BloomJoinNode propagates no ordering). A leaf already
+ * carrying pushed constraints had its residual Filter dropped on the module's
+ * promise to enforce them; replacing its FilterInfo with our multi-seek would
+ * silently drop those predicates
+ * (backlog/feat-key-set-seek-over-pushed-constraints). A pushed limit / offset
+ * is likewise a directive the multi-seek would not honor.
+ */
+function admitLeaf(left) {
+    const leaf = peelToLeaf(left);
+    if (!leaf) {
+        log('decline: left does not peel to an access leaf through Alias/Project/Filter');
+        return null;
+    }
+    const fi = leaf.filterInfo;
+    const isEveryRowWalk = fi.accessPath?.kind === 'fullScan'
+        || (fi.accessPath?.kind === 'index' && fi.accessPath.plan === 'scan');
+    if (!isEveryRowWalk || fi.constraints.length !== 0
+        || fi.limit !== undefined || fi.offset !== undefined) {
+        log('decline: leaf is not an unconstrained every-row walk');
+        return null;
+    }
+    // A leaf whose emission order absorbed a SortNode (sort absorption in
+    // rule-grow-retrieve, before this join existed) is the only thing producing
+    // the query's ORDER BY: the hash semi join preserves probe order at
+    // runtime, but a pushed multi-seek emits in seek-key order. Declining keeps
+    // the order-preserving hash join.
+    if (leaf instanceof IndexScanNode && leaf.orderingLoadBearing) {
+        log('decline: leaf emission order is load-bearing (absorbed a Sort)');
+        return null;
+    }
+    return leaf;
+}
+/**
+ * Resolve the equi-pair to a target column index, then apply the two type gates
+ * that keep a raw-value seek from under-fetching.
+ */
+function resolveSeekColumns(leaf, right, leftAttrId, rightAttrId) {
+    // Join key → table column index. A TableAccessNode's attributes are the
+    // table reference's, positionally 1:1 with tableSchema.columns.
+    const seekCol = leaf.getAttributeIndex().get(leftAttrId) ?? -1;
+    if (seekCol === -1) {
+        log('decline: join key attr %d is not a leaf column', leftAttrId);
+        return null;
+    }
+    const keyIdx = right.getAttributeIndex().get(rightAttrId) ?? -1;
+    if (keyIdx === -1) {
+        log('decline: join key attr %d is not a key-source column', rightAttrId);
+        return null;
+    }
+    const targetType = leaf.getAttributes()[seekCol].type;
+    const keyType = right.getAttributes()[keyIdx].type;
+    // Identical logical types only. A cross-type set (INTEGER column, REAL
+    // keys) would be encoded into seek keys that miss rows `=` considers equal,
+    // and the probe cannot resurrect a row the seek never returned.
+    if (targetType.logicalType.name !== keyType.logicalType.name) {
+        log('decline: logical types differ (%s vs %s)', targetType.logicalType.name, keyType.logicalType.name);
+        return null;
+    }
+    // Semantic-ordering types ('PT1H' equals 'PT60M' but is byte-distinct): a
+    // raw-value seek under-fetches. The store module declines these itself —
+    // gate in the engine too, so the guarantee does not depend on which module
+    // answered.
+    if (hasSemanticOrdering(targetType.logicalType) || hasSemanticOrdering(keyType.logicalType)) {
+        log('decline: semantic-ordering key type %s', targetType.logicalType.name);
+        return null;
+    }
+    return { seekCol, targetType, keyType };
+}
+/** Build the probe request `createIndexBasedAccess` would (identical `columns` mapping). */
+function buildProbeRequest(tableSchema, tableRows, filters) {
+    return {
+        columns: tableSchema.columns.map((col, index) => ({
+            index,
+            name: col.name,
+            type: col.logicalType,
+            isPrimaryKey: col.primaryKey || false,
+            isUnique: col.primaryKey || false,
+        })),
+        filters,
+        estimatedRows: tableRows,
+    };
+}
+/** A seek probe's claim, when the module accepted the runtime-set filter cleanly. */
+function claimedIndex(plan, seekCol) {
+    if (plan.handledFilters[0] !== true)
+        return null;
+    if (!plan.indexName)
+        return null;
+    if (!plan.seekColumnIndexes || plan.seekColumnIndexes.length !== 1 || plan.seekColumnIndexes[0] !== seekCol) {
+        // A composite claim is declined too: sorting by single-column SQL value
+        // order equals index-key order only for a single key column.
+        return null;
+    }
+    // A module-supplied JS residual has no place to run in this path.
+    if (plan.residualFilter)
+        return null;
+    return plan.indexName;
+}
+/**
+ * The module's answers to the three synthesized requests: its cost for a
+ * runtime-set seek at two key counts (2 and the engine ceiling) plus its plain
+ * scan cost. `maxCount` 2 rather than 1 keeps the two seek points distinct so
+ * the cost slope is well defined.
+ *
+ * These requests are the ENGINE's, not the user's: a module that answers one
+ * with a plan `validateAccessPlan` rejects gets logged and declined, leaving the
+ * hash semi join — the same disposition as every other gate. Failing the query
+ * instead would let a synthesized probe break a predicate that ran fine before.
+ */
+function probeModuleCosts(context, leaf, seekCol, keyRowsEstimate) {
+    const tableSchema = leaf.tableSchema;
+    const vtabModule = leaf.source.vtabModule;
+    const getBestAccessPlan = vtabModule.getBestAccessPlan;
+    if (typeof getBestAccessPlan !== 'function') {
+        log('decline: module has no getBestAccessPlan');
+        return null;
+    }
+    const tableRows = leaf.source.estimatedRows || undefined;
+    // Advisory count estimate, clamped into the ceiling `validateAccessPlanRequest` demands.
+    const runtimeSetFilter = (maxCount) => ({
+        columnIndex: seekCol,
+        op: 'IN',
+        usable: true,
+        runtimeSet: {
+            maxCount,
+            ...(keyRowsEstimate !== undefined
+                ? { estimatedCount: Math.min(maxCount, Math.max(0, Math.floor(keyRowsEstimate))) }
+                : {}),
+        },
+    });
+    const ask = (filters) => {
+        const request = buildProbeRequest(tableSchema, tableRows, filters);
+        const plan = getBestAccessPlan.call(vtabModule, context.db, tableSchema, request);
+        validateAccessPlan(request, plan);
+        return plan;
+    };
+    try {
+        return {
+            seekAt2: ask([runtimeSetFilter(2)]),
+            seekAtMax: ask([runtimeSetFilter(RUNTIME_SET_MAX_KEYS)]),
+            scan: ask([]),
+        };
+    }
+    catch (e) {
+        log('decline: module %s answered a synthesized runtime-set probe on %s with an invalid plan: %s', tableSchema.vtabModuleName, tableSchema.name, e instanceof Error ? e.message : String(e));
+        return null;
+    }
+}
+/**
+ * Turn the module's probe answers into the runtime pushdown, or null when any
+ * claim gate fails.
+ */
+function planPushdown(context, leaf, right, cols) {
+    const costs = probeModuleCosts(context, leaf, cols.seekCol, right.estimatedRows);
+    if (!costs)
+        return null;
+    const indexAt2 = claimedIndex(costs.seekAt2, cols.seekCol);
+    const indexAtMax = claimedIndex(costs.seekAtMax, cols.seekCol);
+    if (!indexAt2 || !indexAtMax || indexAt2 !== indexAtMax) {
+        log('decline: module did not claim the runtime set on one index (A=%s, B=%s)', indexAt2, indexAtMax);
+        return null;
+    }
+    // Structured identity of the claimed index. An unresolved path declines —
+    // order-sensitive consumers (the isolation overlay merge) must be able to
+    // trust the accessPath this node stamps.
+    const descriptor = resolveIndexDescriptor(leaf.tableSchema, costs.seekAt2, indexAt2);
+    if (!descriptor) {
+        log('decline: index %s cannot be resolved to a descriptor', indexAt2);
+        return null;
+    }
+    if (descriptor.keyColumns[0].columnIndex !== cols.seekCol) {
+        // A module naming an index whose leading column is something else has
+        // answered a different question.
+        log('decline: index %s leading key column %d is not the seek column %d', indexAt2, descriptor.keyColumns[0].columnIndex, cols.seekCol);
+        return null;
+    }
+    // Collation cover: the join comparison collation (the same resolution
+    // emitBloomJoin makes, so the seek and the probe agree) against the index's
+    // leading key column collation. MATCH = exact seek; COARSER_SAFE (BINARY
+    // join over a non-BINARY index) over-fetches a superset the probe trims;
+    // MISMATCH_UNSAFE (a finer index) under-fetches — decline.
+    const joinCollation = normalizeCollationName(effectiveCollationOfTypes(cols.targetType, cols.keyType));
+    const indexCollation = normalizeCollationName(descriptor.keyColumns[0].collation ?? 'BINARY');
+    if (classifyConstraintCover(joinCollation, indexCollation, /*isEquality*/ true, false) === 'MISMATCH_UNSAFE') {
+        log('decline: collation cover unsafe (join %s vs index %s)', joinCollation, indexCollation);
+        return null;
+    }
+    const breakEvenKeys = interpolateBreakEven(costs);
+    if (breakEvenKeys < 1) {
+        log('decline: scan beats a seek at every key count (breakEven=%d)', breakEvenKeys);
+        return null;
+    }
+    return {
+        indexName: indexAt2,
+        accessPath: { kind: 'index', index: descriptor, plan: 'multiSeek' },
+        seekColumnIndex: cols.seekCol,
+        seekDescending: descriptor.keyColumns[0].desc === true,
+        maxKeys: RUNTIME_SET_MAX_KEYS,
+        breakEvenKeys,
+    };
+}
+/**
+ * The distinct key count at which the module's own seek cost overtakes its scan
+ * cost. Interpolates the seek cost as a linear function of key count through the
+ * two probe points and solves against the scan cost. The linear fit is an
+ * approximation, but it is the MODULE's approximation — cost authority stays
+ * with the module rather than a second cost model living in the optimizer.
+ *
+ * A flat-or-falling seek cost (`slope <= 0`) never overtakes the scan, so the
+ * engine ceiling becomes the threshold. A scan cheaper than a two-key seek
+ * interpolates below 1 and the caller declines.
+ */
+function interpolateBreakEven(costs) {
+    const slope = (costs.seekAtMax.cost - costs.seekAt2.cost) / (RUNTIME_SET_MAX_KEYS - 2);
+    if (slope <= 0)
+        return RUNTIME_SET_MAX_KEYS;
+    return Math.max(0, Math.min(RUNTIME_SET_MAX_KEYS, Math.floor(2 + (costs.scan.cost - costs.seekAt2.cost) / slope)));
+}
+export function ruleKeySetSeek(node, context) {
+    if (!(node instanceof BloomJoinNode))
+        return null;
+    if (!admitJoin(node))
+        return null;
+    const leaf = admitLeaf(node.left);
+    if (!leaf)
+        return null;
+    const pair = node.equiPairs[0];
+    const cols = resolveSeekColumns(leaf, node.right, pair.leftAttrId, pair.rightAttrId);
+    if (!cols)
+        return null;
+    const pushdown = planPushdown(context, leaf, node.right, cols);
+    if (!pushdown)
+        return null;
+    const keySetJoin = new KeySetSemiJoinNode(node.scope, leaf, node.right, pair.leftAttrId, pair.rightAttrId, pushdown);
+    log('Replaced hash semi join with KeySetSemiJoin on %s.%s via %s (breakEven=%d)', leaf.tableSchema.name, leaf.tableSchema.columns[cols.seekCol]?.name, pushdown.indexName, pushdown.breakEvenKeys);
+    return rebuildChain(node.left, leaf, keySetJoin);
+}
+//# sourceMappingURL=rule-key-set-seek.js.map

package/dist/src/planner/rules/access/rule-key-set-seek.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"rule-key-set-seek.js","sourceRoot":"","sources":["../../../../../src/planner/rules/access/rule-key-set-seek.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+DG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAEzD,OAAO,EAAE,gBAAgB,EAAE,MAAM,0BAA0B,CAAC;AAE5D,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,EAAE,kBAAkB,EAAE,oBAAoB,EAA8C,MAAM,uCAAuC,CAAC;AAC7I,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAC/E,OAAO,EAAE,SAAS,EAAE,MAAM,2BAA2B,CAAC;AACtD,OAAO,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAC1D,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,mBAAmB,EAAE,MAAM,0BAA0B,CAAC;AAC/D,OAAO,EAAE,uBAAuB,EAAE,MAAM,oCAAoC,CAAC;AAC7E,OAAO,EAAE,oBAAoB,EAAE,MAAM,qCAAqC,CAAC;AAC3E,OAAO,EAAE,mBAAmB,EAAE,sBAAsB,EAAE,MAAM,6BAA6B,CAAC;AAC1F,OAAO,EAAE,yBAAyB,EAAE,MAAM,wCAAwC,CAAC;AACnF,OAAO,EAAE,uBAAuB,EAAE,MAAM,8BAA8B,CAAC;AACvE,OAAO,EAAE,sBAAsB,EAAE,MAAM,mCAAmC,CAAC;AAC3E,OAAO,EACN,kBAAkB,GAKlB,MAAM,mCAAmC,CAAC;AAI3C,MAAM,GAAG,GAAG,YAAY,CAAC,6BAA6B,CAAC,CAAC;AAExD;;;;GAIG;AACH,SAAS,gBAAgB,CAAC,OAAoB;IAC7C,OAAO,OAAO,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,YAAY,mBAAmB,CAAC,CAAC;AAC9E,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,SAA6B;IAChD,IAAI,MAAM,GAAuB,SAAS,CAAC;IAC3C,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,OAAO,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;QACrB,IAAI,MAAM,YAAY,WAAW,IAAI,MAAM,YAAY,aAAa;YAAE,OAAO,MAAM,CAAC;QACpF,IAAI,MAAM,YAAY,SAAS,EAAE,CAAC;YACjC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;YACvB,SAAS;QACV,CAAC;QACD,IAAI,MAAM,YAAY,WAAW,IAAI,gBAAgB,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/D,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;YACvB,SAAS;QACV,CAAC;QACD,IAAI,MAAM,YAAY,UAAU,EAAE,CAAC;YAClC,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC;YACvB,SAAS;QACV,CAAC;QACD,OAAO,IAAI,CAAC;IACb,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,YAAY,CACpB,SAA6B,EAC7B,OAAyB,EACzB,OAA2B;IAE3B,IAAI,SAAS,KAAM,OAAyC,EAAE,CAAC;QAC9D,OAAO,OAAO,CAAC;IAChB,CAAC;IACD,MAAM,WAAW,GAAe,SAAS,CAAC,WAAW,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CACnE,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1E,OAAO,SAAS,CAAC,YAAY,CAAC,WAAW,CAAuB,CAAC;AAClE,CAAC;AAED;;;;GAIG;AACH,SAAS,SAAS,CAAC,IAAmB;IACrC,IAAI,IAAI,CAAC,QAAQ,KAAK,MAAM;QAAE,OAAO,KAAK,CAAC;IAC3C,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAC9C,IAAI,IAAI,CAAC,iBAAiB,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAEvD,mEAAmE;IACnE,uEAAuE;IACvE,8DAA8D;IAC9D,IAAI,uBAAuB,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/D,GAAG,CAAC,sCAAsC,CAAC,CAAC;QAC5C,OAAO,KAAK,CAAC;IACd,CAAC;IACD,IAAI,CAAC,uBAAuB,CAAC,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1D,GAAG,CAAC,0CAA0C,CAAC,CAAC;QAChD,OAAO,KAAK,CAAC;IACd,CAAC;IACD,IAAI,oBAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;QACtC,GAAG,CAAC,mCAAmC,CAAC,CAAC;QACzC,OAAO,KAAK,CAAC;IACd,CAAC;IACD,2EAA2E;IAC3E,oBAAoB;IACpB,IAAI,uBAAuB,CAAC,qBAAqB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9D,GAAG,CAAC,sCAAsC,CAAC,CAAC;QAC5C,OAAO,KAAK,CAAC;IACd,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,SAAS,SAAS,CAAC,IAAwB;IAC1C,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,CAAC,IAAI,EAAE,CAAC;QACX,GAAG,CAAC,4EAA4E,CAAC,CAAC;QAClF,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC;IAC3B,MAAM,cAAc,GAAG,EAAE,CAAC,UAAU,EAAE,IAAI,KAAK,UAAU;WACrD,CAAC,EAAE,CAAC,UAAU,EAAE,IAAI,KAAK,OAAO,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;IACvE,IAAI,CAAC,cAAc,IAAI,EAAE,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC;WAC9C,EAAE,CAAC,KAAK,KAAK,SAAS,IAAI,EAAE,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QACvD,GAAG,CAAC,sDAAsD,CAAC,CAAC;QAC5D,OAAO,IAAI,CAAC;IACb,CAAC;IAED,sEAAsE;IACtE,4EAA4E;IAC5E,oEAAoE;IACpE,4EAA4E;IAC5E,kCAAkC;IAClC,IAAI,IAAI,YAAY,aAAa,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC/D,GAAG,CAAC,gEAAgE,CAAC,CAAC;QACtE,OAAO,IAAI,CAAC;IACb,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AASD;;;GAGG;AACH,SAAS,kBAAkB,CAC1B,IAAsB,EACtB,KAAyB,EACzB,UAAkB,EAClB,WAAmB;IAEnB,wEAAwE;IACxE,gEAAgE;IAChE,MAAM,OAAO,GAAG,IAAI,CAAC,iBAAiB,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/D,IAAI,OAAO,KAAK,CAAC,CAAC,EAAE,CAAC;QACpB,GAAG,CAAC,gDAAgD,EAAE,UAAU,CAAC,CAAC;QAClE,OAAO,IAAI,CAAC;IACb,CAAC;IACD,MAAM,MAAM,GAAG,KAAK,CAAC,iBAAiB,EAAE,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC;IAChE,IAAI,MAAM,KAAK,CAAC,CAAC,EAAE,CAAC;QACnB,GAAG,CAAC,sDAAsD,EAAE,WAAW,CAAC,CAAC;QACzE,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,CAAC,aAAa,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;IACtD,MAAM,OAAO,GAAG,KAAK,CAAC,aAAa,EAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC;IAEnD,uEAAuE;IACvE,4EAA4E;IAC5E,gEAAgE;IAChE,IAAI,UAAU,CAAC,WAAW,CAAC,IAAI,KAAK,OAAO,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAC9D,GAAG,CAAC,0CAA0C,EAAE,UAAU,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACvG,OAAO,IAAI,CAAC;IACb,CAAC;IACD,0EAA0E;IAC1E,yEAAyE;IACzE,2EAA2E;IAC3E,YAAY;IACZ,IAAI,mBAAmB,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,mBAAmB,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QAC7F,GAAG,CAAC,wCAAwC,EAAE,UAAU,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAC3E,OAAO,IAAI,CAAC;IACb,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC;AACzC,CAAC;AAED,4FAA4F;AAC5F,SAAS,iBAAiB,CACzB,WAAwB,EACxB,SAA6B,EAC7B,OAAuC;IAEvC,OAAO;QACN,OAAO,EAAE,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;YACjD,KAAK;YACL,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,IAAI,EAAE,GAAG,CAAC,WAAW;YACrB,YAAY,EAAE,GAAG,CAAC,UAAU,IAAI,KAAK;YACrC,QAAQ,EAAE,GAAG,CAAC,UAAU,IAAI,KAAK;SAClB,CAAA,CAAC;QACjB,OAAO;QACP,aAAa,EAAE,SAAS;KACxB,CAAC;AACH,CAAC;AAED,qFAAqF;AACrF,SAAS,YAAY,CAAC,IAA0B,EAAE,OAAe;IAChE,IAAI,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IACjD,IAAI,CAAC,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IACjC,IAAI,CAAC,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,iBAAiB,CAAC,CAAC,CAAC,KAAK,OAAO,EAAE,CAAC;QAC7G,wEAAwE;QACxE,6DAA6D;QAC7D,OAAO,IAAI,CAAC;IACb,CAAC;IACD,kEAAkE;IAClE,IAAI,IAAI,CAAC,cAAc;QAAE,OAAO,IAAI,CAAC;IACrC,OAAO,IAAI,CAAC,SAAS,CAAC;AACvB,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,gBAAgB,CACxB,OAAmB,EACnB,IAAsB,EACtB,OAAe,EACf,eAAmC;IAEnC,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;IACrC,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC;IAC1C,MAAM,iBAAiB,GAAG,UAAU,CAAC,iBAAiB,CAAC;IACvD,IAAI,OAAO,iBAAiB,KAAK,UAAU,EAAE,CAAC;QAC7C,GAAG,CAAC,0CAA0C,CAAC,CAAC;QAChD,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,aAAa,IAAI,SAAS,CAAC;IACzD,yFAAyF;IACzF,MAAM,gBAAgB,GAAG,CAAC,QAAgB,EAAuB,EAAE,CAAC,CAAC;QACpE,WAAW,EAAE,OAAO;QACpB,EAAE,EAAE,IAAI;QACR,MAAM,EAAE,IAAI;QACZ,UAAU,EAAE;YACX,QAAQ;YACR,GAAG,CAAC,eAAe,KAAK,SAAS;gBAChC,CAAC,CAAC,EAAE,cAAc,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC,CAAC,EAAE;gBAClF,CAAC,CAAC,EAAE,CAAC;SACN;KACD,CAAC,CAAC;IACH,MAAM,GAAG,GAAG,CAAC,OAAuC,EAAwB,EAAE;QAC7E,MAAM,OAAO,GAAG,iBAAiB,CAAC,WAAW,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;QACnE,MAAM,IAAI,GAAG,iBAAiB,CAAC,IAAI,CAAC,UAAU,EAAE,OAAO,CAAC,EAAE,EAAE,WAAW,EAAE,OAAO,CAAyB,CAAC;QAC1G,kBAAkB,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QAClC,OAAO,IAAI,CAAC;IACb,CAAC,CAAC;IAEF,IAAI,CAAC;QACJ,OAAO;YACN,OAAO,EAAE,GAAG,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,SAAS,EAAE,GAAG,CAAC,CAAC,gBAAgB,CAAC,oBAAoB,CAAC,CAAC,CAAC;YACxD,IAAI,EAAE,GAAG,CAAC,EAAE,CAAC;SACb,CAAC;IACH,CAAC;IAAC,OAAO,CAAU,EAAE,CAAC;QACrB,GAAG,CAAC,4FAA4F,EAC/F,WAAW,CAAC,cAAc,EAAE,WAAW,CAAC,IAAI,EAAE,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3F,OAAO,IAAI,CAAC;IACb,CAAC;AACF,CAAC;AAED;;;GAGG;AACH,SAAS,YAAY,CACpB,OAAmB,EACnB,IAAsB,EACtB,KAAyB,EACzB,IAAiB;IAEjB,MAAM,KAAK,GAAG,gBAAgB,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;IACjF,IAAI,CAAC,KAAK;QAAE,OAAO,IAAI,CAAC;IAExB,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,CAAC,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAC3D,MAAM,UAAU,GAAG,YAAY,CAAC,KAAK,CAAC,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;IAC/D,IAAI,CAAC,QAAQ,IAAI,CAAC,UAAU,IAAI,QAAQ,KAAK,UAAU,EAAE,CAAC;QACzD,GAAG,CAAC,yEAAyE,EAAE,QAAQ,EAAE,UAAU,CAAC,CAAC;QACrG,OAAO,IAAI,CAAC;IACb,CAAC;IAED,0EAA0E;IAC1E,0EAA0E;IAC1E,yCAAyC;IACzC,MAAM,UAAU,GAAG,sBAAsB,CAAC,IAAI,CAAC,WAAW,EAAE,KAAK,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IACrF,IAAI,CAAC,UAAU,EAAE,CAAC;QACjB,GAAG,CAAC,sDAAsD,EAAE,QAAQ,CAAC,CAAC;QACtE,OAAO,IAAI,CAAC;IACb,CAAC;IACD,IAAI,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,WAAW,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;QAC3D,sEAAsE;QACtE,iCAAiC;QACjC,GAAG,CAAC,mEAAmE,EACtE,QAAQ,EAAE,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/D,OAAO,IAAI,CAAC;IACb,CAAC;IAED,sEAAsE;IACtE,4EAA4E;IAC5E,yEAAyE;IACzE,yEAAyE;IACzE,2DAA2D;IAC3D,MAAM,aAAa,GAAG,sBAAsB,CAAC,yBAAyB,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IACvG,MAAM,cAAc,GAAG,sBAAsB,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,QAAQ,CAAC,CAAC;IAC9F,IAAI,uBAAuB,CAAC,aAAa,EAAE,cAAc,EAAE,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,iBAAiB,EAAE,CAAC;QAC9G,GAAG,CAAC,uDAAuD,EAAE,aAAa,EAAE,cAAc,CAAC,CAAC;QAC5F,OAAO,IAAI,CAAC;IACb,CAAC;IAED,MAAM,aAAa,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAClD,IAAI,aAAa,GAAG,CAAC,EAAE,CAAC;QACvB,GAAG,CAAC,8DAA8D,EAAE,aAAa,CAAC,CAAC;QACnF,OAAO,IAAI,CAAC;IACb,CAAC;IAED,OAAO;QACN,SAAS,EAAE,QAAQ;QACnB,UAAU,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,WAAW,EAAE;QACnE,eAAe,EAAE,IAAI,CAAC,OAAO;QAC7B,cAAc,EAAE,UAAU,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI;QACtD,OAAO,EAAE,oBAAoB;QAC7B,aAAa;KACb,CAAC;AACH,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,oBAAoB,CAC5B,KAAqG;IAErG,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,oBAAoB,GAAG,CAAC,CAAC,CAAC;IACvF,IAAI,KAAK,IAAI,CAAC;QAAE,OAAO,oBAAoB,CAAC;IAC5C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAC/C,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;AACnE,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,IAAc,EAAE,OAAmB;IACjE,IAAI,CAAC,CAAC,IAAI,YAAY,aAAa,CAAC;QAAE,OAAO,IAAI,CAAC;IAClD,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAElC,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClC,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAEvB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,kBAAkB,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IACrF,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAEvB,MAAM,QAAQ,GAAG,YAAY,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IAC/D,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAC;IAE3B,MAAM,UAAU,GAAG,IAAI,kBAAkB,CACxC,IAAI,CAAC,KAAK,EACV,IAAI,EACJ,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,WAAW,EAChB,QAAQ,CACR,CAAC;IACF,GAAG,CAAC,4EAA4E,EAC/E,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,IAAI,EACnE,QAAQ,CAAC,SAAS,EAAE,QAAQ,CAAC,aAAa,CAAC,CAAC;IAC7C,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AAClD,CAAC"}

package/dist/src/planner/rules/access/rule-monotonic-range-access.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rule-monotonic-range-access.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/access/rule-monotonic-range-access.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AACzD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAmN7D,wBAAgB,wBAAwB,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAQ1F"}
+{"version":3,"file":"rule-monotonic-range-access.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/access/rule-monotonic-range-access.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AACzD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AAqN7D,wBAAgB,wBAAwB,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAQ1F"}

package/dist/src/planner/rules/access/rule-monotonic-range-access.js

@@ -83,7 +83,7 @@ function leafWithRangeBound(leaf, rb) {
         return new SeqScanNode(leaf.scope, leaf.source, leaf.filterInfo, undefined, rb, leaf.suppressMonotonic);
     }
     if (leaf instanceof IndexScanNode) {
-        return new IndexScanNode(leaf.scope, leaf.source, leaf.filterInfo, leaf.indexName, leaf.providesOrdering, undefined, leaf.advertisement, rb, leaf.suppressMonotonic);
+        return new IndexScanNode(leaf.scope, leaf.source, leaf.filterInfo, leaf.indexName, leaf.providesOrdering, undefined, leaf.advertisement, rb, leaf.suppressMonotonic, leaf.orderingLoadBearing);
     }
     // IndexSeekNode
     return new IndexSeekNode(leaf.scope, leaf.source, leaf.filterInfo, leaf.indexName, leaf.seekKeys, leaf.isRange, leaf.providesOrdering, undefined, leaf.advertisement, rb, leaf.suppressMonotonic);
@@ -94,7 +94,7 @@ function leafWithMonotonicSuppressed(leaf) {
         return new SeqScanNode(leaf.scope, leaf.source, leaf.filterInfo, undefined, leaf.rangeBoundedOn, true);
     }
     if (leaf instanceof IndexScanNode) {
-        return new IndexScanNode(leaf.scope, leaf.source, leaf.filterInfo, leaf.indexName, leaf.providesOrdering, undefined, leaf.advertisement, leaf.rangeBoundedOn, true);
+        return new IndexScanNode(leaf.scope, leaf.source, leaf.filterInfo, leaf.indexName, leaf.providesOrdering, undefined, leaf.advertisement, leaf.rangeBoundedOn, true, leaf.orderingLoadBearing);
     }
     return new IndexSeekNode(leaf.scope, leaf.source, leaf.filterInfo, leaf.indexName, leaf.seekKeys, leaf.isRange, leaf.providesOrdering, undefined, leaf.advertisement, leaf.rangeBoundedOn, true);
 }

package/dist/src/planner/rules/access/rule-monotonic-range-access.js.map

@@ -1 +1 @@
-{"version":3,"file":"rule-monotonic-range-access.js","sourceRoot":"","sources":["../../../../../src/planner/rules/access/rule-monotonic-range-access.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAIzD,OAAO,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AACjE,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAC9F,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,MAAM,wCAAwC,CAAC;AAKrG,MAAM,GAAG,GAAG,YAAY,CAAC,uCAAuC,CAAC,CAAC;AAIlE,SAAS,YAAY,CAAC,IAAc;IACnC,OAAO,IAAI,YAAY,WAAW,IAAI,IAAI,YAAY,aAAa,IAAI,IAAI,YAAY,aAAa,CAAC;AACtG,CAAC;AAOD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAoB,CAAC,iBAAiB,CAAC,EAAE,EAAE,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1F,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAoB,CAAC,iBAAiB,CAAC,EAAE,EAAE,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC;AAE1F;;;;;GAKG;AACH,SAAS,kBAAkB,CAC1B,UAAsB,EACtB,QAA+C,EAC/C,MAAc;IAEd,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,WAAW,EAAE,CAAC;QAC5C,MAAM,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC;QAC3B,IAAI,CAAC,CAAC,OAAO,KAAK,MAAM;YAAE,SAAS;QACnC,4FAA4F;QAC5F,MAAM,OAAO,GAAG,QAAQ,IAAI,KAAK,CAAC,SAAS,IAAI,CAAC,IAAI,KAAK,CAAC,SAAS,IAAI,QAAQ,CAAC,MAAM;YACrF,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;YAC/B,CAAC,CAAC,SAAS,CAAC;QACb,MAAM,YAAY,GAAG,OAAO,YAAY,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,KAAiB,CAAC,CAAC,CAAC,SAAS,CAAC;QAEvG,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,GAAe,CAAC,CAAC,EAAE,KAAK,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;YAClE,GAAG,CAAC,KAAK,GAAG,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC;YACvE,GAAG,GAAG,IAAI,CAAC;QACZ,CAAC;aAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YAC/B,MAAM,EAAE,GAAe,CAAC,CAAC,EAAE,KAAK,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;YAClE,GAAG,CAAC,KAAK,GAAG,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC;YACvE,GAAG,GAAG,IAAI,CAAC;QACZ,CAAC;aAAM,IAAI,CAAC,CAAC,EAAE,KAAK,iBAAiB,CAAC,EAAE,EAAE,CAAC;YAC1C,8DAA8D;YAC9D,MAAM,EAAE,GAAG,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAa,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAa,EAAE,CAAC;YACpG,MAAM,EAAE,GAAG,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAa,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAa,EAAE,CAAC;YACpG,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC;YACf,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC;YACf,GAAG,GAAG,IAAI,CAAC;QACZ,CAAC;IACF,CAAC;IACD,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AACzB,CAAC;AAED,SAAS,mBAAmB,CAAC,IAAgB,EAAE,MAAc;IAC5D,OAAO,IAAI,CAAC,MAAM,CAAC,iBAAiB,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED,2EAA2E;AAC3E,SAAS,kBAAkB,CAAC,IAAgB,EAAE,EAAwC;IACrF,IAAI,IAAI,YAAY,WAAW,EAAE,CAAC;QACjC,OAAO,IAAI,WAAW,CACrB,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,UAAU,EACf,SAAS,EACT,EAAE,EACF,IAAI,CAAC,iBAAiB,CACtB,CAAC;IACH,CAAC;IACD,IAAI,IAAI,YAAY,aAAa,EAAE,CAAC;QACnC,OAAO,IAAI,aAAa,CACvB,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,gBAAgB,EACrB,SAAS,EACT,IAAI,CAAC,aAAa,EAClB,EAAE,EACF,IAAI,CAAC,iBAAiB,CACtB,CAAC;IACH,CAAC;IACD,gBAAgB;IAChB,OAAO,IAAI,aAAa,CACvB,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,gBAAgB,EACrB,SAAS,EACT,IAAI,CAAC,aAAa,EAClB,EAAE,EACF,IAAI,CAAC,iBAAiB,CACtB,CAAC;AACH,CAAC;AAED,wEAAwE;AACxE,SAAS,2BAA2B,CAAC,IAAgB;IACpD,IAAI,IAAI,YAAY,WAAW,EAAE,CAAC;QACjC,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,SAAS,EAAE,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;IACxG,CAAC;IACD,IAAI,IAAI,YAAY,aAAa,EAAE,CAAC;QACnC,OAAO,IAAI,aAAa,CACvB,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,gBAAgB,EACrB,SAAS,EACT,IAAI,CAAC,aAAa,EAClB,IAAI,CAAC,cAAc,EACnB,IAAI,CACJ,CAAC;IACH,CAAC;IACD,OAAO,IAAI,aAAa,CACvB,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,gBAAgB,EACrB,SAAS,EACT,IAAI,CAAC,aAAa,EAClB,IAAI,CAAC,cAAc,EACnB,IAAI,CACJ,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CAAC,IAAgB;IACxC,yDAAyD;IACzD,IAAI,IAAI,CAAC,cAAc;QAAE,OAAO,IAAI,CAAC;IAErC,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC;IAC9C,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1D,MAAM,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAErC,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACjD,IAAI,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAE5B,MAAM,QAAQ,GAAG,IAAI,YAAY,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;IAC3E,MAAM,MAAM,GAAG,kBAAkB,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IACrE,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEzB,MAAM,EAAE,GAAyC;QAChD,MAAM;QACN,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChD,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAChD,CAAC;IAEF,GAAG,CAAC,+CAA+C,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC5E,OAAO,kBAAkB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AACrC,CAAC;AAED;;;;;GAKG;AACH,SAAS,kBAAkB,CAAC,MAAkB;IAC7C,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9C,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;IAE3B,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC;IAC9C,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1D,IAAI,IAAI,CAAC,iBAAiB;QAAE,OAAO,IAAI,CAAC;IAExC,MAAM,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACrC,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACjD,IAAI,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAE5B,yEAAyE;IACzE,wEAAwE;IACxE,sEAAsE;IACtE,MAAM,SAAS,GAAG,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvD,MAAM,MAAM,GAAG,kBAAkB,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;IACjE,MAAM,SAAS,GAAG,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAChD,CAAC,CAAC,WAAW,KAAK,MAAM;QACxB,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAChF,CAAC;IACF,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAE5B,GAAG,CAAC,kGAAkG,EAAE,MAAM,CAAC,CAAC;IAChH,MAAM,OAAO,GAAG,2BAA2B,CAAC,IAAI,CAAC,CAAC;IAClD,OAAO,MAAM,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;AACzD,CAAC;AAED,MAAM,UAAU,wBAAwB,CAAC,IAAc,EAAE,IAAgB;IACxE,IAAI,IAAI,YAAY,UAAU,EAAE,CAAC;QAChC,OAAO,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IACD,IAAI,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC"}
+{"version":3,"file":"rule-monotonic-range-access.js","sourceRoot":"","sources":["../../../../../src/planner/rules/access/rule-monotonic-range-access.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAIzD,OAAO,EAAE,iBAAiB,EAAE,MAAM,8BAA8B,CAAC;AACjE,OAAO,EAAE,WAAW,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AAC9F,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,kBAAkB,EAAE,uBAAuB,EAAE,MAAM,wCAAwC,CAAC;AAKrG,MAAM,GAAG,GAAG,YAAY,CAAC,uCAAuC,CAAC,CAAC;AAIlE,SAAS,YAAY,CAAC,IAAc;IACnC,OAAO,IAAI,YAAY,WAAW,IAAI,IAAI,YAAY,aAAa,IAAI,IAAI,YAAY,aAAa,CAAC;AACtG,CAAC;AAOD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAoB,CAAC,iBAAiB,CAAC,EAAE,EAAE,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC;AAC1F,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAoB,CAAC,iBAAiB,CAAC,EAAE,EAAE,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC;AAE1F;;;;;GAKG;AACH,SAAS,kBAAkB,CAC1B,UAAsB,EACtB,QAA+C,EAC/C,MAAc;IAEd,MAAM,GAAG,GAAgB,EAAE,CAAC;IAC5B,IAAI,GAAG,GAAG,KAAK,CAAC;IAChB,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,WAAW,EAAE,CAAC;QAC5C,MAAM,CAAC,GAAG,KAAK,CAAC,UAAU,CAAC;QAC3B,IAAI,CAAC,CAAC,OAAO,KAAK,MAAM;YAAE,SAAS;QACnC,4FAA4F;QAC5F,MAAM,OAAO,GAAG,QAAQ,IAAI,KAAK,CAAC,SAAS,IAAI,CAAC,IAAI,KAAK,CAAC,SAAS,IAAI,QAAQ,CAAC,MAAM;YACrF,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,GAAG,CAAC,CAAC;YAC/B,CAAC,CAAC,SAAS,CAAC;QACb,MAAM,YAAY,GAAG,OAAO,YAAY,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,CAAC,KAAiB,CAAC,CAAC,CAAC,SAAS,CAAC;QAEvG,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,MAAM,EAAE,GAAe,CAAC,CAAC,EAAE,KAAK,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;YAClE,GAAG,CAAC,KAAK,GAAG,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC;YACvE,GAAG,GAAG,IAAI,CAAC;QACZ,CAAC;aAAM,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YAC/B,MAAM,EAAE,GAAe,CAAC,CAAC,EAAE,KAAK,iBAAiB,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;YAClE,GAAG,CAAC,KAAK,GAAG,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC;YACvE,GAAG,GAAG,IAAI,CAAC;QACZ,CAAC;aAAM,IAAI,CAAC,CAAC,EAAE,KAAK,iBAAiB,CAAC,EAAE,EAAE,CAAC;YAC1C,8DAA8D;YAC9D,MAAM,EAAE,GAAG,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAa,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAa,EAAE,CAAC;YACpG,MAAM,EAAE,GAAG,YAAY,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAa,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,IAAa,EAAE,CAAC;YACpG,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC;YACf,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC;YACf,GAAG,GAAG,IAAI,CAAC;QACZ,CAAC;IACF,CAAC;IACD,OAAO,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AACzB,CAAC;AAED,SAAS,mBAAmB,CAAC,IAAgB,EAAE,MAAc;IAC5D,OAAO,IAAI,CAAC,MAAM,CAAC,iBAAiB,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;AAC1D,CAAC;AAED,2EAA2E;AAC3E,SAAS,kBAAkB,CAAC,IAAgB,EAAE,EAAwC;IACrF,IAAI,IAAI,YAAY,WAAW,EAAE,CAAC;QACjC,OAAO,IAAI,WAAW,CACrB,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,UAAU,EACf,SAAS,EACT,EAAE,EACF,IAAI,CAAC,iBAAiB,CACtB,CAAC;IACH,CAAC;IACD,IAAI,IAAI,YAAY,aAAa,EAAE,CAAC;QACnC,OAAO,IAAI,aAAa,CACvB,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,gBAAgB,EACrB,SAAS,EACT,IAAI,CAAC,aAAa,EAClB,EAAE,EACF,IAAI,CAAC,iBAAiB,EACtB,IAAI,CAAC,mBAAmB,CACxB,CAAC;IACH,CAAC;IACD,gBAAgB;IAChB,OAAO,IAAI,aAAa,CACvB,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,gBAAgB,EACrB,SAAS,EACT,IAAI,CAAC,aAAa,EAClB,EAAE,EACF,IAAI,CAAC,iBAAiB,CACtB,CAAC;AACH,CAAC;AAED,wEAAwE;AACxE,SAAS,2BAA2B,CAAC,IAAgB;IACpD,IAAI,IAAI,YAAY,WAAW,EAAE,CAAC;QACjC,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,SAAS,EAAE,IAAI,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;IACxG,CAAC;IACD,IAAI,IAAI,YAAY,aAAa,EAAE,CAAC;QACnC,OAAO,IAAI,aAAa,CACvB,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,gBAAgB,EACrB,SAAS,EACT,IAAI,CAAC,aAAa,EAClB,IAAI,CAAC,cAAc,EACnB,IAAI,EACJ,IAAI,CAAC,mBAAmB,CACxB,CAAC;IACH,CAAC;IACD,OAAO,IAAI,aAAa,CACvB,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,MAAM,EACX,IAAI,CAAC,UAAU,EACf,IAAI,CAAC,SAAS,EACd,IAAI,CAAC,QAAQ,EACb,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,gBAAgB,EACrB,SAAS,EACT,IAAI,CAAC,aAAa,EAClB,IAAI,CAAC,cAAc,EACnB,IAAI,CACJ,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,eAAe,CAAC,IAAgB;IACxC,yDAAyD;IACzD,IAAI,IAAI,CAAC,cAAc;QAAE,OAAO,IAAI,CAAC;IAErC,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC;IAC9C,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1D,MAAM,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IAErC,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACjD,IAAI,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAE5B,MAAM,QAAQ,GAAG,IAAI,YAAY,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC;IAC3E,MAAM,MAAM,GAAG,kBAAkB,CAAC,IAAI,CAAC,UAAU,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAC;IACrE,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEzB,MAAM,EAAE,GAAyC;QAChD,MAAM;QACN,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAChD,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAChD,CAAC;IAEF,GAAG,CAAC,+CAA+C,EAAE,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC5E,OAAO,kBAAkB,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AACrC,CAAC;AAED;;;;;GAKG;AACH,SAAS,kBAAkB,CAAC,MAAkB;IAC7C,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,MAAM,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9C,MAAM,IAAI,GAAG,MAAM,CAAC,MAAM,CAAC;IAE3B,MAAM,WAAW,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC;IAC9C,IAAI,CAAC,WAAW,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC1D,IAAI,IAAI,CAAC,iBAAiB;QAAE,OAAO,IAAI,CAAC;IAExC,MAAM,MAAM,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACrC,MAAM,MAAM,GAAG,mBAAmB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACjD,IAAI,MAAM,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAE5B,yEAAyE;IACzE,wEAAwE;IACxE,sEAAsE;IACtE,MAAM,SAAS,GAAG,uBAAuB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACvD,MAAM,MAAM,GAAG,kBAAkB,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;IACjE,MAAM,SAAS,GAAG,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAChD,CAAC,CAAC,WAAW,KAAK,MAAM;QACxB,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,IAAI,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAChF,CAAC;IACF,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAE5B,GAAG,CAAC,kGAAkG,EAAE,MAAM,CAAC,CAAC;IAChH,MAAM,OAAO,GAAG,2BAA2B,CAAC,IAAI,CAAC,CAAC;IAClD,OAAO,MAAM,CAAC,YAAY,CAAC,CAAC,OAAO,EAAE,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;AACzD,CAAC;AAED,MAAM,UAAU,wBAAwB,CAAC,IAAc,EAAE,IAAgB;IACxE,IAAI,IAAI,YAAY,UAAU,EAAE,CAAC;QAChC,OAAO,kBAAkB,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IACD,IAAI,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC;QACxB,OAAO,eAAe,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC"}

package/dist/src/planner/rules/access/rule-select-access-path.d.ts

@@ -13,4 +13,31 @@
 import type { PlanNode } from '../../nodes/plan-node.js';
 import type { OptContext } from '../../framework/context.js';
 export declare function ruleSelectAccessPath(node: PlanNode, context: OptContext): PlanNode | null;
+/**
+ * Per-seek-constraint classification of how an index column's collation relates
+ * to the predicate's effective comparison collation. See {@link classifyConstraintCover}.
+ *
+ * - `MATCH`           — collations equal; the seek fully satisfies the predicate.
+ * - `COARSER_SAFE`    — equality op whose index collation is a provable superset of
+ *                       the predicate's (BINARY predicate over a non-BINARY index):
+ *                       the seek over-fetches a superset, so a residual recovers the
+ *                       exact matches.
+ * - `MISMATCH_UNSAFE` — anything else (a finer index that under-fetches, or any
+ *                       range/prefix mismatch that reorders the walked window): the
+ *                       seek cannot be made correct with a residual.
+ */
+type CollationCover = 'MATCH' | 'COARSER_SAFE' | 'MISMATCH_UNSAFE';
+/**
+ * Cover relation for a single seek column. See {@link CollationCover}.
+ *
+ * `honorsCollatedRangeBounds` is the module's advertisement (off by default) that its
+ * runtime filters range bounds under the index collation rather than BINARY; it gates
+ * the non-BINARY range MATCH and is ignored for equality.
+ *
+ * Exported for `rule-key-set-seek`, which applies the same equality lattice to its
+ * runtime-materialized multi-seek (accepting MATCH and COARSER_SAFE, declining
+ * MISMATCH_UNSAFE) rather than restating it.
+ */
+export declare function classifyConstraintCover(predColl: string, indexColl: string, isEquality: boolean, honorsCollatedRangeBounds: boolean): CollationCover;
+export {};
 //# sourceMappingURL=rule-select-access-path.d.ts.map

package/dist/src/planner/rules/access/rule-select-access-path.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"rule-select-access-path.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/access/rule-select-access-path.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAkB,MAAM,0BAA0B,CAAC;AAEzE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AA2H7D,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CA0EzF"}
+{"version":3,"file":"rule-select-access-path.d.ts","sourceRoot":"","sources":["../../../../../src/planner/rules/access/rule-select-access-path.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAGH,OAAO,KAAK,EAAE,QAAQ,EAAkB,MAAM,0BAA0B,CAAC;AAEzE,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,4BAA4B,CAAC;AA2H7D,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAsFzF;AA0mCD;;;;;;;;;;;;GAYG;AACH,KAAK,cAAc,GAAG,OAAO,GAAG,cAAc,GAAG,iBAAiB,CAAC;AA+EnE;;;;;;;;;;GAUG;AACH,wBAAgB,uBAAuB,CAAC,QAAQ,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,yBAAyB,EAAE,OAAO,GAAG,cAAc,CAuBpJ"}

package/dist/src/planner/rules/access/rule-select-access-path.js

@@ -115,11 +115,21 @@ export function ruleSelectAccessPath(node, context) {
     // Always allow fallback to sequential scan to guarantee physicalization
     // even when no specialized support is available.
     // If grow-retrieve established an index-style context, reuse it directly
+    // NOTE: `retrieveNode.source` is intentionally NOT rebuilt on this path. Once an
+    // index-style moduleCtx exists it is the sole authority for what the access applies
+    // (accessPlan + handledFilters + residualPredicate); nothing this branch emits comes
+    // from `source`. A predicate written into `source` after the ctx is set is therefore
+    // silently lost — exactly the bug rule-predicate-pushdown's isIndexStyleContext guard
+    // prevents. Rebuilding from `source` here is NOT the fix: this branch also legitimately
+    // discards a Sort/LimitOffset that sort-absorption already elided, so rebuilding
+    // would resurrect them. `source` is still read elsewhere (rule-grow-retrieve's
+    // `collectBindingsInPlan` and `trySortAbsorbViaIndexOrdering`'s constraint sweep), so
+    // it is dead as an execution channel, not dead weight — do not stop populating it.
     if (isIndexStyleContext(retrieveNode.moduleCtx)) {
         log('Using index-style context provided by grow-retrieve');
         const accessPlan = retrieveNode.moduleCtx.accessPlan;
         const originalConstraints = retrieveNode.moduleCtx.originalConstraints;
-        const physicalLeaf = selectPhysicalNode(retrieveNode.tableRef, accessPlan, originalConstraints);
+        const physicalLeaf = selectPhysicalNode(retrieveNode.tableRef, accessPlan, originalConstraints, retrieveNode.moduleCtx.orderingLoadBearing === true);
         if (retrieveNode.moduleCtx.residualPredicate) {
             return new FilterNode(retrieveNode.scope, physicalLeaf, retrieveNode.moduleCtx.residualPredicate);
         }
@@ -173,12 +183,14 @@ function createIndexBasedAccess(retrieveNode, context) {
     let accessPlan;
     let constraints;
     let residualPredicate;
+    let orderingLoadBearing = false;
     if (isIndexStyleContext(retrieveNode.moduleCtx)) {
         // Use pre-computed access plan from grow rule
         log('Using pre-computed access plan from grow rule');
         accessPlan = retrieveNode.moduleCtx.accessPlan;
         constraints = retrieveNode.moduleCtx.originalConstraints;
         residualPredicate = retrieveNode.moduleCtx.residualPredicate;
+        orderingLoadBearing = retrieveNode.moduleCtx.orderingLoadBearing === true;
     }
     else {
         // Extract constraints from grown pipeline in source using table instance key
@@ -200,7 +212,7 @@ function createIndexBasedAccess(retrieveNode, context) {
         accessPlan = vtabModule.getBestAccessPlan(context.db, tableSchema, request);
     }
     // Choose physical node based on access plan
-    const physicalLeaf = selectPhysicalNode(retrieveNode.tableRef, accessPlan, constraints);
+    const physicalLeaf = selectPhysicalNode(retrieveNode.tableRef, accessPlan, constraints, orderingLoadBearing);
     // If the Retrieve source contained a pipeline (e.g., Filter/Sort/Project), rebuild it above the physical leaf.
     //
     // NOTE: on this path (no index-style moduleCtx) an absorbed `Filter` in `source` is
@@ -280,9 +292,13 @@ function reattachUnconsumedConstraints(tableRef, accessPlan, constraints, consum
     return new FilterNode(tableRef.scope, leaf, predicate);
 }
 /**
- * Select the appropriate physical node based on access plan
+ * Select the appropriate physical node based on access plan.
+ *
+ * `orderingLoadBearing` records that a SortNode was dropped on the strength of
+ * this plan's `providesOrdering` (sort absorption) — lifted onto the
+ * ordering-only IndexScan leaf so emission-order-changing rewrites decline.
  */
-function selectPhysicalNode(tableRef, accessPlan, constraints) {
+function selectPhysicalNode(tableRef, accessPlan, constraints, orderingLoadBearing = false) {
     // Empty result optimization (e.g., IS NULL on NOT NULL column)
     if (accessPlan.rows === 0 && accessPlan.handledFilters.every(h => h)) {
         log('Using empty result (impossible predicate detected)');
@@ -300,15 +316,15 @@ function selectPhysicalNode(tableRef, accessPlan, constraints) {
     // --- Index-aware path: use module-provided index identity ---
     // --- Legacy fallback: infer access method from constraints and PK definition ---
     const leaf = (accessPlan.indexName && accessPlan.seekColumnIndexes && accessPlan.seekColumnIndexes.length > 0)
-        ? selectPhysicalNodeFromPlan(tableRef, accessPlan, constraints, filterInfo, providesOrdering, consumed)
-        : selectPhysicalNodeLegacy(tableRef, accessPlan, constraints, filterInfo, providesOrdering, consumed);
+        ? selectPhysicalNodeFromPlan(tableRef, accessPlan, constraints, filterInfo, providesOrdering, consumed, orderingLoadBearing)
+        : selectPhysicalNodeLegacy(tableRef, accessPlan, constraints, filterInfo, providesOrdering, consumed, orderingLoadBearing);
     return reattachUnconsumedConstraints(tableRef, accessPlan, constraints, consumed, leaf);
 }
 /**
  * Index-aware physical node selection using module-provided indexName and seekColumnIndexes.
  * Works for both primary key and secondary indexes.
  */
-function selectPhysicalNodeFromPlan(tableRef, accessPlan, constraints, filterInfo, providesOrdering, consumed) {
+function selectPhysicalNodeFromPlan(tableRef, accessPlan, constraints, filterInfo, providesOrdering, consumed, orderingLoadBearing = false) {
     const advertisement = extractAdvertisement(accessPlan);
     // Whether this module's runtime honours the index collation for range bounds —
     // gates the collation-matched non-BINARY range/prefix seek (see classifyConstraintCover).
@@ -686,7 +702,7 @@ function selectPhysicalNodeFromPlan(tableRef, accessPlan, constraints, filterInf
         const orderingIdxStr = orderingIndexName === PRIMARY_PHYSICAL_INDEX_NAME ? PRIMARY_INDEX_NAME : orderingIndexName;
         log('Using index scan (ordering provided by %s)', orderingIndexName);
         const orderingFilterInfo = makeOrderedScanFilterInfo(filterInfo, tableRef.tableSchema, accessPlan, orderingIdxStr);
-        return new IndexScanNode(tableRef.scope, tableRef, orderingFilterInfo, orderingIndexName, providesOrdering, accessPlan.cost, advertisement);
+        return new IndexScanNode(tableRef.scope, tableRef, orderingFilterInfo, orderingIndexName, providesOrdering, accessPlan.cost, advertisement, undefined, false, orderingLoadBearing);
     }
     // Fall back to sequential scan
     log('Using sequential scan (index %s: no usable seek/range constraints)', physicalIndexName);
@@ -696,7 +712,7 @@ function selectPhysicalNodeFromPlan(tableRef, accessPlan, constraints, filterInf
  * Legacy physical node selection for backward compatibility when module
  * doesn't provide indexName/seekColumnIndexes (PK-based heuristics).
  */
-function selectPhysicalNodeLegacy(tableRef, accessPlan, constraints, filterInfo, providesOrdering, consumed) {
+function selectPhysicalNodeLegacy(tableRef, accessPlan, constraints, filterInfo, providesOrdering, consumed, orderingLoadBearing = false) {
     const advertisement = extractAdvertisement(accessPlan);
     const honorsCollatedRangeBounds = accessPlan.honorsCollatedRangeBounds === true;
     // Analyze the access plan to determine node type
@@ -811,7 +827,7 @@ function selectPhysicalNodeLegacy(tableRef, accessPlan, constraints, filterInfo,
         log('Using index scan (ordering provided by %s)', indexName);
         const indexIdxStr = indexName === PRIMARY_PHYSICAL_INDEX_NAME ? PRIMARY_INDEX_NAME : indexName;
         const orderingFilterInfo = makeOrderedScanFilterInfo(filterInfo, tableRef.tableSchema, accessPlan, indexIdxStr);
-        return new IndexScanNode(tableRef.scope, tableRef, orderingFilterInfo, indexName, providesOrdering, accessPlan.cost, advertisement);
+        return new IndexScanNode(tableRef.scope, tableRef, orderingFilterInfo, indexName, providesOrdering, accessPlan.cost, advertisement, undefined, false, orderingLoadBearing);
     }
     log('Using sequential scan (no beneficial index access)');
     return createSeqScan(tableRef, filterInfo, accessPlan.cost);
@@ -1032,8 +1048,12 @@ function primaryKeyCollationLookup(tableSchema) {
  * `honorsCollatedRangeBounds` is the module's advertisement (off by default) that its
  * runtime filters range bounds under the index collation rather than BINARY; it gates
  * the non-BINARY range MATCH and is ignored for equality.
+ *
+ * Exported for `rule-key-set-seek`, which applies the same equality lattice to its
+ * runtime-materialized multi-seek (accepting MATCH and COARSER_SAFE, declining
+ * MISMATCH_UNSAFE) rather than restating it.
  */
-function classifyConstraintCover(predColl, indexColl, isEquality, honorsCollatedRangeBounds) {
+export function classifyConstraintCover(predColl, indexColl, isEquality, honorsCollatedRangeBounds) {
     if (isEquality) {
         if (predColl === indexColl)
             return 'MATCH';