@origintrail-official/dkg-agent 10.0.20 → 10.0.21

package/dist/internal/vm-reconcile-local-admission-wait.js

@@ -0,0 +1,226 @@
+/**
+ * Graphs waiting for node-local sync admission, served in turn.
+ *
+ * A reconcile pass that the node's own sync admission refused has nothing to
+ * gain from running again while that capacity is still in use: every repeat
+ * costs the pass's chain reads and is refused the same way, and every waiting
+ * graph pays them at once. This component owns the wait instead. A refused
+ * graph is kept in arrival order and nudged once the admission can take its
+ * fetch, one graph at a time.
+ *
+ * A pass that could not start its work at all, because the source it had to
+ * ask did not answer, waits here too (see {@link VmReconcileLocalAdmissionWait.defer}).
+ *
+ * It owns no sync lease and no VM worker. A nudge re-enters the ordinary
+ * bounded dispatcher, and the periodic sweep still visits a waiting graph.
+ */
+/** A refused nudge's hold, and how often the queue re-reads capacity. */
+const RETRY_MS = 2_500;
+/**
+ * How long a nudged pass holds the next waiter back when it has not settled:
+ * long enough to reach its own admission, after which the capacity read
+ * accounts for it. Without the bound a long fetch on a node with several sync
+ * slots would keep its free ones idle.
+ */
+const TURN_MAX_MS = 15_000;
+/** A capacity read that cannot answer falls back to the plain bounded retry. */
+function admissionAvailable(waiter) {
+    try {
+        return waiter.canAdmit();
+    }
+    catch {
+        return true;
+    }
+}
+export class VmReconcileLocalAdmissionWait {
+    deps;
+    /** Waiting graphs, in the order they are served. */
+    waiters = new Map();
+    /** The waiter nudged last, until its pass settles. */
+    turn;
+    /** No waiter is nudged before this time: a nudged pass was refused all the same. */
+    holdUntil = 0;
+    timer;
+    closed = false;
+    constructor(deps) {
+        this.deps = deps;
+    }
+    /**
+     * The node's sync admission refused this graph's fetch. `canAdmit` reads the
+     * admission the fetch will ask. Every waiter uses this readiness contract.
+     */
+    retry(key, options) {
+        if (this.closed || options.signal?.aborted || !options.isCurrent())
+            return;
+        const refusedTurn = this.turn?.key === key;
+        // The nudged graph was refused all the same, so the capacity read was
+        // wrong or capacity went elsewhere first. It keeps its place at the head,
+        // and nothing is nudged for one delay so a wrong read cannot spin passes.
+        if (this.park(key, options, refusedTurn ? 'front' : 'keep') && refusedTurn) {
+            this.holdUntil = Date.now() + RETRY_MS;
+        }
+        this.armTimer();
+    }
+    /**
+     * A graph that just used the node's sync admission and has more to fetch
+     * goes behind the graphs already waiting for it. Returns false, and parks
+     * nothing, when no other graph is waiting.
+     */
+    yieldTurn(key, options) {
+        if (this.closed || options.signal?.aborted || !options.isCurrent())
+            return false;
+        let othersWaiting = false;
+        for (const waiting of this.waiters.keys()) {
+            if (waiting !== key) {
+                othersWaiting = true;
+                break;
+            }
+        }
+        if (!othersWaiting)
+            return false;
+        const parked = this.park(key, options, 'back');
+        this.armTimer();
+        return parked;
+    }
+    /**
+     * A pass ended before its work started: the source it had to ask gave no
+     * answer. Nothing here can read when it will, so the graph goes behind the
+     * others and no waiter is nudged for one delay. A graph that keeps getting
+     * no answer then costs one short pass per delay, in turn with the rest.
+     * `canAdmit` is the same readiness contract as for a refused fetch: the
+     * graph is not asked again while its fetch could not start anyway.
+     *
+     * Returns `again` when the pass was this wait's own nudge, `parked` when it
+     * came from elsewhere, and undefined when the graph was not taken.
+     */
+    defer(key, options) {
+        if (this.closed || options.signal?.aborted || !options.isCurrent())
+            return undefined;
+        const nudged = this.turn?.key === key;
+        if (!this.park(key, options, 'back', true))
+            return undefined;
+        this.holdUntil = Date.now() + RETRY_MS;
+        this.armTimer();
+        return nudged ? 'again' : 'parked';
+    }
+    /** A pass of this graph is starting. Hand the result to {@link passEnded}. */
+    passStarted(key) {
+        return { key, waiting: this.waiters.get(key) };
+    }
+    /**
+     * The pass ended. A graph whose place in the wait is still the one it had
+     * when the pass started was not refused again, so it is no longer waiting.
+     * Whatever the pass used is free now, so this is also when the next waiter
+     * can go.
+     */
+    passEnded(pass) {
+        if (pass.waiting !== undefined && this.waiters.get(pass.key) === pass.waiting) {
+            this.remove(pass.key);
+        }
+        this.wake();
+    }
+    close() {
+        this.closed = true;
+        for (const key of this.waiters.keys())
+            this.remove(key);
+        this.armTimer();
+        this.turn = undefined;
+    }
+    park(key, options, position, deferred = false) {
+        const existing = this.waiters.get(key);
+        if (!existing && this.waiters.size >= this.deps.maxWaiters)
+            return false;
+        const waiter = {
+            deferred,
+            canAdmit: options.canAdmit,
+            isCurrent: options.isCurrent,
+            ...(options.signal ? { signal: options.signal } : {}),
+            onAbort: () => {
+                if (this.waiters.get(key) !== waiter)
+                    return;
+                this.remove(key);
+                this.armTimer();
+            },
+        };
+        existing?.signal?.removeEventListener('abort', existing.onAbort);
+        if (position === 'front') {
+            const behind = [...this.waiters].filter(([waiting]) => waiting !== key);
+            this.waiters.clear();
+            this.waiters.set(key, waiter);
+            for (const [waiting, entry] of behind)
+                this.waiters.set(waiting, entry);
+        }
+        else {
+            // Setting an existing key keeps its place; `back` gives it up first.
+            if (position === 'back')
+                this.waiters.delete(key);
+            this.waiters.set(key, waiter);
+        }
+        options.signal?.addEventListener('abort', waiter.onAbort, { once: true });
+        return true;
+    }
+    remove(key) {
+        const waiter = this.waiters.get(key);
+        if (!waiter)
+            return;
+        waiter.signal?.removeEventListener('abort', waiter.onAbort);
+        this.waiters.delete(key);
+    }
+    /**
+     * Nudge the longest waiter the node's sync admission can take, unless a
+     * nudged pass is still out. Waiters are read in arrival order and one that
+     * cannot be admitted yet is passed over, so a graph with capacity of its own
+     * is not held behind one without.
+     */
+    wake() {
+        if (this.closed)
+            return;
+        const now = Date.now();
+        const turnIsOut = this.turn !== undefined && now - this.turn.startedAt < TURN_MAX_MS;
+        if (!turnIsOut && now >= this.holdUntil) {
+            // Removing the entry being visited is safe on a Map.
+            for (const [key, waiter] of this.waiters) {
+                if (waiter.signal?.aborted || !waiter.isCurrent()) {
+                    this.remove(key);
+                    continue;
+                }
+                if (!admissionAvailable(waiter))
+                    continue;
+                this.remove(key);
+                const completion = this.deps.nudge(key, waiter.deferred);
+                // Not admitted: the periodic sweep owns the graph.
+                if (!completion)
+                    continue;
+                const started = { key, startedAt: now };
+                this.turn = started;
+                const settle = () => {
+                    if (this.turn === started)
+                        this.turn = undefined;
+                    this.wake();
+                };
+                completion.then(settle, settle);
+                break;
+            }
+        }
+        this.armTimer();
+    }
+    /** One timer for the whole wait: the next delay to run out, else a capacity re-read per interval. */
+    armTimer() {
+        if (this.timer !== undefined)
+            clearTimeout(this.timer);
+        this.timer = undefined;
+        if (this.closed || this.waiters.size === 0)
+            return;
+        const now = Date.now();
+        let delay = RETRY_MS;
+        if (this.holdUntil > now) {
+            delay = this.holdUntil - now;
+        }
+        this.timer = setTimeout(() => {
+            this.timer = undefined;
+            this.wake();
+        }, delay);
+        this.timer.unref?.();
+    }
+}
+//# sourceMappingURL=vm-reconcile-local-admission-wait.js.map

