@loomwork/event-runtime 0.0.0-stage → 0.1.1

package/dist/InMemoryAsyncEventStore.js

@@ -0,0 +1,374 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.InMemoryAsyncEventStore = void 0;
+const SubscriberRegistry_1 = require("./SubscriberRegistry");
+const eventKindClass_1 = require("./eventKindClass");
+const executionIdOrder_1 = require("./executionIdOrder");
+const fencing_1 = require("./fencing");
+const sequenceRange_1 = require("./sequenceRange");
+const writeConflicts_1 = require("./writeConflicts");
+/**
+ * Reference **async** EventStore: a genuine Promise-returning backend (unlike the
+ * synchronous SQLite/in-memory stores, which merely satisfy the async interface).
+ * Use it as a starting point for a real network backend, or in tests to exercise
+ * the runtime's async write pipeline, ordering, and failure handling.
+ */
+class InMemoryAsyncEventStore {
+    log = new Map();
+    /**
+     * The executionIds in SPI order (code point), built lazily by `listExecutionsPage` and
+     * dropped only when the SET of executions changes (a new one, or a delete). A full paged
+     * walk is then one O(n log n) sort plus O(log n) per page, not a re-sort per page.
+     */
+    sortedIds;
+    /**
+     * #309 — every envelope id in the store, the index behind the `id` PRIMARY KEY both SQL
+     * backends have. GLOBAL, not per-execution, because that is what the SQL constraint is:
+     * two executions may not share an envelope id either.
+     *
+     * It has to be maintained everywhere the log changes, not just on append — a stale entry
+     * after a delete would refuse a legitimate re-append forever, and an un-removed one is a
+     * leak in a store whose whole job is to be re-created cheaply in tests. The removal side
+     * is only correct BECAUSE the invariant holds: an id belongs to exactly one envelope, so
+     * dropping the ids of the events being dropped cannot orphan someone else's claim.
+     *
+     * Costs one hash-table slot per event; the id strings themselves are already retained by
+     * the envelopes in `log`, so this is not a second copy of the data.
+     */
+    ids = new Set();
+    subscribers = new SubscriberRegistry_1.SubscriberRegistry();
+    fences = new Map();
+    /**
+     * ADR 0129 — the store-assigned incarnation of each execution, taken from a store-wide
+     * monotonic counter when its sequence 0 first lands and dropped with the log. Store metadata
+     * only: never in an envelope, a fold, a snapshot or a hash, so replay stays byte-identical.
+     */
+    incarnations = new Map();
+    nextIncarnation = 1;
+    latencyMs;
+    failAppendWhen;
+    constructor(options = {}) {
+        this.latencyMs = options.latencyMs ?? 0;
+        this.failAppendWhen = options.failAppendWhen;
+    }
+    async tick() {
+        if (this.latencyMs > 0)
+            await new Promise((r) => setTimeout(r, this.latencyMs));
+        else
+            await Promise.resolve();
+    }
+    async append(envelope) {
+        await this.tick();
+        this.assertAppendable(envelope);
+        this.commit(envelope);
+        this.subscribers.emit(envelope);
+    }
+    /**
+     * ADR 0074 D1 — the reference implementation of the `appendBatch` contract, and what a
+     * bring-your-own backend can read to see what it has to honour.
+     *
+     * One `tick()` for the whole batch, because the point of the method is one round-trip.
+     * Atomicity is why validation is a separate pass: EVERY envelope is checked before ANY
+     * is committed, so a fenced-out or rejected envelope leaves the log exactly as it was
+     * rather than half-applied. Fencing is checked per envelope, since a batch may span
+     * executions.
+     */
+    async appendBatch(envelopes) {
+        if (envelopes.length === 0)
+            return;
+        await this.tick();
+        // A batch must be checked against ITSELF as well as the log: two envelopes claiming
+        // the same slot — or the same id — are both appendable against the durable state, and
+        // only the pairwise check catches them. Tracked lazily, so the common single-execution
+        // monotonic batch allocates nothing.
+        let claimedSlots;
+        let claimedIds;
+        for (const envelope of envelopes) {
+            this.assertAppendable(envelope);
+            const seen = claimedSlots?.get(envelope.executionId);
+            if (seen?.has(envelope.sequence) === true) {
+                throw new writeConflicts_1.DuplicateSequenceError(envelope.executionId, envelope.sequence);
+            }
+            if (claimedIds?.has(envelope.id) === true) {
+                throw new writeConflicts_1.DuplicateEnvelopeIdError(envelope.id, envelope.executionId);
+            }
+            claimedSlots ??= new Map();
+            const set = seen ?? new Set();
+            set.add(envelope.sequence);
+            claimedSlots.set(envelope.executionId, set);
+            claimedIds ??= new Set();
+            claimedIds.add(envelope.id);
+        }
+        for (const envelope of envelopes)
+            this.commit(envelope);
+        // Fan out only once the whole batch has landed — a subscriber must never observe a
+        // partially applied batch.
+        for (const envelope of envelopes)
+            this.subscribers.emit(envelope);
+    }
+    /**
+     * Throws if this envelope may not land: a duplicate `(executionId, sequence)`, a
+     * duplicate envelope `id`, K9.4 fencing, or an injected failure.
+     */
+    assertAppendable(envelope, checkFence = true) {
+        // K9.4 — fencing: once a token has been acquired for this execution, an
+        // append missing the current token is a zombie write and is rejected.
+        const currentFence = checkFence ? this.fences.get(envelope.executionId) : undefined;
+        if (currentFence !== undefined) {
+            const fence = (0, fencing_1.fenceOf)(envelope);
+            if (fence === undefined || fence < currentFence) {
+                throw new fencing_1.StaleFenceError(envelope.executionId, fence, currentFence);
+            }
+        }
+        // #306 — the same `UNIQUE (execution_id, sequence)` both SQL backends enforce. Not a
+        // redundant belt beside fencing: fencing engages only once a token has been ACQUIRED,
+        // and sequences are allocated per-process from folded state, so two unfenced writers
+        // recovering the same execution allocate the same next sequence with neither a zombie.
+        // O(log n) against the sorted log — `commit` maintains that order for exactly this.
+        const list = this.log.get(envelope.executionId);
+        if (list !== undefined) {
+            const at = (0, sequenceRange_1.lowerBoundBySequence)(list, envelope.sequence);
+            if (at < list.length && list[at].sequence === envelope.sequence) {
+                throw new writeConflicts_1.DuplicateSequenceError(envelope.executionId, envelope.sequence);
+            }
+        }
+        // #309 — the events table's OTHER key. Checked after the slot, so a writer that lost a
+        // sequence race is told that (the actionable failure) rather than being told about the
+        // id its own naming convention derived from the sequence it lost.
+        if (this.ids.has(envelope.id)) {
+            throw new writeConflicts_1.DuplicateEnvelopeIdError(envelope.id, envelope.executionId);
+        }
+        const verdict = this.failAppendWhen?.(envelope);
+        if (verdict) {
+            throw verdict instanceof Error
+                ? verdict
+                : new Error(typeof verdict === "string" ? verdict : `append rejected: ${envelope.id}`);
+        }
+    }
+    /** Insert into the execution's log, keeping it sorted by sequence. */
+    commit(envelope) {
+        this.ids.add(envelope.id);
+        const list = this.log.get(envelope.executionId) ?? [];
+        // Keep each execution's log sorted by sequence so reads can binary-search.
+        // Appends are normally monotonic (a plain end-push); only an out-of-order
+        // arrival triggers an insertion.
+        if (list.length === 0 ||
+            list[list.length - 1].sequence <= envelope.sequence) {
+            list.push(envelope);
+        }
+        else {
+            list.splice((0, sequenceRange_1.lowerBoundBySequence)(list, envelope.sequence), 0, envelope);
+        }
+        this.setLog(envelope.executionId, list);
+    }
+    async read(executionId) {
+        await this.tick();
+        // Already sorted by the append invariant — return a defensive copy, no re-sort.
+        return [...(this.log.get(executionId) ?? [])];
+    }
+    async readFrom(executionId, fromSequence) {
+        await this.tick();
+        const list = this.log.get(executionId) ?? [];
+        return list.slice((0, sequenceRange_1.lowerBoundBySequence)(list, fromSequence));
+    }
+    async head(executionId) {
+        await this.tick();
+        const list = this.log.get(executionId) ?? [];
+        return list.length === 0 ? null : (list[list.length - 1]?.sequence ?? null);
+    }
+    async readRange(executionId, fromSequence, toSequence) {
+        await this.tick();
+        return (0, sequenceRange_1.sliceBySequence)(this.log.get(executionId) ?? [], fromSequence, toSequence);
+    }
+    async copyPrefix(fromExecutionId, toExecutionId, throughSequence, metadata) {
+        await this.tick();
+        const src = this.log.get(fromExecutionId) ?? [];
+        const dst = this.log.get(toExecutionId) ?? [];
+        // Built fully before anything is published, so a rejected copy leaves the target
+        // untouched — the same all-or-nothing shape the SQL backends get from their INSERT
+        // … SELECT, which would abort on the primary key rather than half-populate a fork.
+        const copied = [];
+        for (const e of src) {
+            if (e.sequence > throughSequence)
+                continue;
+            // Re-stamp only; no payload (de)serialization.
+            const stamped = {
+                ...e,
+                executionId: toExecutionId,
+                id: `${toExecutionId}-${e.sequence}`,
+                metadata: { ...e.metadata, ...metadata },
+            };
+            // #309 — the re-stamped ids must be as unique as any other. A fork into a target
+            // that already holds events is a broken fork, and this is where it surfaces; the
+            // check also keeps the id index single-owner, which is what makes removal on
+            // delete/truncate safe.
+            if (this.ids.has(stamped.id)) {
+                throw new writeConflicts_1.DuplicateEnvelopeIdError(stamped.id, toExecutionId);
+            }
+            copied.push(stamped);
+        }
+        for (const e of copied) {
+            this.ids.add(e.id);
+            dst.push(e);
+        }
+        this.setLog(toExecutionId, dst);
+    }
+    async acquireFence(executionId) {
+        await this.tick();
+        const next = (this.fences.get(executionId) ?? 0) + 1;
+        this.fences.set(executionId, next);
+        return next;
+    }
+    /**
+     * ADR 0118 D1 — one synchronous step after the tick, so it cannot interleave with an append's
+     * own check-and-commit (which is also synchronous after ITS tick): the token compare-and-set
+     * plus a scan of the tail past `parkSeq`, which is short (the events appended since the park).
+     */
+    async acquireFenceIf(executionId, expect) {
+        await this.tick();
+        const current = this.fences.get(executionId) ?? 0;
+        if (current !== expect.fence)
+            return { stale: true, fence: current };
+        const list = this.log.get(executionId) ?? [];
+        for (let i = (0, sequenceRange_1.lowerBoundBySequence)(list, expect.parkSeq + 1); i < list.length; i++) {
+            if ((0, eventKindClass_1.isAnsweringKind)(list[i]))
+                return { stale: true, fence: current };
+        }
+        this.fences.set(executionId, current + 1);
+        return { fence: current + 1 };
+    }
+    /**
+     * SPI 2.2.0 (ADR 0116 amendment) — one synchronous step after the tick, so the existence,
+     * head and token checks and the commit cannot interleave with any other append, acquire or
+     * delete. The token is compared, never presented: the fence rule is deliberately skipped.
+     */
+    async appendIfUnchanged(executionId, event, expect) {
+        await this.tick();
+        if (event !== null && (expect === undefined || event.executionId !== executionId)) {
+            throw new TypeError("appendIfUnchanged: an event needs `expect` and the matching executionId");
+        }
+        const list = this.log.get(executionId);
+        const fence = this.fences.get(executionId) ?? 0;
+        if (list === undefined || list.length === 0 || list[0].sequence !== 0) {
+            return { appended: false, reason: "gone", head: null, fence, anchor: null };
+        }
+        const head = list[list.length - 1].sequence;
+        const anchor = String(this.incarnations.get(executionId));
+        if (event === null)
+            return { appended: false, reason: "observed", head, fence, anchor };
+        const want = expect;
+        if (head !== want.head ||
+            fence !== want.fence ||
+            anchor !== want.anchor ||
+            event.sequence !== head + 1) {
+            return { appended: false, reason: "moved", head, fence, anchor };
+        }
+        this.assertAppendable(event, false);
+        this.commit(event);
+        this.subscribers.emit(event);
+        return { appended: true };
+    }
+    async deleteExecution(executionId) {
+        await this.tick();
+        // Release the ids too, or a re-created execution could never re-append the events it
+        // just erased — and the index would grow forever across a retention sweep.
+        for (const e of this.log.get(executionId) ?? [])
+            this.ids.delete(e.id);
+        if (this.log.delete(executionId))
+            this.sortedIds = undefined;
+        this.fences.delete(executionId);
+        this.incarnations.delete(executionId);
+    }
+    async deleteThrough(executionId, through) {
+        await this.tick();
+        const list = this.log.get(executionId);
+        if (list === undefined)
+            return;
+        // One synchronous pass (no reader sees half of it): sequence 0 goes too, unlike truncatePrefix.
+        const kept = [];
+        for (const e of list) {
+            if (e.sequence > through)
+                kept.push(e);
+            else
+                this.ids.delete(e.id);
+        }
+        if (kept.length === 0) {
+            await this.deleteExecution(executionId);
+            return;
+        }
+        this.log.set(executionId, kept);
+    }
+    setLog(executionId, list) {
+        if (!this.log.has(executionId))
+            this.sortedIds = undefined;
+        if (list[0]?.sequence === 0 && !this.incarnations.has(executionId)) {
+            this.incarnations.set(executionId, this.nextIncarnation++);
+        }
+        this.log.set(executionId, list);
+    }
+    async listExecutions() {
+        await this.tick();
+        return [...this.log.keys()];
+    }
+    async listExecutionsPage(opts) {
+        await this.tick();
+        const limit = opts?.limit ?? 1000;
+        const cursor = opts?.cursor;
+        // SPI 2.0.0 — code point order, and the cursor may be any string: binary-search the
+        // first id strictly after it.
+        this.sortedIds ??= [...this.log.keys()].sort(executionIdOrder_1.compareExecutionIds);
+        const sorted = this.sortedIds;
+        let start = 0;
+        if (cursor !== undefined) {
+            let hi = sorted.length;
+            while (start < hi) {
+                const mid = (start + hi) >>> 1;
+                if ((0, executionIdOrder_1.compareExecutionIds)(sorted[mid], cursor) > 0)
+                    hi = mid;
+                else
+                    start = mid + 1;
+            }
+        }
+        const executionIds = sorted.slice(start, start + limit);
+        const last = executionIds[executionIds.length - 1];
+        return {
+            executionIds,
+            ...(last !== undefined && start + limit < sorted.length && { nextCursor: last }),
+        };
+    }
+    async truncatePrefix(executionId, throughSequence) {
+        await this.truncatePrefixKeeping(executionId, throughSequence, []);
+    }
+    async truncatePrefixKeeping(executionId, throughSequence, keepEventTypes) {
+        await this.tick();
+        const list = this.log.get(executionId);
+        if (list === undefined)
+            return;
+        const keepTypes = new Set(keepEventTypes);
+        // Preserve sequence 0 (bootstrap anchor) and every kept-type event; drop the rest of
+        // (0..throughSequence]. One synchronous pass, so no reader sees a half-truncated prefix.
+        const kept = [];
+        for (const e of list) {
+            if (e.sequence === 0 || e.sequence > throughSequence || keepTypes.has(e.eventType)) {
+                kept.push(e);
+            }
+            else {
+                this.ids.delete(e.id); // compacted away — its id is free again
+            }
+        }
+        this.setLog(executionId, kept);
+    }
+    async subscribe(executionId, handler) {
+        await this.tick();
+        return this.subscribers.add(executionId, handler);
+    }
+    async close() {
+        this.ids.clear();
+        this.log.clear();
+        this.incarnations.clear();
+        this.sortedIds = undefined;
+        this.subscribers.clear();
+    }
+}
+exports.InMemoryAsyncEventStore = InMemoryAsyncEventStore;
+//# sourceMappingURL=InMemoryAsyncEventStore.js.map

