@atlaspack/graph 3.5.7-unified-e330ff3d9.0 → 3.5.7-unified-f92fba5b6.0

package/lib/AdjacencyList.js

@@ -1359,7 +1359,8 @@ function link(from, to, type, edges, nodes, unloadFactor = DEFAULT_PARAMS.unload
   // Since the space occupied by deleted edges isn't reclaimed,
   // we include them in our count to avoid overflowing the `edges` array.
   let deletes = edges.deletes;
-  if (edges.getLoad(count + deletes) >= 1) {
+  let total = count + deletes;
+  if (edges.getLoad(total) >= 1) {
     if (edges.getLoad(deletes) >= unloadFactor && edges.getLoad(count) < unloadFactor) {
       // If we have a significant number of deletes, reclaim the space.
       return LinkResult.TooManyDeletes;

package/lib/BitSet.js

@@ -9,7 +9,8 @@ function ctz32(n) {
   if (n === 0) {
     return 32;
   }
-  return 31 - Math.clz32(n & -n);
+  let reversed = n & -n;
+  return 31 - Math.clz32(reversed);
 }
 class BitSet {
   constructor(maxBits) {
@@ -34,13 +35,19 @@ class BitSet {
     return this.bits.length * 32;
   }
   add(bit) {
-    this.bits[bit >>> 5] |= 1 << (bit & 31);
+    let i = bit >>> 5;
+    let b = bit & 31;
+    this.bits[i] |= 1 << b;
   }
   delete(bit) {
-    this.bits[bit >>> 5] &= ~(1 << (bit & 31));
+    let i = bit >>> 5;
+    let b = bit & 31;
+    this.bits[i] &= ~(1 << b);
   }
   has(bit) {
-    return Boolean(this.bits[bit >>> 5] & 1 << (bit & 31));
+    let i = bit >>> 5;
+    let b = bit & 31;
+    return Boolean(this.bits[i] & 1 << b);
   }
   empty() {
     for (let k = 0; k < this.bits.length; k++) {

package/lib/Graph.js

@@ -324,6 +324,7 @@ class Graph {
       }
     }
     this._visited = visited;
+    return;
   }
 
   /**
@@ -506,7 +507,7 @@ class Graph {
 exports.default = Graph;
 function mapVisitor(filter, visit) {
   function makeEnter(visit) {
-    return function (nodeId, context, actions) {
+    return function mappedEnter(nodeId, context, actions) {
       let value = filter(nodeId, actions);
       if (value != null) {
         return visit(value, context, actions);
@@ -521,7 +522,7 @@ function mapVisitor(filter, visit) {
     mapped.enter = makeEnter(visit.enter);
   }
   if (visit.exit != null) {
-    mapped.exit = function (nodeId, context, actions) {
+    mapped.exit = function mappedExit(nodeId, context, actions) {
       let exit = visit.exit;
       if (!exit) {
         return;

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@atlaspack/graph",
-  "version": "3.5.7-unified-e330ff3d9.0",
+  "version": "3.5.7-unified-f92fba5b6.0",
   "description": "Blazing fast, zero configuration web application bundler",
   "license": "(MIT OR Apache-2.0)",
   "publishConfig": {
@@ -19,13 +19,13 @@
     "benchmark": "node ./benchmark/BitSet.js"
   },
   "dependencies": {
-    "@atlaspack/feature-flags": "2.18.5-unified-e330ff3d9.0",
+    "@atlaspack/feature-flags": "2.18.5-unified-f92fba5b6.0",
     "nullthrows": "^1.1.1"
   },
   "devDependencies": {
-    "@atlaspack/babel-register": "2.14.2-unified-e330ff3d9.0",
+    "@atlaspack/babel-register": "2.14.2-unified-f92fba5b6.0",
     "benny": "^3.7.1"
   },
   "type": "commonjs",
-  "gitHead": "e330ff3d90fbf336f87439a65e312d698433990b"
+  "gitHead": "f92fba5b6216e1d94cbd23f3a5d61f7188d49199"
 }