@quereus/quereus 4.5.0 → 4.7.0

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

@@ -1,11 +1,15 @@
 /**
  * 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):
+ * Pattern (anchored on the physical hash semi join `join-physical-selection`
+ * builds — rule id `key-set-seek` — and on the merge semi join
+ * `monotonic-merge-join` / `join-physical-selection` build — rule id
+ * `key-set-seek-merge`; one rule function serves both anchors):
  *
- *   BloomJoinNode (semi, exactly one equi-pair, no residual)
+ *   BloomJoinNode | MergeJoinNode (semi, exactly one equi-pair, no residual)
  *     ├─ left:  (FilterNode | trivial ProjectNode | AliasNode)*
  *     │           over  SeqScan(fullScan) | ordering-only IndexScan(plan=0)
+ *     │                 | IndexSeek carrying pushedConstraints
  *     └─ right: uncorrelated, deterministic, side-effect-free key source
  *
  * On a successful match the left chain is rebuilt with the leaf replaced by a
@@ -16,27 +20,61 @@
  *   HashJoin(semi, Project(Filter(leaf)), right)
  *     →  Project(Filter(KeySetSemiJoin(leaf, right)))
  *
+ * An `IndexSeek` leaf is admitted UNCHANGED, with the predicate its
+ * `FilterInfo` enforces (recorded in `pushedConstraints`, dropped from the
+ * tree on the module's promise) re-applied as a `Filter` directly above the
+ * new node — inside the peeled wrappers, because a peeled trivial Project may
+ * not carry the predicate's columns:
+ *
+ *   HashJoin(semi, Project(IndexSeek[s='x']), right)
+ *     →  Project(Filter[s='x'](KeySetSemiJoin(IndexSeek[s='x'], right)))
+ *
+ * That is right on both runtime branches: the scan branch runs the leaf's own
+ * FilterInfo untouched (the pushed seek happens exactly as today; the added
+ * Filter is redundant), and the seek branch replaces the FilterInfo with the
+ * multi-seek (the module ignores the pushed predicate; the Filter re-applies
+ * it). The scan branch is byte-for-byte the plan being displaced, so the
+ * rewrite is never a structural loss.
+ *
  * 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:
+ * The rule declines (returns null, keeping the join it arrived as) 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 walk leaf that is not an unconstrained every-row walk (residue in
+ *     `FilterInfo.constraints`, or a pushed limit / offset)
+ *   - a seek leaf failing any of {@link admitSeekLeaf}'s five gates:
+ *     - a pushed limit / offset (a directive the multi-seek would not honour,
+ *       and unlike a predicate it cannot be re-applied by a Filter without
+ *       changing which rows are dropped — unreachable today,
+ *       `monotonic-limit-pushdown`'s peel cannot cross a join, but kept)
+ *     - no recorded `pushedConstraints` (a seek we cannot describe is a seek
+ *       we must not displace)
+ *     - a recorded predicate containing a relational node (this rule runs
+ *       PostOptimization — a re-inserted relational subquery would reach emit
+ *       unphysicalized)
+ *     - a correlated subtree (`index-nested-loop` builds seeks keyed on the
+ *       OUTER side of a join — re-applying is correct but the node drains the
+ *       key source per outer row, turning a linear plan quadratic)
+ *     - an emission order that absorbed a Sort (`orderingLoadBearing` —
+ *       `seekPreservesTargetOrder` is false for every seek, so the absorbed
+ *       order cannot be reproduced)
+ *   - a walk leaf whose emission order absorbed a SortNode (`orderingLoadBearing`)
+ *     UNLESS the seek would reproduce that order (`seekPreservesTargetOrder`:
+ *     the seek index is the walk index, so a multi-seek emits a subsequence of
+ *     the walk — still in the same order). Otherwise the dropped Sort's order,
+ *     which rides the leaf's walk order through the order-preserving join,
+ *     would be replaced by seek-key order
+ *   - target/key logical types that do not share one seek key space
+ *     (`sharesSeekKeySpace`: identical types, or any two of INTEGER / REAL /
+ *     NUMERIC). Anything else could be encoded into seek keys that miss rows
+ *     `=` considers equal
  *   - 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;
@@ -49,87 +87,63 @@
  *   - 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)
+ *   - a break-even of zero (the module's own costs say the displaced plan —
+ *     the plain scan for a walk leaf, the leaf's own pushed seek for a seek
+ *     leaf — wins at every key count)
+ *
+ * The MERGE anchor adds two gates the hash anchor does not need:
+ *   - `seekPreservesTargetOrder` must hold. `MergeJoinNode.computePhysical`
+ *     propagates the probe side's `ordering` / `monotonicOn` for semi, so a
+ *     Sort an earlier pass dropped on the strength of the merge join's order
+ *     cannot come back — a replacement that cannot reproduce that order is a
+ *     wrong-order plan, not a slow one. (`BloomJoinNode` propagates neither,
+ *     so nothing above a hash join can have depended on an ordering claim —
+ *     that asymmetry is the whole reason this gate is merge-only.)
+ *   - the key source's PHYSICAL row estimate, when present, must not exceed
+ *     min(maxKeys, breakEvenKeys) — the same expression the runtime's `push`
+ *     decision uses. A merge semi join streams both sides; this node drains
+ *     the key source into a Set before opening the target, so a rewrite whose
+ *     seek then never fires is pure loss (the same scan, plus a set the merge
+ *     join never built). The gate is a heuristic in BOTH directions: the
+ *     estimate is advisory, and it counts ROWS while the runtime counts
+ *     DISTINCT non-null keys, so a duplicate-heavy key source can be declined
+ *     here and still have seeked. Both errors cost an optimization, never a
+ *     row. The hash arm has no such gate because the hash join it replaces
+ *     already built that set.
  *
- * NOTE: the three `getBestAccessPlan` probes run on every qualifying hash semi
+ * NOTE: the three `getBestAccessPlan` probes run on every qualifying 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`).
+ * NOTE: the `orderingLoadBearing` decline is conservative when
+ * `seekPreservesTargetOrder` is false — a future enhancement could re-sort the
+ * pushed output by the leaf's advertised order.
  */
 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 { MergeJoinNode } from '../../nodes/merge-join-node.js';
