@nanonets/graft 0.22.0 → 0.23.0

package/dist/app/history.d.ts

@@ -1,163 +0,0 @@
-import type { GraphV1 } from "../graph/types.js";
-import { type Fetch } from "./identity.js";
-import type { HistorySource } from "./sources.js";
-/** One commit's rule-bearing content. */
-export interface HistoryCommit {
-    sha: string;
-    subject: string;
-    body: string;
-    files: string[];
-}
-/** One pull request's discussion. */
-export interface HistoryThread {
-    number: number;
-    title: string;
-    body: string;
-    mergeSha: string;
-    comments: Array<{
-        body: string;
-        path?: string;
-    }>;
-}
-/** One symbol, as the brain needs it to anchor a rule. */
-export interface HistorySymbol {
-    id: string;
-    path: string;
-    name: string;
-    kind: string;
-    signature: string;
-    fingerprint: string;
-}
-/** The whole payload posted to the brain. */
-export interface RepoDigest {
-    provider: "github";
-    owner: string;
-    name: string;
-    head_sha: string;
-    default_branch: string;
-    is_private: boolean;
-    commits: Array<{
-        sha: string;
-        subject: string;
-        body: string;
-        files: string[];
-        symbols: string[];
-    }>;
-    threads: Array<{
-        number: number;
-        title: string;
-        body: string;
-        merge_sha: string;
-        comments: Array<{
-            body: string;
-            path?: string;
-        }>;
-    }>;
-    symbols: HistorySymbol[];
-    /** Everything in the repo that is already a rule, or nearly one: instruction
-     * files, decision records, config, ownership, reverts, test names. One array
-     * rather than a field per kind, so adding a source is adding an entry. */
-    sources: HistorySource[];
-    auto_approve: boolean;
-    /** The agents `graft init` wired this repo for (claude, cursor, agents, …).
-     * Trail shows only the context files those agents read. Absent or empty
-     * means "not known", and Trail then shows every kind. */
-    agents?: string[];
-}
-/**
- * Commit subjects, bodies and touched files, oldest first.
- *
- * `--no-merges`: a merge commit's message is "Merge pull request #N from …",
- * which establishes nothing — the decision is in the commits it brings in, and
- * in the thread. `--reverse` so a later reversal reads as a reversal downstream;
- * the extraction prompt relies on that ordering.
- */
-export declare function readCommits(root: string, max?: number): HistoryCommit[];
-/** How many threads' comments are fetched at once. Two requests per pull
- * request, so this is the real cost of a repository read. A pool of 24 (so at
- * most 48 requests in flight) stays well under GitHub's secondary limit on
- * concurrent requests, and a slow thread no longer holds up the seven that
- * happened to share its batch. */
-export declare const THREAD_FETCH_CONCURRENCY = 24;
-/**
- * What one push has already asked GitHub, shared between its reads.
- *
- * The early upload reads the newest pull requests and the full read reads them
- * again as part of the 200. Promises rather than results, so a full read that
- * starts while the early one is still in flight waits on the same request
- * instead of sending a second — and threads with no discussion are remembered
- * too, which a map of finished threads could not say.
- */
-export interface ThreadReadCache {
-    /** Pages of the closed-pull-request list, by page number. */
-    pages: Map<number, Promise<PullListItem[] | null>>;
-    /** One pull request's discussion, by number; null when it had none. */
-    threads: Map<number, Promise<HistoryThread | null>>;
-}
-export declare function newThreadReadCache(): ThreadReadCache;
-/** Run `fn` over `items` with at most `limit` in flight, results in input order. */
-export declare function mapPool<T, R>(items: readonly T[], limit: number, fn: (item: T, index: number) => Promise<R>): Promise<R[]>;
-export interface PullListItem {
-    number?: number;
-    title?: string;
-    body?: string | null;
-    merge_commit_sha?: string | null;
-}
-/**
- * Closed pull requests and their discussion, most-discussed first.
- *
- * Closed only: an open PR's discussion has not concluded, so mining a rule out
- * of it would record a proposal as a decision.
- *
- * Comment counts have to be discovered by fetching, not by reading the list.
- * GitHub's `GET /pulls` list response carries NO `comments` or
- * `review_comments` field — those exist only on the single-PR GET — so an
- * earlier version that pre-filtered on them read `undefined` for every pull
- * request, scored them all zero and skipped the lot. The failure was silent and
- * total: every repository came back with no discussion at all. So the comments
- * are fetched for the most recently updated closed pull requests, and the
- * ranking happens afterwards, on counts that are real.
- *
- * Bot comments are dropped. A CI bot posting a coverage table is the single
- * largest source of text in a busy repo's threads and it establishes nothing.
- */
-export declare function readThreads(owner: string, repo: string, token: string, fetchImpl: Fetch, api?: string, max?: number, known?: ReadonlyMap<number, HistoryThread>, cache?: ThreadReadCache): Promise<HistoryThread[]>;
-/**
- * Exported symbols from the graph, with the body hash that makes an anchored
- * rule self-invalidating.
- *
- * Exported only, and biggest first: an internal helper is not what a team's
- * rules are about, and the budget is better spent on the surface a rule is
- * likely to govern.
- */
-export declare function readSymbols(graph: GraphV1 | null, max?: number): HistorySymbol[];
-/**
- * Assemble the digest.
- *
- * Each commit carries the symbol ids its files touched, so a rule mined from a
- * commit message can be anchored even when the message names no symbol — which
- * is most of the time.
- */
-export declare function buildDigest(input: {
-    owner: string;
-    name: string;
-    headSha: string;
-    defaultBranch: string;
-    isPrivate: boolean;
-    commits: HistoryCommit[];
-    threads: HistoryThread[];
-    symbols: HistorySymbol[];
-    sources: HistorySource[];
-    autoApprove: boolean;
-    agents?: string[];
-}): RepoDigest;
-/**
- * Post the digest to a brain.
- *
- * Returns the job id so the caller can hand it back to whoever asked for the
- * build, which is what the onboarding screen polls.
- */
-export declare function postDigest(baseUrl: string, brainId: string, brainToken: string, digest: RepoDigest, fetchImpl: Fetch): Promise<{
-    jobId: string;
-}>;
-//# sourceMappingURL=history.d.ts.map

