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

package/CHANGELOG.md

@@ -1,5 +1,17 @@
 # @atlaspack/bundler-experimental
 
+## 2.13.24
+
+### Patch Changes
+
+- Updated dependencies [[`069de47`](https://github.com/atlassian-labs/atlaspack/commit/069de478e64fb5889f6f2ce023eb510782767fbd)]:
+  - @atlaspack/feature-flags@2.20.0
+  - @atlaspack/core@2.20.0
+  - @atlaspack/types@2.15.11
+  - @atlaspack/graph@3.5.10
+  - @atlaspack/utils@2.17.3
+  - @atlaspack/plugin@2.14.21
+
 ## 2.13.23
 
 ### Patch Changes

package/lib/DominatorBundler/EdgeContentGraph.js

@@ -34,7 +34,7 @@ class EdgeContentGraph extends _graph().ContentGraph {
       const contentKey = this._nodeIdToContentKey.get(nodeId);
       if (node == null) {
         // Add null node to preserve node ids
-        // @ts-expect-error TS2345
+        // $FlowFixMe
         newGraph.addNode(null);
       } else if (contentKey == null) {
         newGraph.addNode(node);
@@ -43,7 +43,6 @@ class EdgeContentGraph extends _graph().ContentGraph {
       }
       nodeId += 1;
     }
-    // @ts-expect-error TS2488
     for (let edge of this.getAllEdges()) {
       const weight = this.getEdgeWeight(edge.from, edge.to);
       newGraph.addWeightedEdge(edge.from, edge.to, edge.type, weight);

package/lib/DominatorBundler/cycleBreaker/findStronglyConnectedComponents.js

@@ -48,9 +48,7 @@ function findStronglyConnectedComponents(graph) {
       let member;
       do {
         member = stack.pop();
-        // @ts-expect-error TS2538
         state[member].onStack = false;
-        // @ts-expect-error TS2345
         component.push(member);
       } while (member !== nodeId);
       result.push(component);

package/lib/DominatorBundler/findAssetDominators/simpleFastDominance.js

@@ -44,22 +44,15 @@ function simpleFastDominance(graph) {
     changed = false;
     for (let node of reversedPostOrder) {
       if (node === graph.rootNodeId) continue;
-
-      // @ts-expect-error TS7034
       let newImmediateDominator = null;
-      graph.forEachNodeIdConnectedTo(node,
-      // @ts-expect-error TS2345
-      predecessor => {
-        // @ts-expect-error TS7005
+      graph.forEachNodeIdConnectedTo(node, predecessor => {
         if (newImmediateDominator == null) {
           newImmediateDominator = predecessor;
         } else {
           if (dominators[predecessor] == null) {
             return;
           }
-          newImmediateDominator = intersect(postOrderIndexes, dominators, predecessor,
-          // @ts-expect-error TS7005
-          newImmediateDominator);
+          newImmediateDominator = intersect(postOrderIndexes, dominators, predecessor, newImmediateDominator);
         }
       }, _graph().ALL_EDGE_TYPES);
       if (dominators[node] !== newImmediateDominator) {
@@ -127,11 +120,9 @@ function intersect(postOrderIndexes, dominators, predecessor, newImmediateDomina
   let n2 = newImmediateDominator;
   while (n1 !== n2) {
     while (postOrderIndexes[n1] < postOrderIndexes[n2]) {
-      // @ts-expect-error TS7053
       n1 = Number(dominators[n1]);
     }
     while (postOrderIndexes[n2] < postOrderIndexes[n1]) {
-      // @ts-expect-error TS7053
       n2 = Number(dominators[n2]);
     }
   }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@atlaspack/bundler-experimental",
-  "version": "2.13.24-typescript-5b4d3ad41.0",
+  "version": "2.13.24",
   "license": "(MIT OR Apache-2.0)",
   "type": "commonjs",
   "publishConfig": {
@@ -10,29 +10,24 @@
     "type": "git",
     "url": "https://github.com/atlassian-labs/atlaspack.git"
   },
-  "main": "./lib/index.js",
-  "source": "./src/index.ts",
-  "types": "./lib/index.d.ts",
+  "main": "lib/index.js",
+  "source": "src/index.js",
   "engines": {
     "node": ">= 16.0.0"
   },
   "dependencies": {
-    "@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",
+    "@atlaspack/core": "2.20.0",
+    "@atlaspack/diagnostic": "2.14.1",
+    "@atlaspack/feature-flags": "2.20.0",
+    "@atlaspack/graph": "3.5.10",
+    "@atlaspack/logger": "2.14.13",
+    "@atlaspack/plugin": "2.14.21",
+    "@atlaspack/rust": "3.4.1",
+    "@atlaspack/types": "2.15.11",
+    "@atlaspack/utils": "2.17.3",
     "nullthrows": "^1.1.1"
   },
   "devDependencies": {
-    "@atlaspack/fs": "2.15.16-typescript-5b4d3ad41.0"
-  },
-  "scripts": {
-    "check-ts": "tsc --emitDeclarationOnly --rootDir src"
-  },
-  "gitHead": "5b4d3ad41ffa002b989ba77271bb3010a1f05b2a"
-}
+    "@atlaspack/fs": "2.15.16"
+  }
+}

package/src/DominatorBundler/{EdgeContentGraph.ts → EdgeContentGraph.js}

@@ -1,4 +1,6 @@
-import {ContentGraph, NodeId} from '@atlaspack/graph';
+// @flow strict-local
+
+import {ContentGraph, type NodeId} from '@atlaspack/graph';
 import nullthrows from 'nullthrows';
 
 /**
@@ -17,7 +19,7 @@ export class EdgeContentGraph<N, EW> extends ContentGraph<N, number> {
       const contentKey = this._nodeIdToContentKey.get(nodeId);
       if (node == null) {
         // Add null node to preserve node ids
-        // @ts-expect-error TS2345
+        // $FlowFixMe
         newGraph.addNode(null);
       } else if (contentKey == null) {
         newGraph.addNode(node);
@@ -26,7 +28,6 @@ export class EdgeContentGraph<N, EW> extends ContentGraph<N, number> {
       }
       nodeId += 1;
     }
-    // @ts-expect-error TS2488
     for (let edge of this.getAllEdges()) {
       const weight = this.getEdgeWeight(edge.from, edge.to);
       newGraph.addWeightedEdge(edge.from, edge.to, edge.type, weight);

package/src/DominatorBundler/cycleBreaker/{findStronglyConnectedComponents.ts → findStronglyConnectedComponents.js}

@@ -1,3 +1,5 @@
+// @flow strict-local
+
 import type {Graph, NodeId} from '@atlaspack/graph';
 
 export type StronglyConnectedComponent = NodeId[];
@@ -11,17 +13,17 @@ export type StronglyConnectedComponent = NodeId[];
  * * 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 function findStronglyConnectedComponents<T, E extends number>(
+export function findStronglyConnectedComponents<T, E: number>(
   graph: Graph<T, E>,
 ): StronglyConnectedComponent[] {
-  type State = {
-    index: null | NodeId;
-    lowlink: null | NodeId;
-    onStack: boolean;
-  };
-  const result: Array<StronglyConnectedComponent> = [];
+  type State = {|
+    index: null | NodeId,
+    lowlink: null | NodeId,
+    onStack: boolean,
+  |};
+  const result = [];
   let index = 0;
-  const stack: Array<NodeId | number> = [];
+  const stack = [];
   const state: State[] = new Array(graph.nodes.length).fill(null).map(() => ({
     index: null,
     lowlink: null,
@@ -32,7 +34,7 @@ export function findStronglyConnectedComponents<T, E extends number>(
       strongConnect(nodeId);
     }
   });
-  function strongConnect(nodeId: NodeId | number) {
+  function strongConnect(nodeId) {
     const nodeState = state[nodeId];
     nodeState.index = index;
     nodeState.lowlink = index;
@@ -60,14 +62,12 @@ export function findStronglyConnectedComponents<T, E extends number>(
     }
 
     if (nodeState.lowlink === nodeState.index) {
-      const component: Array<NodeId> = [];
+      const component = [];
       let member;
 
       do {
         member = stack.pop();
-        // @ts-expect-error TS2538
         state[member].onStack = false;
-        // @ts-expect-error TS2345
         component.push(member);
       } while (member !== nodeId);
 

package/src/DominatorBundler/findAssetDominators/{simpleFastDominance.ts → simpleFastDominance.js}

@@ -1,4 +1,6 @@
-import {NodeId, Graph, ALL_EDGE_TYPES} from '@atlaspack/graph';
+// @flow strict-local
+
+import {type NodeId, Graph, ALL_EDGE_TYPES} from '@atlaspack/graph';
 
 /**
  * Implements "A simple, fast dominance algorithm", to find the immediate
@@ -38,13 +40,10 @@ export function simpleFastDominance<T>(graph: Graph<T, number>): NodeId[] {
     for (let node of reversedPostOrder) {
       if (node === graph.rootNodeId) continue;
 
-      // @ts-expect-error TS7034
       let newImmediateDominator = null;
       graph.forEachNodeIdConnectedTo(
         node,
-        // @ts-expect-error TS2345
         (predecessor) => {
-          // @ts-expect-error TS7005
           if (newImmediateDominator == null) {
             newImmediateDominator = predecessor;
           } else {
@@ -56,7 +55,6 @@ export function simpleFastDominance<T>(graph: Graph<T, number>): NodeId[] {
               postOrderIndexes,
               dominators,
               predecessor,
-              // @ts-expect-error TS7005
               newImmediateDominator,
             );
           }
@@ -81,7 +79,7 @@ export function getGraphPostOrder<T>(
   graph: Graph<T, number>,
   type: number = 1,
 ): NodeId[] {
-  const postOrder: Array<NodeId> = [];
+  const postOrder = [];
   graph.traverse(
     {
       exit: (node) => {
@@ -134,7 +132,7 @@ export function getGraphPostOrder<T>(
  */
 export function intersect(
   postOrderIndexes: number[],
-  dominators: NodeId | null[],
+  dominators: (NodeId | null)[],
   predecessor: NodeId,
   newImmediateDominator: NodeId,
 ): NodeId {
@@ -142,11 +140,9 @@ export function intersect(
   let n2: number = newImmediateDominator;
   while (n1 !== n2) {
     while (postOrderIndexes[n1] < postOrderIndexes[n2]) {
-      // @ts-expect-error TS7053
       n1 = Number(dominators[n1]);
     }
     while (postOrderIndexes[n2] < postOrderIndexes[n1]) {
-      // @ts-expect-error TS7053
       n2 = Number(dominators[n2]);
     }
   }

package/test/DominatorBundler/{EdgeContentGraph.test.ts → EdgeContentGraph.test.js}

@@ -1,3 +1,5 @@
+// @flow strict-local
+
 import assert from 'assert';
 import {EdgeContentGraph} from '../../src/DominatorBundler/EdgeContentGraph';
 

package/test/DominatorBundler/cycleBreaker/{findStronglyConnectedComponents.ts → findStronglyConnectedComponents.js}

@@ -1,3 +1,5 @@
+// @flow strict-local
+
 import {Graph} from '@atlaspack/graph';
 import assert from 'assert';
 import {findStronglyConnectedComponents} from '../../../src/DominatorBundler/cycleBreaker/findStronglyConnectedComponents';

package/test/DominatorBundler/findAssetDominators/{simpleFastDominance.test.ts → simpleFastDominance.test.js}

@@ -1,3 +1,5 @@
+// @flow strict-local
+
 import assert from 'assert';
 import {Graph} from '@atlaspack/graph';
 import {simpleFastDominance} from '../../../src/DominatorBundler/findAssetDominators/simpleFastDominance';

package/test/{fixtureFromGraph.ts → fixtureFromGraph.js}

@@ -1,3 +1,5 @@
+// @flow strict-local
+
 /*!
  * This module provides a way to write fixtures where we don't care about the
  * code within the assets; only the shape of the asset graphs.
@@ -13,44 +15,44 @@ export type GraphEntry = AssetEntry;
 /**
  * An asset in the fixture graph. Just a path and dependencies
  */
-export type AssetEntry = {
-  type: 'asset';
-  value: {
-    filePath: string;
-    dependencies: DependencyEntry[];
-  };
-};
+export type AssetEntry = {|
+  type: 'asset',
+  value: {|
+    filePath: string,
+    dependencies: DependencyEntry[],
+  |},
+|};
 
 /**
  * Sync or async dependency between assets
  */
-export type DependencyEntry = {
-  type: 'dependency';
-  value: {
-    from: string;
-    to: string;
-    type: 'sync' | 'async';
-  };
-};
+export type DependencyEntry = {|
+  type: 'dependency',
+  value: {|
+    from: string,
+    to: string,
+    type: 'sync' | 'async',
+  |},
+|};
 
-export type DependencySpec = {
-  to: string;
-  type: 'sync' | 'async';
-};
+export type DependencySpec = {|
+  to: string,
+  type: 'sync' | 'async',
+|};
 
 /**
  * Create an asset node in the fixture graph
  */
 export function asset(
   path: string,
-  dependencies?: string | DependencySpec[],
+  dependencies?: (string | DependencySpec)[],
 ): GraphEntry {
   return {
     type: 'asset',
     value: {
       filePath: path,
       dependencies:
-        dependencies?.map((dependency: DependencySpec | string) => {
+        dependencies?.map((dependency) => {
           if (typeof dependency === 'string') {
             return {
               type: 'dependency',
@@ -157,7 +159,7 @@ export async function fixtureFromGraph(
  *
  */
 export function dotFromGraph(entries: GraphEntry[]): string {
-  const contents: Array<string> = [];
+  const contents = [];
 
   for (let entry of entries) {
     if (entry.type === 'asset') {

package/test/{fixtureFromGraph.test.ts → fixtureFromGraph.test.js}

@@ -1,3 +1,5 @@
+// @flow strict-local
+
 import {MemoryFS} from '@atlaspack/fs';
 import assert from 'assert';
 import {workerFarm} from '@atlaspack/test-utils';

package/LICENSE

@@ -1,201 +0,0 @@
-                                 Apache License
-                           Version 2.0, January 2004
-                        http://www.apache.org/licenses/
-
-   TERMS AND CONDITIONS FOR USE, REPRODUCTION, AND DISTRIBUTION
-
-   1. Definitions.
-
-      "License" shall mean the terms and conditions for use, reproduction,
-      and distribution as defined by Sections 1 through 9 of this document.
-
-      "Licensor" shall mean the copyright owner or entity authorized by
-      the copyright owner that is granting the License.
-
-      "Legal Entity" shall mean the union of the acting entity and all
-      other entities that control, are controlled by, or are under common
-      control with that entity. For the purposes of this definition,
-      "control" means (i) the power, direct or indirect, to cause the
-      direction or management of such entity, whether by contract or
-      otherwise, or (ii) ownership of fifty percent (50%) or more of the
-      outstanding shares, or (iii) beneficial ownership of such entity.
-
-      "You" (or "Your") shall mean an individual or Legal Entity
-      exercising permissions granted by this License.
-
-      "Source" form shall mean the preferred form for making modifications,
-      including but not limited to software source code, documentation
-      source, and configuration files.
-
-      "Object" form shall mean any form resulting from mechanical
-      transformation or translation of a Source form, including but
-      not limited to compiled object code, generated documentation,
-      and conversions to other media types.
-
-      "Work" shall mean the work of authorship, whether in Source or
-      Object form, made available under the License, as indicated by a
-      copyright notice that is included in or attached to the work
-      (an example is provided in the Appendix below).
-
-      "Derivative Works" shall mean any work, whether in Source or Object
-      form, that is based on (or derived from) the Work and for which the
-      editorial revisions, annotations, elaborations, or other modifications
-      represent, as a whole, an original work of authorship. For the purposes
-      of this License, Derivative Works shall not include works that remain
-      separable from, or merely link (or bind by name) to the interfaces of,
-      the Work and Derivative Works thereof.
-
-      "Contribution" shall mean any work of authorship, including
-      the original version of the Work and any modifications or additions
-      to that Work or Derivative Works thereof, that is intentionally
-      submitted to Licensor for inclusion in the Work by the copyright owner
-      or by an individual or Legal Entity authorized to submit on behalf of
-      the copyright owner. For the purposes of this definition, "submitted"
-      means any form of electronic, verbal, or written communication sent
-      to the Licensor or its representatives, including but not limited to
-      communication on electronic mailing lists, source code control systems,
-      and issue tracking systems that are managed by, or on behalf of, the
-      Licensor for the purpose of discussing and improving the Work, but
-      excluding communication that is conspicuously marked or otherwise
-      designated in writing by the copyright owner as "Not a Contribution."
-
-      "Contributor" shall mean Licensor and any individual or Legal Entity
-      on behalf of whom a Contribution has been received by Licensor and
-      subsequently incorporated within the Work.
-
-   2. Grant of Copyright License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      copyright license to reproduce, prepare Derivative Works of,
-      publicly display, publicly perform, sublicense, and distribute the
-      Work and such Derivative Works in Source or Object form.
-
-   3. Grant of Patent License. Subject to the terms and conditions of
-      this License, each Contributor hereby grants to You a perpetual,
-      worldwide, non-exclusive, no-charge, royalty-free, irrevocable
-      (except as stated in this section) patent license to make, have made,
-      use, offer to sell, sell, import, and otherwise transfer the Work,
-      where such license applies only to those patent claims licensable
-      by such Contributor that are necessarily infringed by their
-      Contribution(s) alone or by combination of their Contribution(s)
-      with the Work to which such Contribution(s) was submitted. If You
-      institute patent litigation against any entity (including a
-      cross-claim or counterclaim in a lawsuit) alleging that the Work
-      or a Contribution incorporated within the Work constitutes direct
-      or contributory patent infringement, then any patent licenses
-      granted to You under this License for that Work shall terminate
-      as of the date such litigation is filed.
-
-   4. Redistribution. You may reproduce and distribute copies of the
-      Work or Derivative Works thereof in any medium, with or without
-      modifications, and in Source or Object form, provided that You
-      meet the following conditions:
-
-      (a) You must give any other recipients of the Work or
-          Derivative Works a copy of this License; and
-
-      (b) You must cause any modified files to carry prominent notices
-          stating that You changed the files; and
-
-      (c) You must retain, in the Source form of any Derivative Works
-          that You distribute, all copyright, patent, trademark, and
-          attribution notices from the Source form of the Work,
-          excluding those notices that do not pertain to any part of
-          the Derivative Works; and
-
-      (d) If the Work includes a "NOTICE" text file as part of its
-          distribution, then any Derivative Works that You distribute must
-          include a readable copy of the attribution notices contained
-          within such NOTICE file, excluding those notices that do not
-          pertain to any part of the Derivative Works, in at least one
-          of the following places: within a NOTICE text file distributed
-          as part of the Derivative Works; within the Source form or
-          documentation, if provided along with the Derivative Works; or,
-          within a display generated by the Derivative Works, if and
-          wherever such third-party notices normally appear. The contents
-          of the NOTICE file are for informational purposes only and
-          do not modify the License. You may add Your own attribution
-          notices within Derivative Works that You distribute, alongside
-          or as an addendum to the NOTICE text from the Work, provided
-          that such additional attribution notices cannot be construed
-          as modifying the License.
-
-      You may add Your own copyright statement to Your modifications and
-      may provide additional or different license terms and conditions
-      for use, reproduction, or distribution of Your modifications, or
-      for any such Derivative Works as a whole, provided Your use,
-      reproduction, and distribution of the Work otherwise complies with
-      the conditions stated in this License.
-
-   5. Submission of Contributions. Unless You explicitly state otherwise,
-      any Contribution intentionally submitted for inclusion in the Work
-      by You to the Licensor shall be under the terms and conditions of
-      this License, without any additional terms or conditions.
-      Notwithstanding the above, nothing herein shall supersede or modify
-      the terms of any separate license agreement you may have executed
-      with Licensor regarding such Contributions.
-
-   6. Trademarks. This License does not grant permission to use the trade
-      names, trademarks, service marks, or product names of the Licensor,
-      except as required for reasonable and customary use in describing the
-      origin of the Work and reproducing the content of the NOTICE file.
-
-   7. Disclaimer of Warranty. Unless required by applicable law or
-      agreed to in writing, Licensor provides the Work (and each
-      Contributor provides its Contributions) on an "AS IS" BASIS,
-      WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or
-      implied, including, without limitation, any warranties or conditions
-      of TITLE, NON-INFRINGEMENT, MERCHANTABILITY, or FITNESS FOR A
-      PARTICULAR PURPOSE. You are solely responsible for determining the
-      appropriateness of using or redistributing the Work and assume any
-      risks associated with Your exercise of permissions under this License.
-
-   8. Limitation of Liability. In no event and under no legal theory,
-      whether in tort (including negligence), contract, or otherwise,
-      unless required by applicable law (such as deliberate and grossly
-      negligent acts) or agreed to in writing, shall any Contributor be
-      liable to You for damages, including any direct, indirect, special,
-      incidental, or consequential damages of any character arising as a
-      result of this License or out of the use or inability to use the
-      Work (including but not limited to damages for loss of goodwill,
-      work stoppage, computer failure or malfunction, or any and all
-      other commercial damages or losses), even if such Contributor
-      has been advised of the possibility of such damages.
-
-   9. Accepting Warranty or Additional Liability. While redistributing
-      the Work or Derivative Works thereof, You may choose to offer,
-      and charge a fee for, acceptance of support, warranty, indemnity,
-      or other liability obligations and/or rights consistent with this
-      License. However, in accepting such obligations, You may act only
-      on Your own behalf and on Your sole responsibility, not on behalf
-      of any other Contributor, and only if You agree to indemnify,
-      defend, and hold each Contributor harmless for any liability
-      incurred by, or claims asserted against, such Contributor by reason
-      of your accepting any such warranty or additional liability.
-
-   END OF TERMS AND CONDITIONS
-
-   APPENDIX: How to apply the Apache License to your work.
-
-      To apply the Apache License to your work, attach the following
-      boilerplate notice, with the fields enclosed by brackets "[]"
-      replaced with your own identifying information. (Don't include
-      the brackets!)  The text should be enclosed in the appropriate
-      comment syntax for the file format. We also recommend that a
-      file or class name and description of purpose be included on the
-      same "printed page" as the copyright notice for easier
-      identification within third-party archives.
-
-   Copyright (c) 2024 Atlassian US., Inc.
-
-   Licensed under the Apache License, Version 2.0 (the "License");
-   you may not use this file except in compliance with the License.
-   You may obtain a copy of the License at
-
-       http://www.apache.org/licenses/LICENSE-2.0
-
-   Unless required by applicable law or agreed to in writing, software
-   distributed under the License is distributed on an "AS IS" BASIS,
-   WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-   See the License for the specific language governing permissions and
-   limitations under the License.

package/lib/DominatorBundler/EdgeContentGraph.d.ts

@@ -1,13 +0,0 @@
-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

@@ -1,12 +0,0 @@
-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

@@ -1,58 +0,0 @@
-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/tsconfig.json

@@ -1,4 +0,0 @@
-{
-  "extends": "../../../tsconfig.json",
-  "include": ["src"]
-}