npm - min-heap-typed - Versions diffs - 1.40.0-rc → 1.40.0 - Mend

min-heap-typed 1.40.0-rc → 1.40.0

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

package/.dependency-cruiser.js +422 -422
package/.eslintrc.js +59 -59
package/.prettierrc.js +14 -14
package/README.md +20 -3
package/coverage/clover.xml +11 -7
package/coverage/coverage-final.json +95 -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 +36 -35
package/coverage/lcov-report/sorter.js +15 -5
package/dist/data-structures/binary-tree/avl-tree.d.ts +106 -0
package/dist/data-structures/binary-tree/avl-tree.js +347 -0
package/dist/data-structures/binary-tree/binary-indexed-tree.d.ts +149 -0
package/dist/data-structures/binary-tree/binary-indexed-tree.js +269 -0
package/dist/data-structures/binary-tree/binary-tree.d.ts +355 -0
package/dist/data-structures/binary-tree/binary-tree.js +1115 -0
package/dist/data-structures/binary-tree/bst.d.ts +167 -0
package/dist/data-structures/binary-tree/bst.js +512 -0
package/dist/data-structures/binary-tree/index.d.ts +7 -0
package/dist/data-structures/binary-tree/index.js +23 -0
package/dist/data-structures/binary-tree/rb-tree.d.ts +11 -0
package/dist/data-structures/binary-tree/rb-tree.js +21 -0
package/dist/data-structures/binary-tree/segment-tree.d.ts +67 -0
package/dist/data-structures/binary-tree/segment-tree.js +180 -0
package/dist/data-structures/binary-tree/tree-multiset.d.ts +126 -0
package/dist/data-structures/binary-tree/tree-multiset.js +355 -0
package/dist/data-structures/graph/abstract-graph.d.ts +313 -0
package/dist/data-structures/graph/abstract-graph.js +884 -0
package/dist/data-structures/graph/directed-graph.d.ts +194 -0
package/dist/data-structures/graph/directed-graph.js +404 -0
package/dist/data-structures/graph/index.d.ts +4 -0
package/dist/data-structures/graph/index.js +20 -0
package/dist/data-structures/graph/map-graph.d.ts +73 -0
package/dist/data-structures/graph/map-graph.js +93 -0
package/dist/data-structures/graph/undirected-graph.d.ts +120 -0
package/dist/data-structures/graph/undirected-graph.js +239 -0
package/dist/data-structures/hash/coordinate-map.d.ts +44 -0
package/dist/data-structures/hash/coordinate-map.js +62 -0
package/dist/data-structures/hash/coordinate-set.d.ts +36 -0
package/dist/data-structures/hash/coordinate-set.js +52 -0
package/dist/data-structures/hash/hash-map.d.ts +50 -0
package/dist/data-structures/hash/hash-map.js +153 -0
package/dist/data-structures/hash/hash-table.d.ts +103 -0
package/dist/data-structures/hash/hash-table.js +236 -0
package/dist/data-structures/hash/index.d.ts +6 -0
package/dist/data-structures/hash/index.js +22 -0
package/dist/data-structures/hash/tree-map.d.ts +2 -0
package/dist/data-structures/hash/tree-map.js +6 -0
package/dist/data-structures/hash/tree-set.d.ts +2 -0
package/dist/data-structures/hash/tree-set.js +6 -0
package/dist/data-structures/heap/heap.d.ts +235 -0
package/dist/data-structures/heap/heap.js +515 -0
package/dist/data-structures/heap/index.d.ts +3 -0
package/dist/data-structures/heap/index.js +19 -0
package/dist/data-structures/heap/max-heap.d.ts +15 -0
package/dist/data-structures/heap/max-heap.js +26 -0
package/dist/data-structures/heap/min-heap.d.ts +15 -0
package/dist/data-structures/heap/min-heap.js +26 -0
package/dist/data-structures/index.d.ts +11 -0
package/dist/data-structures/index.js +27 -0
package/dist/data-structures/linked-list/doubly-linked-list.d.ts +253 -0
package/dist/data-structures/linked-list/doubly-linked-list.js +569 -0
package/dist/data-structures/linked-list/index.d.ts +3 -0
package/dist/data-structures/linked-list/index.js +19 -0
package/dist/data-structures/linked-list/singly-linked-list.d.ts +232 -0
package/dist/data-structures/linked-list/singly-linked-list.js +533 -0
package/dist/data-structures/linked-list/skip-linked-list.d.ts +80 -0
package/dist/data-structures/linked-list/skip-linked-list.js +187 -0
package/dist/data-structures/matrix/index.d.ts +4 -0
package/dist/data-structures/matrix/index.js +20 -0
package/dist/data-structures/matrix/matrix.d.ts +21 -0
package/dist/data-structures/matrix/matrix.js +28 -0
package/dist/data-structures/matrix/matrix2d.d.ts +107 -0
package/dist/data-structures/matrix/matrix2d.js +199 -0
package/dist/data-structures/matrix/navigator.d.ts +52 -0
package/dist/data-structures/matrix/navigator.js +106 -0
package/dist/data-structures/matrix/vector2d.d.ts +200 -0
package/dist/data-structures/matrix/vector2d.js +290 -0
package/dist/data-structures/priority-queue/index.d.ts +3 -0
package/dist/data-structures/priority-queue/index.js +19 -0
package/dist/data-structures/priority-queue/max-priority-queue.d.ts +15 -0
package/dist/data-structures/priority-queue/max-priority-queue.js +26 -0
package/dist/data-structures/priority-queue/min-priority-queue.d.ts +15 -0
package/dist/data-structures/priority-queue/min-priority-queue.js +26 -0
package/dist/data-structures/priority-queue/priority-queue.d.ts +15 -0
package/dist/data-structures/priority-queue/priority-queue.js +17 -0
package/dist/data-structures/queue/deque.d.ts +161 -0
package/dist/data-structures/queue/deque.js +264 -0
package/dist/data-structures/queue/index.d.ts +2 -0
package/dist/data-structures/queue/index.js +18 -0
package/dist/data-structures/queue/queue.d.ts +122 -0
package/dist/data-structures/queue/queue.js +187 -0
package/dist/data-structures/stack/index.d.ts +1 -0
package/dist/data-structures/stack/index.js +17 -0
package/dist/data-structures/stack/stack.d.ts +64 -0
package/dist/data-structures/stack/stack.js +94 -0
package/dist/data-structures/tree/index.d.ts +1 -0
package/dist/data-structures/tree/index.js +17 -0
package/dist/data-structures/tree/tree.d.ts +8 -0
package/dist/data-structures/tree/tree.js +40 -0
package/dist/data-structures/trie/index.d.ts +1 -0
package/dist/data-structures/trie/index.js +17 -0
package/dist/data-structures/trie/trie.d.ts +79 -0
package/dist/data-structures/trie/trie.js +251 -0
package/dist/index.d.ts +3 -1
package/dist/index.js +18 -4
package/dist/interfaces/binary-tree.d.ts +7 -0
package/dist/interfaces/binary-tree.js +2 -0
package/dist/interfaces/doubly-linked-list.d.ts +1 -0
package/dist/interfaces/doubly-linked-list.js +2 -0
package/dist/interfaces/graph.d.ts +5 -0
package/dist/interfaces/graph.js +2 -0
package/dist/interfaces/heap.d.ts +1 -0
package/dist/interfaces/heap.js +2 -0
package/dist/interfaces/index.d.ts +8 -0
package/dist/interfaces/index.js +24 -0
package/dist/interfaces/navigator.d.ts +1 -0
package/dist/interfaces/navigator.js +2 -0
package/dist/interfaces/priority-queue.d.ts +1 -0
package/dist/interfaces/priority-queue.js +2 -0
package/dist/interfaces/segment-tree.d.ts +1 -0
package/dist/interfaces/segment-tree.js +2 -0
package/dist/interfaces/singly-linked-list.d.ts +1 -0
package/dist/interfaces/singly-linked-list.js +2 -0
package/dist/types/data-structures/binary-tree/avl-tree.d.ts +4 -0
package/dist/types/data-structures/binary-tree/avl-tree.js +2 -0
package/dist/types/data-structures/binary-tree/binary-indexed-tree.d.ts +1 -0
package/dist/types/data-structures/binary-tree/binary-indexed-tree.js +2 -0
package/dist/types/data-structures/binary-tree/binary-tree.d.ts +29 -0
package/dist/types/data-structures/binary-tree/binary-tree.js +24 -0
package/dist/types/data-structures/binary-tree/bst.d.ts +7 -0
package/dist/types/data-structures/binary-tree/bst.js +2 -0
package/dist/types/data-structures/binary-tree/index.d.ts +6 -0
package/dist/types/data-structures/binary-tree/index.js +22 -0
package/dist/types/data-structures/binary-tree/rb-tree.d.ts +8 -0
package/dist/types/data-structures/binary-tree/rb-tree.js +8 -0
package/dist/types/data-structures/binary-tree/segment-tree.d.ts +1 -0
package/dist/types/data-structures/binary-tree/segment-tree.js +2 -0
package/dist/types/data-structures/binary-tree/tree-multiset.d.ts +4 -0
package/dist/types/data-structures/binary-tree/tree-multiset.js +2 -0
package/dist/types/data-structures/graph/abstract-graph.d.ts +10 -0
package/dist/types/data-structures/graph/abstract-graph.js +2 -0
package/dist/types/data-structures/graph/directed-graph.d.ts +6 -0
package/dist/types/data-structures/graph/directed-graph.js +9 -0
package/dist/types/data-structures/graph/index.d.ts +3 -0
package/dist/types/data-structures/graph/index.js +19 -0
package/dist/types/data-structures/graph/map-graph.d.ts +1 -0
package/dist/types/data-structures/graph/map-graph.js +2 -0
package/dist/types/data-structures/graph/undirected-graph.d.ts +1 -0
package/dist/types/data-structures/graph/undirected-graph.js +2 -0
package/dist/types/data-structures/hash/coordinate-map.d.ts +1 -0
package/dist/types/data-structures/hash/coordinate-map.js +2 -0
package/dist/types/data-structures/hash/coordinate-set.d.ts +1 -0
package/dist/types/data-structures/hash/coordinate-set.js +2 -0
package/dist/types/data-structures/hash/hash-map.d.ts +1 -0
package/dist/types/data-structures/hash/hash-map.js +2 -0
package/dist/types/data-structures/hash/hash-table.d.ts +1 -0
package/dist/types/data-structures/hash/hash-table.js +2 -0
package/dist/types/data-structures/hash/index.d.ts +1 -0
package/dist/types/data-structures/hash/index.js +2 -0
package/dist/types/data-structures/hash/tree-map.d.ts +1 -0
package/dist/types/data-structures/hash/tree-map.js +2 -0
package/dist/types/data-structures/hash/tree-set.d.ts +1 -0
package/dist/types/data-structures/hash/tree-set.js +2 -0
package/dist/types/data-structures/heap/heap.d.ts +1 -0
package/dist/types/data-structures/heap/heap.js +2 -0
package/dist/types/data-structures/heap/index.d.ts +1 -0
package/dist/types/data-structures/heap/index.js +17 -0
package/dist/types/data-structures/heap/max-heap.d.ts +1 -0
package/dist/types/data-structures/heap/max-heap.js +2 -0
package/dist/types/data-structures/heap/min-heap.d.ts +1 -0
package/dist/types/data-structures/heap/min-heap.js +2 -0
package/dist/types/data-structures/index.d.ts +11 -0
package/dist/types/data-structures/index.js +27 -0
package/dist/types/data-structures/linked-list/doubly-linked-list.d.ts +1 -0
package/dist/types/data-structures/linked-list/doubly-linked-list.js +2 -0
package/dist/types/data-structures/linked-list/index.d.ts +2 -0
package/dist/types/data-structures/linked-list/index.js +18 -0
package/dist/types/data-structures/linked-list/singly-linked-list.d.ts +1 -0
package/dist/types/data-structures/linked-list/singly-linked-list.js +2 -0
package/dist/types/data-structures/linked-list/skip-linked-list.d.ts +1 -0
package/dist/types/data-structures/linked-list/skip-linked-list.js +2 -0
package/dist/types/data-structures/matrix/index.d.ts +1 -0
package/dist/types/data-structures/matrix/index.js +17 -0
package/dist/types/data-structures/matrix/matrix.d.ts +1 -0
package/dist/types/data-structures/matrix/matrix.js +2 -0
package/dist/types/data-structures/matrix/matrix2d.d.ts +1 -0
package/dist/types/data-structures/matrix/matrix2d.js +2 -0
package/dist/types/data-structures/matrix/navigator.d.ts +14 -0
package/dist/types/data-structures/matrix/navigator.js +2 -0
package/dist/types/data-structures/matrix/vector2d.d.ts +1 -0
package/dist/types/data-structures/matrix/vector2d.js +2 -0
package/dist/types/data-structures/priority-queue/index.d.ts +3 -0
package/dist/types/data-structures/priority-queue/index.js +19 -0
package/dist/types/data-structures/priority-queue/max-priority-queue.d.ts +1 -0
package/dist/types/data-structures/priority-queue/max-priority-queue.js +2 -0
package/dist/types/data-structures/priority-queue/min-priority-queue.d.ts +1 -0
package/dist/types/data-structures/priority-queue/min-priority-queue.js +2 -0
package/dist/types/data-structures/priority-queue/priority-queue.d.ts +1 -0
package/dist/types/data-structures/priority-queue/priority-queue.js +2 -0
package/dist/types/data-structures/queue/deque.d.ts +1 -0
package/dist/types/data-structures/queue/deque.js +2 -0
package/dist/types/data-structures/queue/index.d.ts +2 -0
package/dist/types/data-structures/queue/index.js +18 -0
package/dist/types/data-structures/queue/queue.d.ts +1 -0
package/dist/types/data-structures/queue/queue.js +2 -0
package/dist/types/data-structures/stack/index.d.ts +1 -0
package/dist/types/data-structures/stack/index.js +17 -0
package/dist/types/data-structures/stack/stack.d.ts +1 -0
package/dist/types/data-structures/stack/stack.js +2 -0
package/dist/types/data-structures/tree/index.d.ts +1 -0
package/dist/types/data-structures/tree/index.js +17 -0
package/dist/types/data-structures/tree/tree.d.ts +1 -0
package/dist/types/data-structures/tree/tree.js +2 -0
package/dist/types/data-structures/trie/index.d.ts +1 -0
package/dist/types/data-structures/trie/index.js +17 -0
package/dist/types/data-structures/trie/trie.d.ts +1 -0
package/dist/types/data-structures/trie/trie.js +2 -0
package/dist/types/helpers.d.ts +8 -0
package/dist/types/helpers.js +9 -0
package/dist/types/index.d.ts +3 -0
package/dist/types/index.js +19 -0
package/dist/types/utils/index.d.ts +2 -0
package/dist/types/utils/index.js +18 -0
package/dist/types/utils/utils.d.ts +7 -0
package/dist/types/utils/utils.js +2 -0
package/dist/types/utils/validate-type.d.ts +19 -0
package/dist/types/utils/validate-type.js +2 -0
package/dist/utils/index.d.ts +1 -0
package/dist/utils/index.js +17 -0
package/dist/utils/utils.d.ts +20 -0
package/dist/utils/utils.js +73 -0
package/jest.config.js +6 -6
package/package.json +2 -2
package/src/data-structures/binary-tree/avl-tree.ts +350 -0
package/src/data-structures/binary-tree/binary-indexed-tree.ts +306 -0
package/src/data-structures/binary-tree/binary-tree.ts +1262 -0
package/src/data-structures/binary-tree/bst.ts +522 -0
package/src/data-structures/binary-tree/index.ts +7 -0
package/src/data-structures/binary-tree/rb-tree.ts +358 -0
package/src/data-structures/binary-tree/segment-tree.ts +190 -0
package/src/data-structures/binary-tree/tree-multiset.ts +379 -0
package/src/data-structures/graph/abstract-graph.ts +1000 -0
package/src/data-structures/graph/directed-graph.ts +449 -0
package/src/data-structures/graph/index.ts +4 -0
package/src/data-structures/graph/map-graph.ts +106 -0
package/src/data-structures/graph/undirected-graph.ts +259 -0
package/src/data-structures/hash/coordinate-map.ts +63 -0
package/src/data-structures/hash/coordinate-set.ts +52 -0
package/src/data-structures/hash/hash-map.ts +185 -0
package/src/data-structures/hash/hash-table.ts +268 -0
package/src/data-structures/hash/index.ts +6 -0
package/src/data-structures/hash/tree-map.ts +2 -0
package/src/data-structures/hash/tree-set.ts +2 -0
package/src/data-structures/heap/heap.ts +589 -0
package/src/data-structures/heap/index.ts +3 -0
package/src/data-structures/heap/max-heap.ts +26 -0
package/src/data-structures/heap/min-heap.ts +26 -0
package/src/data-structures/index.ts +11 -0
package/src/data-structures/linked-list/doubly-linked-list.ts +605 -0
package/src/data-structures/linked-list/index.ts +3 -0
package/src/data-structures/linked-list/singly-linked-list.ts +576 -0
package/src/data-structures/linked-list/skip-linked-list.ts +221 -0
package/src/data-structures/matrix/index.ts +4 -0
package/src/data-structures/matrix/matrix.ts +27 -0
package/src/data-structures/matrix/matrix2d.ts +211 -0
package/src/data-structures/matrix/navigator.ts +121 -0
package/src/data-structures/matrix/vector2d.ts +315 -0
package/src/data-structures/priority-queue/index.ts +3 -0
package/src/data-structures/priority-queue/max-priority-queue.ts +25 -0
package/src/data-structures/priority-queue/min-priority-queue.ts +25 -0
package/src/data-structures/priority-queue/priority-queue.ts +16 -0
package/src/data-structures/queue/deque.ts +282 -0
package/src/data-structures/queue/index.ts +2 -0
package/src/data-structures/queue/queue.ts +209 -0
package/src/data-structures/stack/index.ts +1 -0
package/src/data-structures/stack/stack.ts +102 -0
package/src/data-structures/tree/index.ts +1 -0
package/src/data-structures/tree/tree.ts +41 -0
package/src/data-structures/trie/index.ts +1 -0
package/src/data-structures/trie/trie.ts +262 -0
package/src/index.ts +4 -1
package/src/interfaces/binary-tree.ts +10 -0
package/src/interfaces/doubly-linked-list.ts +1 -0
package/src/interfaces/graph.ts +7 -0
package/src/interfaces/heap.ts +1 -0
package/src/interfaces/index.ts +8 -0
package/src/interfaces/navigator.ts +1 -0
package/src/interfaces/priority-queue.ts +1 -0
package/src/interfaces/segment-tree.ts +1 -0
package/src/interfaces/singly-linked-list.ts +1 -0
package/src/types/data-structures/binary-tree/avl-tree.ts +5 -0
package/src/types/data-structures/binary-tree/binary-indexed-tree.ts +1 -0
package/src/types/data-structures/binary-tree/binary-tree.ts +31 -0
package/src/types/data-structures/binary-tree/bst.ts +11 -0
package/src/types/data-structures/binary-tree/index.ts +6 -0
package/src/types/data-structures/binary-tree/rb-tree.ts +8 -0
package/src/types/data-structures/binary-tree/segment-tree.ts +1 -0
package/src/types/data-structures/binary-tree/tree-multiset.ts +6 -0
package/src/types/data-structures/graph/abstract-graph.ts +11 -0
package/src/types/data-structures/graph/directed-graph.ts +8 -0
package/src/types/data-structures/graph/index.ts +3 -0
package/src/types/data-structures/graph/map-graph.ts +1 -0
package/src/types/data-structures/graph/undirected-graph.ts +1 -0
package/src/types/data-structures/hash/coordinate-map.ts +1 -0
package/src/types/data-structures/hash/coordinate-set.ts +1 -0
package/src/types/data-structures/hash/hash-map.ts +1 -0
package/src/types/data-structures/hash/hash-table.ts +1 -0
package/src/types/data-structures/hash/index.ts +1 -0
package/src/types/data-structures/hash/tree-map.ts +1 -0
package/src/types/data-structures/hash/tree-set.ts +1 -0
package/src/types/data-structures/heap/heap.ts +1 -0
package/src/types/data-structures/heap/index.ts +1 -0
package/src/types/data-structures/heap/max-heap.ts +1 -0
package/src/types/data-structures/heap/min-heap.ts +1 -0
package/src/types/data-structures/index.ts +11 -0
package/src/types/data-structures/linked-list/doubly-linked-list.ts +1 -0
package/src/types/data-structures/linked-list/index.ts +2 -0
package/src/types/data-structures/linked-list/singly-linked-list.ts +1 -0
package/src/types/data-structures/linked-list/skip-linked-list.ts +1 -0
package/src/types/data-structures/matrix/index.ts +1 -0
package/src/types/data-structures/matrix/matrix.ts +1 -0
package/src/types/data-structures/matrix/matrix2d.ts +1 -0
package/src/types/data-structures/matrix/navigator.ts +14 -0
package/src/types/data-structures/matrix/vector2d.ts +1 -0
package/src/types/data-structures/priority-queue/index.ts +3 -0
package/src/types/data-structures/priority-queue/max-priority-queue.ts +1 -0
package/src/types/data-structures/priority-queue/min-priority-queue.ts +1 -0
package/src/types/data-structures/priority-queue/priority-queue.ts +1 -0
package/src/types/data-structures/queue/deque.ts +1 -0
package/src/types/data-structures/queue/index.ts +2 -0
package/src/types/data-structures/queue/queue.ts +1 -0
package/src/types/data-structures/stack/index.ts +1 -0
package/src/types/data-structures/stack/stack.ts +1 -0
package/src/types/data-structures/tree/index.ts +1 -0
package/src/types/data-structures/tree/tree.ts +1 -0
package/src/types/data-structures/trie/index.ts +1 -0
package/src/types/data-structures/trie/trie.ts +1 -0
package/src/types/helpers.ts +11 -0
package/src/types/index.ts +3 -0
package/src/types/utils/index.ts +2 -0
package/src/types/utils/utils.ts +6 -0
package/src/types/utils/validate-type.ts +35 -0
package/src/utils/index.ts +1 -0
package/src/utils/utils.ts +86 -0
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'>3/3</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">100% </span>
                 <span class="quiet">Functions</span>
                 <span class='fraction'>2/2</span>
             </div>
             <div class='fl pad1y space-right2'>
                 <span class="strong">100% </span>
                 <span class="quiet">Lines</span>
                 <span class='fraction'>1/1</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>