package/dist/app/history.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"history.d.ts","sourceRoot":"","sources":["../../src/app/history.ts"],"names":[],"mappings":"AAaA,OAAO,KAAK,EAAE,OAAO,EAAE,MAAM,mBAAmB,CAAC;AACjD,OAAO,EAAa,KAAK,KAAK,EAAE,MAAM,eAAe,CAAC;AACtD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,cAAc,CAAC;AAElD,yCAAyC;AACzC,MAAM,WAAW,aAAa;IAC5B,GAAG,EAAE,MAAM,CAAC;IACZ,OAAO,EAAE,MAAM,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,EAAE,CAAC;CACjB;AAED,qCAAqC;AACrC,MAAM,WAAW,aAAa;IAC5B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,KAAK,CAAC;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,CAAC,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAClD;AAED,0DAA0D;AAC1D,MAAM,WAAW,aAAa;IAC5B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,6CAA6C;AAC7C,MAAM,WAAW,UAAU;IACzB,QAAQ,EAAE,QAAQ,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,MAAM,CAAC;IACjB,cAAc,EAAE,MAAM,CAAC;IACvB,UAAU,EAAE,OAAO,CAAC;IACpB,OAAO,EAAE,KAAK,CAAC;QAAE,GAAG,EAAE,MAAM,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,EAAE,CAAC;QAAC,OAAO,EAAE,MAAM,EAAE,CAAA;KAAE,CAAC,CAAC;IACnG,OAAO,EAAE,KAAK,CAAC;QACb,MAAM,EAAE,MAAM,CAAC;QACf,KAAK,EAAE,MAAM,CAAC;QACd,IAAI,EAAE,MAAM,CAAC;QACb,SAAS,EAAE,MAAM,CAAC;QAClB,QAAQ,EAAE,KAAK,CAAC;YAAE,IAAI,EAAE,MAAM,CAAC;YAAC,IAAI,CAAC,EAAE,MAAM,CAAA;SAAE,CAAC,CAAC;KAClD,CAAC,CAAC;IACH,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB;;8EAE0E;IAC1E,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB,YAAY,EAAE,OAAO,CAAC;IACtB;;6DAEyD;IACzD,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;CACnB;AAuBD;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,SAAc,GAAG,aAAa,EAAE,CA0B5E;AAKD;;;;kCAIkC;AAClC,eAAO,MAAM,wBAAwB,KAAK,CAAC;AAE3C;;;;;;;;GAQG;AACH,MAAM,WAAW,eAAe;IAC9B,6DAA6D;IAC7D,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,YAAY,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;IACnD,uEAAuE;IACvE,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,aAAa,GAAG,IAAI,CAAC,CAAC,CAAC;CACrD;AAED,wBAAgB,kBAAkB,IAAI,eAAe,CAEpD;AAED,oFAAoF;AACpF,wBAAsB,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,SAAS,CAAC,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,EAAE,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,KAAK,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,CAAC,CAYhI;AAED,MAAM,WAAW,YAAY;IAC3B,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACrB,gBAAgB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;CAClC;AAQD;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAsB,WAAW,CAC/B,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,KAAK,EAChB,GAAG,SAA2B,EAC9B,GAAG,SAAc,EAGjB,KAAK,GAAE,WAAW,CAAC,MAAM,EAAE,aAAa,CAAa,EAGrD,KAAK,GAAE,eAAsC,GAC5C,OAAO,CAAC,aAAa,EAAE,CAAC,CA4E1B;AAiCD;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,GAAG,IAAI,EAAE,GAAG,SAAc,GAAG,aAAa,EAAE,CAcrF;AAED;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE;IACjC,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,CAAC;IAChB,aAAa,EAAE,MAAM,CAAC;IACtB,SAAS,EAAE,OAAO,CAAC;IACnB,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB,OAAO,EAAE,aAAa,EAAE,CAAC;IACzB,WAAW,EAAE,OAAO,CAAC;IACrB,MAAM,CAAC,EAAE,MAAM,EAAE,CAAC;CACnB,GAAG,UAAU,CAoCb;AAED;;;;;GAKG;AACH,wBAAsB,UAAU,CAC9B,OAAO,EAAE,MAAM,EACf,OAAO,EAAE,MAAM,EACf,UAAU,EAAE,MAAM,EAClB,MAAM,EAAE,UAAU,EAClB,SAAS,EAAE,KAAK,GACf,OAAO,CAAC;IAAE,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,CAgB5B"}

