npm - graph-typed - Versions diffs - 1.38.2 → 1.38.5 - Mend

graph-typed 1.38.2 → 1.38.5

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (43) hide show

package/.dependency-cruiser.js +422 -422
package/.eslintrc.js +59 -59
package/.prettierrc.js +14 -14
package/README.md +21 -3
package/coverage/clover.xml +22 -19
package/coverage/coverage-final.json +445 -1
package/coverage/coverage-summary.json +59 -2
package/coverage/lcov-report/base.css +278 -99
package/coverage/lcov-report/index.html +69 -65
package/coverage/lcov-report/index.ts.html +45 -44
package/coverage/lcov-report/sorter.js +15 -5
package/dist/data-structures/binary-tree/binary-tree.d.ts +9 -9
package/dist/data-structures/binary-tree/bst.d.ts +4 -4
package/dist/data-structures/linked-list/doubly-linked-list.d.ts +12 -3
package/dist/data-structures/linked-list/singly-linked-list.d.ts +17 -4
package/dist/data-structures/linked-list/singly-linked-list.js +2 -0
package/dist/types/data-structures/binary-tree/binary-tree.d.ts +1 -1
package/dist/types/helpers.d.ts +1 -1
package/jest.config.js +6 -6
package/package.json +4 -1
package/src/data-structures/binary-tree/avl-tree.ts +1 -1
package/src/data-structures/binary-tree/binary-indexed-tree.ts +1 -1
package/src/data-structures/binary-tree/binary-tree.ts +21 -21
package/src/data-structures/binary-tree/bst.ts +7 -7
package/src/data-structures/binary-tree/tree-multiset.ts +2 -1
package/src/data-structures/graph/abstract-graph.ts +11 -10
package/src/data-structures/graph/directed-graph.ts +2 -1
package/src/data-structures/graph/undirected-graph.ts +5 -4
package/src/data-structures/hash/hash-map.ts +1 -1
package/src/data-structures/hash/tree-map.ts +1 -2
package/src/data-structures/hash/tree-set.ts +1 -2
package/src/data-structures/linked-list/doubly-linked-list.ts +2 -4
package/src/data-structures/linked-list/singly-linked-list.ts +3 -8
package/src/data-structures/matrix/matrix.ts +1 -1
package/src/data-structures/matrix/vector2d.ts +1 -2
package/src/data-structures/queue/deque.ts +4 -5
package/src/data-structures/queue/queue.ts +1 -1
package/src/types/data-structures/binary-tree/binary-tree.ts +1 -1
package/src/types/data-structures/matrix/navigator.ts +1 -1
package/src/types/helpers.ts +1 -1
package/src/types/utils/utils.ts +1 -1
package/src/types/utils/validate-type.ts +2 -2
package/tsconfig.json +1 -2

package/coverage/lcov-report/index.ts.html CHANGED Viewed

@@ -1,63 +1,63 @@
 <!doctype html>
 <html lang="en">
 <head>
     <title>Code coverage report for index.ts</title>
-    <meta charset="utf-8" />
-    <link rel="stylesheet" href="prettify.css" />
-    <link rel="stylesheet" href="base.css" />
-    <link rel="shortcut icon" type="image/x-icon" href="favicon.png" />
-    <meta name="viewport" content="width=device-width, initial-scale=1" />
+    <meta charset="utf-8"/>
+    <link href="prettify.css" rel="stylesheet"/>
+    <link href="base.css" rel="stylesheet"/>
+    <link href="favicon.png" rel="shortcut icon" type="image/x-icon"/>
+    <meta content="width=device-width, initial-scale=1" name="viewport"/>
     <style type='text/css'>
         .coverage-summary .sorter {
             background-image: url(sort-arrow-sprite.png);
         }
     </style>
 </head>
 <body>
 <div class='wrapper'>
     <div class='pad1'>
         <h1><a href="index.html">All files</a> index.ts</h1>
         <div class='clearfix'>
             <div class='fl pad1y space-right2'>
                 <span class="strong">100% </span>
                 <span class="quiet">Statements</span>
                 <span class='fraction'>13/13</span>
             </div>
             <div class='fl pad1y space-right2'>
                 <span class="strong">100% </span>
                 <span class="quiet">Branches</span>
                 <span class='fraction'>0/0</span>
             </div>
             <div class='fl pad1y space-right2'>
                 <span class="strong">25% </span>
                 <span class="quiet">Functions</span>
                 <span class='fraction'>3/12</span>
             </div>
             <div class='fl pad1y space-right2'>
                 <span class="strong">100% </span>
                 <span class="quiet">Lines</span>
                 <span class='fraction'>13/13</span>
             </div>
         </div>
         <p class="quiet">
