@earendil-works/pi-agent-core 0.85.0 → 0.86.0

package/dist/harness/pico3/membrane.js

@@ -0,0 +1,141 @@
+/**
+ * A transaction-scoped revocable membrane over a Chord-tracked document.
+ *
+ * Every object reached through a document proxy is wrapped lazily; all wrappers of one
+ * transaction share one liveness flag; identity is preserved by a WeakMap. Mutations forward
+ * to the underlying Chord proxy so its tracker records ops. At transaction finish — success,
+ * callback failure, validation failure, storage failure — `revoke()` flips the flag and every
+ * retained wrapper, root or nested, throws on any operation.
+ *
+ * Assigning one wrapper into another (`a.list = b.list`) is rejected: Chord stores the value it
+ * is given, and a stored proxy is the classic footgun. Assign plain values; splice in place.
+ */
+export class Membrane {
+    alive = true;
+    wrappers = new WeakMap();
+    isWrapper = new WeakSet();
+    what;
+    constructor(what) {
+        this.what = what;
+    }
+    revoke() {
+        this.alive = false;
+    }
+    wrap(target) {
+        const hit = this.wrappers.get(target);
+        if (hit !== undefined)
+            return hit;
+        const m = this;
+        const dead = () => new TypeError(`document proxy (${m.what}) used outside its transaction`);
+        const out = (v) => (typeof v === "object" && v !== null ? m.wrap(v) : v);
+        const inp = (value) => {
+            if (typeof value !== "object" || value === null)
+                return value;
+            m.assertPlainInput(value, new WeakSet());
+            return JSON.parse(JSON.stringify(value));
+        };
+        const proxy = new Proxy(target, {
+            get(t, key, receiver) {
+                if (!m.alive)
+                    throw dead();
+                const v = Reflect.get(t, key, receiver === proxy ? t : receiver);
+                if (typeof v === "function") {
+                    // Methods run against the tracked target. Callback arguments (array elements and
+                    // the array itself) must cross back through the membrane before user code sees them.
+                    return (...args) => {
+                        if (!m.alive)
+                            throw dead();
+                        const safeArgs = args.map((arg) => {
+                            if (typeof arg !== "function")
+                                return inp(arg);
+                            return function (...callbackArgs) {
+                                if (!m.alive)
+                                    throw dead();
+                                return Reflect.apply(arg, this, callbackArgs.map(out));
+                            };
+                        });
+                        return out(Reflect.apply(v, t, safeArgs));
+                    };
+                }
+                return out(v);
+            },
+            set(t, key, value) {
+                if (!m.alive)
+                    throw dead();
+                if (key === "__proto__")
+                    throw new TypeError(`document proxy (${m.what}) cannot change prototypes`);
+                return Reflect.set(t, key, inp(value));
+            },
+            deleteProperty(t, key) {
+                if (!m.alive)
+                    throw dead();
+                return Reflect.deleteProperty(t, key);
+            },
+            has(t, key) {
+                if (!m.alive)
+                    throw dead();
+                return Reflect.has(t, key);
+            },
+            ownKeys(t) {
+                if (!m.alive)
+                    throw dead();
+                return Reflect.ownKeys(t);
+            },
+            getOwnPropertyDescriptor(t, key) {
+                if (!m.alive)
+                    throw dead();
+                const d = Reflect.getOwnPropertyDescriptor(t, key);
+                if (d === undefined)
+                    return undefined;
+                // Descriptors must not leak a raw nested object.
+                if ("value" in d)
+                    d.value = out(d.value);
+                return d;
+            },
+            defineProperty(t, key, descriptor) {
+                if (!m.alive)
+                    throw dead();
+                if ("get" in descriptor || "set" in descriptor)
+                    throw new TypeError(`document proxy (${m.what}) cannot define accessors`);
+                const safe = "value" in descriptor ? { ...descriptor, value: inp(descriptor.value) } : descriptor;
+                return Reflect.defineProperty(t, key, safe);
+            },
+            getPrototypeOf(t) {
+                if (!m.alive)
+                    throw dead();
+                return Reflect.getPrototypeOf(t);
+            },
+            setPrototypeOf() {
+                if (!m.alive)
+                    throw dead();
+                throw new TypeError(`document proxy (${m.what}) cannot change prototypes`);
+            },
+            isExtensible(t) {
+                if (!m.alive)
+                    throw dead();
+                return Reflect.isExtensible(t);
+            },
+            preventExtensions() {
+                if (!m.alive)
+                    throw dead();
+                throw new TypeError(`document proxy (${m.what}) cannot change extensibility`);
+            },
+        });
+        this.wrappers.set(target, proxy);
+        this.isWrapper.add(proxy);
+        return proxy;
+    }
+    assertPlainInput(value, seen) {
+        if (this.isWrapper.has(value))
+            throw new TypeError(`assigning a document proxy into a document (${this.what}); assign a plain value`);
+        if (seen.has(value))
+            throw new TypeError(`assigning a cyclic value into a document (${this.what})`);
+        seen.add(value);
+        for (const nested of Object.values(value)) {
+            if (typeof nested === "object" && nested !== null)
+                this.assertPlainInput(nested, seen);
+        }
+        seen.delete(value);
+    }
+}
+//# sourceMappingURL=membrane.js.map

