@flaid/devmap 0.2.0

package/dist/analyzers/features/featureSimilarity.js

@@ -0,0 +1,264 @@
+/**
+ * featureSimilarity.ts
+ *
+ * Reusable similarity engine untuk feature identity comparison.
+ *
+ * Design goals:
+ *   - Tidak bergantung pada feature name sebagai primary identity
+ *   - Weighted multi-factor scoring: files, entities, searchTerms, description
+ *   - Groundwork untuk future fingerprint system
+ *   - No heuristic string tricks (substring, includes, normalize-only)
+ *
+ * Scoring model:
+ *   Setiap faktor diberi bobot berbeda tergantung reliability-nya.
+ *   File overlap = paling reliable (concrete evidence).
+ *   Name similarity = least reliable (AI dapat berubah wording).
+ *
+ *   Composite score 0.0 - 1.0.
+ *   Threshold default 0.35 — dipilih biar:
+ *     - "Plan Management" ↔ "Customizable Plans" MATCH (entity + terms overlap)
+ *     - "Authentication" ↔ "Search" TIDAK MATCH (no overlap)
+ *     - "Search" ↔ "Search Functionality" MATCH (terms overlap)
+ */
+// ---------------------------------------------------------------------------
+// Config
+// ---------------------------------------------------------------------------
+/**
+ * MAX_SEARCH_TERMS — cross-cutting constant untuk search term cap.
+ * Konsisten dengan featureDetector. Dipakai di similarity engine dan merge.
+ */
+export const MAX_SEARCH_TERMS = 8;
+const DEFAULT_WEIGHTS = {
+    fileOverlap: 0.45,
+    termOverlap: 0.25,
+    entityOverlap: 0.20,
+    nameSimilarity: 0.10,
+};
+export const DEFAULT_SIMILARITY_CONFIG = {
+    weights: DEFAULT_WEIGHTS,
+    threshold: 0.35,
+};
+/**
+ * DEFAULT_SIMILARITY_THRESHOLD — backward compat alias.
+ */
+export const DEFAULT_SIMILARITY_THRESHOLD = DEFAULT_SIMILARITY_CONFIG.threshold;
+// ---------------------------------------------------------------------------
+// Public API
+// ---------------------------------------------------------------------------
+function resolveConfig(config) {
+    return config ?? DEFAULT_SIMILARITY_CONFIG;
+}
+/**
+ * computeSimilarity — hitung composite similarity score antara dua feature.
+ *
+ * @returns 0.0 - 1.0 (0 = no similarity, 1 = identical)
+ */
+export function computeSimilarity(a, b, config) {
+    const { weights } = resolveConfig(config);
+    const fileScore = jaccardSimilarity(new Set(a.files), new Set(b.files));
+    const termScore = jaccardSimilarity(new Set(normTerms(a.searchTerms)), new Set(normTerms(b.searchTerms)));
+    const entityScore = jaccardSimilarity(new Set(normTerms(a.relatedEntities)), new Set(normTerms(b.relatedEntities)));
+    const nameScore = trigramSimilarity(a.name, b.name);
+    return (fileScore * weights.fileOverlap +
+        termScore * weights.termOverlap +
+        entityScore * weights.entityOverlap +
+        nameScore * weights.nameSimilarity);
+}
+/**
+ * isSimilarFeature — convenience wrapper dengan threshold.
+ */
+export function isSimilarFeature(a, b, thresholdOrConfig) {
+    if (typeof thresholdOrConfig === "number") {
+        return computeSimilarity(a, b) >= thresholdOrConfig;
+    }
+    const config = resolveConfig(thresholdOrConfig);
+    return computeSimilarity(a, b, config) >= config.threshold;
+}
+/**
+ * findSimilarFeature — cari feature di list yang paling similar ke candidate.
+ *
+ * Return { index, score } dari match terbaik, atau null kalau tidak ada yang
+ * melewati threshold.
+ */
+export function findSimilarFeature(candidates, target, thresholdOrConfig) {
+    const config = resolveConfig(typeof thresholdOrConfig === "object" ? thresholdOrConfig : undefined);
+    const threshold = typeof thresholdOrConfig === "number"
+        ? thresholdOrConfig
+        : config.threshold;
+    let bestIndex = -1;
+    let bestScore = 0;
+    for (let i = 0; i < candidates.length; i++) {
+        const score = computeSimilarity(candidates[i], target, config);
+        if (score > bestScore) {
+            bestScore = score;
+            bestIndex = i;
+        }
+    }
+    if (bestIndex === -1 || bestScore < threshold)
+        return null;
+    return { index: bestIndex, score: bestScore };
+}
+/**
+ * computeSimilarityWithExplanation — seperti computeSimilarity, tapi return
+ * breakdown detail buat debugging.
+ * @internal
+ */
+export function computeSimilarityWithExplanation(a, b, config) {
+    const { weights, threshold } = resolveConfig(config);
+    const fileScore = jaccardSimilarity(new Set(a.files), new Set(b.files));
+    const termScore = jaccardSimilarity(new Set(normTerms(a.searchTerms)), new Set(normTerms(b.searchTerms)));
+    const entityScore = jaccardSimilarity(new Set(normTerms(a.relatedEntities)), new Set(normTerms(b.relatedEntities)));
+    const nameScore = trigramSimilarity(a.name, b.name);
+    const factors = {
+        fileOverlap: {
+            score: fileScore,
+            weight: weights.fileOverlap,
+            contribution: fileScore * weights.fileOverlap,
+            detail: a.files.length === 0 && b.files.length === 0
+                ? "both empty"
+                : a.files.length === 0 || b.files.length === 0
+                    ? "one side empty"
+                    : `overlap ${describeFilesOverlap(a.files, b.files)}`,
+        },
+        termOverlap: {
+            score: termScore,
+            weight: weights.termOverlap,
+            contribution: termScore * weights.termOverlap,
+            detail: a.searchTerms.length === 0 && b.searchTerms.length === 0
+                ? "both empty"
+                : a.searchTerms.length === 0 || b.searchTerms.length === 0
+                    ? "one side empty"
+                    : `jaccard ${termScore.toFixed(3)}`,
+        },
+        entityOverlap: {
+            score: entityScore,
+            weight: weights.entityOverlap,
+            contribution: entityScore * weights.entityOverlap,
+            detail: a.relatedEntities.length === 0 && b.relatedEntities.length === 0
+                ? "both empty"
+                : a.relatedEntities.length === 0 || b.relatedEntities.length === 0
+                    ? "one side empty"
+                    : `jaccard ${entityScore.toFixed(3)}`,
+        },
+        nameSimilarity: {
+            score: nameScore,
+            weight: weights.nameSimilarity,
+            contribution: nameScore * weights.nameSimilarity,
+            detail: `trigram ${nameScore.toFixed(3)}`,
+        },
+    };
+    const total = factors.fileOverlap.contribution
+        + factors.termOverlap.contribution
+        + factors.entityOverlap.contribution
+        + factors.nameSimilarity.contribution;
+    const weaknesses = [];
+    if (a.files.length === 0 || b.files.length === 0) {
+        weaknesses.push("one or both sides have no files — fileOverlap may be unreliable");
+    }
+    if (total < threshold && total >= threshold - 0.1) {
+        weaknesses.push(`score ${total.toFixed(3)} is close to threshold ${threshold}`);
+    }
+    return {
+        score: total,
+        threshold,
+        similar: total >= threshold,
+        factors,
+        weaknesses,
+    };
+}
+function describeFilesOverlap(a, b) {
+    const setA = new Set(a);
+    const overlap = b.filter((f) => setA.has(f));
+    return overlap.length > 0
+        ? `${overlap.length}/${Math.max(a.length, b.length)} files`
+        : "none";
+}
+// ---------------------------------------------------------------------------
+// Similarity algorithms
+// ---------------------------------------------------------------------------
+/**
+ * jaccardSimilarity — |A ∩ B| / |A ∪ B|
+ *
+ * Dipakai untuk set-based features (files, terms, entities).
+ * Return 1.0 kalau keduanya empty (dua feature tanpa data tidak conflicting).
+ * Return 0.0 kalau salah satu empty dan yang lain tidak.
+ */
+export function jaccardSimilarity(a, b) {
+    if (a.size === 0 && b.size === 0)
+        return 1.0;
+    if (a.size === 0 || b.size === 0)
+        return 0.0;
+    let intersection = 0;
+    for (const item of a) {
+        if (b.has(item))
+            intersection++;
+    }
+    const union = a.size + b.size - intersection;
+    return union === 0 ? 1.0 : intersection / union;
+}
+/**
+ * trigramSimilarity — Dice coefficient pada character trigrams.
+ *
+ * Lebih robust dari Levenshtein untuk perbandingan nama pendek.
+ * "Plan Management" ↔ "Customizable Plans" → ~0.28
+ * "Authentication" ↔ "Authentication System" → ~0.82
+ * "Search" ↔ "Search Functionality" → ~0.55
+ *
+ * Dipakai sebagai soft signal saja (weight 0.10) karena AI wording volatile.
+ */
+export function trigramSimilarity(a, b) {
+    const ta = buildTrigrams(a.toLowerCase());
+    const tb = buildTrigrams(b.toLowerCase());
+    if (ta.size === 0 && tb.size === 0)
+        return 1.0;
+    if (ta.size === 0 || tb.size === 0)
+        return 0.0;
+    let intersection = 0;
+    for (const g of ta) {
+        if (tb.has(g))
+            intersection++;
+    }
+    // Dice coefficient: 2 * |A ∩ B| / (|A| + |B|)
+    return (2 * intersection) / (ta.size + tb.size);
+}
+function buildTrigrams(s) {
+    const grams = new Set();
+    const padded = `  ${s}  `;
+    for (let i = 0; i < padded.length - 2; i++) {
+        grams.add(padded.slice(i, i + 3));
+    }
+    return grams;
+}
+// ---------------------------------------------------------------------------
+// Normalization helpers
+// ---------------------------------------------------------------------------
+/**
+ * normTerms — lowercase semua terms untuk case-insensitive comparison.
+ * Tidak strip stopwords — terlalu agresif dan bisa hilangkan signal penting.
+ */
+function normTerms(terms) {
+    return terms.map((t) => t.toLowerCase().trim()).filter(Boolean);
+}
+export function buildFeatureFingerprint(identity) {
+    return {
+        fileSignature: [...identity.files].sort().join("|"),
+        termSignature: [...normTerms(identity.searchTerms)].sort().join("|"),
+        entitySignature: [...normTerms(identity.relatedEntities)].sort().join("|"),
+    };
+}
+/**
+ * fingerprintSimilarity — compare dua fingerprint secara segment-by-segment.
+ * Alternative entry point kalau future code ingin compare fingerprints
+ * tanpa reconstruct full FeatureIdentity.
+ */
+export function fingerprintSimilarity(a, b) {
+    const fileScore = jaccardSimilarity(new Set(a.fileSignature.split("|").filter(Boolean)), new Set(b.fileSignature.split("|").filter(Boolean)));
+    const termScore = jaccardSimilarity(new Set(a.termSignature.split("|").filter(Boolean)), new Set(b.termSignature.split("|").filter(Boolean)));
+    const entityScore = jaccardSimilarity(new Set(a.entitySignature.split("|").filter(Boolean)), new Set(b.entitySignature.split("|").filter(Boolean)));
+    // tanpa nameSimilarity karena fingerprint tidak menyimpan nama
+    const { weights } = DEFAULT_SIMILARITY_CONFIG;
+    return (fileScore * (weights.fileOverlap / (1 - weights.nameSimilarity)) +
+        termScore * (weights.termOverlap / (1 - weights.nameSimilarity)) +
+        entityScore * (weights.entityOverlap / (1 - weights.nameSimilarity)));
+}
+//# sourceMappingURL=featureSimilarity.js.map

