@quereus/quereus 4.21.1 → 4.23.0

package/dist/src/core/database-cardinality-feedback.js

@@ -0,0 +1,547 @@
+/**
+ * The observed row-count overlay: exact base-table sizes seen during execution.
+ *
+ * One per `Database`. The planner reads it through `plannedRowCount`
+ * (`planner/stats/table-cardinality.ts`), where an answering entry outranks the
+ * catalog's `ANALYZE` count and a module's approximate count, but not a module's
+ * exact one, and through `plannedRowsPerKey`, where an entry's rows per key answers
+ * unless the catalog's statistics cover the column set. This module owns the record
+ * policy — which observations are worth keeping, and when one has moved far enough
+ * from what plans were costed against to call it a *shift* — and the entries' lifetime.
+ *
+ * Validity is schema identity: an entry answers only for the exact `TableSchema`
+ * object it was observed under. Any swap (`ANALYZE`, `ALTER TABLE`, drop and
+ * re-create) silences it, and a schema-change listener evicts it. The identity
+ * check is the correctness guard; the listener is memory hygiene.
+ *
+ * An entry holds an exact count from a complete read, a floor ("at least N rows") from a
+ * partial one, or both; a floor only ever raises an estimate, and an exact count clears it.
+ * Beside them it keeps, per equality column set the table is seeked on through a
+ * non-unique index, a running mean of the rows one key matched ({@link PerKeyEntry}).
+ *
+ * Execution feeds it through {@link CardinalityFeedbackManager.publish}, which admits
+ * only observations of committed state: one made inside a transaction is held until
+ * that transaction commits ({@link CardinalityFeedbackManager.onCommitted}) and
+ * dropped if it rolls back ({@link CardinalityFeedbackManager.onRolledBack}).
+ *
+ * A shift reaches prepared statements through `onShift`; each statement paces its
+ * re-plans with a {@link FeedbackReplanState}. A module-reported size, which moves with
+ * no observation at all, is re-checked by each statement at execution start against the
+ * size its plan was costed with ({@link ReportedSizeSnapshot}).
+ *
+ * Nothing here is persisted: a new `Database` starts empty. See
+ * docs/progressive-optimizer.md §3.2–3.6.
+ */
+import { createLogger } from '../common/logger.js';
+import { CardinalityObservations, columnSetKey } from '../runtime/cardinality-observations.js';
+import { catalogRowCount, moduleReportsRowCount, plannedRowCount, } from '../planner/stats/table-cardinality.js';
+const log = createLogger('core:cardinality-feedback');
+const debugLog = log.extend('debug');
+/**
+ * Samples a rows-per-key mean tracks exactly before it becomes an exponential average:
+ * up to this many, the mean is the exact running mean of every sample; past it, each
+ * sample weighs 1/32, so a changing distribution is followed rather than averaged away.
+ * A module constant, not a tuning knob — nothing a deployment would turn.
+ */
+const ROWS_PER_KEY_WINDOW = 32;
+/**
+ * Distance between two counts as a ratio ≥ 1. The `+ 1` on both sides keeps a zero
+ * count finite and makes tiny counts compare sanely (0 vs 3 is 4×, not infinite).
+ */
+function rowCountSpread(a, b) {
+    return (Math.max(a, b) + 1) / (Math.min(a, b) + 1);
+}
+/** The overlay's key for a table: lowercased `schema.table`. Shifts are reported under it. */
+export function overlayTableKey(schemaName, tableName) {
+    return `${schemaName}.${tableName}`.toLowerCase();
+}
+function tableKey(table) {
+    return overlayTableKey(table.schemaName, table.name);
+}
+function newEntry(schema, baselineRows) {
+    return { schema, rows: undefined, atLeast: undefined, baselineRows, observations: 0, shifts: 0, perKey: new Map() };
+}
+/**
+ * Folds a batch of `count` samples averaging `batchMean` into `entry` (docs/progressive-optimizer.md
+ * §3.4): with `n` samples already held the batch weighs `min(1, count / min(n + count, WINDOW))` —
+ * the exact running mean up to the window, 1/32 per sample past it, and a batch at least the
+ * window's size replaces the mean outright.
+ */
+function foldRowsPerKey(entry, batchMean, count) {
+    const weight = Math.min(1, count / Math.min(entry.samples + count, ROWS_PER_KEY_WINDOW));
+    entry.mean += (batchMean - entry.mean) * weight;
+    entry.samples += count;
+}
+/** Cap on the cooldown's doubling: re-plans past the seventh wait `64 × replanCooldown` executions. */
+const MAX_COOLDOWN_DOUBLINGS = 6;
+/**
+ * One prepared statement's feedback re-plan cooldown (docs/progressive-optimizer.md §3.6).
+ * A shift marks the cached plan; the mark is acted on at an execution start, never
+ * mid-execution. The first feedback re-plan is immediate; re-plan `k + 1` waits until the
+ * statement has executed `cooldown × 2^min(k − 1, 6)` times since re-plan `k` — a mark
+ * arriving sooner stays pending until then.
+ */
+export class FeedbackReplanState {
+    marked = false;
+    /** Feedback re-plans so far. */
+    replans = 0;
+    /** Executions started since the last feedback re-plan, the re-planning one included. */
+    executionsSinceReplan = 0;
+    /** A table the cached plan reads shifted. */
+    markShift() {
+        this.marked = true;
+    }
+    /** The cached plan was dropped for any reason; whatever compiles next reads the current overlay. */
+    onPlanDropped() {
+        this.marked = false;
+    }
+    /** Counts one execution; true when the marked plan must be dropped before it runs. */
+    onExecutionStart(cooldown) {
+        const due = this.marked && (this.replans === 0 || this.executionsSinceReplan >= this.requiredExecutions(cooldown));
+        if (due) {
+            this.marked = false;
+            this.replans++;
+            this.executionsSinceReplan = 0;
+        }
+        this.executionsSinceReplan++;
+        return due;
+    }
+    requiredExecutions(cooldown) {
+        return cooldown * 2 ** Math.min(this.replans - 1, MAX_COOLDOWN_DOUBLINGS);
+    }
+}
+/**
+ * The planned sizes, as of one compile, of the tables the plan reads whose module reports
+ * its own count (docs/progressive-optimizer.md §3.6). Such a count moves on every write
+ * with no event the planner hears, and a plan that no longer reads the table in full
+ * never produces an observation, so nothing else notices that a table planned at 10 rows
+ * now holds a million. A prepared statement compares its snapshot with the current
+ * planned sizes at each execution start and treats a drift like an overlay shift.
+ *
+ * Planned sizes, not raw module answers, are compared, so an approximate count the
+ * overlay outranks drifts only when what planning would use drifts.
+ */
+export class ReportedSizeSnapshot {
+    sizes;
+    static empty = new ReportedSizeSnapshot([]);
+    constructor(sizes) {
+        this.sizes = sizes;
+    }
+    /**
+     * Called right after a compile, in the same synchronous turn, so each size is the one
+     * the plan's table references were costed with. Tables whose module has no
+     * `getRowCount` are left out: overlay shifts and schema changes already cover them.
+     */
+    static capture(db, dependencies) {
+        // NOTE: write targets are kept too (dependencies do not record read vs write), so a
+        // prepared `insert` driving a bulk load re-plans at each 10× of its target, paced by
+        // the cooldown; if those re-plans ever show up in a profile, record dependency roles
+        // in the builder and keep only read tables here.
+        const sizes = [];
+        for (const dep of dependencies) {
+            if (dep.type !== 'table' || !dep.schemaName)
+                continue;
+            const table = db.schemaManager.findTable(dep.objectName, dep.schemaName);
+            if (table && moduleReportsRowCount(db, table))
+                sizes.push({ table, rows: currentPlannedRows(db, table) });
+        }
+        return sizes.length > 0 ? new ReportedSizeSnapshot(sizes) : ReportedSizeSnapshot.empty;
+    }
+    /**
+     * True when some table's planned size has moved `shiftFactor` from the captured one
+     * with the larger side above `minRows` — the overlay's shift rule (§3.4). A table whose
+     * catalog object was replaced is skipped: that schema change already dropped the plan.
+     */
+    drifted(db) {
+        if (this.sizes.length === 0)
+            return false;
+        const { shiftFactor, minRows } = db.optimizer.tuning.cardinalityFeedback;
+        for (const { table, rows } of this.sizes) {
+            if (db.schemaManager.findTable(table.name, table.schemaName) !== table)
+                continue;
+            const now = currentPlannedRows(db, table);
+            if (Math.max(now, rows) > minRows && rowCountSpread(now, rows) >= shiftFactor) {
+                debugLog('Reported size drift on %s: planned %d, now %d rows', tableKey(table), rows, now);
+                return true;
+            }
+        }
+        return false;
+    }
+}
+/** What planning would size `table` at now; an unknown size reads as `defaultRowEstimate`, as in the overlay's record policy. */
+function currentPlannedRows(db, table) {
+    return plannedRowCount(table, db._rowCountSources) ?? db.optimizer.tuning.defaultRowEstimate;
+}
+export class CardinalityFeedbackManager {
+    ctx;
+    /**
+     * Lowercased `schema.table` → entry, the change-log / work-counter key convention.
+     * `Map` insertion order doubles as recency: a hit or a record re-inserts, so the
+     * first key is the least recently used.
+     */
+    entries = new Map();
+    /**
+     * Observations made inside the open transaction, held until it ends; same key as
+     * `entries`, last count and largest floor per table win. Bounded by the distinct
+     * tables one transaction observes.
+     */
+    pending = new Map();
+    /** {@link onRolledBack} calls so far; each execution's sink records it at start. */
+    rollbacks = 0;
+    unsubscribeSchemaChanges = null;
+    constructor(ctx) {
+        this.ctx = ctx;
+        this.subscribeToSchemaChanges();
+    }
+    observedRows(table) {
+        const key = tableKey(table);
+        const entry = this.entries.get(key);
+        if (!entry || entry.schema !== table)
+            return undefined;
+        this.touch(key, entry);
+        return entry;
+    }
+    /** The running mean for `columns` on `table`, under the same identity rule as {@link observedRows}; a hit refreshes the table's recency. */
+    observedRowsPerKey(table, columns) {
+        const key = tableKey(table);
+        const entry = this.entries.get(key);
+        if (!entry || entry.schema !== table)
+            return undefined;
+        const keyEntry = entry.perKey.get(columnSetKey(columns));
+        if (!keyEntry)
+            return undefined;
+        this.touch(key, entry);
+        return keyEntry.mean;
+    }
+    /**
+     * Offer one exact row count of `table`, observed by a complete enumeration of
+     * committed state. Applies the record policy (docs/progressive-optimizer.md §3.4):
+     * ignored when the schema object is superseded or when both the observation and the
+     * current estimate are small; otherwise recorded — clearing any floor, which the newer
+     * complete count supersedes — and reported through `onShift` when it has moved
+     * `shiftFactor` from the entry's baseline.
+     */
+    record(table, rows) {
+        if (this.isSuperseded(table))
+            return;
+        const policy = this.ctx.getTuning().cardinalityFeedback;
+        const key = tableKey(table);
+        const existing = this.validEntry(key, table);
+        // NOTE: an exactly module-sized table still records an entry, which `plannedRowCount`
+        // never reads while the module answers — one LRU slot each; if `maxTables` pressure
+        // ever matters, skip recording when the module's count is exact.
+        const before = this.plannedBefore(table, existing);
+        if (Math.max(before, rows) <= policy.minRows)
+            return;
+        const entry = this.upsert(key, existing ?? newEntry(table, before));
+        entry.rows = rows;
+        entry.atLeast = undefined;
+        debugLog('Recorded %d rows for %s (was %d, baseline %d)', rows, key, before, entry.baselineRows);
+        this.shiftIfMoved(key, entry, rows);
+    }
+    /**
+     * Offer one floor for `table`: a read of committed state yielded `rows` distinct rows of
+     * it, so it holds at least that many (docs/progressive-optimizer.md §3.4). Recorded only
+     * when it exceeds both what planning would use now and `minRows`, so a floor never
+     * lowers an estimate and never makes an unknown table look smaller than the default it
+     * plans at today. Shifts like a count; floors only raise, so they cannot oscillate.
+     */
+    recordAtLeast(table, rows) {
+        if (this.isSuperseded(table))
+            return;
+        const policy = this.ctx.getTuning().cardinalityFeedback;
+        const key = tableKey(table);
+        const existing = this.validEntry(key, table);
+        const before = this.plannedBefore(table, existing);
+        if (rows <= before || rows <= policy.minRows)
+            return;
+        const entry = this.upsert(key, existing ?? newEntry(table, before));
+        entry.atLeast = Math.max(entry.atLeast ?? 0, rows);
+        debugLog('Recorded at least %d rows for %s (was %d, baseline %d)', rows, key, before, entry.baselineRows);
+        this.shiftIfMoved(key, entry, rows);
+    }
+    /**
+     * Offer `count` samples of rows per key for `spec`'s column set on `table`, summing to
+     * `sum` rows — one sample per exhausted equality seek with non-NULL keys
+     * (docs/progressive-optimizer.md §3.4). Ignored under a superseded schema, and unless
+     * the table's planned size exceeds `minRows`: below that every plan finishes fast, and
+     * the gate keeps small-table plans unchanged exactly as the count gate does. So a table
+     * of unknown size learns rows per key only once its size is learned (a complete scan,
+     * a floor, or a module count above the gate); publication applies per-key batches
+     * after the same execution's counts and floors, so one execution can open the gate for
+     * itself. A new column-set entry's baseline is the rows per key the plan was priced
+     * with; the table remembers at most `maxKeySetsPerTable` sets, least recently recorded
+     * evicted. Accepted bias: frequently probed keys weigh more than a uniform sample would.
+     * Reported through `onShift` under the table's key when the folded mean has moved
+     * `shiftFactor` from the set's baseline — the count rule, applied to the mean.
+     */
+    recordRowsPerKey(table, spec, sum, count) {
+        if (count <= 0 || this.isSuperseded(table))
+            return;
+        const policy = this.ctx.getTuning().cardinalityFeedback;
+        const key = tableKey(table);
+        const existing = this.validEntry(key, table);
+        const before = this.plannedBefore(table, existing);
+        if (before <= policy.minRows)
+            return;
+        // NOTE: a set the catalog's statistics cover is recorded too, though `plannedRowsPerKey`
+        // never consults it under this schema object (an `ANALYZE` swaps the object before
+        // coverage can change), so under a stale catalog its first record can shift once and
+        // re-plan statements that land the same plan; if that re-plan ever shows in a profile,
+        // skip the record when `catalogCoversColumns` holds.
+        const entry = this.upsert(key, existing ?? newEntry(table, before));
+        const batchMean = sum / count;
+        let keyEntry = entry.perKey.get(spec.key);
+        if (keyEntry) {
+            entry.perKey.delete(spec.key);
+            foldRowsPerKey(keyEntry, batchMean, count);
+        }
+        else {
+            keyEntry = { columns: spec.columns, mean: batchMean, samples: count, baseline: spec.plannedRowsPerKey, shifts: 0 };
+        }
+        entry.perKey.set(spec.key, keyEntry);
+        for (const staleKey of entry.perKey.keys()) {
+            if (entry.perKey.size <= policy.maxKeySetsPerTable)
+                break;
+            entry.perKey.delete(staleKey);
+        }
+        debugLog('Recorded %d rows per key over %d samples for %s (%s) (mean now %d, baseline %d)', batchMean, count, key, spec.key, keyEntry.mean, keyEntry.baseline);
+        this.shiftIfRowsPerKeyMoved(key, spec.key, keyEntry);
+    }
+    /**
+     * Offer one finished execution's observations (docs/progressive-optimizer.md §3.5).
+     * A committed read (`readCommitted`) or an execution that ended with no transaction
+     * open saw committed state and is recorded now. Anything else may include the open
+     * transaction's uncommitted writes, so it is held for {@link onCommitted} — unless a
+     * rollback ran during the execution (typically a failing statement's own statement
+     * savepoint, which fires before publication): then a completed scan may have counted
+     * rows that no longer exist, and the whole execution is discarded.
+     */
+    publish(observations, options) {
+        if (options.readCommitted) {
+            this.recordAll(observations);
+        }
+        else if (observations.rollbacksAtStart !== this.rollbacks) {
+            debugLog('Discarded observations: work was rolled back during the execution');
+        }
+        else if (this.ctx.getAutocommit()) {
+            this.recordAll(observations);
+        }
+        else {
+            this.holdAll(observations);
+        }
+    }
+    /**
+     * A fresh per-execution sink, stamped so {@link publish} can tell whether a rollback ran
+     * under it, and carrying the record floor so it can drop floors that could never record.
+     */
+    beginObservations() {
+        return new CardinalityObservations(this.rollbacks, this.ctx.getTuning().cardinalityFeedback.minRows);
+    }
+    /**
+     * The open transaction committed: record what it held, except tables it wrote.
+     * Such an observation was made mid-transaction, possibly before later writes in the
+     * same transaction, and the change log cannot say which came first. `changedCounts` is
+     * the change log keyed like `entries` — every table the transaction wrote, even one
+     * whose writes cancelled out — and is not built when nothing is held.
+     */
+    onCommitted(changedCounts) {
+        // NOTE: external-change ingestion with `captureChanges: false` writes rows the change
+        // log never sees, so a count held from before such a batch is applied. Only an estimate
+        // lags; if those batches ever routinely shrink or grow tables, have them veto here too.
+        if (this.pending.size === 0)
+            return;
+        try {
+            const changed = changedCounts();
+            for (const [key, held] of this.pending) {
+                if (changed.has(key)) {
+                    debugLog('Dropped observations of %s: the committing transaction wrote it', key);
+                    continue;
+                }
+                this.recordHeld(held);
+            }
+        }
+        finally {
+            this.pending.clear();
+        }
+    }
+    /** The open transaction, or some of its work, was undone: forget everything held. */
+    onRolledBack() {
+        this.pending.clear();
+        this.rollbacks++;
+    }
+    /** Forget every observation, held ones included; later compiles read the catalog only. */
+    clear() {
+        this.entries.clear();
+        this.pending.clear();
+    }
+    /** Valid entries, by value, least recently used first. Does not refresh recency. */
+    snapshot() {
+        const out = [];
+        for (const entry of this.entries.values()) {
+            const { schema } = entry;
+            if (this.ctx.schemaManager.findTable(schema.name, schema.schemaName) !== schema)
+                continue;
+            out.push({
+                schemaName: schema.schemaName,
+                tableName: schema.name,
+                rows: entry.rows,
+                atLeast: entry.atLeast,
+                catalogRows: catalogRowCount(schema),
+                baselineRows: entry.baselineRows,
+                observations: entry.observations,
+                shifts: entry.shifts,
+                perKey: [...entry.perKey.values()].map(keyEntry => ({
+                    keyColumns: keyEntry.columns.map(i => schema.columns[i].name),
+                    rowsPerKey: keyEntry.mean,
+                    samples: keyEntry.samples,
+                    baselineRowsPerKey: keyEntry.baseline,
+                    shifts: keyEntry.shifts,
+                })),
+            });
+        }
+        return out;
+    }
+    dispose() {
+        if (this.unsubscribeSchemaChanges) {
+            this.unsubscribeSchemaChanges();
+            this.unsubscribeSchemaChanges = null;
+        }
+        this.clear();
+    }
+    subscribeToSchemaChanges() {
+        const notifier = this.ctx.schemaManager.getChangeNotifier();
+        this.unsubscribeSchemaChanges = notifier.addListener((event) => {
+            // Keyed by `oldObject`, not the event's name: a rename reports the NEW name.
+            // `DETACH` fires no per-table events; its tables' entries never match again
+            // and age out under the LRU cap.
+            if (event.type === 'table_modified' || event.type === 'table_removed') {
+                this.entries.delete(tableKey(event.oldObject));
+            }
+        });
+    }
+    /**
+     * Exact counts first: a floor at or below the count just recorded is then ignored.
+     * Rows per key last, so a count or floor from the same execution can open its table-size gate.
+     */
+    recordAll(observations) {
+        for (const [table, rows] of observations.entries()) {
+            this.record(table, rows);
+        }
+        for (const [table, rows] of observations.lowerBounds()) {
+            this.recordAtLeast(table, rows);
+        }
+        for (const [table, { spec, sum, count }] of observations.rowsPerKey()) {
+            this.recordRowsPerKey(table, spec, sum, count);
+        }
+    }
+    holdAll(observations) {
+        for (const [table, rows] of observations.entries()) {
+            this.held(table).rows = rows;
+        }
+        for (const [table, rows] of observations.lowerBounds()) {
+            const held = this.held(table);
+            held.atLeast = Math.max(held.atLeast ?? 0, rows);
+        }
+        for (const [table, { spec, sum, count }] of observations.rowsPerKey()) {
+            const held = this.held(table).perKey;
+            const heldSamples = held.get(spec.key);
+            if (heldSamples) {
+                heldSamples.sum += sum;
+                heldSamples.count += count;
+            }
+            else {
+                held.set(spec.key, { spec, sum, count });
+            }
+        }
+    }
+    /** What is held for `table`; anything held under an older schema object for its name is superseded. */
+    held(table) {
+        const key = tableKey(table);
+        const existing = this.pending.get(key);
+        if (existing?.table === table)
+            return existing;
+        const fresh = { table, rows: undefined, atLeast: undefined, perKey: new Map() };
+        this.pending.set(key, fresh);
+        return fresh;
+    }
+    /** As {@link recordAll}: the count first, so a floor it already covers is ignored, and rows per key last. */
+    recordHeld({ table, rows, atLeast, perKey }) {
+        if (rows !== undefined)
+            this.record(table, rows);
+        if (atLeast !== undefined)
+            this.recordAtLeast(table, atLeast);
+        for (const { spec, sum, count } of perKey.values())
+            this.recordRowsPerKey(table, spec, sum, count);
+    }
+    isSuperseded(table) {
+        if (this.ctx.schemaManager.findTable(table.name, table.schemaName) === table)
+            return false;
+        debugLog('Ignored an observation of %s.%s: made under a superseded schema', table.schemaName, table.name);
+        return true;
+    }
+    /**
+     * What planning would use for `table` right now — `existing` ranked with the module's
+     * count and the catalog's (§3.3), else the default — so an exactly module-sized table
+     * compares against the module and a scan agreeing with it shifts nothing.
+     */
+    plannedBefore(table, existing) {
+        return plannedRowCount(table, {
+            observedRows: () => existing,
+            reportedRows: t => this.ctx.reportedRows(t),
+        }) ?? this.ctx.getTuning().defaultRowEstimate;
+    }
+    /** Counts one recorded observation on `entry`, makes it the most recent, and enforces the cap. */
+    upsert(key, entry) {
+        entry.observations++;
+        this.touch(key, entry);
+        this.evictBeyond(this.ctx.getTuning().cardinalityFeedback.maxTables);
+        return entry;
+    }
+    /** Reports a shift through `onShift` when `rows` has moved `shiftFactor` from the entry's baseline. */
+    shiftIfMoved(key, entry, rows) {
+        if (rowCountSpread(rows, entry.baselineRows) < this.ctx.getTuning().cardinalityFeedback.shiftFactor)
+            return;
+        log('Shift on %s: baseline %d -> %d rows', key, entry.baselineRows, rows);
+        entry.baselineRows = rows;
+        entry.shifts++;
+        this.ctx.onShift(key);
+    }
+    /**
+     * Reports a shift through `onShift` when a column set's mean has moved `shiftFactor`
+     * from its baseline. The table key is reported, not the set: a statement that reads the
+     * table re-plans and every seek node in it re-snapshots the overlay (§3.6). A set's first
+     * record cannot shift when its plan was already priced from the mean (the baseline is what
+     * the plan used); a set re-created after eviction carries the module's estimate again and
+     * may shift once, landing the same plan.
+     */
+    shiftIfRowsPerKeyMoved(key, setKey, keyEntry) {
+        if (rowCountSpread(keyEntry.mean, keyEntry.baseline) < this.ctx.getTuning().cardinalityFeedback.shiftFactor)
+            return;
+        log('Shift on %s (%s): rows per key baseline %d -> %d', key, setKey, keyEntry.baseline, keyEntry.mean);
+        keyEntry.baseline = keyEntry.mean;
+        keyEntry.shifts++;
+        this.ctx.onShift(key);
+    }
+    /** The entry under `key` if it was observed against `table`; a stale one is replaced on record. */
+    validEntry(key, table) {
+        const entry = this.entries.get(key);
+        return entry?.schema === table ? entry : undefined;
+    }
+    touch(key, entry) {
+        this.entries.delete(key);
+        this.entries.set(key, entry);
+    }
+    /**
+     * Drop least-recently-used entries past the cap. No `onShift`: plans already built
+     * keep their snapshot, and the next compile falls back to catalog or default numbers.
+     */
+    evictBeyond(maxTables) {
+        for (const key of this.entries.keys()) {
+            if (this.entries.size <= maxTables)
+                return;
+            this.entries.delete(key);
+        }
+    }
+}
+//# sourceMappingURL=database-cardinality-feedback.js.map

