codesift-mcp 0.9.0 → 0.9.10

package/dist/tools/react-component-tree-tools.js

@@ -0,0 +1,292 @@
+/**
+ * React component tree analysis helpers.
+ */
+import { getCodeIndex } from "./index-tools.js";
+import { isTestFileStrict as isTestFile } from "../utils/test-file.js";
+import { resolveAlias } from "../utils/react-alias.js";
+// ── Limits (mirror graph-tools.ts) ──────────────────────────
+const MAX_TREE_NODES = 500;
+const MAX_CHILDREN_PER_NODE = 20;
+const DEFAULT_DEPTH = 3;
+/**
+ * Extract PascalCase JSX element names from source code.
+ * Returns the set of component names used via `<ComponentName ...>` or `<ComponentName/>`.
+ * HTML elements (lowercase) are skipped.
+ */
+function extractJsxComponents(source) {
+    const names = new Set();
+    const pattern = /<([A-Z][a-zA-Z0-9_$]*)\b/g;
+    let m;
+    while ((m = pattern.exec(source)) !== null) {
+        names.add(m[1]);
+    }
+    return names;
+}
+/**
+ * Build component → rendered-components adjacency from the index.
+ * Only considers symbols with kind "component" (requires Wave 1 extractor).
+ */
+function buildJsxAdjacency(symbols) {
+    const children = new Map();
+    // name → component symbols lookup (may have multiple definitions with same name)
+    const nameToComponents = new Map();
+    // file → component symbols lookup (used by alias-resolved imports)
+    const fileToComponents = new Map();
+    for (const sym of symbols) {
+        if (sym.kind !== "component")
+            continue;
+        const existing = nameToComponents.get(sym.name);
+        if (existing)
+            existing.push(sym);
+        else
+            nameToComponents.set(sym.name, [sym]);
+        const fileExisting = fileToComponents.get(sym.file);
+        if (fileExisting)
+            fileExisting.push(sym);
+        else
+            fileToComponents.set(sym.file, [sym]);
+    }
+    // Build a synthetic files list for resolveAlias() — needs only `path` field.
+    const filesList = [...fileToComponents.keys()].map((path) => ({ path }));
+    for (const sym of symbols) {
+        if (sym.kind !== "component" || !sym.source)
+            continue;
+        const rendered = extractJsxComponents(sym.source);
+        const childList = [];
+        // Parse alias imports in this component's source for fallback resolution
+        // (Tier 4 — Item 8 wired into trace_component_tree).
+        // Pattern: import { X, Y as Z } from "@/components/Button"
+        // Pattern: import Default from "@/components/Foo"
+        const aliasImports = new Map(); // localName → resolved file
+        const importRe = /import\s+(?:(\w+)|(?:\{([^}]+)\}))(?:\s*,\s*(?:(\w+)|(?:\{([^}]+)\})))?\s+from\s+["'](@\/[^"']+)["']/g;
+        let im;
+        while ((im = importRe.exec(sym.source)) !== null) {
+            const aliasPath = im[5];
+            const resolved = resolveAlias(aliasPath, filesList);
+            if (!resolved)
+                continue;
+            // default import
+            if (im[1])
+                aliasImports.set(im[1], resolved);
+            if (im[3])
+                aliasImports.set(im[3], resolved);
+            // named imports {A, B as C}
+            const namedGroup = im[2] ?? im[4];
+            if (namedGroup) {
+                for (const part of namedGroup.split(",")) {
+                    const trimmed = part.trim();
+                    // Handle "X as Y" → local name is Y
+                    const asMatch = trimmed.match(/^(\w+)\s+as\s+(\w+)$/);
+                    const localName = asMatch ? asMatch[2] : trimmed.replace(/\s.*$/, "");
+                    if (localName)
+                        aliasImports.set(localName, resolved);
+                }
+            }
+        }
+        for (const name of rendered) {
+            if (name === sym.name)
+                continue; // skip self-reference
+            const targets = nameToComponents.get(name);
+            if (targets) {
+                for (const target of targets) {
+                    if (target.id !== sym.id)
+                        childList.push(target);
+                }
+                continue;
+            }
+            // Fallback: alias-resolved import lookup
+            const aliasTargetFile = aliasImports.get(name);
+            if (aliasTargetFile) {
+                const fileTargets = fileToComponents.get(aliasTargetFile) ?? [];
+                for (const target of fileTargets) {
+                    if (target.id !== sym.id)
+                        childList.push(target);
+                }
+            }
+        }
+        if (childList.length > 0)
+            children.set(sym.id, childList);
+    }
+    return { children };
+}
+// ─────────────────────────────────────────────────────────────
+// Tier 5 — prop_chain_depth metric helpers
+// ─────────────────────────────────────────────────────────────
+/**
+ * Invert JsxAdjacency to a reverse adjacency: child id → sorted list of parent ids.
+ *
+ * Used by computePropChainDepth to walk UP the render tree (from a leaf back toward
+ * roots) and measure render-tree depth. Sorts each parent list alphabetically for
+ * deterministic output on cyclic graphs.
+ */
+function buildReverseAdjacency(adjacency) {
+    const parents = new Map();
+    for (const [parentId, children] of adjacency.children) {
+        for (const child of children) {
+            const list = parents.get(child.id) ?? [];
+            list.push(parentId);
+            parents.set(child.id, list);
+        }
+    }
+    // Sort each parent list alphabetically for determinism on cyclic graphs
+    for (const [k, v] of parents)
+        parents.set(k, [...v].sort());
+    return parents;
+}
+/**
+ * Compute the longest path (in edges) from componentId UP to the deepest root in
+ * the reverse JSX adjacency. This is render-tree depth — NOT prop-flow depth.
+ *
+ * Iterative implementation using an explicit 2-phase ("enter"/"exit") stack to
+ * avoid recursive blowup on deep linear chains (V8 stack ~10-15K frames).
+ *
+ * Uses shared `memo` and `inProgress` across all calls in one analyzeRenders run
+ * to amortize cost to O(V+E) total.
+ */
+function computePropChainDepth(componentId, reverseAdjacency, memo, inProgress) {
+    if (memo.has(componentId))
+        return memo.get(componentId);
+    if (inProgress.has(componentId))
+        return 0;
+    const stack = [{ node: componentId, phase: "enter" }];
+    while (stack.length > 0) {
+        const f = stack[stack.length - 1];
+        if (f.phase === "enter") {
+            if (memo.has(f.node)) {
+                stack.pop();
+                continue;
+            }
+            if (inProgress.has(f.node)) {
+                stack.pop();
+                continue;
+            }
+            inProgress.add(f.node);
+            f.phase = "exit";
+            for (const p of reverseAdjacency.get(f.node) ?? []) {
+                if (!memo.has(p) && !inProgress.has(p)) {
+                    stack.push({ node: p, phase: "enter" });
+                }
+            }
+        }
+        else {
+            // exit phase — exclude back-edges (parents still in inProgress closing a
+            // cycle) so a strongly-connected component with no real root reports
+            // depth 0 instead of inflating linearly with cycle-traversal order.
+            const parents = reverseAdjacency.get(f.node) ?? [];
+            let maxParentDepth = -1;
+            let nonCyclicParents = 0;
+            for (const p of parents) {
+                if (inProgress.has(p))
+                    continue; // back-edge — exclude from depth
+                nonCyclicParents++;
+                const d = memo.get(p) ?? 0;
+                if (d > maxParentDepth)
+                    maxParentDepth = d;
+            }
+            const depth = nonCyclicParents === 0 ? 0 : maxParentDepth + 1;
+            memo.set(f.node, depth);
+            inProgress.delete(f.node);
+            stack.pop();
+        }
+    }
+    return memo.get(componentId);
+}
+/**
+ * BFS the component composition tree from a root component.
+ * Returns a CallNode tree of rendered components up to maxDepth.
+ */
+function buildComponentTree(root, adjacency, maxDepth) {
+    const visited = new Set([root.id]);
+    let totalNodes = 1;
+    function expand(symbol, depth) {
+        if (depth >= maxDepth || totalNodes >= MAX_TREE_NODES) {
+            return { symbol, children: [] };
+        }
+        const kids = adjacency.children.get(symbol.id) ?? [];
+        const out = [];
+        for (const kid of kids) {
+            if (totalNodes >= MAX_TREE_NODES)
+                break;
+            if (out.length >= MAX_CHILDREN_PER_NODE)
+                break;
+            if (visited.has(kid.id))
+                continue;
+            visited.add(kid.id);
+            totalNodes++;
+            out.push(expand(kid, depth + 1));
+        }
+        return { symbol, children: out };
+    }
+    return expand(root, 0);
+}
+function stripSource(sym) {
+    const { source: _, repo: _r, tokens: _t, start_col: _sc, end_col: _ec, id, ...rest } = sym;
+    const shortId = id.includes(":") ? id.slice(id.indexOf(":") + 1) : id;
+    return { ...rest, id: shortId };
+}
+function stripTreeSource(node) {
+    return {
+        symbol: stripSource(node.symbol),
+        children: node.children.map(stripTreeSource),
+    };
+}
+function treeToMermaid(tree, rootName) {
+    const lines = ["graph TD"];
+    const visited = new Set();
+    function nodeId(sym) {
+        return sym.id.replace(/[^a-zA-Z0-9_]/g, "_");
+    }
+    function nodeLabel(sym) {
+        const shortFile = sym.file.split("/").pop() ?? sym.file;
+        return `${sym.name}<br/><small>${shortFile}:${sym.start_line}</small>`;
+    }
+    function walk(node, parentId) {
+        const id = nodeId(node.symbol);
+        if (!visited.has(id)) {
+            visited.add(id);
+            lines.push(`  ${id}["${nodeLabel(node.symbol)}"]`);
+        }
+        if (parentId) {
+            lines.push(`  ${parentId} --> ${id}`);
+        }
+        for (const child of node.children) {
+            walk(child, id);
+        }
+    }
+    walk(tree);
+    lines.push(`  %% root: ${rootName}`);
+    return lines.join("\n");
+}
+/**
+ * Trace the React component composition tree from a root component.
+ * Returns a tree of JSX children (which components the root renders,
+ * and recursively their children).
+ */
+export async function traceComponentTree(repo, rootComponent, options) {
+    const index = await getCodeIndex(repo);
+    if (!index) {
+        throw new Error(`Repository not found: ${repo}`);
+    }
+    const maxDepth = options?.depth ?? DEFAULT_DEPTH;
+    const outputFormat = options?.output_format ?? "json";
+    const includeSource = options?.include_source ?? false;
+    const includeTests = options?.include_tests ?? false;
+    const symbols = includeTests
+        ? index.symbols
+        : index.symbols.filter((s) => !isTestFile(s.file));
+    // Find root component
+    const candidates = symbols.filter((s) => s.name === rootComponent && s.kind === "component");
+    const target = candidates[0];
+    if (!target) {
+        throw new Error(`Component "${rootComponent}" not found in repository "${repo}". ` +
+            `Make sure it has kind: "component" — index may need refresh.`);
+    }
+    const adjacency = buildJsxAdjacency(symbols);
+    const tree = buildComponentTree(target, adjacency, maxDepth);
+    if (outputFormat === "mermaid") {
+        return { mermaid: treeToMermaid(tree, rootComponent), root: rootComponent, depth: maxDepth };
+    }
+    return includeSource ? tree : stripTreeSource(tree);
+}
+export { buildJsxAdjacency, buildComponentTree, extractJsxComponents, buildReverseAdjacency, computePropChainDepth };
+//# sourceMappingURL=react-component-tree-tools.js.map

