trail-code 0.0.0-stage → 0.28.0-semantic.3

package/dist/blast/blast.js

@@ -0,0 +1,383 @@
+/**
+ * Blast radius of a diff: what else in the repo depends on the lines this change
+ * touched.
+ *
+ * The whole command is a join between two things graft already has — git's changed
+ * line ranges (`diff.ts`) and the wiring graph's incoming edges (`traverse.ts`) —
+ * so there is no new graph logic here, only the seeding rule:
+ *
+ *   changed line → the innermost symbol whose span contains it → seed
+ *
+ * Seeding by SYMBOL rather than by file is what makes the answer worth reading: a
+ * 400-line file with a one-line edit reports the dependents of that one function,
+ * not of everything the file happens to define. The file node is seeded too, so
+ * importers (whose edge targets the file, not the symbol) are still found.
+ */
+import { impactOfMany } from "../graph/traverse.js";
+import { dirLabel, moduleIndex, parentDir, shortLabel } from "./modules.js";
+const SPAN_RE = /^L(\d+)-L(\d+)$/;
+function spanBounds(span) {
+    const m = SPAN_RE.exec(span);
+    return m ? { start: Number(m[1]), end: Number(m[2]) } : null;
+}
+/**
+ * The innermost symbols whose spans overlap any changed range in `path`.
+ *
+ * "Innermost" matters for a method: a changed line inside `Cache.get` overlaps both
+ * the class span and the method span, and seeding the class would report everyone
+ * who touches any part of `Cache`. Nesting is resolved by keeping, for each range,
+ * only symbols that contain no other matched symbol.
+ */
+function seedsForFile(graph, path, ranges) {
+    const symbols = [];
+    for (const n of graph.nodes) {
+        if (n.kind === "file" || n.path !== path)
+            continue;
+        const b = spanBounds(n.span);
+        if (b)
+            symbols.push({ node: n, ...b });
+    }
+    if (symbols.length === 0)
+        return [];
+    const hit = new Map();
+    for (const r of ranges) {
+        const overlapping = symbols.filter((s) => s.start <= r.end && s.end >= r.start);
+        // Drop any symbol that strictly contains another overlapping one (the class
+        // around a changed method), keeping the tightest description of the edit.
+        for (const s of overlapping) {
+            const containsAnother = overlapping.some((o) => o !== s && o.start >= s.start && o.end <= s.end);
+            if (!containsAnother)
+                hit.set(s.node.id, s.node);
+        }
+    }
+    return [...hit.values()];
+}
+/** Compute the blast radius of `changed` against `graph`. */
+export function blastRadius(graph, changed, basis, opts) {
+    const fileNodes = new Map();
+    for (const n of graph.nodes)
+        if (n.kind === "file")
+            fileNodes.set(n.path, n);
+    const seeds = [];
+    const unindexed = [];
+    const deleted = [];
+    /** Seed nodes per changed file, kept for the area grouping and the test signal. */
+    const seedNodes = new Map();
+    /** Merged dependents, keyed by node id, at the shallowest depth any file reached
+     * them — plus which changed files did the reaching. */
+    const merged = new Map();
+    for (const file of changed) {
+        if (file.status === "deleted") {
+            deleted.push(file.path);
+            continue;
+        }
+        const fileNode = fileNodes.get(file.path);
+        if (!fileNode) {
+            unindexed.push(file.path);
+            continue;
+        }
+        // No hunk ranges (a rename with no content change, a mode change) or an added
+        // file: the unit of change is the file itself.
+        const symbolSeeds = file.ranges.length > 0 ? seedsForFile(graph, file.path, file.ranges) : [];
+        for (const node of symbolSeeds) {
+            seeds.push({ id: node.id, name: node.name, kind: node.kind, path: node.path, span: node.span, wholeFile: false });
+        }
+        if (symbolSeeds.length === 0) {
+            seeds.push({
+                id: fileNode.id, name: fileNode.name, kind: fileNode.kind,
+                path: fileNode.path, span: fileNode.span, wholeFile: true,
+            });
+        }
+        // One walk PER CHANGED FILE, not one walk over every seed at once. A combined
+        // walk records the depth a node was first reached at but not by which seed, so
+        // the diagram could only draw "every changed file reaches every module" — a
+        // cross-product that tells a reviewer nothing. Walking per file costs one
+        // adjacency build each (cheap: the graph is already in memory) and buys arrows
+        // that are true.
+        //
+        // The FILE node is a seed only when no symbol matched. `imports` edges target
+        // the file id, so seeding it alongside symbols would pull in every importer of
+        // the file — a one-line edit to one function would report every module that
+        // imports the module, which is the noise this command exists to avoid. With no
+        // symbol seeds (a change to a top-level constant, a new import, a file with no
+        // extracted symbols) the file IS the unit of change, and its importers are the
+        // only dependents there are.
+        const walkSeeds = symbolSeeds.length > 0 ? symbolSeeds : [fileNode];
+        seedNodes.set(file.path, walkSeeds);
+        const hits = impactOfMany(graph, walkSeeds, opts.depth, "in");
+        for (const h of hits) {
+            if (!hasNode(h))
+                continue;
+            const hit = toImpacted(h);
+            const prev = merged.get(hit.id);
+            if (!prev)
+                merged.set(hit.id, { hit, from: new Set([file.path]) });
+            else {
+                prev.from.add(file.path);
+                // Keep the shallowest reach: a symbol two hops from one changed file and one
+                // hop from another is one hop away from this PR.
+                if (hit.depth < prev.hit.depth)
+                    prev.hit = hit;
+            }
+        }
+    }
+    const impacted = [...merged.values()].map((m) => m.hit);
+    const origins = new Map([...merged].map(([id, m]) => [id, m.from]));
+    const index = opts.modules ?? emptyIndex();
+    const grouped = groupByModule(impacted, changed, origins, index);
+    return {
+        basis,
+        depth: opts.depth,
+        changed,
+        unindexed,
+        deleted,
+        seeds,
+        impacted,
+        modules: grouped.modules,
+        testModules: grouped.testModules,
+        areas: changedAreas(graph, changed, seedNodes, index, grouped.modules),
+    };
+}
+/**
+ * Group the changed files into areas, and work out whether each one's tests moved.
+ *
+ * The diff's own side of the diagram used to be one box per changed file, which can
+ * never fit: a 24-file PR drew ten arbitrary paths. Grouped by the same concept
+ * labels the dependents use, the same PR is three or four circles — and once the
+ * files are grouped, "did a test that reaches this move too?" is one question per
+ * circle instead of per file.
+ */
+function changedAreas(graph, changed, seedNodes, index, modules) {
+    const changedTests = new Set(changed.filter((c) => TEST_PATH.test(c.path)).map((c) => c.path));
+    const nodeById = new Map(graph.nodes.map((n) => [n.id, n]));
+    /** How many edges point AT each node — how central it is in the graph. */
+    const inDegree = new Map();
+    for (const e of graph.edges)
+        inDegree.set(e.target, (inDegree.get(e.target) ?? 0) + 1);
+    /** Incoming edge sources per node id, resolved to the source's file path. */
+    const incoming = new Map();
+    for (const e of graph.edges) {
+        const path = nodeById.get(e.source)?.path;
+        if (!path || !TEST_PATH.test(path))
+            continue;
+        const at = incoming.get(e.target) ?? new Set();
+        at.add(path);
+        incoming.set(e.target, at);
+    }
+    // Group by DIRECTORY, not by concept. Concepts in a well-summarised repo are
+    // near-file-grained — graft's own PR produced nine of them, one file each — so
+    // grouping the diff by concept groups nothing: the left side was nine circles
+    // with near-identical truncated names. A directory is the coarser unit reviewers
+    // already use, and a concept name is only worth borrowing when one concept
+    // happens to claim the whole group.
+    const groups = new Map();
+    for (const path of seedNodes.keys()) {
+        // A changed test file is the signal, not the source of a blast radius. Drawing
+        // it as an area would put "your tests changed" on both sides of the arrow.
+        if (TEST_PATH.test(path))
+            continue;
+        const dir = dirLabel(path);
+        groups.set(dir, [...(groups.get(dir) ?? []), path]);
+    }
+    coarsen(groups, MAX_AREAS);
+    const byKey = new Map();
+    /** Hub candidates per area, ranked once every seed has been seen. */
+    const candidates = new Map();
+    for (const [dir, paths] of groups) {
+        const area = {
+            label: dir, labelSource: "symbol", key: dir,
+            files: [], seeds: 0, tests: "none", testFiles: [], changedTestFiles: [],
+            reached: 0, behavioural: 0, unreached: [], seedNames: [],
+        };
+        byKey.set(dir, area);
+        for (const path of paths) {
+            const nodes = seedNodes.get(path) ?? [];
+            area.files.push(path);
+            area.seeds += nodes.length;
+            for (const node of nodes) {
+                // Reach is measured over behaviour only. Counting interfaces and type aliases
+                // would sink every ratio: nothing "calls" a type, so a fully tested area of
+                // typed code would report a third of its symbols as unreached.
+                const behavioural = node.kind === "function" || node.kind === "method" || node.kind === "class";
+                const from = incoming.get(node.id) ?? new Set();
+                for (const t of from) {
+                    if (!area.testFiles.includes(t))
+                        area.testFiles.push(t);
+                    if (changedTests.has(t) && !area.changedTestFiles.includes(t))
+                        area.changedTestFiles.push(t);
+                }
+                candidates.set(area, [
+                    ...(candidates.get(area) ?? []),
+                    { name: node.name, behavioural, degree: inDegree.get(node.id) ?? 0 },
+                ]);
+                if (!behavioural)
+                    continue;
+                area.behavioural++;
+                if (from.size > 0)
+                    area.reached++;
+                else
+                    area.unreached.push(node.name);
+            }
+        }
+    }
+    for (const area of byKey.values()) {
+        // The hub is the most-depended-on function in the area, not whichever symbol the
+        // file walk happened to end on: `LlmFailureGate` rather than `transportRetries`.
+        // Behaviour outranks types, since nothing calls an interface.
+        area.seedNames = (candidates.get(area) ?? [])
+            .sort((a, b) => Number(b.behavioural) - Number(a.behavioural) || b.degree - a.degree || a.name.localeCompare(b.name))
+            .map((c) => c.name);
+        const concept = sharedConcept(area.files, index);
+        area.label = concept ?? hubLabel(area.seedNames, area.key);
+        area.labelSource = concept ? "concept" : "symbol";
+        area.files.sort();
+        area.testFiles.sort();
+        area.changedTestFiles.sort();
+        area.tests =
+            area.behavioural === 0 ? "na"
+                : area.changedTestFiles.length > 0 ? "changed"
+                    : area.testFiles.length > 0 ? "stale"
+                        : "none";
+    }
+    // Ordered by how much each area actually reaches, because the diagram caps this
+    // list and folds the rest into one circle. Ordered by size instead, the fold ends
+    // up holding the best-connected areas and the tail circle collects every arrow —
+    // the same mistake, one level up, as capping changed FILES in diff order.
+    const reach = (a) => modules.filter((m) => m.from.some((f) => a.files.includes(f))).length;
+    return [...byKey.values()].sort((a, b) => reach(b) - reach(a) || b.files.length - a.files.length || a.label.localeCompare(b.label));
+}
+/** Convenience wrapper: build the module index from a context dir. */
+export function blastRadiusIn(graph, contextDir, changed, basis, depth) {
+    return blastRadius(graph, changed, basis, { depth, modules: moduleIndex(contextDir) });
+}
+function hasNode(h) {
+    // Unresolved endpoints (an import module string no node exists for) carry no
+    // location, so they can neither be grouped nor opened — dropped rather than
+    // rendered as a box with no file behind it.
+    return h.node !== null;
+}
+function toImpacted(h) {
+    return {
+        id: h.node.id, name: h.node.name, kind: h.node.kind,
+        path: h.node.path, span: h.node.span, relation: h.relation, depth: h.depth,
+    };
+}
+function emptyIndex() {
+    return { hasConcepts: false, labelOf: (p) => p, conceptOf: () => null };
+}
+/**
+ * The concept claiming EVERY file in a cluster, or null when they disagree.
+ *
+ * Unanimity is the point: a concept that covers three of five files describes
+ * something narrower than the cluster, and stamping its name on the whole thing is
+ * how a diagram starts lying about what it drew.
+ */
+function sharedConcept(paths, index) {
+    const concepts = new Set(paths.map((p) => index.conceptOf(p)));
+    const [only] = concepts;
+    return concepts.size === 1 && only ? shortLabel(only) : null;
+}
+/**
+ * The deterministic backstop label: the cluster's most significant symbol.
+ *
+ * Reached with no concept, no cache and no API key, so this is what guarantees a
+ * circle never carries a bare directory. It is a fact rather than a guess — the
+ * reviewer can grep the name — which is why it beats borrowing a neighbouring
+ * concept: on graft's own graph that borrowing labelled the freshness gate
+ * "Graph Extraction and Loading", which misleads worse than any path.
+ */
+export function hubLabel(names, fallback) {
+    const [head] = names.filter(Boolean);
+    // The hub alone, with no "+8" tail: how many symbols came with it is already the
+    // circle's second line and the table's own column, and repeating it in the label
+    // turned "writeGraph" into "writeGraph +8", which reads as a version number.
+    return head ? shortLabel(head) : fallback;
+}
+/**
+ * Group dependents into modules. `origins` carries, per dependent, the changed
+ * files whose walk actually reached it — so a module's `from` is the real arrow
+ * set, not every changed file in the PR.
+ */
+function groupByModule(impacted, changed, origins, modules) {
+    const changedPaths = new Set(changed.map((c) => c.path));
+    const byKey = new Map();
+    for (const hit of impacted) {
+        // A dependent inside a file the PR already changes is not "reach" — it is the
+        // diff. Reviewers see it in the diff itself; repeating it as blast radius is
+        // what makes these comments feel like noise.
+        if (changedPaths.has(hit.path))
+            continue;
+        // Cluster by concept where one exists, else by directory. Clustering and
+        // LABELLING are separate steps now: the key only has to be stable, while the
+        // label goes through the ladder below and may end up naming a symbol.
+        const key = modules.conceptOf(hit.path) ?? dirLabel(hit.path);
+        let mod = byKey.get(key);
+        if (!mod) {
+            mod = { label: key, labelSource: "symbol", key, files: [], symbols: [], from: [] };
+            byKey.set(key, mod);
+        }
+        mod.symbols.push(hit);
+        if (!mod.files.includes(hit.path))
+            mod.files.push(hit.path);
+    }
+    for (const mod of byKey.values()) {
+        const from = new Set();
+        for (const s of mod.symbols)
+            for (const p of origins.get(s.id) ?? [])
+                from.add(p);
+        mod.from = [...from].sort();
+        mod.files.sort();
+        mod.symbols.sort((a, b) => a.depth - b.depth || a.path.localeCompare(b.path));
+        // Shallowest symbol first after that sort, so it is the cluster's hub: the
+        // thing one hop from the diff rather than an arbitrary member.
+        const concept = sharedConcept(mod.files, modules);
+        mod.label = concept ?? hubLabel(mod.symbols.map((s) => s.name), mod.key);
+        mod.labelSource = concept ? "concept" : "symbol";
+    }
+    // Test-only modules are separated, not just sorted last. On a repo with a test
+    // per module they are the majority of the graph's dependents — graft's own 24-file
+    // PR produced 31 modules, 24 of them a single test file — so leaving them in the
+    // same list means they crowd out every module a reviewer needs whatever the caps
+    // are. "Your tests reference the thing you changed" is one line, not 24 sections.
+    const bySize = (a, b) => b.symbols.length - a.symbols.length || a.label.localeCompare(b.label);
+    const all = [...byKey.values()];
+    return {
+        modules: all.filter((m) => !isTestOnly(m)).sort(bySize),
+        testModules: all.filter(isTestOnly).sort(bySize),
+    };
+}
+/**
+ * Directory groups the diff is folded down to before anything is drawn.
+ *
+ * Kept here rather than in the renderer because it is a statement about the diff,
+ * not about the picture: five areas is roughly what a reviewer holds in their head,
+ * and the renderer then draws all of them.
+ */
+const MAX_AREAS = 5;
+/**
+ * Fold directory groups into their parents until there are at most `max`.
+ *
+ * The deepest group goes first, and only into a parent that already exists, so
+ * `src/ai/llm/` joins `src/ai/` rather than everything collapsing towards the repo
+ * root. When no group has an existing parent, one is created — but never at the top
+ * level, since a single `(root)` area is no grouping at all.
+ */
+function coarsen(groups, max) {
+    const depth = (dir) => dir.split("/").length;
+    while (groups.size > max) {
+        const keys = [...groups.keys()].sort((a, b) => depth(b) - depth(a) || (groups.get(a).length - groups.get(b).length));
+        const pick = keys.find((k) => groups.has(parentDir(k)) && parentDir(k) !== "") ??
+            keys.find((k) => parentDir(k) !== "");
+        if (!pick)
+            return;
+        const parent = parentDir(pick);
+        groups.set(parent, [...(groups.get(parent) ?? []), ...groups.get(pick)]);
+        groups.delete(pick);
+    }
+}
+const TEST_PATH = /(^|\/)(tests?|specs?|__tests__)\/|\.(test|spec)\.[cm]?[jt]sx?$|_test\.(go|py|rb)$/i;
+/** True when every file in the module is a test file. */
+function isTestOnly(mod) {
+    return mod.files.length > 0 && mod.files.every((f) => TEST_PATH.test(f));
+}
+//# sourceMappingURL=blast.js.map

