@north-light/crouter 0.3.318 → 0.3.319

package/dist/commands/memory/find.js

@@ -1,244 +1,2 @@
-import { defineLeaf } from '../../core/command.js';
-import { usage } from '../../core/errors.js';
-import { listAllMemoryDocs, loadMemoryStoreView } from '../../core/memory-resolver.js';
-import { parseSubstrateDoc } from '../../core/substrate/schema.js';
-import { paginate } from '../../core/pagination.js';
-import { candidateRow } from './read.js';
-import { MEMORY_KINDS, registerMemoryListingExposure, requireMountedStore, resolveReadSelector, selectorParam, } from './shared.js';
-/** The search space over one corpus: every substrate memory document, narrowed
- *  to one kind when asked. Within that narrowing find searches EVERYTHING — it
- *  never applies gate or visibility-rung filtering; --kind/--scope/--dir are
- *  caller intent, not a visibility policy.
- *
- *  A target view is deduped by canonical name, first in source order wins, so a
- *  hit names the document a read of that name returns. An exact store (`--dir`)
- *  is not deduped: naming a store means seeing what it physically holds. */
-function searchUnits(kindFilter, docs, dedup) {
-    const byName = new Map();
-    for (const doc of docs) {
-        const bucket = byName.get(doc.name);
-        if (bucket !== undefined)
-            bucket.push(doc);
-        else
-            byName.set(doc.name, [doc]);
-    }
-    const seen = new Set();
-    const units = [];
-    for (const doc of docs) {
-        const sub = parseSubstrateDoc(doc);
-        if (sub === null)
-            continue;
-        if (kindFilter !== undefined && sub.kind !== kindFilter)
-            continue;
-        if (dedup) {
-            if (seen.has(sub.name))
-                continue;
-            seen.add(sub.name);
-        }
-        units.push({
-            name: sub.name,
-            localName: doc.localName,
-            kind: sub.kind,
-            scope: sub.scope,
-            path: sub.path,
-            storeRoot: doc.root,
-            physicalRelativePath: doc.physicalRelativePath,
-            routing: sub.whenAndWhyToRead,
-            shortForm: sub.shortForm,
-            candidates: byName.get(doc.name) ?? [doc],
-            loadBody: () => sub.body,
-        });
-    }
-    return units;
-}
-/** The physical location fields --paths adds to any hit shape. */
-function pathFields(u) {
-    return {
-        path: u.path,
-        store_root: u.storeRoot,
-        physical_relative_path: u.physicalRelativePath,
-        ...(u.candidates.length > 1 ? { candidates: u.candidates.map((c) => candidateRow(c, u.candidates[0])) } : {}),
-    };
-}
-export const findLeaf = defineLeaf({
-    name: 'find',
-    description: 'relevance search across memory documents',
-    whenToUse: 'the discovery surface when you do NOT know a document\u2019s canonical name — ranks documents by relevance over the canonical name, the store-local name, the physical path, the read-routing line, and short-form (add --body to also weigh body text), and every hit reports the canonical name `crtr memory read` takes. Searches every scope by default regardless of any visibility gate; --scope narrows to one class of store, --dir to one exact store. Reach for `crtr memory list` instead when you want the whole inventory rather than a topic match, and --grep when you need an exact regex or literal-string match across document bodies.',
-    help: {
-        name: 'memory find',
-        summary: 'bounded relevance search across memory documents, weighted over name/local name/physical path/routing-line/short-form (and body with --body)',
-        params: [
-            { kind: 'positional', name: 'query', required: true, constraint: 'With ranked search (default): whitespace-separated terms, matched case-insensitively and weighted over the document\u2019s names (canonical, store-local, and physical path), the read-routing line, and short-form (plus body with --body); documents matching more/stronger fields rank higher. By default returns at most 10 hits scoring at least half the top score. With --grep: an ECMAScript regex applied to each document body line.' },
-            { kind: 'flag', name: 'kind', type: 'enum', choices: [...MEMORY_KINDS], required: false, constraint: 'Filter to a single kind. Default: all kinds.' },
-            selectorParam('scope-read', {}, 'Default: every resolved scope, builtin included.'),
-            selectorParam('dir', {}, 'Searches that store alone, and searches it physically: two documents sharing one canonical name are both searched and both reported, where the default view searches only the winner.'),
-            { kind: 'flag', name: 'grep', type: 'bool', required: false, constraint: 'Treat the query as an ECMAScript regex and match it against document bodies, instead of weighted relevance ranking. Mutually exclusive with --body.' },
-            { kind: 'flag', name: 'body', type: 'bool', required: false, constraint: 'Also weigh document body text in the relevance ranking (in addition to name/when/why/short-form). Ignored under --grep, which always scans bodies.' },
-            { kind: 'flag', name: 'limit', type: 'int', required: false, constraint: 'Maximum hits to return per page after relevance filtering. Default 10, hard max 100.' },
-            { kind: 'flag', name: 'cursor', type: 'string', required: false, constraint: 'Opaque token from next_cursor. Omit on first call.' },
-            { kind: 'flag', name: 'min-score', type: 'int', required: false, constraint: 'Ranked mode only. Minimum score to return, replacing the default adaptive floor of half the top score. Must be at least 1.' },
-            { kind: 'flag', name: 'paths', type: 'bool', required: false, constraint: 'Include each hit\u2019s physical location — absolute path, store root, store-relative path, and every other physical document sharing its canonical name. Off by default; the canonical name is sufficient for `crtr memory read <name>`.' },
-        ],
-        output: [
-            { name: 'query', type: 'string', required: true, constraint: 'Echo of the input query.' },
-            { name: 'matches', type: 'integer', required: true, constraint: 'Total matches before the default relevance floor and limit are applied (ranked mode) or total matching lines (grep mode) — across all pages, not just this one.' },
-            { name: 'hits', type: 'object[]', required: true, constraint: 'Ranked mode — each: {name, kind, scope, score, short_form}, sorted by score descending. Grep mode — each: {name, scope, line, text}, sorted by name then line. `name` is always the canonical name, whatever field matched. With --paths, each shape also carries path, store_root, physical_relative_path, and candidates when several physical documents share the name. Paginated via --limit/--cursor.' },
-            { name: 'next_cursor', type: 'string | null', required: true, constraint: 'Opaque token for the next page; null means no more items.' },
-            { name: 'follow_up', type: 'string', required: true, constraint: 'Concrete next commands for reading a hit in full or refining the search.' },
-        ],
-        outputKind: 'object',
-        effects: ['Records this search page as listing context for the current node without marking any matched document as loaded.'],
-    },
-    run: async (input) => {
-        const query = input['query'];
-        const kindFilter = input['kind'];
-        const dirArg = input['dir'];
-        const selector = resolveReadSelector({ scope: input['scope'], dir: dirArg });
-        const grep = input['grep'];
-        const weighBody = input['body'];
-        const limitArg = input['limit'];
-        const cursor = input['cursor'];
-        const minScore = input['minScore'];
-        const includePaths = input['paths'];
-        if (grep && weighBody) {
-            throw usage('--grep and --body are mutually exclusive (--grep always scans bodies).');
-        }
-        if (grep && minScore !== undefined)
-            throw usage('--min-score is only available in ranked mode.');
-        if (limitArg !== undefined && (limitArg < 1 || limitArg > 100)) {
-            throw usage('--limit must be between 1 and 100.');
-        }
-        if (minScore !== undefined && minScore < 1)
-            throw usage('--min-score must be at least 1.');
-        const limit = limitArg ?? 10;
-        const listingIdentity = `listing:memory-find:${JSON.stringify({
-            query,
-            kind: kindFilter ?? null,
-            scope: selector.scope ?? null,
-            dir: dirArg ?? null,
-            grep: grep === true,
-            body: weighBody === true,
-            limit,
-            cursor: cursor ?? null,
-            minScore: minScore ?? null,
-            paths: includePaths === true,
-        })}`;
-        const units = selector.store !== null
-            ? searchUnits(kindFilter, loadMemoryStoreView(requireMountedStore(selector.store), false).docs, false)
-            : searchUnits(kindFilter, listAllMemoryDocs(selector.scope, false, true), true);
-        // grep mode: regex over every unit's body, one row per matching line
-        if (grep) {
-            let regex;
-            try {
-                regex = new RegExp(query);
-            }
-            catch {
-                throw usage(`invalid regex pattern: ${query}`);
-            }
-            const matches = [];
-            for (const u of units) {
-                const lines = u.loadBody().split('\n');
-                lines.forEach((text, idx) => {
-                    if (regex.test(text))
-                        matches.push({ name: u.name, scope: u.scope, unit: u, line: idx + 1, text });
-                });
-            }
-            // Physical path is part of the identity: under --dir two documents can
-            // share one canonical name, and pagination needs unique ascending keys.
-            matches.sort((a, b) => {
-                const nc = a.name.localeCompare(b.name);
-                if (nc !== 0)
-                    return nc;
-                const sc = a.scope.localeCompare(b.scope);
-                if (sc !== 0)
-                    return sc;
-                const pc = a.unit.physicalRelativePath.localeCompare(b.unit.physicalRelativePath);
-                return pc !== 0 ? pc : a.line - b.line;
-            });
-            const keyOf = (m) => `${m.name}:${m.scope}:${m.unit.physicalRelativePath}:${String(m.line).padStart(7, '0')}`;
-            const page = paginate(matches, { limit, cursor }, { defaultLimit: 10, maxLimit: 100, keyOf, total: 'omit' });
-            const output = {
-                query,
-                matches: matches.length,
-                hits: page.items.map(({ unit, ...match }) => (includePaths ? { ...match, ...pathFields(unit) } : match)),
-                next_cursor: page.next_cursor,
-                follow_up: 'Read a hit with `crtr memory read <name>`. Run `crtr memory find -h` for filters and verbosity.',
-            };
-            registerMemoryListingExposure(listingIdentity);
-            return output;
-        }
-        // ranked mode: weighted relevance over name/routing-line/short-form(+body)
-        const terms = query
-            .toLowerCase()
-            .split(/\s+/)
-            .filter((t) => t.length > 0);
-        if (terms.length === 0)
-            throw usage('query must contain at least one non-whitespace term');
-        const hits = [];
-        for (const u of units) {
-            // One name weight over three spellings of the same document: an agent
-            // searching a store-local name or a physical path is searching for the
-            // identity, and counting each spelling separately would inflate the band
-            // the adaptive floor is calibrated against.
-            const nameLc = u.name.toLowerCase();
-            const localLc = u.localName.toLowerCase();
-            const physLc = u.physicalRelativePath.toLowerCase();
-            const routingLc = u.routing.toLowerCase();
-            const shortLc = u.shortForm.toLowerCase();
-            const bodyLc = weighBody ? u.loadBody().toLowerCase() : null;
-            let score = 0;
-            for (const term of terms) {
-                if (nameLc.includes(term) || localLc.includes(term) || physLc.includes(term))
-                    score += 10;
-                if (routingLc.includes(term))
-                    score += 5;
-                if (shortLc.includes(term))
-                    score += 3;
-                if (bodyLc !== null && bodyLc.includes(term))
-                    score += 1;
-            }
-            if (score > 0)
-                hits.push({ unit: u, score });
-        }
-        // Sort comparator MUST match keyOf exactly (score desc, then scope asc,
-        // then name asc, then physical path asc — which is unique even under --dir,
-        // where two documents can share one canonical name). Sorting equal-score
-        // hits by one order while the cursor key uses another would let the array
-        // disagree with its own keys, and paginate() would silently skip an item.
-        hits.sort((a, b) => {
-            if (b.score !== a.score)
-                return b.score - a.score;
-            const scopeCmp = a.unit.scope.localeCompare(b.unit.scope);
-            if (scopeCmp !== 0)
-                return scopeCmp;
-            const nameCmp = a.unit.name.localeCompare(b.unit.name);
-            if (nameCmp !== 0)
-                return nameCmp;
-            return a.unit.physicalRelativePath.localeCompare(b.unit.physicalRelativePath);
-        });
-        const adaptiveFloor = hits.length === 0 ? 1 : Math.max(1, Math.ceil(hits[0].score / 2));
-        const floor = minScore ?? adaptiveFloor;
-        const relevant = hits.filter((hit) => hit.score >= floor);
-        // relevant is already sorted score-desc/scope-asc/name-asc, which is
-        // exactly ascending order by this key (higher score → smaller key),
-        // satisfying paginate's ascending-key precondition.
-        const keyOf = (h) => `${String(1_000_000 - h.score).padStart(7, '0')}:${h.unit.scope}:${h.unit.name}:${h.unit.physicalRelativePath}`;
-        const page = paginate(relevant, { limit, cursor }, { defaultLimit: 10, maxLimit: 100, keyOf, total: 'omit' });
-        const output = {
-            query,
-            matches: hits.length,
-            hits: page.items.map((h) => ({
-                name: h.unit.name,
-                kind: h.unit.kind,
-                scope: h.unit.scope,
-                score: h.score,
-                short_form: h.unit.shortForm,
-                ...(includePaths ? pathFields(h.unit) : {}),
-            })),
-            next_cursor: page.next_cursor,
-            follow_up: 'Read a hit with `crtr memory read <name>`. Run `crtr memory find -h` for filters and verbosity.',
-        };
-        registerMemoryListingExposure(listingIdentity);
-        return output;
-    },
-});
+var B=Object.defineProperty;var u=(t,r)=>B(t,"name",{value:r,configurable:!0});import{defineLeaf as T}from"../../core/command.js";import{usage as y}from"../../core/errors.js";import{listAllMemoryDocs as I,loadMemoryStoreView as W}from"../../core/memory-resolver.js";import{parseSubstrateDoc as j}from"../../core/substrate/schema.js";import{paginate as M}from"../../core/pagination.js";import{candidateRow as K}from"./read.js";import{MEMORY_KINDS as U,registerMemoryListingExposure as P,requireMountedStore as G,resolveReadSelector as J,selectorParam as O}from"./shared.js";function $(t,r,g){const p=new Map;for(const a of r){const o=p.get(a.name);o!==void 0?o.push(a):p.set(a.name,[a])}const d=new Set,m=[];for(const a of r){const o=j(a);if(o!==null&&!(t!==void 0&&o.kind!==t)){if(g){if(d.has(o.name))continue;d.add(o.name)}m.push({name:o.name,localName:a.localName,kind:o.kind,scope:o.scope,path:o.path,storeRoot:a.root,physicalRelativePath:a.physicalRelativePath,routing:o.whenAndWhyToRead,shortForm:o.shortForm,candidates:p.get(a.name)??[a],loadBody:u(()=>o.body,"loadBody")})}}return m}u($,"searchUnits");function A(t){return{path:t.path,store_root:t.storeRoot,physical_relative_path:t.physicalRelativePath,...t.candidates.length>1?{candidates:t.candidates.map(r=>K(r,t.candidates[0]))}:{}}}u(A,"pathFields");const oe=T({name:"find",description:"relevance search across memory documents",whenToUse:"the discovery surface when you do NOT know a document\u2019s canonical name \u2014 ranks documents by relevance over the canonical name, the store-local name, the physical path, the read-routing line, and short-form (add --body to also weigh body text), and every hit reports the canonical name `crtr memory read` takes. Searches every scope by default regardless of any visibility gate; --scope narrows to one class of store, --dir to one exact store. Reach for `crtr memory list` instead when you want the whole inventory rather than a topic match, and --grep when you need an exact regex or literal-string match across document bodies.",help:{name:"memory find",summary:"bounded relevance search across memory documents, weighted over name/local name/physical path/routing-line/short-form (and body with --body)",params:[{kind:"positional",name:"query",required:!0,constraint:"With ranked search (default): whitespace-separated terms, matched case-insensitively and weighted over the document\u2019s names (canonical, store-local, and physical path), the read-routing line, and short-form (plus body with --body); documents matching more/stronger fields rank higher. By default returns at most 10 hits scoring at least half the top score. With --grep: an ECMAScript regex applied to each document body line."},{kind:"flag",name:"kind",type:"enum",choices:[...U],required:!1,constraint:"Filter to a single kind. Default: all kinds."},O("scope-read",{},"Default: every resolved scope, builtin included."),O("dir",{},"Searches that store alone, and searches it physically: two documents sharing one canonical name are both searched and both reported, where the default view searches only the winner."),{kind:"flag",name:"grep",type:"bool",required:!1,constraint:"Treat the query as an ECMAScript regex and match it against document bodies, instead of weighted relevance ranking. Mutually exclusive with --body."},{kind:"flag",name:"body",type:"bool",required:!1,constraint:"Also weigh document body text in the relevance ranking (in addition to name/when/why/short-form). Ignored under --grep, which always scans bodies."},{kind:"flag",name:"limit",type:"int",required:!1,constraint:"Maximum hits to return per page after relevance filtering. Default 10, hard max 100."},{kind:"flag",name:"cursor",type:"string",required:!1,constraint:"Opaque token from next_cursor. Omit on first call."},{kind:"flag",name:"min-score",type:"int",required:!1,constraint:"Ranked mode only. Minimum score to return, replacing the default adaptive floor of half the top score. Must be at least 1."},{kind:"flag",name:"paths",type:"bool",required:!1,constraint:"Include each hit\u2019s physical location \u2014 absolute path, store root, store-relative path, and every other physical document sharing its canonical name. Off by default; the canonical name is sufficient for `crtr memory read <name>`."}],output:[{name:"query",type:"string",required:!0,constraint:"Echo of the input query."},{name:"matches",type:"integer",required:!0,constraint:"Total matches before the default relevance floor and limit are applied (ranked mode) or total matching lines (grep mode) \u2014 across all pages, not just this one."},{name:"hits",type:"object[]",required:!0,constraint:"Ranked mode \u2014 each: {name, kind, scope, score, short_form}, sorted by score descending. Grep mode \u2014 each: {name, scope, line, text}, sorted by name then line. `name` is always the canonical name, whatever field matched. With --paths, each shape also carries path, store_root, physical_relative_path, and candidates when several physical documents share the name. Paginated via --limit/--cursor."},{name:"next_cursor",type:"string | null",required:!0,constraint:"Opaque token for the next page; null means no more items."},{name:"follow_up",type:"string",required:!0,constraint:"Concrete next commands for reading a hit in full or refining the search."}],outputKind:"object",effects:["Records this search page as listing context for the current node without marking any matched document as loaded."]},run:u(async t=>{const r=t.query,g=t.kind,p=t.dir,d=J({scope:t.scope,dir:p}),m=t.grep,a=t.body,o=t.limit,b=t.cursor,w=t.minScore,k=t.paths;if(m&&a)throw y("--grep and --body are mutually exclusive (--grep always scans bodies).");if(m&&w!==void 0)throw y("--min-score is only available in ranked mode.");if(o!==void 0&&(o<1||o>100))throw y("--limit must be between 1 and 100.");if(w!==void 0&&w<1)throw y("--min-score must be at least 1.");const x=o??10,q=`listing:memory-find:${JSON.stringify({query:r,kind:g??null,scope:d.scope??null,dir:p??null,grep:m===!0,body:a===!0,limit:x,cursor:b??null,minScore:w??null,paths:k===!0})}`,L=d.store!==null?$(g,W(G(d.store),!1).docs,!1):$(g,I(d.scope,!1,!0),!0);if(m){let e;try{e=new RegExp(r)}catch{throw y(`invalid regex pattern: ${r}`)}const s=[];for(const n of L)n.loadBody().split(`
+`).forEach((i,l)=>{e.test(i)&&s.push({name:n.name,scope:n.scope,unit:n,line:l+1,text:i})});s.sort((n,c)=>{const i=n.name.localeCompare(c.name);if(i!==0)return i;const l=n.scope.localeCompare(c.scope);if(l!==0)return l;const S=n.unit.physicalRelativePath.localeCompare(c.unit.physicalRelativePath);return S!==0?S:n.line-c.line});const h=M(s,{limit:x,cursor:b},{defaultLimit:10,maxLimit:100,keyOf:u(n=>`${n.name}:${n.scope}:${n.unit.physicalRelativePath}:${String(n.line).padStart(7,"0")}`,"keyOf"),total:"omit"}),R={query:r,matches:s.length,hits:h.items.map(({unit:n,...c})=>k?{...c,...A(n)}:c),next_cursor:h.next_cursor,follow_up:"Read a hit with `crtr memory read <name>`. Run `crtr memory find -h` for filters and verbosity."};return P(q),R}const _=r.toLowerCase().split(/\s+/).filter(e=>e.length>0);if(_.length===0)throw y("query must contain at least one non-whitespace term");const f=[];for(const e of L){const s=e.name.toLowerCase(),v=e.localName.toLowerCase(),h=e.physicalRelativePath.toLowerCase(),R=e.routing.toLowerCase(),n=e.shortForm.toLowerCase(),c=a?e.loadBody().toLowerCase():null;let i=0;for(const l of _)(s.includes(l)||v.includes(l)||h.includes(l))&&(i+=10),R.includes(l)&&(i+=5),n.includes(l)&&(i+=3),c!==null&&c.includes(l)&&(i+=1);i>0&&f.push({unit:e,score:i})}f.sort((e,s)=>{if(s.score!==e.score)return s.score-e.score;const v=e.unit.scope.localeCompare(s.unit.scope);if(v!==0)return v;const h=e.unit.name.localeCompare(s.unit.name);return h!==0?h:e.unit.physicalRelativePath.localeCompare(s.unit.physicalRelativePath)});const E=f.length===0?1:Math.max(1,Math.ceil(f[0].score/2)),F=w??E,N=f.filter(e=>e.score>=F),C=M(N,{limit:x,cursor:b},{defaultLimit:10,maxLimit:100,keyOf:u(e=>`${String(1e6-e.score).padStart(7,"0")}:${e.unit.scope}:${e.unit.name}:${e.unit.physicalRelativePath}`,"keyOf"),total:"omit"}),D={query:r,matches:f.length,hits:C.items.map(e=>({name:e.unit.name,kind:e.unit.kind,scope:e.unit.scope,score:e.score,short_form:e.unit.shortForm,...k?A(e.unit):{}})),next_cursor:C.next_cursor,follow_up:"Read a hit with `crtr memory read <name>`. Run `crtr memory find -h` for filters and verbosity."};return P(q),D},"run")});export{oe as findLeaf};