package/dist/tools/react-component-tree-tools.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"react-component-tree-tools.js","sourceRoot":"","sources":["../../src/tools/react-component-tree-tools.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,gBAAgB,IAAI,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACvE,OAAO,EAAE,YAAY,EAAE,MAAM,yBAAyB,CAAC;AAGvD,+DAA+D;AAC/D,MAAM,cAAc,GAAG,GAAG,CAAC;AAC3B,MAAM,qBAAqB,GAAG,EAAE,CAAC;AACjC,MAAM,aAAa,GAAG,CAAC,CAAC;AAUxB;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,MAAc;IAC1C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,OAAO,GAAG,2BAA2B,CAAC;IAC5C,IAAI,CAAyB,CAAC;IAC9B,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAC3C,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,OAAqB;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAwB,CAAC;IAEjD,iFAAiF;IACjF,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAwB,CAAC;IACzD,mEAAmE;IACnE,MAAM,gBAAgB,GAAG,IAAI,GAAG,EAAwB,CAAC;IACzD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW;YAAE,SAAS;QACvC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChD,IAAI,QAAQ;YAAE,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;YAC5B,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,YAAY,GAAG,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACpD,IAAI,YAAY;YAAE,YAAY,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;;YACpC,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED,6EAA6E;IAC7E,MAAM,SAAS,GAAG,CAAC,GAAG,gBAAgB,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAEzE,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,GAAG,CAAC,MAAM;YAAE,SAAS;QAEtD,MAAM,QAAQ,GAAG,oBAAoB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAClD,MAAM,SAAS,GAAiB,EAAE,CAAC;QAEnC,yEAAyE;QACzE,qDAAqD;QACrD,2DAA2D;QAC3D,kDAAkD;QAClD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,4BAA4B;QAC5E,MAAM,QAAQ,GAAG,uGAAuG,CAAC;QACzH,IAAI,EAA0B,CAAC;QAC/B,OAAO,CAAC,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YACjD,MAAM,SAAS,GAAG,EAAE,CAAC,CAAC,CAAE,CAAC;YACzB,MAAM,QAAQ,GAAG,YAAY,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;YACpD,IAAI,CAAC,QAAQ;gBAAE,SAAS;YACxB,iBAAiB;YACjB,IAAI,EAAE,CAAC,CAAC,CAAC;gBAAE,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC7C,IAAI,EAAE,CAAC,CAAC,CAAC;gBAAE,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC;YAC7C,4BAA4B;YAC5B,MAAM,UAAU,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;YAClC,IAAI,UAAU,EAAE,CAAC;gBACf,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;oBACzC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;oBAC5B,oCAAoC;oBACpC,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,sBAAsB,CAAC,CAAC;oBACtD,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;oBACvE,IAAI,SAAS;wBAAE,YAAY,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;gBACvD,CAAC;YACH,CAAC;QACH,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI;gBAAE,SAAS,CAAC,sBAAsB;YACvD,MAAM,OAAO,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3C,IAAI,OAAO,EAAE,CAAC;gBACZ,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;oBAC7B,IAAI,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE;wBAAE,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACnD,CAAC;gBACD,SAAS;YACX,CAAC;YACD,yCAAyC;YACzC,MAAM,eAAe,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC/C,IAAI,eAAe,EAAE,CAAC;gBACpB,MAAM,WAAW,GAAG,gBAAgB,CAAC,GAAG,CAAC,eAAe,CAAC,IAAI,EAAE,CAAC;gBAChE,KAAK,MAAM,MAAM,IAAI,WAAW,EAAE,CAAC;oBACjC,IAAI,MAAM,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE;wBAAE,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;gBACnD,CAAC;YACH,CAAC;QACH,CAAC;QACD,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC;YAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;IAC5D,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,CAAC;AACtB,CAAC;AAED,gEAAgE;AAChE,2CAA2C;AAC3C,gEAAgE;AAEhE;;;;;;GAMG;AACH,SAAS,qBAAqB,CAAC,SAAuB;IACpD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,KAAK,MAAM,CAAC,QAAQ,EAAE,QAAQ,CAAC,IAAI,SAAS,CAAC,QAAQ,EAAE,CAAC;QACtD,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YACzC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACpB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IACD,wEAAwE;IACxE,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,OAAO;QAAE,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAC5D,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;;;;GASG;AACH,SAAS,qBAAqB,CAC5B,WAAmB,EACnB,gBAAuC,EACvC,IAAyB,EACzB,UAAuB;IAEvB,IAAI,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC;QAAE,OAAO,IAAI,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC;IACzD,IAAI,UAAU,CAAC,GAAG,CAAC,WAAW,CAAC;QAAE,OAAO,CAAC,CAAC;IAG1C,MAAM,KAAK,GAAY,CAAC,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;IAE/D,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;QACnC,IAAI,CAAC,CAAC,KAAK,KAAK,OAAO,EAAE,CAAC;YACxB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAC,KAAK,CAAC,GAAG,EAAE,CAAC;gBAAC,SAAS;YAAC,CAAC;YAChD,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBAAC,KAAK,CAAC,GAAG,EAAE,CAAC;gBAAC,SAAS;YAAC,CAAC;YACtD,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC,CAAC,KAAK,GAAG,MAAM,CAAC;YACjB,KAAK,MAAM,CAAC,IAAI,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBACnD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBACvC,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;gBAC1C,CAAC;YACH,CAAC;QACH,CAAC;aAAM,CAAC;YACN,yEAAyE;YACzE,qEAAqE;YACrE,oEAAoE;YACpE,MAAM,OAAO,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACnD,IAAI,cAAc,GAAG,CAAC,CAAC,CAAC;YACxB,IAAI,gBAAgB,GAAG,CAAC,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;gBACxB,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;oBAAE,SAAS,CAAC,iCAAiC;gBAClE,gBAAgB,EAAE,CAAC;gBACnB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC3B,IAAI,CAAC,GAAG,cAAc;oBAAE,cAAc,GAAG,CAAC,CAAC;YAC7C,CAAC;YACD,MAAM,KAAK,GAAG,gBAAgB,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC;YAC9D,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YACxB,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC1B,KAAK,CAAC,GAAG,EAAE,CAAC;QACd,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAC,GAAG,CAAC,WAAW,CAAE,CAAC;AAChC,CAAC;AAED;;;GAGG;AACH,SAAS,kBAAkB,CACzB,IAAgB,EAChB,SAAuB,EACvB,QAAgB;IAEhB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3C,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,SAAS,MAAM,CAAC,MAAkB,EAAE,KAAa;QAC/C,IAAI,KAAK,IAAI,QAAQ,IAAI,UAAU,IAAI,cAAc,EAAE,CAAC;YACtD,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;QAClC,CAAC;QACD,MAAM,IAAI,GAAG,SAAS,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QACrD,MAAM,GAAG,GAAe,EAAE,CAAC;QAC3B,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,IAAI,UAAU,IAAI,cAAc;gBAAE,MAAM;YACxC,IAAI,GAAG,CAAC,MAAM,IAAI,qBAAqB;gBAAE,MAAM;YAC/C,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAClC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACpB,UAAU,EAAE,CAAC;YACb,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;QACD,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,EAAE,CAAC;IACnC,CAAC;IAED,OAAO,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACzB,CAAC;AAED,SAAS,WAAW,CAAC,GAAe;IAClC,MAAM,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,IAAI,EAAE,GAAG,GAAG,CAAC;IAC3F,MAAM,OAAO,GAAG,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IACtE,OAAO,EAAE,GAAG,IAAI,EAAE,EAAE,EAAE,OAAO,EAAgB,CAAC;AAChD,CAAC;AAED,SAAS,eAAe,CAAC,IAAc;IACrC,OAAO;QACL,MAAM,EAAE,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC;QAChC,QAAQ,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,eAAe,CAAC;KAC7C,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,IAAc,EAAE,QAAgB;IACrD,MAAM,KAAK,GAAa,CAAC,UAAU,CAAC,CAAC;IACrC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,SAAS,MAAM,CAAC,GAAe;QAC7B,OAAO,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,gBAAgB,EAAE,GAAG,CAAC,CAAC;IAC/C,CAAC;IACD,SAAS,SAAS,CAAC,GAAe;QAChC,MAAM,SAAS,GAAG,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,GAAG,CAAC,IAAI,CAAC;QACxD,OAAO,GAAG,GAAG,CAAC,IAAI,eAAe,SAAS,IAAI,GAAG,CAAC,UAAU,UAAU,CAAC;IACzE,CAAC;IAED,SAAS,IAAI,CAAC,IAAc,EAAE,QAAiB;QAC7C,MAAM,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACrB,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAChB,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACrD,CAAC;QACD,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,CAAC,IAAI,CAAC,KAAK,QAAQ,QAAQ,EAAE,EAAE,CAAC,CAAC;QACxC,CAAC;QACD,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;QAClB,CAAC;IACH,CAAC;IAED,IAAI,CAAC,IAAI,CAAC,CAAC;IACX,KAAK,CAAC,IAAI,CAAC,cAAc,QAAQ,EAAE,CAAC,CAAC;IACrC,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC;AASD;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,kBAAkB,CACtC,IAAY,EACZ,aAAqB,EACrB,OAAmC;IAEnC,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CAAC,yBAAyB,IAAI,EAAE,CAAC,CAAC;IACnD,CAAC;IAED,MAAM,QAAQ,GAAG,OAAO,EAAE,KAAK,IAAI,aAAa,CAAC;IACjD,MAAM,YAAY,GAAG,OAAO,EAAE,aAAa,IAAI,MAAM,CAAC;IACtD,MAAM,aAAa,GAAG,OAAO,EAAE,cAAc,IAAI,KAAK,CAAC;IACvD,MAAM,YAAY,GAAG,OAAO,EAAE,aAAa,IAAI,KAAK,CAAC;IAErD,MAAM,OAAO,GAAG,YAAY;QAC1B,CAAC,CAAC,KAAK,CAAC,OAAO;QACf,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAErD,sBAAsB;IACtB,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAC/B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,IAAI,CAAC,CAAC,IAAI,KAAK,WAAW,CAC1D,CAAC;IACF,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;IAC7B,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,IAAI,KAAK,CACb,cAAc,aAAa,8BAA8B,IAAI,KAAK;YAClE,8DAA8D,CAC/D,CAAC;IACJ,CAAC;IAED,MAAM,SAAS,GAAG,iBAAiB,CAAC,OAAO,CAAC,CAAC;IAC7C,MAAM,IAAI,GAAG,kBAAkB,CAAC,MAAM,EAAE,SAAS,EAAE,QAAQ,CAAC,CAAC;IAE7D,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;QAC/B,OAAO,EAAE,OAAO,EAAE,aAAa,CAAC,IAAI,EAAE,aAAa,CAAC,EAAE,IAAI,EAAE,aAAa,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;IAC/F,CAAC;IAED,OAAO,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;AACtD,CAAC;AAED,OAAO,EAAE,iBAAiB,EAAE,kBAAkB,EAAE,oBAAoB,EAAE,qBAAqB,EAAE,qBAAqB,EAAE,CAAC"}

