@atlaspack/graph 3.2.1-dev.3450 → 3.2.1-dev.3478

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@atlaspack/graph",
-  "version": "3.2.1-dev.3450+58845ef87",
+  "version": "3.2.1-dev.3478+5fd2da535",
   "description": "Blazing fast, zero configuration web application bundler",
   "license": "(MIT OR Apache-2.0)",
   "publishConfig": {
@@ -16,8 +16,8 @@
     "node": ">= 16.0.0"
   },
   "dependencies": {
-    "@atlaspack/feature-flags": "2.12.1-dev.3450+58845ef87",
+    "@atlaspack/feature-flags": "2.12.1-dev.3478+5fd2da535",
     "nullthrows": "^1.1.1"
   },
-  "gitHead": "58845ef87446fcedb7d7d8876440c64184645cbb"
+  "gitHead": "5fd2da535ecbe096d57e03aec15e80bb1d7601f7"
 }

package/src/AdjacencyList.js

@@ -301,7 +301,7 @@ export default class AdjacencyList<TEdgeType: number = 1> {
     // Copy the existing edges into the new array.
     nodes.nextId = this.#nodes.nextId;
     this.#edges.forEach(
-      edge =>
+      (edge) =>
         void link(
           this.#edges.from(edge),
           this.#edges.to(edge),
@@ -570,7 +570,7 @@ export default class AdjacencyList<TEdgeType: number = 1> {
       | NullEdgeType
       | Array<TEdgeType | NullEdgeType> = 1,
   ): NodeId[] {
-    let matches = node =>
+    let matches = (node) =>
       type === ALL_EDGE_TYPES ||
       (Array.isArray(type)
         ? type.includes(this.#nodes.typeOf(node))
@@ -628,7 +628,7 @@ export default class AdjacencyList<TEdgeType: number = 1> {
       | NullEdgeType
       | Array<TEdgeType | NullEdgeType> = 1,
   ): NodeId[] {
-    let matches = node =>
+    let matches = (node) =>
       type === ALL_EDGE_TYPES ||
       (Array.isArray(type)
         ? type.includes(this.#nodes.typeOf(node))

package/src/Graph.js

@@ -293,7 +293,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
   replaceNodeIdsConnectedTo(
     fromNodeId: NodeId,
     toNodeIds: $ReadOnlyArray<NodeId>,
-    replaceFilter?: null | (NodeId => boolean),
+    replaceFilter?: null | ((NodeId) => boolean),
     type?: TEdgeType | NullEdgeType = 1,
   ): void {
     this._assertHasNodeId(fromNodeId);
@@ -301,7 +301,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
     let outboundEdges = this.getNodeIdsConnectedFrom(fromNodeId, type);
     let childrenToRemove = new Set(
       replaceFilter
-        ? outboundEdges.filter(toNodeId => replaceFilter(toNodeId))
+        ? outboundEdges.filter((toNodeId) => replaceFilter(toNodeId))
         : outboundEdges,
     );
     for (let toNodeId of toNodeIds) {
@@ -337,7 +337,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
       return this.dfs({
         visit,
         startNodeId,
-        getChildren: nodeId => this.getNodeIdsConnectedFrom(nodeId, type),
+        getChildren: (nodeId) => this.getNodeIdsConnectedFrom(nodeId, type),
       });
     }
   }
@@ -363,7 +363,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
     return this.dfs({
       visit,
       startNodeId,
-      getChildren: nodeId => this.getNodeIdsConnectedTo(nodeId, type),
+      getChildren: (nodeId) => this.getNodeIdsConnectedTo(nodeId, type),
     });
   }
 
@@ -421,7 +421,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
         return context;
       }
 
-      this.adjacencyList.forEachNodeIdConnectedFromReverse(nodeId, child => {
+      this.adjacencyList.forEachNodeIdConnectedFromReverse(nodeId, (child) => {
         if (!visited.has(child)) {
           queue.push({nodeId: child, context});
         }
@@ -473,12 +473,15 @@ export default class Graph<TNode, TEdgeType: number = 1> {
       if (!visited.has(nodeId)) {
         visited.add(nodeId);
 
-        this.adjacencyList.forEachNodeIdConnectedFromReverse(nodeId, child => {
-          if (!visited.has(child)) {
-            queue.push(child);
-          }
-          return false;
-        });
+        this.adjacencyList.forEachNodeIdConnectedFromReverse(
+          nodeId,
+          (child) => {
+            if (!visited.has(child)) {
+              queue.push(child);
+            }
+            return false;
+          },
+        );
       } else {
         queue.pop();
         visit(nodeId, null, actions);
@@ -633,7 +636,7 @@ export default class Graph<TNode, TEdgeType: number = 1> {
     let sorted: Array<NodeId> = [];
     this.traverse(
       {
-        exit: nodeId => {
+        exit: (nodeId) => {
           sorted.push(nodeId);
         },
       },

package/test/AdjacencyList.test.js

@@ -289,7 +289,7 @@ describe('AdjacencyList', () => {
       let originalSerialized = graph.serialize();
       let originalNodes = [...originalSerialized.nodes];
       let originalEdges = [...originalSerialized.edges];
-      let work = new Promise(resolve => worker.on('message', resolve));
+      let work = new Promise((resolve) => worker.on('message', resolve));
       worker.postMessage(originalSerialized);
       let received = AdjacencyList.deserialize(await work);
       // eslint-disable-next-line no-unused-vars

package/test/BitSet.test.js

@@ -5,14 +5,14 @@ import {BitSet} from '../src/BitSet';
 
 function assertValues(set: BitSet, values: Array<number>) {
   let setValues = [];
-  set.forEach(bit => {
+  set.forEach((bit) => {
     setValues.push(bit);
   });
 
   for (let value of values) {
     assert(set.has(value), 'Set.has returned false');
     assert(
-      setValues.some(v => v === value),
+      setValues.some((v) => v === value),
       'Set values is missing value',
     );
   }

package/test/Graph.test.js

@@ -312,7 +312,7 @@ describe('Graph', () => {
 
     let visited = [];
     graph.traverse(
-      nodeId => {
+      (nodeId) => {
         visited.push(nodeId);
       },
       null, // use root as startNode