package/dist/analyzers/features/featureSimilarity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"featureSimilarity.js","sourceRoot":"","sources":["../../../src/analyzers/features/featureSimilarity.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;GAqBG;AAmBH,8EAA8E;AAC9E,SAAS;AACT,8EAA8E;AAE9E;;;GAGG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAC;AAelC,MAAM,eAAe,GAAG;IACtB,WAAW,EAAE,IAAI;IACjB,WAAW,EAAE,IAAI;IACjB,aAAa,EAAE,IAAI;IACnB,cAAc,EAAE,IAAI;CACZ,CAAC;AAEX,MAAM,CAAC,MAAM,yBAAyB,GAA4B;IAChE,OAAO,EAAE,eAAe;IACxB,SAAS,EAAE,IAAI;CAChB,CAAC;AAEF;;GAEG;AACH,MAAM,CAAC,MAAM,4BAA4B,GAAG,yBAAyB,CAAC,SAAS,CAAC;AAEhF,8EAA8E;AAC9E,aAAa;AACb,8EAA8E;AAE9E,SAAS,aAAa,CAAC,MAAgC;IACrD,OAAO,MAAM,IAAI,yBAAyB,CAAC;AAC7C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAC/B,CAAkB,EAClB,CAAkB,EAClB,MAAgC;IAEhC,MAAM,EAAE,OAAO,EAAE,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IAC1C,MAAM,SAAS,GAAK,iBAAiB,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC1E,MAAM,SAAS,GAAK,iBAAiB,CAAC,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IAC5G,MAAM,WAAW,GAAG,iBAAiB,CAAC,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACpH,MAAM,SAAS,GAAK,iBAAiB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAEtD,OAAO,CACL,SAAS,GAAK,OAAO,CAAC,WAAW;QACjC,SAAS,GAAK,OAAO,CAAC,WAAW;QACjC,WAAW,GAAG,OAAO,CAAC,aAAa;QACnC,SAAS,GAAK,OAAO,CAAC,cAAc,CACrC,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC9B,CAAkB,EAClB,CAAkB,EAClB,iBAAoD;IAEpD,IAAI,OAAO,iBAAiB,KAAK,QAAQ,EAAE,CAAC;QAC1C,OAAO,iBAAiB,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,iBAAiB,CAAC;IACtD,CAAC;IACD,MAAM,MAAM,GAAG,aAAa,CAAC,iBAAiB,CAAC,CAAC;IAChD,OAAO,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC;AAC7D,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,kBAAkB,CAChC,UAA6B,EAC7B,MAAuB,EACvB,iBAAoD;IAEpD,MAAM,MAAM,GAAG,aAAa,CAC1B,OAAO,iBAAiB,KAAK,QAAQ,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,SAAS,CACtE,CAAC;IACF,MAAM,SAAS,GAAG,OAAO,iBAAiB,KAAK,QAAQ;QACrD,CAAC,CAAC,iBAAiB;QACnB,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC;IAErB,IAAI,SAAS,GAAG,CAAC,CAAC,CAAC;IACnB,IAAI,SAAS,GAAG,CAAC,CAAC;IAElB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,iBAAiB,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;QAC/D,IAAI,KAAK,GAAG,SAAS,EAAE,CAAC;YACtB,SAAS,GAAG,KAAK,CAAC;YAClB,SAAS,GAAG,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IAED,IAAI,SAAS,KAAK,CAAC,CAAC,IAAI,SAAS,GAAG,SAAS;QAAE,OAAO,IAAI,CAAC;IAC3D,OAAO,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,SAAS,EAAE,CAAC;AAChD,CAAC;AAuBD;;;;GAIG;AACH,MAAM,UAAU,gCAAgC,CAC9C,CAAkB,EAClB,CAAkB,EAClB,MAAgC;IAEhC,MAAM,EAAE,OAAO,EAAE,SAAS,EAAE,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;IAErD,MAAM,SAAS,GAAK,iBAAiB,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IAC1E,MAAM,SAAS,GAAK,iBAAiB,CAAC,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;IAC5G,MAAM,WAAW,GAAG,iBAAiB,CAAC,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,IAAI,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;IACpH,MAAM,SAAS,GAAK,iBAAiB,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAEtD,MAAM,OAAO,GAAG;QACd,WAAW,EAAE;YACX,KAAK,EAAE,SAAS;YAChB,MAAM,EAAE,OAAO,CAAC,WAAW;YAC3B,YAAY,EAAE,SAAS,GAAG,OAAO,CAAC,WAAW;YAC7C,MAAM,EAAE,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;gBAClD,CAAC,CAAC,YAAY;gBACd,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;oBAC5C,CAAC,CAAC,gBAAgB;oBAClB,CAAC,CAAC,WAAW,oBAAoB,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE;SAC1D;QACD,WAAW,EAAE;YACX,KAAK,EAAE,SAAS;YAChB,MAAM,EAAE,OAAO,CAAC,WAAW;YAC3B,YAAY,EAAE,SAAS,GAAG,OAAO,CAAC,WAAW;YAC7C,MAAM,EAAE,CAAC,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC;gBAC9D,CAAC,CAAC,YAAY;gBACd,CAAC,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,WAAW,CAAC,MAAM,KAAK,CAAC;oBACxD,CAAC,CAAC,gBAAgB;oBAClB,CAAC,CAAC,WAAW,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;SACxC;QACD,aAAa,EAAE;YACb,KAAK,EAAE,WAAW;YAClB,MAAM,EAAE,OAAO,CAAC,aAAa;YAC7B,YAAY,EAAE,WAAW,GAAG,OAAO,CAAC,aAAa;YACjD,MAAM,EAAE,CAAC,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC;gBACtE,CAAC,CAAC,YAAY;gBACd,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,eAAe,CAAC,MAAM,KAAK,CAAC;oBAChE,CAAC,CAAC,gBAAgB;oBAClB,CAAC,CAAC,WAAW,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;SAC1C;QACD,cAAc,EAAE;YACd,KAAK,EAAE,SAAS;YAChB,MAAM,EAAE,OAAO,CAAC,cAAc;YAC9B,YAAY,EAAE,SAAS,GAAG,OAAO,CAAC,cAAc;YAChD,MAAM,EAAE,WAAW,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE;SAC1C;KACF,CAAC;IAEF,MAAM,KAAK,GAAG,OAAO,CAAC,WAAW,CAAC,YAAY;UAC1C,OAAO,CAAC,WAAW,CAAC,YAAY;UAChC,OAAO,CAAC,aAAa,CAAC,YAAY;UAClC,OAAO,CAAC,cAAc,CAAC,YAAY,CAAC;IAExC,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACjD,UAAU,CAAC,IAAI,CAAC,iEAAiE,CAAC,CAAC;IACrF,CAAC;IACD,IAAI,KAAK,GAAG,SAAS,IAAI,KAAK,IAAI,SAAS,GAAG,GAAG,EAAE,CAAC;QAClD,UAAU,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,0BAA0B,SAAS,EAAE,CAAC,CAAC;IAClF,CAAC;IAED,OAAO;QACL,KAAK,EAAE,KAAK;QACZ,SAAS;QACT,OAAO,EAAE,KAAK,IAAI,SAAS;QAC3B,OAAO;QACP,UAAU;KACX,CAAC;AACJ,CAAC;AAED,SAAS,oBAAoB,CAAC,CAAW,EAAE,CAAW;IACpD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC7C,OAAO,OAAO,CAAC,MAAM,GAAG,CAAC;QACvB,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,QAAQ;QAC3D,CAAC,CAAC,MAAM,CAAC;AACb,CAAC;AAED,8EAA8E;AAC9E,wBAAwB;AACxB,8EAA8E;AAE9E;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAc,EAAE,CAAc;IAC9D,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC7C,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAE7C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,IAAI,IAAI,CAAC,EAAE,CAAC;QACrB,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,YAAY,EAAE,CAAC;IAClC,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,YAAY,CAAC;IAC7C,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;AAClD,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAS,EAAE,CAAS;IACpD,MAAM,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;IAC1C,MAAM,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC;IAE1C,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAC/C,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC;IAE/C,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACnB,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,YAAY,EAAE,CAAC;IAChC,CAAC;IAED,8CAA8C;IAC9C,OAAO,CAAC,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;AAClD,CAAC;AAED,SAAS,aAAa,CAAC,CAAS;IAC9B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC;IAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3C,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,8EAA8E;AAC9E,wBAAwB;AACxB,8EAA8E;AAE9E;;;GAGG;AACH,SAAS,SAAS,CAAC,KAAe;IAChC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;AAClE,CAAC;AAyBD,MAAM,UAAU,uBAAuB,CAAC,QAAyB;IAC/D,OAAO;QACL,aAAa,EAAI,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC;QACrD,aAAa,EAAI,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC;QACtE,eAAe,EAAE,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC;KAC3E,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CAAC,CAAqB,EAAE,CAAqB;IAChF,MAAM,SAAS,GAAK,iBAAiB,CACnC,IAAI,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EACnD,IAAI,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CACpD,CAAC;IACF,MAAM,SAAS,GAAK,iBAAiB,CACnC,IAAI,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EACnD,IAAI,GAAG,CAAC,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CACpD,CAAC;IACF,MAAM,WAAW,GAAG,iBAAiB,CACnC,IAAI,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,EACrD,IAAI,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CACtD,CAAC;IAEF,+DAA+D;IAC/D,MAAM,EAAE,OAAO,EAAE,GAAG,yBAAyB,CAAC;IAC9C,OAAO,CACL,SAAS,GAAK,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;QAClE,SAAS,GAAK,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC;QAClE,WAAW,GAAG,CAAC,OAAO,CAAC,aAAa,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,cAAc,CAAC,CAAC,CACrE,CAAC;AACJ,CAAC"}

