vue-hook-optimizer 0.0.18 → 0.0.20

package/dist/index.js

@@ -86886,6 +86886,15 @@ function noIndegreeFilter(graph) {
   });
   return nodes.filter((node2) => indegree.get(node2) === 0);
 }
+function noOutdegreeFilter(graph) {
+  const zeroOutdegreeNodes = [];
+  for (let [node2, edges] of graph.entries()) {
+    if (edges.size === 0) {
+      zeroOutdegreeNodes.push(node2);
+    }
+  }
+  return zeroOutdegreeNodes;
+}
 function removeVariable(graph, targets) {
   const newTarget = /* @__PURE__ */ new Set();
   targets.forEach((target) => {
@@ -86911,6 +86920,64 @@ function onlyFunctions(graph) {
   });
   return result2;
 }
+function findLinearPaths(graph) {
+  let linearPaths = [];
+  let visitedNodes = /* @__PURE__ */ new Set();
+  for (let [node2, edges] of graph.entries()) {
+    if (edges.size === 1 && !visitedNodes.has(node2)) {
+      let path2 = [node2];
+      let nextNode = Array.from(edges)[0];
+      visitedNodes.add(node2);
+      while (graph.get(nextNode)?.size === 1) {
+        path2.push(nextNode);
+        visitedNodes.add(nextNode);
+        nextNode = Array.from(graph.get(nextNode))[0];
+      }
+      if (path2.length > 1) {
+        linearPaths.push(path2);
+      }
+    }
+  }
+  return linearPaths;
+}
+function findArticulationPoints(graph) {
+  const noIndegreeNodes = noIndegreeFilter(graph);
+  let time = 0;
+  const low = /* @__PURE__ */ new Map();
+  const disc = /* @__PURE__ */ new Map();
+  const parent = /* @__PURE__ */ new Map();
+  const ap = /* @__PURE__ */ new Set();
+  const visited = /* @__PURE__ */ new Set();
+  function APUtil(graph2, node2) {
+    let children = 0;
+    disc.set(node2, time);
+    low.set(node2, time);
+    time++;
+    visited.add(node2);
+    for (let neighbor of graph2.get(node2) || []) {
+      if (!visited.has(neighbor)) {
+        children++;
+        parent.set(neighbor, node2);
+        APUtil(graph2, neighbor);
+        low.set(node2, Math.min(low.get(node2), low.get(neighbor)));
+        if (parent.get(node2) === null && children > 1) {
+          ap.add(node2);
+        }
+        if (parent.get(node2) !== null && low.get(neighbor) >= disc.get(node2)) {
+          ap.add(node2);
+        }
+      } else if (neighbor !== parent.get(node2)) {
+        low.set(node2, Math.min(low.get(node2), disc.get(neighbor)));
+      }
+    }
+  }
+  for (let node2 of graph.keys()) {
+    if (!visited.has(node2) && !noIndegreeNodes.includes(node2)) {
+      APUtil(graph, node2);
+    }
+  }
+  return ap;
+}
 
 // src/suggest/utils.ts
 function hasCycle(graph) {
@@ -86968,6 +87035,23 @@ function gen(graph, usedNodes) {
         message: `There is a loop call in nodes [${nodes.length > 10 ? nodes.slice(0, 10).map((node2) => node2.label).join(",") + "...(" + nodes.length + ")" : nodes.map((node2) => node2.label).join(",")}], perhaps you can refactor it.`
       });
     }
+    const paths = findLinearPaths(g);
+    paths.forEach((path2) => {
+      suggestions.push({
+        type: "warning" /* warning */,
+        message: `Nodes [${path2.length > 10 ? path2.slice(0, 10).map((node2) => node2.label).join(",") + "...(" + path2.length + ")" : path2.map((node2) => node2.label).join(",")}] are have function chain calls, perhaps you can refactor it.`
+      });
+    });
+    if (g.size > 5) {
+      const ap = findArticulationPoints(g);
+      ap.forEach((node2) => {
+        suggestions.push({
+          type: "info" /* info */,
+          // eslint-disable-next-line max-len
+          message: `Node [${node2.label}] is an articulation point, perhaps you need to pay special attention to this node.`
+        });
+      });
+    }
   });
   const noIndegreeNodes = noIndegreeFilter(graph.edges);
   noIndegreeNodes.forEach((node2) => {
@@ -86978,6 +87062,15 @@ function gen(graph, usedNodes) {
       });
     }
   });
+  const noOutdegreeNodes = noOutdegreeFilter(graph.edges);
+  noOutdegreeNodes.forEach((node2) => {
+    if (!usedNodes.has(node2.label)) {
+      suggestions.push({
+        type: "info" /* info */,
+        message: `Node [${node2.label}] is not used, perhaps you can remove it.`
+      });
+    }
+  });
   return suggestions;
 }