lmgrep 0.1.18 → 0.2.1

package/dist/domain/project/ProjectLocator.js

@@ -0,0 +1,178 @@
+import { dirname, join, resolve } from "node:path";
+import { Branch } from "./Branch.js";
+import { DatabaseLocation } from "./DatabaseLocation.js";
+import { Project } from "./Project.js";
+import { ProjectId } from "./ProjectId.js";
+/**
+ * Translates a working directory into a project identity and a database
+ * location.
+ *
+ * This is the only place that knows the rules, and there are three:
+ *
+ * **A repository's index lives inside it**, at `<git-common-dir>/lmgrep/`.
+ * Git resolves that to the main checkout's `.git` even from a linked worktree,
+ * so every worktree of a repository agrees on one index by construction rather
+ * than by a shared registry that could disagree with reality. It also means
+ * the index is found by `du`, deleted by `rm -rf`, and gone when the clone is
+ * — which is what stops orphaned databases from accumulating somewhere the
+ * user never looks. Git never walks its own directory, so nothing here is ever
+ * committed or indexed.
+ *
+ * **Each embedding model gets its own database.** Vectors from different
+ * models are not comparable, so pointing lmgrep at a new model used to mean
+ * discarding the index or searching it with embeddings that quietly meant
+ * nothing. Keyed by model, switching is just a different subdirectory, and
+ * switching back finds the old index intact.
+ *
+ * **Everything else falls back to the state directory**: projects outside git
+ * have no repository to live in, and `--database <name>` is by definition not
+ * tied to one.
+ */
+export class ProjectLocator {
+    git;
+    state;
+    model;
+    dimensions;
+    /** Subdirectory of the git common directory holding every model's index. */
+    static REPOSITORY_SUBDIRECTORY = "lmgrep";
+    constructor(git, state, 
+    /** The configured embedding model, which partitions the databases. */
+    model, 
+    /** Configured output width, when the model has a configurable one. */
+    dimensions) {
+        this.git = git;
+        this.state = state;
+        this.model = model;
+        this.dimensions = dimensions;
+    }
+    /**
+     * Identify the project containing `cwd`.
+     *
+     * A git repo is identified by its origin URL when it has one, so every
+     * worktree and clone maps to a single identity; a remoteless repo falls
+     * back to its root path, and a plain directory to its own absolute path.
+     */
+    resolveProject(cwd) {
+        const absolute = resolve(cwd);
+        const gitRoot = this.git.toplevel(absolute);
+        if (gitRoot) {
+            const branch = Branch.of(this.git.currentBranch(gitRoot) ?? "HEAD");
+            const remoteUrl = this.git.originUrl(gitRoot);
+            return new Project(ProjectId.of(remoteUrl ?? gitRoot), gitRoot, branch, remoteUrl);
+        }
+        return new Project(ProjectId.of(absolute), absolute, Branch.default());
+    }
+    /** The directory holding every model's index for the project at `cwd`. */
+    indexHomeFor(cwd) {
+        const commonDir = this.git.commonDir(resolve(cwd));
+        if (commonDir) {
+            return join(commonDir, ProjectLocator.REPOSITORY_SUBDIRECTORY);
+        }
+        return join(this.state.databasesDirectory(), this.resolveProject(cwd).id.toSlug());
+    }
+    /** Database directory for the project containing `cwd`. */
+    databasePathFor(cwd) {
+        return join(this.indexHomeFor(cwd), this.modelSlug());
+    }
+    /**
+     * The working tree a repository index belongs to, for display and for the
+     * registry.
+     *
+     * Worktrees share one database, so the toplevel of whichever worktree
+     * happened to run the index would name an arbitrary one of them. The main
+     * checkout — the parent of the common directory — is the stable answer.
+     */
+    projectRootFor(cwd) {
+        const commonDir = this.git.commonDir(resolve(cwd));
+        return commonDir ? dirname(commonDir) : this.resolveProject(cwd).root;
+    }
+    /** Directory name the configured model's embeddings are stored under. */
+    modelSlug() {
+        return this.model.toSlug(this.dimensions);
+    }
+    /**
+     * Where an index built with `model` belongs.
+     *
+     * Needed when adopting a database written by an older layout, which knows
+     * which model built it but not which slot the current rules would put it
+     * in. It must go through here rather than deriving a slug independently:
+     * the width only counts when it was *configured*, since an index records
+     * the width it observed and that is the model's native size whenever
+     * nothing was requested. Computing the slug from the recorded width
+     * instead produced a directory the locator would never look in — an
+     * adopted index that was silently invisible.
+     */
+    databasePathForModel(cwd, model) {
+        const dimensions = model.isSameFamilyAs(this.model)
+            ? this.dimensions
+            : undefined;
+        return join(this.indexHomeFor(cwd), model.toSlug(dimensions));
+    }
+    /**
+     * Decide which database a command targets.
+     *
+     * With no override this is the repository's index for the configured
+     * model. An override containing a separator is taken literally — it is an
+     * exact address, and appending anything to it would make it impossible to
+     * point at a database that already exists. A bare name is an identity
+     * instead, so it is model-scoped like any other.
+     *
+     * Either way the result is flat and branch-agnostic: indexing and search
+     * both use the default branch, so switching git branches never hides
+     * results in a database the user asked for explicitly. `cwd` still drives
+     * file scanning; only the database identity changes.
+     */
+    resolveDatabase(cwd, database) {
+        if (database && database.length > 0) {
+            const path = this.isPathLike(database)
+                ? resolve(cwd, database)
+                : join(this.state.databasesDirectory(), database.replace(/[^a-zA-Z0-9_.-]/g, "_"), this.modelSlug());
+            return new DatabaseLocation(path, Branch.default(), resolve(cwd), true);
+        }
+        const project = this.resolveProject(cwd);
+        return new DatabaseLocation(this.databasePathFor(cwd), project.branch, project.root, false);
+    }
+    /**
+     * Find the indexed project root covering `cwd` and the prefix from it.
+     *
+     * For a git repo the root is the toplevel. Outside git, walks up looking
+     * for an ancestor that already has an index, so running from a
+     * subdirectory of an indexed tree still finds it.
+     */
+    findIndexedAncestor(cwd) {
+        const absolute = resolve(cwd);
+        const root = this.resolveProject(cwd).root;
+        if (this.state.isDirectory(this.databasePathFor(root))) {
+            return {
+                root,
+                prefix: root === absolute ? "" : absolute.slice(root.length + 1),
+            };
+        }
+        // Only plain directories climb: inside a git repo the toplevel is
+        // definitive, so a miss there means there is genuinely no index.
+        if (root === absolute) {
+            let current = resolve(absolute, "..");
+            for (;;) {
+                if (this.state.isDirectory(this.databasePathFor(current))) {
+                    return {
+                        root: current,
+                        prefix: absolute.slice(current.length + 1),
+                    };
+                }
+                const parent = resolve(current, "..");
+                if (parent === current)
+                    break;
+                current = parent;
+            }
+        }
+        return undefined;
+    }
+    /** A `--database` override is a path when it carries a separator. */
+    isPathLike(value) {
+        return (value.includes("/") ||
+            value.includes("\\") ||
+            value === "." ||
+            value === "..");
+    }
+}
+//# sourceMappingURL=ProjectLocator.js.map