package/dist/blast/blast.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"blast.js","sourceRoot":"","sources":["../../src/blast/blast.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AACH,OAAO,EAAE,YAAY,EAAgB,MAAM,sBAAsB,CAAC;AAElE,OAAO,EAAE,QAAQ,EAAE,WAAW,EAAE,SAAS,EAAE,UAAU,EAAoB,MAAM,cAAc,CAAC;AAI9F,MAAM,OAAO,GAAG,iBAAiB,CAAC;AAuHlC,SAAS,UAAU,CAAC,IAAY;IAC9B,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7B,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;AAC/D,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,YAAY,CAAC,KAAc,EAAE,IAAY,EAAE,MAAwC;IAC1F,MAAM,OAAO,GAAmD,EAAE,CAAC;IACnE,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5B,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI;YAAE,SAAS;QACnD,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC;IACzC,CAAC;IACD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAEpC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC;QAChF,4EAA4E;QAC5E,0EAA0E;QAC1E,KAAK,MAAM,CAAC,IAAI,WAAW,EAAE,CAAC;YAC5B,MAAM,eAAe,GAAG,WAAW,CAAC,IAAI,CACtC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,GAAG,CACvD,CAAC;YACF,IAAI,CAAC,eAAe;gBAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;QACnD,CAAC;IACH,CAAC;IACD,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC;AAC3B,CAAC;AAED,6DAA6D;AAC7D,MAAM,UAAU,WAAW,CACzB,KAAc,EACd,OAAsB,EACtB,KAAa,EACb,IAAkB;IAElB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK;QAAE,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;YAAE,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAE7E,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,MAAM,SAAS,GAAa,EAAE,CAAC;IAC/B,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,mFAAmF;IACnF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C;2DACuD;IACvD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgD,CAAC;IAEvE,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,IAAI,IAAI,CAAC,MAAM,KAAK,SAAS,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,SAAS;QACX,CAAC;QACD,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC1B,SAAS;QACX,CAAC;QAED,8EAA8E;QAC9E,+CAA+C;QAC/C,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QAC9F,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC;QACpH,CAAC;QACD,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,QAAQ,CAAC,EAAE,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI;gBACzD,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI;aAC1D,CAAC,CAAC;QACL,CAAC;QAED,8EAA8E;QAC9E,+EAA+E;QAC/E,4EAA4E;QAC5E,0EAA0E;QAC1E,+EAA+E;QAC/E,iBAAiB;QACjB,EAAE;QACF,8EAA8E;QAC9E,+EAA+E;QAC/E,4EAA4E;QAC5E,+EAA+E;QAC/E,+EAA+E;QAC/E,+EAA+E;QAC/E,6BAA6B;QAC7B,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACpE,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QACpC,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC9D,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;YACrB,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;gBAAE,SAAS;YAC1B,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChC,IAAI,CAAC,IAAI;gBAAE,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC;iBAC9D,CAAC;gBACJ,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACzB,6EAA6E;gBAC7E,iDAAiD;gBACjD,IAAI,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK;oBAAE,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;YACjD,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IACxD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,KAAK,GAAG,IAAI,CAAC,OAAO,IAAI,UAAU,EAAE,CAAC;IAC3C,MAAM,OAAO,GAAG,aAAa,CAAC,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;IAEjE,OAAO;QACL,KAAK;QACL,KAAK,EAAE,IAAI,CAAC,KAAK;QACjB,OAAO;QACP,SAAS;QACT,OAAO;QACP,KAAK;QACL,QAAQ;QACR,OAAO,EAAE,OAAO,CAAC,OAAO;QACxB,WAAW,EAAE,OAAO,CAAC,WAAW;QAChC,KAAK,EAAE,YAAY,CAAC,KAAK,EAAE,OAAO,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,CAAC,OAAO,CAAC;KACvE,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,YAAY,CACnB,KAAc,EACd,OAAsB,EACtB,SAAgC,EAChC,KAAkB,EAClB,OAAyB;IAEzB,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC/F,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC5D,0EAA0E;IAC1E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK;QAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvF,6EAA6E;IAC7E,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IAChD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC;QAC1C,IAAI,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QAC7C,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;QACvD,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACb,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,6EAA6E;IAC7E,+EAA+E;IAC/E,8EAA8E;IAC9E,iFAAiF;IACjF,2EAA2E;IAC3E,oCAAoC;IACpC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC;QACpC,+EAA+E;QAC/E,2EAA2E;QAC3E,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAS;QACnC,MAAM,GAAG,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC3B,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;IAE3B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC7C,qEAAqE;IACrE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAyE,CAAC;IACpG,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;QAClC,MAAM,IAAI,GAAgB;YACxB,KAAK,EAAE,GAAG,EAAE,WAAW,EAAE,QAAQ,EAAE,GAAG,EAAE,GAAG;YAC3C,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,gBAAgB,EAAE,EAAE;YACvE,OAAO,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,EAAE,SAAS,EAAE,EAAE,EAAE,SAAS,EAAE,EAAE;SACzD,CAAC;QACF,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACxC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtB,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,CAAC;YAE3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,8EAA8E;gBAC9E,4EAA4E;gBAC5E,+DAA+D;gBAC/D,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,IAAI,KAAK,QAAQ,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,CAAC;gBAChG,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;gBACxD,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;oBACrB,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC;wBAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBACxD,IAAI,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC,CAAC;wBAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC/F,CAAC;gBACD,UAAU,CAAC,GAAG,CAAC,IAAI,EAAE;oBACnB,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;oBAC/B,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE;iBACrE,CAAC,CAAC;gBACH,IAAI,CAAC,WAAW;oBAAE,SAAS;gBAC3B,IAAI,CAAC,WAAW,EAAE,CAAC;gBACnB,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC;oBAAE,IAAI,CAAC,OAAO,EAAE,CAAC;;oBAC7B,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QAClC,iFAAiF;QACjF,iFAAiF;QACjF,8DAA8D;QAC9D,IAAI,CAAC,SAAS,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;aAC1C,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACb,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;aACtG,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;QACtB,MAAM,OAAO,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACjD,IAAI,CAAC,KAAK,GAAG,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,SAAS,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QAC3D,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;QAClD,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QAClB,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QACtB,IAAI,CAAC,gBAAgB,CAAC,IAAI,EAAE,CAAC;QAC7B,IAAI,CAAC,KAAK;YACR,IAAI,CAAC,WAAW,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI;gBAC7B,CAAC,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS;oBAC9C,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO;wBACrC,CAAC,CAAC,MAAM,CAAC;IACb,CAAC;IAED,gFAAgF;IAChF,kFAAkF;IAClF,iFAAiF;IACjF,0EAA0E;IAC1E,MAAM,KAAK,GAAG,CAAC,CAAc,EAAE,EAAE,CAC/B,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;IACxE,OAAO,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAC7B,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CACnG,CAAC;AACJ,CAAC;AAED,sEAAsE;AACtE,MAAM,UAAU,aAAa,CAC3B,KAAc,EACd,UAAkB,EAClB,OAAsB,EACtB,KAAa,EACb,KAAa;IAEb,OAAO,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,KAAK,EAAE,OAAO,EAAE,WAAW,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;AACzF,CAAC;AAED,SAAS,OAAO,CAAC,CAAU;IACzB,6EAA6E;IAC7E,4EAA4E;IAC5E,4CAA4C;IAC5C,OAAO,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC;AACzB,CAAC;AAED,SAAS,UAAU,CAAC,CAA6B;IAC/C,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI;QACnD,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK;KAC3E,CAAC;AACJ,CAAC;AAED,SAAS,UAAU;IACjB,OAAO,EAAE,WAAW,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC;AAC1E,CAAC;AAED;;;;;;GAMG;AACH,SAAS,aAAa,CAAC,KAAe,EAAE,KAAkB;IACxD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/D,MAAM,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC;IACxB,OAAO,QAAQ,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AAC/D,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,QAAQ,CAAC,KAAe,EAAE,QAAgB;IACxD,MAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACrC,iFAAiF;IACjF,iFAAiF;IACjF,6EAA6E;IAC7E,OAAO,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC;AAC5C,CAAC;AAED;;;;GAIG;AACH,SAAS,aAAa,CACpB,QAAoB,EACpB,OAAsB,EACtB,OAAiC,EACjC,OAAoB;IAEpB,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACzD,MAAM,KAAK,GAAG,IAAI,GAAG,EAA0B,CAAC;IAEhD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,8EAA8E;QAC9E,6EAA6E;QAC7E,6CAA6C;QAC7C,IAAI,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QACzC,yEAAyE;QACzE,6EAA6E;QAC7E,sEAAsE;QACtE,MAAM,GAAG,GAAG,OAAO,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9D,IAAI,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACzB,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,GAAG,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,WAAW,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;YACnF,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;QACtB,CAAC;QACD,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACtB,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAC9D,CAAC;IAED,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACjC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;QAC/B,KAAK,MAAM,CAAC,IAAI,GAAG,CAAC,OAAO;YAAE,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE;gBAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClF,GAAG,CAAC,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAC5B,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QACjB,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;QAC9E,2EAA2E;QAC3E,+DAA+D;QAC/D,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAClD,GAAG,CAAC,KAAK,GAAG,OAAO,IAAI,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;QACzE,GAAG,CAAC,WAAW,GAAG,OAAO,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;IACnD,CAAC;IAED,+EAA+E;IAC/E,mFAAmF;IACnF,iFAAiF;IACjF,iFAAiF;IACjF,kFAAkF;IAClF,MAAM,MAAM,GAAG,CAAC,CAAiB,EAAE,CAAiB,EAAE,EAAE,CACtD,CAAC,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACxE,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAChC,OAAO;QACL,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;QACvD,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;KACjD,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,MAAM,SAAS,GAAG,CAAC,CAAC;AAEpB;;;;;;;GAOG;AACH,SAAS,OAAO,CAAC,MAA6B,EAAE,GAAW;IACzD,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC;IACrD,OAAO,MAAM,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC;QACzB,MAAM,IAAI,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,CAAC;QACvH,MAAM,IAAI,GACR,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC;YACjE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI;YAAE,OAAO;QAClB,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC,CAAC;QAC1E,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACtB,CAAC;AACH,CAAC;AAED,MAAM,SAAS,GAAG,oFAAoF,CAAC;AAEvG,yDAAyD;AACzD,SAAS,UAAU,CAAC,GAAmB;IACrC,OAAO,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;AAC3E,CAAC"}

