@north-light/crouter 0.3.318 → 0.3.319

package/dist/core/memory/doc-link-grammar.js

@@ -1,109 +1,2 @@
-// doc-link-grammar.ts — crouter's parser for `[[canonical/name]]` memory links.
-// Memory commands and the daemon's resolve endpoint share this module for the
-// bracket scan and canonical-name shape.
-//
-// A doc link is a durable cross-reference written INSIDE a memory document's
-// body, pointing at another memory document by its exact canonical name (the
-// same identifier `crtr memory read <name>` takes; a directory INDEX is linked
-// by its folded bare-directory name). It is distinct from the interactive
-// `/name` inline-reference grammar (`inline-ref-grammar.ts`), which scans a
-// human's live composer text — links live in stored markdown and survive there.
-//
-// Links are POINTERS, never transclusion: nothing in the runtime auto-loads a
-// linked body into context. `crtr memory lint` fails a link that resolves to no
-// document; `crtr memory read` surfaces the resolved links of the doc it loads.
-//
-// This module never resolves anything: `findDocLinks` returns candidate links;
-// a caller decides a link is live by testing `name` against the corpus of
-// resolvable canonical names.
-// A canonical doc name: one or more `[A-Za-z0-9._-]+` segments joined by `/`.
-// Anything else between `[[` `]]` (spaces, `|` aliases, empty segments) is NOT
-// a doc link — the grammar has no alias/label form, by design.
-const NAME_RE = /^[A-Za-z0-9._-]+(?:\/[A-Za-z0-9._-]+)*$/;
-const LINK_RE = /\[\[([^\[\]\n]+)\]\]/g;
-/** Is `name` a well-formed canonical doc-link name? */
-export function isDocLinkName(name) {
-    return NAME_RE.test(name);
-}
-/**
- * Find every `[[name]]` doc link in a markdown body, in order of appearance,
- * skipping fenced code blocks and inline code spans (a link mentioned inside
- * code is an example, not a reference). Occurrences are NOT deduplicated —
- * callers collapse as needed.
- */
-export function findDocLinks(body) {
-    const links = [];
-    for (const segment of proseSegments(body)) {
-        LINK_RE.lastIndex = 0;
-        let m;
-        while ((m = LINK_RE.exec(segment.text)) !== null) {
-            const name = m[1];
-            if (!isDocLinkName(name))
-                continue;
-            links.push({ start: segment.offset + m.index, end: segment.offset + m.index + m[0].length, name });
-        }
-    }
-    return links;
-}
-/** The distinct link names in a body, first-appearance order. */
-export function docLinkNames(body) {
-    const seen = new Set();
-    const out = [];
-    for (const link of findDocLinks(body)) {
-        if (seen.has(link.name))
-            continue;
-        seen.add(link.name);
-        out.push(link.name);
-    }
-    return out;
-}
-const FENCE_RE = /^ {0,3}(`{3,}|~{3,})/;
-function* proseSegments(body) {
-    let offset = 0;
-    let fence = null; // the opening fence marker while inside a block
-    for (const line of body.split('\n')) {
-        const lineLen = line.length + 1; // + '\n' (harmless overcount on last line)
-        const fenceMatch = line.match(FENCE_RE);
-        if (fence !== null) {
-            // Inside a fenced block: only a closing fence of the same char and at
-            // least the same length ends it. Nothing in here is prose.
-            if (fenceMatch && fenceMatch[1][0] === fence[0] && fenceMatch[1].length >= fence.length) {
-                fence = null;
-            }
-            offset += lineLen;
-            continue;
-        }
-        if (fenceMatch) {
-            fence = fenceMatch[1];
-            offset += lineLen;
-            continue;
-        }
-        // Prose line: split around inline code spans (single-backtick pairs).
-        yield* proseParts(line, offset);
-        offset += lineLen;
-    }
-}
-function* proseParts(line, offset) {
-    let i = 0;
-    while (i < line.length) {
-        const open = line.indexOf('`', i);
-        if (open === -1) {
-            yield { offset: offset + i, text: line.slice(i) };
-            return;
-        }
-        // Backtick run: an inline span is delimited by runs of equal length.
-        let runEnd = open;
-        while (runEnd < line.length && line[runEnd] === '`')
-            runEnd++;
-        const run = line.slice(open, runEnd);
-        const close = line.indexOf(run, runEnd);
-        if (close === -1) {
-            // Unbalanced backticks: treat the rest as prose past the run.
-            yield { offset: offset + i, text: line.slice(i, open) };
-            i = runEnd;
-            continue;
-        }
-        yield { offset: offset + i, text: line.slice(i, open) };
-        i = close + run.length;
-    }
-}
+var u=Object.defineProperty;var i=(e,o)=>u(e,"name",{value:o,configurable:!0});const r=/^[A-Za-z0-9._-]+(?:\/[A-Za-z0-9._-]+)*$/,l=/\[\[([^\[\]\n]+)\]\]/g;function a(e){return r.test(e)}i(a,"isDocLinkName");function d(e){const o=[];for(const n of x(e)){l.lastIndex=0;let t;for(;(t=l.exec(n.text))!==null;){const s=t[1];a(s)&&o.push({start:n.offset+t.index,end:n.offset+t.index+t[0].length,name:s})}}return o}i(d,"findDocLinks");function p(e){const o=new Set,n=[];for(const t of d(e))o.has(t.name)||(o.add(t.name),n.push(t.name));return n}i(p,"docLinkNames");const h=/^ {0,3}(`{3,}|~{3,})/;function*x(e){let o=0,n=null;for(const t of e.split(`
+`)){const s=t.length+1,c=t.match(h);if(n!==null){c&&c[1][0]===n[0]&&c[1].length>=n.length&&(n=null),o+=s;continue}if(c){n=c[1],o+=s;continue}yield*g(t,o),o+=s}}i(x,"proseSegments");function*g(e,o){let n=0;for(;n<e.length;){const t=e.indexOf("`",n);if(t===-1){yield{offset:o+n,text:e.slice(n)};return}let s=t;for(;s<e.length&&e[s]==="`";)s++;const c=e.slice(t,s),f=e.indexOf(c,s);if(f===-1){yield{offset:o+n,text:e.slice(n,t)},n=s;continue}yield{offset:o+n,text:e.slice(n,t)},n=f+c.length}}i(g,"proseParts");export{p as docLinkNames,d as findDocLinks,a as isDocLinkName};

package/dist/core/memory/extensions.js

@@ -1,221 +1 @@
-import { sep } from 'node:path';
-import { listInstalledPlugins, listInstalledPluginsInRoot } from '../resolver.js';
-const LOCAL_FIELD_NAME = /^[a-z][a-z0-9]*(?:-[a-z0-9]+)*$/;
-const DECLARATION_KEYS = new Set(['type', 'values', 'default', 'write_help', 'edit_help']);
-function isRecord(value) {
-    return value !== null && typeof value === 'object' && !Array.isArray(value);
-}
-export function isMemoryExtensionScalar(value) {
-    return typeof value === 'string' || typeof value === 'boolean' || (typeof value === 'number' && Number.isFinite(value));
-}
-function declarationError(path, message) {
-    return new Error(`invalid memory_extensions declaration at ${path}: ${message}`);
-}
-function validHelp(value) {
-    return typeof value === 'string' && value.trim() !== '' && !/[\r\n]/.test(value);
-}
-function validDefault(declaration, value) {
-    if (!isMemoryExtensionScalar(value))
-        return false;
-    if (declaration.type === 'enum')
-        return typeof value === 'string' && declaration.values.includes(value);
-    return typeof value === declaration.type;
-}
-/** Parse the closed declaration addendum. Callers that accept a plugin manifest
- * invoke this at their install/preflight boundary; normal runtime catalogs only
- * admit declarations which have already cleared that boundary. */
-export function validateMemoryExtensionDeclarations(raw) {
-    if (!isRecord(raw))
-        throw declarationError('memory_extensions', 'expected a non-empty object');
-    const declarations = {};
-    const fields = Object.entries(raw);
-    if (fields.length === 0)
-        throw declarationError('memory_extensions', 'must not be empty');
-    for (const [field, value] of fields) {
-        const path = `memory_extensions.${field}`;
-        if (!LOCAL_FIELD_NAME.test(field)) {
-            throw declarationError(path, 'field names must be lowercase kebab-case');
-        }
-        if (!isRecord(value))
-            throw declarationError(path, 'expected a declaration object');
-        for (const key of Object.keys(value)) {
-            if (!DECLARATION_KEYS.has(key))
-                throw declarationError(path, `unknown key \`${key}\``);
-        }
-        const type = value['type'];
-        if (type !== 'boolean' && type !== 'string' && type !== 'number' && type !== 'enum') {
-            throw declarationError(`${path}.type`, 'expected boolean, string, number, or enum');
-        }
-        if (!validHelp(value['write_help']))
-            throw declarationError(`${path}.write_help`, 'expected a nonblank single-line string');
-        if (!validHelp(value['edit_help']))
-            throw declarationError(`${path}.edit_help`, 'expected a nonblank single-line string');
-        if (type === 'enum') {
-            const values = value['values'];
-            if (!Array.isArray(values) || values.length === 0 || !values.every((entry) => typeof entry === 'string' && entry !== '')) {
-                throw declarationError(`${path}.values`, 'expected a non-empty string list');
-            }
-            if (new Set(values).size !== values.length)
-                throw declarationError(`${path}.values`, 'values must be unique');
-            const declaration = {
-                type,
-                values: [...values],
-                write_help: value['write_help'],
-                edit_help: value['edit_help'],
-            };
-            if ('default' in value) {
-                if (!validDefault(declaration, value['default'])) {
-                    throw declarationError(`${path}.default`, 'must be one of the declared enum values');
-                }
-                declaration.default = value['default'];
-            }
-            declarations[field] = declaration;
-            continue;
-        }
-        if ('values' in value)
-            throw declarationError(`${path}.values`, 'is allowed only for enum declarations');
-        const declaration = {
-            type,
-            write_help: value['write_help'],
-            edit_help: value['edit_help'],
-        };
-        if ('default' in value) {
-            if (!validDefault(declaration, value['default'])) {
-                throw declarationError(`${path}.default`, `must be a ${type}`);
-            }
-            declaration.default = value['default'];
-        }
-        declarations[field] = declaration;
-    }
-    return declarations;
-}
-/** Throw when a manifest carries an invalid addendum; absent is valid. */
-export function validatePluginMemoryExtensions(manifest) {
-    if (manifest.memory_extensions !== undefined)
-        validateMemoryExtensionDeclarations(manifest.memory_extensions);
-}
-function declarationsFromManifest(manifest, strict) {
-    if (manifest.memory_extensions === undefined)
-        return undefined;
-    try {
-        return validateMemoryExtensionDeclarations(manifest.memory_extensions);
-    }
-    catch (error) {
-        if (strict)
-            throw error;
-        return undefined;
-    }
-}
-function catalogForPlugins(groups, enabledOnly, candidate) {
-    const catalog = {};
-    const shadowed = new Set();
-    if (candidate !== undefined) {
-        // A candidate that removes its addendum must still hide an installed copy
-        // while that package's own documents are being validated.
-        shadowed.add(candidate.name);
-        const declarations = declarationsFromManifest(candidate, true);
-        if (declarations !== undefined)
-            catalog[candidate.name] = declarations;
-    }
-    for (const plugins of groups) {
-        for (const plugin of plugins) {
-            if (enabledOnly && !plugin.enabled)
-                continue;
-            const namespace = plugin.manifest.name;
-            if (shadowed.has(namespace) || catalog[namespace] !== undefined)
-                continue;
-            const declarations = declarationsFromManifest(plugin.manifest, false);
-            if (declarations !== undefined)
-                catalog[namespace] = declarations;
-        }
-    }
-    return catalog;
-}
-/** Declarations for a native document. Project documents use their owning
- * project scope only, then user scope; profile/node/user docs use user scope. */
-function pluginGroupsForDocument(doc) {
-    if (doc.scope === 'builtin')
-        return [];
-    if (doc.scope === 'project') {
-        const marker = `${sep}.crouter${sep}`;
-        const markerIndex = doc.path.lastIndexOf(marker);
-        if (markerIndex >= 0) {
-            const root = doc.path.slice(0, markerIndex + `${sep}.crouter`.length);
-            return [listInstalledPluginsInRoot('project', root), listInstalledPlugins('user')];
-        }
-    }
-    return [listInstalledPlugins('user')];
-}
-/** Installed declarations used for validation and authoring. Disabled plugins
- * remain present so existing values can still be checked and edited. */
-export function memoryExtensionValidationCatalog(doc, options = {}) {
-    return catalogForPlugins(pluginGroupsForDocument(doc), false, options.candidate);
-}
-/** Winning enabled declarations used only to interpret structured output. */
-export function memoryExtensionEffectiveCatalog(doc) {
-    return catalogForPlugins(pluginGroupsForDocument(doc), true);
-}
-/** Validate the raw `extensions` frontmatter value. Unresolved namespaces are
- * intentionally reported rather than discarded: removal leaves raw metadata
- * intact but lint-invalid until its plugin returns. */
-export function validateMemoryExtensionValues(raw, catalog) {
-    if (raw === undefined)
-        return [];
-    if (!isRecord(raw))
-        return [{ path: 'extensions', message: 'expected a mapping' }];
-    const issues = [];
-    for (const [namespace, fields] of Object.entries(raw)) {
-        const namespacePath = `extensions.${namespace}`;
-        if (!isRecord(fields)) {
-            issues.push({ path: namespacePath, message: 'expected a mapping' });
-            continue;
-        }
-        const declarations = catalog[namespace];
-        if (declarations === undefined) {
-            issues.push({ path: namespacePath, message: 'unresolved extension namespace' });
-            for (const [field, value] of Object.entries(fields)) {
-                if (!isMemoryExtensionScalar(value)) {
-                    issues.push({ path: `${namespacePath}.${field}`, message: 'expected a string, boolean, or finite number' });
-                }
-            }
-            continue;
-        }
-        for (const [field, value] of Object.entries(fields)) {
-            const path = `${namespacePath}.${field}`;
-            if (!isMemoryExtensionScalar(value)) {
-                issues.push({ path, message: 'expected a string, boolean, or finite number' });
-                continue;
-            }
-            const declaration = declarations[field];
-            if (declaration === undefined) {
-                issues.push({ path, message: 'undeclared extension field' });
-                continue;
-            }
-            if (!validDefault(declaration, value)) {
-                const expected = declaration.type === 'enum' ? `one of ${declaration.values.join('|')}` : declaration.type;
-                issues.push({ path, message: `expected ${expected}` });
-            }
-        }
-    }
-    return issues;
-}
-/** Effective plugin metadata for structured consumers. It overlays only valid
- * explicit scalars onto defaults and never mutates or serializes frontmatter. */
-export function projectEffectiveMemoryExtensions(raw, catalog) {
-    const source = isRecord(raw) ? raw : {};
-    const effective = {};
-    for (const [namespace, declarations] of Object.entries(catalog)) {
-        const values = {};
-        const explicit = isRecord(source[namespace]) ? source[namespace] : {};
-        for (const [field, declaration] of Object.entries(declarations)) {
-            if (declaration.default !== undefined)
-                values[field] = declaration.default;
-            const value = explicit[field];
-            if (validDefault(declaration, value))
-                values[field] = value;
-        }
-        if (Object.keys(values).length > 0)
-            effective[namespace] = values;
-    }
-    return effective;
-}
+var j=Object.defineProperty;var f=(e,n)=>j(e,"name",{value:n,configurable:!0});import{sep as h}from"node:path";import{listInstalledPlugins as x,listInstalledPluginsInRoot as E}from"../resolver.js";const O=/^[a-z][a-z0-9]*(?:-[a-z0-9]+)*$/,k=new Set(["type","values","default","write_help","edit_help"]);function p(e){return e!==null&&typeof e=="object"&&!Array.isArray(e)}f(p,"isRecord");function y(e){return typeof e=="string"||typeof e=="boolean"||typeof e=="number"&&Number.isFinite(e)}f(y,"isMemoryExtensionScalar");function c(e,n){return new Error(`invalid memory_extensions declaration at ${e}: ${n}`)}f(c,"declarationError");function g(e){return typeof e=="string"&&e.trim()!==""&&!/[\r\n]/.test(e)}f(g,"validHelp");function m(e,n){return y(n)?e.type==="enum"?typeof n=="string"&&e.values.includes(n):typeof n===e.type:!1}f(m,"validDefault");function b(e){if(!p(e))throw c("memory_extensions","expected a non-empty object");const n={},o=Object.entries(e);if(o.length===0)throw c("memory_extensions","must not be empty");for(const[a,t]of o){const i=`memory_extensions.${a}`;if(!O.test(a))throw c(i,"field names must be lowercase kebab-case");if(!p(t))throw c(i,"expected a declaration object");for(const s of Object.keys(t))if(!k.has(s))throw c(i,`unknown key \`${s}\``);const r=t.type;if(r!=="boolean"&&r!=="string"&&r!=="number"&&r!=="enum")throw c(`${i}.type`,"expected boolean, string, number, or enum");if(!g(t.write_help))throw c(`${i}.write_help`,"expected a nonblank single-line string");if(!g(t.edit_help))throw c(`${i}.edit_help`,"expected a nonblank single-line string");if(r==="enum"){const s=t.values;if(!Array.isArray(s)||s.length===0||!s.every(d=>typeof d=="string"&&d!==""))throw c(`${i}.values`,"expected a non-empty string list");if(new Set(s).size!==s.length)throw c(`${i}.values`,"values must be unique");const l={type:r,values:[...s],write_help:t.write_help,edit_help:t.edit_help};if("default"in t){if(!m(l,t.default))throw c(`${i}.default`,"must be one of the declared enum values");l.default=t.default}n[a]=l;continue}if("values"in t)throw c(`${i}.values`,"is allowed only for enum declarations");const u={type:r,write_help:t.write_help,edit_help:t.edit_help};if("default"in t){if(!m(u,t.default))throw c(`${i}.default`,`must be a ${r}`);u.default=t.default}n[a]=u}return n}f(b,"validateMemoryExtensionDeclarations");function D(e){e.memory_extensions!==void 0&&b(e.memory_extensions)}f(D,"validatePluginMemoryExtensions");function w(e,n){if(e.memory_extensions!==void 0)try{return b(e.memory_extensions)}catch(o){if(n)throw o;return}}f(w,"declarationsFromManifest");function _(e,n,o){const a={},t=new Set;if(o!==void 0){t.add(o.name);const i=w(o,!0);i!==void 0&&(a[o.name]=i)}for(const i of e)for(const r of i){if(n&&!r.enabled)continue;const u=r.manifest.name;if(t.has(u)||a[u]!==void 0)continue;const s=w(r.manifest,!1);s!==void 0&&(a[u]=s)}return a}f(_,"catalogForPlugins");function $(e){if(e.scope==="builtin")return[];if(e.scope==="project"){const n=`${h}.crouter${h}`,o=e.path.lastIndexOf(n);if(o>=0){const a=e.path.slice(0,o+`${h}.crouter`.length);return[E("project",a),x("user")]}}return[x("user")]}f($,"pluginGroupsForDocument");function F(e,n={}){return _($(e),!1,n.candidate)}f(F,"memoryExtensionValidationCatalog");function P(e){return _($(e),!0)}f(P,"memoryExtensionEffectiveCatalog");function S(e,n){if(e===void 0)return[];if(!p(e))return[{path:"extensions",message:"expected a mapping"}];const o=[];for(const[a,t]of Object.entries(e)){const i=`extensions.${a}`;if(!p(t)){o.push({path:i,message:"expected a mapping"});continue}const r=n[a];if(r===void 0){o.push({path:i,message:"unresolved extension namespace"});for(const[u,s]of Object.entries(t))y(s)||o.push({path:`${i}.${u}`,message:"expected a string, boolean, or finite number"});continue}for(const[u,s]of Object.entries(t)){const l=`${i}.${u}`;if(!y(s)){o.push({path:l,message:"expected a string, boolean, or finite number"});continue}const d=r[u];if(d===void 0){o.push({path:l,message:"undeclared extension field"});continue}if(!m(d,s)){const v=d.type==="enum"?`one of ${d.values.join("|")}`:d.type;o.push({path:l,message:`expected ${v}`})}}}return o}f(S,"validateMemoryExtensionValues");function z(e,n){const o=p(e)?e:{},a={};for(const[t,i]of Object.entries(n)){const r={},u=p(o[t])?o[t]:{};for(const[s,l]of Object.entries(i)){l.default!==void 0&&(r[s]=l.default);const d=u[s];m(l,d)&&(r[s]=d)}Object.keys(r).length>0&&(a[t]=r)}return a}f(z,"projectEffectiveMemoryExtensions");export{y as isMemoryExtensionScalar,P as memoryExtensionEffectiveCatalog,F as memoryExtensionValidationCatalog,z as projectEffectiveMemoryExtensions,b as validateMemoryExtensionDeclarations,S as validateMemoryExtensionValues,D as validatePluginMemoryExtensions};

