@agentshouse/mdruntime 0.1.0-cde2b99d2fcbc → 0.1.0-ce131cb435f8b

package/dist/save.js

@@ -1,10 +1,12 @@
 import { definitionOf } from './model.js';
 import { apply, ATTACHMENT, links, parse, pointerSegments, references, relative, relativize, retarget, serialize, target, } from '@agentshouse/mdmodel';
 import { immutable, queuedFile, departure, } from './change.js';
-import { collectionOf, documentsOf, governing, validateCollection, } from './collection.js';
+import { available, changedCleanly, collectionOf, documentsOf, governing, referring, validateCollection, } from './collection.js';
 import { changeBatchIdentity } from './identity.js';
 import { overlay } from './overlay.js';
 import { covered, normalize } from './paths.js';
+import { differences } from './shared.js';
+import { ROW_WEIGHT, stepped } from './turn.js';
 function refuse(code, file, location) {
     return {
         kind: 'refused',
@@ -177,7 +179,7 @@ export function providerRewritten(batch, visible) {
         ...anticipated(batch.changes, batch.preconditions, rewritten.changes, visible),
     };
 }
-function incoming(collection, removed) {
+function* incoming(collection, removed, candidates) {
     const found = new Map();
     const note = (target, file) => {
         if (!removed.has(target))
@@ -186,7 +188,14 @@ function incoming(collection, removed) {
         referrers.add(file);
         found.set(target, referrers);
     };
-    for (const [path, document] of documentsOf(collection)) {
+    const read = function* (paths) {
+        for (const path of [...new Set(paths)].sort()) {
+            const document = collection.document(path);
+            if (document !== undefined)
+                yield [path, document];
+        }
+    };
+    for (const [path, document] of candidates === null ? documentsOf(collection) : read(candidates)) {
         const definition = definitionOf(governing(collection.composition, path), document.type);
         for (const { value, to } of definition === undefined ? [] : references(document, definition)) {
             if (to.includes(ATTACHMENT))
@@ -195,6 +204,7 @@ function incoming(collection, removed) {
             if (named !== null)
                 note(named, path);
         }
+        yield ROW_WEIGHT + collection.text[path].length;
     }
     const [first] = [...found.keys()].sort();
     if (first === undefined)
@@ -217,10 +227,13 @@ function affected(change) {
     return change.kind === 'move' ? [change.path, change.to] : [change.path];
 }
 function guard(changes, input) {
-    const existing = new Set([
-        ...Object.keys(input.visible.documents),
-        ...Object.keys(input.visible.binaries),
-    ]);
+    const overridden = new Map();
+    const existing = {
+        has: (path) => overridden.get(path) ??
+            (Object.hasOwn(input.visible.documents, path) || Object.hasOwn(input.visible.binaries, path)),
+        add: (path) => void overridden.set(path, true),
+        delete: (path) => void overridden.set(path, false),
+    };
     for (const [index, change] of changes.entries()) {
         for (const path of affected(change)) {
             const normalized = normalize(path);
@@ -275,7 +288,7 @@ function guard(changes, input) {
             continue;
         }
         if (change.kind === 'replace') {
-            if (!input.local && input.visible.revisions[change.path] === undefined) {
+            if (unrevised(input, change.path)) {
                 return refuse('unknown-revision', change.path);
             }
             continue;
@@ -289,6 +302,22 @@ function guard(changes, input) {
 function unrevised(input, path) {
     return (!input.local && input.queued?.has(path) !== true && input.visible.revisions[path] === undefined);
 }
+export function queuedDocuments(queue) {
+    const paths = new Set();
+    for (const batch of queue) {
+        for (const change of batch.changes) {
+            if (change.kind === 'binary')
+                continue;
+            if (change.kind === 'remove')
+                paths.delete(change.path);
+            else if (change.kind !== 'move')
+                paths.add(change.path);
+            else if (paths.delete(change.path))
+                paths.add(change.to);
+        }
+    }
+    return paths;
+}
 function identity(precondition) {
     const part = precondition.kind === 'field' || precondition.kind === 'section' ? precondition.name : '';
     return `${precondition.kind} ${precondition.path} ${part}`;
@@ -364,8 +393,8 @@ function preconditionsOf(changes, visible, bases) {
 function depth(path) {
     return path.split('/').length;
 }
-function exceeded(limits, changes, resulting) {
-    const written = changes.map((change) => (change.kind === 'move' ? change.to : change.path));
+function exceeded(limits, changes, effective, resulting) {
+    const written = effective.map((change) => (change.kind === 'move' ? change.to : change.path));
     const created = changes
         .filter((change) => change.kind === 'create' || change.kind === 'move' || change.kind === 'binary')
         .map((change) => (change.kind === 'move' ? change.to : change.path));
@@ -381,7 +410,7 @@ function exceeded(limits, changes, resulting) {
             return refuse('provider-limit', undefined, limit.name);
         }
         if (limit.name === 'document-size') {
-            const large = written.find((path) => (resulting.documents[path] ?? '').length > value);
+            const large = written.find((path) => new TextEncoder().encode(resulting.documents[path] ?? '').byteLength > value);
             if (large !== undefined)
                 return refuse('provider-limit', large, limit.name);
         }
@@ -449,12 +478,15 @@ function relativeChanges(input) {
         return { ...change, fields, sections };
     });
 }
-function unmodeledType(collection, composition) {
+function* unmodeledType(collection, composition) {
+    if (available(composition))
+        return false;
     for (const [path, document] of documentsOf(collection)) {
         if (document.type !== undefined &&
             document.type !== 'any' &&
             governing(composition, path).status === 'unavailable')
             return true;
+        yield ROW_WEIGHT + collection.text[path].length;
     }
     return false;
 }
@@ -718,13 +750,15 @@ export function joined(queue, owner, extra) {
     return { kind: 'joined', batch, queue: queue.map((item) => (item === owner ? batch : item)) };
 }
 export function limitedIn(queue, batch, limits, state) {
-    const limited = exceeded(limits, batch.changes, state(queue.slice(0, queue.indexOf(batch) + 1)));
+    const at = queue.indexOf(batch);
+    const limited = exceeded(limits, batch.changes, providerRewritten(batch, state(queue.slice(0, at))).changes, state(queue.slice(0, at + 1)));
     return limited?.kind === 'refused' ? limited.refusal : null;
 }
-export function buildBatch(input) {
+function* batching(input) {
     const changes = relativeChanges(input);
     const structural = changes.find((change) => change.kind === 'move' || change.kind === 'remove');
-    if (structural !== undefined && unmodeledType(input.visible.collection, input.composition))
+    if (structural !== undefined &&
+        (yield* unmodeledType(input.visible.collection, input.composition)))
         return refuse('model-unavailable', structural.path);
     if (changes.length === 0)
         return refuse('no-change');
@@ -739,9 +773,13 @@ export function buildBatch(input) {
     const resulting = overlay(input.visible, [
         { id: '', baseRoomVersion: input.baseRoomVersion, ...predicted },
     ]);
+    const clean = input.clean !== undefined && available(input.composition) ? input.clean : null;
     const removed = new Set(changes.filter((change) => change.kind === 'remove').map((change) => change.path));
     if (removed.size > 0) {
-        const referenced = incoming(collectionOf(resulting.documents, input.composition), removed);
+        const referrers = clean === null ? null : referring(clean, input.composition, removed);
+        const referenced = yield* incoming(collectionOf(resulting.documents, input.composition), removed, clean === null || referrers === null
+            ? null
+            : [...referrers, ...(yield* differences(clean.text, resulting.documents))]);
         if (referenced !== null)
             return referenced;
     }
@@ -751,15 +789,20 @@ export function buildBatch(input) {
         const parsed = parse(content);
         return parsed.ok && parsed.document.type !== undefined && parsed.document.type !== 'any';
     };
-    const typedPaths = [...new Set(predicted.changes.flatMap(affected))].filter((path) => typed(input.visible.documents[path]) || typed(resulting.documents[path]));
+    const touched = [...new Set(predicted.changes.flatMap(affected))];
+    const typedPaths = touched.filter((path) => typed(input.visible.documents[path]) || typed(resulting.documents[path]));
     const needsModel = typedPaths.length > 0;
     const withoutModel = typedPaths.find((path) => governing(input.composition, path).status === 'unavailable');
     if (withoutModel !== undefined)
         return refuse('model-unavailable', withoutModel);
-    const validationText = needsModel
-        ? resulting.documents
-        : Object.fromEntries(Object.entries(resulting.documents).filter(([path]) => predicted.changes.some((change) => affected(change).includes(path))));
-    const verdict = validateCollection(validationText, Object.keys(resulting.binaries), input.composition);
+    const verdict = clean !== null &&
+        (yield* changedCleanly({ text: resulting.documents, binaries: resulting.binaries }, clean, input.composition))
+        ? { verdict: 'accept' }
+        : yield* validateCollection(needsModel
+            ? resulting.documents
+            : Object.fromEntries(touched.flatMap((path) => resulting.documents[path] === undefined
+                ? []
+                : [[path, resulting.documents[path]]])), Object.keys(resulting.binaries), input.composition);
     if (verdict.verdict === 'refuse') {
         return {
             kind: 'refused',
@@ -772,7 +815,7 @@ export function buildBatch(input) {
             },
         };
     }
-    const limited = exceeded(input.providerLimits, changes, resulting);
+    const limited = exceeded(input.providerLimits, changes, predicted.changes, resulting);
     if (limited !== null)
         return limited;
     const validated = typedPaths
@@ -798,3 +841,6 @@ export function buildBatch(input) {
         }),
     };
 }
+export function buildBatch(input) {
+    return stepped(batching(input));
+}

package/dist/search.d.ts

@@ -1,12 +1,16 @@
+import type { ProviderRefusal } from './adapter.js';
 import type { ChangeSet } from './change-set.js';
-import { type Filter } from './query.js';
+import { type CoveredRoom, type Filter, type PendingRoom } from './query.js';
 import type { Open } from './open.js';
 export type DocumentPart = Open<'fields' | 'sections' | 'preamble' | 'path'>;
 export type SearchRequest = {
     text: string;
     documents?: Filter;
+    collection?: true;
     conversations?: readonly string[];
     limit?: number;
+    after?: string;
+    total?: true;
 };
 export type DocumentHit = {
     room: string;
@@ -21,10 +25,38 @@ export type MessageHit = {
     score: number;
     matches: Readonly<Record<string, readonly Open<'text'>[]>>;
 };
-export type SearchResult = {
+export type SearchCoverage = {
+    rooms: readonly CoveredRoom[];
+    conversations: readonly string[];
+    index: string;
+    overlay: readonly string[];
+};
+export type PendingConversation = {
+    conversation: string;
+    awaits: Open<'index'>;
+};
+export type SearchHits = {
     documents: readonly DocumentHit[];
     messages: readonly MessageHit[];
 };
+export type SearchWindow = SearchHits & {
+    next?: string;
+    total?: {
+        documents: number;
+        messages: number;
+    };
+};
+export type SearchPending = SearchHits & {
+    pending: readonly (PendingRoom | PendingConversation)[];
+    coverage: SearchCoverage;
+};
+export type SearchUndeclared = ProviderRefusal & {
+    kind: 'undeclared';
+};
+export type SearchResult = (SearchWindow & {
+    coverage: SearchCoverage;
+}) | SearchPending | SearchUndeclared;
+export declare function undeclaredSearch(): SearchUndeclared;
 export type SearchedDocument = {
     room: string;
     path: string;
@@ -39,24 +71,35 @@ export type SearchedMessage = {
     text: string;
 };
 export type SearchSource = {
-    documents(): readonly SearchedDocument[];
+    room(room: string): readonly string[];
     document(room: string, path: string): SearchedDocument | null;
-    messages(): readonly SearchedMessage[];
-    message(conversation: string, identity: string): SearchedMessage | null;
 };
+type HitCursor = readonly [number, string, string] | readonly [] | null;
 export type SearchPlan = {
     text: string;
     documents: unknown;
+    collection: boolean;
     conversations: readonly string[] | null;
     limit: number | null;
+    after: readonly [HitCursor, HitCursor] | null;
+    total: boolean;
 };
 export type SearchIndex = {
+    generation(): string;
+    rooms(): ReadonlySet<string>;
+    conversations(): ReadonlySet<string>;
+    indexRoom(room: string): Promise<void>;
+    indexMessages(conversation: string, messages: readonly SearchedMessage[], whole: boolean): void;
+    forget(rooms: readonly string[]): void;
     changed(set: ChangeSet): void;
+    changes(): number;
+    caughtUp(): Promise<void>;
     search(plan: SearchPlan, documents: readonly {
         room: string;
         path: string;
-    }[] | null): SearchResult;
+    }[] | null, conversations: readonly string[], rooms: ReadonlySet<string> | null, selections: ReadonlyMap<string, readonly string[]> | null): SearchWindow;
 };
 export declare function searchPlanOf(input: unknown): SearchPlan;
 export declare function createSearchIndex(source: SearchSource): SearchIndex;
+export {};
 //# sourceMappingURL=search.d.ts.map

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;AACzE,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEtC,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,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,eAAe,EAAE,MAAM,cAAc,CAAC;AACpD,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAEjD,OAAO,EAML,KAAK,WAAW,EAChB,KAAK,MAAM,EACX,KAAK,WAAW,EACjB,MAAM,YAAY,CAAC;AACpB,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAKtC,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,UAAU,CAAC,EAAE,IAAI,CAAC;IAClB,aAAa,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,KAAK,CAAC,EAAE,IAAI,CAAC;CACd,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,IAAI,CAAC,OAAO,CAAC,CAAA;CAAE,CAAC;AAElF,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,UAAU,GAAG;IACtC,IAAI,CAAC,EAAE,MAAM,CAAC;IACd,KAAK,CAAC,EAAE;QAAE,SAAS,EAAE,MAAM,CAAC;QAAC,QAAQ,EAAE,MAAM,CAAA;KAAE,CAAC;CACjD,CAAC;AAEF,MAAM,MAAM,aAAa,GAAG,UAAU,GAAG;IACvC,OAAO,EAAE,SAAS,CAAC,WAAW,GAAG,mBAAmB,CAAC,EAAE,CAAC;IACxD,QAAQ,EAAE,cAAc,CAAC;CAC1B,CAAC;AAEF,MAAM,MAAM,gBAAgB,GAAG,eAAe,GAAG;IAAE,IAAI,EAAE,YAAY,CAAA;CAAE,CAAC;AAExE,MAAM,MAAM,YAAY,GACpB,CAAC,YAAY,GAAG;IAAE,QAAQ,EAAE,cAAc,CAAA;CAAE,CAAC,GAC7C,aAAa,GACb,gBAAgB,CAAC;AAErB,wBAAgB,gBAAgB,IAAI,gBAAgB,CAOnD;AAED,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,KAAK,SAAS,GAAG,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,GAAG,SAAS,EAAE,GAAG,IAAI,CAAC;AAExE,MAAM,MAAM,UAAU,GAAG;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,OAAO,CAAC;IACnB,UAAU,EAAE,OAAO,CAAC;IACpB,aAAa,EAAE,SAAS,MAAM,EAAE,GAAG,IAAI,CAAC;IACxC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,KAAK,EAAE,SAAS,CAAC,SAAS,EAAE,SAAS,CAAC,GAAG,IAAI,CAAC;IAC9C,KAAK,EAAE,OAAO,CAAC;CAChB,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,EAChC,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,GAAG,IAAI,EACjC,UAAU,EAAE,WAAW,CAAC,MAAM,EAAE,SAAS,MAAM,EAAE,CAAC,GAAG,IAAI,GACxD,YAAY,CAAC;CACjB,CAAC;AAoDF,wBAAgB,YAAY,CAAC,KAAK,EAAE,OAAO,GAAG,UAAU,CAoBvD;AAoCD,wBAAgB,iBAAiB,CAAC,MAAM,EAAE,YAAY,GAAG,WAAW,CA+LnE"}

package/dist/search.js

@@ -1,5 +1,17 @@
 import MiniSearch from 'minisearch';
-import { invalid, known, limitOf, plain } from './query.js';
+import { indexGeneration } from './identity.js';
+import { flag, invalid, known, limitOf, plain, } from './query.js';
+import { beneath } from './paths.js';
+import { inUnits, ROW_WEIGHT } from './turn.js';
+import { decodedCursor } from './windows.js';
+export function undeclaredSearch() {
+    return {
+        kind: 'undeclared',
+        code: 'search-undeclared',
+        fields: { name: 'local_search' },
+        retryable: false,
+    };
+}
 const FIELDS = ['fields', 'sections', 'preamble', 'path', 'text'];
 function documentId(room, path) {
     return JSON.stringify(['document', room, path]);
@@ -16,10 +28,36 @@ function scalars(value) {
         return Object.values(value).flatMap(scalars);
     return [String(value)];
 }
+function hitCursor(input) {
+    if (input === null)
+        return null;
+    if (!Array.isArray(input))
+        return undefined;
+    if (input.length === 0)
+        return [];
+    const [score, first, second] = input;
+    return input.length === 3 &&
+        typeof score === 'number' &&
+        typeof first === 'string' &&
+        typeof second === 'string'
+        ? [score, first, second]
+        : undefined;
+}
+function searchAfter(input) {
+    if (input === undefined)
+        return null;
+    const decoded = typeof input === 'string' ? decodedCursor(input) : null;
+    const documents = decoded?.length === 2 ? hitCursor(decoded[0]) : undefined;
+    const messages = decoded?.length === 2 ? hitCursor(decoded[1]) : undefined;
+    if (documents === undefined || messages === undefined) {
+        invalid('after', 'expects the next an earlier search returned');
+    }
+    return [documents, messages];
+}
 export function searchPlanOf(input) {
     if (!plain(input))
         invalid('search', 'expects a search object');
-    known(input, ['text', 'documents', 'conversations', 'limit'], '');
+    known(input, ['text', 'documents', 'collection', 'conversations', 'limit', 'after', 'total'], '');
     if (typeof input.text !== 'string')
         invalid('text', 'expects text');
     const conversations = input.conversations;
@@ -30,20 +68,49 @@ export function searchPlanOf(input) {
     return {
         text: input.text,
         documents: input.documents,
+        collection: flag(input.collection, 'collection'),
         conversations: conversations ?? null,
         limit: limitOf(input.limit),
+        after: searchAfter(input.after),
+        total: flag(input.total, 'total'),
     };
 }
+function pair(left, right) {
+    if (left[0] !== right[0])
+        return left[0] < right[0] ? -1 : 1;
+    if (left[1] !== right[1])
+        return left[1] < right[1] ? -1 : 1;
+    return 0;
+}
+function hitWindow(found, cursor, limit, tie) {
+    if (cursor === null)
+        return { kept: [], cursor: null };
+    const start = cursor.length === 0
+        ? 0
+        : found.findIndex((hit) => hit.score < cursor[0] ||
+            (hit.score === cursor[0] && pair(tie(hit), [cursor[1], cursor[2]]) > 0));
+    const following = start === -1 ? [] : found.slice(start);
+    if (limit === null || following.length <= limit)
+        return { kept: following, cursor: null };
+    const kept = following.slice(0, limit);
+    const last = kept[kept.length - 1];
+    return { kept, cursor: last === undefined ? cursor : [last.score, ...tie(last)] };
+}
 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);
-        documents.set(id, { room: document.room, path: document.path, type: document.type });
-        built.add({
+        discard(id, documents);
+        index.add({
             id,
             fields: scalars(document.fields).join('\n'),
             sections: Object.entries(document.sections)
@@ -52,73 +119,151 @@ export function createSearchIndex(source) {
             preamble: document.preamble,
             path: document.path,
         });
+        documents.set(id, { room: document.room, path: document.path, type: document.type });
     }
-    function addMessage(built, message) {
+    function addMessage(message) {
         const id = messageId(message.conversation, message.identity);
+        discard(id, messages);
+        index.add({ id, text: message.text });
         messages.set(id, { conversation: message.conversation, identity: message.identity });
-        built.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, tie) {
+        const found = index.search(text, {
             filter: ({ id }) => {
                 const entry = entries.get(id);
                 return entry !== undefined && keep(entry, id);
             },
         });
-        return (limit === null ? found : found.slice(0, limit)).map(({ id, score, match }) => ({
+        found.sort((left, right) => right.score - left.score ||
+            pair(tie(entries.get(left.id)), tie(entries.get(right.id))));
+        return found.map(({ id, score, match }) => ({
             ...entries.get(id),
             score,
             match,
         }));
     }
     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, after, total }, selected, named, within, selections) {
             const chosen = selected === null
                 ? null
                 : new Set(selected.map(({ room, path }) => documentId(room, path)));
+            const asked = new Set(named);
+            const documentTie = ({ room, path }) => [room, path];
+            const messageTie = ({ conversation, identity }) => [conversation, identity];
+            const foundDocuments = ranked(text, documents, ({ room, path }, id) => (chosen === null || chosen.has(id)) &&
+                (within === null || within.has(room)) &&
+                !(selections?.get(room) ?? []).some((root) => beneath(root, path)), documentTie);
+            const foundMessages = ranked(text, messages, ({ conversation }) => asked.has(conversation), messageTie);
+            const [documentsAfter, messagesAfter] = after ?? [[], []];
+            const documentWindow = hitWindow(foundDocuments, documentsAfter, limit, documentTie);
+            const messageWindow = hitWindow(foundMessages, messagesAfter, limit, messageTie);
+            const more = documentWindow.cursor !== null || messageWindow.cursor !== null;
             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: documentWindow.kept.map(({ match, ...hit }) => ({
+                    ...hit,
+                    matches: match,
+                })),
+                messages: messageWindow.kept.map(({ match, ...hit }) => ({
+                    ...hit,
+                    matches: match,
+                })),
+                ...(more ? { next: JSON.stringify([documentWindow.cursor, messageWindow.cursor]) } : {}),
+                ...(total
+                    ? { total: { documents: foundDocuments.length, messages: foundMessages.length } }
+                    : {}),
             };
         },
     };

package/dist/seed.d.ts

@@ -0,0 +1,16 @@
+import type { KeyedResult } from './observation.js';
+import type { QueryRows } from './query.js';
+export type EntrySeed = {
+    readonly at: Readonly<Record<string, string>>;
+    readonly queries: readonly {
+        readonly query: unknown;
+        readonly rows: QueryRows;
+    }[];
+};
+export type Seeded = {
+    readonly rows: QueryRows;
+    readonly at: Readonly<Record<string, string>>;
+};
+export declare function entrySeedOf(value: unknown): EntrySeed | null;
+export declare function seededResult(seed: Seeded): KeyedResult;
+//# sourceMappingURL=seed.d.ts.map

package/dist/seed.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"seed.d.ts","sourceRoot":"","sources":["../src/seed.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,KAAK,EAA4C,SAAS,EAAE,MAAM,YAAY,CAAC;AAGtF,MAAM,MAAM,SAAS,GAAG;IACtB,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC9C,QAAQ,CAAC,OAAO,EAAE,SAAS;QAAE,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;QAAC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAA;KAAE,EAAE,CAAC;CACpF,CAAC;AAEF,MAAM,MAAM,MAAM,GAAG;IAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IAAC,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAA;CAAE,CAAC;AAwCjG,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,SAAS,GAAG,IAAI,CAe5D;AAED,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,WAAW,CAoBtD"}