@agentshouse/mdruntime 0.1.0-c5d3fa6fb67bc → 0.1.0-c63ad08fad0c3

package/dist/words.js

@@ -0,0 +1,150 @@
+const SPACELESS = /(?:[\p{Script=Han}\p{Script=Hiragana}\p{Script=Katakana}\p{Script=Thai}\p{Script=Lao}\p{Script=Khmer}\p{Script=Myanmar}\p{Script=Hangul}]\p{M}*)+/gu;
+const SPACELESS_TERM = /[\p{Script=Han}\p{Script=Hiragana}\p{Script=Katakana}\p{Script=Thai}\p{Script=Lao}\p{Script=Khmer}\p{Script=Myanmar}\p{Script=Hangul}]/u;
+const TOKEN = /[\p{L}\p{N}\p{M}\p{Co}]+/gu;
+const MARKED = /([\p{Script=Latin}\p{Script=Greek}\p{Script=Cyrillic}])\p{M}+/gu;
+const INFLECTED = /^[\p{Script=Cyrillic}\p{Script=Greek}]+$/u;
+const FOLD = /\p{M}+/gu;
+const ASCII = /^[\x00-\x7f]$/;
+const PREFIXED_LETTERS = 2;
+const INFLECTED_LETTERS = 4;
+const PHRASE_TERMS = { least: 2, most: 6 };
+const GRAPHEMES = new Intl.Segmenter(undefined, { granularity: 'grapheme' });
+function bigrams(run) {
+    const characters = Array.from(run);
+    if (characters.length < 2)
+        return ` ${run} `;
+    const pairs = [];
+    for (let index = 0; index + 1 < characters.length; index += 1) {
+        pairs.push(characters[index] + characters[index + 1]);
+    }
+    return ` ${pairs.join(' ')} `;
+}
+export function indexed(text) {
+    return text.normalize('NFKD').replace(MARKED, '$1').normalize('NFKC').replace(SPACELESS, bigrams);
+}
+function tokens(text) {
+    return [...text.matchAll(TOKEN)].map(([token]) => token.toLowerCase());
+}
+function quoted(token) {
+    return `"${token.replaceAll('"', '""')}"`;
+}
+function truncated(term) {
+    const letters = Array.from(term);
+    if (!INFLECTED.test(term) || letters.length < INFLECTED_LETTERS)
+        return null;
+    return letters.slice(0, letters.length - (letters.length >= 6 ? 2 : 1)).join('');
+}
+export function matchClauses(text) {
+    const terms = tokens(indexed(text));
+    if (terms.length === 0)
+        return null;
+    const unique = [...new Set(terms)];
+    const clauses = unique.map((term) => ({ text: quoted(term), kind: 'term', term }));
+    for (const term of unique) {
+        const stem = truncated(term);
+        if (stem !== null)
+            clauses.push({ text: `${quoted(stem)}*`, kind: 'stem', term });
+    }
+    const last = terms[terms.length - 1];
+    if (!/\s$/u.test(text) && Array.from(last).length >= PREFIXED_LETTERS) {
+        clauses.push({ text: `${quoted(last)}*`, kind: 'prefix', term: last });
+    }
+    if (terms.length >= PHRASE_TERMS.least && terms.length <= PHRASE_TERMS.most) {
+        clauses.push({ text: quoted(terms.join(' ')), kind: 'phrase', term: terms.join(' ') });
+    }
+    return clauses;
+}
+export function matchExpression(clauses) {
+    return clauses.map(({ text }) => text).join(' OR ');
+}
+function folded(text) {
+    return text.normalize('NFKD').replace(FOLD, '').toLowerCase();
+}
+export function queryTerms(text) {
+    return [...new Set(tokens(text.normalize('NFKC')).map(folded))];
+}
+function agrees(token, term) {
+    if (SPACELESS_TERM.test(term))
+        return token.includes(term);
+    if (token.startsWith(term))
+        return true;
+    return token.length >= 3 && term.startsWith(token.slice(0, Math.max(3, token.length - 2)));
+}
+function inside(token, offset, term) {
+    const pieces = [...GRAPHEMES.segment(token)];
+    const owner = [];
+    let joined = '';
+    for (const [at, { segment }] of pieces.entries()) {
+        const part = folded(segment);
+        joined += part;
+        for (let index = 0; index < part.length; index += 1)
+            owner.push(at);
+    }
+    const found = joined.indexOf(term);
+    if (found < 0)
+        return null;
+    const first = pieces[owner[found]];
+    const last = pieces[owner[found + term.length - 1]];
+    return { start: offset + first.index, end: offset + last.index + last.segment.length };
+}
+function locate(part, terms) {
+    for (const match of part.matchAll(TOKEN)) {
+        const token = folded(match[0]);
+        for (const term of terms) {
+            if (!agrees(token, term))
+                continue;
+            if (!SPACELESS_TERM.test(term)) {
+                return { start: match.index, end: match.index + match[0].length };
+            }
+            const found = inside(match[0], match.index, term);
+            if (found !== null)
+                return found;
+        }
+    }
+    return null;
+}
+function settled(part, index) {
+    if (index <= 0 || index >= part.length)
+        return true;
+    const before = part[index - 1];
+    const after = part[index];
+    if (before === '\n')
+        return true;
+    return ASCII.test(before) && ASCII.test(after) && !(before === '\r' && after === '\n');
+}
+function edgesAround(part, low, high) {
+    let from = Math.max(0, low);
+    while (!settled(part, from))
+        from -= 1;
+    let to = Math.min(part.length, high);
+    while (!settled(part, to))
+        to += 1;
+    const edges = [...GRAPHEMES.segment(part.slice(from, to))].map(({ index }) => from + index);
+    edges.push(to);
+    return edges;
+}
+export function snippet(part, terms, reach) {
+    const located = locate(part, terms);
+    if (located === null)
+        return null;
+    const edges = edgesAround(part, located.start - 2 * reach, located.end + 2 * reach);
+    const last = (limit) => edges.filter((edge) => edge <= limit).at(-1) ?? edges[0];
+    const first = (limit) => edges.find((edge) => edge >= limit) ?? edges[edges.length - 1];
+    const from = last(located.start);
+    const to = Math.max(first(Math.min(located.end, from + reach)), first(from + 1));
+    const start = first(Math.max(0, from - reach));
+    const end = last(Math.min(part.length, to + reach));
+    return { text: part.slice(start, end), at: [from - start, to - start] };
+}
+export function matched(part, terms) {
+    const found = new Set();
+    for (const match of part.matchAll(TOKEN)) {
+        const token = folded(match[0]);
+        for (const term of terms)
+            if (agrees(token, term))
+                found.add(term);
+        if (found.size === terms.length)
+            break;
+    }
+    return [...found];
+}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@agentshouse/mdruntime",
-  "version": "0.1.0-c5d3fa6fb67bc",
+  "version": "0.1.0-c63ad08fad0c3",
   "description": "The headless core of MD App",
   "license": "MIT",
   "type": "module",