package/dist/internal/vm-reconcile-local-admission-wait.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vm-reconcile-local-admission-wait.js","sourceRoot":"","sources":["../../src/internal/vm-reconcile-local-admission-wait.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAEH,yEAAyE;AACzE,MAAM,QAAQ,GAAG,KAAK,CAAC;AACvB;;;;;GAKG;AACH,MAAM,WAAW,GAAG,MAAM,CAAC;AAkC3B,gFAAgF;AAChF,SAAS,kBAAkB,CAAC,MAAc;IACxC,IAAI,CAAC;QACH,OAAO,MAAM,CAAC,QAAQ,EAAE,CAAC;IAC3B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,MAAM,OAAO,6BAA6B;IAUX;IAT7B,oDAAoD;IACnC,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IACrD,sDAAsD;IAC9C,IAAI,CAAiD;IAC7D,oFAAoF;IAC5E,SAAS,GAAG,CAAC,CAAC;IACd,KAAK,CAA4C;IACjD,MAAM,GAAG,KAAK,CAAC;IAEvB,YAA6B,IAAuC;QAAvC,SAAI,GAAJ,IAAI,CAAmC;IAAG,CAAC;IAExE;;;OAGG;IACH,KAAK,CAAC,GAAW,EAAE,OAAkC;QACnD,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE;YAAE,OAAO;QAC3E,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK,GAAG,CAAC;QAC3C,sEAAsE;QACtE,0EAA0E;QAC1E,0EAA0E;QAC1E,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC3E,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC;QACzC,CAAC;QACD,IAAI,CAAC,QAAQ,EAAE,CAAC;IAClB,CAAC;IAED;;;;OAIG;IACH,SAAS,CAAC,GAAW,EAAE,OAAkC;QACvD,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE;YAAE,OAAO,KAAK,CAAC;QACjF,IAAI,aAAa,GAAG,KAAK,CAAC;QAC1B,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YAC1C,IAAI,OAAO,KAAK,GAAG,EAAE,CAAC;gBAAC,aAAa,GAAG,IAAI,CAAC;gBAAC,MAAM;YAAC,CAAC;QACvD,CAAC;QACD,IAAI,CAAC,aAAa;YAAE,OAAO,KAAK,CAAC;QACjC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,CAAC,CAAC;QAC/C,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;OAUG;IACH,KAAK,CAAC,GAAW,EAAE,OAAkC;QACnD,IAAI,IAAI,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE;YAAE,OAAO,SAAS,CAAC;QACrF,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK,GAAG,CAAC;QACtC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,OAAO,EAAE,MAAM,EAAE,IAAI,CAAC;YAAE,OAAO,SAAS,CAAC;QAC7D,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,GAAG,QAAQ,CAAC;QACvC,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,OAAO,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;IACrC,CAAC;IAED,8EAA8E;IAC9E,WAAW,CAAC,GAAW;QACrB,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;IACjD,CAAC;IAED;;;;;OAKG;IACH,SAAS,CAAC,IAAwB;QAChC,IAAI,IAAI,CAAC,OAAO,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,OAAO,EAAE,CAAC;YAC9E,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxB,CAAC;QACD,IAAI,CAAC,IAAI,EAAE,CAAC;IACd,CAAC;IAED,KAAK;QACH,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;QACnB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE;YAAE,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACxD,IAAI,CAAC,QAAQ,EAAE,CAAC;QAChB,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;IACxB,CAAC;IAEO,IAAI,CACV,GAAW,EACX,OAAkC,EAClC,QAAmC,EACnC,QAAQ,GAAG,KAAK;QAEhB,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACvC,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU;YAAE,OAAO,KAAK,CAAC;QACzE,MAAM,MAAM,GAAW;YACrB,QAAQ;YACR,QAAQ,EAAE,OAAO,CAAC,QAAQ;YAC1B,SAAS,EAAE,OAAO,CAAC,SAAS;YAC5B,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACrD,OAAO,EAAE,GAAG,EAAE;gBACZ,IAAI,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,MAAM;oBAAE,OAAO;gBAC7C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACjB,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,CAAC;SACF,CAAC;QACF,QAAQ,EAAE,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,QAAQ,CAAC,OAAO,CAAC,CAAC;QACjE,IAAI,QAAQ,KAAK,OAAO,EAAE,CAAC;YACzB,MAAM,MAAM,GAAG,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,OAAO,KAAK,GAAG,CAAC,CAAC;YACxE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;YACrB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YAC9B,KAAK,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,IAAI,MAAM;gBAAE,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAC1E,CAAC;aAAM,CAAC;YACN,qEAAqE;YACrE,IAAI,QAAQ,KAAK,MAAM;gBAAE,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;YAClD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,CAAC,MAAM,EAAE,gBAAgB,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC;QAC1E,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,MAAM,CAAC,GAAW;QACxB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,MAAM;YAAE,OAAO;QACpB,MAAM,CAAC,MAAM,EAAE,mBAAmB,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;QAC5D,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACK,IAAI;QACV,IAAI,IAAI,CAAC,MAAM;YAAE,OAAO;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC;QACrF,IAAI,CAAC,SAAS,IAAI,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACxC,qDAAqD;YACrD,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;gBACzC,IAAI,MAAM,CAAC,MAAM,EAAE,OAAO,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,CAAC;oBAClD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;oBACjB,SAAS;gBACX,CAAC;gBACD,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC;oBAAE,SAAS;gBAC1C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBACjB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;gBACzD,mDAAmD;gBACnD,IAAI,CAAC,UAAU;oBAAE,SAAS;gBAC1B,MAAM,OAAO,GAAG,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC;gBACxC,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;gBACpB,MAAM,MAAM,GAAG,GAAG,EAAE;oBAClB,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;wBAAE,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;oBACjD,IAAI,CAAC,IAAI,EAAE,CAAC;gBACd,CAAC,CAAC;gBACF,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;gBAChC,MAAM;YACR,CAAC;QACH,CAAC;QACD,IAAI,CAAC,QAAQ,EAAE,CAAC;IAClB,CAAC;IAED,qGAAqG;IAC7F,QAAQ;QACd,IAAI,IAAI,CAAC,KAAK,KAAK,SAAS;YAAE,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC;YAAE,OAAO;QACnD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,IAAI,KAAK,GAAG,QAAQ,CAAC;QACrB,IAAI,IAAI,CAAC,SAAS,GAAG,GAAG,EAAE,CAAC;YACzB,KAAK,GAAG,IAAI,CAAC,SAAS,GAAG,GAAG,CAAC;QAC/B,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,EAAE;YAC3B,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YACvB,IAAI,CAAC,IAAI,EAAE,CAAC;QACd,CAAC,EAAE,KAAK,CAAC,CAAC;QACV,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;IACvB,CAAC;CACF"}

