@atlaspack/graph 3.2.1-dev.3565 → 3.2.1-dev.3566

package/lib/AdjacencyList.js

@@ -467,16 +467,19 @@ class AdjacencyList {
       node = this.#nodes.next(node);
     }
   }
-  forEachNodeIdConnectedTo(to, fn) {
+  forEachNodeIdConnectedTo(to, fn, type = 1) {
+    const matches = node => type === _Graph.ALL_EDGE_TYPES || type === this.#nodes.typeOf(node);
     let node = this.#nodes.head(to);
     while (node !== null) {
-      let edge = this.#nodes.firstIn(node);
-      while (edge !== null) {
-        let from = this.#edges.from(edge);
-        if (fn(from)) {
-          return;
+      if (matches(node)) {
+        let edge = this.#nodes.firstIn(node);
+        while (edge !== null) {
+          let from = this.#edges.from(edge);
+          if (fn(from)) {
+            return;
+          }
+          edge = this.#edges.nextIn(edge);
         }
-        edge = this.#edges.nextIn(edge);
       }
       node = this.#nodes.next(node);
     }

package/lib/Graph.js

@@ -85,9 +85,9 @@ class Graph {
   hasEdge(from, to, type = 1) {
     return this.adjacencyList.hasEdge(from, to, type);
   }
-  forEachNodeIdConnectedTo(to, fn) {
+  forEachNodeIdConnectedTo(to, fn, type = ALL_EDGE_TYPES) {
     this._assertHasNodeId(to);
-    this.adjacencyList.forEachNodeIdConnectedTo(to, fn);
+    this.adjacencyList.forEachNodeIdConnectedTo(to, fn, type);
   }
   forEachNodeIdConnectedFrom(from, fn, type = ALL_EDGE_TYPES) {
     this._assertHasNodeId(from);

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@atlaspack/graph",
-  "version": "3.2.1-dev.3565+b31bc6b33",
+  "version": "3.2.1-dev.3566+facdfb05f",
   "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.3565+b31bc6b33",
+    "@atlaspack/feature-flags": "2.12.1-dev.3566+facdfb05f",
     "nullthrows": "^1.1.1"
   },
-  "gitHead": "b31bc6b33de40c158b9f4d8ff177238be0de409d"
+  "gitHead": "facdfb05f693e50037a82a4afa101adf093fd8c9"
 }

package/src/AdjacencyList.js

@@ -619,16 +619,25 @@ export default class AdjacencyList<TEdgeType: number = 1> {
     }
   }
 
-  forEachNodeIdConnectedTo(to: NodeId, fn: (nodeId: NodeId) => boolean | void) {
+  forEachNodeIdConnectedTo(
+    to: NodeId,
+    fn: (nodeId: NodeId) => boolean | void,
+    type: AllEdgeTypes | TEdgeType | NullEdgeType = 1,
+  ) {
+    const matches = (node) =>
+      type === ALL_EDGE_TYPES || type === this.#nodes.typeOf(node);
+
     let node = this.#nodes.head(to);
     while (node !== null) {
-      let edge = this.#nodes.firstIn(node);
-      while (edge !== null) {
-        let from = this.#edges.from(edge);
-        if (fn(from)) {
-          return;
+      if (matches(node)) {
+        let edge = this.#nodes.firstIn(node);
+        while (edge !== null) {
+          let from = this.#edges.from(edge);
+          if (fn(from)) {
+            return;
+          }
+          edge = this.#edges.nextIn(edge);
         }
-        edge = this.#edges.nextIn(edge);
       }
       node = this.#nodes.next(node);
     }

package/src/Graph.js

@@ -163,10 +163,14 @@ export default class Graph<TNode, TEdgeType: number = 1> {
     return this.adjacencyList.hasEdge(from, to, type);
   }
 
-  forEachNodeIdConnectedTo(to: NodeId, fn: (nodeId: NodeId) => boolean | void) {
+  forEachNodeIdConnectedTo(
+    to: NodeId,
+    fn: (nodeId: NodeId) => boolean | void,
+    type: AllEdgeTypes | TEdgeType | NullEdgeType = ALL_EDGE_TYPES,
+  ) {
     this._assertHasNodeId(to);
 
-    this.adjacencyList.forEachNodeIdConnectedTo(to, fn);
+    this.adjacencyList.forEachNodeIdConnectedTo(to, fn, type);
   }
 
   forEachNodeIdConnectedFrom(

package/test/AdjacencyList.test.js

@@ -7,6 +7,7 @@ import {Worker} from 'worker_threads';
 
 import AdjacencyList, {NodeTypeMap, EdgeTypeMap} from '../src/AdjacencyList';
 import {toNodeId} from '../src/types';
+import {ALL_EDGE_TYPES} from '../src/Graph';
 
 describe('AdjacencyList', () => {
   it('constructor should initialize an empty graph', () => {
@@ -343,6 +344,44 @@ describe('AdjacencyList', () => {
 
       assert.deepEqual(nodeIds, [a, c, b]);
     });
+
+    it('respects the edge type', () => {
+      const graph = new AdjacencyList();
+      const a = graph.addNode();
+      const b = graph.addNode();
+      const c = graph.addNode();
+
+      graph.addEdge(a, b);
+      graph.addEdge(c, b, 2);
+
+      const nodeIds = [];
+      graph.forEachNodeIdConnectedTo(b, (id) => {
+        nodeIds.push(id);
+      });
+
+      assert.deepEqual(nodeIds, [a]);
+    });
+
+    it('iterates all edges if all edge type is provided', () => {
+      const graph = new AdjacencyList();
+      const a = graph.addNode();
+      const b = graph.addNode();
+      const c = graph.addNode();
+
+      graph.addEdge(a, b);
+      graph.addEdge(c, b, 2);
+
+      const nodeIds = [];
+      graph.forEachNodeIdConnectedTo(
+        b,
+        (id) => {
+          nodeIds.push(id);
+        },
+        ALL_EDGE_TYPES,
+      );
+
+      assert.deepEqual(nodeIds, [a, c]);
+    });
   });
 
   describe('forEachNodeIdConnectedFromReverse', () => {