package/dist/src/core/database-cardinality-feedback.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"database-cardinality-feedback.js","sourceRoot":"","sources":["../../../src/core/database-cardinality-feedback.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAiCG;AAEH,OAAO,EAAE,YAAY,EAAE,MAAM,qBAAqB,CAAC;AAEnD,OAAO,EAAE,uBAAuB,EAAE,YAAY,EAA+C,MAAM,wCAAwC,CAAC;AAC5I,OAAO,EACN,eAAe,EAAE,qBAAqB,EAAE,eAAe,GAEvD,MAAM,uCAAuC,CAAC;AAO/C,MAAM,GAAG,GAAG,YAAY,CAAC,2BAA2B,CAAC,CAAC;AACtD,MAAM,QAAQ,GAAG,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;AA0FrC;;;;;GAKG;AACH,MAAM,mBAAmB,GAAG,EAAE,CAAC;AAE/B;;;GAGG;AACH,SAAS,cAAc,CAAC,CAAS,EAAE,CAAS;IAC3C,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;AACpD,CAAC;AAED,8FAA8F;AAC9F,MAAM,UAAU,eAAe,CAAC,UAAkB,EAAE,SAAiB;IACpE,OAAO,GAAG,UAAU,IAAI,SAAS,EAAE,CAAC,WAAW,EAAE,CAAC;AACnD,CAAC;AAED,SAAS,QAAQ,CAAC,KAAkB;IACnC,OAAO,eAAe,CAAC,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;AACtD,CAAC;AAED,SAAS,QAAQ,CAAC,MAAmB,EAAE,YAAoB;IAC1D,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,YAAY,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;AACrH,CAAC;AAED;;;;;GAKG;AACH,SAAS,cAAc,CAAC,KAAkB,EAAE,SAAiB,EAAE,KAAa;IAC3E,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,GAAG,KAAK,EAAE,mBAAmB,CAAC,CAAC,CAAC;IACzF,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC;IAChD,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC;AACxB,CAAC;AAED,uGAAuG;AACvG,MAAM,sBAAsB,GAAG,CAAC,CAAC;AAEjC;;;;;;GAMG;AACH,MAAM,OAAO,mBAAmB;IACvB,MAAM,GAAG,KAAK,CAAC;IACvB,gCAAgC;IACxB,OAAO,GAAG,CAAC,CAAC;IACpB,wFAAwF;IAChF,qBAAqB,GAAG,CAAC,CAAC;IAElC,6CAA6C;IAC7C,SAAS;QACR,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;IACpB,CAAC;IAED,oGAAoG;IACpG,aAAa;QACZ,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,sFAAsF;IACtF,gBAAgB,CAAC,QAAgB;QAChC,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,OAAO,KAAK,CAAC,IAAI,IAAI,CAAC,qBAAqB,IAAI,IAAI,CAAC,kBAAkB,CAAC,QAAQ,CAAC,CAAC,CAAC;QACnH,IAAI,GAAG,EAAE,CAAC;YACT,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;YACpB,IAAI,CAAC,OAAO,EAAE,CAAC;YACf,IAAI,CAAC,qBAAqB,GAAG,CAAC,CAAC;QAChC,CAAC;QACD,IAAI,CAAC,qBAAqB,EAAE,CAAC;QAC7B,OAAO,GAAG,CAAC;IACZ,CAAC;IAEO,kBAAkB,CAAC,QAAgB;QAC1C,OAAO,QAAQ,GAAG,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,GAAG,CAAC,EAAE,sBAAsB,CAAC,CAAC;IAC3E,CAAC;CACD;AAQD;;;;;;;;;;GAUG;AACH,MAAM,OAAO,oBAAoB;IAGK;IAFrC,MAAM,CAAU,KAAK,GAAG,IAAI,oBAAoB,CAAC,EAAE,CAAC,CAAC;IAErD,YAAqC,KAAkC;QAAlC,UAAK,GAAL,KAAK,CAA6B;IAAG,CAAC;IAE3E;;;;OAIG;IACH,MAAM,CAAC,OAAO,CAAC,EAAY,EAAE,YAAyC;QACrE,oFAAoF;QACpF,qFAAqF;QACrF,qFAAqF;QACrF,iDAAiD;QACjD,MAAM,KAAK,GAAuB,EAAE,CAAC;QACrC,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAChC,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,GAAG,CAAC,UAAU;gBAAE,SAAS;YACtD,MAAM,KAAK,GAAG,EAAE,CAAC,aAAa,CAAC,SAAS,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;YACzE,IAAI,KAAK,IAAI,qBAAqB,CAAC,EAAE,EAAE,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,kBAAkB,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QAC3G,CAAC;QACD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,oBAAoB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,oBAAoB,CAAC,KAAK,CAAC;IACxF,CAAC;IAED;;;;OAIG;IACH,OAAO,CAAC,EAAY;QACnB,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAC1C,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,mBAAmB,CAAC;QACzE,KAAK,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC1C,IAAI,EAAE,CAAC,aAAa,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,KAAK,KAAK;gBAAE,SAAS;YACjF,MAAM,GAAG,GAAG,kBAAkB,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YAC1C,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,OAAO,IAAI,cAAc,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,WAAW,EAAE,CAAC;gBAC/E,QAAQ,CAAC,oDAAoD,EAAE,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;gBAC3F,OAAO,IAAI,CAAC;YACb,CAAC;QACF,CAAC;QACD,OAAO,KAAK,CAAC;IACd,CAAC;;AAGF,iIAAiI;AACjI,SAAS,kBAAkB,CAAC,EAAY,EAAE,KAAkB;IAC3D,OAAO,eAAe,CAAC,KAAK,EAAE,EAAE,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,kBAAkB,CAAC;AAC9F,CAAC;AAED,MAAM,OAAO,0BAA0B;IAiBT;IAhB7B;;;;OAIG;IACc,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC5D;;;;OAIG;IACc,OAAO,GAAG,IAAI,GAAG,EAA2B,CAAC;IAC9D,oFAAoF;IAC5E,SAAS,GAAG,CAAC,CAAC;IACd,wBAAwB,GAAwB,IAAI,CAAC;IAE7D,YAA6B,GAAsC;QAAtC,QAAG,GAAH,GAAG,CAAmC;QAClE,IAAI,CAAC,wBAAwB,EAAE,CAAC;IACjC,CAAC;IAED,YAAY,CAAC,KAAkB;QAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK;YAAE,OAAO,SAAS,CAAC;QACvD,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACvB,OAAO,KAAK,CAAC;IACd,CAAC;IAED,4IAA4I;IAC5I,kBAAkB,CAAC,KAAkB,EAAE,OAA0B;QAChE,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,KAAK;YAAE,OAAO,SAAS,CAAC;QACvD,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC;QACzD,IAAI,CAAC,QAAQ;YAAE,OAAO,SAAS,CAAC;QAChC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACvB,OAAO,QAAQ,CAAC,IAAI,CAAC;IACtB,CAAC;IAED;;;;;;;OAOG;IACH,MAAM,CAAC,KAAkB,EAAE,IAAY;QACtC,IAAI,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAAE,OAAO;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,mBAAmB,CAAC;QACxD,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC7C,sFAAsF;QACtF,oFAAoF;QACpF,iEAAiE;QACjE,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QACnD,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO;YAAE,OAAO;QAErD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,IAAI,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;QACpE,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;QAClB,KAAK,CAAC,OAAO,GAAG,SAAS,CAAC;QAC1B,QAAQ,CAAC,+CAA+C,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;QACjG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IACrC,CAAC;IAED;;;;;;OAMG;IACH,aAAa,CAAC,KAAkB,EAAE,IAAY;QAC7C,IAAI,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAAE,OAAO;QACrC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,mBAAmB,CAAC;QACxD,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QACnD,IAAI,IAAI,IAAI,MAAM,IAAI,IAAI,IAAI,MAAM,CAAC,OAAO;YAAE,OAAO;QAErD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,IAAI,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;QACpE,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QACnD,QAAQ,CAAC,wDAAwD,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,CAAC,YAAY,CAAC,CAAC;QAC1G,IAAI,CAAC,YAAY,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;IACrC,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACH,gBAAgB,CAAC,KAAkB,EAAE,IAAoB,EAAE,GAAW,EAAE,KAAa;QACpF,IAAI,KAAK,IAAI,CAAC,IAAI,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC;YAAE,OAAO;QACnD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,mBAAmB,CAAC;QACxD,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QACnD,IAAI,MAAM,IAAI,MAAM,CAAC,OAAO;YAAE,OAAO;QACrC,yFAAyF;QACzF,mFAAmF;QACnF,qFAAqF;QACrF,uFAAuF;QACvF,qDAAqD;QAErD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,QAAQ,IAAI,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;QACpE,MAAM,SAAS,GAAG,GAAG,GAAG,KAAK,CAAC;QAC9B,IAAI,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,QAAQ,EAAE,CAAC;YACd,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC9B,cAAc,CAAC,QAAQ,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;QAC5C,CAAC;aAAM,CAAC;YACP,QAAQ,GAAG,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,iBAAiB,EAAE,MAAM,EAAE,CAAC,EAAE,CAAC;QACpH,CAAC;QACD,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;QACrC,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YAC5C,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,kBAAkB;gBAAE,MAAM;YAC1D,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QAC/B,CAAC;QACD,QAAQ,CAAC,iFAAiF,EACzF,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACpE,IAAI,CAAC,sBAAsB,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;IACtD,CAAC;IAED;;;;;;;;OAQG;IACH,OAAO,CAAC,YAAqC,EAAE,OAAmC;QACjF,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;YAC3B,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;QAC9B,CAAC;aAAM,IAAI,YAAY,CAAC,gBAAgB,KAAK,IAAI,CAAC,SAAS,EAAE,CAAC;YAC7D,QAAQ,CAAC,mEAAmE,CAAC,CAAC;QAC/E,CAAC;aAAM,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;QAC9B,CAAC;aAAM,CAAC;YACP,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QAC5B,CAAC;IACF,CAAC;IAED;;;OAGG;IACH,iBAAiB;QAChB,OAAO,IAAI,uBAAuB,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC;IACtG,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAC,aAAwC;QACnD,sFAAsF;QACtF,wFAAwF;QACxF,wFAAwF;QACxF,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO;QACpC,IAAI,CAAC;YACJ,MAAM,OAAO,GAAG,aAAa,EAAE,CAAC;YAChC,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACxC,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACtB,QAAQ,CAAC,iEAAiE,EAAE,GAAG,CAAC,CAAC;oBACjF,SAAS;gBACV,CAAC;gBACD,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;QACF,CAAC;gBAAS,CAAC;YACV,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACtB,CAAC;IACF,CAAC;IAED,qFAAqF;IACrF,YAAY;QACX,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,SAAS,EAAE,CAAC;IAClB,CAAC;IAED,0FAA0F;IAC1F,KAAK;QACJ,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACrB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACtB,CAAC;IAED,oFAAoF;IACpF,QAAQ;QACP,MAAM,GAAG,GAA+B,EAAE,CAAC;QAC3C,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;YAC3C,MAAM,EAAE,MAAM,EAAE,GAAG,KAAK,CAAC;YACzB,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,UAAU,CAAC,KAAK,MAAM;gBAAE,SAAS;YAC1F,GAAG,CAAC,IAAI,CAAC;gBACR,UAAU,EAAE,MAAM,CAAC,UAAU;gBAC7B,SAAS,EAAE,MAAM,CAAC,IAAI;gBACtB,IAAI,EAAE,KAAK,CAAC,IAAI;gBAChB,OAAO,EAAE,KAAK,CAAC,OAAO;gBACtB,WAAW,EAAE,eAAe,CAAC,MAAM,CAAC;gBACpC,YAAY,EAAE,KAAK,CAAC,YAAY;gBAChC,YAAY,EAAE,KAAK,CAAC,YAAY;gBAChC,MAAM,EAAE,KAAK,CAAC,MAAM;gBACpB,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;oBACnD,UAAU,EAAE,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;oBAC7D,UAAU,EAAE,QAAQ,CAAC,IAAI;oBACzB,OAAO,EAAE,QAAQ,CAAC,OAAO;oBACzB,kBAAkB,EAAE,QAAQ,CAAC,QAAQ;oBACrC,MAAM,EAAE,QAAQ,CAAC,MAAM;iBACvB,CAAC,CAAC;aACH,CAAC,CAAC;QACJ,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;IAED,OAAO;QACN,IAAI,IAAI,CAAC,wBAAwB,EAAE,CAAC;YACnC,IAAI,CAAC,wBAAwB,EAAE,CAAC;YAChC,IAAI,CAAC,wBAAwB,GAAG,IAAI,CAAC;QACtC,CAAC;QACD,IAAI,CAAC,KAAK,EAAE,CAAC;IACd,CAAC;IAEO,wBAAwB;QAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,iBAAiB,EAAE,CAAC;QAC5D,IAAI,CAAC,wBAAwB,GAAG,QAAQ,CAAC,WAAW,CAAC,CAAC,KAAwB,EAAE,EAAE;YACjF,6EAA6E;YAC7E,4EAA4E;YAC5E,iCAAiC;YACjC,IAAI,KAAK,CAAC,IAAI,KAAK,gBAAgB,IAAI,KAAK,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;gBACvE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC;YAChD,CAAC;QACF,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;OAGG;IACK,SAAS,CAAC,YAAqC;QACtD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC1B,CAAC;QACD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,YAAY,CAAC,WAAW,EAAE,EAAE,CAAC;YACxD,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACjC,CAAC;QACD,KAAK,MAAM,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,IAAI,YAAY,CAAC,UAAU,EAAE,EAAE,CAAC;YACvE,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAChD,CAAC;IACF,CAAC;IAEO,OAAO,CAAC,YAAqC;QACpD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC;QAC9B,CAAC;QACD,KAAK,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,YAAY,CAAC,WAAW,EAAE,EAAE,CAAC;YACxD,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC9B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;QAClD,CAAC;QACD,KAAK,MAAM,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,IAAI,YAAY,CAAC,UAAU,EAAE,EAAE,CAAC;YACvE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;YACrC,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACvC,IAAI,WAAW,EAAE,CAAC;gBACjB,WAAW,CAAC,GAAG,IAAI,GAAG,CAAC;gBACvB,WAAW,CAAC,KAAK,IAAI,KAAK,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACP,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;YAC1C,CAAC;QACF,CAAC;IACF,CAAC;IAED,uGAAuG;IAC/F,IAAI,CAAC,KAAkB;QAC9B,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,QAAQ,EAAE,KAAK,KAAK,KAAK;YAAE,OAAO,QAAQ,CAAC;QAC/C,MAAM,KAAK,GAAoB,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;QACjG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QAC7B,OAAO,KAAK,CAAC;IACd,CAAC;IAED,6GAA6G;IACrG,UAAU,CAAC,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAmB;QACnE,IAAI,IAAI,KAAK,SAAS;YAAE,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACjD,IAAI,OAAO,KAAK,SAAS;YAAE,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC9D,KAAK,MAAM,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,IAAI,MAAM,CAAC,MAAM,EAAE;YAAE,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IACpG,CAAC;IAEO,YAAY,CAAC,KAAkB;QACtC,IAAI,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,UAAU,CAAC,KAAK,KAAK;YAAE,OAAO,KAAK,CAAC;QAC3F,QAAQ,CAAC,iEAAiE,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;QAC1G,OAAO,IAAI,CAAC;IACb,CAAC;IAED;;;;OAIG;IACK,aAAa,CAAC,KAAkB,EAAE,QAAmC;QAC5E,OAAO,eAAe,CAAC,KAAK,EAAE;YAC7B,YAAY,EAAE,GAAG,EAAE,CAAC,QAAQ;YAC5B,YAAY,EAAE,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;SAC3C,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,kBAAkB,CAAC;IAC/C,CAAC;IAED,kGAAkG;IAC1F,MAAM,CAAC,GAAW,EAAE,KAAoB;QAC/C,KAAK,CAAC,YAAY,EAAE,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;QACvB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,mBAAmB,CAAC,SAAS,CAAC,CAAC;QACrE,OAAO,KAAK,CAAC;IACd,CAAC;IAED,uGAAuG;IAC/F,YAAY,CAAC,GAAW,EAAE,KAAoB,EAAE,IAAY;QACnE,IAAI,cAAc,CAAC,IAAI,EAAE,KAAK,CAAC,YAAY,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,mBAAmB,CAAC,WAAW;YAAE,OAAO;QAC5G,GAAG,CAAC,qCAAqC,EAAE,GAAG,EAAE,KAAK,CAAC,YAAY,EAAE,IAAI,CAAC,CAAC;QAC1E,KAAK,CAAC,YAAY,GAAG,IAAI,CAAC;QAC1B,KAAK,CAAC,MAAM,EAAE,CAAC;QACf,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAED;;;;;;;OAOG;IACK,sBAAsB,CAAC,GAAW,EAAE,MAAc,EAAE,QAAqB;QAChF,IAAI,cAAc,CAAC,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,mBAAmB,CAAC,WAAW;YAAE,OAAO;QACpH,GAAG,CAAC,kDAAkD,EAAE,GAAG,EAAE,MAAM,EAAE,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,CAAC,CAAC;QACvG,QAAQ,CAAC,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC;QAClC,QAAQ,CAAC,MAAM,EAAE,CAAC;QAClB,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAED,mGAAmG;IAC3F,UAAU,CAAC,GAAW,EAAE,KAAkB;QACjD,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpC,OAAO,KAAK,EAAE,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,SAAS,CAAC;IACpD,CAAC;IAEO,KAAK,CAAC,GAAW,EAAE,KAAoB;QAC9C,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED;;;OAGG;IACK,WAAW,CAAC,SAAiB;QACpC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YACvC,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,SAAS;gBAAE,OAAO;YAC3C,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC1B,CAAC;IACF,CAAC;CACD"}