package/dist/blast/diff.d.ts

@@ -0,0 +1,53 @@
+export type ChangeStatus = "added" | "modified" | "deleted" | "renamed";
+/** A contiguous run of changed lines, in POST-image (new file) line numbers. */
+export interface LineRange {
+    start: number;
+    end: number;
+}
+/**
+ * One line git reported inside a hunk.
+ *
+ * `n` is the POST-image number, so it is the number a reviewer sees in the file
+ * on disk — a deleted line has none.
+ */
+export interface DiffLine {
+    n: number | null;
+    sign: "+" | "-";
+    text: string;
+}
+/** A hunk's range and the lines in it. `ranges` on the file mirrors these. */
+export interface Hunk extends LineRange {
+    lines: DiffLine[];
+    /** Lines dropped by the per-hunk cap — a generated file is not worth holding. */
+    dropped: number;
+}
+export interface ChangedFile {
+    /** Repo-relative posix path, post-image (the new name for a rename). */
+    path: string;
+    status: ChangeStatus;
+    /** Pre-image path, renames only. */
+    oldPath?: string;
+    /** Post-image changed line ranges. Empty for a pure delete or a mode-only change. */
+    ranges: LineRange[];
+    /** The same hunks, carrying their text: what a panel shows so a reader sees the
+     * change rather than a line number they have to go look up. One per range. */
+    hunks: Hunk[];
+}
+export interface DiffResult {
+    /** Human label for what was compared, e.g. "origin/main...HEAD". */
+    basis: string;
+    files: ChangedFile[];
+}
+/** True when `ref` names something git can resolve — checked before diffing so
+ * an unknown `--base` fails with a caller-facing message, not a git stack. */
+export declare function refExists(root: string, ref: string): boolean;
+/**
+ * Changed files + post-image line ranges.
+ *
+ * With no `base` this reports the working tree against HEAD (the local
+ * "what am I about to push" case), falling back to the last commit when the
+ * tree is clean — so the command answers something useful when run by hand,
+ * and CI passes `--base` for the real PR range.
+ */
+export declare function changedFiles(root: string, base?: string): DiffResult | null;
+//# sourceMappingURL=diff.d.ts.map