package/dist/domain/project/ProjectLocator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ProjectLocator.js","sourceRoot":"","sources":["../../../src/domain/project/ProjectLocator.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AAGnD,OAAO,EAAE,MAAM,EAAE,MAAM,aAAa,CAAC;AACrC,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAEzD,OAAO,EAAE,OAAO,EAAE,MAAM,cAAc,CAAC;AACvC,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAS3C;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,MAAM,OAAO,cAAc;IAKR;IACA;IAEA;IAEA;IATlB,4EAA4E;IACpE,MAAM,CAAU,uBAAuB,GAAG,QAAQ,CAAC;IAE3D,YACkB,GAAY,EACZ,KAAyB;IAC1C,sEAAsE;IACrD,KAAoB;IACrC,sEAAsE;IACrD,UAAmB;QALnB,QAAG,GAAH,GAAG,CAAS;QACZ,UAAK,GAAL,KAAK,CAAoB;QAEzB,UAAK,GAAL,KAAK,CAAe;QAEpB,eAAU,GAAV,UAAU,CAAS;IAClC,CAAC;IAEJ;;;;;;OAMG;IACH,cAAc,CAAC,GAAW;QACzB,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QAE9B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QAC5C,IAAI,OAAO,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,MAAM,CAAC,CAAC;YACpE,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YAC9C,OAAO,IAAI,OAAO,CACjB,SAAS,CAAC,EAAE,CAAC,SAAS,IAAI,OAAO,CAAC,EAClC,OAAO,EACP,MAAM,EACN,SAAS,CACT,CAAC;QACH,CAAC;QAED,OAAO,IAAI,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC,QAAQ,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC;IACxE,CAAC;IAED,0EAA0E;IAC1E,YAAY,CAAC,GAAW;QACvB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;QACnD,IAAI,SAAS,EAAE,CAAC;YACf,OAAO,IAAI,CAAC,SAAS,EAAE,cAAc,CAAC,uBAAuB,CAAC,CAAC;QAChE,CAAC;QACD,OAAO,IAAI,CACV,IAAI,CAAC,KAAK,CAAC,kBAAkB,EAAE,EAC/B,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,MAAM,EAAE,CACpC,CAAC;IACH,CAAC;IAED,2DAA2D;IAC3D,eAAe,CAAC,GAAW;QAC1B,OAAO,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC;IACvD,CAAC;IAED;;;;;;;OAOG;IACH,cAAc,CAAC,GAAW;QACzB,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;QACnD,OAAO,SAAS,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;IACvE,CAAC;IAED,yEAAyE;IACzE,SAAS;QACR,OAAO,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;;;;;;;OAWG;IACH,oBAAoB,CAAC,GAAW,EAAE,KAAoB;QACrD,MAAM,UAAU,GAAG,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC;YAClD,CAAC,CAAC,IAAI,CAAC,UAAU;YACjB,CAAC,CAAC,SAAS,CAAC;QACb,OAAO,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC;IAC/D,CAAC;IAED;;;;;;;;;;;;;OAaG;IACH,eAAe,CAAC,GAAW,EAAE,QAAiB;QAC7C,IAAI,QAAQ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC;gBACrC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC;gBACxB,CAAC,CAAC,IAAI,CACJ,IAAI,CAAC,KAAK,CAAC,kBAAkB,EAAE,EAC/B,QAAQ,CAAC,OAAO,CAAC,kBAAkB,EAAE,GAAG,CAAC,EACzC,IAAI,CAAC,SAAS,EAAE,CAChB,CAAC;YACJ,OAAO,IAAI,gBAAgB,CAAC,IAAI,EAAE,MAAM,CAAC,OAAO,EAAE,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QACzE,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;QACzC,OAAO,IAAI,gBAAgB,CAC1B,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,EACzB,OAAO,CAAC,MAAM,EACd,OAAO,CAAC,IAAI,EACZ,KAAK,CACL,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,mBAAmB,CAAC,GAAW;QAC9B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;QAE3C,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YACxD,OAAO;gBACN,IAAI;gBACJ,MAAM,EAAE,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;aAChE,CAAC;QACH,CAAC;QAED,kEAAkE;QAClE,iEAAiE;QACjE,IAAI,IAAI,KAAK,QAAQ,EAAE,CAAC;YACvB,IAAI,OAAO,GAAG,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YACtC,SAAS,CAAC;gBACT,IAAI,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC;oBAC3D,OAAO;wBACN,IAAI,EAAE,OAAO;wBACb,MAAM,EAAE,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC;qBAC1C,CAAC;gBACH,CAAC;gBACD,MAAM,MAAM,GAAG,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;gBACtC,IAAI,MAAM,KAAK,OAAO;oBAAE,MAAM;gBAC9B,OAAO,GAAG,MAAM,CAAC;YAClB,CAAC;QACF,CAAC;QAED,OAAO,SAAS,CAAC;IAClB,CAAC;IAED,qEAAqE;IAC7D,UAAU,CAAC,KAAa;QAC/B,OAAO,CACN,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC;YACnB,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC;YACpB,KAAK,KAAK,GAAG;YACb,KAAK,KAAK,IAAI,CACd,CAAC;IACH,CAAC"}