package/dist/core/memory/history.js

@@ -1,268 +1,6 @@
-// Per-document revision history for the memory substrate: one append-only
-// JSONL sidecar per doc at `<store>/memory/.history/<name>.jsonl`, mirroring
-// the doc tree segment for segment. Every record carries the COMPLETE document
-// text before and after the mutation, so a reader never reconstructs a chain,
-// an interleaved concurrent append stays fully valid, and an out-of-band direct
-// file edit is visible as a record whose `before` differs from the prior
-// record's `after`. Diffs and revision numbers are derived at read time, never
-// stored.
-//
-// The raw file is the consumer contract: an external reader (a product surface
-// reading a store off disk) parses one JSON object per line and computes its
-// own diffs. Nothing here shells out to git.
-import { appendFileSync, readdirSync } from 'node:fs';
-import { dirname, join, relative } from 'node:path';
-import { ensureDir, pathExists, readText } from '../fs-utils.js';
-import { general } from '../errors.js';
-import { parseFrontmatterGeneric } from '../frontmatter.js';
-import { normalizeNameSegment } from './identity.js';
-/** Sidecar tree name under a store's `memory/` dir. Dot-prefixed and holding
- *  only `.jsonl`, so every substrate scan (which filters to `*.md`, and in
- *  `lint`'s case skips dot-dirs outright) passes it over without an exclusion
- *  rule of its own. */
-export const HISTORY_DIR = '.history';
-/** The log path for a document, derived from its PHYSICAL path so the history
- *  tree mirrors the doc tree exactly (`memory/area/topic.md` →
- *  `memory/.history/area/topic.jsonl`). `memoryRoot` is the store's `memory/`
- *  dir the doc lives under. */
-export function historyLogPathFor(memoryRoot, docPath) {
-    const rel = relative(memoryRoot, docPath);
-    if (rel === '' || rel.startsWith('..')) {
-        throw general(`memory document ${docPath} is not inside its store root ${memoryRoot}`);
-    }
-    return join(memoryRoot, HISTORY_DIR, rel.replace(/\.md$/i, '') + '.jsonl');
-}
-/** Stamp the runtime-owned fields of a record. Field insertion order IS the
- *  serialized key order — the on-disk shape consumers read. */
-export function buildHistoryRecord(input) {
-    const env = process.env;
-    const record = {
-        op: input.op,
-        at: new Date().toISOString(),
-        ...(env['CRTR_NODE_ID'] ? { node: env['CRTR_NODE_ID'] } : {}),
-        cwd: env['CRTR_NODE_CWD'] ?? process.cwd(),
-        ...(input.from !== undefined ? { from: input.from } : {}),
-        ...(input.rationale !== undefined ? { rationale: input.rationale } : {}),
-        ...(input.verbatim === true ? { verbatim: true } : {}),
-        before: input.before,
-        after: input.after,
-    };
-    return record;
-}
-/** Derive a live document's sidecar from its descriptor. The descriptor's
- * physical path is authoritative: canonical names carry a project namespace,
- * while sidecars remain in the owning store's physical tree. */
-export function historyLogPathForDoc(doc) {
-    return historyLogPathFor(doc.root, doc.path);
-}
-function matchingDirs(parent, segment) {
-    let entries;
-    try {
-        entries = readdirSync(parent, { withFileTypes: true });
-    }
-    catch {
-        return [];
-    }
-    return entries
-        .filter((entry) => entry.isDirectory() && normalizeNameSegment(entry.name) === segment)
-        .sort((a, b) => (a.name === segment ? -1 : b.name === segment ? 1 : a.name.localeCompare(b.name)))
-        .map((entry) => join(parent, entry.name));
-}
-function matchingFiles(parent, stem) {
-    let entries;
-    try {
-        entries = readdirSync(parent, { withFileTypes: true });
-    }
-    catch {
-        return [];
-    }
-    return entries
-        .filter((entry) => entry.isFile() && entry.name.endsWith('.jsonl') && normalizeNameSegment(entry.name.slice(0, -'.jsonl'.length)) === stem)
-        .sort((a, b) => (a.name === `${stem}.jsonl` ? -1 : b.name === `${stem}.jsonl` ? 1 : a.name.localeCompare(b.name)))
-        .map((entry) => join(parent, entry.name));
-}
-function historyFilesForSegments(historyDir, segments, stem) {
-    let parents = [historyDir];
-    for (const segment of segments) {
-        parents = parents.flatMap((parent) => matchingDirs(parent, segment));
-        if (parents.length === 0)
-            return [];
-    }
-    return parents.flatMap((parent) => matchingFiles(parent, stem));
-}
-/** Resolve a deleted document's physical history without reintroducing a
- * canonical-name fallback. `localName` is already stripped of the selected
- * project's exact namespace. The directory-index sidecar is deliberately
- * probed first, and therefore wins deterministically if both physical forms
- * survive; callers can expose `candidates`/`collision` for diagnostics. */
-export function resolveDeletedHistoryLogPath(storeRoot, localName) {
-    const segments = localName.split('/').filter((segment) => segment !== '').map(normalizeNameSegment);
-    const historyDir = join(storeRoot, HISTORY_DIR);
-    const indexPaths = historyFilesForSegments(historyDir, segments, 'INDEX');
-    const leafPaths = segments.length === 0 ? [] : historyFilesForSegments(historyDir, segments.slice(0, -1), segments[segments.length - 1]);
-    const candidates = [
-        ...indexPaths.map((path) => ({ path, representation: 'directory-index', winner: false })),
-        ...leafPaths.map((path) => ({ path, representation: 'leaf-file', winner: false })),
-    ];
-    if (candidates.length === 0)
-        return null;
-    candidates[0].winner = true;
-    return {
-        logPath: candidates[0].path,
-        candidates,
-        ...(candidates.length > 1 ? { collision: { paths: candidates.map((candidate) => candidate.path), winner: candidates[0].path } } : {}),
-    };
-}
-/** Append one record. Single write of one line — concurrent appends interleave
- *  whole records, and every record stands alone, so no lock is needed. */
-export function appendHistoryRecord(logPath, record) {
-    ensureDir(dirname(logPath));
-    appendFileSync(logPath, JSON.stringify(record) + '\n', 'utf8');
-}
-/** Every record in a log, oldest first (append order). Revision numbers are
- *  1-based positions in this array. */
-export function readHistoryRecords(logPath) {
-    if (!pathExists(logPath))
-        return [];
-    const lines = readText(logPath).split('\n');
-    const records = [];
-    for (let i = 0; i < lines.length; i += 1) {
-        const line = lines[i];
-        if (line.trim() === '')
-            continue;
-        try {
-            records.push(JSON.parse(line));
-        }
-        catch {
-            throw general(`corrupt history record at ${logPath}:${i + 1} — the line is not valid JSON`, {
-                next: 'Inspect that line directly; the surrounding records are self-contained and still readable.',
-            });
-        }
-    }
-    return records;
-}
-/** What one record changed, derived from its own two texts. `last-updated` is
- *  excluded: the runtime stamps it on every edit, so listing it says nothing. */
-export function summarizeChange(before, after) {
-    const b = parseFrontmatterGeneric(before);
-    const a = parseFrontmatterGeneric(after);
-    const bData = b.data ?? {};
-    const aData = a.data ?? {};
-    const keys = new Set([...Object.keys(bData), ...Object.keys(aData)]);
-    keys.delete('last-updated');
-    const changed = [...keys]
-        .filter((k) => JSON.stringify(bData[k]) !== JSON.stringify(aData[k]))
-        .sort((x, y) => x.localeCompare(y));
-    return { body_changed: b.body !== a.body, frontmatter_changed: changed };
-}
-/** Unified diff between two document texts, computed at read time. Dependency
- *  free (an LCS over lines) — memory docs are lint-capped small, so the
- *  quadratic table is never a cost. */
-export function unifiedDiff(before, after, context = 3) {
-    const { lines: a, terminated: aTerm } = toLines(before);
-    const { lines: b, terminated: bTerm } = toLines(after);
-    // Diff on keys, not raw text: an unterminated final line is a DIFFERENT line
-    // from the same text terminated, so dropping a trailing newline is a real
-    // change rather than an empty diff.
-    const ops = diffOps(diffKeys(a, aTerm), diffKeys(b, bTerm));
-    // Each changed op claims `context` ops on either side; overlapping claims
-    // merge into one hunk.
-    const ranges = [];
-    for (let i = 0; i < ops.length; i += 1) {
-        if (ops[i].tag === ' ')
-            continue;
-        const from = Math.max(0, i - context);
-        const to = Math.min(ops.length, i + context + 1);
-        const last = ranges[ranges.length - 1];
-        if (last !== undefined && from <= last.to)
-            last.to = Math.max(last.to, to);
-        else
-            ranges.push({ from, to });
-    }
-    if (ranges.length === 0)
-        return '';
-    // Line numbers each op sits at, in the before and after texts.
-    const aAt = [];
-    const bAt = [];
-    let aLine = 0;
-    let bLine = 0;
-    for (const op of ops) {
-        aAt.push(aLine);
-        bAt.push(bLine);
-        if (op.tag !== '+')
-            aLine += 1;
-        if (op.tag !== '-')
-            bLine += 1;
-    }
-    const out = [];
-    for (const { from, to } of ranges) {
-        const slice = ops.slice(from, to);
-        const aCount = slice.filter((op) => op.tag !== '+').length;
-        const bCount = slice.filter((op) => op.tag !== '-').length;
-        // A side contributing no lines is `0,0` — an empty file has no line 1.
-        out.push(`@@ -${aCount === 0 ? 0 : aAt[from] + 1},${aCount} +${bCount === 0 ? 0 : bAt[from] + 1},${bCount} @@`);
-        for (let i = from; i < to; i += 1) {
-            const op = ops[i];
-            out.push(op.tag + (op.tag === '+' ? b[op.index] : a[op.index]));
-            const endsA = op.tag !== '+' && !aTerm && aAt[i] === a.length - 1;
-            const endsB = op.tag !== '-' && !bTerm && bAt[i] === b.length - 1;
-            if (endsA || endsB)
-                out.push(NO_NEWLINE_MARKER);
-        }
-    }
-    return out.join('\n');
-}
-const NO_NEWLINE_MARKER = '\';
-// U+0000 cannot occur in a memory document, so it can never collide with text.
-const NO_NEWLINE_KEY = '\u0000no-newline-at-eof';
-function diffKeys(lines, terminated) {
-    if (terminated || lines.length === 0)
-        return lines;
-    return lines.map((line, i) => (i === lines.length - 1 ? line + NO_NEWLINE_KEY : line));
-}
-/** Split into diffable lines. A final `\n` TERMINATES the last line rather than
- *  opening an empty one, so `foo\n` is one line; a text without it is flagged so
- *  the diff can mark it, the way a unified patch must. */
-function toLines(text) {
-    if (text === '')
-        return { lines: [], terminated: true };
-    const terminated = text.endsWith('\n');
-    const lines = text.split('\n');
-    if (terminated)
-        lines.pop();
-    return { lines, terminated };
-}
-function diffOps(a, b) {
-    const n = a.length;
-    const m = b.length;
-    // lcs[i][j] = length of the longest common subsequence of a[i..] and b[j..].
-    const lcs = Array.from({ length: n + 1 }, () => new Array(m + 1).fill(0));
-    for (let i = n - 1; i >= 0; i -= 1) {
-        for (let j = m - 1; j >= 0; j -= 1) {
-            lcs[i][j] = a[i] === b[j] ? lcs[i + 1][j + 1] + 1 : Math.max(lcs[i + 1][j], lcs[i][j + 1]);
-        }
-    }
-    const ops = [];
-    let i = 0;
-    let j = 0;
-    while (i < n && j < m) {
-        if (a[i] === b[j]) {
-            ops.push({ tag: ' ', index: i });
-            i += 1;
-            j += 1;
-        }
-        else if (lcs[i + 1][j] >= lcs[i][j + 1]) {
-            ops.push({ tag: '-', index: i });
-            i += 1;
-        }
-        else {
-            ops.push({ tag: '+', index: j });
-            j += 1;
-        }
-    }
-    for (; i < n; i += 1)
-        ops.push({ tag: '-', index: i });
-    for (; j < m; j += 1)
-        ops.push({ tag: '+', index: j });
-    return ops;
-}
+var T=Object.defineProperty;var l=(t,n)=>T(t,"name",{value:n,configurable:!0});import{appendFileSync as L,readdirSync as S}from"node:fs";import{dirname as v,join as x,relative as M}from"node:path";import{ensureDir as A,pathExists as W,readText as H}from"../fs-utils.js";import{general as _}from"../errors.js";import{parseFrontmatterGeneric as j}from"../frontmatter.js";import{normalizeNameSegment as N}from"./identity.js";const E=".history";function J(t,n){const r=M(t,n);if(r===""||r.startsWith(".."))throw _(`memory document ${n} is not inside its store root ${t}`);return x(t,E,r.replace(/\.md$/i,"")+".jsonl")}l(J,"historyLogPathFor");function Z(t){const n=process.env;return{op:t.op,at:new Date().toISOString(),...n.CRTR_NODE_ID?{node:n.CRTR_NODE_ID}:{},cwd:n.CRTR_NODE_CWD??process.cwd(),...t.from!==void 0?{from:t.from}:{},...t.rationale!==void 0?{rationale:t.rationale}:{},...t.verbatim===!0?{verbatim:!0}:{},before:t.before,after:t.after}}l(Z,"buildHistoryRecord");function tt(t){return J(t.root,t.path)}l(tt,"historyLogPathForDoc");function K(t,n){let r;try{r=S(t,{withFileTypes:!0})}catch{return[]}return r.filter(e=>e.isDirectory()&&N(e.name)===n).sort((e,o)=>e.name===n?-1:o.name===n?1:e.name.localeCompare(o.name)).map(e=>x(t,e.name))}l(K,"matchingDirs");function k(t,n){let r;try{r=S(t,{withFileTypes:!0})}catch{return[]}return r.filter(e=>e.isFile()&&e.name.endsWith(".jsonl")&&N(e.name.slice(0,-6))===n).sort((e,o)=>e.name===`${n}.jsonl`?-1:o.name===`${n}.jsonl`?1:e.name.localeCompare(o.name)).map(e=>x(t,e.name))}l(k,"matchingFiles");function R(t,n,r){let e=[t];for(const o of n)if(e=e.flatMap(c=>K(c,o)),e.length===0)return[];return e.flatMap(o=>k(o,r))}l(R,"historyFilesForSegments");function et(t,n){const r=n.split("/").filter(i=>i!=="").map(N),e=x(t,E),o=R(e,r,"INDEX"),c=r.length===0?[]:R(e,r.slice(0,-1),r[r.length-1]),s=[...o.map(i=>({path:i,representation:"directory-index",winner:!1})),...c.map(i=>({path:i,representation:"leaf-file",winner:!1}))];return s.length===0?null:(s[0].winner=!0,{logPath:s[0].path,candidates:s,...s.length>1?{collision:{paths:s.map(i=>i.path),winner:s[0].path}}:{}})}l(et,"resolveDeletedHistoryLogPath");function nt(t,n){A(v(t)),L(t,JSON.stringify(n)+`
+`,"utf8")}l(nt,"appendHistoryRecord");function rt(t){if(!W(t))return[];const n=H(t).split(`
+`),r=[];for(let e=0;e<n.length;e+=1){const o=n[e];if(o.trim()!=="")try{r.push(JSON.parse(o))}catch{throw _(`corrupt history record at ${t}:${e+1} \u2014 the line is not valid JSON`,{next:"Inspect that line directly; the surrounding records are self-contained and still readable."})}}return r}l(rt,"readHistoryRecords");function ot(t,n){const r=j(t),e=j(n),o=r.data??{},c=e.data??{},s=new Set([...Object.keys(o),...Object.keys(c)]);s.delete("last-updated");const i=[...s].filter(a=>JSON.stringify(o[a])!==JSON.stringify(c[a])).sort((a,f)=>a.localeCompare(f));return{body_changed:r.body!==e.body,frontmatter_changed:i}}l(ot,"summarizeChange");function it(t,n,r=3){const{lines:e,terminated:o}=C(t),{lines:c,terminated:s}=C(n),i=Y($(e,o),$(c,s)),a=[];for(let h=0;h<i.length;h+=1){if(i[h].tag===" ")continue;const m=Math.max(0,h-r),g=Math.min(i.length,h+r+1),u=a[a.length-1];u!==void 0&&m<=u.to?u.to=Math.max(u.to,g):a.push({from:m,to:g})}if(a.length===0)return"";const f=[],D=[];let w=0,O=0;for(const h of i)f.push(w),D.push(O),h.tag!=="+"&&(w+=1),h.tag!=="-"&&(O+=1);const y=[];for(const{from:h,to:m}of a){const g=i.slice(h,m),u=g.filter(d=>d.tag!=="+").length,b=g.filter(d=>d.tag!=="-").length;y.push(`@@ -${u===0?0:f[h]+1},${u} +${b===0?0:D[h]+1},${b} @@`);for(let d=h;d<m;d+=1){const p=i[d];y.push(p.tag+(p.tag==="+"?c[p.index]:e[p.index]));const F=p.tag!=="+"&&!o&&f[d]===e.length-1,I=p.tag!=="-"&&!s&&D[d]===c.length-1;(F||I)&&y.push(z)}}return y.join(`
+`)}l(it,"unifiedDiff");const z="\",P="\0no-newline-at-eof";function $(t,n){return n||t.length===0?t:t.map((r,e)=>e===t.length-1?r+P:r)}l($,"diffKeys");function C(t){if(t==="")return{lines:[],terminated:!0};const n=t.endsWith(`
+`),r=t.split(`
+`);return n&&r.pop(),{lines:r,terminated:n}}l(C,"toLines");function Y(t,n){const r=t.length,e=n.length,o=Array.from({length:r+1},()=>new Array(e+1).fill(0));for(let a=r-1;a>=0;a-=1)for(let f=e-1;f>=0;f-=1)o[a][f]=t[a]===n[f]?o[a+1][f+1]+1:Math.max(o[a+1][f],o[a][f+1]);const c=[];let s=0,i=0;for(;s<r&&i<e;)t[s]===n[i]?(c.push({tag:" ",index:s}),s+=1,i+=1):o[s+1][i]>=o[s][i+1]?(c.push({tag:"-",index:s}),s+=1):(c.push({tag:"+",index:i}),i+=1);for(;s<r;s+=1)c.push({tag:"-",index:s});for(;i<e;i+=1)c.push({tag:"+",index:i});return c}l(Y,"diffOps");export{E as HISTORY_DIR,nt as appendHistoryRecord,Z as buildHistoryRecord,J as historyLogPathFor,tt as historyLogPathForDoc,rt as readHistoryRecords,et as resolveDeletedHistoryLogPath,ot as summarizeChange,it as unifiedDiff};