@opensip-cli/graph 0.1.0

package/dist/pipeline/features.js

@@ -0,0 +1,462 @@
+// @fitness-ignore-file batch-operation-limits -- pure in-memory linear/BFS scans over the already-materialized catalog + indexes (bounded by repo size); data→data, no DB/IO/unbounded-async to batch or paginate.
+/**
+ * Stage 3.5 — Feature derivation.
+ *
+ * Pure data→data over the catalog + indexes. A *plain view* by default
+ * (ADR-0006): only the columns the caller requests are computed
+ * (lazy/needed-only), and the in-engine rules consume the result without it
+ * ever being persisted for their sake. The dashboard columns (blast / scc /
+ * packageCoupling) are materialized into the catalog JSON only when the
+ * producing run requests them.
+ *
+ * Algorithms here are ports of analyses that first lived in dashboard-side
+ * JavaScript (`code-paths/indexes.ts` blast, `code-paths/scc.ts` Tarjan,
+ * `code-paths/view-coupling.ts` coupling) or inline inside individual rules
+ * (the `endLine − line + 1` span, `orphan-subtree`'s reachability BFS,
+ * `test-only-reachable`'s prod BFS). The engine is now the canonical home for
+ * computed feature columns; dashboard helpers still assemble view-local
+ * indexes and drilldowns from the catalog plus the precomputed features.
+ */
+import { logger } from '@opensip-cli/core';
+import { occId, pkgOf, resolveCallee } from '../resolve-callee.js';
+import { inferEntryPoints } from '../rules/_entry-points.js';
+/**
+ * Maximum BFS depth used when computing per-function blast radius. Ported
+ * verbatim from the dashboard's former `code-paths/indexes.ts`: bounded depth
+ * keeps cost predictable; a slight under-count for deep chains is acceptable
+ * for a "what's risky to touch" heuristic.
+ */
+const BLAST_MAX_DEPTH = 5;
+const EMPTY_FUNCTION = new Map();
+const EMPTY_PACKAGE = new Map();
+const EMPTY_SCC = [];
+const EMPTY_EDGE = [];
+/** True when any function-grain column is requested. */
+function wantsFunctionGrain(set) {
+    return (set.has('bodyLines') ||
+        set.has('blast') ||
+        set.has('reachableFromEntry') ||
+        set.has('reachableOnlyFromTests'));
+}
+/**
+ * Compute the requested feature columns over the catalog + indexes. Only the
+ * entities whose driving columns are present are populated; everything else
+ * is the shared empty value. An empty `requested` ⇒ an all-empty table.
+ */
+export function buildFeatures(catalog, indexes, config, requested) {
+    const set = new Set(requested);
+    if (set.size === 0) {
+        return { function: EMPTY_FUNCTION, package: EMPTY_PACKAGE, scc: EMPTY_SCC, edge: EMPTY_EDGE };
+    }
+    const fn = wantsFunctionGrain(set)
+        ? buildFunctionFeatures(catalog, indexes, config, set)
+        : EMPTY_FUNCTION;
+    let pkg = EMPTY_PACKAGE;
+    let edge = EMPTY_EDGE;
+    if (set.has('packageCoupling')) {
+        const coupling = computePackageCoupling(indexes);
+        pkg = coupling.package;
+        edge = coupling.edge;
+    }
+    const scc = set.has('scc') ? computeSccs(indexes) : EMPTY_SCC;
+    logger.info({
+        evt: 'graph.features.build.complete',
+        module: 'graph:features',
+        columns: [...set],
+        functions: fn.size,
+        packages: pkg.size,
+        sccs: scc.length,
+        edges: edge.length,
+    });
+    return { function: fn, package: pkg, scc, edge };
+}
+/**
+ * Assemble per-function rows, attaching only the requested columns. `bodyLines`
+ * is always present for the function grain (cheap + always-computable);
+ * `blast` / `reachableFromEntry` / `testReachable` / `reachableOnlyFromTests`
+ * ride along only when their column was requested.
+ */
+function buildFunctionFeatures(catalog, indexes, config, set) {
+    const blast = set.has('blast') ? computeBlast(indexes) : undefined;
+    const reachableFromEntry = set.has('reachableFromEntry')
+        ? computeReachableFromEntry(catalog, indexes, config)
+        : undefined;
+    // Both `testReachable` and `reachableOnlyFromTests` ride on this request.
+    const needsTestReach = set.has('reachableOnlyFromTests');
+    const prodReachable = needsTestReach ? computeProdReachable(catalog, indexes) : undefined;
+    const testReachable = needsTestReach ? computeTestReachable(indexes) : undefined;
+    const out = new Map();
+    for (const [hash, occ] of indexes.byBodyHash) {
+        const row = {
+            bodyLines: occ.endLine - occ.line + 1,
+        };
+        if (blast)
+            row.blast = blast.get(hash);
+        if (reachableFromEntry)
+            row.reachableFromEntry = reachableFromEntry.has(hash);
+        if (prodReachable && testReachable) {
+            // `testReachable` = "exercised by a test" — reachable from a test-file
+            // function (NOT merely the negation of production-reachability, which is
+            // what this used to compute and which mislabeled production-reachable
+            // utilities as 'not reached by any test').
+            row.testReachable = testReachable.has(hash);
+            row.reachableOnlyFromTests = isReachableOnlyFromTests(hash, indexes, prodReachable);
+        }
+        out.set(hash, row);
+    }
+    return out;
+}
+/**
+ * The `test-only-reachable` reachability predicate, lifted verbatim: a function
+ * is reachable-only-from-tests when it is NOT reachable from any production
+ * entry point, HAS callers, and ALL of its callers live in test files.
+ */
+function isReachableOnlyFromTests(hash, indexes, prodReachable) {
+    if (prodReachable.has(hash))
+        return false;
+    const callers = indexes.callers.get(hash) ?? [];
+    if (callers.length === 0)
+        return false;
+    return callers.every((h) => indexes.byBodyHash.get(h)?.inTestFile === true);
+}
+// ── Blast (verbatim port of dashboard code-paths/indexes.ts) ───────
+/**
+ * Bounded reverse BFS over `callers`: depth-1 reaches are `direct`, depth
+ * 2..BLAST_MAX_DEPTH reaches are `transitive` (set-deduplicated, per-source
+ * visited set seeded with `[start, ...directSet]` so cycles short-circuit
+ * without inflating counts). `score = direct + 0.5 × transitive`.
+ */
+function bfsBlast(start, callers) {
+    const directCallers = callers.get(start) ?? [];
+    const directSet = new Set(directCallers);
+    const visited = new Set([start, ...directSet]);
+    const transitiveSet = new Set();
+    let frontier = [...directSet];
+    for (let depth = 2; depth <= BLAST_MAX_DEPTH && frontier.length > 0; depth++) {
+        const next = [];
+        for (const node of frontier) {
+            const parents = callers.get(node) ?? [];
+            for (const parent of parents) {
+                if (visited.has(parent))
+                    continue;
+                visited.add(parent);
+                transitiveSet.add(parent);
+                next.push(parent);
+            }
+        }
+        frontier = next;
+    }
+    const direct = directSet.size;
+    const transitive = transitiveSet.size;
+    return { direct, transitive, score: direct + 0.5 * transitive };
+}
+/** One blast score per `byBodyHash` node. */
+function computeBlast(indexes) {
+    const out = new Map();
+    for (const target of indexes.byBodyHash.keys()) {
+        out.set(target, bfsBlast(target, indexes.callers));
+    }
+    return out;
+}
+// ── Reachability (verbatim ports of the two rule-local BFS passes) ──
+/**
+ * Reachable from any inferred entry point. Lifted from `orphan-subtree`'s
+ * `computeReachable`: seeds = `inferEntryPoints` ∪ `config.entryPointHashes`;
+ * BFS over `callees`.
+ */
+function computeReachableFromEntry(catalog, indexes, config) {
+    const seeds = new Set();
+    for (const ep of inferEntryPoints(catalog, indexes))
+        seeds.add(ep.bodyHash);
+    for (const h of config.entryPointHashes ?? [])
+        seeds.add(h);
+    return bfsForward(seeds, indexes);
+}
+/**
+ * Reachable from a NON-test (production) entry point. Lifted from
+ * `test-only-reachable`'s `computeProductionEntries` + `bfsReachable`: seeds =
+ * `inferEntryPoints` filtered to non-test occurrences; BFS over `callees`.
+ */
+function computeProdReachable(catalog, indexes) {
+    const seeds = new Set();
+    for (const ep of inferEntryPoints(catalog, indexes)) {
+        const occ = indexes.byBodyHash.get(ep.bodyHash);
+        /* v8 ignore next */
+        if (!occ)
+            continue;
+        if (occ.inTestFile)
+            continue;
+        seeds.add(ep.bodyHash);
+    }
+    return bfsForward(seeds, indexes);
+}
+/**
+ * Reachable from a TEST — i.e. exercised by a test. Seeds = EVERY function
+ * defined in a test file (each is a potential test entry); forward BFS over
+ * `callees`. A production function in the result set is transitively called by
+ * some test, so `testReachable` is true. This is the correct companion to the
+ * high-blast-untested rule ("not reached by any test" ⇔ not in this set) — it
+ * replaces the old `!prodReachable` definition, which conflated "unreachable
+ * from production" with "tested".
+ */
+function computeTestReachable(indexes) {
+    const seeds = new Set();
+    for (const [hash, occ] of indexes.byBodyHash) {
+        if (occ.inTestFile)
+            seeds.add(hash);
+    }
+    return bfsForward(seeds, indexes);
+}
+/** Forward BFS over the `callees` adjacency from a seed set. */
+function bfsForward(seeds, indexes) {
+    const visited = new Set();
+    const queue = [...seeds];
+    while (queue.length > 0) {
+        const cur = queue.shift();
+        /* v8 ignore next */
+        if (cur === undefined || visited.has(cur))
+            continue;
+        visited.add(cur);
+        for (const n of indexes.callees.get(cur) ?? []) {
+            if (!visited.has(n))
+                queue.push(n);
+        }
+    }
+    return visited;
+}
+/**
+ * Build the occurrence-level node graph: every occurrence is a node keyed by
+ * occId; each call edge's targets are resolved via `resolveCallee` to the
+ * occurrence the caller actually reaches, then mapped to that callee's occId.
+ * Neighbors are deduped (a Set per node) so the Tarjan adjacency stays tight.
+ */
+function buildOccGraph(indexes) {
+    const byOccId = new Map();
+    const adj = new Map();
+    for (const occs of indexes.occurrencesByHash.values()) {
+        for (const occ of occs) {
+            const id = occId(occ);
+            byOccId.set(id, occ);
+            const neighbors = new Set();
+            for (const callEdge of occ.calls) {
+                for (const target of callEdge.to) {
+                    const callee = resolveCallee(target, occ, indexes);
+                    if (callee)
+                        neighbors.add(occId(callee));
+                }
+            }
+            adj.set(id, [...neighbors]);
+        }
+    }
+    return { nodes: [...byOccId.keys()], byOccId, adj };
+}
+/**
+ * Iterative Tarjan over the occurrence-level graph (`buildOccGraph`). Singletons
+ * included by the algorithm; each component's members sorted; result ordering
+ * preserved (push-on-root-close). Each component is mapped to an `SccFeatures`
+ * whose members are occIds, with a stable member-derived id and
+ * `crossesPackages` over the members' resolved packages. Irreducible iterative
+ * Tarjan (no recursion, to survive deep call graphs) — splitting it would
+ * obscure the well-known algorithm.
+ *
+ * Exported so the equivalence diff (`cross-shard-resolve.diffCatalogs`) can run
+ * the SAME occId-keyed SCC computation over both the exact and the sharded
+ * catalog and diff component membership — the Phase-4 cycle-finding gate. There
+ * is exactly one SCC implementation; the diff reuses it rather than reimplement.
+ */
+// eslint-disable-next-line sonarjs/cognitive-complexity -- iterative Tarjan, see above
+export function computeSccs(indexes) {
+    const graph = buildOccGraph(indexes);
+    const result = [];
+    const index = new Map();
+    const lowlink = new Map();
+    const onStack = new Set();
+    const stack = [];
+    let nextIndex = 0;
+    const adj = (v) => graph.adj.get(v) ?? [];
+    for (const start of graph.nodes) {
+        if (index.has(start))
+            continue;
+        const work = [{ v: start, ai: 0 }];
+        while (work.length > 0) {
+            const frame = work.at(-1);
+            const v = frame.v;
+            if (frame.ai === 0) {
+                index.set(v, nextIndex);
+                lowlink.set(v, nextIndex);
+                nextIndex++;
+                stack.push(v);
+                onStack.add(v);
+            }
+            const adjV = adj(v);
+            let descended = false;
+            while (frame.ai < adjV.length) {
+                const w = adjV[frame.ai++];
+                if (!index.has(w)) {
+                    work.push({ v: w, ai: 0 });
+                    descended = true;
+                    break;
+                }
+                else if (onStack.has(w)) {
+                    const iw = index.get(w);
+                    if (iw < lowlink.get(v))
+                        lowlink.set(v, iw);
+                }
+            }
+            if (descended)
+                continue;
+            if (lowlink.get(v) === index.get(v)) {
+                const members = [];
+                for (;;) {
+                    const w = stack.pop();
+                    onStack.delete(w);
+                    members.push(w);
+                    if (w === v)
+                        break;
+                }
+                members.sort();
+                result.push(toSccFeatures(members, graph.byOccId));
+            }
+            work.pop();
+            if (work.length > 0) {
+                const parent = work.at(-1).v;
+                if (lowlink.get(v) < lowlink.get(parent)) {
+                    lowlink.set(parent, lowlink.get(v));
+                }
+            }
+        }
+    }
+    return result;
+}
+/** Build an `SccFeatures` row from sorted member occIds. */
+function toSccFeatures(members, byOccId) {
+    const packages = new Set();
+    for (const id of members) {
+        const occ = byOccId.get(id);
+        if (occ)
+            packages.add(pkgOf(occ));
+    }
+    return {
+        id: `scc:${members[0] ?? ''}`,
+        members,
+        sccSize: members.length,
+        crossesPackages: packages.size > 1,
+    };
+}
+// ── Package coupling (port of dashboard view-coupling.ts, using the
+//    engine's canonical resolveCallee instead of the browser replica) ──
+/**
+ * Single pass over `byBodyHash`: for each occurrence (caller), resolve every
+ * call-edge target to a callee occurrence via the canonical `resolveCallee`
+ * (body-hash collision disambiguation), bucket by `(callerPkg, calleePkg)`.
+ * Emits the unfiltered whole-graph matrix — the dashboard's `passesFilter` is
+ * a UI concern, applied client-side. Self-edges (diagonal) are kept (the
+ * matrix counts them). Single pass (nested caller→edge→target loops + degree
+ * rollups); a verbatim port of the dashboard's former client coupling view.
+ */
+// eslint-disable-next-line sonarjs/cognitive-complexity -- single-pass coupling aggregation, see above
+function computePackageCoupling(indexes) {
+    const counts = new Map();
+    for (const occ of indexes.byBodyHash.values()) {
+        // Package coupling is a PRODUCTION-architecture gate (graph:unexpected-coupling).
+        // Test-file occurrences are not production architecture — and, because an
+        // anonymous body duplicated between packages can resolve to a same-hash
+        // occurrence in another package's test file, counting them manufactures
+        // phantom cross-package edges (and phantom cycles). Skip test occurrences on
+        // BOTH ends, mirroring how every other production-gating rule skips
+        // `occ.inTestFile`.
+        if (occ.inTestFile)
+            continue;
+        const callerPkg = pkgOf(occ);
+        for (const callEdge of occ.calls) {
+            for (const target of callEdge.to) {
+                const callee = resolveCallee(target, occ, indexes);
+                if (!callee || callee.inTestFile)
+                    continue;
+                const calleePkg = pkgOf(callee);
+                let row = counts.get(callerPkg);
+                if (!row) {
+                    row = new Map();
+                    counts.set(callerPkg, row);
+                }
+                row.set(calleePkg, (row.get(calleePkg) ?? 0) + 1);
+            }
+        }
+    }
+    // edge rows: flatten, sorted by (callerPackage, calleePackage).
+    const edge = [];
+    for (const [callerPackage, row] of counts) {
+        for (const [calleePackage, count] of row) {
+            edge.push({ callerPackage, calleePackage, count });
+        }
+    }
+    edge.sort((a, b) => {
+        const x = a.callerPackage === b.callerPackage ? a.calleePackage : a.callerPackage;
+        const y = a.callerPackage === b.callerPackage ? b.calleePackage : b.callerPackage;
+        return Number(x > y) - Number(x < y);
+    });
+    // package rows: couplingOut = distinct callee packages per caller;
+    // couplingIn = distinct caller packages per callee. Self-edges included
+    // (the matrix diagonal), so the degrees match the matrix.
+    const outDistinct = new Map();
+    const inDistinct = new Map();
+    for (const { callerPackage, calleePackage } of edge) {
+        addDistinct(outDistinct, callerPackage, calleePackage);
+        addDistinct(inDistinct, calleePackage, callerPackage);
+    }
+    const pkg = new Map();
+    const allPkgs = new Set([...outDistinct.keys(), ...inDistinct.keys()]);
+    for (const name of allPkgs) {
+        pkg.set(name, {
+            couplingOut: outDistinct.get(name)?.size ?? 0,
+            couplingIn: inDistinct.get(name)?.size ?? 0,
+        });
+    }
+    return { package: pkg, edge };
+}
+function addDistinct(map, key, value) {
+    let s = map.get(key);
+    if (!s) {
+        s = new Set();
+        map.set(key, s);
+    }
+    s.add(value);
+}
+// ── FeatureTable ↔ PersistedFeatures projection (Phase 4 consumes) ──
+/**
+ * Project a `FeatureTable` to the JSON-safe `PersistedFeatures`, OMITTING any
+ * entity whose driving column was not requested (so an empty-request table
+ * projects to `{}` and a lean default-run persists no blob). Maps → records;
+ * arrays pass through.
+ */
+export function toPersistedFeatures(table, requested) {
+    const set = new Set(requested);
+    const out = {};
+    if (wantsFunctionGrain(set) && table.function.size > 0) {
+        const record = {};
+        for (const [hash, row] of table.function)
+            record[hash] = row;
+        out.function = record;
+    }
+    if (set.has('packageCoupling')) {
+        if (table.package.size > 0) {
+            const record = {};
+            for (const [name, row] of table.package)
+                record[name] = row;
+            out.package = record;
+        }
+        out.edge = table.edge;
+    }
+    if (set.has('scc'))
+        out.scc = table.scc;
+    return out;
+}
+/** True when no entity is present (or every present entity is empty). */
+export function isPersistedFeaturesEmpty(persisted) {
+    const hasFn = persisted.function !== undefined && Object.keys(persisted.function).length > 0;
+    const hasPkg = persisted.package !== undefined && Object.keys(persisted.package).length > 0;
+    const hasScc = persisted.scc !== undefined && persisted.scc.length > 0;
+    const hasEdge = persisted.edge !== undefined && persisted.edge.length > 0;
+    return !hasFn && !hasPkg && !hasScc && !hasEdge;
+}
+//# sourceMappingURL=features.js.map