package/dist/commands/memory/history.js

@@ -1,199 +1,5 @@
-import { defineLeaf } from '../../core/command.js';
-import { CrtrError, notFound, usage } from '../../core/errors.js';
-import { nativeMemoryStoresInPrecedence, resolveMemoryDoc, resolveMemoryDocInStore, } from '../../core/memory-resolver.js';
-import { renderResult } from '../../core/render.js';
-import { historyLogPathForDoc, readHistoryRecords, resolveDeletedHistoryLogPath, summarizeChange, unifiedDiff, } from '../../core/memory/history.js';
-import { requireCanonicalName, requireLocalNameInStore, requireMountedStore, resolveReadSelector, selectorParam, } from './shared.js';
-import { stripNamespace } from '../../core/memory/identity.js';
-/** Locate a document's revision log. A live doc is resolved to its physical
- * descriptor first; a deleted doc is looked up in the selected store(s) by the
- * exact canonical name, stripping only that store's declared project namespace.
- * There is no scope-prefix or leaf fallback. */
-function resolveLog(nameRaw, selectorInput) {
-    const selector = resolveReadSelector(selectorInput);
-    if (selector.store !== null)
-        requireMountedStore(selector.store);
-    let doc;
-    try {
-        doc = selector.store !== null
-            ? resolveMemoryDocInStore(nameRaw, selector.store)
-            : resolveMemoryDoc(nameRaw, { includeDescendants: true, ...(selector.scope ? { scope: selector.scope } : {}) });
-    }
-    catch (e) {
-        if (!(e instanceof CrtrError && e.code === 'not_found'))
-            throw e;
-    }
-    if (doc !== undefined) {
-        if (doc.plugin !== undefined) {
-            throw usage(`${doc.name} belongs to the installed plugin "${doc.plugin}" — a read-only corpus with no revision history.`, {
-                memory: doc.name,
-                plugin: doc.plugin,
-            });
-        }
-        if (doc.scope === 'builtin') {
-            throw usage(`${doc.name} is a builtin document shipped with the package — a read-only corpus with no revision history.`, {
-                memory: doc.name,
-                scope: 'builtin',
-            });
-        }
-        return { name: doc.name, scope: doc.scope, logPath: historyLogPathForDoc(doc) };
-    }
-    const canonicalName = requireCanonicalName(nameRaw);
-    const stores = selector.store !== null
-        ? [{ scope: selector.store.scope, memoryDir: selector.store.storeRoot, store: selector.store }]
-        : nativeMemoryStoresInPrecedence(selector.scope, true);
-    for (const store of stores) {
-        if (selector.store === null && store.store.namespace !== '' && stripNamespace(canonicalName, store.store.namespace) === null)
-            continue;
-        const localName = requireLocalNameInStore(store.store, canonicalName);
-        const deleted = resolveDeletedHistoryLogPath(store.memoryDir, localName);
-        if (deleted !== null) {
-            return { name: canonicalName, scope: store.scope, logPath: deleted.logPath, deleted };
-        }
-    }
-    throw notFound(`no memory document or revision history found: ${nameRaw}`, {
-        memory: nameRaw,
-        next: 'Run `crtr memory find <query>` to locate the document. A document that exists but has no history predates this surface or has never been mutated through it.',
-    });
-}
-export const historyLeaf = defineLeaf({
-    name: 'history',
-    description: 'read a memory document\u2019s revision history',
-    whenToUse: 'you want to know how a document reached its current state \u2014 who revised it, when, why, and what changed per revision. Works for a deleted document too: the log outlives the doc. A diagnostics read; it advances nothing and changes nothing.',
-    help: {
-        name: 'memory history',
-        summary: 'list a document\u2019s revisions newest-first, with diffs or one full record on demand',
-        guide: 'Every mutation through `crtr memory write`, `edit`, `move`, and `delete` appends one self-contained record \u2014 complete document text before and after, plus who, when, and (on an edit) why. Diffs and revision numbers are derived here at read time, never stored.\n\n' +
-            'A record whose `before` differs from the previous record\u2019s `after` is the evidence of an out-of-band direct file edit; nothing prevents those, and nothing detects them beyond this.\n\n' +
-            'The log is a plain JSONL file at `log_path`, one JSON object per line \u2014 an external consumer reads it directly rather than through this command.',
-        params: [
-            { kind: 'positional', name: 'name', required: true, constraint: 'Full canonical memory name (a project document includes its namespace), resolved exactly. Deleted history uses the same canonical name and the selected store\u2019s physical sidecars; there is no leaf or scope-prefix fallback. Builtin and installed-plugin docs are read-only corpora and carry no history.' },
-            selectorParam('scope-read'),
-            selectorParam('dir'),
-            selectorParam('profile'),
-            { kind: 'flag', name: 'limit', type: 'int', required: false, default: 10, constraint: 'How many revisions to return, newest first. Default 10.' },
-            { kind: 'flag', name: 'diff', type: 'bool', required: false, constraint: 'Include a unified diff per listed revision, computed from that record\u2019s own before/after texts.' },
-            { kind: 'flag', name: 'revision', type: 'int', required: false, constraint: 'Show ONE revision in full \u2014 its metadata plus the complete before and after document texts. 1-based position in the log: the number `crtr memory edit` reports. Overrides --limit and --diff.' },
-            // Scope, --dir, and --profile are shared selector contracts above.
-        ],
-        output: [
-            { name: 'name', type: 'string', required: true, constraint: 'Resolved document name.' },
-            { name: 'scope', type: 'string', required: true, constraint: 'Scope whose store holds the log: node, project, profile, or user.' },
-            { name: 'log_path', type: 'string', required: true, constraint: 'Absolute path to the append-only JSONL log \u2014 the direct-consumption pointer, one self-contained record per line.' },
-            { name: 'history_candidates', type: 'object[]', required: false, constraint: 'Deleted-history physical candidates: {path, representation, winner}. The directory-index form is listed first and wins deterministically.' },
-            { name: 'history_collision', type: 'object', required: false, constraint: 'Present when deleted history has both physical forms: {paths, winner}.' },
-            { name: 'total', type: 'number', required: true, constraint: 'Total revisions in the log.' },
-            { name: 'revisions', type: 'object[]', required: false, constraint: 'Newest-first, capped by --limit. Each: {revision, op, at, node, rationale, body_changed, frontmatter_changed, diff}. `node` and `rationale` are present only when recorded; `diff` only with --diff. Absent when --revision selects one record.' },
-            { name: 'record', type: 'object', required: false, constraint: 'Present only with --revision: {revision, op, at, node, cwd, rationale, verbatim, before, after} \u2014 the full record including both complete document texts.' },
-            { name: 'follow_up', type: 'string', required: true, constraint: 'Concrete next commands \u2014 the flag variants and the doc read, or, for a deleted document, the revision carrying its retained final text.' },
-        ],
-        outputKind: 'object',
-        effects: ['None. Read-only.'],
-    },
-    // A unified diff is multi-line, and the default object[] renderer flattens it
-    // into one table cell. With --diff each revision gets its own block instead;
-    // every other shape falls through to the default rendering.
-    render: (result) => {
-        const revisions = result['revisions'];
-        if (revisions === undefined || !revisions.some((r) => typeof r['diff'] === 'string')) {
-            return renderResult(result, historyLeaf.help);
-        }
-        const blocks = revisions.map((r) => {
-            const meta = [`op: ${String(r['op'])}`, `at: ${String(r['at'])}`];
-            if (r['node'] !== undefined)
-                meta.push(`node: ${String(r['node'])}`);
-            if (r['verbatim'] === true)
-                meta.push('verbatim');
-            const fields = r['frontmatter_changed'] ?? [];
-            const changed = [
-                ...(r['body_changed'] === true ? ['body'] : []),
-                ...(fields.length > 0 ? [`frontmatter: ${fields.join(', ')}`] : []),
-            ];
-            const diff = String(r['diff'] ?? '');
-            return [
-                `## revision ${String(r['revision'])} \u2014 ${meta.join('  \u00b7  ')}`,
-                ...(r['rationale'] !== undefined ? [`rationale: ${String(r['rationale'])}`] : []),
-                `changed: ${changed.length > 0 ? changed.join('; ') : 'nothing'}`,
-                ...(diff === '' ? [] : ['', '```diff', diff, '```']),
-            ].join('\n');
-        });
-        return [
-            `- name: ${String(result['name'])}`,
-            `- scope: ${String(result['scope'])}`,
-            `- log_path: ${String(result['log_path'])}`,
-            `- total: ${String(result['total'])}`,
-            '',
-            blocks.join('\n\n'),
-            '',
-            String(result['follow_up']),
-        ].join('\n');
-    },
-    run: async (input) => {
-        const nameRaw = input['name'];
-        const scopeArg = input['scope'];
-        const dirArg = input['dir'];
-        const profileArg = input['profile'];
-        const limit = input['limit'] ?? 10;
-        const wantDiff = input['diff'] === true;
-        const revisionArg = input['revision'];
-        const { name, scope, logPath, deleted } = resolveLog(nameRaw, { scope: scopeArg, dir: dirArg, profile: profileArg });
-        const historyMeta = deleted === undefined ? {} : {
-            history_candidates: deleted.candidates,
-            ...(deleted.collision === undefined ? {} : { history_collision: deleted.collision }),
-        };
-        const records = readHistoryRecords(logPath);
-        if (records.length === 0) {
-            throw notFound(`no revision history recorded for ${name}`, {
-                memory: name,
-                next: 'The document predates this surface or has never been mutated through `crtr memory write`/`edit`/`delete`. Its first edit records the pre-existing content in full.',
-            });
-        }
-        if (revisionArg !== undefined) {
-            if (revisionArg < 1 || revisionArg > records.length) {
-                throw usage(`revision ${revisionArg} is out of range for ${name} (1..${records.length})`, {
-                    memory: name,
-                    next: `Run \`crtr memory history ${name}\` to see which revisions exist.`,
-                });
-            }
-            const r = records[revisionArg - 1];
-            return {
-                name,
-                scope,
-                log_path: logPath,
-                ...historyMeta,
-                total: records.length,
-                record: { revision: revisionArg, ...r },
-                follow_up: deleted === undefined
-                    ? `Read the document as it stands with \`crtr memory read ${name}\`, or list the revisions with \`crtr memory history ${name} --diff\`.`
-                    : `${name} is deleted — no read answers to it. This record's \`before\` is its text at that revision; the last revision (${records.length}) carries the text it was deleted with. List the revisions with \`crtr memory history ${name} --diff\`.`,
-            };
-        }
-        const revisions = records
-            .map((r, i) => {
-            const summary = summarizeChange(r.before, r.after);
-            return {
-                revision: i + 1,
-                op: r.op,
-                at: r.at,
-                ...(r.node !== undefined ? { node: r.node } : {}),
-                ...(r.rationale !== undefined ? { rationale: r.rationale } : {}),
-                ...(r.verbatim === true ? { verbatim: true } : {}),
-                ...summary,
-                ...(wantDiff ? { diff: unifiedDiff(r.before, r.after) } : {}),
-            };
-        })
-            .reverse()
-            .slice(0, Math.max(0, limit));
-        return {
-            name,
-            scope,
-            log_path: logPath,
-            ...historyMeta,
-            total: records.length,
-            revisions,
-            follow_up: deleted === undefined
-                ? `Add --diff for per-revision unified diffs, --revision N for one record's full before/after text, or read the document as it stands with \`crtr memory read ${name}\`.`
-                : `${name} is deleted and only this log survives — no read answers to it. Add --diff for per-revision unified diffs, or recover its final text with \`crtr memory history ${name} --revision ${records.length}\`, whose \`before\` is the document as it stood when deleted.`,
-        };
-    },
-});
+var x=Object.defineProperty;var h=(t,a)=>x(t,"name",{value:a,configurable:!0});import{defineLeaf as S}from"../../core/command.js";import{CrtrError as _,notFound as v,usage as u}from"../../core/errors.js";import{nativeMemoryStoresInPrecedence as q,resolveMemoryDoc as j,resolveMemoryDocInStore as D}from"../../core/memory-resolver.js";import{renderResult as N}from"../../core/render.js";import{historyLogPathForDoc as A,readHistoryRecords as P,resolveDeletedHistoryLogPath as k,summarizeChange as L,unifiedDiff as M}from"../../core/memory/history.js";import{requireCanonicalName as R,requireLocalNameInStore as T,requireMountedStore as I,resolveReadSelector as O,selectorParam as p}from"./shared.js";import{stripNamespace as C}from"../../core/memory/identity.js";function E(t,a){const r=O(a);r.store!==null&&I(r.store);let e;try{e=r.store!==null?D(t,r.store):j(t,{includeDescendants:!0,...r.scope?{scope:r.scope}:{}})}catch(n){if(!(n instanceof _&&n.code==="not_found"))throw n}if(e!==void 0){if(e.plugin!==void 0)throw u(`${e.name} belongs to the installed plugin "${e.plugin}" \u2014 a read-only corpus with no revision history.`,{memory:e.name,plugin:e.plugin});if(e.scope==="builtin")throw u(`${e.name} is a builtin document shipped with the package \u2014 a read-only corpus with no revision history.`,{memory:e.name,scope:"builtin"});return{name:e.name,scope:e.scope,logPath:A(e)}}const d=R(t),l=r.store!==null?[{scope:r.store.scope,memoryDir:r.store.storeRoot,store:r.store}]:q(r.scope,!0);for(const n of l){if(r.store===null&&n.store.namespace!==""&&C(d,n.store.namespace)===null)continue;const s=T(n.store,d),o=k(n.memoryDir,s);if(o!==null)return{name:d,scope:n.scope,logPath:o.logPath,deleted:o}}throw v(`no memory document or revision history found: ${t}`,{memory:t,next:"Run `crtr memory find <query>` to locate the document. A document that exists but has no history predates this surface or has never been mutated through it."})}h(E,"resolveLog");const F=S({name:"history",description:"read a memory document\u2019s revision history",whenToUse:"you want to know how a document reached its current state \u2014 who revised it, when, why, and what changed per revision. Works for a deleted document too: the log outlives the doc. A diagnostics read; it advances nothing and changes nothing.",help:{name:"memory history",summary:"list a document\u2019s revisions newest-first, with diffs or one full record on demand",guide:"Every mutation through `crtr memory write`, `edit`, `move`, and `delete` appends one self-contained record \u2014 complete document text before and after, plus who, when, and (on an edit) why. Diffs and revision numbers are derived here at read time, never stored.\n\nA record whose `before` differs from the previous record\u2019s `after` is the evidence of an out-of-band direct file edit; nothing prevents those, and nothing detects them beyond this.\n\nThe log is a plain JSONL file at `log_path`, one JSON object per line \u2014 an external consumer reads it directly rather than through this command.",params:[{kind:"positional",name:"name",required:!0,constraint:"Full canonical memory name (a project document includes its namespace), resolved exactly. Deleted history uses the same canonical name and the selected store\u2019s physical sidecars; there is no leaf or scope-prefix fallback. Builtin and installed-plugin docs are read-only corpora and carry no history."},p("scope-read"),p("dir"),p("profile"),{kind:"flag",name:"limit",type:"int",required:!1,default:10,constraint:"How many revisions to return, newest first. Default 10."},{kind:"flag",name:"diff",type:"bool",required:!1,constraint:"Include a unified diff per listed revision, computed from that record\u2019s own before/after texts."},{kind:"flag",name:"revision",type:"int",required:!1,constraint:"Show ONE revision in full \u2014 its metadata plus the complete before and after document texts. 1-based position in the log: the number `crtr memory edit` reports. Overrides --limit and --diff."}],output:[{name:"name",type:"string",required:!0,constraint:"Resolved document name."},{name:"scope",type:"string",required:!0,constraint:"Scope whose store holds the log: node, project, profile, or user."},{name:"log_path",type:"string",required:!0,constraint:"Absolute path to the append-only JSONL log \u2014 the direct-consumption pointer, one self-contained record per line."},{name:"history_candidates",type:"object[]",required:!1,constraint:"Deleted-history physical candidates: {path, representation, winner}. The directory-index form is listed first and wins deterministically."},{name:"history_collision",type:"object",required:!1,constraint:"Present when deleted history has both physical forms: {paths, winner}."},{name:"total",type:"number",required:!0,constraint:"Total revisions in the log."},{name:"revisions",type:"object[]",required:!1,constraint:"Newest-first, capped by --limit. Each: {revision, op, at, node, rationale, body_changed, frontmatter_changed, diff}. `node` and `rationale` are present only when recorded; `diff` only with --diff. Absent when --revision selects one record."},{name:"record",type:"object",required:!1,constraint:"Present only with --revision: {revision, op, at, node, cwd, rationale, verbatim, before, after} \u2014 the full record including both complete document texts."},{name:"follow_up",type:"string",required:!0,constraint:"Concrete next commands \u2014 the flag variants and the doc read, or, for a deleted document, the revision carrying its retained final text."}],outputKind:"object",effects:["None. Read-only."]},render:h(t=>{const a=t.revisions;if(a===void 0||!a.some(e=>typeof e.diff=="string"))return N(t,F.help);const r=a.map(e=>{const d=[`op: ${String(e.op)}`,`at: ${String(e.at)}`];e.node!==void 0&&d.push(`node: ${String(e.node)}`),e.verbatim===!0&&d.push("verbatim");const l=e.frontmatter_changed??[],n=[...e.body_changed===!0?["body"]:[],...l.length>0?[`frontmatter: ${l.join(", ")}`]:[]],s=String(e.diff??"");return[`## revision ${String(e.revision)} \u2014 ${d.join("  \xB7  ")}`,...e.rationale!==void 0?[`rationale: ${String(e.rationale)}`]:[],`changed: ${n.length>0?n.join("; "):"nothing"}`,...s===""?[]:["","```diff",s,"```"]].join(`
+`)});return[`- name: ${String(t.name)}`,`- scope: ${String(t.scope)}`,`- log_path: ${String(t.log_path)}`,`- total: ${String(t.total)}`,"",r.join(`
+
+`),"",String(t.follow_up)].join(`
+`)},"render"),run:h(async t=>{const a=t.name,r=t.scope,e=t.dir,d=t.profile,l=t.limit??10,n=t.diff===!0,s=t.revision,{name:o,scope:y,logPath:m,deleted:f}=E(a,{scope:r,dir:e,profile:d}),g=f===void 0?{}:{history_candidates:f.candidates,...f.collision===void 0?{}:{history_collision:f.collision}},c=P(m);if(c.length===0)throw v(`no revision history recorded for ${o}`,{memory:o,next:"The document predates this surface or has never been mutated through `crtr memory write`/`edit`/`delete`. Its first edit records the pre-existing content in full."});if(s!==void 0){if(s<1||s>c.length)throw u(`revision ${s} is out of range for ${o} (1..${c.length})`,{memory:o,next:`Run \`crtr memory history ${o}\` to see which revisions exist.`});const i=c[s-1];return{name:o,scope:y,log_path:m,...g,total:c.length,record:{revision:s,...i},follow_up:f===void 0?`Read the document as it stands with \`crtr memory read ${o}\`, or list the revisions with \`crtr memory history ${o} --diff\`.`:`${o} is deleted \u2014 no read answers to it. This record's \`before\` is its text at that revision; the last revision (${c.length}) carries the text it was deleted with. List the revisions with \`crtr memory history ${o} --diff\`.`}}const w=c.map((i,b)=>{const $=L(i.before,i.after);return{revision:b+1,op:i.op,at:i.at,...i.node!==void 0?{node:i.node}:{},...i.rationale!==void 0?{rationale:i.rationale}:{},...i.verbatim===!0?{verbatim:!0}:{},...$,...n?{diff:M(i.before,i.after)}:{}}}).reverse().slice(0,Math.max(0,l));return{name:o,scope:y,log_path:m,...g,total:c.length,revisions:w,follow_up:f===void 0?`Add --diff for per-revision unified diffs, --revision N for one record's full before/after text, or read the document as it stands with \`crtr memory read ${o}\`.`:`${o} is deleted and only this log survives \u2014 no read answers to it. Add --diff for per-revision unified diffs, or recover its final text with \`crtr memory history ${o} --revision ${c.length}\`, whose \`before\` is the document as it stood when deleted.`}},"run")});export{F as historyLeaf};

