@graphty/algorithms 1.0.1 → 1.2.0

package/dist/test/unit/pagerank.test.js

@@ -1,281 +0,0 @@
-/* eslint-disable dot-notation */
-import { describe, expect, it } from "vitest";
-import { pageRank, pageRankCentrality, personalizedPageRank, topPageRankNodes, } from "../../src/algorithms/centrality/pagerank.js";
-import { Graph } from "../../src/core/graph.js";
-describe("PageRank Algorithm", () => {
-    describe("pageRank", () => {
-        it("should calculate PageRank for a simple directed graph", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "A");
-            const result = pageRank(graph);
-            expect(result.converged).toBe(true);
-            expect(result.iterations).toBeLessThan(100);
-            // In a cycle, all nodes should have equal PageRank
-            expect(result.ranks["A"]).toBeCloseTo(result.ranks["B"] ?? 0, 5);
-            expect(result.ranks["B"]).toBeCloseTo(result.ranks["C"] ?? 0, 5);
-            // Sum should be approximately 1
-            const sum = Object.values(result.ranks).reduce((a, b) => a + b, 0);
-            expect(sum).toBeCloseTo(1, 5);
-        });
-        it("should throw error for undirected graph", () => {
-            const graph = new Graph({ directed: false });
-            graph.addEdge("A", "B");
-            expect(() => {
-                pageRank(graph);
-            }).toThrow("PageRank requires a directed graph");
-        });
-        it("should handle dangling nodes", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            // C is a dangling node (no outgoing edges)
-            const result = pageRank(graph);
-            expect(result.converged).toBe(true);
-            // C should still have some PageRank due to random surfer model
-            expect(result.ranks["C"]).toBeGreaterThan(0);
-        });
-        it("should handle empty graph", () => {
-            const graph = new Graph({ directed: true });
-            const result = pageRank(graph);
-            expect(result.converged).toBe(true);
-            expect(result.iterations).toBe(0);
-            expect(result.ranks).toEqual({});
-        });
-        it("should handle single node", () => {
-            const graph = new Graph({ directed: true });
-            graph.addNode("A");
-            const result = pageRank(graph);
-            expect(result.converged).toBe(true);
-            expect(result.ranks["A"]).toBeCloseTo(1);
-        });
-        it("should handle self-loops", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "A");
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "A");
-            const result = pageRank(graph);
-            expect(result.converged).toBe(true);
-            const sum = Object.values(result.ranks).reduce((a, b) => a + b, 0);
-            expect(sum).toBeCloseTo(1, 5);
-        });
-        it("should respect damping factor", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            const result1 = pageRank(graph, { dampingFactor: 0.85 });
-            const result2 = pageRank(graph, { dampingFactor: 0.5 });
-            // Different damping factors should produce different results
-            expect(result1.ranks["A"]).not.toBeCloseTo(result2.ranks["A"] ?? 0, 2);
-        });
-        it("should throw error for invalid damping factor", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            expect(() => {
-                pageRank(graph, { dampingFactor: -0.1 });
-            }).toThrow("Damping factor must be between 0 and 1");
-            expect(() => {
-                pageRank(graph, { dampingFactor: 1.1 });
-            }).toThrow("Damping factor must be between 0 and 1");
-        });
-        it("should respect tolerance parameter", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "A");
-            const result1 = pageRank(graph, { tolerance: 1e-6 });
-            const result2 = pageRank(graph, { tolerance: 1e-3 });
-            // Looser tolerance should converge faster
-            expect(result2.iterations).toBeLessThanOrEqual(result1.iterations);
-        });
-        it("should handle max iterations limit", () => {
-            const graph = new Graph({ directed: true });
-            // Create a simple graph
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "A");
-            const result = pageRank(graph, { maxIterations: 2, tolerance: 1e-10 });
-            expect(result.iterations).toBeLessThanOrEqual(2);
-            // With very strict tolerance and only 2 iterations, should not converge
-            if (result.iterations === 2) {
-                expect(result.converged).toBe(false);
-            }
-        });
-        it("should handle initial ranks", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "A");
-            const initialRanks = new Map([
-                ["A", 0.5],
-                ["B", 0.3],
-                ["C", 0.2],
-            ]);
-            const result = pageRank(graph, { initialRanks, maxIterations: 1 });
-            // After one iteration, ranks should have changed from initial
-            expect(result.ranks["A"]).not.toBeCloseTo(0.5);
-        });
-        it("should handle weighted PageRank", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            graph.addEdge("A", "C");
-            graph.addEdge("B", "D");
-            graph.addEdge("C", "D");
-            const result = pageRank(graph);
-            expect(result.converged).toBe(true);
-            // Basic PageRank should work
-            const sum = Object.values(result.ranks).reduce((a, b) => a + b, 0);
-            expect(sum).toBeCloseTo(1, 5);
-        });
-        it("should handle star graph", () => {
-            const graph = new Graph({ directed: true });
-            // All nodes point to center
-            graph.addEdge("A", "center");
-            graph.addEdge("B", "center");
-            graph.addEdge("C", "center");
-            graph.addEdge("D", "center");
-            const result = pageRank(graph);
-            // Center should have highest PageRank
-            expect(result.ranks["center"]).toBeGreaterThan(result.ranks["A"] ?? 0);
-            expect(result.ranks["center"]).toBeGreaterThan(result.ranks["B"] ?? 0);
-        });
-        it("should handle complex graph structure", () => {
-            const graph = new Graph({ directed: true });
-            // Create a more complex structure
-            graph.addEdge("A", "B");
-            graph.addEdge("A", "C");
-            graph.addEdge("B", "C");
-            graph.addEdge("B", "D");
-            graph.addEdge("C", "A");
-            graph.addEdge("C", "D");
-            graph.addEdge("D", "A");
-            const result = pageRank(graph);
-            expect(result.converged).toBe(true);
-            const sum = Object.values(result.ranks).reduce((a, b) => a + b, 0);
-            expect(sum).toBeCloseTo(1, 5);
-        });
-    });
-    describe("personalizedPageRank", () => {
-        it("should calculate personalized PageRank", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "A");
-            graph.addEdge("C", "D");
-            const result = personalizedPageRank(graph, ["A"]);
-            expect(result.converged).toBe(true);
-            // A should have higher rank in personalized PageRank
-            expect(result.ranks["A"]).toBeGreaterThan(result.ranks["D"] ?? 0);
-        });
-        it("should handle multiple personal nodes", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "D");
-            graph.addEdge("D", "A");
-            const result = personalizedPageRank(graph, ["A", "C"]);
-            expect(result.converged).toBe(true);
-            // A and C should have relatively higher ranks
-            const avgPersonal = ((result.ranks["A"] ?? 0) + (result.ranks["C"] ?? 0)) / 2;
-            const avgOther = ((result.ranks["B"] ?? 0) + (result.ranks["D"] ?? 0)) / 2;
-            expect(avgPersonal).toBeGreaterThan(avgOther);
-        });
-        it("should throw error for non-existent personal node", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            expect(() => {
-                personalizedPageRank(graph, ["X"]);
-            }).toThrow("Personal node X not found in graph");
-        });
-        it("should handle empty personal nodes array", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            // Empty array will cause division by zero when calculating personalValue
-            const result = personalizedPageRank(graph, []);
-            // Should handle gracefully, all values will be NaN or 0
-            expect(result.converged).toBeDefined();
-        });
-    });
-    describe("pageRankCentrality", () => {
-        it("should return PageRank scores as centrality", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "A");
-            const centrality = pageRankCentrality(graph);
-            expect(centrality).toHaveProperty("A");
-            expect(centrality).toHaveProperty("B");
-            expect(centrality).toHaveProperty("C");
-            const sum = Object.values(centrality).reduce((a, b) => a + b, 0);
-            expect(sum).toBeCloseTo(1, 5);
-        });
-        it("should accept options", () => {
-            const graph = new Graph({ directed: true });
-            // Create a more complex graph where damping factor matters
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            graph.addEdge("C", "D");
-            graph.addEdge("D", "E");
-            graph.addEdge("E", "A");
-            graph.addEdge("C", "A"); // Extra edge
-            const centrality1 = pageRankCentrality(graph, { dampingFactor: 0.9 });
-            const centrality2 = pageRankCentrality(graph, { dampingFactor: 0.1 });
-            // Very different damping factors should produce different results
-            // At least one node should have noticeably different centrality
-            let maxDiff = 0;
-            for (const node of ["A", "B", "C", "D", "E"]) {
-                const diff = Math.abs((centrality1[node] ?? 0) - (centrality2[node] ?? 0));
-                maxDiff = Math.max(maxDiff, diff);
-            }
-            expect(maxDiff).toBeGreaterThan(0.01);
-        });
-    });
-    describe("topPageRankNodes", () => {
-        it("should return top k nodes by PageRank", () => {
-            const graph = new Graph({ directed: true });
-            // Create a hub-like structure
-            graph.addEdge("A", "hub");
-            graph.addEdge("B", "hub");
-            graph.addEdge("C", "hub");
-            graph.addEdge("D", "hub");
-            graph.addEdge("E", "hub");
-            graph.addEdge("hub", "out");
-            const top2 = topPageRankNodes(graph, 2);
-            expect(top2).toHaveLength(2);
-            // Hub should be in top 2
-            const nodes = top2.map((n) => n.node);
-            expect(nodes).toContain("hub");
-            expect(top2[0]?.rank ?? 0).toBeGreaterThanOrEqual(top2[1]?.rank ?? 0);
-        });
-        it("should handle k larger than number of nodes", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            graph.addEdge("B", "C");
-            const top5 = topPageRankNodes(graph, 5);
-            expect(top5).toHaveLength(3);
-        });
-        it("should handle k = 0", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            const top0 = topPageRankNodes(graph, 0);
-            expect(top0).toHaveLength(0);
-        });
-        it("should handle empty graph", () => {
-            const graph = new Graph({ directed: true });
-            const top3 = topPageRankNodes(graph, 3);
-            expect(top3).toHaveLength(0);
-        });
-        it("should work with weighted PageRank", () => {
-            const graph = new Graph({ directed: true });
-            graph.addEdge("A", "B");
-            graph.addEdge("A", "C");
-            graph.addEdge("B", "D");
-            graph.addEdge("C", "D");
-            const top2 = topPageRankNodes(graph, 2);
-            expect(top2).toHaveLength(2);
-            expect(top2[0]?.rank ?? 0).toBeGreaterThanOrEqual(top2[1]?.rank ?? 0);
-        });
-    });
-});
-//# sourceMappingURL=pagerank.test.js.map