package/dist/domain/research/Citation.d.ts

@@ -0,0 +1,27 @@
+/** A source an answer can cite: a numbered code location. */
+export interface Source {
+    n: number;
+    path: string;
+    startLine: number;
+    endLine: number;
+}
+/**
+ * Reads `[n]` citation markers out of an answer.
+ *
+ * Both the single `[3]` and the grouped `[3, 5]` forms must parse — small
+ * models reach for the grouped form when one claim has several sources, and a
+ * marker we cannot read is a source silently missing from the answer's list,
+ * which is exactly the grounding the answer exists to provide.
+ */
+export declare class CitationMarkers {
+    private static readonly PATTERN;
+    /** Every cited id in first-appearance order, groups expanded; may repeat. */
+    static idsIn(text: string): number[];
+    static present(text: string): boolean;
+    /**
+     * Resolve cited ids against the sources actually surfaced, in citation
+     * order. Hallucinated ids are dropped: the marker stays in the prose, but
+     * no invented source is listed under it.
+     */
+    static resolve(answer: string, sources: readonly Source[]): Source[];
+}

package/dist/domain/research/Citation.js

@@ -0,0 +1,43 @@
+/**
+ * Reads `[n]` citation markers out of an answer.
+ *
+ * Both the single `[3]` and the grouped `[3, 5]` forms must parse — small
+ * models reach for the grouped form when one claim has several sources, and a
+ * marker we cannot read is a source silently missing from the answer's list,
+ * which is exactly the grounding the answer exists to provide.
+ */
+export class CitationMarkers {
+    static PATTERN = /\[(\d+(?:\s*,\s*\d+)*)\]/g;
+    /** Every cited id in first-appearance order, groups expanded; may repeat. */
+    static idsIn(text) {
+        const out = [];
+        for (const match of text.matchAll(CitationMarkers.PATTERN)) {
+            for (const part of match[1].split(","))
+                out.push(Number(part.trim()));
+        }
+        return out;
+    }
+    static present(text) {
+        return CitationMarkers.idsIn(text).length > 0;
+    }
+    /**
+     * Resolve cited ids against the sources actually surfaced, in citation
+     * order. Hallucinated ids are dropped: the marker stays in the prose, but
+     * no invented source is listed under it.
+     */
+    static resolve(answer, sources) {
+        const byNumber = new Map(sources.map((s) => [s.n, s]));
+        const seen = new Set();
+        const out = [];
+        for (const n of CitationMarkers.idsIn(answer)) {
+            if (seen.has(n))
+                continue;
+            seen.add(n);
+            const source = byNumber.get(n);
+            if (source)
+                out.push(source);
+        }
+        return out;
+    }
+}
+//# sourceMappingURL=Citation.js.map