package/dist/blast/diff.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"diff.d.ts","sourceRoot":"","sources":["../../src/blast/diff.ts"],"names":[],"mappings":"AAaA,MAAM,MAAM,YAAY,GAAG,OAAO,GAAG,UAAU,GAAG,SAAS,GAAG,SAAS,CAAC;AAExE,gFAAgF;AAChF,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,MAAM,CAAC;IACd,GAAG,EAAE,MAAM,CAAC;CACb;AAED;;;;;GAKG;AACH,MAAM,WAAW,QAAQ;IACvB,CAAC,EAAE,MAAM,GAAG,IAAI,CAAC;IACjB,IAAI,EAAE,GAAG,GAAG,GAAG,CAAC;IAChB,IAAI,EAAE,MAAM,CAAC;CACd;AAED,8EAA8E;AAC9E,MAAM,WAAW,IAAK,SAAQ,SAAS;IACrC,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,iFAAiF;IACjF,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,WAAW;IAC1B,wEAAwE;IACxE,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,YAAY,CAAC;IACrB,oCAAoC;IACpC,OAAO,CAAC,EAAE,MAAM,CAAC;IACjB,qFAAqF;IACrF,MAAM,EAAE,SAAS,EAAE,CAAC;IACpB;kFAC8E;IAC9E,KAAK,EAAE,IAAI,EAAE,CAAC;CACf;AAED,MAAM,WAAW,UAAU;IACzB,oEAAoE;IACpE,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,WAAW,EAAE,CAAC;CACtB;AAqBD;8EAC8E;AAC9E,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,GAAG,OAAO,CAE5D;AAcD;;;;;;;GAOG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,GAAG,UAAU,GAAG,IAAI,CAe3E"}

