@parcel/graph 2.0.2-nightly.2563 → 2.0.2-nightly.2571

package/lib/ContentGraph.js

@@ -65,6 +65,10 @@ class ContentGraph extends _Graph.default {
     return nodeId;
   }
 
+  addNodeByContentKeyIfNeeded(contentKey, node) {
+    return this.hasContentKey(contentKey) ? this.getNodeIdByContentKey(contentKey) : this.addNodeByContentKey(contentKey, node);
+  }
+
   getNodeByContentKey(contentKey) {
     let nodeId = this._contentKeyToNodeId.get(contentKey);
 

package/lib/Graph.js

@@ -338,6 +338,16 @@ class Graph {
     return null;
   }
 
+  topoSort() {
+    let sorted = [];
+    this.traverse({
+      exit: nodeId => {
+        sorted.push(nodeId);
+      }
+    });
+    return sorted.reverse();
+  }
+
   findAncestor(nodeId, fn) {
     let res = null;
     this.traverseAncestors(nodeId, (nodeId, ctx, traversal) => {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@parcel/graph",
-  "version": "2.0.2-nightly.2563+17404e9a",
+  "version": "2.0.2-nightly.2571+588bf4c0",
   "description": "Blazing fast, zero configuration web application bundler",
   "license": "MIT",
   "publishConfig": {
@@ -22,5 +22,5 @@
   "dependencies": {
     "nullthrows": "^1.1.1"
   },
-  "gitHead": "17404e9a9ee6323b973a681017937a4bc6966277"
+  "gitHead": "588bf4c0d6d9dac65a9bf89bf734d7684b523ca2"
 }

package/src/ContentGraph.js

@@ -62,6 +62,12 @@ export default class ContentGraph<TNode, TEdgeType: number = 1> extends Graph<
     return nodeId;
   }
 
+  addNodeByContentKeyIfNeeded(contentKey: ContentKey, node: TNode): NodeId {
+    return this.hasContentKey(contentKey)
+      ? this.getNodeIdByContentKey(contentKey)
+      : this.addNodeByContentKey(contentKey, node);
+  }
+
   getNodeByContentKey(contentKey: ContentKey): ?TNode {
     let nodeId = this._contentKeyToNodeId.get(contentKey);
     if (nodeId != null) {

package/src/Graph.js

@@ -403,6 +403,16 @@ export default class Graph<TNode, TEdgeType: number = 1> {
     return null;
   }
 
+  topoSort(): Array<NodeId> {
+    let sorted: Array<NodeId> = [];
+    this.traverse({
+      exit: nodeId => {
+        sorted.push(nodeId);
+      },
+    });
+    return sorted.reverse();
+  }
+
   findAncestor(nodeId: NodeId, fn: (nodeId: NodeId) => boolean): ?NodeId {
     let res = null;
     this.traverseAncestors(nodeId, (nodeId, ctx, traversal) => {

package/test/Graph.test.js

@@ -83,11 +83,14 @@ describe('Graph', () => {
 
   it('isOrphanedNode should return true or false if the node is orphaned or not', () => {
     let graph = new Graph();
+    let rootNode = graph.addNode('root');
+    graph.setRootNodeId(rootNode);
+
     let nodeA = graph.addNode('a');
     let nodeB = graph.addNode('b');
     let nodeC = graph.addNode('c');
-    graph.addEdge(nodeA, nodeB);
-    graph.addEdge(nodeA, nodeC, 1);
+    graph.addEdge(rootNode, nodeB);
+    graph.addEdge(nodeB, nodeC, 1);
     assert(graph.isOrphanedNode(nodeA));
     assert(!graph.isOrphanedNode(nodeB));
     assert(!graph.isOrphanedNode(nodeC));
@@ -101,6 +104,7 @@ describe('Graph', () => {
     //     c
     let graph = new Graph();
     let nodeA = graph.addNode('a');
+    graph.setRootNodeId(nodeA);
     let nodeB = graph.addNode('b');
     let nodeC = graph.addNode('c');
     let nodeD = graph.addNode('d');
@@ -140,6 +144,7 @@ describe('Graph', () => {
 
     let graph = new Graph();
     let nodeA = graph.addNode('a');
+    graph.setRootNodeId(nodeA);
     let nodeB = graph.addNode('b');
     let nodeC = graph.addNode('c');
     let nodeD = graph.addNode('d');
@@ -268,6 +273,7 @@ describe('Graph', () => {
   it("replaceNodeIdsConnectedTo should update a node's downstream nodes", () => {
     let graph = new Graph();
     let nodeA = graph.addNode('a');
+    graph.setRootNodeId(nodeA);
     let nodeB = graph.addNode('b');
     let nodeC = graph.addNode('c');
     graph.addEdge(nodeA, nodeB);