vue-hook-optimizer 0.0.81 → 0.0.82

package/dist/index.cjs

@@ -1703,8 +1703,21 @@ function buildUndirectedGraph(graph) {
 	}
 	return undirected;
 }
-function sortNodesDeterministically(nodes) {
-	return [...nodes].sort((a, b) => a.label.localeCompare(b.label));
+function createSeededRandom(seed) {
+	if (seed === void 0) return Math.random;
+	let state = seed;
+	return () => {
+		state = state * 1103515245 + 12345 & 2147483647;
+		return state / 2147483647;
+	};
+}
+function shuffleArray(array, random = Math.random) {
+	const result = [...array];
+	for (let i = result.length - 1; i > 0; i--) {
+		const j = Math.floor(random() * (i + 1));
+		[result[i], result[j]] = [result[j], result[i]];
+	}
+	return result;
 }
 /**
 * Label Propagation Algorithm for community detection.
@@ -1716,7 +1729,9 @@ function sortNodesDeterministically(nodes) {
 * This helps identify groups of nodes that are tightly connected
 * and could potentially be extracted into separate hooks.
 */
-function detectCommunities(graph, maxIterations = 100) {
+function detectCommunities(graph, options = {}) {
+	const { maxIterations = 100 } = options;
+	const random = createSeededRandom(options.seed);
 	const undirectedGraph = buildUndirectedGraph(graph);
 	const nodes = Array.from(undirectedGraph.keys());
 	if (nodes.length === 0) return {
@@ -1732,8 +1747,8 @@ function detectCommunities(graph, maxIterations = 100) {
 	while (changed && iterations < maxIterations) {
 		changed = false;
 		iterations++;
-		const sortedNodes = sortNodesDeterministically(nodes);
-		for (const node of sortedNodes) {
+		const shuffledNodes = shuffleArray(nodes, random);
+		for (const node of shuffledNodes) {
 			const neighbors = undirectedGraph.get(node);
 			if (!neighbors || neighbors.size === 0) continue;
 			const labelCounts = /* @__PURE__ */ new Map();
@@ -1749,7 +1764,7 @@ function detectCommunities(graph, maxIterations = 100) {
 			} else if (count === maxCount) maxLabels.push(label);
 			const currentLabel = labels.get(node);
 			if (maxLabels.includes(currentLabel)) continue;
-			const newLabel = Math.min(...maxLabels);
+			const newLabel = maxLabels[Math.floor(random() * maxLabels.length)];
 			if (newLabel !== currentLabel) {
 				labels.set(node, newLabel);
 				changed = true;
@@ -2052,7 +2067,7 @@ let SuggestionType = /* @__PURE__ */ function(SuggestionType$1) {
 	return SuggestionType$1;
 }({});
 function gen(graph, nodesUsedInTemplate, nodesUsedInStyle = /* @__PURE__ */ new Set(), options) {
-	const { ellipsis = true } = options ?? {};
+	const { ellipsis = true, communitySeed } = options ?? {};
 	const usedNodes = new Set([...nodesUsedInTemplate, ...nodesUsedInStyle]);
 	const suggestions = [];
 	const splitedGraph = splitGraph(graph.edges);
@@ -2106,7 +2121,7 @@ function gen(graph, nodesUsedInTemplate, nodesUsedInStyle = /* @__PURE__ */ new
 			nodeInfo: node
 		});
 	});
-	const communityResult = detectCommunities(graph.edges);
+	const communityResult = detectCommunities(graph.edges, { seed: communitySeed });
 	const { communities } = communityResult;
 	const extractableCommunities = communities.filter((community) => {
 		const nodes = Array.from(community.nodes);