package/dist/test/unit/pagerank.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"pagerank.test.js","sourceRoot":"","sources":["../../../test/unit/pagerank.test.ts"],"names":[],"mappings":"AAAA,iCAAiC;AACjC,OAAO,EAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAC,MAAM,QAAQ,CAAC;AAE5C,OAAO,EACH,QAAQ,EACR,kBAAkB,EAClB,oBAAoB,EACpB,gBAAgB,GACnB,MAAM,6CAA6C,CAAC;AACrD,OAAO,EAAC,KAAK,EAAC,MAAM,yBAAyB,CAAC;AAE9C,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;IAChC,QAAQ,CAAC,UAAU,EAAE,GAAG,EAAE;QACtB,EAAE,CAAC,uDAAuD,EAAE,GAAG,EAAE;YAC7D,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAE/B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC;YAE5C,mDAAmD;YACnD,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YACjE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;YAEjE,gCAAgC;YAChC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACnE,MAAM,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YAC/C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,KAAK,EAAC,CAAC,CAAC;YAC3C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,CAAC,GAAG,EAAE;gBACR,QAAQ,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC,CAAC,CAAC,OAAO,CAAC,oCAAoC,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;YACpC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,2CAA2C;YAE3C,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAE/B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,+DAA+D;YAC/D,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACjD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACjC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAE1C,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAE/B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACjC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;YAEnB,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAE/B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YAChC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAE/B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACnE,MAAM,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACrC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAC,aAAa,EAAE,IAAI,EAAC,CAAC,CAAC;YACvD,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAC,aAAa,EAAE,GAAG,EAAC,CAAC,CAAC;YAEtD,6DAA6D;YAC7D,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;QAC3E,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+CAA+C,EAAE,GAAG,EAAE;YACrD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,CAAC,GAAG,EAAE;gBACR,QAAQ,CAAC,KAAK,EAAE,EAAC,aAAa,EAAE,CAAC,GAAG,EAAC,CAAC,CAAC;YAC3C,CAAC,CAAC,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC;YAErD,MAAM,CAAC,GAAG,EAAE;gBACR,QAAQ,CAAC,KAAK,EAAE,EAAC,aAAa,EAAE,GAAG,EAAC,CAAC,CAAC;YAC1C,CAAC,CAAC,CAAC,OAAO,CAAC,wCAAwC,CAAC,CAAC;QACzD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC1C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAC,SAAS,EAAE,IAAI,EAAC,CAAC,CAAC;YACnD,MAAM,OAAO,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAC,SAAS,EAAE,IAAI,EAAC,CAAC,CAAC;YAEnD,0CAA0C;YAC1C,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,mBAAmB,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QACvE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC1C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,wBAAwB;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAC,aAAa,EAAE,CAAC,EAAE,SAAS,EAAE,KAAK,EAAC,CAAC,CAAC;YAErE,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAAC;YACjD,wEAAwE;YACxE,IAAI,MAAM,CAAC,UAAU,KAAK,CAAC,EAAE,CAAC;gBAC1B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACnC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC;gBACzB,CAAC,GAAG,EAAE,GAAG,CAAC;gBACV,CAAC,GAAG,EAAE,GAAG,CAAC;gBACV,CAAC,GAAG,EAAE,GAAG,CAAC;aACb,CAAC,CAAC;YAEH,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,EAAE,EAAC,YAAY,EAAE,aAAa,EAAE,CAAC,EAAC,CAAC,CAAC;YAEjE,8DAA8D;YAC9D,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;QACnD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACvC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAE/B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,6BAA6B;YAC7B,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACnE,MAAM,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YAChC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,4BAA4B;YAC5B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YAC7B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YAC7B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YAC7B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC;YAE7B,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAE/B,sCAAsC;YACtC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;YACvE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3E,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC7C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,kCAAkC;YAClC,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,MAAM,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;YAE/B,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACnE,MAAM,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAClC,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAC9C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YAElD,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,qDAAqD;YACrD,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,eAAe,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACtE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC7C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;YAEvD,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACpC,8CAA8C;YAC9C,MAAM,WAAW,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9E,MAAM,QAAQ,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3E,MAAM,CAAC,WAAW,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YACzD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,CAAC,GAAG,EAAE;gBACR,oBAAoB,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;YACvC,CAAC,CAAC,CAAC,OAAO,CAAC,oCAAoC,CAAC,CAAC;QACrD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YAChD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,yEAAyE;YACzE,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YAC/C,wDAAwD;YACxD,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,WAAW,EAAE,CAAC;QAC3C,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAChC,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACnD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,UAAU,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;YAE7C,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,CAAC,UAAU,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC;YAEvC,MAAM,GAAG,GAAG,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;YACjE,MAAM,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAClC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,uBAAuB,EAAE,GAAG,EAAE;YAC7B,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,2DAA2D;YAC3D,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC,aAAa;YAEtC,MAAM,WAAW,GAAG,kBAAkB,CAAC,KAAK,EAAE,EAAC,aAAa,EAAE,GAAG,EAAC,CAAC,CAAC;YACpE,MAAM,WAAW,GAAG,kBAAkB,CAAC,KAAK,EAAE,EAAC,aAAa,EAAE,GAAG,EAAC,CAAC,CAAC;YAEpE,kEAAkE;YAClE,gEAAgE;YAChE,IAAI,OAAO,GAAG,CAAC,CAAC;YAChB,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;gBAC3C,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC3E,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;YACtC,CAAC;YACD,MAAM,CAAC,OAAO,CAAC,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC9B,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC7C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,8BAA8B;YAC9B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;YAC1B,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAE5B,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAExC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC7B,yBAAyB;YACzB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACtC,MAAM,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YAC/B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;QAC1E,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACnD,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAExC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC3B,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAExC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACjC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAE1C,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAExC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC1C,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;YAC1C,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACxB,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAExB,MAAM,IAAI,GAAG,gBAAgB,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAExC,MAAM,CAAC,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC7B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC,CAAC;QAC1E,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACP,CAAC,CAAC,CAAC"}