package/dist/tools/react-context-tools.d.ts

@@ -0,0 +1,41 @@
+/**
+ * React context graph mapping.
+ */
+import type { CodeSymbol } from "../types.js";
+export interface ReactContextInfo {
+    name: string;
+    created_in: {
+        file: string;
+        line: number;
+    };
+    providers: {
+        file: string;
+        line: number;
+    }[];
+    consumers: {
+        file: string;
+        component: string;
+        line: number;
+    }[];
+}
+export interface ContextGraph {
+    contexts: ReactContextInfo[];
+}
+/**
+ * Build a graph of React Context flows: createContext → Provider → useContext consumers.
+ *
+ * Single-pass scan over all symbols (capped at 500). No cycle detection — relies
+ * on visited set keyed by context name to prevent re-processing.
+ *
+ * Detection patterns:
+ * - createContext call: `const X = createContext(...)` or `const X = React.createContext(...)`
+ * - Provider usage: `<X.Provider value={...}>` (anywhere in any source)
+ * - Consumer usage: `useContext(X)` (anywhere in any source)
+ *
+ * Phase 2 features (not implemented here):
+ * - Cycle detection in provider chains
+ * - Re-render impact analysis ("which consumers re-render when X changes")
+ * - Context value type tracking
+ */
+export declare function buildContextGraph(symbols: CodeSymbol[]): ContextGraph;
+//# sourceMappingURL=react-context-tools.d.ts.map