package/dist/harness/pico3/membrane.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"membrane.js","sourceRoot":"","sources":["../../../src/harness/pico3/membrane.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,MAAM,OAAO,QAAQ;IACZ,KAAK,GAAG,IAAI,CAAC;IACJ,QAAQ,GAAG,IAAI,OAAO,EAAkB,CAAC;IACzC,SAAS,GAAG,IAAI,OAAO,EAAU,CAAC;IAClC,IAAI,CAAS;IAE9B,YAAY,IAAY,EAAE;QACzB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IAAA,CACjB;IAED,MAAM,GAAG;QACR,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAAA,CACnB;IAED,IAAI,CAAmB,MAAS,EAAK;QACpC,MAAM,GAAG,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACtC,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,GAAQ,CAAC;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC;QACf,MAAM,IAAI,GAAG,GAAG,EAAE,CAAC,IAAI,SAAS,CAAC,mBAAmB,CAAC,CAAC,IAAI,gCAAgC,CAAC,CAAC;QAC5F,MAAM,GAAG,GAAG,CAAC,CAAU,EAAW,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC3F,MAAM,GAAG,GAAG,CAAC,KAAc,EAAW,EAAE,CAAC;YACxC,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC;YAC9D,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,IAAI,OAAO,EAAE,CAAC,CAAC;YACzC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAY,CAAC;QAAA,CACpD,CAAC;QACF,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,MAAM,EAAE;YAC/B,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,EAAE;gBACrB,IAAI,CAAC,CAAC,CAAC,KAAK;oBAAE,MAAM,IAAI,EAAE,CAAC;gBAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,QAAQ,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;gBACjE,IAAI,OAAO,CAAC,KAAK,UAAU,EAAE,CAAC;oBAC7B,iFAAiF;oBACjF,qFAAqF;oBACrF,OAAO,CAAC,GAAG,IAAe,EAAE,EAAE,CAAC;wBAC9B,IAAI,CAAC,CAAC,CAAC,KAAK;4BAAE,MAAM,IAAI,EAAE,CAAC;wBAC3B,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC;4BAClC,IAAI,OAAO,GAAG,KAAK,UAAU;gCAAE,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;4BAC/C,OAAO,UAAyB,GAAG,YAAuB,EAAE;gCAC3D,IAAI,CAAC,CAAC,CAAC,KAAK;oCAAE,MAAM,IAAI,EAAE,CAAC;gCAC3B,OAAO,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,EAAE,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;4BAAA,CACvD,CAAC;wBAAA,CACF,CAAC,CAAC;wBACH,OAAO,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;oBAAA,CAC1C,CAAC;gBACH,CAAC;gBACD,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC;YAAA,CACd;YACD,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE;gBAClB,IAAI,CAAC,CAAC,CAAC,KAAK;oBAAE,MAAM,IAAI,EAAE,CAAC;gBAC3B,IAAI,GAAG,KAAK,WAAW;oBAAE,MAAM,IAAI,SAAS,CAAC,mBAAmB,CAAC,CAAC,IAAI,4BAA4B,CAAC,CAAC;gBACpG,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,KAAK,CAAU,CAAC,CAAC;YAAA,CAChD;YACD,cAAc,CAAC,CAAC,EAAE,GAAG,EAAE;gBACtB,IAAI,CAAC,CAAC,CAAC,KAAK;oBAAE,MAAM,IAAI,EAAE,CAAC;gBAC3B,OAAO,OAAO,CAAC,cAAc,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAAA,CACtC;YACD,GAAG,CAAC,CAAC,EAAE,GAAG,EAAE;gBACX,IAAI,CAAC,CAAC,CAAC,KAAK;oBAAE,MAAM,IAAI,EAAE,CAAC;gBAC3B,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;YAAA,CAC3B;YACD,OAAO,CAAC,CAAC,EAAE;gBACV,IAAI,CAAC,CAAC,CAAC,KAAK;oBAAE,MAAM,IAAI,EAAE,CAAC;gBAC3B,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAAA,CAC1B;YACD,wBAAwB,CAAC,CAAC,EAAE,GAAG,EAAE;gBAChC,IAAI,CAAC,CAAC,CAAC,KAAK;oBAAE,MAAM,IAAI,EAAE,CAAC;gBAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,wBAAwB,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;gBACnD,IAAI,CAAC,KAAK,SAAS;oBAAE,OAAO,SAAS,CAAC;gBACtC,iDAAiD;gBACjD,IAAI,OAAO,IAAI,CAAC;oBAAG,CAAwB,CAAC,KAAK,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;gBACjE,OAAO,CAAC,CAAC;YAAA,CACT;YACD,cAAc,CAAC,CAAC,EAAE,GAAG,EAAE,UAAU,EAAE;gBAClC,IAAI,CAAC,CAAC,CAAC,KAAK;oBAAE,MAAM,IAAI,EAAE,CAAC;gBAC3B,IAAI,KAAK,IAAI,UAAU,IAAI,KAAK,IAAI,UAAU;oBAC7C,MAAM,IAAI,SAAS,CAAC,mBAAmB,CAAC,CAAC,IAAI,2BAA2B,CAAC,CAAC;gBAC3E,MAAM,IAAI,GAAG,OAAO,IAAI,UAAU,CAAC,CAAC,CAAC,EAAE,GAAG,UAAU,EAAE,KAAK,EAAE,GAAG,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,CAAC;gBAClG,OAAO,OAAO,CAAC,cAAc,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;YAAA,CAC5C;YACD,cAAc,CAAC,CAAC,EAAE;gBACjB,IAAI,CAAC,CAAC,CAAC,KAAK;oBAAE,MAAM,IAAI,EAAE,CAAC;gBAC3B,OAAO,OAAO,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;YAAA,CACjC;YACD,cAAc,GAAG;gBAChB,IAAI,CAAC,CAAC,CAAC,KAAK;oBAAE,MAAM,IAAI,EAAE,CAAC;gBAC3B,MAAM,IAAI,SAAS,CAAC,mBAAmB,CAAC,CAAC,IAAI,4BAA4B,CAAC,CAAC;YAAA,CAC3E;YACD,YAAY,CAAC,CAAC,EAAE;gBACf,IAAI,CAAC,CAAC,CAAC,KAAK;oBAAE,MAAM,IAAI,EAAE,CAAC;gBAC3B,OAAO,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAAA,CAC/B;YACD,iBAAiB,GAAG;gBACnB,IAAI,CAAC,CAAC,CAAC,KAAK;oBAAE,MAAM,IAAI,EAAE,CAAC;gBAC3B,MAAM,IAAI,SAAS,CAAC,mBAAmB,CAAC,CAAC,IAAI,+BAA+B,CAAC,CAAC;YAAA,CAC9E;SACD,CAAC,CAAC;QACH,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAC1B,OAAO,KAAU,CAAC;IAAA,CAClB;IAEO,gBAAgB,CAAC,KAAa,EAAE,IAAqB,EAAQ;QACpE,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC;YAC5B,MAAM,IAAI,SAAS,CAAC,+CAA+C,IAAI,CAAC,IAAI,yBAAyB,CAAC,CAAC;QACxG,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,MAAM,IAAI,SAAS,CAAC,6CAA6C,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;QACpG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAChB,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;YAC3C,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI;gBAAE,IAAI,CAAC,gBAAgB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACxF,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAAA,CACnB;CACD","sourcesContent":["/**\n * A transaction-scoped revocable membrane over a Chord-tracked document.\n *\n * Every object reached through a document proxy is wrapped lazily; all wrappers of one\n * transaction share one liveness flag; identity is preserved by a WeakMap. Mutations forward\n * to the underlying Chord proxy so its tracker records ops. At transaction finish — success,\n * callback failure, validation failure, storage failure — `revoke()` flips the flag and every\n * retained wrapper, root or nested, throws on any operation.\n *\n * Assigning one wrapper into another (`a.list = b.list`) is rejected: Chord stores the value it\n * is given, and a stored proxy is the classic footgun. Assign plain values; splice in place.\n */\nexport class Membrane {\n\tprivate alive = true;\n\tprivate readonly wrappers = new WeakMap<object, object>();\n\tprivate readonly isWrapper = new WeakSet<object>();\n\tprivate readonly what: string;\n\n\tconstructor(what: string) {\n\t\tthis.what = what;\n\t}\n\n\trevoke() {\n\t\tthis.alive = false;\n\t}\n\n\twrap<T extends object>(target: T): T {\n\t\tconst hit = this.wrappers.get(target);\n\t\tif (hit !== undefined) return hit as T;\n\t\tconst m = this;\n\t\tconst dead = () => new TypeError(`document proxy (${m.what}) used outside its transaction`);\n\t\tconst out = (v: unknown): unknown => (typeof v === \"object\" && v !== null ? m.wrap(v) : v);\n\t\tconst inp = (value: unknown): unknown => {\n\t\t\tif (typeof value !== \"object\" || value === null) return value;\n\t\t\tm.assertPlainInput(value, new WeakSet());\n\t\t\treturn JSON.parse(JSON.stringify(value)) as unknown;\n\t\t};\n\t\tconst proxy = new Proxy(target, {\n\t\t\tget(t, key, receiver) {\n\t\t\t\tif (!m.alive) throw dead();\n\t\t\t\tconst v = Reflect.get(t, key, receiver === proxy ? t : receiver);\n\t\t\t\tif (typeof v === \"function\") {\n\t\t\t\t\t// Methods run against the tracked target. Callback arguments (array elements and\n\t\t\t\t\t// the array itself) must cross back through the membrane before user code sees them.\n\t\t\t\t\treturn (...args: unknown[]) => {\n\t\t\t\t\t\tif (!m.alive) throw dead();\n\t\t\t\t\t\tconst safeArgs = args.map((arg) => {\n\t\t\t\t\t\t\tif (typeof arg !== \"function\") return inp(arg);\n\t\t\t\t\t\t\treturn function (this: unknown, ...callbackArgs: unknown[]) {\n\t\t\t\t\t\t\t\tif (!m.alive) throw dead();\n\t\t\t\t\t\t\t\treturn Reflect.apply(arg, this, callbackArgs.map(out));\n\t\t\t\t\t\t\t};\n\t\t\t\t\t\t});\n\t\t\t\t\t\treturn out(Reflect.apply(v, t, safeArgs));\n\t\t\t\t\t};\n\t\t\t\t}\n\t\t\t\treturn out(v);\n\t\t\t},\n\t\t\tset(t, key, value) {\n\t\t\t\tif (!m.alive) throw dead();\n\t\t\t\tif (key === \"__proto__\") throw new TypeError(`document proxy (${m.what}) cannot change prototypes`);\n\t\t\t\treturn Reflect.set(t, key, inp(value) as never);\n\t\t\t},\n\t\t\tdeleteProperty(t, key) {\n\t\t\t\tif (!m.alive) throw dead();\n\t\t\t\treturn Reflect.deleteProperty(t, key);\n\t\t\t},\n\t\t\thas(t, key) {\n\t\t\t\tif (!m.alive) throw dead();\n\t\t\t\treturn Reflect.has(t, key);\n\t\t\t},\n\t\t\townKeys(t) {\n\t\t\t\tif (!m.alive) throw dead();\n\t\t\t\treturn Reflect.ownKeys(t);\n\t\t\t},\n\t\t\tgetOwnPropertyDescriptor(t, key) {\n\t\t\t\tif (!m.alive) throw dead();\n\t\t\t\tconst d = Reflect.getOwnPropertyDescriptor(t, key);\n\t\t\t\tif (d === undefined) return undefined;\n\t\t\t\t// Descriptors must not leak a raw nested object.\n\t\t\t\tif (\"value\" in d) (d as { value: unknown }).value = out(d.value);\n\t\t\t\treturn d;\n\t\t\t},\n\t\t\tdefineProperty(t, key, descriptor) {\n\t\t\t\tif (!m.alive) throw dead();\n\t\t\t\tif (\"get\" in descriptor || \"set\" in descriptor)\n\t\t\t\t\tthrow new TypeError(`document proxy (${m.what}) cannot define accessors`);\n\t\t\t\tconst safe = \"value\" in descriptor ? { ...descriptor, value: inp(descriptor.value) } : descriptor;\n\t\t\t\treturn Reflect.defineProperty(t, key, safe);\n\t\t\t},\n\t\t\tgetPrototypeOf(t) {\n\t\t\t\tif (!m.alive) throw dead();\n\t\t\t\treturn Reflect.getPrototypeOf(t);\n\t\t\t},\n\t\t\tsetPrototypeOf() {\n\t\t\t\tif (!m.alive) throw dead();\n\t\t\t\tthrow new TypeError(`document proxy (${m.what}) cannot change prototypes`);\n\t\t\t},\n\t\t\tisExtensible(t) {\n\t\t\t\tif (!m.alive) throw dead();\n\t\t\t\treturn Reflect.isExtensible(t);\n\t\t\t},\n\t\t\tpreventExtensions() {\n\t\t\t\tif (!m.alive) throw dead();\n\t\t\t\tthrow new TypeError(`document proxy (${m.what}) cannot change extensibility`);\n\t\t\t},\n\t\t});\n\t\tthis.wrappers.set(target, proxy);\n\t\tthis.isWrapper.add(proxy);\n\t\treturn proxy as T;\n\t}\n\n\tprivate assertPlainInput(value: object, seen: WeakSet<object>): void {\n\t\tif (this.isWrapper.has(value))\n\t\t\tthrow new TypeError(`assigning a document proxy into a document (${this.what}); assign a plain value`);\n\t\tif (seen.has(value)) throw new TypeError(`assigning a cyclic value into a document (${this.what})`);\n\t\tseen.add(value);\n\t\tfor (const nested of Object.values(value)) {\n\t\t\tif (typeof nested === \"object\" && nested !== null) this.assertPlainInput(nested, seen);\n\t\t}\n\t\tseen.delete(value);\n\t}\n}\n"]}

package/dist/harness/pico3/memory.d.ts