package/dist/blast/diff.js

@@ -0,0 +1,193 @@
+/**
+ * What a PR touched, read from git: changed files plus the *line ranges* inside
+ * them, which is what turns a diff into graph seeds (an enclosing-symbol lookup
+ * per changed line, see `blast.ts`).
+ *
+ * Git is shelled out to rather than parsed from a library because the CI job
+ * this feeds already has git — and `--unified=0` gives exactly the post-image
+ * line ranges we need, with no context lines to subtract back out.
+ */
+import { WINHIDE } from "../util/child-process.js";
+import { spawnSync } from "node:child_process";
+import { resolve } from "node:path";
+const HUNK_RE = /^@@ -\d+(?:,\d+)? \+(\d+)(?:,(\d+))? @@/;
+/** Text kept per hunk, and per file. A regenerated lockfile is one hunk of 40,000
+ * lines: the ranges still matter (they seed the graph), the text does not, and it
+ * would otherwise ride along in `--format json` and in every exported page. */
+const MAX_HUNK_LINES = 24;
+const MAX_FILE_LINES = 200;
+/** Run git in `root`, or return null when git fails (not a repo, unknown ref). */
+function git(root, args) {
+    const res = spawnSync("git", ["-c", "core.quotePath=false", ...args], { ...WINHIDE, 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;
+}
+/** True when `ref` names something git can resolve — checked before diffing so
+ * an unknown `--base` fails with a caller-facing message, not a git stack. */
+export function refExists(root, ref) {
+    return git(resolve(root), ["rev-parse", "--verify", "--quiet", `${ref}^{commit}`]) !== null;
+}
+/**
+ * The diff arguments for a base ref, and the label to show for it.
+ *
+ * `<base>...HEAD` (three dots) diffs against the MERGE BASE, not the tip of the
+ * base branch — the difference matters on every PR whose base branch moved after
+ * it was cut: two-dot would attribute other people's merges to this PR and
+ * inflate the blast radius with files the author never touched.
+ */
+function rangeArgs(base) {
+    return { args: [`${base}...HEAD`], basis: `${base}...HEAD` };
+}
+/**
+ * Changed files + post-image line ranges.
+ *
+ * With no `base` this reports the working tree against HEAD (the local
+ * "what am I about to push" case), falling back to the last commit when the
+ * tree is clean — so the command answers something useful when run by hand,
+ * and CI passes `--base` for the real PR range.
+ */
+export function changedFiles(root, base) {
+    const dir = resolve(root);
+    if (base !== undefined) {
+        const { args, basis } = rangeArgs(base);
+        const files = diffFiles(dir, args);
+        return files === null ? null : { basis, files };
+    }
+    const working = diffFiles(dir, ["HEAD"]);
+    if (working === null)
+        return null;
+    if (working.length > 0)
+        return { basis: "working tree vs HEAD", files: working };
+    const last = diffFiles(dir, ["HEAD~1...HEAD"]);
+    if (last === null)
+        return { basis: "working tree vs HEAD", files: [] };
+    return { basis: "HEAD~1...HEAD", files: last };
+}
+/** Both git passes for one range: name-status (statuses, renames) then hunks. */
+function diffFiles(dir, range) {
+    const status = git(dir, ["diff", "--name-status", "--find-renames", "-z", ...range, "--"]);
+    if (status === null)
+        return null;
+    const files = parseNameStatus(status);
+    if (files.length === 0)
+        return files;
+    const patch = git(dir, [
+        "diff",
+        "--unified=0",
+        "--no-color",
+        "--no-ext-diff",
+        "--find-renames",
+        ...range,
+        "--",
+    ]);
+    if (patch !== null)
+        applyHunks(files, patch);
+    return files;
+}
+/**
+ * `--name-status -z` output: NUL-separated fields, where a rename spends THREE
+ * fields (`R096`, old, new) and everything else spends two. Splitting on NUL and
+ * walking with a cursor is the only way to read it — a line-oriented parse
+ * silently pairs a rename's old path with the next file's status.
+ */
+function parseNameStatus(out) {
+    const fields = out.split("\0").filter((f) => f !== "");
+    const files = [];
+    for (let i = 0; i < fields.length;) {
+        const code = fields[i++];
+        if (code.startsWith("R") || code.startsWith("C")) {
+            const oldPath = fields[i++];
+            const path = fields[i++];
+            if (path === undefined)
+                break;
+            files.push({ path, status: "renamed", oldPath, ranges: [], hunks: [] });
+            continue;
+        }
+        const path = fields[i++];
+        if (path === undefined)
+            break;
+        if (code.startsWith("A"))
+            files.push({ path, status: "added", ranges: [], hunks: [] });
+        else if (code.startsWith("D"))
+            files.push({ path, status: "deleted", ranges: [], hunks: [] });
+        else
+            files.push({ path, status: "modified", ranges: [], hunks: [] });
+    }
+    return files;
+}
+/** Attach each hunk's post-image range — and its text — to its file. */
+function applyHunks(files, patch) {
+    const byPath = new Map(files.map((f) => [f.path, f]));
+    let current;
+    let hunk;
+    /** Post-image number for the next `+` line of the open hunk. */
+    let next = 0;
+    let kept = 0;
+    for (const line of patch.split("\n")) {
+        // Every file starts with this, and a content line cannot: a deleted one begins
+        // with `-`. Closing the open hunk here is what stops the NEXT file's `--- a/x`
+        // header being absorbed as a deleted line of the previous hunk.
+        if (line.startsWith("diff --git ")) {
+            current = undefined;
+            hunk = undefined;
+            continue;
+        }
+        if (line.startsWith("+++ ")) {
+            const raw = line.slice(4);
+            current = raw === "/dev/null" ? undefined : byPath.get(stripPrefix(raw));
+            hunk = undefined;
+            kept = 0;
+            continue;
+        }
+        if (line.startsWith("@@")) {
+            hunk = undefined;
+            if (!current)
+                continue;
+            const m = HUNK_RE.exec(line);
+            if (!m)
+                continue;
+            const start = Number(m[1]);
+            // `+N,0` is a pure deletion: nothing survives in the post-image, and git
+            // reports the line BEFORE the gap. Recording that single line is what keeps
+            // "the body of foo() lost 10 lines" attributable to foo() at all.
+            const count = m[2] === undefined ? 1 : Number(m[2]);
+            const range = count === 0 ? { start, end: start } : { start, end: start + count - 1 };
+            hunk = { ...range, lines: [], dropped: 0 };
+            current.ranges.push(range);
+            current.hunks.push(hunk);
+            next = start;
+            continue;
+        }
+        if (!hunk)
+            continue;
+        // With `--unified=0` every line inside a hunk is an edit, so there is no
+        // context to skip. `+++`/`---` headers are already consumed above; a bare
+        // `--- a/x` for the next file arrives before its `+++`, and the `!hunk`
+        // guard on a fresh file keeps it out.
+        if (line.startsWith("+")) {
+            pushLine(hunk, { n: next, sign: "+", text: line.slice(1) }, kept++ < MAX_FILE_LINES);
+            next += 1;
+        }
+        else if (line.startsWith("-")) {
+            pushLine(hunk, { n: null, sign: "-", text: line.slice(1) }, kept++ < MAX_FILE_LINES);
+        }
+    }
+}
+function pushLine(hunk, line, withinFile) {
+    if (!withinFile || hunk.lines.length >= MAX_HUNK_LINES) {
+        hunk.dropped += 1;
+        return;
+    }
+    hunk.lines.push(line);
+}
+/** `b/src/x.ts` → `src/x.ts`, minus any trailing tab-separated timestamp. */
+function stripPrefix(raw) {
+    const untabbed = raw.split("\t")[0];
+    return untabbed.startsWith("b/") ? untabbed.slice(2) : untabbed;
+}
+//# sourceMappingURL=diff.js.map