@agentshouse/mdruntime 0.1.0-cacb4c3f6734e → 0.1.0-cb0eb0d87ff49

package/dist/search.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../src/search.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACjD,OAAO,EAAkC,KAAK,MAAM,EAAE,MAAM,YAAY,CAAC;AAEzE,MAAM,MAAM,YAAY,GAAG,QAAQ,GAAG,UAAU,GAAG,UAAU,GAAG,MAAM,CAAC;AAEvE,MAAM,MAAM,aAAa,GAAG;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,aAAa,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,CAAC;AAEF,MAAM,MAAM,WAAW,GAAG;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,YAAY,EAAE,CAAC,CAAC,CAAC;CAC5D,CAAC;AAEF,MAAM,MAAM,UAAU,GAAG;IACvB,YAAY,EAAE,MAAM,CAAC;IACrB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,CAAC,CAAC;CACtD,CAAC;AAEF,MAAM,MAAM,YAAY,GAAG;IACzB,SAAS,EAAE,SAAS,WAAW,EAAE,CAAC;IAClC,QAAQ,EAAE,SAAS,UAAU,EAAE,CAAC;CACjC,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IAC1C,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;CAC5C,CAAC;AAEF,MAAM,MAAM,eAAe,GAAG;IAAE,YAAY,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC;AAEvF,MAAM,MAAM,YAAY,GAAG;IACzB,SAAS,IAAI,SAAS,gBAAgB,EAAE,CAAC;IACzC,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,gBAAgB,GAAG,IAAI,CAAC;IAC9D,QAAQ,IAAI,SAAS,eAAe,EAAE,CAAC;IACvC,OAAO,CAAC,YAAY,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,eAAe,GAAG,IAAI,CAAC;CACzE,CAAC;AAEF,MAAM,MAAM,UAAU,GAAG;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,OAAO,CAAC;IACnB,aAAa,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;IACxC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;CACtB,CAAC;AAEF,MAAM,MAAM,WAAW,GAAG;IACxB,OAAO,CAAC,GAAG,EAAE,SAAS,GAAG,IAAI,CAAC;IAC9B,MAAM,CACJ,IAAI,EAAE,UAAU,EAChB,SAAS,EAAE,SAAS;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,EAAE,GAAG,IAAI,GAC1D,YAAY,CAAC;CACjB,CAAC;AA4BF,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,UAAU,CAiBvD;AAMD,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,YAAY,GAAG,WAAW,CAyGnE"}
+{"version":3,"file":"search.d.ts","sourceRoot":"","sources":["../src/search.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAEjD,OAAO,EAKL,KAAK,WAAW,EAChB,KAAK,MAAM,EACX,KAAK,WAAW,EACjB,MAAM,YAAY,CAAC;AACpB,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAGtC,MAAM,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,GAAG,UAAU,GAAG,UAAU,GAAG,MAAM,CAAC,CAAC;AAE7E,MAAM,MAAM,aAAa,GAAG;IAC1B,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,aAAa,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,KAAK,CAAC,EAAE,MAAM,CAAC;CAChB,CAAC;AAEF,MAAM,MAAM,WAAW,GAAG;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,YAAY,EAAE,CAAC,CAAC,CAAC;CAC5D,CAAC;AAEF,MAAM,MAAM,UAAU,GAAG;IACvB,YAAY,EAAE,MAAM,CAAC;IACrB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,SAAS,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;CAC5D,CAAC;AAEF,MAAM,MAAM,cAAc,GAAG;IAC3B,KAAK,EAAE,SAAS,WAAW,EAAE,CAAC;IAC9B,aAAa,EAAE,SAAS,MAAM,EAAE,CAAC;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;CAC5B,CAAC;AAEF,MAAM,MAAM,mBAAmB,GAAG;IAAE,YAAY,EAAE,MAAM,CAAC;IAAC,MAAM,EAAE,OAAO,CAAA;CAAE,CAAC;AAE5E,MAAM,MAAM,aAAa,GAAG;IAAE,OAAO,EAAE,SAAS,CAAC,WAAW,GAAG,mBAAmB,CAAC,EAAE,CAAA;CAAE,CAAC;AAExF,MAAM,MAAM,UAAU,GAAG;IACvB,SAAS,EAAE,SAAS,WAAW,EAAE,CAAC;IAClC,QAAQ,EAAE,SAAS,UAAU,EAAE,CAAC;CACjC,CAAC;AAEF,MAAM,MAAM,YAAY,GAAG,CAAC,UAAU,GAAG;IAAE,QAAQ,EAAE,cAAc,CAAA;CAAE,CAAC,GAAG,aAAa,CAAC;AAEvF,MAAM,MAAM,gBAAgB,GAAG;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC;IAC1C,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;CAC5C,CAAC;AAEF,MAAM,MAAM,eAAe,GAAG;IAAE,YAAY,EAAE,MAAM,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC;AAEvF,MAAM,MAAM,YAAY,GAAG;IACzB,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,SAAS,MAAM,EAAE,CAAC;IACtC,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,gBAAgB,GAAG,IAAI,CAAC;CAC/D,CAAC;AAEF,MAAM,MAAM,UAAU,GAAG;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,OAAO,CAAC;IACnB,aAAa,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;IACxC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;CACtB,CAAC;AAEF,MAAM,MAAM,WAAW,GAAG;IACxB,UAAU,IAAI,MAAM,CAAC;IACrB,KAAK,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;IAC7B,aAAa,IAAI,WAAW,CAAC,MAAM,CAAC,CAAC;IACrC,SAAS,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;IACvC,aAAa,CAAC,YAAY,EAAE,MAAM,EAAE,QAAQ,EAAE,SAAS,eAAe,EAAE,EAAE,KAAK,EAAE,OAAO,GAAG,IAAI,CAAC;IAChG,MAAM,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;IACvC,OAAO,CAAC,GAAG,EAAE,SAAS,GAAG,IAAI,CAAC;IAC9B,OAAO,IAAI,MAAM,CAAC;IAClB,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAC1B,MAAM,CACJ,IAAI,EAAE,UAAU,EAChB,SAAS,EAAE,SAAS;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,EAAE,GAAG,IAAI,EAC3D,aAAa,EAAE,SAAS,MAAM,EAAE,GAC/B,UAAU,CAAC;CACf,CAAC;AA4BF,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,UAAU,CAiBvD;AAMD,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,YAAY,GAAG,WAAW,CAiKnE"}

package/dist/search.js

@@ -1,5 +1,7 @@
 import MiniSearch from 'minisearch';
-import { invalid, known, limitOf, plain } from './query.js';
+import { indexGeneration } from './identity.js';
+import { invalid, known, limitOf, plain, } from './query.js';
+import { inUnits, ROW_WEIGHT } from './turn.js';
 const FIELDS = ['fields', 'sections', 'preamble', 'path', 'text'];
 function documentId(room, path) {
     return JSON.stringify(['document', room, path]);
@@ -35,15 +37,22 @@ export function searchPlanOf(input) {
     };
 }
 export function createSearchIndex(source) {
-    let index = null;
+    const generation = indexGeneration();
+    const index = new MiniSearch({ fields: FIELDS });
     const documents = new Map();
     const messages = new Map();
+    const rooms = new Set();
+    const filling = new Set();
+    const conversations = new Set();
+    const acquiring = new Set();
     const changedDocuments = new Map();
-    const changedMessages = new Map();
-    function addDocument(built, document) {
+    let changes = 0;
+    function addDocument(document) {
         const id = documentId(document.room, document.path);
+        if (documents.has(id))
+            index.discard(id);
         documents.set(id, { room: document.room, path: document.path, type: document.type });
-        built.add({
+        index.add({
             id,
             fields: scalars(document.fields).join('\n'),
             sections: Object.entries(document.sections)
@@ -53,42 +62,47 @@ export function createSearchIndex(source) {
             path: document.path,
         });
     }
-    function addMessage(built, message) {
+    function addMessage(message) {
         const id = messageId(message.conversation, message.identity);
+        if (messages.has(id))
+            index.discard(id);
         messages.set(id, { conversation: message.conversation, identity: message.identity });
-        built.add({ id, text: message.text });
+        index.add({ id, text: message.text });
     }
-    function current() {
-        if (index === null) {
-            const built = new MiniSearch({ fields: FIELDS });
-            for (const document of source.documents())
-                addDocument(built, document);
-            for (const message of source.messages())
-                addMessage(built, message);
-            index = built;
-            return built;
+    function discard(id, entries) {
+        if (entries.delete(id))
+            index.discard(id);
+    }
+    function* pending() {
+        for (;;) {
+            const next = changedDocuments.entries().next();
+            if (next.done === true)
+                return;
+            changedDocuments.delete(next.value[0]);
+            yield next.value;
         }
-        const built = index;
-        for (const [id, { room, path }] of changedDocuments) {
-            if (documents.delete(id))
-                built.discard(id);
+    }
+    let catching = null;
+    function caughtUp() {
+        if (catching !== null)
+            return catching;
+        const running = inUnits(pending(), ([id, { room, path }]) => {
+            discard(id, documents);
             const document = source.document(room, path);
-            if (document !== null)
-                addDocument(built, document);
-        }
-        changedDocuments.clear();
-        for (const [id, { conversation, identity }] of changedMessages) {
-            if (messages.delete(id))
-                built.discard(id);
-            const message = source.message(conversation, identity);
-            if (message !== null)
-                addMessage(built, message);
-        }
-        changedMessages.clear();
-        return built;
+            if (document === null)
+                return ROW_WEIGHT;
+            addDocument(document);
+            return Object.values(document.sections).reduce((total, text) => total + text.length, ROW_WEIGHT + document.preamble.length);
+        });
+        if (!(running instanceof Promise))
+            return Promise.resolve();
+        catching = running.finally(() => {
+            catching = null;
+        });
+        return catching;
     }
-    function ranked(built, text, entries, keep, limit) {
-        const found = built.search(text, {
+    function ranked(text, entries, keep, limit) {
+        const found = index.search(text, {
             filter: ({ id }) => {
                 const entry = entries.get(id);
                 return entry !== undefined && keep(entry, id);
@@ -101,24 +115,75 @@ export function createSearchIndex(source) {
         }));
     }
     return {
-        changed(set) {
-            if (index === null)
+        generation: () => generation,
+        rooms: () => rooms,
+        conversations: () => conversations,
+        async indexRoom(room) {
+            if (rooms.has(room) || filling.has(room))
                 return;
+            filling.add(room);
+            try {
+                await inUnits(source.room(room), (path) => {
+                    const document = filling.has(room) ? source.document(room, path) : null;
+                    if (document === null)
+                        return ROW_WEIGHT;
+                    addDocument(document);
+                    return Object.values(document.sections).reduce((total, text) => total + text.length, ROW_WEIGHT + document.preamble.length);
+                });
+                if (filling.has(room))
+                    rooms.add(room);
+            }
+            finally {
+                filling.delete(room);
+            }
+        },
+        indexMessages(conversation, arriving, whole) {
+            for (const message of arriving)
+                addMessage(message);
+            if (!whole) {
+                acquiring.add(conversation);
+                return;
+            }
+            acquiring.delete(conversation);
+            conversations.add(conversation);
+        },
+        forget(leaving) {
+            const gone = new Set(leaving);
+            for (const [id, entry] of documents)
+                if (gone.has(entry.room))
+                    discard(id, documents);
+            for (const room of leaving) {
+                rooms.delete(room);
+                filling.delete(room);
+            }
+        },
+        changed(set) {
+            changes += 1;
             for (const { locator, path } of set.documents) {
-                changedDocuments.set(documentId(locator, path), { room: locator, path });
+                if (rooms.has(locator) || filling.has(locator)) {
+                    changedDocuments.set(documentId(locator, path), { room: locator, path });
+                }
             }
-            for (const { conversation, identity } of set.messages) {
-                changedMessages.set(messageId(conversation, identity), { conversation, identity });
+            for (const { conversation, identity, text } of set.messages) {
+                if (!conversations.has(conversation) && !acquiring.has(conversation))
+                    continue;
+                const id = messageId(conversation, identity);
+                if (text === null)
+                    discard(id, messages);
+                else
+                    addMessage({ conversation, identity, text });
             }
         },
-        search({ text, conversations, limit }, selected) {
-            const built = current();
+        changes: () => changes,
+        caughtUp,
+        search({ text, limit }, selected, named) {
             const chosen = selected === null
                 ? null
                 : new Set(selected.map(({ room, path }) => documentId(room, path)));
+            const asked = new Set(named);
             return {
-                documents: ranked(built, text, documents, (_entry, id) => chosen === null || chosen.has(id), limit).map(({ match, ...hit }) => ({ ...hit, matches: match })),
-                messages: ranked(built, text, messages, ({ conversation }) => conversations === null || conversations.includes(conversation), limit).map(({ match, ...hit }) => ({ ...hit, matches: match })),
+                documents: ranked(text, documents, (_entry, id) => chosen === null || chosen.has(id), limit).map(({ match, ...hit }) => ({ ...hit, matches: match })),
+                messages: ranked(text, messages, ({ conversation }) => asked.has(conversation), limit).map(({ match, ...hit }) => ({ ...hit, matches: match })),
             };
         },
     };

package/dist/shared.d.ts

@@ -0,0 +1,11 @@
+export type Paths<V> = Readonly<Record<string, V>>;
+type Weigh<V> = (key: string, value: V) => number;
+export declare function shared<V>(map: Paths<V>): Paths<V>;
+export declare function patched<V>(base: Paths<V>, set: Iterable<readonly [string, V]>, removed?: Iterable<string>): Paths<V>;
+export declare function tally<V>(map: Paths<V>, weigh: Weigh<V>): number;
+export declare function sizeOf<V>(map: Paths<V>): number;
+export declare function differing<V>(left: Paths<V>, right: Paths<V>, same?: (left: V, right: V) => boolean): ReadonlySet<string>;
+export declare function drafted<V>(base: Paths<V>): Record<string, V>;
+export declare function settled<V>(draft: Record<string, V>): Paths<V>;
+export {};
+//# sourceMappingURL=shared.d.ts.map

package/dist/shared.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"shared.d.ts","sourceRoot":"","sources":["../src/shared.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,KAAK,CAAC,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC;AAkBnD,KAAK,KAAK,CAAC,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,KAAK,MAAM,CAAC;AA6LlD,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAEjD;AAED,wBAAgB,OAAO,CAAC,CAAC,EACvB,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EACd,GAAG,EAAE,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EACnC,OAAO,GAAE,QAAQ,CAAC,MAAM,CAAM,GAC7B,KAAK,CAAC,CAAC,CAAC,CA8BV;AAED,wBAAgB,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAY/D;AAED,wBAAgB,MAAM,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAE/C;AAuCD,wBAAgB,SAAS,CAAC,CAAC,EACzB,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,EACd,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,EACf,IAAI,GAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,KAAK,OAAmB,GAC/C,WAAW,CAAC,MAAM,CAAC,CAcrB;AAMD,wBAAgB,OAAO,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,CAiD5D;AAED,wBAAgB,OAAO,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAS7D"}

package/dist/shared.js

@@ -0,0 +1,368 @@
+const BITS = 5;
+const MASK = (1 << BITS) - 1;
+const roots = new WeakMap();
+const tallies = new WeakMap();
+function hashOf(key) {
+    let hash = 0x811c9dc5;
+    for (let index = 0; index < key.length; index += 1) {
+        hash ^= key.charCodeAt(index);
+        hash = Math.imul(hash, 0x01000193);
+    }
+    return hash >>> 0;
+}
+function isLeaf(node) {
+    return 'key' in node;
+}
+function isCollision(node) {
+    return 'leaves' in node;
+}
+function fragment(hash, shift) {
+    return (hash >>> shift) & MASK;
+}
+function count(bits) {
+    let left = bits - ((bits >>> 1) & 0x55555555);
+    left = (left & 0x33333333) + ((left >>> 2) & 0x33333333);
+    return (((left + (left >>> 4)) & 0x0f0f0f0f) * 0x01010101) >>> 24;
+}
+function slot(bitmap, bit) {
+    return count(bitmap & (bit - 1));
+}
+function lookup(root, key) {
+    const hash = hashOf(key);
+    let node = root.node;
+    let shift = 0;
+    while (node !== undefined) {
+        if (isLeaf(node))
+            return node.key === key ? node : undefined;
+        if (isCollision(node))
+            return node.leaves.find((leaf) => leaf.key === key);
+        const bit = 1 << fragment(hash, shift);
+        if ((node.bitmap & bit) === 0)
+            return undefined;
+        node = node.children[slot(node.bitmap, bit)];
+        shift += BITS;
+    }
+    return undefined;
+}
+function branchOf(node, shift) {
+    return { bitmap: 1 << fragment(node.hash, shift), children: [node] };
+}
+function joined(left, right, shift) {
+    if (left.hash === right.hash) {
+        const leaves = isCollision(left) ? left.leaves : [left];
+        return { hash: right.hash, leaves: [...leaves, right] };
+    }
+    return put(branchOf(left, shift), right, shift);
+}
+function put(node, leaf, shift) {
+    if (node === undefined)
+        return leaf;
+    if (isLeaf(node)) {
+        if (node.key !== leaf.key)
+            return joined(node, leaf, shift);
+        return node.value === leaf.value ? node : leaf;
+    }
+    if (isCollision(node)) {
+        if (node.hash !== leaf.hash)
+            return joined(node, leaf, shift);
+        const at = node.leaves.findIndex((held) => held.key === leaf.key);
+        if (at === -1)
+            return { hash: node.hash, leaves: [...node.leaves, leaf] };
+        if (node.leaves[at].value === leaf.value)
+            return node;
+        return {
+            hash: node.hash,
+            leaves: node.leaves.map((held, index) => (index === at ? leaf : held)),
+        };
+    }
+    const bit = 1 << fragment(leaf.hash, shift);
+    const at = slot(node.bitmap, bit);
+    if ((node.bitmap & bit) === 0) {
+        return {
+            bitmap: node.bitmap | bit,
+            children: [...node.children.slice(0, at), leaf, ...node.children.slice(at)],
+        };
+    }
+    const child = node.children[at];
+    const next = put(child, leaf, shift + BITS);
+    if (next === child)
+        return node;
+    return {
+        bitmap: node.bitmap,
+        children: node.children.map((held, index) => (index === at ? next : held)),
+    };
+}
+function lone(node) {
+    if (node.children.length !== 1)
+        return null;
+    const [only] = node.children;
+    return isLeaf(only) || isCollision(only) ? only : null;
+}
+function taken(node, hash, key, shift) {
+    if (isLeaf(node))
+        return node.key === key ? undefined : node;
+    if (isCollision(node)) {
+        const leaves = node.leaves.filter((leaf) => leaf.key !== key);
+        if (leaves.length === node.leaves.length)
+            return node;
+        return leaves.length === 1 ? leaves[0] : { hash: node.hash, leaves };
+    }
+    const bit = 1 << fragment(hash, shift);
+    if ((node.bitmap & bit) === 0)
+        return node;
+    const at = slot(node.bitmap, bit);
+    const child = node.children[at];
+    const next = taken(child, hash, key, shift + BITS);
+    if (next === child)
+        return node;
+    if (next === undefined) {
+        if (node.children.length === 1)
+            return undefined;
+        const rest = {
+            bitmap: node.bitmap & ~bit,
+            children: node.children.filter((_, index) => index !== at),
+        };
+        return lone(rest) ?? rest;
+    }
+    const replaced = {
+        bitmap: node.bitmap,
+        children: node.children.map((held, index) => (index === at ? next : held)),
+    };
+    return lone(replaced) ?? replaced;
+}
+function* leavesOf(node) {
+    if (node === undefined)
+        return;
+    if (isLeaf(node)) {
+        yield node;
+        return;
+    }
+    if (isCollision(node)) {
+        yield* node.leaves;
+        return;
+    }
+    for (const child of node.children)
+        yield* leavesOf(child);
+}
+function facade(root) {
+    let keys;
+    const target = {};
+    const map = new Proxy(target, {
+        get(held, property, receiver) {
+            if (typeof property === 'string') {
+                const leaf = lookup(root, property);
+                if (leaf !== undefined)
+                    return leaf.value;
+            }
+            return Reflect.get(held, property, receiver);
+        },
+        has(held, property) {
+            return ((typeof property === 'string' && lookup(root, property) !== undefined) ||
+                Reflect.has(held, property));
+        },
+        ownKeys() {
+            keys ??= [...leavesOf(root.node)].map((leaf) => leaf.key);
+            return keys;
+        },
+        getOwnPropertyDescriptor(_held, property) {
+            if (typeof property !== 'string')
+                return undefined;
+            const leaf = lookup(root, property);
+            if (leaf === undefined)
+                return undefined;
+            return { value: leaf.value, writable: false, enumerable: true, configurable: true };
+        },
+        set: () => false,
+        defineProperty: () => false,
+        deleteProperty: () => false,
+    });
+    roots.set(map, root);
+    return map;
+}
+function rootOf(map) {
+    const held = roots.get(map);
+    if (held !== undefined)
+        return held;
+    let node;
+    let size = 0;
+    for (const [key, value] of Object.entries(map)) {
+        node = put(node, { key, hash: hashOf(key), value }, 0);
+        size += 1;
+    }
+    return { node, size };
+}
+export function shared(map) {
+    return roots.has(map) ? map : facade(rootOf(map));
+}
+export function patched(base, set, removed = []) {
+    const root = rootOf(base);
+    const weighed = [...(tallies.get(base) ?? [])];
+    let node = root.node;
+    let size = root.size;
+    const shift = (key, before, after) => {
+        for (const entry of weighed) {
+            entry[1] +=
+                (after === undefined ? 0 : entry[0](key, after)) -
+                    (before === undefined ? 0 : entry[0](key, before.value));
+        }
+    };
+    for (const key of removed) {
+        if (node === undefined)
+            break;
+        const before = lookup({ node, size }, key);
+        if (before === undefined)
+            continue;
+        node = taken(node, before.hash, key, 0);
+        size -= 1;
+        shift(key, before, undefined);
+    }
+    for (const [key, value] of set) {
+        const before = lookup({ node, size }, key);
+        node = put(node, { key, hash: hashOf(key), value }, 0);
+        if (before === undefined)
+            size += 1;
+        shift(key, before, value);
+    }
+    if (node === root.node && roots.has(base))
+        return base;
+    const map = facade({ node, size });
+    if (weighed.length > 0)
+        tallies.set(map, new Map(weighed));
+    return map;
+}
+export function tally(map, weigh) {
+    const held = tallies.get(map);
+    const known = held?.get(weigh);
+    if (known !== undefined)
+        return known;
+    let total = 0;
+    for (const [key, value] of Object.entries(map))
+        total += weigh(key, value);
+    if (roots.has(map)) {
+        const kept = held ?? new Map();
+        kept.set(weigh, total);
+        tallies.set(map, kept);
+    }
+    return total;
+}
+export function sizeOf(map) {
+    return roots.get(map)?.size ?? Object.keys(map).length;
+}
+function collect(node, into) {
+    for (const leaf of leavesOf(node))
+        into.add(leaf.key);
+}
+function compared(left, right, shift, same, into) {
+    if (left === right)
+        return;
+    if (left === undefined)
+        return collect(right, into);
+    if (right === undefined)
+        return collect(left, into);
+    if (!isLeaf(left) && !isCollision(left) && !isLeaf(right) && !isCollision(right)) {
+        const bits = left.bitmap | right.bitmap;
+        for (let remaining = bits; remaining !== 0; remaining &= remaining - 1) {
+            const bit = remaining & -remaining;
+            compared((left.bitmap & bit) === 0 ? undefined : left.children[slot(left.bitmap, bit)], (right.bitmap & bit) === 0 ? undefined : right.children[slot(right.bitmap, bit)], shift + BITS, same, into);
+        }
+        return;
+    }
+    const before = new Map([...leavesOf(left)].map((leaf) => [leaf.key, leaf.value]));
+    for (const leaf of leavesOf(right)) {
+        const held = before.get(leaf.key);
+        before.delete(leaf.key);
+        if (held === undefined || !same(held, leaf.value))
+            into.add(leaf.key);
+    }
+    for (const key of before.keys())
+        into.add(key);
+}
+export function differing(left, right, same = Object.is) {
+    const into = new Set();
+    if (left === right)
+        return into;
+    const leftRoot = roots.get(left);
+    const rightRoot = roots.get(right);
+    if (leftRoot !== undefined && rightRoot !== undefined) {
+        compared(leftRoot.node, rightRoot.node, 0, same, into);
+        return into;
+    }
+    for (const key of Object.keys(left)) {
+        if (!Object.hasOwn(right, key) || !same(left[key], right[key]))
+            into.add(key);
+    }
+    for (const key of Object.keys(right))
+        if (!Object.hasOwn(left, key))
+            into.add(key);
+    return into;
+}
+const drafts = new WeakMap();
+const GONE = Symbol('gone');
+export function drafted(base) {
+    const written = new Map();
+    const read = (key) => {
+        const held = written.get(key);
+        if (held === GONE)
+            return undefined;
+        return held ?? (Object.hasOwn(base, key) ? base[key] : undefined);
+    };
+    const draft = new Proxy({}, {
+        get(held, property, receiver) {
+            if (typeof property === 'string') {
+                const value = read(property);
+                if (value !== undefined)
+                    return value;
+            }
+            return Reflect.get(held, property, receiver);
+        },
+        has(held, property) {
+            return ((typeof property === 'string' && read(property) !== undefined) ||
+                Reflect.has(held, property));
+        },
+        ownKeys() {
+            const keys = new Set(Object.keys(base));
+            for (const [key, value] of written) {
+                if (value === GONE)
+                    keys.delete(key);
+                else
+                    keys.add(key);
+            }
+            return [...keys];
+        },
+        getOwnPropertyDescriptor(_held, property) {
+            if (typeof property !== 'string')
+                return undefined;
+            const value = read(property);
+            if (value === undefined)
+                return undefined;
+            return { value, writable: true, enumerable: true, configurable: true };
+        },
+        set(_held, property, value) {
+            if (typeof property !== 'string')
+                return false;
+            written.set(property, value);
+            return true;
+        },
+        deleteProperty(_held, property) {
+            if (typeof property !== 'string')
+                return false;
+            written.set(property, GONE);
+            return true;
+        },
+        defineProperty: () => false,
+    });
+    drafts.set(draft, { base, written });
+    return draft;
+}
+export function settled(draft) {
+    const held = drafts.get(draft);
+    const set = [];
+    const removed = [];
+    for (const [key, value] of held.written) {
+        if (value === GONE)
+            removed.push(key);
+        else
+            set.push([key, value]);
+    }
+    return patched(held.base, set, removed);
+}

package/dist/status.d.ts

@@ -1,3 +1,4 @@
+import type { Open } from './open.js';
 import type { ReturnReason } from './room-draft.js';
 export type AttentionEntry = {
     room: string;
@@ -5,7 +6,7 @@ export type AttentionEntry = {
     returned: ReturnReason;
 };
 export type SyncStatus = {
-    state: 'pending' | 'syncing' | 'synced';
+    state: Open<'pending' | 'syncing' | 'synced'>;
     lastCompleted: string | null;
     providerUnreachable: boolean;
     attentionRequired: readonly AttentionEntry[];
@@ -17,7 +18,6 @@ export type CycleProgress = {
 };
 export declare const STARTING: SyncStatus;
 export declare function transferring(status: SyncStatus): SyncStatus;
-export declare function settled(status: SyncStatus, progress: CycleProgress, at: string | null, queued: boolean, attention: Pick<SyncStatus, 'attentionRequired' | 'reset'>): SyncStatus;
 export declare function saving(status: SyncStatus): SyncStatus;
 export declare function same(one: SyncStatus, other: SyncStatus): boolean;
 //# sourceMappingURL=status.d.ts.map

package/dist/status.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"status.d.ts","sourceRoot":"","sources":["../src/status.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAEpD,MAAM,MAAM,cAAc,GAAG;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,YAAY,CAAC;CACxB,CAAC;AAEF,MAAM,MAAM,UAAU,GAAG;IACvB,KAAK,EAAE,SAAS,GAAG,SAAS,GAAG,QAAQ,CAAC;IACxC,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,mBAAmB,EAAE,OAAO,CAAC;IAC7B,iBAAiB,EAAE,SAAS,cAAc,EAAE,CAAC;IAC7C,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;CACtB,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG;IAC1B,QAAQ,EAAE,OAAO,CAAC;IAClB,SAAS,EAAE,OAAO,CAAC;CACpB,CAAC;AAEF,eAAO,MAAM,QAAQ,EAAE,UAMtB,CAAC;AAEF,wBAAgB,YAAY,CAAC,MAAM,EAAE,UAAU,GAAG,UAAU,CAE3D;AAED,wBAAgB,OAAO,CACrB,MAAM,EAAE,UAAU,EAClB,QAAQ,EAAE,aAAa,EACvB,EAAE,EAAE,MAAM,GAAG,IAAI,EACjB,MAAM,EAAE,OAAO,EACf,SAAS,EAAE,IAAI,CAAC,UAAU,EAAE,mBAAmB,GAAG,OAAO,CAAC,GACzD,UAAU,CAOZ;AAED,wBAAgB,MAAM,CAAC,MAAM,EAAE,UAAU,GAAG,UAAU,CAErD;AAED,wBAAgB,IAAI,CAAC,GAAG,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,GAAG,OAAO,CAQhE"}
+{"version":3,"file":"status.d.ts","sourceRoot":"","sources":["../src/status.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACtC,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,iBAAiB,CAAC;AAEpD,MAAM,MAAM,cAAc,GAAG;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,YAAY,CAAC;CACxB,CAAC;AAEF,MAAM,MAAM,UAAU,GAAG;IACvB,KAAK,EAAE,IAAI,CAAC,SAAS,GAAG,SAAS,GAAG,QAAQ,CAAC,CAAC;IAC9C,aAAa,EAAE,MAAM,GAAG,IAAI,CAAC;IAC7B,mBAAmB,EAAE,OAAO,CAAC;IAC7B,iBAAiB,EAAE,SAAS,cAAc,EAAE,CAAC;IAC7C,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;CACtB,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG;IAC1B,QAAQ,EAAE,OAAO,CAAC;IAClB,SAAS,EAAE,OAAO,CAAC;CACpB,CAAC;AAEF,eAAO,MAAM,QAAQ,EAAE,UAMtB,CAAC;AAEF,wBAAgB,YAAY,CAAC,MAAM,EAAE,UAAU,GAAG,UAAU,CAE3D;AAED,wBAAgB,MAAM,CAAC,MAAM,EAAE,UAAU,GAAG,UAAU,CAErD;AAED,wBAAgB,IAAI,CAAC,GAAG,EAAE,UAAU,EAAE,KAAK,EAAE,UAAU,GAAG,OAAO,CAQhE"}

package/dist/status.js

@@ -8,14 +8,6 @@ export const STARTING = {
 export function transferring(status) {
     return { ...status, state: 'syncing' };
 }
-export function settled(status, progress, at, queued, attention) {
-    return {
-        state: queued ? 'pending' : progress.complete ? 'synced' : status.state,
-        lastCompleted: progress.complete ? at : status.lastCompleted,
-        providerUnreachable: !progress.reachable,
-        ...attention,
-    };
-}
 export function saving(status) {
     return { ...status, state: 'pending' };
 }