package/dist/InMemoryAsyncEventStore.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"InMemoryAsyncEventStore.js","sourceRoot":"","sources":["../src/InMemoryAsyncEventStore.ts"],"names":[],"mappings":";;;AACA,6DAA0D;AAC1D,qDAAmD;AACnD,yDAAyD;AACzD,uCAAqD;AACrD,mDAAwE;AAOxE,qDAAoF;AAapF;;;;;GAKG;AACH,MAAa,uBAAuB;IACjB,GAAG,GAAG,IAAI,GAAG,EAA2B,CAAC;IAC1D;;;;OAIG;IACK,SAAS,CAAuB;IACxC;;;;;;;;;;;;;OAaG;IACc,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IACxB,WAAW,GAAG,IAAI,uCAAkB,EAAE,CAAC;IACvC,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACpD;;;;OAIG;IACc,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClD,eAAe,GAAG,CAAC,CAAC;IACX,SAAS,CAAS;IAClB,cAAc,CAEjB;IAEd,YAAY,UAA0C,EAAE;QACtD,IAAI,CAAC,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,CAAC;QACxC,IAAI,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc,CAAC;IAC/C,CAAC;IAEO,KAAK,CAAC,IAAI;QAChB,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC;YAAE,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,EAAE,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;;YAC3E,MAAM,OAAO,CAAC,OAAO,EAAE,CAAC;IAC/B,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,QAAuB;QAClC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;QAChC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACtB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IAClC,CAAC;IAED;;;;;;;;;OASG;IACH,KAAK,CAAC,WAAW,CAAC,SAAmC;QACnD,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QACnC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,oFAAoF;QACpF,sFAAsF;QACtF,uFAAuF;QACvF,qCAAqC;QACrC,IAAI,YAAkD,CAAC;QACvD,IAAI,UAAmC,CAAC;QACxC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;YAChC,MAAM,IAAI,GAAG,YAAY,EAAE,GAAG,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;YACrD,IAAI,IAAI,EAAE,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,IAAI,EAAE,CAAC;gBAC1C,MAAM,IAAI,uCAAsB,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC5E,CAAC;YACD,IAAI,UAAU,EAAE,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC;gBAC1C,MAAM,IAAI,yCAAwB,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC;YACxE,CAAC;YACD,YAAY,KAAK,IAAI,GAAG,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,IAAI,IAAI,IAAI,GAAG,EAAU,CAAC;YACtC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC3B,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,EAAE,GAAG,CAAC,CAAC;YAC5C,UAAU,KAAK,IAAI,GAAG,EAAE,CAAC;YACzB,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC9B,CAAC;QACD,KAAK,MAAM,QAAQ,IAAI,SAAS;YAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACxD,mFAAmF;QACnF,2BAA2B;QAC3B,KAAK,MAAM,QAAQ,IAAI,SAAS;YAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACpE,CAAC;IAED;;;OAGG;IACK,gBAAgB,CAAC,QAAuB,EAAE,UAAU,GAAG,IAAI;QACjE,wEAAwE;QACxE,sEAAsE;QACtE,MAAM,YAAY,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QACpF,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;YAC/B,MAAM,KAAK,GAAG,IAAA,iBAAO,EAAC,QAAQ,CAAC,CAAC;YAChC,IAAI,KAAK,KAAK,SAAS,IAAI,KAAK,GAAG,YAAY,EAAE,CAAC;gBAChD,MAAM,IAAI,yBAAe,CAAC,QAAQ,CAAC,WAAW,EAAE,KAAK,EAAE,YAAY,CAAC,CAAC;YACvE,CAAC;QACH,CAAC;QACD,qFAAqF;QACrF,sFAAsF;QACtF,qFAAqF;QACrF,uFAAuF;QACvF,oFAAoF;QACpF,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;QAChD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,EAAE,GAAG,IAAA,oCAAoB,EAAC,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;YACzD,IAAI,EAAE,GAAG,IAAI,CAAC,MAAM,IAAK,IAAI,CAAC,EAAE,CAAmB,CAAC,QAAQ,KAAK,QAAQ,CAAC,QAAQ,EAAE,CAAC;gBACnF,MAAM,IAAI,uCAAsB,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,QAAQ,CAAC,CAAC;YAC5E,CAAC;QACH,CAAC;QACD,uFAAuF;QACvF,uFAAuF;QACvF,kEAAkE;QAClE,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;YAC9B,MAAM,IAAI,yCAAwB,CAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,WAAW,CAAC,CAAC;QACxE,CAAC;QACD,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,OAAO,YAAY,KAAK;gBAC5B,CAAC,CAAC,OAAO;gBACT,CAAC,CAAC,IAAI,KAAK,CAAC,OAAO,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,oBAAoB,QAAQ,CAAC,EAAE,EAAE,CAAC,CAAC;QAC3F,CAAC;IACH,CAAC;IAED,sEAAsE;IAC9D,MAAM,CAAC,QAAuB;QACpC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QACtD,2EAA2E;QAC3E,0EAA0E;QAC1E,iCAAiC;QACjC,IACE,IAAI,CAAC,MAAM,KAAK,CAAC;YAChB,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAmB,CAAC,QAAQ,IAAI,QAAQ,CAAC,QAAQ,EACtE,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACtB,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,MAAM,CAAC,IAAA,oCAAoB,EAAC,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;QAC1E,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,WAAmB;QAC5B,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,gFAAgF;QAChF,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAChD,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,WAAmB,EAAE,YAAoB;QACtD,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAC7C,OAAO,IAAI,CAAC,KAAK,CAAC,IAAA,oCAAoB,EAAC,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC;IAC9D,CAAC;IAED,KAAK,CAAC,IAAI,CAAC,WAAmB;QAC5B,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAC7C,OAAO,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,EAAE,QAAQ,IAAI,IAAI,CAAC,CAAC;IAC9E,CAAC;IAED,KAAK,CAAC,SAAS,CACb,WAAmB,EACnB,YAAoB,EACpB,UAAkB;QAElB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAA,+BAAe,EAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,EAAE,YAAY,EAAE,UAAU,CAAC,CAAC;IACpF,CAAC;IAED,KAAK,CAAC,UAAU,CACd,eAAuB,EACvB,aAAqB,EACrB,eAAuB,EACvB,QAAiC;QAEjC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;QAChD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC;QAC9C,iFAAiF;QACjF,mFAAmF;QACnF,mFAAmF;QACnF,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,GAAG,EAAE,CAAC;YACpB,IAAI,CAAC,CAAC,QAAQ,GAAG,eAAe;gBAAE,SAAS;YAC3C,+CAA+C;YAC/C,MAAM,OAAO,GAAG;gBACd,GAAG,CAAC;gBACJ,WAAW,EAAE,aAAa;gBAC1B,EAAE,EAAE,GAAG,aAAa,IAAI,CAAC,CAAC,QAAQ,EAAE;gBACpC,QAAQ,EAAE,EAAE,GAAG,CAAC,CAAC,QAAQ,EAAE,GAAG,QAAQ,EAAE;aACzC,CAAC;YACF,iFAAiF;YACjF,iFAAiF;YACjF,6EAA6E;YAC7E,wBAAwB;YACxB,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC7B,MAAM,IAAI,yCAAwB,CAAC,OAAO,CAAC,EAAE,EAAE,aAAa,CAAC,CAAC;YAChE,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACvB,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACnB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,aAAa,EAAE,GAAG,CAAC,CAAC;IAClC,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,WAAmB;QACpC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACrD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,cAAc,CAClB,WAAmB,EACnB,MAA0C;QAE1C,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,OAAO,KAAK,MAAM,CAAC,KAAK;YAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;QACrE,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAC7C,KAAK,IAAI,CAAC,GAAG,IAAA,oCAAoB,EAAC,IAAI,EAAE,MAAM,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClF,IAAI,IAAA,gCAAe,EAAC,IAAI,CAAC,CAAC,CAAkB,CAAC;gBAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC;QACxF,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,EAAE,OAAO,GAAG,CAAC,CAAC,CAAC;QAC1C,OAAO,EAAE,KAAK,EAAE,OAAO,GAAG,CAAC,EAAE,CAAC;IAChC,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,iBAAiB,CACrB,WAAmB,EACnB,KAA2B,EAC3B,MAAuB;QAEvB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,IAAI,KAAK,KAAK,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,KAAK,CAAC,WAAW,KAAK,WAAW,CAAC,EAAE,CAAC;YAClF,MAAM,IAAI,SAAS,CACjB,yEAAyE,CAC1E,CAAC;QACJ,CAAC;QACD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,IAAK,IAAI,CAAC,CAAC,CAAmB,CAAC,QAAQ,KAAK,CAAC,EAAE,CAAC;YACzF,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;QAC9E,CAAC;QACD,MAAM,IAAI,GAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAmB,CAAC,QAAQ,CAAC;QAC/D,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC;QAC1D,IAAI,KAAK,KAAK,IAAI;YAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QACxF,MAAM,IAAI,GAAG,MAAwB,CAAC;QACtC,IACE,IAAI,KAAK,IAAI,CAAC,IAAI;YAClB,KAAK,KAAK,IAAI,CAAC,KAAK;YACpB,MAAM,KAAK,IAAI,CAAC,MAAM;YACtB,KAAK,CAAC,QAAQ,KAAK,IAAI,GAAG,CAAC,EAC3B,CAAC;YACD,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;QACnE,CAAC;QACD,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACpC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACnB,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC7B,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;IAC5B,CAAC;IAED,KAAK,CAAC,eAAe,CAAC,WAAmB;QACvC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,qFAAqF;QACrF,2EAA2E;QAC3E,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,EAAE;YAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACvE,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC;YAAE,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC7D,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;QAChC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IACxC,CAAC;IAED,KAAK,CAAC,aAAa,CAAC,WAAmB,EAAE,OAAe;QACtD,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACvC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO;QAC/B,gGAAgG;QAChG,MAAM,IAAI,GAAoB,EAAE,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,QAAQ,GAAG,OAAO;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;gBAClC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC;QACD,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC;YACxC,OAAO;QACT,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAClC,CAAC;IAEO,MAAM,CAAC,WAAmB,EAAE,IAAqB;QACvD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC;YAAE,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3D,IAAI,IAAI,CAAC,CAAC,CAAC,EAAE,QAAQ,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;YACnE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,eAAe,EAAE,CAAC,CAAC;QAC7D,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAClC,CAAC;IAED,KAAK,CAAC,cAAc;QAClB,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAC9B,CAAC;IAED,KAAK,CAAC,kBAAkB,CAAC,IAGxB;QACC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,IAAI,CAAC;QAClC,MAAM,MAAM,GAAG,IAAI,EAAE,MAAM,CAAC;QAC5B,oFAAoF;QACpF,8BAA8B;QAC9B,IAAI,CAAC,SAAS,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,sCAAmB,CAAC,CAAC;QAClE,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC;QAC9B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,IAAI,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC;YACvB,OAAO,KAAK,GAAG,EAAE,EAAE,CAAC;gBAClB,MAAM,GAAG,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;gBAC/B,IAAI,IAAA,sCAAmB,EAAC,MAAM,CAAC,GAAG,CAAW,EAAE,MAAM,CAAC,GAAG,CAAC;oBAAE,EAAE,GAAG,GAAG,CAAC;;oBAChE,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,MAAM,YAAY,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,GAAG,KAAK,CAAC,CAAC;QACxD,MAAM,IAAI,GAAG,YAAY,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QACnD,OAAO;YACL,YAAY;YACZ,GAAG,CAAC,IAAI,KAAK,SAAS,IAAI,KAAK,GAAG,KAAK,GAAG,MAAM,CAAC,MAAM,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC;SACjF,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,cAAc,CAAC,WAAmB,EAAE,eAAuB;QAC/D,MAAM,IAAI,CAAC,qBAAqB,CAAC,WAAW,EAAE,eAAe,EAAE,EAAE,CAAC,CAAC;IACrE,CAAC;IAED,KAAK,CAAC,qBAAqB,CACzB,WAAmB,EACnB,eAAuB,EACvB,cAAiC;QAEjC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACvC,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO;QAC/B,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,CAAC;QAC1C,qFAAqF;QACrF,yFAAyF;QACzF,MAAM,IAAI,GAAoB,EAAE,CAAC;QACjC,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,GAAG,eAAe,IAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC;gBACnF,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACf,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,wCAAwC;YACjE,CAAC;QACH,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IACjC,CAAC;IAED,KAAK,CAAC,SAAS,CACb,WAAmB,EACnB,OAAuC;QAEvC,MAAM,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IACpD,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;QACjB,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;QACjB,IAAI,CAAC,YAAY,CAAC,KAAK,EAAE,CAAC;QAC1B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;CACF;AAzYD,0DAyYC"}