-            Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
+            Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for
+            the previous block.
         </p>
         <template id="filterTemplate">
             <div class="quiet">
                 Filter:
-                <input oninput="onInput()" type="search" id="fileSearch">
+                <input id="fileSearch" oninput="onInput()" type="search">
             </div>
         </template>
     </div>
@@ -85,7 +85,8 @@
 <a name='L20'></a><a href='#L20'>20</a>
 <a name='L21'></a><a href='#L21'>21</a>
 <a name='L22'></a><a href='#L22'>22</a>
-<a name='L23'></a><a href='#L23'>23</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<a name='L23'></a><a href='#L23'>23</a></td><td class="line-coverage quiet"><span
+        class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
 <span class="cline-any cline-neutral">&nbsp;</span>
@@ -115,37 +116,37 @@
  * @license MIT License
  */
 export {
-<span class="fstat-no" title="function not covered" >  AbstractVertex,</span>
-<span class="fstat-no" title="function not covered" >  AbstractEdge,</span>
-<span class="fstat-no" title="function not covered" >  AbstractGraph,</span>
+<span class="fstat-no" title="function not covered">  AbstractVertex,</span>
+<span class="fstat-no" title="function not covered">  AbstractEdge,</span>
+<span class="fstat-no" title="function not covered">  AbstractGraph,</span>
   DirectedVertex,
   DirectedEdge,
   DirectedGraph,
-<span class="fstat-no" title="function not covered" >  UndirectedVertex,</span>
-<span class="fstat-no" title="function not covered" >  UndirectedEdge,</span>
-<span class="fstat-no" title="function not covered" >  UndirectedGraph,</span>
-<span class="fstat-no" title="function not covered" >  MapGraph,</span>
-<span class="fstat-no" title="function not covered" >  MapVertex,</span>
-<span class="fstat-no" title="function not covered" >  MapEdge,</span>
+<span class="fstat-no" title="function not covered">  UndirectedVertex,</span>
+<span class="fstat-no" title="function not covered">  UndirectedEdge,</span>
+<span class="fstat-no" title="function not covered">  UndirectedGraph,</span>
+<span class="fstat-no" title="function not covered">  MapGraph,</span>
+<span class="fstat-no" title="function not covered">  MapVertex,</span>
+<span class="fstat-no" title="function not covered">  MapEdge,</span>
   VertexId
 } from 'data-structure-typed';
 &nbsp;</pre></td></tr></table></pre>
-                <div class='push'></div><!-- for sticky footer -->
-            </div><!-- /wrapper -->
-            <div class='footer quiet pad2 space-top1 center small'>
-                Code coverage generated by
-                <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-10-08T10:22:41.687Z
-            </div>
-        <script src="prettify.js"></script>
-        <script>
-            window.onload = function () {
-                prettyPrint();
-            };
-        </script>
-        <script src="sorter.js"></script>
-        <script src="block-navigation.js"></script>
-    </body>
+    <div class='push'></div><!-- for sticky footer -->
+</div><!-- /wrapper -->
+<div class='footer quiet pad2 space-top1 center small'>
+    Code coverage generated by
+    <a href="https://istanbul.js.org/" rel="noopener noreferrer" target="_blank">istanbul</a>
+    at 2023-10-08T10:22:41.687Z
+</div>
+<script src="prettify.js"></script>
+<script>
+    window.onload = function () {
+        prettyPrint();
+    };
+</script>
+<script src="sorter.js"></script>
+<script src="block-navigation.js"></script>
+</body>
 </html>

package/coverage/lcov-report/sorter.js CHANGED Viewed

@@ -1,5 +1,5 @@
 /* eslint-disable */
