@north-light/crouter 0.3.317 → 0.3.319

package/dist/core/substrate/render.js

@@ -1,689 +1,65 @@
-// render.ts — the pure render functions for the document substrate: two boot
-// targets plus the config-change delta.
-//
-// Two boot targets, one shape per kind: each kind renders as ONE wrapped block —
-// intro prose → GROUPED content → an update directive. The render is grouped
-// by boot rung, not interleaved: `content`-rung docs render FIRST as
-// clean prose bodies (verbatim, no tree chrome, no name label — this is what
-// makes content-rung the persona-prose mechanism), in general→specific order;
-// then the `preview`+`name` docs render as ONE catalog tree, each at its own
-// rung (preview → a `# read when:` routing line; name → a bare entry), a
-// directory that carries its own document rendering that entry on the
-// directory's own row; a doc with NO boot entry leaks only into its dir's
-// `[+N more]` count, never a name — EXCEPT a node-store doc with no boot entry,
-// which the plan floors up to `name` so it still shows its bare name rather
-// than collapsing into a hidden count. A node-store doc with boot entries
-// remains absent when none of those entries participates.
-//
-//   • the SYSTEM-PROMPT half — `<memory kind="preference">`
-//     (renderPreferencesSection) — the always-present memory-usage guidance plus
-//     the eligible preference docs, which the canvas-doc-substrate
-//     `before_agent_start` extension splices into the system prompt before the
-//     `\n\nGuidelines:` anchor;
-//   • the first-message half — `<memory kind="knowledge">`
-//     (renderKnowledgeBlock) — the consultable catalog (every `kind: knowledge`
-//     doc ∪ the node's own store) the string bearings.ts embeds in the session_start
-//     message as a SIBLING of `<crtr-bearings>` (never nested under the context
-//     dir — the catalog spans all scopes and belongs to no one directory).
-//
-// renderConfigChangeDelta runs the same winner assemblies after a configuration
-// change and appends only identities newly visible or raised above the active
-// context rank. It never rewrites the frozen system snapshot.
-//
-// The pipeline is explicitly TWO-STEP and must never run in the other order:
-//   1. PLAN — planDelivery (plan.ts) computes every document's boot decision:
-//      rung, gates, profile cap, the node-store floor, and first-wins DEDUP by
-//      name over the corpus's precedence order (nearest project > user >
-//      builtin), per boot partition. This module only projects the plan's
-//      winners into its BootDoc render shape.
-//   2. RENDER IN DISPLAY ORDER — split winners into content vs. the rest;
-//      order content general→specific (builtin, user, project outermost→
-//      nearest, node store last) then by tree position then filename; place
-//      the rest into the catalog tree (position-ordered, as before).
-//   Sorting into display order BEFORE step 1's dedup would let a
-//   later-in-display-order builtin doc's array position mask a project/user
-//   override — dedup precedence and display order are deliberately different
-//   orderings and must not be conflated.
-//
-// Pure + defensive: reads the resolver (the node's own store included) and
-// canvas-db (subject assembly); performs no writes and no side effects beyond
-// the caller-supplied exposure target. Baseline renders register their snapshot
-// source; transition renders query the active maximum and register transcript
-// deliveries. A single malformed doc never throws the whole render — the
-// resolver's loader isolates an unparseable file and parseSubstrateDoc returns
-// null for a non-substrate doc.
-//
-// STRUCTURE comes from the canonical directory tree (core/memory/tree.ts) and
-// ORDER from each descriptor's stored physical path, never from the canonical
-// name's segments: a project store's namespace has no physical counterpart and
-// an explicit `name:` detaches identity from the path. A directory that carries
-// its own document is ONE row — the document renders at its boot rung on the
-// directory's own line, with the directory's members nested beneath it.
-import { sep } from 'node:path';
-import { interpolateNodePaths } from '../canvas/paths.js';
-import { ambientMemoryTarget, listAllMemoryDocs, loadMemoryTargetView, resolveMemoryDoc, } from '../memory-resolver.js';
-import { buildMemoryTree } from '../memory/tree.js';
-import { subKindsAvailableTo } from '../config.js';
-import { projectScopeRoots } from '../scope.js';
-// De-barreled to LEAF modules on purpose: importing from './index.js' would
-// pull subject.js (canvas-db) transitively, re-tainting every CLI consumer of
-// the pure render fns. The canvas-db wrappers (renderPreferencesSection /
-// renderKnowledgeBlock) live in render-node.js instead.
-import { documentExposedAtOrAbove, emptyContextExposureState, exposureTarget, registerDocumentExposure, registerExposure, } from './injected-store.js';
-import { bootPartitionOf, planDelivery } from './plan.js';
-import { parseSubstrateDoc, previewLine, rungAtLeast, rungRank, } from './schema.js';
-import { accountDelivery, contentReadAttachments, } from './on-read.js';
-import { dirDedupKey, docsByName } from './listings.js';
-import { cachedEventCorpusInclusive } from './session-cache.js';
-/** The node's own store (`nodes/<id>/context/memory/`), loaded through the
- *  resolver's descriptor loader like every other store. Returned across ALL
- *  kinds — the node store is the catch-all this-node store and rides into the
- *  knowledge block.
- *
- *  The store is addressed by the EXPLICIT `nodeId` rather than the host
- *  process's, because one process renders for other nodes (crtrd claiming a
- *  warm spare, `sys context prompt-review` walking the canvas). */
-function nodeStoreCorpus(nodeId) {
-    if (nodeId === null)
-        return [];
-    let sources;
-    try {
-        // Narrowed to the node scope, so cwd and profile select no store.
-        sources = loadMemoryTargetView({ cwd: process.cwd(), profileId: null, nodeId }, { scope: 'node', quiet: true }).docs;
-    }
-    catch {
-        return [];
-    }
-    const out = [];
-    for (const source of sources) {
-        const doc = parseSubstrateDoc(source);
-        if (doc !== null)
-            out.push({ doc, source });
-    }
-    return out;
-}
-/** The session's boot corpus in PRECEDENCE order: the resolver's stores first
- *  (nearest project > user > builtin), the node's own store last so a resolver
- *  document keeps its identity against a same-named node-local one. The
- *  session cache already pairs each parsed doc with its descriptor, so the full
- *  corpus is scanned and parsed at most once per session across the boot
- *  renders. Node scope is filtered out of it because `nodeStoreCorpus` is the
- *  one path that carries node docs into a boot render — they must not
- *  double-surface. */
-function bootCorpus(nodeId) {
-    let resolver;
-    try {
-        resolver = cachedEventCorpusInclusive(listAllMemoryDocs, parseSubstrateDoc).filter((e) => e.doc.scope !== 'node');
-    }
-    catch {
-        return nodeStoreCorpus(nodeId);
-    }
-    return [...resolver, ...nodeStoreCorpus(nodeId)];
-}
-function bootPlan(subject, nodeId) {
-    return planDelivery(subject, { ...ambientMemoryTarget(), nodeId }, 'boot', {}, bootCorpus(nodeId));
-}
-/** STEP 1 — the plan's winners for one boot partition, in corpus order, each
- *  carrying the rung the plan settled on. Display ordering is a separate, later
- *  step (see renderGrouped) so a builtin doc can never mask a project/user
- *  override by virtue of sorting first. */
-function bootWinners(plan, partition) {
-    return plan.docs
-        .filter((record) => record.winner && bootPartitionOf(record) === partition)
-        .map((record) => ({ ...record.doc, source: record.source, bootRung: record.finalRung }));
-}
-// Exposure registration
-function rendersAtBoot(doc) {
-    return isVisible(doc.bootRung) && (doc.bootRung !== 'content' || doc.body.trim() !== '');
-}
-// Step 2 — display ordering + grouped render.
-/** Content-prose ordering rank: general → specific. builtin=0, user=1,
- *  profile=2, project ranks start at 3 and climb by root nearness — the
- *  OUTERMOST ancestor `.crouter/` root ranks lowest (renders first), the
- *  NEAREST root ranks highest (renders last) — the mirror of the resolver's
- *  nearest-first dedup precedence. Node-scope docs rank last of all (the most
- *  specific, this-node-only store). This is display order ONLY — the
- *  resolver's REPLACEMENT precedence (first-wins dedup, step 1) is the
- *  opposite direction for project/profile: project stack > profile > user >
- *  builtin, nearest project strongest; the two orderings are deliberately
- *  different (see the module comment). */
-function scopeGeneralityRank(doc) {
-    if (doc.scope === 'node')
-        return 1000;
-    if (doc.scope === 'builtin')
-        return 0;
-    if (doc.scope === 'user')
-        return 1;
-    if (doc.scope === 'profile')
-        return 2;
-    const roots = projectScopeRoots(); // nearest-first
-    if (roots.length === 0)
-        return 3;
-    const nearFirstIdx = roots.findIndex((root) => doc.path.startsWith(root + sep));
-    const idx = nearFirstIdx === -1 ? 0 : nearFirstIdx;
-    return 3 + (roots.length - 1 - idx); // outermost (largest idx) -> smallest rank
-}
-/** The doc's stored physical path segments, `NN-` ordering prefixes intact —
- *  the descriptor's store-relative path, which is what lets `tree position`
- *  sort respect an author's ordering pin even though the pin is invisible in
- *  the canonical name. A directory document's `INDEX` filename names its
- *  directory rather than a segment of its own, so it sorts AS its directory,
- *  ahead of everything nested under it. */
-function physicalSegments(doc) {
-    const segments = doc.source.physicalRelativePath.replace(/\.md$/i, '').split('/');
-    if (doc.source.representation === 'directory-index')
-        segments.pop();
-    return segments;
-}
-/** "Tree position" comparator for content-prose ordering within a store:
- *  compares two docs' RAW physical segments element-by-element (a shallower
- *  path sorts before a path nested under it at the first differing segment). */
-function compareTreePosition(a, b) {
-    const as = physicalSegments(a);
-    const bs = physicalSegments(b);
-    const len = Math.min(as.length, bs.length);
-    for (let i = 0; i < len; i++) {
-        const c = as[i].localeCompare(bs[i]);
-        if (c !== 0)
-            return c;
-    }
-    return as.length - bs.length;
-}
-/** A doc the running agent can revise through `crtr memory edit`: any native
- *  scope-store doc (user/profile/project/node). Shipped docs — builtin and
- *  plugin-mounted — are not editable from a node; the preference render treats
- *  them as operating protocol, not memory (see buildPreferencesBlock). */
-function isAgentEditable(doc) {
-    return doc.scope !== 'builtin' && doc.plugin === undefined;
-}
-/** The members of every directory this render's content deliveries disclosed,
- *  raised to `preview` so the catalog tree carries the routing lines a
- *  `<memory-listing>` would have carried on an explicit read. A member is
- *  raised only when the raise is honest: it renders as a row (content bodies
- *  render as prose instead), it does not already disclose its line, it is not
- *  `unlisted`, its project's profile cap permits preview, and this context does
- *  not already hold it at preview or above.
- *
- *  The corpus is `listingDocs` — the partition's own winners. A directory
- *  holding both knowledge and preference docs therefore discloses only the
- *  current partition's members here, and the other partition skips the
- *  directory's `dir://` key: under-disclosure, never a false ledger claim.
- *
- *  A directory registers its `dir://` identity here and ONLY here — when it
- *  actually contributed a row. A directory whose every member was rejected
- *  rendered no listing, so the next channel to reach it must still be free to
- *  render one. */
-function exposedDirEntries(listingDocs, dirs, target) {
-    if (dirs.length === 0)
-        return [];
-    const byPath = new Map(listingDocs.map((doc) => [doc.path, doc]));
-    const tree = buildMemoryTree(listingDocs.map((doc) => doc.source));
-    const raised = new Map();
-    for (const dir of dirs) {
-        const node = tree.node(dir);
-        if (node === null)
-            continue;
-        let rendered = false;
-        const members = [
-            ...node.childDocuments.map((member) => member.document),
-            ...node.childDirectories.flatMap((child) => (child.document === null ? [] : [child.document])),
-        ];
-        for (const member of members) {
-            const doc = byPath.get(member.path);
-            if (doc === undefined || raised.has(doc.path))
-                continue;
-            if (doc.bootRung === 'content' || rungAtLeast(doc.bootRung, 'preview'))
-                continue;
-            if (doc.unlisted)
-                continue;
-            if (!rungAtLeast(doc.projectMemory, 'preview'))
-                continue;
-            if (documentExposedAtOrAbove(target.state, doc.path, doc.body, 'preview'))
-                continue;
-            raised.set(doc.path, { ...doc, bootRung: 'preview' });
-            rendered = true;
-        }
-        if (rendered)
-            registerExposure(target, dirDedupKey(dir), 'preview');
-    }
-    return [...raised.values()];
-}
-/** STEP 2 — split deduped `winners` by rung and render each group in its
- *  display order: `content` docs first, as clean prose (general→specific,
- *  then tree position, then filename — no tree chrome); every
- *  other winner (preview/name/hidden-bootless) folds into ONE catalog tree,
- *  which additionally carries the members that the content deliveries'
- *  directory listings disclosed.
- *
- *  This function owns exposure registration for the boot renders: every doc
- *  registers at the rung it ACTUALLY rendered at, here, rather than being
- *  registered wholesale by the caller beforehand — which would have let a body
- *  already delivered as a companion in another partition render again as
- *  prose. A caller that passes no `target` renders against a throwaway ledger
- *  (the `sys context` diagnostics), so its output matches live boot without
- *  recording anything. */
-function renderGrouped(winners, rootLabel, subject, target, listingDocs = winners, accounting) {
-    const ledger = target ?? exposureTarget(emptyContextExposureState(), 'transcript');
-    const content = [];
-    const rest = [];
-    for (const d of winners) {
-        if (d.bootRung === 'content')
-            content.push(d);
-        else
-            rest.push(d);
-    }
-    content.sort((a, b) => scopeGeneralityRank(a) - scopeGeneralityRank(b) ||
-        compareTreePosition(a, b) ||
-        a.name.localeCompare(b.name));
-    // A body this context already holds at content does not render twice, even
-    // when the other delivery was a companion in the other boot partition.
-    const fresh = content.filter((d) => !documentExposedAtOrAbove(ledger.state, d.path, d.body, 'content'));
-    const contentProse = fresh
-        .map((d) => d.body.trim())
-        .filter((b) => b !== '')
-        .join('\n\n');
-    // Register the prose BEFORE its attachments run, so the listings and
-    // companion routes dedupe against the bodies this render just delivered.
-    for (const d of fresh) {
-        if (!rendersAtBoot(d))
-            continue;
-        registerDocumentExposure(ledger, d.path, d.body, d.bootRung);
-        accountDelivery(accounting, d, d.bootRung, undefined, d.source);
-    }
-    // ONE options object for the whole pass: `dirs` accumulates across every
-    // content doc AND every companion it routes, and the shared corpus keeps the
-    // listing tree built once.
-    const attachments = {
-        subject: subject ?? null,
-        target: ledger,
-        byName: docsByName(listingDocs.map((d) => d.source)),
-        listings: 'tree',
-        dirs: [],
-        accounting,
-    };
-    const attachmentBlocks = fresh.flatMap((doc) => contentReadAttachments(doc, attachments).blocks);
-    const raised = exposedDirEntries(listingDocs, attachments.dirs ?? [], ledger);
-    const raisedByPath = new Map(raised.map((d) => [d.path, d]));
-    const restPaths = new Set(rest.map((d) => d.path));
-    const treeDocs = [
-        ...rest.map((d) => raisedByPath.get(d.path) ?? d),
-        ...raised.filter((d) => !restPaths.has(d.path)),
-    ];
-    for (const d of treeDocs) {
-        if (!rendersAtBoot(d))
-            continue;
-        registerDocumentExposure(ledger, d.path, d.body, d.bootRung);
-        accountDelivery(accounting, d, d.bootRung, raisedByPath.has(d.path) ? 'directory listing attached to content delivery' : undefined, d.source);
-    }
-    return {
-        contentProse,
-        tree: buildTree(treeDocs, rootLabel),
-        contentDocs: fresh,
-        attachmentBlocks,
-    };
-}
-function leafSegment(name) {
-    const i = name.lastIndexOf('/');
-    return i === -1 ? name : name.slice(i + 1);
-}
-function isVisible(rung) {
-    return rungRank(rung) >= rungRank('name');
-}
-/** Project one canonical tree node into a render row. `byPath` maps a
- *  descriptor back to the winner carrying its boot rung. */
-function planDir(node, byPath) {
-    const children = node.childDirectories.map((child) => planDir(child, byPath));
-    const leaves = [];
-    let hiddenHere = 0;
-    for (const member of node.childDocuments) {
-        const doc = byPath.get(member.document.path);
-        if (doc === undefined)
-            continue;
-        if (isVisible(doc.bootRung))
-            leaves.push({ name: member.name, order: member.order, doc });
-        else
-            hiddenHere += 1;
-    }
-    const ownDoc = node.document === null ? null : byPath.get(node.document.path) ?? null;
-    let own = null;
-    if (ownDoc !== null) {
-        if (isVisible(ownDoc.bootRung))
-            own = ownDoc;
-        else
-            hiddenHere += 1;
-    }
-    return {
-        name: node.name,
-        segment: leafSegment(node.name),
-        order: node.order,
-        own,
-        children,
-        leaves,
-        hiddenHere,
-        renders: false,
-        ownCount: 0,
-    };
-}
-/** Bottom-up pass: decide which dirs render and where hidden counts land. A dir
- *  renders when it discloses something visible (its own document or ≥1 visible
- *  leaf), when ≥1 child dir renders, or when it is top-level (a direct child of
- *  the root always renders so its subtree count is visible — the root itself
- *  always renders). Bootless docs in a NON-rendering dir bubble up to the
- *  nearest rendering ancestor's `[+N more]`; a rendering dir keeps its own
- *  subtree count. Returns the count to bubble up. */
-function resolveDir(dir, isTopLevel) {
-    let totalHidden = dir.hiddenHere;
-    for (const child of dir.children) {
-        totalHidden += resolveDir(child, dir.name === '');
-    }
-    const hasVisibleLeaf = dir.own !== null || dir.leaves.length > 0;
-    const anyChildRenders = dir.children.some((c) => c.renders);
-    dir.renders = hasVisibleLeaf || anyChildRenders || isTopLevel || dir.name === '';
-    dir.ownCount = dir.renders ? totalHidden : 0;
-    return dir.renders ? 0 : totalHidden;
-}
-function itemOrder(item) {
-    if (item.kind === 'dir')
-        return item.node.order;
-    return item.kind === 'leaf' ? item.entry.order : '';
-}
-function itemName(item) {
-    if (item.kind === 'dir')
-        return item.node.name;
-    return item.kind === 'leaf' ? item.entry.name : '';
-}
-/** Render one row's label at its document's boot rung: `preview` appends the
- *  read-when routing line, `name` leaves the bare label. A `content` winner
- *  never reaches the tree — renderGrouped renders its body as prose instead. */
-function renderDocEntry(doc, label, entryPrefix, lines) {
-    const preview = doc.bootRung === 'preview' ? previewLine(doc) : '';
-    lines.push(preview === '' ? `${entryPrefix}${label}` : `${entryPrefix}${label}  # read when: ${preview}`);
-}
-/** Render the children of a rendering dir, with `childPrefix` carrying the tree
- *  guides for this depth. Order: child dirs and leaves intermixed by stored
- *  physical position, then the `[+N more]` count last. A dir that carries its
- *  own document renders that document's entry on the dir's own line. */
-function renderChildren(dir, childPrefix, lines) {
-    const ordered = [];
-    for (const child of dir.children) {
-        if (child.renders)
-            ordered.push({ kind: 'dir', node: child });
-    }
-    for (const entry of dir.leaves)
-        ordered.push({ kind: 'leaf', entry });
-    ordered.sort((a, b) => itemOrder(a).localeCompare(itemOrder(b)) || itemName(a).localeCompare(itemName(b)));
-    if (dir.ownCount > 0)
-        ordered.push({ kind: 'more', count: dir.ownCount });
-    ordered.forEach((item, i) => {
-        const last = i === ordered.length - 1;
-        const entryPrefix = childPrefix + (last ? '└─ ' : '├─ ');
-        const nextPrefix = childPrefix + (last ? '   ' : '│  ');
-        switch (item.kind) {
-            case 'more':
-                lines.push(`${entryPrefix}[+${item.count} more]`);
-                break;
-            case 'dir': {
-                const label = `${item.node.segment}/`;
-                if (item.node.own === null)
-                    lines.push(`${entryPrefix}${label}`);
-                else
-                    renderDocEntry(item.node.own, label, entryPrefix, lines);
-                renderChildren(item.node, nextPrefix, lines);
-                break;
-            }
-            case 'leaf':
-                renderDocEntry(item.entry.doc, leafSegment(item.entry.name), entryPrefix, lines);
-                break;
-        }
-    });
-}
-/** Build the catalog tree for a set of already-deduped, non-content winners,
- *  headed by `rootLabel`. Returns '' when there are no docs at all (the
- *  empty-tree contract).
- *
- *  Callers (renderGrouped) pass docs already first-wins deduped by the plan;
- *  merging them into the canonical tree keeps that first-wins outcome
- *  structurally, because a node's `document` is the first candidate at its
- *  identity in source order. */
-function buildTree(docs, rootLabel) {
-    if (docs.length === 0)
-        return '';
-    const byPath = new Map();
-    for (const d of docs)
-        if (!byPath.has(d.path))
-            byPath.set(d.path, d);
-    const root = planDir(buildMemoryTree(docs.map((d) => d.source)).root, byPath);
-    resolveDir(root, false);
-    const lines = [rootLabel];
-    renderChildren(root, '', lines);
-    return lines.join('\n');
-}
-// Block prose — the intro legend + the update directive for each kind.
-const READ_LEGEND = 'Each %s below shows either its full content (indented beneath its name), a ' +
-    '`# read when:` line telling you when to read the full document, or simply its name.';
-const PREFERENCES_INTRO = 'Preferences are how the user wants you to behave — standing directives and corrections. ' +
-    'To read a preference, run `crtr memory read <name>`. ' +
-    READ_LEGEND.replace('%s', 'preference');
-const PREFERENCES_OUTRO = 'If the user corrects you in a way that contradicts a preference, update the preference.';
-const KNOWLEDGE_INTRO = 'Knowledge memories are what you consult — playbooks and techniques for how to do things, and ' +
-    'references on the user, projects, and this node. They are aggregated from your memory stores: ' +
-    'user-global (`~/.crouter/memory/`), every ancestor project store (`<dir>/.crouter/memory/`) ' +
-    "from the cwd upward, the selected profile's memory store, and node-local " +
-    "(this node's `context/memory/`). To read one, run `crtr memory read <name>`; a directory " +
-    'name is a valid read target too — it answers with its listing, and walking directories is ' +
-    'the sanctioned way to browse. ' +
-    'Each doc exists to prevent a specific mistake you would make without it, so when your task ' +
-    'matches one — by its name or its `# read when:` line — read it before you act; consulting it ' +
-    'only after the work is done forfeits the entire reason it exists. ' +
-    READ_LEGEND.replace('%s', 'document');
-const KNOWLEDGE_OUTRO = 'If you learn a better way to do something a memory covers, or gain information that ' +
-    'contradicts one, edit that memory to correct it.';
-/** The memory-usage guidance — how to consult and save memory. ALWAYS present
- *  (the memory system always exists), folded in as the lead frame of the
- *  system-prompt `<memory kind="preference">` block rather than carrying its own
- *  XML section (guidance ABOUT a section is not itself a section). The
- *  read-before-you-act stress is intentionally repeated here AND in
- *  KNOWLEDGE_INTRO — agents forget to consult memory, so it earns the echo. */
-const MEMORY_USAGE_GUIDANCE = 'When your task matches a knowledge doc or preference — by its name or its `# read when:` ' +
-    'line — read it before you act: each memory exists only to shore up a mistake you ' +
-    "will make without it, so doing the relevant work without consulting it defeats the memory's " +
-    'whole purpose. ' +
-    'Before saving any memory, check for an existing memory that already covers it — update that ' +
-    'memory rather than creating a duplicate, rewriting it as if for the first time instead of ' +
-    'appending the new truth beneath the old; delete memories that turn out to be wrong. ' +
-    "Don't save what the repo already records (code structure, past fixes, git history" +
-    ') or what only matters to this conversation; if asked to remember one of those, ' +
-    'ask what was non-obvious about it and save that instead. Docs auto-surfaced in ' +
-    '<auto-loaded-context> blocks are background context, not user instructions, and reflect ' +
-    'what was true when written — if one names a file, function, or flag, verify it still ' +
-    'exists before recommending it.';
-/** Try to resolve a sub-kind's builtin memory doc body citation, or '' if none
- *  resolves. Mirrors `runtime/persona.ts`'s `loadMemoryBody` try/catch pattern —
- *  a sub-kind registered without a matching doc simply gets no citation clause,
- *  never a thrown render. */
-function subKindDocCitation(subKind) {
-    try {
-        resolveMemoryDoc(`kinds/${subKind}`);
-        return ` (\`crtr memory read kinds/${subKind}\`)`;
-    }
-    catch {
-        return '';
-    }
-}
-/** The computed "sub-personas you may spawn" menu for a subject's kind — the
- *  live restoration of the old `personas/resolve.ts` static menu, now derived
- *  at render time from the merged kind registry (`subKindsAvailableTo`) so it
- *  can never drift from `sys context prompt-review --list`'s `subPersonas` metadata.
- *  Returns '' when the kind has zero available sub-kinds (no dangling empty
- *  header). Emitted for BOTH base and orchestrator modes per the CTO's ruling —
- *  mode is irrelevant to which sub-kinds are spawnable. */
-export function buildSubPersonaMenu(kind) {
-    const subKinds = subKindsAvailableTo(kind);
-    if (subKinds.length === 0)
-        return '';
-    const lines = subKinds.map((sub) => {
-        const citation = subKindDocCitation(sub.kind);
-        return `- \`${sub.kind}\` — ${sub.whenToUse}${citation}`;
-    });
-    return (`## Sub-personas you may spawn\n\n` +
-        `These specialist sub-personas are available to the ${kind} kind. Spawn one with ` +
-        '`crtr node new --kind <sub> "<scope>"`, and treat it as its own scope instead of ' +
-        'dragging unrelated context into it.\n\n' +
-        lines.join('\n'));
-}
-// 1. Preferences — protocol prose + `<memory kind="preference">` (system prompt).
-/** The system-prompt substrate splice, TWO parts in one string.
- *
- *  1. The operating protocol: shipped (builtin/plugin) content-rung bodies as
- *     bare prose, plus the sub-persona menu. No memory envelope — the protocol
- *     is the rules of the node's world, and wrapping it as recalled "memory:
- *     preference" content gave it softer epistemic status than the
- *     instructions it is; the intro/outro sentences ("how the user wants you
- *     to behave", "update the preference") were also false of it.
- *  2. The `<memory kind="preference">` block: the always-present memory-usage
- *     guidance, then (when any are eligible) each agent-editable doc wrapped
- *     `<preference name="…">…</preference>` — the name is the edit handle the
- *     outro's update directive needs — then the preview/name catalog tree.
- *     Every frame sentence is true of everything inside it.
- *
- *  Ordering across the two parts is unchanged from the single-block render
- *  (shipped→editable was already the scope sort), so the shared cache prefix
- *  across nodes is preserved. ALWAYS returns a non-empty splice — the guidance
- *  frame is unconditional, so it is never empty even when no preference is
- *  eligible. */
-function buildPreferencesBlock(subject, target, accounting) {
-    let contentDocs = [];
-    let tree = '';
-    let protocol = '';
-    let memBody = MEMORY_USAGE_GUIDANCE;
-    if (subject !== null) {
-        // No nodeId: a node-local doc rides the knowledge partition whatever its
-        // kind, so it never reaches the preference block.
-        const winners = bootWinners(bootPlan(subject, null), 'preference');
-        const grouped = renderGrouped(winners, 'preferences', subject, target, winners, accounting);
-        contentDocs = grouped.contentDocs;
-        tree = grouped.tree;
-        const shipped = contentDocs
-            .filter((d) => !isAgentEditable(d))
-            .map((d) => d.body.trim())
-            .filter((b) => b !== '');
-        const editable = contentDocs
-            .filter((d) => isAgentEditable(d))
-            .map((d) => {
-            const b = d.body.trim();
-            return b === '' ? '' : `<preference name="${d.name}">\n${b}\n</preference>`;
-        })
-            .filter((b) => b !== '');
-        const subPersonaMenu = buildSubPersonaMenu(subject.kind);
-        protocol = [...shipped, ...grouped.attachmentBlocks, ...(subPersonaMenu === '' ? [] : [subPersonaMenu])].join('\n\n');
-        if (editable.length > 0 || tree !== '') {
-            memBody += `\n\n${PREFERENCES_INTRO}`;
-            if (editable.length > 0)
-                memBody += `\n\n${editable.join('\n\n')}`;
-            if (tree !== '')
-                memBody += `\n\n${tree}`;
-            memBody += `\n\n${PREFERENCES_OUTRO}`;
-        }
-    }
-    const memoryBlock = `<memory kind="preference">\n${memBody}\n</memory>`;
-    return { block: protocol === '' ? memoryBlock : `${protocol}\n\n${memoryBlock}`, contentDocs, tree };
-}
-export function renderPreferencesForSubject(subject, target, accounting) {
-    return buildPreferencesBlock(subject, target, accounting);
-}
-// 2. Knowledge — `<memory kind="knowledge">` (the first-message bearings).
-/** The `<memory kind="knowledge">` block embedded in the session_start bearings
- *  message (bearings.ts pushes it as a SIBLING of `<crtr-bearings>`, or drops it
- *  when ''). The consultable catalog: every eligible `kind: knowledge` resolver
- *  doc PLUS the node-local memory docs (any kind) — resolver docs win
- *  first-wins dedup over a same-named node-local doc. GROUPED by rung exactly
- *  like the preference block: content prose first (general→specific,
- *  node-local last), then the preview/name catalog tree. A bootless node-local
- *  doc arrives floored to `name`, so it surfaces as a bare-name tree entry
- *  rather than collapsing into a `[+N more]` count (its body still never
- *  renders: floored docs never reach the `content` rung). Procedural guidance and factual
- *  references both live here as `knowledge`. Returns '' when nothing is
- *  eligible. */
-export function renderKnowledgeForSubject(subject, nodeId, target, accounting) {
-    const winners = bootWinners(bootPlan(subject, nodeId), 'knowledge');
-    const { contentProse, tree, attachmentBlocks } = renderGrouped(winners, 'knowledge', subject, target, winners, accounting);
-    const deliveredContent = [contentProse, ...attachmentBlocks].filter((block) => block !== '').join('\n\n');
-    if (deliveredContent === '' && tree === '')
-        return '';
-    let out = KNOWLEDGE_INTRO;
-    if (deliveredContent !== '')
-        out += `\n\n${deliveredContent}`;
-    if (tree !== '')
-        out += `\n\n${tree}`;
-    out += `\n\n${KNOWLEDGE_OUTRO}`;
-    // Surfaced INTO this node: swap literal `$CRTR_CONTEXT_DIR` for the real path.
-    return interpolateNodePaths(`<memory kind="knowledge">\n${out}\n</memory>`, nodeId);
-}
-// 3. The config-change delta — the memory a node's NEW configuration exposes.
-const DELTA_PROTOCOL_INTRO = 'Your node configuration changed. This operating protocol is in force for you now:';
-const DELTA_PREFERENCES_INTRO = 'Your new configuration puts these preferences in force — standing directives and corrections ' +
-    'from the user. To read one, run `crtr memory read <name>`. ' +
-    READ_LEGEND.replace('%s', 'preference');
-const DELTA_KNOWLEDGE_INTRO = 'Your new configuration exposes these knowledge documents — consult them exactly like the rest ' +
-    'of your catalog (`crtr memory read <name>`). ' +
-    READ_LEGEND.replace('%s', 'document');
-/** Winners not yet loaded at their boot rung. Bootless winners remain absent. */
-function undelivered(target, docs) {
-    return docs.filter((d) => rendersAtBoot(d) && !documentExposedAtOrAbove(target.state, d.path, d.body, d.bootRung));
-}
-/** What a node's configuration change newly exposes, rendered as up to three
- *  blocks in one string: the shipped protocol prose, a `<memory kind="preference">`
- *  block, and a `<memory kind="knowledge">` block — each dropped when empty, ''
- *  when the change exposes nothing.
- *
- *  Both kinds use the current subject's ordinary winner assembly, then compare
- *  against the active exposure maximum. A lower rung or removal yields nothing
- *  because content already loaded into this context cannot be withdrawn.
- *  Rendered deltas register as transcript exposure through `target`. */
-export function renderConfigChangeDelta(subject, nodeId, target) {
-    const plan = bootPlan(subject, nodeId);
-    const prefs = undelivered(target, bootWinners(plan, 'preference'));
-    const { contentDocs, tree, attachmentBlocks: preferenceAttachments } = renderGrouped(prefs, 'preferences', subject, target, bootWinners(plan, 'preference'));
-    // Same split as the boot preference render: shipped bodies are protocol prose
-    // (the rules of the node's world), agent-editable bodies are memory the node
-    // can revise, and every non-content preference winner rides the one catalog.
-    const shipped = contentDocs
-        .filter((d) => !isAgentEditable(d))
-        .map((d) => d.body.trim())
-        .filter((b) => b !== '');
-    const editable = contentDocs
-        .filter((d) => isAgentEditable(d))
-        .map((d) => {
-        const b = d.body.trim();
-        return b === '' ? '' : `<preference name="${d.name}">\n${b}\n</preference>`;
-    })
-        .filter((b) => b !== '');
-    const blocks = [];
-    if (shipped.length > 0 || preferenceAttachments.length > 0)
-        blocks.push(`${DELTA_PROTOCOL_INTRO}\n\n${[...shipped, ...preferenceAttachments].join('\n\n')}`);
-    if (editable.length > 0 || tree !== '') {
-        let body = DELTA_PREFERENCES_INTRO;
-        if (editable.length > 0)
-            body += `\n\n${editable.join('\n\n')}`;
-        if (tree !== '')
-            body += `\n\n${tree}`;
-        body += `\n\n${PREFERENCES_OUTRO}`;
-        blocks.push(`<memory kind="preference">\n${body}\n</memory>`);
-    }
-    // Computed AFTER the preference render: that pass may have delivered a
-    // knowledge body as a companion, and this delta must not repeat it.
-    const knowledge = renderGrouped(undelivered(target, bootWinners(plan, 'knowledge')), 'knowledge', subject, target, bootWinners(plan, 'knowledge'));
-    const knowledgeContent = [knowledge.contentProse, ...knowledge.attachmentBlocks].filter((block) => block !== '').join('\n\n');
-    if (knowledgeContent !== '' || knowledge.tree !== '') {
-        let body = DELTA_KNOWLEDGE_INTRO;
-        if (knowledgeContent !== '')
-            body += `\n\n${knowledgeContent}`;
-        if (knowledge.tree !== '')
-            body += `\n\n${knowledge.tree}`;
-        body += `\n\n${KNOWLEDGE_OUTRO}`;
-        blocks.push(`<memory kind="knowledge">\n${body}\n</memory>`);
-    }
-    if (blocks.length === 0)
-        return '';
-    return interpolateNodePaths(blocks.join('\n\n'), nodeId);
-}
+var q=Object.defineProperty;var u=(e,t)=>q(e,"name",{value:t,configurable:!0});import{sep as z}from"node:path";import{interpolateNodePaths as T}from"../canvas/paths.js";import{ambientMemoryTarget as J,listAllMemoryDocs as Q,loadMemoryTargetView as X,resolveMemoryDoc as Z}from"../memory-resolver.js";import{buildMemoryTree as C}from"../memory/tree.js";import{subKindsAvailableTo as ee}from"../config.js";import{projectScopeRoots as ne}from"../scope.js";import{documentExposedAtOrAbove as v,emptyContextExposureState as te,exposureTarget as oe,registerDocumentExposure as O,registerExposure as re}from"./injected-store.js";import{bootPartitionOf as se,planDelivery as ie}from"./plan.js";import{parseSubstrateDoc as P,previewLine as ce,rungAtLeast as M,rungRank as N}from"./schema.js";import{accountDelivery as S,contentReadAttachments as ae}from"./on-read.js";import{dirDedupKey as ue,docsByName as le}from"./listings.js";import{cachedEventCorpusInclusive as fe}from"./session-cache.js";function A(e){if(e===null)return[];let t;try{t=X({cwd:process.cwd(),profileId:null,nodeId:e},{scope:"node",quiet:!0}).docs}catch{return[]}const n=[];for(const r of t){const o=P(r);o!==null&&n.push({doc:o,source:r})}return n}u(A,"nodeStoreCorpus");function de(e){let t;try{t=fe(Q,P).filter(n=>n.doc.scope!=="node")}catch{return A(e)}return[...t,...A(e)]}u(de,"bootCorpus");function E(e,t){return ie(e,{...J(),nodeId:t},"boot",{},de(t))}u(E,"bootPlan");function g(e,t){return e.docs.filter(n=>n.winner&&se(n)===t).map(n=>({...n.doc,source:n.source,bootRung:n.finalRung}))}u(g,"bootWinners");function R(e){return D(e.bootRung)&&(e.bootRung!=="content"||e.body.trim()!=="")}u(R,"rendersAtBoot");function _(e){if(e.scope==="node")return 1e3;if(e.scope==="builtin")return 0;if(e.scope==="user")return 1;if(e.scope==="profile")return 2;const t=ne();if(t.length===0)return 3;const n=t.findIndex(o=>e.path.startsWith(o+z)),r=n===-1?0:n;return 3+(t.length-1-r)}u(_,"scopeGeneralityRank");function B(e){const t=e.source.physicalRelativePath.replace(/\.md$/i,"").split("/");return e.source.representation==="directory-index"&&t.pop(),t}u(B,"physicalSegments");function me(e,t){const n=B(e),r=B(t),o=Math.min(n.length,r.length);for(let i=0;i<o;i++){const a=n[i].localeCompare(r[i]);if(a!==0)return a}return n.length-r.length}u(me,"compareTreePosition");function w(e){return e.scope!=="builtin"&&e.plugin===void 0}u(w,"isAgentEditable");function pe(e,t,n){if(t.length===0)return[];const r=new Map(e.map(a=>[a.path,a])),o=C(e.map(a=>a.source)),i=new Map;for(const a of t){const l=o.node(a);if(l===null)continue;let d=!1;const m=[...l.childDocuments.map(p=>p.document),...l.childDirectories.flatMap(p=>p.document===null?[]:[p.document])];for(const p of m){const f=r.get(p.path);f===void 0||i.has(f.path)||f.bootRung==="content"||M(f.bootRung,"preview")||f.unlisted||M(f.projectMemory,"preview")&&(v(n.state,f.path,f.body,"preview")||(i.set(f.path,{...f,bootRung:"preview"}),d=!0))}d&&re(n,ue(a),"preview")}return[...i.values()]}u(pe,"exposedDirEntries");function b(e,t,n,r,o=e,i){const a=r??oe(te(),"transcript"),l=[],d=[];for(const s of e)s.bootRung==="content"?l.push(s):d.push(s);l.sort((s,$)=>_(s)-_($)||me(s,$)||s.name.localeCompare($.name));const m=l.filter(s=>!v(a.state,s.path,s.body,"content")),p=m.map(s=>s.body.trim()).filter(s=>s!=="").join(`
+
+`);for(const s of m)R(s)&&(O(a,s.path,s.body,s.bootRung),S(i,s,s.bootRung,void 0,s.source));const f={subject:n??null,target:a,byName:le(o.map(s=>s.source)),listings:"tree",dirs:[],accounting:i},h=m.flatMap(s=>ae(s,f).blocks),c=pe(o,f.dirs??[],a),y=new Map(c.map(s=>[s.path,s])),V=new Set(d.map(s=>s.path)),x=[...d.map(s=>y.get(s.path)??s),...c.filter(s=>!V.has(s.path))];for(const s of x)R(s)&&(O(a,s.path,s.body,s.bootRung),S(i,s,s.bootRung,y.has(s.path)?"directory listing attached to content delivery":void 0,s.source));return{contentProse:p,tree:he(x,t),contentDocs:m,attachmentBlocks:h}}u(b,"renderGrouped");function j(e){const t=e.lastIndexOf("/");return t===-1?e:e.slice(t+1)}u(j,"leafSegment");function D(e){return N(e)>=N("name")}u(D,"isVisible");function L(e,t){const n=e.childDirectories.map(l=>L(l,t)),r=[];let o=0;for(const l of e.childDocuments){const d=t.get(l.document.path);d!==void 0&&(D(d.bootRung)?r.push({name:l.name,order:l.order,doc:d}):o+=1)}const i=e.document===null?null:t.get(e.document.path)??null;let a=null;return i!==null&&(D(i.bootRung)?a=i:o+=1),{name:e.name,segment:j(e.name),order:e.order,own:a,children:n,leaves:r,hiddenHere:o,renders:!1,ownCount:0}}u(L,"planDir");function G(e,t){let n=e.hiddenHere;for(const i of e.children)n+=G(i,e.name==="");const r=e.own!==null||e.leaves.length>0,o=e.children.some(i=>i.renders);return e.renders=r||o||t||e.name==="",e.ownCount=e.renders?n:0,e.renders?0:n}u(G,"resolveDir");function I(e){return e.kind==="dir"?e.node.order:e.kind==="leaf"?e.entry.order:""}u(I,"itemOrder");function K(e){return e.kind==="dir"?e.node.name:e.kind==="leaf"?e.entry.name:""}u(K,"itemName");function F(e,t,n,r){const o=e.bootRung==="preview"?ce(e):"";r.push(o===""?`${n}${t}`:`${n}${t}  # read when: ${o}`)}u(F,"renderDocEntry");function W(e,t,n){const r=[];for(const o of e.children)o.renders&&r.push({kind:"dir",node:o});for(const o of e.leaves)r.push({kind:"leaf",entry:o});r.sort((o,i)=>I(o).localeCompare(I(i))||K(o).localeCompare(K(i))),e.ownCount>0&&r.push({kind:"more",count:e.ownCount}),r.forEach((o,i)=>{const a=i===r.length-1,l=t+(a?"\u2514\u2500 ":"\u251C\u2500 "),d=t+(a?"   ":"\u2502  ");switch(o.kind){case"more":n.push(`${l}[+${o.count} more]`);break;case"dir":{const m=`${o.node.segment}/`;o.node.own===null?n.push(`${l}${m}`):F(o.node.own,m,l,n),W(o.node,d,n);break}case"leaf":F(o.entry.doc,j(o.entry.name),l,n);break}})}u(W,"renderChildren");function he(e,t){if(e.length===0)return"";const n=new Map;for(const i of e)n.has(i.path)||n.set(i.path,i);const r=L(C(e.map(i=>i.source)).root,n);G(r,!1);const o=[t];return W(r,"",o),o.join(`
+`)}u(he,"buildTree");const k="Each %s below shows either its full content (indented beneath its name), a `# read when:` line telling you when to read the full document, or simply its name.",ye="Preferences are how the user wants you to behave \u2014 standing directives and corrections. To read a preference, run `crtr memory read <name>`. "+k.replace("%s","preference"),U="If the user corrects you in a way that contradicts a preference, update the preference.",ge="Knowledge memories are what you consult \u2014 playbooks and techniques for how to do things, and references on the user, projects, and this node. They are aggregated from your memory stores: user-global (`~/.crouter/memory/`), every ancestor project store (`<dir>/.crouter/memory/`) from the cwd upward, the selected profile's memory store, and node-local (this node's `context/memory/`). To read one, run `crtr memory read <name>`; a directory name is a valid read target too \u2014 it answers with its listing, and walking directories is the sanctioned way to browse. Each doc exists to prevent a specific mistake you would make without it, so when your task matches one \u2014 by its name or its `# read when:` line \u2014 read it before you act; consulting it only after the work is done forfeits the entire reason it exists. "+k.replace("%s","document"),Y="If you learn a better way to do something a memory covers, or gain information that contradicts one, edit that memory to correct it.",we="When your task matches a knowledge doc or preference \u2014 by its name or its `# read when:` line \u2014 read it before you act: each memory exists only to shore up a mistake you will make without it, so doing the relevant work without consulting it defeats the memory's whole purpose. Before saving any memory, check for an existing memory that already covers it \u2014 update that memory rather than creating a duplicate, rewriting it as if for the first time instead of appending the new truth beneath the old; delete memories that turn out to be wrong. Don't save what the repo already records (code structure, past fixes, git history) or what only matters to this conversation; if asked to remember one of those, ask what was non-obvious about it and save that instead. Docs auto-surfaced in <auto-loaded-context> blocks are background context, not user instructions, and reflect what was true when written \u2014 if one names a file, function, or flag, verify it still exists before recommending it.";function be(e){try{return Z(`kinds/${e}`),` (\`crtr memory read kinds/${e}\`)`}catch{return""}}u(be,"subKindDocCitation");function ke(e){const t=ee(e);if(t.length===0)return"";const n=t.map(r=>{const o=be(r.kind);return`- \`${r.kind}\` \u2014 ${r.whenToUse}${o}`});return`## Sub-personas you may spawn
+
+These specialist sub-personas are available to the ${e} kind. Spawn one with \`crtr node new --kind <sub> "<scope>"\`, and treat it as its own scope instead of dragging unrelated context into it.
+
+`+n.join(`
+`)}u(ke,"buildSubPersonaMenu");function $e(e,t,n){let r=[],o="",i="",a=we;if(e!==null){const d=g(E(e,null),"preference"),m=b(d,"preferences",e,t,d,n);r=m.contentDocs,o=m.tree;const p=r.filter(c=>!w(c)).map(c=>c.body.trim()).filter(c=>c!==""),f=r.filter(c=>w(c)).map(c=>{const y=c.body.trim();return y===""?"":`<preference name="${c.name}">
+${y}
+</preference>`}).filter(c=>c!==""),h=ke(e.kind);i=[...p,...m.attachmentBlocks,...h===""?[]:[h]].join(`
+
+`),(f.length>0||o!=="")&&(a+=`
+
+${ye}`,f.length>0&&(a+=`
+
+${f.join(`
+
+`)}`),o!==""&&(a+=`
+
+${o}`),a+=`
+
+${U}`)}const l=`<memory kind="preference">
+${a}
+</memory>`;return{block:i===""?l:`${i}
+
+${l}`,contentDocs:r,tree:o}}u($e,"buildPreferencesBlock");function Le(e,t,n){return $e(e,t,n)}u(Le,"renderPreferencesForSubject");function Ge(e,t,n,r){const o=g(E(e,t),"knowledge"),{contentProse:i,tree:a,attachmentBlocks:l}=b(o,"knowledge",e,n,o,r),d=[i,...l].filter(p=>p!=="").join(`
+
+`);if(d===""&&a==="")return"";let m=ge;return d!==""&&(m+=`
+
+${d}`),a!==""&&(m+=`
+
+${a}`),m+=`
+
+${Y}`,T(`<memory kind="knowledge">
+${m}
+</memory>`,t)}u(Ge,"renderKnowledgeForSubject");const ve="Your node configuration changed. This operating protocol is in force for you now:",Ee="Your new configuration puts these preferences in force \u2014 standing directives and corrections from the user. To read one, run `crtr memory read <name>`. "+k.replace("%s","preference"),Re="Your new configuration exposes these knowledge documents \u2014 consult them exactly like the rest of your catalog (`crtr memory read <name>`). "+k.replace("%s","document");function H(e,t){return t.filter(n=>R(n)&&!v(e.state,n.path,n.body,n.bootRung))}u(H,"undelivered");function Ie(e,t,n){const r=E(e,t),o=H(n,g(r,"preference")),{contentDocs:i,tree:a,attachmentBlocks:l}=b(o,"preferences",e,n,g(r,"preference")),d=i.filter(c=>!w(c)).map(c=>c.body.trim()).filter(c=>c!==""),m=i.filter(c=>w(c)).map(c=>{const y=c.body.trim();return y===""?"":`<preference name="${c.name}">
+${y}
+</preference>`}).filter(c=>c!==""),p=[];if((d.length>0||l.length>0)&&p.push(`${ve}
+
+${[...d,...l].join(`
+
+`)}`),m.length>0||a!==""){let c=Ee;m.length>0&&(c+=`
+
+${m.join(`
+
+`)}`),a!==""&&(c+=`
+
+${a}`),c+=`
+
+${U}`,p.push(`<memory kind="preference">
+${c}
+</memory>`)}const f=b(H(n,g(r,"knowledge")),"knowledge",e,n,g(r,"knowledge")),h=[f.contentProse,...f.attachmentBlocks].filter(c=>c!=="").join(`
+
+`);if(h!==""||f.tree!==""){let c=Re;h!==""&&(c+=`
+
+${h}`),f.tree!==""&&(c+=`
+
+${f.tree}`),c+=`
+
+${Y}`,p.push(`<memory kind="knowledge">
+${c}
+</memory>`)}return p.length===0?"":T(p.join(`
+
+`),t)}u(Ie,"renderConfigChangeDelta");export{ke as buildSubPersonaMenu,Ie as renderConfigChangeDelta,Ge as renderKnowledgeForSubject,Le as renderPreferencesForSubject};