package/dist/InMemoryBranchRegistry.d.ts

@@ -0,0 +1,31 @@
+import { type BranchRef, type BranchRegistry, type LineageRecord, type ListRefsOptions, type PromoteOptions } from "./BranchRegistry";
+export interface InMemoryBranchRegistryOptions {
+    /** Injectable clock for createdAt/updatedAt (defaults to Date.now). */
+    now?: () => number;
+}
+/**
+ * Ephemeral, Map-based {@link BranchRegistry} — the browser-safe / test reference impl
+ * alongside the Sqlite and Postgres ones. Pure JS, no native deps. Behaviour matches
+ * the durable backends (verified by `runBranchRegistryConformance` in `@loomwork/testing`).
+ */
+export declare class InMemoryBranchRegistry implements BranchRegistry {
+    private readonly refs;
+    private readonly lineage;
+    private readonly now;
+    private sortedNames;
+    constructor(options?: InMemoryBranchRegistryOptions);
+    /** Binary-insert `name` into `sortedNames`, no-op if it is already there (live or a tombstone). */
+    private insertSorted;
+    putRef(ref: BranchRef): Promise<void>;
+    getRef(name: string): Promise<BranchRef | null>;
+    listRefs(options?: ListRefsOptions): Promise<BranchRef[]>;
+    moveTip(name: string, tip: number): Promise<void>;
+    promote(fromName: string, toName: string, options?: PromoteOptions): Promise<void>;
+    deleteRef(name: string): Promise<void>;
+    recordLineage(rec: Omit<LineageRecord, "createdAt">): Promise<void>;
+    getLineage(executionId: string): Promise<LineageRecord | null>;
+    removeLineage(executionId: string): Promise<void>;
+    children(executionId: string): Promise<LineageRecord[]>;
+    close(): Promise<void>;
+}
+//# sourceMappingURL=InMemoryBranchRegistry.d.ts.map