package/dist/app/history.js

@@ -1,319 +0,0 @@
-/**
- * Reading a repository's history into a rule-bearing digest.
- *
- * What a code graph cannot tell you is why the code is the way it is. That
- * lives in two places: commit messages, and the discussion under pull requests.
- * This module reads both, plus the symbol ids from the graph so a rule mined
- * out of them can be anchored to the code it governs.
- *
- * It deliberately sends NO source code onward. The digest is messages, titles,
- * comments, symbol ids and hashes — nothing a reader could reconstruct a private
- * codebase from.
- */
-import { spawnSync } from "node:child_process";
-import { ghHeaders } from "./identity.js";
-/** Field separators inside one `git log` record. Chosen for being bytes no
- * commit message contains, the same trick blast/owners.ts uses. */
-const REC = "\x01";
-const FIELD = "\x02";
-/** Most commits read out of one repository. Above the brain's own per-ingest
- * cap, so the trim happens here where the ordering is known. */
-const MAX_COMMITS = 1_000;
-/** Run git in `root`, or null when git fails. */
-function git(root, args) {
-    const res = spawnSync("git", ["-c", "core.quotePath=false", ...args], {
-        cwd: root,
-        encoding: "utf8",
-        stdio: ["ignore", "pipe", "pipe"],
-        maxBuffer: 64 * 1024 * 1024,
-    });
-    if (res.error || res.status !== 0 || typeof res.stdout !== "string")
-        return null;
-    return res.stdout;
-}
-/**
- * Commit subjects, bodies and touched files, oldest first.
- *
- * `--no-merges`: a merge commit's message is "Merge pull request #N from …",
- * which establishes nothing — the decision is in the commits it brings in, and
- * in the thread. `--reverse` so a later reversal reads as a reversal downstream;
- * the extraction prompt relies on that ordering.
- */
-export function readCommits(root, max = MAX_COMMITS) {
-    const fmt = `${REC}%H${FIELD}%s${FIELD}%b${FIELD}`;
-    const out = git(root, [
-        "log",
-        "--no-merges",
-        "--reverse",
-        `-n`,
-        String(max),
-        `--format=${fmt}`,
-        "--name-only",
-    ]);
-    if (!out)
-        return [];
-    const commits = [];
-    for (const record of out.split(REC)) {
-        if (!record.trim())
-            continue;
-        const [sha = "", subject = "", body = "", rest = ""] = record.split(FIELD);
-        const files = rest
-            .split("\n")
-            .map((l) => l.trim())
-            .filter((l) => l !== "");
-        // A commit with no subject is a broken record, not a commit worth mining.
-        if (!sha.trim() || !subject.trim())
-            continue;
-        commits.push({ sha: sha.trim(), subject: subject.trim(), body: body.trim(), files });
-    }
-    return commits;
-}
-/** How many pull requests to read, and how many comment pages per thread. */
-const MAX_THREADS = 200;
-const MAX_COMMENT_PAGES = 3;
-/** How many threads' comments are fetched at once. Two requests per pull
- * request, so this is the real cost of a repository read. A pool of 24 (so at
- * most 48 requests in flight) stays well under GitHub's secondary limit on
- * concurrent requests, and a slow thread no longer holds up the seven that
- * happened to share its batch. */
-export const THREAD_FETCH_CONCURRENCY = 24;
-export function newThreadReadCache() {
-    return { pages: new Map(), threads: new Map() };
-}
-/** Run `fn` over `items` with at most `limit` in flight, results in input order. */
-export async function mapPool(items, limit, fn) {
-    const out = new Array(items.length);
-    let next = 0;
-    const worker = async () => {
-        for (;;) {
-            const i = next++;
-            if (i >= items.length)
-                return;
-            out[i] = await fn(items[i], i);
-        }
-    };
-    await Promise.all(Array.from({ length: Math.min(Math.max(1, limit), items.length) }, worker));
-    return out;
-}
-/**
- * Closed pull requests and their discussion, most-discussed first.
- *
- * Closed only: an open PR's discussion has not concluded, so mining a rule out
- * of it would record a proposal as a decision.
- *
- * Comment counts have to be discovered by fetching, not by reading the list.
- * GitHub's `GET /pulls` list response carries NO `comments` or
- * `review_comments` field — those exist only on the single-PR GET — so an
- * earlier version that pre-filtered on them read `undefined` for every pull
- * request, scored them all zero and skipped the lot. The failure was silent and
- * total: every repository came back with no discussion at all. So the comments
- * are fetched for the most recently updated closed pull requests, and the
- * ranking happens afterwards, on counts that are real.
- *
- * Bot comments are dropped. A CI bot posting a coverage table is the single
- * largest source of text in a busy repo's threads and it establishes nothing.
- */
-export async function readThreads(owner, repo, token, fetchImpl, api = "https://api.github.com", max = MAX_THREADS, 
-// Threads already read (the early upload's newest ones), reused rather than
-// fetched a second time.
-known = new Map(), 
-// Everything this push has already asked GitHub, in flight or finished. See
-// ThreadReadCache; a fresh one when the caller has nothing to share.
-cache = newThreadReadCache()) {
-    const headers = ghHeaders(token);
-    const readPage = (page) => {
-        const cached = cache.pages.get(page);
-        if (cached)
-            return cached;
-        const pending = (async () => {
-            const res = await fetchImpl(`${api}/repos/${owner}/${repo}/pulls?state=closed&sort=updated&direction=desc&per_page=100&page=${page}`, { headers });
-            if (!res.ok)
-                return null;
-            const batch = JSON.parse(await res.text());
-            return Array.isArray(batch) ? batch : null;
-        })();
-        // A failed page is forgotten, so the next read asks again rather than
-        // inheriting one blip for the rest of the push.
-        pending.catch(() => cache.pages.delete(page));
-        cache.pages.set(page, pending);
-        return pending;
-    };
-    const pulls = [];
-    // 100 per page, up to the cap. Sorted by GitHub as most-recently-updated,
-    // which is the right window: rules decided two years ago that still hold get
-    // restated in newer threads, and ones that do not are usually superseded.
-    for (let page = 1; pulls.length < max && page <= Math.ceil(max / 100); page++) {
-        const batch = await readPage(page);
-        if (!batch || batch.length === 0)
-            break;
-        pulls.push(...batch);
-    }
-    // Deduplicated: a pull request updated between two page reads moves up the
-    // list and would otherwise be read, and sent, twice.
-    const seenNumbers = new Set();
-    const candidates = pulls
-        .filter((p) => typeof p.number === "number")
-        .filter((p) => !seenNumbers.has(p.number) && (seenNumbers.add(p.number), true))
-        .slice(0, max);
-    const readThread = (p) => {
-        const seen = known.get(p.number);
-        if (seen)
-            return Promise.resolve(seen);
-        const cached = cache.threads.get(p.number);
-        if (cached)
-            return cached;
-        const pending = (async () => {
-            const [issueComments, reviewComments] = await Promise.all([
-                readComments(`${api}/repos/${owner}/${repo}/issues/${p.number}/comments`, headers, fetchImpl),
-                readComments(`${api}/repos/${owner}/${repo}/pulls/${p.number}/comments`, headers, fetchImpl),
-            ]);
-            const comments = [...issueComments, ...reviewComments];
-            if (comments.length === 0)
-                return null;
-            return {
-                number: p.number,
-                title: (p.title ?? "").trim(),
-                body: (p.body ?? "").trim(),
-                mergeSha: (p.merge_commit_sha ?? "").trim(),
-                comments,
-            };
-        })();
-        pending.catch(() => cache.threads.delete(p.number));
-        cache.threads.set(p.number, pending);
-        return pending;
-    };
-    // A pool rather than one at a time: two requests per pull request over 200
-    // of them is 400 sequential round trips, which is minutes of a person
-    // waiting on a progress screen.
-    const fetched = await mapPool(candidates, THREAD_FETCH_CONCURRENCY, readThread);
-    const threads = fetched.filter((t) => t !== null);
-    // Most-discussed first, because the digest renderer spends its budget in this
-    // order and a twenty-comment thread contains an argument while a one-comment
-    // thread contains a rubber stamp.
-    threads.sort((a, b) => b.comments.length - a.comments.length);
-    return threads;
-}
-/** One comment endpoint, paginated, bots removed. */
-async function readComments(url, headers, fetchImpl) {
-    const out = [];
-    for (let page = 1; page <= MAX_COMMENT_PAGES; page++) {
-        const res = await fetchImpl(`${url}?per_page=100&page=${page}`, { headers });
-        if (!res.ok)
-            break;
-        let batch;
-        try {
-            batch = JSON.parse(await res.text());
-        }
-        catch {
-            break;
-        }
-        if (!Array.isArray(batch) || batch.length === 0)
-            break;
-        for (const c of batch) {
-            const body = (c.body ?? "").trim();
-            if (!body)
-                continue;
-            if (c.user?.type === "Bot")
-                continue;
-            out.push(c.path ? { body, path: c.path } : { body });
-        }
-        if (batch.length < 100)
-            break;
-    }
-    return out;
-}
-/** Most symbols to send. The brain only needs enough to anchor rules against. */
-const MAX_SYMBOLS = 4_000;
-/**
- * Exported symbols from the graph, with the body hash that makes an anchored
- * rule self-invalidating.
- *
- * Exported only, and biggest first: an internal helper is not what a team's
- * rules are about, and the budget is better spent on the surface a rule is
- * likely to govern.
- */
-export function readSymbols(graph, max = MAX_SYMBOLS) {
-    if (!graph)
-        return [];
-    return graph.nodes
-        .filter((n) => n.exported && n.kind !== "file")
-        .sort((a, b) => (b.chars ?? 0) - (a.chars ?? 0))
-        .slice(0, max)
-        .map((n) => ({
-        id: n.id,
-        path: n.path,
-        name: n.name,
-        kind: n.kind,
-        signature: n.signature ?? "",
-        fingerprint: n.body_hash,
-    }));
-}
-/**
- * Assemble the digest.
- *
- * Each commit carries the symbol ids its files touched, so a rule mined from a
- * commit message can be anchored even when the message names no symbol — which
- * is most of the time.
- */
-export function buildDigest(input) {
-    const byPath = new Map();
-    for (const s of input.symbols) {
-        const bucket = byPath.get(s.path);
-        if (bucket)
-            bucket.push(s.id);
-        else
-            byPath.set(s.path, [s.id]);
-    }
-    return {
-        provider: "github",
-        owner: input.owner,
-        name: input.name,
-        head_sha: input.headSha,
-        default_branch: input.defaultBranch,
-        is_private: input.isPrivate,
-        commits: input.commits.map((c) => ({
-            sha: c.sha,
-            subject: c.subject,
-            body: c.body,
-            files: c.files,
-            // Capped per commit: a sweeping refactor touches hundreds of files, and
-            // listing every symbol in all of them would drown the message it belongs to.
-            symbols: c.files.flatMap((f) => byPath.get(f) ?? []).slice(0, 20),
-        })),
-        threads: input.threads.map((t) => ({
-            number: t.number,
-            title: t.title,
-            body: t.body,
-            merge_sha: t.mergeSha,
-            comments: t.comments,
-        })),
-        symbols: input.symbols,
-        sources: input.sources,
-        auto_approve: input.autoApprove,
-        ...(input.agents?.length ? { agents: input.agents } : {}),
-    };
-}
-/**
- * Post the digest to a brain.
- *
- * Returns the job id so the caller can hand it back to whoever asked for the
- * build, which is what the onboarding screen polls.
- */
-export async function postDigest(baseUrl, brainId, brainToken, digest, fetchImpl) {
-    const res = await fetchImpl(`${baseUrl.replace(/\/+$/, "")}/api/brains/${encodeURIComponent(brainId)}/repo`, {
-        method: "POST",
-        headers: {
-            authorization: `Bearer ${brainToken}`,
-            "content-type": "application/json",
-            accept: "application/json",
-        },
-        body: JSON.stringify(digest),
-    });
-    const text = await res.text();
-    if (!res.ok) {
-        throw new Error(`brain ingest failed: ${res.status} ${text.slice(0, 300)}`);
-    }
-    const parsed = JSON.parse(text);
-    return { jobId: String(parsed.job_id ?? "") };
-}
-//# sourceMappingURL=history.js.map