package/dist/internal/vm-reconcile-read-authority.d.ts

@@ -0,0 +1,27 @@
+/**
+ * What a VM reconcile pass makes of a read-authority check that was not
+ * allowed.
+ *
+ * A denial closes the pass, and so does an authority source that answered
+ * "unknown". A chain read that was never answered is different: the node's own
+ * RPC budget did not admit it, or the endpoint did not reply in time. That
+ * says nothing about the graph, and the same question may be answered a
+ * moment later, so the pass is told apart and its graph can be asked again
+ * without waiting for the periodic sweep.
+ */
+import type { ContextGraphReadAuthorityDecision, UnavailableContextGraphReadAuthorityDecision } from '../context-graph-read-authority.js';
+import { ContextGraphNotFoundError } from '../dkg-agent-types.js';
+/** Whether the decision is "no answer from the chain" rather than a refusal. */
+export declare function isUnansweredVmReconcileReadAuthority(decision: ContextGraphReadAuthorityDecision | undefined): decision is UnavailableContextGraphReadAuthorityDecision;
+/**
+ * The pass could not confirm read authority because the chain read behind the
+ * check got no answer. To a caller it is the refusal it always was, a
+ * {@link ContextGraphNotFoundError} with the same message; reconcile
+ * scheduling tells it apart by class.
+ */
+export declare class VmReconcileReadAuthorityUnansweredError extends ContextGraphNotFoundError {
+    /** `source/reason/dependency` of the unanswered decision, for the node's log. */
+    readonly readAuthority: string;
+    constructor(contextGraphId: string, decision: Pick<UnavailableContextGraphReadAuthorityDecision, 'source' | 'reason' | 'dependency'>);
+}
+//# sourceMappingURL=vm-reconcile-read-authority.d.ts.map

package/dist/internal/vm-reconcile-read-authority.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"vm-reconcile-read-authority.d.ts","sourceRoot":"","sources":["../../src/internal/vm-reconcile-read-authority.ts"],"names":[],"mappings":"AAEA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EACV,iCAAiC,EACjC,4CAA4C,EAC7C,MAAM,oCAAoC,CAAC;AAC5C,OAAO,EAAE,yBAAyB,EAAE,MAAM,uBAAuB,CAAC;AAalE,gFAAgF;AAChF,wBAAgB,oCAAoC,CAClD,QAAQ,EAAE,iCAAiC,GAAG,SAAS,GACtD,QAAQ,IAAI,4CAA4C,CAI1D;AAED;;;;;GAKG;AACH,qBAAa,uCAAwC,SAAQ,yBAAyB;IACpF,iFAAiF;IACjF,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;gBAG7B,cAAc,EAAE,MAAM,EACtB,QAAQ,EAAE,IAAI,CAAC,4CAA4C,EAAE,QAAQ,GAAG,QAAQ,GAAG,YAAY,CAAC;CAKnG"}

package/dist/internal/vm-reconcile-read-authority.js

@@ -0,0 +1,33 @@
+// SPDX-License-Identifier: Apache-2.0
+import { ContextGraphNotFoundError } from '../dkg-agent-types.js';
+/**
+ * On a current-state read these reasons only come from a chain read that
+ * timed out or that the transport rejected. `chain-access-policy-unknown` is
+ * absent on purpose: there the chain answered, and the answer is final.
+ */
+const UNANSWERED_CHAIN_READ_REASONS = new Set([
+    'chain-access-policy-timeout',
+    'chain-access-policy-unavailable',
+    'chain-participant-authority-unavailable',
+]);
+/** Whether the decision is "no answer from the chain" rather than a refusal. */
+export function isUnansweredVmReconcileReadAuthority(decision) {
+    return decision?.outcome === 'unavailable'
+        && decision.dependency === 'chain'
+        && UNANSWERED_CHAIN_READ_REASONS.has(decision.reason);
+}
+/**
+ * The pass could not confirm read authority because the chain read behind the
+ * check got no answer. To a caller it is the refusal it always was, a
+ * {@link ContextGraphNotFoundError} with the same message; reconcile
+ * scheduling tells it apart by class.
+ */
+export class VmReconcileReadAuthorityUnansweredError extends ContextGraphNotFoundError {
+    /** `source/reason/dependency` of the unanswered decision, for the node's log. */
+    readAuthority;
+    constructor(contextGraphId, decision) {
+        super(contextGraphId);
+        this.readAuthority = `${decision.source}/${decision.reason}/${decision.dependency}`;
+    }
+}
+//# sourceMappingURL=vm-reconcile-read-authority.js.map

package/dist/internal/vm-reconcile-read-authority.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vm-reconcile-read-authority.js","sourceRoot":"","sources":["../../src/internal/vm-reconcile-read-authority.ts"],"names":[],"mappings":"AAAA,sCAAsC;AAkBtC,OAAO,EAAE,yBAAyB,EAAE,MAAM,uBAAuB,CAAC;AAElE;;;;GAIG;AACH,MAAM,6BAA6B,GAAwB,IAAI,GAAG,CAAC;IACjE,6BAA6B;IAC7B,iCAAiC;IACjC,yCAAyC;CAC1C,CAAC,CAAC;AAEH,gFAAgF;AAChF,MAAM,UAAU,oCAAoC,CAClD,QAAuD;IAEvD,OAAO,QAAQ,EAAE,OAAO,KAAK,aAAa;WACrC,QAAQ,CAAC,UAAU,KAAK,OAAO;WAC/B,6BAA6B,CAAC,GAAG,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;AAC1D,CAAC;AAED;;;;;GAKG;AACH,MAAM,OAAO,uCAAwC,SAAQ,yBAAyB;IACpF,iFAAiF;IACxE,aAAa,CAAS;IAE/B,YACE,cAAsB,EACtB,QAAgG;QAEhG,KAAK,CAAC,cAAc,CAAC,CAAC;QACtB,IAAI,CAAC,aAAa,GAAG,GAAG,QAAQ,CAAC,MAAM,IAAI,QAAQ,CAAC,MAAM,IAAI,QAAQ,CAAC,UAAU,EAAE,CAAC;IACtF,CAAC;CACF"}

package/dist/internal/vm-reconcile-sweep-admission.d.ts

