@atlaspack/bundler-experimental 2.13.24-typescript-b27501580.0 → 2.13.24-typescript-5b4d3ad41.0

package/lib/DominatorBundler/EdgeContentGraph.d.ts

@@ -0,0 +1,13 @@
+import { ContentGraph, NodeId } from '@atlaspack/graph';
+/**
+ * A `ContentGraph` that also stores weights on edges.
+ *
+ * @template N The type of the node weight.
+ * @template EW The type of the edge weight.
+ */
+export declare class EdgeContentGraph<N, EW> extends ContentGraph<N, number> {
+    #private;
+    clone(): EdgeContentGraph<N, EW>;
+    addWeightedEdge(from: NodeId, to: NodeId, type: number, weight: EW | null): void;
+    getEdgeWeight(from: NodeId, to: NodeId): EW | null;
+}

package/lib/DominatorBundler/cycleBreaker/findStronglyConnectedComponents.d.ts

@@ -0,0 +1,12 @@
+import type { Graph, NodeId } from '@atlaspack/graph';
+export type StronglyConnectedComponent = NodeId[];
+/**
+ * Robert Tarjan's algorithm to find strongly connected components in a graph.
+ *
+ * Time complexity: O(V + E)
+ * Space complexity (worst case): O(V)
+ *
+ * * https://web.archive.org/web/20170829214726id_/http://www.cs.ucsb.edu/~gilbert/cs240a/old/cs240aSpr2011/slides/TarjanDFS.pdf
+ * * https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm
+ */
+export declare function findStronglyConnectedComponents<T, E extends number>(graph: Graph<T, E>): StronglyConnectedComponent[];

package/lib/DominatorBundler/findAssetDominators/simpleFastDominance.d.ts

@@ -0,0 +1,58 @@
+import { NodeId, Graph } from '@atlaspack/graph';
+/**
+ * Implements "A simple, fast dominance algorithm", to find the immediate
+ * dominators of all nodes in a graph.
+ *
+ * Returns a map of node IDs to their immediate dominator's node ID.
+ * This map is represented by an array where the index is the node ID and the
+ * value is its dominator.
+ *
+ * For example, given a node `3`, `dominators[3]` is the immediate dominator
+ * of node 3.
+ *
+ * - https://www.cs.tufts.edu/comp/150FP/archive/keith-cooper/dom14.pdf
+ */
+export declare function simpleFastDominance<T>(graph: Graph<T, number>): NodeId[];
+/**
+ * Return the post-order of the graph.
+ */
+export declare function getGraphPostOrder<T>(graph: Graph<T, number>, type?: number): NodeId[];
+/**
+ * From "A Simple, Fast Dominance Algorithm"
+ * Keith D. Cooper, Timothy J. Harvey, and Ken Kennedy:
+ *
+ * > The intersection routine appears at the bottom of the figure.
+ * > It implements a “two-finger” algorithm – one can imagine a finger pointing
+ * > to each dominator set, each finger moving independently as the comparisons
+ * > dictate. In this case, the comparisons are on postorder numbers; for each
+ * > intersection, we start the two fingers at the ends of the two sets, and,
+ * > until the fingers point to the same postorder number, we move the finger
+ * > pointing to the smaller number back one element. Remember that nodes higher
+ * > in the dominator tree have higher postorder numbers, which is why intersect
+ * > moves the finger whose value is less than the other finger’s. When the two
+ * > fingers point at the same element, intersect returns that element. The set
+ * > resulting from the intersection begins with the returned element and chains
+ * > its way up the doms array to the entry node.
+ *
+ * `postOrder` is the post-order node list of the graph.
+ *
+ * `dominators` is the current immediate dominator state for node in the graph.
+ *
+ * This is coupled with the fact node ids are indexes into an array. It is a map
+ * of NodeId -> NodeId, where the value at index `i` is the immediate dominator
+ * of the node `i`.
+ *
+ * `predecessor` is one predecessor node id of the node we're currently
+ * computing the immediate dominator for.
+ *
+ * `newImmediateDominator` is current best immediate dominator candidate for the
+ * node we're computing the immediate dominator for.
+ *
+ * The algorithm is intersecting the dominator sets of the two predecessors and
+ * returning dominator node with the highest post-order number by walking up
+ * the dominator tree until the two sets intersect.
+ *
+ * The node with the highest post-order index is the immediate dominator, as
+ * it is the closest to the node we're computing for.
+ */
+export declare function intersect(postOrderIndexes: number[], dominators: NodeId | null[], predecessor: NodeId, newImmediateDominator: NodeId): NodeId;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@atlaspack/bundler-experimental",
-  "version": "2.13.24-typescript-b27501580.0",
+  "version": "2.13.24-typescript-5b4d3ad41.0",
   "license": "(MIT OR Apache-2.0)",
   "type": "commonjs",
   "publishConfig": {
@@ -17,22 +17,22 @@
     "node": ">= 16.0.0"
   },
   "dependencies": {
-    "@atlaspack/core": "2.19.3-typescript-b27501580.0",
-    "@atlaspack/diagnostic": "2.14.2-typescript-b27501580.0",
-    "@atlaspack/feature-flags": "2.19.3-typescript-b27501580.0",
-    "@atlaspack/graph": "3.5.10-typescript-b27501580.0",
-    "@atlaspack/logger": "2.14.14-typescript-b27501580.0",
-    "@atlaspack/plugin": "2.14.21-typescript-b27501580.0",
-    "@atlaspack/rust": "3.4.2-typescript-b27501580.0",
-    "@atlaspack/types": "2.15.11-typescript-b27501580.0",
-    "@atlaspack/utils": "2.17.3-typescript-b27501580.0",
+    "@atlaspack/core": "2.19.3-typescript-5b4d3ad41.0",
+    "@atlaspack/diagnostic": "2.14.2-typescript-5b4d3ad41.0",
+    "@atlaspack/feature-flags": "2.19.3-typescript-5b4d3ad41.0",
+    "@atlaspack/graph": "3.5.10-typescript-5b4d3ad41.0",
+    "@atlaspack/logger": "2.14.14-typescript-5b4d3ad41.0",
+    "@atlaspack/plugin": "2.14.21-typescript-5b4d3ad41.0",
+    "@atlaspack/rust": "3.4.2-typescript-5b4d3ad41.0",
+    "@atlaspack/types": "2.15.11-typescript-5b4d3ad41.0",
+    "@atlaspack/utils": "2.17.3-typescript-5b4d3ad41.0",
     "nullthrows": "^1.1.1"
   },
   "devDependencies": {
-    "@atlaspack/fs": "2.15.16-typescript-b27501580.0"
+    "@atlaspack/fs": "2.15.16-typescript-5b4d3ad41.0"
   },
   "scripts": {
     "check-ts": "tsc --emitDeclarationOnly --rootDir src"
   },
-  "gitHead": "b275015805a058452afb6fb48c078ecd4de925f2"
+  "gitHead": "5b4d3ad41ffa002b989ba77271bb3010a1f05b2a"
 }