package/dist/tools/react-context-tools.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"react-context-tools.d.ts","sourceRoot":"","sources":["../../src/tools/react-context-tools.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AAM9C,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;IAC3C,SAAS,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;IAC5C,SAAS,EAAE;QAAE,IAAI,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,EAAE,CAAC;CAChE;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,EAAE,gBAAgB,EAAE,CAAC;CAC9B;AAID;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,iBAAiB,CAAC,OAAO,EAAE,UAAU,EAAE,GAAG,YAAY,CAsDrE"}

package/dist/tools/react-context-tools.js

@@ -0,0 +1,76 @@
+const MAX_CONTEXT_SYMBOLS = 500;
+/**
+ * Build a graph of React Context flows: createContext → Provider → useContext consumers.
+ *
+ * Single-pass scan over all symbols (capped at 500). No cycle detection — relies
+ * on visited set keyed by context name to prevent re-processing.
+ *
+ * Detection patterns:
+ * - createContext call: `const X = createContext(...)` or `const X = React.createContext(...)`
+ * - Provider usage: `<X.Provider value={...}>` (anywhere in any source)
+ * - Consumer usage: `useContext(X)` (anywhere in any source)
+ *
+ * Phase 2 features (not implemented here):
+ * - Cycle detection in provider chains
+ * - Re-render impact analysis ("which consumers re-render when X changes")
+ * - Context value type tracking
+ */
+export function buildContextGraph(symbols) {
+    const contexts = new Map();
+    const createPattern = /\bconst\s+(\w+)\s*(?::[^=]+)?\s*=\s*(?:React\.)?createContext\b/g;
+    // Pass 1: Find context definitions
+    let scanned = 0;
+    for (const sym of symbols) {
+        if (scanned >= MAX_CONTEXT_SYMBOLS)
+            break;
+        if (!sym.source)
+            continue;
+        scanned++;
+        let m;
+        createPattern.lastIndex = 0;
+        while ((m = createPattern.exec(sym.source)) !== null) {
+            const name = m[1];
+            if (contexts.has(name))
+                continue; // visited — skip duplicate definition
+            // Compute line offset within symbol source
+            const linesBefore = sym.source.slice(0, m.index).split("\n").length;
+            contexts.set(name, {
+                name,
+                created_in: { file: sym.file, line: sym.start_line + linesBefore - 1 },
+                providers: [],
+                consumers: [],
+            });
+        }
+    }
+    if (contexts.size === 0)
+        return { contexts: [] };
+    // Pass 2: Find providers and consumers
+    scanned = 0;
+    for (const sym of symbols) {
+        if (scanned >= MAX_CONTEXT_SYMBOLS)
+            break;
+        if (!sym.source)
+            continue;
+        if (sym.kind !== "component" && sym.kind !== "hook")
+            continue;
+        scanned++;
+        for (const [ctxName, info] of contexts) {
+            // Provider: <X.Provider
+            const providerRe = new RegExp(`<${ctxName}\\.Provider\\b`);
+            if (providerRe.test(sym.source)) {
+                info.providers.push({ file: sym.file, line: sym.start_line });
+            }
+            // Consumer: useContext(X)
+            const consumerRe = new RegExp(`useContext\\s*\\(\\s*${ctxName}\\b`);
+            if (consumerRe.test(sym.source)) {
+                info.consumers.push({
+                    file: sym.file,
+                    component: sym.name,
+                    line: sym.start_line,
+                });
+            }
+        }
+    }
+    return { contexts: [...contexts.values()] };
+}
+//# sourceMappingURL=react-context-tools.js.map