@@ -0,0 +1,53 @@
+import type { Context } from "@earendil-works/chord";
+import { type Op } from "@earendil-works/chord/delta";
+import type { Conversation, DocRef, Entry, EntryScan, Id, Input, JsonObject, Seq, Storage, Task, TaskScan, Write } from "./types.ts";
+/**
+ * In-memory Storage. The reference backend, and the read path of JsonlStorage.
+ *
+ * A batch is validated and staged in full before any table changes: one failed
+ * batch changes no table, no document, no ID high-water, no sequence. Committed
+ * IDs are never reused; IDs minted but never committed may be reused after reopen.
+ */
+export declare class MemoryStorage implements Storage {
+    protected readonly conversationsById: Map<number, Conversation>;
+    protected readonly entriesById: Map<number, Entry>;
+    protected readonly entriesByConversation: Map<number, Entry[]>;
+    protected readonly tasksById: Map<number, Task<import("@earendil-works/chord").JsonValue, import("./types.ts").Checkpoint>>;
+    protected readonly inputsById: Map<number, Input>;
+    protected readonly inputsByRequest: Map<string, Input>;
+    /** Rewindable docs keep their full op history with the seq of each batch, for `docAsOf`. */
+    protected readonly rewindableLog: Map<number, {
+        seq: number;
+        ops: Op[];
+    }[]>;
+    protected readonly stickyLog: Map<number, Op[][]>;
+    protected sessionDoc: JsonObject | undefined;
+    protected readonly entrySeq: Map<number, number>;
+    protected nextIdValue: number;
+    protected seq: Seq;
+    private closed;
+    mintId(): Id;
+    protected setNextId(n: Id): void;
+    commit(writes: readonly Write[], _ctx: Context): Promise<Seq>;
+    /** Validate the whole batch against the current tables; return a function that applies it. */
+    protected stage(writes: readonly Write[], seq: Seq): () => void;
+    conversation(id: Id, _ctx?: Context): Promise<Conversation | undefined>;
+    conversations(_ctx?: Context): Promise<Conversation[]>;
+    entries(ids: readonly Id[], _ctx?: Context): Promise<Map<number, Entry>>;
+    /** Newest-first, fork-aware: after this conversation's own entries, the parent's up to the fork point, and so on. */
+    scanEntries(scan: EntryScan, _ctx?: Context): Promise<Entry[]>;
+    task(id: Id, _ctx?: Context): Promise<Task<import("@earendil-works/chord").JsonValue, import("./types.ts").Checkpoint> | undefined>;
+    scanTasks(scan: TaskScan, _ctx?: Context): Promise<Task<import("@earendil-works/chord").JsonValue, import("./types.ts").Checkpoint>[]>;
+    input(id: Id, _ctx?: Context): Promise<Input | undefined>;
+    inputByRequest(conversationId: Id, requestId: string, _ctx?: Context): Promise<Input | undefined>;
+    doc(ref: DocRef, _ctx?: Context): Promise<JsonObject | undefined>;
+    /**
+     * Commit-granular history: the rewindable state after the atomic commit that contains
+     * entry `at`, walking the fork chain for entries owned by ancestors.
+     */
+    docAsOf(conversationId: Id, at: Id, _ctx?: Context): Promise<JsonObject | undefined>;
+    protected fold(log: Op[][]): JsonObject;
+    truncate(ref: DocRef, _ctx?: Context): Promise<void>;
+    close(_ctx?: Context): Promise<void>;
+}
+//# sourceMappingURL=memory.d.ts.map