+import { KeySetSemiJoinNode, RUNTIME_SET_MAX_KEYS, seekPreservesTargetOrder } from '../../nodes/key-set-semi-join-node.js';
+import { IndexScanNode, IndexSeekNode } from '../../nodes/table-access-nodes.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 { sharesSeekKeySpace } from '../../../types/builtin-types.js';
 import { effectiveCollationOfTypes } from '../../analysis/comparison-collation.js';
-import { classifyConstraintCover } from './rule-select-access-path.js';
+import { hasRelationalDescendant } from '../../analysis/scalar-subqueries.js';
+import { classifyConstraintCover, combineResidualExpressions } from './rule-select-access-path.js';
+import { peelToSeekableAccessLeaf, rebuildChain, buildProbeRequest } from '../shared/access-leaf.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.
+ * SEMI join (hash or merge — both expose the same shape) whose key source may be
+ * drained exactly once (uncorrelated, deterministic, pure) and whose probe chain
+ * carries no write. The residual gate also covers `monotonic-merge-join`'s
+ * residualized non-driving equi-pairs: a two-pair IN-style shape arrives as one
+ * equi-pair plus a residual and declines here.
  */
 function admitJoin(node) {
     if (node.joinType !== 'semi')
@@ -162,25 +176,35 @@ function admitJoin(node) {
     return true;
 }
 /**
- * The probe-side access leaf, when it is one whose `FilterInfo` may be replaced
- * wholesale at runtime.
+ * The probe-side access leaf, when the rewrite can honour everything its
+ * `FilterInfo` enforces.
+ *
+ * Two arms. A WALK leaf 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 SEEK leaf
+ * (its residual Filter dropped on the module's promise to enforce the pushed
+ * predicate) is admitted unchanged when its `pushedConstraints` fully describe
+ * that promise — the caller re-applies them above the new node; see
+ * {@link admitSeekLeaf} for the gates. A pushed limit / offset declines both
+ * arms: a directive the multi-seek would not honour, and one a Filter cannot
+ * re-apply without changing which rows are dropped.
  *
- * 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.
+ * Deliberately structural only for the walk arm: its `orderingLoadBearing`
+ * decline needs the pushdown (an absorbed Sort is fine when
+ * `seekPreservesTargetOrder` holds), so it lives in `ruleKeySetSeek` after
+ * `planPushdown` rather than here. The seek arm's ordering decline IS here
+ * (gate 5): `seekPreservesTargetOrder` is false for every seek, so no pushdown
+ * could ever change the answer.
  */
 function admitLeaf(left) {
-    const leaf = peelToLeaf(left);
+    const leaf = peelToSeekableAccessLeaf(left);
     if (!leaf) {
         log('decline: left does not peel to an access leaf through Alias/Project/Filter');
         return null;
     }
+    if (leaf instanceof IndexSeekNode) {
+        return admitSeekLeaf(leaf);
+    }
     const fi = leaf.filterInfo;
     const isEveryRowWalk = fi.accessPath?.kind === 'fullScan'
         || (fi.accessPath?.kind === 'index' && fi.accessPath.plan === 'scan');
@@ -189,16 +213,62 @@ function admitLeaf(left) {
         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 { leaf };
+}
+/**
+ * Admission gates for an `IndexSeekNode` target. The type / collation /
+ * module-claim / break-even gates applied later concern the SEEK column and
+ * apply to this arm identically; these five concern the pushed predicate.
+ */
+function admitSeekLeaf(leaf) {
+    const fi = leaf.filterInfo;
+    // Gate 1: a pushed limit / offset is a directive the multi-seek would not
+    // honour, and unlike a predicate it cannot be re-applied by a Filter without
+    // changing which rows are dropped. (Unreachable today —
+    // `monotonic-limit-pushdown`'s peel cannot cross a join — but kept.)
+    if (fi.limit !== undefined || fi.offset !== undefined) {
+        log('decline: seek leaf carries a pushed limit/offset');
+        return null;
+    }
+    // Gate 2: the seek's FilterInfo is the sole enforcer of whatever the module
+    // promised; a seek we cannot describe is a seek we must not displace.
+    if (!leaf.pushedConstraints || leaf.pushedConstraints.length === 0) {
+        log('decline: seek leaf records no pushed constraints');
+        return null;
+    }
+    const residual = combineResidualExpressions(leaf.pushedConstraints.map(c => c.sourceExpression));
+    if (!residual) {
+        log('decline: seek leaf pushed constraints combine to no predicate');
+        return null;
+    }
+    // Gate 3: this rule runs in PostOptimization, so an expression re-inserted
+    // here gets no further optimization pass — an unphysicalized relational
+    // subquery inside it would reach emit unprepared. Constraint extraction
+    // should never produce one; this gate makes that independent of the
+    // extractor's behaviour.
+    if (hasRelationalDescendant(residual)) {
+        log('decline: seek leaf pushed predicate contains a relational node');
         return null;
     }
-    return leaf;
+    // Gate 4: `index-nested-loop` builds seeks whose keys — and therefore whose
+    // pushedConstraints — reference the OUTER side of a nested-loop join.
+    // Re-applying such a predicate above the semi join would still be correct,
+    // but the node drains the key source once per outer row, turning a linear
+    // plan quadratic. Same test `admitJoin` applies to the key source.
+    if (isCorrelatedSubquery(leaf)) {
+        log('decline: seek leaf is correlated (per-outer-row seek)');
+        return null;
+    }
+    // Gate 5: `seekPreservesTargetOrder` is false for every IndexSeekNode (it
+    // requires an ordering-only index walk whose index is the seek index), so a
+    // seek target can never reproduce an absorbed Sort's order — one ordering
+    // doctrine with the walk arm's gate in `ruleKeySetSeek`, resolved here
+    // because no pushdown could change the answer.
+    if (leaf.orderingLoadBearing) {
+        log('decline: seek leaf emission order is load-bearing (absorbed a Sort)');
+        return null;
+    }
+    return { leaf, residual };
 }
 /**
  * Resolve the equi-pair to a target column index, then apply the two type gates
@@ -219,11 +289,32 @@ function resolveSeekColumns(leaf, right, leftAttrId, rightAttrId) {
     }
     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);
+    // One seek key space only. Identical types qualify; so does any pair drawn
+    // from INTEGER / REAL / NUMERIC, whose keys are identified by VALUE rather
+    // than by JS representation at every layer (see `sharesSeekKeySpace`). The
+    // key value is passed through RAW — coercing it into the target's type would
+    // truncate (`INTEGER_TYPE.parse(1.5)` → 1) and mint a key for a value `=`
+    // calls unequal. Any other cross-type pair could be encoded into seek keys
+    // that miss rows `=` considers equal, and the probe cannot resurrect a row
+    // the seek never returned.
+    //
+    // NOTE: a NaN seek key cannot under-fetch, so it needs no special handling
+    // here. A NaN key's probe string is `n:NaN`, which matches only a stored NaN.
+    // On the memory backend, REAL/NUMERIC rank NaN first and NaN = NaN in the
+    // very comparator their BTrees are built with, so the seek lands on the NaN
+    // entries; an INTEGER-declared column cannot hold NaN at all
+    // (`INTEGER_TYPE.validate` rejects it), so there is no row to miss — its
+    // comparator ranking NaN equal to everything can only over-fetch, which the
+    // probe trims. On the store backend `encodeNumeric` maps every NaN to one
+    // byte string (above every finite double), so the window is exactly the NaN
+    // rows. Dropping NaN keys the way NULL keys are dropped would be WRONG: it
+    // would under-fetch a genuinely NaN-valued row in a REAL/NUMERIC column.
+    // The reasoning is defensive: no builtin SQL surface produces a stored NaN —
+    // `0.0/0.0`, `1e308*1e308`, `sqrt(-1)` and `cast('nan' as real)` all yield NULL
+    // or 0, and a NaN bound as a parameter arrives as NULL. Only a plugin type,
+    // module or UDF can mint one.
+    if (!sharesSeekKeySpace(targetType.logicalType, keyType.logicalType)) {
+        log('decline: %s and %s do not share a seek key space', targetType.logicalType.name, keyType.logicalType.name);
         return null;
     }
     // Semantic-ordering types ('PT1H' equals 'PT60M' but is byte-distinct): a
@@ -236,20 +327,6 @@ function resolveSeekColumns(leaf, right, leftAttrId, rightAttrId) {
     }
     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)
@@ -267,14 +344,14 @@ function claimedIndex(plan, seekCol) {
     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.
+ * The module's answers to the synthesized requests: its cost for a runtime-set
+ * seek at two key counts (2 and the engine ceiling), plus the cost of the plan
+ * the seek branch would displace. `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
+ * incoming 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) {
@@ -305,10 +382,17 @@ function probeModuleCosts(context, leaf, seekCol, keyRowsEstimate) {
         return plan;
     };
     try {
+        // The plan the seek branch displaces. A constrained leaf already records
+        // the module's cost for its own seek (`filterInfo.indexInfoOutput.
+        // estimatedCost` is `accessPlan.cost` verbatim — `makeIndexFilterInfo`
+        // spreads a base seeded with it and never overrides the field); an
+        // unconstrained walk has to be asked.
         return {
             seekAt2: ask([runtimeSetFilter(2)]),
             seekAtMax: ask([runtimeSetFilter(RUNTIME_SET_MAX_KEYS)]),
-            scan: ask([]),
+            baselineCost: leaf instanceof IndexSeekNode
+                ? leaf.filterInfo.indexInfoOutput.estimatedCost
+                : ask([]).cost,
         };
     }
     catch (e) {
@@ -370,30 +454,56 @@ function planPushdown(context, leaf, right, cols) {
     };
 }
 /**
- * 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.
+ * Absorbs floating-point jitter in the break-even solve before `Math.floor`.
+ * The tie case is real, not hypothetical: the memory module prices a k-key
+ * runtime-set seek and a k-row literal equality seek with one formula, so a
+ * pushed single-row equality baseline lands EXACTLY on the interpolation line
+ * at k=1 — in exact arithmetic the floor yields 1 (accept at the tie; a
+ * cost-equal seek is harmless), but the subtract-then-divide can land a hair
+ * under the integer and turn the tie into a decline.
+ *
+ * NOTE: the consequence on the memory module is that an equality-pushed seek
+ * target always lands on `breakEvenKeys === 1`, so the plan is rewritten but
+ * the runtime seek branch fires only for a one-key set. That is the module's
+ * own verdict (it prices both seeks off the seek-key count and knows nothing
+ * of how many rows each window holds), not an engine choice. A module that
+ * prices an equality seek from its matched-row count — the store does — yields
+ * a break-even that discriminates, and the seek branch fires accordingly.
+ */
+const BREAK_EVEN_EPSILON = 1e-9;
+/**
+ * The distinct key count at which the module's own seek cost overtakes the
+ * cost of the plan being displaced (the plain scan for a walk leaf, the leaf's
+ * own pushed seek for a seek leaf). Interpolates the runtime-set seek cost as
+ * a linear function of key count through the two probe points and solves
+ * against the baseline. 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 baseline, so
+ * the engine ceiling becomes the threshold. A baseline cheaper than a two-key
+ * seek interpolates below 1 and the caller declines — for a seek leaf that is
+ * the honest "the pushed seek beats any key-set seek" answer.
  *
- * 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.
+ * NOTE: the comparison charges nothing for the re-applied predicate's per-row
+ * evaluation on a seek leaf's seek branch. It is bounded by the number of rows
+ * the seek returns (≤ key count), so it cannot flip a decision by much.
  */
 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)));