package/dist/domain/research/Citation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Citation.js","sourceRoot":"","sources":["../../../src/domain/research/Citation.ts"],"names":[],"mappings":"AAQA;;;;;;;GAOG;AACH,MAAM,OAAO,eAAe;IACnB,MAAM,CAAU,OAAO,GAAG,2BAA2B,CAAC;IAE9D,6EAA6E;IAC7E,MAAM,CAAC,KAAK,CAAC,IAAY;QACxB,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,CAAC,eAAe,CAAC,OAAO,CAAC,EAAE,CAAC;YAC5D,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACvE,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC;IAED,MAAM,CAAC,OAAO,CAAC,IAAY;QAC1B,OAAO,eAAe,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAC/C,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,OAAO,CAAC,MAAc,EAAE,OAA0B;QACxD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,eAAe,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/C,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC1B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACZ,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/B,IAAI,MAAM;gBAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;QACD,OAAO,GAAG,CAAC;IACZ,CAAC"}

package/dist/domain/research/EvidenceLedger.d.ts

@@ -0,0 +1,47 @@
+import type { Hit } from "../retrieval/Hit.js";
+import type { Source } from "./Citation.js";
+/**
+ * Accumulates what the research loop has seen, and numbers it.
+ *
+ * Numbering is stable and deduplicated by location, so the same chunk surfaced
+ * by two different searches keeps one id — otherwise the model would cite the
+ * same code under several numbers and the source list would triple.
+ */
+export declare class EvidenceLedger {
+    /**
+     * Cap on one hit's source. AST chunks are usually small; a large one is
+     * truncated to its head so a single search cannot swamp the context.
+     */
+    private static readonly MAX_CONTENT_CHARS;
+    /**
+     * Char budget for the digest fed to fallback synthesis. ~9k chars is
+     * roughly 2.5k tokens, which fits even an 8k window alongside the prompt
+     * and the answer.
+     */
+    private static readonly DIGEST_CHAR_BUDGET;
+    /** How many sources to offer when asking a model to add citations. */
+    private static readonly MENU_SIZE;
+    private readonly sourceList;
+    private readonly byLocation;
+    private readonly evidence;
+    private readonly recorded;
+    get sources(): Source[];
+    get isEmpty(): boolean;
+    /** Register hits, returning each one's id and the body shown to the model. */
+    ingest(hits: readonly Hit[]): Array<{
+        id: number;
+        hit: Hit;
+        body: string;
+    }>;
+    /**
+     * A budgeted digest of everything gathered, for one-shot synthesis in a
+     * fresh context. Blocks are truncated rather than dropped so the earliest
+     * (highest-ranked) evidence always appears.
+     */
+    digest(): string;
+    /** A compact source list, for asking a model to insert missing citations. */
+    menu(): string;
+    private register;
+    private clamp;
+    private firstLine;
+}

package/dist/domain/research/EvidenceLedger.js