package/dist/harness/pico3/memory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory.d.ts","sourceRoot":"","sources":["../../../src/harness/pico3/memory.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,uBAAuB,CAAC;AACrD,OAAO,EAA0B,KAAK,EAAE,EAAE,MAAM,6BAA6B,CAAC;AAC9E,OAAO,KAAK,EACX,YAAY,EACZ,MAAM,EACN,KAAK,EACL,SAAS,EACT,EAAE,EACF,KAAK,EACL,UAAU,EACV,GAAG,EACH,OAAO,EACP,IAAI,EACJ,QAAQ,EACR,KAAK,EACL,MAAM,YAAY,CAAC;AAEpB;;;;;;GAMG;AACH,qBAAa,aAAc,YAAW,OAAO;IAC5C,SAAS,CAAC,QAAQ,CAAC,iBAAiB,4BAA+B;IACnE,SAAS,CAAC,QAAQ,CAAC,WAAW,qBAAwB;IACtD,SAAS,CAAC,QAAQ,CAAC,qBAAqB,uBAA0B;IAClE,SAAS,CAAC,QAAQ,CAAC,SAAS,gGAAuB;IACnD,SAAS,CAAC,QAAQ,CAAC,UAAU,qBAAwB;IACrD,SAAS,CAAC,QAAQ,CAAC,eAAe,qBAA4B;IAC9D,4FAA4F;IAC5F,SAAS,CAAC,QAAQ,CAAC,aAAa;;;SAA4C;IAC5E,SAAS,CAAC,QAAQ,CAAC,SAAS,sBAAyB;IACrD,SAAS,CAAC,UAAU,EAAE,UAAU,GAAG,SAAS,CAAC;IAC7C,SAAS,CAAC,QAAQ,CAAC,QAAQ,sBAAsB;IACjD,SAAS,CAAC,WAAW,SAAK;IAC1B,SAAS,CAAC,GAAG,EAAE,GAAG,CAAK;IACvB,OAAO,CAAC,MAAM,CAAS;IAEvB,MAAM,IAAI,EAAE,CAEX;IACD,SAAS,CAAC,SAAS,CAAC,CAAC,EAAE,EAAE,QAExB;IAEK,MAAM,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,EAAE,IAAI,EAAE,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,CAOlE;IAED,8FAA8F;IAC9F,SAAS,CAAC,KAAK,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,EAAE,GAAG,EAAE,GAAG,GAAG,MAAM,IAAI,CAsG9D;IAEK,YAAY,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,OAAO,qCAExC;IACK,aAAa,CAAC,IAAI,CAAC,EAAE,OAAO,2BAEjC;IACK,OAAO,CAAC,GAAG,EAAE,SAAS,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,OAAO,+BAO/C;IACD,qHAAqH;IAC/G,WAAW,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,EAAE,OAAO,oBAkBhD;IACK,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,OAAO,yGAEhC;IACK,SAAS,CAAC,IAAI,EAAE,QAAQ,EAAE,IAAI,CAAC,EAAE,OAAO,+FAS7C;IACK,KAAK,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,OAAO,8BAEjC;IACK,cAAc,CAAC,cAAc,EAAE,EAAE,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,OAAO,8BAEzE;IAEK,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,UAAU,GAAG,SAAS,CAAC,CAStE;IACD;;;OAGG;IACG,OAAO,CAAC,cAAc,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,OAAO,GAAG,OAAO,CAAC,UAAU,GAAG,SAAS,CAAC,CAazF;IACD,SAAS,CAAC,IAAI,CAAC,GAAG,EAAE,EAAE,EAAE,EAAE,GAAG,UAAU,CAUtC;IACK,QAAQ,CAAC,GAAG,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,OAAO,iBAWzC;IACK,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,iBAEzB;CACD","sourcesContent":["import type { Context } from \"@earendil-works/chord\";\nimport { applyImmutable, isBase, type Op } from \"@earendil-works/chord/delta\";\nimport type {\n\tConversation,\n\tDocRef,\n\tEntry,\n\tEntryScan,\n\tId,\n\tInput,\n\tJsonObject,\n\tSeq,\n\tStorage,\n\tTask,\n\tTaskScan,\n\tWrite,\n} from \"./types.ts\";\n\n/**\n * In-memory Storage. The reference backend, and the read path of JsonlStorage.\n *\n * A batch is validated and staged in full before any table changes: one failed\n * batch changes no table, no document, no ID high-water, no sequence. Committed\n * IDs are never reused; IDs minted but never committed may be reused after reopen.\n */\nexport class MemoryStorage implements Storage {\n\tprotected readonly conversationsById = new Map<Id, Conversation>();\n\tprotected readonly entriesById = new Map<Id, Entry>();\n\tprotected readonly entriesByConversation = new Map<Id, Entry[]>(); // ascending\n\tprotected readonly tasksById = new Map<Id, Task>();\n\tprotected readonly inputsById = new Map<Id, Input>();\n\tprotected readonly inputsByRequest = new Map<string, Input>();\n\t/** Rewindable docs keep their full op history with the seq of each batch, for `docAsOf`. */\n\tprotected readonly rewindableLog = new Map<Id, { seq: Seq; ops: Op[] }[]>();\n\tprotected readonly stickyLog = new Map<Id, Op[][]>();\n\tprotected sessionDoc: JsonObject | undefined;\n\tprotected readonly entrySeq = new Map<Id, Seq>(); // entry id → seq of its batch\n\tprotected nextIdValue = 1;\n\tprotected seq: Seq = 0;\n\tprivate closed = false;\n\n\tmintId(): Id {\n\t\treturn this.nextIdValue++;\n\t}\n\tprotected setNextId(n: Id) {\n\t\tthis.nextIdValue = Math.max(this.nextIdValue, n);\n\t}\n\n\tasync commit(writes: readonly Write[], _ctx: Context): Promise<Seq> {\n\t\tif (this.closed) throw new Error(\"storage closed\");\n\t\tconst seq = this.seq + 1;\n\t\tconst staged = this.stage(writes, seq); // throws before any mutation\n\t\tstaged();\n\t\tthis.seq = seq;\n\t\treturn seq;\n\t}\n\n\t/** Validate the whole batch against the current tables; return a function that applies it. */\n\tprotected stage(writes: readonly Write[], seq: Seq): () => void {\n\t\tconst ops: (() => void)[] = [];\n\t\tconst created = new Set<Id>();\n\t\tlet maxId = 0;\n\t\tconst claim = (id: Id, what: string) => {\n\t\t\tif (!Number.isSafeInteger(id) || id <= 0) throw new Error(`${what}: invalid id ${id}`);\n\t\t\tif (created.has(id)) throw new Error(`${what}: id ${id} created twice in one batch`);\n\t\t\tcreated.add(id);\n\t\t\tmaxId = Math.max(maxId, id);\n\t\t};\n\t\tfor (const w of writes) {\n\t\t\tswitch (w.type) {\n\t\t\t\tcase \"conversation\": {\n\t\t\t\t\tif (this.conversationsById.has(w.conversation.id))\n\t\t\t\t\t\tthrow new Error(`conversation ${w.conversation.id} exists`);\n\t\t\t\t\tclaim(w.conversation.id, \"conversation\");\n\t\t\t\t\tconst c = clone(w.conversation);\n\t\t\t\t\tops.push(() => {\n\t\t\t\t\t\tthis.conversationsById.set(c.id, c);\n\t\t\t\t\t\tthis.entriesByConversation.set(c.id, []);\n\t\t\t\t\t});\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase \"entry\": {\n\t\t\t\t\tif (this.entriesById.has(w.entry.id)) throw new Error(`entry ${w.entry.id} exists`);\n\t\t\t\t\tclaim(w.entry.id, \"entry\");\n\t\t\t\t\tconst e = clone(w.entry);\n\t\t\t\t\tops.push(() => {\n\t\t\t\t\t\tthis.entriesById.set(e.id, e);\n\t\t\t\t\t\t(\n\t\t\t\t\t\t\tthis.entriesByConversation.get(e.conversationId) ??\n\t\t\t\t\t\t\tthis.entriesByConversation.set(e.conversationId, []).get(e.conversationId)!\n\t\t\t\t\t\t).push(e);\n\t\t\t\t\t\tthis.entrySeq.set(e.id, seq);\n\t\t\t\t\t});\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase \"task\": {\n\t\t\t\t\tif (this.tasksById.has(w.task.id)) throw new Error(`task ${w.task.id} exists`);\n\t\t\t\t\tclaim(w.task.id, \"task\");\n\t\t\t\t\tconst t = clone(w.task);\n\t\t\t\t\tops.push(() => this.tasksById.set(t.id, t));\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase \"task.patch\": {\n\t\t\t\t\tconst prev =\n\t\t\t\t\t\tthis.tasksById.get(w.patch.id) ??\n\t\t\t\t\t\t[...writes]\n\t\t\t\t\t\t\t.filter((x): x is Extract<Write, { type: \"task\" }> => x.type === \"task\")\n\t\t\t\t\t\t\t.find((x) => x.task.id === w.patch.id)?.task;\n\t\t\t\t\tif (prev === undefined) throw new Error(`patch for unknown task ${w.patch.id}`);\n\t\t\t\t\tconst p = clone(w.patch);\n\t\t\t\t\tops.push(() => {\n\t\t\t\t\t\tconst cur = this.tasksById.get(p.id)!;\n\t\t\t\t\t\tconst { id: _i, ...fields } = p;\n\t\t\t\t\t\tconst next = { ...cur, ...fields } as Task;\n\t\t\t\t\t\tif (p.checkpoint === null) delete (next as { checkpoint?: unknown }).checkpoint;\n\t\t\t\t\t\tthis.tasksById.set(p.id, next);\n\t\t\t\t\t});\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase \"input\": {\n\t\t\t\t\tconst i = clone(w.input);\n\t\t\t\t\tif (!this.inputsById.has(i.id)) claim(i.id, \"input\");\n\t\t\t\t\tops.push(() => {\n\t\t\t\t\t\tthis.inputsById.set(i.id, i);\n\t\t\t\t\t\tif (i.requestId !== undefined) this.inputsByRequest.set(`${i.conversationId}:${i.requestId}`, i);\n\t\t\t\t\t});\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase \"doc\": {\n\t\t\t\t\tconst ref = clone(w.ref);\n\t\t\t\t\tconst o = clone(w.ops);\n\t\t\t\t\tif (ref.doc === \"session\")\n\t\t\t\t\t\tops.push(() => {\n\t\t\t\t\t\t\tthis.sessionDoc = applyImmutable(\n\t\t\t\t\t\t\t\t(this.sessionDoc ?? { plugins: {} }) as JsonObject,\n\t\t\t\t\t\t\t\to,\n\t\t\t\t\t\t\t) as JsonObject;\n\t\t\t\t\t\t});\n\t\t\t\t\telse if (ref.doc === \"rewindable\")\n\t\t\t\t\t\tops.push(() =>\n\t\t\t\t\t\t\t(\n\t\t\t\t\t\t\t\tthis.rewindableLog.get(ref.conversationId) ??\n\t\t\t\t\t\t\t\tthis.rewindableLog.set(ref.conversationId, []).get(ref.conversationId)!\n\t\t\t\t\t\t\t).push({ seq, ops: o }),\n\t\t\t\t\t\t);\n\t\t\t\t\telse\n\t\t\t\t\t\tops.push(() =>\n\t\t\t\t\t\t\t(\n\t\t\t\t\t\t\t\tthis.stickyLog.get(ref.conversationId) ??\n\t\t\t\t\t\t\t\tthis.stickyLog.set(ref.conversationId, []).get(ref.conversationId)!\n\t\t\t\t\t\t\t).push(o),\n\t\t\t\t\t\t);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn () => {\n\t\t\tfor (const op of ops) op();\n\t\t\tthis.setNextId(maxId + 1);\n\t\t};\n\t}\n\n\tasync conversation(id: Id, _ctx?: Context) {\n\t\treturn optionalClone(this.conversationsById.get(id));\n\t}\n\tasync conversations(_ctx?: Context) {\n\t\treturn [...this.conversationsById.values()].map(clone);\n\t}\n\tasync entries(ids: readonly Id[], _ctx?: Context) {\n\t\tconst out = new Map<Id, Entry>();\n\t\tfor (const id of ids) {\n\t\t\tconst e = this.entriesById.get(id);\n\t\t\tif (e) out.set(id, clone(e));\n\t\t}\n\t\treturn out;\n\t}\n\t/** Newest-first, fork-aware: after this conversation's own entries, the parent's up to the fork point, and so on. */\n\tasync scanEntries(scan: EntryScan, _ctx?: Context) {\n\t\tconst out: Entry[] = [];\n\t\tlet conversationId: Id | undefined = scan.conversationId;\n\t\tlet cap: Id | undefined = scan.before;\n\t\twhile (conversationId !== undefined && out.length < scan.limit) {\n\t\t\tconst own = this.entriesByConversation.get(conversationId) ?? [];\n\t\t\tfor (let i = own.length - 1; i >= 0 && out.length < scan.limit; i--) {\n\t\t\t\tconst e = own[i]!;\n\t\t\t\tif (cap !== undefined && e.id >= cap) continue;\n\t\t\t\tif (scan.kind !== undefined && e.kind !== scan.kind) continue;\n\t\t\t\tif (scan.withHead && e.head === undefined) continue;\n\t\t\t\tout.push(clone(e));\n\t\t\t}\n\t\t\tconst c = this.conversationsById.get(conversationId);\n\t\t\tconversationId = c?.parent?.conversationId;\n\t\t\tcap = c?.parent === undefined ? undefined : Math.min(cap ?? Infinity, c.parent.at + 1);\n\t\t}\n\t\treturn out;\n\t}\n\tasync task(id: Id, _ctx?: Context) {\n\t\treturn optionalClone(this.tasksById.get(id));\n\t}\n\tasync scanTasks(scan: TaskScan, _ctx?: Context) {\n\t\tconst out: Task[] = [];\n\t\tfor (const t of this.tasksById.values()) {\n\t\t\tif (scan.conversationId !== undefined && t.conversationId !== scan.conversationId) continue;\n\t\t\tif (scan.status !== undefined && !scan.status.includes(t.status)) continue;\n\t\t\tif (scan.kind !== undefined && t.kind !== scan.kind) continue;\n\t\t\tout.push(clone(t));\n\t\t}\n\t\treturn out;\n\t}\n\tasync input(id: Id, _ctx?: Context) {\n\t\treturn optionalClone(this.inputsById.get(id));\n\t}\n\tasync inputByRequest(conversationId: Id, requestId: string, _ctx?: Context) {\n\t\treturn optionalClone(this.inputsByRequest.get(`${conversationId}:${requestId}`));\n\t}\n\n\tasync doc(ref: DocRef, _ctx?: Context): Promise<JsonObject | undefined> {\n\t\tif (ref.doc === \"session\")\n\t\t\treturn this.sessionDoc === undefined ? { plugins: {} } : structuredClone(this.sessionDoc);\n\t\tconst log =\n\t\t\tref.doc === \"rewindable\"\n\t\t\t\t? this.rewindableLog.get(ref.conversationId)?.map((r) => r.ops)\n\t\t\t\t: this.stickyLog.get(ref.conversationId);\n\t\tif (log === undefined) return undefined;\n\t\treturn clone(this.fold(log));\n\t}\n\t/**\n\t * Commit-granular history: the rewindable state after the atomic commit that contains\n\t * entry `at`, walking the fork chain for entries owned by ancestors.\n\t */\n\tasync docAsOf(conversationId: Id, at: Id, _ctx?: Context): Promise<JsonObject | undefined> {\n\t\tconst owner = this.entriesById.get(at)?.conversationId;\n\t\tif (owner === undefined) return undefined;\n\t\tconst chain: Id[] = [];\n\t\tlet c: Conversation | undefined = this.conversationsById.get(conversationId);\n\t\twhile (c !== undefined && c.id !== owner) {\n\t\t\tchain.push(c.id);\n\t\t\tc = c.parent ? this.conversationsById.get(c.parent.conversationId) : undefined;\n\t\t}\n\t\tif (c === undefined) return undefined;\n\t\tconst seqAt = this.entrySeq.get(at) ?? 0;\n\t\tconst log = (this.rewindableLog.get(owner) ?? []).filter((r) => r.seq <= seqAt).map((r) => r.ops);\n\t\treturn log.length === 0 ? undefined : clone(this.fold(log));\n\t}\n\tprotected fold(log: Op[][]): JsonObject {\n\t\tlet start = 0;\n\t\tfor (let i = log.length - 1; i >= 0; i--)\n\t\t\tif (isBase(log[i]!)) {\n\t\t\t\tstart = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tlet state: JsonObject = {};\n\t\tfor (let i = start; i < log.length; i++) state = applyImmutable(state, log[i]!) as JsonObject;\n\t\treturn state;\n\t}\n\tasync truncate(ref: DocRef, _ctx?: Context) {\n\t\tif (ref.doc !== \"sticky\") return;\n\t\tconst log = this.stickyLog.get(ref.conversationId);\n\t\tif (log === undefined) return;\n\t\tlet start = 0;\n\t\tfor (let i = log.length - 1; i >= 0; i--)\n\t\t\tif (isBase(log[i]!)) {\n\t\t\t\tstart = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tlog.splice(0, start);\n\t}\n\tasync close(_ctx?: Context) {\n\t\tthis.closed = true;\n\t}\n}\n\nfunction clone<T>(value: T): T {\n\treturn JSON.parse(JSON.stringify(value)) as T;\n}\n\nfunction optionalClone<T>(value: T | undefined): T | undefined {\n\treturn value === undefined ? undefined : clone(value);\n}\n"]}