package/dist/InMemoryBranchRegistry.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"InMemoryBranchRegistry.d.ts","sourceRoot":"","sources":["../src/InMemoryBranchRegistry.ts"],"names":[],"mappings":"AAAA,OAAO,EAEL,KAAK,SAAS,EACd,KAAK,cAAc,EACnB,KAAK,aAAa,EAClB,KAAK,eAAe,EACpB,KAAK,cAAc,EAEpB,MAAM,kBAAkB,CAAC;AAG1B,MAAM,WAAW,6BAA6B;IAC5C,uEAAuE;IACvE,GAAG,CAAC,EAAE,MAAM,MAAM,CAAC;CACpB;AAED;;;;GAIG;AACH,qBAAa,sBAAuB,YAAW,cAAc;IAC3D,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAgC;IACrD,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAoC;IAC5D,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAe;IAuBnC,OAAO,CAAC,WAAW,CAAuB;gBAE9B,OAAO,GAAE,6BAAkC;IAIvD,mGAAmG;IACnG,OAAO,CAAC,YAAY;IAad,MAAM,CAAC,GAAG,EAAE,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC;IAKrC,MAAM,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC;IAK/C,QAAQ,CAAC,OAAO,CAAC,EAAE,eAAe,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAoCzD,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAOjD,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC;IA+BlF,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAMtC,aAAa,CAAC,GAAG,EAAE,IAAI,CAAC,aAAa,EAAE,WAAW,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC;IAInE,UAAU,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC;IAK9D,aAAa,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAIjD,QAAQ,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,EAAE,CAAC;IAMvD,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;CAC7B"}