package/dist/commands/memory/lint.js

@@ -1,107 +1 @@
-// `crtr memory lint` — the selector/help wrapper over the memory lint engine
-// (`core/memory/lint.ts`). Every rule lives in the engine, which migration
-// verification, the plugin candidate gate, and the build's builtin gate consume
-// too; this leaf only picks WHAT to lint (a target view, or one exact store
-// with --dir) and shapes the findings for the CLI.
-import { envProfileId } from '../../shared/env.js';
-import { defineLeaf } from '../../core/command.js';
-import { warn } from '../../core/output.js';
-import { ExitCode } from '../../types.js';
-import { lintMemoryStore, lintMemoryTarget, lintOrphans, resolvableCanonicalNames, } from '../../core/memory/lint.js';
-import { loadMemoryTargetView } from '../../core/memory-resolver.js';
-import { resolveReadSelector, selectorParam } from './shared.js';
-function findingRow(finding) {
-    return {
-        rule: finding.rule,
-        path: finding.path,
-        message: finding.message,
-        ...(finding.name === undefined ? {} : { name: finding.name }),
-        ...(finding.scope === undefined ? {} : { scope: finding.scope }),
-        ...(finding.storeRoot === undefined ? {} : { store_root: finding.storeRoot }),
-        ...(finding.paths === undefined ? {} : { paths: [...finding.paths] }),
-    };
-}
-/** The target view an agent standing in a `--dir` store's project sees. Both a
- *  project doc's links/routes and its reachability are resolved against this,
- *  never the store in isolation — a project doc legitimately links a user or
- *  builtin doc, and is legitimately reached from one. */
-function targetViewForStore(store) {
-    return loadMemoryTargetView({
-        cwd: store.ownerDir ?? store.storeRoot,
-        profileId: envProfileId() || null,
-        nodeId: null,
-    }, { quiet: true, includeDescendants: true });
-}
-export const lintLeaf = defineLeaf({
-    name: 'lint',
-    description: 'validate memory identity, frontmatter, and references across a target view or one exact store',
-    whenToUse: 'you authored, moved, or migrated documents and want the authoring-time gate before shipping them. It strict-parses every doc the selection covers and fails on: invalid YAML or substrate schema, a repository whose root store declares no valid `namespace:` (so the runtime refuses to mount it), a `namespace:` outside the repository-root store\u2019s root INDEX.md, two directories in one repository whose paths normalize to the same prefix, a `name:` on a root INDEX.md or a non-root `name:` that is not a valid store-LOCAL name, two files in one store owning one canonical identity, a `[[link]]` or literal `memory-read` route naming no document or directory in the view (a directory\u2019s own document answers at the directory name, never at `<dir>/INDEX`), a body longer than its delivery entries earn, and a repository whose root store’s workspace front door is missing or sits anywhere but its root INDEX.md. One canonical identity held by SEVERAL stores is legitimate (a linked worktree sharing its main checkout\u2019s namespace), so it is reported as a notice with the view\u2019s winner and every candidate, never failed. CI-friendly: non-zero exit on any error, warnings and notices stay non-fatal.',
-    help: {
-        name: 'memory lint',
-        summary: 'validate canonical identity, frontmatter, and references across the memory corpus',
-        params: [
-            selectorParam('scope-read', {}, 'Lints only that source class. Cross-store candidate notices and project front-door coverage need the unfiltered view, so a scope filter suppresses them.'),
-            selectorParam('dir', {}, 'Lints that one store even when the runtime refuses to mount it — the only way to check a project store before its repository namespace is declared. Its links and routes are resolved against the target view that project\u2019s own directory sees, and an unmounted store defers those reference checks (its identities are undetermined until the namespace exists).'),
-        ],
-        output: [
-            { name: 'checked', type: 'number', required: true, constraint: 'Markdown files examined.' },
-            { name: 'stores', type: 'number', required: true, constraint: 'Physical memory stores linted.' },
-            { name: 'profile_projects', type: 'number', required: false, constraint: 'Projects the selected profile manages that were checked for a workspace front door — zero under a scope filter excluding project stores. Absent under --dir.' },
-            { name: 'findings', type: 'object[]', required: true, constraint: 'One row per ERROR: {rule, path, message, name?, scope?, store_root?, paths?}. `rule` names the violated rule (yaml, schema, extension, length, store-namespace, namespace-placement, root-name, root-index-unaddressable, local-name, canonical-collision, dangling-link, memory-read-route, front-door, owner-path-collision). `paths` carries every file sharing a collided identity, read winner first. Empty when green.' },
-            { name: 'warnings', type: 'object[]', required: true, constraint: 'Same row shape, non-fatal authoring smells: short-preview, broad-memory-read, nested-store-boot, an advisory missing front door, a wildcard memory-read glob matching nothing, and orphan (a doc no reachability path routes an agent to — unfiltered target/--dir view only, never under --scope).' },
-            { name: 'notices', type: 'object[]', required: true, constraint: 'Same row shape, inspection data rather than faults: cross-store-candidates (one canonical name held by several stores, winner first) and reference-check-deferred.' },
-            { name: 'follow_up', type: 'string', required: true, constraint: 'Concrete next command.' },
-        ],
-        outputKind: 'object',
-        effects: ['None. Read-only. Exits non-zero when any error finding exists.'],
-    },
-    run: async (input) => {
-        const selector = resolveReadSelector({
-            scope: input['scope'],
-            dir: input['dir'],
-        });
-        let result;
-        if (selector.store !== null) {
-            const view = targetViewForStore(selector.store);
-            const base = lintMemoryStore(selector.store, {
-                resolvable: resolvableCanonicalNames(view.docs),
-                // Asked about directly, not as a profile-managed project: a missing
-                // front door is a gap to report, not a failed gate.
-                frontDoor: 'advisory',
-            });
-            // Reachability is a whole-view property, so orphans are computed over the
-            // project's target view but flagged only for this store's own docs.
-            const orphans = lintOrphans(view.docs, { flagStoreRoot: selector.store.storeRoot });
-            result = { ...base, findings: [...base.findings, ...orphans], warnings: [...base.warnings, ...orphans] };
-        }
-        else {
-            result = lintMemoryTarget({ ...(selector.scope === undefined ? {} : { scope: selector.scope }) });
-        }
-        const errors = result.errors.map(findingRow);
-        const warnings = result.warnings.map(findingRow);
-        const notices = result.notices.map(findingRow);
-        const counts = {
-            checked: result.checked,
-            stores: result.storesLinted,
-            ...('profileProjects' in result ? { profile_projects: result.profileProjects } : {}),
-        };
-        for (const finding of [...result.warnings, ...result.errors]) {
-            warn(`memory lint: ${finding.rule}: ${finding.path}: ${finding.message}`);
-        }
-        // A failing lint still owes its declared rows — the findings ARE the
-        // result. It fails by exit code, not by throwing them away.
-        if (errors.length > 0)
-            process.exitCode = ExitCode.GENERAL;
-        return {
-            ...counts,
-            findings: errors,
-            warnings,
-            notices,
-            follow_up: errors.length > 0
-                ? `${errors.length} error(s) across ${result.checked} files in ${result.storesLinted} store(s) — fix each, then re-run. A repository store that does not mount is repaired with \`crtr sys migrate --dir <repository-root>\`; an owner-path collision is fixed by renaming one of the directories named in the finding; a canonical collision is recovered with \`crtr memory move <name> --to <new-free-name>\` (it selects the first physical path in stable lexical order); a dangling link or route is retargeted with the name \`crtr memory find <leaf>\` reports, or dropped; an over-length body splits into [[linked]] surface-less reference docs.`
-                : warnings.length > 0
-                    ? 'No errors — review the warnings above, then revise with `crtr memory edit <name> --rationale "<why>"`.'
-                    : 'No errors. Notices are inspection data, not faults: a canonical name held by several stores is reachable per-store with `crtr memory read <name> --dir <project>`.',
-        };
-    },
-});
+var h=Object.defineProperty;var s=(e,o)=>h(e,"name",{value:o,configurable:!0});import{envProfileId as u}from"../../shared/env.js";import{defineLeaf as f}from"../../core/command.js";import{warn as y}from"../../core/output.js";import{ExitCode as w}from"../../types.js";import{lintMemoryStore as g,lintMemoryTarget as v,lintOrphans as b,resolvableCanonicalNames as k}from"../../core/memory/lint.js";import{loadMemoryTargetView as x}from"../../core/memory-resolver.js";import{resolveReadSelector as j,selectorParam as l}from"./shared.js";function i(e){return{rule:e.rule,path:e.path,message:e.message,...e.name===void 0?{}:{name:e.name},...e.scope===void 0?{}:{scope:e.scope},...e.storeRoot===void 0?{}:{store_root:e.storeRoot},...e.paths===void 0?{}:{paths:[...e.paths]}}}s(i,"findingRow");function R(e){return x({cwd:e.ownerDir??e.storeRoot,profileId:u()||null,nodeId:null},{quiet:!0,includeDescendants:!0})}s(R,"targetViewForStore");const A=f({name:"lint",description:"validate memory identity, frontmatter, and references across a target view or one exact store",whenToUse:"you authored, moved, or migrated documents and want the authoring-time gate before shipping them. It strict-parses every doc the selection covers and fails on: invalid YAML or substrate schema, a repository whose root store declares no valid `namespace:` (so the runtime refuses to mount it), a `namespace:` outside the repository-root store\u2019s root INDEX.md, two directories in one repository whose paths normalize to the same prefix, a `name:` on a root INDEX.md or a non-root `name:` that is not a valid store-LOCAL name, two files in one store owning one canonical identity, a `[[link]]` or literal `memory-read` route naming no document or directory in the view (a directory\u2019s own document answers at the directory name, never at `<dir>/INDEX`), a body longer than its delivery entries earn, and a repository whose root store\u2019s workspace front door is missing or sits anywhere but its root INDEX.md. One canonical identity held by SEVERAL stores is legitimate (a linked worktree sharing its main checkout\u2019s namespace), so it is reported as a notice with the view\u2019s winner and every candidate, never failed. CI-friendly: non-zero exit on any error, warnings and notices stay non-fatal.",help:{name:"memory lint",summary:"validate canonical identity, frontmatter, and references across the memory corpus",params:[l("scope-read",{},"Lints only that source class. Cross-store candidate notices and project front-door coverage need the unfiltered view, so a scope filter suppresses them."),l("dir",{},"Lints that one store even when the runtime refuses to mount it \u2014 the only way to check a project store before its repository namespace is declared. Its links and routes are resolved against the target view that project\u2019s own directory sees, and an unmounted store defers those reference checks (its identities are undetermined until the namespace exists).")],output:[{name:"checked",type:"number",required:!0,constraint:"Markdown files examined."},{name:"stores",type:"number",required:!0,constraint:"Physical memory stores linted."},{name:"profile_projects",type:"number",required:!1,constraint:"Projects the selected profile manages that were checked for a workspace front door \u2014 zero under a scope filter excluding project stores. Absent under --dir."},{name:"findings",type:"object[]",required:!0,constraint:"One row per ERROR: {rule, path, message, name?, scope?, store_root?, paths?}. `rule` names the violated rule (yaml, schema, extension, length, store-namespace, namespace-placement, root-name, root-index-unaddressable, local-name, canonical-collision, dangling-link, memory-read-route, front-door, owner-path-collision). `paths` carries every file sharing a collided identity, read winner first. Empty when green."},{name:"warnings",type:"object[]",required:!0,constraint:"Same row shape, non-fatal authoring smells: short-preview, broad-memory-read, nested-store-boot, an advisory missing front door, a wildcard memory-read glob matching nothing, and orphan (a doc no reachability path routes an agent to \u2014 unfiltered target/--dir view only, never under --scope)."},{name:"notices",type:"object[]",required:!0,constraint:"Same row shape, inspection data rather than faults: cross-store-candidates (one canonical name held by several stores, winner first) and reference-check-deferred."},{name:"follow_up",type:"string",required:!0,constraint:"Concrete next command."}],outputKind:"object",effects:["None. Read-only. Exits non-zero when any error finding exists."]},run:s(async e=>{const o=j({scope:e.scope,dir:e.dir});let r;if(o.store!==null){const t=R(o.store),a=g(o.store,{resolvable:k(t.docs),frontDoor:"advisory"}),d=b(t.docs,{flagStoreRoot:o.store.storeRoot});r={...a,findings:[...a.findings,...d],warnings:[...a.warnings,...d]}}else r=v({...o.scope===void 0?{}:{scope:o.scope}});const n=r.errors.map(i),c=r.warnings.map(i),m=r.notices.map(i),p={checked:r.checked,stores:r.storesLinted,..."profileProjects"in r?{profile_projects:r.profileProjects}:{}};for(const t of[...r.warnings,...r.errors])y(`memory lint: ${t.rule}: ${t.path}: ${t.message}`);return n.length>0&&(process.exitCode=w.GENERAL),{...p,findings:n,warnings:c,notices:m,follow_up:n.length>0?`${n.length} error(s) across ${r.checked} files in ${r.storesLinted} store(s) \u2014 fix each, then re-run. A repository store that does not mount is repaired with \`crtr sys migrate --dir <repository-root>\`; an owner-path collision is fixed by renaming one of the directories named in the finding; a canonical collision is recovered with \`crtr memory move <name> --to <new-free-name>\` (it selects the first physical path in stable lexical order); a dangling link or route is retargeted with the name \`crtr memory find <leaf>\` reports, or dropped; an over-length body splits into [[linked]] surface-less reference docs.`:c.length>0?'No errors \u2014 review the warnings above, then revise with `crtr memory edit <name> --rationale "<why>"`.':"No errors. Notices are inspection data, not faults: a canonical name held by several stores is reachable per-store with `crtr memory read <name> --dir <project>`."}},"run")});export{A as lintLeaf};