package/dist/app/history.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"history.js","sourceRoot":"","sources":["../../src/app/history.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AACH,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAE/C,OAAO,EAAE,SAAS,EAAc,MAAM,eAAe,CAAC;AA0DtD;mEACmE;AACnE,MAAM,GAAG,GAAG,MAAM,CAAC;AACnB,MAAM,KAAK,GAAG,MAAM,CAAC;AAErB;gEACgE;AAChE,MAAM,WAAW,GAAG,KAAK,CAAC;AAE1B,iDAAiD;AACjD,SAAS,GAAG,CAAC,IAAY,EAAE,IAAc;IACvC,MAAM,GAAG,GAAG,SAAS,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,sBAAsB,EAAE,GAAG,IAAI,CAAC,EAAE;QACpE,GAAG,EAAE,IAAI;QACT,QAAQ,EAAE,MAAM;QAChB,KAAK,EAAE,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC;QACjC,SAAS,EAAE,EAAE,GAAG,IAAI,GAAG,IAAI;KAC5B,CAAC,CAAC;IACH,IAAI,GAAG,CAAC,KAAK,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,GAAG,CAAC,MAAM,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IACjF,OAAO,GAAG,CAAC,MAAM,CAAC;AACpB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CAAC,IAAY,EAAE,GAAG,GAAG,WAAW;IACzD,MAAM,GAAG,GAAG,GAAG,GAAG,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,EAAE,CAAC;IACnD,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,EAAE;QACpB,KAAK;QACL,aAAa;QACb,WAAW;QACX,IAAI;QACJ,MAAM,CAAC,GAAG,CAAC;QACX,YAAY,GAAG,EAAE;QACjB,aAAa;KACd,CAAC,CAAC;IACH,IAAI,CAAC,GAAG;QAAE,OAAO,EAAE,CAAC;IAEpB,MAAM,OAAO,GAAoB,EAAE,CAAC;IACpC,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACpC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE;YAAE,SAAS;QAC7B,MAAM,CAAC,GAAG,GAAG,EAAE,EAAE,OAAO,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;QAC3E,MAAM,KAAK,GAAG,IAAI;aACf,KAAK,CAAC,IAAI,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;aACpB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QAC3B,0EAA0E;QAC1E,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE;YAAE,SAAS;QAC7C,OAAO,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;IACvF,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,6EAA6E;AAC7E,MAAM,WAAW,GAAG,GAAG,CAAC;AACxB,MAAM,iBAAiB,GAAG,CAAC,CAAC;AAC5B;;;;kCAIkC;AAClC,MAAM,CAAC,MAAM,wBAAwB,GAAG,EAAE,CAAC;AAkB3C,MAAM,UAAU,kBAAkB;IAChC,OAAO,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,OAAO,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC;AAClD,CAAC;AAED,oFAAoF;AACpF,MAAM,CAAC,KAAK,UAAU,OAAO,CAAO,KAAmB,EAAE,KAAa,EAAE,EAA0C;IAChH,MAAM,GAAG,GAAG,IAAI,KAAK,CAAI,KAAK,CAAC,MAAM,CAAC,CAAC;IACvC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,MAAM,MAAM,GAAG,KAAK,IAAI,EAAE;QACxB,SAAS,CAAC;YACR,MAAM,CAAC,GAAG,IAAI,EAAE,CAAC;YACjB,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM;gBAAE,OAAO;YAC9B,GAAG,CAAC,CAAC,CAAC,GAAG,MAAM,EAAE,CAAC,KAAK,CAAC,CAAC,CAAE,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC;IACH,CAAC,CAAC;IACF,MAAM,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC,CAAC;IAC9F,OAAO,GAAG,CAAC;AACb,CAAC;AAeD;;;;;;;;;;;;;;;;;GAiBG;AACH,MAAM,CAAC,KAAK,UAAU,WAAW,CAC/B,KAAa,EACb,IAAY,EACZ,KAAa,EACb,SAAgB,EAChB,GAAG,GAAG,wBAAwB,EAC9B,GAAG,GAAG,WAAW;AACjB,4EAA4E;AAC5E,yBAAyB;AACzB,QAA4C,IAAI,GAAG,EAAE;AACrD,4EAA4E;AAC5E,qEAAqE;AACrE,QAAyB,kBAAkB,EAAE;IAE7C,MAAM,OAAO,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC;IAEjC,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAkC,EAAE;QAChE,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACrC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAC1B,MAAM,OAAO,GAAG,CAAC,KAAK,IAAI,EAAE;YAC1B,MAAM,GAAG,GAAG,MAAM,SAAS,CACzB,GAAG,GAAG,UAAU,KAAK,IAAI,IAAI,qEAAqE,IAAI,EAAE,EACxG,EAAE,OAAO,EAAE,CACZ,CAAC;YACF,IAAI,CAAC,GAAG,CAAC,EAAE;gBAAE,OAAO,IAAI,CAAC;YACzB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAmB,CAAC;YAC7D,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;QAC7C,CAAC,CAAC,EAAE,CAAC;QACL,sEAAsE;QACtE,gDAAgD;QAChD,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;QAC9C,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QAC/B,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC;IAEF,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,0EAA0E;IAC1E,6EAA6E;IAC7E,0EAA0E;IAC1E,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,KAAK,CAAC,MAAM,GAAG,GAAG,IAAI,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QAC9E,MAAM,KAAK,GAAG,MAAM,QAAQ,CAAC,IAAI,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM;QACxC,KAAK,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;IACvB,CAAC;IAED,2EAA2E;IAC3E,qDAAqD;IACrD,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,UAAU,GAAG,KAAK;SACrB,MAAM,CAAC,CAAC,CAAC,EAA0C,EAAE,CAAC,OAAO,CAAC,CAAC,MAAM,KAAK,QAAQ,CAAC;SACnF,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,CAAC;SAC9E,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IAEjB,MAAM,UAAU,GAAG,CAAC,CAAoC,EAAiC,EAAE;QACzF,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QACjC,IAAI,IAAI;YAAE,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,MAAM;YAAE,OAAO,MAAM,CAAC;QAC1B,MAAM,OAAO,GAAG,CAAC,KAAK,IAAI,EAAE;YAC1B,MAAM,CAAC,aAAa,EAAE,cAAc,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;gBACxD,YAAY,CAAC,GAAG,GAAG,UAAU,KAAK,IAAI,IAAI,WAAW,CAAC,CAAC,MAAM,WAAW,EAAE,OAAO,EAAE,SAAS,CAAC;gBAC7F,YAAY,CAAC,GAAG,GAAG,UAAU,KAAK,IAAI,IAAI,UAAU,CAAC,CAAC,MAAM,WAAW,EAAE,OAAO,EAAE,SAAS,CAAC;aAC7F,CAAC,CAAC;YACH,MAAM,QAAQ,GAAG,CAAC,GAAG,aAAa,EAAE,GAAG,cAAc,CAAC,CAAC;YACvD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;gBAAE,OAAO,IAAI,CAAC;YACvC,OAAO;gBACL,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,KAAK,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE;gBAC7B,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE;gBAC3B,QAAQ,EAAE,CAAC,CAAC,CAAC,gBAAgB,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE;gBAC3C,QAAQ;aACe,CAAC;QAC5B,CAAC,CAAC,EAAE,CAAC;QACL,OAAO,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACpD,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;QACrC,OAAO,OAAO,CAAC;IACjB,CAAC,CAAC;IAEF,2EAA2E;IAC3E,sEAAsE;IACtE,gCAAgC;IAChC,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,UAAU,EAAE,wBAAwB,EAAE,UAAU,CAAC,CAAC;IAChF,MAAM,OAAO,GAAoB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAsB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IAEvF,8EAA8E;IAC9E,6EAA6E;IAC7E,kCAAkC;IAClC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC9D,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,qDAAqD;AACrD,KAAK,UAAU,YAAY,CACzB,GAAW,EACX,OAA+B,EAC/B,SAAgB;IAEhB,MAAM,GAAG,GAA2C,EAAE,CAAC;IACvD,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,IAAI,iBAAiB,EAAE,IAAI,EAAE,EAAE,CAAC;QACrD,MAAM,GAAG,GAAG,MAAM,SAAS,CAAC,GAAG,GAAG,sBAAsB,IAAI,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,CAAC;QAC7E,IAAI,CAAC,GAAG,CAAC,EAAE;YAAE,MAAM;QACnB,IAAI,KAAoB,CAAC;QACzB,IAAI,CAAC;YACH,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,EAAE,CAAkB,CAAC;QACxD,CAAC;QAAC,MAAM,CAAC;YACP,MAAM;QACR,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,MAAM;QACvD,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI;gBAAE,SAAS;YACpB,IAAI,CAAC,CAAC,IAAI,EAAE,IAAI,KAAK,KAAK;gBAAE,SAAS;YACrC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC;QACvD,CAAC;QACD,IAAI,KAAK,CAAC,MAAM,GAAG,GAAG;YAAE,MAAM;IAChC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,iFAAiF;AACjF,MAAM,WAAW,GAAG,KAAK,CAAC;AAE1B;;;;;;;GAOG;AACH,MAAM,UAAU,WAAW,CAAC,KAAqB,EAAE,GAAG,GAAG,WAAW;IAClE,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IACtB,OAAO,KAAK,CAAC,KAAK;SACf,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;SAC9C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;SAC/C,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;SACb,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACX,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,SAAS,EAAE,CAAC,CAAC,SAAS,IAAI,EAAE;QAC5B,WAAW,EAAE,CAAC,CAAC,SAAS;KACzB,CAAC,CAAC,CAAC;AACR,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,WAAW,CAAC,KAY3B;IACC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC;QAC9B,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,MAAM;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;;YACzB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClC,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,QAAQ;QAClB,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,IAAI,EAAE,KAAK,CAAC,IAAI;QAChB,QAAQ,EAAE,KAAK,CAAC,OAAO;QACvB,cAAc,EAAE,KAAK,CAAC,aAAa;QACnC,UAAU,EAAE,KAAK,CAAC,SAAS;QAC3B,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACjC,GAAG,EAAE,CAAC,CAAC,GAAG;YACV,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,wEAAwE;YACxE,6EAA6E;YAC7E,OAAO,EAAE,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;SAClE,CAAC,CAAC;QACH,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACjC,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,SAAS,EAAE,CAAC,CAAC,QAAQ;YACrB,QAAQ,EAAE,CAAC,CAAC,QAAQ;SACrB,CAAC,CAAC;QACH,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,OAAO,EAAE,KAAK,CAAC,OAAO;QACtB,YAAY,EAAE,KAAK,CAAC,WAAW;QAC/B,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC1D,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,OAAe,EACf,OAAe,EACf,UAAkB,EAClB,MAAkB,EAClB,SAAgB;IAEhB,MAAM,GAAG,GAAG,MAAM,SAAS,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,eAAe,kBAAkB,CAAC,OAAO,CAAC,OAAO,EAAE;QAC3G,MAAM,EAAE,MAAM;QACd,OAAO,EAAE;YACP,aAAa,EAAE,UAAU,UAAU,EAAE;YACrC,cAAc,EAAE,kBAAkB;YAClC,MAAM,EAAE,kBAAkB;SAC3B;QACD,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC;KAC7B,CAAC,CAAC;IACH,MAAM,IAAI,GAAG,MAAM,GAAG,CAAC,IAAI,EAAE,CAAC;IAC9B,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CAAC,wBAAwB,GAAG,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;IAC9E,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAwB,CAAC;IACvD,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,EAAE,CAAC;AAChD,CAAC"}

