localptp 0.1.0

package/dist/core/contextBuilder.js

@@ -0,0 +1,406 @@
+/**
+ * Context Builder (HLD-SRD §3.7, §6, §9, §10.1).
+ *
+ * `buildContext` is a PURE, deterministic function: it performs no I/O and
+ * reads only the data handed to it (including a preloaded `fileContents` map).
+ * It therefore takes no ModelClient and structurally cannot call the model.
+ *
+ * Pipeline: heuristic selection (task-driven, else preview) → per-file hard cap
+ * → assembly → the §3.7 seven-step over-budget reduction ladder.
+ */
+import path from "node:path";
+import { estimateTokens } from "../utils/tokenEstimate.js";
+import { KNOWN_BINARY_EXT } from "./repoIndexer.js";
+import { CODER_SYSTEM_PROMPT } from "./prompts.js";
+import { firstIncompleteSubtask, } from "../types/context.js";
+// ---------------------------------------------------------------------------
+// Memory selection order (HLD-SRD §3.7)
+// ---------------------------------------------------------------------------
+/**
+ * Conditional memory in priority order. `coding-rules.md` is intentionally
+ * absent — it is the always-include, ladder-protected project-rules file.
+ */
+const CONDITIONAL_MEMORY_ORDER = [
+    "project-brief.md",
+    "file-index.md",
+    "data-model.md",
+    "api-map.md",
+    "external-integrations.md",
+    "decisions.md",
+    "test-plan.md",
+];
+const ALWAYS_MEMORY = ["coding-rules.md"];
+const TRUNCATION_MARKER = "\n… [truncated]\n";
+// ---------------------------------------------------------------------------
+// Helpers
+// ---------------------------------------------------------------------------
+function toPosix(p) {
+    return p.replace(/\\/g, "/");
+}
+function stripExt(p) {
+    const ext = path.posix.extname(p);
+    return ext ? p.slice(0, -ext.length) : p;
+}
+function isBinaryEntry(f) {
+    if (f.language === "binary")
+        return true;
+    return KNOWN_BINARY_EXT.has(f.extension.toLowerCase());
+}
+/**
+ * Resolve a relative import specifier (`./x`, `../y`) against indexed paths by
+ * suffix match. Returns the matched indexed path, or undefined. Bare package
+ * specifiers and node builtins are ignored (return undefined).
+ */
+function resolveImport(specifier, fromPath, byPath) {
+    if (!specifier.startsWith("."))
+        return undefined; // package / builtin
+    // Normalize the specifier relative to the importing file's directory.
+    const fromDir = path.posix.dirname(toPosix(fromPath));
+    const resolved = stripExt(toPosix(path.posix.normalize(`${fromDir}/${specifier}`)));
+    // Exact (extensionless) match first, then index-suffix match.
+    for (const indexed of byPath.keys()) {
+        if (stripExt(indexed) === resolved)
+            return indexed;
+    }
+    const tail = stripExt(toPosix(specifier).replace(/^\.\//, "").replace(/^\.\.\//, ""));
+    for (const indexed of byPath.keys()) {
+        const ix = stripExt(indexed);
+        if (ix === tail || ix.endsWith(`/${tail}`))
+            return indexed;
+    }
+    return undefined;
+}
+/**
+ * The import-neighbor source files of a set of seed files: every indexed file
+ * a seed's `imports[]` resolves to (by suffix match), excluding the seeds
+ * themselves. Deterministic: sorted by size asc then path asc.
+ */
+export function importNeighbors(seedFiles, index) {
+    const byPath = new Map();
+    for (const f of index.files)
+        byPath.set(toPosix(f.path), f);
+    const seeds = new Set(seedFiles.map(toPosix));
+    const found = new Map();
+    for (const seed of seeds) {
+        const entry = byPath.get(seed);
+        if (!entry)
+            continue;
+        for (const spec of entry.imports) {
+            const resolved = resolveImport(spec, seed, byPath);
+            if (resolved && !seeds.has(resolved)) {
+                const f = byPath.get(resolved);
+                if (f && !isBinaryEntry(f))
+                    found.set(resolved, f);
+            }
+        }
+    }
+    return [...found.values()].sort(compareBySizeThenPath).map((f) => f.path);
+}
+function compareBySizeThenPath(a, b) {
+    if (a.size !== b.size)
+        return a.size - b.size;
+    return a.path.localeCompare(b.path);
+}
+/**
+ * A no-model summary: an index header (path/language/exports/size) followed by
+ * the file's first 20 non-blank lines.
+ */
+export function summarizeFile(entry, body) {
+    const exportsStr = entry.exports.length > 0 ? entry.exports.join(", ") : "(none)";
+    const header = `// ${entry.path} · ${entry.language} · ${entry.size} bytes · exports: ${exportsStr}`;
+    const head = body
+        .split(/\r?\n/)
+        .filter((l) => l.trim().length > 0)
+        .slice(0, 20)
+        .join("\n");
+    return `${header}\n${head}`;
+}
+/**
+ * A snippet: the first `floor(maxChars / 2)` characters plus a truncation
+ * marker. Bodies already at-or-under the snippet size are returned unchanged.
+ */
+export function snippetFile(body, maxChars) {
+    const limit = Math.floor(maxChars / 2);
+    if (body.length <= limit)
+        return body;
+    return body.slice(0, limit) + TRUNCATION_MARKER;
+}
+/** Hard-cap a body to `maxChars` (selection-time cap, assumption 5a). */
+function hardCap(body, maxChars) {
+    if (body.length <= maxChars)
+        return body;
+    return body.slice(0, maxChars) + TRUNCATION_MARKER;
+}
+// ---------------------------------------------------------------------------
+// Direct-test matching
+// ---------------------------------------------------------------------------
+/** The basename stem of a test path, stripping `.test`/`.spec` and `test_`. */
+function sourceStemsForTest(testPath) {
+    const base = path.posix.basename(toPosix(testPath));
+    const noExt = stripExt(base); // e.g. Foo.test, test_foo, foo_test
+    const stems = new Set();
+    // Foo.test / Foo.spec → Foo
+    const dotted = noExt.replace(/\.(test|spec)$/i, "");
+    stems.add(dotted);
+    // test_foo → foo  /  foo_test → foo
+    stems.add(noExt.replace(/^test_/i, "").replace(/_test$/i, ""));
+    return [...stems];
+}
+/** Is `test` a direct test of `source`? (import resolves OR basename-stem). */
+function isDirectTestOf(test, source, byPath) {
+    // (a) import resolution
+    for (const spec of test.imports) {
+        if (resolveImport(spec, test.path, byPath) === toPosix(source.path)) {
+            return true;
+        }
+    }
+    // (b) basename-stem match
+    const sourceStem = stripExt(path.posix.basename(toPosix(source.path)));
+    return sourceStemsForTest(test.path).includes(sourceStem);
+}
+export function selectFiles(inputs) {
+    const { config, index, task } = inputs;
+    const ctx = config.context;
+    const warnings = [];
+    const byPath = new Map();
+    for (const f of index.files)
+        byPath.set(toPosix(f.path), f);
+    // Edit files: the current subtask's likelyFiles (capped).
+    let editFiles = [];
+    if (task) {
+        const subtask = firstIncompleteSubtask(task) ?? task.subtasks?.[0];
+        const likely = subtask?.likelyFiles ?? [];
+        // Keep only files that exist in the index and are not binary.
+        editFiles = likely
+            .map(toPosix)
+            .filter((p) => {
+            const f = byPath.get(p);
+            return f !== undefined && !isBinaryEntry(f);
+        })
+            .slice(0, ctx.maxEditFilesPerStep);
+    }
+    // Source files.
+    let sourceFiles;
+    let testFiles = [];
+    if (task) {
+        const neighbors = ctx.includeImportNeighbors
+            ? importNeighbors(editFiles, index)
+            : [];
+        // Combined non-edit selection (neighbors + tests) is bounded by
+        // maxFilesPerStep. Edit files are reserved first and never dropped.
+        const combined = [...editFiles];
+        const seen = new Set(editFiles);
+        const room = () => combined.length < ctx.maxFilesPerStep;
+        for (const n of neighbors) {
+            if (!room())
+                break;
+            if (seen.has(n))
+                continue;
+            combined.push(n);
+            seen.add(n);
+        }
+        sourceFiles = combined.slice();
+        // Direct tests of any selected source file, filling remaining room.
+        if (ctx.includeTests) {
+            const selectedSources = sourceFiles
+                .map((p) => byPath.get(p))
+                .filter((f) => f !== undefined);
+            const testCandidates = index.files
+                .filter((f) => f.isTest && !isBinaryEntry(f))
+                .filter((t) => !seen.has(toPosix(t.path)))
+                .filter((t) => selectedSources.some((s) => isDirectTestOf(t, s, byPath)))
+                .sort(compareBySizeThenPath);
+            for (const t of testCandidates) {
+                if (!room())
+                    break;
+                const p = toPosix(t.path);
+                if (seen.has(p))
+                    continue;
+                testFiles.push(p);
+                seen.add(p);
+                combined.push(p);
+            }
+        }
+    }
+    else {
+        // Preview: smallest-first sample of non-test, non-config, non-binary source.
+        const sample = index.files
+            .filter((f) => !f.isTest && !f.isConfig && !isBinaryEntry(f))
+            .sort(compareBySizeThenPath)
+            .slice(0, ctx.maxFilesPerStep)
+            .map((f) => toPosix(f.path));
+        sourceFiles = sample;
+        warnings.push("No active task — showing a budget-capped preview. Run `localptp task \"…\"` to scope context.");
+        if (index.files.length === 0) {
+            warnings.push("No source files indexed.");
+        }
+    }
+    return { editFiles, sourceFiles, testFiles, warnings };
+}
+// ---------------------------------------------------------------------------
+// Memory selection
+// ---------------------------------------------------------------------------
+function selectMemory(memory) {
+    const always = ALWAYS_MEMORY.filter((name) => memory[name] !== undefined);
+    const conditional = CONDITIONAL_MEMORY_ORDER.filter((name) => memory[name] !== undefined);
+    return { always, conditional };
+}
+// ---------------------------------------------------------------------------
+// buildContext
+// ---------------------------------------------------------------------------
+const NARROW_TASK_WARNING = "Context package exceeds configured budget. Try narrowing the task or allow summaries/snippets.";
+export function buildContext(inputs) {
+    const { role, config, index, memory, task, session, fileContents } = inputs;
+    const ctx = config.context;
+    const byPath = new Map();
+    for (const f of index.files)
+        byPath.set(toPosix(f.path), f);
+    const sel = selectFiles(inputs);
+    const warnings = [...sel.warnings];
+    // System prompt: §10.1 body, role-labeled header.
+    const systemPrompt = `[role: ${role}]\n${CODER_SYSTEM_PROMPT}`;
+    // Memory selection.
+    const mem = selectMemory(memory);
+    // Conditional memory may be dropped by ladder step 6 (reverse priority).
+    let conditionalMemory = [...mem.conditional];
+    // Resolve bodies for selected source/test files, hard-capped per assumption 5a.
+    // A path absent from fileContents (e.g. deleted since index) is dropped.
+    const bodyFor = (p) => {
+        const raw = fileContents[toPosix(p)];
+        if (raw === undefined)
+            return undefined;
+        return hardCap(raw, ctx.maxFileChars);
+    };
+    const presentSource = sel.sourceFiles.filter((p) => bodyFor(p) !== undefined);
+    const presentTests = sel.testFiles.filter((p) => bodyFor(p) !== undefined);
+    // Edit files are the protected subset of source actually present.
+    const editPresent = new Set(sel.editFiles.filter((p) => presentSource.includes(toPosix(p))).map(toPosix));
+    // Ladder state: which secondary source files are summarized / snippeted.
+    const summarized = new Set();
+    const snippeted = new Set();
+    // --- assembly -----------------------------------------------------------
+    const buildUserPrompt = () => {
+        const parts = [];
+        // Always-include task + session summaries (protected).
+        if (task) {
+            const goal = task.goal ?? "(no goal stated)";
+            const subtask = firstIncompleteSubtask(task) ?? task.subtasks?.[0];
+            parts.push(`## Task\n\nGoal: ${goal}`);
+            if (subtask)
+                parts.push(`Current subtask: ${subtask.text}`);
+        }
+        if (session) {
+            const lines = [];
+            if (session.currentState)
+                lines.push(`Current state: ${session.currentState}`);
+            if (session.nextStep)
+                lines.push(`Next step: ${session.nextStep}`);
+            if (lines.length > 0)
+                parts.push(`## Session\n\n${lines.join("\n")}`);
+        }
+        // Memory: always-include first (protected), then surviving conditional.
+        const memNames = [...mem.always, ...conditionalMemory];
+        for (const name of memNames) {
+            parts.push(`## Memory: ${name}\n\n${memory[name]}`);
+        }
+        // Source files.
+        for (const p of presentSource) {
+            const entry = byPath.get(toPosix(p));
+            const raw = bodyFor(p);
+            if (raw === undefined || !entry)
+                continue;
+            let body = raw;
+            if (summarized.has(toPosix(p))) {
+                body = summarizeFile(entry, fileContents[toPosix(p)] ?? raw);
+            }
+            else if (snippeted.has(toPosix(p))) {
+                body = snippetFile(raw, ctx.maxFileChars);
+            }
+            parts.push(`## Source: ${p}\n\n${body}`);
+        }
+        // Test files.
+        for (const p of presentTests) {
+            const raw = bodyFor(p);
+            if (raw === undefined)
+                continue;
+            let body = raw;
+            if (snippeted.has(toPosix(p)))
+                body = snippetFile(raw, ctx.maxFileChars);
+            parts.push(`## Test: ${p}\n\n${body}`);
+        }
+        return parts.join("\n\n");
+    };
+    const totalChars = () => systemPrompt.length + buildUserPrompt().length;
+    // --- budget ladder ------------------------------------------------------
+    const editSet = editPresent; // protected (steps 1–2)
+    const directTestSet = new Set(presentTests.map(toPosix)); // protected (step 3)
+    /** Secondary (non-edit, non-direct-test) source files, in selection order. */
+    const secondarySource = () => presentSource.filter((p) => !editSet.has(toPosix(p)) && !directTestSet.has(toPosix(p)));
+    if (totalChars() > ctx.maxContextChars) {
+        // Step 4 — summarize secondary source files.
+        let didSummarize = false;
+        for (const p of secondarySource()) {
+            if (totalChars() <= ctx.maxContextChars)
+                break;
+            if (!summarized.has(toPosix(p))) {
+                summarized.add(toPosix(p));
+                didSummarize = true;
+            }
+        }
+        if (didSummarize) {
+            warnings.push("Budget: replaced secondary source files with index summaries.");
+        }
+        // Step 5 — snippet remaining over-budget files (eligible = non-edit,
+        // non-direct-test; summarized files are already small, skip).
+        if (totalChars() > ctx.maxContextChars) {
+            let didSnippet = false;
+            for (const p of secondarySource()) {
+                if (totalChars() <= ctx.maxContextChars)
+                    break;
+                const key = toPosix(p);
+                if (summarized.has(key))
+                    continue;
+                if (!snippeted.has(key)) {
+                    snippeted.add(key);
+                    didSnippet = true;
+                }
+            }
+            if (didSnippet) {
+                warnings.push("Budget: snippeted remaining over-budget files.");
+            }
+        }
+        // Step 6 — drop low-relevance memory (reverse conditional priority).
+        if (totalChars() > ctx.maxContextChars && conditionalMemory.length > 0) {
+            const dropped = [];
+            // Reverse priority: drop the lowest-priority conditional memory first.
+            while (totalChars() > ctx.maxContextChars &&
+                conditionalMemory.length > 0) {
+                const drop = conditionalMemory[conditionalMemory.length - 1];
+                conditionalMemory = conditionalMemory.slice(0, -1);
+                dropped.push(drop);
+            }
+            if (dropped.length > 0) {
+                warnings.push(`Budget: dropped low-relevance memory (${dropped.join(", ")}).`);
+            }
+        }
+        // Step 7 — still over budget: warn to narrow the task. Package still returned.
+        if (totalChars() > ctx.maxContextChars) {
+            warnings.push(NARROW_TASK_WARNING);
+        }
+    }
+    // --- finalize -----------------------------------------------------------
+    const userPrompt = buildUserPrompt();
+    const includedMemoryFiles = [...mem.always, ...conditionalMemory];
+    const estimatedTokens = estimateTokens(systemPrompt + userPrompt);
+    return {
+        role,
+        systemPrompt,
+        userPrompt,
+        includedMemoryFiles,
+        includedSourceFiles: presentSource.map(toPosix),
+        includedTestFiles: presentTests.map(toPosix),
+        estimatedTokens,
+        warnings,
+    };
+}
+//# sourceMappingURL=contextBuilder.js.map

package/dist/core/contextBuilder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"contextBuilder.js","sourceRoot":"","sources":["../../src/core/contextBuilder.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AACH,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EAAE,gBAAgB,EAAE,MAAM,kBAAkB,CAAC;AACpD,OAAO,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAC;AACnD,OAAO,EACL,sBAAsB,GAIvB,MAAM,qBAAqB,CAAC;AAiB7B,8EAA8E;AAC9E,wCAAwC;AACxC,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,wBAAwB,GAAG;IAC/B,kBAAkB;IAClB,eAAe;IACf,eAAe;IACf,YAAY;IACZ,0BAA0B;IAC1B,cAAc;IACd,cAAc;CACf,CAAC;AAEF,MAAM,aAAa,GAAG,CAAC,iBAAiB,CAAC,CAAC;AAE1C,MAAM,iBAAiB,GAAG,mBAAmB,CAAC;AAE9C,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E,SAAS,OAAO,CAAC,CAAS;IACxB,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AAC/B,CAAC;AAED,SAAS,QAAQ,CAAC,CAAS;IACzB,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;IAClC,OAAO,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED,SAAS,aAAa,CAAC,CAAW;IAChC,IAAI,CAAC,CAAC,QAAQ,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACzC,OAAO,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,SAAS,CAAC,WAAW,EAAE,CAAC,CAAC;AACzD,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CACpB,SAAiB,EACjB,QAAgB,EAChB,MAA6B;IAE7B,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,SAAS,CAAC,CAAC,oBAAoB;IACtE,sEAAsE;IACtE,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;IACtD,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,GAAG,OAAO,IAAI,SAAS,EAAE,CAAC,CAAC,CAAC,CAAC;IACpF,8DAA8D;IAC9D,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACpC,IAAI,QAAQ,CAAC,OAAO,CAAC,KAAK,QAAQ;YAAE,OAAO,OAAO,CAAC;IACrD,CAAC;IACD,MAAM,IAAI,GAAG,QAAQ,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;IACtF,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACpC,MAAM,EAAE,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QAC7B,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC,QAAQ,CAAC,IAAI,IAAI,EAAE,CAAC;YAAE,OAAO,OAAO,CAAC;IAC7D,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAC7B,SAAmB,EACnB,KAAgB;IAEhB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK;QAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC;IAC9C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,CAAC,KAAK;YAAE,SAAS;QACrB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;YACnD,IAAI,QAAQ,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACrC,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC/B,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC;oBAAE,KAAK,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AAC5E,CAAC;AAED,SAAS,qBAAqB,CAAC,CAAW,EAAE,CAAW;IACrD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI;QAAE,OAAO,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC;IAC9C,OAAO,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;AACtC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,KAAe,EAAE,IAAY;IACzD,MAAM,UAAU,GACd,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;IACjE,MAAM,MAAM,GAAG,MAAM,KAAK,CAAC,IAAI,MAAM,KAAK,CAAC,QAAQ,MAAM,KAAK,CAAC,IAAI,qBAAqB,UAAU,EAAE,CAAC;IACrG,MAAM,IAAI,GAAG,IAAI;SACd,KAAK,CAAC,OAAO,CAAC;SACd,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;SAClC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;SACZ,IAAI,CAAC,IAAI,CAAC,CAAC;IACd,OAAO,GAAG,MAAM,KAAK,IAAI,EAAE,CAAC;AAC9B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,IAAY,EAAE,QAAgB;IACxD,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,CAAC,CAAC,CAAC;IACvC,IAAI,IAAI,CAAC,MAAM,IAAI,KAAK;QAAE,OAAO,IAAI,CAAC;IACtC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,iBAAiB,CAAC;AAClD,CAAC;AAED,yEAAyE;AACzE,SAAS,OAAO,CAAC,IAAY,EAAE,QAAgB;IAC7C,IAAI,IAAI,CAAC,MAAM,IAAI,QAAQ;QAAE,OAAO,IAAI,CAAC;IACzC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,QAAQ,CAAC,GAAG,iBAAiB,CAAC;AACrD,CAAC;AAED,8EAA8E;AAC9E,uBAAuB;AACvB,8EAA8E;AAE9E,+EAA+E;AAC/E,SAAS,kBAAkB,CAAC,QAAgB;IAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;IACpD,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,oCAAoC;IAClE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,4BAA4B;IAC5B,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,iBAAiB,EAAE,EAAE,CAAC,CAAC;IACpD,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAClB,oCAAoC;IACpC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,EAAE,CAAC,CAAC,CAAC;IAC/D,OAAO,CAAC,GAAG,KAAK,CAAC,CAAC;AACpB,CAAC;AAED,+EAA+E;AAC/E,SAAS,cAAc,CACrB,IAAc,EACd,MAAgB,EAChB,MAA6B;IAE7B,wBAAwB;IACxB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;QAChC,IAAI,aAAa,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,KAAK,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;YACpE,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,0BAA0B;IAC1B,MAAM,UAAU,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACvE,OAAO,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;AAC5D,CAAC;AAaD,MAAM,UAAU,WAAW,CAAC,MAAqB;IAC/C,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,CAAC;IACvC,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC;IAC3B,MAAM,QAAQ,GAAa,EAAE,CAAC;IAE9B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK;QAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAE5D,0DAA0D;IAC1D,IAAI,SAAS,GAAa,EAAE,CAAC;IAC7B,IAAI,IAAI,EAAE,CAAC;QACT,MAAM,OAAO,GAAG,sBAAsB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;QACnE,MAAM,MAAM,GAAG,OAAO,EAAE,WAAW,IAAI,EAAE,CAAC;QAC1C,8DAA8D;QAC9D,SAAS,GAAG,MAAM;aACf,GAAG,CAAC,OAAO,CAAC;aACZ,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;YACZ,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACxB,OAAO,CAAC,KAAK,SAAS,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QAC9C,CAAC,CAAC;aACD,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,mBAAmB,CAAC,CAAC;IACvC,CAAC;IAED,gBAAgB;IAChB,IAAI,WAAqB,CAAC;IAC1B,IAAI,SAAS,GAAa,EAAE,CAAC;IAE7B,IAAI,IAAI,EAAE,CAAC;QACT,MAAM,SAAS,GAAG,GAAG,CAAC,sBAAsB;YAC1C,CAAC,CAAC,eAAe,CAAC,SAAS,EAAE,KAAK,CAAC;YACnC,CAAC,CAAC,EAAE,CAAC;QACP,gEAAgE;QAChE,oEAAoE;QACpE,MAAM,QAAQ,GAAa,CAAC,GAAG,SAAS,CAAC,CAAC;QAC1C,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC;QAChC,MAAM,IAAI,GAAG,GAAG,EAAE,CAAC,QAAQ,CAAC,MAAM,GAAG,GAAG,CAAC,eAAe,CAAC;QAEzD,KAAK,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,EAAE;gBAAE,MAAM;YACnB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC1B,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACjB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACd,CAAC;QACD,WAAW,GAAG,QAAQ,CAAC,KAAK,EAAE,CAAC;QAE/B,oEAAoE;QACpE,IAAI,GAAG,CAAC,YAAY,EAAE,CAAC;YACrB,MAAM,eAAe,GAAG,WAAW;iBAChC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;iBACzB,MAAM,CAAC,CAAC,CAAC,EAAiB,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;YACjD,MAAM,cAAc,GAAG,KAAK,CAAC,KAAK;iBAC/B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;iBAC5C,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;iBACzC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CACZ,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC,CAC1D;iBACA,IAAI,CAAC,qBAAqB,CAAC,CAAC;YAC/B,KAAK,MAAM,CAAC,IAAI,cAAc,EAAE,CAAC;gBAC/B,IAAI,CAAC,IAAI,EAAE;oBAAE,MAAM;gBACnB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC1B,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS;gBAC1B,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAClB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACZ,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACnB,CAAC;QACH,CAAC;IACH,CAAC;SAAM,CAAC;QACN,6EAA6E;QAC7E,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK;aACvB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;aAC5D,IAAI,CAAC,qBAAqB,CAAC;aAC3B,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,eAAe,CAAC;aAC7B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/B,WAAW,GAAG,MAAM,CAAC;QACrB,QAAQ,CAAC,IAAI,CACX,+FAA+F,CAChG,CAAC;QACF,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,QAAQ,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;QAC5C,CAAC;IACH,CAAC;IAED,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,SAAS,EAAE,QAAQ,EAAE,CAAC;AACzD,CAAC;AAED,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E,SAAS,YAAY,CAAC,MAAmB;IAIvC,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,SAAS,CAAC,CAAC;IAC1E,MAAM,WAAW,GAAG,wBAAwB,CAAC,MAAM,CACjD,CAAC,IAAI,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,SAAS,CACrC,CAAC;IACF,OAAO,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;AACjC,CAAC;AAED,8EAA8E;AAC9E,eAAe;AACf,8EAA8E;AAE9E,MAAM,mBAAmB,GACvB,gGAAgG,CAAC;AAEnG,MAAM,UAAU,YAAY,CAAC,MAAqB;IAChD,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,YAAY,EAAE,GAAG,MAAM,CAAC;IAC5E,MAAM,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC;IAE3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK;QAAE,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAE5D,MAAM,GAAG,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;IAChC,MAAM,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC,CAAC;IAEnC,kDAAkD;IAClD,MAAM,YAAY,GAAG,UAAU,IAAI,MAAM,mBAAmB,EAAE,CAAC;IAE/D,oBAAoB;IACpB,MAAM,GAAG,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IACjC,yEAAyE;IACzE,IAAI,iBAAiB,GAAG,CAAC,GAAG,GAAG,CAAC,WAAW,CAAC,CAAC;IAE7C,gFAAgF;IAChF,yEAAyE;IACzE,MAAM,OAAO,GAAG,CAAC,CAAS,EAAsB,EAAE;QAChD,MAAM,GAAG,GAAG,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,IAAI,GAAG,KAAK,SAAS;YAAE,OAAO,SAAS,CAAC;QACxC,OAAO,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;IACxC,CAAC,CAAC;IAEF,MAAM,aAAa,GAAG,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IAC9E,MAAM,YAAY,GAAG,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IAC3E,kEAAkE;IAClE,MAAM,WAAW,GAAG,IAAI,GAAG,CACzB,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAC7E,CAAC;IAEF,yEAAyE;IACzE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,2EAA2E;IAE3E,MAAM,eAAe,GAAG,GAAW,EAAE;QACnC,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,uDAAuD;QACvD,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,kBAAkB,CAAC;YAC7C,MAAM,OAAO,GAAG,sBAAsB,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC;YACnE,KAAK,CAAC,IAAI,CAAC,oBAAoB,IAAI,EAAE,CAAC,CAAC;YACvC,IAAI,OAAO;gBAAE,KAAK,CAAC,IAAI,CAAC,oBAAoB,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;QAC9D,CAAC;QACD,IAAI,OAAO,EAAE,CAAC;YACZ,MAAM,KAAK,GAAa,EAAE,CAAC;YAC3B,IAAI,OAAO,CAAC,YAAY;gBAAE,KAAK,CAAC,IAAI,CAAC,kBAAkB,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;YAC/E,IAAI,OAAO,CAAC,QAAQ;gBAAE,KAAK,CAAC,IAAI,CAAC,cAAc,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC;YACnE,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,iBAAiB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxE,CAAC;QAED,wEAAwE;QACxE,MAAM,QAAQ,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,iBAAiB,CAAC,CAAC;QACvD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,KAAK,CAAC,IAAI,CAAC,cAAc,IAAI,OAAO,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtD,CAAC;QAED,gBAAgB;QAChB,KAAK,MAAM,CAAC,IAAI,aAAa,EAAE,CAAC;YAC9B,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;YACrC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,KAAK;gBAAE,SAAS;YAC1C,IAAI,IAAI,GAAG,GAAG,CAAC;YACf,IAAI,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC/B,IAAI,GAAG,aAAa,CAAC,KAAK,EAAE,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;YAC/D,CAAC;iBAAM,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrC,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;YAC5C,CAAC;YACD,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;QAC3C,CAAC;QAED,cAAc;QACd,KAAK,MAAM,CAAC,IAAI,YAAY,EAAE,CAAC;YAC7B,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;YACvB,IAAI,GAAG,KAAK,SAAS;gBAAE,SAAS;YAChC,IAAI,IAAI,GAAG,GAAG,CAAC;YACf,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;gBAAE,IAAI,GAAG,WAAW,CAAC,GAAG,EAAE,GAAG,CAAC,YAAY,CAAC,CAAC;YACzE,KAAK,CAAC,IAAI,CAAC,YAAY,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;QACzC,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC,CAAC;IAEF,MAAM,UAAU,GAAG,GAAW,EAAE,CAC9B,YAAY,CAAC,MAAM,GAAG,eAAe,EAAE,CAAC,MAAM,CAAC;IAEjD,2EAA2E;IAE3E,MAAM,OAAO,GAAG,WAAW,CAAC,CAAC,wBAAwB;IACrD,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,qBAAqB;IAE/E,8EAA8E;IAC9E,MAAM,eAAe,GAAG,GAAa,EAAE,CACrC,aAAa,CAAC,MAAM,CAClB,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAClE,CAAC;IAEJ,IAAI,UAAU,EAAE,GAAG,GAAG,CAAC,eAAe,EAAE,CAAC;QACvC,6CAA6C;QAC7C,IAAI,YAAY,GAAG,KAAK,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE,EAAE,CAAC;YAClC,IAAI,UAAU,EAAE,IAAI,GAAG,CAAC,eAAe;gBAAE,MAAM;YAC/C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBAChC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC;gBAC3B,YAAY,GAAG,IAAI,CAAC;YACtB,CAAC;QACH,CAAC;QACD,IAAI,YAAY,EAAE,CAAC;YACjB,QAAQ,CAAC,IAAI,CACX,+DAA+D,CAChE,CAAC;QACJ,CAAC;QAED,qEAAqE;QACrE,8DAA8D;QAC9D,IAAI,UAAU,EAAE,GAAG,GAAG,CAAC,eAAe,EAAE,CAAC;YACvC,IAAI,UAAU,GAAG,KAAK,CAAC;YACvB,KAAK,MAAM,CAAC,IAAI,eAAe,EAAE,EAAE,CAAC;gBAClC,IAAI,UAAU,EAAE,IAAI,GAAG,CAAC,eAAe;oBAAE,MAAM;gBAC/C,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAClC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;oBACxB,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;oBACnB,UAAU,GAAG,IAAI,CAAC;gBACpB,CAAC;YACH,CAAC;YACD,IAAI,UAAU,EAAE,CAAC;gBACf,QAAQ,CAAC,IAAI,CAAC,gDAAgD,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;QAED,qEAAqE;QACrE,IAAI,UAAU,EAAE,GAAG,GAAG,CAAC,eAAe,IAAI,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvE,MAAM,OAAO,GAAa,EAAE,CAAC;YAC7B,uEAAuE;YACvE,OACE,UAAU,EAAE,GAAG,GAAG,CAAC,eAAe;gBAClC,iBAAiB,CAAC,MAAM,GAAG,CAAC,EAC5B,CAAC;gBACD,MAAM,IAAI,GAAG,iBAAiB,CAAC,iBAAiB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;gBAC7D,iBAAiB,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACnD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;YACD,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACvB,QAAQ,CAAC,IAAI,CACX,yCAAyC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAChE,CAAC;YACJ,CAAC;QACH,CAAC;QAED,+EAA+E;QAC/E,IAAI,UAAU,EAAE,GAAG,GAAG,CAAC,eAAe,EAAE,CAAC;YACvC,QAAQ,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,2EAA2E;IAE3E,MAAM,UAAU,GAAG,eAAe,EAAE,CAAC;IACrC,MAAM,mBAAmB,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,iBAAiB,CAAC,CAAC;IAClE,MAAM,eAAe,GAAG,cAAc,CAAC,YAAY,GAAG,UAAU,CAAC,CAAC;IAElE,OAAO;QACL,IAAI;QACJ,YAAY;QACZ,UAAU;QACV,mBAAmB;QACnB,mBAAmB,EAAE,aAAa,CAAC,GAAG,CAAC,OAAO,CAAC;QAC/C,iBAAiB,EAAE,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC;QAC5C,eAAe;QACf,QAAQ;KACT,CAAC;AACJ,CAAC"}

package/dist/core/memoryLoader.d.ts

@@ -0,0 +1,4 @@
+export interface MemoryFiles {
+    [name: string]: string;
+}
+export declare function loadMemoryFiles(root: string): Promise<MemoryFiles>;

package/dist/core/memoryLoader.js

@@ -0,0 +1,35 @@
+/**
+ * Memory loader (HLD-SRD §3.4, §3.7).
+ *
+ * Reads the top-level `/ai/*.md` files into a `name → content` map for the
+ * Context Builder. Subdirectories (`tasks/`, `sessions/`) and non-markdown
+ * files are ignored. A missing `/ai` dir yields an empty map (no crash).
+ */
+import { promises as fs } from "node:fs";
+import { layout } from "../utils/paths.js";
+export async function loadMemoryFiles(root) {
+    const l = layout(root);
+    const out = {};
+    let entries;
+    try {
+        entries = await fs.readdir(l.aiDir, { withFileTypes: true });
+    }
+    catch {
+        // Missing /ai dir (or unreadable) — degrade to an empty memory map.
+        return out;
+    }
+    for (const entry of entries) {
+        if (!entry.isFile())
+            continue;
+        if (!entry.name.toLowerCase().endsWith(".md"))
+            continue;
+        try {
+            out[entry.name] = await fs.readFile(l.memoryFile(entry.name), "utf8");
+        }
+        catch {
+            // A file that vanished mid-read is simply omitted.
+        }
+    }
+    return out;
+}
+//# sourceMappingURL=memoryLoader.js.map

package/dist/core/memoryLoader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"memoryLoader.js","sourceRoot":"","sources":["../../src/core/memoryLoader.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,OAAO,EAAE,QAAQ,IAAI,EAAE,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAM3C,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,IAAY;IAChD,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC;IACvB,MAAM,GAAG,GAAgB,EAAE,CAAC;IAE5B,IAAI,OAAmC,CAAC;IACxC,IAAI,CAAC;QACH,OAAO,GAAG,MAAM,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;IAC/D,CAAC;IAAC,MAAM,CAAC;QACP,oEAAoE;QACpE,OAAO,GAAG,CAAC;IACb,CAAC;IAED,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE;YAAE,SAAS;QAC9B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;YAAE,SAAS;QACxD,IAAI,CAAC;YACH,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,CAAC;QACxE,CAAC;QAAC,MAAM,CAAC;YACP,mDAAmD;QACrD,CAAC;IACH,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC"}

package/dist/core/memoryManager.d.ts

@@ -0,0 +1,41 @@
+import type { Layout } from "../utils/paths.js";
+/**
+ * Per-entry character cap for appended memory entries (design §3, assumption 3).
+ * Content longer than this cap is truncated before writing.
+ */
+export declare const MAX_ENTRY_CHARS = 280;
+export interface ScaffoldReport {
+    created: string[];
+    preserved: string[];
+}
+/**
+ * Replace or append a marker-delimited section in a file.
+ *
+ * Markers: `<!-- BEGIN localcoder:<markerId> -->` / `<!-- END localcoder:<markerId> -->`
+ *
+ * - If both markers exist: replaces the inner region with `\n${body}\n`, preserving
+ *   all content outside.
+ * - If markers are absent: appends a fresh BEGIN/body/END block.
+ * - If duplicate BEGIN markers: replaces the first complete block, warns.
+ * - If file doesn't exist: creates it with just the marker block.
+ */
+export declare function updateMarkerSection(filePath: string, markerId: string, body: string): Promise<void>;
+/**
+ * Append a dated, length-capped entry under `sectionHeading` in `filePath`.
+ *
+ * Algorithm:
+ *   1. Read the file (or default to a title heading if absent).
+ *   2. Build the entry line: `- YYYY-MM-DD — <truncated content>`.
+ *   3. If the file already contains that exact line anywhere inside
+ *      `## sectionHeading` → return (de-dupe same-day identical entry).
+ *   4. If `## sectionHeading` exists: insert the entry at the END of that
+ *      section (just before the next `## ` of same/lower level or EOF).
+ *   5. If not: append a fresh `\n## sectionHeading\n<entry>\n` block.
+ *   6. Write file — only the inserted line differs; all prior prose is intact.
+ */
+export declare function appendMemoryEntry(filePath: string, sectionHeading: string, rawEntry: string): Promise<void>;
+export declare class MemoryManager {
+    private readonly layout;
+    constructor(layout: Layout);
+    scaffold(): Promise<ScaffoldReport>;
+}