package/dist/src/core/database-transaction.d.ts

@@ -41,6 +41,9 @@ export interface TransactionManagerContext {
     /** Called after a successful commit, before the change log is cleared. The callback
      *  materializes per-table committed row counts only if a consumer wants them. */
     recordCommittedChangeCounts(counts: () => Map<string, number>): void;
+    /** Called when work of the open transaction is undone: a rollback, a failed commit,
+     *  or a `rollback to savepoint`. Bookkeeping only — errors are logged, never thrown. */
+    transactionRolledBack(): void;
 }
 /**
  * Op kind for a captured row change.
@@ -126,6 +129,8 @@ export declare class TransactionManager {
      * Rolls back the current transaction on all connections.
      */
     rollbackTransaction(): Promise<void>;
+    /** Tell the context work was undone, isolated like commit bookkeeping. */
+    private notifyRolledBack;
     /**
      * Ensures we're in a transaction. If in autocommit mode, starts an implicit transaction.
      */
@@ -220,8 +225,10 @@ export declare class TransactionManager {
      * so the whole reading is O(tables × layers) with no scan.
      *
      * Inherits the change log's coalescing — ten updates to one row count as one,
-     * and an insert followed by a delete of the same key leaves no entry at all.
-     * That makes this a *distinct rows touched* measure.
+     * and an insert followed by a delete of the same key counts zero. That makes
+     * this a *distinct rows touched* measure. A table written whose changes all
+     * cancelled out still appears, with count 0: the key set is every table the
+     * transaction wrote, which held cardinality observations rely on.
      *
      * Deliberately approximate across layers: the same key changed in two live
      * savepoint layers is counted twice. Deduplicating would cost a scan of every

package/dist/src/core/database-transaction.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"database-transaction.d.ts","sourceRoot":"","sources":["../../../src/core/database-transaction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAIxD,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AACpE,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAC;AACjE,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,yCAAyC,CAAC;AACvF,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAC;AAMnE;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG,UAAU,GAAG,UAAU,CAAC;AAExD;;;GAGG;AACH,MAAM,WAAW,yBAAyB;IACzC,+CAA+C;IAC/C,iBAAiB,IAAI,sBAAsB,EAAE,CAAC;IAC9C,qCAAqC;IACrC,eAAe,IAAI,oBAAoB,CAAC;IACxC,wCAAwC;IACxC,sBAAsB,IAAI,uBAAuB,CAAC;IAClD;;8CAE0C;IAC1C,mBAAmB,CAAC,IAAI,CAAC,EAAE,kBAAkB,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAChE,iDAAiD;IACjD,yBAAyB,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAC3C;;sBAEkB;IAClB,qBAAqB,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACvC;qFACiF;IACjF,2BAA2B,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;CACrE;AAED;;GAEG;AACH,MAAM,MAAM,UAAU,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;AAexD;;;;GAIG;AACH,MAAM,WAAW,WAAW;IAC3B,oFAAoF;IACpF,YAAY,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;CAClC;AAiBD;;;;;;GAMG;AACH,qBAAa,kBAAkB;IA2BlB,OAAO,CAAC,QAAQ,CAAC,GAAG;IA1BhC,OAAO,CAAC,YAAY,CAAQ;IAC5B,OAAO,CAAC,aAAa,CAAS;IAC9B,OAAO,CAAC,iBAAiB,CAAkC;IAE3D,0EAA0E;IAC1E,OAAO,CAAC,SAAS,CAA6B;IAC9C,2CAA2C;IAC3C,OAAO,CAAC,eAAe,CAAwB;IAE/C,4DAA4D;IAC5D,OAAO,CAAC,cAAc,CAAgB;IAEtC,sFAAsF;IACtF,OAAO,CAAC,aAAa,CAAyC;IAE9D,8FAA8F;IAC9F,OAAO,CAAC,6BAA6B,CAAS;IAC9C,qEAAqE;IACrE,OAAO,CAAC,mBAAmB,CAAS;IAEpC;;;wEAGoE;IACpE,OAAO,CAAC,0BAA0B,CAAqC;gBAE1C,GAAG,EAAE,yBAAyB;IAM3D,iDAAiD;IACjD,aAAa,IAAI,OAAO;IAIxB,gDAAgD;IAChD,eAAe,IAAI,OAAO;IAI1B,iFAAiF;IACjF,oBAAoB,IAAI,iBAAiB,GAAG,IAAI;IAIhD;;;;;;OAMG;IACH,6BAA6B,CAAC,IAAI,EAAE,kBAAkB,EAAE,GAAG,IAAI,GAAG,IAAI;IAItE,gDAAgD;IAChD,qBAAqB,IAAI,OAAO;IAIhC,0FAA0F;IAC1F,+BAA+B,IAAI,OAAO;IAI1C,+EAA+E;IAC/E,qBAAqB,IAAI,OAAO;IAIhC;;;;;OAKG;IACH,uBAAuB,IAAI,MAAM;IAQjC;;;OAGG;IACG,gBAAgB,CAAC,MAAM,EAAE,iBAAiB,GAAG,OAAO,CAAC,IAAI,CAAC;IAyChE;;;OAGG;IACG,iBAAiB,IAAI,OAAO,CAAC,IAAI,CAAC;IAsFxC;;OAEG;IACG,mBAAmB,IAAI,OAAO,CAAC,IAAI,CAAC;IAoC1C;;OAEG;IACG,iBAAiB,IAAI,OAAO,CAAC,IAAI,CAAC;IAMxC;;OAEG;IACG,kBAAkB,IAAI,OAAO,CAAC,IAAI,CAAC;IAMzC;;OAEG;IACG,oBAAoB,IAAI,OAAO,CAAC,IAAI,CAAC;IAM3C;;;OAGG;IACH,4BAA4B,IAAI,IAAI;IAWpC;;OAEG;IACG,yBAAyB,IAAI,OAAO,CAAC,IAAI,CAAC;IAahD;;;;;OAKG;IACH,mBAAmB,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,GAAG,MAAM,IAAI;IAkCrE;;;;;;;;;OASG;IACH,OAAO,CAAC,iBAAiB;IAIzB,iEAAiE;IACjE,OAAO,CAAC,WAAW;IAMnB,mDAAmD;IACnD,OAAO,CAAC,UAAU;IAMlB;;;;OAIG;IACH,OAAO,CAAC,iBAAiB;IAezB;;;;;;;;;OASG;IACH,OAAO,CAAC,WAAW;IAKnB;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IAkDvB,6EAA6E;IAC7E,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI;IAWhF,4EAA4E;IAC5E,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI;IAWhF;;;;;;;;;;;;;OAaG;IACH,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI;IAmB7F,yCAAyC;IACzC,oBAAoB,IAAI,GAAG,CAAC,MAAM,CAAC;IAYnC;;;;;;;;;;;;OAYG;IACH,mBAAmB,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAa1C,iFAAiF;IACjF,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,EAAE,EAAE;IAkB/C;;;;;;;;;;;;OAYG;IACH,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,aAAa,EAAE,SAAS,MAAM,EAAE,EAAE,SAAS,EAAE,SAAS,MAAM,EAAE,GAAG,QAAQ,EAAE,EAAE;IAsD5G,gCAAgC;IAChC,cAAc,IAAI,IAAI;IAWtB;;;OAGG;IACH,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAOrC;;;OAGG;IACH,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAQnC;;;;;OAKG;IACH,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAYtC;;;;;;OAMG;IACH,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAuBzC,sDAAsD;IACtD,OAAO,CAAC,mBAAmB;IAM3B,2CAA2C;IAC3C,OAAO,CAAC,sBAAsB;IAM9B;;;;;;OAMG;IACH,OAAO,CAAC,qBAAqB;CAiB7B"}
+{"version":3,"file":"database-transaction.d.ts","sourceRoot":"","sources":["../../../src/core/database-transaction.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,OAAO,KAAK,EAAE,GAAG,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAIxD,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,uBAAuB,CAAC;AACpE,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAC;AACjE,OAAO,KAAK,EAAE,uBAAuB,EAAE,MAAM,yCAAyC,CAAC;AACvF,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,0BAA0B,CAAC;AAMnE;;GAEG;AACH,MAAM,MAAM,iBAAiB,GAAG,UAAU,GAAG,UAAU,CAAC;AAExD;;;GAGG;AACH,MAAM,WAAW,yBAAyB;IACzC,+CAA+C;IAC/C,iBAAiB,IAAI,sBAAsB,EAAE,CAAC;IAC9C,qCAAqC;IACrC,eAAe,IAAI,oBAAoB,CAAC;IACxC,wCAAwC;IACxC,sBAAsB,IAAI,uBAAuB,CAAC;IAClD;;8CAE0C;IAC1C,mBAAmB,CAAC,IAAI,CAAC,EAAE,kBAAkB,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IAChE,iDAAiD;IACjD,yBAAyB,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAC3C;;sBAEkB;IAClB,qBAAqB,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IACvC;qFACiF;IACjF,2BAA2B,CAAC,MAAM,EAAE,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;IACrE;4FACwF;IACxF,qBAAqB,IAAI,IAAI,CAAC;CAC9B;AAED;;GAEG;AACH,MAAM,MAAM,UAAU,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;AAexD;;;;GAIG;AACH,MAAM,WAAW,WAAW;IAC3B,oFAAoF;IACpF,YAAY,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;CAClC;AAiBD;;;;;;GAMG;AACH,qBAAa,kBAAkB;IA2BlB,OAAO,CAAC,QAAQ,CAAC,GAAG;IA1BhC,OAAO,CAAC,YAAY,CAAQ;IAC5B,OAAO,CAAC,aAAa,CAAS;IAC9B,OAAO,CAAC,iBAAiB,CAAkC;IAE3D,0EAA0E;IAC1E,OAAO,CAAC,SAAS,CAA6B;IAC9C,2CAA2C;IAC3C,OAAO,CAAC,eAAe,CAAwB;IAE/C,4DAA4D;IAC5D,OAAO,CAAC,cAAc,CAAgB;IAEtC,sFAAsF;IACtF,OAAO,CAAC,aAAa,CAAyC;IAE9D,8FAA8F;IAC9F,OAAO,CAAC,6BAA6B,CAAS;IAC9C,qEAAqE;IACrE,OAAO,CAAC,mBAAmB,CAAS;IAEpC;;;wEAGoE;IACpE,OAAO,CAAC,0BAA0B,CAAqC;gBAE1C,GAAG,EAAE,yBAAyB;IAM3D,iDAAiD;IACjD,aAAa,IAAI,OAAO;IAIxB,gDAAgD;IAChD,eAAe,IAAI,OAAO;IAI1B,iFAAiF;IACjF,oBAAoB,IAAI,iBAAiB,GAAG,IAAI;IAIhD;;;;;;OAMG;IACH,6BAA6B,CAAC,IAAI,EAAE,kBAAkB,EAAE,GAAG,IAAI,GAAG,IAAI;IAItE,gDAAgD;IAChD,qBAAqB,IAAI,OAAO;IAIhC,0FAA0F;IAC1F,+BAA+B,IAAI,OAAO;IAI1C,+EAA+E;IAC/E,qBAAqB,IAAI,OAAO;IAIhC;;;;;OAKG;IACH,uBAAuB,IAAI,MAAM;IAQjC;;;OAGG;IACG,gBAAgB,CAAC,MAAM,EAAE,iBAAiB,GAAG,OAAO,CAAC,IAAI,CAAC;IA8ChE;;;OAGG;IACG,iBAAiB,IAAI,OAAO,CAAC,IAAI,CAAC;IAwFxC;;OAEG;IACG,mBAAmB,IAAI,OAAO,CAAC,IAAI,CAAC;IAqC1C,0EAA0E;IAC1E,OAAO,CAAC,gBAAgB;IAQxB;;OAEG;IACG,iBAAiB,IAAI,OAAO,CAAC,IAAI,CAAC;IAMxC;;OAEG;IACG,kBAAkB,IAAI,OAAO,CAAC,IAAI,CAAC;IAMzC;;OAEG;IACG,oBAAoB,IAAI,OAAO,CAAC,IAAI,CAAC;IAM3C;;;OAGG;IACH,4BAA4B,IAAI,IAAI;IAWpC;;OAEG;IACG,yBAAyB,IAAI,OAAO,CAAC,IAAI,CAAC;IAahD;;;;;OAKG;IACH,mBAAmB,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,WAAW,GAAG,MAAM,IAAI;IAkCrE;;;;;;;;;OASG;IACH,OAAO,CAAC,iBAAiB;IAIzB,iEAAiE;IACjE,OAAO,CAAC,WAAW;IAMnB,mDAAmD;IACnD,OAAO,CAAC,UAAU;IAMlB;;;;OAIG;IACH,OAAO,CAAC,iBAAiB;IAezB;;;;;;;;;OASG;IACH,OAAO,CAAC,WAAW;IAKnB;;;;;OAKG;IACH,OAAO,CAAC,eAAe;IAkDvB,6EAA6E;IAC7E,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI;IAWhF,4EAA4E;IAC5E,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI;IAWhF;;;;;;;;;;;;;OAaG;IACH,YAAY,CAAC,SAAS,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,SAAS,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI;IAmB7F,yCAAyC;IACzC,oBAAoB,IAAI,GAAG,CAAC,MAAM,CAAC;IAYnC;;;;;;;;;;;;;;OAcG;IACH,mBAAmB,IAAI,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;IAY1C,iFAAiF;IACjF,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,QAAQ,EAAE,EAAE;IAkB/C;;;;;;;;;;;;OAYG;IACH,gBAAgB,CAAC,IAAI,EAAE,MAAM,EAAE,aAAa,EAAE,SAAS,MAAM,EAAE,EAAE,SAAS,EAAE,SAAS,MAAM,EAAE,GAAG,QAAQ,EAAE,EAAE;IAsD5G,gCAAgC;IAChC,cAAc,IAAI,IAAI;IAWtB;;;OAGG;IACH,eAAe,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAOrC;;;OAGG;IACH,aAAa,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAQnC;;;;;OAKG;IACH,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAYtC;;;;;;OAMG;IACH,mBAAmB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM;IAwBzC,sDAAsD;IACtD,OAAO,CAAC,mBAAmB;IAM3B,2CAA2C;IAC3C,OAAO,CAAC,sBAAsB;IAM9B;;;;;;OAMG;IACH,OAAO,CAAC,qBAAqB;CAiB7B"}