@parcel/graph 3.0.4-nightly.3069 → 3.0.4-nightly.3071

package/lib/Graph.js

@@ -257,6 +257,51 @@ class Graph {
     this._visited = visited;
     return null;
   }
+
+  // A post-order implementation of dfsFast
+  postOrderDfsFast(visit, startNodeId) {
+    let traversalStartNode = (0, _nullthrows().default)(startNodeId !== null && startNodeId !== void 0 ? startNodeId : this.rootNodeId, 'A start node is required to traverse');
+    this._assertHasNodeId(traversalStartNode);
+    let visited;
+    if (!this._visited || this._visited.capacity < this.nodes.length) {
+      this._visited = new _BitSet.BitSet(this.nodes.length);
+      visited = this._visited;
+    } else {
+      visited = this._visited;
+      visited.clear();
+    }
+    this._visited = null;
+    let stopped = false;
+    let actions = {
+      stop() {
+        stopped = true;
+      },
+      skipChildren() {
+        throw new Error('Calling skipChildren inside a post-order traversal is not allowed');
+      }
+    };
+    let queue = [traversalStartNode];
+    while (queue.length !== 0) {
+      let nodeId = queue[queue.length - 1];
+      if (!visited.has(nodeId)) {
+        visited.add(nodeId);
+        this.adjacencyList.forEachNodeIdConnectedFromReverse(nodeId, child => {
+          if (!visited.has(child)) {
+            queue.push(child);
+          }
+          return false;
+        });
+      } else {
+        queue.pop();
+        visit(nodeId, null, actions);
+        if (stopped) {
+          this._visited = visited;
+          return;
+        }
+      }
+    }
+    this._visited = visited;
+  }
   dfs({
     visit,
     startNodeId,

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@parcel/graph",
-  "version": "3.0.4-nightly.3069+65f8e21ad",
+  "version": "3.0.4-nightly.3071+273f94c8e",
   "description": "Blazing fast, zero configuration web application bundler",
   "license": "MIT",
   "publishConfig": {
@@ -22,5 +22,5 @@
   "dependencies": {
     "nullthrows": "^1.1.1"
   },
-  "gitHead": "65f8e21ad8a7c8c0770bd8c008e17ab702c1a0ab"
+  "gitHead": "273f94c8e6e478d328e329bd9787789469463522"
 }

package/src/Graph.js

@@ -388,6 +388,67 @@ export default class Graph<TNode, TEdgeType: number = 1> {
     return null;
   }
 
+  // A post-order implementation of dfsFast
+  postOrderDfsFast(
+    visit: GraphTraversalCallback<NodeId, TraversalActions>,
+    startNodeId: ?NodeId,
+  ): void {
+    let traversalStartNode = nullthrows(
+      startNodeId ?? this.rootNodeId,
+      'A start node is required to traverse',
+    );
+    this._assertHasNodeId(traversalStartNode);
+
+    let visited;
+    if (!this._visited || this._visited.capacity < this.nodes.length) {
+      this._visited = new BitSet(this.nodes.length);
+      visited = this._visited;
+    } else {
+      visited = this._visited;
+      visited.clear();
+    }
+    this._visited = null;
+
+    let stopped = false;
+    let actions: TraversalActions = {
+      stop() {
+        stopped = true;
+      },
+      skipChildren() {
+        throw new Error(
+          'Calling skipChildren inside a post-order traversal is not allowed',
+        );
+      },
+    };
+
+    let queue = [traversalStartNode];
+    while (queue.length !== 0) {
+      let nodeId = queue[queue.length - 1];
+
+      if (!visited.has(nodeId)) {
+        visited.add(nodeId);
+
+        this.adjacencyList.forEachNodeIdConnectedFromReverse(nodeId, child => {
+          if (!visited.has(child)) {
+            queue.push(child);
+          }
+          return false;
+        });
+      } else {
+        queue.pop();
+        visit(nodeId, null, actions);
+
+        if (stopped) {
+          this._visited = visited;
+          return;
+        }
+      }
+    }
+
+    this._visited = visited;
+    return;
+  }
+
   dfs<TContext>({
     visit,
     startNodeId,