package/dist/tools/react-context-tools.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"react-context-tools.js","sourceRoot":"","sources":["../../src/tools/react-context-tools.ts"],"names":[],"mappings":"AAoBA,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEhC;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,iBAAiB,CAAC,OAAqB;IACrD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA4B,CAAC;IACrD,MAAM,aAAa,GAAG,kEAAkE,CAAC;IAEzF,mCAAmC;IACnC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,OAAO,IAAI,mBAAmB;YAAE,MAAM;QAC1C,IAAI,CAAC,GAAG,CAAC,MAAM;YAAE,SAAS;QAC1B,OAAO,EAAE,CAAC;QACV,IAAI,CAAyB,CAAC;QAC9B,aAAa,CAAC,SAAS,GAAG,CAAC,CAAC;QAC5B,OAAO,CAAC,CAAC,GAAG,aAAa,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YACrD,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;YACnB,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAS,CAAE,sCAAsC;YACzE,2CAA2C;YAC3C,MAAM,WAAW,GAAG,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;YACpE,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE;gBACjB,IAAI;gBACJ,UAAU,EAAE,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,UAAU,GAAG,WAAW,GAAG,CAAC,EAAE;gBACtE,SAAS,EAAE,EAAE;gBACb,SAAS,EAAE,EAAE;aACd,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;IAEjD,uCAAuC;IACvC,OAAO,GAAG,CAAC,CAAC;IACZ,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,OAAO,IAAI,mBAAmB;YAAE,MAAM;QAC1C,IAAI,CAAC,GAAG,CAAC,MAAM;YAAE,SAAS;QAC1B,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM;YAAE,SAAS;QAC9D,OAAO,EAAE,CAAC;QACV,KAAK,MAAM,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,QAAQ,EAAE,CAAC;YACvC,wBAAwB;YACxB,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,IAAI,OAAO,gBAAgB,CAAC,CAAC;YAC3D,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAChC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC;YAChE,CAAC;YACD,0BAA0B;YAC1B,MAAM,UAAU,GAAG,IAAI,MAAM,CAAC,wBAAwB,OAAO,KAAK,CAAC,CAAC;YACpE,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAChC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC;oBAClB,IAAI,EAAE,GAAG,CAAC,IAAI;oBACd,SAAS,EAAE,GAAG,CAAC,IAAI;oBACnB,IAAI,EAAE,GAAG,CAAC,UAAU;iBACrB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;AAC9C,CAAC"}

