vue-hook-optimizer 0.0.14 → 0.0.16

package/dist/index.d.mts

@@ -1,6 +1,8 @@
 export { parse } from '@vue/compiler-sfc';
 import * as vis_network from 'vis-network';
 
+declare function analyze$2(content: string): Set<string>;
+
 type TypedNode = {
     label: string;
     type: NodeType;
@@ -10,8 +12,6 @@ declare enum NodeType {
     fun = "fun"
 }
 
-declare function analyze$2(content: string): Set<string>;
-
 declare function analyze$1(content: string): {
     nodes: Set<TypedNode>;
     edges: Map<TypedNode, Set<TypedNode>>;
@@ -22,10 +22,19 @@ declare function analyze(content: string): {
     edges: Map<TypedNode, Set<TypedNode>>;
 };
 
+declare enum SuggestionType {
+    'info' = "info",
+    'warning' = "warning",
+    'error' = "error"
+}
+type Suggestion = {
+    type: SuggestionType;
+    message: string;
+};
 declare function gen(graph: {
     nodes: Set<TypedNode>;
     edges: Map<TypedNode, Set<TypedNode>>;
-}, usedNodes: Set<string>): string[];
+}, usedNodes: Set<string>): Suggestion[];
 
 declare function getVisData(graph: {
     nodes: Set<TypedNode>;
@@ -35,4 +44,4 @@ declare function getVisData(graph: {
     edges: vis_network.Edge[];
 };
 
-export { NodeType, TypedNode, analyze as analyzeOptions, analyze$1 as analyzeSetupScript, analyze$2 as analyzeTemplate, gen, getVisData };
+export { NodeType, Suggestion, SuggestionType, TypedNode, analyze as analyzeOptions, analyze$1 as analyzeSetupScript, analyze$2 as analyzeTemplate, gen, getVisData };

package/dist/index.d.ts

@@ -1,6 +1,8 @@
 export { parse } from '@vue/compiler-sfc';
 import * as vis_network from 'vis-network';
 
+declare function analyze$2(content: string): Set<string>;
+
 type TypedNode = {
     label: string;
     type: NodeType;
@@ -10,8 +12,6 @@ declare enum NodeType {
     fun = "fun"
 }
 
-declare function analyze$2(content: string): Set<string>;
-
 declare function analyze$1(content: string): {
     nodes: Set<TypedNode>;
     edges: Map<TypedNode, Set<TypedNode>>;
@@ -22,10 +22,19 @@ declare function analyze(content: string): {
     edges: Map<TypedNode, Set<TypedNode>>;
 };
 
+declare enum SuggestionType {
+    'info' = "info",
+    'warning' = "warning",
+    'error' = "error"
+}
+type Suggestion = {
+    type: SuggestionType;
+    message: string;
+};
 declare function gen(graph: {
     nodes: Set<TypedNode>;
     edges: Map<TypedNode, Set<TypedNode>>;
-}, usedNodes: Set<string>): string[];
+}, usedNodes: Set<string>): Suggestion[];
 
 declare function getVisData(graph: {
     nodes: Set<TypedNode>;
@@ -35,4 +44,4 @@ declare function getVisData(graph: {
     edges: vis_network.Edge[];
 };
 
-export { NodeType, TypedNode, analyze as analyzeOptions, analyze$1 as analyzeSetupScript, analyze$2 as analyzeTemplate, gen, getVisData };
+export { NodeType, Suggestion, SuggestionType, TypedNode, analyze as analyzeOptions, analyze$1 as analyzeSetupScript, analyze$2 as analyzeTemplate, gen, getVisData };

package/dist/index.js

@@ -46323,6 +46323,7 @@ var require_lib13 = __commonJS({
 var src_exports = {};
 __export(src_exports, {
   NodeType: () => NodeType,
+  SuggestionType: () => SuggestionType,
   analyzeOptions: () => analyze3,
   analyzeSetupScript: () => analyze2,
   analyzeTemplate: () => analyze,
@@ -46332,55 +46333,6 @@ __export(src_exports, {
 });
 module.exports = __toCommonJS(src_exports);
 
-// src/analyze/utils.ts
-var NodeType = /* @__PURE__ */ ((NodeType3) => {
-  NodeType3["var"] = "var";
-  NodeType3["fun"] = "fun";
-  return NodeType3;
-})(NodeType || {});
-var NodeCollection = class {
-  nodes = /* @__PURE__ */ new Map();
-  addNode(label, node2, options = { isComputed: false }) {
-    if (this.nodes.has(label)) {
-      return;
-    }
-    if (!options.isComputed && (node2.type === "VariableDeclarator" && [
-      "ArrowFunctionExpression",
-      "FunctionDeclaration"
-    ].includes(node2.init?.type || "") || node2.type === "FunctionDeclaration" || node2.type === "ObjectMethod")) {
-      this.nodes.set(label, {
-        label,
-        type: "fun" /* fun */
-      });
-    } else {
-      this.nodes.set(label, {
-        label,
-        type: "var" /* var */
-      });
-    }
-  }
-  addTypedNode(label, node2) {
-    this.nodes.set(label, {
-      label,
-      type: node2.type
-    });
-  }
-  map(graph) {
-    const nodes = new Set(Array.from(graph.nodes).map((node2) => {
-      return this.nodes.get(node2);
-    }).filter((node2) => !!node2));
-    const edges = new Map(Array.from(graph.edges).map(([from2, to]) => {
-      return [this.nodes.get(from2), new Set(Array.from(to).map((node2) => {
-        return this.nodes.get(node2);
-      }).filter((node2) => !!node2))];
-    }));
-    return {
-      nodes,
-      edges
-    };
-  }
-};
-
 // node_modules/.pnpm/@vue+compiler-sfc@3.3.4/node_modules/@vue/compiler-sfc/dist/compiler-sfc.esm-browser.js
 function makeMap(str2, expectsLowerCase) {
   const map2 = /* @__PURE__ */ Object.create(null);
@@ -86324,6 +86276,57 @@ function analyze(content) {
 
 // src/analyze/setupScript.ts
 var import_traverse2 = __toESM(require_lib13());
+
+// src/analyze/utils.ts
+var NodeType = /* @__PURE__ */ ((NodeType3) => {
+  NodeType3["var"] = "var";
+  NodeType3["fun"] = "fun";
+  return NodeType3;
+})(NodeType || {});
+var NodeCollection = class {
+  nodes = /* @__PURE__ */ new Map();
+  addNode(label, node2, options = { isComputed: false }) {
+    if (this.nodes.has(label)) {
+      return;
+    }
+    if (!options.isComputed && (node2.type === "VariableDeclarator" && [
+      "ArrowFunctionExpression",
+      "FunctionDeclaration"
+    ].includes(node2.init?.type || "") || node2.type === "FunctionDeclaration" || node2.type === "ObjectMethod")) {
+      this.nodes.set(label, {
+        label,
+        type: "fun" /* fun */
+      });
+    } else {
+      this.nodes.set(label, {
+        label,
+        type: "var" /* var */
+      });
+    }
+  }
+  addTypedNode(label, node2) {
+    this.nodes.set(label, {
+      label,
+      type: node2.type
+    });
+  }
+  map(graph) {
+    const nodes = new Set(Array.from(graph.nodes).map((node2) => {
+      return this.nodes.get(node2);
+    }).filter((node2) => !!node2));
+    const edges = new Map(Array.from(graph.edges).map(([from2, to]) => {
+      return [this.nodes.get(from2), new Set(Array.from(to).map((node2) => {
+        return this.nodes.get(node2);
+      }).filter((node2) => !!node2))];
+    }));
+    return {
+      nodes,
+      edges
+    };
+  }
+};
+
+// src/analyze/setupScript.ts
 var traverse2 = (
   //@ts-ignore
   import_traverse2.default.default?.default || import_traverse2.default.default || import_traverse2.default
@@ -86883,27 +86886,99 @@ function noIndegreeFilter(graph) {
   });
   return nodes.filter((node2) => indegree.get(node2) === 0);
 }
+function removeVariable(graph, targets) {
+  const newTarget = /* @__PURE__ */ new Set();
+  targets.forEach((target) => {
+    if (target.type === "var" /* var */) {
+      const nodes = graph.get(target);
+      nodes?.forEach((node2) => {
+        newTarget.add(node2);
+      });
+    }
+    if (target.type === "fun" /* fun */) {
+      newTarget.add(target);
+    }
+  });
+  return newTarget;
+}
+function onlyFunctions(graph) {
+  const result2 = /* @__PURE__ */ new Map();
+  graph.forEach((targets, node2) => {
+    if (node2.type === "fun" /* fun */) {
+      const nodes = removeVariable(graph, targets);
+      result2.set(node2, nodes);
+    }
+  });
+  return result2;
+}
+
+// src/suggest/utils.ts
+function hasCycle(graph) {
+  const visited = /* @__PURE__ */ new Set();
+  function dfs2(node2) {
+    if (visited.has(node2)) {
+      return true;
+    }
+    visited.add(node2);
+    for (const neighbor of graph.get(node2) || /* @__PURE__ */ new Set()) {
+      if (dfs2(neighbor)) {
+        return true;
+      }
+    }
+    visited.delete(node2);
+    return false;
+  }
+  for (const [node2, targets] of graph) {
+    if (dfs2(node2)) {
+      return true;
+    }
+  }
+  return false;
+}
 
 // src/suggest/index.ts
+var SuggestionType = /* @__PURE__ */ ((SuggestionType2) => {
+  SuggestionType2["info"] = "info";
+  SuggestionType2["warning"] = "warning";
+  SuggestionType2["error"] = "error";
+  return SuggestionType2;
+})(SuggestionType || {});
 function gen(graph, usedNodes) {
-  const suggests = [];
+  const suggestions = [];
   const splitedGraph = splitGraph(graph.edges);
   splitedGraph.forEach((g) => {
     const nodes = Array.from(g.keys());
     if (splitedGraph.length > 1) {
-      suggests.push(`Node${nodes.length > 1 ? "s" : ""} [${nodes.length > 10 ? nodes.slice(0, 10).map((node2) => node2.label).join(",") + "...(" + nodes.length + ")" : nodes.map((node2) => node2.label).join(",")}] ${nodes.length > 1 ? "are" : "is"} isolated${nodes.length > 2 ? ", perhaps you can refactor them to an isolated file." : "."}`);
+      if (nodes.length > 2 && nodes.some((node2) => !usedNodes.has(node2.label))) {
+        suggestions.push({
+          type: "info" /* info */,
+          message: `Nodes [${nodes.length > 10 ? nodes.slice(0, 10).map((node2) => node2.label).join(",") + "...(" + nodes.length + ")" : nodes.map((node2) => node2.label).join(",")}] are isolated, perhaps you can refactor them to an isolated file.`
+        });
+      }
     }
-    if (nodes.every((node2) => !usedNodes.has(node2.label))) {
-      suggests.push(`Node${nodes.length > 1 ? "s" : ""} [${nodes.length > 10 ? nodes.slice(0, 10).map((node2) => node2.label).join(",") + "..." : nodes.map((node2) => node2.label).join(",")}] ${nodes.length > 1 ? "are" : "is"} not used, perhaps you can remove ${nodes.length > 1 ? "them" : "it"}.`);
+    if (nodes.length > 1 && nodes.every((node2) => !usedNodes.has(node2.label))) {
+      suggestions.push({
+        type: "info" /* info */,
+        message: `Nodes [${nodes.length > 10 ? nodes.slice(0, 10).map((node2) => node2.label).join(",") + "..." : nodes.map((node2) => node2.label).join(",")}] are not used, perhaps you can remove them.`
+      });
+    }
+    if (hasCycle(onlyFunctions(g))) {
+      suggestions.push({
+        type: "error" /* error */,
+        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 noIndegreeNodes = noIndegreeFilter(graph.edges);
   noIndegreeNodes.forEach((node2) => {
     if (!usedNodes.has(node2.label)) {
-      suggests.push(`Node [${node2.label}] is not used, perhaps you can remove it.`);
+      suggestions.push({
+        type: "info" /* info */,
+        message: `Node [${node2.label}] is not used, perhaps you can remove it.`
+      });
     }
   });
-  return suggests;
+  return suggestions;
 }
 
 // src/vis.ts
@@ -86942,6 +87017,7 @@ function getVisData(graph, usedNodes) {
 // Annotate the CommonJS export names for ESM import in node:
 0 && (module.exports = {
   NodeType,
+  SuggestionType,
   analyzeOptions,
   analyzeSetupScript,
   analyzeTemplate,