@@ -0,0 +1,111 @@
+/**
+ * Accumulates what the research loop has seen, and numbers it.
+ *
+ * Numbering is stable and deduplicated by location, so the same chunk surfaced
+ * by two different searches keeps one id — otherwise the model would cite the
+ * same code under several numbers and the source list would triple.
+ */
+export class EvidenceLedger {
+    /**
+     * Cap on one hit's source. AST chunks are usually small; a large one is
+     * truncated to its head so a single search cannot swamp the context.
+     */
+    static MAX_CONTENT_CHARS = 1400;
+    /**
+     * Char budget for the digest fed to fallback synthesis. ~9k chars is
+     * roughly 2.5k tokens, which fits even an 8k window alongside the prompt
+     * and the answer.
+     */
+    static DIGEST_CHAR_BUDGET = 9000;
+    /** How many sources to offer when asking a model to add citations. */
+    static MENU_SIZE = 12;
+    sourceList = [];
+    byLocation = new Map();
+    evidence = [];
+    recorded = new Set();
+    get sources() {
+        return this.sourceList;
+    }
+    get isEmpty() {
+        return this.evidence.length === 0;
+    }
+    /** Register hits, returning each one's id and the body shown to the model. */
+    ingest(hits) {
+        return hits.map((hit) => {
+            const id = this.register(hit);
+            const body = this.clamp(hit.content);
+            if (!this.recorded.has(id)) {
+                this.recorded.add(id);
+                this.evidence.push({
+                    n: id,
+                    path: hit.location.filePath,
+                    startLine: hit.location.startLine,
+                    endLine: hit.location.endLine,
+                    text: body,
+                });
+            }
+            return { id, hit, body };
+        });
+    }
+    /**
+     * A budgeted digest of everything gathered, for one-shot synthesis in a
+     * fresh context. Blocks are truncated rather than dropped so the earliest
+     * (highest-ranked) evidence always appears.
+     */
+    digest() {
+        let budget = EvidenceLedger.DIGEST_CHAR_BUDGET;
+        const blocks = [];
+        for (const ev of this.evidence) {
+            if (budget <= 0)
+                break;
+            const header = `[${ev.n}] ${ev.path}:${ev.startLine}-${ev.endLine}`;
+            const overhead = header.length + 2;
+            let text = ev.text;
+            if (text.length + overhead > budget) {
+                text = `${text.slice(0, Math.max(0, budget - overhead))}\n… (truncated)`;
+            }
+            blocks.push(`${header}\n${text}`);
+            budget -= text.length + overhead;
+        }
+        return blocks.join("\n\n");
+    }
+    /** A compact source list, for asking a model to insert missing citations. */
+    menu() {
+        return this.evidence
+            .slice(0, EvidenceLedger.MENU_SIZE)
+            .map((ev) => `[${ev.n}] ${ev.path}:${ev.startLine}-${ev.endLine} — ${this.firstLine(ev.text)}`)
+            .join("\n");
+    }
+    register(hit) {
+        const key = hit.location.toString();
+        const existing = this.byLocation.get(key);
+        if (existing != null)
+            return existing;
+        const n = this.sourceList.length + 1;
+        this.sourceList.push({
+            n,
+            path: hit.location.filePath,
+            startLine: hit.location.startLine,
+            endLine: hit.location.endLine,
+        });
+        this.byLocation.set(key, n);
+        return n;
+    }
+    clamp(content) {
+        if (content.length <= EvidenceLedger.MAX_CONTENT_CHARS)
+            return content;
+        const head = content.slice(0, EvidenceLedger.MAX_CONTENT_CHARS);
+        const omitted = content
+            .slice(EvidenceLedger.MAX_CONTENT_CHARS)
+            .split("\n").length;
+        return `${head}\n… (${omitted} more lines — search a narrower query if you need them)`;
+    }
+    firstLine(text) {
+        const line = text
+            .split("\n")
+            .find((l) => l.trim().length > 0)
+            ?.trim() ?? "";
+        return line.length > 100 ? `${line.slice(0, 100)}…` : line;
+    }
+}
+//# sourceMappingURL=EvidenceLedger.js.map