package/dist/tools/react-hooks-tools.d.ts

@@ -0,0 +1,58 @@
+export interface HookCall {
+    name: string;
+    line: number;
+    is_stdlib: boolean;
+    context: string;
+}
+export interface HookInventoryEntry {
+    name: string;
+    kind: "component" | "hook";
+    file: string;
+    start_line: number;
+    hook_count: number;
+    hooks: HookCall[];
+    violations: string[];
+}
+export interface HookUsageSummary {
+    name: string;
+    count: number;
+    is_stdlib: boolean;
+}
+export interface AnalyzeHooksResult {
+    entries: HookInventoryEntry[];
+    total_components: number;
+    total_custom_hooks: number;
+    hook_usage: HookUsageSummary[];
+    violations_count: number;
+}
+/**
+ * Scan a component/hook source for Rule of Hooks violations.
+ * Detects: hook inside if/for/while/switch, hook after early return.
+ * Returns a list of human-readable violation descriptions.
+ */
+declare function findRuleOfHooksViolations(source: string): string[];
+/**
+ * Extract unique hook names from source (no line numbers, no cap).
+ * Use when you only need the set of hooks — e.g. React context bundle.
+ */
+declare function extractHookNames(source: string): Set<string>;
+/**
+ * Extract hook calls from source with their relative line number.
+ */
+declare function extractHookCalls(source: string): HookCall[];
+/**
+ * Analyze hook usage across components and custom hooks in a repo.
+ *
+ * Returns:
+ * - per-symbol inventory (hooks called, violations)
+ * - codebase-wide hook usage summary
+ * - Rule of Hooks violation count
+ */
+export declare function analyzeHooks(repo: string, options?: {
+    component_name?: string | undefined;
+    file_pattern?: string | undefined;
+    include_tests?: boolean | undefined;
+    max_entries?: number | undefined;
+}): Promise<AnalyzeHooksResult>;
+export { extractHookCalls, extractHookNames, findRuleOfHooksViolations };
+//# sourceMappingURL=react-hooks-tools.d.ts.map

package/dist/tools/react-hooks-tools.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"react-hooks-tools.d.ts","sourceRoot":"","sources":["../../src/tools/react-hooks-tools.ts"],"names":[],"mappings":"AAWA,MAAM,WAAW,QAAQ;IACvB,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,OAAO,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,MAAM,WAAW,kBAAkB;IACjC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,WAAW,GAAG,MAAM,CAAC;IAC3B,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,QAAQ,EAAE,CAAC;IAClB,UAAU,EAAE,MAAM,EAAE,CAAC;CACtB;AAED,MAAM,WAAW,gBAAgB;IAC/B,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;IACd,SAAS,EAAE,OAAO,CAAC;CACpB;AAED,MAAM,WAAW,kBAAkB;IACjC,OAAO,EAAE,kBAAkB,EAAE,CAAC;IAC9B,gBAAgB,EAAE,MAAM,CAAC;IACzB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,UAAU,EAAE,gBAAgB,EAAE,CAAC;IAC/B,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAED;;;;GAIG;AACH,iBAAS,yBAAyB,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAsB3D;AAED;;;GAGG;AACH,iBAAS,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,CAQrD;AAED;;GAEG;AACH,iBAAS,gBAAgB,CAAC,MAAM,EAAE,MAAM,GAAG,QAAQ,EAAE,CAmBpD;AAED;;;;;;;GAOG;AACH,wBAAsB,YAAY,CAChC,IAAI,EAAE,MAAM,EACZ,OAAO,CAAC,EAAE;IACR,cAAc,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IACpC,YAAY,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;IAClC,aAAa,CAAC,EAAE,OAAO,GAAG,SAAS,CAAC;IACpC,WAAW,CAAC,EAAE,MAAM,GAAG,SAAS,CAAC;CAClC,GACA,OAAO,CAAC,kBAAkB,CAAC,CA+E7B;AAED,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,yBAAyB,EAAE,CAAC"}

package/dist/tools/react-hooks-tools.js

