@agentshouse/mdruntime 0.1.0-c2c52158b7381 → 0.1.0-c2e8a6f99866d

package/dist/collection.js

@@ -1,12 +1,9 @@
-import { checkDocument, parseFrontmatter, references, sectionReferences, target, parse, resolves, validating, VERSION, } from '@agentshouse/mdmodel';
+import { parse, VERSION } from '@agentshouse/mdmodel';
 import { beneath, normalize } from './paths.js';
-import { sameTyping } from './model.js';
-import { differences, entriesIn, keysIn, patched, patching, shared, sizeOf, sortedKeys, } from './shared.js';
-import { after, finished, inUnits, ROW_WEIGHT } from './turn.js';
+import { keysIn, sortedKeys } from './shared.js';
+import { ROW_WEIGHT } from './turn.js';
 export const MD_MODEL = { identity: '@agentshouse/mdmodel', version: VERSION };
-const REFERENCE_WEIGHT = 4 * ROW_WEIGHT;
-const NO_TYPES = { types: {} };
-function selected(composition, path) {
+export function selected(composition, path) {
     return (composition.selection !== null &&
         composition.selection.roots.some((root) => beneath(root, path)));
 }
@@ -15,82 +12,38 @@ export function governing(composition, path) {
         ? composition.selection.model
         : composition.model;
 }
-const parsedIn = new WeakMap();
-function* carried(previous, text) {
-    const held = parsedIn.get(previous);
-    if (held === undefined)
-        return shared({});
-    const kept = yield* patching(held.base, held.added);
-    held.base = kept;
-    held.added = new Map();
-    return yield* patching(kept, [], yield* differences(previous.text, text));
-}
-function cachedIn(collection, path) {
-    const held = parsedIn.get(collection);
-    if (held === undefined)
-        return undefined;
-    if (held.added.has(path))
-        return held.added.get(path);
-    return Object.hasOwn(held.base, path) ? held.base[path] : undefined;
-}
-export function collectionOf(text, composition, previous) {
-    return finished(collecting(text, composition, previous));
-}
-export function* collecting(text, composition, previous) {
-    const parsed = {
-        base: previous === undefined ? shared({}) : yield* carried(previous, text),
-        added: new Map(),
-    };
-    const collection = {
+export function collectionOf(text, composition) {
+    const parsed = new Map();
+    return {
         text,
         composition,
         document(path) {
-            const held = cachedIn(collection, path);
-            if (held !== undefined)
-                return held ?? undefined;
+            if (parsed.has(path))
+                return parsed.get(path) ?? undefined;
             const content = text[path];
             if (content === undefined)
                 return undefined;
             const read = parse(content, path);
-            parsed.added.set(path, read.ok ? read.document : null);
+            parsed.set(path, read.ok ? read.document : null);
             return read.ok ? read.document : undefined;
         },
     };
-    parsedIn.set(collection, parsed);
-    return collection;
-}
-export function passingFrontmatter(collection, path) {
-    const held = cachedIn(collection, path);
-    if (held !== undefined)
-        return held ?? undefined;
-    const content = collection.text[path];
-    if (content === undefined)
-        return undefined;
-    const read = parseFrontmatter(content, path);
-    return read.ok ? read.frontmatter : undefined;
-}
-function* readIn(collection, paths) {
-    for (const path of paths) {
-        const held = cachedIn(collection, path);
-        if (held === null)
-            continue;
-        if (held !== undefined) {
-            yield [path, held];
-            continue;
-        }
-        const read = parse(collection.text[path], path);
-        if (read.ok)
-            yield [path, read.document];
-    }
 }
 export function* documentsOf(collection) {
-    return readIn(collection, yield* sortedKeys(collection.text));
+    const paths = yield* sortedKeys(collection.text);
+    return (function* () {
+        for (const path of paths) {
+            const document = collection.document(path);
+            if (document !== undefined)
+                yield [path, document];
+        }
+    })();
 }
-export function* unreadable(text, previous) {
-    const paths = previous === undefined ? yield* keysIn(text) : yield* differences(previous, text);
+export function* unreadable(text, paths = null) {
+    const named = paths ?? (yield* keysIn(text));
     let least = null;
-    for (const path of paths) {
-        const content = text[path];
+    for (const path of named) {
+        const content = Object.hasOwn(text, path) ? text[path] : undefined;
         if (content === undefined)
             continue;
         const read = parse(content, path);
@@ -104,298 +57,7 @@ export function* unreadable(text, previous) {
 export function validRoot(root) {
     return typeof root === 'string' && normalize(root) === root;
 }
-function* validateAgainst(documents, binaryTargets, model) {
-    if (model.status === 'unavailable') {
-        for (const [path, content] of documents) {
-            const parsed = parse(content);
-            if (parsed.ok && parsed.document.type !== undefined && parsed.document.type !== 'any')
-                return { verdict: 'refuse', rule: 'model-unavailable', file: path };
-            yield ROW_WEIGHT + content.length;
-        }
-    }
-    const steps = validating(documents, { binaryTargets, anyRoom: true }, model.status === 'unavailable' ? NO_TYPES : { types: model.types });
-    for (let step = steps.next();; step = steps.next()) {
-        if (step.done === true)
-            return step.value;
-        const { path, resolved } = step.value;
-        yield ROW_WEIGHT + documents.get(path).length + REFERENCE_WEIGHT * resolved;
-    }
-}
-export function* validateCollection(text, binaryTargets, composition) {
-    const collection = new Map();
-    const selection = new Map();
-    for (const [path, content] of entriesIn(text)) {
-        if (selected(composition, path))
-            selection.set(path, content);
-        else
-            collection.set(path, content);
-        yield ROW_WEIGHT;
-    }
-    const verdicts = [
-        yield* validateAgainst(collection, binaryTargets.filter((path) => !selected(composition, path)), composition.model),
-    ];
-    if (composition.selection !== null) {
-        verdicts.push(yield* validateAgainst(selection, binaryTargets.filter((path) => selected(composition, path)), composition.selection.model));
-    }
-    const refusals = verdicts.filter((verdict) => verdict.verdict === 'refuse');
-    if (refusals.length === 0)
-        return verdicts[0];
-    return refusals.find((refusal) => refusal.rule !== 'model-unavailable') ?? refusals[0];
-}
-const NO_REFERRERS = shared({});
-const referrersOf = new WeakMap();
-function typing(left, right) {
-    return (sameTyping(left.model, right.model) &&
-        (left.selection === null || right.selection === null
-            ? left.selection === right.selection
-            : sameTyping(left.selection.model, right.selection.model)) &&
-        JSON.stringify(left.selection?.roots ?? null) === JSON.stringify(right.selection?.roots ?? null));
-}
-function declared(content) {
-    if (content === undefined)
-        return undefined;
-    const read = parseFrontmatter(content);
-    return read.ok ? (read.frontmatter.type ?? 'any') : undefined;
-}
-function typedIn(content) {
-    const type = declared(content);
-    return type !== undefined && type !== 'any';
-}
-function modelOf(composition, path) {
-    const model = governing(composition, path);
-    return model.status === 'unavailable' ? null : { types: model.types };
-}
-function checked(path, content, composition) {
-    return checkDocument(path, content, modelOf(composition, path) ?? NO_TYPES, { anyRoom: true });
-}
-function resolvedBy(check) {
-    return check.ok ? check.references.length : 0;
-}
-function targetsOf(check) {
-    if (!check.ok)
-        return [];
-    return [...new Set(check.references.flatMap(({ target }) => (target === null ? [] : [target])))];
-}
-function referencedBy(path, content, composition) {
-    const model = modelOf(composition, path);
-    if (model === null)
-        return [];
-    const read = parseFrontmatter(content, path);
-    const type = read.ok ? read.frontmatter.type : undefined;
-    if (!read.ok || type === undefined || !Object.hasOwn(model.types, type))
-        return [];
-    const definition = model.types[type];
-    return [
-        ...new Set([
-            ...references(read.frontmatter, definition).flatMap(({ value }) => {
-                const found = target(path, value);
-                return found === null ? [] : [found];
-            }),
-            ...sectionReferences(path, content, definition).flatMap(({ target }) => target === null ? [] : [target]),
-        ]),
-    ];
-}
-function referrersOfTarget(index, target) {
-    return Object.hasOwn(index.referrers, target) ? index.referrers[target] : NO_REFERRERS;
-}
-function* reindexed(index, changed) {
-    const moved = new Map();
-    const movesOf = (target) => {
-        const held = moved.get(target) ?? { gained: [], lost: [] };
-        moved.set(target, held);
-        return held;
-    };
-    const targeting = [];
-    const targetless = [];
-    for (const [path, found] of changed) {
-        const before = Object.hasOwn(index.targets, path) ? index.targets[path] : [];
-        for (const target of before)
-            if (!found.includes(target))
-                movesOf(target).lost.push(path);
-        for (const target of found) {
-            if (!before.includes(target))
-                movesOf(target).gained.push([path, true]);
-        }
-        if (found.length > 0)
-            targeting.push([path, found]);
-        else
-            targetless.push(path);
-        yield ROW_WEIGHT * (1 + before.length + found.length);
-    }
-    const referred = [];
-    const unreferred = [];
-    for (const [target, { gained, lost }] of moved) {
-        const files = yield* patching(referrersOfTarget(index, target), gained, lost);
-        if (sizeOf(files) > 0)
-            referred.push([target, files]);
-        else
-            unreferred.push(target);
-    }
-    return {
-        composition: index.composition,
-        targets: yield* patching(index.targets, targeting, targetless),
-        referrers: yield* patching(index.referrers, referred, unreferred),
-    };
-}
-function storedIn(entries) {
-    let stored = shared({});
-    let unit = [];
-    return after(inUnits(entries, (entry) => {
-        unit.push(entry);
-        return ROW_WEIGHT;
-    }, () => {
-        stored = patched(stored, unit);
-        unit = [];
-    }), () => stored);
-}
-function storedReferrers(referrers) {
-    const sets = new Map();
-    let unit = new Map();
-    const pairs = function* () {
-        for (const [target, files] of referrers)
-            for (const file of files)
-                yield [target, file];
-    };
-    return after(inUnits(pairs(), ([target, file]) => {
-        const files = unit.get(target);
-        if (files === undefined)
-            unit.set(target, [file]);
-        else
-            files.push(file);
-        return ROW_WEIGHT;
-    }, () => {
-        for (const [target, files] of unit) {
-            sets.set(target, patched(sets.get(target) ?? NO_REFERRERS, files.map((file) => [file, true])));
-        }
-        unit = new Map();
-    }), () => storedIn(sets));
-}
-function heldIndex(held, composition) {
-    const index = referrersOf.get(held.text);
-    return index !== undefined && typing(index.composition, composition) ? index : null;
-}
-const indexing = new WeakMap();
-export function indexReferrers(held, composition) {
-    if (heldIndex(held, composition) !== null)
-        return;
-    const running = indexing.get(held.text);
-    if (running !== undefined)
-        return running;
-    const targets = new Map();
-    const referrers = new Map();
-    const filled = inUnits(entriesIn(held.text), ([path, content]) => {
-        const found = referencedBy(path, content, composition);
-        if (found.length > 0)
-            targets.set(path, found);
-        for (const target of found) {
-            const files = referrers.get(target);
-            if (files === undefined)
-                referrers.set(target, [path]);
-            else
-                files.push(path);
-        }
-        return ROW_WEIGHT + content.length + REFERENCE_WEIGHT * found.length;
-    });
-    const indexed = after(filled, () => after(storedIn(targets), (storedTargets) => after(storedReferrers(referrers), (stored) => {
-        referrersOf.set(held.text, { composition, targets: storedTargets, referrers: stored });
-    })));
-    if (!(indexed instanceof Promise))
-        return;
-    const building = indexed.finally(() => indexing.delete(held.text));
-    indexing.set(held.text, building);
-    return building;
-}
-export function referencesIndexed(held, composition) {
-    return heldIndex(held, composition) !== null;
-}
-export function* referring(held, composition, targets) {
-    const index = heldIndex(held, composition);
-    if (index === null)
-        return null;
-    const found = new Set();
-    for (const target of targets) {
-        for (const [file] of entriesIn(referrersOfTarget(index, target))) {
-            found.add(file);
-            yield ROW_WEIGHT;
-        }
-    }
-    return found;
-}
 export function available(composition) {
     return (composition.model.status !== 'unavailable' &&
         (composition.selection === null || composition.selection.model.status !== 'unavailable'));
 }
-export function* changedCleanly(next, previous, composition) {
-    if (!typing(previous.composition, composition))
-        return false;
-    const paths = new Set([
-        ...(yield* differences(previous.text, next.text)),
-        ...(yield* differences(previous.binaries, next.binaries, () => true)),
-    ]);
-    const binary = (path) => Object.hasOwn(next.binaries, path);
-    const within = (file) => (path) => selected(composition, path) === selected(composition, file);
-    const reaching = (file, check) => {
-        if (!check.ok)
-            return false;
-        const part = within(file);
-        return check.references.every((reference) => resolves(reference, (path) => (part(path) ? declared(next.text[path]) : undefined), (path) => part(path) && binary(path)));
-    };
-    const changedTargets = new Map();
-    const shifted = [];
-    const admitted = (path) => {
-        const now = next.text[path];
-        const was = previous.text[path];
-        const modeled = modelOf(composition, path) !== null;
-        if ((now === undefined) !== (was === undefined) ||
-            declared(now) !== declared(was) ||
-            binary(path) !== Object.hasOwn(previous.binaries, path)) {
-            shifted.push(path);
-        }
-        if (!modeled && typedIn(was) && !typedIn(now))
-            return null;
-        if (now === undefined) {
-            if (modeled)
-                changedTargets.set(path, []);
-            return 0;
-        }
-        if (binary(path))
-            return null;
-        if (!modeled) {
-            if (declared(now) === undefined)
-                return null;
-            if (typedIn(now))
-                return 0;
-            const check = checked(path, now, composition);
-            return check.ok ? resolvedBy(check) : null;
-        }
-        const check = checked(path, now, composition);
-        if (!reaching(path, check))
-            return null;
-        changedTargets.set(path, targetsOf(check));
-        return resolvedBy(check);
-    };
-    for (const path of paths) {
-        const resolved = admitted(path);
-        if (resolved === null)
-            return false;
-        yield ROW_WEIGHT + (next.text[path]?.length ?? 0) + REFERENCE_WEIGHT * resolved;
-    }
-    const index = heldIndex(previous, composition);
-    if (index === null && shifted.length > 0)
-        return false;
-    for (const target of shifted) {
-        const files = index === null ? NO_REFERRERS : referrersOfTarget(index, target);
-        for (const [file] of entriesIn(files)) {
-            if (paths.has(file))
-                continue;
-            const check = checked(file, next.text[file], composition);
-            if (!reaching(file, check))
-                return false;
-            yield ROW_WEIGHT + next.text[file].length + REFERENCE_WEIGHT * resolvedBy(check);
-        }
-    }
-    if (index !== null) {
-        referrersOf.set(next.text, changedTargets.size === 0 ? index : yield* reindexed(index, changedTargets));
-    }
-    return true;
-}

package/dist/compile.d.ts

@@ -0,0 +1,11 @@
+import type { Plan, QueryRows } from './query.js';
+import type { Connection } from './tables.js';
+export type QueryRoom = {
+    readonly locator: string;
+    readonly key: number;
+};
+export type QueryAnswer = QueryRows & {
+    readonly more?: string;
+};
+export declare function answerQuery(connection: Connection, plan: Plan, rooms: readonly QueryRoom[], budget?: number | null): QueryAnswer;
+//# sourceMappingURL=compile.d.ts.map

package/dist/compile.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"compile.d.ts","sourceRoot":"","sources":["../src/compile.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAOV,IAAI,EAGJ,SAAS,EAIV,MAAM,YAAY,CAAC;AAEpB,OAAO,KAAK,EAAE,UAAU,EAAc,MAAM,aAAa,CAAC;AAU1D,MAAM,MAAM,SAAS,GAAG;IAAE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAA;CAAE,CAAC;AA8pB3E,MAAM,MAAM,WAAW,GAAG,SAAS,GAAG;IAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,CAAA;CAAE,CAAC;AAmSjE,wBAAgB,WAAW,CACzB,UAAU,EAAE,UAAU,EACtB,IAAI,EAAE,IAAI,EACV,KAAK,EAAE,SAAS,SAAS,EAAE,EAC3B,MAAM,GAAE,MAAM,GAAG,IAAW,GAC3B,WAAW,CAiBb"}