@@ -32,6 +32,10 @@
       "types": "./dist/memory.d.ts",
       "default": "./dist/memory.js"
     },
+    "./tables": {
+      "types": "./dist/tables.d.ts",
+      "default": "./dist/tables.js"
+    },
     "./react": {
       "types": "./dist/react.d.ts",
       "default": "./dist/react.js"
@@ -40,6 +44,10 @@
       "types": "./dist/chat.d.ts",
       "default": "./dist/chat.js"
     },
+    "./digest": {
+      "types": "./dist/digest.d.ts",
+      "default": "./dist/digest.js"
+    },
     "./package.json": "./package.json"
   },
   "files": [
@@ -49,14 +57,12 @@
     "LICENSE"
   ],
   "dependencies": {
-    "@agentshouse/mdmodel": "0.1.0-cad192ab63d5f",
+    "@agentshouse/mdmodel": "0.1.0-cf77876799aa0",
     "@assistant-ui/react-markdown": "0.14.20",
-    "@tanstack/db": "0.9.2",
     "lucide-react": "1.47.0",
     "mdast-util-from-markdown": "2.0.3",
     "mdast-util-gfm": "3.1.0",
     "micromark-extension-gfm": "3.0.0",
-    "minisearch": "7.2.0",
     "radix-ui": "1.8.0",
     "remark-gfm": "4.0.1"
   },

package/dist/acquisition.d.ts

@@ -1,14 +0,0 @@
-export type RuntimeDemand = {
-    readonly whole: boolean;
-    readonly rooms: readonly string[];
-    readonly handles: readonly string[];
-    readonly conversations: boolean;
-};
-export declare const WHOLE_DEMAND: RuntimeDemand;
-export declare function demanded(demand: RuntimeDemand, room: {
-    readonly locator: string;
-    readonly handle: string;
-}): boolean;
-export declare function wider(next: RuntimeDemand, current: RuntimeDemand): boolean;
-export declare function narrower(next: RuntimeDemand, current: RuntimeDemand): boolean;
-//# sourceMappingURL=acquisition.d.ts.map