package/dist/harness/pico3/memory.js

@@ -0,0 +1,264 @@
+import { applyImmutable, isBase } from "@earendil-works/chord/delta";
+/**
+ * In-memory Storage. The reference backend, and the read path of JsonlStorage.
+ *
+ * A batch is validated and staged in full before any table changes: one failed
+ * batch changes no table, no document, no ID high-water, no sequence. Committed
+ * IDs are never reused; IDs minted but never committed may be reused after reopen.
+ */
+export class MemoryStorage {
+    conversationsById = new Map();
+    entriesById = new Map();
+    entriesByConversation = new Map(); // ascending
+    tasksById = new Map();
+    inputsById = new Map();
+    inputsByRequest = new Map();
+    /** Rewindable docs keep their full op history with the seq of each batch, for `docAsOf`. */
+    rewindableLog = new Map();
+    stickyLog = new Map();
+    sessionDoc;
+    entrySeq = new Map(); // entry id → seq of its batch
+    nextIdValue = 1;
+    seq = 0;
+    closed = false;
+    mintId() {
+        return this.nextIdValue++;
+    }
+    setNextId(n) {
+        this.nextIdValue = Math.max(this.nextIdValue, n);
+    }
+    async commit(writes, _ctx) {
+        if (this.closed)
+            throw new Error("storage closed");
+        const seq = this.seq + 1;
+        const staged = this.stage(writes, seq); // throws before any mutation
+        staged();
+        this.seq = seq;
+        return seq;
+    }
+    /** Validate the whole batch against the current tables; return a function that applies it. */
+    stage(writes, seq) {
+        const ops = [];
+        const created = new Set();
+        let maxId = 0;
+        const claim = (id, what) => {
+            if (!Number.isSafeInteger(id) || id <= 0)
+                throw new Error(`${what}: invalid id ${id}`);
+            if (created.has(id))
+                throw new Error(`${what}: id ${id} created twice in one batch`);
+            created.add(id);
+            maxId = Math.max(maxId, id);
+        };
+        for (const w of writes) {
+            switch (w.type) {
+                case "conversation": {
+                    if (this.conversationsById.has(w.conversation.id))
+                        throw new Error(`conversation ${w.conversation.id} exists`);
+                    claim(w.conversation.id, "conversation");
+                    const c = clone(w.conversation);
+                    ops.push(() => {
+                        this.conversationsById.set(c.id, c);
+                        this.entriesByConversation.set(c.id, []);
+                    });
+                    break;
+                }
+                case "entry": {
+                    if (this.entriesById.has(w.entry.id))
+                        throw new Error(`entry ${w.entry.id} exists`);
+                    claim(w.entry.id, "entry");
+                    const e = clone(w.entry);
+                    ops.push(() => {
+                        this.entriesById.set(e.id, e);
+                        (this.entriesByConversation.get(e.conversationId) ??
+                            this.entriesByConversation.set(e.conversationId, []).get(e.conversationId)).push(e);
+                        this.entrySeq.set(e.id, seq);
+                    });
+                    break;
+                }
+                case "task": {
+                    if (this.tasksById.has(w.task.id))
+                        throw new Error(`task ${w.task.id} exists`);
+                    claim(w.task.id, "task");
+                    const t = clone(w.task);
+                    ops.push(() => this.tasksById.set(t.id, t));
+                    break;
+                }
+                case "task.patch": {
+                    const prev = this.tasksById.get(w.patch.id) ??
+                        [...writes]
+                            .filter((x) => x.type === "task")
+                            .find((x) => x.task.id === w.patch.id)?.task;
+                    if (prev === undefined)
+                        throw new Error(`patch for unknown task ${w.patch.id}`);
+                    const p = clone(w.patch);
+                    ops.push(() => {
+                        const cur = this.tasksById.get(p.id);
+                        const { id: _i, ...fields } = p;
+                        const next = { ...cur, ...fields };
+                        if (p.checkpoint === null)
+                            delete next.checkpoint;
+                        this.tasksById.set(p.id, next);
+                    });
+                    break;
+                }
+                case "input": {
+                    const i = clone(w.input);
+                    if (!this.inputsById.has(i.id))
+                        claim(i.id, "input");
+                    ops.push(() => {
+                        this.inputsById.set(i.id, i);
+                        if (i.requestId !== undefined)
+                            this.inputsByRequest.set(`${i.conversationId}:${i.requestId}`, i);
+                    });
+                    break;
+                }
+                case "doc": {
+                    const ref = clone(w.ref);
+                    const o = clone(w.ops);
+                    if (ref.doc === "session")
+                        ops.push(() => {
+                            this.sessionDoc = applyImmutable((this.sessionDoc ?? { plugins: {} }), o);
+                        });
+                    else if (ref.doc === "rewindable")
+                        ops.push(() => (this.rewindableLog.get(ref.conversationId) ??
+                            this.rewindableLog.set(ref.conversationId, []).get(ref.conversationId)).push({ seq, ops: o }));
+                    else
+                        ops.push(() => (this.stickyLog.get(ref.conversationId) ??
+                            this.stickyLog.set(ref.conversationId, []).get(ref.conversationId)).push(o));
+                    break;
+                }
+            }
+        }
+        return () => {
+            for (const op of ops)
+                op();
+            this.setNextId(maxId + 1);
+        };
+    }
+    async conversation(id, _ctx) {
+        return optionalClone(this.conversationsById.get(id));
+    }
+    async conversations(_ctx) {
+        return [...this.conversationsById.values()].map(clone);
+    }
+    async entries(ids, _ctx) {
+        const out = new Map();
+        for (const id of ids) {
+            const e = this.entriesById.get(id);
+            if (e)
+                out.set(id, clone(e));
+        }
+        return out;
+    }
+    /** Newest-first, fork-aware: after this conversation's own entries, the parent's up to the fork point, and so on. */
+    async scanEntries(scan, _ctx) {
+        const out = [];
+        let conversationId = scan.conversationId;
+        let cap = scan.before;
+        while (conversationId !== undefined && out.length < scan.limit) {
+            const own = this.entriesByConversation.get(conversationId) ?? [];
+            for (let i = own.length - 1; i >= 0 && out.length < scan.limit; i--) {
+                const e = own[i];
+                if (cap !== undefined && e.id >= cap)
+                    continue;
+                if (scan.kind !== undefined && e.kind !== scan.kind)
+                    continue;
+                if (scan.withHead && e.head === undefined)
+                    continue;
+                out.push(clone(e));
+            }
+            const c = this.conversationsById.get(conversationId);
+            conversationId = c?.parent?.conversationId;
+            cap = c?.parent === undefined ? undefined : Math.min(cap ?? Infinity, c.parent.at + 1);
+        }
+        return out;
+    }
+    async task(id, _ctx) {
+        return optionalClone(this.tasksById.get(id));
+    }
+    async scanTasks(scan, _ctx) {
+        const out = [];
+        for (const t of this.tasksById.values()) {
+            if (scan.conversationId !== undefined && t.conversationId !== scan.conversationId)
+                continue;
+            if (scan.status !== undefined && !scan.status.includes(t.status))
+                continue;
+            if (scan.kind !== undefined && t.kind !== scan.kind)
+                continue;
+            out.push(clone(t));
+        }
+        return out;
+    }
+    async input(id, _ctx) {
+        return optionalClone(this.inputsById.get(id));
+    }
+    async inputByRequest(conversationId, requestId, _ctx) {
+        return optionalClone(this.inputsByRequest.get(`${conversationId}:${requestId}`));
+    }
+    async doc(ref, _ctx) {
+        if (ref.doc === "session")
+            return this.sessionDoc === undefined ? { plugins: {} } : structuredClone(this.sessionDoc);
+        const log = ref.doc === "rewindable"
+            ? this.rewindableLog.get(ref.conversationId)?.map((r) => r.ops)
+            : this.stickyLog.get(ref.conversationId);
+        if (log === undefined)
+            return undefined;
+        return clone(this.fold(log));
+    }
+    /**
+     * Commit-granular history: the rewindable state after the atomic commit that contains
+     * entry `at`, walking the fork chain for entries owned by ancestors.
+     */
+    async docAsOf(conversationId, at, _ctx) {
+        const owner = this.entriesById.get(at)?.conversationId;
+        if (owner === undefined)
+            return undefined;
+        const chain = [];
+        let c = this.conversationsById.get(conversationId);
+        while (c !== undefined && c.id !== owner) {
+            chain.push(c.id);
+            c = c.parent ? this.conversationsById.get(c.parent.conversationId) : undefined;
+        }
+        if (c === undefined)
+            return undefined;
+        const seqAt = this.entrySeq.get(at) ?? 0;
+        const log = (this.rewindableLog.get(owner) ?? []).filter((r) => r.seq <= seqAt).map((r) => r.ops);
+        return log.length === 0 ? undefined : clone(this.fold(log));
+    }
+    fold(log) {
+        let start = 0;
+        for (let i = log.length - 1; i >= 0; i--)
+            if (isBase(log[i])) {
+                start = i;
+                break;
+            }
+        let state = {};
+        for (let i = start; i < log.length; i++)
+            state = applyImmutable(state, log[i]);
+        return state;
+    }
+    async truncate(ref, _ctx) {
+        if (ref.doc !== "sticky")
+            return;
+        const log = this.stickyLog.get(ref.conversationId);
+        if (log === undefined)
+            return;
+        let start = 0;
+        for (let i = log.length - 1; i >= 0; i--)
+            if (isBase(log[i])) {
+                start = i;
+                break;
+            }
+        log.splice(0, start);
+    }
+    async close(_ctx) {
+        this.closed = true;
+    }
+}
+function clone(value) {
+    return JSON.parse(JSON.stringify(value));
+}
+function optionalClone(value) {
+    return value === undefined ? undefined : clone(value);
+}
+//# sourceMappingURL=memory.js.map