@@ -0,0 +1,144 @@
+/**
+ * React hook inventory and Rule of Hooks analysis.
+ */
+import { getCodeIndex } from "./index-tools.js";
+import { isTestFileStrict as isTestFile } from "../utils/test-file.js";
+import { REACT_STDLIB_HOOKS } from "./react-shared-tools.js";
+/**
+ * Scan a component/hook source for Rule of Hooks violations.
+ * Detects: hook inside if/for/while/switch, hook after early return.
+ * Returns a list of human-readable violation descriptions.
+ */
+function findRuleOfHooksViolations(source) {
+    const violations = [];
+    // Heuristic: hook call inside if/for/while/switch block
+    const conditionalHook = /\b(if|for|while|switch)\s*\([^)]*\)\s*\{[^}]*\b(use[A-Z]\w*)\s*\(/;
+    const condMatch = conditionalHook.exec(source);
+    if (condMatch) {
+        violations.push(`Hook "${condMatch[2]}" called inside ${condMatch[1]} block — violates Rule of Hooks`);
+    }
+    // Heuristic: hook after early return
+    const earlyReturnHook = /\breturn\s+[^;{]*;\s*\n[\s\S]*?\b(use[A-Z]\w*)\s*\(/;
+    const earlyMatch = earlyReturnHook.exec(source);
+    if (earlyMatch) {
+        violations.push(`Hook "${earlyMatch[1]}" called after early return — violates Rule of Hooks`);
+    }
+    return violations;
+}
+/**
+ * Extract unique hook names from source (no line numbers, no cap).
+ * Use when you only need the set of hooks — e.g. React context bundle.
+ */
+function extractHookNames(source) {
+    const names = new Set();
+    const pattern = /\b(use[A-Z]\w*)\s*\(/g;
+    let m;
+    while ((m = pattern.exec(source)) !== null) {
+        names.add(m[1]);
+    }
+    return names;
+}
+/**
+ * Extract hook calls from source with their relative line number.
+ */
+function extractHookCalls(source) {
+    const calls = [];
+    const lines = source.split("\n");
+    const pattern = /\b(use[A-Z]\w*)\s*\(/;
+    for (let i = 0; i < lines.length && calls.length < 20; i++) {
+        const line = lines[i];
+        const m = pattern.exec(line);
+        if (m) {
+            calls.push({
+                name: m[1],
+                line: i + 1,
+                is_stdlib: REACT_STDLIB_HOOKS.has(m[1]),
+                context: line.trim().slice(0, 160),
+            });
+        }
+    }
+    return calls;
+}
+/**
+ * Analyze hook usage across components and custom hooks in a repo.
+ *
+ * Returns:
+ * - per-symbol inventory (hooks called, violations)
+ * - codebase-wide hook usage summary
+ * - Rule of Hooks violation count
+ */
+export async function analyzeHooks(repo, options) {
+    const index = await getCodeIndex(repo);
+    if (!index) {
+        throw new Error(`Repository not found: ${repo}`);
+    }
+    const componentName = options?.component_name;
+    const filePattern = options?.file_pattern;
+    const includeTests = options?.include_tests ?? false;
+    const maxEntries = options?.max_entries ?? 100;
+    // Filter symbols to components and hooks
+    let symbols = index.symbols.filter((s) => s.kind === "component" || s.kind === "hook");
+    if (!includeTests)
+        symbols = symbols.filter((s) => !isTestFile(s.file));
+    if (componentName)
+        symbols = symbols.filter((s) => s.name === componentName);
+    if (filePattern)
+        symbols = symbols.filter((s) => s.file.includes(filePattern));
+    const entries = [];
+    const globalHookCount = new Map();
+    let totalComponents = 0;
+    let totalHooks = 0;
+    let violationsCount = 0;
+    for (const sym of symbols) {
+        if (!sym.source)
+            continue;
+        const hookCalls = extractHookCalls(sym.source);
+        const violations = findRuleOfHooksViolations(sym.source);
+        if (sym.kind === "component")
+            totalComponents++;
+        else if (sym.kind === "hook")
+            totalHooks++;
+        // Skip empty entries (no hooks, no violations)
+        if (hookCalls.length === 0 && violations.length === 0)
+            continue;
+        violationsCount += violations.length;
+        for (const call of hookCalls) {
+            globalHookCount.set(call.name, (globalHookCount.get(call.name) ?? 0) + 1);
+        }
+        entries.push({
+            name: sym.name,
+            kind: sym.kind,
+            file: sym.file,
+            start_line: sym.start_line,
+            hook_count: hookCalls.length,
+            hooks: hookCalls,
+            violations,
+        });
+        if (entries.length >= maxEntries)
+            break;
+    }
+    // Sort entries: violations first, then by hook_count descending
+    entries.sort((a, b) => {
+        const vdiff = b.violations.length - a.violations.length;
+        if (vdiff !== 0)
+            return vdiff;
+        return b.hook_count - a.hook_count;
+    });
+    const hook_usage = [...globalHookCount.entries()]
+        .sort((a, b) => b[1] - a[1])
+        .slice(0, 20)
+        .map(([name, count]) => ({
+        name,
+        count,
+        is_stdlib: REACT_STDLIB_HOOKS.has(name),
+    }));
+    return {
+        entries,
+        total_components: totalComponents,
+        total_custom_hooks: totalHooks,
+        hook_usage,
+        violations_count: violationsCount,
+    };
+}
+export { extractHookCalls, extractHookNames, findRuleOfHooksViolations };
+//# sourceMappingURL=react-hooks-tools.js.map

package/dist/tools/react-hooks-tools.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"react-hooks-tools.js","sourceRoot":"","sources":["../../src/tools/react-hooks-tools.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,OAAO,EAAE,YAAY,EAAE,MAAM,kBAAkB,CAAC;AAChD,OAAO,EAAE,gBAAgB,IAAI,UAAU,EAAE,MAAM,uBAAuB,CAAC;AACvE,OAAO,EAAE,kBAAkB,EAAE,MAAM,yBAAyB,CAAC;AAqC7D;;;;GAIG;AACH,SAAS,yBAAyB,CAAC,MAAc;IAC/C,MAAM,UAAU,GAAa,EAAE,CAAC;IAEhC,wDAAwD;IACxD,MAAM,eAAe,GAAG,mEAAmE,CAAC;IAC5F,MAAM,SAAS,GAAG,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC/C,IAAI,SAAS,EAAE,CAAC;QACd,UAAU,CAAC,IAAI,CACb,SAAS,SAAS,CAAC,CAAC,CAAC,mBAAmB,SAAS,CAAC,CAAC,CAAC,iCAAiC,CACtF,CAAC;IACJ,CAAC;IAED,qCAAqC;IACrC,MAAM,eAAe,GAAG,qDAAqD,CAAC;IAC9E,MAAM,UAAU,GAAG,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChD,IAAI,UAAU,EAAE,CAAC;QACf,UAAU,CAAC,IAAI,CACb,SAAS,UAAU,CAAC,CAAC,CAAC,sDAAsD,CAC7E,CAAC;IACJ,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;GAGG;AACH,SAAS,gBAAgB,CAAC,MAAc;IACtC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,OAAO,GAAG,uBAAuB,CAAC;IACxC,IAAI,CAAyB,CAAC;IAC9B,OAAO,CAAC,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAC3C,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC,CAAC;IACnB,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,MAAc;IACtC,MAAM,KAAK,GAAe,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACjC,MAAM,OAAO,GAAG,sBAAsB,CAAC;IAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,MAAM,GAAG,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3D,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAE,CAAC;QACvB,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,IAAI,CAAC,EAAE,CAAC;YACN,KAAK,CAAC,IAAI,CAAC;gBACT,IAAI,EAAE,CAAC,CAAC,CAAC,CAAE;gBACX,IAAI,EAAE,CAAC,GAAG,CAAC;gBACX,SAAS,EAAE,kBAAkB,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAE,CAAC;gBACxC,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC;aACnC,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,KAAK,UAAU,YAAY,CAChC,IAAY,EACZ,OAKC;IAED,MAAM,KAAK,GAAG,MAAM,YAAY,CAAC,IAAI,CAAC,CAAC;IACvC,IAAI,CAAC,KAAK,EAAE,CAAC;QACX,MAAM,IAAI,KAAK,CAAC,yBAAyB,IAAI,EAAE,CAAC,CAAC;IACnD,CAAC;IAED,MAAM,aAAa,GAAG,OAAO,EAAE,cAAc,CAAC;IAC9C,MAAM,WAAW,GAAG,OAAO,EAAE,YAAY,CAAC;IAC1C,MAAM,YAAY,GAAG,OAAO,EAAE,aAAa,IAAI,KAAK,CAAC;IACrD,MAAM,UAAU,GAAG,OAAO,EAAE,WAAW,IAAI,GAAG,CAAC;IAE/C,yCAAyC;IACzC,IAAI,OAAO,GAAG,KAAK,CAAC,OAAO,CAAC,MAAM,CAChC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,CACnD,CAAC;IACF,IAAI,CAAC,YAAY;QAAE,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACxE,IAAI,aAAa;QAAE,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,aAAa,CAAC,CAAC;IAC7E,IAAI,WAAW;QAAE,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC;IAE/E,MAAM,OAAO,GAAyB,EAAE,CAAC;IACzC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAkB,CAAC;IAClD,IAAI,eAAe,GAAG,CAAC,CAAC;IACxB,IAAI,UAAU,GAAG,CAAC,CAAC;IACnB,IAAI,eAAe,GAAG,CAAC,CAAC;IAExB,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,CAAC,GAAG,CAAC,MAAM;YAAE,SAAS;QAE1B,MAAM,SAAS,GAAG,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC/C,MAAM,UAAU,GAAG,yBAAyB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEzD,IAAI,GAAG,CAAC,IAAI,KAAK,WAAW;YAAE,eAAe,EAAE,CAAC;aAC3C,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM;YAAE,UAAU,EAAE,CAAC;QAE3C,+CAA+C;QAC/C,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEhE,eAAe,IAAI,UAAU,CAAC,MAAM,CAAC;QAErC,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5E,CAAC;QAED,OAAO,CAAC,IAAI,CAAC;YACX,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,IAAI,EAAE,GAAG,CAAC,IAA4B;YACtC,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,UAAU,EAAE,SAAS,CAAC,MAAM;YAC5B,KAAK,EAAE,SAAS;YAChB,UAAU;SACX,CAAC,CAAC;QAEH,IAAI,OAAO,CAAC,MAAM,IAAI,UAAU;YAAE,MAAM;IAC1C,CAAC;IAED,gEAAgE;IAChE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpB,MAAM,KAAK,GAAG,CAAC,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,UAAU,CAAC,MAAM,CAAC;QACxD,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAC9B,OAAO,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,UAAU,CAAC;IACrC,CAAC,CAAC,CAAC;IAEH,MAAM,UAAU,GAAuB,CAAC,GAAG,eAAe,CAAC,OAAO,EAAE,CAAC;SAClE,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC3B,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC;SACZ,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;QACvB,IAAI;QACJ,KAAK;QACL,SAAS,EAAE,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC;KACxC,CAAC,CAAC,CAAC;IAEN,OAAO;QACL,OAAO;QACP,gBAAgB,EAAE,eAAe;QACjC,kBAAkB,EAAE,UAAU;QAC9B,UAAU;QACV,gBAAgB,EAAE,eAAe;KAClC,CAAC;AACJ,CAAC;AAED,OAAO,EAAE,gBAAgB,EAAE,gBAAgB,EAAE,yBAAyB,EAAE,CAAC"}