package/dist/analyzers/features/index.d.ts

@@ -0,0 +1,6 @@
+export { detectFeatures, detectAuthenticationSemanticRole, orderAuthenticationFiles, authenticationFilePriority, classifyFileTier, } from "./featureDetector.js";
+export type { FeatureInfo, AuthSemanticRole, FileTier, } from "./featureDetector.js";
+export { toFeatureIdentity, mergeIntoFeatureList, mergeFeatureData, mergeDomainFeatures, } from "./featureMerge.js";
+export { computeSimilarity, isSimilarFeature, findSimilarFeature, jaccardSimilarity, trigramSimilarity, buildFeatureFingerprint, fingerprintSimilarity, DEFAULT_SIMILARITY_THRESHOLD, } from "./featureSimilarity.js";
+export type { FeatureIdentity, FeatureFingerprint, } from "./featureSimilarity.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/analyzers/features/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/analyzers/features/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,cAAc,EACd,gCAAgC,EAChC,wBAAwB,EACxB,0BAA0B,EAC1B,gBAAgB,GACjB,MAAM,sBAAsB,CAAC;AAC9B,YAAY,EACV,WAAW,EACX,gBAAgB,EAChB,QAAQ,GACT,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EACL,iBAAiB,EACjB,oBAAoB,EACpB,gBAAgB,EAChB,mBAAmB,GACpB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,iBAAiB,EACjB,gBAAgB,EAChB,kBAAkB,EAClB,iBAAiB,EACjB,iBAAiB,EACjB,uBAAuB,EACvB,qBAAqB,EACrB,4BAA4B,GAC7B,MAAM,wBAAwB,CAAC;AAChC,YAAY,EACV,eAAe,EACf,kBAAkB,GACnB,MAAM,wBAAwB,CAAC"}