+    return Math.max(0, Math.min(RUNTIME_SET_MAX_KEYS, Math.floor(2 + (costs.baselineCost - costs.seekAt2.cost) / slope + BREAK_EVEN_EPSILON)));
 }
 export function ruleKeySetSeek(node, context) {
-    if (!(node instanceof BloomJoinNode))
+    if (!(node instanceof BloomJoinNode) && !(node instanceof MergeJoinNode))
         return null;
     if (!admitJoin(node))
         return null;
-    const leaf = admitLeaf(node.left);
-    if (!leaf)
+    const admitted = admitLeaf(node.left);
+    if (!admitted)
         return null;
+    const { leaf, residual } = admitted;
     const pair = node.equiPairs[0];
     const cols = resolveSeekColumns(leaf, node.right, pair.leftAttrId, pair.rightAttrId);
     if (!cols)
@@ -401,8 +511,59 @@ export function ruleKeySetSeek(node, context) {
     const pushdown = planPushdown(context, leaf, node.right, cols);
     if (!pushdown)
         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 join preserves probe order at runtime, and the
+    // replacement must keep serving that order. When the seek index is the walk
+    // index (`seekPreservesTargetOrder`) both runtime branches emit in the
+    // leaf's own order and the absorbed Sort stays served; otherwise a pushed
+    // multi-seek would emit in seek-key order — decline, keeping the
+    // order-preserving join.
+    if (leaf instanceof IndexScanNode && leaf.orderingLoadBearing
+        && !seekPreservesTargetOrder(leaf, pushdown)) {
+        log('decline: leaf emission order is load-bearing (absorbed a Sort) and the seek would not reproduce it');
+        return null;
+    }
+    if (node instanceof MergeJoinNode) {
+        // Merge-arm-only gate 1: the merge join propagates the probe side's
+        // ordering / monotonicOn upward for semi, so an ancestor (or an already
+        // dropped Sort) may depend on that order. The replacement must be able
+        // to claim the same order — KeySetSemiJoinNode does so exactly when
+        // this predicate holds. (The hash arm needs no such gate: BloomJoinNode
+        // propagates no ordering, so nothing above it can have depended on one.)
+        if (!seekPreservesTargetOrder(leaf, pushdown)) {
+            log('decline: merge join propagates the probe order and the seek cannot reproduce it');
+            return null;
+        }
+        // Merge-arm-only gate 2: do not trade a streaming operator for an
+        // unbounded materialization. When the key source's row estimate already
+        // exceeds the runtime's own seek threshold — the same expression
+        // `emitKeySetSemiJoin` uses for its `push` decision — the seek is very
+        // unlikely to fire and the rewrite is then pure loss: the same scan the
+        // merge join did, plus a probe Set the merge join never built. Heuristic
+        // in both directions (the estimate is advisory, and it counts ROWS where
+        // the runtime counts DISTINCT non-null keys), so it can only cost an
+        // optimization, never a row. Absent estimate ⇒ proceed, the same posture
+        // the rest of the rule takes toward advisory numbers. The PHYSICAL
+        // estimate is read because the logical `estimatedRows` getter reads
+        // `undefined` through a physical access node. NOTE: inert on the memory
+        // backend today (its row estimate for a freshly-populated table reads 0)
+        // — this gate exists for modules that report real cardinality.
+        const keyRows = node.right.physical.estimatedRows;
+        if (keyRows !== undefined && keyRows > Math.min(pushdown.maxKeys, pushdown.breakEvenKeys)) {
+            log('decline: key source estimate %d exceeds the seek threshold min(%d, %d)', keyRows, pushdown.maxKeys, pushdown.breakEvenKeys);
+            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);
+    // For a seek target, re-apply the module-enforced predicate DIRECTLY above
+    // the node — inside the peeled wrappers, because a peeled trivial Project
+    // may not carry the predicate's columns. The node exposes the target's full
+    // attribute set, so the predicate's column references resolve here.
+    const replacement = residual !== undefined
+        ? new FilterNode(leaf.scope, keySetJoin, residual)
+        : keySetJoin;
+    log('Replaced %s semi join with KeySetSemiJoin on %s.%s via %s (breakEven=%d%s)', node instanceof MergeJoinNode ? 'merge' : 'hash', leaf.tableSchema.name, leaf.tableSchema.columns[cols.seekCol]?.name, pushdown.indexName, pushdown.breakEvenKeys, residual !== undefined ? ', pushed predicate re-applied' : '');
+    return rebuildChain(node.left, leaf, replacement);
 }
 //# sourceMappingURL=rule-key-set-seek.js.map

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

@@ -1 +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"}
+{"version":3,"file":"rule-key-set-seek.js","sourceRoot":"","sources":["../../../../../src/planner/rules/access/rule-key-set-seek.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyHG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,2BAA2B,CAAC;AAGzD,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,EAAE,aAAa,EAAE,MAAM,gCAAgC,CAAC;AAC/D,OAAO,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,wBAAwB,EAA8C,MAAM,uCAAuC,CAAC;AACvK,OAAO,EAAE,aAAa,EAAE,aAAa,EAAE,MAAM,mCAAmC,CAAC;AACjF,OAAO,EAAE,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACnD,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,kBAAkB,EAAE,MAAM,iCAAiC,CAAC;AACrE,OAAO,EAAE,yBAAyB,EAAE,MAAM,wCAAwC,CAAC;AACnF,OAAO,EAAE,uBAAuB,EAAE,MAAM,qCAAqC,CAAC;AAC9E,OAAO,EAAE,uBAAuB,EAAE,0BAA0B,EAAE,MAAM,8BAA8B,CAAC;AACnG,OAAO,EAAE,wBAAwB,EAAE,YAAY,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AACrG,OAAO,EAAE,sBAAsB,EAAE,MAAM,mCAAmC,CAAC;AAC3E,OAAO,EACN,kBAAkB,GAGlB,MAAM,mCAAmC,CAAC;AAG3C,MAAM,GAAG,GAAG,YAAY,CAAC,6BAA6B,CAAC,CAAC;AAExD;;;;;;;GAOG;AACH,SAAS,SAAS,CAAC,IAAmC;IACrD,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;AAaD;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,SAAS,SAAS,CAAC,IAAwB;IAC1C,MAAM,IAAI,GAAG,wBAAwB,CAAC,IAAI,CAAC,CAAC;IAC5C,IAAI,CAAC,IAAI,EAAE,CAAC;QACX,GAAG,CAAC,4EAA4E,CAAC,CAAC;QAClF,OAAO,IAAI,CAAC;IACb,CAAC;IACD,IAAI,IAAI,YAAY,aAAa,EAAE,CAAC;QACnC,OAAO,aAAa,CAAC,IAAI,CAAC,CAAC;IAC5B,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,OAAO,EAAE,IAAI,EAAE,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CAAC,IAAmB;IACzC,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC;IAC3B,0EAA0E;IAC1E,6EAA6E;IAC7E,wDAAwD;IACxD,qEAAqE;IACrE,IAAI,EAAE,CAAC,KAAK,KAAK,SAAS,IAAI,EAAE,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;QACvD,GAAG,CAAC,kDAAkD,CAAC,CAAC;QACxD,OAAO,IAAI,CAAC;IACb,CAAC;IACD,4EAA4E;IAC5E,sEAAsE;IACtE,IAAI,CAAC,IAAI,CAAC,iBAAiB,IAAI,IAAI,CAAC,iBAAiB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACpE,GAAG,CAAC,kDAAkD,CAAC,CAAC;QACxD,OAAO,IAAI,CAAC;IACb,CAAC;IACD,MAAM,QAAQ,GAAG,0BAA0B,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC;IACjG,IAAI,CAAC,QAAQ,EAAE,CAAC;QACf,GAAG,CAAC,+DAA+D,CAAC,CAAC;QACrE,OAAO,IAAI,CAAC;IACb,CAAC;IACD,2EAA2E;IAC3E,wEAAwE;IACxE,wEAAwE;IACxE,oEAAoE;IACpE,yBAAyB;IACzB,IAAI,uBAAuB,CAAC,QAAQ,CAAC,EAAE,CAAC;QACvC,GAAG,CAAC,gEAAgE,CAAC,CAAC;QACtE,OAAO,IAAI,CAAC;IACb,CAAC;IACD,4EAA4E;IAC5E,sEAAsE;IACtE,2EAA2E;IAC3E,0EAA0E;IAC1E,mEAAmE;IACnE,IAAI,oBAAoB,CAAC,IAAI,CAAC,EAAE,CAAC;QAChC,GAAG,CAAC,uDAAuD,CAAC,CAAC;QAC7D,OAAO,IAAI,CAAC;IACb,CAAC;IACD,0EAA0E;IAC1E,4EAA4E;IAC5E,0EAA0E;IAC1E,uEAAuE;IACvE,+CAA+C;IAC/C,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC9B,GAAG,CAAC,qEAAqE,CAAC,CAAC;QAC3E,OAAO,IAAI,CAAC;IACb,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC;AAC3B,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,2EAA2E;IAC3E,2EAA2E;IAC3E,2EAA2E;IAC3E,6EAA6E;IAC7E,0EAA0E;IAC1E,2EAA2E;IAC3E,2EAA2E;IAC3E,2BAA2B;IAC3B,EAAE;IACF,2EAA2E;IAC3E,8EAA8E;IAC9E,0EAA0E;IAC1E,4EAA4E;IAC5E,6DAA6D;IAC7D,yEAAyE;IACzE,4EAA4E;IAC5E,0EAA0E;IAC1E,4EAA4E;IAC5E,2EAA2E;IAC3E,yEAAyE;IACzE,6EAA6E;IAC7E,gFAAgF;IAChF,4EAA4E;IAC5E,8BAA8B;IAC9B,IAAI,CAAC,kBAAkB,CAAC,UAAU,CAAC,WAAW,EAAE,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QACtE,GAAG,CAAC,kDAAkD,EACrD,UAAU,CAAC,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACxD,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,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,yEAAyE;QACzE,mEAAmE;QACnE,uEAAuE;QACvE,mEAAmE;QACnE,sCAAsC;QACtC,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,YAAY,EAAE,IAAI,YAAY,aAAa;gBAC1C,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,aAAa;gBAC/C,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI;SACf,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;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,kBAAkB,GAAG,IAAI,CAAC;AAEhC;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAS,oBAAoB,CAC5B,KAA+F;IAE/F,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,YAAY,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,KAAK,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;AAC3F,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,IAAc,EAAE,OAAmB;IACjE,IAAI,CAAC,CAAC,IAAI,YAAY,aAAa,CAAC,IAAI,CAAC,CAAC,IAAI,YAAY,aAAa,CAAC;QAAE,OAAO,IAAI,CAAC;IACtF,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAElC,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAC;IAC3B,MAAM,EAAE,IAAI,EAAE,QAAQ,EAAE,GAAG,QAAQ,CAAC;IAEpC,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,sEAAsE;IACtE,4EAA4E;IAC5E,2EAA2E;IAC3E,4EAA4E;IAC5E,uEAAuE;IACvE,0EAA0E;IAC1E,iEAAiE;IACjE,yBAAyB;IACzB,IAAI,IAAI,YAAY,aAAa,IAAI,IAAI,CAAC,mBAAmB;WACzD,CAAC,wBAAwB,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC;QAC/C,GAAG,CAAC,oGAAoG,CAAC,CAAC;QAC1G,OAAO,IAAI,CAAC;IACb,CAAC;IAED,IAAI,IAAI,YAAY,aAAa,EAAE,CAAC;QACnC,oEAAoE;QACpE,wEAAwE;QACxE,uEAAuE;QACvE,oEAAoE;QACpE,wEAAwE;QACxE,yEAAyE;QACzE,IAAI,CAAC,wBAAwB,CAAC,IAAI,EAAE,QAAQ,CAAC,EAAE,CAAC;YAC/C,GAAG,CAAC,iFAAiF,CAAC,CAAC;YACvF,OAAO,IAAI,CAAC;QACb,CAAC;QACD,kEAAkE;QAClE,wEAAwE;QACxE,iEAAiE;QACjE,uEAAuE;QACvE,wEAAwE;QACxE,yEAAyE;QACzE,yEAAyE;QACzE,qEAAqE;QACrE,yEAAyE;QACzE,mEAAmE;QACnE,oEAAoE;QACpE,wEAAwE;QACxE,yEAAyE;QACzE,+DAA+D;QAC/D,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,aAAa,CAAC;QAClD,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC;YAC3F,GAAG,CAAC,wEAAwE,EAC3E,OAAO,EAAE,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,aAAa,CAAC,CAAC;YACpD,OAAO,IAAI,CAAC;QACb,CAAC;IACF,CAAC;IAED,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,2EAA2E;IAC3E,0EAA0E;IAC1E,4EAA4E;IAC5E,oEAAoE;IACpE,MAAM,WAAW,GAAG,QAAQ,KAAK,SAAS;QACzC,CAAC,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,UAAU,EAAE,QAAQ,CAAC;QAClD,CAAC,CAAC,UAAU,CAAC;IACd,GAAG,CAAC,4EAA4E,EAC/E,IAAI,YAAY,aAAa,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,EAChD,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,EAC1C,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,+BAA+B,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAChE,OAAO,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC,CAAC;AACnD,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;AAqN7D,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;AAyN7D,wBAAgB,wBAAwB,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,UAAU,GAAG,QAAQ,GAAG,IAAI,CAQ1F"}