package/dist/InMemoryBranchRegistry.js

@@ -0,0 +1,167 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.InMemoryBranchRegistry = void 0;
+const BranchRegistry_1 = require("./BranchRegistry");
+const executionIdOrder_1 = require("./executionIdOrder");
+/**
+ * Ephemeral, Map-based {@link BranchRegistry} — the browser-safe / test reference impl
+ * alongside the Sqlite and Postgres ones. Pure JS, no native deps. Behaviour matches
+ * the durable backends (verified by `runBranchRegistryConformance` in `@loomwork/testing`).
+ */
+class InMemoryBranchRegistry {
+    refs = new Map();
+    lineage = new Map();
+    now;
+    // SPI 2.0.0 (L21, ADR 0108 addendum) — ref names in Unicode CODE POINT order
+    // (`compareExecutionIds`), kept sorted incrementally rather than re-sorted per call.
+    // Mirrors `InMemoryAsyncEventStore`'s `sortedIds` cache, so a page costs a binary search
+    // plus the page size, not an O(n log n) re-sort of the whole registry on every call.
+    //
+    // NOT `String.prototype.localeCompare`: it is locale- and normalization-aware, so two
+    // DISTINCT, canonically-equivalent names (an NFC "é", U+00E9, and its NFD decomposition
+    // "e\u0301") can compare equal. `listRefs`'s `after` filter used to test
+    // `name.localeCompare(after) > 0`, so a name tied with the cursor by that comparator was
+    // silently excluded — an L10-style skip at exactly the page boundary `pruneBranchRefs`
+    // resumes from.
+    //
+    // Review round 1 (P3) — `deleteRef` does NOT remove the name from this array; it becomes
+    // a TOMBSTONE (absent from `refs`, still present here) that `listRefs` skips while paging,
+    // and that gets swept out the next time this array is rebuilt. Deleting never reorders the
+    // survivors, so there is nothing to re-sort — `pruneBranchRefs` interleaves one `listRefs`
+    // page with N `deleteRef` calls, and invalidating per delete forced a full re-sort on
+    // every single page (measured: 100k refs, 179s). New names are binary-INSERTed in place
+    // instead, which also keeps a revived name (deleted, then `putRef`-created again under the
+    // same string) from producing a duplicate entry — see `insertSorted`. Compacted lazily in
+    // `listRefs`, once tombstones make up at least half the array, rather than never (an
+    // unbounded array over a long-lived registry) or on every delete (the cost above).
+    sortedNames;
+    constructor(options = {}) {
+        this.now = options.now ?? (() => Date.now());
+    }
+    /** Binary-insert `name` into `sortedNames`, no-op if it is already there (live or a tombstone). */
+    insertSorted(name) {
+        if (this.sortedNames === undefined)
+            return; // computed fresh, lazily, on the next listRefs
+        const arr = this.sortedNames;
+        let lo = 0;
+        let hi = arr.length;
+        while (lo < hi) {
+            const mid = (lo + hi) >>> 1;
+            if ((0, executionIdOrder_1.compareExecutionIds)(arr[mid], name) < 0)
+                lo = mid + 1;
+            else
+                hi = mid;
+        }
+        if (arr[lo] !== name)
+            arr.splice(lo, 0, name);
+    }
+    async putRef(ref) {
+        if (!this.refs.has(ref.name))
+            this.insertSorted(ref.name);
+        this.refs.set(ref.name, { ...ref });
+    }
+    async getRef(name) {
+        const ref = this.refs.get(name);
+        return ref !== undefined ? { ...ref } : null;
+    }
+    async listRefs(options) {
+        (0, BranchRegistry_1.assertListRefsLimit)(options?.limit);
+        // Lazy compaction: `deleteRef` never removes a name from `sortedNames` (see its doc
+        // comment), so once tombstones make up at least half the array, drop them by rebuilding
+        // from the live map — bounding how long a dead name can inflate every later scan, without
+        // paying for a rebuild on every delete.
+        if (this.sortedNames !== undefined && this.sortedNames.length >= this.refs.size * 2) {
+            this.sortedNames = undefined;
+        }
+        this.sortedNames ??= [...this.refs.keys()].sort(executionIdOrder_1.compareExecutionIds);
+        const sorted = this.sortedNames;
+        const after = options?.after;
+        // Binary-search the first name strictly after the cursor (any string, not only one
+        // this store returned) — the same seek `InMemoryAsyncEventStore.listExecutionsPage`
+        // does for execution ids. Tombstones do not disturb this: removing a name from `refs`
+        // never changes the relative order of the names that remain in `sortedNames`.
+        let start = 0;
+        if (after !== undefined) {
+            let hi = sorted.length;
+            while (start < hi) {
+                const mid = (start + hi) >>> 1;
+                if ((0, executionIdOrder_1.compareExecutionIds)(sorted[mid], after) > 0)
+                    hi = mid;
+                else
+                    start = mid + 1;
+            }
+        }
+        const limit = options?.limit;
+        const page = [];
+        for (let i = start; i < sorted.length; i++) {
+            const ref = this.refs.get(sorted[i]);
+            if (ref === undefined)
+                continue; // a tombstone — deleted since this name was indexed
+            page.push({ ...ref });
+            if (limit !== undefined && page.length >= limit)
+                break;
+        }
+        return page;
+    }
+    async moveTip(name, tip) {
+        const ref = this.refs.get(name);
+        if (ref === undefined)
+            return;
+        ref.tip = tip;
+        ref.updatedAt = this.now();
+    }
+    async promote(fromName, toName, options) {
+        const from = this.refs.get(fromName);
+        if (from === undefined) {
+            throw new Error(`promote: branch "${fromName}" does not exist`);
+        }
+        const now = this.now();
+        const to = this.refs.get(toName);
+        // CAS. Single-threaded by construction here, so read-then-write IS atomic; the durable
+        // backends do the same check inside one statement/transaction.
+        if (options !== undefined && "expect" in options) {
+            const actual = to?.executionId ?? null;
+            if (actual !== (options.expect ?? null)) {
+                throw new BranchRegistry_1.BranchPromotionConflictError(toName, options.expect ?? null, actual);
+            }
+        }
+        if (to === undefined) {
+            this.insertSorted(toName); // a new name enters the order
+            this.refs.set(toName, {
+                name: toName,
+                executionId: from.executionId,
+                tip: from.tip,
+                createdAt: now,
+                updatedAt: now,
+            });
+        }
+        else {
+            to.executionId = from.executionId;
+            to.tip = from.tip;
+            to.updatedAt = now;
+        }
+    }
+    async deleteRef(name) {
+        // Deliberately does NOT touch `sortedNames` — see its doc comment. The name becomes a
+        // tombstone, skipped by `listRefs` and compacted away lazily.
+        this.refs.delete(name);
+    }
+    async recordLineage(rec) {
+        this.lineage.set(rec.executionId, { ...rec, createdAt: this.now() });
+    }
+    async getLineage(executionId) {
+        const rec = this.lineage.get(executionId);
+        return rec !== undefined ? { ...rec } : null;
+    }
+    async removeLineage(executionId) {
+        this.lineage.delete(executionId);
+    }
+    async children(executionId) {
+        return [...this.lineage.values()]
+            .filter((l) => l.parentExecutionId === executionId)
+            .map((l) => ({ ...l }));
+    }
+    async close() { }
+}
+exports.InMemoryBranchRegistry = InMemoryBranchRegistry;
+//# sourceMappingURL=InMemoryBranchRegistry.js.map