package/dist/app/sources.d.ts

@@ -1,81 +0,0 @@
-import { type Fetch } from "./identity.js";
-/** What kind of thing a source is, so extraction can weigh it. */
-export type SourceKind = "agent_instructions" | "decision_doc" | "lint_config" | "ci_config" | "codeowners" | "branch_protection" | "revert" | "test_name" | "declined_issue";
-/** One rule-bearing artefact. */
-export interface HistorySource {
-    kind: SourceKind;
-    /** Repo-relative path, or an API-ish label like "branch protection: main". */
-    path: string;
-    text: string;
-    /** Deep link, where one exists (an issue, a reverted commit). */
-    url?: string;
-}
-/**
- * Instruction files the team already wrote for coding agents.
- *
- * The single highest-precision source in a repository: someone sat down and
- * wrote imperative rules for a machine to follow. Nothing has to be inferred.
- *
- * Graft's own managed blocks are stripped first. Without that the brain reads
- * back graft's instructions about using graft, and then graft carries them into
- * the same file — a loop that fills the rulebook with itself.
- */
-export declare function readAgentInstructions(root: string): HistorySource[];
-/** Most folder instruction files, and most skills, carried per push. */
-export declare const MAX_FOLDER_FILES = 30;
-export declare const MAX_SKILL_FILES = 30;
-/**
- * `**\/CLAUDE.md` and `**\/AGENTS.md` below the root, shallowest first.
- *
- * Asked of git first, because git already knows what the repository ignores:
- * a CLAUDE.md inside an ignored folder is someone's scratch, not the team's.
- * The walk is the fallback for a checkout git cannot answer for.
- */
-export declare function folderInstructionFiles(root: string, max?: number): string[];
-/** `.claude/skills/<name>/SKILL.md`, graft's own skill excluded. */
-export declare function skillFiles(root: string, max?: number): string[];
-/** Architecture decision records and the docs that read like them. */
-export declare function readDecisionDocs(root: string): HistorySource[];
-/**
- * Rules the team already encoded for a machine: linters, formatters, and the
- * checks CI insists on. Nothing to infer — extraction only has to phrase them.
- */
-export declare function readCodifiedRules(root: string): HistorySource[];
-/** Who must approve what. A hard constraint, stated as a file. */
-export declare function readCodeowners(root: string): HistorySource[];
-/**
- * Commits that undid another commit.
- *
- * "We tried this and took it back" is a rule available from nowhere else, and
- * it is the one kind of history that says what NOT to do. The body of a revert
- * usually names the commit it undoes and, when the author bothered, why.
- */
-export declare function readReverts(root: string, max?: number): HistorySource[];
-/**
- * Test names, which are invariants someone wrote deliberately.
- *
- * `never retries on a card decline` is a rule stated as an assertion. Read from
- * the graph's own symbols rather than by re-parsing, so this costs nothing:
- * a test function is already a node.
- *
- * Only names that read like a sentence are kept. `TestFoo` is a label;
- * `rejects an expired token` is a claim about how the system must behave.
- */
-export declare function readTestNames(symbolNames: Array<{
-    name: string;
-    path: string;
-}>, max?: number): HistorySource[];
-/**
- * Issues closed as not planned.
- *
- * A decision NOT to build something, which is half of what a codebase's rules
- * are and is invisible everywhere else — nothing was committed, so no commit
- * message records it.
- */
-export declare function readDeclinedIssues(owner: string, repo: string, token: string, fetchImpl: Fetch, api?: string, max?: number): Promise<HistorySource[]>;
-/** Required checks and reviewers on the default branch. */
-export declare function readBranchProtection(owner: string, repo: string, branch: string, token: string, fetchImpl: Fetch, api?: string): Promise<HistorySource[]>;
-export declare function budgetSources(sources: HistorySource[], maxChars?: number, maxCount?: number): HistorySource[];
-/** Repo-relative path, for readers handed an absolute one. */
-export declare function relPath(root: string, abs: string): string;
-//# sourceMappingURL=sources.d.ts.map

