graphology-types - npm Package Compare versions

Comparing version 0.19.3 to 0.19.4

index.d.ts

@@ -588,3 +588,3 @@ /**
     callback: AdjacencyUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   adjacency(): IterableIterator<AdjacencyEntry<NodeAttributes, EdgeAttributes>>;
@@ -594,3 +594,5 @@
   forEachNode(callback: NodeIterationCallback<NodeAttributes>): void;
-  forEachNodeUntil(callback: NodeUntilIterationCallback<NodeAttributes>): void;
+  forEachNodeUntil(
+    callback: NodeUntilIterationCallback<NodeAttributes>
+  ): boolean;
   nodeEntries(): IterableIterator<NodeEntry<NodeAttributes>>;
@@ -705,7 +707,7 @@
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachEdgeUntil(
     node: NodeKey,
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachEdgeUntil(
@@ -715,10 +717,10 @@ source: NodeKey,
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachUndirectedEdgeUntil(
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachUndirectedEdgeUntil(
     node: NodeKey,
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachUndirectedEdgeUntil(
@@ -728,10 +730,10 @@ source: NodeKey,
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachDirectedEdgeUntil(
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachDirectedEdgeUntil(
     node: NodeKey,
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachDirectedEdgeUntil(
@@ -741,10 +743,10 @@ source: NodeKey,
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachInEdgeUntil(
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachInEdgeUntil(
     node: NodeKey,
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachInEdgeUntil(
@@ -754,10 +756,10 @@ source: NodeKey,
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachOutEdgeUntil(
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachOutEdgeUntil(
     node: NodeKey,
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachOutEdgeUntil(
@@ -767,10 +769,10 @@ source: NodeKey,
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachInboundEdgeUntil(
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachInboundEdgeUntil(
     node: NodeKey,
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachInboundEdgeUntil(
@@ -780,10 +782,10 @@ source: NodeKey,
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachOutboundEdgeUntil(
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachOutboundEdgeUntil(
     node: NodeKey,
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   forEachOutboundEdgeUntil(
@@ -793,3 +795,3 @@ source: NodeKey,
     callback: EdgeUntilIterationCallback<NodeAttributes, EdgeAttributes>
-  ): void;
+  ): boolean;
   edgeEntries(): IterableIterator<EdgeEntry<NodeAttributes, EdgeAttributes>>;
@@ -898,27 +900,27 @@ edgeEntries(
     callback: NodeUntilIterationCallback<NodeAttributes>
-  ): void;
+  ): boolean;
   forEachUndirectedNeighborUntil(
     node: NodeKey,
     callback: NodeUntilIterationCallback<NodeAttributes>
-  ): void;
+  ): boolean;
   forEachDirectedNeighborUntil(
     node: NodeKey,
     callback: NodeUntilIterationCallback<NodeAttributes>
-  ): void;
+  ): boolean;
   forEachInNeighborUntil(
     node: NodeKey,
     callback: NodeUntilIterationCallback<NodeAttributes>
-  ): void;
+  ): boolean;
   forEachOutNeighborUntil(
     node: NodeKey,
     callback: NodeUntilIterationCallback<NodeAttributes>
-  ): void;
+  ): boolean;
   forEachInboundNeighborUntil(
     node: NodeKey,
     callback: NodeUntilIterationCallback<NodeAttributes>
-  ): void;
+  ): boolean;
   forEachOutboundNeighborUntil(
     node: NodeKey,
     callback: NodeUntilIterationCallback<NodeAttributes>
-  ): void;
+  ): boolean;
   neighborEntries(node: NodeKey): IterableIterator<NodeEntry<NodeAttributes>>;
@@ -925,0 +927,0 @@ undirectedNeighborEntries(

package.json

 {
   "name": "graphology-types",
-  "version": "0.19.3",
+  "version": "0.19.4",
   "description": "TypeScript declaration for graphology.",
@@ -5,0 +5,0 @@ "main": "index.d.ts",

New alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Fixed alerts

License Policy Violation

License

This package is not allowed per your license policy. Review the package's license to ensure compliance.

Found 1 instance in 1 package

Improved metrics

Total package byte prevSize

33004

increased by0.3%

Lines of code

974

increased by0.21%

No dependency changes