package/dist/pipeline/features.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"features.js","sourceRoot":"","sources":["../../src/pipeline/features.ts"],"names":[],"mappings":"AAAA,mNAAmN;AACnN;;;;;;;;;;;;;;;;;GAiBG;AAEH,OAAO,EAAE,MAAM,EAAE,MAAM,mBAAmB,CAAC;AAE3C,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,sBAAsB,CAAC;AACnE,OAAO,EAAE,gBAAgB,EAAE,MAAM,2BAA2B,CAAC;AAkB7D;;;;;GAKG;AACH,MAAM,eAAe,GAAG,CAAC,CAAC;AAE1B,MAAM,cAAc,GAA0C,IAAI,GAAG,EAAE,CAAC;AACxE,MAAM,aAAa,GAAyC,IAAI,GAAG,EAAE,CAAC;AACtE,MAAM,SAAS,GAA2B,EAAE,CAAC;AAC7C,MAAM,UAAU,GAAkC,EAAE,CAAC;AAErD,wDAAwD;AACxD,SAAS,kBAAkB,CAAC,GAA+B;IACzD,OAAO,CACL,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC;QACpB,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC;QAChB,GAAG,CAAC,GAAG,CAAC,oBAAoB,CAAC;QAC7B,GAAG,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAClC,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAC3B,OAAgB,EAChB,OAAgB,EAChB,MAAmB,EACnB,SAAmC;IAEnC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAgB,SAAS,CAAC,CAAC;IAC9C,IAAI,GAAG,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QACnB,OAAO,EAAE,QAAQ,EAAE,cAAc,EAAE,OAAO,EAAE,aAAa,EAAE,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;IAChG,CAAC;IAED,MAAM,EAAE,GAAG,kBAAkB,CAAC,GAAG,CAAC;QAChC,CAAC,CAAC,qBAAqB,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,GAAG,CAAC;QACtD,CAAC,CAAC,cAAc,CAAC;IAEnB,IAAI,GAAG,GAAyC,aAAa,CAAC;IAC9D,IAAI,IAAI,GAAkC,UAAU,CAAC;IACrD,IAAI,GAAG,CAAC,GAAG,CAAC,iBAAiB,CAAC,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,sBAAsB,CAAC,OAAO,CAAC,CAAC;QACjD,GAAG,GAAG,QAAQ,CAAC,OAAO,CAAC;QACvB,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC;IACvB,CAAC;IAED,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAE9D,MAAM,CAAC,IAAI,CAAC;QACV,GAAG,EAAE,+BAA+B;QACpC,MAAM,EAAE,gBAAgB;QACxB,OAAO,EAAE,CAAC,GAAG,GAAG,CAAC;QACjB,SAAS,EAAE,EAAE,CAAC,IAAI;QAClB,QAAQ,EAAE,GAAG,CAAC,IAAI;QAClB,IAAI,EAAE,GAAG,CAAC,MAAM;QAChB,KAAK,EAAE,IAAI,CAAC,MAAM;KACnB,CAAC,CAAC;IAEH,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;AACnD,CAAC;AAED;;;;;GAKG;AACH,SAAS,qBAAqB,CAC5B,OAAgB,EAChB,OAAgB,EAChB,MAAmB,EACnB,GAA+B;IAE/B,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IACnE,MAAM,kBAAkB,GAAG,GAAG,CAAC,GAAG,CAAC,oBAAoB,CAAC;QACtD,CAAC,CAAC,yBAAyB,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,CAAC;QACrD,CAAC,CAAC,SAAS,CAAC;IACd,0EAA0E;IAC1E,MAAM,cAAc,GAAG,GAAG,CAAC,GAAG,CAAC,wBAAwB,CAAC,CAAC;IACzD,MAAM,aAAa,GAAG,cAAc,CAAC,CAAC,CAAC,oBAAoB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC1F,MAAM,aAAa,GAAG,cAAc,CAAC,CAAC,CAAC,oBAAoB,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAEjF,MAAM,GAAG,GAAG,IAAI,GAAG,EAA4B,CAAC;IAChD,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;QAC7C,MAAM,GAAG,GAAsE;YAC7E,SAAS,EAAE,GAAG,CAAC,OAAO,GAAG,GAAG,CAAC,IAAI,GAAG,CAAC;SACtC,CAAC;QACF,IAAI,KAAK;YAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACvC,IAAI,kBAAkB;YAAE,GAAG,CAAC,kBAAkB,GAAG,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9E,IAAI,aAAa,IAAI,aAAa,EAAE,CAAC;YACnC,uEAAuE;YACvE,yEAAyE;YACzE,sEAAsE;YACtE,2CAA2C;YAC3C,GAAG,CAAC,aAAa,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC5C,GAAG,CAAC,sBAAsB,GAAG,wBAAwB,CAAC,IAAI,EAAE,OAAO,EAAE,aAAa,CAAC,CAAC;QACtF,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,GAAuB,CAAC,CAAC;IACzC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;GAIG;AACH,SAAS,wBAAwB,CAC/B,IAAY,EACZ,OAAgB,EAChB,aAAkC;IAElC,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC1C,MAAM,OAAO,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAChD,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACvC,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,UAAU,KAAK,IAAI,CAAC,CAAC;AAC9E,CAAC;AAED,sEAAsE;AAEtE;;;;;GAKG;AACH,SAAS,QAAQ,CAAC,KAAa,EAAE,OAA+C;IAC9E,MAAM,aAAa,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;IAC/C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,CAAC;IACzC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,KAAK,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC;IACvD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAU,CAAC;IACxC,IAAI,QAAQ,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC;IAC9B,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,IAAI,eAAe,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QAC7E,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACxC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,SAAS;gBAClC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACpB,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBAC1B,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC;IAClB,CAAC;IACD,MAAM,MAAM,GAAG,SAAS,CAAC,IAAI,CAAC;IAC9B,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC;IACtC,OAAO,EAAE,MAAM,EAAE,UAAU,EAAE,KAAK,EAAE,MAAM,GAAG,GAAG,GAAG,UAAU,EAAE,CAAC;AAClE,CAAC;AAED,6CAA6C;AAC7C,SAAS,YAAY,CAAC,OAAgB;IACpC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC1C,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC;QAC/C,GAAG,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC;IACrD,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,uEAAuE;AAEvE;;;;GAIG;AACH,SAAS,yBAAyB,CAChC,OAAgB,EAChB,OAAgB,EAChB,MAAmB;IAEnB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,EAAE,IAAI,gBAAgB,CAAC,OAAO,EAAE,OAAO,CAAC;QAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC;IAC5E,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,gBAAgB,IAAI,EAAE;QAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC5D,OAAO,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;AACpC,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,OAAgB,EAAE,OAAgB;IAC9D,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,EAAE,IAAI,gBAAgB,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;QACpD,MAAM,GAAG,GAAG,OAAO,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC;QAChD,oBAAoB;QACpB,IAAI,CAAC,GAAG;YAAE,SAAS;QACnB,IAAI,GAAG,CAAC,UAAU;YAAE,SAAS;QAC7B,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,CAAC,CAAC;IACzB,CAAC;IACD,OAAO,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;AACpC,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,oBAAoB,CAAC,OAAgB;IAC5C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;QAC7C,IAAI,GAAG,CAAC,UAAU;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,UAAU,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;AACpC,CAAC;AAED,gEAAgE;AAChE,SAAS,UAAU,CAAC,KAA0B,EAAE,OAAgB;IAC9D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,CAAC,GAAG,KAAK,CAAC,CAAC;IACnC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,EAAE,CAAC;QAC1B,oBAAoB;QACpB,IAAI,GAAG,KAAK,SAAS,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QACpD,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACjB,KAAK,MAAM,CAAC,IAAI,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC;YAC/C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AA8BD;;;;;GAKG;AACH,SAAS,aAAa,CAAC,OAAgB;IACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAA8B,CAAC;IACtD,MAAM,GAAG,GAAG,IAAI,GAAG,EAA6B,CAAC;IACjD,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,iBAAiB,CAAC,MAAM,EAAE,EAAE,CAAC;QACtD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;YACtB,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;YACrB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;YACpC,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;gBACjC,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,EAAE,EAAE,CAAC;oBACjC,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;oBACnD,IAAI,MAAM;wBAAE,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3C,CAAC;YACH,CAAC;YACD,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,EAAE,CAAC;AACtD,CAAC;AAED;;;;;;;;;;;;;GAaG;AACH,uFAAuF;AACvF,MAAM,UAAU,WAAW,CAAC,OAAgB;IAC1C,MAAM,KAAK,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;IACrC,MAAM,MAAM,GAAkB,EAAE,CAAC;IACjC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,MAAM,GAAG,GAAG,CAAC,CAAS,EAAqB,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IAErE,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,SAAS;QAC/B,MAAM,IAAI,GAAkB,CAAC,EAAE,CAAC,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAClD,OAAO,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC;YAC3B,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;YAClB,IAAI,KAAK,CAAC,EAAE,KAAK,CAAC,EAAE,CAAC;gBACnB,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;gBACxB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;gBAC1B,SAAS,EAAE,CAAC;gBACZ,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBACd,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACjB,CAAC;YACD,MAAM,IAAI,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;YACpB,IAAI,SAAS,GAAG,KAAK,CAAC;YACtB,OAAO,KAAK,CAAC,EAAE,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;gBAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC3B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClB,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;oBAC3B,SAAS,GAAG,IAAI,CAAC;oBACjB,MAAM;gBACR,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAC1B,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC;oBACzB,IAAI,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE;wBAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBAC/C,CAAC;YACH,CAAC;YACD,IAAI,SAAS;gBAAE,SAAS;YACxB,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpC,MAAM,OAAO,GAAa,EAAE,CAAC;gBAC7B,SAAS,CAAC;oBACR,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;oBACvB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;oBAClB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;oBAChB,IAAI,CAAC,KAAK,CAAC;wBAAE,MAAM;gBACrB,CAAC;gBACD,OAAO,CAAC,IAAI,EAAE,CAAC;gBACf,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;YACrD,CAAC;YACD,IAAI,CAAC,GAAG,EAAE,CAAC;YACX,IAAI,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACpB,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;gBAC9B,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,CAAC;oBAC3C,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,4DAA4D;AAC5D,SAAS,aAAa,CACpB,OAA0B,EAC1B,OAAgD;IAEhD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC5B,IAAI,GAAG;YAAE,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,OAAO;QACL,EAAE,EAAE,OAAO,OAAO,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE;QAC7B,OAAO;QACP,OAAO,EAAE,OAAO,CAAC,MAAM;QACvB,eAAe,EAAE,QAAQ,CAAC,IAAI,GAAG,CAAC;KACnC,CAAC;AACJ,CAAC;AAED,qEAAqE;AACrE,yEAAyE;AAEzE;;;;;;;;GAQG;AACH,uGAAuG;AACvG,SAAS,sBAAsB,CAAC,OAAgB;IAI9C,MAAM,MAAM,GAAG,IAAI,GAAG,EAA+B,CAAC;IACtD,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;QAC9C,kFAAkF;QAClF,0EAA0E;QAC1E,wEAAwE;QACxE,wEAAwE;QACxE,6EAA6E;QAC7E,oEAAoE;QACpE,oBAAoB;QACpB,IAAI,GAAG,CAAC,UAAU;YAAE,SAAS;QAC7B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QAC7B,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YACjC,KAAK,MAAM,MAAM,IAAI,QAAQ,CAAC,EAAE,EAAE,CAAC;gBACjC,MAAM,MAAM,GAAG,aAAa,CAAC,MAAM,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;gBACnD,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,UAAU;oBAAE,SAAS;gBAC3C,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;gBAChC,IAAI,GAAG,GAAG,MAAM,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBAChC,IAAI,CAAC,GAAG,EAAE,CAAC;oBACT,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;oBAChC,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC;gBAC7B,CAAC;gBACD,GAAG,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpD,CAAC;QACH,CAAC;IACH,CAAC;IAED,gEAAgE;IAChE,MAAM,IAAI,GAAyB,EAAE,CAAC;IACtC,KAAK,MAAM,CAAC,aAAa,EAAE,GAAG,CAAC,IAAI,MAAM,EAAE,CAAC;QAC1C,KAAK,MAAM,CAAC,aAAa,EAAE,KAAK,CAAC,IAAI,GAAG,EAAE,CAAC;YACzC,IAAI,CAAC,IAAI,CAAC,EAAE,aAAa,EAAE,aAAa,EAAE,KAAK,EAAE,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IACD,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACjB,MAAM,CAAC,GAAG,CAAC,CAAC,aAAa,KAAK,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QAClF,MAAM,CAAC,GAAG,CAAC,CAAC,aAAa,KAAK,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC;QAClF,OAAO,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACvC,CAAC,CAAC,CAAC;IAEH,mEAAmE;IACnE,wEAAwE;IACxE,0DAA0D;IAC1D,MAAM,WAAW,GAAG,IAAI,GAAG,EAAuB,CAAC;IACnD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAuB,CAAC;IAClD,KAAK,MAAM,EAAE,aAAa,EAAE,aAAa,EAAE,IAAI,IAAI,EAAE,CAAC;QACpD,WAAW,CAAC,WAAW,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;QACvD,WAAW,CAAC,UAAU,EAAE,aAAa,EAAE,aAAa,CAAC,CAAC;IACxD,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAA2B,CAAC;IAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,GAAG,WAAW,CAAC,IAAI,EAAE,EAAE,GAAG,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAC/E,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE;YACZ,WAAW,EAAE,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC;YAC7C,UAAU,EAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC;SAC5C,CAAC,CAAC;IACL,CAAC;IACD,OAAO,EAAE,OAAO,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC;AAChC,CAAC;AAED,SAAS,WAAW,CAAC,GAA6B,EAAE,GAAW,EAAE,KAAa;IAC5E,IAAI,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACrB,IAAI,CAAC,CAAC,EAAE,CAAC;QACP,CAAC,GAAG,IAAI,GAAG,EAAU,CAAC;QACtB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAClB,CAAC;IACD,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;AACf,CAAC;AAED,uEAAuE;AAEvE;;;;;GAKG;AACH,MAAM,UAAU,mBAAmB,CACjC,KAAmB,EACnB,SAAmC;IAEnC,MAAM,GAAG,GAAG,IAAI,GAAG,CAAgB,SAAS,CAAC,CAAC;IAC9C,MAAM,GAAG,GAEL,EAAE,CAAC;IACP,IAAI,kBAAkB,CAAC,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACvD,MAAM,MAAM,GAA8C,EAAE,CAAC;QAC7D,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,KAAK,CAAC,QAAQ;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;QAC7D,GAAG,CAAC,QAAQ,GAAG,MAAM,CAAC;IACxB,CAAC;IACD,IAAI,GAAG,CAAC,GAAG,CAAC,iBAAiB,CAAC,EAAE,CAAC;QAC/B,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC3B,MAAM,MAAM,GAAoC,EAAE,CAAC;YACnD,KAAK,MAAM,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,KAAK,CAAC,OAAO;gBAAE,MAAM,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC;YAC5D,GAAG,CAAC,OAAO,GAAG,MAAM,CAAC;QACvB,CAAC;QACD,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC;IACxB,CAAC;IACD,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,GAAG,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC;IACxC,OAAO,GAAG,CAAC;AACb,CAAC;AAED,yEAAyE;AACzE,MAAM,UAAU,wBAAwB,CAAC,SAA4B;IACnE,MAAM,KAAK,GAAG,SAAS,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAC7F,MAAM,MAAM,GAAG,SAAS,CAAC,OAAO,KAAK,SAAS,IAAI,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;IAC5F,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,KAAK,SAAS,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,GAAG,CAAC,CAAC;IACvE,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,KAAK,SAAS,IAAI,SAAS,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1E,OAAO,CAAC,KAAK,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,IAAI,CAAC,OAAO,CAAC;AAClD,CAAC"}