package/dist/InMemoryBranchRegistry.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"InMemoryBranchRegistry.js","sourceRoot":"","sources":["../src/InMemoryBranchRegistry.ts"],"names":[],"mappings":";;;AAAA,qDAQ0B;AAC1B,yDAAyD;AAOzD;;;;GAIG;AACH,MAAa,sBAAsB;IAChB,IAAI,GAAG,IAAI,GAAG,EAAqB,CAAC;IACpC,OAAO,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC3C,GAAG,CAAe;IACnC,6EAA6E;IAC7E,qFAAqF;IACrF,yFAAyF;IACzF,qFAAqF;IACrF,EAAE;IACF,sFAAsF;IACtF,wFAAwF;IACxF,yEAAyE;IACzE,yFAAyF;IACzF,uFAAuF;IACvF,gBAAgB;IAChB,EAAE;IACF,yFAAyF;IACzF,2FAA2F;IAC3F,2FAA2F;IAC3F,2FAA2F;IAC3F,sFAAsF;IACtF,wFAAwF;IACxF,2FAA2F;IAC3F,0FAA0F;IAC1F,qFAAqF;IACrF,mFAAmF;IAC3E,WAAW,CAAuB;IAE1C,YAAY,UAAyC,EAAE;QACrD,IAAI,CAAC,GAAG,GAAG,OAAO,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC;IAC/C,CAAC;IAED,mGAAmG;IAC3F,YAAY,CAAC,IAAY;QAC/B,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS;YAAE,OAAO,CAAC,+CAA+C;QAC3F,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;QAC7B,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,IAAI,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC;QACpB,OAAO,EAAE,GAAG,EAAE,EAAE,CAAC;YACf,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;YAC5B,IAAI,IAAA,sCAAmB,EAAC,GAAG,CAAC,GAAG,CAAW,EAAE,IAAI,CAAC,GAAG,CAAC;gBAAE,EAAE,GAAG,GAAG,GAAG,CAAC,CAAC;;gBAC/D,EAAE,GAAG,GAAG,CAAC;QAChB,CAAC;QACD,IAAI,GAAG,CAAC,EAAE,CAAC,KAAK,IAAI;YAAE,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;IAChD,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,GAAc;QACzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC1D,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;IACtC,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,IAAY;QACvB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,OAAO,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/C,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,OAAyB;QACtC,IAAA,oCAAmB,EAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QACpC,oFAAoF;QACpF,wFAAwF;QACxF,0FAA0F;QAC1F,wCAAwC;QACxC,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,WAAW,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACpF,IAAI,CAAC,WAAW,GAAG,SAAS,CAAC;QAC/B,CAAC;QACD,IAAI,CAAC,WAAW,KAAK,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,sCAAmB,CAAC,CAAC;QACrE,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC;QAChC,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,CAAC;QAC7B,mFAAmF;QACnF,oFAAoF;QACpF,sFAAsF;QACtF,8EAA8E;QAC9E,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YACxB,IAAI,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC;YACvB,OAAO,KAAK,GAAG,EAAE,EAAE,CAAC;gBAClB,MAAM,GAAG,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;gBAC/B,IAAI,IAAA,sCAAmB,EAAC,MAAM,CAAC,GAAG,CAAW,EAAE,KAAK,CAAC,GAAG,CAAC;oBAAE,EAAE,GAAG,GAAG,CAAC;;oBAC/D,KAAK,GAAG,GAAG,GAAG,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;QACD,MAAM,KAAK,GAAG,OAAO,EAAE,KAAK,CAAC;QAC7B,MAAM,IAAI,GAAgB,EAAE,CAAC;QAC7B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC3C,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAW,CAAC,CAAC;YAC/C,IAAI,GAAG,KAAK,SAAS;gBAAE,SAAS,CAAC,oDAAoD;YACrF,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC;YACtB,IAAI,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK;gBAAE,MAAM;QACzD,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,IAAY,EAAE,GAAW;QACrC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChC,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO;QAC9B,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;QACd,GAAG,CAAC,SAAS,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;IAC7B,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,QAAgB,EAAE,MAAc,EAAE,OAAwB;QACtE,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACrC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,MAAM,IAAI,KAAK,CAAC,oBAAoB,QAAQ,kBAAkB,CAAC,CAAC;QAClE,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjC,uFAAuF;QACvF,+DAA+D;QAC/D,IAAI,OAAO,KAAK,SAAS,IAAI,QAAQ,IAAI,OAAO,EAAE,CAAC;YACjD,MAAM,MAAM,GAAG,EAAE,EAAE,WAAW,IAAI,IAAI,CAAC;YACvC,IAAI,MAAM,KAAK,CAAC,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;gBACxC,MAAM,IAAI,6CAA4B,CAAC,MAAM,EAAE,OAAO,CAAC,MAAM,IAAI,IAAI,EAAE,MAAM,CAAC,CAAC;YACjF,CAAC;QACH,CAAC;QACD,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,8BAA8B;YACzD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE;gBACpB,IAAI,EAAE,MAAM;gBACZ,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,GAAG,EAAE,IAAI,CAAC,GAAG;gBACb,SAAS,EAAE,GAAG;gBACd,SAAS,EAAE,GAAG;aACf,CAAC,CAAC;QACL,CAAC;aAAM,CAAC;YACN,EAAE,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC;YAClC,EAAE,CAAC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC;YAClB,EAAE,CAAC,SAAS,GAAG,GAAG,CAAC;QACrB,CAAC;IACH,CAAC;IAED,KAAK,CAAC,SAAS,CAAC,IAAY;QAC1B,sFAAsF;QACtF,8DAA8D;QAC9D,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,KAAK,CAAC,aAAa,CAAC,GAAqC;QACvD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,GAAG,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACvE,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,WAAmB;QAClC,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAC1C,OAAO,GAAG,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;IAC/C,CAAC;IAED,KAAK,CAAC,aAAa,CAAC,WAAmB;QACrC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC;IACnC,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,WAAmB;QAChC,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;aAC9B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,iBAAiB,KAAK,WAAW,CAAC;aAClD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5B,CAAC;IAED,KAAK,CAAC,KAAK,KAAmB,CAAC;CAChC;AA5JD,wDA4JC"}