@smeltjs/core 0.1.0

package/dist/repomap/cache.js

@@ -0,0 +1,139 @@
+import { mkdirSync, readFileSync, renameSync, unlinkSync, writeFileSync } from 'node:fs';
+import { join } from 'node:path';
+import process from 'node:process';
+import { contentHash } from '../hash.js';
+/**
+ * The repo map's disk cache — per-file tags, keyed by content hash, JSON on disk.
+ *
+ * Modelled on Aider's repo-map tags cache (https://aider.chat/docs/repomap.html),
+ * with one deliberate substitution: Aider persists through SQLite; this repo ships
+ * zero new runtime dependencies, so entries are plain JSON files under a directory
+ * **the caller explicitly hands in**. smelt never writes outside a store or cache it
+ * was handed — no default location, no home-directory guessing.
+ *
+ * The key is a content hash over the tag-format version, the language, and the file's
+ * exact text. That is the whole invalidation story: edit a file and its key changes,
+ * so the stale entry is simply never looked up again. Nothing needs a timestamp.
+ *
+ * A corrupt entry — unparseable JSON, or JSON of the wrong shape — is **discarded
+ * loudly, never trusted**: the entry file is deleted, the tags are re-extracted from
+ * source, and the caller's result carries a warning naming the file. Trusting a
+ * damaged cache would silently drop symbols from the map, which is this project's
+ * signature failure mode.
+ */
+/** The format name every cache entry carries. */
+export const TAGS_CACHE_FORMAT = 'smelt-repomap-tags';
+/** Bump this when the tag shape changes: old entries then miss instead of misleading. */
+export const TAGS_CACHE_VERSION = 1;
+/**
+ * The cache key for one file's tags. The version and language are part of the hashed
+ * material, so a format bump or a re-detected language can never resurrect an entry
+ * extracted under different rules.
+ */
+export function tagsCacheKey(language, content) {
+    return contentHash(`${TAGS_CACHE_FORMAT}/${String(TAGS_CACHE_VERSION)}\0${language}\0${content}`);
+}
+export class TagsCache {
+    #entriesDir;
+    /** `dir` is the directory the caller handed in; entries live under `<dir>/tags/`. */
+    constructor(dir) {
+        this.#entriesDir = join(dir, 'tags');
+        mkdirSync(this.#entriesDir, { recursive: true });
+    }
+    /**
+     * The cached tags under `key`, `undefined` on a miss, `'corrupt'` when an entry
+     * existed but could not be trusted — in which case it has already been deleted, so
+     * the corruption is reported exactly once and never re-read.
+     */
+    read(key) {
+        let raw;
+        try {
+            raw = readFileSync(this.#entryPath(key), 'utf8');
+        }
+        catch (error) {
+            if (error.code === 'ENOENT')
+                return undefined;
+            throw error;
+        }
+        let parsed;
+        try {
+            parsed = JSON.parse(raw);
+        }
+        catch {
+            this.#discard(key);
+            return 'corrupt';
+        }
+        const tags = validateEntry(parsed);
+        if (tags === undefined) {
+            this.#discard(key);
+            return 'corrupt';
+        }
+        return tags;
+    }
+    /**
+     * Persist one file's tags. Written to a temp name and renamed into place, so a
+     * concurrent reader never sees a half-written entry; both writers of the same key
+     * are writing identical bytes (the key covers the content), so last-rename-wins is
+     * harmless. No fsync: unlike the elision store, every entry here is derivable from
+     * source, so losing one to a crash costs a re-parse, not a broken promise.
+     */
+    write(key, tags) {
+        const body = `${JSON.stringify({
+            format: TAGS_CACHE_FORMAT,
+            version: TAGS_CACHE_VERSION,
+            defs: tags.defs,
+            refs: tags.refs,
+        })}\n`;
+        const target = this.#entryPath(key);
+        const temp = `${target}.tmp-${String(process.pid)}`;
+        writeFileSync(temp, body, 'utf8');
+        renameSync(temp, target);
+    }
+    #entryPath(key) {
+        return join(this.#entriesDir, `${key}.json`);
+    }
+    /** Delete a corrupt entry so it can never be re-read as truth. Best effort. */
+    #discard(key) {
+        try {
+            unlinkSync(this.#entryPath(key));
+        }
+        catch {
+            // Already gone, or undeletable — either way it will be overwritten by the
+            // rewrite that follows every discard.
+        }
+    }
+}
+/** The parsed entry as `FileTags`, or `undefined` when its shape cannot be trusted. */
+function validateEntry(parsed) {
+    if (typeof parsed !== 'object' || parsed === null)
+        return undefined;
+    const entry = parsed;
+    if (entry.format !== TAGS_CACHE_FORMAT || entry.version !== TAGS_CACHE_VERSION)
+        return undefined;
+    if (!Array.isArray(entry.defs) || !Array.isArray(entry.refs))
+        return undefined;
+    const defs = [];
+    for (const item of entry.defs) {
+        const def = item;
+        if (typeof def.name !== 'string' || def.name === '')
+            return undefined;
+        if (typeof def.kind !== 'string' || def.kind === '')
+            return undefined;
+        if (typeof def.line !== 'number' || !Number.isInteger(def.line) || def.line < 1) {
+            return undefined;
+        }
+        defs.push({ name: def.name, kind: def.kind, line: def.line });
+    }
+    const refs = [];
+    for (const item of entry.refs) {
+        const ref = item;
+        if (typeof ref.name !== 'string' || ref.name === '')
+            return undefined;
+        if (typeof ref.count !== 'number' || !Number.isInteger(ref.count) || ref.count < 1) {
+            return undefined;
+        }
+        refs.push({ name: ref.name, count: ref.count });
+    }
+    return { defs, refs };
+}
+//# sourceMappingURL=cache.js.map

package/dist/repomap/cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cache.js","sourceRoot":"","sources":["../../src/repomap/cache.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,UAAU,EAAE,UAAU,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AACzF,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AACjC,OAAO,OAAO,MAAM,cAAc,CAAC;AAEnC,OAAO,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAIzC;;;;;;;;;;;;;;;;;;GAkBG;AAEH,iDAAiD;AACjD,MAAM,CAAC,MAAM,iBAAiB,GAAG,oBAAoB,CAAC;AAEtD,yFAAyF;AACzF,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAC;AAEpC;;;;GAIG;AACH,MAAM,UAAU,YAAY,CAAC,QAAoB,EAAE,OAAe;IAChE,OAAO,WAAW,CAAC,GAAG,iBAAiB,IAAI,MAAM,CAAC,kBAAkB,CAAC,KAAK,QAAQ,KAAK,OAAO,EAAE,CAAC,CAAC;AACpG,CAAC;AAKD,MAAM,OAAO,SAAS;IACX,WAAW,CAAS;IAE7B,qFAAqF;IACrF,YAAY,GAAW;QACrB,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;QACrC,SAAS,CAAC,IAAI,CAAC,WAAW,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACnD,CAAC;IAED;;;;OAIG;IACH,IAAI,CAAC,GAAW;QACd,IAAI,GAAW,CAAC;QAChB,IAAI,CAAC;YACH,GAAG,GAAG,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC;QACnD,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAK,KAA+B,CAAC,IAAI,KAAK,QAAQ;gBAAE,OAAO,SAAS,CAAC;YACzE,MAAM,KAAK,CAAC;QACd,CAAC;QACD,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC3B,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACnB,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,MAAM,IAAI,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QACnC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC;YACnB,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,GAAW,EAAE,IAAc;QAC/B,MAAM,IAAI,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC;YAC7B,MAAM,EAAE,iBAAiB;YACzB,OAAO,EAAE,kBAAkB;YAC3B,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,IAAI,EAAE,IAAI,CAAC,IAAI;SAChB,CAAC,IAAI,CAAC;QACP,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,GAAG,MAAM,QAAQ,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;QACpD,aAAa,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC;QAClC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC3B,CAAC;IAED,UAAU,CAAC,GAAW;QACpB,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,GAAG,OAAO,CAAC,CAAC;IAC/C,CAAC;IAED,+EAA+E;IAC/E,QAAQ,CAAC,GAAW;QAClB,IAAI,CAAC;YACH,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QACnC,CAAC;QAAC,MAAM,CAAC;YACP,0EAA0E;YAC1E,sCAAsC;QACxC,CAAC;IACH,CAAC;CACF;AAED,uFAAuF;AACvF,SAAS,aAAa,CAAC,MAAe;IACpC,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI;QAAE,OAAO,SAAS,CAAC;IACpE,MAAM,KAAK,GAAG,MAAiF,CAAC;IAChG,IAAI,KAAK,CAAC,MAAM,KAAK,iBAAiB,IAAI,KAAK,CAAC,OAAO,KAAK,kBAAkB;QAAE,OAAO,SAAS,CAAC;IACjG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC;QAAE,OAAO,SAAS,CAAC;IAE/E,MAAM,IAAI,GAAoB,EAAE,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,IAAiB,EAAE,CAAC;QAC3C,MAAM,GAAG,GAAG,IAA0D,CAAC;QACvE,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE;YAAE,OAAO,SAAS,CAAC;QACtE,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE;YAAE,OAAO,SAAS,CAAC;QACtE,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAChF,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC;IAChE,CAAC;IACD,MAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,IAAiB,EAAE,CAAC;QAC3C,MAAM,GAAG,GAAG,IAA2C,CAAC;QACxD,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,GAAG,CAAC,IAAI,KAAK,EAAE;YAAE,OAAO,SAAS,CAAC;QACtE,IAAI,OAAO,GAAG,CAAC,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC;YACnF,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACxB,CAAC"}

package/dist/repomap/map.d.ts

@@ -0,0 +1,161 @@
+/**
+ * The repo-map builder — Slice 7, the cross-file shape.
+ *
+ * **Modelled on Aider's repo-map, and credited as such.** The whole design is prior
+ * art: Paul Gauthier's Aider extracts tree-sitter definition/reference tags per file,
+ * runs PageRank over the cross-file reference graph, fits the ranked result to a
+ * budget, and caches tags on disk keyed by content — see
+ * https://aider.chat/docs/repomap.html and `aider/repomap.py` in
+ * https://github.com/Aider-AI/aider. Nothing about the approach is this project's
+ * invention; what this module adds is only smelt's own house rules:
+ *
+ *  - **Local files only** (Law 1). The caller names the root; symlinks are never
+ *    followed, so the walk cannot leave it; binary files are skipped; no network.
+ *  - **Every inclusion is explainable** (Law 2, applied to inclusion rather than
+ *    elision): each symbol in the map carries a rule id and a sentence stating its
+ *    definition site and the measured reference counts that ranked it.
+ *  - **Deterministic**: fixed PageRank constants, sorted walks, a total tie-break by
+ *    path, name, and line. Two runs over the same tree are byte-identical.
+ *  - **The budget is bytes**, same contract as the planners, and it is respected by
+ *    construction: symbols are added in rank order until the next line would not fit.
+ *  - **The cache lives only in a directory the caller explicitly hands in**, and a
+ *    corrupt entry is discarded loudly — a warning in the result — never trusted.
+ *
+ * **Deliberately NOT a `Planner`.** `buildRepoMap` returns a {@link RepoMap},
+ * not an `ElisionPlan`: nothing here is elided, nothing is stored under a hash, and
+ * there is no original to reconstruct — the map is a *summary built up under a
+ * budget*, not a *removal to be reversed*. Forcing the Planner interface onto it
+ * would claim Law 3 (reversibility) about output that has no bytes to give back,
+ * which is exactly the kind of lie the interface exists to prevent. The CLI serves
+ * it as its own subcommand (`smelt map`), never as a `--strategy`.
+ */
+/** The id stamped on every map this module emits. */
+export declare const REPO_MAP_ID = "repomap/v1";
+/**
+ * Rule id for a symbol something in the scanned tree references — its own file
+ * included, so its rank may still be zero when every reference is same-file (only
+ * cross-file references move rank).
+ */
+export declare const REPO_MAP_RANKED_RULE = "ranked-definition";
+/** Rule id for a definition nothing in the scanned tree references. */
+export declare const REPO_MAP_UNREFERENCED_RULE = "unreferenced-definition";
+/**
+ * Rule id for a definition promoted because it matches a caller-supplied focus term.
+ * The rank stays the measured PageRank share — focus moves a symbol's *place in the
+ * fill order*, never its numbers.
+ */
+export declare const REPO_MAP_FOCUS_RULE = "focus-match";
+/** Rule id for a file listed by path because no definitions were extracted from it. */
+export declare const REPO_MAP_PATH_ONLY_RULE = "path-only";
+/** Rule id for the warning left behind when a corrupt cache entry is discarded. */
+export declare const REPO_MAP_CACHE_CORRUPT_RULE = "cache-entry-corrupt";
+/**
+ * The ignore list used when the caller supplies none. Deliberately tiny: `.git` is
+ * object storage, `node_modules` is other people's code. A caller with opinions passes
+ * its own list, which *replaces* this one.
+ */
+export declare const DEFAULT_REPO_IGNORE: readonly string[];
+/** Why an entry is in the map — same two-register shape as {@link ElisionReason}. */
+export interface RepoMapReason {
+    /** Stable machine id, e.g. `'ranked-definition'`. */
+    readonly rule: string;
+    /** A sentence a human can read: definition site and the counts that ranked it. */
+    readonly explanation: string;
+}
+export interface RepoMapOptions {
+    /** The repository root to read. Local files only; symlinks are never followed. */
+    readonly root: string;
+    /** Ceiling for the rendered map, in UTF-8 bytes. Respected, not aimed at. */
+    readonly budgetBytes: number;
+    /**
+     * What the task is actually about — same meaning as a planner's focus. A
+     * definition whose name or path contains a term (case-insensitive, like the
+     * lexical planner's default) is promoted to the front of the fill order, so it
+     * survives a tight budget. Promotion only: the measured rank and reference
+     * counts are never altered, and each promoted entry says which term it matched.
+     */
+    readonly focus?: readonly string[];
+    /**
+     * Paths to skip, replacing {@link DEFAULT_REPO_IGNORE}. An entry containing `/` is
+     * matched as a root-relative path prefix — a trailing slash counts, so `build/`
+     * means the root-level `build` tree, never every `build` segment anywhere; a bare
+     * name matches any path segment.
+     */
+    readonly ignore?: readonly string[];
+    /**
+     * Directory for the tags cache. **Only** when this is passed is anything written
+     * to disk — smelt never writes outside a store or cache it was explicitly handed.
+     */
+    readonly cacheDir?: string;
+}
+/** One symbol included in the rendered map, with the receipt for its inclusion. */
+export interface RepoMapEntry {
+    readonly path: string;
+    readonly name: string;
+    readonly kind: string;
+    /** 1-based line of the definition. */
+    readonly line: number;
+    /** PageRank share this definition attracted. `0` for unreferenced definitions. */
+    readonly rank: number;
+    /** Measured: total references to this name across the scanned tree. */
+    readonly refsIn: number;
+    /** Measured: distinct files holding those references. */
+    readonly refsInFiles: number;
+    /** Measured: references the defining file makes to names defined elsewhere. */
+    readonly refsOut: number;
+    readonly reason: RepoMapReason;
+}
+/** A file listed by path because no definitions were extracted from it. */
+export interface RepoMapPathEntry {
+    readonly path: string;
+    readonly reason: RepoMapReason;
+}
+/** Something worth telling the caller that is not worth failing the build over. */
+export interface RepoMapWarning {
+    readonly rule: string;
+    readonly explanation: string;
+}
+/** Measured cache activity for one build. Counts only — smelt claims no rates. */
+export interface RepoMapCacheCounts {
+    /** Lookups answered from disk. */
+    readonly hits: number;
+    /** Lookups that found nothing and re-extracted from source. */
+    readonly misses: number;
+    /** Corrupt entries deleted and re-extracted; each one also left a warning. */
+    readonly discarded: number;
+}
+export interface RepoMap {
+    readonly id: typeof REPO_MAP_ID;
+    /** The rendered map. Always at most `budgetBytes` UTF-8 bytes. */
+    readonly text: string;
+    readonly outputBytes: number;
+    readonly budgetBytes: number;
+    /** The symbols that fit, in fill order (focus matches first, then rank). */
+    readonly entries: readonly RepoMapEntry[];
+    /** Path-only files that fit, after the symbols, in path order. */
+    readonly pathOnly: readonly RepoMapPathEntry[];
+    /** All ranked definitions found, before the budget cut anything. */
+    readonly definitionsTotal: number;
+    /** All path-only candidates found, before the budget cut anything. */
+    readonly pathOnlyTotal: number;
+    /** Regular files examined under the root, after the ignore list. */
+    readonly filesScanned: number;
+    /** Files skipped because their bytes contain a NUL — binary, not mappable. */
+    readonly binarySkipped: number;
+    readonly warnings: readonly RepoMapWarning[];
+    /** Present only when the caller handed in a `cacheDir`. Never invented. */
+    readonly cache?: RepoMapCacheCounts;
+}
+/**
+ * Build a ranked symbol map of the repository under `options.root`.
+ *
+ * Reads local files only. Deterministic: two runs over the same tree, with or without
+ * a warm cache, produce byte-identical maps — asserted by the guard in
+ * `test/guards/repo-map.test.ts`, not assumed.
+ *
+ * @throws {SmeltError} when `budgetBytes` is not a positive integer.
+ * @throws {GrammarUnavailableError} when a supported language's grammar cannot load —
+ *   never a silent skip that would make the map quietly incomplete.
+ */
+export declare function buildRepoMap(options: RepoMapOptions): Promise<RepoMap>;
+//# sourceMappingURL=map.d.ts.map

package/dist/repomap/map.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"map.d.ts","sourceRoot":"","sources":["../../src/repomap/map.ts"],"names":[],"mappings":"AAaA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH,qDAAqD;AACrD,eAAO,MAAM,WAAW,eAAe,CAAC;AAExC;;;;GAIG;AACH,eAAO,MAAM,oBAAoB,sBAAsB,CAAC;AAExD,uEAAuE;AACvE,eAAO,MAAM,0BAA0B,4BAA4B,CAAC;AAEpE;;;;GAIG;AACH,eAAO,MAAM,mBAAmB,gBAAgB,CAAC;AAEjD,uFAAuF;AACvF,eAAO,MAAM,uBAAuB,cAAc,CAAC;AAEnD,mFAAmF;AACnF,eAAO,MAAM,2BAA2B,wBAAwB,CAAC;AAEjE;;;;GAIG;AACH,eAAO,MAAM,mBAAmB,EAAE,SAAS,MAAM,EAA6B,CAAC;AAE/E,qFAAqF;AACrF,MAAM,WAAW,aAAa;IAC5B,qDAAqD;IACrD,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,kFAAkF;IAClF,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC9B;AAED,MAAM,WAAW,cAAc;IAC7B,kFAAkF;IAClF,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,6EAA6E;IAC7E,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B;;;;;;OAMG;IACH,QAAQ,CAAC,KAAK,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACnC;;;;;OAKG;IACH,QAAQ,CAAC,MAAM,CAAC,EAAE,SAAS,MAAM,EAAE,CAAC;IACpC;;;OAGG;IACH,QAAQ,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC;CAC5B;AAED,mFAAmF;AACnF,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,sCAAsC;IACtC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,kFAAkF;IAClF,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,uEAAuE;IACvE,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,yDAAyD;IACzD,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,+EAA+E;IAC/E,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAC;IACzB,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;CAChC;AAED,2EAA2E;AAC3E,MAAM,WAAW,gBAAgB;IAC/B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,MAAM,EAAE,aAAa,CAAC;CAChC;AAED,mFAAmF;AACnF,MAAM,WAAW,cAAc;IAC7B,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;CAC9B;AAED,kFAAkF;AAClF,MAAM,WAAW,kBAAkB;IACjC,kCAAkC;IAClC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,+DAA+D;IAC/D,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,8EAA8E;IAC9E,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;CAC5B;AAED,MAAM,WAAW,OAAO;IACtB,QAAQ,CAAC,EAAE,EAAE,OAAO,WAAW,CAAC;IAChC,kEAAkE;IAClE,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAC;IAC7B,4EAA4E;IAC5E,QAAQ,CAAC,OAAO,EAAE,SAAS,YAAY,EAAE,CAAC;IAC1C,kEAAkE;IAClE,QAAQ,CAAC,QAAQ,EAAE,SAAS,gBAAgB,EAAE,CAAC;IAC/C,oEAAoE;IACpE,QAAQ,CAAC,gBAAgB,EAAE,MAAM,CAAC;IAClC,sEAAsE;IACtE,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,oEAAoE;IACpE,QAAQ,CAAC,YAAY,EAAE,MAAM,CAAC;IAC9B,8EAA8E;IAC9E,QAAQ,CAAC,aAAa,EAAE,MAAM,CAAC;IAC/B,QAAQ,CAAC,QAAQ,EAAE,SAAS,cAAc,EAAE,CAAC;IAC7C,2EAA2E;IAC3E,QAAQ,CAAC,KAAK,CAAC,EAAE,kBAAkB,CAAC;CACrC;AAED;;;;;;;;;;GAUG;AACH,wBAAsB,YAAY,CAAC,OAAO,EAAE,cAAc,GAAG,OAAO,CAAC,OAAO,CAAC,CAyF5E"}

package/dist/repomap/map.js

@@ -0,0 +1,302 @@
+import { lstatSync, readdirSync, readFileSync } from 'node:fs';
+import { join } from 'node:path';
+import { detectLanguage } from '../detect.js';
+import { SmeltError } from '../errors.js';
+import { TagsCache, tagsCacheKey } from './cache.js';
+import { rankDefinitions } from './rank.js';
+import { extractTags } from './tags.js';
+/**
+ * The repo-map builder — Slice 7, the cross-file shape.
+ *
+ * **Modelled on Aider's repo-map, and credited as such.** The whole design is prior
+ * art: Paul Gauthier's Aider extracts tree-sitter definition/reference tags per file,
+ * runs PageRank over the cross-file reference graph, fits the ranked result to a
+ * budget, and caches tags on disk keyed by content — see
+ * https://aider.chat/docs/repomap.html and `aider/repomap.py` in
+ * https://github.com/Aider-AI/aider. Nothing about the approach is this project's
+ * invention; what this module adds is only smelt's own house rules:
+ *
+ *  - **Local files only** (Law 1). The caller names the root; symlinks are never
+ *    followed, so the walk cannot leave it; binary files are skipped; no network.
+ *  - **Every inclusion is explainable** (Law 2, applied to inclusion rather than
+ *    elision): each symbol in the map carries a rule id and a sentence stating its
+ *    definition site and the measured reference counts that ranked it.
+ *  - **Deterministic**: fixed PageRank constants, sorted walks, a total tie-break by
+ *    path, name, and line. Two runs over the same tree are byte-identical.
+ *  - **The budget is bytes**, same contract as the planners, and it is respected by
+ *    construction: symbols are added in rank order until the next line would not fit.
+ *  - **The cache lives only in a directory the caller explicitly hands in**, and a
+ *    corrupt entry is discarded loudly — a warning in the result — never trusted.
+ *
+ * **Deliberately NOT a `Planner`.** `buildRepoMap` returns a {@link RepoMap},
+ * not an `ElisionPlan`: nothing here is elided, nothing is stored under a hash, and
+ * there is no original to reconstruct — the map is a *summary built up under a
+ * budget*, not a *removal to be reversed*. Forcing the Planner interface onto it
+ * would claim Law 3 (reversibility) about output that has no bytes to give back,
+ * which is exactly the kind of lie the interface exists to prevent. The CLI serves
+ * it as its own subcommand (`smelt map`), never as a `--strategy`.
+ */
+/** The id stamped on every map this module emits. */
+export const REPO_MAP_ID = 'repomap/v1';
+/**
+ * Rule id for a symbol something in the scanned tree references — its own file
+ * included, so its rank may still be zero when every reference is same-file (only
+ * cross-file references move rank).
+ */
+export const REPO_MAP_RANKED_RULE = 'ranked-definition';
+/** Rule id for a definition nothing in the scanned tree references. */
+export const REPO_MAP_UNREFERENCED_RULE = 'unreferenced-definition';
+/**
+ * Rule id for a definition promoted because it matches a caller-supplied focus term.
+ * The rank stays the measured PageRank share — focus moves a symbol's *place in the
+ * fill order*, never its numbers.
+ */
+export const REPO_MAP_FOCUS_RULE = 'focus-match';
+/** Rule id for a file listed by path because no definitions were extracted from it. */
+export const REPO_MAP_PATH_ONLY_RULE = 'path-only';
+/** Rule id for the warning left behind when a corrupt cache entry is discarded. */
+export const REPO_MAP_CACHE_CORRUPT_RULE = 'cache-entry-corrupt';
+/**
+ * The ignore list used when the caller supplies none. Deliberately tiny: `.git` is
+ * object storage, `node_modules` is other people's code. A caller with opinions passes
+ * its own list, which *replaces* this one.
+ */
+export const DEFAULT_REPO_IGNORE = ['.git', 'node_modules'];
+/**
+ * Build a ranked symbol map of the repository under `options.root`.
+ *
+ * Reads local files only. Deterministic: two runs over the same tree, with or without
+ * a warm cache, produce byte-identical maps — asserted by the guard in
+ * `test/guards/repo-map.test.ts`, not assumed.
+ *
+ * @throws {SmeltError} when `budgetBytes` is not a positive integer.
+ * @throws {GrammarUnavailableError} when a supported language's grammar cannot load —
+ *   never a silent skip that would make the map quietly incomplete.
+ */
+export async function buildRepoMap(options) {
+    const { root, budgetBytes } = options;
+    if (!Number.isInteger(budgetBytes) || budgetBytes < 1) {
+        throw new SmeltError(`smelt: budgetBytes must be a positive integer, got ${String(budgetBytes)}. ` +
+            `There is no default budget — a budget smelt invented would silently decide ` +
+            `how much of the map to throw away.`);
+    }
+    const ignore = options.ignore ?? DEFAULT_REPO_IGNORE;
+    const cache = options.cacheDir === undefined ? undefined : new TagsCache(options.cacheDir);
+    const cacheCounts = { hits: 0, misses: 0, discarded: 0 };
+    const warnings = [];
+    const files = scanFiles(root, ignore);
+    let binarySkipped = 0;
+    const parsed = [];
+    const pathOnlyPaths = [];
+    for (const rel of files) {
+        const bytes = readFileSync(join(root, ...rel.split('/')));
+        if (bytes.includes(0)) {
+            binarySkipped += 1;
+            continue;
+        }
+        const language = detectLanguage(rel);
+        if (language === 'unknown') {
+            pathOnlyPaths.push(rel);
+            continue;
+        }
+        const text = bytes.toString('utf8');
+        const tags = await tagsFor(text, language, cache, cacheCounts, warnings, rel);
+        if (tags.defs.length === 0)
+            pathOnlyPaths.push(rel);
+        if (tags.defs.length > 0 || tags.refs.length > 0)
+            parsed.push({ path: rel, tags });
+    }
+    const ranked = rankDefinitions(parsed);
+    const focus = (options.focus ?? []).filter((term) => term.length > 0);
+    const ordered = orderWithFocus(ranked, focus);
+    // Fit to the budget: ranked symbols first — focus matches promoted to the front,
+    // each partition in rank order — then path-only files, in path order. Filling
+    // stops at the first line that does not fit, so the included set is always a
+    // prefix of that order — a map that skipped its #2 symbol to squeeze in its #9
+    // would be lying about what mattered.
+    const lines = [];
+    let bytes = 0;
+    const tryAppend = (line) => {
+        const lineBytes = Buffer.byteLength(line, 'utf8') + 1; // its trailing newline
+        if (bytes + lineBytes > budgetBytes)
+            return false;
+        lines.push(line);
+        bytes += lineBytes;
+        return true;
+    };
+    const entries = [];
+    for (const { definition, focusTerm } of ordered) {
+        if (!tryAppend(renderDefinition(definition)))
+            break;
+        entries.push(toEntry(definition, focusTerm));
+    }
+    const pathOnly = [];
+    if (entries.length === ordered.length) {
+        for (const rel of pathOnlyPaths) {
+            if (!tryAppend(`${rel} [path only]`))
+                break;
+            pathOnly.push({
+                path: rel,
+                reason: {
+                    rule: REPO_MAP_PATH_ONLY_RULE,
+                    explanation: `no definitions extracted from ${rel}; listed by path so the file stays visible`,
+                },
+            });
+        }
+    }
+    const text = lines.length === 0 ? '' : `${lines.join('\n')}\n`;
+    return {
+        id: REPO_MAP_ID,
+        text,
+        outputBytes: Buffer.byteLength(text, 'utf8'),
+        budgetBytes,
+        entries,
+        pathOnly,
+        definitionsTotal: ranked.length,
+        pathOnlyTotal: pathOnlyPaths.length,
+        filesScanned: files.length,
+        binarySkipped,
+        warnings,
+        ...(cache === undefined ? {} : { cache: { ...cacheCounts } }),
+    };
+}
+/** One file's tags — from the cache when possible, from the grammar when not. */
+async function tagsFor(text, language, cache, counts, warnings, rel) {
+    if (cache === undefined)
+        return extractTags(text, language);
+    const key = tagsCacheKey(language, text);
+    const found = cache.read(key);
+    if (found === 'corrupt') {
+        counts.discarded += 1;
+        warnings.push({
+            rule: REPO_MAP_CACHE_CORRUPT_RULE,
+            explanation: `discarded a corrupt cache entry for ${rel} and re-extracted its tags from ` +
+                `source; the entry file was deleted so it cannot be read again`,
+        });
+    }
+    else if (found !== undefined) {
+        counts.hits += 1;
+        return found;
+    }
+    else {
+        counts.misses += 1;
+    }
+    const tags = await extractTags(text, language);
+    cache.write(key, tags);
+    return tags;
+}
+/**
+ * Walk the tree under `root`, depth-first in sorted order, returning `/`-separated
+ * relative paths of every regular file that survives the ignore list.
+ *
+ * Symlinks are skipped outright — file or directory, in-root or out. Never following
+ * one is the simplest true implementation of "never follow a symlink out of the
+ * root": there is no resolution step to get wrong.
+ */
+function scanFiles(root, ignore) {
+    const found = [];
+    const walk = (dir, relDir) => {
+        for (const entry of readdirSync(dir).toSorted()) {
+            const rel = relDir === '' ? entry : `${relDir}/${entry}`;
+            if (isIgnored(rel, ignore))
+                continue;
+            const full = join(dir, entry);
+            const stat = lstatSync(full);
+            if (stat.isSymbolicLink())
+                continue;
+            if (stat.isDirectory())
+                walk(full, rel);
+            else if (stat.isFile())
+                found.push(rel);
+        }
+    };
+    walk(root, '');
+    return found;
+}
+/** See {@link RepoMapOptions.ignore} for the two match modes. */
+function isIgnored(rel, ignore) {
+    for (const entry of ignore) {
+        const cleaned = entry.replace(/\/+$/, '');
+        if (cleaned === '')
+            continue;
+        // Prefix mode is decided on the entry AS WRITTEN, before the trailing slash is
+        // trimmed: `build/` contains a `/` and so is the documented root-relative prefix
+        // (the root-level `build` tree), not a bare name that would match a `build`
+        // segment at any depth.
+        if (entry.includes('/')) {
+            if (rel === cleaned || rel.startsWith(`${cleaned}/`))
+                return true;
+        }
+        else if (rel.split('/').includes(cleaned)) {
+            return true;
+        }
+    }
+    return false;
+}
+/**
+ * The fill order: focus-matched definitions first, then the rest, each partition
+ * keeping the ranker's total order. A stable partition of a deterministic order is
+ * itself deterministic, so the map's byte-for-byte claim survives focus untouched.
+ * The match is a case-insensitive substring over name and path — the lexical
+ * planner's default, so "focus" means the same thing in both places — and the
+ * *first* matching term in caller order is the one the receipt names.
+ */
+function orderWithFocus(ranked, focus) {
+    if (focus.length === 0)
+        return ranked.map((definition) => ({ definition }));
+    const needles = focus.map((term) => term.toLowerCase());
+    const matched = [];
+    const rest = [];
+    for (const definition of ranked) {
+        const haystack = `${definition.path}\0${definition.name}`.toLowerCase();
+        const index = needles.findIndex((needle) => haystack.includes(needle));
+        if (index === -1)
+            rest.push({ definition });
+        else
+            matched.push({ definition, focusTerm: focus[index] });
+    }
+    return [...matched, ...rest];
+}
+/** One rendered map line. Everything in it is measured, nothing estimated. */
+function renderDefinition(definition) {
+    return (`${definition.path}:${String(definition.line)} ${definition.kind} ${definition.name} ` +
+        `[${String(definition.refsIn)} in from ${String(definition.refsInFiles)} ` +
+        `${plural('file', definition.refsInFiles)}, ${String(definition.refsOut)} out]`);
+}
+/** Law 2, applied to inclusion: the receipt every included symbol carries. */
+function toEntry(definition, focusTerm) {
+    const site = `defined at ${definition.path}:${String(definition.line)}`;
+    const counts = `${String(definition.refsIn)} ${plural('reference', definition.refsIn)} in ` +
+        `from ${String(definition.refsInFiles)} ${plural('file', definition.refsInFiles)}; ` +
+        `its file makes ${String(definition.refsOut)} ` +
+        `${plural('reference', definition.refsOut)} out`;
+    const reason = focusTerm !== undefined
+        ? {
+            rule: REPO_MAP_FOCUS_RULE,
+            explanation: `${site}; matches focus "${focusTerm}"; ${counts}`,
+        }
+        : definition.refsIn === 0
+            ? {
+                rule: REPO_MAP_UNREFERENCED_RULE,
+                explanation: `${site}; no references to it anywhere in the scanned tree`,
+            }
+            : {
+                rule: REPO_MAP_RANKED_RULE,
+                explanation: `${site}; ${counts}`,
+            };
+    return {
+        path: definition.path,
+        name: definition.name,
+        kind: definition.kind,
+        line: definition.line,
+        rank: definition.rank,
+        refsIn: definition.refsIn,
+        refsInFiles: definition.refsInFiles,
+        refsOut: definition.refsOut,
+        reason,
+    };
+}
+function plural(word, count) {
+    return count === 1 ? word : `${word}s`;
+}
+//# sourceMappingURL=map.js.map

package/dist/repomap/map.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"map.js","sourceRoot":"","sources":["../../src/repomap/map.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,WAAW,EAAE,YAAY,EAAE,MAAM,SAAS,CAAC;AAC/D,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAC;AAEjC,OAAO,EAAE,cAAc,EAAE,MAAM,cAAc,CAAC;AAC9C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAG1C,OAAO,EAAE,SAAS,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AACrD,OAAO,EAAE,eAAe,EAAE,MAAM,WAAW,CAAC;AAE5C,OAAO,EAAE,WAAW,EAAE,MAAM,WAAW,CAAC;AAGxC;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AAEH,qDAAqD;AACrD,MAAM,CAAC,MAAM,WAAW,GAAG,YAAY,CAAC;AAExC;;;;GAIG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,mBAAmB,CAAC;AAExD,uEAAuE;AACvE,MAAM,CAAC,MAAM,0BAA0B,GAAG,yBAAyB,CAAC;AAEpE;;;;GAIG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG,aAAa,CAAC;AAEjD,uFAAuF;AACvF,MAAM,CAAC,MAAM,uBAAuB,GAAG,WAAW,CAAC;AAEnD,mFAAmF;AACnF,MAAM,CAAC,MAAM,2BAA2B,GAAG,qBAAqB,CAAC;AAEjE;;;;GAIG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAsB,CAAC,MAAM,EAAE,cAAc,CAAC,CAAC;AAoG/E;;;;;;;;;;GAUG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAAC,OAAuB;IACxD,MAAM,EAAE,IAAI,EAAE,WAAW,EAAE,GAAG,OAAO,CAAC;IACtC,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,WAAW,GAAG,CAAC,EAAE,CAAC;QACtD,MAAM,IAAI,UAAU,CAClB,sDAAsD,MAAM,CAAC,WAAW,CAAC,IAAI;YAC3E,6EAA6E;YAC7E,oCAAoC,CACvC,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,mBAAmB,CAAC;IACrD,MAAM,KAAK,GAAG,OAAO,CAAC,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC3F,MAAM,WAAW,GAAG,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,CAAC;IACzD,MAAM,QAAQ,GAAqB,EAAE,CAAC;IAEtC,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACtC,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,MAAM,aAAa,GAAa,EAAE,CAAC;IAEnC,KAAK,MAAM,GAAG,IAAI,KAAK,EAAE,CAAC;QACxB,MAAM,KAAK,GAAG,YAAY,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAC1D,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,aAAa,IAAI,CAAC,CAAC;YACnB,SAAS;QACX,CAAC;QACD,MAAM,QAAQ,GAAG,cAAc,CAAC,GAAG,CAAC,CAAC;QACrC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YACxB,SAAS;QACX,CAAC;QACD,MAAM,IAAI,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,MAAM,OAAO,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;QAC9E,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;YAAE,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACpD,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;IACrF,CAAC;IAED,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,CAAC,CAAC;IACvC,MAAM,KAAK,GAAG,CAAC,OAAO,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtE,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAE9C,iFAAiF;IACjF,8EAA8E;IAC9E,6EAA6E;IAC7E,+EAA+E;IAC/E,sCAAsC;IACtC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,SAAS,GAAG,CAAC,IAAY,EAAW,EAAE;QAC1C,MAAM,SAAS,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,uBAAuB;QAC9E,IAAI,KAAK,GAAG,SAAS,GAAG,WAAW;YAAE,OAAO,KAAK,CAAC;QAClD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,KAAK,IAAI,SAAS,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,KAAK,MAAM,EAAE,UAAU,EAAE,SAAS,EAAE,IAAI,OAAO,EAAE,CAAC;QAChD,IAAI,CAAC,SAAS,CAAC,gBAAgB,CAAC,UAAU,CAAC,CAAC;YAAE,MAAM;QACpD,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC;IAC/C,CAAC;IACD,MAAM,QAAQ,GAAuB,EAAE,CAAC;IACxC,IAAI,OAAO,CAAC,MAAM,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;QACtC,KAAK,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;YAChC,IAAI,CAAC,SAAS,CAAC,GAAG,GAAG,cAAc,CAAC;gBAAE,MAAM;YAC5C,QAAQ,CAAC,IAAI,CAAC;gBACZ,IAAI,EAAE,GAAG;gBACT,MAAM,EAAE;oBACN,IAAI,EAAE,uBAAuB;oBAC7B,WAAW,EAAE,iCAAiC,GAAG,4CAA4C;iBAC9F;aACF,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;IAC/D,OAAO;QACL,EAAE,EAAE,WAAW;QACf,IAAI;QACJ,WAAW,EAAE,MAAM,CAAC,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC;QAC5C,WAAW;QACX,OAAO;QACP,QAAQ;QACR,gBAAgB,EAAE,MAAM,CAAC,MAAM;QAC/B,aAAa,EAAE,aAAa,CAAC,MAAM;QACnC,YAAY,EAAE,KAAK,CAAC,MAAM;QAC1B,aAAa;QACb,QAAQ;QACR,GAAG,CAAC,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,GAAG,WAAW,EAAE,EAAE,CAAC;KAC9D,CAAC;AACJ,CAAC;AAED,iFAAiF;AACjF,KAAK,UAAU,OAAO,CACpB,IAAY,EACZ,QAAoB,EACpB,KAA4B,EAC5B,MAA2D,EAC3D,QAA0B,EAC1B,GAAW;IAEX,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAE5D,MAAM,GAAG,GAAG,YAAY,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IACzC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC9B,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QACxB,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC;QACtB,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,2BAA2B;YACjC,WAAW,EACT,uCAAuC,GAAG,kCAAkC;gBAC5E,+DAA+D;SAClE,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;QAC/B,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC;QACjB,OAAO,KAAK,CAAC;IACf,CAAC;SAAM,CAAC;QACN,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;IACrB,CAAC;IACD,MAAM,IAAI,GAAG,MAAM,WAAW,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC/C,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;IACvB,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,SAAS,CAAC,IAAY,EAAE,MAAyB;IACxD,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,CAAC,GAAW,EAAE,MAAc,EAAQ,EAAE;QACjD,KAAK,MAAM,KAAK,IAAI,WAAW,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC;YAChD,MAAM,GAAG,GAAG,MAAM,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,IAAI,KAAK,EAAE,CAAC;YACzD,IAAI,SAAS,CAAC,GAAG,EAAE,MAAM,CAAC;gBAAE,SAAS;YACrC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC9B,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;YAC7B,IAAI,IAAI,CAAC,cAAc,EAAE;gBAAE,SAAS;YACpC,IAAI,IAAI,CAAC,WAAW,EAAE;gBAAE,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;iBACnC,IAAI,IAAI,CAAC,MAAM,EAAE;gBAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC1C,CAAC;IACH,CAAC,CAAC;IACF,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;IACf,OAAO,KAAK,CAAC;AACf,CAAC;AAED,iEAAiE;AACjE,SAAS,SAAS,CAAC,GAAW,EAAE,MAAyB;IACvD,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QAC1C,IAAI,OAAO,KAAK,EAAE;YAAE,SAAS;QAC7B,+EAA+E;QAC/E,iFAAiF;QACjF,4EAA4E;QAC5E,wBAAwB;QACxB,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YACxB,IAAI,GAAG,KAAK,OAAO,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,OAAO,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAC;QACpE,CAAC;aAAM,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAQD;;;;;;;GAOG;AACH,SAAS,cAAc,CACrB,MAAmC,EACnC,KAAwB;IAExB,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC,CAAC;IAC5E,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;IACxD,MAAM,OAAO,GAAwB,EAAE,CAAC;IACxC,MAAM,IAAI,GAAwB,EAAE,CAAC;IACrC,KAAK,MAAM,UAAU,IAAI,MAAM,EAAE,CAAC;QAChC,MAAM,QAAQ,GAAG,GAAG,UAAU,CAAC,IAAI,KAAK,UAAU,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QACxE,MAAM,KAAK,GAAG,OAAO,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;QACvE,IAAI,KAAK,KAAK,CAAC,CAAC;YAAE,IAAI,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,CAAC,CAAC;;YACvC,OAAO,CAAC,IAAI,CAAC,EAAE,UAAU,EAAE,SAAS,EAAE,KAAK,CAAC,KAAK,CAAE,EAAE,CAAC,CAAC;IAC9D,CAAC;IACD,OAAO,CAAC,GAAG,OAAO,EAAE,GAAG,IAAI,CAAC,CAAC;AAC/B,CAAC;AAED,8EAA8E;AAC9E,SAAS,gBAAgB,CAAC,UAA4B;IACpD,OAAO,CACL,GAAG,UAAU,CAAC,IAAI,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,UAAU,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,GAAG;QACtF,IAAI,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,YAAY,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,GAAG;QAC1E,GAAG,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,WAAW,CAAC,KAAK,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,OAAO,CAChF,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,SAAS,OAAO,CAAC,UAA4B,EAAE,SAAkB;IAC/D,MAAM,IAAI,GAAG,cAAc,UAAU,CAAC,IAAI,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;IACxE,MAAM,MAAM,GACV,GAAG,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,WAAW,EAAE,UAAU,CAAC,MAAM,CAAC,MAAM;QAC5E,QAAQ,MAAM,CAAC,UAAU,CAAC,WAAW,CAAC,IAAI,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,WAAW,CAAC,IAAI;QACpF,kBAAkB,MAAM,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG;QAC/C,GAAG,MAAM,CAAC,WAAW,EAAE,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC;IACnD,MAAM,MAAM,GACV,SAAS,KAAK,SAAS;QACrB,CAAC,CAAC;YACE,IAAI,EAAE,mBAAmB;YACzB,WAAW,EAAE,GAAG,IAAI,oBAAoB,SAAS,MAAM,MAAM,EAAE;SAChE;QACH,CAAC,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC;YACvB,CAAC,CAAC;gBACE,IAAI,EAAE,0BAA0B;gBAChC,WAAW,EAAE,GAAG,IAAI,oDAAoD;aACzE;YACH,CAAC,CAAC;gBACE,IAAI,EAAE,oBAAoB;gBAC1B,WAAW,EAAE,GAAG,IAAI,KAAK,MAAM,EAAE;aAClC,CAAC;IACV,OAAO;QACL,IAAI,EAAE,UAAU,CAAC,IAAI;QACrB,IAAI,EAAE,UAAU,CAAC,IAAI;QACrB,IAAI,EAAE,UAAU,CAAC,IAAI;QACrB,IAAI,EAAE,UAAU,CAAC,IAAI;QACrB,IAAI,EAAE,UAAU,CAAC,IAAI;QACrB,MAAM,EAAE,UAAU,CAAC,MAAM;QACzB,WAAW,EAAE,UAAU,CAAC,WAAW;QACnC,OAAO,EAAE,UAAU,CAAC,OAAO;QAC3B,MAAM;KACP,CAAC;AACJ,CAAC;AAED,SAAS,MAAM,CAAC,IAAY,EAAE,KAAa;IACzC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC;AACzC,CAAC"}