package/dist/pipeline/indexes.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Stage 3 — Index build.
+ *
+ * Pure linear scans over the catalog. No TS, no AST, no filesystem.
+ * Data → data.
+ */
+import type { Catalog, FunctionOccurrence, Indexes } from '../types.js';
+/** The content-keyed maps a single linear scan of the catalog produces. */
+export interface HashMaps {
+    readonly byBodyHash: Map<string, FunctionOccurrence>;
+    readonly occurrencesByHash: Map<string, FunctionOccurrence[]>;
+    readonly bySimpleName: Map<string, string[]>;
+    /** `${filePath}:${line}:${column}` → occurrence (package-unique node id). */
+    readonly byOccId: Map<string, FunctionOccurrence>;
+}
+/**
+ * One linear pass over `catalog.functions` producing the content-keyed maps:
+ * `byBodyHash` (last-writer-wins, content-dedup), `occurrencesByHash` (all
+ * occurrences per hash — collision-preserving), `bySimpleName`, and `byOccId`
+ * (per-occurrence location id — the SCC/cycle node identity). Shared by
+ * `buildIndexes` and the cross-package edge-constraint pass so both derive
+ * package identity from the same scan.
+ */
+export declare function buildHashMaps(catalog: Catalog): HashMaps;
+/** Builds query-side indexes (by-body-hash, by-occ-id, by-simple-name, adjacency) over the catalog. */
+export declare function buildIndexes(catalog: Catalog): Indexes;
+//# sourceMappingURL=indexes.d.ts.map

