npm - data-structure-typed - Versions diffs - 2.6.1 → 2.6.2 - Mend

data-structure-typed 2.6.1 → 2.6.2

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 (116) hide show

package/CHANGELOG.md +9 -1
package/dist/cjs/binary-tree.cjs +2927 -23688
package/dist/cjs/graph.cjs +845 -2634
package/dist/cjs/hash.cjs +185 -616
package/dist/cjs/heap.cjs +266 -818
package/dist/cjs/index.cjs +5116 -31358
package/dist/cjs/linked-list.cjs +644 -2615
package/dist/cjs/matrix.cjs +220 -535
package/dist/cjs/priority-queue.cjs +266 -818
package/dist/cjs/queue.cjs +637 -2343
package/dist/cjs/stack.cjs +124 -530
package/dist/cjs/trie.cjs +145 -592
package/dist/cjs-legacy/binary-tree.cjs +4352 -25113
package/dist/cjs-legacy/graph.cjs +847 -2636
package/dist/cjs-legacy/hash.cjs +181 -612
package/dist/cjs-legacy/heap.cjs +266 -818
package/dist/cjs-legacy/index.cjs +6657 -32899
package/dist/cjs-legacy/linked-list.cjs +640 -2611
package/dist/cjs-legacy/matrix.cjs +220 -535
package/dist/cjs-legacy/priority-queue.cjs +266 -818
package/dist/cjs-legacy/queue.cjs +634 -2340
package/dist/cjs-legacy/stack.cjs +124 -530
package/dist/cjs-legacy/trie.cjs +145 -592
package/dist/esm/binary-tree.mjs +2927 -23688
package/dist/esm/graph.mjs +845 -2634
package/dist/esm/hash.mjs +185 -616
package/dist/esm/heap.mjs +266 -818
package/dist/esm/index.mjs +5116 -31358
package/dist/esm/linked-list.mjs +644 -2615
package/dist/esm/matrix.mjs +220 -535
package/dist/esm/priority-queue.mjs +266 -818
package/dist/esm/queue.mjs +637 -2343
package/dist/esm/stack.mjs +124 -530
package/dist/esm/trie.mjs +145 -592
package/dist/esm-legacy/binary-tree.mjs +4352 -25113
package/dist/esm-legacy/graph.mjs +847 -2636
package/dist/esm-legacy/hash.mjs +181 -612
package/dist/esm-legacy/heap.mjs +266 -818
package/dist/esm-legacy/index.mjs +6657 -32899
package/dist/esm-legacy/linked-list.mjs +640 -2611
package/dist/esm-legacy/matrix.mjs +220 -535
package/dist/esm-legacy/priority-queue.mjs +266 -818
package/dist/esm-legacy/queue.mjs +634 -2340
package/dist/esm-legacy/stack.mjs +124 -530
package/dist/esm-legacy/trie.mjs +145 -592
package/dist/types/data-structures/binary-tree/avl-tree.d.ts +29 -500
package/dist/types/data-structures/binary-tree/binary-indexed-tree.d.ts +38 -563
package/dist/types/data-structures/binary-tree/binary-tree.d.ts +230 -1212
package/dist/types/data-structures/binary-tree/bst.d.ts +124 -1063
package/dist/types/data-structures/binary-tree/red-black-tree.d.ts +99 -854
package/dist/types/data-structures/binary-tree/segment-tree.d.ts +62 -314
package/dist/types/data-structures/binary-tree/tree-map.d.ts +366 -5057
package/dist/types/data-structures/binary-tree/tree-multi-map.d.ts +277 -4885
package/dist/types/data-structures/binary-tree/tree-multi-set.d.ts +253 -3929
package/dist/types/data-structures/binary-tree/tree-set.d.ts +261 -4782
package/dist/types/data-structures/graph/abstract-graph.d.ts +44 -44
package/dist/types/data-structures/graph/directed-graph.d.ts +130 -527
package/dist/types/data-structures/graph/undirected-graph.d.ts +125 -482
package/dist/types/data-structures/hash/hash-map.d.ts +132 -562
package/dist/types/data-structures/heap/heap.d.ts +194 -746
package/dist/types/data-structures/linked-list/doubly-linked-list.d.ts +120 -809
package/dist/types/data-structures/linked-list/singly-linked-list.d.ts +121 -733
package/dist/types/data-structures/linked-list/skip-linked-list.d.ts +193 -863
package/dist/types/data-structures/matrix/matrix.d.ts +159 -474
package/dist/types/data-structures/priority-queue/max-priority-queue.d.ts +1 -6
package/dist/types/data-structures/priority-queue/min-priority-queue.d.ts +6 -11
package/dist/types/data-structures/priority-queue/priority-queue.d.ts +1 -1
package/dist/types/data-structures/queue/deque.d.ts +196 -804
package/dist/types/data-structures/queue/queue.d.ts +99 -585
package/dist/types/data-structures/stack/stack.d.ts +75 -481
package/dist/types/data-structures/trie/trie.d.ts +98 -584
package/dist/umd/data-structure-typed.js +6580 -32822
package/dist/umd/data-structure-typed.min.js +3 -3
package/docs-site-docusaurus/docs/api/classes/AVLTree.md +162 -215
package/docs-site-docusaurus/docs/api/classes/AVLTreeNode.md +9 -9
package/docs-site-docusaurus/docs/api/classes/AbstractGraph.md +47 -47
package/docs-site-docusaurus/docs/api/classes/BST.md +155 -208
package/docs-site-docusaurus/docs/api/classes/BSTNode.md +7 -7
package/docs-site-docusaurus/docs/api/classes/BinaryIndexedTree.md +13 -29
package/docs-site-docusaurus/docs/api/classes/BinaryTree.md +104 -158
package/docs-site-docusaurus/docs/api/classes/BinaryTreeNode.md +13 -13
package/docs-site-docusaurus/docs/api/classes/Deque.md +72 -104
package/docs-site-docusaurus/docs/api/classes/DirectedGraph.md +60 -80
package/docs-site-docusaurus/docs/api/classes/DoublyLinkedList.md +67 -101
package/docs-site-docusaurus/docs/api/classes/DoublyLinkedListNode.md +6 -6
package/docs-site-docusaurus/docs/api/classes/FibonacciHeap.md +9 -9
package/docs-site-docusaurus/docs/api/classes/FibonacciHeapNode.md +1 -1
package/docs-site-docusaurus/docs/api/classes/HashMap.md +52 -48
package/docs-site-docusaurus/docs/api/classes/Heap.md +40 -68
package/docs-site-docusaurus/docs/api/classes/IterableElementBase.md +17 -17
package/docs-site-docusaurus/docs/api/classes/LinearBase.md +38 -38
package/docs-site-docusaurus/docs/api/classes/LinearLinkedBase.md +45 -45
package/docs-site-docusaurus/docs/api/classes/LinkedHashMap.md +23 -23
package/docs-site-docusaurus/docs/api/classes/LinkedListQueue.md +68 -96
package/docs-site-docusaurus/docs/api/classes/MapGraph.md +60 -80
package/docs-site-docusaurus/docs/api/classes/Matrix.md +57 -52
package/docs-site-docusaurus/docs/api/classes/MaxHeap.md +38 -66
package/docs-site-docusaurus/docs/api/classes/MaxPriorityQueue.md +41 -74
package/docs-site-docusaurus/docs/api/classes/MinHeap.md +38 -66
package/docs-site-docusaurus/docs/api/classes/MinPriorityQueue.md +46 -79
package/docs-site-docusaurus/docs/api/classes/PriorityQueue.md +40 -68
package/docs-site-docusaurus/docs/api/classes/Queue.md +54 -78
package/docs-site-docusaurus/docs/api/classes/RedBlackTree.md +171 -225
package/docs-site-docusaurus/docs/api/classes/SegmentTree.md +10 -22
package/docs-site-docusaurus/docs/api/classes/SinglyLinkedList.md +68 -98
package/docs-site-docusaurus/docs/api/classes/SinglyLinkedListNode.md +4 -4
package/docs-site-docusaurus/docs/api/classes/SkipList.md +98 -75
package/docs-site-docusaurus/docs/api/classes/Stack.md +33 -53
package/docs-site-docusaurus/docs/api/classes/TreeMap.md +104 -129
package/docs-site-docusaurus/docs/api/classes/TreeMultiMap.md +57 -124
package/docs-site-docusaurus/docs/api/classes/TreeSet.md +45 -116
package/docs-site-docusaurus/docs/api/classes/Trie.md +37 -61
package/docs-site-docusaurus/docs/api/classes/TrieNode.md +8 -8
package/docs-site-docusaurus/docs/api/classes/UndirectedGraph.md +59 -77
package/package.json +1 -1
package/src/data-structures/binary-tree/tree-multi-set.ts +15 -11

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

