@earendil-works/chord 1.5.0 → 1.5.1

package/dist/next/registries/value.js

@@ -1,199 +0,0 @@
-// Registry values (slice 8 §1 "Reading", S2, S3): a registry's composed value as the readers of one version see it, a
-// native source. The provider's version reads the composition itself; an older one reads it mapped back with
-// `accepts[old].value`, once per composition, kept only while someone reads or follows it; a version the provider
-// cannot serve fails `contract_mismatch`. Its readers (attempts that declared it) keep the mapping; its waiters
-// (attempts parked on it, a waiting `host.registry`) are woken at every change of whether it is usable, and of its
-// failure while it is not (dependency model §9).
-import { ChordError, isChordError } from "../data/index.js";
-import { FollowedSource } from "../state/internal.js";
-const USABLE = { kind: "usable" };
-/** Whether two failures say the same: the same error, or ChordErrors alike (a version mismatch is made per read). */
-function sameError(a, b) {
-    if (a === b)
-        return true;
-    return isChordError(a) && isChordError(b) && a.code === b.code && a.reason === b.reason && a.message === b.message;
-}
-/** One version's view of a registry's composed value. */
-export class RegistryValueSource extends FollowedSource {
-    name;
-    version;
-    #registered;
-    /** Its readers, each a token of its own (one object may read twice), until released. */
-    #readers = new Set();
-    /** Its waiters, each a token of its own, until released. */
-    #waiters = new Set();
-    /**
-     * What its waiters were last told: usable (a value, or a failure with a last good one), or the error it has none
-     * for; a change wakes them.
-     */
-    #told;
-    #mapped;
-    #mapFailure;
-    constructor(record, version, batch) {
-        super(batch);
-        this.name = record.name;
-        this.version = version;
-        this.#registered = { kind: "open", record };
-    }
-    /** The composition (or its mapping) at its last good value; throws the failure when there is none. */
-    get value() {
-        const start = this.start();
-        if (start.kind === "value")
-            return start.value;
-        if (start.last === undefined)
-            throw start.error;
-        return start.last.value;
-    }
-    /**
-     * Its composition (mapped for an older version), composed now if its table changed; a change of whether it is
-     * usable, or of its failure while it is not, wakes its waiters.
-     */
-    start() {
-        const registered = this.#registered;
-        if (registered.kind === "closed")
-            return registered.last;
-        const start = this.#start(registered.record);
-        if (this.#waiters.size > 0)
-            this.#tell(start);
-        return start;
-    }
-    /** Its composition (or mapping) now; throws while it is failed, though `.value` keeps the last good one. */
-    current() {
-        const start = this.start();
-        if (start.kind === "failed")
-            throw start.error;
-        return start.value;
-    }
-    /** Followed while someone watches or observes it, and while waiters wait on it. */
-    get watched() {
-        return super.watched || this.#waiters.size > 0;
-    }
-    /** Registers a reader (an attempt that declared it) until the returned release: its mapping is kept meanwhile. */
-    read() {
-        const token = {};
-        this.#readers.add(token);
-        return () => {
-            this.#readers.delete(token);
-            if (this.#readers.size === 0 && !super.watched)
-                this.#dropMapping();
-        };
-    }
-    /**
-     * Registers `waiter` (a parked attempt's object, a waiting `host.registry`) until the returned release: it is told
-     * of every change of whether this value is usable (inside the batch that made it: it only records).
-     */
-    wait(waiter) {
-        const token = { waiter };
-        if (this.#waiters.size === 0)
-            this.#told = undefined;
-        this.#waiters.add(token);
-        return () => {
-            this.#waiters.delete(token);
-            if (this.#waiters.size === 0)
-                this.#told = undefined;
-        };
-    }
-    /** The registry's table changed (inside a batch): its dependents are marked, its followers get the next frame. */
-    recomposed() {
-        this.changed();
-    }
-    /**
-     * The registry's table changed again while not composed since (inside a batch): its dependents are marked already
-     * (none read it meanwhile, or it would be composed); its followers get the next frame. Marking stops here, so a
-     * cycle of registries through their values ends.
-     */
-    relisted() {
-        this.list();
-    }
-    /** The host closed: its watches and observers end, its readers and mapping go; it keeps its last start only. */
-    close() {
-        let last;
-        try {
-            last = this.start();
-        }
-        catch (error) {
-            last = { kind: "failed", error, last: undefined };
-        }
-        this.#registered = { kind: "closed", last };
-        this.#readers.clear();
-        const waiters = [...this.#waiters];
-        this.#waiters.clear();
-        const error = new ChordError({ code: "released", reason: "closed", message: `registry ${this.name}: closed` });
-        for (const { waiter } of waiters)
-            waiter.closed(error);
-        this.#told = undefined;
-        this.#dropMapping();
-        this.end();
-    }
-    /** Nobody follows it: without readers, its mapping goes (computed again on the next read). */
-    unfollowed() {
-        if (this.#readers.size === 0)
-            this.#dropMapping();
-    }
-    /** Wakes the waiters when `start` says something else than they were told (by usability, then by the error). */
-    #tell(start) {
-        const told = this.#told;
-        const usable = start.kind === "value" || start.last !== undefined;
-        if (usable ? told?.kind === "usable" : told?.kind === "failed" && sameError(told.error, start.error))
-            return;
-        this.#told = usable ? USABLE : { kind: "failed", error: start.error };
-        // The first start of a wait wakes nobody: the waiter reads it itself.
-        if (told === undefined)
-            return;
-        for (const { waiter } of this.#waiters)
-            waiter.dependencyMoved();
-    }
-    #dropMapping() {
-        this.#mapped = undefined;
-        this.#mapFailure = undefined;
-    }
-    #start(record) {
-        const provided = record.providedVersion;
-        if (provided === undefined || provided === this.version)
-            return record.start();
-        const map = provided > this.version ? record.valueAdapter(this.version) : undefined;
-        if (map === undefined) {
-            const message = `registry ${this.name}: version ${this.version} is not served here (version ${provided} is)`;
-            return { kind: "failed", error: new ChordError({ code: "contract_mismatch", message }), last: undefined };
-        }
-        return this.#mappedStart(record, record.start(), map);
-    }
-    /**
-     * The composition `current` mapped back with `map`, once per composition; a throwing mapping fails this version
-     * only (reported once per episode), keeping its last good mapping; a composition mapped before heals it.
-     */
-    #mappedStart(record, current, map) {
-        if (current.kind === "failed" && current.last === undefined)
-            return current;
-        const from = current.kind === "value" ? current.value : current.last.value;
-        // `undefined` is a composition too: the records, not their fields, say whether there is one.
-        // A mapping built from a contribution that left is no last good value any more (decision 5).
-        if (this.#mapped?.contributions !== undefined && !record.inTable(this.#mapped.contributions)) {
-            this.#mapped = undefined;
-        }
-        const mapped = this.#mapped;
-        const failure = this.#mapFailure;
-        if (mapped !== undefined && mapped.from === from && mapped.map === map) {
-            this.#mapFailure = undefined;
-        }
-        else if (failure === undefined || failure.from !== from || failure.map !== map) {
-            try {
-                const value = record.adapt(() => map(from));
-                this.#mapped = { from, map, value, contributions: record.composedFrom };
-                this.#mapFailure = undefined;
-            }
-            catch (error) {
-                if (failure === undefined)
-                    record.failed(error);
-                this.#mapFailure = { from, map, error };
-            }
-        }
-        const last = this.#mapped === undefined ? undefined : { value: this.#mapped.value };
-        if (this.#mapFailure !== undefined)
-            return { kind: "failed", error: this.#mapFailure.error, last };
-        if (current.kind === "failed")
-            return { kind: "failed", error: current.error, last };
-        return { kind: "value", value: last.value };
-    }
-}
-//# sourceMappingURL=value.js.map

package/dist/next/registries/value.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"value.js","sourceRoot":"","sources":["../../../src/next/registries/value.ts"],"names":[],"mappings":"AAAA,sHAAsH;AACtH,6GAA6G;AAC7G,kHAAkH;AAClH,gHAAgH;AAChH,mHAAmH;AACnH,iDAAiD;AAEjD,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAC5D,OAAO,EAAc,cAAc,EAAoB,MAAM,sBAAsB,CAAC;AAYpF,MAAM,MAAM,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAW,CAAC;AAE3C,qHAAqH;AACrH,SAAS,SAAS,CAAC,CAAU,EAAE,CAAU;IACxC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACzB,OAAO,YAAY,CAAC,CAAC,CAAC,IAAI,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,OAAO,KAAK,CAAC,CAAC,OAAO,CAAC;AACpH,CAAC;AAyBD,yDAAyD;AACzD,MAAM,OAAO,mBAAoB,SAAQ,cAAuB;IACtD,IAAI,CAAS;IACb,OAAO,CAAS;IACzB,WAAW,CAAa;IACxB,wFAAwF;IAC/E,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,4DAA4D;IACnD,QAAQ,GAAG,IAAI,GAAG,EAAuC,CAAC;IACnE;;;OAGG;IACH,KAAK,CAAiG;IACtG,OAAO,CAAqB;IAC5B,WAAW,CAAyB;IAEpC,YAAY,MAAsB,EAAE,OAAe,EAAE,KAAY;QAChE,KAAK,CAAC,KAAK,CAAC,CAAC;QACb,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC;QACxB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,WAAW,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC;IAC7C,CAAC;IAED,sGAAsG;IACtG,IAAI,KAAK;QACR,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,IAAI,KAAK,OAAO;YAAE,OAAO,KAAK,CAAC,KAAK,CAAC;QAC/C,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS;YAAE,MAAM,KAAK,CAAC,KAAK,CAAC;QAChD,OAAO,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC;IACzB,CAAC;IAED;;;OAGG;IACM,KAAK;QACb,MAAM,UAAU,GAAG,IAAI,CAAC,WAAW,CAAC;QACpC,IAAI,UAAU,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,UAAU,CAAC,IAAI,CAAC;QACzD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;QAC7C,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC;YAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC9C,OAAO,KAAK,CAAC;IACd,CAAC;IAED,4GAA4G;IACnG,OAAO;QACf,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,IAAI,KAAK,QAAQ;YAAE,MAAM,KAAK,CAAC,KAAK,CAAC;QAC/C,OAAO,KAAK,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,mFAAmF;IACnF,IAAa,OAAO;QACnB,OAAO,KAAK,CAAC,OAAO,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,CAAC;IAChD,CAAC;IAED,kHAAkH;IAClH,IAAI;QACH,MAAM,KAAK,GAAG,EAAE,CAAC;QACjB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACzB,OAAO,GAAG,EAAE;YACX,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO;gBAAE,IAAI,CAAC,YAAY,EAAE,CAAC;QACrE,CAAC,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,MAAsB;QAC1B,MAAM,KAAK,GAAG,EAAE,MAAM,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACrD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACzB,OAAO,GAAG,EAAE;YACX,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;gBAAE,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACtD,CAAC,CAAC;IACH,CAAC;IAED,kHAAkH;IAClH,UAAU;QACT,IAAI,CAAC,OAAO,EAAE,CAAC;IAChB,CAAC;IAED;;;;OAIG;IACH,QAAQ;QACP,IAAI,CAAC,IAAI,EAAE,CAAC;IACb,CAAC;IAED,gHAAgH;IAChH,KAAK;QACJ,IAAI,IAA0B,CAAC;QAC/B,IAAI,CAAC;YACJ,IAAI,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;QACrB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YAChB,IAAI,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;QACnD,CAAC;QACD,IAAI,CAAC,WAAW,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;QAC5C,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,YAAY,IAAI,CAAC,IAAI,UAAU,EAAE,CAAC,CAAC;QAC/G,KAAK,MAAM,EAAE,MAAM,EAAE,IAAI,OAAO;YAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACvD,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;QACvB,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,CAAC,GAAG,EAAE,CAAC;IACZ,CAAC;IAED,8FAA8F;IAC3E,UAAU;QAC5B,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,YAAY,EAAE,CAAC;IACnD,CAAC;IAED,gHAAgH;IAChH,KAAK,CAAC,KAA2B;QAChC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACxB,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC,IAAI,KAAK,SAAS,CAAC;QAClE,IAAI,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,KAAK,QAAQ,IAAI,SAAS,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC;YAAE,OAAO;QAC7G,IAAI,CAAC,KAAK,GAAG,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAG,KAAqC,CAAC,KAAK,EAAE,CAAC;QACvG,sEAAsE;QACtE,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO;QAC/B,KAAK,MAAM,EAAE,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ;YAAE,MAAM,CAAC,eAAe,EAAE,CAAC;IAClE,CAAC;IAED,YAAY;QACX,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;QACzB,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;IAC9B,CAAC;IAED,MAAM,CAAC,MAAsB;QAC5B,MAAM,QAAQ,GAAG,MAAM,CAAC,eAAe,CAAC;QACxC,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,IAAI,CAAC,OAAO;YAAE,OAAO,MAAM,CAAC,KAAK,EAAE,CAAC;QAC/E,MAAM,GAAG,GAAG,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACpF,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,OAAO,GAAG,YAAY,IAAI,CAAC,IAAI,aAAa,IAAI,CAAC,OAAO,gCAAgC,QAAQ,MAAM,CAAC;YAC7G,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,UAAU,CAAC,EAAE,IAAI,EAAE,mBAAmB,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;QAC3G,CAAC;QACD,OAAO,IAAI,CAAC,YAAY,CAAC,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,EAAE,GAAG,CAAC,CAAC;IACvD,CAAC;IAED;;;OAGG;IACH,YAAY,CACX,MAAsB,EACtB,OAA6B,EAC7B,GAAgC;QAEhC,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS;YAAE,OAAO,OAAO,CAAC;QAC5E,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,IAAK,CAAC,KAAK,CAAC;QAC5E,6FAA6F;QAC7F,6FAA6F;QAC7F,IAAI,IAAI,CAAC,OAAO,EAAE,aAAa,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;YAC9F,IAAI,CAAC,OAAO,GAAG,SAAS,CAAC;QAC1B,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC;QAC5B,MAAM,OAAO,GAAG,IAAI,CAAC,WAAW,CAAC;QACjC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,KAAK,IAAI,IAAI,MAAM,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YACxE,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;QAC9B,CAAC;aAAM,IAAI,OAAO,KAAK,SAAS,IAAI,OAAO,CAAC,IAAI,KAAK,IAAI,IAAI,OAAO,CAAC,GAAG,KAAK,GAAG,EAAE,CAAC;YAClF,IAAI,CAAC;gBACJ,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,IAAa,CAAC,CAAC,CAAC;gBACrD,IAAI,CAAC,OAAO,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,CAAC,YAAY,EAAE,CAAC;gBACxE,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;YAC9B,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBAChB,IAAI,OAAO,KAAK,SAAS;oBAAE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAChD,IAAI,CAAC,WAAW,GAAG,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC;YACzC,CAAC;QACF,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC;QACpF,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS;YAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC;QACnG,IAAI,OAAO,CAAC,IAAI,KAAK,QAAQ;YAAE,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,EAAE,IAAI,EAAE,CAAC;QACrF,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,IAAK,CAAC,KAAK,EAAE,CAAC;IAC9C,CAAC;CACD","sourcesContent":["// Registry values (slice 8 §1 \"Reading\", S2, S3): a registry's composed value as the readers of one version see it, a\n// native source. The provider's version reads the composition itself; an older one reads it mapped back with\n// `accepts[old].value`, once per composition, kept only while someone reads or follows it; a version the provider\n// cannot serve fails `contract_mismatch`. Its readers (attempts that declared it) keep the mapping; its waiters\n// (attempts parked on it, a waiting `host.registry`) are woken at every change of whether it is usable, and of its\n// failure while it is not (dependency model §9).\n\nimport { ChordError, isChordError } from \"../data/index.ts\";\nimport { type Batch, FollowedSource, type NativeStart } from \"../state/internal.ts\";\nimport type { RegistryContribution } from \"./contribution.ts\";\nimport type { RegistryRecord } from \"./record.ts\";\n\n/** Who waits for a registry's value (a parked attempt, a `host.registry`): told when it may have changed. */\nexport interface RegistryWaiter {\n\t/** The value may have changed (inside its batch: it only records). */\n\tdependencyMoved(): void;\n\t/** The value closed with its host: the wait ends with `error` (`released/closed`). */\n\tclosed(error: ChordError): void;\n}\n\nconst USABLE = { kind: \"usable\" } as const;\n\n/** Whether two failures say the same: the same error, or ChordErrors alike (a version mismatch is made per read). */\nfunction sameError(a: unknown, b: unknown): boolean {\n\tif (a === b) return true;\n\treturn isChordError(a) && isChordError(b) && a.code === b.code && a.reason === b.reason && a.message === b.message;\n}\n\n/**\n * The last good mapping for an older version, the composition it was made from, and the contributions that composition\n * was built from (kept only while all are in the table, decision 5).\n */\ntype Mapped = {\n\treadonly from: unknown;\n\t/** The adapter it was made with: a reload's provider brings another, which maps again. */\n\treadonly map: (current: never) => unknown;\n\treadonly value: unknown;\n\treadonly contributions: readonly RegistryContribution[] | undefined;\n};\n\n/** A failed mapping of composition `from` by `map`, until another composition or adapter maps. */\ntype MapFailure = { readonly from: unknown; readonly map: (current: never) => unknown; readonly error: unknown };\n\n/**\n * Where a value's registry stands for it: on the host, or closed with the host (its last start kept, the record let\n * go, so a value an app keeps keeps no closed host).\n */\ntype Registered =\n\t| { readonly kind: \"open\"; readonly record: RegistryRecord }\n\t| { readonly kind: \"closed\"; readonly last: NativeStart<unknown> };\n\n/** One version's view of a registry's composed value. */\nexport class RegistryValueSource extends FollowedSource<unknown> {\n\treadonly name: string;\n\treadonly version: number;\n\t#registered: Registered;\n\t/** Its readers, each a token of its own (one object may read twice), until released. */\n\treadonly #readers = new Set<object>();\n\t/** Its waiters, each a token of its own, until released. */\n\treadonly #waiters = new Set<{ readonly waiter: RegistryWaiter }>();\n\t/**\n\t * What its waiters were last told: usable (a value, or a failure with a last good one), or the error it has none\n\t * for; a change wakes them.\n\t */\n\t#told: { readonly kind: \"usable\" } | { readonly kind: \"failed\"; readonly error: unknown } | undefined;\n\t#mapped: Mapped | undefined;\n\t#mapFailure: MapFailure | undefined;\n\n\tconstructor(record: RegistryRecord, version: number, batch: Batch) {\n\t\tsuper(batch);\n\t\tthis.name = record.name;\n\t\tthis.version = version;\n\t\tthis.#registered = { kind: \"open\", record };\n\t}\n\n\t/** The composition (or its mapping) at its last good value; throws the failure when there is none. */\n\tget value(): unknown {\n\t\tconst start = this.start();\n\t\tif (start.kind === \"value\") return start.value;\n\t\tif (start.last === undefined) throw start.error;\n\t\treturn start.last.value;\n\t}\n\n\t/**\n\t * Its composition (mapped for an older version), composed now if its table changed; a change of whether it is\n\t * usable, or of its failure while it is not, wakes its waiters.\n\t */\n\toverride start(): NativeStart<unknown> {\n\t\tconst registered = this.#registered;\n\t\tif (registered.kind === \"closed\") return registered.last;\n\t\tconst start = this.#start(registered.record);\n\t\tif (this.#waiters.size > 0) this.#tell(start);\n\t\treturn start;\n\t}\n\n\t/** Its composition (or mapping) now; throws while it is failed, though `.value` keeps the last good one. */\n\toverride current(): unknown {\n\t\tconst start = this.start();\n\t\tif (start.kind === \"failed\") throw start.error;\n\t\treturn start.value;\n\t}\n\n\t/** Followed while someone watches or observes it, and while waiters wait on it. */\n\toverride get watched(): boolean {\n\t\treturn super.watched || this.#waiters.size > 0;\n\t}\n\n\t/** Registers a reader (an attempt that declared it) until the returned release: its mapping is kept meanwhile. */\n\tread(): () => void {\n\t\tconst token = {};\n\t\tthis.#readers.add(token);\n\t\treturn () => {\n\t\t\tthis.#readers.delete(token);\n\t\t\tif (this.#readers.size === 0 && !super.watched) this.#dropMapping();\n\t\t};\n\t}\n\n\t/**\n\t * Registers `waiter` (a parked attempt's object, a waiting `host.registry`) until the returned release: it is told\n\t * of every change of whether this value is usable (inside the batch that made it: it only records).\n\t */\n\twait(waiter: RegistryWaiter): () => void {\n\t\tconst token = { waiter };\n\t\tif (this.#waiters.size === 0) this.#told = undefined;\n\t\tthis.#waiters.add(token);\n\t\treturn () => {\n\t\t\tthis.#waiters.delete(token);\n\t\t\tif (this.#waiters.size === 0) this.#told = undefined;\n\t\t};\n\t}\n\n\t/** The registry's table changed (inside a batch): its dependents are marked, its followers get the next frame. */\n\trecomposed(): void {\n\t\tthis.changed();\n\t}\n\n\t/**\n\t * The registry's table changed again while not composed since (inside a batch): its dependents are marked already\n\t * (none read it meanwhile, or it would be composed); its followers get the next frame. Marking stops here, so a\n\t * cycle of registries through their values ends.\n\t */\n\trelisted(): void {\n\t\tthis.list();\n\t}\n\n\t/** The host closed: its watches and observers end, its readers and mapping go; it keeps its last start only. */\n\tclose(): void {\n\t\tlet last: NativeStart<unknown>;\n\t\ttry {\n\t\t\tlast = this.start();\n\t\t} catch (error) {\n\t\t\tlast = { kind: \"failed\", error, last: undefined };\n\t\t}\n\t\tthis.#registered = { kind: \"closed\", last };\n\t\tthis.#readers.clear();\n\t\tconst waiters = [...this.#waiters];\n\t\tthis.#waiters.clear();\n\t\tconst error = new ChordError({ code: \"released\", reason: \"closed\", message: `registry ${this.name}: closed` });\n\t\tfor (const { waiter } of waiters) waiter.closed(error);\n\t\tthis.#told = undefined;\n\t\tthis.#dropMapping();\n\t\tthis.end();\n\t}\n\n\t/** Nobody follows it: without readers, its mapping goes (computed again on the next read). */\n\tprotected override unfollowed(): void {\n\t\tif (this.#readers.size === 0) this.#dropMapping();\n\t}\n\n\t/** Wakes the waiters when `start` says something else than they were told (by usability, then by the error). */\n\t#tell(start: NativeStart<unknown>): void {\n\t\tconst told = this.#told;\n\t\tconst usable = start.kind === \"value\" || start.last !== undefined;\n\t\tif (usable ? told?.kind === \"usable\" : told?.kind === \"failed\" && sameError(told.error, start.error)) return;\n\t\tthis.#told = usable ? USABLE : { kind: \"failed\", error: (start as { readonly error: unknown }).error };\n\t\t// The first start of a wait wakes nobody: the waiter reads it itself.\n\t\tif (told === undefined) return;\n\t\tfor (const { waiter } of this.#waiters) waiter.dependencyMoved();\n\t}\n\n\t#dropMapping(): void {\n\t\tthis.#mapped = undefined;\n\t\tthis.#mapFailure = undefined;\n\t}\n\n\t#start(record: RegistryRecord): NativeStart<unknown> {\n\t\tconst provided = record.providedVersion;\n\t\tif (provided === undefined || provided === this.version) return record.start();\n\t\tconst map = provided > this.version ? record.valueAdapter(this.version) : undefined;\n\t\tif (map === undefined) {\n\t\t\tconst message = `registry ${this.name}: version ${this.version} is not served here (version ${provided} is)`;\n\t\t\treturn { kind: \"failed\", error: new ChordError({ code: \"contract_mismatch\", message }), last: undefined };\n\t\t}\n\t\treturn this.#mappedStart(record, record.start(), map);\n\t}\n\n\t/**\n\t * The composition `current` mapped back with `map`, once per composition; a throwing mapping fails this version\n\t * only (reported once per episode), keeping its last good mapping; a composition mapped before heals it.\n\t */\n\t#mappedStart(\n\t\trecord: RegistryRecord,\n\t\tcurrent: NativeStart<unknown>,\n\t\tmap: (current: never) => unknown,\n\t): NativeStart<unknown> {\n\t\tif (current.kind === \"failed\" && current.last === undefined) return current;\n\t\tconst from = current.kind === \"value\" ? current.value : current.last!.value;\n\t\t// `undefined` is a composition too: the records, not their fields, say whether there is one.\n\t\t// A mapping built from a contribution that left is no last good value any more (decision 5).\n\t\tif (this.#mapped?.contributions !== undefined && !record.inTable(this.#mapped.contributions)) {\n\t\t\tthis.#mapped = undefined;\n\t\t}\n\t\tconst mapped = this.#mapped;\n\t\tconst failure = this.#mapFailure;\n\t\tif (mapped !== undefined && mapped.from === from && mapped.map === map) {\n\t\t\tthis.#mapFailure = undefined;\n\t\t} else if (failure === undefined || failure.from !== from || failure.map !== map) {\n\t\t\ttry {\n\t\t\t\tconst value = record.adapt(() => map(from as never));\n\t\t\t\tthis.#mapped = { from, map, value, contributions: record.composedFrom };\n\t\t\t\tthis.#mapFailure = undefined;\n\t\t\t} catch (error) {\n\t\t\t\tif (failure === undefined) record.failed(error);\n\t\t\t\tthis.#mapFailure = { from, map, error };\n\t\t\t}\n\t\t}\n\t\tconst last = this.#mapped === undefined ? undefined : { value: this.#mapped.value };\n\t\tif (this.#mapFailure !== undefined) return { kind: \"failed\", error: this.#mapFailure.error, last };\n\t\tif (current.kind === \"failed\") return { kind: \"failed\", error: current.error, last };\n\t\treturn { kind: \"value\", value: last!.value };\n\t}\n}\n"]}

package/dist/next/remote/calls.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"calls.d.ts","sourceRoot":"","sources":["../../../src/next/remote/calls.ts"],"names":[],"mappings":"AAGA,gGAAgG;AAChG,MAAM,MAAM,UAAU,GAAG;IAAE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,IAAI,EAAE,MAAM,IAAI,CAAA;CAAE,CAAC;AAE9E;;;GAGG;AACH,qBAAa,UAAU,CAAC,CAAC,SAAS,UAAU,GAAG,UAAU;;IAKxD,4GAA4G;IAC5G,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAOpB;IAED,wEAAwE;IACxE,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAG1B;IAED,uGAAuG;IACvG,KAAK,IAAI,IAAI,CAGZ;IAED,oGAAoG;IACpG,MAAM,CAAC,IAAI,EAAE,CAAC,GAAG,IAAI,CAEpB;IAED,kGAAkG;IAClG,UAAU,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,EAAE,CAQ5B;IAED,uEAAuE;IACvE,KAAK,IAAI,CAAC,EAAE,CAIX;CAWD"}

package/dist/next/remote/calls.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"calls.js","sourceRoot":"","sources":["../../../src/next/remote/calls.ts"],"names":[],"mappings":"AAAA,sHAAsH;AACtH,kGAAkG;AAKlG;;;GAGG;AACH,MAAM,OAAO,UAAU;IACtB,MAAM,GAAG,CAAC,CAAC;IACX,SAAS,GAAG,CAAC,CAAC;IACL,QAAQ,GAAG,IAAI,GAAG,EAAK,CAAC;IAEjC,4GAA4G;IAC5G,MAAM,CAAC,IAAO;QACb,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9D,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,OAAO;QACR,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,wEAAwE;IACxE,MAAM,CAAC,KAAa;QACnB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,MAAM,EAAE,CAAC;IACf,CAAC;IAED,uGAAuG;IACvG,KAAK;QACJ,IAAI,CAAC,SAAS,EAAE,CAAC;QACjB,IAAI,CAAC,MAAM,EAAE,CAAC;IACf,CAAC;IAED,oGAAoG;IACpG,MAAM,CAAC,IAAO;QACb,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5B,CAAC;IAED,kGAAkG;IAClG,UAAU,CAAC,IAAY;QACtB,MAAM,OAAO,GAAQ,EAAE,CAAC;QACxB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI;gBAAE,SAAS;YACjC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,OAAO,CAAC;IAChB,CAAC;IAED,uEAAuE;IACvE,KAAK;QACJ,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QACnC,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC;QACtB,OAAO,OAAO,CAAC;IAChB,CAAC;IAED,yDAAyD;IACzD,MAAM;QACL,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,MAAM;gBAAE,OAAO;YAC1C,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC3B,IAAI,CAAC,SAAS,EAAE,CAAC;YACjB,IAAI,CAAC,IAAI,EAAE,CAAC;QACb,CAAC;IACF,CAAC;CACD","sourcesContent":["// The call window (§3, decision log \"Flow control: an ack-clocked window\"): at most the peer's N calls in flight on a\n// link from this host; further calls wait in one FIFO queue, sent in order as replies free slots.\n\n/** A call waiting for a slot: its hold (a rebind or release takes it out) and what sends it. */\nexport type QueuedCall = { readonly hold: number; readonly send: () => void };\n\n/**\n * The calls of one link's consumer side. `limit` is the peer's N from its `hello` (0 before it, so every call waits).\n * A relay forwards its downstream calls at once, so only this host's own calls are counted here.\n */\nexport class CallWindow<C extends QueuedCall = QueuedCall> {\n\t#limit = 0;\n\t#inFlight = 0;\n\treadonly #waiting = new Set<C>();\n\n\t/** Sends `call` now when a slot is free and nothing waits, otherwise queues it behind the earlier calls. */\n\tsubmit(call: C): void {\n\t\tif (this.#waiting.size === 0 && this.#inFlight < this.#limit) {\n\t\t\tthis.#inFlight++;\n\t\t\tcall.send();\n\t\t\treturn;\n\t\t}\n\t\tthis.#waiting.add(call);\n\t}\n\n\t/** The peer's window arrived with its `hello`: waiting calls go out. */\n\topened(limit: number): void {\n\t\tthis.#limit = limit;\n\t\tthis.#drain();\n\t}\n\n\t/** A call in flight ended (its reply, its abort sent, its hold released or gone): its slot is free. */\n\tfreed(): void {\n\t\tthis.#inFlight--;\n\t\tthis.#drain();\n\t}\n\n\t/** Takes a waiting call out (its caller cancelled); nothing happens for one that is not waiting. */\n\tremove(call: C): void {\n\t\tthis.#waiting.delete(call);\n\t}\n\n\t/** Takes every waiting call of `hold` out and returns them (its hold rebinds or was released). */\n\tremoveHold(hold: number): C[] {\n\t\tconst removed: C[] = [];\n\t\tfor (const call of this.#waiting) {\n\t\t\tif (call.hold !== hold) continue;\n\t\t\tthis.#waiting.delete(call);\n\t\t\tremoved.push(call);\n\t\t}\n\t\treturn removed;\n\t}\n\n\t/** Takes every waiting call out and returns them (the link closed). */\n\tclear(): C[] {\n\t\tconst removed = [...this.#waiting];\n\t\tthis.#waiting.clear();\n\t\treturn removed;\n\t}\n\n\t/** Sends waiting calls in order while slots are free. */\n\t#drain(): void {\n\t\tfor (const call of this.#waiting) {\n\t\t\tif (this.#inFlight >= this.#limit) return;\n\t\t\tthis.#waiting.delete(call);\n\t\t\tthis.#inFlight++;\n\t\t\tcall.send();\n\t\t}\n\t}\n}\n"]}

package/dist/next/remote/consumer.d.ts

@@ -1,42 +0,0 @@
-import type { Context } from "../../context/index.ts";
-import { type MethodData } from "../contracts/internal.ts";
-import { ChordError } from "../data/index.ts";
-import { type ConsumerMessage } from "../link/internal.ts";
-import type { HostLink } from "./host-link.ts";
-import type { RemoteObject } from "./remote-object.ts";
-/**
- * The consumer side of one link. Ids are its own counters, from 0; a reply naming an id this side gave up is ignored
- * (Q1). When the link closes, every call rejects `unavailable` (never resent) and its path tells every holder.
- */
-export declare class ConsumerSide {
-    #private;
-    constructor(link: HostLink);
-    /**
-     * Holds `holder` on this link and returns its new id: its first hold, or a re-hold on a new link; `chain`: the
-     * activation chain it is held for, if any (Q5).
-     */
-    attach(holder: RemoteObject, chain: string[] | undefined): number;
-    /**
-     * Calls method `method` (an index into the bound variant) on hold `hold` with `args`: left out for a method without
-     * arguments, with byte segments when its argument schema has a `bytes()` leaf, deflated above the threshold except on
-     * the parent link. The result is parsed here. The caller's cancellation rejects it at once and sends `abort` when it
-     * is in flight.
-     */
-    call(hold: number, method: number, data: MethodData, args: unknown, context: Context): Promise<unknown>;
-    /** Hold `hold` was released: the provider is told, its calls fail with `error`. */
-    release(hold: number, error: ChordError): void;
-    /** `ref.retry()` on a failed hold, with `hops` left of its budget: the provider is asked for an attempt now. */
-    retry(hold: number, hops: number): void;
-    /** Drops hold `hold` from the tables; its calls, in flight and waiting, fail with `error` and free their slots. */
-    forget(hold: number, error: ChordError): void;
-    /** The peer's `hello` arrived: calls go out within its window. */
-    opened(calls: number): void;
-    /**
-     * Handles one message from the provider: this host's own, or (with an origin) one for a relayed hold. A `bound`,
-     * `state` or `result` with deflated parts to inflate asynchronously returns that promise and is handled after it.
-     */
-    message(message: ConsumerMessage): void | Promise<void>;
-    /** The link closed: calls in flight and waiting reject `unavailable` (never resent, §7); the tables are dropped. */
-    closed(): void;
-}
-//# sourceMappingURL=consumer.d.ts.map

package/dist/next/remote/consumer.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"consumer.d.ts","sourceRoot":"","sources":["../../../src/next/remote/consumer.ts"],"names":[],"mappings":"AAMA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,wBAAwB,CAAC;AACtD,OAAO,EAAE,KAAK,UAAU,EAAe,MAAM,0BAA0B,CAAC;AACxE,OAAO,EAAE,UAAU,EAAgB,MAAM,kBAAkB,CAAC;AAE5D,OAAO,EAEN,KAAK,eAAe,EAQpB,MAAM,qBAAqB,CAAC;AAG7B,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAC/C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAqBvD;;;GAGG;AACH,qBAAa,YAAY;;IAQxB,YAAY,IAAI,EAAE,QAAQ,EAEzB;IAED;;;OAGG;IACH,MAAM,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,SAAS,GAAG,MAAM,CAYhE;IAED;;;;;OAKG;IACH,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,CAkCtG;IAED,mFAAmF;IACnF,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAG7C;IAED,gHAAgH;IAChH,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAEtC;IAED,mHAAmH;IACnH,MAAM,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,UAAU,GAAG,IAAI,CAG5C;IAED,kEAAkE;IAClE,MAAM,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAE1B;IAED;;;OAGG;IACH,OAAO,CAAC,OAAO,EAAE,eAAe,GAAG,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CA2BtD;IAED,oHAAoH;IACpH,MAAM,IAAI,IAAI,CAMb;CAuLD"}

package/dist/next/remote/consumer.js

@@ -1,343 +0,0 @@
-// The consumer side of a link (§7, §22, W1): the holds this host's own remote references sent on it, by this side's
-// ids, the calls through them within the peer's call window, and each `bound` and `state` message applied to their
-// replicas as one batch, then acknowledged. Messages with an origin answer holds this host relays: they go to that
-// origin's provider side. On a host without a compressor, the deflated parts of this host's own holds and calls are
-// inflated asynchronously first, and the message is handled once they are.
-import { takesNoArgs } from "../contracts/internal.js";
-import { ChordError, isChordError } from "../data/index.js";
-import { asChordError } from "../data/internal.js";
-import { errorFromWire, parsePayload, payloadPart, } from "../link/internal.js";
-import { CallWindow } from "./calls.js";
-import { actingFor } from "./hold.js";
-/**
- * The consumer side of one link. Ids are its own counters, from 0; a reply naming an id this side gave up is ignored
- * (Q1). When the link closes, every call rejects `unavailable` (never resent) and its path tells every holder.
- */
-export class ConsumerSide {
-    #link;
-    #entries = new Map();
-    #calls = new Map();
-    #window = new CallWindow();
-    #nextHold = 0;
-    #nextCall = 0;
-    constructor(link) {
-        this.#link = link;
-    }
-    /**
-     * Holds `holder` on this link and returns its new id: its first hold, or a re-hold on a new link; `chain`: the
-     * activation chain it is held for, if any (Q5).
-     */
-    attach(holder, chain) {
-        const id = this.#nextHold++;
-        this.#entries.set(id, holder);
-        const acting = actingFor(this.#link, holder.caller);
-        this.#link.send({
-            kind: "hold",
-            hold: id,
-            ...holder.request,
-            ...acting,
-            ...(chain === undefined ? {} : { chain }),
-        });
-        return id;
-    }
-    /**
-     * Calls method `method` (an index into the bound variant) on hold `hold` with `args`: left out for a method without
-     * arguments, with byte segments when its argument schema has a `bytes()` leaf, deflated above the threshold except on
-     * the parent link. The result is parsed here. The caller's cancellation rejects it at once and sends `abort` when it
-     * is in flight.
-     */
-    call(hold, method, data, args, context) {
-        const signal = context.abortSignal;
-        signal?.throwIfAborted();
-        const payload = takesNoArgs(data) ? undefined : payloadPart(args, data.args.bytes);
-        // Up a parent link they travel uncompressed: the parent may have accepted this host as a child, and child links
-        // refuse compressed parts (§22).
-        const link = this.#link;
-        const part = payload === undefined ? undefined : link.role === "parent" ? payload.json : link.part(payload.json, context);
-        const { promise, resolve, reject } = Promise.withResolvers();
-        const cancel = () => {
-            this.#cancel(call);
-            reject(signal.reason);
-        };
-        const done = () => signal?.removeEventListener("abort", cancel);
-        const call = {
-            hold,
-            method,
-            args: part,
-            segments: payload?.segments,
-            resolve: (value) => {
-                done();
-                resolve(value);
-            },
-            reject: (error) => {
-                done();
-                reject(error);
-            },
-            id: undefined,
-            send: () => this.#send(call),
-        };
-        signal?.addEventListener("abort", cancel, { once: true });
-        this.#window.submit(call);
-        return promise;
-    }
-    /** Hold `hold` was released: the provider is told, its calls fail with `error`. */
-    release(hold, error) {
-        this.#link.send({ kind: "release", hold });
-        this.forget(hold, error);
-    }
-    /** `ref.retry()` on a failed hold, with `hops` left of its budget: the provider is asked for an attempt now. */
-    retry(hold, hops) {
-        this.#link.send({ kind: "retry", hold, hops });
-    }
-    /** Drops hold `hold` from the tables; its calls, in flight and waiting, fail with `error` and free their slots. */
-    forget(hold, error) {
-        this.#entries.delete(hold);
-        this.#failCalls(hold, error);
-    }
-    /** The peer's `hello` arrived: calls go out within its window. */
-    opened(calls) {
-        this.#window.opened(calls);
-    }
-    /**
-     * Handles one message from the provider: this host's own, or (with an origin) one for a relayed hold. A `bound`,
-     * `state` or `result` with deflated parts to inflate asynchronously returns that promise and is handled after it.
-     */
-    message(message) {
-        if (message.origin !== undefined) {
-            this.#link.host.relays.get(message.origin)?.forward(message, this.#link);
-            return;
-        }
-        switch (message.kind) {
-            case "bound":
-            case "state": {
-                const deflated = this.#deflated(message.holds);
-                if (deflated !== undefined)
-                    return this.#link.inflate(deflated, () => this.message(message));
-                if (message.kind === "bound")
-                    this.#bound(message.holds);
-                else
-                    this.#state(message.holds);
-                break;
-            }
-            case "failed":
-                this.#failed(message);
-                break;
-            case "loading":
-                this.#loading(message.hold);
-                break;
-            case "result":
-            case "error":
-                return this.#reply(message);
-            case "gone":
-                this.#gone(message);
-                break;
-        }
-    }
-    /** The link closed: calls in flight and waiting reject `unavailable` (never resent, §7); the tables are dropped. */
-    closed() {
-        const error = new ChordError({ code: "unavailable", message: "the link closed" });
-        const calls = [...this.#calls.values(), ...this.#window.clear()];
-        this.#calls.clear();
-        this.#entries.clear();
-        for (const call of calls)
-            call.reject(error);
-    }
-    /** Sends a call that got its slot, with the next id. */
-    #send(call) {
-        const id = this.#nextCall++;
-        call.id = id;
-        this.#calls.set(id, call);
-        const { hold, method, args, segments } = call;
-        this.#link.send({
-            kind: "call",
-            call: id,
-            hold,
-            method,
-            ...(args === undefined ? {} : { args }),
-            ...(segments === undefined ? {} : { segments }),
-        });
-    }
-    /**
-     * Cancels `call`: a waiting one leaves the window and nothing is sent; one in flight sends `abort` and frees its
-     * slot. Settling the caller is the caller's.
-     */
-    #cancel(call) {
-        if (call.id === undefined) {
-            this.#window.remove(call);
-            return;
-        }
-        if (!this.#calls.delete(call.id))
-            return;
-        this.#link.send({ kind: "abort", call: call.id });
-        this.#window.freed();
-    }
-    /**
-     * The deflated parts of this side's own holds in `entries` that wait for an asynchronous inflate, each with the
-     * link's decoded limit; `undefined` when none does (nothing allocated). Entries of holds this side gave up are not
-     * inflated (Q1).
-     */
-    #deflated(entries) {
-        const { limits } = this.#link;
-        let deflated;
-        for (const entry of entries) {
-            if (!this.#entries.has(entry.hold))
-                continue;
-            for (const member of entry.members) {
-                const part = "value" in member ? member.value : member.ops;
-                if (!this.#link.inflates(part, limits))
-                    continue;
-                deflated ??= [];
-                deflated.push([part, limits.decoded]);
-            }
-        }
-        return deflated;
-    }
-    /**
-     * One `bound` message: every entry prepared first (one that does not fit closes the link before anything changed)
-     * and applied in one batch; then the references go live, and the message is acknowledged. An entry with a part past
-     * the link's limits fails only its hold (`too_large/part`); the others apply.
-     */
-    #bound(holds) {
-        const adoptions = [];
-        const bound = [];
-        let oversized;
-        for (const entry of holds) {
-            const holder = this.#entries.get(entry.hold);
-            if (holder === undefined)
-                continue;
-            try {
-                adoptions.push(holder.prepareBound(entry, this.#link));
-            }
-            catch (error) {
-                if (!isChordError(error, "too_large"))
-                    throw error;
-                oversized ??= [];
-                oversized.push([holder, error]);
-                continue;
-            }
-            bound.push(holder);
-        }
-        this.#adopt(adoptions);
-        // After the batch: the references go live with every replica of the message in place.
-        for (const holder of bound)
-            holder.wentLive();
-        for (const [holder, error] of oversized ?? [])
-            holder.tooLarge(error);
-        this.#link.send({ kind: "ack" });
-    }
-    /** One `state` message, as `#bound` does it. */
-    #state(holds) {
-        const adoptions = [];
-        let oversized;
-        for (const entry of holds) {
-            const holder = this.#entries.get(entry.hold);
-            if (holder === undefined)
-                continue;
-            try {
-                adoptions.push(holder.prepare(entry, this.#link));
-            }
-            catch (error) {
-                if (!isChordError(error, "too_large"))
-                    throw error;
-                oversized ??= [];
-                oversized.push([holder, error]);
-            }
-        }
-        this.#adopt(adoptions);
-        for (const [holder, error] of oversized ?? [])
-            holder.tooLarge(error);
-        this.#link.send({ kind: "ack" });
-    }
-    /** Applies prepared entries in one batch of this host, so no watch or derive sees half a provider commit (W1). */
-    #adopt(adoptions) {
-        if (adoptions.length === 0)
-            return;
-        this.#link.host.batch.commit(() => {
-            for (const adopt of adoptions)
-                adopt();
-        }, this.#link.context);
-    }
-    /**
-     * `loading`: the hold's object, or its relay's upstream, starts over; its calls still waiting for a slot reject
-     * `unavailable` (they may name a method of the old variant).
-     */
-    #loading(hold) {
-        const holder = this.#entries.get(hold);
-        if (holder === undefined)
-            return;
-        const error = new ChordError({ code: "unavailable", message: `hold ${hold}: rebinding` });
-        for (const call of this.#window.removeHold(hold))
-            call.reject(error);
-        holder.loading();
-    }
-    /**
-     * `failed`: its holder fails; its calls still waiting for a slot reject with the cause (a bound hold is unbound by it,
-     * slice 7b; its calls in flight are rejected by the provider).
-     */
-    #failed(message) {
-        const holder = this.#entries.get(message.hold);
-        if (holder === undefined)
-            return;
-        const error = asChordError(errorFromWire(message.cause.error), `hold ${message.hold}`);
-        for (const call of this.#window.removeHold(message.hold))
-            call.reject(error);
-        holder.failed(message);
-    }
-    /**
-     * `gone`: one for a hold this side gave up is ignored (Q1); the holder ends, which forgets its hold here and fails
-     * its calls.
-     */
-    #gone(message) {
-        const holder = this.#entries.get(message.hold);
-        if (holder === undefined)
-            return;
-        holder.lost(asChordError(errorFromWire(message.error), `hold ${message.hold}`));
-    }
-    /**
-     * A reply: its call settles with the parsed result or the error. A result past the link's limits rejects the call
-     * `too_large/part`. A malformed part rejects the call `unavailable` and throws (a protocol error: the link closes).
-     * A result to inflate asynchronously is inflated first (for a call still waiting), then handled again.
-     */
-    #reply(reply) {
-        const call = this.#calls.get(reply.call);
-        if (call === undefined)
-            return;
-        const link = this.#link;
-        if (reply.kind === "result" && link.inflates(reply.value, link.limits)) {
-            return link.inflate([[reply.value, link.limits.decoded]], () => this.#reply(reply));
-        }
-        this.#calls.delete(reply.call);
-        this.#window.freed();
-        try {
-            if (reply.kind === "error")
-                call.reject(errorFromWire(reply.error));
-            else if (reply.value === undefined)
-                call.resolve(null);
-            else
-                call.resolve(parsePayload(link.openPart(reply.value, link.limits, link.context), reply.segments));
-        }
-        catch (error) {
-            if (isChordError(error, "too_large")) {
-                call.reject(error);
-                return;
-            }
-            call.reject(new ChordError({ code: "unavailable", message: `call ${reply.call}: a malformed reply` }));
-            throw error;
-        }
-    }
-    /** Fails `hold`'s calls in flight and waiting with `error`; each in-flight one frees its slot. */
-    #failCalls(hold, error) {
-        // Waiting ones first: a freed slot must not send one of them.
-        const failed = this.#window.removeHold(hold);
-        for (const [id, call] of this.#calls) {
-            if (call.hold !== hold)
-                continue;
-            this.#calls.delete(id);
-            this.#window.freed();
-            failed.push(call);
-        }
-        for (const call of failed)
-            call.reject(error);
-    }
-}
-//# sourceMappingURL=consumer.js.map