package/dist/app/sources.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"sources.d.ts","sourceRoot":"","sources":["../../src/app/sources.ts"],"names":[],"mappings":"AAeA,OAAO,EAAa,KAAK,KAAK,EAAE,MAAM,eAAe,CAAC;AAEtD,kEAAkE;AAClE,MAAM,MAAM,UAAU,GAClB,oBAAoB,GACpB,cAAc,GACd,aAAa,GACb,WAAW,GACX,YAAY,GACZ,mBAAmB,GACnB,QAAQ,GACR,WAAW,GACX,gBAAgB,CAAC;AAErB,iCAAiC;AACjC,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,UAAU,CAAC;IACjB,8EAA8E;IAC9E,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,iEAAiE;IACjE,GAAG,CAAC,EAAE,MAAM,CAAC;CACd;AAkCD;;;;;;;;;GASG;AACH,wBAAgB,qBAAqB,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa,EAAE,CAyBnE;AAMD,wEAAwE;AACxE,eAAO,MAAM,gBAAgB,KAAK,CAAC;AACnC,eAAO,MAAM,eAAe,KAAK,CAAC;AAsBlC;;;;;;GAMG;AACH,wBAAgB,sBAAsB,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,SAAmB,GAAG,MAAM,EAAE,CAkBrF;AAgCD,oEAAoE;AACpE,wBAAgB,UAAU,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,SAAkB,GAAG,MAAM,EAAE,CAqBxE;AASD,sEAAsE;AACtE,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa,EAAE,CAiB9D;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa,EAAE,CA0B/D;AAED,kEAAkE;AAClE,wBAAgB,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,aAAa,EAAE,CAM5D;AAiBD;;;;;;GAMG;AACH,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,SAAc,GAAG,aAAa,EAAE,CAe5E;AAKD;;;;;;;;;GASG;AACH,wBAAgB,aAAa,CAAC,WAAW,EAAE,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,EAAE,GAAG,SAAiB,GAAG,aAAa,EAAE,CAUvH;AAqBD;;;;;;GAMG;AACH,wBAAsB,kBAAkB,CACtC,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,EACZ,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,KAAK,EAChB,GAAG,SAA2B,EAC9B,GAAG,SAAe,GACjB,OAAO,CAAC,aAAa,EAAE,CAAC,CAkC1B;AAED,2DAA2D;AAC3D,wBAAsB,oBAAoB,CACxC,KAAK,EAAE,MAAM,EACb,IAAI,EAAE,MAAM,EACZ,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,MAAM,EACb,SAAS,EAAE,KAAK,EAChB,GAAG,SAA2B,GAC7B,OAAO,CAAC,aAAa,EAAE,CAAC,CA2B1B;AAsBD,wBAAgB,aAAa,CAAC,OAAO,EAAE,aAAa,EAAE,EAAE,QAAQ,SAAkB,EAAE,QAAQ,SAAc,GAAG,aAAa,EAAE,CAW3H;AAED,8DAA8D;AAC9D,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,MAAM,CAEzD"}