-var addSorting = (function() {
+var addSorting = (function () {
     'use strict';
     var cols,
         currentSort = {
@@ -11,14 +11,17 @@ var addSorting = (function() {
     function getTable() {
         return document.querySelector('.coverage-summary');
     }
     // returns the thead element of the summary table
     function getTableHeader() {
         return getTable().querySelector('thead tr');
     }
     // returns the tbody element of the summary table
     function getTableBody() {
         return getTable().querySelector('tbody');
     }
     // returns the th element for nth column
     function getNthColumn(n) {
         return getTableHeader().querySelectorAll('th')[n];
@@ -73,6 +76,7 @@ var addSorting = (function() {
         }
         return cols;
     }
     // attaches a data attribute to every tr element with an object
     // of data values keyed by column name
     function loadRowData(tableRow) {
@@ -93,6 +97,7 @@ var addSorting = (function() {
         }
         return data;
     }
     // loads all row data
     function loadData() {
         var rows = getTableBody().querySelectorAll('tr'),
@@ -102,10 +107,11 @@ var addSorting = (function() {
             rows[i].data = loadRowData(rows[i]);
         }
     }
     // sorts the table using the data for the ith column
     function sortByIndex(index, desc) {
         var key = cols[index].key,
-            sorter = function(a, b) {
+            sorter = function (a, b) {
                 a = a.data[key];
                 b = b.data[key];
                 return a < b ? -1 : a > b ? 1 : 0;
@@ -117,7 +123,7 @@ var addSorting = (function() {
             i;
         if (desc) {
-            finalSorter = function(a, b) {
+            finalSorter = function (a, b) {
                 return -1 * sorter(a, b);
             };
         }
@@ -133,6 +139,7 @@ var addSorting = (function() {
             tableBody.appendChild(rows[i]);
         }
     }
     // removes sort indicators for current column being sorted
     function removeSortIndicators() {
         var col = getNthColumn(currentSort.index),
@@ -141,12 +148,14 @@ var addSorting = (function() {
         cls = cls.replace(/ sorted$/, '').replace(/ sorted-desc$/, '');
         col.className = cls;
     }
     // adds sort indicators for current column being sorted
     function addSortIndicators() {
         getNthColumn(currentSort.index).className += currentSort.desc
             ? ' sorted-desc'
             : ' sorted';
     }
     // adds event listeners for all sorter widgets
     function enableUI() {
         var i,
@@ -154,7 +163,7 @@ var addSorting = (function() {
             ithSorter = function ithSorter(i) {
                 var col = cols[i];
-                return function() {
+                return function () {
                     var desc = col.defaultDescSort;
                     if (currentSort.index === i) {
@@ -180,8 +189,9 @@ var addSorting = (function() {
             }
         }
     }
     // adds sorting functionality to the UI
-    return function() {
+    return function () {
         if (!getTable()) {
             return;
         }

package/dist/data-structures/binary-tree/binary-tree.d.ts CHANGED Viewed

@@ -5,7 +5,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { BFSCallback, BFSCallbackReturn, BinaryTreeNodeKey, BinaryTreeNodeNested, BinaryTreeOptions, MapCallback, MapCallbackReturn } from '../../types';
+import type { BFSCallback, BinaryTreeNodeKey, BinaryTreeNodeNested, BinaryTreeOptions, MapCallback } from '../../types';
 import { BinaryTreeDeletedResult, DFSOrderPattern, FamilyPosition, IterationType } from '../../types';
 import { IBinaryTree } from '../../interfaces';
 /**
@@ -207,7 +207,7 @@ export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTr
      * traverse the binary tree. It can have two possible values:
      * @returns The function `getNodes` returns an array of nodes (`N[]`).
      */
-    getNodes(nodeProperty: BinaryTreeNodeKey | N, callback?: MapCallback<N>, onlyOne?: boolean, beginRoot?: N | null, iterationType?: IterationType): N[];
+    getNodes<C extends MapCallback<N> = MapCallback<N, BinaryTreeNodeKey>>(nodeProperty: BinaryTreeNodeKey | N, callback?: C, onlyOne?: boolean, beginRoot?: N | null, iterationType?: IterationType): N[];
     /**
      * The function checks if a binary tree has a node with a given property or key.
      * @param {BinaryTreeNodeKey | N} nodeProperty - The `nodeProperty` parameter is the key or value of
@@ -225,7 +225,7 @@ export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTr
      * performed when searching for nodes in the binary tree. It can have one of the following values:
      * @returns a boolean value.
      */
-    has(nodeProperty: BinaryTreeNodeKey | N, callback?: MapCallback<N>, beginRoot?: N | null, iterationType?: IterationType): boolean;
+    has<C extends MapCallback<N> = MapCallback<N, BinaryTreeNodeKey>>(nodeProperty: BinaryTreeNodeKey | N, callback?: C, beginRoot?: N | null, iterationType?: IterationType): boolean;
     /**
      * The function `get` returns the first node in a binary tree that matches the given property or key.
      * @param {BinaryTreeNodeKey | N} nodeProperty - The `nodeProperty` parameter is the key or value of
@@ -241,7 +241,7 @@ export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTr
      * performed when searching for a node in the binary tree. It can have one of the following values:
      * @returns either the found node (of type N) or null if no node is found.
      */
-    get(nodeProperty: BinaryTreeNodeKey | N, callback?: MapCallback<N>, beginRoot?: N | null, iterationType?: IterationType): N | null;
+    get<C extends MapCallback<N> = MapCallback<N, BinaryTreeNodeKey>>(nodeProperty: BinaryTreeNodeKey | N, callback?: C, beginRoot?: N | null, iterationType?: IterationType): N | null;
     /**
      * The function `getPathToRoot` returns an array of nodes starting from a given node and traversing
      * up to the root node, with the option to reverse the order of the nodes.
@@ -310,7 +310,7 @@ export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTr
      * performed on the binary tree. It can have two possible values:
      * @returns The function `subTreeTraverse` returns an array of `MapCallbackReturn<N>`.
      */
-    subTreeTraverse(callback?: MapCallback<N>, beginRoot?: N | BinaryTreeNodeKey | null, iterationType?: IterationType): MapCallbackReturn<N>[];
+    subTreeTraverse<C extends MapCallback<N> = MapCallback<N, BinaryTreeNodeKey>>(callback?: C, beginRoot?: N | BinaryTreeNodeKey | null, iterationType?: IterationType): ReturnType<C>[];
     /**
      * The `dfs` function performs a depth-first search traversal on a binary tree, executing a callback
      * function on each node according to a specified order pattern.
@@ -326,7 +326,7 @@ export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTr
      * iteration used in the depth-first search algorithm. It can have two possible values:
      * @returns The function `dfs` returns an array of `MapCallbackReturn<N>` values.
      */
-    dfs(callback?: MapCallback<N>, pattern?: DFSOrderPattern, beginRoot?: N | null, iterationType?: IterationType): MapCallbackReturn<N>[];
+    dfs<C extends MapCallback<N> = MapCallback<N, BinaryTreeNodeKey>>(callback?: C, pattern?: DFSOrderPattern, beginRoot?: N | null, iterationType?: IterationType): ReturnType<C>[];
     /**
      * The bfs function performs a breadth-first search traversal on a binary tree, executing a callback
      * function on each node.
@@ -344,7 +344,7 @@ export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTr
      * in the breadth-first search (BFS) algorithm. It can have two possible values:
      * @returns The function `bfs` returns an array of `BFSCallbackReturn<N>[]`.
      */
-    bfs(callback?: BFSCallback<N>, withLevel?: boolean, beginRoot?: N | null, iterationType?: IterationType): BFSCallbackReturn<N>[];
+    bfs<C extends BFSCallback<N> = BFSCallback<N, BinaryTreeNodeKey>>(callback?: C, withLevel?: boolean, beginRoot?: N | null, iterationType?: IterationType): ReturnType<C>[];
     /**
      * The function returns the predecessor node of a given node in a binary tree.
      * @param {N} node - The parameter "node" represents a node in a binary tree.
@@ -365,7 +365,7 @@ export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTr
      * `beginRoot` is `null`, an empty array will be returned.
      * @returns The `morris` function returns an array of `MapCallbackReturn<N>` values.
      */
-    morris(callback?: MapCallback<N>, pattern?: DFSOrderPattern, beginRoot?: N | null): MapCallbackReturn<N>[];
+    morris<C extends MapCallback<N> = MapCallback<N, BinaryTreeNodeKey>>(callback?: C, pattern?: DFSOrderPattern, beginRoot?: N | null): ReturnType<C>[];
     /**
      * Swap the data of two nodes in the binary tree.
      * @param {N} srcNode - The source node to swap.
@@ -380,7 +380,7 @@ export declare class BinaryTree<N extends BinaryTreeNode<N['val'], N> = BinaryTr
      * the tree's structure should be restored to its original state to maintain the tree's integrity.
      * This is because the purpose of the Morris algorithm is to save space rather than permanently alter the tree's shape.
      */
-    protected _defaultCallbackByKey: MapCallback<N>;
+    protected _defaultCallbackByKey: (node: N) => number;
     /**
      * The function `_addTo` adds a new node to a binary tree if there is an available position.
      * @param {N | null} newNode - The `newNode` parameter represents the node that you want to add to

package/dist/data-structures/binary-tree/bst.d.ts CHANGED Viewed

@@ -5,7 +5,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type { BinaryTreeNodeKey, BSTComparator, BSTNodeNested, BSTOptions, MapCallback, MapCallbackReturn } from '../../types';
+import type { BinaryTreeNodeKey, BSTComparator, BSTNodeNested, BSTOptions, MapCallback } from '../../types';
 import { CP, IterationType } from '../../types';
 import { BinaryTree, BinaryTreeNode } from './binary-tree';
 import { IBinaryTree } from '../../interfaces';
@@ -72,7 +72,7 @@ export declare class BST<N extends BSTNode<N['val'], N> = BSTNode> extends Binar
      * @returns either the first node that matches the given nodeProperty and callback, or null if no
      * matching node is found.
      */
-    get(nodeProperty: BinaryTreeNodeKey | N, callback?: MapCallback<N>, beginRoot?: N | null, iterationType?: IterationType): N | null;
+    get<C extends MapCallback<N> = MapCallback<N, BinaryTreeNodeKey>>(nodeProperty: BinaryTreeNodeKey | N, callback?: C, beginRoot?: N | null, iterationType?: IterationType): N | null;
     /**
      * The function `lastKey` returns the key of the rightmost node if the comparison result is less
      * than, the key of the leftmost node if the comparison result is greater than, and the key of the
@@ -110,7 +110,7 @@ export declare class BST<N extends BSTNode<N['val'], N> = BSTNode> extends Binar
      * traverse the binary tree. It can have one of the following values:
      * @returns an array of nodes (N[]).
      */
-    getNodes(nodeProperty: BinaryTreeNodeKey | N, callback?: MapCallback<N>, onlyOne?: boolean, beginRoot?: N | null, iterationType?: IterationType): N[];
+    getNodes<C extends MapCallback<N> = MapCallback<N, BinaryTreeNodeKey>>(nodeProperty: BinaryTreeNodeKey | N, callback?: C, onlyOne?: boolean, beginRoot?: N | null, iterationType?: IterationType): N[];
     /**
      * The `lesserOrGreaterTraverse` function traverses a binary tree and applies a callback function to
      * nodes that have a key value lesser or greater than a target key value.
@@ -128,7 +128,7 @@ export declare class BST<N extends BSTNode<N['val'], N> = BSTNode> extends Binar
      * done recursively or iteratively. It can have two possible values:
      * @returns The function `lesserOrGreaterTraverse` returns an array of `MapCallbackReturn<N>`.
      */
-    lesserOrGreaterTraverse(callback?: MapCallback<N>, lesserOrGreater?: CP, targetNode?: N | BinaryTreeNodeKey | null, iterationType?: IterationType): MapCallbackReturn<N>;
+    lesserOrGreaterTraverse<C extends MapCallback<N> = MapCallback<N, BinaryTreeNodeKey>>(callback?: C, lesserOrGreater?: CP, targetNode?: N | BinaryTreeNodeKey | null, iterationType?: IterationType): ReturnType<C>[];
     /**
      * Balancing Adjustment:
      * Perfectly Balanced Binary Tree: Since the balance of a perfectly balanced binary tree is already fixed, no additional balancing adjustment is needed. Any insertion or deletion operation will disrupt the perfect balance, often requiring a complete reconstruction of the tree.

package/dist/data-structures/linked-list/doubly-linked-list.d.ts CHANGED Viewed

@@ -123,7 +123,7 @@ export declare class DoublyLinkedList<E = any> {
      * @returns The function `findNodeByValue` returns a `DoublyLinkedListNode<E>` if a node with the specified value `val`
      * is found in the linked list. If no such node is found, it returns `null`.
      */
-    findNode(val: E): DoublyLinkedListNode<E> | null;
+    findNode(val: E | null): DoublyLinkedListNode<E> | null;
     /**
      * The `insert` function inserts a value at a specified index in a doubly linked list.
      * @param {number} index - The index parameter represents the position at which the new value should be inserted in the
@@ -229,6 +229,15 @@ export declare class DoublyLinkedList<E = any> {
     reduce<U>(callback: (accumulator: U, val: E) => U, initialValue: U): U;
     insertAfter(existingValueOrNode: E, newValue: E): boolean;
     insertAfter(existingValueOrNode: DoublyLinkedListNode<E>, newValue: E): boolean;
-    insertBefore(existingValueOrNode: E, newValue: E): boolean;
-    insertBefore(existingValueOrNode: DoublyLinkedListNode<E>, newValue: E): boolean;
+    /**
+     * The `insertBefore` function inserts a new value before an existing value or node in a doubly linked list.
+     * @param {E | DoublyLinkedListNode<E>} existingValueOrNode - The existing value or node in the doubly linked list
+     * before which the new value will be inserted. It can be either the value of the existing node or the existing node
+     * itself.
+     * @param {E} newValue - The `newValue` parameter represents the value that you want to insert into the doubly linked
+     * list.
+     * @returns The method returns a boolean value. It returns `true` if the insertion is successful, and `false` if the
+     * insertion fails.
+     */
+    insertBefore(existingValueOrNode: E | DoublyLinkedListNode<E>, newValue: E): boolean;
 }

package/dist/data-structures/linked-list/singly-linked-list.d.ts CHANGED Viewed

@@ -88,8 +88,14 @@ export declare class SinglyLinkedList<E = any> {
      * bounds.
      */
     deleteAt(index: number): E | undefined;
-    delete(valueOrNode: E): boolean;
-    delete(valueOrNode: SinglyLinkedListNode<E>): boolean;
+    /**
+     * The delete function removes a node with a specific value from a singly linked list.
+     * @param {E | SinglyLinkedListNode<E>} valueOrNode - The `valueOrNode` parameter can accept either a value of type `E`
+     * or a `SinglyLinkedListNode<E>` object.
+     * @returns The `delete` method returns a boolean value. It returns `true` if the value or node is found and
+     * successfully deleted from the linked list, and `false` if the value or node is not found in the linked list.
+     */
+    delete(valueOrNode: E | SinglyLinkedListNode<E> | null | undefined): boolean;
     /**
      * The `insertAt` function inserts a value at a specified index in a singly linked list.
      * @param {number} index - The index parameter represents the position at which the new value should be inserted in the
@@ -143,8 +149,15 @@ export declare class SinglyLinkedList<E = any> {
      * the specified value is found, the function returns `null`.
      */
     findNode(value: E): SinglyLinkedListNode<E> | null;
-    insertBefore(existingValue: E, newValue: E): boolean;
-    insertBefore(existingValue: SinglyLinkedListNode<E>, newValue: E): boolean;
+    /**
+     * The `insertBefore` function inserts a new value before an existing value in a singly linked list.
+     * @param {E | SinglyLinkedListNode<E>} existingValueOrNode - The existing value or node that you want to insert the
+     * new value before. It can be either the value itself or a node containing the value in the linked list.
+     * @param {E} newValue - The `newValue` parameter represents the value that you want to insert into the linked list.
+     * @returns The method `insertBefore` returns a boolean value. It returns `true` if the new value was successfully
+     * inserted before the existing value, and `false` otherwise.
+     */
+    insertBefore(existingValueOrNode: E | SinglyLinkedListNode<E>, newValue: E): boolean;
     insertAfter(existingValueOrNode: E, newValue: E): boolean;
     insertAfter(existingValueOrNode: SinglyLinkedListNode<E>, newValue: E): boolean;
     /**

package/dist/data-structures/linked-list/singly-linked-list.js CHANGED Viewed

@@ -202,6 +202,8 @@ class SinglyLinkedList {
      * successfully deleted from the linked list, and `false` if the value or node is not found in the linked list.
      */
     delete(valueOrNode) {
+        if (!valueOrNode)
+            return false;
         let value;
         if (valueOrNode instanceof SinglyLinkedListNode) {
             value = valueOrNode.val;

package/dist/types/data-structures/binary-tree/binary-tree.d.ts CHANGED Viewed

@@ -19,7 +19,7 @@ export declare enum FamilyPosition {
     MAL_NODE = "MAL_NODE"
 }
 export type BinaryTreeNodeKey = number;
-export type BFSCallback<N> = (node: N, level?: number) => any;
+export type BFSCallback<N, D = any> = (node: N, level?: number) => D;
 export type BFSCallbackReturn<N> = ReturnType<BFSCallback<N>>;
 export type BinaryTreeDeletedResult<N> = {
     deleted: N | null | undefined;

package/dist/types/helpers.d.ts CHANGED Viewed

@@ -1,6 +1,6 @@
 export type Comparator<T> = (a: T, b: T) => number;
 export type DFSOrderPattern = 'pre' | 'in' | 'post';
-export type MapCallback<N> = (node: N) => any;
+export type MapCallback<N, D = any> = (node: N) => D;
 export type MapCallbackReturn<N> = ReturnType<MapCallback<N>>;
 export declare enum CP {
     lt = "lt",

package/jest.config.js CHANGED Viewed

@@ -1,8 +1,8 @@
 module.exports = {
-  preset: 'ts-jest',
-  testEnvironment: 'node',
-  testMatch: ['<rootDir>/test/**/*.test.ts', '<rootDir>/test/**/*.test.js'],
-  collectCoverage: true,
-  coverageReporters: ['clover', 'json', 'lcov', ['text', {skipFull: true}], "json-summary"],
-  coverageDirectory: 'coverage'
+    preset: 'ts-jest',
+    testEnvironment: 'node',
+    testMatch: ['<rootDir>/test/**/*.test.ts', '<rootDir>/test/**/*.test.js'],
+    collectCoverage: true,
+    coverageReporters: ['clover', 'json', 'lcov', ['text', {skipFull: true}], "json-summary"],
+    coverageDirectory: 'coverage'
 };

package/package.json CHANGED Viewed

@@ -1,6 +1,6 @@
 {
   "name": "graph-typed",
-  "version": "1.38.2",
+  "version": "1.38.5",
   "description": "Graph. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -133,5 +133,8 @@
     "ts-jest": "^29.1.1",
     "typedoc": "^0.25.1",
     "typescript": "^4.9.5"
+  },
+  "dependencies": {
+    "data-structure-typed": "^1.38.4"
   }
 }

package/src/data-structures/binary-tree/avl-tree.ts CHANGED Viewed

@@ -152,7 +152,7 @@ export class AVLTree<N extends AVLTreeNode<N['val'], N> = AVLTreeNode> extends B
       // Balance Restoration: If a balance issue is discovered after inserting a node, it requires balance restoration operations. Balance restoration includes four basic cases where rotation operations need to be performed to fix the balance:
       switch (
         this._balanceFactor(A) // second O(1)
-        ) {
+      ) {
         case -2:
           if (A && A.left) {
             if (this._balanceFactor(A.left) <= 0) {

package/src/data-structures/binary-tree/binary-indexed-tree.ts CHANGED Viewed

@@ -17,7 +17,7 @@ export class BinaryIndexedTree {
    * @param  - - `frequency`: The default frequency value. It is optional and has a default
    * value of 0.
    */
-  constructor({frequency = 0, max}: { frequency?: number; max: number }) {
+  constructor({frequency = 0, max}: {frequency?: number; max: number}) {
     this._freq = frequency;
     this._max = max;
     this._freqMap = {0: 0};