package/dist/pipeline/indexes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"indexes.d.ts","sourceRoot":"","sources":["../../src/pipeline/indexes.ts"],"names":[],"mappings":"AACA;;;;;GAKG;AAMH,OAAO,KAAK,EAAE,OAAO,EAAE,kBAAkB,EAAE,OAAO,EAAE,MAAM,aAAa,CAAC;AAExE,2EAA2E;AAC3E,MAAM,WAAW,QAAQ;IACvB,QAAQ,CAAC,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC;IACrD,QAAQ,CAAC,iBAAiB,EAAE,GAAG,CAAC,MAAM,EAAE,kBAAkB,EAAE,CAAC,CAAC;IAC9D,QAAQ,CAAC,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;IAC7C,6EAA6E;IAC7E,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC,CAAC;CACnD;AAED;;;;;;;GAOG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE,OAAO,GAAG,QAAQ,CAWxD;AAED,uGAAuG;AACvG,wBAAgB,YAAY,CAAC,OAAO,EAAE,OAAO,GAAG,OAAO,CA4BtD"}

package/dist/pipeline/indexes.js

@@ -0,0 +1,159 @@
+// @fitness-ignore-file batch-operation-limits -- pure in-memory linear scans over the already-materialized catalog (bounded by repo size); the for-of loops build data→data indexes, with no DB/IO/unbounded-async to batch or paginate.
+/**
+ * Stage 3 — Index build.
+ *
+ * Pure linear scans over the catalog. No TS, no AST, no filesystem.
+ * Data → data.
+ */
+import { logger, withSpan } from '@opensip-cli/core';
+import { occId, pkgOf } from '../resolve-callee.js';
+/**
+ * One linear pass over `catalog.functions` producing the content-keyed maps:
+ * `byBodyHash` (last-writer-wins, content-dedup), `occurrencesByHash` (all
+ * occurrences per hash — collision-preserving), `bySimpleName`, and `byOccId`
+ * (per-occurrence location id — the SCC/cycle node identity). Shared by
+ * `buildIndexes` and the cross-package edge-constraint pass so both derive
+ * package identity from the same scan.
+ */
+export function buildHashMaps(catalog) {
+    const maps = {
+        byBodyHash: new Map(),
+        occurrencesByHash: new Map(),
+        bySimpleName: new Map(),
+        byOccId: new Map(),
+    };
+    for (const name of Object.keys(catalog.functions)) {
+        indexNameBucket(catalog, name, maps);
+    }
+    return maps;
+}
+/** Builds query-side indexes (by-body-hash, by-occ-id, by-simple-name, adjacency) over the catalog. */
+export function buildIndexes(catalog) {
+    return withSpan('opensip-cli-graph', 'graph.indexes', () => {
+        const { byBodyHash, occurrencesByHash, bySimpleName, byOccId } = buildHashMaps(catalog);
+        const { callees, callers } = buildAdjacency(occurrencesByHash, byBodyHash);
+        const importedPackagesByFile = buildImportedPackagesByFile(occurrencesByHash, byBodyHash);
+        logger.info({
+            evt: 'graph.indexes.build.complete',
+            module: 'graph:indexes',
+            nodes: byBodyHash.size,
+            edges: [...callees.values()].reduce((n, arr) => n + arr.length, 0),
+        });
+        return {
+            byBodyHash,
+            byOccId,
+            occurrencesByHash,
+            importedPackagesByFile,
+            bySimpleName,
+            callees,
+            callers,
+        };
+    }, { 'graph.indexes.nodes': /* approximate */ 0 });
+}
+/**
+ * filePath → set of package groups it imports. Reads each file's module-init
+ * `dependencies[]` (the resolved import targets) and maps each to its
+ * package via `packageOf`. Files without resolved imports (and all files in
+ * `fast` mode, which has no `dependencies[]`) get no entry.
+ */
+function buildImportedPackagesByFile(occurrencesByHash, byBodyHash) {
+    const out = new Map();
+    for (const occs of occurrencesByHash.values()) {
+        for (const occ of occs) {
+            const pkgs = importedPackagesOf(occ, byBodyHash);
+            if (pkgs.size > 0)
+                unionInto(out, occ.filePath, pkgs);
+        }
+    }
+    return out;
+}
+/** Package groups one module-init occurrence imports (resolved via byBodyHash). */
+function importedPackagesOf(occ, byBodyHash) {
+    const set = new Set();
+    for (const dep of occ.dependencies ?? []) {
+        for (const targetHash of dep.to) {
+            const target = byBodyHash.get(targetHash);
+            if (target)
+                set.add(pkgOf(target));
+        }
+    }
+    return set;
+}
+function unionInto(map, key, values) {
+    let set = map.get(key);
+    if (!set) {
+        set = new Set();
+        map.set(key, set);
+    }
+    for (const v of values)
+        set.add(v);
+}
+function indexNameBucket(catalog, name, maps) {
+    const occs = catalog.functions[name];
+    /* v8 ignore next */
+    if (!occs)
+        return;
+    for (const o of occs) {
+        maps.byBodyHash.set(o.bodyHash, o);
+        pushTo(maps.occurrencesByHash, o.bodyHash, o);
+        pushTo(maps.bySimpleName, name, o.bodyHash);
+        maps.byOccId.set(occId(o), o);
+    }
+}
+/** Append `value` to the array stored at `key`, creating it if absent. */
+function pushTo(map, key, value) {
+    let arr = map.get(key);
+    if (!arr) {
+        arr = [];
+        map.set(key, arr);
+    }
+    arr.push(value);
+}
+/**
+ * Build the callees/callers adjacency, **twin-aware** (ADR-0003): a body hash's
+ * out-edges are the UNION of every occurrence sharing that hash, deduplicated to
+ * distinct neighbors. Iterating `byBodyHash` winners instead (last-writer-wins)
+ * would erase losing body-twins' out-edges from the graph — which made
+ * reachability rules (`orphan-subtree`, `test-only-reachable`) report false
+ * orphans for any function reached only through a twin that lost the slot.
+ */
+function buildAdjacency(occurrencesByHash, byBodyHash) {
+    const callees = new Map();
+    const callerSets = new Map();
+    for (const [ownerHash, occs] of occurrencesByHash) {
+        const out = collectOutgoing(occs, byBodyHash);
+        if (out.size === 0)
+            continue;
+        callees.set(ownerHash, [...out]);
+        for (const target of out)
+            pushCaller(callerSets, target, ownerHash);
+    }
+    const callers = new Map();
+    for (const [target, owners] of callerSets)
+        callers.set(target, [...owners]);
+    return { callees, callers };
+}
+/** Distinct in-catalog call targets across every occurrence sharing a body hash. */
+function collectOutgoing(occs, byBodyHash) {
+    const out = new Set();
+    for (const occ of occs) {
+        for (const edge of occ.calls) {
+            for (const target of edge.to) {
+                /* v8 ignore next */
+                if (!byBodyHash.has(target))
+                    continue;
+                out.add(target);
+            }
+        }
+    }
+    return out;
+}
+function pushCaller(callers, target, caller) {
+    let inb = callers.get(target);
+    if (!inb) {
+        inb = new Set();
+        callers.set(target, inb);
+    }
+    inb.add(caller);
+}
+//# sourceMappingURL=indexes.js.map