@@ -71,7 +71,8 @@
 <a name='L6'></a><a href='#L6'>6</a>
 <a name='L7'></a><a href='#L7'>7</a>
 <a name='L8'></a><a href='#L8'>8</a>
-<a name='L9'></a><a href='#L9'>9</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
+<a name='L9'></a><a href='#L9'>9</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>
@@ -89,21 +90,21 @@
 export { MinHeap, HeapItem } 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:23:16.441Z
-            </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:23:16.441Z
+</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/avl-tree.d.ts ADDED Viewed

@@ -0,0 +1,106 @@
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+import { BST, BSTNode } from './bst';
+import type { AVLTreeNodeNested, AVLTreeOptions, BinaryTreeDeletedResult, BTNKey } from '../../types';
+import { BTNCallback } from '../../types';
+import { IBinaryTree } from '../../interfaces';
+export declare class AVLTreeNode<V = any, N extends AVLTreeNode<V, N> = AVLTreeNodeNested<V>> extends BSTNode<V, N> {
+    height: number;
+    constructor(key: BTNKey, value?: V);
+}
+export declare class AVLTree<V = any, N extends AVLTreeNode<V, N> = AVLTreeNode<V, AVLTreeNodeNested<V>>> extends BST<V, N> implements IBinaryTree<V, N> {
+    /**
+     * This is a constructor function for an AVL tree data structure in TypeScript.
+     * @param {AVLTreeOptions} [options] - The `options` parameter is an optional object that can be passed to the
+     * constructor of the AVLTree class. It allows you to customize the behavior of the AVL tree by providing different
+     * options.
+     */
+    constructor(options?: AVLTreeOptions);
+    /**
+     * The function creates a new AVL tree node with the specified key and value.
+     * @param {BTNKey} key - The key parameter is the key value that will be associated with
+     * the new node. It is used to determine the position of the node in the binary search tree.
+     * @param [value] - The parameter `value` is an optional value that can be assigned to the node. It is of
+     * type `V`, which means it can be any value that is assignable to the `value` property of the
+     * node type `N`.
+     * @returns a new AVLTreeNode object with the specified key and value.
+     */
+    createNode(key: BTNKey, value?: V): N;
+    /**
+     * The function overrides the add method of a binary tree node and balances the tree after inserting
+     * a new node.
+     * @param {BTNKey | N | null} keyOrNode - The `keyOrNode` parameter can accept either a
+     * `BTNKey` or a `N` (which represents a node in the binary tree) or `null`.
+     * @param [value] - The `value` parameter is the value that you want to assign to the new node that you
+     * are adding to the binary search tree.
+     * @returns The method is returning the inserted node (`N`), `null`, or `undefined`.
+     */
+    add(keyOrNode: BTNKey | N | null, value?: V): N | null | undefined;
+    /**
+     * The function overrides the delete method of a binary tree and balances the tree after deleting a
+     * node if necessary.
+     * @param {ReturnType<C>} identifier - The `identifier` parameter is either a
+     * `BTNKey` or a generic type `N`. It represents the property of the node that we are
+     * searching for. It can be a specific key value or any other property of the node.
+     * @param callback - The `callback` parameter is a function that takes a node as input and returns a
+     * value. This value is compared with the `identifier` parameter to determine if the node should be
+     * included in the result. The `callback` parameter has a default value of
+     * `((node: N) => node.key)`
+     * @returns The method is returning an array of `BinaryTreeDeletedResult<N>` objects.
+     */
+    delete<C extends BTNCallback<N>>(identifier: ReturnType<C>, callback?: C): BinaryTreeDeletedResult<N>[];
+    /**
+     * The function swaps the key, value, and height properties between two nodes in a binary tree.
+     * @param {N} srcNode - The `srcNode` parameter represents the source node that needs to be swapped
+     * with the `destNode`.
+     * @param {N} destNode - The `destNode` parameter represents the destination node where the values
+     * from the source node (`srcNode`) will be swapped to.
+     * @returns The method is returning the `destNode` after swapping its properties with the `srcNode`.
+     */
+    protected _swap(srcNode: N, destNode: N): N;
+    /**
+     * The function calculates the balance factor of a node in a binary tree.
+     * @param {N} node - The parameter "node" represents a node in a binary tree data structure.
+     * @returns the balance factor of a given node. The balance factor is calculated by subtracting the
+     * height of the left subtree from the height of the right subtree.
+     */
+    protected _balanceFactor(node: N): number;
+    /**
+     * The function updates the height of a node in a binary tree based on the heights of its left and
+     * right children.
+     * @param {N} node - The parameter "node" represents a node in a binary tree data structure.
+     */
+    protected _updateHeight(node: N): void;
+    /**
+     * The `_balancePath` function is used to update the heights of nodes and perform rotation operations
+     * to restore balance in an AVL tree after inserting a node.
+     * @param {N} node - The `node` parameter in the `_balancePath` function represents the node in the
+     * AVL tree that needs to be balanced.
+     */
+    protected _balancePath(node: N): void;
+    /**
+     * The function `_balanceLL` performs a left-left rotation to balance a binary tree.
+     * @param {N} A - A is a node in a binary tree.
+     */
+    protected _balanceLL(A: N): void;
+    /**
+     * The `_balanceLR` function performs a left-right rotation to balance a binary tree.
+     * @param {N} A - A is a node in a binary tree.
+     */
+    protected _balanceLR(A: N): void;
+    /**
+     * The function `_balanceRR` performs a right-right rotation to balance a binary tree.
+     * @param {N} A - A is a node in a binary tree.
+     */
+    protected _balanceRR(A: N): void;
+    /**
+     * The function `_balanceRL` performs a right-left rotation to balance a binary tree.
+     * @param {N} A - A is a node in a binary tree.
+     */
+    protected _balanceRL(A: N): void;
+}