package/dist/test/unit/priority-queue.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=priority-queue.test.d.ts.map

package/dist/test/unit/priority-queue.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"priority-queue.test.d.ts","sourceRoot":"","sources":["../../../test/unit/priority-queue.test.ts"],"names":[],"mappings":""}

package/dist/test/unit/priority-queue.test.js

@@ -1,189 +0,0 @@
-import { describe, expect, it } from "vitest";
-import { PriorityQueue } from "../../src/data-structures/priority-queue.js";
-describe("PriorityQueue", () => {
-    describe("constructor", () => {
-        it("should create an empty priority queue", () => {
-            const pq = new PriorityQueue();
-            expect(pq.isEmpty()).toBe(true);
-            expect(pq.size()).toBe(0);
-            expect(pq.peek()).toBeUndefined();
-        });
-        it("should accept custom comparison function", () => {
-            // Max-heap (reverse of default min-heap)
-            const pq = new PriorityQueue((a, b) => b - a);
-            pq.enqueue("low", 1);
-            pq.enqueue("high", 10);
-            pq.enqueue("medium", 5);
-            expect(pq.dequeue()).toBe("high");
-            expect(pq.dequeue()).toBe("medium");
-            expect(pq.dequeue()).toBe("low");
-        });
-    });
-    describe("enqueue and dequeue", () => {
-        it("should maintain min-heap property by default", () => {
-            const pq = new PriorityQueue();
-            pq.enqueue("medium", 5);
-            pq.enqueue("high", 10);
-            pq.enqueue("low", 1);
-            pq.enqueue("lowest", 0);
-            expect(pq.dequeue()).toBe("lowest");
-            expect(pq.dequeue()).toBe("low");
-            expect(pq.dequeue()).toBe("medium");
-            expect(pq.dequeue()).toBe("high");
-        });
-        it("should handle equal priorities correctly", () => {
-            const pq = new PriorityQueue();
-            pq.enqueue("first", 5);
-            pq.enqueue("second", 5);
-            pq.enqueue("third", 5);
-            // Should maintain some consistent order
-            const results = [pq.dequeue(), pq.dequeue(), pq.dequeue()];
-            expect(results).toContain("first");
-            expect(results).toContain("second");
-            expect(results).toContain("third");
-        });
-        it("should return undefined when dequeuing from empty queue", () => {
-            const pq = new PriorityQueue();
-            expect(pq.dequeue()).toBeUndefined();
-        });
-        it("should handle single element correctly", () => {
-            const pq = new PriorityQueue();
-            pq.enqueue("only", 42);
-            expect(pq.size()).toBe(1);
-            expect(pq.peek()).toBe("only");
-            expect(pq.dequeue()).toBe("only");
-            expect(pq.isEmpty()).toBe(true);
-        });
-    });
-    describe("peek", () => {
-        it("should return highest priority item without removing it", () => {
-            const pq = new PriorityQueue();
-            pq.enqueue("medium", 5);
-            pq.enqueue("low", 1);
-            pq.enqueue("high", 10);
-            expect(pq.peek()).toBe("low");
-            expect(pq.size()).toBe(3);
-            expect(pq.peek()).toBe("low"); // Should still be there
-        });
-        it("should return undefined for empty queue", () => {
-            const pq = new PriorityQueue();
-            expect(pq.peek()).toBeUndefined();
-        });
-    });
-    describe("updatePriority", () => {
-        it("should update priority and maintain heap property", () => {
-            const pq = new PriorityQueue();
-            pq.enqueue("a", 5);
-            pq.enqueue("b", 10);
-            pq.enqueue("c", 15);
-            expect(pq.updatePriority("b", 1)).toBe(true);
-            expect(pq.dequeue()).toBe("b"); // Should now be highest priority
-        });
-        it("should return false for non-existent item", () => {
-            const pq = new PriorityQueue();
-            pq.enqueue("a", 5);
-            expect(pq.updatePriority("nonexistent", 1)).toBe(false);
-        });
-        it("should handle priority increase correctly", () => {
-            const pq = new PriorityQueue();
-            pq.enqueue("a", 1);
-            pq.enqueue("b", 5);
-            pq.enqueue("c", 10);
-            expect(pq.updatePriority("a", 15)).toBe(true);
-            expect(pq.dequeue()).toBe("b"); // 'a' should now be last
-            expect(pq.dequeue()).toBe("c");
-            expect(pq.dequeue()).toBe("a");
-        });
-    });
-    describe("clear", () => {
-        it("should remove all items from queue", () => {
-            const pq = new PriorityQueue();
-            pq.enqueue("a", 1);
-            pq.enqueue("b", 2);
-            pq.enqueue("c", 3);
-            expect(pq.size()).toBe(3);
-            pq.clear();
-            expect(pq.size()).toBe(0);
-            expect(pq.isEmpty()).toBe(true);
-            expect(pq.peek()).toBeUndefined();
-        });
-    });
-    describe("toArray", () => {
-        it("should return array representation of queue", () => {
-            const pq = new PriorityQueue();
-            pq.enqueue("a", 1);
-            pq.enqueue("b", 2);
-            pq.enqueue("c", 3);
-            const array = pq.toArray();
-            expect(array).toHaveLength(3);
-            expect(array.every((item) => typeof item.item === "string")).toBe(true);
-            expect(array.every((item) => typeof item.priority === "number")).toBe(true);
-        });
-        it("should return copy of internal array", () => {
-            const pq = new PriorityQueue();
-            pq.enqueue("a", 1);
-            const array1 = pq.toArray();
-            const array2 = pq.toArray();
-            expect(array1).not.toBe(array2); // Different array instances
-            expect(array1).toEqual(array2); // But same content
-        });
-    });
-    describe("stress test", () => {
-        it("should handle large number of operations efficiently", () => {
-            const pq = new PriorityQueue();
-            const items = 1000;
-            // Add items in random order
-            for (let i = 0; i < items; i++) {
-                pq.enqueue(i, Math.random() * 1000);
-            }
-            expect(pq.size()).toBe(items);
-            // Dequeue all items - should come out in priority order
-            const lastPriority = -Infinity;
-            for (let i = 0; i < items; i++) {
-                const item = pq.dequeue();
-                expect(item).toBeDefined();
-                // Get the priority from the remaining queue state
-                // This is a simplified check since we can't easily get the priority of dequeued item
-                if (!pq.isEmpty()) {
-                    // The next item should have equal or higher priority (min-heap)
-                    const nextArray = pq.toArray();
-                    if (nextArray.length > 0) {
-                        const minPriority = Math.min(...nextArray.map((x) => x.priority));
-                        expect(minPriority).toBeGreaterThanOrEqual(lastPriority);
-                    }
-                }
-            }
-            expect(pq.isEmpty()).toBe(true);
-        });
-    });
-    describe("edge cases", () => {
-        it("should handle negative priorities", () => {
-            const pq = new PriorityQueue();
-            pq.enqueue("negative", -5);
-            pq.enqueue("positive", 5);
-            pq.enqueue("zero", 0);
-            expect(pq.dequeue()).toBe("negative");
-            expect(pq.dequeue()).toBe("zero");
-            expect(pq.dequeue()).toBe("positive");
-        });
-        it("should handle floating point priorities", () => {
-            const pq = new PriorityQueue();
-            pq.enqueue("a", 1.5);
-            pq.enqueue("b", 1.1);
-            pq.enqueue("c", 1.9);
-            expect(pq.dequeue()).toBe("b");
-            expect(pq.dequeue()).toBe("a");
-            expect(pq.dequeue()).toBe("c");
-        });
-        it("should handle complex objects as items", () => {
-            const pq = new PriorityQueue();
-            const item1 = { id: "1", value: 100 };
-            const item2 = { id: "2", value: 200 };
-            pq.enqueue(item1, 10);
-            pq.enqueue(item2, 5);
-            expect(pq.dequeue()).toBe(item2);
-            expect(pq.dequeue()).toBe(item1);
-        });
-    });
-});
-//# sourceMappingURL=priority-queue.test.js.map