package/dist/domain/research/EvidenceLedger.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"EvidenceLedger.js","sourceRoot":"","sources":["../../../src/domain/research/EvidenceLedger.ts"],"names":[],"mappings":"AAYA;;;;;;GAMG;AACH,MAAM,OAAO,cAAc;IAC1B;;;OAGG;IACK,MAAM,CAAU,iBAAiB,GAAG,IAAI,CAAC;IAEjD;;;;OAIG;IACK,MAAM,CAAU,kBAAkB,GAAG,IAAI,CAAC;IAElD,sEAAsE;IAC9D,MAAM,CAAU,SAAS,GAAG,EAAE,CAAC;IAEtB,UAAU,GAAa,EAAE,CAAC;IAC1B,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,QAAQ,GAAe,EAAE,CAAC;IAC1B,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAE9C,IAAI,OAAO;QACV,OAAO,IAAI,CAAC,UAAU,CAAC;IACxB,CAAC;IAED,IAAI,OAAO;QACV,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,8EAA8E;IAC9E,MAAM,CAAC,IAAoB;QAC1B,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;YACvB,MAAM,EAAE,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YAC9B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACrC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC5B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACtB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC;oBAClB,CAAC,EAAE,EAAE;oBACL,IAAI,EAAE,GAAG,CAAC,QAAQ,CAAC,QAAQ;oBAC3B,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,SAAS;oBACjC,OAAO,EAAE,GAAG,CAAC,QAAQ,CAAC,OAAO;oBAC7B,IAAI,EAAE,IAAI;iBACV,CAAC,CAAC;YACJ,CAAC;YACD,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;QAC1B,CAAC,CAAC,CAAC;IACJ,CAAC;IAED;;;;OAIG;IACH,MAAM;QACL,IAAI,MAAM,GAAG,cAAc,CAAC,kBAAkB,CAAC;QAC/C,MAAM,MAAM,GAAa,EAAE,CAAC;QAE5B,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAChC,IAAI,MAAM,IAAI,CAAC;gBAAE,MAAM;YACvB,MAAM,MAAM,GAAG,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,SAAS,IAAI,EAAE,CAAC,OAAO,EAAE,CAAC;YACpE,MAAM,QAAQ,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;YACnC,IAAI,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC;YACnB,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ,GAAG,MAAM,EAAE,CAAC;gBACrC,IAAI,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,QAAQ,CAAC,CAAC,iBAAiB,CAAC;YAC1E,CAAC;YACD,MAAM,CAAC,IAAI,CAAC,GAAG,MAAM,KAAK,IAAI,EAAE,CAAC,CAAC;YAClC,MAAM,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ,CAAC;QAClC,CAAC;QACD,OAAO,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5B,CAAC;IAED,6EAA6E;IAC7E,IAAI;QACH,OAAO,IAAI,CAAC,QAAQ;aAClB,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,SAAS,CAAC;aAClC,GAAG,CACH,CAAC,EAAE,EAAE,EAAE,CACN,IAAI,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC,SAAS,IAAI,EAAE,CAAC,OAAO,MAAM,IAAI,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAClF;aACA,IAAI,CAAC,IAAI,CAAC,CAAC;IACd,CAAC;IAEO,QAAQ,CAAC,GAAQ;QACxB,MAAM,GAAG,GAAG,GAAG,CAAC,QAAQ,CAAC,QAAQ,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC1C,IAAI,QAAQ,IAAI,IAAI;YAAE,OAAO,QAAQ,CAAC;QAEtC,MAAM,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC;QACrC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC;YACpB,CAAC;YACD,IAAI,EAAE,GAAG,CAAC,QAAQ,CAAC,QAAQ;YAC3B,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,SAAS;YACjC,OAAO,EAAE,GAAG,CAAC,QAAQ,CAAC,OAAO;SAC7B,CAAC,CAAC;QACH,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;QAC5B,OAAO,CAAC,CAAC;IACV,CAAC;IAEO,KAAK,CAAC,OAAe;QAC5B,IAAI,OAAO,CAAC,MAAM,IAAI,cAAc,CAAC,iBAAiB;YAAE,OAAO,OAAO,CAAC;QACvE,MAAM,IAAI,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,cAAc,CAAC,iBAAiB,CAAC,CAAC;QAChE,MAAM,OAAO,GAAG,OAAO;aACrB,KAAK,CAAC,cAAc,CAAC,iBAAiB,CAAC;aACvC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;QACrB,OAAO,GAAG,IAAI,QAAQ,OAAO,yDAAyD,CAAC;IACxF,CAAC;IAEO,SAAS,CAAC,IAAY;QAC7B,MAAM,IAAI,GACT,IAAI;aACF,KAAK,CAAC,IAAI,CAAC;aACX,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;YACjC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;QACjB,OAAO,IAAI,CAAC,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;IAC5D,CAAC"}

package/dist/domain/research/ResearchTrace.d.ts

@@ -0,0 +1,19 @@
+/** One step of a research run, for the caller to display live. */
+export type TraceEntry = {
+    kind: "search";
+    query: string;
+    hits: number;
+} | {
+    kind: "note";
+    message: string;
+};
+/** Records what a research run did, and streams it to an optional observer. */
+export declare class ResearchTrace {
+    private readonly observer?;
+    private readonly entries;
+    constructor(observer?: ((entry: TraceEntry) => void) | undefined);
+    record(entry: TraceEntry): void;
+    searched(query: string, hits: number): void;
+    noted(message: string): void;
+    toArray(): TraceEntry[];
+}

package/dist/domain/research/ResearchTrace.js

@@ -0,0 +1,22 @@
+/** Records what a research run did, and streams it to an optional observer. */
+export class ResearchTrace {
+    observer;
+    entries = [];
+    constructor(observer) {
+        this.observer = observer;
+    }
+    record(entry) {
+        this.entries.push(entry);
+        this.observer?.(entry);
+    }
+    searched(query, hits) {
+        this.record({ kind: "search", query, hits });
+    }
+    noted(message) {
+        this.record({ kind: "note", message });
+    }
+    toArray() {
+        return [...this.entries];
+    }
+}
+//# sourceMappingURL=ResearchTrace.js.map

package/dist/domain/research/ResearchTrace.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ResearchTrace.js","sourceRoot":"","sources":["../../../src/domain/research/ResearchTrace.ts"],"names":[],"mappings":"AAKA,+EAA+E;AAC/E,MAAM,OAAO,aAAa;IAGI;IAFZ,OAAO,GAAiB,EAAE,CAAC;IAE5C,YAA6B,QAAsC;QAAtC,aAAQ,GAAR,QAAQ,CAA8B;IAAG,CAAC;IAEvE,MAAM,CAAC,KAAiB;QACvB,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,IAAI,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,CAAC;IACxB,CAAC;IAED,QAAQ,CAAC,KAAa,EAAE,IAAY;QACnC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;IAC9C,CAAC;IAED,KAAK,CAAC,OAAe;QACpB,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;IACxC,CAAC;IAED,OAAO;QACN,OAAO,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC;IAC1B,CAAC;CACD"}

package/dist/domain/retrieval/Hit.d.ts