@@ -1,6 +1,8 @@
 /** Internal sweep capability; deliberately absent from the package-root API. */
 export interface VmReconcileSweepAdmission<T = unknown> {
     readonly tryAdmit: (key: string) => Promise<T> | undefined;
+    /** Dispatcher-owned timer cap; coalesced work does not consume another slot. */
+    readonly tryAdmitBoundTimer: (key: string) => Promise<T> | undefined;
     readonly waitForChange: (signal?: AbortSignal) => Promise<void>;
     readonly isClosed: () => boolean;
     /** Keep waiting periodic admission visible until its owner retires. */

package/dist/internal/vm-reconcile-sweep-admission.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"vm-reconcile-sweep-admission.d.ts","sourceRoot":"","sources":["../../src/internal/vm-reconcile-sweep-admission.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,MAAM,WAAW,yBAAyB,CAAC,CAAC,GAAG,OAAO;IACpD,QAAQ,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IAC3D,QAAQ,CAAC,aAAa,EAAE,CAAC,MAAM,CAAC,EAAE,WAAW,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;IAChE,QAAQ,CAAC,QAAQ,EAAE,MAAM,OAAO,CAAC;IACjC,uEAAuE;IACvE,QAAQ,CAAC,cAAc,EAAE,CAAC,MAAM,EAAE,WAAW,KAAK,MAAM,IAAI,CAAC;CAC9D"}
+{"version":3,"file":"vm-reconcile-sweep-admission.d.ts","sourceRoot":"","sources":["../../src/internal/vm-reconcile-sweep-admission.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,MAAM,WAAW,yBAAyB,CAAC,CAAC,GAAG,OAAO;IACpD,QAAQ,CAAC,QAAQ,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IAC3D,gFAAgF;IAChF,QAAQ,CAAC,kBAAkB,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC;IACrE,QAAQ,CAAC,aAAa,EAAE,CAAC,MAAM,CAAC,EAAE,WAAW,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC;IAChE,QAAQ,CAAC,QAAQ,EAAE,MAAM,OAAO,CAAC;IACjC,uEAAuE;IACvE,QAAQ,CAAC,cAAc,EAAE,CAAC,MAAM,EAAE,WAAW,KAAK,MAAM,IAAI,CAAC;CAC9D"}

package/dist/internal/vm-reconcile-sweep.d.ts

@@ -7,17 +7,22 @@ export declare class VmReconcileSweepSelector {
     /** Return successful admissions; keep a rejected candidate for the next call. */
     admit(keys: readonly string[], maximum: number, tryAdmit: (key: string) => boolean): number;
 }
+export interface VmReconcileSweepPlannerOptions {
+    discoveryBatchSize: number;
+    periodicBoundBatchSize?: number;
+}
 /** Own real admissions and their completion handles throughout a discovery turn. */
 export declare class VmReconcileSweepPlanner {
-    private readonly discoveryBatchSize;
     private readonly retainCapacity;
     private readonly bound;
     private readonly unbound;
+    private readonly discoveryBatchSize;
+    private readonly periodicBoundBatchSize;
     private turn;
-    constructor(discoveryBatchSize: number, retainCapacity: VmReconcileSweepAdmission['retainCapacity']);
+    constructor(options: VmReconcileSweepPlannerOptions, retainCapacity: VmReconcileSweepAdmission['retainCapacity']);
     reset(): void;
     /** Timer admission is synchronous; retain a capacity-limited discovery turn. */
-    admit(boundKeys: readonly string[], unboundKeys: readonly string[], tryAdmit: (key: string) => Promise<unknown> | undefined): void;
+    admit(boundKeys: readonly string[], unboundKeys: readonly string[], admission: Pick<VmReconcileSweepAdmission, 'tryAdmit' | 'tryAdmitBoundTimer'>): void;
     /**
      * Join retained admissions, then finish this turn's selected rotation.
      * Calls overlapping a partial admission turn join it; once admission is
@@ -28,6 +33,13 @@ export declare class VmReconcileSweepPlanner {
     private claimForCompletion;
     private releaseTimerCapacity;
     private finish;
-    private advance;
+    private record;
+    private admitLeadingBound;
+    private spendDiscovery;
+    private admitBoundTail;
+    /** A timer tick spends discovery independently, then fills only its bound allowance. */
+    private advanceTimerTurn;
+    /** An explicit completion owns one full finite bound rotation and retries. */
+    private advanceCompletionTurn;
 }
 //# sourceMappingURL=vm-reconcile-sweep.d.ts.map

package/dist/internal/vm-reconcile-sweep.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"vm-reconcile-sweep.d.ts","sourceRoot":"","sources":["../../src/internal/vm-reconcile-sweep.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,mCAAmC,CAAC;AAEnF,kFAAkF;AAClF,qBAAa,wBAAwB;IACnC,OAAO,CAAC,OAAO,CAAqB;IACpC,OAAO,CAAC,SAAS,CAAK;IAEtB,KAAK,IAAI,IAAI;IAEb,iFAAiF;IACjF,KAAK,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO,GAAG,MAAM;CAiB5F;AA4BD,oFAAoF;AACpF,qBAAa,uBAAuB;IAMhC,OAAO,CAAC,QAAQ,CAAC,kBAAkB;IACnC,OAAO,CAAC,QAAQ,CAAC,cAAc;IANjC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAkC;IACxD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAkC;IAC1D,OAAO,CAAC,IAAI,CAAwB;gBAGjB,kBAAkB,EAAE,MAAM,EAC1B,cAAc,EAAE,yBAAyB,CAAC,gBAAgB,CAAC;IAG9E,KAAK,IAAI,IAAI;IAMb,gFAAgF;IAChF,KAAK,CACH,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,WAAW,EAAE,SAAS,MAAM,EAAE,EAC9B,QAAQ,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO,CAAC,OAAO,CAAC,GAAG,SAAS,GACtD,IAAI;IASP;;;;OAIG;IACG,QAAQ,CACZ,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,WAAW,EAAE,SAAS,MAAM,EAAE,EAC9B,SAAS,EAAE,yBAAyB,EACpC,SAAS,EAAE,MAAM,OAAO,EACxB,MAAM,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC,IAAI,CAAC;IAsBhB,OAAO,CAAC,WAAW;IAQnB,OAAO,CAAC,kBAAkB;IAa1B,OAAO,CAAC,oBAAoB;IAK5B,OAAO,CAAC,MAAM;IAKd,OAAO,CAAC,OAAO;CAwDhB"}
+{"version":3,"file":"vm-reconcile-sweep.d.ts","sourceRoot":"","sources":["../../src/internal/vm-reconcile-sweep.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,yBAAyB,EAAE,MAAM,mCAAmC,CAAC;AAEnF,kFAAkF;AAClF,qBAAa,wBAAwB;IACnC,OAAO,CAAC,OAAO,CAAqB;IACpC,OAAO,CAAC,SAAS,CAAK;IAEtB,KAAK,IAAI,IAAI;IAEb,iFAAiF;IACjF,KAAK,CAAC,IAAI,EAAE,SAAS,MAAM,EAAE,EAAE,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,OAAO,GAAG,MAAM;CAiB5F;AAgCD,MAAM,WAAW,8BAA8B;IAC7C,kBAAkB,EAAE,MAAM,CAAC;IAC3B,sBAAsB,CAAC,EAAE,MAAM,CAAC;CACjC;AAED,oFAAoF;AACpF,qBAAa,uBAAuB;IAShC,OAAO,CAAC,QAAQ,CAAC,cAAc;IARjC,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAkC;IACxD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAkC;IAC1D,OAAO,CAAC,QAAQ,CAAC,kBAAkB,CAAS;IAC5C,OAAO,CAAC,QAAQ,CAAC,sBAAsB,CAAS;IAChD,OAAO,CAAC,IAAI,CAAwB;gBAGlC,OAAO,EAAE,8BAA8B,EACtB,cAAc,EAAE,yBAAyB,CAAC,gBAAgB,CAAC;IAM9E,KAAK,IAAI,IAAI;IAMb,gFAAgF;IAChF,KAAK,CACH,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,WAAW,EAAE,SAAS,MAAM,EAAE,EAC9B,SAAS,EAAE,IAAI,CAAC,yBAAyB,EAAE,UAAU,GAAG,oBAAoB,CAAC,GAC5E,IAAI;IAUP;;;;OAIG;IACG,QAAQ,CACZ,SAAS,EAAE,SAAS,MAAM,EAAE,EAC5B,WAAW,EAAE,SAAS,MAAM,EAAE,EAC9B,SAAS,EAAE,yBAAyB,EACpC,SAAS,EAAE,MAAM,OAAO,EACxB,MAAM,CAAC,EAAE,WAAW,GACnB,OAAO,CAAC,IAAI,CAAC;IA0BhB,OAAO,CAAC,WAAW;IASnB,OAAO,CAAC,kBAAkB;IAiB1B,OAAO,CAAC,oBAAoB;IAK5B,OAAO,CAAC,MAAM;IAKd,OAAO,CAAC,MAAM;IAed,OAAO,CAAC,iBAAiB;IASzB,OAAO,CAAC,cAAc;IAetB,OAAO,CAAC,cAAc;IAYtB,wFAAwF;IACxF,OAAO,CAAC,gBAAgB;IA0CxB,8EAA8E;IAC9E,OAAO,CAAC,qBAAqB;CA4B9B"}

package/dist/internal/vm-reconcile-sweep.js

@@ -28,14 +28,16 @@ export class VmReconcileSweepSelector {
 }
 /** Own real admissions and their completion handles throughout a discovery turn. */
 export class VmReconcileSweepPlanner {
-    discoveryBatchSize;
     retainCapacity;
     bound = new VmReconcileSweepSelector();
     unbound = new VmReconcileSweepSelector();
+    discoveryBatchSize;
+    periodicBoundBatchSize;
     turn;
-    constructor(discoveryBatchSize, retainCapacity) {
-        this.discoveryBatchSize = discoveryBatchSize;
+    constructor(options, retainCapacity) {
         this.retainCapacity = retainCapacity;
+        this.discoveryBatchSize = options.discoveryBatchSize;
+        this.periodicBoundBatchSize = options.periodicBoundBatchSize ?? 8;
     }
     reset() {
         if (this.turn)
@@ -44,10 +46,12 @@ export class VmReconcileSweepPlanner {
         this.unbound.reset();
     }
     /** Timer admission is synchronous; retain a capacity-limited discovery turn. */
-    admit(boundKeys, unboundKeys, tryAdmit) {
+    admit(boundKeys, unboundKeys, admission) {
         const turn = this.currentTurn();
+        if (turn.owner === 'completion')
+            return;
         this.releaseTimerCapacity(turn);
-        this.advance(turn, boundKeys, unboundKeys, tryAdmit);
+        this.advanceTimerTurn(turn, boundKeys, unboundKeys, admission);
         if (!turn.finished.signal.aborted) {
             turn.releaseTimerCapacity = this.retainCapacity(turn.finished.signal);
         }
@@ -67,7 +71,7 @@ export class VmReconcileSweepPlanner {
         const releaseCapacity = this.retainCapacity(waitingSignal);
         try {
             while (!turn.finished.signal.aborted && isActive() && !admission.isClosed()) {
-                this.advance(turn, boundKeys, unboundKeys, key => isActive() ? admission.tryAdmit(key) : undefined);
+                this.advanceCompletionTurn(turn, unboundKeys, key => isActive() ? admission.tryAdmit(key) : undefined);
                 if (turn.finished.signal.aborted || !isActive() || admission.isClosed())
                     break;
                 // Successful admissions may wake another caller finishing this turn.
@@ -77,6 +81,11 @@ export class VmReconcileSweepPlanner {
         }
         finally {
             releaseCapacity();
+            turn.completionClaimants--;
+            // A cancelled or obsolete final caller must not leave the planner in
+            // completion mode, which would suppress every later timer sweep.
+            if (turn.completionClaimants === 0 && !turn.finished.signal.aborted)
+                this.finish(turn);
         }
         await Promise.all(turn.completions);
     }
@@ -84,18 +93,22 @@ export class VmReconcileSweepPlanner {
         return this.turn ??= {
             owner: 'timer',
             state: { phase: 'leading', remainingDiscovery: this.discoveryBatchSize },
-            admittedKeys: new Set(), completions: [], finished: new AbortController(),
+            admittedKeys: new Set(), boundAdmissions: 0, completionClaimants: 0,
+            completions: [], finished: new AbortController(),
         };
     }
     claimForCompletion(boundKeys) {
         const current = this.currentTurn();
         this.releaseTimerCapacity(current);
-        if (current.owner === 'completion')
+        if (current.owner === 'completion') {
+            current.completionClaimants++;
             return current;
+        }
         const claimed = {
             ...current,
             owner: 'completion',
             fullBoundKeys: [...boundKeys],
+            completionClaimants: 1,
         };
         this.turn = claimed;
         return claimed;
@@ -109,59 +122,87 @@ export class VmReconcileSweepPlanner {
         if (this.turn === turn)
             this.turn = undefined;
     }
-    advance(turn, boundKeys, unboundKeys, tryAdmit) {
-        if (turn.finished.signal.aborted)
-            return;
-        const boundRotation = turn.owner === 'completion' ? turn.fullBoundKeys : boundKeys;
-        const accept = (key) => {
-            const completion = tryAdmit(key);
-            if (completion === undefined)
+    record(turn, key, tryAdmit, bound) {
+        const completion = tryAdmit(key);
+        if (completion === undefined)
+            return false;
+        // Preserve the exact handle, including work coalesced with an earlier tick.
+        turn.completions.push(completion.catch(() => undefined));
+        turn.admittedKeys.add(key);
+        if (bound)
+            turn.boundAdmissions++;
+        return true;
+    }
+    admitLeadingBound(turn, keys, tryAdmit) {
+        return keys.length === 0 || this.bound.admit(keys, 1, key => this.record(turn, key, tryAdmit, true)) === 1;
+    }
+    spendDiscovery(turn, keys, remaining, tryAdmit) {
+        let budget = Math.min(remaining, keys.length);
+        this.unbound.admit(keys, budget, key => {
+            if (!this.record(turn, key, tryAdmit, false))
                 return false;
-            // Automatic failures are reported by the dispatcher. Retain each exact
-            // handle immediately, including work admitted by an earlier timer tick.
-            turn.completions.push(completion.catch(() => undefined));
+            budget--;
             return true;
-        };
+        });
+        return budget;
+    }
+    admitBoundTail(turn, keys, limit, tryAdmit) {
+        const tail = keys.filter(key => !turn.admittedKeys.has(key));
+        const admitted = limit === 0 ? 0 : this.bound.admit(tail, Math.min(tail.length, limit), key => this.record(turn, key, tryAdmit, true));
+        return { admitted, available: tail.length };
+    }
+    /** A timer tick spends discovery independently, then fills only its bound allowance. */
+    advanceTimerTurn(turn, boundKeys, unboundKeys, admission) {
+        if (turn.owner !== 'timer' || turn.finished.signal.aborted)
+            return;
+        const timerBound = admission.tryAdmitBoundTimer;
         if (turn.state.phase === 'leading') {
-            const count = this.bound.admit(boundRotation, 1, key => {
-                if (!accept(key))
-                    return false;
-                turn.admittedKeys.add(key);
-                return true;
-            });
-            if (boundRotation.length > 0 && count === 0)
+            const remaining = turn.state.remainingDiscovery;
+            if (!this.admitLeadingBound(turn, boundKeys, timerBound)) {
+                // Keep the periodic capacity claim for dispatcher fairness. Discovery
+                // can still run, but the rejected bound key waits for the next tick.
+                turn.state = {
+                    phase: 'leading',
+                    remainingDiscovery: this.spendDiscovery(turn, unboundKeys, remaining, admission.tryAdmit),
+                };
                 return;
-            turn.state = {
-                phase: 'discovery',
-                remainingDiscovery: turn.state.remainingDiscovery,
-            };
+            }
+            turn.state = { phase: 'discovery', remainingDiscovery: remaining };
         }
         if (turn.state.phase === 'discovery') {
-            let remainingDiscovery = Math.min(turn.state.remainingDiscovery, unboundKeys.length);
-            this.unbound.admit(unboundKeys, remainingDiscovery, key => {
-                if (!accept(key))
-                    return false;
-                turn.admittedKeys.add(key);
-                remainingDiscovery--;
-                return true;
-            });
-            if (remainingDiscovery > 0) {
-                turn.state = { phase: 'discovery', remainingDiscovery };
+            const remaining = this.spendDiscovery(turn, unboundKeys, turn.state.remainingDiscovery, admission.tryAdmit);
+            if (remaining > 0) {
+                turn.state = { phase: 'discovery', remainingDiscovery: remaining };
                 return;
             }
             turn.state = { phase: 'tail' };
         }
-        const tail = boundRotation.filter(key => !turn.admittedKeys.has(key));
-        const count = this.bound.admit(tail, tail.length, key => {
-            if (!accept(key))
-                return false;
-            turn.admittedKeys.add(key);
-            return true;
-        });
-        if (turn.owner === 'completion' && count < tail.length)
+        this.admitBoundTail(turn, boundKeys, Math.max(0, this.periodicBoundBatchSize - turn.boundAdmissions), timerBound);
+        // A rejected tail retains the selector's round-robin cursor for the next
+        // tick. Timer turns never own an unbounded completion drain.
+        this.finish(turn);
+    }
+    /** An explicit completion owns one full finite bound rotation and retries. */
+    advanceCompletionTurn(turn, unboundKeys, tryAdmit) {
+        if (turn.owner !== 'completion' || turn.finished.signal.aborted)
+            return;
+        const boundKeys = turn.fullBoundKeys;
+        if (turn.state.phase === 'leading') {
+            if (!this.admitLeadingBound(turn, boundKeys, tryAdmit))
+                return;
+            turn.state = { phase: 'discovery', remainingDiscovery: turn.state.remainingDiscovery };
+        }
+        if (turn.state.phase === 'discovery') {
+            const remaining = this.spendDiscovery(turn, unboundKeys, turn.state.remainingDiscovery, tryAdmit);
+            if (remaining > 0) {
+                turn.state = { phase: 'discovery', remainingDiscovery: remaining };
+                return;
+            }
+            turn.state = { phase: 'tail' };
+        }
+        const { admitted, available } = this.admitBoundTail(turn, boundKeys, boundKeys.length, tryAdmit);
+        if (admitted < available)
             return;
-        // A timer's rejected tail leads its next discovery turn. Public callers
-        // retain the tail until admitted, so their finite selected rotation drains.
         this.finish(turn);
     }
 }

package/dist/internal/vm-reconcile-sweep.js.map

@@ -1 +1 @@
-{"version":3,"file":"vm-reconcile-sweep.js","sourceRoot":"","sources":["../../src/internal/vm-reconcile-sweep.ts"],"names":[],"mappings":"AAEA,kFAAkF;AAClF,MAAM,OAAO,wBAAwB;IAC3B,OAAO,CAAqB;IAC5B,SAAS,GAAG,CAAC,CAAC;IAEtB,KAAK,KAAW,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;IAE/D,iFAAiF;IACjF,KAAK,CAAC,IAAuB,EAAE,OAAe,EAAE,QAAkC;QAChF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAAC,OAAO,CAAC,CAAC;QAAC,CAAC;QAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC9E,MAAM,KAAK,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;QACrE,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,IAAI,CAAC,MAAM,IAAI,QAAQ,GAAG,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC;YAC7E,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAE,CAAC;YACzB,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC;YACnB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;YACvB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,MAAM;YAC1B,QAAQ,EAAE,CAAC;YACX,IAAI,CAAC,SAAS,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AA4BD,oFAAoF;AACpF,MAAM,OAAO,uBAAuB;IAMf;IACA;IANF,KAAK,GAAG,IAAI,wBAAwB,EAAE,CAAC;IACvC,OAAO,GAAG,IAAI,wBAAwB,EAAE,CAAC;IAClD,IAAI,CAAwB;IAEpC,YACmB,kBAA0B,EAC1B,cAA2D;QAD3D,uBAAkB,GAAlB,kBAAkB,CAAQ;QAC1B,mBAAc,GAAd,cAAc,CAA6C;IAC3E,CAAC;IAEJ,KAAK;QACH,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED,gFAAgF;IAChF,KAAK,CACH,SAA4B,EAC5B,WAA8B,EAC9B,QAAuD;QAEvD,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAChC,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,QAAQ,CAAC,CAAC;QACrD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YAClC,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,QAAQ,CACZ,SAA4B,EAC5B,WAA8B,EAC9B,SAAoC,EACpC,SAAwB,EACxB,MAAoB;QAEpB,MAAM,QAAQ,GAAG,GAAG,EAAE,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC;QACvD,IAAI,CAAC,QAAQ,EAAE,IAAI,SAAS,CAAC,QAAQ,EAAE;YAAE,OAAO;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAChD,MAAM,aAAa,GAAG,MAAM;YAC1B,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC3E,MAAM,eAAe,GAAG,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;QAC3D,IAAI,CAAC;YACH,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,IAAI,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,EAAE,CAAC;gBAC5E,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,EAAE,WAAW,EACvC,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBAC3D,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,QAAQ,EAAE,IAAI,SAAS,CAAC,QAAQ,EAAE;oBAAE,MAAM;gBAC/E,qEAAqE;gBACrE,iEAAiE;gBACjE,MAAM,SAAS,CAAC,aAAa,CAAC,aAAa,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,eAAe,EAAE,CAAC;QACpB,CAAC;QACD,MAAM,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACtC,CAAC;IAEO,WAAW;QACjB,OAAO,IAAI,CAAC,IAAI,KAAK;YACnB,KAAK,EAAE,OAAO;YACd,KAAK,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,kBAAkB,EAAE,IAAI,CAAC,kBAAkB,EAAE;YACxE,YAAY,EAAE,IAAI,GAAG,EAAE,EAAE,WAAW,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,eAAe,EAAE;SAC1E,CAAC;IACJ,CAAC;IAEO,kBAAkB,CAAC,SAA4B;QACrD,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACnC,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;QACnC,IAAI,OAAO,CAAC,KAAK,KAAK,YAAY;YAAE,OAAO,OAAO,CAAC;QACnD,MAAM,OAAO,GAAc;YACzB,GAAG,OAAO;YACV,KAAK,EAAE,YAAY;YACnB,aAAa,EAAE,CAAC,GAAG,SAAS,CAAC;SAC9B,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACpB,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,oBAAoB,CAAC,IAAe;QAC1C,IAAI,CAAC,oBAAoB,EAAE,EAAE,CAAC;QAC9B,IAAI,CAAC,oBAAoB,GAAG,SAAS,CAAC;IACxC,CAAC;IAEO,MAAM,CAAC,IAAe;QAC5B,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;YAAE,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;IAChD,CAAC;IAEO,OAAO,CACb,IAAe,EACf,SAA4B,EAC5B,WAA8B,EAC9B,QAAuD;QAEvD,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO;YAAE,OAAO;QACzC,MAAM,aAAa,GAAG,IAAI,CAAC,KAAK,KAAK,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC;QACnF,MAAM,MAAM,GAAG,CAAC,GAAW,EAAW,EAAE;YACtC,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;YACjC,IAAI,UAAU,KAAK,SAAS;gBAAE,OAAO,KAAK,CAAC;YAC3C,uEAAuE;YACvE,wEAAwE;YACxE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;YACzD,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QACF,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,aAAa,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE;gBACrD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;oBAAE,OAAO,KAAK,CAAC;gBAC/B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC3B,OAAO,IAAI,CAAC;YACd,CAAC,CAAC,CAAC;YACH,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,KAAK,KAAK,CAAC;gBAAE,OAAO;YACpD,IAAI,CAAC,KAAK,GAAG;gBACX,KAAK,EAAE,WAAW;gBAClB,kBAAkB,EAAE,IAAI,CAAC,KAAK,CAAC,kBAAkB;aAClD,CAAC;QACJ,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,WAAW,EAAE,CAAC;YACrC,IAAI,kBAAkB,GAAG,IAAI,CAAC,GAAG,CAC/B,IAAI,CAAC,KAAK,CAAC,kBAAkB,EAC7B,WAAW,CAAC,MAAM,CACnB,CAAC;YACF,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,EAAE,kBAAkB,EAAE,GAAG,CAAC,EAAE;gBACxD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;oBAAE,OAAO,KAAK,CAAC;gBAC/B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC3B,kBAAkB,EAAE,CAAC;gBACrB,OAAO,IAAI,CAAC;YACd,CAAC,CAAC,CAAC;YACH,IAAI,kBAAkB,GAAG,CAAC,EAAE,CAAC;gBAC3B,IAAI,CAAC,KAAK,GAAG,EAAE,KAAK,EAAE,WAAW,EAAE,kBAAkB,EAAE,CAAC;gBACxD,OAAO;YACT,CAAC;YACD,IAAI,CAAC,KAAK,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QACjC,CAAC;QACD,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QACtE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE;YACtD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC/B,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC3B,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACH,IAAI,IAAI,CAAC,KAAK,KAAK,YAAY,IAAI,KAAK,GAAG,IAAI,CAAC,MAAM;YAAE,OAAO;QAC/D,wEAAwE;QACxE,4EAA4E;QAC5E,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;CACF"}
+{"version":3,"file":"vm-reconcile-sweep.js","sourceRoot":"","sources":["../../src/internal/vm-reconcile-sweep.ts"],"names":[],"mappings":"AAEA,kFAAkF;AAClF,MAAM,OAAO,wBAAwB;IAC3B,OAAO,CAAqB;IAC5B,SAAS,GAAG,CAAC,CAAC;IAEtB,KAAK,KAAW,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC;IAE/D,iFAAiF;IACjF,KAAK,CAAC,IAAuB,EAAE,OAAe,EAAE,QAAkC;QAChF,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YAAC,OAAO,CAAC,CAAC;QAAC,CAAC;QAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC9E,MAAM,KAAK,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC;QACrE,IAAI,QAAQ,GAAG,CAAC,CAAC;QACjB,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,IAAI,CAAC,MAAM,IAAI,QAAQ,GAAG,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC;YAC7E,MAAM,KAAK,GAAG,CAAC,KAAK,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YAC9C,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAE,CAAC;YACzB,IAAI,CAAC,OAAO,GAAG,GAAG,CAAC;YACnB,IAAI,CAAC,SAAS,GAAG,KAAK,CAAC;YACvB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC;gBAAE,MAAM;YAC1B,QAAQ,EAAE,CAAC;YACX,IAAI,CAAC,SAAS,GAAG,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YAC3C,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACtC,CAAC;QACD,OAAO,QAAQ,CAAC;IAClB,CAAC;CACF;AAqCD,oFAAoF;AACpF,MAAM,OAAO,uBAAuB;IASf;IARF,KAAK,GAAG,IAAI,wBAAwB,EAAE,CAAC;IACvC,OAAO,GAAG,IAAI,wBAAwB,EAAE,CAAC;IACzC,kBAAkB,CAAS;IAC3B,sBAAsB,CAAS;IACxC,IAAI,CAAwB;IAEpC,YACE,OAAuC,EACtB,cAA2D;QAA3D,mBAAc,GAAd,cAAc,CAA6C;QAE5E,IAAI,CAAC,kBAAkB,GAAG,OAAO,CAAC,kBAAkB,CAAC;QACrD,IAAI,CAAC,sBAAsB,GAAG,OAAO,CAAC,sBAAsB,IAAI,CAAC,CAAC;IACpE,CAAC;IAED,KAAK;QACH,IAAI,IAAI,CAAC,IAAI;YAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;QACnB,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;IACvB,CAAC;IAED,gFAAgF;IAChF,KAAK,CACH,SAA4B,EAC5B,WAA8B,EAC9B,SAA6E;QAE7E,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,KAAK,KAAK,YAAY;YAAE,OAAO;QACxC,IAAI,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,SAAS,EAAE,WAAW,EAAE,SAAS,CAAC,CAAC;QAC/D,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YAClC,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACxE,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,QAAQ,CACZ,SAA4B,EAC5B,WAA8B,EAC9B,SAAoC,EACpC,SAAwB,EACxB,MAAoB;QAEpB,MAAM,QAAQ,GAAG,GAAG,EAAE,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC;QACvD,IAAI,CAAC,QAAQ,EAAE,IAAI,SAAS,CAAC,QAAQ,EAAE;YAAE,OAAO;QAChD,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,CAAC;QAChD,MAAM,aAAa,GAAG,MAAM;YAC1B,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC;QAC3E,MAAM,eAAe,GAAG,IAAI,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;QAC3D,IAAI,CAAC;YACH,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,IAAI,QAAQ,EAAE,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,EAAE,CAAC;gBAC5E,IAAI,CAAC,qBAAqB,CAAC,IAAI,EAAE,WAAW,EAC1C,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;gBAC3D,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,QAAQ,EAAE,IAAI,SAAS,CAAC,QAAQ,EAAE;oBAAE,MAAM;gBAC/E,qEAAqE;gBACrE,iEAAiE;gBACjE,MAAM,SAAS,CAAC,aAAa,CAAC,aAAa,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;gBAAS,CAAC;YACT,eAAe,EAAE,CAAC;YAClB,IAAI,CAAC,mBAAmB,EAAE,CAAC;YAC3B,qEAAqE;YACrE,iEAAiE;YACjE,IAAI,IAAI,CAAC,mBAAmB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO;gBAAE,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACzF,CAAC;QACD,MAAM,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;IACtC,CAAC;IAEO,WAAW;QACjB,OAAO,IAAI,CAAC,IAAI,KAAK;YACnB,KAAK,EAAE,OAAO;YACd,KAAK,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,kBAAkB,EAAE,IAAI,CAAC,kBAAkB,EAAE;YACxE,YAAY,EAAE,IAAI,GAAG,EAAE,EAAE,eAAe,EAAE,CAAC,EAAE,mBAAmB,EAAE,CAAC;YACnE,WAAW,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,eAAe,EAAE;SACjD,CAAC;IACJ,CAAC;IAEO,kBAAkB,CAAC,SAA4B;QACrD,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACnC,IAAI,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC;QACnC,IAAI,OAAO,CAAC,KAAK,KAAK,YAAY,EAAE,CAAC;YACnC,OAAO,CAAC,mBAAmB,EAAE,CAAC;YAC9B,OAAO,OAAO,CAAC;QACjB,CAAC;QACD,MAAM,OAAO,GAAc;YACzB,GAAG,OAAO;YACV,KAAK,EAAE,YAAY;YACnB,aAAa,EAAE,CAAC,GAAG,SAAS,CAAC;YAC7B,mBAAmB,EAAE,CAAC;SACvB,CAAC;QACF,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QACpB,OAAO,OAAO,CAAC;IACjB,CAAC;IAEO,oBAAoB,CAAC,IAAe;QAC1C,IAAI,CAAC,oBAAoB,EAAE,EAAE,CAAC;QAC9B,IAAI,CAAC,oBAAoB,GAAG,SAAS,CAAC;IACxC,CAAC;IAEO,MAAM,CAAC,IAAe;QAC5B,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;YAAE,IAAI,CAAC,IAAI,GAAG,SAAS,CAAC;IAChD,CAAC;IAEO,MAAM,CACZ,IAAe,EACf,GAAW,EACX,QAAuD,EACvD,KAAc;QAEd,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,UAAU,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QAC3C,4EAA4E;QAC5E,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC;QACzD,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,KAAK;YAAE,IAAI,CAAC,eAAe,EAAE,CAAC;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IAEO,iBAAiB,CACvB,IAAe,EACf,IAAuB,EACvB,QAAuD;QAEvD,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,EAClD,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;IACzD,CAAC;IAEO,cAAc,CACpB,IAAe,EACf,IAAuB,EACvB,SAAiB,EACjB,QAAuD;QAEvD,IAAI,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,CAAC,EAAE;YACrC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,QAAQ,EAAE,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YAC3D,MAAM,EAAE,CAAC;YACT,OAAO,IAAI,CAAC;QACd,CAAC,CAAC,CAAC;QACH,OAAO,MAAM,CAAC;IAChB,CAAC;IAEO,cAAc,CACpB,IAAe,EACf,IAAuB,EACvB,KAAa,EACb,QAAuD;QAEvD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;QAC7D,MAAM,QAAQ,GAAG,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EACtD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,GAAG,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC;QAC/E,OAAO,EAAE,QAAQ,EAAE,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;IAC9C,CAAC;IAED,wFAAwF;IAChF,gBAAgB,CACtB,IAAe,EACf,SAA4B,EAC5B,WAA8B,EAC9B,SAA6E;QAE7E,IAAI,IAAI,CAAC,KAAK,KAAK,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO;YAAE,OAAO;QACnE,MAAM,UAAU,GAAG,SAAS,CAAC,kBAAkB,CAAC;QAChD,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YACnC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,kBAAkB,CAAC;YAChD,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,SAAS,EAAE,UAAU,CAAC,EAAE,CAAC;gBACzD,sEAAsE;gBACtE,qEAAqE;gBACrE,IAAI,CAAC,KAAK,GAAG;oBACX,KAAK,EAAE,SAAS;oBAChB,kBAAkB,EAAE,IAAI,CAAC,cAAc,CAAC,IAAI,EAAE,WAAW,EAAE,SAAS,EAAE,SAAS,CAAC,QAAQ,CAAC;iBAC1F,CAAC;gBACF,OAAO;YACT,CAAC;YACD,IAAI,CAAC,KAAK,GAAG,EAAE,KAAK,EAAE,WAAW,EAAE,kBAAkB,EAAE,SAAS,EAAE,CAAC;QACrE,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,WAAW,EAAE,CAAC;YACrC,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CACnC,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,kBAAkB,EAAE,SAAS,CAAC,QAAQ,CACrE,CAAC;YACF,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;gBAClB,IAAI,CAAC,KAAK,GAAG,EAAE,KAAK,EAAE,WAAW,EAAE,kBAAkB,EAAE,SAAS,EAAE,CAAC;gBACnE,OAAO;YACT,CAAC;YACD,IAAI,CAAC,KAAK,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QACjC,CAAC;QACD,IAAI,CAAC,cAAc,CACjB,IAAI,EACJ,SAAS,EACT,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,sBAAsB,GAAG,IAAI,CAAC,eAAe,CAAC,EAC/D,UAAU,CACX,CAAC;QACF,yEAAyE;QACzE,6DAA6D;QAC7D,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;IAED,8EAA8E;IACtE,qBAAqB,CAC3B,IAAe,EACf,WAA8B,EAC9B,QAAuD;QAEvD,IAAI,IAAI,CAAC,KAAK,KAAK,YAAY,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,OAAO;YAAE,OAAO;QACxE,MAAM,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC;QACrC,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,iBAAiB,CAAC,IAAI,EAAE,SAAS,EAAE,QAAQ,CAAC;gBAAE,OAAO;YAC/D,IAAI,CAAC,KAAK,GAAG,EAAE,KAAK,EAAE,WAAW,EAAE,kBAAkB,EAAE,IAAI,CAAC,KAAK,CAAC,kBAAkB,EAAE,CAAC;QACzF,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,CAAC,KAAK,KAAK,WAAW,EAAE,CAAC;YACrC,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CACnC,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,kBAAkB,EAAE,QAAQ,CAC3D,CAAC;YACF,IAAI,SAAS,GAAG,CAAC,EAAE,CAAC;gBAClB,IAAI,CAAC,KAAK,GAAG,EAAE,KAAK,EAAE,WAAW,EAAE,kBAAkB,EAAE,SAAS,EAAE,CAAC;gBACnE,OAAO;YACT,CAAC;YACD,IAAI,CAAC,KAAK,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QACjC,CAAC;QACD,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,GAAG,IAAI,CAAC,cAAc,CACjD,IAAI,EAAE,SAAS,EAAE,SAAS,CAAC,MAAM,EAAE,QAAQ,CAC5C,CAAC;QACF,IAAI,QAAQ,GAAG,SAAS;YAAE,OAAO;QACjC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACpB,CAAC;CAEF"}

package/dist/internal/workspace-projected-delegatees.d.ts

@@ -0,0 +1,3 @@
+import type { ContextGraphMetaRecord } from '../context-graph-meta-projection.js';
+export declare function collectProjectedDelegatees(meta: ContextGraphMetaRecord, field: 'allowedPeers' | 'allowedKeys', normalizeValue: (value: string) => string): Map<string, string[]>;
+//# sourceMappingURL=workspace-projected-delegatees.d.ts.map

package/dist/internal/workspace-projected-delegatees.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"workspace-projected-delegatees.d.ts","sourceRoot":"","sources":["../../src/internal/workspace-projected-delegatees.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,sBAAsB,EAAE,MAAM,qCAAqC,CAAC;AAUlF,wBAAgB,0BAA0B,CACxC,IAAI,EAAE,sBAAsB,EAC5B,KAAK,EAAE,cAAc,GAAG,aAAa,EACrC,cAAc,EAAE,CAAC,KAAK,EAAE,MAAM,KAAK,MAAM,GACxC,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAsBvB"}