package/dist/acquisition.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"acquisition.d.ts","sourceRoot":"","sources":["../src/acquisition.ts"],"names":[],"mappings":"AAAA,MAAM,MAAM,aAAa,GAAG;IAC1B,QAAQ,CAAC,KAAK,EAAE,OAAO,CAAC;IACxB,QAAQ,CAAC,KAAK,EAAE,SAAS,MAAM,EAAE,CAAC;IAClC,QAAQ,CAAC,OAAO,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC,QAAQ,CAAC,aAAa,EAAE,OAAO,CAAC;CACjC,CAAC;AAEF,eAAO,MAAM,YAAY,EAAE,aAK1B,CAAC;AAEF,wBAAgB,QAAQ,CACtB,MAAM,EAAE,aAAa,EACrB,IAAI,EAAE;IAAE,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;CAAE,GAC1D,OAAO,CAIT;AAYD,wBAAgB,KAAK,CAAC,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,aAAa,GAAG,OAAO,CAE1E;AAED,wBAAgB,QAAQ,CAAC,IAAI,EAAE,aAAa,EAAE,OAAO,EAAE,aAAa,GAAG,OAAO,CAE7E"}

package/dist/acquisition.js

@@ -1,24 +0,0 @@
-export const WHOLE_DEMAND = {
-    whole: true,
-    rooms: [],
-    handles: [],
-    conversations: true,
-};
-export function demanded(demand, room) {
-    return (demand.whole || demand.rooms.includes(room.locator) || demand.handles.includes(room.handle));
-}
-function adds(next, current) {
-    if (current.whole)
-        return false;
-    if (next.whole)
-        return true;
-    return ((next.conversations && !current.conversations) ||
-        next.rooms.some((room) => !current.rooms.includes(room)) ||
-        next.handles.some((handle) => !current.handles.includes(handle)));
-}
-export function wider(next, current) {
-    return adds(next, current);
-}
-export function narrower(next, current) {
-    return adds(current, next);
-}

package/dist/read-side.d.ts

@@ -1,25 +0,0 @@
-import type { ChangeSet } from './change-set.js';
-import { type KeyedResult, type QueryMessage } from './observation.js';
-import type { PendingResult, Plan, QueryCoverage, QueryRows } from './query.js';
-import type { SearchedDocument } from './search.js';
-export type Cover = {
-    coverage: QueryCoverage;
-} | PendingResult;
-export type ReadSide = {
-    apply(set: ChangeSet): void;
-    recover(): void;
-    query<T>(plan: Plan, at: () => T): Promise<{
-        rows: QueryRows;
-        at: T;
-    }>;
-    watch(plan: Plan, identity: string, cover: () => Cover, deliver: (message: QueryMessage) => void): () => void;
-    room(room: string): readonly string[];
-    document(room: string, path: string): SearchedDocument | null;
-    close(): void;
-};
-export declare function reconciled(previous: KeyedResult, next: KeyedResult): {
-    keyed: KeyedResult;
-    message: QueryMessage;
-} | null;
-export declare function createReadSide(): ReadSide;
-//# sourceMappingURL=read-side.d.ts.map

package/dist/read-side.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"read-side.d.ts","sourceRoot":"","sources":["../src/read-side.ts"],"names":[],"mappings":"AAsBA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AACjD,OAAO,EAAE,KAAK,WAAW,EAAE,KAAK,YAAY,EAAe,MAAM,kBAAkB,CAAC;AACpF,OAAO,KAAK,EAOV,aAAa,EACb,IAAI,EAEJ,aAAa,EAGb,SAAS,EAIV,MAAM,YAAY,CAAC;AAGpB,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,aAAa,CAAC;AA4CpD,MAAM,MAAM,KAAK,GAAG;IAAE,QAAQ,EAAE,aAAa,CAAA;CAAE,GAAG,aAAa,CAAC;AAuBhE,MAAM,MAAM,QAAQ,GAAG;IACrB,KAAK,CAAC,GAAG,EAAE,SAAS,GAAG,IAAI,CAAC;IAC5B,OAAO,IAAI,IAAI,CAAC;IAChB,KAAK,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,OAAO,CAAC;QAAE,IAAI,EAAE,SAAS,CAAC;QAAC,EAAE,EAAE,CAAC,CAAA;KAAE,CAAC,CAAC;IACvE,KAAK,CACH,IAAI,EAAE,IAAI,EACV,QAAQ,EAAE,MAAM,EAChB,KAAK,EAAE,MAAM,KAAK,EAClB,OAAO,EAAE,CAAC,OAAO,EAAE,YAAY,KAAK,IAAI,GACvC,MAAM,IAAI,CAAC;IACd,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;IAC9D,KAAK,IAAI,IAAI,CAAC;CACf,CAAC;AAwWF,wBAAgB,UAAU,CACxB,QAAQ,EAAE,WAAW,EACrB,IAAI,EAAE,WAAW,GAChB;IAAE,KAAK,EAAE,WAAW,CAAC;IAAC,OAAO,EAAE,YAAY,CAAA;CAAE,GAAG,IAAI,CAuCtD;AAgBD,wBAAgB,cAAc,IAAI,QAAQ,CA+QzC"}