data-structure-typed 1.37.3 → 1.37.5

package/lib/data-structures/binary-tree/tree-multiset.js

@@ -46,11 +46,11 @@ export class TreeMultiset extends AVLTree {
         return new TreeMultisetNode(key, val, count);
     }
     /**
-     * The function swaps the location of two nodes in a tree data structure.
-     * @param {N} srcNode - The source node that we want to _swap with the destination node.
-     * @param {N} destNode - The `destNode` parameter represents the destination node where the values from `srcNode` will
-     * be swapped with.
-     * @returns the `destNode` after swapping its values with the `srcNode`.
+     * The function swaps the values of two nodes in a binary tree.
+     * @param {N} srcNode - The source node that needs to be swapped with the destination node.
+     * @param {N} destNode - The `destNode` parameter represents the destination node where the values
+     * from `srcNode` will be swapped into.
+     * @returns The method is returning the `destNode` after swapping its properties with the `srcNode`.
      */
     _swap(srcNode, destNode) {
         const { key, val, count, height } = destNode;
@@ -69,14 +69,17 @@ export class TreeMultiset extends AVLTree {
         return destNode;
     }
     /**
-     * The `add` function adds a new node to a binary search tree, maintaining the tree's properties and balancing if
-     * necessary.
-     * @param {BinaryTreeNodeKey | N} keyOrNode - The `keyOrNode` parameter can be either a `BinaryTreeNodeKey` or a `N` (which
-     * represents a `BinaryTreeNode`).
-     * @param [val] - The `val` parameter represents the value to be added to the binary tree node.
-     * @param {number} [count] - The `count` parameter is an optional parameter that specifies the number of times the
-     * value should be added to the binary tree. If the `count` parameter is not provided, it defaults to 1.
-     * @returns The method `add` returns either the inserted node (`N`), `null`, or `undefined`.
+     * The `add` function adds a new node to a binary search tree, updating the count if the key already
+     * exists, and balancing the tree if necessary.
+     * @param {BinaryTreeNodeKey | N | null} keyOrNode - The `keyOrNode` parameter can be either a
+     * `BinaryTreeNodeKey` (which represents the key of the node to be added), a `N` (which represents a
+     * node to be added), or `null` (which represents a null node).
+     * @param [val] - The `val` parameter represents the value associated with the key that is being
+     * added to the binary tree.
+     * @param [count=1] - The `count` parameter represents the number of occurrences of the key/value
+     * pair that will be added to the binary tree. It has a default value of 1, which means that if no
+     * count is specified, the default count will be 1.
+     * @returns The function `add` returns a value of type `N | null | undefined`.
      */
     add(keyOrNode, val, count = 1) {
         let inserted = undefined, newNode;
@@ -155,13 +158,12 @@ export class TreeMultiset extends AVLTree {
         return inserted;
     }
     /**
-     * The function adds a new node to a binary tree if there is an available slot on the left or right side of the parent
-     * node.
-     * @param {N | null} newNode - The `newNode` parameter represents the node that needs to be added to the tree. It can
-     * be either a node object (`N`) or `null`.
-     * @param {N} parent - The `parent` parameter represents the parent node to which the new node will be added as a
-     * child.
-     * @returns The method returns either the `parent.left`, `parent.right`, or `undefined`.
+     * The function adds a new node to a binary tree if there is an available slot in the parent node.
+     * @param {N | null} newNode - The `newNode` parameter represents the node that needs to be added to
+     * the tree. It can be either a node object (`N`) or `null`.
+     * @param {N} parent - The `parent` parameter represents the parent node to which the new node will
+     * be added as a child.
+     * @returns The method `_addTo` returns either the `parent.left`, `parent.right`, or `undefined`.
      */
     _addTo(newNode, parent) {
         if (parent) {
@@ -190,13 +192,13 @@ export class TreeMultiset extends AVLTree {
         }
     }
     /**
-     * The `addMany` function takes an array of node IDs or nodes and adds them to the tree multiset, returning an array of
-     * the inserted nodes.
-     * @param {(BinaryTreeNodeKey | null)[] | (N | null)[]} keysOrNodes - An array of BinaryTreeNodeKey or BinaryTreeNode
-     * objects, or null values.
-     * @param {N['val'][]} [data] - The `data` parameter is an optional array of values (`N['val'][]`) that corresponds to
-     * the nodes being added. It is used when adding nodes using the `keyOrNode` and `data` arguments in the `this.add()`
-     * method. If provided, the `data` array should
+     * The `addMany` function adds multiple keys or nodes to a TreeMultiset and returns an array of the
+     * inserted nodes.
+     * @param {(BinaryTreeNodeKey | null)[] | (N | null)[]} keysOrNodes - An array of keys or nodes to be
+     * added to the multiset. Each element can be either a BinaryTreeNodeKey or a TreeMultisetNode.
+     * @param {N['val'][]} [data] - The `data` parameter is an optional array of values that correspond
+     * to the keys or nodes being added to the multiset. It is used to associate additional data with
+     * each key or node.
      * @returns The function `addMany` returns an array of `N`, `null`, or `undefined` values.
      */
     addMany(keysOrNodes, data) {
@@ -216,9 +218,12 @@ export class TreeMultiset extends AVLTree {
         return inserted;
     }
     /**
-     * The `perfectlyBalance` function takes a binary tree, performs a depth-first search to sort the nodes, and then
-     * constructs a balanced binary search tree using either a recursive or iterative approach.
-     * @returns The function `perfectlyBalance()` returns a boolean value.
+     * The `perfectlyBalance` function in TypeScript takes a sorted array of nodes and builds a balanced
+     * binary search tree using either a recursive or iterative approach.
+     * @param iterationType - The `iterationType` parameter is an optional parameter that specifies the
+     * type of iteration to use when building a balanced binary search tree. It can have two possible
+     * values:
+     * @returns a boolean value.
      */
     perfectlyBalance(iterationType = this.iterationType) {
         const sorted = this.dfs(node => node, 'in'), n = sorted.length;
@@ -257,13 +262,16 @@ export class TreeMultiset extends AVLTree {
         }
     }
     /**
-     * The `delete` function removes a node from a binary search tree and returns the deleted node along with the parent
-     * node that needs to be balanced.
-     * @param {N | BinaryTreeNodeKey | null} nodeOrKey - The `nodeOrKey` parameter can be one of the following:
-     * @param {boolean} [ignoreCount] - The `ignoreCount` parameter is an optional boolean parameter that determines
-     * whether to ignore the count of the node being removed. If `ignoreCount` is set to `true`, the count of the node will
-     * not be taken into account when removing it. If `ignoreCount` is set to `false
-     * @returns The function `delete` returns an array of `BinaryTreeDeletedResult<N>` objects.
+     * The `delete` function in a binary search tree deletes a node from the tree and returns the deleted
+     * node along with the parent node that needs to be balanced.
+     * @param {N | BinaryTreeNodeKey} nodeOrKey - The `nodeOrKey` parameter can be either a node object
+     * (`N`) or a key value (`BinaryTreeNodeKey`). It represents the node or key that needs to be deleted
+     * from the binary tree.
+     * @param [ignoreCount=false] - A boolean flag indicating whether to ignore the count of the node
+     * being deleted. If set to true, the count of the node will not be considered and the node will be
+     * deleted regardless of its count. If set to false (default), the count of the node will be
+     * decremented by 1 and
+     * @returns The method `delete` returns an array of `BinaryTreeDeletedResult<N>` objects.
      */
     delete(nodeOrKey, ignoreCount = false) {
         const bstDeletedResult = [];
@@ -322,14 +330,14 @@ export class TreeMultiset extends AVLTree {
         return bstDeletedResult;
     }
     /**
-     * The clear() function clears the data and sets the count to 0.
+     * The clear() function clears the contents of a data structure and sets the count to zero.
      */
     clear() {
         super.clear();
         this._setCount(0);
     }
     /**
-     * The function "_setCount" is used to set the value of the "_count" property.
+     * The function sets the value of the "_count" property.
      * @param {number} v - number
      */
     _setCount(v) {

package/{dist/types/data-structures → lib/types/data-structures/binary-tree}/avl-tree.d.ts

@@ -1,4 +1,4 @@
-import { AVLTreeNode } from '../../data-structures';
+import { AVLTreeNode } from '../../../data-structures';
 import { BSTOptions } from './bst';
 export type AVLTreeNodeNested<T> = AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, AVLTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type AVLTreeOptions = BSTOptions & {};

package/lib/types/data-structures/binary-tree/avl-tree.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/binary-tree/binary-indexed-tree.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/binary-tree/binary-indexed-tree.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/{binary-tree.d.ts → binary-tree/binary-tree.d.ts}

@@ -1,4 +1,4 @@
-import { BinaryTreeNode } from '../../data-structures/binary-tree';
+import { BinaryTreeNode } from '../../../data-structures';
 /**
  * Enum representing different loop types.
  *
@@ -18,17 +18,13 @@ export declare enum FamilyPosition {
     ISOLATED = "ISOLATED",
     MAL_NODE = "MAL_NODE"
 }
-export type BinaryTreeNodePropertyName = 'key' | 'val';
-export type NodeOrPropertyName = 'node' | BinaryTreeNodePropertyName;
 export type BinaryTreeNodeKey = number;
 export type BFSCallback<N> = (node: N, level?: number) => any;
 export type BFSCallbackReturn<N> = ReturnType<BFSCallback<N>>;
-export type BinaryTreeNodeProperty<N extends BinaryTreeNode<N['val'], N>> = N['val'] | N | number | BinaryTreeNodeKey;
 export type BinaryTreeDeletedResult<N> = {
     deleted: N | null | undefined;
     needBalanced: N | null;
 };
-export type BinaryTreeNodeProperties<N extends BinaryTreeNode<N['val'], N>> = BinaryTreeNodeProperty<N>[];
 export type BinaryTreeNodeNested<T> = BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, BinaryTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type BinaryTreeOptions = {
     iterationType?: IterationType;

package/lib/types/data-structures/{bst.d.ts → binary-tree/bst.d.ts}

@@ -1,4 +1,4 @@
-import { BSTNode } from '../../data-structures/binary-tree';
+import { BSTNode } from '../../../data-structures';
 import type { BinaryTreeNodeKey, BinaryTreeOptions } from './binary-tree';
 export type BSTComparator = (a: BinaryTreeNodeKey, b: BinaryTreeNodeKey) => number;
 export type BSTNodeNested<T> = BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, BSTNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;

package/lib/types/data-structures/binary-tree/index.d.ts

@@ -0,0 +1,6 @@
+export * from './binary-tree';
+export * from './bst';
+export * from './avl-tree';
+export * from './segment-tree';
+export * from './tree-multiset';
+export * from './rb-tree';

package/lib/types/data-structures/binary-tree/index.js

@@ -0,0 +1,6 @@
+export * from './binary-tree';
+export * from './bst';
+export * from './avl-tree';
+export * from './segment-tree';
+export * from './tree-multiset';
+export * from './rb-tree';

package/lib/types/data-structures/{rb-tree.d.ts → binary-tree/rb-tree.d.ts}

@@ -1,5 +1,5 @@
 import { BinaryTreeOptions } from './binary-tree';
-import { RBTreeNode } from '../../data-structures/binary-tree';
+import { RBTreeNode } from '../../../data-structures';
 export declare enum RBColor {
     RED = "RED",
     BLACK = "BLACK"

package/lib/types/data-structures/binary-tree/segment-tree.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/{tree-multiset.d.ts → binary-tree/tree-multiset.d.ts}

@@ -1,4 +1,4 @@
-import { TreeMultisetNode } from '../../data-structures/binary-tree';
+import { TreeMultisetNode } from '../../../data-structures';
 import { AVLTreeOptions } from './avl-tree';
 export type TreeMultisetNodeNested<T> = TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, TreeMultisetNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>;
 export type TreeMultisetOptions = Omit<AVLTreeOptions, 'isMergeDuplicatedNodeByKey'> & {};

package/lib/types/data-structures/binary-tree/tree-multiset.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/graph/abstract-graph.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/graph/index.d.ts

@@ -0,0 +1,3 @@
+export * from './abstract-graph';
+export * from './map-graph';
+export * from './directed-graph';

package/lib/types/data-structures/graph/index.js

@@ -0,0 +1,3 @@
+export * from './abstract-graph';
+export * from './map-graph';
+export * from './directed-graph';

package/lib/types/data-structures/graph/map-graph.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/graph/undirected-graph.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/graph/undirected-graph.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/hash/coordinate-map.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/hash/coordinate-map.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/hash/coordinate-set.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/hash/coordinate-set.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/hash/hash-map.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/hash/hash-map.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/hash/hash-table.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/hash/hash-table.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/hash/index.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/hash/tree-map.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/hash/tree-map.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/hash/tree-set.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/hash/tree-set.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/heap/heap.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/heap/heap.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/heap/index.d.ts

@@ -0,0 +1 @@
+export * from './heap';

package/lib/types/data-structures/heap/index.js

@@ -0,0 +1 @@
+export * from './heap';

package/lib/types/data-structures/heap/max-heap.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/heap/max-heap.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/heap/min-heap.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/heap/min-heap.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/index.d.ts

@@ -1,16 +1,11 @@
 export * from './binary-tree';
-export * from './bst';
-export * from './avl-tree';
-export * from './segment-tree';
-export * from './tree-multiset';
-export * from './abstract-graph';
-export * from './map-graph';
-export * from './rb-tree';
-export * from './directed-graph';
+export * from './graph';
+export * from './linked-list';
 export * from './heap';
-export * from './singly-linked-list';
-export * from './doubly-linked-list';
-export * from './navigator';
+export * from './matrix';
 export * from './hash';
-export type MapCallback<N> = (node: N) => any;
-export type MapCallbackReturn<N> = ReturnType<MapCallback<N>>;
+export * from './priority-queue';
+export * from './queue';
+export * from './stack';
+export * from './tree';
+export * from './trie';

package/lib/types/data-structures/index.js

@@ -1,14 +1,11 @@
 export * from './binary-tree';
-export * from './bst';
-export * from './avl-tree';
-export * from './segment-tree';
-export * from './tree-multiset';
-export * from './abstract-graph';
-export * from './map-graph';
-export * from './rb-tree';
-export * from './directed-graph';
+export * from './graph';
+export * from './linked-list';
 export * from './heap';
-export * from './singly-linked-list';
-export * from './doubly-linked-list';
-export * from './navigator';
+export * from './matrix';
 export * from './hash';
+export * from './priority-queue';
+export * from './queue';
+export * from './stack';
+export * from './tree';
+export * from './trie';

package/lib/types/data-structures/linked-list/doubly-linked-list.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/linked-list/doubly-linked-list.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/linked-list/index.d.ts

@@ -0,0 +1,2 @@
+export * from './singly-linked-list';
+export * from './doubly-linked-list';

package/lib/types/data-structures/linked-list/index.js

@@ -0,0 +1,2 @@
+export * from './singly-linked-list';
+export * from './doubly-linked-list';

package/lib/types/data-structures/linked-list/singly-linked-list.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/linked-list/singly-linked-list.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/linked-list/skip-linked-list.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/linked-list/skip-linked-list.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/matrix/index.d.ts

@@ -0,0 +1 @@
+export * from './navigator';

package/lib/types/data-structures/matrix/index.js

@@ -0,0 +1 @@
+export * from './navigator';

package/lib/types/data-structures/matrix/matrix.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/matrix/matrix.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/matrix/matrix2d.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/matrix/matrix2d.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/matrix/navigator.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/matrix/vector2d.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/matrix/vector2d.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/priority-queue/index.d.ts

@@ -0,0 +1,3 @@
+export * from './priority-queue';
+export * from './min-priority-queue';
+export * from './max-priority-queue';

package/lib/types/data-structures/priority-queue/index.js

@@ -0,0 +1,3 @@
+export * from './priority-queue';
+export * from './min-priority-queue';
+export * from './max-priority-queue';

package/lib/types/data-structures/priority-queue/max-priority-queue.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/priority-queue/max-priority-queue.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/priority-queue/min-priority-queue.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/priority-queue/min-priority-queue.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/priority-queue/priority-queue.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/priority-queue/priority-queue.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/queue/deque.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/queue/deque.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/queue/index.d.ts

@@ -0,0 +1,2 @@
+export * from './queue';
+export * from './deque';

package/lib/types/data-structures/queue/index.js

@@ -0,0 +1,2 @@
+export * from './queue';
+export * from './deque';

package/lib/types/data-structures/queue/queue.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/queue/queue.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/stack/index.d.ts

@@ -0,0 +1 @@
+export * from './stack';

package/lib/types/data-structures/stack/index.js

@@ -0,0 +1 @@
+export * from './stack';

package/lib/types/data-structures/stack/stack.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/stack/stack.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/tree/index.d.ts

@@ -0,0 +1 @@
+export * from './tree';

package/lib/types/data-structures/tree/index.js

@@ -0,0 +1 @@
+export * from './tree';

package/lib/types/data-structures/tree/tree.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/tree/tree.js

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/trie/index.d.ts

@@ -0,0 +1 @@
+export * from './trie';

package/lib/types/data-structures/trie/index.js

@@ -0,0 +1 @@
+export * from './trie';

package/lib/types/data-structures/trie/trie.d.ts

@@ -0,0 +1 @@
+export {};

package/lib/types/data-structures/trie/trie.js

@@ -0,0 +1 @@
+export {};

package/lib/types/helpers.d.ts

@@ -1,2 +1,4 @@
 export type Comparator<T> = (a: T, b: T) => number;
 export type DFSOrderPattern = 'pre' | 'in' | 'post';
+export type MapCallback<N> = (node: N) => any;
+export type MapCallbackReturn<N> = ReturnType<MapCallback<N>>;

package/lib/utils/utils.d.ts

@@ -17,3 +17,4 @@ export declare const trampoline: (fn: TrlFn) => ((...args: [...Parameters<TrlFn>
 export declare const trampolineAsync: (fn: TrlAsyncFn) => ((...args: [...Parameters<TrlAsyncFn>]) => Promise<any>) & {
     cont: (...args: [...Parameters<TrlAsyncFn>]) => Thunk;
 };
+export declare const getMSB: (value: number) => number;

package/lib/utils/utils.js

@@ -55,3 +55,9 @@ export const trampolineAsync = (fn) => {
         return result;
     }), { cont });
 };
+export const getMSB = (value) => {
+    if (value <= 0) {
+        return 0;
+    }
+    return 1 << (31 - Math.clz32(value));
+};

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "data-structure-typed",
-  "version": "1.37.3",
+  "version": "1.37.5",
   "description": "Data Structures of Javascript & TypeScript. Binary Tree, BST, Graph, Heap, Priority Queue, Linked List, Queue, Deque, Stack, AVL Tree, Tree Multiset, Trie, Directed Graph, Undirected Graph, Singly Linked List, Doubly Linked List, Max Heap, Max Priority Queue, Min Heap, Min Priority Queue.",
   "main": "dist/index.js",
   "module": "lib/index.js",
@@ -27,16 +27,16 @@
     "fix:src": "npm run lint:src && npm run format:src",
     "fix:test": "npm run lint:test && npm run format:test",
     "fix": "npm run fix:src && npm run fix:test",
-    "update:individuals": "npm i avl-tree-typed binary-tree-typed bst-typed heap-typed --save-dev",
-    "install:all-individuals": "npm i avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multiset-typed trie-typed undirected-graph-typed queue-typed --save-dev",
+    "update:subs": "npm i avl-tree-typed binary-tree-typed bst-typed heap-typed --save-dev",
+    "install:all-subs": "npm i avl-tree-typed binary-tree-typed bst-typed deque-typed directed-graph-typed doubly-linked-list-typed graph-typed heap-typed linked-list-typed max-heap-typed max-priority-queue-typed min-heap-typed min-priority-queue-typed priority-queue-typed singly-linked-list-typed stack-typed tree-multiset-typed trie-typed undirected-graph-typed queue-typed --save-dev",
     "test": "jest",
     "check:deps": "dependency-cruiser src",
     "changelog": "auto-changelog",
     "coverage:badge": "istanbul-badges-readme",
-    "ci": "env && git fetch --tags && npm run lint && npm run build && npm run update:individuals && npm run test && npm run changelog",
-    "publish:individuals": "sh scripts/publish_all_subs.sh",
+    "ci": "env && git fetch --tags && npm run lint && npm run build && npm run update:subs && npm run test && npm run changelog",
+    "publish:subs": "sh scripts/publish_all_subs.sh",
     "publish:docs": "sh scripts/publish_docs.sh",
-    "publish:all": "npm run ci && npm publish && npm run publish:individuals && npm run publish:docs"
+    "publish:all": "npm run ci && npm publish && npm run publish:subs && npm run publish:docs"
   },
   "repository": {
     "type": "git",