@@ -0,0 +1,19 @@
+import type { CodeLocation } from "../corpus/CodeLocation.js";
+import type { FileVersion } from "../corpus/FileVersion.js";
+/** A retrieved chunk together with its similarity score. */
+export declare class Hit {
+    /** Chunk identity, used to deduplicate a result page. */
+    readonly id: string;
+    readonly location: CodeLocation;
+    readonly type: string;
+    readonly name: string;
+    readonly content: string;
+    readonly context: string;
+    readonly score: number;
+    readonly fileVersion: FileVersion;
+    constructor(
+    /** Chunk identity, used to deduplicate a result page. */
+    id: string, location: CodeLocation, type: string, name: string, content: string, context: string, score: number, fileVersion: FileVersion);
+    /** The same hit with its path rooted under another project's directory. */
+    relocatedUnder(root: string): Hit;
+}

package/dist/domain/retrieval/Hit.js

@@ -0,0 +1,28 @@
+/** A retrieved chunk together with its similarity score. */
+export class Hit {
+    id;
+    location;
+    type;
+    name;
+    content;
+    context;
+    score;
+    fileVersion;
+    constructor(
+    /** Chunk identity, used to deduplicate a result page. */
+    id, location, type, name, content, context, score, fileVersion) {
+        this.id = id;
+        this.location = location;
+        this.type = type;
+        this.name = name;
+        this.content = content;
+        this.context = context;
+        this.score = score;
+        this.fileVersion = fileVersion;
+    }
+    /** The same hit with its path rooted under another project's directory. */
+    relocatedUnder(root) {
+        return new Hit(this.id, this.location.relocatedUnder(root), this.type, this.name, this.content, this.context, this.score, this.fileVersion);
+    }
+}
+//# sourceMappingURL=Hit.js.map

package/dist/domain/retrieval/Hit.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Hit.js","sourceRoot":"","sources":["../../../src/domain/retrieval/Hit.ts"],"names":[],"mappings":"AAGA,4DAA4D;AAC5D,MAAM,OAAO,GAAG;IAGL;IACA;IACA;IACA;IACA;IACA;IACA;IACA;IATV;IACC,yDAAyD;IAChD,EAAU,EACV,QAAsB,EACtB,IAAY,EACZ,IAAY,EACZ,OAAe,EACf,OAAe,EACf,KAAa,EACb,WAAwB;QAPxB,OAAE,GAAF,EAAE,CAAQ;QACV,aAAQ,GAAR,QAAQ,CAAc;QACtB,SAAI,GAAJ,IAAI,CAAQ;QACZ,SAAI,GAAJ,IAAI,CAAQ;QACZ,YAAO,GAAP,OAAO,CAAQ;QACf,YAAO,GAAP,OAAO,CAAQ;QACf,UAAK,GAAL,KAAK,CAAQ;QACb,gBAAW,GAAX,WAAW,CAAa;IAC/B,CAAC;IAEJ,2EAA2E;IAC3E,cAAc,CAAC,IAAY;QAC1B,OAAO,IAAI,GAAG,CACb,IAAI,CAAC,EAAE,EACP,IAAI,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,EAClC,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,OAAO,EACZ,IAAI,CAAC,KAAK,EACV,IAAI,CAAC,WAAW,CAChB,CAAC;IACH,CAAC;CACD"}

package/dist/domain/retrieval/HitList.d.ts

@@ -0,0 +1,35 @@
+import type { Hit } from "./Hit.js";
+/**
+ * An ordered result page, with the reductions that always follow retrieval.
+ *
+ * These used to be loose steps repeated at each call site; collecting them
+ * here means "what search returns" has one definition, and the ordering of the
+ * reductions (dedup before trim, always) cannot drift between callers.
+ */
+export declare class HitList {
+    private readonly hits;
+    private constructor();
+    static of(hits: readonly Hit[]): HitList;
+    static empty(): HitList;
+    get length(): number;
+    get isEmpty(): boolean;
+    toArray(): Hit[];
+    [Symbol.iterator](): Iterator<Hit>;
+    /**
+     * Drop redundant rows, keeping the first (highest-scoring) of each group:
+     *
+     *  1. Exact duplicates by chunk id — identical rows produced by concurrent
+     *     unlocked indexing.
+     *  2. Overlapping line ranges within a file — the fallback chunker's
+     *     sliding-window overlap, plus any parent/child or near-duplicate span.
+     *     Tree-sitter chunks are node-bounded and never overlap, so this only
+     *     ever removes genuine near-duplicates.
+     */
+    deduplicated(): HitList;
+    takeAtMost(limit: number): HitList;
+    filtered(predicate: (hit: Hit) => boolean): HitList;
+    mapped(transform: (hit: Hit) => Hit): HitList;
+    /** Highest score first — used when merging pages from several projects. */
+    sortedByScoreDescending(): HitList;
+    concat(other: HitList): HitList;
+}

package/dist/domain/retrieval/HitList.js

