@aiready/context-analyzer 0.22.9 → 0.22.11

package/dist/chunk-GXTGOLZT.mjs

@@ -1,92 +0,0 @@
-// src/utils/dependency-graph-utils.ts
-function calculateImportDepthFromEdges(file, edges, visited = /* @__PURE__ */ new Set(), depth = 0) {
-  if (visited.has(file)) return depth;
-  const dependencies = edges.get(file);
-  if (!dependencies || dependencies.size === 0) return depth;
-  const nextVisited = new Set(visited);
-  nextVisited.add(file);
-  let maxDepth = depth;
-  for (const dep of dependencies) {
-    maxDepth = Math.max(
-      maxDepth,
-      calculateImportDepthFromEdges(dep, edges, nextVisited, depth + 1)
-    );
-  }
-  return maxDepth;
-}
-function getTransitiveDependenciesFromEdges(file, edges, visited = /* @__PURE__ */ new Set()) {
-  if (visited.has(file)) return [];
-  const nextVisited = new Set(visited);
-  nextVisited.add(file);
-  const dependencies = edges.get(file);
-  if (!dependencies || dependencies.size === 0) return [];
-  const allDeps = [];
-  for (const dep of dependencies) {
-    allDeps.push(dep);
-    allDeps.push(...getTransitiveDependenciesFromEdges(dep, edges, nextVisited));
-  }
-  return [...new Set(allDeps)];
-}
-function detectGraphCycles(edges) {
-  const cycles = [];
-  const visited = /* @__PURE__ */ new Set();
-  const recursionStack = /* @__PURE__ */ new Set();
-  function dfs(file, path) {
-    if (recursionStack.has(file)) {
-      const cycleStart = path.indexOf(file);
-      if (cycleStart !== -1) {
-        cycles.push([...path.slice(cycleStart), file]);
-      }
-      return;
-    }
-    if (visited.has(file)) return;
-    visited.add(file);
-    recursionStack.add(file);
-    const dependencies = edges.get(file);
-    if (dependencies) {
-      for (const dep of dependencies) {
-        dfs(dep, [...path, file]);
-      }
-    }
-    recursionStack.delete(file);
-  }
-  for (const file of edges.keys()) {
-    if (!visited.has(file)) {
-      dfs(file, []);
-    }
-  }
-  return cycles;
-}
-function detectGraphCyclesFromFile(file, edges) {
-  const cycles = [];
-  const visited = /* @__PURE__ */ new Set();
-  const recursionStack = /* @__PURE__ */ new Set();
-  function dfs(current, path) {
-    if (recursionStack.has(current)) {
-      const cycleStart = path.indexOf(current);
-      if (cycleStart !== -1) {
-        cycles.push([...path.slice(cycleStart), current]);
-      }
-      return;
-    }
-    if (visited.has(current)) return;
-    visited.add(current);
-    recursionStack.add(current);
-    const dependencies = edges.get(current);
-    if (dependencies) {
-      for (const dep of dependencies) {
-        dfs(dep, [...path, current]);
-      }
-    }
-    recursionStack.delete(current);
-  }
-  dfs(file, []);
-  return cycles;
-}
-
-export {
-  calculateImportDepthFromEdges,
-  getTransitiveDependenciesFromEdges,
-  detectGraphCycles,
-  detectGraphCyclesFromFile
-};