package/dist/harness/pico3/memory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory.js","sourceRoot":"","sources":["../../../src/harness/pico3/memory.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,cAAc,EAAE,MAAM,EAAW,MAAM,6BAA6B,CAAC;AAgB9E;;;;;;GAMG;AACH,MAAM,OAAO,aAAa;IACN,iBAAiB,GAAG,IAAI,GAAG,EAAoB,CAAC;IAChD,WAAW,GAAG,IAAI,GAAG,EAAa,CAAC;IACnC,qBAAqB,GAAG,IAAI,GAAG,EAAe,CAAC,CAAC,YAAY;IAC5D,SAAS,GAAG,IAAI,GAAG,EAAY,CAAC;IAChC,UAAU,GAAG,IAAI,GAAG,EAAa,CAAC;IAClC,eAAe,GAAG,IAAI,GAAG,EAAiB,CAAC;IAC9D,4FAA4F;IACzE,aAAa,GAAG,IAAI,GAAG,EAAiC,CAAC;IACzD,SAAS,GAAG,IAAI,GAAG,EAAc,CAAC;IAC3C,UAAU,CAAyB;IAC1B,QAAQ,GAAG,IAAI,GAAG,EAAW,CAAC,CAAC,gCAA8B;IACtE,WAAW,GAAG,CAAC,CAAC;IAChB,GAAG,GAAQ,CAAC,CAAC;IACf,MAAM,GAAG,KAAK,CAAC;IAEvB,MAAM,GAAO;QACZ,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC;IAAA,CAC1B;IACS,SAAS,CAAC,CAAK,EAAE;QAC1B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IAAA,CACjD;IAED,KAAK,CAAC,MAAM,CAAC,MAAwB,EAAE,IAAa,EAAgB;QACnE,IAAI,IAAI,CAAC,MAAM;YAAE,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;QACnD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,6BAA6B;QACrE,MAAM,EAAE,CAAC;QACT,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,OAAO,GAAG,CAAC;IAAA,CACX;IAED,8FAA8F;IACpF,KAAK,CAAC,MAAwB,EAAE,GAAQ,EAAc;QAC/D,MAAM,GAAG,GAAmB,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAM,CAAC;QAC9B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,MAAM,KAAK,GAAG,CAAC,EAAM,EAAE,IAAY,EAAE,EAAE,CAAC;YACvC,IAAI,CAAC,MAAM,CAAC,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,gBAAgB,EAAE,EAAE,CAAC,CAAC;YACvF,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,QAAQ,EAAE,6BAA6B,CAAC,CAAC;YACrF,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChB,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAAA,CAC5B,CAAC;QACF,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACxB,QAAQ,CAAC,CAAC,IAAI,EAAE,CAAC;gBAChB,KAAK,cAAc,EAAE,CAAC;oBACrB,IAAI,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,CAAC;wBAChD,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC,YAAY,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC7D,KAAK,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,EAAE,cAAc,CAAC,CAAC;oBACzC,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;oBAChC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;wBACd,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBACpC,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;oBAAA,CACzC,CAAC,CAAC;oBACH,MAAM;gBACP,CAAC;gBACD,KAAK,OAAO,EAAE,CAAC;oBACd,IAAI,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;wBAAE,MAAM,IAAI,KAAK,CAAC,SAAS,CAAC,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;oBACpF,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;oBAC3B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;oBACzB,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;wBACd,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBAC9B,CACC,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAC;4BAChD,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,cAAc,CAAE,CAC3E,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACV,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;oBAAA,CAC7B,CAAC,CAAC;oBACH,MAAM;gBACP,CAAC;gBACD,KAAK,MAAM,EAAE,CAAC;oBACb,IAAI,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;wBAAE,MAAM,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,IAAI,CAAC,EAAE,SAAS,CAAC,CAAC;oBAC/E,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;oBACzB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;oBACxB,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;oBAC5C,MAAM;gBACP,CAAC;gBACD,KAAK,YAAY,EAAE,CAAC;oBACnB,MAAM,IAAI,GACT,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;wBAC9B,CAAC,GAAG,MAAM,CAAC;6BACT,MAAM,CAAC,CAAC,CAAC,EAAyC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;6BACvE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,IAAI,CAAC;oBAC/C,IAAI,IAAI,KAAK,SAAS;wBAAE,MAAM,IAAI,KAAK,CAAC,0BAA0B,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;oBAChF,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;oBACzB,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;wBACd,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;wBACtC,MAAM,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,MAAM,EAAE,GAAG,CAAC,CAAC;wBAChC,MAAM,IAAI,GAAG,EAAE,GAAG,GAAG,EAAE,GAAG,MAAM,EAAU,CAAC;wBAC3C,IAAI,CAAC,CAAC,UAAU,KAAK,IAAI;4BAAE,OAAQ,IAAiC,CAAC,UAAU,CAAC;wBAChF,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;oBAAA,CAC/B,CAAC,CAAC;oBACH,MAAM;gBACP,CAAC;gBACD,KAAK,OAAO,EAAE,CAAC;oBACd,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;oBACzB,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;wBAAE,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;oBACrD,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;wBACd,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;wBAC7B,IAAI,CAAC,CAAC,SAAS,KAAK,SAAS;4BAAE,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,cAAc,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;oBAAA,CACjG,CAAC,CAAC;oBACH,MAAM;gBACP,CAAC;gBACD,KAAK,KAAK,EAAE,CAAC;oBACZ,MAAM,GAAG,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACzB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;oBACvB,IAAI,GAAG,CAAC,GAAG,KAAK,SAAS;wBACxB,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;4BACd,IAAI,CAAC,UAAU,GAAG,cAAc,CAC/B,CAAC,IAAI,CAAC,UAAU,IAAI,EAAE,OAAO,EAAE,EAAE,EAAE,CAAe,EAClD,CAAC,CACa,CAAC;wBAAA,CAChB,CAAC,CAAC;yBACC,IAAI,GAAG,CAAC,GAAG,KAAK,YAAY;wBAChC,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CACb,CACC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC;4BAC1C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,CAAE,CACvE,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CACvB,CAAC;;wBAEF,GAAG,CAAC,IAAI,CAAC,GAAG,EAAE,CACb,CACC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC;4BACtC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,CAAE,CACnE,CAAC,IAAI,CAAC,CAAC,CAAC,CACT,CAAC;oBACH,MAAM;gBACP,CAAC;YACF,CAAC;QACF,CAAC;QACD,OAAO,GAAG,EAAE,CAAC;YACZ,KAAK,MAAM,EAAE,IAAI,GAAG;gBAAE,EAAE,EAAE,CAAC;YAC3B,IAAI,CAAC,SAAS,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;QAAA,CAC1B,CAAC;IAAA,CACF;IAED,KAAK,CAAC,YAAY,CAAC,EAAM,EAAE,IAAc,EAAE;QAC1C,OAAO,aAAa,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAAA,CACrD;IACD,KAAK,CAAC,aAAa,CAAC,IAAc,EAAE;QACnC,OAAO,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAAA,CACvD;IACD,KAAK,CAAC,OAAO,CAAC,GAAkB,EAAE,IAAc,EAAE;QACjD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAa,CAAC;QACjC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACtB,MAAM,CAAC,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACnC,IAAI,CAAC;gBAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,GAAG,CAAC;IAAA,CACX;IACD,qHAAqH;IACrH,KAAK,CAAC,WAAW,CAAC,IAAe,EAAE,IAAc,EAAE;QAClD,MAAM,GAAG,GAAY,EAAE,CAAC;QACxB,IAAI,cAAc,GAAmB,IAAI,CAAC,cAAc,CAAC;QACzD,IAAI,GAAG,GAAmB,IAAI,CAAC,MAAM,CAAC;QACtC,OAAO,cAAc,KAAK,SAAS,IAAI,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;YAChE,MAAM,GAAG,GAAG,IAAI,CAAC,qBAAqB,CAAC,GAAG,CAAC,cAAc,CAAC,IAAI,EAAE,CAAC;YACjE,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBACrE,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;gBAClB,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,IAAI,GAAG;oBAAE,SAAS;gBAC/C,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;oBAAE,SAAS;gBAC9D,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS;oBAAE,SAAS;gBACpD,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YACpB,CAAC;YACD,MAAM,CAAC,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;YACrD,cAAc,GAAG,CAAC,EAAE,MAAM,EAAE,cAAc,CAAC;YAC3C,GAAG,GAAG,CAAC,EAAE,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,QAAQ,EAAE,CAAC,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;QACxF,CAAC;QACD,OAAO,GAAG,CAAC;IAAA,CACX;IACD,KAAK,CAAC,IAAI,CAAC,EAAM,EAAE,IAAc,EAAE;QAClC,OAAO,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAAA,CAC7C;IACD,KAAK,CAAC,SAAS,CAAC,IAAc,EAAE,IAAc,EAAE;QAC/C,MAAM,GAAG,GAAW,EAAE,CAAC;QACvB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YACzC,IAAI,IAAI,CAAC,cAAc,KAAK,SAAS,IAAI,CAAC,CAAC,cAAc,KAAK,IAAI,CAAC,cAAc;gBAAE,SAAS;YAC5F,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC;gBAAE,SAAS;YAC3E,IAAI,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;gBAAE,SAAS;YAC9D,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,GAAG,CAAC;IAAA,CACX;IACD,KAAK,CAAC,KAAK,CAAC,EAAM,EAAE,IAAc,EAAE;QACnC,OAAO,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAAA,CAC9C;IACD,KAAK,CAAC,cAAc,CAAC,cAAkB,EAAE,SAAiB,EAAE,IAAc,EAAE;QAC3E,OAAO,aAAa,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,GAAG,cAAc,IAAI,SAAS,EAAE,CAAC,CAAC,CAAC;IAAA,CACjF;IAED,KAAK,CAAC,GAAG,CAAC,GAAW,EAAE,IAAc,EAAmC;QACvE,IAAI,GAAG,CAAC,GAAG,KAAK,SAAS;YACxB,OAAO,IAAI,CAAC,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC3F,MAAM,GAAG,GACR,GAAG,CAAC,GAAG,KAAK,YAAY;YACvB,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;YAC/D,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAC3C,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACxC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAAA,CAC7B;IACD;;;OAGG;IACH,KAAK,CAAC,OAAO,CAAC,cAAkB,EAAE,EAAM,EAAE,IAAc,EAAmC;QAC1F,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC;QACvD,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QAC1C,MAAM,KAAK,GAAS,EAAE,CAAC;QACvB,IAAI,CAAC,GAA6B,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QAC7E,OAAO,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,EAAE,KAAK,KAAK,EAAE,CAAC;YAC1C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACjB,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;QAChF,CAAC;QACD,IAAI,CAAC,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QACzC,MAAM,GAAG,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAClG,OAAO,GAAG,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IAAA,CAC5D;IACS,IAAI,CAAC,GAAW,EAAc;QACvC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YACvC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;gBACrB,KAAK,GAAG,CAAC,CAAC;gBACV,MAAM;YACP,CAAC;QACF,IAAI,KAAK,GAAe,EAAE,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,KAAK,GAAG,cAAc,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAE,CAAe,CAAC;QAC9F,OAAO,KAAK,CAAC;IAAA,CACb;IACD,KAAK,CAAC,QAAQ,CAAC,GAAW,EAAE,IAAc,EAAE;QAC3C,IAAI,GAAG,CAAC,GAAG,KAAK,QAAQ;YAAE,OAAO;QACjC,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,cAAc,CAAC,CAAC;QACnD,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO;QAC9B,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;YACvC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC;gBACrB,KAAK,GAAG,CAAC,CAAC;gBACV,MAAM;YACP,CAAC;QACF,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAAA,CACrB;IACD,KAAK,CAAC,KAAK,CAAC,IAAc,EAAE;QAC3B,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;IAAA,CACnB;CACD;AAED,SAAS,KAAK,CAAI,KAAQ,EAAK;IAC9B,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAM,CAAC;AAAA,CAC9C;AAED,SAAS,aAAa,CAAI,KAAoB,EAAiB;IAC9D,OAAO,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;AAAA,CACtD","sourcesContent":["import type { Context } from \"@earendil-works/chord\";\nimport { applyImmutable, isBase, type Op } from \"@earendil-works/chord/delta\";\nimport type {\n\tConversation,\n\tDocRef,\n\tEntry,\n\tEntryScan,\n\tId,\n\tInput,\n\tJsonObject,\n\tSeq,\n\tStorage,\n\tTask,\n\tTaskScan,\n\tWrite,\n} from \"./types.ts\";\n\n/**\n * In-memory Storage. The reference backend, and the read path of JsonlStorage.\n *\n * A batch is validated and staged in full before any table changes: one failed\n * batch changes no table, no document, no ID high-water, no sequence. Committed\n * IDs are never reused; IDs minted but never committed may be reused after reopen.\n */\nexport class MemoryStorage implements Storage {\n\tprotected readonly conversationsById = new Map<Id, Conversation>();\n\tprotected readonly entriesById = new Map<Id, Entry>();\n\tprotected readonly entriesByConversation = new Map<Id, Entry[]>(); // ascending\n\tprotected readonly tasksById = new Map<Id, Task>();\n\tprotected readonly inputsById = new Map<Id, Input>();\n\tprotected readonly inputsByRequest = new Map<string, Input>();\n\t/** Rewindable docs keep their full op history with the seq of each batch, for `docAsOf`. */\n\tprotected readonly rewindableLog = new Map<Id, { seq: Seq; ops: Op[] }[]>();\n\tprotected readonly stickyLog = new Map<Id, Op[][]>();\n\tprotected sessionDoc: JsonObject | undefined;\n\tprotected readonly entrySeq = new Map<Id, Seq>(); // entry id → seq of its batch\n\tprotected nextIdValue = 1;\n\tprotected seq: Seq = 0;\n\tprivate closed = false;\n\n\tmintId(): Id {\n\t\treturn this.nextIdValue++;\n\t}\n\tprotected setNextId(n: Id) {\n\t\tthis.nextIdValue = Math.max(this.nextIdValue, n);\n\t}\n\n\tasync commit(writes: readonly Write[], _ctx: Context): Promise<Seq> {\n\t\tif (this.closed) throw new Error(\"storage closed\");\n\t\tconst seq = this.seq + 1;\n\t\tconst staged = this.stage(writes, seq); // throws before any mutation\n\t\tstaged();\n\t\tthis.seq = seq;\n\t\treturn seq;\n\t}\n\n\t/** Validate the whole batch against the current tables; return a function that applies it. */\n\tprotected stage(writes: readonly Write[], seq: Seq): () => void {\n\t\tconst ops: (() => void)[] = [];\n\t\tconst created = new Set<Id>();\n\t\tlet maxId = 0;\n\t\tconst claim = (id: Id, what: string) => {\n\t\t\tif (!Number.isSafeInteger(id) || id <= 0) throw new Error(`${what}: invalid id ${id}`);\n\t\t\tif (created.has(id)) throw new Error(`${what}: id ${id} created twice in one batch`);\n\t\t\tcreated.add(id);\n\t\t\tmaxId = Math.max(maxId, id);\n\t\t};\n\t\tfor (const w of writes) {\n\t\t\tswitch (w.type) {\n\t\t\t\tcase \"conversation\": {\n\t\t\t\t\tif (this.conversationsById.has(w.conversation.id))\n\t\t\t\t\t\tthrow new Error(`conversation ${w.conversation.id} exists`);\n\t\t\t\t\tclaim(w.conversation.id, \"conversation\");\n\t\t\t\t\tconst c = clone(w.conversation);\n\t\t\t\t\tops.push(() => {\n\t\t\t\t\t\tthis.conversationsById.set(c.id, c);\n\t\t\t\t\t\tthis.entriesByConversation.set(c.id, []);\n\t\t\t\t\t});\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase \"entry\": {\n\t\t\t\t\tif (this.entriesById.has(w.entry.id)) throw new Error(`entry ${w.entry.id} exists`);\n\t\t\t\t\tclaim(w.entry.id, \"entry\");\n\t\t\t\t\tconst e = clone(w.entry);\n\t\t\t\t\tops.push(() => {\n\t\t\t\t\t\tthis.entriesById.set(e.id, e);\n\t\t\t\t\t\t(\n\t\t\t\t\t\t\tthis.entriesByConversation.get(e.conversationId) ??\n\t\t\t\t\t\t\tthis.entriesByConversation.set(e.conversationId, []).get(e.conversationId)!\n\t\t\t\t\t\t).push(e);\n\t\t\t\t\t\tthis.entrySeq.set(e.id, seq);\n\t\t\t\t\t});\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase \"task\": {\n\t\t\t\t\tif (this.tasksById.has(w.task.id)) throw new Error(`task ${w.task.id} exists`);\n\t\t\t\t\tclaim(w.task.id, \"task\");\n\t\t\t\t\tconst t = clone(w.task);\n\t\t\t\t\tops.push(() => this.tasksById.set(t.id, t));\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase \"task.patch\": {\n\t\t\t\t\tconst prev =\n\t\t\t\t\t\tthis.tasksById.get(w.patch.id) ??\n\t\t\t\t\t\t[...writes]\n\t\t\t\t\t\t\t.filter((x): x is Extract<Write, { type: \"task\" }> => x.type === \"task\")\n\t\t\t\t\t\t\t.find((x) => x.task.id === w.patch.id)?.task;\n\t\t\t\t\tif (prev === undefined) throw new Error(`patch for unknown task ${w.patch.id}`);\n\t\t\t\t\tconst p = clone(w.patch);\n\t\t\t\t\tops.push(() => {\n\t\t\t\t\t\tconst cur = this.tasksById.get(p.id)!;\n\t\t\t\t\t\tconst { id: _i, ...fields } = p;\n\t\t\t\t\t\tconst next = { ...cur, ...fields } as Task;\n\t\t\t\t\t\tif (p.checkpoint === null) delete (next as { checkpoint?: unknown }).checkpoint;\n\t\t\t\t\t\tthis.tasksById.set(p.id, next);\n\t\t\t\t\t});\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase \"input\": {\n\t\t\t\t\tconst i = clone(w.input);\n\t\t\t\t\tif (!this.inputsById.has(i.id)) claim(i.id, \"input\");\n\t\t\t\t\tops.push(() => {\n\t\t\t\t\t\tthis.inputsById.set(i.id, i);\n\t\t\t\t\t\tif (i.requestId !== undefined) this.inputsByRequest.set(`${i.conversationId}:${i.requestId}`, i);\n\t\t\t\t\t});\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tcase \"doc\": {\n\t\t\t\t\tconst ref = clone(w.ref);\n\t\t\t\t\tconst o = clone(w.ops);\n\t\t\t\t\tif (ref.doc === \"session\")\n\t\t\t\t\t\tops.push(() => {\n\t\t\t\t\t\t\tthis.sessionDoc = applyImmutable(\n\t\t\t\t\t\t\t\t(this.sessionDoc ?? { plugins: {} }) as JsonObject,\n\t\t\t\t\t\t\t\to,\n\t\t\t\t\t\t\t) as JsonObject;\n\t\t\t\t\t\t});\n\t\t\t\t\telse if (ref.doc === \"rewindable\")\n\t\t\t\t\t\tops.push(() =>\n\t\t\t\t\t\t\t(\n\t\t\t\t\t\t\t\tthis.rewindableLog.get(ref.conversationId) ??\n\t\t\t\t\t\t\t\tthis.rewindableLog.set(ref.conversationId, []).get(ref.conversationId)!\n\t\t\t\t\t\t\t).push({ seq, ops: o }),\n\t\t\t\t\t\t);\n\t\t\t\t\telse\n\t\t\t\t\t\tops.push(() =>\n\t\t\t\t\t\t\t(\n\t\t\t\t\t\t\t\tthis.stickyLog.get(ref.conversationId) ??\n\t\t\t\t\t\t\t\tthis.stickyLog.set(ref.conversationId, []).get(ref.conversationId)!\n\t\t\t\t\t\t\t).push(o),\n\t\t\t\t\t\t);\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn () => {\n\t\t\tfor (const op of ops) op();\n\t\t\tthis.setNextId(maxId + 1);\n\t\t};\n\t}\n\n\tasync conversation(id: Id, _ctx?: Context) {\n\t\treturn optionalClone(this.conversationsById.get(id));\n\t}\n\tasync conversations(_ctx?: Context) {\n\t\treturn [...this.conversationsById.values()].map(clone);\n\t}\n\tasync entries(ids: readonly Id[], _ctx?: Context) {\n\t\tconst out = new Map<Id, Entry>();\n\t\tfor (const id of ids) {\n\t\t\tconst e = this.entriesById.get(id);\n\t\t\tif (e) out.set(id, clone(e));\n\t\t}\n\t\treturn out;\n\t}\n\t/** Newest-first, fork-aware: after this conversation's own entries, the parent's up to the fork point, and so on. */\n\tasync scanEntries(scan: EntryScan, _ctx?: Context) {\n\t\tconst out: Entry[] = [];\n\t\tlet conversationId: Id | undefined = scan.conversationId;\n\t\tlet cap: Id | undefined = scan.before;\n\t\twhile (conversationId !== undefined && out.length < scan.limit) {\n\t\t\tconst own = this.entriesByConversation.get(conversationId) ?? [];\n\t\t\tfor (let i = own.length - 1; i >= 0 && out.length < scan.limit; i--) {\n\t\t\t\tconst e = own[i]!;\n\t\t\t\tif (cap !== undefined && e.id >= cap) continue;\n\t\t\t\tif (scan.kind !== undefined && e.kind !== scan.kind) continue;\n\t\t\t\tif (scan.withHead && e.head === undefined) continue;\n\t\t\t\tout.push(clone(e));\n\t\t\t}\n\t\t\tconst c = this.conversationsById.get(conversationId);\n\t\t\tconversationId = c?.parent?.conversationId;\n\t\t\tcap = c?.parent === undefined ? undefined : Math.min(cap ?? Infinity, c.parent.at + 1);\n\t\t}\n\t\treturn out;\n\t}\n\tasync task(id: Id, _ctx?: Context) {\n\t\treturn optionalClone(this.tasksById.get(id));\n\t}\n\tasync scanTasks(scan: TaskScan, _ctx?: Context) {\n\t\tconst out: Task[] = [];\n\t\tfor (const t of this.tasksById.values()) {\n\t\t\tif (scan.conversationId !== undefined && t.conversationId !== scan.conversationId) continue;\n\t\t\tif (scan.status !== undefined && !scan.status.includes(t.status)) continue;\n\t\t\tif (scan.kind !== undefined && t.kind !== scan.kind) continue;\n\t\t\tout.push(clone(t));\n\t\t}\n\t\treturn out;\n\t}\n\tasync input(id: Id, _ctx?: Context) {\n\t\treturn optionalClone(this.inputsById.get(id));\n\t}\n\tasync inputByRequest(conversationId: Id, requestId: string, _ctx?: Context) {\n\t\treturn optionalClone(this.inputsByRequest.get(`${conversationId}:${requestId}`));\n\t}\n\n\tasync doc(ref: DocRef, _ctx?: Context): Promise<JsonObject | undefined> {\n\t\tif (ref.doc === \"session\")\n\t\t\treturn this.sessionDoc === undefined ? { plugins: {} } : structuredClone(this.sessionDoc);\n\t\tconst log =\n\t\t\tref.doc === \"rewindable\"\n\t\t\t\t? this.rewindableLog.get(ref.conversationId)?.map((r) => r.ops)\n\t\t\t\t: this.stickyLog.get(ref.conversationId);\n\t\tif (log === undefined) return undefined;\n\t\treturn clone(this.fold(log));\n\t}\n\t/**\n\t * Commit-granular history: the rewindable state after the atomic commit that contains\n\t * entry `at`, walking the fork chain for entries owned by ancestors.\n\t */\n\tasync docAsOf(conversationId: Id, at: Id, _ctx?: Context): Promise<JsonObject | undefined> {\n\t\tconst owner = this.entriesById.get(at)?.conversationId;\n\t\tif (owner === undefined) return undefined;\n\t\tconst chain: Id[] = [];\n\t\tlet c: Conversation | undefined = this.conversationsById.get(conversationId);\n\t\twhile (c !== undefined && c.id !== owner) {\n\t\t\tchain.push(c.id);\n\t\t\tc = c.parent ? this.conversationsById.get(c.parent.conversationId) : undefined;\n\t\t}\n\t\tif (c === undefined) return undefined;\n\t\tconst seqAt = this.entrySeq.get(at) ?? 0;\n\t\tconst log = (this.rewindableLog.get(owner) ?? []).filter((r) => r.seq <= seqAt).map((r) => r.ops);\n\t\treturn log.length === 0 ? undefined : clone(this.fold(log));\n\t}\n\tprotected fold(log: Op[][]): JsonObject {\n\t\tlet start = 0;\n\t\tfor (let i = log.length - 1; i >= 0; i--)\n\t\t\tif (isBase(log[i]!)) {\n\t\t\t\tstart = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tlet state: JsonObject = {};\n\t\tfor (let i = start; i < log.length; i++) state = applyImmutable(state, log[i]!) as JsonObject;\n\t\treturn state;\n\t}\n\tasync truncate(ref: DocRef, _ctx?: Context) {\n\t\tif (ref.doc !== \"sticky\") return;\n\t\tconst log = this.stickyLog.get(ref.conversationId);\n\t\tif (log === undefined) return;\n\t\tlet start = 0;\n\t\tfor (let i = log.length - 1; i >= 0; i--)\n\t\t\tif (isBase(log[i]!)) {\n\t\t\t\tstart = i;\n\t\t\t\tbreak;\n\t\t\t}\n\t\tlog.splice(0, start);\n\t}\n\tasync close(_ctx?: Context) {\n\t\tthis.closed = true;\n\t}\n}\n\nfunction clone<T>(value: T): T {\n\treturn JSON.parse(JSON.stringify(value)) as T;\n}\n\nfunction optionalClone<T>(value: T | undefined): T | undefined {\n\treturn value === undefined ? undefined : clone(value);\n}\n"]}