package/dist/test/unit/priority-queue.test.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"priority-queue.test.js","sourceRoot":"","sources":["../../../test/unit/priority-queue.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,QAAQ,EAAE,MAAM,EAAE,EAAE,EAAC,MAAM,QAAQ,CAAC;AAE5C,OAAO,EAAC,aAAa,EAAC,MAAM,6CAA6C,CAAC;AAE1E,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC3B,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;YAC7C,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YAChD,yCAAyC;YACzC,MAAM,EAAE,GAAG,IAAI,aAAa,CAAS,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAEtD,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACrB,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YACvB,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YAExB,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAClC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACpC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,qBAAqB,EAAE,GAAG,EAAE;QACjC,EAAE,CAAC,8CAA8C,EAAE,GAAG,EAAE;YACpD,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YACxB,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YACvB,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACrB,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YAExB,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACpC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACpC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YAChD,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YACvB,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YACxB,EAAE,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC;YAEvB,wCAAwC;YACxC,MAAM,OAAO,GAAG,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC;YAC3D,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;YACnC,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;YACpC,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC;QACvC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;YAC/D,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAC9C,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAEvB,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC/B,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAClC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,MAAM,EAAE,GAAG,EAAE;QAClB,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;YAC/D,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,EAAE,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;YACxB,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YACrB,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;YAEvB,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC9B,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,wBAAwB;QAC3D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YAC/C,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;QACtC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC5B,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;YACzD,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACnB,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YACpB,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAEpB,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC7C,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,iCAAiC;QACrE,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACjD,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAEnB,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5D,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;YACjD,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACnB,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACnB,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;YAEpB,MAAM,CAAC,EAAE,CAAC,cAAc,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC9C,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,yBAAyB;YACzD,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/B,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACnB,EAAE,CAAC,oCAAoC,EAAE,GAAG,EAAE;YAC1C,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACnB,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACnB,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAEnB,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,EAAE,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC1B,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,aAAa,EAAE,CAAC;QACtC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,SAAS,EAAE,GAAG,EAAE;QACrB,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACnD,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACnB,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACnB,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAEnB,MAAM,KAAK,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC;YAC3B,MAAM,CAAC,KAAK,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;YAC9B,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,IAAI,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChF,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;YAC5C,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YAEnB,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC;YAC5B,MAAM,MAAM,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC;YAE5B,MAAM,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,4BAA4B;YAC7D,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,mBAAmB;QACvD,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,aAAa,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,sDAAsD,EAAE,GAAG,EAAE;YAC5D,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YACvC,MAAM,KAAK,GAAG,IAAI,CAAC;YAEnB,4BAA4B;YAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,EAAE,CAAC,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC;YACxC,CAAC;YAED,MAAM,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAE9B,wDAAwD;YACxD,MAAM,YAAY,GAAG,CAAC,QAAQ,CAAC;YAC/B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7B,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC;gBAC1B,MAAM,CAAC,IAAI,CAAC,CAAC,WAAW,EAAE,CAAC;gBAE3B,kDAAkD;gBAClD,qFAAqF;gBACrF,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,CAAC;oBAChB,gEAAgE;oBAChE,MAAM,SAAS,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC;oBAC/B,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;wBACvB,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,GAAI,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;wBACnE,MAAM,CAAC,WAAW,CAAC,CAAC,sBAAsB,CAAC,YAAY,CAAC,CAAC;oBAC7D,CAAC;gBACL,CAAC;YACL,CAAC;YAED,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QACxB,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YACzC,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,EAAE,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3B,EAAE,CAAC,OAAO,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YAC1B,EAAE,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAEtB,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACtC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAClC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yCAAyC,EAAE,GAAG,EAAE;YAC/C,MAAM,EAAE,GAAG,IAAI,aAAa,EAAU,CAAC;YAEvC,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACrB,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACrB,EAAE,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YAErB,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/B,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/B,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAM9C,MAAM,EAAE,GAAG,IAAI,aAAa,EAAY,CAAC;YAEzC,MAAM,KAAK,GAAa,EAAC,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAC,CAAC;YAC9C,MAAM,KAAK,GAAa,EAAC,EAAE,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,EAAC,CAAC;YAE9C,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YACtB,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;YAErB,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;IACP,CAAC,CAAC,CAAC;AACP,CAAC,CAAC,CAAC"}

package/dist/test/unit/union-find.test.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=union-find.test.d.ts.map

package/dist/test/unit/union-find.test.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"union-find.test.d.ts","sourceRoot":"","sources":["../../../test/unit/union-find.test.ts"],"names":[],"mappings":""}