@@ -0,0 +1,81 @@
+/**
+ * An ordered result page, with the reductions that always follow retrieval.
+ *
+ * These used to be loose steps repeated at each call site; collecting them
+ * here means "what search returns" has one definition, and the ordering of the
+ * reductions (dedup before trim, always) cannot drift between callers.
+ */
+export class HitList {
+    hits;
+    constructor(hits) {
+        this.hits = hits;
+    }
+    static of(hits) {
+        return new HitList(hits);
+    }
+    static empty() {
+        return new HitList([]);
+    }
+    get length() {
+        return this.hits.length;
+    }
+    get isEmpty() {
+        return this.hits.length === 0;
+    }
+    toArray() {
+        return [...this.hits];
+    }
+    [Symbol.iterator]() {
+        return this.hits[Symbol.iterator]();
+    }
+    /**
+     * Drop redundant rows, keeping the first (highest-scoring) of each group:
+     *
+     *  1. Exact duplicates by chunk id — identical rows produced by concurrent
+     *     unlocked indexing.
+     *  2. Overlapping line ranges within a file — the fallback chunker's
+     *     sliding-window overlap, plus any parent/child or near-duplicate span.
+     *     Tree-sitter chunks are node-bounded and never overlap, so this only
+     *     ever removes genuine near-duplicates.
+     */
+    deduplicated() {
+        const seenIds = new Set();
+        const keptRanges = new Map();
+        const out = [];
+        for (const hit of this.hits) {
+            if (seenIds.has(hit.id))
+                continue;
+            seenIds.add(hit.id);
+            const { filePath, startLine, endLine } = hit.location;
+            const ranges = keptRanges.get(filePath);
+            if (ranges) {
+                const overlaps = ranges.some(([s, e]) => startLine <= e && s <= endLine);
+                if (overlaps)
+                    continue;
+                ranges.push([startLine, endLine]);
+            }
+            else {
+                keptRanges.set(filePath, [[startLine, endLine]]);
+            }
+            out.push(hit);
+        }
+        return new HitList(out);
+    }
+    takeAtMost(limit) {
+        return new HitList(this.hits.slice(0, limit));
+    }
+    filtered(predicate) {
+        return new HitList(this.hits.filter(predicate));
+    }
+    mapped(transform) {
+        return new HitList(this.hits.map(transform));
+    }
+    /** Highest score first — used when merging pages from several projects. */
+    sortedByScoreDescending() {
+        return new HitList([...this.hits].sort((a, b) => b.score - a.score));
+    }
+    concat(other) {
+        return new HitList([...this.hits, ...other.hits]);
+    }
+}
+//# sourceMappingURL=HitList.js.map

package/dist/domain/retrieval/HitList.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"HitList.js","sourceRoot":"","sources":["../../../src/domain/retrieval/HitList.ts"],"names":[],"mappings":"AAEA;;;;;;GAMG;AACH,MAAM,OAAO,OAAO;IACkB;IAArC,YAAqC,IAAoB;QAApB,SAAI,GAAJ,IAAI,CAAgB;IAAG,CAAC;IAE7D,MAAM,CAAC,EAAE,CAAC,IAAoB;QAC7B,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,MAAM,CAAC,KAAK;QACX,OAAO,IAAI,OAAO,CAAC,EAAE,CAAC,CAAC;IACxB,CAAC;IAED,IAAI,MAAM;QACT,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IACzB,CAAC;IAED,IAAI,OAAO;QACV,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED,OAAO;QACN,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;IAED,CAAC,MAAM,CAAC,QAAQ,CAAC;QAChB,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,EAAE,CAAC;IACrC,CAAC;IAED;;;;;;;;;OASG;IACH,YAAY;QACX,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAmC,CAAC;QAC9D,MAAM,GAAG,GAAU,EAAE,CAAC;QAEtB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC7B,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAClC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAEpB,MAAM,EAAE,QAAQ,EAAE,SAAS,EAAE,OAAO,EAAE,GAAG,GAAG,CAAC,QAAQ,CAAC;YACtD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACxC,IAAI,MAAM,EAAE,CAAC;gBACZ,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,CAC3B,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,IAAI,OAAO,CAC1C,CAAC;gBACF,IAAI,QAAQ;oBAAE,SAAS;gBACvB,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC;YACnC,CAAC;iBAAM,CAAC;gBACP,UAAU,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;YAClD,CAAC;YACD,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,CAAC;QAED,OAAO,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC;IACzB,CAAC;IAED,UAAU,CAAC,KAAa;QACvB,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;IAC/C,CAAC;IAED,QAAQ,CAAC,SAAgC;QACxC,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,MAAM,CAAC,SAA4B;QAClC,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED,2EAA2E;IAC3E,uBAAuB;QACtB,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACtE,CAAC;IAED,MAAM,CAAC,KAAc;QACpB,OAAO,IAAI,OAAO,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;IACnD,CAAC;CACD"}