@@ -267,172 +267,12 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      * @param keyNodeOrEntry - The key, node, or entry to set.
      * @param [value] - The value, if providing just a key.
      * @returns True if the addition was successful, false otherwise.
-      * @example
-   * // Set a key-value pair
-   *  const avl = new AVLTree<number, string>();
-   *     avl.set(1, 'one');
-   *     avl.set(2, 'two');
-   *     console.log(avl.get(1)); // 'one';
+     * @example
+     * // Set a key-value pair
+     *  const avl = new AVLTree<number, string>();
+     *     avl.set(1, 'one');
+     *     avl.set(2, 'two');
+     *     console.log(avl.get(1)); // 'one';
      */
     set(keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined, value?: V): boolean;
     /**
@@ -441,138 +281,12 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      *
      * @param keyNodeOrEntry - The node to delete.
      * @returns An array containing deletion results.
-      * @example
-   * // Remove nodes and verify structure
-   *  const avl = new AVLTree<number>([5, 3, 7, 1, 4, 6, 8]);
-   *     avl.delete(3);
-   *     console.log(avl.has(3)); // false;
-   *     console.log(avl.size); // 6;
+     * @example
+     * // Remove nodes and verify structure
+     *  const avl = new AVLTree<number>([5, 3, 7, 1, 4, 6, 8]);
+     *     avl.delete(3);
+     *     console.log(avl.has(3)); // false;
+     *     console.log(avl.size); // 6;
      */
     delete(keyNodeOrEntry: K | AVLTreeNode<K, V> | [K | null | undefined, V | undefined] | null | undefined): boolean;
     /**
@@ -582,88 +296,14 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      *
      * @param [iterationType=this.iterationType] - The traversal method for the initial node export.
      * @returns True if successful, false if the tree was empty.
-      * @example
-   * // Rebalance the tree
-   *  const avl = new AVLTree<number>();
-   *     // Insert in sorted order (worst case for BST)
-   *     for (let i = 1; i <= 7; i++) avl.add(i);
-   *     console.log(avl.isAVLBalanced()); // false;
-   *     avl.perfectlyBalance();
-   *     console.log(avl.isAVLBalanced()); // true;
+     * @example
+     * // Rebalance the tree
+     *  const avl = new AVLTree<number>();
+     *     // Insert in sorted order (worst case for BST)
+     *     for (let i = 1; i <= 7; i++) avl.add(i);
+     *     console.log(avl.isAVLBalanced()); // false;
+     *     avl.perfectlyBalance();
+     *     console.log(avl.isAVLBalanced()); // true;
      */
     perfectlyBalance(iterationType?: IterationType): boolean;
     /**
@@ -677,126 +317,15 @@ export declare class AVLTree<K = any, V = any, R = any> extends BST<K, V, R> imp
      * @param [options] - Options for the new AVLTree.
      * @param [thisArg] - `this` context for the callback.
      * @returns A new, mapped AVLTree.
-      * @example
-   * // Transform to new tree
-   *  const avl = new AVLTree<number, number>([[1, 10], [2, 20], [3, 30]]);
-   *     const doubled = avl.map((value, key) => [key, (value ?? 0) * 2] as [number, number]);
-   *     console.log([...doubled.values()]); // [20, 40, 60];
+     * @example
+     * // Transform to new tree
+     *  const avl = new AVLTree<number, number>([
+     *       [1, 10],
+     *       [2, 20],
+     *       [3, 30]
+     *     ]);
+     *     const doubled = avl.map((value, key) => [key, (value ?? 0) * 2] as [number, number]);
+     *     console.log([...doubled.values()]); // [20, 40, 60];
      */
     map<MK = K, MV = V, MR = any>(callback: EntryCallback<K, V | undefined, [MK, MV]>, options?: Partial<BinaryTreeOptions<MK, MV, MR>>, thisArg?: unknown): AVLTree<MK, MV, MR>;
     /**