package/dist/harness/pico3/scheduler.d.ts

@@ -0,0 +1,46 @@
+import type { Context } from "@earendil-works/chord";
+import type { Session } from "./session.ts";
+import { type AnyKind, type Id, type Input, type Invoker, type Runtime, type Task } from "./types.ts";
+export interface SchedulerDeps {
+    session: Session;
+    kinds: ReadonlyMap<string, AnyKind>;
+    runtime(task: Task, invoker: Extract<Invoker, {
+        type: "task";
+    }>, ctx: Context): Runtime;
+    onReport(error: unknown): void;
+    ctx: Context;
+}
+export declare class Scheduler {
+    private readonly deps;
+    private enabled;
+    private holds;
+    private dirty;
+    private draining;
+    private readonly invocations;
+    private readonly taskWaiters;
+    private readonly inputWaiters;
+    private readonly idleWaiters;
+    constructor(deps: SchedulerDeps);
+    resume(): void;
+    stop(): void;
+    hold(): () => void;
+    kick(): void;
+    private drain;
+    private reserveEligible;
+    private dispatch;
+    private lease;
+    private runPhases;
+    /** Mark, revoke, signal, join. The scheduler then reserves the fresh abort on its next drain. */
+    abortTask(id: Id, ctx: Context): Promise<"marked" | "terminal">;
+    waitForTask(id: Id, ctx: Context): Promise<Task>;
+    waitForInput(id: Id, ctx: Context): Promise<Input>;
+    private waiter;
+    waitForIdle(conversationId: Id | undefined, ctx: Context): Promise<void>;
+    private isIdle;
+    private checkIdle;
+    /** Signal every invocation and wait for them; nothing is written. */
+    joinAll(): Promise<void>;
+    quiescent(): boolean;
+    get liveInvocations(): number;
+}
+//# sourceMappingURL=scheduler.d.ts.map