package/dist/analyzers/features/index.js

@@ -0,0 +1,4 @@
+export { detectFeatures, detectAuthenticationSemanticRole, orderAuthenticationFiles, authenticationFilePriority, classifyFileTier, } from "./featureDetector.js";
+export { toFeatureIdentity, mergeIntoFeatureList, mergeFeatureData, mergeDomainFeatures, } from "./featureMerge.js";
+export { computeSimilarity, isSimilarFeature, findSimilarFeature, jaccardSimilarity, trigramSimilarity, buildFeatureFingerprint, fingerprintSimilarity, DEFAULT_SIMILARITY_THRESHOLD, } from "./featureSimilarity.js";
+//# sourceMappingURL=index.js.map

package/dist/analyzers/features/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/analyzers/features/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,cAAc,EACd,gCAAgC,EAChC,wBAAwB,EACxB,0BAA0B,EAC1B,gBAAgB,GACjB,MAAM,sBAAsB,CAAC;AAO9B,OAAO,EACL,iBAAiB,EACjB,oBAAoB,EACpB,gBAAgB,EAChB,mBAAmB,GACpB,MAAM,mBAAmB,CAAC;AAE3B,OAAO,EACL,iBAAiB,EACjB,gBAAgB,EAChB,kBAAkB,EAClB,iBAAiB,EACjB,iBAAiB,EACjB,uBAAuB,EACvB,qBAAqB,EACrB,4BAA4B,GAC7B,MAAM,wBAAwB,CAAC"}