package/dist/data-structures/binary-tree/avl-tree.js ADDED Viewed

@@ -0,0 +1,347 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.AVLTree = exports.AVLTreeNode = void 0;
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+const bst_1 = require("./bst");
+class AVLTreeNode extends bst_1.BSTNode {
+    constructor(key, value) {
+        super(key, value);
+        this.height = 0;
+    }
+}
+exports.AVLTreeNode = AVLTreeNode;
+class AVLTree extends bst_1.BST {
+    /**
+     * This is a constructor function for an AVL tree data structure in TypeScript.
+     * @param {AVLTreeOptions} [options] - The `options` parameter is an optional object that can be passed to the
+     * constructor of the AVLTree class. It allows you to customize the behavior of the AVL tree by providing different
+     * options.
+     */
+    constructor(options) {
+        super(options);
+    }
+    /**
+     * The function creates a new AVL tree node with the specified key and value.
+     * @param {BTNKey} key - The key parameter is the key value that will be associated with
+     * the new node. It is used to determine the position of the node in the binary search tree.
+     * @param [value] - The parameter `value` is an optional value that can be assigned to the node. It is of
+     * type `V`, which means it can be any value that is assignable to the `value` property of the
+     * node type `N`.
+     * @returns a new AVLTreeNode object with the specified key and value.
+     */
+    createNode(key, value) {
+        return new AVLTreeNode(key, value);
+    }
+    /**
+     * The function overrides the add method of a binary tree node and balances the tree after inserting
+     * a new node.
+     * @param {BTNKey | N | null} keyOrNode - The `keyOrNode` parameter can accept either a
+     * `BTNKey` or a `N` (which represents a node in the binary tree) or `null`.
+     * @param [value] - The `value` parameter is the value that you want to assign to the new node that you
+     * are adding to the binary search tree.
+     * @returns The method is returning the inserted node (`N`), `null`, or `undefined`.
+     */
+    add(keyOrNode, value) {
+        const inserted = super.add(keyOrNode, value);
+        if (inserted)
+            this._balancePath(inserted);
+        return inserted;
+    }
+    /**
+     * The function overrides the delete method of a binary tree and balances the tree after deleting a
+     * node if necessary.
+     * @param {ReturnType<C>} identifier - The `identifier` parameter is either a
+     * `BTNKey` or a generic type `N`. It represents the property of the node that we are
+     * searching for. It can be a specific key value or any other property of the node.
+     * @param callback - The `callback` parameter is a function that takes a node as input and returns a
+     * value. This value is compared with the `identifier` parameter to determine if the node should be
+     * included in the result. The `callback` parameter has a default value of
+     * `((node: N) => node.key)`
+     * @returns The method is returning an array of `BinaryTreeDeletedResult<N>` objects.
+     */
+    delete(identifier, callback = ((node) => node.key)) {
+        if (identifier instanceof AVLTreeNode)
+            callback = (node => node);
+        const deletedResults = super.delete(identifier, callback);
+        for (const { needBalanced } of deletedResults) {
+            if (needBalanced) {
+                this._balancePath(needBalanced);
+            }
+        }
+        return deletedResults;
+    }
+    /**
+     * The function swaps the key, value, and height properties between two nodes in a binary tree.
+     * @param {N} srcNode - The `srcNode` parameter represents the source node that needs to be swapped
+     * with the `destNode`.
+     * @param {N} destNode - The `destNode` parameter represents the destination node where the values
+     * from the source node (`srcNode`) will be swapped to.
+     * @returns The method is returning the `destNode` after swapping its properties with the `srcNode`.
+     */
+    _swap(srcNode, destNode) {
+        const { key, value, height } = destNode;
+        const tempNode = this.createNode(key, value);
+        if (tempNode) {
+            tempNode.height = height;
+            destNode.key = srcNode.key;
+            destNode.value = srcNode.value;
+            destNode.height = srcNode.height;
+            srcNode.key = tempNode.key;
+            srcNode.value = tempNode.value;
+            srcNode.height = tempNode.height;
+        }
+        return destNode;
+    }
+    /**
+     * The function calculates the balance factor of a node in a binary tree.
+     * @param {N} node - The parameter "node" represents a node in a binary tree data structure.
+     * @returns the balance factor of a given node. The balance factor is calculated by subtracting the
+     * height of the left subtree from the height of the right subtree.
+     */
+    _balanceFactor(node) {
+        if (!node.right)
+            // node has no right subtree
+            return -node.height;
+        else if (!node.left)
+            // node has no left subtree
+            return +node.height;
+        else
+            return node.right.height - node.left.height;
+    }
+    /**
+     * The function updates the height of a node in a binary tree based on the heights of its left and
+     * right children.
+     * @param {N} node - The parameter "node" represents a node in a binary tree data structure.
+     */
+    _updateHeight(node) {
+        if (!node.left && !node.right)
+            node.height = 0;
+        else if (!node.left) {
+            const rightHeight = node.right ? node.right.height : 0;
+            node.height = 1 + rightHeight;
+        }
+        else if (!node.right)
+            node.height = 1 + node.left.height;
+        else
+            node.height = 1 + Math.max(node.right.height, node.left.height);
+    }
+    /**
+     * The `_balancePath` function is used to update the heights of nodes and perform rotation operations
+     * to restore balance in an AVL tree after inserting a node.
+     * @param {N} node - The `node` parameter in the `_balancePath` function represents the node in the
+     * AVL tree that needs to be balanced.
+     */
+    _balancePath(node) {
+        const path = this.getPathToRoot(node, false); // first O(log n) + O(log n)
+        for (let i = 0; i < path.length; i++) {
+            // second O(log n)
+            const A = path[i];
+            // Update Heights: After inserting a node, backtrack from the insertion point to the root node, updating the height of each node along the way.
+            this._updateHeight(A); // first O(1)
+            // Check Balance: Simultaneously with height updates, check if each node violates the balance property of an AVL tree.
+            // 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) {
+                            // second O(1)
+                            // Left Rotation (LL Rotation): When the inserted node is in the left subtree of the left subtree, causing an imbalance.
+                            this._balanceLL(A);
+                        }
+                        else {
+                            // Left-Right Rotation (LR Rotation): When the inserted node is in the right subtree of the left subtree, causing an imbalance.
+                            this._balanceLR(A);
+                        }
+                    }
+                    break;
+                case +2:
+                    if (A && A.right) {
+                        if (this._balanceFactor(A.right) >= 0) {
+                            // Right Rotation (RR Rotation): When the inserted node is in the right subtree of the right subtree, causing an imbalance.
+                            this._balanceRR(A);
+                        }
+                        else {
+                            // Right-Left Rotation (RL Rotation): When the inserted node is in the left subtree of the right subtree, causing an imbalance.
+                            this._balanceRL(A);
+                        }
+                    }
+            }
+            // TODO So far, no sure if this is necessary that Recursive Repair: Once rotation operations are executed, it may cause imbalance issues at higher levels of the tree. Therefore, you need to recursively check and repair imbalance problems upwards until you reach the root node.
+        }
+    }
+    /**
+     * The function `_balanceLL` performs a left-left rotation to balance a binary tree.
+     * @param {N} A - A is a node in a binary tree.
+     */
+    _balanceLL(A) {
+        const parentOfA = A.parent;
+        const B = A.left;
+        A.parent = B;
+        if (B && B.right) {
+            B.right.parent = A;
+        }
+        if (B)
+            B.parent = parentOfA;
+        if (A === this.root) {
+            if (B)
+                this._setRoot(B);
+        }
+        else {
+            if ((parentOfA === null || parentOfA === void 0 ? void 0 : parentOfA.left) === A) {
+                parentOfA.left = B;
+            }
+            else {
+                if (parentOfA)
+                    parentOfA.right = B;
+            }
+        }
+        if (B) {
+            A.left = B.right;
+            B.right = A;
+        }
+        this._updateHeight(A);
+        if (B)
+            this._updateHeight(B);
+    }
+    /**
+     * The `_balanceLR` function performs a left-right rotation to balance a binary tree.
+     * @param {N} A - A is a node in a binary tree.
+     */
+    _balanceLR(A) {
+        const parentOfA = A.parent;
+        const B = A.left;
+        let C = null;
+        if (B) {
+            C = B.right;
+        }
+        if (A)
+            A.parent = C;
+        if (B)
+            B.parent = C;
+        if (C) {
+            if (C.left) {
+                C.left.parent = B;
+            }
+            if (C.right) {
+                C.right.parent = A;
+            }
+            C.parent = parentOfA;
+        }
+        if (A === this.root) {
+            if (C)
+                this._setRoot(C);
+        }
+        else {
+            if (parentOfA) {
+                if (parentOfA.left === A) {
+                    parentOfA.left = C;
+                }
+                else {
+                    parentOfA.right = C;
+                }
+            }
+        }
+        if (C) {
+            A.left = C.right;
+            if (B)
+                B.right = C.left;
+            C.left = B;
+            C.right = A;
+        }
+        this._updateHeight(A);
+        B && this._updateHeight(B);
+        C && this._updateHeight(C);
+    }
+    /**
+     * The function `_balanceRR` performs a right-right rotation to balance a binary tree.
+     * @param {N} A - A is a node in a binary tree.
+     */
+    _balanceRR(A) {
+        const parentOfA = A.parent;
+        const B = A.right;
+        A.parent = B;
+        if (B) {
+            if (B.left) {
+                B.left.parent = A;
+            }
+            B.parent = parentOfA;
+        }
+        if (A === this.root) {
+            if (B)
+                this._setRoot(B);
+        }
+        else {
+            if (parentOfA) {
+                if (parentOfA.left === A) {
+                    parentOfA.left = B;
+                }
+                else {
+                    parentOfA.right = B;
+                }
+            }
+        }
+        if (B) {
+            A.right = B.left;
+            B.left = A;
+        }
+        this._updateHeight(A);
+        B && this._updateHeight(B);
+    }
+    /**
+     * The function `_balanceRL` performs a right-left rotation to balance a binary tree.
+     * @param {N} A - A is a node in a binary tree.
+     */
+    _balanceRL(A) {
+        const parentOfA = A.parent;
+        const B = A.right;
+        let C = null;
+        if (B) {
+            C = B.left;
+        }
+        A.parent = C;
+        if (B)
+            B.parent = C;
+        if (C) {
+            if (C.left) {
+                C.left.parent = A;
+            }
+            if (C.right) {
+                C.right.parent = B;
+            }
+            C.parent = parentOfA;
+        }
+        if (A === this.root) {
+            if (C)
+                this._setRoot(C);
+        }
+        else {
+            if (parentOfA) {
+                if (parentOfA.left === A) {
+                    parentOfA.left = C;
+                }
+                else {
+                    parentOfA.right = C;
+                }
+            }
+        }
+        if (C)
+            A.right = C.left;
+        if (B && C)
+            B.left = C.right;
+        if (C)
+            C.left = A;
+        if (C)
+            C.right = B;
+        this._updateHeight(A);
+        B && this._updateHeight(B);
+        C && this._updateHeight(C);
+    }
+}
+exports.AVLTree = AVLTree;