package/dist/analyzers/graph/dependencyGraph.d.ts

@@ -0,0 +1,5 @@
+import type { FileAnalysis, ScannedFile } from "../analysis/index.js";
+export type FileGraph = Record<string, string[]>;
+export declare function buildDependencyGraph(files: ScannedFile[], analyses?: Record<string, FileAnalysis>): FileGraph;
+export declare function countReferences(graph: FileGraph): Record<string, number>;
+//# sourceMappingURL=dependencyGraph.d.ts.map

package/dist/analyzers/graph/dependencyGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependencyGraph.d.ts","sourceRoot":"","sources":["../../../src/analyzers/graph/dependencyGraph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAEtE,MAAM,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC;AAIjD,wBAAgB,oBAAoB,CAClC,KAAK,EAAE,WAAW,EAAE,EACpB,QAAQ,GAAE,MAAM,CAAC,MAAM,EAAE,YAAY,CAAM,GAC1C,SAAS,CAqBX;AAED,wBAAgB,eAAe,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAUxE"}

package/dist/analyzers/graph/dependencyGraph.js

@@ -0,0 +1,88 @@
+const IMPORT_RE = /(?:import\s+(?:[^'"]+\s+from\s+)?|export\s+[^'"]+\s+from\s+|require\()\s*['"]([^'"]+)['"]/g;
+export function buildDependencyGraph(files, analyses = {}) {
+    const graph = {};
+    const localPaths = new Set(files.map((file) => file.path));
+    for (const file of files) {
+        graph[file.path] = [];
+        const importSpecifiers = analyses[file.path]?.imports ?? findImportSpecifiers(file.content);
+        for (const specifier of importSpecifiers) {
+            if (!specifier.startsWith(".")) {
+                continue;
+            }
+            const resolved = resolveImport(file.path, specifier, localPaths);
+            if (resolved) {
+                graph[file.path].push(resolved);
+            }
+        }
+    }
+    return graph;
+}
+export function countReferences(graph) {
+    const counts = {};
+    for (const imports of Object.values(graph)) {
+        for (const imported of imports) {
+            counts[imported] = (counts[imported] ?? 0) + 1;
+        }
+    }
+    return counts;
+}
+function findImportSpecifiers(content) {
+    const matches = [];
+    IMPORT_RE.lastIndex = 0;
+    let match = IMPORT_RE.exec(content);
+    while (match) {
+        matches.push(match[1]);
+        match = IMPORT_RE.exec(content);
+    }
+    return matches;
+}
+function resolveImport(fromPath, specifier, localPaths) {
+    const baseParts = fromPath.split("/");
+    baseParts.pop();
+    const normalized = normalizePath([...baseParts, specifier].join("/"));
+    const candidates = [
+        normalized,
+        `${normalized}.ts`,
+        `${normalized}.tsx`,
+        `${normalized}.js`,
+        `${normalized}.jsx`,
+        `${normalized}.mjs`,
+        `${normalized}.cjs`,
+        `${normalized}.vue`,
+        `${normalized}.svelte`,
+        `${normalized}.astro`,
+        `${normalized}/index.ts`,
+        `${normalized}/index.tsx`,
+        `${normalized}/index.js`,
+        `${normalized}/index.jsx`,
+        `${normalized}/index.vue`,
+        `${normalized}/index.svelte`,
+        `${normalized}/index.astro`
+    ];
+    if (normalized.endsWith(".js")) {
+        const withoutExtension = normalized.slice(0, -3);
+        candidates.push(`${withoutExtension}.ts`, `${withoutExtension}.tsx`);
+    }
+    if (normalized.endsWith(".mjs")) {
+        candidates.push(`${normalized.slice(0, -4)}.mts`);
+    }
+    if (normalized.endsWith(".cjs")) {
+        candidates.push(`${normalized.slice(0, -4)}.cts`);
+    }
+    return candidates.find((candidate) => localPaths.has(candidate)) ?? null;
+}
+function normalizePath(path) {
+    const parts = [];
+    for (const part of path.split("/")) {
+        if (part === "." || part === "") {
+            continue;
+        }
+        if (part === "..") {
+            parts.pop();
+            continue;
+        }
+        parts.push(part);
+    }
+    return parts.join("/");
+}
+//# sourceMappingURL=dependencyGraph.js.map

package/dist/analyzers/graph/dependencyGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependencyGraph.js","sourceRoot":"","sources":["../../../src/analyzers/graph/dependencyGraph.ts"],"names":[],"mappings":"AAIA,MAAM,SAAS,GAAG,4FAA4F,CAAC;AAE/G,MAAM,UAAU,oBAAoB,CAClC,KAAoB,EACpB,WAAyC,EAAE;IAE3C,MAAM,KAAK,GAAc,EAAE,CAAC;IAC5B,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAE3D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QAEtB,MAAM,gBAAgB,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,OAAO,IAAI,oBAAoB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC5F,KAAK,MAAM,SAAS,IAAI,gBAAgB,EAAE,CAAC;YACzC,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC/B,SAAS;YACX,CAAC;YAED,MAAM,QAAQ,GAAG,aAAa,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;YACjE,IAAI,QAAQ,EAAE,CAAC;gBACb,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAClC,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,eAAe,CAAC,KAAgB;IAC9C,MAAM,MAAM,GAA2B,EAAE,CAAC;IAE1C,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QAC3C,KAAK,MAAM,QAAQ,IAAI,OAAO,EAAE,CAAC;YAC/B,MAAM,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,oBAAoB,CAAC,OAAe;IAC3C,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,SAAS,CAAC,SAAS,GAAG,CAAC,CAAC;IAExB,IAAI,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACpC,OAAO,KAAK,EAAE,CAAC;QACb,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QACvB,KAAK,GAAG,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IAClC,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,aAAa,CAAC,QAAgB,EAAE,SAAiB,EAAE,UAAuB;IACjF,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;IACtC,SAAS,CAAC,GAAG,EAAE,CAAC;IAChB,MAAM,UAAU,GAAG,aAAa,CAAC,CAAC,GAAG,SAAS,EAAE,SAAS,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC;IACtE,MAAM,UAAU,GAAG;QACjB,UAAU;QACV,GAAG,UAAU,KAAK;QAClB,GAAG,UAAU,MAAM;QACnB,GAAG,UAAU,KAAK;QAClB,GAAG,UAAU,MAAM;QACnB,GAAG,UAAU,MAAM;QACnB,GAAG,UAAU,MAAM;QACnB,GAAG,UAAU,MAAM;QACnB,GAAG,UAAU,SAAS;QACtB,GAAG,UAAU,QAAQ;QACrB,GAAG,UAAU,WAAW;QACxB,GAAG,UAAU,YAAY;QACzB,GAAG,UAAU,WAAW;QACxB,GAAG,UAAU,YAAY;QACzB,GAAG,UAAU,YAAY;QACzB,GAAG,UAAU,eAAe;QAC5B,GAAG,UAAU,cAAc;KAC5B,CAAC;IAEF,IAAI,UAAU,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC;QAC/B,MAAM,gBAAgB,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACjD,UAAU,CAAC,IAAI,CAAC,GAAG,gBAAgB,KAAK,EAAE,GAAG,gBAAgB,MAAM,CAAC,CAAC;IACvE,CAAC;IACD,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QAChC,UAAU,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACpD,CAAC;IACD,IAAI,UAAU,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;QAChC,UAAU,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;IACpD,CAAC;IAED,OAAO,UAAU,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,IAAI,IAAI,CAAC;AAC3E,CAAC;AAED,SAAS,aAAa,CAAC,IAAY;IACjC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QACnC,IAAI,IAAI,KAAK,GAAG,IAAI,IAAI,KAAK,EAAE,EAAE,CAAC;YAChC,SAAS;QACX,CAAC;QAED,IAAI,IAAI,KAAK,IAAI,EAAE,CAAC;YAClB,KAAK,CAAC,GAAG,EAAE,CAAC;YACZ,SAAS;QACX,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnB,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AACzB,CAAC"}

package/dist/analyzers/graph/dependencyMap.d.ts

@@ -0,0 +1,43 @@
+import type { FileGraph } from "./dependencyGraph.js";
+/**
+ * buildReverseGraph — invert a forward file-import graph into a
+ * "who depends on me" graph. `fileGraph` maps a file to the files it
+ * imports; the reverse maps a file to the files that import it.
+ */
+export declare function buildReverseGraph(fileGraph: FileGraph): FileGraph;
+export type MapTreeNode = {
+    path: string;
+    children: MapTreeNode[];
+    /** true if this node closes a cycle back to an ancestor already shown above it */
+    isCycle: boolean;
+    /** number of additional direct children that exist but were cut off by maxChildren */
+    truncatedCount?: number;
+};
+/**
+ * Default cap on direct children shown per node. Hub files (a shared
+ * types.ts, utils.ts, a common UI component) can have very high fan-in —
+ * without a cap, a single "used by" tree (or the mermaid diagram built from
+ * it) can balloon to hundreds of lines/nodes and become unreadable. Pass
+ * `maxChildren: Infinity` (wired to the `--all` flag) to bypass this.
+ */
+export declare const DEFAULT_MAX_CHILDREN = 25;
+/**
+ * buildBoundedTree — walk a graph outward from `root` up to `maxDepth` hops,
+ * stopping (and flagging isCycle) whenever a path revisits a file already on
+ * the current branch. File dependency graphs commonly have real cycles
+ * (A imports B imports A), so a naive walk without a visited-per-branch set
+ * would recurse forever.
+ */
+export declare function buildBoundedTree(graph: FileGraph, root: string, maxDepth: number, options?: {
+    ancestors?: string[];
+    filter?: (path: string) => boolean;
+    maxChildren?: number;
+}): MapTreeNode;
+/**
+ * collectNodesWithinDepth — flat, deduplicated list of every file reachable
+ * from `root` within `maxDepth` hops (root excluded). Used for feature-level
+ * "what does this feature touch outside itself" style queries where a flat
+ * set is more useful than a nested tree.
+ */
+export declare function collectNodesWithinDepth(graph: FileGraph, root: string, maxDepth: number): string[];
+//# sourceMappingURL=dependencyMap.d.ts.map

package/dist/analyzers/graph/dependencyMap.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependencyMap.d.ts","sourceRoot":"","sources":["../../../src/analyzers/graph/dependencyMap.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AAEtD;;;;GAIG;AACH,wBAAgB,iBAAiB,CAAC,SAAS,EAAE,SAAS,GAAG,SAAS,CAajE;AAED,MAAM,MAAM,WAAW,GAAG;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,kFAAkF;IAClF,OAAO,EAAE,OAAO,CAAC;IACjB,sFAAsF;IACtF,cAAc,CAAC,EAAE,MAAM,CAAC;CACzB,CAAC;AAEF;;;;;;GAMG;AACH,eAAO,MAAM,oBAAoB,KAAK,CAAC;AAEvC;;;;;;GAMG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,SAAS,EAChB,IAAI,EAAE,MAAM,EACZ,QAAQ,EAAE,MAAM,EAChB,OAAO,GAAE;IAAE,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;IAAC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,KAAK,OAAO,CAAC;IAAC,WAAW,CAAC,EAAE,MAAM,CAAA;CAAO,GAC/F,WAAW,CAmCb;AAED;;;;;GAKG;AACH,wBAAgB,uBAAuB,CACrC,KAAK,EAAE,SAAS,EAChB,IAAI,EAAE,MAAM,EACZ,QAAQ,EAAE,MAAM,GACf,MAAM,EAAE,CAmBV"}

package/dist/analyzers/graph/dependencyMap.js

@@ -0,0 +1,85 @@
+/**
+ * buildReverseGraph — invert a forward file-import graph into a
+ * "who depends on me" graph. `fileGraph` maps a file to the files it
+ * imports; the reverse maps a file to the files that import it.
+ */
+export function buildReverseGraph(fileGraph) {
+    const reverse = {};
+    for (const [file, dependencies] of Object.entries(fileGraph)) {
+        for (const dependency of dependencies) {
+            const dependents = reverse[dependency] ?? (reverse[dependency] = []);
+            if (!dependents.includes(file)) {
+                dependents.push(file);
+            }
+        }
+    }
+    return reverse;
+}
+/**
+ * Default cap on direct children shown per node. Hub files (a shared
+ * types.ts, utils.ts, a common UI component) can have very high fan-in —
+ * without a cap, a single "used by" tree (or the mermaid diagram built from
+ * it) can balloon to hundreds of lines/nodes and become unreadable. Pass
+ * `maxChildren: Infinity` (wired to the `--all` flag) to bypass this.
+ */
+export const DEFAULT_MAX_CHILDREN = 25;
+/**
+ * buildBoundedTree — walk a graph outward from `root` up to `maxDepth` hops,
+ * stopping (and flagging isCycle) whenever a path revisits a file already on
+ * the current branch. File dependency graphs commonly have real cycles
+ * (A imports B imports A), so a naive walk without a visited-per-branch set
+ * would recurse forever.
+ */
+export function buildBoundedTree(graph, root, maxDepth, options = {}) {
+    const ancestors = options.ancestors ?? [root];
+    const maxChildren = options.maxChildren ?? DEFAULT_MAX_CHILDREN;
+    if (maxDepth <= 0) {
+        return { path: root, children: [], isCycle: false };
+    }
+    const candidates = (graph[root] ?? []).filter((next) => !options.filter || options.filter(next));
+    const shown = candidates.slice(0, maxChildren);
+    const truncatedCount = candidates.length - shown.length;
+    const children = [];
+    for (const next of shown) {
+        if (ancestors.includes(next)) {
+            children.push({ path: next, children: [], isCycle: true });
+            continue;
+        }
+        children.push(buildBoundedTree(graph, next, maxDepth - 1, {
+            ancestors: [...ancestors, next],
+            filter: options.filter,
+            maxChildren
+        }));
+    }
+    return {
+        path: root,
+        children,
+        isCycle: false,
+        ...(truncatedCount > 0 ? { truncatedCount } : {})
+    };
+}
+/**
+ * collectNodesWithinDepth — flat, deduplicated list of every file reachable
+ * from `root` within `maxDepth` hops (root excluded). Used for feature-level
+ * "what does this feature touch outside itself" style queries where a flat
+ * set is more useful than a nested tree.
+ */
+export function collectNodesWithinDepth(graph, root, maxDepth) {
+    const visited = new Set([root]);
+    let frontier = [root];
+    for (let depth = 0; depth < maxDepth && frontier.length > 0; depth++) {
+        const next = [];
+        for (const file of frontier) {
+            for (const neighbor of graph[file] ?? []) {
+                if (!visited.has(neighbor)) {
+                    visited.add(neighbor);
+                    next.push(neighbor);
+                }
+            }
+        }
+        frontier = next;
+    }
+    visited.delete(root);
+    return [...visited];
+}
+//# sourceMappingURL=dependencyMap.js.map

package/dist/analyzers/graph/dependencyMap.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependencyMap.js","sourceRoot":"","sources":["../../../src/analyzers/graph/dependencyMap.ts"],"names":[],"mappings":"AAEA;;;;GAIG;AACH,MAAM,UAAU,iBAAiB,CAAC,SAAoB;IACpD,MAAM,OAAO,GAAc,EAAE,CAAC;IAE9B,KAAK,MAAM,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QAC7D,KAAK,MAAM,UAAU,IAAI,YAAY,EAAE,CAAC;YACtC,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,GAAG,EAAE,CAAC,CAAC;YACrE,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC/B,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAWD;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,EAAE,CAAC;AAEvC;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAC9B,KAAgB,EAChB,IAAY,EACZ,QAAgB,EAChB,UAA8F,EAAE;IAEhG,MAAM,SAAS,GAAG,OAAO,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,CAAC;IAC9C,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,IAAI,oBAAoB,CAAC;IAEhE,IAAI,QAAQ,IAAI,CAAC,EAAE,CAAC;QAClB,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IACtD,CAAC;IAED,MAAM,UAAU,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAC3C,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAClD,CAAC;IACF,MAAM,KAAK,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;IAC/C,MAAM,cAAc,GAAG,UAAU,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC;IAExD,MAAM,QAAQ,GAAkB,EAAE,CAAC;IACnC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,QAAQ,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;YAC3D,SAAS;QACX,CAAC;QACD,QAAQ,CAAC,IAAI,CACX,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,GAAG,CAAC,EAAE;YAC1C,SAAS,EAAE,CAAC,GAAG,SAAS,EAAE,IAAI,CAAC;YAC/B,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,WAAW;SACZ,CAAC,CACH,CAAC;IACJ,CAAC;IAED,OAAO;QACL,IAAI,EAAE,IAAI;QACV,QAAQ;QACR,OAAO,EAAE,KAAK;QACd,GAAG,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,cAAc,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAClD,CAAC;AACJ,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,uBAAuB,CACrC,KAAgB,EAChB,IAAY,EACZ,QAAgB;IAEhB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,IAAI,CAAC,CAAC,CAAC;IACxC,IAAI,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC;IAEtB,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,QAAQ,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACrE,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBACzC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;QACH,CAAC;QACD,QAAQ,GAAG,IAAI,CAAC;IAClB,CAAC;IAED,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACrB,OAAO,CAAC,GAAG,OAAO,CAAC,CAAC;AACtB,CAAC"}

package/dist/analyzers/graph/entryPoints.d.ts

@@ -0,0 +1,3 @@
+import type { FileGraph } from "./dependencyGraph.js";
+export declare function detectEntryPoints(graph: FileGraph): string[];
+//# sourceMappingURL=entryPoints.d.ts.map

package/dist/analyzers/graph/entryPoints.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"entryPoints.d.ts","sourceRoot":"","sources":["../../../src/analyzers/graph/entryPoints.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,sBAAsB,CAAC;AAWtD,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,SAAS,GAAG,MAAM,EAAE,CAS5D"}

package/dist/analyzers/graph/entryPoints.js

@@ -0,0 +1,21 @@
+import { isArchitectureSource } from "./sourceScope.js";
+const ENTRY_PATTERNS = [
+    /(^|\/)page\.[jt]sx?$/,
+    /(^|\/)layout\.[jt]sx?$/,
+    /(^|\/)middleware\.[jt]s$/,
+    /(^|\/)(server|app|index|main)\.[cm]?[jt]sx?$/,
+    /(^|\/)route\.[jt]s$/
+];
+export function detectEntryPoints(graph) {
+    const imported = new Set(Object.values(graph).flat());
+    return Object.keys(graph)
+        .filter((path) => isSourceFile(path))
+        .filter((path) => isArchitectureSource(path))
+        .filter((path) => ENTRY_PATTERNS.some((pattern) => pattern.test(path)) || (!imported.has(path) && (graph[path]?.length ?? 0) > 0))
+        .sort((a, b) => a.localeCompare(b))
+        .slice(0, 20);
+}
+function isSourceFile(path) {
+    return /\.[cm]?[jt]sx?$|\.vue$|\.svelte$|\.astro$/.test(path);
+}
+//# sourceMappingURL=entryPoints.js.map

package/dist/analyzers/graph/entryPoints.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"entryPoints.js","sourceRoot":"","sources":["../../../src/analyzers/graph/entryPoints.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,oBAAoB,EAAE,MAAM,kBAAkB,CAAC;AAExD,MAAM,cAAc,GAAG;IACrB,sBAAsB;IACtB,wBAAwB;IACxB,0BAA0B;IAC1B,8CAA8C;IAC9C,qBAAqB;CACtB,CAAC;AAEF,MAAM,UAAU,iBAAiB,CAAC,KAAgB;IAChD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;IAEtD,OAAO,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;SACtB,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;SACpC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;SAC5C,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;SACjI,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;SAClC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;AAClB,CAAC;AAED,SAAS,YAAY,CAAC,IAAY;IAChC,OAAO,2CAA2C,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAChE,CAAC"}

package/dist/analyzers/graph/index.d.ts

@@ -0,0 +1,7 @@
+export { buildDependencyGraph, countReferences, } from "./dependencyGraph.js";
+export type { FileGraph, } from "./dependencyGraph.js";
+export { detectEntryPoints, } from "./entryPoints.js";
+export { isArchitectureSource, } from "./sourceScope.js";
+export { buildReverseGraph, buildBoundedTree, collectNodesWithinDepth, DEFAULT_MAX_CHILDREN, } from "./dependencyMap.js";
+export type { MapTreeNode, } from "./dependencyMap.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/analyzers/graph/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/analyzers/graph/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,oBAAoB,EACpB,eAAe,GAChB,MAAM,sBAAsB,CAAC;AAC9B,YAAY,EACV,SAAS,GACV,MAAM,sBAAsB,CAAC;AAE9B,OAAO,EACL,iBAAiB,GAClB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EACL,oBAAoB,GACrB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EACL,iBAAiB,EACjB,gBAAgB,EAChB,uBAAuB,EACvB,oBAAoB,GACrB,MAAM,oBAAoB,CAAC;AAC5B,YAAY,EACV,WAAW,GACZ,MAAM,oBAAoB,CAAC"}

package/dist/analyzers/graph/index.js

@@ -0,0 +1,5 @@
+export { buildDependencyGraph, countReferences, } from "./dependencyGraph.js";
+export { detectEntryPoints, } from "./entryPoints.js";
+export { isArchitectureSource, } from "./sourceScope.js";
+export { buildReverseGraph, buildBoundedTree, collectNodesWithinDepth, DEFAULT_MAX_CHILDREN, } from "./dependencyMap.js";
+//# sourceMappingURL=index.js.map

package/dist/analyzers/graph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/analyzers/graph/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,oBAAoB,EACpB,eAAe,GAChB,MAAM,sBAAsB,CAAC;AAK9B,OAAO,EACL,iBAAiB,GAClB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EACL,oBAAoB,GACrB,MAAM,kBAAkB,CAAC;AAE1B,OAAO,EACL,iBAAiB,EACjB,gBAAgB,EAChB,uBAAuB,EACvB,oBAAoB,GACrB,MAAM,oBAAoB,CAAC"}

package/dist/analyzers/graph/sourceScope.d.ts

@@ -0,0 +1,2 @@
+export declare function isArchitectureSource(path: string): boolean;
+//# sourceMappingURL=sourceScope.d.ts.map

package/dist/analyzers/graph/sourceScope.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sourceScope.d.ts","sourceRoot":"","sources":["../../../src/analyzers/graph/sourceScope.ts"],"names":[],"mappings":"AAeA,wBAAgB,oBAAoB,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAkB1D"}