From fd5ebea438667556cd761343037281be2db58a9a Mon Sep 17 00:00:00 2001 From: zrwusa <75152230+zrwusa@users.noreply.github.com> Date: Tue, 3 Oct 2023 14:13:32 +0800 Subject: [PATCH] Delete docs directory --- docs/.nojekyll | 1 - docs/assets/highlight.css | 127 - docs/assets/main.js | 58 - docs/assets/search.js | 1 - docs/assets/style.css | 1367 --------- docs/classes/AVLTree.html | 2145 -------------- docs/classes/AVLTreeNode.html | 403 --- docs/classes/AaTree.html | 206 -- docs/classes/AbstractBinaryTree.html | 1794 ------------ docs/classes/AbstractBinaryTreeNode.html | 445 --- docs/classes/AbstractEdge.html | 349 --- docs/classes/AbstractGraph.html | 1109 -------- docs/classes/AbstractVertex.html | 303 -- docs/classes/ArrayDeque.html | 473 ---- docs/classes/BST.html | 1989 ------------- docs/classes/BSTNode.html | 404 --- docs/classes/BTree.html | 206 -- docs/classes/BinaryIndexedTree.html | 375 --- docs/classes/BinaryTree.html | 1830 ------------ docs/classes/BinaryTreeNode.html | 403 --- docs/classes/Character.html | 254 -- docs/classes/CoordinateMap.html | 517 ---- docs/classes/CoordinateSet.html | 478 ---- docs/classes/Deque.html | 1142 -------- docs/classes/DirectedEdge.html | 408 --- docs/classes/DirectedGraph.html | 1534 ---------- docs/classes/DirectedVertex.html | 290 -- docs/classes/DoublyLinkedList.html | 1127 -------- docs/classes/DoublyLinkedListNode.html | 331 --- docs/classes/HashTable.html | 599 ---- docs/classes/Heap.html | 651 ----- docs/classes/HeapItem.html | 300 -- docs/classes/LinkedListQueue.html | 888 ------ docs/classes/MapEdge.html | 395 --- docs/classes/MapGraph.html | 1587 ----------- docs/classes/MapVertex.html | 360 --- docs/classes/Matrix2D.html | 536 ---- docs/classes/MatrixNTI2D.html | 274 -- docs/classes/MaxHeap.html | 675 ----- docs/classes/MaxPriorityQueue.html | 870 ------ docs/classes/MinHeap.html | 676 ----- docs/classes/MinPriorityQueue.html | 872 ------ docs/classes/Navigator.html | 347 --- docs/classes/ObjectDeque.html | 531 ---- docs/classes/Pair.html | 206 -- docs/classes/PriorityQueue.html | 794 ------ docs/classes/Queue.html | 525 ---- docs/classes/RBTree.html | 1987 ------------- docs/classes/RBTreeNode.html | 433 --- docs/classes/SegmentTree.html | 468 ---- docs/classes/SegmentTreeNode.html | 391 --- docs/classes/SinglyLinkedList.html | 834 ------ docs/classes/SinglyLinkedListNode.html | 304 -- docs/classes/SplayTree.html | 206 -- docs/classes/Stack.html | 402 --- docs/classes/TreeMap.html | 206 -- docs/classes/TreeMultiset.html | 2480 ----------------- docs/classes/TreeMultisetNode.html | 451 --- docs/classes/TreeNode.html | 348 --- docs/classes/TreeSet.html | 206 -- docs/classes/Trie.html | 406 --- docs/classes/TrieNode.html | 314 --- docs/classes/TwoThreeTree.html | 206 -- docs/classes/UndirectedEdge.html | 378 --- docs/classes/UndirectedGraph.html | 1289 --------- docs/classes/UndirectedVertex.html | 288 -- docs/classes/Vector2D.html | 839 ------ docs/enums/CP.html | 215 -- docs/enums/FamilyPosition.html | 243 -- docs/enums/LoopType.html | 216 -- docs/enums/RBColor.html | 208 -- docs/enums/TopologicalProperty.html | 215 -- docs/functions/arrayRemove.html | 212 -- docs/functions/isThunk.html | 190 -- docs/functions/toThunk.html | 190 -- docs/functions/trampoline.html | 190 -- docs/functions/trampolineAsync.html | 190 -- docs/functions/uuidV4.html | 185 -- docs/index.html | 882 ------ docs/interfaces/IAVLTree.html | 1236 -------- docs/interfaces/IAbstractBinaryTree.html | 1095 -------- docs/interfaces/IAbstractBinaryTreeNode.html | 339 --- docs/interfaces/IAbstractGraph.html | 437 --- docs/interfaces/IBST.html | 1238 -------- docs/interfaces/IDirectedGraph.html | 574 ---- docs/interfaces/IRBTree.html | 1240 --------- docs/interfaces/IUNDirectedGraph.html | 467 ---- docs/modules.html | 336 --- docs/types/AVLTreeNodeNested.html | 186 -- docs/types/AVLTreeOptions.html | 184 -- docs/types/AbstractBinaryTreeNodeNested.html | 186 -- .../AbstractBinaryTreeNodeProperties.html | 186 -- .../types/AbstractBinaryTreeNodeProperty.html | 186 -- docs/types/AbstractBinaryTreeOptions.html | 186 -- docs/types/BSTComparator.html | 196 -- docs/types/BSTNodeNested.html | 186 -- docs/types/BSTOptions.html | 186 -- docs/types/BinaryTreeDeletedResult.html | 193 -- docs/types/BinaryTreeNodeId.html | 181 -- docs/types/BinaryTreeNodeNested.html | 186 -- docs/types/BinaryTreeNodePropertyName.html | 181 -- docs/types/BinaryTreeOptions.html | 184 -- docs/types/DFSOrderPattern.html | 181 -- docs/types/DijkstraResult.html | 203 -- docs/types/Direction.html | 181 -- docs/types/DummyAny.html | 194 -- docs/types/EdgeId.html | 181 -- docs/types/HeapOptions.html | 202 -- docs/types/IAVLTreeNode.html | 188 -- docs/types/IBSTNode.html | 188 -- docs/types/IBinaryTree.html | 186 -- docs/types/IBinaryTreeNode.html | 188 -- docs/types/IRBTreeNode.html | 188 -- docs/types/ITreeMultiset.html | 186 -- docs/types/ITreeMultisetNode.html | 188 -- docs/types/KeyValueObject.html | 186 -- docs/types/KeyValueObjectWithId.html | 188 -- docs/types/MapGraphCoordinate.html | 181 -- docs/types/NavigatorParams.html | 215 -- docs/types/NodeOrPropertyName.html | 181 -- docs/types/NonNumberNonObjectButDefined.html | 181 -- docs/types/ObjectWithNonNumberId.html | 188 -- docs/types/ObjectWithNumberId.html | 188 -- docs/types/ObjectWithoutId.html | 181 -- docs/types/PriorityQueueComparator.html | 201 -- docs/types/PriorityQueueDFSOrderPattern.html | 181 -- docs/types/PriorityQueueOptions.html | 195 -- docs/types/RBTreeNodeNested.html | 186 -- docs/types/RBTreeOptions.html | 184 -- docs/types/RestrictValById.html | 181 -- docs/types/SegmentTreeNodeVal.html | 181 -- docs/types/SpecifyOptional.html | 188 -- docs/types/Thunk.html | 189 -- docs/types/ToThunkFn.html | 189 -- docs/types/TopologicalStatus.html | 181 -- docs/types/TreeMultisetNodeNested.html | 186 -- docs/types/TreeMultisetOptions.html | 184 -- docs/types/TrlAsyncFn.html | 194 -- docs/types/TrlFn.html | 194 -- docs/types/Turning.html | 181 -- docs/types/VertexId.html | 181 -- docs/variables/THUNK_SYMBOL.html | 181 -- 142 files changed, 63796 deletions(-) delete mode 100644 docs/.nojekyll delete mode 100644 docs/assets/highlight.css delete mode 100644 docs/assets/main.js delete mode 100644 docs/assets/search.js delete mode 100644 docs/assets/style.css delete mode 100644 docs/classes/AVLTree.html delete mode 100644 docs/classes/AVLTreeNode.html delete mode 100644 docs/classes/AaTree.html delete mode 100644 docs/classes/AbstractBinaryTree.html delete mode 100644 docs/classes/AbstractBinaryTreeNode.html delete mode 100644 docs/classes/AbstractEdge.html delete mode 100644 docs/classes/AbstractGraph.html delete mode 100644 docs/classes/AbstractVertex.html delete mode 100644 docs/classes/ArrayDeque.html delete mode 100644 docs/classes/BST.html delete mode 100644 docs/classes/BSTNode.html delete mode 100644 docs/classes/BTree.html delete mode 100644 docs/classes/BinaryIndexedTree.html delete mode 100644 docs/classes/BinaryTree.html delete mode 100644 docs/classes/BinaryTreeNode.html delete mode 100644 docs/classes/Character.html delete mode 100644 docs/classes/CoordinateMap.html delete mode 100644 docs/classes/CoordinateSet.html delete mode 100644 docs/classes/Deque.html delete mode 100644 docs/classes/DirectedEdge.html delete mode 100644 docs/classes/DirectedGraph.html delete mode 100644 docs/classes/DirectedVertex.html delete mode 100644 docs/classes/DoublyLinkedList.html delete mode 100644 docs/classes/DoublyLinkedListNode.html delete mode 100644 docs/classes/HashTable.html delete mode 100644 docs/classes/Heap.html delete mode 100644 docs/classes/HeapItem.html delete mode 100644 docs/classes/LinkedListQueue.html delete mode 100644 docs/classes/MapEdge.html delete mode 100644 docs/classes/MapGraph.html delete mode 100644 docs/classes/MapVertex.html delete mode 100644 docs/classes/Matrix2D.html delete mode 100644 docs/classes/MatrixNTI2D.html delete mode 100644 docs/classes/MaxHeap.html delete mode 100644 docs/classes/MaxPriorityQueue.html delete mode 100644 docs/classes/MinHeap.html delete mode 100644 docs/classes/MinPriorityQueue.html delete mode 100644 docs/classes/Navigator.html delete mode 100644 docs/classes/ObjectDeque.html delete mode 100644 docs/classes/Pair.html delete mode 100644 docs/classes/PriorityQueue.html delete mode 100644 docs/classes/Queue.html delete mode 100644 docs/classes/RBTree.html delete mode 100644 docs/classes/RBTreeNode.html delete mode 100644 docs/classes/SegmentTree.html delete mode 100644 docs/classes/SegmentTreeNode.html delete mode 100644 docs/classes/SinglyLinkedList.html delete mode 100644 docs/classes/SinglyLinkedListNode.html delete mode 100644 docs/classes/SplayTree.html delete mode 100644 docs/classes/Stack.html delete mode 100644 docs/classes/TreeMap.html delete mode 100644 docs/classes/TreeMultiset.html delete mode 100644 docs/classes/TreeMultisetNode.html delete mode 100644 docs/classes/TreeNode.html delete mode 100644 docs/classes/TreeSet.html delete mode 100644 docs/classes/Trie.html delete mode 100644 docs/classes/TrieNode.html delete mode 100644 docs/classes/TwoThreeTree.html delete mode 100644 docs/classes/UndirectedEdge.html delete mode 100644 docs/classes/UndirectedGraph.html delete mode 100644 docs/classes/UndirectedVertex.html delete mode 100644 docs/classes/Vector2D.html delete mode 100644 docs/enums/CP.html delete mode 100644 docs/enums/FamilyPosition.html delete mode 100644 docs/enums/LoopType.html delete mode 100644 docs/enums/RBColor.html delete mode 100644 docs/enums/TopologicalProperty.html delete mode 100644 docs/functions/arrayRemove.html delete mode 100644 docs/functions/isThunk.html delete mode 100644 docs/functions/toThunk.html delete mode 100644 docs/functions/trampoline.html delete mode 100644 docs/functions/trampolineAsync.html delete mode 100644 docs/functions/uuidV4.html delete mode 100644 docs/index.html delete mode 100644 docs/interfaces/IAVLTree.html delete mode 100644 docs/interfaces/IAbstractBinaryTree.html delete mode 100644 docs/interfaces/IAbstractBinaryTreeNode.html delete mode 100644 docs/interfaces/IAbstractGraph.html delete mode 100644 docs/interfaces/IBST.html delete mode 100644 docs/interfaces/IDirectedGraph.html delete mode 100644 docs/interfaces/IRBTree.html delete mode 100644 docs/interfaces/IUNDirectedGraph.html delete mode 100644 docs/modules.html delete mode 100644 docs/types/AVLTreeNodeNested.html delete mode 100644 docs/types/AVLTreeOptions.html delete mode 100644 docs/types/AbstractBinaryTreeNodeNested.html delete mode 100644 docs/types/AbstractBinaryTreeNodeProperties.html delete mode 100644 docs/types/AbstractBinaryTreeNodeProperty.html delete mode 100644 docs/types/AbstractBinaryTreeOptions.html delete mode 100644 docs/types/BSTComparator.html delete mode 100644 docs/types/BSTNodeNested.html delete mode 100644 docs/types/BSTOptions.html delete mode 100644 docs/types/BinaryTreeDeletedResult.html delete mode 100644 docs/types/BinaryTreeNodeId.html delete mode 100644 docs/types/BinaryTreeNodeNested.html delete mode 100644 docs/types/BinaryTreeNodePropertyName.html delete mode 100644 docs/types/BinaryTreeOptions.html delete mode 100644 docs/types/DFSOrderPattern.html delete mode 100644 docs/types/DijkstraResult.html delete mode 100644 docs/types/Direction.html delete mode 100644 docs/types/DummyAny.html delete mode 100644 docs/types/EdgeId.html delete mode 100644 docs/types/HeapOptions.html delete mode 100644 docs/types/IAVLTreeNode.html delete mode 100644 docs/types/IBSTNode.html delete mode 100644 docs/types/IBinaryTree.html delete mode 100644 docs/types/IBinaryTreeNode.html delete mode 100644 docs/types/IRBTreeNode.html delete mode 100644 docs/types/ITreeMultiset.html delete mode 100644 docs/types/ITreeMultisetNode.html delete mode 100644 docs/types/KeyValueObject.html delete mode 100644 docs/types/KeyValueObjectWithId.html delete mode 100644 docs/types/MapGraphCoordinate.html delete mode 100644 docs/types/NavigatorParams.html delete mode 100644 docs/types/NodeOrPropertyName.html delete mode 100644 docs/types/NonNumberNonObjectButDefined.html delete mode 100644 docs/types/ObjectWithNonNumberId.html delete mode 100644 docs/types/ObjectWithNumberId.html delete mode 100644 docs/types/ObjectWithoutId.html delete mode 100644 docs/types/PriorityQueueComparator.html delete mode 100644 docs/types/PriorityQueueDFSOrderPattern.html delete mode 100644 docs/types/PriorityQueueOptions.html delete mode 100644 docs/types/RBTreeNodeNested.html delete mode 100644 docs/types/RBTreeOptions.html delete mode 100644 docs/types/RestrictValById.html delete mode 100644 docs/types/SegmentTreeNodeVal.html delete mode 100644 docs/types/SpecifyOptional.html delete mode 100644 docs/types/Thunk.html delete mode 100644 docs/types/ToThunkFn.html delete mode 100644 docs/types/TopologicalStatus.html delete mode 100644 docs/types/TreeMultisetNodeNested.html delete mode 100644 docs/types/TreeMultisetOptions.html delete mode 100644 docs/types/TrlAsyncFn.html delete mode 100644 docs/types/TrlFn.html delete mode 100644 docs/types/Turning.html delete mode 100644 docs/types/VertexId.html delete mode 100644 docs/variables/THUNK_SYMBOL.html diff --git a/docs/.nojekyll b/docs/.nojekyll deleted file mode 100644 index e2ac661..0000000 --- a/docs/.nojekyll +++ /dev/null @@ -1 +0,0 @@ -TypeDoc added this file to prevent GitHub Pages from using Jekyll. You can turn off this behavior by setting the `githubPages` option to false. \ No newline at end of file diff --git a/docs/assets/highlight.css b/docs/assets/highlight.css deleted file mode 100644 index 1928eb6..0000000 --- a/docs/assets/highlight.css +++ /dev/null @@ -1,127 +0,0 @@ -:root { - --light-hl-0: #795E26; - --dark-hl-0: #DCDCAA; - --light-hl-1: #000000; - --dark-hl-1: #D4D4D4; - --light-hl-2: #A31515; - --dark-hl-2: #CE9178; - --light-hl-3: #0000FF; - --dark-hl-3: #569CD6; - --light-hl-4: #800000; - --dark-hl-4: #808080; - --light-hl-5: #800000; - --dark-hl-5: #569CD6; - --light-hl-6: #000000FF; - --dark-hl-6: #D4D4D4; - --light-hl-7: #E50000; - --dark-hl-7: #9CDCFE; - --light-hl-8: #0000FF; - --dark-hl-8: #CE9178; - --light-hl-9: #0070C1; - --dark-hl-9: #4FC1FF; - --light-hl-10: #001080; - --dark-hl-10: #9CDCFE; - --light-hl-11: #AF00DB; - --dark-hl-11: #C586C0; - --light-hl-12: #098658; - --dark-hl-12: #B5CEA8; - --light-hl-13: #008000; - --dark-hl-13: #6A9955; - --light-hl-14: #267F99; - --dark-hl-14: #4EC9B0; - --light-code-background: #FFFFFF; - --dark-code-background: #1E1E1E; -} - -@media (prefers-color-scheme: light) { :root { - --hl-0: var(--light-hl-0); - --hl-1: var(--light-hl-1); - --hl-2: var(--light-hl-2); - --hl-3: var(--light-hl-3); - --hl-4: var(--light-hl-4); - --hl-5: var(--light-hl-5); - --hl-6: var(--light-hl-6); - --hl-7: var(--light-hl-7); - --hl-8: var(--light-hl-8); - --hl-9: var(--light-hl-9); - --hl-10: var(--light-hl-10); - --hl-11: var(--light-hl-11); - --hl-12: var(--light-hl-12); - --hl-13: var(--light-hl-13); - --hl-14: var(--light-hl-14); - --code-background: var(--light-code-background); -} } - -@media (prefers-color-scheme: dark) { :root { - --hl-0: var(--dark-hl-0); - --hl-1: var(--dark-hl-1); - --hl-2: var(--dark-hl-2); - --hl-3: var(--dark-hl-3); - --hl-4: var(--dark-hl-4); - --hl-5: var(--dark-hl-5); - --hl-6: var(--dark-hl-6); - --hl-7: var(--dark-hl-7); - --hl-8: var(--dark-hl-8); - --hl-9: var(--dark-hl-9); - --hl-10: var(--dark-hl-10); - --hl-11: var(--dark-hl-11); - --hl-12: var(--dark-hl-12); - --hl-13: var(--dark-hl-13); - --hl-14: var(--dark-hl-14); - --code-background: var(--dark-code-background); -} } - -:root[data-theme='light'] { - --hl-0: var(--light-hl-0); - --hl-1: var(--light-hl-1); - --hl-2: var(--light-hl-2); - --hl-3: var(--light-hl-3); - --hl-4: var(--light-hl-4); - --hl-5: var(--light-hl-5); - --hl-6: var(--light-hl-6); - --hl-7: var(--light-hl-7); - --hl-8: var(--light-hl-8); - --hl-9: var(--light-hl-9); - --hl-10: var(--light-hl-10); - --hl-11: var(--light-hl-11); - --hl-12: var(--light-hl-12); - --hl-13: var(--light-hl-13); - --hl-14: var(--light-hl-14); - --code-background: var(--light-code-background); -} - -:root[data-theme='dark'] { - --hl-0: var(--dark-hl-0); - --hl-1: var(--dark-hl-1); - --hl-2: var(--dark-hl-2); - --hl-3: var(--dark-hl-3); - --hl-4: var(--dark-hl-4); - --hl-5: var(--dark-hl-5); - --hl-6: var(--dark-hl-6); - --hl-7: var(--dark-hl-7); - --hl-8: var(--dark-hl-8); - --hl-9: var(--dark-hl-9); - --hl-10: var(--dark-hl-10); - --hl-11: var(--dark-hl-11); - --hl-12: var(--dark-hl-12); - --hl-13: var(--dark-hl-13); - --hl-14: var(--dark-hl-14); - --code-background: var(--dark-code-background); -} - -.hl-0 { color: var(--hl-0); } -.hl-1 { color: var(--hl-1); } -.hl-2 { color: var(--hl-2); } -.hl-3 { color: var(--hl-3); } -.hl-4 { color: var(--hl-4); } -.hl-5 { color: var(--hl-5); } -.hl-6 { color: var(--hl-6); } -.hl-7 { color: var(--hl-7); } -.hl-8 { color: var(--hl-8); } -.hl-9 { color: var(--hl-9); } -.hl-10 { color: var(--hl-10); } -.hl-11 { color: var(--hl-11); } -.hl-12 { color: var(--hl-12); } -.hl-13 { color: var(--hl-13); } -.hl-14 { color: var(--hl-14); } -pre, code { background: var(--code-background); } diff --git a/docs/assets/main.js b/docs/assets/main.js deleted file mode 100644 index 4c8fa61..0000000 --- a/docs/assets/main.js +++ /dev/null @@ -1,58 +0,0 @@ -"use strict"; -"use strict";(()=>{var Se=Object.create;var re=Object.defineProperty;var we=Object.getOwnPropertyDescriptor;var Te=Object.getOwnPropertyNames;var ke=Object.getPrototypeOf,Qe=Object.prototype.hasOwnProperty;var Pe=(t,e)=>()=>(e||t((e={exports:{}}).exports,e),e.exports);var Ie=(t,e,r,n)=>{if(e&&typeof e=="object"||typeof e=="function")for(let i of Te(e))!Qe.call(t,i)&&i!==r&&re(t,i,{get:()=>e[i],enumerable:!(n=we(e,i))||n.enumerable});return t};var Ce=(t,e,r)=>(r=t!=null?Se(ke(t)):{},Ie(e||!t||!t.__esModule?re(r,"default",{value:t,enumerable:!0}):r,t));var ae=Pe((se,oe)=>{(function(){var t=function(e){var r=new t.Builder;return r.pipeline.add(t.trimmer,t.stopWordFilter,t.stemmer),r.searchPipeline.add(t.stemmer),e.call(r,r),r.build()};t.version="2.3.9";t.utils={},t.utils.warn=function(e){return function(r){e.console&&console.warn&&console.warn(r)}}(this),t.utils.asString=function(e){return e==null?"":e.toString()},t.utils.clone=function(e){if(e==null)return e;for(var r=Object.create(null),n=Object.keys(e),i=0;i0){var d=t.utils.clone(r)||{};d.position=[a,u],d.index=s.length,s.push(new t.Token(n.slice(a,o),d))}a=o+1}}return s},t.tokenizer.separator=/[\s\-]+/;t.Pipeline=function(){this._stack=[]},t.Pipeline.registeredFunctions=Object.create(null),t.Pipeline.registerFunction=function(e,r){r in this.registeredFunctions&&t.utils.warn("Overwriting existing registered function: "+r),e.label=r,t.Pipeline.registeredFunctions[e.label]=e},t.Pipeline.warnIfFunctionNotRegistered=function(e){var r=e.label&&e.label in this.registeredFunctions;r||t.utils.warn(`Function is not registered with pipeline. This may cause problems when serialising the index. -`,e)},t.Pipeline.load=function(e){var r=new t.Pipeline;return e.forEach(function(n){var i=t.Pipeline.registeredFunctions[n];if(i)r.add(i);else throw new Error("Cannot load unregistered function: "+n)}),r},t.Pipeline.prototype.add=function(){var e=Array.prototype.slice.call(arguments);e.forEach(function(r){t.Pipeline.warnIfFunctionNotRegistered(r),this._stack.push(r)},this)},t.Pipeline.prototype.after=function(e,r){t.Pipeline.warnIfFunctionNotRegistered(r);var n=this._stack.indexOf(e);if(n==-1)throw new Error("Cannot find existingFn");n=n+1,this._stack.splice(n,0,r)},t.Pipeline.prototype.before=function(e,r){t.Pipeline.warnIfFunctionNotRegistered(r);var n=this._stack.indexOf(e);if(n==-1)throw new Error("Cannot find existingFn");this._stack.splice(n,0,r)},t.Pipeline.prototype.remove=function(e){var r=this._stack.indexOf(e);r!=-1&&this._stack.splice(r,1)},t.Pipeline.prototype.run=function(e){for(var r=this._stack.length,n=0;n1&&(oe&&(n=s),o!=e);)i=n-r,s=r+Math.floor(i/2),o=this.elements[s*2];if(o==e||o>e)return s*2;if(ol?d+=2:a==l&&(r+=n[u+1]*i[d+1],u+=2,d+=2);return r},t.Vector.prototype.similarity=function(e){return this.dot(e)/this.magnitude()||0},t.Vector.prototype.toArray=function(){for(var e=new Array(this.elements.length/2),r=1,n=0;r0){var o=s.str.charAt(0),a;o in s.node.edges?a=s.node.edges[o]:(a=new t.TokenSet,s.node.edges[o]=a),s.str.length==1&&(a.final=!0),i.push({node:a,editsRemaining:s.editsRemaining,str:s.str.slice(1)})}if(s.editsRemaining!=0){if("*"in s.node.edges)var l=s.node.edges["*"];else{var l=new t.TokenSet;s.node.edges["*"]=l}if(s.str.length==0&&(l.final=!0),i.push({node:l,editsRemaining:s.editsRemaining-1,str:s.str}),s.str.length>1&&i.push({node:s.node,editsRemaining:s.editsRemaining-1,str:s.str.slice(1)}),s.str.length==1&&(s.node.final=!0),s.str.length>=1){if("*"in s.node.edges)var u=s.node.edges["*"];else{var u=new t.TokenSet;s.node.edges["*"]=u}s.str.length==1&&(u.final=!0),i.push({node:u,editsRemaining:s.editsRemaining-1,str:s.str.slice(1)})}if(s.str.length>1){var d=s.str.charAt(0),m=s.str.charAt(1),y;m in s.node.edges?y=s.node.edges[m]:(y=new t.TokenSet,s.node.edges[m]=y),s.str.length==1&&(y.final=!0),i.push({node:y,editsRemaining:s.editsRemaining-1,str:d+s.str.slice(2)})}}}return n},t.TokenSet.fromString=function(e){for(var r=new t.TokenSet,n=r,i=0,s=e.length;i=e;r--){var n=this.uncheckedNodes[r],i=n.child.toString();i in this.minimizedNodes?n.parent.edges[n.char]=this.minimizedNodes[i]:(n.child._str=i,this.minimizedNodes[i]=n.child),this.uncheckedNodes.pop()}};t.Index=function(e){this.invertedIndex=e.invertedIndex,this.fieldVectors=e.fieldVectors,this.tokenSet=e.tokenSet,this.fields=e.fields,this.pipeline=e.pipeline},t.Index.prototype.search=function(e){return this.query(function(r){var n=new t.QueryParser(e,r);n.parse()})},t.Index.prototype.query=function(e){for(var r=new t.Query(this.fields),n=Object.create(null),i=Object.create(null),s=Object.create(null),o=Object.create(null),a=Object.create(null),l=0;l1?this._b=1:this._b=e},t.Builder.prototype.k1=function(e){this._k1=e},t.Builder.prototype.add=function(e,r){var n=e[this._ref],i=Object.keys(this._fields);this._documents[n]=r||{},this.documentCount+=1;for(var s=0;s=this.length)return t.QueryLexer.EOS;var e=this.str.charAt(this.pos);return this.pos+=1,e},t.QueryLexer.prototype.width=function(){return this.pos-this.start},t.QueryLexer.prototype.ignore=function(){this.start==this.pos&&(this.pos+=1),this.start=this.pos},t.QueryLexer.prototype.backup=function(){this.pos-=1},t.QueryLexer.prototype.acceptDigitRun=function(){var e,r;do e=this.next(),r=e.charCodeAt(0);while(r>47&&r<58);e!=t.QueryLexer.EOS&&this.backup()},t.QueryLexer.prototype.more=function(){return this.pos1&&(e.backup(),e.emit(t.QueryLexer.TERM)),e.ignore(),e.more())return t.QueryLexer.lexText},t.QueryLexer.lexEditDistance=function(e){return e.ignore(),e.acceptDigitRun(),e.emit(t.QueryLexer.EDIT_DISTANCE),t.QueryLexer.lexText},t.QueryLexer.lexBoost=function(e){return e.ignore(),e.acceptDigitRun(),e.emit(t.QueryLexer.BOOST),t.QueryLexer.lexText},t.QueryLexer.lexEOS=function(e){e.width()>0&&e.emit(t.QueryLexer.TERM)},t.QueryLexer.termSeparator=t.tokenizer.separator,t.QueryLexer.lexText=function(e){for(;;){var r=e.next();if(r==t.QueryLexer.EOS)return t.QueryLexer.lexEOS;if(r.charCodeAt(0)==92){e.escapeCharacter();continue}if(r==":")return t.QueryLexer.lexField;if(r=="~")return e.backup(),e.width()>0&&e.emit(t.QueryLexer.TERM),t.QueryLexer.lexEditDistance;if(r=="^")return e.backup(),e.width()>0&&e.emit(t.QueryLexer.TERM),t.QueryLexer.lexBoost;if(r=="+"&&e.width()===1||r=="-"&&e.width()===1)return e.emit(t.QueryLexer.PRESENCE),t.QueryLexer.lexText;if(r.match(t.QueryLexer.termSeparator))return t.QueryLexer.lexTerm}},t.QueryParser=function(e,r){this.lexer=new t.QueryLexer(e),this.query=r,this.currentClause={},this.lexemeIdx=0},t.QueryParser.prototype.parse=function(){this.lexer.run(),this.lexemes=this.lexer.lexemes;for(var e=t.QueryParser.parseClause;e;)e=e(this);return this.query},t.QueryParser.prototype.peekLexeme=function(){return this.lexemes[this.lexemeIdx]},t.QueryParser.prototype.consumeLexeme=function(){var e=this.peekLexeme();return this.lexemeIdx+=1,e},t.QueryParser.prototype.nextClause=function(){var e=this.currentClause;this.query.clause(e),this.currentClause={}},t.QueryParser.parseClause=function(e){var r=e.peekLexeme();if(r!=null)switch(r.type){case t.QueryLexer.PRESENCE:return t.QueryParser.parsePresence;case t.QueryLexer.FIELD:return t.QueryParser.parseField;case t.QueryLexer.TERM:return t.QueryParser.parseTerm;default:var n="expected either a field or a term, found "+r.type;throw r.str.length>=1&&(n+=" with value '"+r.str+"'"),new t.QueryParseError(n,r.start,r.end)}},t.QueryParser.parsePresence=function(e){var r=e.consumeLexeme();if(r!=null){switch(r.str){case"-":e.currentClause.presence=t.Query.presence.PROHIBITED;break;case"+":e.currentClause.presence=t.Query.presence.REQUIRED;break;default:var n="unrecognised presence operator'"+r.str+"'";throw new t.QueryParseError(n,r.start,r.end)}var i=e.peekLexeme();if(i==null){var n="expecting term or field, found nothing";throw new t.QueryParseError(n,r.start,r.end)}switch(i.type){case t.QueryLexer.FIELD:return t.QueryParser.parseField;case t.QueryLexer.TERM:return t.QueryParser.parseTerm;default:var n="expecting term or field, found '"+i.type+"'";throw new t.QueryParseError(n,i.start,i.end)}}},t.QueryParser.parseField=function(e){var r=e.consumeLexeme();if(r!=null){if(e.query.allFields.indexOf(r.str)==-1){var n=e.query.allFields.map(function(o){return"'"+o+"'"}).join(", "),i="unrecognised field '"+r.str+"', possible fields: "+n;throw new t.QueryParseError(i,r.start,r.end)}e.currentClause.fields=[r.str];var s=e.peekLexeme();if(s==null){var i="expecting term, found nothing";throw new t.QueryParseError(i,r.start,r.end)}switch(s.type){case t.QueryLexer.TERM:return t.QueryParser.parseTerm;default:var i="expecting term, found '"+s.type+"'";throw new t.QueryParseError(i,s.start,s.end)}}},t.QueryParser.parseTerm=function(e){var r=e.consumeLexeme();if(r!=null){e.currentClause.term=r.str.toLowerCase(),r.str.indexOf("*")!=-1&&(e.currentClause.usePipeline=!1);var n=e.peekLexeme();if(n==null){e.nextClause();return}switch(n.type){case t.QueryLexer.TERM:return e.nextClause(),t.QueryParser.parseTerm;case t.QueryLexer.FIELD:return e.nextClause(),t.QueryParser.parseField;case t.QueryLexer.EDIT_DISTANCE:return t.QueryParser.parseEditDistance;case t.QueryLexer.BOOST:return t.QueryParser.parseBoost;case t.QueryLexer.PRESENCE:return e.nextClause(),t.QueryParser.parsePresence;default:var i="Unexpected lexeme type '"+n.type+"'";throw new t.QueryParseError(i,n.start,n.end)}}},t.QueryParser.parseEditDistance=function(e){var r=e.consumeLexeme();if(r!=null){var n=parseInt(r.str,10);if(isNaN(n)){var i="edit distance must be numeric";throw new t.QueryParseError(i,r.start,r.end)}e.currentClause.editDistance=n;var s=e.peekLexeme();if(s==null){e.nextClause();return}switch(s.type){case t.QueryLexer.TERM:return e.nextClause(),t.QueryParser.parseTerm;case t.QueryLexer.FIELD:return e.nextClause(),t.QueryParser.parseField;case t.QueryLexer.EDIT_DISTANCE:return t.QueryParser.parseEditDistance;case t.QueryLexer.BOOST:return t.QueryParser.parseBoost;case t.QueryLexer.PRESENCE:return e.nextClause(),t.QueryParser.parsePresence;default:var i="Unexpected lexeme type '"+s.type+"'";throw new t.QueryParseError(i,s.start,s.end)}}},t.QueryParser.parseBoost=function(e){var r=e.consumeLexeme();if(r!=null){var n=parseInt(r.str,10);if(isNaN(n)){var i="boost must be numeric";throw new t.QueryParseError(i,r.start,r.end)}e.currentClause.boost=n;var s=e.peekLexeme();if(s==null){e.nextClause();return}switch(s.type){case t.QueryLexer.TERM:return e.nextClause(),t.QueryParser.parseTerm;case t.QueryLexer.FIELD:return e.nextClause(),t.QueryParser.parseField;case t.QueryLexer.EDIT_DISTANCE:return t.QueryParser.parseEditDistance;case t.QueryLexer.BOOST:return t.QueryParser.parseBoost;case t.QueryLexer.PRESENCE:return e.nextClause(),t.QueryParser.parsePresence;default:var i="Unexpected lexeme type '"+s.type+"'";throw new t.QueryParseError(i,s.start,s.end)}}},function(e,r){typeof define=="function"&&define.amd?define(r):typeof se=="object"?oe.exports=r():e.lunr=r()}(this,function(){return t})})()});var ne=[];function G(t,e){ne.push({selector:e,constructor:t})}var U=class{constructor(){this.alwaysVisibleMember=null;this.createComponents(document.body),this.ensureActivePageVisible(),this.ensureFocusedElementVisible(),this.listenForCodeCopies(),window.addEventListener("hashchange",()=>this.ensureFocusedElementVisible())}createComponents(e){ne.forEach(r=>{e.querySelectorAll(r.selector).forEach(n=>{n.dataset.hasInstance||(new r.constructor({el:n,app:this}),n.dataset.hasInstance=String(!0))})})}filterChanged(){this.ensureFocusedElementVisible()}ensureActivePageVisible(){let e=document.querySelector(".tsd-navigation .current"),r=e?.parentElement;for(;r&&!r.classList.contains(".tsd-navigation");)r instanceof HTMLDetailsElement&&(r.open=!0),r=r.parentElement;if(e){let n=e.getBoundingClientRect().top-document.documentElement.clientHeight/4;document.querySelector(".site-menu").scrollTop=n}}ensureFocusedElementVisible(){if(this.alwaysVisibleMember&&(this.alwaysVisibleMember.classList.remove("always-visible"),this.alwaysVisibleMember.firstElementChild.remove(),this.alwaysVisibleMember=null),!location.hash)return;let e=document.getElementById(location.hash.substring(1));if(!e)return;let r=e.parentElement;for(;r&&r.tagName!=="SECTION";)r=r.parentElement;if(r&&r.offsetParent==null){this.alwaysVisibleMember=r,r.classList.add("always-visible");let n=document.createElement("p");n.classList.add("warning"),n.textContent="This member is normally hidden due to your filter settings.",r.prepend(n)}}listenForCodeCopies(){document.querySelectorAll("pre > button").forEach(e=>{let r;e.addEventListener("click",()=>{e.previousElementSibling instanceof HTMLElement&&navigator.clipboard.writeText(e.previousElementSibling.innerText.trim()),e.textContent="Copied!",e.classList.add("visible"),clearTimeout(r),r=setTimeout(()=>{e.classList.remove("visible"),r=setTimeout(()=>{e.textContent="Copy"},100)},1e3)})})}};var ie=(t,e=100)=>{let r;return()=>{clearTimeout(r),r=setTimeout(()=>t(),e)}};var ce=Ce(ae());function de(){let t=document.getElementById("tsd-search");if(!t)return;let e=document.getElementById("tsd-search-script");t.classList.add("loading"),e&&(e.addEventListener("error",()=>{t.classList.remove("loading"),t.classList.add("failure")}),e.addEventListener("load",()=>{t.classList.remove("loading"),t.classList.add("ready")}),window.searchData&&t.classList.remove("loading"));let r=document.querySelector("#tsd-search input"),n=document.querySelector("#tsd-search .results");if(!r||!n)throw new Error("The input field or the result list wrapper was not found");let i=!1;n.addEventListener("mousedown",()=>i=!0),n.addEventListener("mouseup",()=>{i=!1,t.classList.remove("has-focus")}),r.addEventListener("focus",()=>t.classList.add("has-focus")),r.addEventListener("blur",()=>{i||(i=!1,t.classList.remove("has-focus"))});let s={base:t.dataset.base+"/"};Oe(t,n,r,s)}function Oe(t,e,r,n){r.addEventListener("input",ie(()=>{Re(t,e,r,n)},200));let i=!1;r.addEventListener("keydown",s=>{i=!0,s.key=="Enter"?Fe(e,r):s.key=="Escape"?r.blur():s.key=="ArrowUp"?ue(e,-1):s.key==="ArrowDown"?ue(e,1):i=!1}),r.addEventListener("keypress",s=>{i&&s.preventDefault()}),document.body.addEventListener("keydown",s=>{s.altKey||s.ctrlKey||s.metaKey||!r.matches(":focus")&&s.key==="/"&&(r.focus(),s.preventDefault())})}function _e(t,e){t.index||window.searchData&&(e.classList.remove("loading"),e.classList.add("ready"),t.data=window.searchData,t.index=ce.Index.load(window.searchData.index))}function Re(t,e,r,n){if(_e(n,t),!n.index||!n.data)return;e.textContent="";let i=r.value.trim(),s=i?n.index.search(`*${i}*`):[];for(let o=0;oa.score-o.score);for(let o=0,a=Math.min(10,s.length);o${le(l.parent,i)}.${u}`);let d=document.createElement("li");d.classList.value=l.classes??"";let m=document.createElement("a");m.href=n.base+l.url,m.innerHTML=u,d.append(m),e.appendChild(d)}}function ue(t,e){let r=t.querySelector(".current");if(!r)r=t.querySelector(e==1?"li:first-child":"li:last-child"),r&&r.classList.add("current");else{let n=r;if(e===1)do n=n.nextElementSibling??void 0;while(n instanceof HTMLElement&&n.offsetParent==null);else do n=n.previousElementSibling??void 0;while(n instanceof HTMLElement&&n.offsetParent==null);n&&(r.classList.remove("current"),n.classList.add("current"))}}function Fe(t,e){let r=t.querySelector(".current");if(r||(r=t.querySelector("li:first-child")),r){let n=r.querySelector("a");n&&(window.location.href=n.href),e.blur()}}function le(t,e){if(e==="")return t;let r=t.toLocaleLowerCase(),n=e.toLocaleLowerCase(),i=[],s=0,o=r.indexOf(n);for(;o!=-1;)i.push(K(t.substring(s,o)),`${K(t.substring(o,o+n.length))}`),s=o+n.length,o=r.indexOf(n,s);return i.push(K(t.substring(s))),i.join("")}var Me={"&":"&","<":"<",">":">","'":"'",'"':"""};function K(t){return t.replace(/[&<>"'"]/g,e=>Me[e])}var P=class{constructor(e){this.el=e.el,this.app=e.app}};var M="mousedown",fe="mousemove",N="mouseup",J={x:0,y:0},he=!1,ee=!1,De=!1,D=!1,pe=/Android|webOS|iPhone|iPad|iPod|BlackBerry|IEMobile|Opera Mini/i.test(navigator.userAgent);document.documentElement.classList.add(pe?"is-mobile":"not-mobile");pe&&"ontouchstart"in document.documentElement&&(De=!0,M="touchstart",fe="touchmove",N="touchend");document.addEventListener(M,t=>{ee=!0,D=!1;let e=M=="touchstart"?t.targetTouches[0]:t;J.y=e.pageY||0,J.x=e.pageX||0});document.addEventListener(fe,t=>{if(ee&&!D){let e=M=="touchstart"?t.targetTouches[0]:t,r=J.x-(e.pageX||0),n=J.y-(e.pageY||0);D=Math.sqrt(r*r+n*n)>10}});document.addEventListener(N,()=>{ee=!1});document.addEventListener("click",t=>{he&&(t.preventDefault(),t.stopImmediatePropagation(),he=!1)});var X=class extends P{constructor(r){super(r);this.className=this.el.dataset.toggle||"",this.el.addEventListener(N,n=>this.onPointerUp(n)),this.el.addEventListener("click",n=>n.preventDefault()),document.addEventListener(M,n=>this.onDocumentPointerDown(n)),document.addEventListener(N,n=>this.onDocumentPointerUp(n))}setActive(r){if(this.active==r)return;this.active=r,document.documentElement.classList.toggle("has-"+this.className,r),this.el.classList.toggle("active",r);let n=(this.active?"to-has-":"from-has-")+this.className;document.documentElement.classList.add(n),setTimeout(()=>document.documentElement.classList.remove(n),500)}onPointerUp(r){D||(this.setActive(!0),r.preventDefault())}onDocumentPointerDown(r){if(this.active){if(r.target.closest(".col-sidebar, .tsd-filter-group"))return;this.setActive(!1)}}onDocumentPointerUp(r){if(!D&&this.active&&r.target.closest(".col-sidebar")){let n=r.target.closest("a");if(n){let i=window.location.href;i.indexOf("#")!=-1&&(i=i.substring(0,i.indexOf("#"))),n.href.substring(0,i.length)==i&&setTimeout(()=>this.setActive(!1),250)}}}};var te;try{te=localStorage}catch{te={getItem(){return null},setItem(){}}}var Q=te;var me=document.head.appendChild(document.createElement("style"));me.dataset.for="filters";var Y=class extends P{constructor(r){super(r);this.key=`filter-${this.el.name}`,this.value=this.el.checked,this.el.addEventListener("change",()=>{this.setLocalStorage(this.el.checked)}),this.setLocalStorage(this.fromLocalStorage()),me.innerHTML+=`html:not(.${this.key}) .tsd-is-${this.el.name} { display: none; } -`}fromLocalStorage(){let r=Q.getItem(this.key);return r?r==="true":this.el.checked}setLocalStorage(r){Q.setItem(this.key,r.toString()),this.value=r,this.handleValueChange()}handleValueChange(){this.el.checked=this.value,document.documentElement.classList.toggle(this.key,this.value),this.app.filterChanged(),document.querySelectorAll(".tsd-index-section").forEach(r=>{r.style.display="block";let n=Array.from(r.querySelectorAll(".tsd-index-link")).every(i=>i.offsetParent==null);r.style.display=n?"none":"block"})}};var Z=class extends P{constructor(r){super(r);this.summary=this.el.querySelector(".tsd-accordion-summary"),this.icon=this.summary.querySelector("svg"),this.key=`tsd-accordion-${this.summary.dataset.key??this.summary.textContent.trim().replace(/\s+/g,"-").toLowerCase()}`;let n=Q.getItem(this.key);this.el.open=n?n==="true":this.el.open,this.el.addEventListener("toggle",()=>this.update()),this.update()}update(){this.icon.style.transform=`rotate(${this.el.open?0:-90}deg)`,Q.setItem(this.key,this.el.open.toString())}};function ve(t){let e=Q.getItem("tsd-theme")||"os";t.value=e,ye(e),t.addEventListener("change",()=>{Q.setItem("tsd-theme",t.value),ye(t.value)})}function ye(t){document.documentElement.dataset.theme=t}de();G(X,"a[data-toggle]");G(Z,".tsd-index-accordion");G(Y,".tsd-filter-item input[type=checkbox]");var ge=document.getElementById("tsd-theme");ge&&ve(ge);var Ae=new U;Object.defineProperty(window,"app",{value:Ae});document.querySelectorAll("summary a").forEach(t=>{t.addEventListener("click",()=>{location.assign(t.href)})});})(); -/*! Bundled license information: - -lunr/lunr.js: - (** - * lunr - http://lunrjs.com - A bit like Solr, but much smaller and not as bright - 2.3.9 - * Copyright (C) 2020 Oliver Nightingale - * @license MIT - *) - (*! - * lunr.utils - * Copyright (C) 2020 Oliver Nightingale - *) - (*! - * lunr.Set - * Copyright (C) 2020 Oliver Nightingale - *) - (*! - * lunr.tokenizer - * Copyright (C) 2020 Oliver Nightingale - *) - (*! - * lunr.Pipeline - * Copyright (C) 2020 Oliver Nightingale - *) - (*! - * lunr.Vector - * Copyright (C) 2020 Oliver Nightingale - *) - (*! - * lunr.stemmer - * Copyright (C) 2020 Oliver Nightingale - * Includes code from - http://tartarus.org/~martin/PorterStemmer/js.txt - *) - (*! - * lunr.stopWordFilter - * Copyright (C) 2020 Oliver Nightingale - *) - (*! - * lunr.trimmer - * Copyright (C) 2020 Oliver Nightingale - *) - (*! - * lunr.TokenSet - * Copyright (C) 2020 Oliver Nightingale - *) - (*! - * lunr.Index - * Copyright (C) 2020 Oliver Nightingale - *) - (*! - * lunr.Builder - * Copyright (C) 2020 Oliver Nightingale - *) -*/ diff --git a/docs/assets/search.js b/docs/assets/search.js deleted file mode 100644 index fff0a9d..0000000 --- a/docs/assets/search.js +++ /dev/null @@ -1 +0,0 @@ -window.searchData = JSON.parse("{\"rows\":[{\"kind\":128,\"name\":\"HashTableNode\",\"url\":\"classes/HashTableNode.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/HashTableNode.html#constructor\",\"classes\":\"\",\"parent\":\"HashTableNode\"},{\"kind\":1024,\"name\":\"key\",\"url\":\"classes/HashTableNode.html#key\",\"classes\":\"\",\"parent\":\"HashTableNode\"},{\"kind\":1024,\"name\":\"val\",\"url\":\"classes/HashTableNode.html#val\",\"classes\":\"\",\"parent\":\"HashTableNode\"},{\"kind\":1024,\"name\":\"next\",\"url\":\"classes/HashTableNode.html#next\",\"classes\":\"\",\"parent\":\"HashTableNode\"},{\"kind\":128,\"name\":\"HashTable\",\"url\":\"classes/HashTable.html\",\"classes\":\"\"},{\"kind\":1024,\"name\":\"DEFAULT_CAPACITY\",\"url\":\"classes/HashTable.html#DEFAULT_CAPACITY\",\"classes\":\"tsd-is-private\",\"parent\":\"HashTable\"},{\"kind\":1024,\"name\":\"LOAD_FACTOR\",\"url\":\"classes/HashTable.html#LOAD_FACTOR\",\"classes\":\"tsd-is-private\",\"parent\":\"HashTable\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/HashTable.html#constructor\",\"classes\":\"\",\"parent\":\"HashTable\"},{\"kind\":262144,\"name\":\"hashFn\",\"url\":\"classes/HashTable.html#hashFn\",\"classes\":\"\",\"parent\":\"HashTable\"},{\"kind\":262144,\"name\":\"buckets\",\"url\":\"classes/HashTable.html#buckets\",\"classes\":\"\",\"parent\":\"HashTable\"},{\"kind\":262144,\"name\":\"capacity\",\"url\":\"classes/HashTable.html#capacity\",\"classes\":\"\",\"parent\":\"HashTable\"},{\"kind\":1024,\"name\":\"_capacity\",\"url\":\"classes/HashTable.html#_capacity\",\"classes\":\"tsd-is-private\",\"parent\":\"HashTable\"},{\"kind\":1024,\"name\":\"_size\",\"url\":\"classes/HashTable.html#_size\",\"classes\":\"tsd-is-private\",\"parent\":\"HashTable\"},{\"kind\":1024,\"name\":\"_buckets\",\"url\":\"classes/HashTable.html#_buckets\",\"classes\":\"tsd-is-private\",\"parent\":\"HashTable\"},{\"kind\":1024,\"name\":\"_hashFn\",\"url\":\"classes/HashTable.html#_hashFn\",\"classes\":\"tsd-is-private\",\"parent\":\"HashTable\"},{\"kind\":2048,\"name\":\"_defaultHashFn\",\"url\":\"classes/HashTable.html#_defaultHashFn\",\"classes\":\"tsd-is-protected\",\"parent\":\"HashTable\"},{\"kind\":2048,\"name\":\"_multiplicativeStringHashFn\",\"url\":\"classes/HashTable.html#_multiplicativeStringHashFn\",\"classes\":\"tsd-is-protected\",\"parent\":\"HashTable\"},{\"kind\":2048,\"name\":\"_murmurStringHashFn\",\"url\":\"classes/HashTable.html#_murmurStringHashFn\",\"classes\":\"tsd-is-protected\",\"parent\":\"HashTable\"},{\"kind\":2048,\"name\":\"_hash\",\"url\":\"classes/HashTable.html#_hash\",\"classes\":\"tsd-is-protected\",\"parent\":\"HashTable\"},{\"kind\":2048,\"name\":\"_stringHash\",\"url\":\"classes/HashTable.html#_stringHash\",\"classes\":\"tsd-is-protected\",\"parent\":\"HashTable\"},{\"kind\":2048,\"name\":\"_objectHash\",\"url\":\"classes/HashTable.html#_objectHash\",\"classes\":\"tsd-is-protected\",\"parent\":\"HashTable\"},{\"kind\":2048,\"name\":\"set\",\"url\":\"classes/HashTable.html#set\",\"classes\":\"\",\"parent\":\"HashTable\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"classes/HashTable.html#get\",\"classes\":\"\",\"parent\":\"HashTable\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"classes/HashTable.html#remove\",\"classes\":\"\",\"parent\":\"HashTable\"},{\"kind\":2048,\"name\":\"_expand\",\"url\":\"classes/HashTable.html#_expand\",\"classes\":\"tsd-is-protected\",\"parent\":\"HashTable\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/HashTable.html#size\",\"classes\":\"\",\"parent\":\"HashTable\"},{\"kind\":128,\"name\":\"CoordinateMap\",\"url\":\"classes/CoordinateMap.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/CoordinateMap.html#constructor\",\"classes\":\"\",\"parent\":\"CoordinateMap\"},{\"kind\":1024,\"name\":\"_joint\",\"url\":\"classes/CoordinateMap.html#_joint\",\"classes\":\"tsd-is-protected\",\"parent\":\"CoordinateMap\"},{\"kind\":262144,\"name\":\"joint\",\"url\":\"classes/CoordinateMap.html#joint\",\"classes\":\"\",\"parent\":\"CoordinateMap\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/CoordinateMap.html#has\",\"classes\":\"\",\"parent\":\"CoordinateMap\"},{\"kind\":2048,\"name\":\"set\",\"url\":\"classes/CoordinateMap.html#set\",\"classes\":\"\",\"parent\":\"CoordinateMap\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"classes/CoordinateMap.html#get\",\"classes\":\"\",\"parent\":\"CoordinateMap\"},{\"kind\":2048,\"name\":\"delete\",\"url\":\"classes/CoordinateMap.html#delete\",\"classes\":\"\",\"parent\":\"CoordinateMap\"},{\"kind\":2048,\"name\":\"_setJoint\",\"url\":\"classes/CoordinateMap.html#_setJoint\",\"classes\":\"tsd-is-protected\",\"parent\":\"CoordinateMap\"},{\"kind\":128,\"name\":\"CoordinateSet\",\"url\":\"classes/CoordinateSet.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/CoordinateSet.html#constructor\",\"classes\":\"\",\"parent\":\"CoordinateSet\"},{\"kind\":1024,\"name\":\"_joint\",\"url\":\"classes/CoordinateSet.html#_joint\",\"classes\":\"tsd-is-protected\",\"parent\":\"CoordinateSet\"},{\"kind\":262144,\"name\":\"joint\",\"url\":\"classes/CoordinateSet.html#joint\",\"classes\":\"\",\"parent\":\"CoordinateSet\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/CoordinateSet.html#has\",\"classes\":\"\",\"parent\":\"CoordinateSet\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/CoordinateSet.html#add\",\"classes\":\"\",\"parent\":\"CoordinateSet\"},{\"kind\":2048,\"name\":\"delete\",\"url\":\"classes/CoordinateSet.html#delete\",\"classes\":\"\",\"parent\":\"CoordinateSet\"},{\"kind\":2048,\"name\":\"_setJoint\",\"url\":\"classes/CoordinateSet.html#_setJoint\",\"classes\":\"tsd-is-protected\",\"parent\":\"CoordinateSet\"},{\"kind\":128,\"name\":\"Pair\",\"url\":\"classes/Pair.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/Pair.html#constructor\",\"classes\":\"\",\"parent\":\"Pair\"},{\"kind\":128,\"name\":\"TreeMap\",\"url\":\"classes/TreeMap.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/TreeMap.html#constructor\",\"classes\":\"\",\"parent\":\"TreeMap\"},{\"kind\":128,\"name\":\"TreeSet\",\"url\":\"classes/TreeSet.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/TreeSet.html#constructor\",\"classes\":\"\",\"parent\":\"TreeSet\"},{\"kind\":128,\"name\":\"HashMap\",\"url\":\"classes/HashMap.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/HashMap.html#constructor\",\"classes\":\"\",\"parent\":\"HashMap\"},{\"kind\":262144,\"name\":\"hashFn\",\"url\":\"classes/HashMap.html#hashFn\",\"classes\":\"\",\"parent\":\"HashMap\"},{\"kind\":262144,\"name\":\"table\",\"url\":\"classes/HashMap.html#table\",\"classes\":\"\",\"parent\":\"HashMap\"},{\"kind\":262144,\"name\":\"capacityMultiplier\",\"url\":\"classes/HashMap.html#capacityMultiplier\",\"classes\":\"\",\"parent\":\"HashMap\"},{\"kind\":262144,\"name\":\"loadFactor\",\"url\":\"classes/HashMap.html#loadFactor\",\"classes\":\"\",\"parent\":\"HashMap\"},{\"kind\":262144,\"name\":\"initialCapacity\",\"url\":\"classes/HashMap.html#initialCapacity\",\"classes\":\"\",\"parent\":\"HashMap\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/HashMap.html#size\",\"classes\":\"\",\"parent\":\"HashMap\"},{\"kind\":1024,\"name\":\"_initialCapacity\",\"url\":\"classes/HashMap.html#_initialCapacity\",\"classes\":\"tsd-is-private\",\"parent\":\"HashMap\"},{\"kind\":1024,\"name\":\"_loadFactor\",\"url\":\"classes/HashMap.html#_loadFactor\",\"classes\":\"tsd-is-private\",\"parent\":\"HashMap\"},{\"kind\":1024,\"name\":\"_capacityMultiplier\",\"url\":\"classes/HashMap.html#_capacityMultiplier\",\"classes\":\"tsd-is-private\",\"parent\":\"HashMap\"},{\"kind\":1024,\"name\":\"_size\",\"url\":\"classes/HashMap.html#_size\",\"classes\":\"tsd-is-private\",\"parent\":\"HashMap\"},{\"kind\":1024,\"name\":\"_table\",\"url\":\"classes/HashMap.html#_table\",\"classes\":\"tsd-is-private\",\"parent\":\"HashMap\"},{\"kind\":1024,\"name\":\"_hashFn\",\"url\":\"classes/HashMap.html#_hashFn\",\"classes\":\"tsd-is-private\",\"parent\":\"HashMap\"},{\"kind\":2048,\"name\":\"_hash\",\"url\":\"classes/HashMap.html#_hash\",\"classes\":\"tsd-is-private\",\"parent\":\"HashMap\"},{\"kind\":2048,\"name\":\"resizeTable\",\"url\":\"classes/HashMap.html#resizeTable\",\"classes\":\"tsd-is-private\",\"parent\":\"HashMap\"},{\"kind\":2048,\"name\":\"set\",\"url\":\"classes/HashMap.html#set\",\"classes\":\"\",\"parent\":\"HashMap\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"classes/HashMap.html#get\",\"classes\":\"\",\"parent\":\"HashMap\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"classes/HashMap.html#remove\",\"classes\":\"\",\"parent\":\"HashMap\"},{\"kind\":2048,\"name\":\"entries\",\"url\":\"classes/HashMap.html#entries\",\"classes\":\"\",\"parent\":\"HashMap\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/HashMap.html#clear\",\"classes\":\"\",\"parent\":\"HashMap\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/HashMap.html#isEmpty\",\"classes\":\"\",\"parent\":\"HashMap\"},{\"kind\":2048,\"name\":\"[iterator]\",\"url\":\"classes/HashMap.html#_iterator_\",\"classes\":\"\",\"parent\":\"HashMap\"},{\"kind\":128,\"name\":\"SinglyLinkedListNode\",\"url\":\"classes/SinglyLinkedListNode.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/SinglyLinkedListNode.html#constructor\",\"classes\":\"\",\"parent\":\"SinglyLinkedListNode\"},{\"kind\":1024,\"name\":\"_val\",\"url\":\"classes/SinglyLinkedListNode.html#_val\",\"classes\":\"tsd-is-private\",\"parent\":\"SinglyLinkedListNode\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/SinglyLinkedListNode.html#val\",\"classes\":\"\",\"parent\":\"SinglyLinkedListNode\"},{\"kind\":1024,\"name\":\"_next\",\"url\":\"classes/SinglyLinkedListNode.html#_next\",\"classes\":\"tsd-is-private\",\"parent\":\"SinglyLinkedListNode\"},{\"kind\":262144,\"name\":\"next\",\"url\":\"classes/SinglyLinkedListNode.html#next\",\"classes\":\"\",\"parent\":\"SinglyLinkedListNode\"},{\"kind\":128,\"name\":\"SinglyLinkedList\",\"url\":\"classes/SinglyLinkedList.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"fromArray\",\"url\":\"classes/SinglyLinkedList.html#fromArray\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/SinglyLinkedList.html#constructor\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":1024,\"name\":\"_head\",\"url\":\"classes/SinglyLinkedList.html#_head\",\"classes\":\"tsd-is-private\",\"parent\":\"SinglyLinkedList\"},{\"kind\":262144,\"name\":\"head\",\"url\":\"classes/SinglyLinkedList.html#head\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":1024,\"name\":\"_tail\",\"url\":\"classes/SinglyLinkedList.html#_tail\",\"classes\":\"tsd-is-private\",\"parent\":\"SinglyLinkedList\"},{\"kind\":262144,\"name\":\"tail\",\"url\":\"classes/SinglyLinkedList.html#tail\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":1024,\"name\":\"_length\",\"url\":\"classes/SinglyLinkedList.html#_length\",\"classes\":\"tsd-is-private\",\"parent\":\"SinglyLinkedList\"},{\"kind\":262144,\"name\":\"length\",\"url\":\"classes/SinglyLinkedList.html#length\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"getLength\",\"url\":\"classes/SinglyLinkedList.html#getLength\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"push\",\"url\":\"classes/SinglyLinkedList.html#push\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"pop\",\"url\":\"classes/SinglyLinkedList.html#pop\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"shift\",\"url\":\"classes/SinglyLinkedList.html#shift\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"unshift\",\"url\":\"classes/SinglyLinkedList.html#unshift\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"getAt\",\"url\":\"classes/SinglyLinkedList.html#getAt\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"getNodeAt\",\"url\":\"classes/SinglyLinkedList.html#getNodeAt\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"deleteAt\",\"url\":\"classes/SinglyLinkedList.html#deleteAt\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"delete\",\"url\":\"classes/SinglyLinkedList.html#delete\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"insertAt\",\"url\":\"classes/SinglyLinkedList.html#insertAt\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/SinglyLinkedList.html#isEmpty\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/SinglyLinkedList.html#clear\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"toArray\",\"url\":\"classes/SinglyLinkedList.html#toArray\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"reverse\",\"url\":\"classes/SinglyLinkedList.html#reverse\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"find\",\"url\":\"classes/SinglyLinkedList.html#find\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"indexOf\",\"url\":\"classes/SinglyLinkedList.html#indexOf\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"findNode\",\"url\":\"classes/SinglyLinkedList.html#findNode\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"insertBefore\",\"url\":\"classes/SinglyLinkedList.html#insertBefore\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"insertAfter\",\"url\":\"classes/SinglyLinkedList.html#insertAfter\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"countOccurrences\",\"url\":\"classes/SinglyLinkedList.html#countOccurrences\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":2048,\"name\":\"[iterator]\",\"url\":\"classes/SinglyLinkedList.html#_iterator_\",\"classes\":\"\",\"parent\":\"SinglyLinkedList\"},{\"kind\":128,\"name\":\"DoublyLinkedListNode\",\"url\":\"classes/DoublyLinkedListNode.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/DoublyLinkedListNode.html#constructor\",\"classes\":\"\",\"parent\":\"DoublyLinkedListNode\"},{\"kind\":1024,\"name\":\"_val\",\"url\":\"classes/DoublyLinkedListNode.html#_val\",\"classes\":\"tsd-is-private\",\"parent\":\"DoublyLinkedListNode\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/DoublyLinkedListNode.html#val\",\"classes\":\"\",\"parent\":\"DoublyLinkedListNode\"},{\"kind\":1024,\"name\":\"_next\",\"url\":\"classes/DoublyLinkedListNode.html#_next\",\"classes\":\"tsd-is-private\",\"parent\":\"DoublyLinkedListNode\"},{\"kind\":262144,\"name\":\"next\",\"url\":\"classes/DoublyLinkedListNode.html#next\",\"classes\":\"\",\"parent\":\"DoublyLinkedListNode\"},{\"kind\":1024,\"name\":\"_prev\",\"url\":\"classes/DoublyLinkedListNode.html#_prev\",\"classes\":\"tsd-is-private\",\"parent\":\"DoublyLinkedListNode\"},{\"kind\":262144,\"name\":\"prev\",\"url\":\"classes/DoublyLinkedListNode.html#prev\",\"classes\":\"\",\"parent\":\"DoublyLinkedListNode\"},{\"kind\":128,\"name\":\"DoublyLinkedList\",\"url\":\"classes/DoublyLinkedList.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"fromArray\",\"url\":\"classes/DoublyLinkedList.html#fromArray\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/DoublyLinkedList.html#constructor\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":1024,\"name\":\"_head\",\"url\":\"classes/DoublyLinkedList.html#_head\",\"classes\":\"tsd-is-private\",\"parent\":\"DoublyLinkedList\"},{\"kind\":262144,\"name\":\"head\",\"url\":\"classes/DoublyLinkedList.html#head\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":1024,\"name\":\"_tail\",\"url\":\"classes/DoublyLinkedList.html#_tail\",\"classes\":\"tsd-is-private\",\"parent\":\"DoublyLinkedList\"},{\"kind\":262144,\"name\":\"tail\",\"url\":\"classes/DoublyLinkedList.html#tail\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":1024,\"name\":\"_length\",\"url\":\"classes/DoublyLinkedList.html#_length\",\"classes\":\"tsd-is-private\",\"parent\":\"DoublyLinkedList\"},{\"kind\":262144,\"name\":\"length\",\"url\":\"classes/DoublyLinkedList.html#length\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"push\",\"url\":\"classes/DoublyLinkedList.html#push\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"addLast\",\"url\":\"classes/DoublyLinkedList.html#addLast\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"pop\",\"url\":\"classes/DoublyLinkedList.html#pop\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"pollLast\",\"url\":\"classes/DoublyLinkedList.html#pollLast\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"shift\",\"url\":\"classes/DoublyLinkedList.html#shift\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"pollFirst\",\"url\":\"classes/DoublyLinkedList.html#pollFirst\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"unshift\",\"url\":\"classes/DoublyLinkedList.html#unshift\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"addFirst\",\"url\":\"classes/DoublyLinkedList.html#addFirst\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"peekFirst\",\"url\":\"classes/DoublyLinkedList.html#peekFirst\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"peekLast\",\"url\":\"classes/DoublyLinkedList.html#peekLast\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/DoublyLinkedList.html#size\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"getAt\",\"url\":\"classes/DoublyLinkedList.html#getAt\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"getNodeAt\",\"url\":\"classes/DoublyLinkedList.html#getNodeAt\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"findNode\",\"url\":\"classes/DoublyLinkedList.html#findNode\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"insertAt\",\"url\":\"classes/DoublyLinkedList.html#insertAt\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"deleteAt\",\"url\":\"classes/DoublyLinkedList.html#deleteAt\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"delete\",\"url\":\"classes/DoublyLinkedList.html#delete\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"toArray\",\"url\":\"classes/DoublyLinkedList.html#toArray\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/DoublyLinkedList.html#isEmpty\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/DoublyLinkedList.html#clear\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"find\",\"url\":\"classes/DoublyLinkedList.html#find\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"indexOf\",\"url\":\"classes/DoublyLinkedList.html#indexOf\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"findLast\",\"url\":\"classes/DoublyLinkedList.html#findLast\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"toArrayReverse\",\"url\":\"classes/DoublyLinkedList.html#toArrayReverse\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"reverse\",\"url\":\"classes/DoublyLinkedList.html#reverse\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"forEach\",\"url\":\"classes/DoublyLinkedList.html#forEach\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"map\",\"url\":\"classes/DoublyLinkedList.html#map\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"filter\",\"url\":\"classes/DoublyLinkedList.html#filter\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"reduce\",\"url\":\"classes/DoublyLinkedList.html#reduce\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"insertAfter\",\"url\":\"classes/DoublyLinkedList.html#insertAfter\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":2048,\"name\":\"insertBefore\",\"url\":\"classes/DoublyLinkedList.html#insertBefore\",\"classes\":\"\",\"parent\":\"DoublyLinkedList\"},{\"kind\":128,\"name\":\"SkipListNode\",\"url\":\"classes/SkipListNode.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/SkipListNode.html#constructor\",\"classes\":\"\",\"parent\":\"SkipListNode\"},{\"kind\":1024,\"name\":\"key\",\"url\":\"classes/SkipListNode.html#key\",\"classes\":\"\",\"parent\":\"SkipListNode\"},{\"kind\":1024,\"name\":\"value\",\"url\":\"classes/SkipListNode.html#value\",\"classes\":\"\",\"parent\":\"SkipListNode\"},{\"kind\":1024,\"name\":\"forward\",\"url\":\"classes/SkipListNode.html#forward\",\"classes\":\"\",\"parent\":\"SkipListNode\"},{\"kind\":128,\"name\":\"SkipList\",\"url\":\"classes/SkipList.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/SkipList.html#constructor\",\"classes\":\"\",\"parent\":\"SkipList\"},{\"kind\":262144,\"name\":\"probability\",\"url\":\"classes/SkipList.html#probability\",\"classes\":\"\",\"parent\":\"SkipList\"},{\"kind\":262144,\"name\":\"maxLevel\",\"url\":\"classes/SkipList.html#maxLevel\",\"classes\":\"\",\"parent\":\"SkipList\"},{\"kind\":262144,\"name\":\"level\",\"url\":\"classes/SkipList.html#level\",\"classes\":\"\",\"parent\":\"SkipList\"},{\"kind\":262144,\"name\":\"head\",\"url\":\"classes/SkipList.html#head\",\"classes\":\"\",\"parent\":\"SkipList\"},{\"kind\":1024,\"name\":\"_head\",\"url\":\"classes/SkipList.html#_head\",\"classes\":\"tsd-is-private\",\"parent\":\"SkipList\"},{\"kind\":1024,\"name\":\"_level\",\"url\":\"classes/SkipList.html#_level\",\"classes\":\"tsd-is-private\",\"parent\":\"SkipList\"},{\"kind\":1024,\"name\":\"_maxLevel\",\"url\":\"classes/SkipList.html#_maxLevel\",\"classes\":\"tsd-is-private\",\"parent\":\"SkipList\"},{\"kind\":1024,\"name\":\"_probability\",\"url\":\"classes/SkipList.html#_probability\",\"classes\":\"tsd-is-private\",\"parent\":\"SkipList\"},{\"kind\":2048,\"name\":\"randomLevel\",\"url\":\"classes/SkipList.html#randomLevel\",\"classes\":\"tsd-is-private\",\"parent\":\"SkipList\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/SkipList.html#add\",\"classes\":\"\",\"parent\":\"SkipList\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"classes/SkipList.html#get\",\"classes\":\"\",\"parent\":\"SkipList\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"classes/SkipList.html#remove\",\"classes\":\"\",\"parent\":\"SkipList\"},{\"kind\":128,\"name\":\"Stack\",\"url\":\"classes/Stack.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"fromArray\",\"url\":\"classes/Stack.html#fromArray\",\"classes\":\"\",\"parent\":\"Stack\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/Stack.html#constructor\",\"classes\":\"\",\"parent\":\"Stack\"},{\"kind\":1024,\"name\":\"_elements\",\"url\":\"classes/Stack.html#_elements\",\"classes\":\"tsd-is-protected\",\"parent\":\"Stack\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/Stack.html#isEmpty\",\"classes\":\"\",\"parent\":\"Stack\"},{\"kind\":2048,\"name\":\"size\",\"url\":\"classes/Stack.html#size\",\"classes\":\"\",\"parent\":\"Stack\"},{\"kind\":2048,\"name\":\"peek\",\"url\":\"classes/Stack.html#peek\",\"classes\":\"\",\"parent\":\"Stack\"},{\"kind\":2048,\"name\":\"push\",\"url\":\"classes/Stack.html#push\",\"classes\":\"\",\"parent\":\"Stack\"},{\"kind\":2048,\"name\":\"pop\",\"url\":\"classes/Stack.html#pop\",\"classes\":\"\",\"parent\":\"Stack\"},{\"kind\":2048,\"name\":\"toArray\",\"url\":\"classes/Stack.html#toArray\",\"classes\":\"\",\"parent\":\"Stack\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/Stack.html#clear\",\"classes\":\"\",\"parent\":\"Stack\"},{\"kind\":2048,\"name\":\"clone\",\"url\":\"classes/Stack.html#clone\",\"classes\":\"\",\"parent\":\"Stack\"},{\"kind\":128,\"name\":\"LinkedListQueue\",\"url\":\"classes/LinkedListQueue.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"fromArray\",\"url\":\"classes/LinkedListQueue.html#fromArray\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/LinkedListQueue.html#constructor\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"enqueue\",\"url\":\"classes/LinkedListQueue.html#enqueue\",\"classes\":\"\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"dequeue\",\"url\":\"classes/LinkedListQueue.html#dequeue\",\"classes\":\"\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"peek\",\"url\":\"classes/LinkedListQueue.html#peek\",\"classes\":\"\",\"parent\":\"LinkedListQueue\"},{\"kind\":262144,\"name\":\"head\",\"url\":\"classes/LinkedListQueue.html#head\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":262144,\"name\":\"tail\",\"url\":\"classes/LinkedListQueue.html#tail\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":262144,\"name\":\"length\",\"url\":\"classes/LinkedListQueue.html#length\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"getLength\",\"url\":\"classes/LinkedListQueue.html#getLength\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"push\",\"url\":\"classes/LinkedListQueue.html#push\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"pop\",\"url\":\"classes/LinkedListQueue.html#pop\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"shift\",\"url\":\"classes/LinkedListQueue.html#shift\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"unshift\",\"url\":\"classes/LinkedListQueue.html#unshift\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"getAt\",\"url\":\"classes/LinkedListQueue.html#getAt\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"getNodeAt\",\"url\":\"classes/LinkedListQueue.html#getNodeAt\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"deleteAt\",\"url\":\"classes/LinkedListQueue.html#deleteAt\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"delete\",\"url\":\"classes/LinkedListQueue.html#delete\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"insertAt\",\"url\":\"classes/LinkedListQueue.html#insertAt\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/LinkedListQueue.html#isEmpty\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/LinkedListQueue.html#clear\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"toArray\",\"url\":\"classes/LinkedListQueue.html#toArray\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"reverse\",\"url\":\"classes/LinkedListQueue.html#reverse\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"find\",\"url\":\"classes/LinkedListQueue.html#find\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"indexOf\",\"url\":\"classes/LinkedListQueue.html#indexOf\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"findNode\",\"url\":\"classes/LinkedListQueue.html#findNode\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"insertBefore\",\"url\":\"classes/LinkedListQueue.html#insertBefore\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"insertAfter\",\"url\":\"classes/LinkedListQueue.html#insertAfter\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"countOccurrences\",\"url\":\"classes/LinkedListQueue.html#countOccurrences\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":2048,\"name\":\"[iterator]\",\"url\":\"classes/LinkedListQueue.html#_iterator_\",\"classes\":\"tsd-is-inherited\",\"parent\":\"LinkedListQueue\"},{\"kind\":128,\"name\":\"Queue\",\"url\":\"classes/Queue.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"fromArray\",\"url\":\"classes/Queue.html#fromArray\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/Queue.html#constructor\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":1024,\"name\":\"_nodes\",\"url\":\"classes/Queue.html#_nodes\",\"classes\":\"tsd-is-private\",\"parent\":\"Queue\"},{\"kind\":262144,\"name\":\"nodes\",\"url\":\"classes/Queue.html#nodes\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":1024,\"name\":\"_offset\",\"url\":\"classes/Queue.html#_offset\",\"classes\":\"tsd-is-private\",\"parent\":\"Queue\"},{\"kind\":262144,\"name\":\"offset\",\"url\":\"classes/Queue.html#offset\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/Queue.html#size\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":2048,\"name\":\"push\",\"url\":\"classes/Queue.html#push\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":2048,\"name\":\"shift\",\"url\":\"classes/Queue.html#shift\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":2048,\"name\":\"peek\",\"url\":\"classes/Queue.html#peek\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":2048,\"name\":\"peekLast\",\"url\":\"classes/Queue.html#peekLast\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":2048,\"name\":\"enqueue\",\"url\":\"classes/Queue.html#enqueue\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":2048,\"name\":\"dequeue\",\"url\":\"classes/Queue.html#dequeue\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":2048,\"name\":\"getAt\",\"url\":\"classes/Queue.html#getAt\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/Queue.html#isEmpty\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":2048,\"name\":\"toArray\",\"url\":\"classes/Queue.html#toArray\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/Queue.html#clear\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":2048,\"name\":\"clone\",\"url\":\"classes/Queue.html#clone\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":2048,\"name\":\"[iterator]\",\"url\":\"classes/Queue.html#_iterator_\",\"classes\":\"\",\"parent\":\"Queue\"},{\"kind\":128,\"name\":\"Deque\",\"url\":\"classes/Deque.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"fromArray\",\"url\":\"classes/Deque.html#fromArray\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/Deque.html#constructor\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":262144,\"name\":\"head\",\"url\":\"classes/Deque.html#head\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":262144,\"name\":\"tail\",\"url\":\"classes/Deque.html#tail\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":262144,\"name\":\"length\",\"url\":\"classes/Deque.html#length\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"push\",\"url\":\"classes/Deque.html#push\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"addLast\",\"url\":\"classes/Deque.html#addLast\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"pop\",\"url\":\"classes/Deque.html#pop\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"pollLast\",\"url\":\"classes/Deque.html#pollLast\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"shift\",\"url\":\"classes/Deque.html#shift\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"pollFirst\",\"url\":\"classes/Deque.html#pollFirst\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"unshift\",\"url\":\"classes/Deque.html#unshift\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"addFirst\",\"url\":\"classes/Deque.html#addFirst\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"peekFirst\",\"url\":\"classes/Deque.html#peekFirst\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"peekLast\",\"url\":\"classes/Deque.html#peekLast\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/Deque.html#size\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"getAt\",\"url\":\"classes/Deque.html#getAt\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"getNodeAt\",\"url\":\"classes/Deque.html#getNodeAt\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"findNode\",\"url\":\"classes/Deque.html#findNode\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"insertAt\",\"url\":\"classes/Deque.html#insertAt\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"deleteAt\",\"url\":\"classes/Deque.html#deleteAt\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"delete\",\"url\":\"classes/Deque.html#delete\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"toArray\",\"url\":\"classes/Deque.html#toArray\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/Deque.html#isEmpty\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/Deque.html#clear\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"find\",\"url\":\"classes/Deque.html#find\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"indexOf\",\"url\":\"classes/Deque.html#indexOf\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"findLast\",\"url\":\"classes/Deque.html#findLast\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"toArrayReverse\",\"url\":\"classes/Deque.html#toArrayReverse\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"reverse\",\"url\":\"classes/Deque.html#reverse\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"forEach\",\"url\":\"classes/Deque.html#forEach\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"map\",\"url\":\"classes/Deque.html#map\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"filter\",\"url\":\"classes/Deque.html#filter\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"reduce\",\"url\":\"classes/Deque.html#reduce\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"insertAfter\",\"url\":\"classes/Deque.html#insertAfter\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":2048,\"name\":\"insertBefore\",\"url\":\"classes/Deque.html#insertBefore\",\"classes\":\"tsd-is-inherited\",\"parent\":\"Deque\"},{\"kind\":128,\"name\":\"ObjectDeque\",\"url\":\"classes/ObjectDeque.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/ObjectDeque.html#constructor\",\"classes\":\"\",\"parent\":\"ObjectDeque\"},{\"kind\":1024,\"name\":\"_nodes\",\"url\":\"classes/ObjectDeque.html#_nodes\",\"classes\":\"tsd-is-private\",\"parent\":\"ObjectDeque\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/ObjectDeque.html#_nodes.__type\",\"classes\":\"\",\"parent\":\"ObjectDeque._nodes\"},{\"kind\":262144,\"name\":\"nodes\",\"url\":\"classes/ObjectDeque.html#nodes\",\"classes\":\"\",\"parent\":\"ObjectDeque\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/ObjectDeque.html#nodes.nodes-1.__type-1\",\"classes\":\"\",\"parent\":\"ObjectDeque.nodes.nodes\"},{\"kind\":1024,\"name\":\"_capacity\",\"url\":\"classes/ObjectDeque.html#_capacity\",\"classes\":\"tsd-is-private\",\"parent\":\"ObjectDeque\"},{\"kind\":262144,\"name\":\"capacity\",\"url\":\"classes/ObjectDeque.html#capacity\",\"classes\":\"\",\"parent\":\"ObjectDeque\"},{\"kind\":1024,\"name\":\"_first\",\"url\":\"classes/ObjectDeque.html#_first\",\"classes\":\"tsd-is-private\",\"parent\":\"ObjectDeque\"},{\"kind\":262144,\"name\":\"first\",\"url\":\"classes/ObjectDeque.html#first\",\"classes\":\"\",\"parent\":\"ObjectDeque\"},{\"kind\":1024,\"name\":\"_last\",\"url\":\"classes/ObjectDeque.html#_last\",\"classes\":\"tsd-is-private\",\"parent\":\"ObjectDeque\"},{\"kind\":262144,\"name\":\"last\",\"url\":\"classes/ObjectDeque.html#last\",\"classes\":\"\",\"parent\":\"ObjectDeque\"},{\"kind\":1024,\"name\":\"_size\",\"url\":\"classes/ObjectDeque.html#_size\",\"classes\":\"tsd-is-private\",\"parent\":\"ObjectDeque\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/ObjectDeque.html#size\",\"classes\":\"\",\"parent\":\"ObjectDeque\"},{\"kind\":2048,\"name\":\"addFirst\",\"url\":\"classes/ObjectDeque.html#addFirst\",\"classes\":\"\",\"parent\":\"ObjectDeque\"},{\"kind\":2048,\"name\":\"addLast\",\"url\":\"classes/ObjectDeque.html#addLast\",\"classes\":\"\",\"parent\":\"ObjectDeque\"},{\"kind\":2048,\"name\":\"pollFirst\",\"url\":\"classes/ObjectDeque.html#pollFirst\",\"classes\":\"\",\"parent\":\"ObjectDeque\"},{\"kind\":2048,\"name\":\"peekFirst\",\"url\":\"classes/ObjectDeque.html#peekFirst\",\"classes\":\"\",\"parent\":\"ObjectDeque\"},{\"kind\":2048,\"name\":\"pollLast\",\"url\":\"classes/ObjectDeque.html#pollLast\",\"classes\":\"\",\"parent\":\"ObjectDeque\"},{\"kind\":2048,\"name\":\"peekLast\",\"url\":\"classes/ObjectDeque.html#peekLast\",\"classes\":\"\",\"parent\":\"ObjectDeque\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"classes/ObjectDeque.html#get\",\"classes\":\"\",\"parent\":\"ObjectDeque\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/ObjectDeque.html#isEmpty\",\"classes\":\"\",\"parent\":\"ObjectDeque\"},{\"kind\":2048,\"name\":\"_seNodes\",\"url\":\"classes/ObjectDeque.html#_seNodes\",\"classes\":\"tsd-is-protected\",\"parent\":\"ObjectDeque\"},{\"kind\":2048,\"name\":\"_setSize\",\"url\":\"classes/ObjectDeque.html#_setSize\",\"classes\":\"tsd-is-protected\",\"parent\":\"ObjectDeque\"},{\"kind\":128,\"name\":\"ArrayDeque\",\"url\":\"classes/ArrayDeque.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/ArrayDeque.html#constructor\",\"classes\":\"\",\"parent\":\"ArrayDeque\"},{\"kind\":1024,\"name\":\"_nodes\",\"url\":\"classes/ArrayDeque.html#_nodes\",\"classes\":\"tsd-is-protected\",\"parent\":\"ArrayDeque\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/ArrayDeque.html#size\",\"classes\":\"\",\"parent\":\"ArrayDeque\"},{\"kind\":2048,\"name\":\"addLast\",\"url\":\"classes/ArrayDeque.html#addLast\",\"classes\":\"\",\"parent\":\"ArrayDeque\"},{\"kind\":2048,\"name\":\"pollLast\",\"url\":\"classes/ArrayDeque.html#pollLast\",\"classes\":\"\",\"parent\":\"ArrayDeque\"},{\"kind\":2048,\"name\":\"pollFirst\",\"url\":\"classes/ArrayDeque.html#pollFirst\",\"classes\":\"\",\"parent\":\"ArrayDeque\"},{\"kind\":2048,\"name\":\"addFirst\",\"url\":\"classes/ArrayDeque.html#addFirst\",\"classes\":\"\",\"parent\":\"ArrayDeque\"},{\"kind\":2048,\"name\":\"peekFirst\",\"url\":\"classes/ArrayDeque.html#peekFirst\",\"classes\":\"\",\"parent\":\"ArrayDeque\"},{\"kind\":2048,\"name\":\"peekLast\",\"url\":\"classes/ArrayDeque.html#peekLast\",\"classes\":\"\",\"parent\":\"ArrayDeque\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"classes/ArrayDeque.html#get\",\"classes\":\"\",\"parent\":\"ArrayDeque\"},{\"kind\":2048,\"name\":\"set\",\"url\":\"classes/ArrayDeque.html#set\",\"classes\":\"\",\"parent\":\"ArrayDeque\"},{\"kind\":2048,\"name\":\"insert\",\"url\":\"classes/ArrayDeque.html#insert\",\"classes\":\"\",\"parent\":\"ArrayDeque\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"classes/ArrayDeque.html#remove\",\"classes\":\"\",\"parent\":\"ArrayDeque\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/ArrayDeque.html#isEmpty\",\"classes\":\"\",\"parent\":\"ArrayDeque\"},{\"kind\":128,\"name\":\"AbstractVertex\",\"url\":\"classes/AbstractVertex.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/AbstractVertex.html#constructor\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractVertex\"},{\"kind\":1024,\"name\":\"_id\",\"url\":\"classes/AbstractVertex.html#_id\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractVertex\"},{\"kind\":262144,\"name\":\"id\",\"url\":\"classes/AbstractVertex.html#id\",\"classes\":\"\",\"parent\":\"AbstractVertex\"},{\"kind\":1024,\"name\":\"_val\",\"url\":\"classes/AbstractVertex.html#_val\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractVertex\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/AbstractVertex.html#val\",\"classes\":\"\",\"parent\":\"AbstractVertex\"},{\"kind\":128,\"name\":\"AbstractEdge\",\"url\":\"classes/AbstractEdge.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/AbstractEdge.html#constructor\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractEdge\"},{\"kind\":1024,\"name\":\"_val\",\"url\":\"classes/AbstractEdge.html#_val\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractEdge\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/AbstractEdge.html#val\",\"classes\":\"\",\"parent\":\"AbstractEdge\"},{\"kind\":1024,\"name\":\"_weight\",\"url\":\"classes/AbstractEdge.html#_weight\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractEdge\"},{\"kind\":262144,\"name\":\"weight\",\"url\":\"classes/AbstractEdge.html#weight\",\"classes\":\"\",\"parent\":\"AbstractEdge\"},{\"kind\":1024,\"name\":\"_hashCode\",\"url\":\"classes/AbstractEdge.html#_hashCode\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractEdge\"},{\"kind\":262144,\"name\":\"hashCode\",\"url\":\"classes/AbstractEdge.html#hashCode\",\"classes\":\"\",\"parent\":\"AbstractEdge\"},{\"kind\":2048,\"name\":\"_setHashCode\",\"url\":\"classes/AbstractEdge.html#_setHashCode\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractEdge\"},{\"kind\":128,\"name\":\"AbstractGraph\",\"url\":\"classes/AbstractGraph.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/AbstractGraph.html#constructor\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":1024,\"name\":\"_vertices\",\"url\":\"classes/AbstractGraph.html#_vertices\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractGraph\"},{\"kind\":262144,\"name\":\"vertices\",\"url\":\"classes/AbstractGraph.html#vertices\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"createVertex\",\"url\":\"classes/AbstractGraph.html#createVertex\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"createEdge\",\"url\":\"classes/AbstractGraph.html#createEdge\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"removeEdge\",\"url\":\"classes/AbstractGraph.html#removeEdge\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"getEdge\",\"url\":\"classes/AbstractGraph.html#getEdge\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"degreeOf\",\"url\":\"classes/AbstractGraph.html#degreeOf\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"edgeSet\",\"url\":\"classes/AbstractGraph.html#edgeSet\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"edgesOf\",\"url\":\"classes/AbstractGraph.html#edgesOf\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"getNeighbors\",\"url\":\"classes/AbstractGraph.html#getNeighbors\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"getEndsOfEdge\",\"url\":\"classes/AbstractGraph.html#getEndsOfEdge\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"getVertex\",\"url\":\"classes/AbstractGraph.html#getVertex\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"hasVertex\",\"url\":\"classes/AbstractGraph.html#hasVertex\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"addVertex\",\"url\":\"classes/AbstractGraph.html#addVertex\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"removeVertex\",\"url\":\"classes/AbstractGraph.html#removeVertex\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"removeAllVertices\",\"url\":\"classes/AbstractGraph.html#removeAllVertices\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"hasEdge\",\"url\":\"classes/AbstractGraph.html#hasEdge\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"addEdge\",\"url\":\"classes/AbstractGraph.html#addEdge\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"setEdgeWeight\",\"url\":\"classes/AbstractGraph.html#setEdgeWeight\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"getAllPathsBetween\",\"url\":\"classes/AbstractGraph.html#getAllPathsBetween\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"getPathSumWeight\",\"url\":\"classes/AbstractGraph.html#getPathSumWeight\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"getMinCostBetween\",\"url\":\"classes/AbstractGraph.html#getMinCostBetween\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"getMinPathBetween\",\"url\":\"classes/AbstractGraph.html#getMinPathBetween\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"dijkstraWithoutHeap\",\"url\":\"classes/AbstractGraph.html#dijkstraWithoutHeap\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"dijkstra\",\"url\":\"classes/AbstractGraph.html#dijkstra\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"bellmanFord\",\"url\":\"classes/AbstractGraph.html#bellmanFord\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/AbstractGraph.html#bellmanFord.bellmanFord-1.__type\",\"classes\":\"\",\"parent\":\"AbstractGraph.bellmanFord.bellmanFord\"},{\"kind\":1024,\"name\":\"hasNegativeCycle\",\"url\":\"classes/AbstractGraph.html#bellmanFord.bellmanFord-1.__type.hasNegativeCycle\",\"classes\":\"\",\"parent\":\"AbstractGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"distMap\",\"url\":\"classes/AbstractGraph.html#bellmanFord.bellmanFord-1.__type.distMap\",\"classes\":\"\",\"parent\":\"AbstractGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"preMap\",\"url\":\"classes/AbstractGraph.html#bellmanFord.bellmanFord-1.__type.preMap\",\"classes\":\"\",\"parent\":\"AbstractGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"paths\",\"url\":\"classes/AbstractGraph.html#bellmanFord.bellmanFord-1.__type.paths\",\"classes\":\"\",\"parent\":\"AbstractGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"min\",\"url\":\"classes/AbstractGraph.html#bellmanFord.bellmanFord-1.__type.min\",\"classes\":\"\",\"parent\":\"AbstractGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"minPath\",\"url\":\"classes/AbstractGraph.html#bellmanFord.bellmanFord-1.__type.minPath\",\"classes\":\"\",\"parent\":\"AbstractGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":2048,\"name\":\"floyd\",\"url\":\"classes/AbstractGraph.html#floyd\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/AbstractGraph.html#floyd.floyd-1.__type-1\",\"classes\":\"\",\"parent\":\"AbstractGraph.floyd.floyd\"},{\"kind\":1024,\"name\":\"costs\",\"url\":\"classes/AbstractGraph.html#floyd.floyd-1.__type-1.costs\",\"classes\":\"\",\"parent\":\"AbstractGraph.floyd.floyd.__type\"},{\"kind\":1024,\"name\":\"predecessor\",\"url\":\"classes/AbstractGraph.html#floyd.floyd-1.__type-1.predecessor\",\"classes\":\"\",\"parent\":\"AbstractGraph.floyd.floyd.__type\"},{\"kind\":2048,\"name\":\"tarjan\",\"url\":\"classes/AbstractGraph.html#tarjan\",\"classes\":\"\",\"parent\":\"AbstractGraph\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/AbstractGraph.html#tarjan.tarjan-1.__type-2\",\"classes\":\"\",\"parent\":\"AbstractGraph.tarjan.tarjan\"},{\"kind\":1024,\"name\":\"dfnMap\",\"url\":\"classes/AbstractGraph.html#tarjan.tarjan-1.__type-2.dfnMap\",\"classes\":\"\",\"parent\":\"AbstractGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"lowMap\",\"url\":\"classes/AbstractGraph.html#tarjan.tarjan-1.__type-2.lowMap\",\"classes\":\"\",\"parent\":\"AbstractGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"bridges\",\"url\":\"classes/AbstractGraph.html#tarjan.tarjan-1.__type-2.bridges\",\"classes\":\"\",\"parent\":\"AbstractGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"articulationPoints\",\"url\":\"classes/AbstractGraph.html#tarjan.tarjan-1.__type-2.articulationPoints\",\"classes\":\"\",\"parent\":\"AbstractGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"SCCs\",\"url\":\"classes/AbstractGraph.html#tarjan.tarjan-1.__type-2.SCCs\",\"classes\":\"\",\"parent\":\"AbstractGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"cycles\",\"url\":\"classes/AbstractGraph.html#tarjan.tarjan-1.__type-2.cycles\",\"classes\":\"\",\"parent\":\"AbstractGraph.tarjan.tarjan.__type\"},{\"kind\":2048,\"name\":\"_addEdgeOnly\",\"url\":\"classes/AbstractGraph.html#_addEdgeOnly\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"_addVertexOnly\",\"url\":\"classes/AbstractGraph.html#_addVertexOnly\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"_getVertex\",\"url\":\"classes/AbstractGraph.html#_getVertex\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"_getVertexId\",\"url\":\"classes/AbstractGraph.html#_getVertexId\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractGraph\"},{\"kind\":2048,\"name\":\"_setVertices\",\"url\":\"classes/AbstractGraph.html#_setVertices\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractGraph\"},{\"kind\":128,\"name\":\"DirectedVertex\",\"url\":\"classes/DirectedVertex.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/DirectedVertex.html#constructor\",\"classes\":\"\",\"parent\":\"DirectedVertex\"},{\"kind\":262144,\"name\":\"id\",\"url\":\"classes/DirectedVertex.html#id\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedVertex\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/DirectedVertex.html#val\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedVertex\"},{\"kind\":128,\"name\":\"DirectedEdge\",\"url\":\"classes/DirectedEdge.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/DirectedEdge.html#constructor\",\"classes\":\"\",\"parent\":\"DirectedEdge\"},{\"kind\":1024,\"name\":\"_src\",\"url\":\"classes/DirectedEdge.html#_src\",\"classes\":\"tsd-is-private\",\"parent\":\"DirectedEdge\"},{\"kind\":262144,\"name\":\"src\",\"url\":\"classes/DirectedEdge.html#src\",\"classes\":\"\",\"parent\":\"DirectedEdge\"},{\"kind\":1024,\"name\":\"_dest\",\"url\":\"classes/DirectedEdge.html#_dest\",\"classes\":\"tsd-is-private\",\"parent\":\"DirectedEdge\"},{\"kind\":262144,\"name\":\"dest\",\"url\":\"classes/DirectedEdge.html#dest\",\"classes\":\"\",\"parent\":\"DirectedEdge\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/DirectedEdge.html#val\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedEdge\"},{\"kind\":262144,\"name\":\"weight\",\"url\":\"classes/DirectedEdge.html#weight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedEdge\"},{\"kind\":1024,\"name\":\"_hashCode\",\"url\":\"classes/DirectedEdge.html#_hashCode\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"DirectedEdge\"},{\"kind\":262144,\"name\":\"hashCode\",\"url\":\"classes/DirectedEdge.html#hashCode\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedEdge\"},{\"kind\":2048,\"name\":\"_setHashCode\",\"url\":\"classes/DirectedEdge.html#_setHashCode\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"DirectedEdge\"},{\"kind\":128,\"name\":\"DirectedGraph\",\"url\":\"classes/DirectedGraph.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/DirectedGraph.html#constructor\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":1024,\"name\":\"_outEdgeMap\",\"url\":\"classes/DirectedGraph.html#_outEdgeMap\",\"classes\":\"tsd-is-private\",\"parent\":\"DirectedGraph\"},{\"kind\":262144,\"name\":\"outEdgeMap\",\"url\":\"classes/DirectedGraph.html#outEdgeMap\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":1024,\"name\":\"_inEdgeMap\",\"url\":\"classes/DirectedGraph.html#_inEdgeMap\",\"classes\":\"tsd-is-private\",\"parent\":\"DirectedGraph\"},{\"kind\":262144,\"name\":\"inEdgeMap\",\"url\":\"classes/DirectedGraph.html#inEdgeMap\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"createVertex\",\"url\":\"classes/DirectedGraph.html#createVertex\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"createEdge\",\"url\":\"classes/DirectedGraph.html#createEdge\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"getEdge\",\"url\":\"classes/DirectedGraph.html#getEdge\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"removeEdgeSrcToDest\",\"url\":\"classes/DirectedGraph.html#removeEdgeSrcToDest\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"removeEdge\",\"url\":\"classes/DirectedGraph.html#removeEdge\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"removeEdgesBetween\",\"url\":\"classes/DirectedGraph.html#removeEdgesBetween\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"incomingEdgesOf\",\"url\":\"classes/DirectedGraph.html#incomingEdgesOf\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"outgoingEdgesOf\",\"url\":\"classes/DirectedGraph.html#outgoingEdgesOf\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"degreeOf\",\"url\":\"classes/DirectedGraph.html#degreeOf\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"inDegreeOf\",\"url\":\"classes/DirectedGraph.html#inDegreeOf\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"outDegreeOf\",\"url\":\"classes/DirectedGraph.html#outDegreeOf\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"edgesOf\",\"url\":\"classes/DirectedGraph.html#edgesOf\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"getEdgeSrc\",\"url\":\"classes/DirectedGraph.html#getEdgeSrc\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"getEdgeDest\",\"url\":\"classes/DirectedGraph.html#getEdgeDest\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"getDestinations\",\"url\":\"classes/DirectedGraph.html#getDestinations\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"topologicalSort\",\"url\":\"classes/DirectedGraph.html#topologicalSort\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"edgeSet\",\"url\":\"classes/DirectedGraph.html#edgeSet\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"getNeighbors\",\"url\":\"classes/DirectedGraph.html#getNeighbors\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"getEndsOfEdge\",\"url\":\"classes/DirectedGraph.html#getEndsOfEdge\",\"classes\":\"\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"_addEdgeOnly\",\"url\":\"classes/DirectedGraph.html#_addEdgeOnly\",\"classes\":\"tsd-is-protected\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"_setOutEdgeMap\",\"url\":\"classes/DirectedGraph.html#_setOutEdgeMap\",\"classes\":\"tsd-is-protected\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"_setInEdgeMap\",\"url\":\"classes/DirectedGraph.html#_setInEdgeMap\",\"classes\":\"tsd-is-protected\",\"parent\":\"DirectedGraph\"},{\"kind\":262144,\"name\":\"vertices\",\"url\":\"classes/DirectedGraph.html#vertices\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"getVertex\",\"url\":\"classes/DirectedGraph.html#getVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"hasVertex\",\"url\":\"classes/DirectedGraph.html#hasVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"addVertex\",\"url\":\"classes/DirectedGraph.html#addVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"removeVertex\",\"url\":\"classes/DirectedGraph.html#removeVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"removeAllVertices\",\"url\":\"classes/DirectedGraph.html#removeAllVertices\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"hasEdge\",\"url\":\"classes/DirectedGraph.html#hasEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"addEdge\",\"url\":\"classes/DirectedGraph.html#addEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"setEdgeWeight\",\"url\":\"classes/DirectedGraph.html#setEdgeWeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"getAllPathsBetween\",\"url\":\"classes/DirectedGraph.html#getAllPathsBetween\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"getPathSumWeight\",\"url\":\"classes/DirectedGraph.html#getPathSumWeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"getMinCostBetween\",\"url\":\"classes/DirectedGraph.html#getMinCostBetween\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"getMinPathBetween\",\"url\":\"classes/DirectedGraph.html#getMinPathBetween\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"dijkstraWithoutHeap\",\"url\":\"classes/DirectedGraph.html#dijkstraWithoutHeap\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"dijkstra\",\"url\":\"classes/DirectedGraph.html#dijkstra\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"bellmanFord\",\"url\":\"classes/DirectedGraph.html#bellmanFord\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/DirectedGraph.html#bellmanFord.bellmanFord-1.__type\",\"classes\":\"\",\"parent\":\"DirectedGraph.bellmanFord.bellmanFord\"},{\"kind\":1024,\"name\":\"hasNegativeCycle\",\"url\":\"classes/DirectedGraph.html#bellmanFord.bellmanFord-1.__type.hasNegativeCycle\",\"classes\":\"\",\"parent\":\"DirectedGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"distMap\",\"url\":\"classes/DirectedGraph.html#bellmanFord.bellmanFord-1.__type.distMap\",\"classes\":\"\",\"parent\":\"DirectedGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"preMap\",\"url\":\"classes/DirectedGraph.html#bellmanFord.bellmanFord-1.__type.preMap\",\"classes\":\"\",\"parent\":\"DirectedGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"paths\",\"url\":\"classes/DirectedGraph.html#bellmanFord.bellmanFord-1.__type.paths\",\"classes\":\"\",\"parent\":\"DirectedGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"min\",\"url\":\"classes/DirectedGraph.html#bellmanFord.bellmanFord-1.__type.min\",\"classes\":\"\",\"parent\":\"DirectedGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"minPath\",\"url\":\"classes/DirectedGraph.html#bellmanFord.bellmanFord-1.__type.minPath\",\"classes\":\"\",\"parent\":\"DirectedGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":2048,\"name\":\"floyd\",\"url\":\"classes/DirectedGraph.html#floyd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/DirectedGraph.html#floyd.floyd-1.__type-1\",\"classes\":\"\",\"parent\":\"DirectedGraph.floyd.floyd\"},{\"kind\":1024,\"name\":\"costs\",\"url\":\"classes/DirectedGraph.html#floyd.floyd-1.__type-1.costs\",\"classes\":\"\",\"parent\":\"DirectedGraph.floyd.floyd.__type\"},{\"kind\":1024,\"name\":\"predecessor\",\"url\":\"classes/DirectedGraph.html#floyd.floyd-1.__type-1.predecessor\",\"classes\":\"\",\"parent\":\"DirectedGraph.floyd.floyd.__type\"},{\"kind\":2048,\"name\":\"tarjan\",\"url\":\"classes/DirectedGraph.html#tarjan\",\"classes\":\"tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/DirectedGraph.html#tarjan.tarjan-1.__type-2\",\"classes\":\"\",\"parent\":\"DirectedGraph.tarjan.tarjan\"},{\"kind\":1024,\"name\":\"dfnMap\",\"url\":\"classes/DirectedGraph.html#tarjan.tarjan-1.__type-2.dfnMap\",\"classes\":\"\",\"parent\":\"DirectedGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"lowMap\",\"url\":\"classes/DirectedGraph.html#tarjan.tarjan-1.__type-2.lowMap\",\"classes\":\"\",\"parent\":\"DirectedGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"bridges\",\"url\":\"classes/DirectedGraph.html#tarjan.tarjan-1.__type-2.bridges\",\"classes\":\"\",\"parent\":\"DirectedGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"articulationPoints\",\"url\":\"classes/DirectedGraph.html#tarjan.tarjan-1.__type-2.articulationPoints\",\"classes\":\"\",\"parent\":\"DirectedGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"SCCs\",\"url\":\"classes/DirectedGraph.html#tarjan.tarjan-1.__type-2.SCCs\",\"classes\":\"\",\"parent\":\"DirectedGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"cycles\",\"url\":\"classes/DirectedGraph.html#tarjan.tarjan-1.__type-2.cycles\",\"classes\":\"\",\"parent\":\"DirectedGraph.tarjan.tarjan.__type\"},{\"kind\":2048,\"name\":\"_addVertexOnly\",\"url\":\"classes/DirectedGraph.html#_addVertexOnly\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"_getVertex\",\"url\":\"classes/DirectedGraph.html#_getVertex\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"_getVertexId\",\"url\":\"classes/DirectedGraph.html#_getVertexId\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":2048,\"name\":\"_setVertices\",\"url\":\"classes/DirectedGraph.html#_setVertices\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"DirectedGraph\"},{\"kind\":128,\"name\":\"UndirectedVertex\",\"url\":\"classes/UndirectedVertex.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/UndirectedVertex.html#constructor\",\"classes\":\"\",\"parent\":\"UndirectedVertex\"},{\"kind\":262144,\"name\":\"id\",\"url\":\"classes/UndirectedVertex.html#id\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedVertex\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/UndirectedVertex.html#val\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedVertex\"},{\"kind\":128,\"name\":\"UndirectedEdge\",\"url\":\"classes/UndirectedEdge.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/UndirectedEdge.html#constructor\",\"classes\":\"\",\"parent\":\"UndirectedEdge\"},{\"kind\":1024,\"name\":\"_vertices\",\"url\":\"classes/UndirectedEdge.html#_vertices\",\"classes\":\"tsd-is-private\",\"parent\":\"UndirectedEdge\"},{\"kind\":262144,\"name\":\"vertices\",\"url\":\"classes/UndirectedEdge.html#vertices\",\"classes\":\"\",\"parent\":\"UndirectedEdge\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/UndirectedEdge.html#val\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedEdge\"},{\"kind\":262144,\"name\":\"weight\",\"url\":\"classes/UndirectedEdge.html#weight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedEdge\"},{\"kind\":1024,\"name\":\"_hashCode\",\"url\":\"classes/UndirectedEdge.html#_hashCode\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"UndirectedEdge\"},{\"kind\":262144,\"name\":\"hashCode\",\"url\":\"classes/UndirectedEdge.html#hashCode\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedEdge\"},{\"kind\":2048,\"name\":\"_setHashCode\",\"url\":\"classes/UndirectedEdge.html#_setHashCode\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"UndirectedEdge\"},{\"kind\":128,\"name\":\"UndirectedGraph\",\"url\":\"classes/UndirectedGraph.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/UndirectedGraph.html#constructor\",\"classes\":\"\",\"parent\":\"UndirectedGraph\"},{\"kind\":1024,\"name\":\"_edges\",\"url\":\"classes/UndirectedGraph.html#_edges\",\"classes\":\"tsd-is-protected\",\"parent\":\"UndirectedGraph\"},{\"kind\":262144,\"name\":\"edges\",\"url\":\"classes/UndirectedGraph.html#edges\",\"classes\":\"\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"createVertex\",\"url\":\"classes/UndirectedGraph.html#createVertex\",\"classes\":\"\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"createEdge\",\"url\":\"classes/UndirectedGraph.html#createEdge\",\"classes\":\"\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"getEdge\",\"url\":\"classes/UndirectedGraph.html#getEdge\",\"classes\":\"\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"removeEdgeBetween\",\"url\":\"classes/UndirectedGraph.html#removeEdgeBetween\",\"classes\":\"\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"removeEdge\",\"url\":\"classes/UndirectedGraph.html#removeEdge\",\"classes\":\"\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"degreeOf\",\"url\":\"classes/UndirectedGraph.html#degreeOf\",\"classes\":\"\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"edgesOf\",\"url\":\"classes/UndirectedGraph.html#edgesOf\",\"classes\":\"\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"edgeSet\",\"url\":\"classes/UndirectedGraph.html#edgeSet\",\"classes\":\"\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"getNeighbors\",\"url\":\"classes/UndirectedGraph.html#getNeighbors\",\"classes\":\"\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"getEndsOfEdge\",\"url\":\"classes/UndirectedGraph.html#getEndsOfEdge\",\"classes\":\"\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"_addEdgeOnly\",\"url\":\"classes/UndirectedGraph.html#_addEdgeOnly\",\"classes\":\"tsd-is-protected\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"_setEdges\",\"url\":\"classes/UndirectedGraph.html#_setEdges\",\"classes\":\"tsd-is-protected\",\"parent\":\"UndirectedGraph\"},{\"kind\":262144,\"name\":\"vertices\",\"url\":\"classes/UndirectedGraph.html#vertices\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"getVertex\",\"url\":\"classes/UndirectedGraph.html#getVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"hasVertex\",\"url\":\"classes/UndirectedGraph.html#hasVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"addVertex\",\"url\":\"classes/UndirectedGraph.html#addVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"removeVertex\",\"url\":\"classes/UndirectedGraph.html#removeVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"removeAllVertices\",\"url\":\"classes/UndirectedGraph.html#removeAllVertices\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"hasEdge\",\"url\":\"classes/UndirectedGraph.html#hasEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"addEdge\",\"url\":\"classes/UndirectedGraph.html#addEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"setEdgeWeight\",\"url\":\"classes/UndirectedGraph.html#setEdgeWeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"getAllPathsBetween\",\"url\":\"classes/UndirectedGraph.html#getAllPathsBetween\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"getPathSumWeight\",\"url\":\"classes/UndirectedGraph.html#getPathSumWeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"getMinCostBetween\",\"url\":\"classes/UndirectedGraph.html#getMinCostBetween\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"getMinPathBetween\",\"url\":\"classes/UndirectedGraph.html#getMinPathBetween\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"dijkstraWithoutHeap\",\"url\":\"classes/UndirectedGraph.html#dijkstraWithoutHeap\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"dijkstra\",\"url\":\"classes/UndirectedGraph.html#dijkstra\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"bellmanFord\",\"url\":\"classes/UndirectedGraph.html#bellmanFord\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/UndirectedGraph.html#bellmanFord.bellmanFord-1.__type\",\"classes\":\"\",\"parent\":\"UndirectedGraph.bellmanFord.bellmanFord\"},{\"kind\":1024,\"name\":\"hasNegativeCycle\",\"url\":\"classes/UndirectedGraph.html#bellmanFord.bellmanFord-1.__type.hasNegativeCycle\",\"classes\":\"\",\"parent\":\"UndirectedGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"distMap\",\"url\":\"classes/UndirectedGraph.html#bellmanFord.bellmanFord-1.__type.distMap\",\"classes\":\"\",\"parent\":\"UndirectedGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"preMap\",\"url\":\"classes/UndirectedGraph.html#bellmanFord.bellmanFord-1.__type.preMap\",\"classes\":\"\",\"parent\":\"UndirectedGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"paths\",\"url\":\"classes/UndirectedGraph.html#bellmanFord.bellmanFord-1.__type.paths\",\"classes\":\"\",\"parent\":\"UndirectedGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"min\",\"url\":\"classes/UndirectedGraph.html#bellmanFord.bellmanFord-1.__type.min\",\"classes\":\"\",\"parent\":\"UndirectedGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"minPath\",\"url\":\"classes/UndirectedGraph.html#bellmanFord.bellmanFord-1.__type.minPath\",\"classes\":\"\",\"parent\":\"UndirectedGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":2048,\"name\":\"floyd\",\"url\":\"classes/UndirectedGraph.html#floyd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/UndirectedGraph.html#floyd.floyd-1.__type-1\",\"classes\":\"\",\"parent\":\"UndirectedGraph.floyd.floyd\"},{\"kind\":1024,\"name\":\"costs\",\"url\":\"classes/UndirectedGraph.html#floyd.floyd-1.__type-1.costs\",\"classes\":\"\",\"parent\":\"UndirectedGraph.floyd.floyd.__type\"},{\"kind\":1024,\"name\":\"predecessor\",\"url\":\"classes/UndirectedGraph.html#floyd.floyd-1.__type-1.predecessor\",\"classes\":\"\",\"parent\":\"UndirectedGraph.floyd.floyd.__type\"},{\"kind\":2048,\"name\":\"tarjan\",\"url\":\"classes/UndirectedGraph.html#tarjan\",\"classes\":\"tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/UndirectedGraph.html#tarjan.tarjan-1.__type-2\",\"classes\":\"\",\"parent\":\"UndirectedGraph.tarjan.tarjan\"},{\"kind\":1024,\"name\":\"dfnMap\",\"url\":\"classes/UndirectedGraph.html#tarjan.tarjan-1.__type-2.dfnMap\",\"classes\":\"\",\"parent\":\"UndirectedGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"lowMap\",\"url\":\"classes/UndirectedGraph.html#tarjan.tarjan-1.__type-2.lowMap\",\"classes\":\"\",\"parent\":\"UndirectedGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"bridges\",\"url\":\"classes/UndirectedGraph.html#tarjan.tarjan-1.__type-2.bridges\",\"classes\":\"\",\"parent\":\"UndirectedGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"articulationPoints\",\"url\":\"classes/UndirectedGraph.html#tarjan.tarjan-1.__type-2.articulationPoints\",\"classes\":\"\",\"parent\":\"UndirectedGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"SCCs\",\"url\":\"classes/UndirectedGraph.html#tarjan.tarjan-1.__type-2.SCCs\",\"classes\":\"\",\"parent\":\"UndirectedGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"cycles\",\"url\":\"classes/UndirectedGraph.html#tarjan.tarjan-1.__type-2.cycles\",\"classes\":\"\",\"parent\":\"UndirectedGraph.tarjan.tarjan.__type\"},{\"kind\":2048,\"name\":\"_addVertexOnly\",\"url\":\"classes/UndirectedGraph.html#_addVertexOnly\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"_getVertex\",\"url\":\"classes/UndirectedGraph.html#_getVertex\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"_getVertexId\",\"url\":\"classes/UndirectedGraph.html#_getVertexId\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":2048,\"name\":\"_setVertices\",\"url\":\"classes/UndirectedGraph.html#_setVertices\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"UndirectedGraph\"},{\"kind\":128,\"name\":\"MapVertex\",\"url\":\"classes/MapVertex.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/MapVertex.html#constructor\",\"classes\":\"\",\"parent\":\"MapVertex\"},{\"kind\":1024,\"name\":\"_lat\",\"url\":\"classes/MapVertex.html#_lat\",\"classes\":\"tsd-is-private\",\"parent\":\"MapVertex\"},{\"kind\":262144,\"name\":\"lat\",\"url\":\"classes/MapVertex.html#lat\",\"classes\":\"\",\"parent\":\"MapVertex\"},{\"kind\":1024,\"name\":\"_long\",\"url\":\"classes/MapVertex.html#_long\",\"classes\":\"tsd-is-private\",\"parent\":\"MapVertex\"},{\"kind\":262144,\"name\":\"long\",\"url\":\"classes/MapVertex.html#long\",\"classes\":\"\",\"parent\":\"MapVertex\"},{\"kind\":262144,\"name\":\"id\",\"url\":\"classes/MapVertex.html#id\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapVertex\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/MapVertex.html#val\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapVertex\"},{\"kind\":128,\"name\":\"MapEdge\",\"url\":\"classes/MapEdge.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/MapEdge.html#constructor\",\"classes\":\"\",\"parent\":\"MapEdge\"},{\"kind\":262144,\"name\":\"src\",\"url\":\"classes/MapEdge.html#src\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapEdge\"},{\"kind\":262144,\"name\":\"dest\",\"url\":\"classes/MapEdge.html#dest\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapEdge\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/MapEdge.html#val\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapEdge\"},{\"kind\":262144,\"name\":\"weight\",\"url\":\"classes/MapEdge.html#weight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapEdge\"},{\"kind\":1024,\"name\":\"_hashCode\",\"url\":\"classes/MapEdge.html#_hashCode\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MapEdge\"},{\"kind\":262144,\"name\":\"hashCode\",\"url\":\"classes/MapEdge.html#hashCode\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapEdge\"},{\"kind\":2048,\"name\":\"_setHashCode\",\"url\":\"classes/MapEdge.html#_setHashCode\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MapEdge\"},{\"kind\":128,\"name\":\"MapGraph\",\"url\":\"classes/MapGraph.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/MapGraph.html#constructor\",\"classes\":\"\",\"parent\":\"MapGraph\"},{\"kind\":1024,\"name\":\"_origin\",\"url\":\"classes/MapGraph.html#_origin\",\"classes\":\"tsd-is-private\",\"parent\":\"MapGraph\"},{\"kind\":262144,\"name\":\"origin\",\"url\":\"classes/MapGraph.html#origin\",\"classes\":\"\",\"parent\":\"MapGraph\"},{\"kind\":1024,\"name\":\"_bottomRight\",\"url\":\"classes/MapGraph.html#_bottomRight\",\"classes\":\"tsd-is-private\",\"parent\":\"MapGraph\"},{\"kind\":262144,\"name\":\"bottomRight\",\"url\":\"classes/MapGraph.html#bottomRight\",\"classes\":\"\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"createVertex\",\"url\":\"classes/MapGraph.html#createVertex\",\"classes\":\"\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"createEdge\",\"url\":\"classes/MapGraph.html#createEdge\",\"classes\":\"\",\"parent\":\"MapGraph\"},{\"kind\":262144,\"name\":\"outEdgeMap\",\"url\":\"classes/MapGraph.html#outEdgeMap\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":262144,\"name\":\"inEdgeMap\",\"url\":\"classes/MapGraph.html#inEdgeMap\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"getEdge\",\"url\":\"classes/MapGraph.html#getEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"removeEdgeSrcToDest\",\"url\":\"classes/MapGraph.html#removeEdgeSrcToDest\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"removeEdge\",\"url\":\"classes/MapGraph.html#removeEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"removeEdgesBetween\",\"url\":\"classes/MapGraph.html#removeEdgesBetween\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"incomingEdgesOf\",\"url\":\"classes/MapGraph.html#incomingEdgesOf\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"outgoingEdgesOf\",\"url\":\"classes/MapGraph.html#outgoingEdgesOf\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"degreeOf\",\"url\":\"classes/MapGraph.html#degreeOf\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"inDegreeOf\",\"url\":\"classes/MapGraph.html#inDegreeOf\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"outDegreeOf\",\"url\":\"classes/MapGraph.html#outDegreeOf\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"edgesOf\",\"url\":\"classes/MapGraph.html#edgesOf\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"getEdgeSrc\",\"url\":\"classes/MapGraph.html#getEdgeSrc\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"getEdgeDest\",\"url\":\"classes/MapGraph.html#getEdgeDest\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"getDestinations\",\"url\":\"classes/MapGraph.html#getDestinations\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"topologicalSort\",\"url\":\"classes/MapGraph.html#topologicalSort\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"edgeSet\",\"url\":\"classes/MapGraph.html#edgeSet\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"getNeighbors\",\"url\":\"classes/MapGraph.html#getNeighbors\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"getEndsOfEdge\",\"url\":\"classes/MapGraph.html#getEndsOfEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"_addEdgeOnly\",\"url\":\"classes/MapGraph.html#_addEdgeOnly\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"_setOutEdgeMap\",\"url\":\"classes/MapGraph.html#_setOutEdgeMap\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"_setInEdgeMap\",\"url\":\"classes/MapGraph.html#_setInEdgeMap\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":262144,\"name\":\"vertices\",\"url\":\"classes/MapGraph.html#vertices\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"getVertex\",\"url\":\"classes/MapGraph.html#getVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"hasVertex\",\"url\":\"classes/MapGraph.html#hasVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"addVertex\",\"url\":\"classes/MapGraph.html#addVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"removeVertex\",\"url\":\"classes/MapGraph.html#removeVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"removeAllVertices\",\"url\":\"classes/MapGraph.html#removeAllVertices\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"hasEdge\",\"url\":\"classes/MapGraph.html#hasEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"addEdge\",\"url\":\"classes/MapGraph.html#addEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"setEdgeWeight\",\"url\":\"classes/MapGraph.html#setEdgeWeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"getAllPathsBetween\",\"url\":\"classes/MapGraph.html#getAllPathsBetween\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"getPathSumWeight\",\"url\":\"classes/MapGraph.html#getPathSumWeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"getMinCostBetween\",\"url\":\"classes/MapGraph.html#getMinCostBetween\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"getMinPathBetween\",\"url\":\"classes/MapGraph.html#getMinPathBetween\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"dijkstraWithoutHeap\",\"url\":\"classes/MapGraph.html#dijkstraWithoutHeap\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"dijkstra\",\"url\":\"classes/MapGraph.html#dijkstra\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"bellmanFord\",\"url\":\"classes/MapGraph.html#bellmanFord\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/MapGraph.html#bellmanFord.bellmanFord-1.__type\",\"classes\":\"\",\"parent\":\"MapGraph.bellmanFord.bellmanFord\"},{\"kind\":1024,\"name\":\"hasNegativeCycle\",\"url\":\"classes/MapGraph.html#bellmanFord.bellmanFord-1.__type.hasNegativeCycle\",\"classes\":\"\",\"parent\":\"MapGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"distMap\",\"url\":\"classes/MapGraph.html#bellmanFord.bellmanFord-1.__type.distMap\",\"classes\":\"\",\"parent\":\"MapGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"preMap\",\"url\":\"classes/MapGraph.html#bellmanFord.bellmanFord-1.__type.preMap\",\"classes\":\"\",\"parent\":\"MapGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"paths\",\"url\":\"classes/MapGraph.html#bellmanFord.bellmanFord-1.__type.paths\",\"classes\":\"\",\"parent\":\"MapGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"min\",\"url\":\"classes/MapGraph.html#bellmanFord.bellmanFord-1.__type.min\",\"classes\":\"\",\"parent\":\"MapGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":1024,\"name\":\"minPath\",\"url\":\"classes/MapGraph.html#bellmanFord.bellmanFord-1.__type.minPath\",\"classes\":\"\",\"parent\":\"MapGraph.bellmanFord.bellmanFord.__type\"},{\"kind\":2048,\"name\":\"floyd\",\"url\":\"classes/MapGraph.html#floyd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/MapGraph.html#floyd.floyd-1.__type-1\",\"classes\":\"\",\"parent\":\"MapGraph.floyd.floyd\"},{\"kind\":1024,\"name\":\"costs\",\"url\":\"classes/MapGraph.html#floyd.floyd-1.__type-1.costs\",\"classes\":\"\",\"parent\":\"MapGraph.floyd.floyd.__type\"},{\"kind\":1024,\"name\":\"predecessor\",\"url\":\"classes/MapGraph.html#floyd.floyd-1.__type-1.predecessor\",\"classes\":\"\",\"parent\":\"MapGraph.floyd.floyd.__type\"},{\"kind\":2048,\"name\":\"tarjan\",\"url\":\"classes/MapGraph.html#tarjan\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/MapGraph.html#tarjan.tarjan-1.__type-2\",\"classes\":\"\",\"parent\":\"MapGraph.tarjan.tarjan\"},{\"kind\":1024,\"name\":\"dfnMap\",\"url\":\"classes/MapGraph.html#tarjan.tarjan-1.__type-2.dfnMap\",\"classes\":\"\",\"parent\":\"MapGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"lowMap\",\"url\":\"classes/MapGraph.html#tarjan.tarjan-1.__type-2.lowMap\",\"classes\":\"\",\"parent\":\"MapGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"bridges\",\"url\":\"classes/MapGraph.html#tarjan.tarjan-1.__type-2.bridges\",\"classes\":\"\",\"parent\":\"MapGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"articulationPoints\",\"url\":\"classes/MapGraph.html#tarjan.tarjan-1.__type-2.articulationPoints\",\"classes\":\"\",\"parent\":\"MapGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"SCCs\",\"url\":\"classes/MapGraph.html#tarjan.tarjan-1.__type-2.SCCs\",\"classes\":\"\",\"parent\":\"MapGraph.tarjan.tarjan.__type\"},{\"kind\":1024,\"name\":\"cycles\",\"url\":\"classes/MapGraph.html#tarjan.tarjan-1.__type-2.cycles\",\"classes\":\"\",\"parent\":\"MapGraph.tarjan.tarjan.__type\"},{\"kind\":2048,\"name\":\"_addVertexOnly\",\"url\":\"classes/MapGraph.html#_addVertexOnly\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"_getVertex\",\"url\":\"classes/MapGraph.html#_getVertex\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"_getVertexId\",\"url\":\"classes/MapGraph.html#_getVertexId\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":2048,\"name\":\"_setVertices\",\"url\":\"classes/MapGraph.html#_setVertices\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MapGraph\"},{\"kind\":128,\"name\":\"AbstractBinaryTreeNode\",\"url\":\"classes/AbstractBinaryTreeNode.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/AbstractBinaryTreeNode.html#constructor\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractBinaryTreeNode\"},{\"kind\":1024,\"name\":\"_id\",\"url\":\"classes/AbstractBinaryTreeNode.html#_id\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractBinaryTreeNode\"},{\"kind\":262144,\"name\":\"id\",\"url\":\"classes/AbstractBinaryTreeNode.html#id\",\"classes\":\"\",\"parent\":\"AbstractBinaryTreeNode\"},{\"kind\":1024,\"name\":\"_val\",\"url\":\"classes/AbstractBinaryTreeNode.html#_val\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractBinaryTreeNode\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/AbstractBinaryTreeNode.html#val\",\"classes\":\"\",\"parent\":\"AbstractBinaryTreeNode\"},{\"kind\":1024,\"name\":\"_left\",\"url\":\"classes/AbstractBinaryTreeNode.html#_left\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractBinaryTreeNode\"},{\"kind\":262144,\"name\":\"left\",\"url\":\"classes/AbstractBinaryTreeNode.html#left\",\"classes\":\"\",\"parent\":\"AbstractBinaryTreeNode\"},{\"kind\":1024,\"name\":\"_right\",\"url\":\"classes/AbstractBinaryTreeNode.html#_right\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractBinaryTreeNode\"},{\"kind\":262144,\"name\":\"right\",\"url\":\"classes/AbstractBinaryTreeNode.html#right\",\"classes\":\"\",\"parent\":\"AbstractBinaryTreeNode\"},{\"kind\":1024,\"name\":\"_parent\",\"url\":\"classes/AbstractBinaryTreeNode.html#_parent\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractBinaryTreeNode\"},{\"kind\":262144,\"name\":\"parent\",\"url\":\"classes/AbstractBinaryTreeNode.html#parent\",\"classes\":\"\",\"parent\":\"AbstractBinaryTreeNode\"},{\"kind\":1024,\"name\":\"_height\",\"url\":\"classes/AbstractBinaryTreeNode.html#_height\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractBinaryTreeNode\"},{\"kind\":262144,\"name\":\"height\",\"url\":\"classes/AbstractBinaryTreeNode.html#height\",\"classes\":\"\",\"parent\":\"AbstractBinaryTreeNode\"},{\"kind\":262144,\"name\":\"familyPosition\",\"url\":\"classes/AbstractBinaryTreeNode.html#familyPosition\",\"classes\":\"\",\"parent\":\"AbstractBinaryTreeNode\"},{\"kind\":128,\"name\":\"AbstractBinaryTree\",\"url\":\"classes/AbstractBinaryTree.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/AbstractBinaryTree.html#constructor\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":1024,\"name\":\"_root\",\"url\":\"classes/AbstractBinaryTree.html#_root\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":262144,\"name\":\"root\",\"url\":\"classes/AbstractBinaryTree.html#root\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":1024,\"name\":\"_size\",\"url\":\"classes/AbstractBinaryTree.html#_size\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/AbstractBinaryTree.html#size\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":1024,\"name\":\"_loopType\",\"url\":\"classes/AbstractBinaryTree.html#_loopType\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":262144,\"name\":\"loopType\",\"url\":\"classes/AbstractBinaryTree.html#loopType\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":1024,\"name\":\"_visitedId\",\"url\":\"classes/AbstractBinaryTree.html#_visitedId\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":262144,\"name\":\"visitedId\",\"url\":\"classes/AbstractBinaryTree.html#visitedId\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":1024,\"name\":\"_visitedVal\",\"url\":\"classes/AbstractBinaryTree.html#_visitedVal\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":262144,\"name\":\"visitedVal\",\"url\":\"classes/AbstractBinaryTree.html#visitedVal\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":1024,\"name\":\"_visitedNode\",\"url\":\"classes/AbstractBinaryTree.html#_visitedNode\",\"classes\":\"tsd-is-private\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":262144,\"name\":\"visitedNode\",\"url\":\"classes/AbstractBinaryTree.html#visitedNode\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"createNode\",\"url\":\"classes/AbstractBinaryTree.html#createNode\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"swapLocation\",\"url\":\"classes/AbstractBinaryTree.html#swapLocation\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/AbstractBinaryTree.html#clear\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/AbstractBinaryTree.html#isEmpty\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/AbstractBinaryTree.html#add\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"addMany\",\"url\":\"classes/AbstractBinaryTree.html#addMany\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"fill\",\"url\":\"classes/AbstractBinaryTree.html#fill\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"classes/AbstractBinaryTree.html#remove\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getDepth\",\"url\":\"classes/AbstractBinaryTree.html#getDepth\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getHeight\",\"url\":\"classes/AbstractBinaryTree.html#getHeight\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getMinHeight\",\"url\":\"classes/AbstractBinaryTree.html#getMinHeight\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"isPerfectlyBalanced\",\"url\":\"classes/AbstractBinaryTree.html#isPerfectlyBalanced\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getNodes\",\"url\":\"classes/AbstractBinaryTree.html#getNodes\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/AbstractBinaryTree.html#has\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"classes/AbstractBinaryTree.html#get\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getPathToRoot\",\"url\":\"classes/AbstractBinaryTree.html#getPathToRoot\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getLeftMost\",\"url\":\"classes/AbstractBinaryTree.html#getLeftMost\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getRightMost\",\"url\":\"classes/AbstractBinaryTree.html#getRightMost\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"isSubtreeBST\",\"url\":\"classes/AbstractBinaryTree.html#isSubtreeBST\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"isBST\",\"url\":\"classes/AbstractBinaryTree.html#isBST\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getSubTreeSize\",\"url\":\"classes/AbstractBinaryTree.html#getSubTreeSize\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"subTreeSum\",\"url\":\"classes/AbstractBinaryTree.html#subTreeSum\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"subTreeAdd\",\"url\":\"classes/AbstractBinaryTree.html#subTreeAdd\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"BFS\",\"url\":\"classes/AbstractBinaryTree.html#BFS\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"DFS\",\"url\":\"classes/AbstractBinaryTree.html#DFS\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"DFSIterative\",\"url\":\"classes/AbstractBinaryTree.html#DFSIterative\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"levelIterative\",\"url\":\"classes/AbstractBinaryTree.html#levelIterative\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"listLevels\",\"url\":\"classes/AbstractBinaryTree.html#listLevels\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getPredecessor\",\"url\":\"classes/AbstractBinaryTree.html#getPredecessor\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"morris\",\"url\":\"classes/AbstractBinaryTree.html#morris\",\"classes\":\"\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"_addTo\",\"url\":\"classes/AbstractBinaryTree.html#_addTo\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"_setLoopType\",\"url\":\"classes/AbstractBinaryTree.html#_setLoopType\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"_setVisitedId\",\"url\":\"classes/AbstractBinaryTree.html#_setVisitedId\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"_setVisitedVal\",\"url\":\"classes/AbstractBinaryTree.html#_setVisitedVal\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"_setVisitedNode\",\"url\":\"classes/AbstractBinaryTree.html#_setVisitedNode\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"_setRoot\",\"url\":\"classes/AbstractBinaryTree.html#_setRoot\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"_setSize\",\"url\":\"classes/AbstractBinaryTree.html#_setSize\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"_clearResults\",\"url\":\"classes/AbstractBinaryTree.html#_clearResults\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"_pushByPropertyNameStopOrNot\",\"url\":\"classes/AbstractBinaryTree.html#_pushByPropertyNameStopOrNot\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"_accumulatedByPropertyName\",\"url\":\"classes/AbstractBinaryTree.html#_accumulatedByPropertyName\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":2048,\"name\":\"_getResultByPropertyName\",\"url\":\"classes/AbstractBinaryTree.html#_getResultByPropertyName\",\"classes\":\"tsd-is-protected\",\"parent\":\"AbstractBinaryTree\"},{\"kind\":128,\"name\":\"BinaryTreeNode\",\"url\":\"classes/BinaryTreeNode.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/BinaryTreeNode.html#constructor\",\"classes\":\"\",\"parent\":\"BinaryTreeNode\"},{\"kind\":262144,\"name\":\"id\",\"url\":\"classes/BinaryTreeNode.html#id\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTreeNode\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/BinaryTreeNode.html#val\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTreeNode\"},{\"kind\":262144,\"name\":\"left\",\"url\":\"classes/BinaryTreeNode.html#left\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTreeNode\"},{\"kind\":262144,\"name\":\"right\",\"url\":\"classes/BinaryTreeNode.html#right\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTreeNode\"},{\"kind\":262144,\"name\":\"parent\",\"url\":\"classes/BinaryTreeNode.html#parent\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTreeNode\"},{\"kind\":262144,\"name\":\"height\",\"url\":\"classes/BinaryTreeNode.html#height\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTreeNode\"},{\"kind\":262144,\"name\":\"familyPosition\",\"url\":\"classes/BinaryTreeNode.html#familyPosition\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTreeNode\"},{\"kind\":128,\"name\":\"BinaryTree\",\"url\":\"classes/BinaryTree.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/BinaryTree.html#constructor\",\"classes\":\"\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"createNode\",\"url\":\"classes/BinaryTree.html#createNode\",\"classes\":\"\",\"parent\":\"BinaryTree\"},{\"kind\":262144,\"name\":\"root\",\"url\":\"classes/BinaryTree.html#root\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/BinaryTree.html#size\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":262144,\"name\":\"loopType\",\"url\":\"classes/BinaryTree.html#loopType\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":262144,\"name\":\"visitedId\",\"url\":\"classes/BinaryTree.html#visitedId\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":262144,\"name\":\"visitedVal\",\"url\":\"classes/BinaryTree.html#visitedVal\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":262144,\"name\":\"visitedNode\",\"url\":\"classes/BinaryTree.html#visitedNode\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"swapLocation\",\"url\":\"classes/BinaryTree.html#swapLocation\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/BinaryTree.html#clear\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/BinaryTree.html#isEmpty\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/BinaryTree.html#add\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"addMany\",\"url\":\"classes/BinaryTree.html#addMany\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"fill\",\"url\":\"classes/BinaryTree.html#fill\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"classes/BinaryTree.html#remove\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"getDepth\",\"url\":\"classes/BinaryTree.html#getDepth\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"getHeight\",\"url\":\"classes/BinaryTree.html#getHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"getMinHeight\",\"url\":\"classes/BinaryTree.html#getMinHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"isPerfectlyBalanced\",\"url\":\"classes/BinaryTree.html#isPerfectlyBalanced\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"getNodes\",\"url\":\"classes/BinaryTree.html#getNodes\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/BinaryTree.html#has\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"classes/BinaryTree.html#get\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"getPathToRoot\",\"url\":\"classes/BinaryTree.html#getPathToRoot\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"getLeftMost\",\"url\":\"classes/BinaryTree.html#getLeftMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"getRightMost\",\"url\":\"classes/BinaryTree.html#getRightMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"isSubtreeBST\",\"url\":\"classes/BinaryTree.html#isSubtreeBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"isBST\",\"url\":\"classes/BinaryTree.html#isBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"getSubTreeSize\",\"url\":\"classes/BinaryTree.html#getSubTreeSize\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"subTreeSum\",\"url\":\"classes/BinaryTree.html#subTreeSum\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"subTreeAdd\",\"url\":\"classes/BinaryTree.html#subTreeAdd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"BFS\",\"url\":\"classes/BinaryTree.html#BFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"DFS\",\"url\":\"classes/BinaryTree.html#DFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"DFSIterative\",\"url\":\"classes/BinaryTree.html#DFSIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"levelIterative\",\"url\":\"classes/BinaryTree.html#levelIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"listLevels\",\"url\":\"classes/BinaryTree.html#listLevels\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"getPredecessor\",\"url\":\"classes/BinaryTree.html#getPredecessor\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"morris\",\"url\":\"classes/BinaryTree.html#morris\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"_addTo\",\"url\":\"classes/BinaryTree.html#_addTo\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"_setLoopType\",\"url\":\"classes/BinaryTree.html#_setLoopType\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"_setVisitedId\",\"url\":\"classes/BinaryTree.html#_setVisitedId\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"_setVisitedVal\",\"url\":\"classes/BinaryTree.html#_setVisitedVal\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"_setVisitedNode\",\"url\":\"classes/BinaryTree.html#_setVisitedNode\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"_setRoot\",\"url\":\"classes/BinaryTree.html#_setRoot\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"_setSize\",\"url\":\"classes/BinaryTree.html#_setSize\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"_clearResults\",\"url\":\"classes/BinaryTree.html#_clearResults\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"_pushByPropertyNameStopOrNot\",\"url\":\"classes/BinaryTree.html#_pushByPropertyNameStopOrNot\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"_accumulatedByPropertyName\",\"url\":\"classes/BinaryTree.html#_accumulatedByPropertyName\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":2048,\"name\":\"_getResultByPropertyName\",\"url\":\"classes/BinaryTree.html#_getResultByPropertyName\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BinaryTree\"},{\"kind\":128,\"name\":\"BSTNode\",\"url\":\"classes/BSTNode.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/BSTNode.html#constructor\",\"classes\":\"\",\"parent\":\"BSTNode\"},{\"kind\":262144,\"name\":\"id\",\"url\":\"classes/BSTNode.html#id\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BSTNode\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/BSTNode.html#val\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BSTNode\"},{\"kind\":262144,\"name\":\"left\",\"url\":\"classes/BSTNode.html#left\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BSTNode\"},{\"kind\":262144,\"name\":\"right\",\"url\":\"classes/BSTNode.html#right\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BSTNode\"},{\"kind\":262144,\"name\":\"parent\",\"url\":\"classes/BSTNode.html#parent\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BSTNode\"},{\"kind\":262144,\"name\":\"height\",\"url\":\"classes/BSTNode.html#height\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BSTNode\"},{\"kind\":262144,\"name\":\"familyPosition\",\"url\":\"classes/BSTNode.html#familyPosition\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BSTNode\"},{\"kind\":128,\"name\":\"BST\",\"url\":\"classes/BST.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/BST.html#constructor\",\"classes\":\"\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"createNode\",\"url\":\"classes/BST.html#createNode\",\"classes\":\"\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/BST.html#add\",\"classes\":\"\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"addMany\",\"url\":\"classes/BST.html#addMany\",\"classes\":\"\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"classes/BST.html#get\",\"classes\":\"\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"lastKey\",\"url\":\"classes/BST.html#lastKey\",\"classes\":\"\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"getNodes\",\"url\":\"classes/BST.html#getNodes\",\"classes\":\"\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"lesserSum\",\"url\":\"classes/BST.html#lesserSum\",\"classes\":\"\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"allGreaterNodesAdd\",\"url\":\"classes/BST.html#allGreaterNodesAdd\",\"classes\":\"\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"perfectlyBalance\",\"url\":\"classes/BST.html#perfectlyBalance\",\"classes\":\"\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"isAVLBalanced\",\"url\":\"classes/BST.html#isAVLBalanced\",\"classes\":\"\",\"parent\":\"BST\"},{\"kind\":1024,\"name\":\"_comparator\",\"url\":\"classes/BST.html#_comparator\",\"classes\":\"tsd-is-protected\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"_compare\",\"url\":\"classes/BST.html#_compare\",\"classes\":\"tsd-is-protected\",\"parent\":\"BST\"},{\"kind\":262144,\"name\":\"root\",\"url\":\"classes/BST.html#root\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/BST.html#size\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":262144,\"name\":\"loopType\",\"url\":\"classes/BST.html#loopType\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":262144,\"name\":\"visitedId\",\"url\":\"classes/BST.html#visitedId\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":262144,\"name\":\"visitedVal\",\"url\":\"classes/BST.html#visitedVal\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":262144,\"name\":\"visitedNode\",\"url\":\"classes/BST.html#visitedNode\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"swapLocation\",\"url\":\"classes/BST.html#swapLocation\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/BST.html#clear\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/BST.html#isEmpty\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"fill\",\"url\":\"classes/BST.html#fill\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"classes/BST.html#remove\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"getDepth\",\"url\":\"classes/BST.html#getDepth\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"getHeight\",\"url\":\"classes/BST.html#getHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"getMinHeight\",\"url\":\"classes/BST.html#getMinHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"isPerfectlyBalanced\",\"url\":\"classes/BST.html#isPerfectlyBalanced\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/BST.html#has\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"getPathToRoot\",\"url\":\"classes/BST.html#getPathToRoot\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"getLeftMost\",\"url\":\"classes/BST.html#getLeftMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"getRightMost\",\"url\":\"classes/BST.html#getRightMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"isSubtreeBST\",\"url\":\"classes/BST.html#isSubtreeBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"isBST\",\"url\":\"classes/BST.html#isBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"getSubTreeSize\",\"url\":\"classes/BST.html#getSubTreeSize\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"subTreeSum\",\"url\":\"classes/BST.html#subTreeSum\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"subTreeAdd\",\"url\":\"classes/BST.html#subTreeAdd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"BFS\",\"url\":\"classes/BST.html#BFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"DFS\",\"url\":\"classes/BST.html#DFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"DFSIterative\",\"url\":\"classes/BST.html#DFSIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"levelIterative\",\"url\":\"classes/BST.html#levelIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"listLevels\",\"url\":\"classes/BST.html#listLevels\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"getPredecessor\",\"url\":\"classes/BST.html#getPredecessor\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"morris\",\"url\":\"classes/BST.html#morris\",\"classes\":\"tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"_addTo\",\"url\":\"classes/BST.html#_addTo\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"_setLoopType\",\"url\":\"classes/BST.html#_setLoopType\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"_setVisitedId\",\"url\":\"classes/BST.html#_setVisitedId\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"_setVisitedVal\",\"url\":\"classes/BST.html#_setVisitedVal\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"_setVisitedNode\",\"url\":\"classes/BST.html#_setVisitedNode\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"_setRoot\",\"url\":\"classes/BST.html#_setRoot\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"_setSize\",\"url\":\"classes/BST.html#_setSize\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"_clearResults\",\"url\":\"classes/BST.html#_clearResults\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"_pushByPropertyNameStopOrNot\",\"url\":\"classes/BST.html#_pushByPropertyNameStopOrNot\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"_accumulatedByPropertyName\",\"url\":\"classes/BST.html#_accumulatedByPropertyName\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":2048,\"name\":\"_getResultByPropertyName\",\"url\":\"classes/BST.html#_getResultByPropertyName\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"BST\"},{\"kind\":128,\"name\":\"BinaryIndexedTree\",\"url\":\"classes/BinaryIndexedTree.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"lowBit\",\"url\":\"classes/BinaryIndexedTree.html#lowBit\",\"classes\":\"\",\"parent\":\"BinaryIndexedTree\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/BinaryIndexedTree.html#constructor\",\"classes\":\"\",\"parent\":\"BinaryIndexedTree\"},{\"kind\":1024,\"name\":\"_sumTree\",\"url\":\"classes/BinaryIndexedTree.html#_sumTree\",\"classes\":\"tsd-is-private\",\"parent\":\"BinaryIndexedTree\"},{\"kind\":262144,\"name\":\"sumTree\",\"url\":\"classes/BinaryIndexedTree.html#sumTree\",\"classes\":\"\",\"parent\":\"BinaryIndexedTree\"},{\"kind\":2048,\"name\":\"update\",\"url\":\"classes/BinaryIndexedTree.html#update\",\"classes\":\"\",\"parent\":\"BinaryIndexedTree\"},{\"kind\":2048,\"name\":\"getPrefixSum\",\"url\":\"classes/BinaryIndexedTree.html#getPrefixSum\",\"classes\":\"\",\"parent\":\"BinaryIndexedTree\"},{\"kind\":2048,\"name\":\"getRangeSum\",\"url\":\"classes/BinaryIndexedTree.html#getRangeSum\",\"classes\":\"\",\"parent\":\"BinaryIndexedTree\"},{\"kind\":2048,\"name\":\"_setSumTree\",\"url\":\"classes/BinaryIndexedTree.html#_setSumTree\",\"classes\":\"tsd-is-protected\",\"parent\":\"BinaryIndexedTree\"},{\"kind\":128,\"name\":\"SegmentTreeNode\",\"url\":\"classes/SegmentTreeNode.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/SegmentTreeNode.html#constructor\",\"classes\":\"\",\"parent\":\"SegmentTreeNode\"},{\"kind\":1024,\"name\":\"_start\",\"url\":\"classes/SegmentTreeNode.html#_start\",\"classes\":\"tsd-is-private\",\"parent\":\"SegmentTreeNode\"},{\"kind\":262144,\"name\":\"start\",\"url\":\"classes/SegmentTreeNode.html#start\",\"classes\":\"\",\"parent\":\"SegmentTreeNode\"},{\"kind\":1024,\"name\":\"_end\",\"url\":\"classes/SegmentTreeNode.html#_end\",\"classes\":\"tsd-is-private\",\"parent\":\"SegmentTreeNode\"},{\"kind\":262144,\"name\":\"end\",\"url\":\"classes/SegmentTreeNode.html#end\",\"classes\":\"\",\"parent\":\"SegmentTreeNode\"},{\"kind\":1024,\"name\":\"_val\",\"url\":\"classes/SegmentTreeNode.html#_val\",\"classes\":\"tsd-is-private\",\"parent\":\"SegmentTreeNode\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/SegmentTreeNode.html#val\",\"classes\":\"\",\"parent\":\"SegmentTreeNode\"},{\"kind\":1024,\"name\":\"_sum\",\"url\":\"classes/SegmentTreeNode.html#_sum\",\"classes\":\"tsd-is-private\",\"parent\":\"SegmentTreeNode\"},{\"kind\":262144,\"name\":\"sum\",\"url\":\"classes/SegmentTreeNode.html#sum\",\"classes\":\"\",\"parent\":\"SegmentTreeNode\"},{\"kind\":1024,\"name\":\"_left\",\"url\":\"classes/SegmentTreeNode.html#_left\",\"classes\":\"tsd-is-private\",\"parent\":\"SegmentTreeNode\"},{\"kind\":262144,\"name\":\"left\",\"url\":\"classes/SegmentTreeNode.html#left\",\"classes\":\"\",\"parent\":\"SegmentTreeNode\"},{\"kind\":1024,\"name\":\"_right\",\"url\":\"classes/SegmentTreeNode.html#_right\",\"classes\":\"tsd-is-private\",\"parent\":\"SegmentTreeNode\"},{\"kind\":262144,\"name\":\"right\",\"url\":\"classes/SegmentTreeNode.html#right\",\"classes\":\"\",\"parent\":\"SegmentTreeNode\"},{\"kind\":128,\"name\":\"SegmentTree\",\"url\":\"classes/SegmentTree.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/SegmentTree.html#constructor\",\"classes\":\"\",\"parent\":\"SegmentTree\"},{\"kind\":1024,\"name\":\"_values\",\"url\":\"classes/SegmentTree.html#_values\",\"classes\":\"tsd-is-private\",\"parent\":\"SegmentTree\"},{\"kind\":262144,\"name\":\"values\",\"url\":\"classes/SegmentTree.html#values\",\"classes\":\"\",\"parent\":\"SegmentTree\"},{\"kind\":1024,\"name\":\"_start\",\"url\":\"classes/SegmentTree.html#_start\",\"classes\":\"tsd-is-private\",\"parent\":\"SegmentTree\"},{\"kind\":262144,\"name\":\"start\",\"url\":\"classes/SegmentTree.html#start\",\"classes\":\"\",\"parent\":\"SegmentTree\"},{\"kind\":1024,\"name\":\"_end\",\"url\":\"classes/SegmentTree.html#_end\",\"classes\":\"tsd-is-private\",\"parent\":\"SegmentTree\"},{\"kind\":262144,\"name\":\"end\",\"url\":\"classes/SegmentTree.html#end\",\"classes\":\"\",\"parent\":\"SegmentTree\"},{\"kind\":1024,\"name\":\"_root\",\"url\":\"classes/SegmentTree.html#_root\",\"classes\":\"tsd-is-private\",\"parent\":\"SegmentTree\"},{\"kind\":262144,\"name\":\"root\",\"url\":\"classes/SegmentTree.html#root\",\"classes\":\"\",\"parent\":\"SegmentTree\"},{\"kind\":2048,\"name\":\"build\",\"url\":\"classes/SegmentTree.html#build\",\"classes\":\"\",\"parent\":\"SegmentTree\"},{\"kind\":2048,\"name\":\"updateNode\",\"url\":\"classes/SegmentTree.html#updateNode\",\"classes\":\"\",\"parent\":\"SegmentTree\"},{\"kind\":2048,\"name\":\"querySumByRange\",\"url\":\"classes/SegmentTree.html#querySumByRange\",\"classes\":\"\",\"parent\":\"SegmentTree\"},{\"kind\":2048,\"name\":\"_setValues\",\"url\":\"classes/SegmentTree.html#_setValues\",\"classes\":\"tsd-is-protected\",\"parent\":\"SegmentTree\"},{\"kind\":2048,\"name\":\"_setStart\",\"url\":\"classes/SegmentTree.html#_setStart\",\"classes\":\"tsd-is-protected\",\"parent\":\"SegmentTree\"},{\"kind\":2048,\"name\":\"_setEnd\",\"url\":\"classes/SegmentTree.html#_setEnd\",\"classes\":\"tsd-is-protected\",\"parent\":\"SegmentTree\"},{\"kind\":2048,\"name\":\"_setRoot\",\"url\":\"classes/SegmentTree.html#_setRoot\",\"classes\":\"tsd-is-protected\",\"parent\":\"SegmentTree\"},{\"kind\":128,\"name\":\"AVLTreeNode\",\"url\":\"classes/AVLTreeNode.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/AVLTreeNode.html#constructor\",\"classes\":\"\",\"parent\":\"AVLTreeNode\"},{\"kind\":262144,\"name\":\"id\",\"url\":\"classes/AVLTreeNode.html#id\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTreeNode\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/AVLTreeNode.html#val\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTreeNode\"},{\"kind\":262144,\"name\":\"left\",\"url\":\"classes/AVLTreeNode.html#left\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTreeNode\"},{\"kind\":262144,\"name\":\"right\",\"url\":\"classes/AVLTreeNode.html#right\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTreeNode\"},{\"kind\":262144,\"name\":\"parent\",\"url\":\"classes/AVLTreeNode.html#parent\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTreeNode\"},{\"kind\":262144,\"name\":\"height\",\"url\":\"classes/AVLTreeNode.html#height\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTreeNode\"},{\"kind\":262144,\"name\":\"familyPosition\",\"url\":\"classes/AVLTreeNode.html#familyPosition\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTreeNode\"},{\"kind\":128,\"name\":\"AVLTree\",\"url\":\"classes/AVLTree.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/AVLTree.html#constructor\",\"classes\":\"\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"createNode\",\"url\":\"classes/AVLTree.html#createNode\",\"classes\":\"\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/AVLTree.html#add\",\"classes\":\"\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"classes/AVLTree.html#remove\",\"classes\":\"\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_balanceFactor\",\"url\":\"classes/AVLTree.html#_balanceFactor\",\"classes\":\"tsd-is-protected\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_updateHeight\",\"url\":\"classes/AVLTree.html#_updateHeight\",\"classes\":\"tsd-is-protected\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_balancePath\",\"url\":\"classes/AVLTree.html#_balancePath\",\"classes\":\"tsd-is-protected\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_balanceLL\",\"url\":\"classes/AVLTree.html#_balanceLL\",\"classes\":\"tsd-is-protected\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_balanceLR\",\"url\":\"classes/AVLTree.html#_balanceLR\",\"classes\":\"tsd-is-protected\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_balanceRR\",\"url\":\"classes/AVLTree.html#_balanceRR\",\"classes\":\"tsd-is-protected\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_balanceRL\",\"url\":\"classes/AVLTree.html#_balanceRL\",\"classes\":\"tsd-is-protected\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"addMany\",\"url\":\"classes/AVLTree.html#addMany\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"classes/AVLTree.html#get\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"lastKey\",\"url\":\"classes/AVLTree.html#lastKey\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"getNodes\",\"url\":\"classes/AVLTree.html#getNodes\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"lesserSum\",\"url\":\"classes/AVLTree.html#lesserSum\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"allGreaterNodesAdd\",\"url\":\"classes/AVLTree.html#allGreaterNodesAdd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"perfectlyBalance\",\"url\":\"classes/AVLTree.html#perfectlyBalance\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"isAVLBalanced\",\"url\":\"classes/AVLTree.html#isAVLBalanced\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":1024,\"name\":\"_comparator\",\"url\":\"classes/AVLTree.html#_comparator\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_compare\",\"url\":\"classes/AVLTree.html#_compare\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":262144,\"name\":\"root\",\"url\":\"classes/AVLTree.html#root\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/AVLTree.html#size\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":262144,\"name\":\"loopType\",\"url\":\"classes/AVLTree.html#loopType\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":262144,\"name\":\"visitedId\",\"url\":\"classes/AVLTree.html#visitedId\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":262144,\"name\":\"visitedVal\",\"url\":\"classes/AVLTree.html#visitedVal\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":262144,\"name\":\"visitedNode\",\"url\":\"classes/AVLTree.html#visitedNode\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"swapLocation\",\"url\":\"classes/AVLTree.html#swapLocation\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/AVLTree.html#clear\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/AVLTree.html#isEmpty\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"fill\",\"url\":\"classes/AVLTree.html#fill\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"getDepth\",\"url\":\"classes/AVLTree.html#getDepth\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"getHeight\",\"url\":\"classes/AVLTree.html#getHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"getMinHeight\",\"url\":\"classes/AVLTree.html#getMinHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"isPerfectlyBalanced\",\"url\":\"classes/AVLTree.html#isPerfectlyBalanced\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/AVLTree.html#has\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"getPathToRoot\",\"url\":\"classes/AVLTree.html#getPathToRoot\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"getLeftMost\",\"url\":\"classes/AVLTree.html#getLeftMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"getRightMost\",\"url\":\"classes/AVLTree.html#getRightMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"isSubtreeBST\",\"url\":\"classes/AVLTree.html#isSubtreeBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"isBST\",\"url\":\"classes/AVLTree.html#isBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"getSubTreeSize\",\"url\":\"classes/AVLTree.html#getSubTreeSize\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"subTreeSum\",\"url\":\"classes/AVLTree.html#subTreeSum\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"subTreeAdd\",\"url\":\"classes/AVLTree.html#subTreeAdd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"BFS\",\"url\":\"classes/AVLTree.html#BFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"DFS\",\"url\":\"classes/AVLTree.html#DFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"DFSIterative\",\"url\":\"classes/AVLTree.html#DFSIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"levelIterative\",\"url\":\"classes/AVLTree.html#levelIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"listLevels\",\"url\":\"classes/AVLTree.html#listLevels\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"getPredecessor\",\"url\":\"classes/AVLTree.html#getPredecessor\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"morris\",\"url\":\"classes/AVLTree.html#morris\",\"classes\":\"tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_addTo\",\"url\":\"classes/AVLTree.html#_addTo\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_setLoopType\",\"url\":\"classes/AVLTree.html#_setLoopType\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_setVisitedId\",\"url\":\"classes/AVLTree.html#_setVisitedId\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_setVisitedVal\",\"url\":\"classes/AVLTree.html#_setVisitedVal\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_setVisitedNode\",\"url\":\"classes/AVLTree.html#_setVisitedNode\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_setRoot\",\"url\":\"classes/AVLTree.html#_setRoot\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_setSize\",\"url\":\"classes/AVLTree.html#_setSize\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_clearResults\",\"url\":\"classes/AVLTree.html#_clearResults\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_pushByPropertyNameStopOrNot\",\"url\":\"classes/AVLTree.html#_pushByPropertyNameStopOrNot\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_accumulatedByPropertyName\",\"url\":\"classes/AVLTree.html#_accumulatedByPropertyName\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":2048,\"name\":\"_getResultByPropertyName\",\"url\":\"classes/AVLTree.html#_getResultByPropertyName\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"AVLTree\"},{\"kind\":128,\"name\":\"BTree\",\"url\":\"classes/BTree.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/BTree.html#constructor\",\"classes\":\"\",\"parent\":\"BTree\"},{\"kind\":128,\"name\":\"RBTreeNode\",\"url\":\"classes/RBTreeNode.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/RBTreeNode.html#constructor\",\"classes\":\"\",\"parent\":\"RBTreeNode\"},{\"kind\":1024,\"name\":\"_color\",\"url\":\"classes/RBTreeNode.html#_color\",\"classes\":\"tsd-is-private\",\"parent\":\"RBTreeNode\"},{\"kind\":262144,\"name\":\"color\",\"url\":\"classes/RBTreeNode.html#color\",\"classes\":\"\",\"parent\":\"RBTreeNode\"},{\"kind\":262144,\"name\":\"id\",\"url\":\"classes/RBTreeNode.html#id\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTreeNode\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/RBTreeNode.html#val\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTreeNode\"},{\"kind\":262144,\"name\":\"left\",\"url\":\"classes/RBTreeNode.html#left\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTreeNode\"},{\"kind\":262144,\"name\":\"right\",\"url\":\"classes/RBTreeNode.html#right\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTreeNode\"},{\"kind\":262144,\"name\":\"parent\",\"url\":\"classes/RBTreeNode.html#parent\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTreeNode\"},{\"kind\":262144,\"name\":\"height\",\"url\":\"classes/RBTreeNode.html#height\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTreeNode\"},{\"kind\":262144,\"name\":\"familyPosition\",\"url\":\"classes/RBTreeNode.html#familyPosition\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTreeNode\"},{\"kind\":128,\"name\":\"RBTree\",\"url\":\"classes/RBTree.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/RBTree.html#constructor\",\"classes\":\"\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"createNode\",\"url\":\"classes/RBTree.html#createNode\",\"classes\":\"\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/RBTree.html#add\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"addMany\",\"url\":\"classes/RBTree.html#addMany\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"classes/RBTree.html#get\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"lastKey\",\"url\":\"classes/RBTree.html#lastKey\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"getNodes\",\"url\":\"classes/RBTree.html#getNodes\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"lesserSum\",\"url\":\"classes/RBTree.html#lesserSum\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"allGreaterNodesAdd\",\"url\":\"classes/RBTree.html#allGreaterNodesAdd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"perfectlyBalance\",\"url\":\"classes/RBTree.html#perfectlyBalance\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"isAVLBalanced\",\"url\":\"classes/RBTree.html#isAVLBalanced\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":1024,\"name\":\"_comparator\",\"url\":\"classes/RBTree.html#_comparator\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"_compare\",\"url\":\"classes/RBTree.html#_compare\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":262144,\"name\":\"root\",\"url\":\"classes/RBTree.html#root\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/RBTree.html#size\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":262144,\"name\":\"loopType\",\"url\":\"classes/RBTree.html#loopType\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":262144,\"name\":\"visitedId\",\"url\":\"classes/RBTree.html#visitedId\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":262144,\"name\":\"visitedVal\",\"url\":\"classes/RBTree.html#visitedVal\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":262144,\"name\":\"visitedNode\",\"url\":\"classes/RBTree.html#visitedNode\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"swapLocation\",\"url\":\"classes/RBTree.html#swapLocation\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/RBTree.html#clear\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/RBTree.html#isEmpty\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"fill\",\"url\":\"classes/RBTree.html#fill\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"classes/RBTree.html#remove\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"getDepth\",\"url\":\"classes/RBTree.html#getDepth\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"getHeight\",\"url\":\"classes/RBTree.html#getHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"getMinHeight\",\"url\":\"classes/RBTree.html#getMinHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"isPerfectlyBalanced\",\"url\":\"classes/RBTree.html#isPerfectlyBalanced\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/RBTree.html#has\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"getPathToRoot\",\"url\":\"classes/RBTree.html#getPathToRoot\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"getLeftMost\",\"url\":\"classes/RBTree.html#getLeftMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"getRightMost\",\"url\":\"classes/RBTree.html#getRightMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"isSubtreeBST\",\"url\":\"classes/RBTree.html#isSubtreeBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"isBST\",\"url\":\"classes/RBTree.html#isBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"getSubTreeSize\",\"url\":\"classes/RBTree.html#getSubTreeSize\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"subTreeSum\",\"url\":\"classes/RBTree.html#subTreeSum\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"subTreeAdd\",\"url\":\"classes/RBTree.html#subTreeAdd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"BFS\",\"url\":\"classes/RBTree.html#BFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"DFS\",\"url\":\"classes/RBTree.html#DFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"DFSIterative\",\"url\":\"classes/RBTree.html#DFSIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"levelIterative\",\"url\":\"classes/RBTree.html#levelIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"listLevels\",\"url\":\"classes/RBTree.html#listLevels\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"getPredecessor\",\"url\":\"classes/RBTree.html#getPredecessor\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"morris\",\"url\":\"classes/RBTree.html#morris\",\"classes\":\"tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"_addTo\",\"url\":\"classes/RBTree.html#_addTo\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"_setLoopType\",\"url\":\"classes/RBTree.html#_setLoopType\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"_setVisitedId\",\"url\":\"classes/RBTree.html#_setVisitedId\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"_setVisitedVal\",\"url\":\"classes/RBTree.html#_setVisitedVal\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"_setVisitedNode\",\"url\":\"classes/RBTree.html#_setVisitedNode\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"_setRoot\",\"url\":\"classes/RBTree.html#_setRoot\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"_setSize\",\"url\":\"classes/RBTree.html#_setSize\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"_clearResults\",\"url\":\"classes/RBTree.html#_clearResults\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"_pushByPropertyNameStopOrNot\",\"url\":\"classes/RBTree.html#_pushByPropertyNameStopOrNot\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"_accumulatedByPropertyName\",\"url\":\"classes/RBTree.html#_accumulatedByPropertyName\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":2048,\"name\":\"_getResultByPropertyName\",\"url\":\"classes/RBTree.html#_getResultByPropertyName\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"RBTree\"},{\"kind\":128,\"name\":\"SplayTree\",\"url\":\"classes/SplayTree.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/SplayTree.html#constructor\",\"classes\":\"\",\"parent\":\"SplayTree\"},{\"kind\":128,\"name\":\"AaTree\",\"url\":\"classes/AaTree.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/AaTree.html#constructor\",\"classes\":\"\",\"parent\":\"AaTree\"},{\"kind\":128,\"name\":\"TreeMultisetNode\",\"url\":\"classes/TreeMultisetNode.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/TreeMultisetNode.html#constructor\",\"classes\":\"\",\"parent\":\"TreeMultisetNode\"},{\"kind\":1024,\"name\":\"_count\",\"url\":\"classes/TreeMultisetNode.html#_count\",\"classes\":\"tsd-is-private\",\"parent\":\"TreeMultisetNode\"},{\"kind\":262144,\"name\":\"count\",\"url\":\"classes/TreeMultisetNode.html#count\",\"classes\":\"\",\"parent\":\"TreeMultisetNode\"},{\"kind\":262144,\"name\":\"id\",\"url\":\"classes/TreeMultisetNode.html#id\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultisetNode\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/TreeMultisetNode.html#val\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultisetNode\"},{\"kind\":262144,\"name\":\"left\",\"url\":\"classes/TreeMultisetNode.html#left\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultisetNode\"},{\"kind\":262144,\"name\":\"right\",\"url\":\"classes/TreeMultisetNode.html#right\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultisetNode\"},{\"kind\":262144,\"name\":\"parent\",\"url\":\"classes/TreeMultisetNode.html#parent\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultisetNode\"},{\"kind\":262144,\"name\":\"height\",\"url\":\"classes/TreeMultisetNode.html#height\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultisetNode\"},{\"kind\":262144,\"name\":\"familyPosition\",\"url\":\"classes/TreeMultisetNode.html#familyPosition\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultisetNode\"},{\"kind\":128,\"name\":\"TreeMultiset\",\"url\":\"classes/TreeMultiset.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/TreeMultiset.html#constructor\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":1024,\"name\":\"_count\",\"url\":\"classes/TreeMultiset.html#_count\",\"classes\":\"tsd-is-private\",\"parent\":\"TreeMultiset\"},{\"kind\":262144,\"name\":\"count\",\"url\":\"classes/TreeMultiset.html#count\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"createNode\",\"url\":\"classes/TreeMultiset.html#createNode\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"swapLocation\",\"url\":\"classes/TreeMultiset.html#swapLocation\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/TreeMultiset.html#add\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_addTo\",\"url\":\"classes/TreeMultiset.html#_addTo\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"addMany\",\"url\":\"classes/TreeMultiset.html#addMany\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"perfectlyBalance\",\"url\":\"classes/TreeMultiset.html#perfectlyBalance\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"classes/TreeMultiset.html#remove\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"getSubTreeCount\",\"url\":\"classes/TreeMultiset.html#getSubTreeCount\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"subTreeSumCount\",\"url\":\"classes/TreeMultiset.html#subTreeSumCount\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"subTreeAddCount\",\"url\":\"classes/TreeMultiset.html#subTreeAddCount\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"getNodesByCount\",\"url\":\"classes/TreeMultiset.html#getNodesByCount\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"BFSCount\",\"url\":\"classes/TreeMultiset.html#BFSCount\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"listLevelsCount\",\"url\":\"classes/TreeMultiset.html#listLevelsCount\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"morrisCount\",\"url\":\"classes/TreeMultiset.html#morrisCount\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"DFSIterativeCount\",\"url\":\"classes/TreeMultiset.html#DFSIterativeCount\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"DFSCount\",\"url\":\"classes/TreeMultiset.html#DFSCount\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"lesserSumCount\",\"url\":\"classes/TreeMultiset.html#lesserSumCount\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"allGreaterNodesAddCount\",\"url\":\"classes/TreeMultiset.html#allGreaterNodesAddCount\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/TreeMultiset.html#clear\",\"classes\":\"\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_setCount\",\"url\":\"classes/TreeMultiset.html#_setCount\",\"classes\":\"tsd-is-protected\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_balanceFactor\",\"url\":\"classes/TreeMultiset.html#_balanceFactor\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_updateHeight\",\"url\":\"classes/TreeMultiset.html#_updateHeight\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_balancePath\",\"url\":\"classes/TreeMultiset.html#_balancePath\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_balanceLL\",\"url\":\"classes/TreeMultiset.html#_balanceLL\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_balanceLR\",\"url\":\"classes/TreeMultiset.html#_balanceLR\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_balanceRR\",\"url\":\"classes/TreeMultiset.html#_balanceRR\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_balanceRL\",\"url\":\"classes/TreeMultiset.html#_balanceRL\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"classes/TreeMultiset.html#get\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"lastKey\",\"url\":\"classes/TreeMultiset.html#lastKey\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"getNodes\",\"url\":\"classes/TreeMultiset.html#getNodes\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"lesserSum\",\"url\":\"classes/TreeMultiset.html#lesserSum\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"allGreaterNodesAdd\",\"url\":\"classes/TreeMultiset.html#allGreaterNodesAdd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"isAVLBalanced\",\"url\":\"classes/TreeMultiset.html#isAVLBalanced\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":1024,\"name\":\"_comparator\",\"url\":\"classes/TreeMultiset.html#_comparator\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_compare\",\"url\":\"classes/TreeMultiset.html#_compare\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":262144,\"name\":\"root\",\"url\":\"classes/TreeMultiset.html#root\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/TreeMultiset.html#size\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":262144,\"name\":\"loopType\",\"url\":\"classes/TreeMultiset.html#loopType\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":262144,\"name\":\"visitedId\",\"url\":\"classes/TreeMultiset.html#visitedId\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":262144,\"name\":\"visitedVal\",\"url\":\"classes/TreeMultiset.html#visitedVal\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":262144,\"name\":\"visitedNode\",\"url\":\"classes/TreeMultiset.html#visitedNode\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/TreeMultiset.html#isEmpty\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"fill\",\"url\":\"classes/TreeMultiset.html#fill\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"getDepth\",\"url\":\"classes/TreeMultiset.html#getDepth\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"getHeight\",\"url\":\"classes/TreeMultiset.html#getHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"getMinHeight\",\"url\":\"classes/TreeMultiset.html#getMinHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"isPerfectlyBalanced\",\"url\":\"classes/TreeMultiset.html#isPerfectlyBalanced\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/TreeMultiset.html#has\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"getPathToRoot\",\"url\":\"classes/TreeMultiset.html#getPathToRoot\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"getLeftMost\",\"url\":\"classes/TreeMultiset.html#getLeftMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"getRightMost\",\"url\":\"classes/TreeMultiset.html#getRightMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"isSubtreeBST\",\"url\":\"classes/TreeMultiset.html#isSubtreeBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"isBST\",\"url\":\"classes/TreeMultiset.html#isBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"getSubTreeSize\",\"url\":\"classes/TreeMultiset.html#getSubTreeSize\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"subTreeSum\",\"url\":\"classes/TreeMultiset.html#subTreeSum\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"subTreeAdd\",\"url\":\"classes/TreeMultiset.html#subTreeAdd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"BFS\",\"url\":\"classes/TreeMultiset.html#BFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"DFS\",\"url\":\"classes/TreeMultiset.html#DFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"DFSIterative\",\"url\":\"classes/TreeMultiset.html#DFSIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"levelIterative\",\"url\":\"classes/TreeMultiset.html#levelIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"listLevels\",\"url\":\"classes/TreeMultiset.html#listLevels\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"getPredecessor\",\"url\":\"classes/TreeMultiset.html#getPredecessor\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"morris\",\"url\":\"classes/TreeMultiset.html#morris\",\"classes\":\"tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_setLoopType\",\"url\":\"classes/TreeMultiset.html#_setLoopType\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_setVisitedId\",\"url\":\"classes/TreeMultiset.html#_setVisitedId\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_setVisitedVal\",\"url\":\"classes/TreeMultiset.html#_setVisitedVal\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_setVisitedNode\",\"url\":\"classes/TreeMultiset.html#_setVisitedNode\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_setRoot\",\"url\":\"classes/TreeMultiset.html#_setRoot\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_setSize\",\"url\":\"classes/TreeMultiset.html#_setSize\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_clearResults\",\"url\":\"classes/TreeMultiset.html#_clearResults\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_pushByPropertyNameStopOrNot\",\"url\":\"classes/TreeMultiset.html#_pushByPropertyNameStopOrNot\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_accumulatedByPropertyName\",\"url\":\"classes/TreeMultiset.html#_accumulatedByPropertyName\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":2048,\"name\":\"_getResultByPropertyName\",\"url\":\"classes/TreeMultiset.html#_getResultByPropertyName\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"TreeMultiset\"},{\"kind\":128,\"name\":\"TwoThreeTree\",\"url\":\"classes/TwoThreeTree.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/TwoThreeTree.html#constructor\",\"classes\":\"\",\"parent\":\"TwoThreeTree\"},{\"kind\":128,\"name\":\"TreeNode\",\"url\":\"classes/TreeNode.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/TreeNode.html#constructor\",\"classes\":\"\",\"parent\":\"TreeNode\"},{\"kind\":1024,\"name\":\"_id\",\"url\":\"classes/TreeNode.html#_id\",\"classes\":\"tsd-is-private\",\"parent\":\"TreeNode\"},{\"kind\":262144,\"name\":\"id\",\"url\":\"classes/TreeNode.html#id\",\"classes\":\"\",\"parent\":\"TreeNode\"},{\"kind\":1024,\"name\":\"_value\",\"url\":\"classes/TreeNode.html#_value\",\"classes\":\"tsd-is-private\",\"parent\":\"TreeNode\"},{\"kind\":262144,\"name\":\"value\",\"url\":\"classes/TreeNode.html#value\",\"classes\":\"\",\"parent\":\"TreeNode\"},{\"kind\":1024,\"name\":\"_children\",\"url\":\"classes/TreeNode.html#_children\",\"classes\":\"tsd-is-private\",\"parent\":\"TreeNode\"},{\"kind\":262144,\"name\":\"children\",\"url\":\"classes/TreeNode.html#children\",\"classes\":\"\",\"parent\":\"TreeNode\"},{\"kind\":2048,\"name\":\"addChildren\",\"url\":\"classes/TreeNode.html#addChildren\",\"classes\":\"\",\"parent\":\"TreeNode\"},{\"kind\":2048,\"name\":\"getHeight\",\"url\":\"classes/TreeNode.html#getHeight\",\"classes\":\"\",\"parent\":\"TreeNode\"},{\"kind\":128,\"name\":\"MaxHeap\",\"url\":\"classes/MaxHeap.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/MaxHeap.html#constructor\",\"classes\":\"\",\"parent\":\"MaxHeap\"},{\"kind\":1024,\"name\":\"_pq\",\"url\":\"classes/MaxHeap.html#_pq\",\"classes\":\"tsd-is-protected\",\"parent\":\"MaxHeap\"},{\"kind\":262144,\"name\":\"pq\",\"url\":\"classes/MaxHeap.html#pq\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxHeap\"},{\"kind\":1024,\"name\":\"_priorityExtractor\",\"url\":\"classes/MaxHeap.html#_priorityExtractor\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MaxHeap\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/MaxHeap.html#_priorityExtractor.__type\",\"classes\":\"\",\"parent\":\"MaxHeap._priorityExtractor\"},{\"kind\":262144,\"name\":\"priorityExtractor\",\"url\":\"classes/MaxHeap.html#priorityExtractor\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxHeap\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/MaxHeap.html#priorityExtractor.priorityExtractor-1.__type-2\",\"classes\":\"\",\"parent\":\"MaxHeap.priorityExtractor.priorityExtractor\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/MaxHeap.html#size\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxHeap\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/MaxHeap.html#isEmpty\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxHeap\"},{\"kind\":2048,\"name\":\"peek\",\"url\":\"classes/MaxHeap.html#peek\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxHeap\"},{\"kind\":2048,\"name\":\"peekLast\",\"url\":\"classes/MaxHeap.html#peekLast\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxHeap\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/MaxHeap.html#add\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxHeap\"},{\"kind\":2048,\"name\":\"poll\",\"url\":\"classes/MaxHeap.html#poll\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxHeap\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/MaxHeap.html#has\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxHeap\"},{\"kind\":2048,\"name\":\"toArray\",\"url\":\"classes/MaxHeap.html#toArray\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxHeap\"},{\"kind\":2048,\"name\":\"sort\",\"url\":\"classes/MaxHeap.html#sort\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxHeap\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/MaxHeap.html#clear\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxHeap\"},{\"kind\":128,\"name\":\"MinHeap\",\"url\":\"classes/MinHeap.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/MinHeap.html#constructor\",\"classes\":\"\",\"parent\":\"MinHeap\"},{\"kind\":1024,\"name\":\"_pq\",\"url\":\"classes/MinHeap.html#_pq\",\"classes\":\"tsd-is-protected\",\"parent\":\"MinHeap\"},{\"kind\":262144,\"name\":\"pq\",\"url\":\"classes/MinHeap.html#pq\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinHeap\"},{\"kind\":1024,\"name\":\"_priorityExtractor\",\"url\":\"classes/MinHeap.html#_priorityExtractor\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MinHeap\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/MinHeap.html#_priorityExtractor.__type\",\"classes\":\"\",\"parent\":\"MinHeap._priorityExtractor\"},{\"kind\":262144,\"name\":\"priorityExtractor\",\"url\":\"classes/MinHeap.html#priorityExtractor\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinHeap\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/MinHeap.html#priorityExtractor.priorityExtractor-1.__type-2\",\"classes\":\"\",\"parent\":\"MinHeap.priorityExtractor.priorityExtractor\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/MinHeap.html#size\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinHeap\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/MinHeap.html#isEmpty\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinHeap\"},{\"kind\":2048,\"name\":\"peek\",\"url\":\"classes/MinHeap.html#peek\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinHeap\"},{\"kind\":2048,\"name\":\"peekLast\",\"url\":\"classes/MinHeap.html#peekLast\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinHeap\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/MinHeap.html#add\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinHeap\"},{\"kind\":2048,\"name\":\"poll\",\"url\":\"classes/MinHeap.html#poll\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinHeap\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/MinHeap.html#has\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinHeap\"},{\"kind\":2048,\"name\":\"toArray\",\"url\":\"classes/MinHeap.html#toArray\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinHeap\"},{\"kind\":2048,\"name\":\"sort\",\"url\":\"classes/MinHeap.html#sort\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinHeap\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/MinHeap.html#clear\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinHeap\"},{\"kind\":128,\"name\":\"HeapItem\",\"url\":\"classes/HeapItem.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/HeapItem.html#constructor\",\"classes\":\"\",\"parent\":\"HeapItem\"},{\"kind\":1024,\"name\":\"_priority\",\"url\":\"classes/HeapItem.html#_priority\",\"classes\":\"tsd-is-private\",\"parent\":\"HeapItem\"},{\"kind\":262144,\"name\":\"priority\",\"url\":\"classes/HeapItem.html#priority\",\"classes\":\"\",\"parent\":\"HeapItem\"},{\"kind\":1024,\"name\":\"_val\",\"url\":\"classes/HeapItem.html#_val\",\"classes\":\"tsd-is-private\",\"parent\":\"HeapItem\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/HeapItem.html#val\",\"classes\":\"\",\"parent\":\"HeapItem\"},{\"kind\":128,\"name\":\"Heap\",\"url\":\"classes/Heap.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/Heap.html#constructor\",\"classes\":\"tsd-is-protected\",\"parent\":\"Heap\"},{\"kind\":1024,\"name\":\"_pq\",\"url\":\"classes/Heap.html#_pq\",\"classes\":\"tsd-is-protected\",\"parent\":\"Heap\"},{\"kind\":262144,\"name\":\"pq\",\"url\":\"classes/Heap.html#pq\",\"classes\":\"\",\"parent\":\"Heap\"},{\"kind\":1024,\"name\":\"_priorityExtractor\",\"url\":\"classes/Heap.html#_priorityExtractor\",\"classes\":\"tsd-is-protected\",\"parent\":\"Heap\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/Heap.html#_priorityExtractor.__type\",\"classes\":\"\",\"parent\":\"Heap._priorityExtractor\"},{\"kind\":262144,\"name\":\"priorityExtractor\",\"url\":\"classes/Heap.html#priorityExtractor\",\"classes\":\"\",\"parent\":\"Heap\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/Heap.html#priorityExtractor.priorityExtractor-1.__type-2\",\"classes\":\"\",\"parent\":\"Heap.priorityExtractor.priorityExtractor\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/Heap.html#size\",\"classes\":\"\",\"parent\":\"Heap\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/Heap.html#isEmpty\",\"classes\":\"\",\"parent\":\"Heap\"},{\"kind\":2048,\"name\":\"peek\",\"url\":\"classes/Heap.html#peek\",\"classes\":\"\",\"parent\":\"Heap\"},{\"kind\":2048,\"name\":\"peekLast\",\"url\":\"classes/Heap.html#peekLast\",\"classes\":\"\",\"parent\":\"Heap\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/Heap.html#add\",\"classes\":\"\",\"parent\":\"Heap\"},{\"kind\":2048,\"name\":\"poll\",\"url\":\"classes/Heap.html#poll\",\"classes\":\"\",\"parent\":\"Heap\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/Heap.html#has\",\"classes\":\"\",\"parent\":\"Heap\"},{\"kind\":2048,\"name\":\"toArray\",\"url\":\"classes/Heap.html#toArray\",\"classes\":\"\",\"parent\":\"Heap\"},{\"kind\":2048,\"name\":\"sort\",\"url\":\"classes/Heap.html#sort\",\"classes\":\"\",\"parent\":\"Heap\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/Heap.html#clear\",\"classes\":\"\",\"parent\":\"Heap\"},{\"kind\":128,\"name\":\"PriorityQueue\",\"url\":\"classes/PriorityQueue.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"heapify\",\"url\":\"classes/PriorityQueue.html#heapify\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"isPriorityQueueified\",\"url\":\"classes/PriorityQueue.html#isPriorityQueueified\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/PriorityQueue.html#constructor\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":1024,\"name\":\"_nodes\",\"url\":\"classes/PriorityQueue.html#_nodes\",\"classes\":\"tsd-is-protected\",\"parent\":\"PriorityQueue\"},{\"kind\":262144,\"name\":\"nodes\",\"url\":\"classes/PriorityQueue.html#nodes\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/PriorityQueue.html#size\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"getNodes\",\"url\":\"classes/PriorityQueue.html#getNodes\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/PriorityQueue.html#add\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/PriorityQueue.html#has\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"peek\",\"url\":\"classes/PriorityQueue.html#peek\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"poll\",\"url\":\"classes/PriorityQueue.html#poll\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"leaf\",\"url\":\"classes/PriorityQueue.html#leaf\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/PriorityQueue.html#isEmpty\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/PriorityQueue.html#clear\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"toArray\",\"url\":\"classes/PriorityQueue.html#toArray\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"clone\",\"url\":\"classes/PriorityQueue.html#clone\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"isValid\",\"url\":\"classes/PriorityQueue.html#isValid\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"sort\",\"url\":\"classes/PriorityQueue.html#sort\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"DFS\",\"url\":\"classes/PriorityQueue.html#DFS\",\"classes\":\"\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"_setNodes\",\"url\":\"classes/PriorityQueue.html#_setNodes\",\"classes\":\"tsd-is-protected\",\"parent\":\"PriorityQueue\"},{\"kind\":1024,\"name\":\"_comparator\",\"url\":\"classes/PriorityQueue.html#_comparator\",\"classes\":\"tsd-is-protected\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"_compare\",\"url\":\"classes/PriorityQueue.html#_compare\",\"classes\":\"tsd-is-protected\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"_swap\",\"url\":\"classes/PriorityQueue.html#_swap\",\"classes\":\"tsd-is-protected\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"_isValidIndex\",\"url\":\"classes/PriorityQueue.html#_isValidIndex\",\"classes\":\"tsd-is-protected\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"_getParent\",\"url\":\"classes/PriorityQueue.html#_getParent\",\"classes\":\"tsd-is-protected\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"_getLeft\",\"url\":\"classes/PriorityQueue.html#_getLeft\",\"classes\":\"tsd-is-protected\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"_getRight\",\"url\":\"classes/PriorityQueue.html#_getRight\",\"classes\":\"tsd-is-protected\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"_getComparedChild\",\"url\":\"classes/PriorityQueue.html#_getComparedChild\",\"classes\":\"tsd-is-protected\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"_heapifyUp\",\"url\":\"classes/PriorityQueue.html#_heapifyUp\",\"classes\":\"tsd-is-protected\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"_heapifyDown\",\"url\":\"classes/PriorityQueue.html#_heapifyDown\",\"classes\":\"tsd-is-protected\",\"parent\":\"PriorityQueue\"},{\"kind\":2048,\"name\":\"_fix\",\"url\":\"classes/PriorityQueue.html#_fix\",\"classes\":\"tsd-is-protected\",\"parent\":\"PriorityQueue\"},{\"kind\":128,\"name\":\"MinPriorityQueue\",\"url\":\"classes/MinPriorityQueue.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"heapify\",\"url\":\"classes/MinPriorityQueue.html#heapify\",\"classes\":\"\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"isPriorityQueueified\",\"url\":\"classes/MinPriorityQueue.html#isPriorityQueueified\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/MinPriorityQueue.html#constructor\",\"classes\":\"\",\"parent\":\"MinPriorityQueue\"},{\"kind\":1024,\"name\":\"_nodes\",\"url\":\"classes/MinPriorityQueue.html#_nodes\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":262144,\"name\":\"nodes\",\"url\":\"classes/MinPriorityQueue.html#nodes\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/MinPriorityQueue.html#size\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"getNodes\",\"url\":\"classes/MinPriorityQueue.html#getNodes\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/MinPriorityQueue.html#add\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/MinPriorityQueue.html#has\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"peek\",\"url\":\"classes/MinPriorityQueue.html#peek\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"poll\",\"url\":\"classes/MinPriorityQueue.html#poll\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"leaf\",\"url\":\"classes/MinPriorityQueue.html#leaf\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/MinPriorityQueue.html#isEmpty\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/MinPriorityQueue.html#clear\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"toArray\",\"url\":\"classes/MinPriorityQueue.html#toArray\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"clone\",\"url\":\"classes/MinPriorityQueue.html#clone\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"isValid\",\"url\":\"classes/MinPriorityQueue.html#isValid\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"sort\",\"url\":\"classes/MinPriorityQueue.html#sort\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"DFS\",\"url\":\"classes/MinPriorityQueue.html#DFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"_setNodes\",\"url\":\"classes/MinPriorityQueue.html#_setNodes\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":1024,\"name\":\"_comparator\",\"url\":\"classes/MinPriorityQueue.html#_comparator\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"_compare\",\"url\":\"classes/MinPriorityQueue.html#_compare\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"_swap\",\"url\":\"classes/MinPriorityQueue.html#_swap\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"_isValidIndex\",\"url\":\"classes/MinPriorityQueue.html#_isValidIndex\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"_getParent\",\"url\":\"classes/MinPriorityQueue.html#_getParent\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"_getLeft\",\"url\":\"classes/MinPriorityQueue.html#_getLeft\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"_getRight\",\"url\":\"classes/MinPriorityQueue.html#_getRight\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"_getComparedChild\",\"url\":\"classes/MinPriorityQueue.html#_getComparedChild\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"_heapifyUp\",\"url\":\"classes/MinPriorityQueue.html#_heapifyUp\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"_heapifyDown\",\"url\":\"classes/MinPriorityQueue.html#_heapifyDown\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":2048,\"name\":\"_fix\",\"url\":\"classes/MinPriorityQueue.html#_fix\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MinPriorityQueue\"},{\"kind\":128,\"name\":\"MaxPriorityQueue\",\"url\":\"classes/MaxPriorityQueue.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"heapify\",\"url\":\"classes/MaxPriorityQueue.html#heapify\",\"classes\":\"\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"isPriorityQueueified\",\"url\":\"classes/MaxPriorityQueue.html#isPriorityQueueified\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/MaxPriorityQueue.html#constructor\",\"classes\":\"\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":1024,\"name\":\"_nodes\",\"url\":\"classes/MaxPriorityQueue.html#_nodes\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":262144,\"name\":\"nodes\",\"url\":\"classes/MaxPriorityQueue.html#nodes\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"classes/MaxPriorityQueue.html#size\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"getNodes\",\"url\":\"classes/MaxPriorityQueue.html#getNodes\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/MaxPriorityQueue.html#add\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/MaxPriorityQueue.html#has\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"peek\",\"url\":\"classes/MaxPriorityQueue.html#peek\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"poll\",\"url\":\"classes/MaxPriorityQueue.html#poll\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"leaf\",\"url\":\"classes/MaxPriorityQueue.html#leaf\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"classes/MaxPriorityQueue.html#isEmpty\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"classes/MaxPriorityQueue.html#clear\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"toArray\",\"url\":\"classes/MaxPriorityQueue.html#toArray\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"clone\",\"url\":\"classes/MaxPriorityQueue.html#clone\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"isValid\",\"url\":\"classes/MaxPriorityQueue.html#isValid\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"sort\",\"url\":\"classes/MaxPriorityQueue.html#sort\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"DFS\",\"url\":\"classes/MaxPriorityQueue.html#DFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"_setNodes\",\"url\":\"classes/MaxPriorityQueue.html#_setNodes\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":1024,\"name\":\"_comparator\",\"url\":\"classes/MaxPriorityQueue.html#_comparator\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"_compare\",\"url\":\"classes/MaxPriorityQueue.html#_compare\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"_swap\",\"url\":\"classes/MaxPriorityQueue.html#_swap\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"_isValidIndex\",\"url\":\"classes/MaxPriorityQueue.html#_isValidIndex\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"_getParent\",\"url\":\"classes/MaxPriorityQueue.html#_getParent\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"_getLeft\",\"url\":\"classes/MaxPriorityQueue.html#_getLeft\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"_getRight\",\"url\":\"classes/MaxPriorityQueue.html#_getRight\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"_getComparedChild\",\"url\":\"classes/MaxPriorityQueue.html#_getComparedChild\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"_heapifyUp\",\"url\":\"classes/MaxPriorityQueue.html#_heapifyUp\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"_heapifyDown\",\"url\":\"classes/MaxPriorityQueue.html#_heapifyDown\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":2048,\"name\":\"_fix\",\"url\":\"classes/MaxPriorityQueue.html#_fix\",\"classes\":\"tsd-is-protected tsd-is-inherited\",\"parent\":\"MaxPriorityQueue\"},{\"kind\":128,\"name\":\"MatrixNTI2D\",\"url\":\"classes/MatrixNTI2D.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/MatrixNTI2D.html#constructor\",\"classes\":\"\",\"parent\":\"MatrixNTI2D\"},{\"kind\":1024,\"name\":\"_matrix\",\"url\":\"classes/MatrixNTI2D.html#_matrix\",\"classes\":\"tsd-is-private\",\"parent\":\"MatrixNTI2D\"},{\"kind\":2048,\"name\":\"toArray\",\"url\":\"classes/MatrixNTI2D.html#toArray\",\"classes\":\"\",\"parent\":\"MatrixNTI2D\"},{\"kind\":128,\"name\":\"Vector2D\",\"url\":\"classes/Vector2D.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/Vector2D.html#add\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"subtract\",\"url\":\"classes/Vector2D.html#subtract\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"subtractValue\",\"url\":\"classes/Vector2D.html#subtractValue\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"multiply\",\"url\":\"classes/Vector2D.html#multiply\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"divide\",\"url\":\"classes/Vector2D.html#divide\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"equals\",\"url\":\"classes/Vector2D.html#equals\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"equalsRounded\",\"url\":\"classes/Vector2D.html#equalsRounded\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"normalize\",\"url\":\"classes/Vector2D.html#normalize\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"truncate\",\"url\":\"classes/Vector2D.html#truncate\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"perp\",\"url\":\"classes/Vector2D.html#perp\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"reverse\",\"url\":\"classes/Vector2D.html#reverse\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"abs\",\"url\":\"classes/Vector2D.html#abs\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"dot\",\"url\":\"classes/Vector2D.html#dot\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"distance\",\"url\":\"classes/Vector2D.html#distance\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"distanceSq\",\"url\":\"classes/Vector2D.html#distanceSq\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"sign\",\"url\":\"classes/Vector2D.html#sign\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"angle\",\"url\":\"classes/Vector2D.html#angle\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"random\",\"url\":\"classes/Vector2D.html#random\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/Vector2D.html#constructor\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":1024,\"name\":\"x\",\"url\":\"classes/Vector2D.html#x\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":1024,\"name\":\"y\",\"url\":\"classes/Vector2D.html#y\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":1024,\"name\":\"w\",\"url\":\"classes/Vector2D.html#w\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":262144,\"name\":\"isZero\",\"url\":\"classes/Vector2D.html#isZero\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":262144,\"name\":\"length\",\"url\":\"classes/Vector2D.html#length\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":262144,\"name\":\"lengthSq\",\"url\":\"classes/Vector2D.html#lengthSq\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":262144,\"name\":\"rounded\",\"url\":\"classes/Vector2D.html#rounded\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":2048,\"name\":\"zero\",\"url\":\"classes/Vector2D.html#zero\",\"classes\":\"\",\"parent\":\"Vector2D\"},{\"kind\":128,\"name\":\"Matrix2D\",\"url\":\"classes/Matrix2D.html\",\"classes\":\"\"},{\"kind\":262144,\"name\":\"empty\",\"url\":\"classes/Matrix2D.html#empty\",\"classes\":\"\",\"parent\":\"Matrix2D\"},{\"kind\":262144,\"name\":\"identity\",\"url\":\"classes/Matrix2D.html#identity\",\"classes\":\"\",\"parent\":\"Matrix2D\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/Matrix2D.html#add\",\"classes\":\"\",\"parent\":\"Matrix2D\"},{\"kind\":2048,\"name\":\"subtract\",\"url\":\"classes/Matrix2D.html#subtract\",\"classes\":\"\",\"parent\":\"Matrix2D\"},{\"kind\":2048,\"name\":\"multiply\",\"url\":\"classes/Matrix2D.html#multiply\",\"classes\":\"\",\"parent\":\"Matrix2D\"},{\"kind\":2048,\"name\":\"multiplyByValue\",\"url\":\"classes/Matrix2D.html#multiplyByValue\",\"classes\":\"\",\"parent\":\"Matrix2D\"},{\"kind\":2048,\"name\":\"multiplyByVector\",\"url\":\"classes/Matrix2D.html#multiplyByVector\",\"classes\":\"\",\"parent\":\"Matrix2D\"},{\"kind\":2048,\"name\":\"view\",\"url\":\"classes/Matrix2D.html#view\",\"classes\":\"\",\"parent\":\"Matrix2D\"},{\"kind\":2048,\"name\":\"scale\",\"url\":\"classes/Matrix2D.html#scale\",\"classes\":\"\",\"parent\":\"Matrix2D\"},{\"kind\":2048,\"name\":\"rotate\",\"url\":\"classes/Matrix2D.html#rotate\",\"classes\":\"\",\"parent\":\"Matrix2D\"},{\"kind\":2048,\"name\":\"translate\",\"url\":\"classes/Matrix2D.html#translate\",\"classes\":\"\",\"parent\":\"Matrix2D\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/Matrix2D.html#constructor\",\"classes\":\"\",\"parent\":\"Matrix2D\"},{\"kind\":1024,\"name\":\"_matrix\",\"url\":\"classes/Matrix2D.html#_matrix\",\"classes\":\"tsd-is-private\",\"parent\":\"Matrix2D\"},{\"kind\":262144,\"name\":\"m\",\"url\":\"classes/Matrix2D.html#m\",\"classes\":\"\",\"parent\":\"Matrix2D\"},{\"kind\":2048,\"name\":\"toVector\",\"url\":\"classes/Matrix2D.html#toVector\",\"classes\":\"\",\"parent\":\"Matrix2D\"},{\"kind\":128,\"name\":\"Character\",\"url\":\"classes/Character.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/Character.html#constructor\",\"classes\":\"\",\"parent\":\"Character\"},{\"kind\":1024,\"name\":\"direction\",\"url\":\"classes/Character.html#direction\",\"classes\":\"\",\"parent\":\"Character\"},{\"kind\":1024,\"name\":\"turn\",\"url\":\"classes/Character.html#turn\",\"classes\":\"\",\"parent\":\"Character\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/Character.html#turn.__type\",\"classes\":\"\",\"parent\":\"Character.turn\"},{\"kind\":128,\"name\":\"Navigator\",\"url\":\"classes/Navigator.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/Navigator.html#constructor\",\"classes\":\"\",\"parent\":\"Navigator\"},{\"kind\":1024,\"name\":\"onMove\",\"url\":\"classes/Navigator.html#onMove\",\"classes\":\"\",\"parent\":\"Navigator\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"classes/Navigator.html#onMove.__type\",\"classes\":\"\",\"parent\":\"Navigator.onMove\"},{\"kind\":1024,\"name\":\"_matrix\",\"url\":\"classes/Navigator.html#_matrix\",\"classes\":\"tsd-is-private\",\"parent\":\"Navigator\"},{\"kind\":1024,\"name\":\"_cur\",\"url\":\"classes/Navigator.html#_cur\",\"classes\":\"tsd-is-private\",\"parent\":\"Navigator\"},{\"kind\":1024,\"name\":\"_character\",\"url\":\"classes/Navigator.html#_character\",\"classes\":\"tsd-is-private\",\"parent\":\"Navigator\"},{\"kind\":1024,\"name\":\"_VISITED\",\"url\":\"classes/Navigator.html#_VISITED\",\"classes\":\"tsd-is-private\",\"parent\":\"Navigator\"},{\"kind\":2048,\"name\":\"start\",\"url\":\"classes/Navigator.html#start\",\"classes\":\"\",\"parent\":\"Navigator\"},{\"kind\":2048,\"name\":\"check\",\"url\":\"classes/Navigator.html#check\",\"classes\":\"\",\"parent\":\"Navigator\"},{\"kind\":2048,\"name\":\"move\",\"url\":\"classes/Navigator.html#move\",\"classes\":\"\",\"parent\":\"Navigator\"},{\"kind\":128,\"name\":\"TrieNode\",\"url\":\"classes/TrieNode.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/TrieNode.html#constructor\",\"classes\":\"\",\"parent\":\"TrieNode\"},{\"kind\":1024,\"name\":\"_val\",\"url\":\"classes/TrieNode.html#_val\",\"classes\":\"tsd-is-private\",\"parent\":\"TrieNode\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"classes/TrieNode.html#val\",\"classes\":\"\",\"parent\":\"TrieNode\"},{\"kind\":1024,\"name\":\"_children\",\"url\":\"classes/TrieNode.html#_children\",\"classes\":\"tsd-is-protected\",\"parent\":\"TrieNode\"},{\"kind\":262144,\"name\":\"children\",\"url\":\"classes/TrieNode.html#children\",\"classes\":\"\",\"parent\":\"TrieNode\"},{\"kind\":1024,\"name\":\"_isEnd\",\"url\":\"classes/TrieNode.html#_isEnd\",\"classes\":\"tsd-is-protected\",\"parent\":\"TrieNode\"},{\"kind\":262144,\"name\":\"isEnd\",\"url\":\"classes/TrieNode.html#isEnd\",\"classes\":\"\",\"parent\":\"TrieNode\"},{\"kind\":128,\"name\":\"Trie\",\"url\":\"classes/Trie.html\",\"classes\":\"\"},{\"kind\":512,\"name\":\"constructor\",\"url\":\"classes/Trie.html#constructor\",\"classes\":\"\",\"parent\":\"Trie\"},{\"kind\":1024,\"name\":\"_root\",\"url\":\"classes/Trie.html#_root\",\"classes\":\"tsd-is-protected\",\"parent\":\"Trie\"},{\"kind\":262144,\"name\":\"root\",\"url\":\"classes/Trie.html#root\",\"classes\":\"\",\"parent\":\"Trie\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"classes/Trie.html#add\",\"classes\":\"\",\"parent\":\"Trie\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"classes/Trie.html#has\",\"classes\":\"\",\"parent\":\"Trie\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"classes/Trie.html#remove\",\"classes\":\"\",\"parent\":\"Trie\"},{\"kind\":2048,\"name\":\"isAbsPrefix\",\"url\":\"classes/Trie.html#isAbsPrefix\",\"classes\":\"\",\"parent\":\"Trie\"},{\"kind\":2048,\"name\":\"isPrefix\",\"url\":\"classes/Trie.html#isPrefix\",\"classes\":\"\",\"parent\":\"Trie\"},{\"kind\":2048,\"name\":\"isCommonPrefix\",\"url\":\"classes/Trie.html#isCommonPrefix\",\"classes\":\"\",\"parent\":\"Trie\"},{\"kind\":2048,\"name\":\"getLongestCommonPrefix\",\"url\":\"classes/Trie.html#getLongestCommonPrefix\",\"classes\":\"\",\"parent\":\"Trie\"},{\"kind\":2048,\"name\":\"getAll\",\"url\":\"classes/Trie.html#getAll\",\"classes\":\"\",\"parent\":\"Trie\"},{\"kind\":64,\"name\":\"uuidV4\",\"url\":\"functions/uuidV4.html\",\"classes\":\"\"},{\"kind\":64,\"name\":\"arrayRemove\",\"url\":\"functions/arrayRemove.html\",\"classes\":\"\"},{\"kind\":32,\"name\":\"THUNK_SYMBOL\",\"url\":\"variables/THUNK_SYMBOL.html\",\"classes\":\"\"},{\"kind\":64,\"name\":\"isThunk\",\"url\":\"functions/isThunk.html\",\"classes\":\"\"},{\"kind\":64,\"name\":\"toThunk\",\"url\":\"functions/toThunk.html\",\"classes\":\"\"},{\"kind\":64,\"name\":\"trampoline\",\"url\":\"functions/trampoline.html\",\"classes\":\"\"},{\"kind\":64,\"name\":\"trampolineAsync\",\"url\":\"functions/trampolineAsync.html\",\"classes\":\"\"},{\"kind\":256,\"name\":\"IAbstractBinaryTreeNode\",\"url\":\"interfaces/IAbstractBinaryTreeNode.html\",\"classes\":\"\"},{\"kind\":262144,\"name\":\"id\",\"url\":\"interfaces/IAbstractBinaryTreeNode.html#id\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTreeNode\"},{\"kind\":262144,\"name\":\"val\",\"url\":\"interfaces/IAbstractBinaryTreeNode.html#val\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTreeNode\"},{\"kind\":262144,\"name\":\"left\",\"url\":\"interfaces/IAbstractBinaryTreeNode.html#left\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTreeNode\"},{\"kind\":262144,\"name\":\"right\",\"url\":\"interfaces/IAbstractBinaryTreeNode.html#right\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTreeNode\"},{\"kind\":262144,\"name\":\"parent\",\"url\":\"interfaces/IAbstractBinaryTreeNode.html#parent\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTreeNode\"},{\"kind\":262144,\"name\":\"familyPosition\",\"url\":\"interfaces/IAbstractBinaryTreeNode.html#familyPosition\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTreeNode\"},{\"kind\":262144,\"name\":\"height\",\"url\":\"interfaces/IAbstractBinaryTreeNode.html#height\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTreeNode\"},{\"kind\":256,\"name\":\"IAbstractBinaryTree\",\"url\":\"interfaces/IAbstractBinaryTree.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"createNode\",\"url\":\"interfaces/IAbstractBinaryTree.html#createNode\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":262144,\"name\":\"loopType\",\"url\":\"interfaces/IAbstractBinaryTree.html#loopType\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":262144,\"name\":\"visitedId\",\"url\":\"interfaces/IAbstractBinaryTree.html#visitedId\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":262144,\"name\":\"visitedVal\",\"url\":\"interfaces/IAbstractBinaryTree.html#visitedVal\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":262144,\"name\":\"visitedNode\",\"url\":\"interfaces/IAbstractBinaryTree.html#visitedNode\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":262144,\"name\":\"root\",\"url\":\"interfaces/IAbstractBinaryTree.html#root\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"interfaces/IAbstractBinaryTree.html#size\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"swapLocation\",\"url\":\"interfaces/IAbstractBinaryTree.html#swapLocation\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"interfaces/IAbstractBinaryTree.html#clear\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"interfaces/IAbstractBinaryTree.html#isEmpty\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"interfaces/IAbstractBinaryTree.html#add\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"addMany\",\"url\":\"interfaces/IAbstractBinaryTree.html#addMany\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"fill\",\"url\":\"interfaces/IAbstractBinaryTree.html#fill\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"interfaces/IAbstractBinaryTree.html#remove\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getDepth\",\"url\":\"interfaces/IAbstractBinaryTree.html#getDepth\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getHeight\",\"url\":\"interfaces/IAbstractBinaryTree.html#getHeight\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getMinHeight\",\"url\":\"interfaces/IAbstractBinaryTree.html#getMinHeight\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"isPerfectlyBalanced\",\"url\":\"interfaces/IAbstractBinaryTree.html#isPerfectlyBalanced\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getNodes\",\"url\":\"interfaces/IAbstractBinaryTree.html#getNodes\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"interfaces/IAbstractBinaryTree.html#has\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"interfaces/IAbstractBinaryTree.html#get\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getPathToRoot\",\"url\":\"interfaces/IAbstractBinaryTree.html#getPathToRoot\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getLeftMost\",\"url\":\"interfaces/IAbstractBinaryTree.html#getLeftMost\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getRightMost\",\"url\":\"interfaces/IAbstractBinaryTree.html#getRightMost\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"isSubtreeBST\",\"url\":\"interfaces/IAbstractBinaryTree.html#isSubtreeBST\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"isBST\",\"url\":\"interfaces/IAbstractBinaryTree.html#isBST\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getSubTreeSize\",\"url\":\"interfaces/IAbstractBinaryTree.html#getSubTreeSize\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"subTreeSum\",\"url\":\"interfaces/IAbstractBinaryTree.html#subTreeSum\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"subTreeAdd\",\"url\":\"interfaces/IAbstractBinaryTree.html#subTreeAdd\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"BFS\",\"url\":\"interfaces/IAbstractBinaryTree.html#BFS\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"DFS\",\"url\":\"interfaces/IAbstractBinaryTree.html#DFS\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"DFSIterative\",\"url\":\"interfaces/IAbstractBinaryTree.html#DFSIterative\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"levelIterative\",\"url\":\"interfaces/IAbstractBinaryTree.html#levelIterative\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"listLevels\",\"url\":\"interfaces/IAbstractBinaryTree.html#listLevels\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"getPredecessor\",\"url\":\"interfaces/IAbstractBinaryTree.html#getPredecessor\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":2048,\"name\":\"morris\",\"url\":\"interfaces/IAbstractBinaryTree.html#morris\",\"classes\":\"\",\"parent\":\"IAbstractBinaryTree\"},{\"kind\":256,\"name\":\"IAbstractGraph\",\"url\":\"interfaces/IAbstractGraph.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"hasVertex\",\"url\":\"interfaces/IAbstractGraph.html#hasVertex\",\"classes\":\"\",\"parent\":\"IAbstractGraph\"},{\"kind\":2048,\"name\":\"addVertex\",\"url\":\"interfaces/IAbstractGraph.html#addVertex\",\"classes\":\"\",\"parent\":\"IAbstractGraph\"},{\"kind\":2048,\"name\":\"removeVertex\",\"url\":\"interfaces/IAbstractGraph.html#removeVertex\",\"classes\":\"\",\"parent\":\"IAbstractGraph\"},{\"kind\":2048,\"name\":\"removeAllVertices\",\"url\":\"interfaces/IAbstractGraph.html#removeAllVertices\",\"classes\":\"\",\"parent\":\"IAbstractGraph\"},{\"kind\":2048,\"name\":\"degreeOf\",\"url\":\"interfaces/IAbstractGraph.html#degreeOf\",\"classes\":\"\",\"parent\":\"IAbstractGraph\"},{\"kind\":2048,\"name\":\"edgesOf\",\"url\":\"interfaces/IAbstractGraph.html#edgesOf\",\"classes\":\"\",\"parent\":\"IAbstractGraph\"},{\"kind\":2048,\"name\":\"hasEdge\",\"url\":\"interfaces/IAbstractGraph.html#hasEdge\",\"classes\":\"\",\"parent\":\"IAbstractGraph\"},{\"kind\":2048,\"name\":\"getEdge\",\"url\":\"interfaces/IAbstractGraph.html#getEdge\",\"classes\":\"\",\"parent\":\"IAbstractGraph\"},{\"kind\":2048,\"name\":\"edgeSet\",\"url\":\"interfaces/IAbstractGraph.html#edgeSet\",\"classes\":\"\",\"parent\":\"IAbstractGraph\"},{\"kind\":2048,\"name\":\"addEdge\",\"url\":\"interfaces/IAbstractGraph.html#addEdge\",\"classes\":\"\",\"parent\":\"IAbstractGraph\"},{\"kind\":2048,\"name\":\"removeEdge\",\"url\":\"interfaces/IAbstractGraph.html#removeEdge\",\"classes\":\"\",\"parent\":\"IAbstractGraph\"},{\"kind\":2048,\"name\":\"setEdgeWeight\",\"url\":\"interfaces/IAbstractGraph.html#setEdgeWeight\",\"classes\":\"\",\"parent\":\"IAbstractGraph\"},{\"kind\":2048,\"name\":\"getMinPathBetween\",\"url\":\"interfaces/IAbstractGraph.html#getMinPathBetween\",\"classes\":\"\",\"parent\":\"IAbstractGraph\"},{\"kind\":2048,\"name\":\"getNeighbors\",\"url\":\"interfaces/IAbstractGraph.html#getNeighbors\",\"classes\":\"\",\"parent\":\"IAbstractGraph\"},{\"kind\":4194304,\"name\":\"IAVLTreeNode\",\"url\":\"types/IAVLTreeNode.html\",\"classes\":\"\"},{\"kind\":256,\"name\":\"IAVLTree\",\"url\":\"interfaces/IAVLTree.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"interfaces/IAVLTree.html#add\",\"classes\":\"\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"interfaces/IAVLTree.html#remove\",\"classes\":\"\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"createNode\",\"url\":\"interfaces/IAVLTree.html#createNode\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"interfaces/IAVLTree.html#get\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"lastKey\",\"url\":\"interfaces/IAVLTree.html#lastKey\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"getNodes\",\"url\":\"interfaces/IAVLTree.html#getNodes\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"lesserSum\",\"url\":\"interfaces/IAVLTree.html#lesserSum\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"allGreaterNodesAdd\",\"url\":\"interfaces/IAVLTree.html#allGreaterNodesAdd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"perfectlyBalance\",\"url\":\"interfaces/IAVLTree.html#perfectlyBalance\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"isAVLBalanced\",\"url\":\"interfaces/IAVLTree.html#isAVLBalanced\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":262144,\"name\":\"loopType\",\"url\":\"interfaces/IAVLTree.html#loopType\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":262144,\"name\":\"visitedId\",\"url\":\"interfaces/IAVLTree.html#visitedId\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":262144,\"name\":\"visitedVal\",\"url\":\"interfaces/IAVLTree.html#visitedVal\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":262144,\"name\":\"visitedNode\",\"url\":\"interfaces/IAVLTree.html#visitedNode\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":262144,\"name\":\"root\",\"url\":\"interfaces/IAVLTree.html#root\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"interfaces/IAVLTree.html#size\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"swapLocation\",\"url\":\"interfaces/IAVLTree.html#swapLocation\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"interfaces/IAVLTree.html#clear\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"interfaces/IAVLTree.html#isEmpty\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"addMany\",\"url\":\"interfaces/IAVLTree.html#addMany\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"fill\",\"url\":\"interfaces/IAVLTree.html#fill\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"getDepth\",\"url\":\"interfaces/IAVLTree.html#getDepth\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"getHeight\",\"url\":\"interfaces/IAVLTree.html#getHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"getMinHeight\",\"url\":\"interfaces/IAVLTree.html#getMinHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"isPerfectlyBalanced\",\"url\":\"interfaces/IAVLTree.html#isPerfectlyBalanced\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"interfaces/IAVLTree.html#has\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"getPathToRoot\",\"url\":\"interfaces/IAVLTree.html#getPathToRoot\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"getLeftMost\",\"url\":\"interfaces/IAVLTree.html#getLeftMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"getRightMost\",\"url\":\"interfaces/IAVLTree.html#getRightMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"isSubtreeBST\",\"url\":\"interfaces/IAVLTree.html#isSubtreeBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"isBST\",\"url\":\"interfaces/IAVLTree.html#isBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"getSubTreeSize\",\"url\":\"interfaces/IAVLTree.html#getSubTreeSize\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"subTreeSum\",\"url\":\"interfaces/IAVLTree.html#subTreeSum\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"subTreeAdd\",\"url\":\"interfaces/IAVLTree.html#subTreeAdd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"BFS\",\"url\":\"interfaces/IAVLTree.html#BFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"DFS\",\"url\":\"interfaces/IAVLTree.html#DFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"DFSIterative\",\"url\":\"interfaces/IAVLTree.html#DFSIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"levelIterative\",\"url\":\"interfaces/IAVLTree.html#levelIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"listLevels\",\"url\":\"interfaces/IAVLTree.html#listLevels\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"getPredecessor\",\"url\":\"interfaces/IAVLTree.html#getPredecessor\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":2048,\"name\":\"morris\",\"url\":\"interfaces/IAVLTree.html#morris\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IAVLTree\"},{\"kind\":4194304,\"name\":\"IBinaryTreeNode\",\"url\":\"types/IBinaryTreeNode.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"IBinaryTree\",\"url\":\"types/IBinaryTree.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"IBSTNode\",\"url\":\"types/IBSTNode.html\",\"classes\":\"\"},{\"kind\":256,\"name\":\"IBST\",\"url\":\"interfaces/IBST.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"createNode\",\"url\":\"interfaces/IBST.html#createNode\",\"classes\":\"\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"interfaces/IBST.html#add\",\"classes\":\"\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"interfaces/IBST.html#get\",\"classes\":\"\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"lastKey\",\"url\":\"interfaces/IBST.html#lastKey\",\"classes\":\"\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"interfaces/IBST.html#remove\",\"classes\":\"\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"getNodes\",\"url\":\"interfaces/IBST.html#getNodes\",\"classes\":\"\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"lesserSum\",\"url\":\"interfaces/IBST.html#lesserSum\",\"classes\":\"\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"allGreaterNodesAdd\",\"url\":\"interfaces/IBST.html#allGreaterNodesAdd\",\"classes\":\"\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"perfectlyBalance\",\"url\":\"interfaces/IBST.html#perfectlyBalance\",\"classes\":\"\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"isAVLBalanced\",\"url\":\"interfaces/IBST.html#isAVLBalanced\",\"classes\":\"\",\"parent\":\"IBST\"},{\"kind\":262144,\"name\":\"loopType\",\"url\":\"interfaces/IBST.html#loopType\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":262144,\"name\":\"visitedId\",\"url\":\"interfaces/IBST.html#visitedId\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":262144,\"name\":\"visitedVal\",\"url\":\"interfaces/IBST.html#visitedVal\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":262144,\"name\":\"visitedNode\",\"url\":\"interfaces/IBST.html#visitedNode\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":262144,\"name\":\"root\",\"url\":\"interfaces/IBST.html#root\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"interfaces/IBST.html#size\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"swapLocation\",\"url\":\"interfaces/IBST.html#swapLocation\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"interfaces/IBST.html#clear\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"interfaces/IBST.html#isEmpty\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"addMany\",\"url\":\"interfaces/IBST.html#addMany\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"fill\",\"url\":\"interfaces/IBST.html#fill\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"getDepth\",\"url\":\"interfaces/IBST.html#getDepth\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"getHeight\",\"url\":\"interfaces/IBST.html#getHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"getMinHeight\",\"url\":\"interfaces/IBST.html#getMinHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"isPerfectlyBalanced\",\"url\":\"interfaces/IBST.html#isPerfectlyBalanced\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"interfaces/IBST.html#has\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"getPathToRoot\",\"url\":\"interfaces/IBST.html#getPathToRoot\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"getLeftMost\",\"url\":\"interfaces/IBST.html#getLeftMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"getRightMost\",\"url\":\"interfaces/IBST.html#getRightMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"isSubtreeBST\",\"url\":\"interfaces/IBST.html#isSubtreeBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"isBST\",\"url\":\"interfaces/IBST.html#isBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"getSubTreeSize\",\"url\":\"interfaces/IBST.html#getSubTreeSize\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"subTreeSum\",\"url\":\"interfaces/IBST.html#subTreeSum\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"subTreeAdd\",\"url\":\"interfaces/IBST.html#subTreeAdd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"BFS\",\"url\":\"interfaces/IBST.html#BFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"DFS\",\"url\":\"interfaces/IBST.html#DFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"DFSIterative\",\"url\":\"interfaces/IBST.html#DFSIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"levelIterative\",\"url\":\"interfaces/IBST.html#levelIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"listLevels\",\"url\":\"interfaces/IBST.html#listLevels\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"getPredecessor\",\"url\":\"interfaces/IBST.html#getPredecessor\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":2048,\"name\":\"morris\",\"url\":\"interfaces/IBST.html#morris\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IBST\"},{\"kind\":256,\"name\":\"IDirectedGraph\",\"url\":\"interfaces/IDirectedGraph.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"incomingEdgesOf\",\"url\":\"interfaces/IDirectedGraph.html#incomingEdgesOf\",\"classes\":\"\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"outgoingEdgesOf\",\"url\":\"interfaces/IDirectedGraph.html#outgoingEdgesOf\",\"classes\":\"\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"inDegreeOf\",\"url\":\"interfaces/IDirectedGraph.html#inDegreeOf\",\"classes\":\"\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"outDegreeOf\",\"url\":\"interfaces/IDirectedGraph.html#outDegreeOf\",\"classes\":\"\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"getEdgeSrc\",\"url\":\"interfaces/IDirectedGraph.html#getEdgeSrc\",\"classes\":\"\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"getEdgeDest\",\"url\":\"interfaces/IDirectedGraph.html#getEdgeDest\",\"classes\":\"\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"removeEdgeSrcToDest\",\"url\":\"interfaces/IDirectedGraph.html#removeEdgeSrcToDest\",\"classes\":\"\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"removeEdgesBetween\",\"url\":\"interfaces/IDirectedGraph.html#removeEdgesBetween\",\"classes\":\"\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"hasVertex\",\"url\":\"interfaces/IDirectedGraph.html#hasVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"addVertex\",\"url\":\"interfaces/IDirectedGraph.html#addVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"removeVertex\",\"url\":\"interfaces/IDirectedGraph.html#removeVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"removeAllVertices\",\"url\":\"interfaces/IDirectedGraph.html#removeAllVertices\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"degreeOf\",\"url\":\"interfaces/IDirectedGraph.html#degreeOf\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"edgesOf\",\"url\":\"interfaces/IDirectedGraph.html#edgesOf\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"hasEdge\",\"url\":\"interfaces/IDirectedGraph.html#hasEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"getEdge\",\"url\":\"interfaces/IDirectedGraph.html#getEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"edgeSet\",\"url\":\"interfaces/IDirectedGraph.html#edgeSet\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"addEdge\",\"url\":\"interfaces/IDirectedGraph.html#addEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"removeEdge\",\"url\":\"interfaces/IDirectedGraph.html#removeEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"setEdgeWeight\",\"url\":\"interfaces/IDirectedGraph.html#setEdgeWeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"getMinPathBetween\",\"url\":\"interfaces/IDirectedGraph.html#getMinPathBetween\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IDirectedGraph\"},{\"kind\":2048,\"name\":\"getNeighbors\",\"url\":\"interfaces/IDirectedGraph.html#getNeighbors\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IDirectedGraph\"},{\"kind\":4194304,\"name\":\"IRBTreeNode\",\"url\":\"types/IRBTreeNode.html\",\"classes\":\"\"},{\"kind\":256,\"name\":\"IRBTree\",\"url\":\"interfaces/IRBTree.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"createNode\",\"url\":\"interfaces/IRBTree.html#createNode\",\"classes\":\"\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"add\",\"url\":\"interfaces/IRBTree.html#add\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"get\",\"url\":\"interfaces/IRBTree.html#get\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"lastKey\",\"url\":\"interfaces/IRBTree.html#lastKey\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"remove\",\"url\":\"interfaces/IRBTree.html#remove\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"getNodes\",\"url\":\"interfaces/IRBTree.html#getNodes\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"lesserSum\",\"url\":\"interfaces/IRBTree.html#lesserSum\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"allGreaterNodesAdd\",\"url\":\"interfaces/IRBTree.html#allGreaterNodesAdd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"perfectlyBalance\",\"url\":\"interfaces/IRBTree.html#perfectlyBalance\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"isAVLBalanced\",\"url\":\"interfaces/IRBTree.html#isAVLBalanced\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":262144,\"name\":\"loopType\",\"url\":\"interfaces/IRBTree.html#loopType\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":262144,\"name\":\"visitedId\",\"url\":\"interfaces/IRBTree.html#visitedId\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":262144,\"name\":\"visitedVal\",\"url\":\"interfaces/IRBTree.html#visitedVal\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":262144,\"name\":\"visitedNode\",\"url\":\"interfaces/IRBTree.html#visitedNode\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":262144,\"name\":\"root\",\"url\":\"interfaces/IRBTree.html#root\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":262144,\"name\":\"size\",\"url\":\"interfaces/IRBTree.html#size\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"swapLocation\",\"url\":\"interfaces/IRBTree.html#swapLocation\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"clear\",\"url\":\"interfaces/IRBTree.html#clear\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"isEmpty\",\"url\":\"interfaces/IRBTree.html#isEmpty\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"addMany\",\"url\":\"interfaces/IRBTree.html#addMany\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"fill\",\"url\":\"interfaces/IRBTree.html#fill\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"getDepth\",\"url\":\"interfaces/IRBTree.html#getDepth\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"getHeight\",\"url\":\"interfaces/IRBTree.html#getHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"getMinHeight\",\"url\":\"interfaces/IRBTree.html#getMinHeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"isPerfectlyBalanced\",\"url\":\"interfaces/IRBTree.html#isPerfectlyBalanced\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"has\",\"url\":\"interfaces/IRBTree.html#has\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"getPathToRoot\",\"url\":\"interfaces/IRBTree.html#getPathToRoot\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"getLeftMost\",\"url\":\"interfaces/IRBTree.html#getLeftMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"getRightMost\",\"url\":\"interfaces/IRBTree.html#getRightMost\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"isSubtreeBST\",\"url\":\"interfaces/IRBTree.html#isSubtreeBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"isBST\",\"url\":\"interfaces/IRBTree.html#isBST\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"getSubTreeSize\",\"url\":\"interfaces/IRBTree.html#getSubTreeSize\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"subTreeSum\",\"url\":\"interfaces/IRBTree.html#subTreeSum\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"subTreeAdd\",\"url\":\"interfaces/IRBTree.html#subTreeAdd\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"BFS\",\"url\":\"interfaces/IRBTree.html#BFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"DFS\",\"url\":\"interfaces/IRBTree.html#DFS\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"DFSIterative\",\"url\":\"interfaces/IRBTree.html#DFSIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"levelIterative\",\"url\":\"interfaces/IRBTree.html#levelIterative\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"listLevels\",\"url\":\"interfaces/IRBTree.html#listLevels\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"getPredecessor\",\"url\":\"interfaces/IRBTree.html#getPredecessor\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":2048,\"name\":\"morris\",\"url\":\"interfaces/IRBTree.html#morris\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IRBTree\"},{\"kind\":4194304,\"name\":\"ITreeMultisetNode\",\"url\":\"types/ITreeMultisetNode.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"ITreeMultiset\",\"url\":\"types/ITreeMultiset.html\",\"classes\":\"\"},{\"kind\":256,\"name\":\"IUNDirectedGraph\",\"url\":\"interfaces/IUNDirectedGraph.html\",\"classes\":\"\"},{\"kind\":2048,\"name\":\"removeEdgeBetween\",\"url\":\"interfaces/IUNDirectedGraph.html#removeEdgeBetween\",\"classes\":\"\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":2048,\"name\":\"hasVertex\",\"url\":\"interfaces/IUNDirectedGraph.html#hasVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":2048,\"name\":\"addVertex\",\"url\":\"interfaces/IUNDirectedGraph.html#addVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":2048,\"name\":\"removeVertex\",\"url\":\"interfaces/IUNDirectedGraph.html#removeVertex\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":2048,\"name\":\"removeAllVertices\",\"url\":\"interfaces/IUNDirectedGraph.html#removeAllVertices\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":2048,\"name\":\"degreeOf\",\"url\":\"interfaces/IUNDirectedGraph.html#degreeOf\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":2048,\"name\":\"edgesOf\",\"url\":\"interfaces/IUNDirectedGraph.html#edgesOf\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":2048,\"name\":\"hasEdge\",\"url\":\"interfaces/IUNDirectedGraph.html#hasEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":2048,\"name\":\"getEdge\",\"url\":\"interfaces/IUNDirectedGraph.html#getEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":2048,\"name\":\"edgeSet\",\"url\":\"interfaces/IUNDirectedGraph.html#edgeSet\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":2048,\"name\":\"addEdge\",\"url\":\"interfaces/IUNDirectedGraph.html#addEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":2048,\"name\":\"removeEdge\",\"url\":\"interfaces/IUNDirectedGraph.html#removeEdge\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":2048,\"name\":\"setEdgeWeight\",\"url\":\"interfaces/IUNDirectedGraph.html#setEdgeWeight\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":2048,\"name\":\"getMinPathBetween\",\"url\":\"interfaces/IUNDirectedGraph.html#getMinPathBetween\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":2048,\"name\":\"getNeighbors\",\"url\":\"interfaces/IUNDirectedGraph.html#getNeighbors\",\"classes\":\"tsd-is-inherited\",\"parent\":\"IUNDirectedGraph\"},{\"kind\":4194304,\"name\":\"BinaryTreeNodeNested\",\"url\":\"types/BinaryTreeNodeNested.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"BinaryTreeOptions\",\"url\":\"types/BinaryTreeOptions.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"BSTComparator\",\"url\":\"types/BSTComparator.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/BSTComparator.html#__type\",\"classes\":\"\",\"parent\":\"BSTComparator\"},{\"kind\":4194304,\"name\":\"BSTNodeNested\",\"url\":\"types/BSTNodeNested.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"BSTOptions\",\"url\":\"types/BSTOptions.html\",\"classes\":\"\"},{\"kind\":8,\"name\":\"CP\",\"url\":\"enums/CP.html\",\"classes\":\"\"},{\"kind\":16,\"name\":\"lt\",\"url\":\"enums/CP.html#lt\",\"classes\":\"\",\"parent\":\"CP\"},{\"kind\":16,\"name\":\"eq\",\"url\":\"enums/CP.html#eq\",\"classes\":\"\",\"parent\":\"CP\"},{\"kind\":16,\"name\":\"gt\",\"url\":\"enums/CP.html#gt\",\"classes\":\"\",\"parent\":\"CP\"},{\"kind\":4194304,\"name\":\"AVLTreeNodeNested\",\"url\":\"types/AVLTreeNodeNested.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"AVLTreeOptions\",\"url\":\"types/AVLTreeOptions.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"SegmentTreeNodeVal\",\"url\":\"types/SegmentTreeNodeVal.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"TreeMultisetNodeNested\",\"url\":\"types/TreeMultisetNodeNested.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"TreeMultisetOptions\",\"url\":\"types/TreeMultisetOptions.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"VertexId\",\"url\":\"types/VertexId.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"EdgeId\",\"url\":\"types/EdgeId.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"DijkstraResult\",\"url\":\"types/DijkstraResult.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"MapGraphCoordinate\",\"url\":\"types/MapGraphCoordinate.html\",\"classes\":\"\"},{\"kind\":8,\"name\":\"LoopType\",\"url\":\"enums/LoopType.html\",\"classes\":\"\"},{\"kind\":16,\"name\":\"ITERATIVE\",\"url\":\"enums/LoopType.html#ITERATIVE\",\"classes\":\"\",\"parent\":\"LoopType\"},{\"kind\":16,\"name\":\"RECURSIVE\",\"url\":\"enums/LoopType.html#RECURSIVE\",\"classes\":\"\",\"parent\":\"LoopType\"},{\"kind\":8,\"name\":\"FamilyPosition\",\"url\":\"enums/FamilyPosition.html\",\"classes\":\"\"},{\"kind\":16,\"name\":\"ROOT\",\"url\":\"enums/FamilyPosition.html#ROOT\",\"classes\":\"\",\"parent\":\"FamilyPosition\"},{\"kind\":16,\"name\":\"LEFT\",\"url\":\"enums/FamilyPosition.html#LEFT\",\"classes\":\"\",\"parent\":\"FamilyPosition\"},{\"kind\":16,\"name\":\"RIGHT\",\"url\":\"enums/FamilyPosition.html#RIGHT\",\"classes\":\"\",\"parent\":\"FamilyPosition\"},{\"kind\":16,\"name\":\"ROOT_LEFT\",\"url\":\"enums/FamilyPosition.html#ROOT_LEFT\",\"classes\":\"\",\"parent\":\"FamilyPosition\"},{\"kind\":16,\"name\":\"ROOT_RIGHT\",\"url\":\"enums/FamilyPosition.html#ROOT_RIGHT\",\"classes\":\"\",\"parent\":\"FamilyPosition\"},{\"kind\":16,\"name\":\"ISOLATED\",\"url\":\"enums/FamilyPosition.html#ISOLATED\",\"classes\":\"\",\"parent\":\"FamilyPosition\"},{\"kind\":16,\"name\":\"MAL_NODE\",\"url\":\"enums/FamilyPosition.html#MAL_NODE\",\"classes\":\"\",\"parent\":\"FamilyPosition\"},{\"kind\":4194304,\"name\":\"BinaryTreeNodePropertyName\",\"url\":\"types/BinaryTreeNodePropertyName.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"NodeOrPropertyName\",\"url\":\"types/NodeOrPropertyName.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"DFSOrderPattern\",\"url\":\"types/DFSOrderPattern.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"BinaryTreeNodeId\",\"url\":\"types/BinaryTreeNodeId.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"BinaryTreeDeletedResult\",\"url\":\"types/BinaryTreeDeletedResult.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/BinaryTreeDeletedResult.html#__type\",\"classes\":\"\",\"parent\":\"BinaryTreeDeletedResult\"},{\"kind\":1024,\"name\":\"deleted\",\"url\":\"types/BinaryTreeDeletedResult.html#__type.deleted\",\"classes\":\"\",\"parent\":\"BinaryTreeDeletedResult.__type\"},{\"kind\":1024,\"name\":\"needBalanced\",\"url\":\"types/BinaryTreeDeletedResult.html#__type.needBalanced\",\"classes\":\"\",\"parent\":\"BinaryTreeDeletedResult.__type\"},{\"kind\":4194304,\"name\":\"AbstractBinaryTreeNodeProperty\",\"url\":\"types/AbstractBinaryTreeNodeProperty.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"AbstractBinaryTreeNodeProperties\",\"url\":\"types/AbstractBinaryTreeNodeProperties.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"AbstractBinaryTreeNodeNested\",\"url\":\"types/AbstractBinaryTreeNodeNested.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"AbstractBinaryTreeOptions\",\"url\":\"types/AbstractBinaryTreeOptions.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/AbstractBinaryTreeOptions.html#__type\",\"classes\":\"\",\"parent\":\"AbstractBinaryTreeOptions\"},{\"kind\":1024,\"name\":\"loopType\",\"url\":\"types/AbstractBinaryTreeOptions.html#__type.loopType\",\"classes\":\"\",\"parent\":\"AbstractBinaryTreeOptions.__type\"},{\"kind\":8,\"name\":\"RBColor\",\"url\":\"enums/RBColor.html\",\"classes\":\"\"},{\"kind\":16,\"name\":\"RED\",\"url\":\"enums/RBColor.html#RED\",\"classes\":\"\",\"parent\":\"RBColor\"},{\"kind\":16,\"name\":\"BLACK\",\"url\":\"enums/RBColor.html#BLACK\",\"classes\":\"\",\"parent\":\"RBColor\"},{\"kind\":4194304,\"name\":\"RBTreeNodeNested\",\"url\":\"types/RBTreeNodeNested.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"RBTreeOptions\",\"url\":\"types/RBTreeOptions.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"TopologicalStatus\",\"url\":\"types/TopologicalStatus.html\",\"classes\":\"\"},{\"kind\":8,\"name\":\"TopologicalProperty\",\"url\":\"enums/TopologicalProperty.html\",\"classes\":\"\"},{\"kind\":16,\"name\":\"VAL\",\"url\":\"enums/TopologicalProperty.html#VAL\",\"classes\":\"\",\"parent\":\"TopologicalProperty\"},{\"kind\":16,\"name\":\"NODE\",\"url\":\"enums/TopologicalProperty.html#NODE\",\"classes\":\"\",\"parent\":\"TopologicalProperty\"},{\"kind\":16,\"name\":\"ID\",\"url\":\"enums/TopologicalProperty.html#ID\",\"classes\":\"\",\"parent\":\"TopologicalProperty\"},{\"kind\":4194304,\"name\":\"PriorityQueueComparator\",\"url\":\"types/PriorityQueueComparator.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/PriorityQueueComparator.html#__type\",\"classes\":\"\",\"parent\":\"PriorityQueueComparator\"},{\"kind\":4194304,\"name\":\"PriorityQueueOptions\",\"url\":\"types/PriorityQueueOptions.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/PriorityQueueOptions.html#__type\",\"classes\":\"\",\"parent\":\"PriorityQueueOptions\"},{\"kind\":1024,\"name\":\"nodes\",\"url\":\"types/PriorityQueueOptions.html#__type.nodes\",\"classes\":\"\",\"parent\":\"PriorityQueueOptions.__type\"},{\"kind\":1024,\"name\":\"isFix\",\"url\":\"types/PriorityQueueOptions.html#__type.isFix\",\"classes\":\"\",\"parent\":\"PriorityQueueOptions.__type\"},{\"kind\":1024,\"name\":\"comparator\",\"url\":\"types/PriorityQueueOptions.html#__type.comparator\",\"classes\":\"\",\"parent\":\"PriorityQueueOptions.__type\"},{\"kind\":4194304,\"name\":\"PriorityQueueDFSOrderPattern\",\"url\":\"types/PriorityQueueDFSOrderPattern.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"HeapOptions\",\"url\":\"types/HeapOptions.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/HeapOptions.html#__type\",\"classes\":\"\",\"parent\":\"HeapOptions\"},{\"kind\":1024,\"name\":\"priorityExtractor\",\"url\":\"types/HeapOptions.html#__type.priorityExtractor\",\"classes\":\"\",\"parent\":\"HeapOptions.__type\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/HeapOptions.html#__type.priorityExtractor.__type-1\",\"classes\":\"\",\"parent\":\"HeapOptions.__type.priorityExtractor\"},{\"kind\":4194304,\"name\":\"Direction\",\"url\":\"types/Direction.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"Turning\",\"url\":\"types/Turning.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"NavigatorParams\",\"url\":\"types/NavigatorParams.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/NavigatorParams.html#__type\",\"classes\":\"\",\"parent\":\"NavigatorParams\"},{\"kind\":1024,\"name\":\"matrix\",\"url\":\"types/NavigatorParams.html#__type.matrix\",\"classes\":\"\",\"parent\":\"NavigatorParams.__type\"},{\"kind\":1024,\"name\":\"turning\",\"url\":\"types/NavigatorParams.html#__type.turning\",\"classes\":\"\",\"parent\":\"NavigatorParams.__type\"},{\"kind\":1024,\"name\":\"onMove\",\"url\":\"types/NavigatorParams.html#__type.onMove\",\"classes\":\"\",\"parent\":\"NavigatorParams.__type\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/NavigatorParams.html#__type.onMove.__type-2\",\"classes\":\"\",\"parent\":\"NavigatorParams.__type.onMove\"},{\"kind\":1024,\"name\":\"init\",\"url\":\"types/NavigatorParams.html#__type.init\",\"classes\":\"\",\"parent\":\"NavigatorParams.__type\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/NavigatorParams.html#__type.init.__type-1\",\"classes\":\"\",\"parent\":\"NavigatorParams.__type.init\"},{\"kind\":1024,\"name\":\"cur\",\"url\":\"types/NavigatorParams.html#__type.init.__type-1.cur\",\"classes\":\"\",\"parent\":\"NavigatorParams.__type.init.__type\"},{\"kind\":1024,\"name\":\"charDir\",\"url\":\"types/NavigatorParams.html#__type.init.__type-1.charDir\",\"classes\":\"\",\"parent\":\"NavigatorParams.__type.init.__type\"},{\"kind\":1024,\"name\":\"VISITED\",\"url\":\"types/NavigatorParams.html#__type.init.__type-1.VISITED\",\"classes\":\"\",\"parent\":\"NavigatorParams.__type.init.__type\"},{\"kind\":4194304,\"name\":\"HashFunction\",\"url\":\"types/HashFunction.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/HashFunction.html#__type\",\"classes\":\"\",\"parent\":\"HashFunction\"},{\"kind\":4194304,\"name\":\"ToThunkFn\",\"url\":\"types/ToThunkFn.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/ToThunkFn.html#__type\",\"classes\":\"\",\"parent\":\"ToThunkFn\"},{\"kind\":4194304,\"name\":\"Thunk\",\"url\":\"types/Thunk.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/Thunk.html#__type\",\"classes\":\"\",\"parent\":\"Thunk\"},{\"kind\":4194304,\"name\":\"TrlFn\",\"url\":\"types/TrlFn.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/TrlFn.html#__type\",\"classes\":\"\",\"parent\":\"TrlFn\"},{\"kind\":4194304,\"name\":\"TrlAsyncFn\",\"url\":\"types/TrlAsyncFn.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/TrlAsyncFn.html#__type\",\"classes\":\"\",\"parent\":\"TrlAsyncFn\"},{\"kind\":4194304,\"name\":\"SpecifyOptional\",\"url\":\"types/SpecifyOptional.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"KeyValueObject\",\"url\":\"types/KeyValueObject.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/KeyValueObject.html#__type\",\"classes\":\"\",\"parent\":\"KeyValueObject\"},{\"kind\":4194304,\"name\":\"KeyValueObjectWithId\",\"url\":\"types/KeyValueObjectWithId.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/KeyValueObjectWithId.html#__type\",\"classes\":\"\",\"parent\":\"KeyValueObjectWithId\"},{\"kind\":1024,\"name\":\"id\",\"url\":\"types/KeyValueObjectWithId.html#__type.id\",\"classes\":\"\",\"parent\":\"KeyValueObjectWithId.__type\"},{\"kind\":4194304,\"name\":\"NonNumberNonObjectButDefined\",\"url\":\"types/NonNumberNonObjectButDefined.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"ObjectWithoutId\",\"url\":\"types/ObjectWithoutId.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"ObjectWithNonNumberId\",\"url\":\"types/ObjectWithNonNumberId.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/ObjectWithNonNumberId.html#__type\",\"classes\":\"\",\"parent\":\"ObjectWithNonNumberId\"},{\"kind\":1024,\"name\":\"id\",\"url\":\"types/ObjectWithNonNumberId.html#__type.id\",\"classes\":\"\",\"parent\":\"ObjectWithNonNumberId.__type\"},{\"kind\":4194304,\"name\":\"ObjectWithNumberId\",\"url\":\"types/ObjectWithNumberId.html\",\"classes\":\"\"},{\"kind\":65536,\"name\":\"__type\",\"url\":\"types/ObjectWithNumberId.html#__type\",\"classes\":\"\",\"parent\":\"ObjectWithNumberId\"},{\"kind\":1024,\"name\":\"id\",\"url\":\"types/ObjectWithNumberId.html#__type.id\",\"classes\":\"\",\"parent\":\"ObjectWithNumberId.__type\"},{\"kind\":4194304,\"name\":\"RestrictValById\",\"url\":\"types/RestrictValById.html\",\"classes\":\"\"},{\"kind\":4194304,\"name\":\"DummyAny\",\"url\":\"types/DummyAny.html\",\"classes\":\"\"}],\"index\":{\"version\":\"2.3.9\",\"fields\":[\"name\",\"comment\"],\"fieldVectors\":[[\"name/0\",[0,70.211]],[\"comment/0\",[]],[\"name/1\",[1,32.293]],[\"comment/1\",[]],[\"name/2\",[2,65.103]],[\"comment/2\",[]],[\"name/3\",[3,43.13]],[\"comment/3\",[]],[\"name/4\",[4,61.738]],[\"comment/4\",[]],[\"name/5\",[5,70.211]],[\"comment/5\",[]],[\"name/6\",[6,70.211]],[\"comment/6\",[]],[\"name/7\",[7,70.211]],[\"comment/7\",[]],[\"name/8\",[1,32.293]],[\"comment/8\",[]],[\"name/9\",[8,65.103]],[\"comment/9\",[]],[\"name/10\",[9,70.211]],[\"comment/10\",[]],[\"name/11\",[10,65.103]],[\"comment/11\",[]],[\"name/12\",[11,65.103]],[\"comment/12\",[]],[\"name/13\",[12,59.225]],[\"comment/13\",[]],[\"name/14\",[13,70.211]],[\"comment/14\",[]],[\"name/15\",[14,65.103]],[\"comment/15\",[]],[\"name/16\",[15,70.211]],[\"comment/16\",[]],[\"name/17\",[16,70.211]],[\"comment/17\",[]],[\"name/18\",[17,70.211]],[\"comment/18\",[]],[\"name/19\",[18,65.103]],[\"comment/19\",[]],[\"name/20\",[19,70.211]],[\"comment/20\",[]],[\"name/21\",[20,70.211]],[\"comment/21\",[]],[\"name/22\",[21,59.225]],[\"comment/22\",[]],[\"name/23\",[22,46.232]],[\"comment/23\",[]],[\"name/24\",[23,46.857]],[\"comment/24\",[]],[\"name/25\",[24,70.211]],[\"comment/25\",[]],[\"name/26\",[25,42.279]],[\"comment/26\",[]],[\"name/27\",[26,70.211]],[\"comment/27\",[]],[\"name/28\",[1,32.293]],[\"comment/28\",[]],[\"name/29\",[27,65.103]],[\"comment/29\",[]],[\"name/30\",[28,65.103]],[\"comment/30\",[]],[\"name/31\",[29,44.561]],[\"comment/31\",[]],[\"name/32\",[21,59.225]],[\"comment/32\",[]],[\"name/33\",[22,46.232]],[\"comment/33\",[]],[\"name/34\",[30,55.547]],[\"comment/34\",[]],[\"name/35\",[31,65.103]],[\"comment/35\",[]],[\"name/36\",[32,70.211]],[\"comment/36\",[]],[\"name/37\",[1,32.293]],[\"comment/37\",[]],[\"name/38\",[27,65.103]],[\"comment/38\",[]],[\"name/39\",[28,65.103]],[\"comment/39\",[]],[\"name/40\",[29,44.561]],[\"comment/40\",[]],[\"name/41\",[33,43.585]],[\"comment/41\",[]],[\"name/42\",[30,55.547]],[\"comment/42\",[]],[\"name/43\",[31,65.103]],[\"comment/43\",[]],[\"name/44\",[34,70.211]],[\"comment/44\",[]],[\"name/45\",[1,32.293]],[\"comment/45\",[]],[\"name/46\",[35,70.211]],[\"comment/46\",[]],[\"name/47\",[1,32.293]],[\"comment/47\",[]],[\"name/48\",[36,70.211]],[\"comment/48\",[]],[\"name/49\",[1,32.293]],[\"comment/49\",[]],[\"name/50\",[37,70.211]],[\"comment/50\",[]],[\"name/51\",[1,32.293]],[\"comment/51\",[]],[\"name/52\",[8,65.103]],[\"comment/52\",[]],[\"name/53\",[38,70.211]],[\"comment/53\",[]],[\"name/54\",[39,70.211]],[\"comment/54\",[]],[\"name/55\",[40,70.211]],[\"comment/55\",[]],[\"name/56\",[41,70.211]],[\"comment/56\",[]],[\"name/57\",[25,42.279]],[\"comment/57\",[]],[\"name/58\",[42,70.211]],[\"comment/58\",[]],[\"name/59\",[43,70.211]],[\"comment/59\",[]],[\"name/60\",[44,70.211]],[\"comment/60\",[]],[\"name/61\",[12,59.225]],[\"comment/61\",[]],[\"name/62\",[45,70.211]],[\"comment/62\",[]],[\"name/63\",[14,65.103]],[\"comment/63\",[]],[\"name/64\",[18,65.103]],[\"comment/64\",[]],[\"name/65\",[46,70.211]],[\"comment/65\",[]],[\"name/66\",[21,59.225]],[\"comment/66\",[]],[\"name/67\",[22,46.232]],[\"comment/67\",[]],[\"name/68\",[23,46.857]],[\"comment/68\",[]],[\"name/69\",[47,70.211]],[\"comment/69\",[]],[\"name/70\",[48,42.695]],[\"comment/70\",[]],[\"name/71\",[49,41.879]],[\"comment/71\",[]],[\"name/72\",[50,59.225]],[\"comment/72\",[]],[\"name/73\",[51,70.211]],[\"comment/73\",[]],[\"name/74\",[1,32.293]],[\"comment/74\",[]],[\"name/75\",[52,52.865]],[\"comment/75\",[]],[\"name/76\",[3,43.13]],[\"comment/76\",[]],[\"name/77\",[53,65.103]],[\"comment/77\",[]],[\"name/78\",[4,61.738]],[\"comment/78\",[]],[\"name/79\",[54,70.211]],[\"comment/79\",[]],[\"name/80\",[55,55.547]],[\"comment/80\",[]],[\"name/81\",[1,32.293]],[\"comment/81\",[]],[\"name/82\",[56,61.738]],[\"comment/82\",[]],[\"name/83\",[57,57.218]],[\"comment/83\",[]],[\"name/84\",[58,65.103]],[\"comment/84\",[]],[\"name/85\",[59,59.225]],[\"comment/85\",[]],[\"name/86\",[60,65.103]],[\"comment/86\",[]],[\"name/87\",[61,57.218]],[\"comment/87\",[]],[\"name/88\",[62,65.103]],[\"comment/88\",[]],[\"name/89\",[63,55.547]],[\"comment/89\",[]],[\"name/90\",[64,57.218]],[\"comment/90\",[]],[\"name/91\",[65,57.218]],[\"comment/91\",[]],[\"name/92\",[66,59.225]],[\"comment/92\",[]],[\"name/93\",[67,57.218]],[\"comment/93\",[]],[\"name/94\",[68,59.225]],[\"comment/94\",[]],[\"name/95\",[69,59.225]],[\"comment/95\",[]],[\"name/96\",[30,55.547]],[\"comment/96\",[]],[\"name/97\",[70,59.225]],[\"comment/97\",[]],[\"name/98\",[49,41.879]],[\"comment/98\",[]],[\"name/99\",[48,42.695]],[\"comment/99\",[]],[\"name/100\",[71,48.239]],[\"comment/100\",[]],[\"name/101\",[72,57.218]],[\"comment/101\",[]],[\"name/102\",[73,59.225]],[\"comment/102\",[]],[\"name/103\",[74,59.225]],[\"comment/103\",[]],[\"name/104\",[75,59.225]],[\"comment/104\",[]],[\"name/105\",[76,59.225]],[\"comment/105\",[]],[\"name/106\",[77,59.225]],[\"comment/106\",[]],[\"name/107\",[78,65.103]],[\"comment/107\",[]],[\"name/108\",[50,59.225]],[\"comment/108\",[]],[\"name/109\",[79,70.211]],[\"comment/109\",[]],[\"name/110\",[1,32.293]],[\"comment/110\",[]],[\"name/111\",[52,52.865]],[\"comment/111\",[]],[\"name/112\",[3,43.13]],[\"comment/112\",[]],[\"name/113\",[53,65.103]],[\"comment/113\",[]],[\"name/114\",[4,61.738]],[\"comment/114\",[]],[\"name/115\",[80,70.211]],[\"comment/115\",[]],[\"name/116\",[81,70.211]],[\"comment/116\",[]],[\"name/117\",[82,70.211]],[\"comment/117\",[]],[\"name/118\",[55,55.547]],[\"comment/118\",[]],[\"name/119\",[1,32.293]],[\"comment/119\",[]],[\"name/120\",[56,61.738]],[\"comment/120\",[]],[\"name/121\",[57,57.218]],[\"comment/121\",[]],[\"name/122\",[58,65.103]],[\"comment/122\",[]],[\"name/123\",[59,59.225]],[\"comment/123\",[]],[\"name/124\",[60,65.103]],[\"comment/124\",[]],[\"name/125\",[61,57.218]],[\"comment/125\",[]],[\"name/126\",[63,55.547]],[\"comment/126\",[]],[\"name/127\",[83,59.225]],[\"comment/127\",[]],[\"name/128\",[64,57.218]],[\"comment/128\",[]],[\"name/129\",[84,59.225]],[\"comment/129\",[]],[\"name/130\",[65,57.218]],[\"comment/130\",[]],[\"name/131\",[85,59.225]],[\"comment/131\",[]],[\"name/132\",[66,59.225]],[\"comment/132\",[]],[\"name/133\",[86,59.225]],[\"comment/133\",[]],[\"name/134\",[87,59.225]],[\"comment/134\",[]],[\"name/135\",[88,52.865]],[\"comment/135\",[]],[\"name/136\",[25,42.279]],[\"comment/136\",[]],[\"name/137\",[67,57.218]],[\"comment/137\",[]],[\"name/138\",[68,59.225]],[\"comment/138\",[]],[\"name/139\",[75,59.225]],[\"comment/139\",[]],[\"name/140\",[70,59.225]],[\"comment/140\",[]],[\"name/141\",[69,59.225]],[\"comment/141\",[]],[\"name/142\",[30,55.547]],[\"comment/142\",[]],[\"name/143\",[71,48.239]],[\"comment/143\",[]],[\"name/144\",[49,41.879]],[\"comment/144\",[]],[\"name/145\",[48,42.695]],[\"comment/145\",[]],[\"name/146\",[73,59.225]],[\"comment/146\",[]],[\"name/147\",[74,59.225]],[\"comment/147\",[]],[\"name/148\",[89,65.103]],[\"comment/148\",[]],[\"name/149\",[90,65.103]],[\"comment/149\",[]],[\"name/150\",[72,57.218]],[\"comment/150\",[]],[\"name/151\",[91,65.103]],[\"comment/151\",[]],[\"name/152\",[92,65.103]],[\"comment/152\",[]],[\"name/153\",[93,65.103]],[\"comment/153\",[]],[\"name/154\",[94,65.103]],[\"comment/154\",[]],[\"name/155\",[77,59.225]],[\"comment/155\",[]],[\"name/156\",[76,59.225]],[\"comment/156\",[]],[\"name/157\",[95,70.211]],[\"comment/157\",[]],[\"name/158\",[1,32.293]],[\"comment/158\",[]],[\"name/159\",[2,65.103]],[\"comment/159\",[]],[\"name/160\",[96,65.103]],[\"comment/160\",[]],[\"name/161\",[97,70.211]],[\"comment/161\",[]],[\"name/162\",[98,70.211]],[\"comment/162\",[]],[\"name/163\",[1,32.293]],[\"comment/163\",[]],[\"name/164\",[99,70.211]],[\"comment/164\",[]],[\"name/165\",[100,70.211]],[\"comment/165\",[]],[\"name/166\",[101,70.211]],[\"comment/166\",[]],[\"name/167\",[57,57.218]],[\"comment/167\",[]],[\"name/168\",[56,61.738]],[\"comment/168\",[]],[\"name/169\",[102,70.211]],[\"comment/169\",[]],[\"name/170\",[103,70.211]],[\"comment/170\",[]],[\"name/171\",[104,70.211]],[\"comment/171\",[]],[\"name/172\",[105,70.211]],[\"comment/172\",[]],[\"name/173\",[33,43.585]],[\"comment/173\",[]],[\"name/174\",[22,46.232]],[\"comment/174\",[]],[\"name/175\",[23,46.857]],[\"comment/175\",[]],[\"name/176\",[106,70.211]],[\"comment/176\",[]],[\"name/177\",[55,55.547]],[\"comment/177\",[]],[\"name/178\",[1,32.293]],[\"comment/178\",[]],[\"name/179\",[107,70.211]],[\"comment/179\",[]],[\"name/180\",[49,41.879]],[\"comment/180\",[]],[\"name/181\",[25,42.279]],[\"comment/181\",[]],[\"name/182\",[108,51.753]],[\"comment/182\",[]],[\"name/183\",[63,55.547]],[\"comment/183\",[]],[\"name/184\",[64,57.218]],[\"comment/184\",[]],[\"name/185\",[71,48.239]],[\"comment/185\",[]],[\"name/186\",[48,42.695]],[\"comment/186\",[]],[\"name/187\",[109,57.218]],[\"comment/187\",[]],[\"name/188\",[110,70.211]],[\"comment/188\",[]],[\"name/189\",[55,55.547]],[\"comment/189\",[]],[\"name/190\",[1,32.293]],[\"comment/190\",[]],[\"name/191\",[111,65.103]],[\"comment/191\",[]],[\"name/192\",[112,65.103]],[\"comment/192\",[]],[\"name/193\",[108,51.753]],[\"comment/193\",[]],[\"name/194\",[57,57.218]],[\"comment/194\",[]],[\"name/195\",[59,59.225]],[\"comment/195\",[]],[\"name/196\",[61,57.218]],[\"comment/196\",[]],[\"name/197\",[62,65.103]],[\"comment/197\",[]],[\"name/198\",[63,55.547]],[\"comment/198\",[]],[\"name/199\",[64,57.218]],[\"comment/199\",[]],[\"name/200\",[65,57.218]],[\"comment/200\",[]],[\"name/201\",[66,59.225]],[\"comment/201\",[]],[\"name/202\",[67,57.218]],[\"comment/202\",[]],[\"name/203\",[68,59.225]],[\"comment/203\",[]],[\"name/204\",[69,59.225]],[\"comment/204\",[]],[\"name/205\",[30,55.547]],[\"comment/205\",[]],[\"name/206\",[70,59.225]],[\"comment/206\",[]],[\"name/207\",[49,41.879]],[\"comment/207\",[]],[\"name/208\",[48,42.695]],[\"comment/208\",[]],[\"name/209\",[71,48.239]],[\"comment/209\",[]],[\"name/210\",[72,57.218]],[\"comment/210\",[]],[\"name/211\",[73,59.225]],[\"comment/211\",[]],[\"name/212\",[74,59.225]],[\"comment/212\",[]],[\"name/213\",[75,59.225]],[\"comment/213\",[]],[\"name/214\",[76,59.225]],[\"comment/214\",[]],[\"name/215\",[77,59.225]],[\"comment/215\",[]],[\"name/216\",[78,65.103]],[\"comment/216\",[]],[\"name/217\",[50,59.225]],[\"comment/217\",[]],[\"name/218\",[113,70.211]],[\"comment/218\",[]],[\"name/219\",[55,55.547]],[\"comment/219\",[]],[\"name/220\",[1,32.293]],[\"comment/220\",[]],[\"name/221\",[114,55.547]],[\"comment/221\",[]],[\"name/222\",[115,55.547]],[\"comment/222\",[]],[\"name/223\",[116,70.211]],[\"comment/223\",[]],[\"name/224\",[117,70.211]],[\"comment/224\",[]],[\"name/225\",[25,42.279]],[\"comment/225\",[]],[\"name/226\",[63,55.547]],[\"comment/226\",[]],[\"name/227\",[65,57.218]],[\"comment/227\",[]],[\"name/228\",[108,51.753]],[\"comment/228\",[]],[\"name/229\",[88,52.865]],[\"comment/229\",[]],[\"name/230\",[111,65.103]],[\"comment/230\",[]],[\"name/231\",[112,65.103]],[\"comment/231\",[]],[\"name/232\",[67,57.218]],[\"comment/232\",[]],[\"name/233\",[49,41.879]],[\"comment/233\",[]],[\"name/234\",[71,48.239]],[\"comment/234\",[]],[\"name/235\",[48,42.695]],[\"comment/235\",[]],[\"name/236\",[109,57.218]],[\"comment/236\",[]],[\"name/237\",[50,59.225]],[\"comment/237\",[]],[\"name/238\",[118,70.211]],[\"comment/238\",[]],[\"name/239\",[55,55.547]],[\"comment/239\",[]],[\"name/240\",[1,32.293]],[\"comment/240\",[]],[\"name/241\",[57,57.218]],[\"comment/241\",[]],[\"name/242\",[59,59.225]],[\"comment/242\",[]],[\"name/243\",[61,57.218]],[\"comment/243\",[]],[\"name/244\",[63,55.547]],[\"comment/244\",[]],[\"name/245\",[83,59.225]],[\"comment/245\",[]],[\"name/246\",[64,57.218]],[\"comment/246\",[]],[\"name/247\",[84,59.225]],[\"comment/247\",[]],[\"name/248\",[65,57.218]],[\"comment/248\",[]],[\"name/249\",[85,59.225]],[\"comment/249\",[]],[\"name/250\",[66,59.225]],[\"comment/250\",[]],[\"name/251\",[86,59.225]],[\"comment/251\",[]],[\"name/252\",[87,59.225]],[\"comment/252\",[]],[\"name/253\",[88,52.865]],[\"comment/253\",[]],[\"name/254\",[25,42.279]],[\"comment/254\",[]],[\"name/255\",[67,57.218]],[\"comment/255\",[]],[\"name/256\",[68,59.225]],[\"comment/256\",[]],[\"name/257\",[75,59.225]],[\"comment/257\",[]],[\"name/258\",[70,59.225]],[\"comment/258\",[]],[\"name/259\",[69,59.225]],[\"comment/259\",[]],[\"name/260\",[30,55.547]],[\"comment/260\",[]],[\"name/261\",[71,48.239]],[\"comment/261\",[]],[\"name/262\",[49,41.879]],[\"comment/262\",[]],[\"name/263\",[48,42.695]],[\"comment/263\",[]],[\"name/264\",[73,59.225]],[\"comment/264\",[]],[\"name/265\",[74,59.225]],[\"comment/265\",[]],[\"name/266\",[89,65.103]],[\"comment/266\",[]],[\"name/267\",[90,65.103]],[\"comment/267\",[]],[\"name/268\",[72,57.218]],[\"comment/268\",[]],[\"name/269\",[91,65.103]],[\"comment/269\",[]],[\"name/270\",[92,65.103]],[\"comment/270\",[]],[\"name/271\",[93,65.103]],[\"comment/271\",[]],[\"name/272\",[94,65.103]],[\"comment/272\",[]],[\"name/273\",[77,59.225]],[\"comment/273\",[]],[\"name/274\",[76,59.225]],[\"comment/274\",[]],[\"name/275\",[119,70.211]],[\"comment/275\",[]],[\"name/276\",[1,32.293]],[\"comment/276\",[]],[\"name/277\",[114,55.547]],[\"comment/277\",[]],[\"name/278\",[120,37.009]],[\"comment/278\",[]],[\"name/279\",[115,55.547]],[\"comment/279\",[]],[\"name/280\",[120,37.009]],[\"comment/280\",[]],[\"name/281\",[11,65.103]],[\"comment/281\",[]],[\"name/282\",[10,65.103]],[\"comment/282\",[]],[\"name/283\",[121,70.211]],[\"comment/283\",[]],[\"name/284\",[122,70.211]],[\"comment/284\",[]],[\"name/285\",[123,70.211]],[\"comment/285\",[]],[\"name/286\",[124,70.211]],[\"comment/286\",[]],[\"name/287\",[12,59.225]],[\"comment/287\",[]],[\"name/288\",[25,42.279]],[\"comment/288\",[]],[\"name/289\",[86,59.225]],[\"comment/289\",[]],[\"name/290\",[83,59.225]],[\"comment/290\",[]],[\"name/291\",[85,59.225]],[\"comment/291\",[]],[\"name/292\",[87,59.225]],[\"comment/292\",[]],[\"name/293\",[84,59.225]],[\"comment/293\",[]],[\"name/294\",[88,52.865]],[\"comment/294\",[]],[\"name/295\",[22,46.232]],[\"comment/295\",[]],[\"name/296\",[49,41.879]],[\"comment/296\",[]],[\"name/297\",[125,70.211]],[\"comment/297\",[]],[\"name/298\",[126,54.116]],[\"comment/298\",[]],[\"name/299\",[127,70.211]],[\"comment/299\",[]],[\"name/300\",[1,32.293]],[\"comment/300\",[]],[\"name/301\",[114,55.547]],[\"comment/301\",[]],[\"name/302\",[25,42.279]],[\"comment/302\",[]],[\"name/303\",[83,59.225]],[\"comment/303\",[]],[\"name/304\",[84,59.225]],[\"comment/304\",[]],[\"name/305\",[85,59.225]],[\"comment/305\",[]],[\"name/306\",[86,59.225]],[\"comment/306\",[]],[\"name/307\",[87,59.225]],[\"comment/307\",[]],[\"name/308\",[88,52.865]],[\"comment/308\",[]],[\"name/309\",[22,46.232]],[\"comment/309\",[]],[\"name/310\",[21,59.225]],[\"comment/310\",[]],[\"name/311\",[128,70.211]],[\"comment/311\",[]],[\"name/312\",[23,46.857]],[\"comment/312\",[]],[\"name/313\",[49,41.879]],[\"comment/313\",[]],[\"name/314\",[129,70.211]],[\"comment/314\",[]],[\"name/315\",[1,32.293]],[\"comment/315\",[]],[\"name/316\",[130,61.738]],[\"comment/316\",[]],[\"name/317\",[131,46.232]],[\"comment/317\",[]],[\"name/318\",[52,52.865]],[\"comment/318\",[]],[\"name/319\",[3,43.13]],[\"comment/319\",[]],[\"name/320\",[132,70.211]],[\"comment/320\",[]],[\"name/321\",[1,32.293]],[\"comment/321\",[]],[\"name/322\",[52,52.865]],[\"comment/322\",[]],[\"name/323\",[3,43.13]],[\"comment/323\",[]],[\"name/324\",[133,70.211]],[\"comment/324\",[]],[\"name/325\",[134,59.225]],[\"comment/325\",[]],[\"name/326\",[135,59.225]],[\"comment/326\",[]],[\"name/327\",[136,59.225]],[\"comment/327\",[]],[\"name/328\",[137,59.225]],[\"comment/328\",[]],[\"name/329\",[138,70.211]],[\"comment/329\",[]],[\"name/330\",[1,32.293]],[\"comment/330\",[]],[\"name/331\",[139,65.103]],[\"comment/331\",[]],[\"name/332\",[140,57.218]],[\"comment/332\",[]],[\"name/333\",[141,59.225]],[\"comment/333\",[]],[\"name/334\",[142,59.225]],[\"comment/334\",[]],[\"name/335\",[143,54.116]],[\"comment/335\",[]],[\"name/336\",[144,54.116]],[\"comment/336\",[]],[\"name/337\",[145,54.116]],[\"comment/337\",[]],[\"name/338\",[146,54.116]],[\"comment/338\",[]],[\"name/339\",[147,54.116]],[\"comment/339\",[]],[\"name/340\",[148,54.116]],[\"comment/340\",[]],[\"name/341\",[149,59.225]],[\"comment/341\",[]],[\"name/342\",[150,59.225]],[\"comment/342\",[]],[\"name/343\",[151,54.116]],[\"comment/343\",[]],[\"name/344\",[152,54.116]],[\"comment/344\",[]],[\"name/345\",[153,54.116]],[\"comment/345\",[]],[\"name/346\",[154,54.116]],[\"comment/346\",[]],[\"name/347\",[155,54.116]],[\"comment/347\",[]],[\"name/348\",[156,54.116]],[\"comment/348\",[]],[\"name/349\",[157,54.116]],[\"comment/349\",[]],[\"name/350\",[158,59.225]],[\"comment/350\",[]],[\"name/351\",[159,59.225]],[\"comment/351\",[]],[\"name/352\",[160,59.225]],[\"comment/352\",[]],[\"name/353\",[161,54.116]],[\"comment/353\",[]],[\"name/354\",[162,59.225]],[\"comment/354\",[]],[\"name/355\",[163,59.225]],[\"comment/355\",[]],[\"name/356\",[164,59.225]],[\"comment/356\",[]],[\"name/357\",[120,37.009]],[\"comment/357\",[]],[\"name/358\",[165,59.225]],[\"comment/358\",[]],[\"name/359\",[166,59.225]],[\"comment/359\",[]],[\"name/360\",[167,59.225]],[\"comment/360\",[]],[\"name/361\",[168,59.225]],[\"comment/361\",[]],[\"name/362\",[169,59.225]],[\"comment/362\",[]],[\"name/363\",[170,59.225]],[\"comment/363\",[]],[\"name/364\",[171,59.225]],[\"comment/364\",[]],[\"name/365\",[120,37.009]],[\"comment/365\",[]],[\"name/366\",[172,59.225]],[\"comment/366\",[]],[\"name/367\",[173,59.225]],[\"comment/367\",[]],[\"name/368\",[174,59.225]],[\"comment/368\",[]],[\"name/369\",[120,37.009]],[\"comment/369\",[]],[\"name/370\",[175,59.225]],[\"comment/370\",[]],[\"name/371\",[176,59.225]],[\"comment/371\",[]],[\"name/372\",[177,59.225]],[\"comment/372\",[]],[\"name/373\",[178,59.225]],[\"comment/373\",[]],[\"name/374\",[179,59.225]],[\"comment/374\",[]],[\"name/375\",[180,59.225]],[\"comment/375\",[]],[\"name/376\",[181,59.225]],[\"comment/376\",[]],[\"name/377\",[182,59.225]],[\"comment/377\",[]],[\"name/378\",[183,59.225]],[\"comment/378\",[]],[\"name/379\",[184,59.225]],[\"comment/379\",[]],[\"name/380\",[185,59.225]],[\"comment/380\",[]],[\"name/381\",[186,70.211]],[\"comment/381\",[]],[\"name/382\",[1,32.293]],[\"comment/382\",[]],[\"name/383\",[131,46.232]],[\"comment/383\",[]],[\"name/384\",[3,43.13]],[\"comment/384\",[]],[\"name/385\",[187,70.211]],[\"comment/385\",[]],[\"name/386\",[1,32.293]],[\"comment/386\",[]],[\"name/387\",[188,70.211]],[\"comment/387\",[]],[\"name/388\",[189,65.103]],[\"comment/388\",[]],[\"name/389\",[190,70.211]],[\"comment/389\",[]],[\"name/390\",[191,65.103]],[\"comment/390\",[]],[\"name/391\",[3,43.13]],[\"comment/391\",[]],[\"name/392\",[134,59.225]],[\"comment/392\",[]],[\"name/393\",[135,59.225]],[\"comment/393\",[]],[\"name/394\",[136,59.225]],[\"comment/394\",[]],[\"name/395\",[137,59.225]],[\"comment/395\",[]],[\"name/396\",[192,70.211]],[\"comment/396\",[]],[\"name/397\",[1,32.293]],[\"comment/397\",[]],[\"name/398\",[193,70.211]],[\"comment/398\",[]],[\"name/399\",[194,65.103]],[\"comment/399\",[]],[\"name/400\",[195,70.211]],[\"comment/400\",[]],[\"name/401\",[196,65.103]],[\"comment/401\",[]],[\"name/402\",[141,59.225]],[\"comment/402\",[]],[\"name/403\",[142,59.225]],[\"comment/403\",[]],[\"name/404\",[144,54.116]],[\"comment/404\",[]],[\"name/405\",[197,61.738]],[\"comment/405\",[]],[\"name/406\",[143,54.116]],[\"comment/406\",[]],[\"name/407\",[198,61.738]],[\"comment/407\",[]],[\"name/408\",[199,61.738]],[\"comment/408\",[]],[\"name/409\",[200,61.738]],[\"comment/409\",[]],[\"name/410\",[145,54.116]],[\"comment/410\",[]],[\"name/411\",[201,61.738]],[\"comment/411\",[]],[\"name/412\",[202,61.738]],[\"comment/412\",[]],[\"name/413\",[147,54.116]],[\"comment/413\",[]],[\"name/414\",[203,61.738]],[\"comment/414\",[]],[\"name/415\",[204,61.738]],[\"comment/415\",[]],[\"name/416\",[205,65.103]],[\"comment/416\",[]],[\"name/417\",[206,65.103]],[\"comment/417\",[]],[\"name/418\",[146,54.116]],[\"comment/418\",[]],[\"name/419\",[148,54.116]],[\"comment/419\",[]],[\"name/420\",[149,59.225]],[\"comment/420\",[]],[\"name/421\",[181,59.225]],[\"comment/421\",[]],[\"name/422\",[207,65.103]],[\"comment/422\",[]],[\"name/423\",[208,65.103]],[\"comment/423\",[]],[\"name/424\",[140,57.218]],[\"comment/424\",[]],[\"name/425\",[150,59.225]],[\"comment/425\",[]],[\"name/426\",[151,54.116]],[\"comment/426\",[]],[\"name/427\",[152,54.116]],[\"comment/427\",[]],[\"name/428\",[153,54.116]],[\"comment/428\",[]],[\"name/429\",[154,54.116]],[\"comment/429\",[]],[\"name/430\",[155,54.116]],[\"comment/430\",[]],[\"name/431\",[156,54.116]],[\"comment/431\",[]],[\"name/432\",[157,54.116]],[\"comment/432\",[]],[\"name/433\",[158,59.225]],[\"comment/433\",[]],[\"name/434\",[159,59.225]],[\"comment/434\",[]],[\"name/435\",[160,59.225]],[\"comment/435\",[]],[\"name/436\",[161,54.116]],[\"comment/436\",[]],[\"name/437\",[162,59.225]],[\"comment/437\",[]],[\"name/438\",[163,59.225]],[\"comment/438\",[]],[\"name/439\",[164,59.225]],[\"comment/439\",[]],[\"name/440\",[120,37.009]],[\"comment/440\",[]],[\"name/441\",[165,59.225]],[\"comment/441\",[]],[\"name/442\",[166,59.225]],[\"comment/442\",[]],[\"name/443\",[167,59.225]],[\"comment/443\",[]],[\"name/444\",[168,59.225]],[\"comment/444\",[]],[\"name/445\",[169,59.225]],[\"comment/445\",[]],[\"name/446\",[170,59.225]],[\"comment/446\",[]],[\"name/447\",[171,59.225]],[\"comment/447\",[]],[\"name/448\",[120,37.009]],[\"comment/448\",[]],[\"name/449\",[172,59.225]],[\"comment/449\",[]],[\"name/450\",[173,59.225]],[\"comment/450\",[]],[\"name/451\",[174,59.225]],[\"comment/451\",[]],[\"name/452\",[120,37.009]],[\"comment/452\",[]],[\"name/453\",[175,59.225]],[\"comment/453\",[]],[\"name/454\",[176,59.225]],[\"comment/454\",[]],[\"name/455\",[177,59.225]],[\"comment/455\",[]],[\"name/456\",[178,59.225]],[\"comment/456\",[]],[\"name/457\",[179,59.225]],[\"comment/457\",[]],[\"name/458\",[180,59.225]],[\"comment/458\",[]],[\"name/459\",[182,59.225]],[\"comment/459\",[]],[\"name/460\",[183,59.225]],[\"comment/460\",[]],[\"name/461\",[184,59.225]],[\"comment/461\",[]],[\"name/462\",[185,59.225]],[\"comment/462\",[]],[\"name/463\",[209,70.211]],[\"comment/463\",[]],[\"name/464\",[1,32.293]],[\"comment/464\",[]],[\"name/465\",[131,46.232]],[\"comment/465\",[]],[\"name/466\",[3,43.13]],[\"comment/466\",[]],[\"name/467\",[210,70.211]],[\"comment/467\",[]],[\"name/468\",[1,32.293]],[\"comment/468\",[]],[\"name/469\",[139,65.103]],[\"comment/469\",[]],[\"name/470\",[140,57.218]],[\"comment/470\",[]],[\"name/471\",[3,43.13]],[\"comment/471\",[]],[\"name/472\",[134,59.225]],[\"comment/472\",[]],[\"name/473\",[135,59.225]],[\"comment/473\",[]],[\"name/474\",[136,59.225]],[\"comment/474\",[]],[\"name/475\",[137,59.225]],[\"comment/475\",[]],[\"name/476\",[211,70.211]],[\"comment/476\",[]],[\"name/477\",[1,32.293]],[\"comment/477\",[]],[\"name/478\",[212,70.211]],[\"comment/478\",[]],[\"name/479\",[213,70.211]],[\"comment/479\",[]],[\"name/480\",[141,59.225]],[\"comment/480\",[]],[\"name/481\",[142,59.225]],[\"comment/481\",[]],[\"name/482\",[144,54.116]],[\"comment/482\",[]],[\"name/483\",[214,65.103]],[\"comment/483\",[]],[\"name/484\",[143,54.116]],[\"comment/484\",[]],[\"name/485\",[145,54.116]],[\"comment/485\",[]],[\"name/486\",[147,54.116]],[\"comment/486\",[]],[\"name/487\",[146,54.116]],[\"comment/487\",[]],[\"name/488\",[148,54.116]],[\"comment/488\",[]],[\"name/489\",[149,59.225]],[\"comment/489\",[]],[\"name/490\",[181,59.225]],[\"comment/490\",[]],[\"name/491\",[215,70.211]],[\"comment/491\",[]],[\"name/492\",[140,57.218]],[\"comment/492\",[]],[\"name/493\",[150,59.225]],[\"comment/493\",[]],[\"name/494\",[151,54.116]],[\"comment/494\",[]],[\"name/495\",[152,54.116]],[\"comment/495\",[]],[\"name/496\",[153,54.116]],[\"comment/496\",[]],[\"name/497\",[154,54.116]],[\"comment/497\",[]],[\"name/498\",[155,54.116]],[\"comment/498\",[]],[\"name/499\",[156,54.116]],[\"comment/499\",[]],[\"name/500\",[157,54.116]],[\"comment/500\",[]],[\"name/501\",[158,59.225]],[\"comment/501\",[]],[\"name/502\",[159,59.225]],[\"comment/502\",[]],[\"name/503\",[160,59.225]],[\"comment/503\",[]],[\"name/504\",[161,54.116]],[\"comment/504\",[]],[\"name/505\",[162,59.225]],[\"comment/505\",[]],[\"name/506\",[163,59.225]],[\"comment/506\",[]],[\"name/507\",[164,59.225]],[\"comment/507\",[]],[\"name/508\",[120,37.009]],[\"comment/508\",[]],[\"name/509\",[165,59.225]],[\"comment/509\",[]],[\"name/510\",[166,59.225]],[\"comment/510\",[]],[\"name/511\",[167,59.225]],[\"comment/511\",[]],[\"name/512\",[168,59.225]],[\"comment/512\",[]],[\"name/513\",[169,59.225]],[\"comment/513\",[]],[\"name/514\",[170,59.225]],[\"comment/514\",[]],[\"name/515\",[171,59.225]],[\"comment/515\",[]],[\"name/516\",[120,37.009]],[\"comment/516\",[]],[\"name/517\",[172,59.225]],[\"comment/517\",[]],[\"name/518\",[173,59.225]],[\"comment/518\",[]],[\"name/519\",[174,59.225]],[\"comment/519\",[]],[\"name/520\",[120,37.009]],[\"comment/520\",[]],[\"name/521\",[175,59.225]],[\"comment/521\",[]],[\"name/522\",[176,59.225]],[\"comment/522\",[]],[\"name/523\",[177,59.225]],[\"comment/523\",[]],[\"name/524\",[178,59.225]],[\"comment/524\",[]],[\"name/525\",[179,59.225]],[\"comment/525\",[]],[\"name/526\",[180,59.225]],[\"comment/526\",[]],[\"name/527\",[182,59.225]],[\"comment/527\",[]],[\"name/528\",[183,59.225]],[\"comment/528\",[]],[\"name/529\",[184,59.225]],[\"comment/529\",[]],[\"name/530\",[185,59.225]],[\"comment/530\",[]],[\"name/531\",[216,70.211]],[\"comment/531\",[]],[\"name/532\",[1,32.293]],[\"comment/532\",[]],[\"name/533\",[217,70.211]],[\"comment/533\",[]],[\"name/534\",[218,70.211]],[\"comment/534\",[]],[\"name/535\",[219,70.211]],[\"comment/535\",[]],[\"name/536\",[220,70.211]],[\"comment/536\",[]],[\"name/537\",[131,46.232]],[\"comment/537\",[]],[\"name/538\",[3,43.13]],[\"comment/538\",[]],[\"name/539\",[221,70.211]],[\"comment/539\",[]],[\"name/540\",[1,32.293]],[\"comment/540\",[]],[\"name/541\",[189,65.103]],[\"comment/541\",[]],[\"name/542\",[191,65.103]],[\"comment/542\",[]],[\"name/543\",[3,43.13]],[\"comment/543\",[]],[\"name/544\",[134,59.225]],[\"comment/544\",[]],[\"name/545\",[135,59.225]],[\"comment/545\",[]],[\"name/546\",[136,59.225]],[\"comment/546\",[]],[\"name/547\",[137,59.225]],[\"comment/547\",[]],[\"name/548\",[222,70.211]],[\"comment/548\",[]],[\"name/549\",[1,32.293]],[\"comment/549\",[]],[\"name/550\",[223,70.211]],[\"comment/550\",[]],[\"name/551\",[224,70.211]],[\"comment/551\",[]],[\"name/552\",[225,70.211]],[\"comment/552\",[]],[\"name/553\",[226,70.211]],[\"comment/553\",[]],[\"name/554\",[141,59.225]],[\"comment/554\",[]],[\"name/555\",[142,59.225]],[\"comment/555\",[]],[\"name/556\",[194,65.103]],[\"comment/556\",[]],[\"name/557\",[196,65.103]],[\"comment/557\",[]],[\"name/558\",[144,54.116]],[\"comment/558\",[]],[\"name/559\",[197,61.738]],[\"comment/559\",[]],[\"name/560\",[143,54.116]],[\"comment/560\",[]],[\"name/561\",[198,61.738]],[\"comment/561\",[]],[\"name/562\",[199,61.738]],[\"comment/562\",[]],[\"name/563\",[200,61.738]],[\"comment/563\",[]],[\"name/564\",[145,54.116]],[\"comment/564\",[]],[\"name/565\",[201,61.738]],[\"comment/565\",[]],[\"name/566\",[202,61.738]],[\"comment/566\",[]],[\"name/567\",[147,54.116]],[\"comment/567\",[]],[\"name/568\",[203,61.738]],[\"comment/568\",[]],[\"name/569\",[204,61.738]],[\"comment/569\",[]],[\"name/570\",[205,65.103]],[\"comment/570\",[]],[\"name/571\",[206,65.103]],[\"comment/571\",[]],[\"name/572\",[146,54.116]],[\"comment/572\",[]],[\"name/573\",[148,54.116]],[\"comment/573\",[]],[\"name/574\",[149,59.225]],[\"comment/574\",[]],[\"name/575\",[181,59.225]],[\"comment/575\",[]],[\"name/576\",[207,65.103]],[\"comment/576\",[]],[\"name/577\",[208,65.103]],[\"comment/577\",[]],[\"name/578\",[140,57.218]],[\"comment/578\",[]],[\"name/579\",[150,59.225]],[\"comment/579\",[]],[\"name/580\",[151,54.116]],[\"comment/580\",[]],[\"name/581\",[152,54.116]],[\"comment/581\",[]],[\"name/582\",[153,54.116]],[\"comment/582\",[]],[\"name/583\",[154,54.116]],[\"comment/583\",[]],[\"name/584\",[155,54.116]],[\"comment/584\",[]],[\"name/585\",[156,54.116]],[\"comment/585\",[]],[\"name/586\",[157,54.116]],[\"comment/586\",[]],[\"name/587\",[158,59.225]],[\"comment/587\",[]],[\"name/588\",[159,59.225]],[\"comment/588\",[]],[\"name/589\",[160,59.225]],[\"comment/589\",[]],[\"name/590\",[161,54.116]],[\"comment/590\",[]],[\"name/591\",[162,59.225]],[\"comment/591\",[]],[\"name/592\",[163,59.225]],[\"comment/592\",[]],[\"name/593\",[164,59.225]],[\"comment/593\",[]],[\"name/594\",[120,37.009]],[\"comment/594\",[]],[\"name/595\",[165,59.225]],[\"comment/595\",[]],[\"name/596\",[166,59.225]],[\"comment/596\",[]],[\"name/597\",[167,59.225]],[\"comment/597\",[]],[\"name/598\",[168,59.225]],[\"comment/598\",[]],[\"name/599\",[169,59.225]],[\"comment/599\",[]],[\"name/600\",[170,59.225]],[\"comment/600\",[]],[\"name/601\",[171,59.225]],[\"comment/601\",[]],[\"name/602\",[120,37.009]],[\"comment/602\",[]],[\"name/603\",[172,59.225]],[\"comment/603\",[]],[\"name/604\",[173,59.225]],[\"comment/604\",[]],[\"name/605\",[174,59.225]],[\"comment/605\",[]],[\"name/606\",[120,37.009]],[\"comment/606\",[]],[\"name/607\",[175,59.225]],[\"comment/607\",[]],[\"name/608\",[176,59.225]],[\"comment/608\",[]],[\"name/609\",[177,59.225]],[\"comment/609\",[]],[\"name/610\",[178,59.225]],[\"comment/610\",[]],[\"name/611\",[179,59.225]],[\"comment/611\",[]],[\"name/612\",[180,59.225]],[\"comment/612\",[]],[\"name/613\",[182,59.225]],[\"comment/613\",[]],[\"name/614\",[183,59.225]],[\"comment/614\",[]],[\"name/615\",[184,59.225]],[\"comment/615\",[]],[\"name/616\",[185,59.225]],[\"comment/616\",[]],[\"name/617\",[227,70.211]],[\"comment/617\",[]],[\"name/618\",[1,32.293]],[\"comment/618\",[]],[\"name/619\",[130,61.738]],[\"comment/619\",[]],[\"name/620\",[131,46.232]],[\"comment/620\",[]],[\"name/621\",[52,52.865]],[\"comment/621\",[]],[\"name/622\",[3,43.13]],[\"comment/622\",[]],[\"name/623\",[228,65.103]],[\"comment/623\",[]],[\"name/624\",[229,51.753]],[\"comment/624\",[]],[\"name/625\",[230,65.103]],[\"comment/625\",[]],[\"name/626\",[231,51.753]],[\"comment/626\",[]],[\"name/627\",[232,70.211]],[\"comment/627\",[]],[\"name/628\",[233,54.116]],[\"comment/628\",[]],[\"name/629\",[234,70.211]],[\"comment/629\",[]],[\"name/630\",[235,54.116]],[\"comment/630\",[]],[\"name/631\",[236,52.865]],[\"comment/631\",[]],[\"name/632\",[237,70.211]],[\"comment/632\",[]],[\"name/633\",[1,32.293]],[\"comment/633\",[]],[\"name/634\",[238,61.738]],[\"comment/634\",[]],[\"name/635\",[239,48.239]],[\"comment/635\",[]],[\"name/636\",[12,59.225]],[\"comment/636\",[]],[\"name/637\",[25,42.279]],[\"comment/637\",[]],[\"name/638\",[240,70.211]],[\"comment/638\",[]],[\"name/639\",[241,49.008]],[\"comment/639\",[]],[\"name/640\",[242,70.211]],[\"comment/640\",[]],[\"name/641\",[243,50.752]],[\"comment/641\",[]],[\"name/642\",[244,70.211]],[\"comment/642\",[]],[\"name/643\",[245,50.752]],[\"comment/643\",[]],[\"name/644\",[246,70.211]],[\"comment/644\",[]],[\"name/645\",[247,50.752]],[\"comment/645\",[]],[\"name/646\",[248,50.752]],[\"comment/646\",[]],[\"name/647\",[249,50.752]],[\"comment/647\",[]],[\"name/648\",[48,42.695]],[\"comment/648\",[]],[\"name/649\",[49,41.879]],[\"comment/649\",[]],[\"name/650\",[33,43.585]],[\"comment/650\",[]],[\"name/651\",[250,50.752]],[\"comment/651\",[]],[\"name/652\",[251,50.752]],[\"comment/652\",[]],[\"name/653\",[23,46.857]],[\"comment/653\",[]],[\"name/654\",[252,50.752]],[\"comment/654\",[]],[\"name/655\",[253,49.842]],[\"comment/655\",[]],[\"name/656\",[254,50.752]],[\"comment/656\",[]],[\"name/657\",[255,50.752]],[\"comment/657\",[]],[\"name/658\",[256,48.239]],[\"comment/658\",[]],[\"name/659\",[29,44.561]],[\"comment/659\",[]],[\"name/660\",[22,46.232]],[\"comment/660\",[]],[\"name/661\",[257,50.752]],[\"comment/661\",[]],[\"name/662\",[258,50.752]],[\"comment/662\",[]],[\"name/663\",[259,50.752]],[\"comment/663\",[]],[\"name/664\",[260,50.752]],[\"comment/664\",[]],[\"name/665\",[261,50.752]],[\"comment/665\",[]],[\"name/666\",[262,50.752]],[\"comment/666\",[]],[\"name/667\",[263,50.752]],[\"comment/667\",[]],[\"name/668\",[264,50.752]],[\"comment/668\",[]],[\"name/669\",[265,50.752]],[\"comment/669\",[]],[\"name/670\",[266,48.239]],[\"comment/670\",[]],[\"name/671\",[267,50.752]],[\"comment/671\",[]],[\"name/672\",[268,50.752]],[\"comment/672\",[]],[\"name/673\",[269,50.752]],[\"comment/673\",[]],[\"name/674\",[270,50.752]],[\"comment/674\",[]],[\"name/675\",[271,50.752]],[\"comment/675\",[]],[\"name/676\",[272,55.547]],[\"comment/676\",[]],[\"name/677\",[273,55.547]],[\"comment/677\",[]],[\"name/678\",[274,55.547]],[\"comment/678\",[]],[\"name/679\",[275,55.547]],[\"comment/679\",[]],[\"name/680\",[276,55.547]],[\"comment/680\",[]],[\"name/681\",[277,54.116]],[\"comment/681\",[]],[\"name/682\",[126,54.116]],[\"comment/682\",[]],[\"name/683\",[278,55.547]],[\"comment/683\",[]],[\"name/684\",[279,55.547]],[\"comment/684\",[]],[\"name/685\",[280,55.547]],[\"comment/685\",[]],[\"name/686\",[281,55.547]],[\"comment/686\",[]],[\"name/687\",[282,70.211]],[\"comment/687\",[]],[\"name/688\",[1,32.293]],[\"comment/688\",[]],[\"name/689\",[131,46.232]],[\"comment/689\",[]],[\"name/690\",[3,43.13]],[\"comment/690\",[]],[\"name/691\",[229,51.753]],[\"comment/691\",[]],[\"name/692\",[231,51.753]],[\"comment/692\",[]],[\"name/693\",[233,54.116]],[\"comment/693\",[]],[\"name/694\",[235,54.116]],[\"comment/694\",[]],[\"name/695\",[236,52.865]],[\"comment/695\",[]],[\"name/696\",[283,70.211]],[\"comment/696\",[]],[\"name/697\",[1,32.293]],[\"comment/697\",[]],[\"name/698\",[248,50.752]],[\"comment/698\",[]],[\"name/699\",[239,48.239]],[\"comment/699\",[]],[\"name/700\",[25,42.279]],[\"comment/700\",[]],[\"name/701\",[241,49.008]],[\"comment/701\",[]],[\"name/702\",[243,50.752]],[\"comment/702\",[]],[\"name/703\",[245,50.752]],[\"comment/703\",[]],[\"name/704\",[247,50.752]],[\"comment/704\",[]],[\"name/705\",[249,50.752]],[\"comment/705\",[]],[\"name/706\",[48,42.695]],[\"comment/706\",[]],[\"name/707\",[49,41.879]],[\"comment/707\",[]],[\"name/708\",[33,43.585]],[\"comment/708\",[]],[\"name/709\",[250,50.752]],[\"comment/709\",[]],[\"name/710\",[251,50.752]],[\"comment/710\",[]],[\"name/711\",[23,46.857]],[\"comment/711\",[]],[\"name/712\",[252,50.752]],[\"comment/712\",[]],[\"name/713\",[253,49.842]],[\"comment/713\",[]],[\"name/714\",[254,50.752]],[\"comment/714\",[]],[\"name/715\",[255,50.752]],[\"comment/715\",[]],[\"name/716\",[256,48.239]],[\"comment/716\",[]],[\"name/717\",[29,44.561]],[\"comment/717\",[]],[\"name/718\",[22,46.232]],[\"comment/718\",[]],[\"name/719\",[257,50.752]],[\"comment/719\",[]],[\"name/720\",[258,50.752]],[\"comment/720\",[]],[\"name/721\",[259,50.752]],[\"comment/721\",[]],[\"name/722\",[260,50.752]],[\"comment/722\",[]],[\"name/723\",[261,50.752]],[\"comment/723\",[]],[\"name/724\",[262,50.752]],[\"comment/724\",[]],[\"name/725\",[263,50.752]],[\"comment/725\",[]],[\"name/726\",[264,50.752]],[\"comment/726\",[]],[\"name/727\",[265,50.752]],[\"comment/727\",[]],[\"name/728\",[266,48.239]],[\"comment/728\",[]],[\"name/729\",[267,50.752]],[\"comment/729\",[]],[\"name/730\",[268,50.752]],[\"comment/730\",[]],[\"name/731\",[269,50.752]],[\"comment/731\",[]],[\"name/732\",[270,50.752]],[\"comment/732\",[]],[\"name/733\",[271,50.752]],[\"comment/733\",[]],[\"name/734\",[272,55.547]],[\"comment/734\",[]],[\"name/735\",[273,55.547]],[\"comment/735\",[]],[\"name/736\",[274,55.547]],[\"comment/736\",[]],[\"name/737\",[275,55.547]],[\"comment/737\",[]],[\"name/738\",[276,55.547]],[\"comment/738\",[]],[\"name/739\",[277,54.116]],[\"comment/739\",[]],[\"name/740\",[126,54.116]],[\"comment/740\",[]],[\"name/741\",[278,55.547]],[\"comment/741\",[]],[\"name/742\",[279,55.547]],[\"comment/742\",[]],[\"name/743\",[280,55.547]],[\"comment/743\",[]],[\"name/744\",[281,55.547]],[\"comment/744\",[]],[\"name/745\",[284,70.211]],[\"comment/745\",[]],[\"name/746\",[1,32.293]],[\"comment/746\",[]],[\"name/747\",[131,46.232]],[\"comment/747\",[]],[\"name/748\",[3,43.13]],[\"comment/748\",[]],[\"name/749\",[229,51.753]],[\"comment/749\",[]],[\"name/750\",[231,51.753]],[\"comment/750\",[]],[\"name/751\",[233,54.116]],[\"comment/751\",[]],[\"name/752\",[235,54.116]],[\"comment/752\",[]],[\"name/753\",[236,52.865]],[\"comment/753\",[]],[\"name/754\",[285,70.211]],[\"comment/754\",[]],[\"name/755\",[1,32.293]],[\"comment/755\",[]],[\"name/756\",[248,50.752]],[\"comment/756\",[]],[\"name/757\",[33,43.585]],[\"comment/757\",[]],[\"name/758\",[250,50.752]],[\"comment/758\",[]],[\"name/759\",[22,46.232]],[\"comment/759\",[]],[\"name/760\",[286,54.116]],[\"comment/760\",[]],[\"name/761\",[256,48.239]],[\"comment/761\",[]],[\"name/762\",[287,54.116]],[\"comment/762\",[]],[\"name/763\",[288,54.116]],[\"comment/763\",[]],[\"name/764\",[289,54.116]],[\"comment/764\",[]],[\"name/765\",[290,54.116]],[\"comment/765\",[]],[\"name/766\",[291,54.116]],[\"comment/766\",[]],[\"name/767\",[292,54.116]],[\"comment/767\",[]],[\"name/768\",[239,48.239]],[\"comment/768\",[]],[\"name/769\",[25,42.279]],[\"comment/769\",[]],[\"name/770\",[241,49.008]],[\"comment/770\",[]],[\"name/771\",[243,50.752]],[\"comment/771\",[]],[\"name/772\",[245,50.752]],[\"comment/772\",[]],[\"name/773\",[247,50.752]],[\"comment/773\",[]],[\"name/774\",[249,50.752]],[\"comment/774\",[]],[\"name/775\",[48,42.695]],[\"comment/775\",[]],[\"name/776\",[49,41.879]],[\"comment/776\",[]],[\"name/777\",[251,50.752]],[\"comment/777\",[]],[\"name/778\",[23,46.857]],[\"comment/778\",[]],[\"name/779\",[252,50.752]],[\"comment/779\",[]],[\"name/780\",[253,49.842]],[\"comment/780\",[]],[\"name/781\",[254,50.752]],[\"comment/781\",[]],[\"name/782\",[255,50.752]],[\"comment/782\",[]],[\"name/783\",[29,44.561]],[\"comment/783\",[]],[\"name/784\",[257,50.752]],[\"comment/784\",[]],[\"name/785\",[258,50.752]],[\"comment/785\",[]],[\"name/786\",[259,50.752]],[\"comment/786\",[]],[\"name/787\",[260,50.752]],[\"comment/787\",[]],[\"name/788\",[261,50.752]],[\"comment/788\",[]],[\"name/789\",[262,50.752]],[\"comment/789\",[]],[\"name/790\",[263,50.752]],[\"comment/790\",[]],[\"name/791\",[264,50.752]],[\"comment/791\",[]],[\"name/792\",[265,50.752]],[\"comment/792\",[]],[\"name/793\",[266,48.239]],[\"comment/793\",[]],[\"name/794\",[267,50.752]],[\"comment/794\",[]],[\"name/795\",[268,50.752]],[\"comment/795\",[]],[\"name/796\",[269,50.752]],[\"comment/796\",[]],[\"name/797\",[270,50.752]],[\"comment/797\",[]],[\"name/798\",[271,50.752]],[\"comment/798\",[]],[\"name/799\",[272,55.547]],[\"comment/799\",[]],[\"name/800\",[273,55.547]],[\"comment/800\",[]],[\"name/801\",[274,55.547]],[\"comment/801\",[]],[\"name/802\",[275,55.547]],[\"comment/802\",[]],[\"name/803\",[276,55.547]],[\"comment/803\",[]],[\"name/804\",[277,54.116]],[\"comment/804\",[]],[\"name/805\",[126,54.116]],[\"comment/805\",[]],[\"name/806\",[278,55.547]],[\"comment/806\",[]],[\"name/807\",[279,55.547]],[\"comment/807\",[]],[\"name/808\",[280,55.547]],[\"comment/808\",[]],[\"name/809\",[281,55.547]],[\"comment/809\",[]],[\"name/810\",[293,70.211]],[\"comment/810\",[]],[\"name/811\",[294,70.211]],[\"comment/811\",[]],[\"name/812\",[1,32.293]],[\"comment/812\",[]],[\"name/813\",[295,70.211]],[\"comment/813\",[]],[\"name/814\",[296,70.211]],[\"comment/814\",[]],[\"name/815\",[297,70.211]],[\"comment/815\",[]],[\"name/816\",[298,70.211]],[\"comment/816\",[]],[\"name/817\",[299,70.211]],[\"comment/817\",[]],[\"name/818\",[300,70.211]],[\"comment/818\",[]],[\"name/819\",[301,70.211]],[\"comment/819\",[]],[\"name/820\",[1,32.293]],[\"comment/820\",[]],[\"name/821\",[302,65.103]],[\"comment/821\",[]],[\"name/822\",[303,61.738]],[\"comment/822\",[]],[\"name/823\",[304,65.103]],[\"comment/823\",[]],[\"name/824\",[305,65.103]],[\"comment/824\",[]],[\"name/825\",[52,52.865]],[\"comment/825\",[]],[\"name/826\",[3,43.13]],[\"comment/826\",[]],[\"name/827\",[306,70.211]],[\"comment/827\",[]],[\"name/828\",[307,70.211]],[\"comment/828\",[]],[\"name/829\",[228,65.103]],[\"comment/829\",[]],[\"name/830\",[229,51.753]],[\"comment/830\",[]],[\"name/831\",[230,65.103]],[\"comment/831\",[]],[\"name/832\",[231,51.753]],[\"comment/832\",[]],[\"name/833\",[308,70.211]],[\"comment/833\",[]],[\"name/834\",[1,32.293]],[\"comment/834\",[]],[\"name/835\",[309,70.211]],[\"comment/835\",[]],[\"name/836\",[310,70.211]],[\"comment/836\",[]],[\"name/837\",[302,65.103]],[\"comment/837\",[]],[\"name/838\",[303,61.738]],[\"comment/838\",[]],[\"name/839\",[304,65.103]],[\"comment/839\",[]],[\"name/840\",[305,65.103]],[\"comment/840\",[]],[\"name/841\",[238,61.738]],[\"comment/841\",[]],[\"name/842\",[239,48.239]],[\"comment/842\",[]],[\"name/843\",[311,70.211]],[\"comment/843\",[]],[\"name/844\",[312,70.211]],[\"comment/844\",[]],[\"name/845\",[313,70.211]],[\"comment/845\",[]],[\"name/846\",[314,70.211]],[\"comment/846\",[]],[\"name/847\",[315,70.211]],[\"comment/847\",[]],[\"name/848\",[316,70.211]],[\"comment/848\",[]],[\"name/849\",[277,54.116]],[\"comment/849\",[]],[\"name/850\",[317,70.211]],[\"comment/850\",[]],[\"name/851\",[1,32.293]],[\"comment/851\",[]],[\"name/852\",[131,46.232]],[\"comment/852\",[]],[\"name/853\",[3,43.13]],[\"comment/853\",[]],[\"name/854\",[229,51.753]],[\"comment/854\",[]],[\"name/855\",[231,51.753]],[\"comment/855\",[]],[\"name/856\",[233,54.116]],[\"comment/856\",[]],[\"name/857\",[235,54.116]],[\"comment/857\",[]],[\"name/858\",[236,52.865]],[\"comment/858\",[]],[\"name/859\",[318,70.211]],[\"comment/859\",[]],[\"name/860\",[1,32.293]],[\"comment/860\",[]],[\"name/861\",[248,50.752]],[\"comment/861\",[]],[\"name/862\",[33,43.585]],[\"comment/862\",[]],[\"name/863\",[23,46.857]],[\"comment/863\",[]],[\"name/864\",[319,65.103]],[\"comment/864\",[]],[\"name/865\",[320,65.103]],[\"comment/865\",[]],[\"name/866\",[321,65.103]],[\"comment/866\",[]],[\"name/867\",[322,65.103]],[\"comment/867\",[]],[\"name/868\",[323,65.103]],[\"comment/868\",[]],[\"name/869\",[324,65.103]],[\"comment/869\",[]],[\"name/870\",[325,65.103]],[\"comment/870\",[]],[\"name/871\",[250,50.752]],[\"comment/871\",[]],[\"name/872\",[22,46.232]],[\"comment/872\",[]],[\"name/873\",[286,54.116]],[\"comment/873\",[]],[\"name/874\",[256,48.239]],[\"comment/874\",[]],[\"name/875\",[287,54.116]],[\"comment/875\",[]],[\"name/876\",[288,54.116]],[\"comment/876\",[]],[\"name/877\",[289,54.116]],[\"comment/877\",[]],[\"name/878\",[290,54.116]],[\"comment/878\",[]],[\"name/879\",[291,54.116]],[\"comment/879\",[]],[\"name/880\",[292,54.116]],[\"comment/880\",[]],[\"name/881\",[239,48.239]],[\"comment/881\",[]],[\"name/882\",[25,42.279]],[\"comment/882\",[]],[\"name/883\",[241,49.008]],[\"comment/883\",[]],[\"name/884\",[243,50.752]],[\"comment/884\",[]],[\"name/885\",[245,50.752]],[\"comment/885\",[]],[\"name/886\",[247,50.752]],[\"comment/886\",[]],[\"name/887\",[249,50.752]],[\"comment/887\",[]],[\"name/888\",[48,42.695]],[\"comment/888\",[]],[\"name/889\",[49,41.879]],[\"comment/889\",[]],[\"name/890\",[251,50.752]],[\"comment/890\",[]],[\"name/891\",[252,50.752]],[\"comment/891\",[]],[\"name/892\",[253,49.842]],[\"comment/892\",[]],[\"name/893\",[254,50.752]],[\"comment/893\",[]],[\"name/894\",[255,50.752]],[\"comment/894\",[]],[\"name/895\",[29,44.561]],[\"comment/895\",[]],[\"name/896\",[257,50.752]],[\"comment/896\",[]],[\"name/897\",[258,50.752]],[\"comment/897\",[]],[\"name/898\",[259,50.752]],[\"comment/898\",[]],[\"name/899\",[260,50.752]],[\"comment/899\",[]],[\"name/900\",[261,50.752]],[\"comment/900\",[]],[\"name/901\",[262,50.752]],[\"comment/901\",[]],[\"name/902\",[263,50.752]],[\"comment/902\",[]],[\"name/903\",[264,50.752]],[\"comment/903\",[]],[\"name/904\",[265,50.752]],[\"comment/904\",[]],[\"name/905\",[266,48.239]],[\"comment/905\",[]],[\"name/906\",[267,50.752]],[\"comment/906\",[]],[\"name/907\",[268,50.752]],[\"comment/907\",[]],[\"name/908\",[269,50.752]],[\"comment/908\",[]],[\"name/909\",[270,50.752]],[\"comment/909\",[]],[\"name/910\",[271,50.752]],[\"comment/910\",[]],[\"name/911\",[272,55.547]],[\"comment/911\",[]],[\"name/912\",[273,55.547]],[\"comment/912\",[]],[\"name/913\",[274,55.547]],[\"comment/913\",[]],[\"name/914\",[275,55.547]],[\"comment/914\",[]],[\"name/915\",[276,55.547]],[\"comment/915\",[]],[\"name/916\",[277,54.116]],[\"comment/916\",[]],[\"name/917\",[126,54.116]],[\"comment/917\",[]],[\"name/918\",[278,55.547]],[\"comment/918\",[]],[\"name/919\",[279,55.547]],[\"comment/919\",[]],[\"name/920\",[280,55.547]],[\"comment/920\",[]],[\"name/921\",[281,55.547]],[\"comment/921\",[]],[\"name/922\",[326,70.211]],[\"comment/922\",[]],[\"name/923\",[1,32.293]],[\"comment/923\",[]],[\"name/924\",[327,70.211]],[\"comment/924\",[]],[\"name/925\",[1,32.293]],[\"comment/925\",[]],[\"name/926\",[328,70.211]],[\"comment/926\",[]],[\"name/927\",[329,70.211]],[\"comment/927\",[]],[\"name/928\",[131,46.232]],[\"comment/928\",[]],[\"name/929\",[3,43.13]],[\"comment/929\",[]],[\"name/930\",[229,51.753]],[\"comment/930\",[]],[\"name/931\",[231,51.753]],[\"comment/931\",[]],[\"name/932\",[233,54.116]],[\"comment/932\",[]],[\"name/933\",[235,54.116]],[\"comment/933\",[]],[\"name/934\",[236,52.865]],[\"comment/934\",[]],[\"name/935\",[330,70.211]],[\"comment/935\",[]],[\"name/936\",[1,32.293]],[\"comment/936\",[]],[\"name/937\",[248,50.752]],[\"comment/937\",[]],[\"name/938\",[33,43.585]],[\"comment/938\",[]],[\"name/939\",[250,50.752]],[\"comment/939\",[]],[\"name/940\",[22,46.232]],[\"comment/940\",[]],[\"name/941\",[286,54.116]],[\"comment/941\",[]],[\"name/942\",[256,48.239]],[\"comment/942\",[]],[\"name/943\",[287,54.116]],[\"comment/943\",[]],[\"name/944\",[288,54.116]],[\"comment/944\",[]],[\"name/945\",[289,54.116]],[\"comment/945\",[]],[\"name/946\",[290,54.116]],[\"comment/946\",[]],[\"name/947\",[291,54.116]],[\"comment/947\",[]],[\"name/948\",[292,54.116]],[\"comment/948\",[]],[\"name/949\",[239,48.239]],[\"comment/949\",[]],[\"name/950\",[25,42.279]],[\"comment/950\",[]],[\"name/951\",[241,49.008]],[\"comment/951\",[]],[\"name/952\",[243,50.752]],[\"comment/952\",[]],[\"name/953\",[245,50.752]],[\"comment/953\",[]],[\"name/954\",[247,50.752]],[\"comment/954\",[]],[\"name/955\",[249,50.752]],[\"comment/955\",[]],[\"name/956\",[48,42.695]],[\"comment/956\",[]],[\"name/957\",[49,41.879]],[\"comment/957\",[]],[\"name/958\",[251,50.752]],[\"comment/958\",[]],[\"name/959\",[23,46.857]],[\"comment/959\",[]],[\"name/960\",[252,50.752]],[\"comment/960\",[]],[\"name/961\",[253,49.842]],[\"comment/961\",[]],[\"name/962\",[254,50.752]],[\"comment/962\",[]],[\"name/963\",[255,50.752]],[\"comment/963\",[]],[\"name/964\",[29,44.561]],[\"comment/964\",[]],[\"name/965\",[257,50.752]],[\"comment/965\",[]],[\"name/966\",[258,50.752]],[\"comment/966\",[]],[\"name/967\",[259,50.752]],[\"comment/967\",[]],[\"name/968\",[260,50.752]],[\"comment/968\",[]],[\"name/969\",[261,50.752]],[\"comment/969\",[]],[\"name/970\",[262,50.752]],[\"comment/970\",[]],[\"name/971\",[263,50.752]],[\"comment/971\",[]],[\"name/972\",[264,50.752]],[\"comment/972\",[]],[\"name/973\",[265,50.752]],[\"comment/973\",[]],[\"name/974\",[266,48.239]],[\"comment/974\",[]],[\"name/975\",[267,50.752]],[\"comment/975\",[]],[\"name/976\",[268,50.752]],[\"comment/976\",[]],[\"name/977\",[269,50.752]],[\"comment/977\",[]],[\"name/978\",[270,50.752]],[\"comment/978\",[]],[\"name/979\",[271,50.752]],[\"comment/979\",[]],[\"name/980\",[272,55.547]],[\"comment/980\",[]],[\"name/981\",[273,55.547]],[\"comment/981\",[]],[\"name/982\",[274,55.547]],[\"comment/982\",[]],[\"name/983\",[275,55.547]],[\"comment/983\",[]],[\"name/984\",[276,55.547]],[\"comment/984\",[]],[\"name/985\",[277,54.116]],[\"comment/985\",[]],[\"name/986\",[126,54.116]],[\"comment/986\",[]],[\"name/987\",[278,55.547]],[\"comment/987\",[]],[\"name/988\",[279,55.547]],[\"comment/988\",[]],[\"name/989\",[280,55.547]],[\"comment/989\",[]],[\"name/990\",[281,55.547]],[\"comment/990\",[]],[\"name/991\",[331,70.211]],[\"comment/991\",[]],[\"name/992\",[1,32.293]],[\"comment/992\",[]],[\"name/993\",[332,70.211]],[\"comment/993\",[]],[\"name/994\",[1,32.293]],[\"comment/994\",[]],[\"name/995\",[333,70.211]],[\"comment/995\",[]],[\"name/996\",[1,32.293]],[\"comment/996\",[]],[\"name/997\",[334,65.103]],[\"comment/997\",[]],[\"name/998\",[335,65.103]],[\"comment/998\",[]],[\"name/999\",[131,46.232]],[\"comment/999\",[]],[\"name/1000\",[3,43.13]],[\"comment/1000\",[]],[\"name/1001\",[229,51.753]],[\"comment/1001\",[]],[\"name/1002\",[231,51.753]],[\"comment/1002\",[]],[\"name/1003\",[233,54.116]],[\"comment/1003\",[]],[\"name/1004\",[235,54.116]],[\"comment/1004\",[]],[\"name/1005\",[236,52.865]],[\"comment/1005\",[]],[\"name/1006\",[336,70.211]],[\"comment/1006\",[]],[\"name/1007\",[1,32.293]],[\"comment/1007\",[]],[\"name/1008\",[334,65.103]],[\"comment/1008\",[]],[\"name/1009\",[335,65.103]],[\"comment/1009\",[]],[\"name/1010\",[248,50.752]],[\"comment/1010\",[]],[\"name/1011\",[249,50.752]],[\"comment/1011\",[]],[\"name/1012\",[33,43.585]],[\"comment/1012\",[]],[\"name/1013\",[272,55.547]],[\"comment/1013\",[]],[\"name/1014\",[250,50.752]],[\"comment/1014\",[]],[\"name/1015\",[289,54.116]],[\"comment/1015\",[]],[\"name/1016\",[23,46.857]],[\"comment/1016\",[]],[\"name/1017\",[337,70.211]],[\"comment/1017\",[]],[\"name/1018\",[338,70.211]],[\"comment/1018\",[]],[\"name/1019\",[339,70.211]],[\"comment/1019\",[]],[\"name/1020\",[340,70.211]],[\"comment/1020\",[]],[\"name/1021\",[341,70.211]],[\"comment/1021\",[]],[\"name/1022\",[342,70.211]],[\"comment/1022\",[]],[\"name/1023\",[343,70.211]],[\"comment/1023\",[]],[\"name/1024\",[344,70.211]],[\"comment/1024\",[]],[\"name/1025\",[345,70.211]],[\"comment/1025\",[]],[\"name/1026\",[346,70.211]],[\"comment/1026\",[]],[\"name/1027\",[347,70.211]],[\"comment/1027\",[]],[\"name/1028\",[48,42.695]],[\"comment/1028\",[]],[\"name/1029\",[348,70.211]],[\"comment/1029\",[]],[\"name/1030\",[319,65.103]],[\"comment/1030\",[]],[\"name/1031\",[320,65.103]],[\"comment/1031\",[]],[\"name/1032\",[321,65.103]],[\"comment/1032\",[]],[\"name/1033\",[322,65.103]],[\"comment/1033\",[]],[\"name/1034\",[323,65.103]],[\"comment/1034\",[]],[\"name/1035\",[324,65.103]],[\"comment/1035\",[]],[\"name/1036\",[325,65.103]],[\"comment/1036\",[]],[\"name/1037\",[22,46.232]],[\"comment/1037\",[]],[\"name/1038\",[286,54.116]],[\"comment/1038\",[]],[\"name/1039\",[256,48.239]],[\"comment/1039\",[]],[\"name/1040\",[287,54.116]],[\"comment/1040\",[]],[\"name/1041\",[288,54.116]],[\"comment/1041\",[]],[\"name/1042\",[290,54.116]],[\"comment/1042\",[]],[\"name/1043\",[291,54.116]],[\"comment/1043\",[]],[\"name/1044\",[292,54.116]],[\"comment/1044\",[]],[\"name/1045\",[239,48.239]],[\"comment/1045\",[]],[\"name/1046\",[25,42.279]],[\"comment/1046\",[]],[\"name/1047\",[241,49.008]],[\"comment/1047\",[]],[\"name/1048\",[243,50.752]],[\"comment/1048\",[]],[\"name/1049\",[245,50.752]],[\"comment/1049\",[]],[\"name/1050\",[247,50.752]],[\"comment/1050\",[]],[\"name/1051\",[49,41.879]],[\"comment/1051\",[]],[\"name/1052\",[251,50.752]],[\"comment/1052\",[]],[\"name/1053\",[252,50.752]],[\"comment/1053\",[]],[\"name/1054\",[253,49.842]],[\"comment/1054\",[]],[\"name/1055\",[254,50.752]],[\"comment/1055\",[]],[\"name/1056\",[255,50.752]],[\"comment/1056\",[]],[\"name/1057\",[29,44.561]],[\"comment/1057\",[]],[\"name/1058\",[257,50.752]],[\"comment/1058\",[]],[\"name/1059\",[258,50.752]],[\"comment/1059\",[]],[\"name/1060\",[259,50.752]],[\"comment/1060\",[]],[\"name/1061\",[260,50.752]],[\"comment/1061\",[]],[\"name/1062\",[261,50.752]],[\"comment/1062\",[]],[\"name/1063\",[262,50.752]],[\"comment/1063\",[]],[\"name/1064\",[263,50.752]],[\"comment/1064\",[]],[\"name/1065\",[264,50.752]],[\"comment/1065\",[]],[\"name/1066\",[265,50.752]],[\"comment/1066\",[]],[\"name/1067\",[266,48.239]],[\"comment/1067\",[]],[\"name/1068\",[267,50.752]],[\"comment/1068\",[]],[\"name/1069\",[268,50.752]],[\"comment/1069\",[]],[\"name/1070\",[269,50.752]],[\"comment/1070\",[]],[\"name/1071\",[270,50.752]],[\"comment/1071\",[]],[\"name/1072\",[271,50.752]],[\"comment/1072\",[]],[\"name/1073\",[273,55.547]],[\"comment/1073\",[]],[\"name/1074\",[274,55.547]],[\"comment/1074\",[]],[\"name/1075\",[275,55.547]],[\"comment/1075\",[]],[\"name/1076\",[276,55.547]],[\"comment/1076\",[]],[\"name/1077\",[277,54.116]],[\"comment/1077\",[]],[\"name/1078\",[126,54.116]],[\"comment/1078\",[]],[\"name/1079\",[278,55.547]],[\"comment/1079\",[]],[\"name/1080\",[279,55.547]],[\"comment/1080\",[]],[\"name/1081\",[280,55.547]],[\"comment/1081\",[]],[\"name/1082\",[281,55.547]],[\"comment/1082\",[]],[\"name/1083\",[349,70.211]],[\"comment/1083\",[]],[\"name/1084\",[1,32.293]],[\"comment/1084\",[]],[\"name/1085\",[350,70.211]],[\"comment/1085\",[]],[\"name/1086\",[1,32.293]],[\"comment/1086\",[]],[\"name/1087\",[130,61.738]],[\"comment/1087\",[]],[\"name/1088\",[131,46.232]],[\"comment/1088\",[]],[\"name/1089\",[351,70.211]],[\"comment/1089\",[]],[\"name/1090\",[96,65.103]],[\"comment/1090\",[]],[\"name/1091\",[352,65.103]],[\"comment/1091\",[]],[\"name/1092\",[353,65.103]],[\"comment/1092\",[]],[\"name/1093\",[354,70.211]],[\"comment/1093\",[]],[\"name/1094\",[253,49.842]],[\"comment/1094\",[]],[\"name/1095\",[355,70.211]],[\"comment/1095\",[]],[\"name/1096\",[1,32.293]],[\"comment/1096\",[]],[\"name/1097\",[356,61.738]],[\"comment/1097\",[]],[\"name/1098\",[357,61.738]],[\"comment/1098\",[]],[\"name/1099\",[358,61.738]],[\"comment/1099\",[]],[\"name/1100\",[120,37.009]],[\"comment/1100\",[]],[\"name/1101\",[359,59.225]],[\"comment/1101\",[]],[\"name/1102\",[120,37.009]],[\"comment/1102\",[]],[\"name/1103\",[25,42.279]],[\"comment/1103\",[]],[\"name/1104\",[49,41.879]],[\"comment/1104\",[]],[\"name/1105\",[108,51.753]],[\"comment/1105\",[]],[\"name/1106\",[88,52.865]],[\"comment/1106\",[]],[\"name/1107\",[33,43.585]],[\"comment/1107\",[]],[\"name/1108\",[360,55.547]],[\"comment/1108\",[]],[\"name/1109\",[29,44.561]],[\"comment/1109\",[]],[\"name/1110\",[71,48.239]],[\"comment/1110\",[]],[\"name/1111\",[361,55.547]],[\"comment/1111\",[]],[\"name/1112\",[48,42.695]],[\"comment/1112\",[]],[\"name/1113\",[362,70.211]],[\"comment/1113\",[]],[\"name/1114\",[1,32.293]],[\"comment/1114\",[]],[\"name/1115\",[356,61.738]],[\"comment/1115\",[]],[\"name/1116\",[357,61.738]],[\"comment/1116\",[]],[\"name/1117\",[358,61.738]],[\"comment/1117\",[]],[\"name/1118\",[120,37.009]],[\"comment/1118\",[]],[\"name/1119\",[359,59.225]],[\"comment/1119\",[]],[\"name/1120\",[120,37.009]],[\"comment/1120\",[]],[\"name/1121\",[25,42.279]],[\"comment/1121\",[]],[\"name/1122\",[49,41.879]],[\"comment/1122\",[]],[\"name/1123\",[108,51.753]],[\"comment/1123\",[]],[\"name/1124\",[88,52.865]],[\"comment/1124\",[]],[\"name/1125\",[33,43.585]],[\"comment/1125\",[]],[\"name/1126\",[360,55.547]],[\"comment/1126\",[]],[\"name/1127\",[29,44.561]],[\"comment/1127\",[]],[\"name/1128\",[71,48.239]],[\"comment/1128\",[]],[\"name/1129\",[361,55.547]],[\"comment/1129\",[]],[\"name/1130\",[48,42.695]],[\"comment/1130\",[]],[\"name/1131\",[363,70.211]],[\"comment/1131\",[]],[\"name/1132\",[1,32.293]],[\"comment/1132\",[]],[\"name/1133\",[364,70.211]],[\"comment/1133\",[]],[\"name/1134\",[365,70.211]],[\"comment/1134\",[]],[\"name/1135\",[52,52.865]],[\"comment/1135\",[]],[\"name/1136\",[3,43.13]],[\"comment/1136\",[]],[\"name/1137\",[366,70.211]],[\"comment/1137\",[]],[\"name/1138\",[1,32.293]],[\"comment/1138\",[]],[\"name/1139\",[356,61.738]],[\"comment/1139\",[]],[\"name/1140\",[357,61.738]],[\"comment/1140\",[]],[\"name/1141\",[358,61.738]],[\"comment/1141\",[]],[\"name/1142\",[120,37.009]],[\"comment/1142\",[]],[\"name/1143\",[359,59.225]],[\"comment/1143\",[]],[\"name/1144\",[120,37.009]],[\"comment/1144\",[]],[\"name/1145\",[25,42.279]],[\"comment/1145\",[]],[\"name/1146\",[49,41.879]],[\"comment/1146\",[]],[\"name/1147\",[108,51.753]],[\"comment/1147\",[]],[\"name/1148\",[88,52.865]],[\"comment/1148\",[]],[\"name/1149\",[33,43.585]],[\"comment/1149\",[]],[\"name/1150\",[360,55.547]],[\"comment/1150\",[]],[\"name/1151\",[29,44.561]],[\"comment/1151\",[]],[\"name/1152\",[71,48.239]],[\"comment/1152\",[]],[\"name/1153\",[361,55.547]],[\"comment/1153\",[]],[\"name/1154\",[48,42.695]],[\"comment/1154\",[]],[\"name/1155\",[367,70.211]],[\"comment/1155\",[]],[\"name/1156\",[368,61.738]],[\"comment/1156\",[]],[\"name/1157\",[369,61.738]],[\"comment/1157\",[]],[\"name/1158\",[1,32.293]],[\"comment/1158\",[]],[\"name/1159\",[114,55.547]],[\"comment/1159\",[]],[\"name/1160\",[115,55.547]],[\"comment/1160\",[]],[\"name/1161\",[25,42.279]],[\"comment/1161\",[]],[\"name/1162\",[256,48.239]],[\"comment/1162\",[]],[\"name/1163\",[33,43.585]],[\"comment/1163\",[]],[\"name/1164\",[29,44.561]],[\"comment/1164\",[]],[\"name/1165\",[108,51.753]],[\"comment/1165\",[]],[\"name/1166\",[360,55.547]],[\"comment/1166\",[]],[\"name/1167\",[370,61.738]],[\"comment/1167\",[]],[\"name/1168\",[49,41.879]],[\"comment/1168\",[]],[\"name/1169\",[48,42.695]],[\"comment/1169\",[]],[\"name/1170\",[71,48.239]],[\"comment/1170\",[]],[\"name/1171\",[109,57.218]],[\"comment/1171\",[]],[\"name/1172\",[371,61.738]],[\"comment/1172\",[]],[\"name/1173\",[361,55.547]],[\"comment/1173\",[]],[\"name/1174\",[266,48.239]],[\"comment/1174\",[]],[\"name/1175\",[372,61.738]],[\"comment/1175\",[]],[\"name/1176\",[291,54.116]],[\"comment/1176\",[]],[\"name/1177\",[292,54.116]],[\"comment/1177\",[]],[\"name/1178\",[373,61.738]],[\"comment/1178\",[]],[\"name/1179\",[374,61.738]],[\"comment/1179\",[]],[\"name/1180\",[375,61.738]],[\"comment/1180\",[]],[\"name/1181\",[376,61.738]],[\"comment/1181\",[]],[\"name/1182\",[377,61.738]],[\"comment/1182\",[]],[\"name/1183\",[378,61.738]],[\"comment/1183\",[]],[\"name/1184\",[379,61.738]],[\"comment/1184\",[]],[\"name/1185\",[380,61.738]],[\"comment/1185\",[]],[\"name/1186\",[381,61.738]],[\"comment/1186\",[]],[\"name/1187\",[382,70.211]],[\"comment/1187\",[]],[\"name/1188\",[368,61.738]],[\"comment/1188\",[]],[\"name/1189\",[369,61.738]],[\"comment/1189\",[]],[\"name/1190\",[1,32.293]],[\"comment/1190\",[]],[\"name/1191\",[114,55.547]],[\"comment/1191\",[]],[\"name/1192\",[115,55.547]],[\"comment/1192\",[]],[\"name/1193\",[25,42.279]],[\"comment/1193\",[]],[\"name/1194\",[256,48.239]],[\"comment/1194\",[]],[\"name/1195\",[33,43.585]],[\"comment/1195\",[]],[\"name/1196\",[29,44.561]],[\"comment/1196\",[]],[\"name/1197\",[108,51.753]],[\"comment/1197\",[]],[\"name/1198\",[360,55.547]],[\"comment/1198\",[]],[\"name/1199\",[370,61.738]],[\"comment/1199\",[]],[\"name/1200\",[49,41.879]],[\"comment/1200\",[]],[\"name/1201\",[48,42.695]],[\"comment/1201\",[]],[\"name/1202\",[71,48.239]],[\"comment/1202\",[]],[\"name/1203\",[109,57.218]],[\"comment/1203\",[]],[\"name/1204\",[371,61.738]],[\"comment/1204\",[]],[\"name/1205\",[361,55.547]],[\"comment/1205\",[]],[\"name/1206\",[266,48.239]],[\"comment/1206\",[]],[\"name/1207\",[372,61.738]],[\"comment/1207\",[]],[\"name/1208\",[291,54.116]],[\"comment/1208\",[]],[\"name/1209\",[292,54.116]],[\"comment/1209\",[]],[\"name/1210\",[373,61.738]],[\"comment/1210\",[]],[\"name/1211\",[374,61.738]],[\"comment/1211\",[]],[\"name/1212\",[375,61.738]],[\"comment/1212\",[]],[\"name/1213\",[376,61.738]],[\"comment/1213\",[]],[\"name/1214\",[377,61.738]],[\"comment/1214\",[]],[\"name/1215\",[378,61.738]],[\"comment/1215\",[]],[\"name/1216\",[379,61.738]],[\"comment/1216\",[]],[\"name/1217\",[380,61.738]],[\"comment/1217\",[]],[\"name/1218\",[381,61.738]],[\"comment/1218\",[]],[\"name/1219\",[383,70.211]],[\"comment/1219\",[]],[\"name/1220\",[368,61.738]],[\"comment/1220\",[]],[\"name/1221\",[369,61.738]],[\"comment/1221\",[]],[\"name/1222\",[1,32.293]],[\"comment/1222\",[]],[\"name/1223\",[114,55.547]],[\"comment/1223\",[]],[\"name/1224\",[115,55.547]],[\"comment/1224\",[]],[\"name/1225\",[25,42.279]],[\"comment/1225\",[]],[\"name/1226\",[256,48.239]],[\"comment/1226\",[]],[\"name/1227\",[33,43.585]],[\"comment/1227\",[]],[\"name/1228\",[29,44.561]],[\"comment/1228\",[]],[\"name/1229\",[108,51.753]],[\"comment/1229\",[]],[\"name/1230\",[360,55.547]],[\"comment/1230\",[]],[\"name/1231\",[370,61.738]],[\"comment/1231\",[]],[\"name/1232\",[49,41.879]],[\"comment/1232\",[]],[\"name/1233\",[48,42.695]],[\"comment/1233\",[]],[\"name/1234\",[71,48.239]],[\"comment/1234\",[]],[\"name/1235\",[109,57.218]],[\"comment/1235\",[]],[\"name/1236\",[371,61.738]],[\"comment/1236\",[]],[\"name/1237\",[361,55.547]],[\"comment/1237\",[]],[\"name/1238\",[266,48.239]],[\"comment/1238\",[]],[\"name/1239\",[372,61.738]],[\"comment/1239\",[]],[\"name/1240\",[291,54.116]],[\"comment/1240\",[]],[\"name/1241\",[292,54.116]],[\"comment/1241\",[]],[\"name/1242\",[373,61.738]],[\"comment/1242\",[]],[\"name/1243\",[374,61.738]],[\"comment/1243\",[]],[\"name/1244\",[375,61.738]],[\"comment/1244\",[]],[\"name/1245\",[376,61.738]],[\"comment/1245\",[]],[\"name/1246\",[377,61.738]],[\"comment/1246\",[]],[\"name/1247\",[378,61.738]],[\"comment/1247\",[]],[\"name/1248\",[379,61.738]],[\"comment/1248\",[]],[\"name/1249\",[380,61.738]],[\"comment/1249\",[]],[\"name/1250\",[381,61.738]],[\"comment/1250\",[]],[\"name/1251\",[384,70.211]],[\"comment/1251\",[]],[\"name/1252\",[1,32.293]],[\"comment/1252\",[]],[\"name/1253\",[385,61.738]],[\"comment/1253\",[]],[\"name/1254\",[71,48.239]],[\"comment/1254\",[]],[\"name/1255\",[386,70.211]],[\"comment/1255\",[]],[\"name/1256\",[33,43.585]],[\"comment/1256\",[]],[\"name/1257\",[387,65.103]],[\"comment/1257\",[]],[\"name/1258\",[388,70.211]],[\"comment/1258\",[]],[\"name/1259\",[389,65.103]],[\"comment/1259\",[]],[\"name/1260\",[390,70.211]],[\"comment/1260\",[]],[\"name/1261\",[391,70.211]],[\"comment/1261\",[]],[\"name/1262\",[392,70.211]],[\"comment/1262\",[]],[\"name/1263\",[393,70.211]],[\"comment/1263\",[]],[\"name/1264\",[394,70.211]],[\"comment/1264\",[]],[\"name/1265\",[395,70.211]],[\"comment/1265\",[]],[\"name/1266\",[72,57.218]],[\"comment/1266\",[]],[\"name/1267\",[396,70.211]],[\"comment/1267\",[]],[\"name/1268\",[397,70.211]],[\"comment/1268\",[]],[\"name/1269\",[398,70.211]],[\"comment/1269\",[]],[\"name/1270\",[399,70.211]],[\"comment/1270\",[]],[\"name/1271\",[400,70.211]],[\"comment/1271\",[]],[\"name/1272\",[401,70.211]],[\"comment/1272\",[]],[\"name/1273\",[402,70.211]],[\"comment/1273\",[]],[\"name/1274\",[1,32.293]],[\"comment/1274\",[]],[\"name/1275\",[403,70.211]],[\"comment/1275\",[]],[\"name/1276\",[404,70.211]],[\"comment/1276\",[]],[\"name/1277\",[405,70.211]],[\"comment/1277\",[]],[\"name/1278\",[406,70.211]],[\"comment/1278\",[]],[\"name/1279\",[61,57.218]],[\"comment/1279\",[]],[\"name/1280\",[407,70.211]],[\"comment/1280\",[]],[\"name/1281\",[408,70.211]],[\"comment/1281\",[]],[\"name/1282\",[409,70.211]],[\"comment/1282\",[]],[\"name/1283\",[410,70.211]],[\"comment/1283\",[]],[\"name/1284\",[411,70.211]],[\"comment/1284\",[]],[\"name/1285\",[412,70.211]],[\"comment/1285\",[]],[\"name/1286\",[33,43.585]],[\"comment/1286\",[]],[\"name/1287\",[387,65.103]],[\"comment/1287\",[]],[\"name/1288\",[389,65.103]],[\"comment/1288\",[]],[\"name/1289\",[413,70.211]],[\"comment/1289\",[]],[\"name/1290\",[414,70.211]],[\"comment/1290\",[]],[\"name/1291\",[415,70.211]],[\"comment/1291\",[]],[\"name/1292\",[416,70.211]],[\"comment/1292\",[]],[\"name/1293\",[417,70.211]],[\"comment/1293\",[]],[\"name/1294\",[418,70.211]],[\"comment/1294\",[]],[\"name/1295\",[1,32.293]],[\"comment/1295\",[]],[\"name/1296\",[385,61.738]],[\"comment/1296\",[]],[\"name/1297\",[419,70.211]],[\"comment/1297\",[]],[\"name/1298\",[420,70.211]],[\"comment/1298\",[]],[\"name/1299\",[421,70.211]],[\"comment/1299\",[]],[\"name/1300\",[1,32.293]],[\"comment/1300\",[]],[\"name/1301\",[422,65.103]],[\"comment/1301\",[]],[\"name/1302\",[423,70.211]],[\"comment/1302\",[]],[\"name/1303\",[120,37.009]],[\"comment/1303\",[]],[\"name/1304\",[424,70.211]],[\"comment/1304\",[]],[\"name/1305\",[1,32.293]],[\"comment/1305\",[]],[\"name/1306\",[425,65.103]],[\"comment/1306\",[]],[\"name/1307\",[120,37.009]],[\"comment/1307\",[]],[\"name/1308\",[385,61.738]],[\"comment/1308\",[]],[\"name/1309\",[426,70.211]],[\"comment/1309\",[]],[\"name/1310\",[427,70.211]],[\"comment/1310\",[]],[\"name/1311\",[428,70.211]],[\"comment/1311\",[]],[\"name/1312\",[303,61.738]],[\"comment/1312\",[]],[\"name/1313\",[429,70.211]],[\"comment/1313\",[]],[\"name/1314\",[430,70.211]],[\"comment/1314\",[]],[\"name/1315\",[431,70.211]],[\"comment/1315\",[]],[\"name/1316\",[1,32.293]],[\"comment/1316\",[]],[\"name/1317\",[52,52.865]],[\"comment/1317\",[]],[\"name/1318\",[3,43.13]],[\"comment/1318\",[]],[\"name/1319\",[352,65.103]],[\"comment/1319\",[]],[\"name/1320\",[353,65.103]],[\"comment/1320\",[]],[\"name/1321\",[432,70.211]],[\"comment/1321\",[]],[\"name/1322\",[433,70.211]],[\"comment/1322\",[]],[\"name/1323\",[434,70.211]],[\"comment/1323\",[]],[\"name/1324\",[1,32.293]],[\"comment/1324\",[]],[\"name/1325\",[238,61.738]],[\"comment/1325\",[]],[\"name/1326\",[239,48.239]],[\"comment/1326\",[]],[\"name/1327\",[33,43.585]],[\"comment/1327\",[]],[\"name/1328\",[29,44.561]],[\"comment/1328\",[]],[\"name/1329\",[23,46.857]],[\"comment/1329\",[]],[\"name/1330\",[435,70.211]],[\"comment/1330\",[]],[\"name/1331\",[436,70.211]],[\"comment/1331\",[]],[\"name/1332\",[437,70.211]],[\"comment/1332\",[]],[\"name/1333\",[438,70.211]],[\"comment/1333\",[]],[\"name/1334\",[439,70.211]],[\"comment/1334\",[]],[\"name/1335\",[440,70.211]],[\"comment/1335\",[]],[\"name/1336\",[441,70.211]],[\"comment/1336\",[]],[\"name/1337\",[442,70.211]],[\"comment/1337\",[]],[\"name/1338\",[443,70.211]],[\"comment/1338\",[]],[\"name/1339\",[444,70.211]],[\"comment/1339\",[]],[\"name/1340\",[445,70.211]],[\"comment/1340\",[]],[\"name/1341\",[446,70.211]],[\"comment/1341\",[]],[\"name/1342\",[447,70.211]],[\"comment/1342\",[]],[\"name/1343\",[131,46.232]],[\"comment/1343\",[]],[\"name/1344\",[3,43.13]],[\"comment/1344\",[]],[\"name/1345\",[229,51.753]],[\"comment/1345\",[]],[\"name/1346\",[231,51.753]],[\"comment/1346\",[]],[\"name/1347\",[233,54.116]],[\"comment/1347\",[]],[\"name/1348\",[236,52.865]],[\"comment/1348\",[]],[\"name/1349\",[235,54.116]],[\"comment/1349\",[]],[\"name/1350\",[448,70.211]],[\"comment/1350\",[]],[\"name/1351\",[248,50.752]],[\"comment/1351\",[]],[\"name/1352\",[241,49.008]],[\"comment/1352\",[]],[\"name/1353\",[243,50.752]],[\"comment/1353\",[]],[\"name/1354\",[245,50.752]],[\"comment/1354\",[]],[\"name/1355\",[247,50.752]],[\"comment/1355\",[]],[\"name/1356\",[239,48.239]],[\"comment/1356\",[]],[\"name/1357\",[25,42.279]],[\"comment/1357\",[]],[\"name/1358\",[249,50.752]],[\"comment/1358\",[]],[\"name/1359\",[48,42.695]],[\"comment/1359\",[]],[\"name/1360\",[49,41.879]],[\"comment/1360\",[]],[\"name/1361\",[33,43.585]],[\"comment/1361\",[]],[\"name/1362\",[250,50.752]],[\"comment/1362\",[]],[\"name/1363\",[251,50.752]],[\"comment/1363\",[]],[\"name/1364\",[23,46.857]],[\"comment/1364\",[]],[\"name/1365\",[252,50.752]],[\"comment/1365\",[]],[\"name/1366\",[253,49.842]],[\"comment/1366\",[]],[\"name/1367\",[254,50.752]],[\"comment/1367\",[]],[\"name/1368\",[255,50.752]],[\"comment/1368\",[]],[\"name/1369\",[256,48.239]],[\"comment/1369\",[]],[\"name/1370\",[29,44.561]],[\"comment/1370\",[]],[\"name/1371\",[22,46.232]],[\"comment/1371\",[]],[\"name/1372\",[257,50.752]],[\"comment/1372\",[]],[\"name/1373\",[258,50.752]],[\"comment/1373\",[]],[\"name/1374\",[259,50.752]],[\"comment/1374\",[]],[\"name/1375\",[260,50.752]],[\"comment/1375\",[]],[\"name/1376\",[261,50.752]],[\"comment/1376\",[]],[\"name/1377\",[262,50.752]],[\"comment/1377\",[]],[\"name/1378\",[263,50.752]],[\"comment/1378\",[]],[\"name/1379\",[264,50.752]],[\"comment/1379\",[]],[\"name/1380\",[265,50.752]],[\"comment/1380\",[]],[\"name/1381\",[266,48.239]],[\"comment/1381\",[]],[\"name/1382\",[267,50.752]],[\"comment/1382\",[]],[\"name/1383\",[268,50.752]],[\"comment/1383\",[]],[\"name/1384\",[269,50.752]],[\"comment/1384\",[]],[\"name/1385\",[270,50.752]],[\"comment/1385\",[]],[\"name/1386\",[271,50.752]],[\"comment/1386\",[]],[\"name/1387\",[449,70.211]],[\"comment/1387\",[]],[\"name/1388\",[151,54.116]],[\"comment/1388\",[]],[\"name/1389\",[152,54.116]],[\"comment/1389\",[]],[\"name/1390\",[153,54.116]],[\"comment/1390\",[]],[\"name/1391\",[154,54.116]],[\"comment/1391\",[]],[\"name/1392\",[145,54.116]],[\"comment/1392\",[]],[\"name/1393\",[147,54.116]],[\"comment/1393\",[]],[\"name/1394\",[155,54.116]],[\"comment/1394\",[]],[\"name/1395\",[144,54.116]],[\"comment/1395\",[]],[\"name/1396\",[146,54.116]],[\"comment/1396\",[]],[\"name/1397\",[156,54.116]],[\"comment/1397\",[]],[\"name/1398\",[143,54.116]],[\"comment/1398\",[]],[\"name/1399\",[157,54.116]],[\"comment/1399\",[]],[\"name/1400\",[161,54.116]],[\"comment/1400\",[]],[\"name/1401\",[148,54.116]],[\"comment/1401\",[]],[\"name/1402\",[450,70.211]],[\"comment/1402\",[]],[\"name/1403\",[451,70.211]],[\"comment/1403\",[]],[\"name/1404\",[33,43.585]],[\"comment/1404\",[]],[\"name/1405\",[23,46.857]],[\"comment/1405\",[]],[\"name/1406\",[248,50.752]],[\"comment/1406\",[]],[\"name/1407\",[22,46.232]],[\"comment/1407\",[]],[\"name/1408\",[286,54.116]],[\"comment/1408\",[]],[\"name/1409\",[256,48.239]],[\"comment/1409\",[]],[\"name/1410\",[287,54.116]],[\"comment/1410\",[]],[\"name/1411\",[288,54.116]],[\"comment/1411\",[]],[\"name/1412\",[289,54.116]],[\"comment/1412\",[]],[\"name/1413\",[290,54.116]],[\"comment/1413\",[]],[\"name/1414\",[241,49.008]],[\"comment/1414\",[]],[\"name/1415\",[243,50.752]],[\"comment/1415\",[]],[\"name/1416\",[245,50.752]],[\"comment/1416\",[]],[\"name/1417\",[247,50.752]],[\"comment/1417\",[]],[\"name/1418\",[239,48.239]],[\"comment/1418\",[]],[\"name/1419\",[25,42.279]],[\"comment/1419\",[]],[\"name/1420\",[249,50.752]],[\"comment/1420\",[]],[\"name/1421\",[48,42.695]],[\"comment/1421\",[]],[\"name/1422\",[49,41.879]],[\"comment/1422\",[]],[\"name/1423\",[250,50.752]],[\"comment/1423\",[]],[\"name/1424\",[251,50.752]],[\"comment/1424\",[]],[\"name/1425\",[252,50.752]],[\"comment/1425\",[]],[\"name/1426\",[253,49.842]],[\"comment/1426\",[]],[\"name/1427\",[254,50.752]],[\"comment/1427\",[]],[\"name/1428\",[255,50.752]],[\"comment/1428\",[]],[\"name/1429\",[29,44.561]],[\"comment/1429\",[]],[\"name/1430\",[257,50.752]],[\"comment/1430\",[]],[\"name/1431\",[258,50.752]],[\"comment/1431\",[]],[\"name/1432\",[259,50.752]],[\"comment/1432\",[]],[\"name/1433\",[260,50.752]],[\"comment/1433\",[]],[\"name/1434\",[261,50.752]],[\"comment/1434\",[]],[\"name/1435\",[262,50.752]],[\"comment/1435\",[]],[\"name/1436\",[263,50.752]],[\"comment/1436\",[]],[\"name/1437\",[264,50.752]],[\"comment/1437\",[]],[\"name/1438\",[265,50.752]],[\"comment/1438\",[]],[\"name/1439\",[266,48.239]],[\"comment/1439\",[]],[\"name/1440\",[267,50.752]],[\"comment/1440\",[]],[\"name/1441\",[268,50.752]],[\"comment/1441\",[]],[\"name/1442\",[269,50.752]],[\"comment/1442\",[]],[\"name/1443\",[270,50.752]],[\"comment/1443\",[]],[\"name/1444\",[271,50.752]],[\"comment/1444\",[]],[\"name/1445\",[452,70.211]],[\"comment/1445\",[]],[\"name/1446\",[453,70.211]],[\"comment/1446\",[]],[\"name/1447\",[454,70.211]],[\"comment/1447\",[]],[\"name/1448\",[455,70.211]],[\"comment/1448\",[]],[\"name/1449\",[248,50.752]],[\"comment/1449\",[]],[\"name/1450\",[33,43.585]],[\"comment/1450\",[]],[\"name/1451\",[22,46.232]],[\"comment/1451\",[]],[\"name/1452\",[286,54.116]],[\"comment/1452\",[]],[\"name/1453\",[23,46.857]],[\"comment/1453\",[]],[\"name/1454\",[256,48.239]],[\"comment/1454\",[]],[\"name/1455\",[287,54.116]],[\"comment/1455\",[]],[\"name/1456\",[288,54.116]],[\"comment/1456\",[]],[\"name/1457\",[289,54.116]],[\"comment/1457\",[]],[\"name/1458\",[290,54.116]],[\"comment/1458\",[]],[\"name/1459\",[241,49.008]],[\"comment/1459\",[]],[\"name/1460\",[243,50.752]],[\"comment/1460\",[]],[\"name/1461\",[245,50.752]],[\"comment/1461\",[]],[\"name/1462\",[247,50.752]],[\"comment/1462\",[]],[\"name/1463\",[239,48.239]],[\"comment/1463\",[]],[\"name/1464\",[25,42.279]],[\"comment/1464\",[]],[\"name/1465\",[249,50.752]],[\"comment/1465\",[]],[\"name/1466\",[48,42.695]],[\"comment/1466\",[]],[\"name/1467\",[49,41.879]],[\"comment/1467\",[]],[\"name/1468\",[250,50.752]],[\"comment/1468\",[]],[\"name/1469\",[251,50.752]],[\"comment/1469\",[]],[\"name/1470\",[252,50.752]],[\"comment/1470\",[]],[\"name/1471\",[253,49.842]],[\"comment/1471\",[]],[\"name/1472\",[254,50.752]],[\"comment/1472\",[]],[\"name/1473\",[255,50.752]],[\"comment/1473\",[]],[\"name/1474\",[29,44.561]],[\"comment/1474\",[]],[\"name/1475\",[257,50.752]],[\"comment/1475\",[]],[\"name/1476\",[258,50.752]],[\"comment/1476\",[]],[\"name/1477\",[259,50.752]],[\"comment/1477\",[]],[\"name/1478\",[260,50.752]],[\"comment/1478\",[]],[\"name/1479\",[261,50.752]],[\"comment/1479\",[]],[\"name/1480\",[262,50.752]],[\"comment/1480\",[]],[\"name/1481\",[263,50.752]],[\"comment/1481\",[]],[\"name/1482\",[264,50.752]],[\"comment/1482\",[]],[\"name/1483\",[265,50.752]],[\"comment/1483\",[]],[\"name/1484\",[266,48.239]],[\"comment/1484\",[]],[\"name/1485\",[267,50.752]],[\"comment/1485\",[]],[\"name/1486\",[268,50.752]],[\"comment/1486\",[]],[\"name/1487\",[269,50.752]],[\"comment/1487\",[]],[\"name/1488\",[270,50.752]],[\"comment/1488\",[]],[\"name/1489\",[271,50.752]],[\"comment/1489\",[]],[\"name/1490\",[456,70.211]],[\"comment/1490\",[]],[\"name/1491\",[199,61.738]],[\"comment/1491\",[]],[\"name/1492\",[200,61.738]],[\"comment/1492\",[]],[\"name/1493\",[201,61.738]],[\"comment/1493\",[]],[\"name/1494\",[202,61.738]],[\"comment/1494\",[]],[\"name/1495\",[203,61.738]],[\"comment/1495\",[]],[\"name/1496\",[204,61.738]],[\"comment/1496\",[]],[\"name/1497\",[197,61.738]],[\"comment/1497\",[]],[\"name/1498\",[198,61.738]],[\"comment/1498\",[]],[\"name/1499\",[151,54.116]],[\"comment/1499\",[]],[\"name/1500\",[152,54.116]],[\"comment/1500\",[]],[\"name/1501\",[153,54.116]],[\"comment/1501\",[]],[\"name/1502\",[154,54.116]],[\"comment/1502\",[]],[\"name/1503\",[145,54.116]],[\"comment/1503\",[]],[\"name/1504\",[147,54.116]],[\"comment/1504\",[]],[\"name/1505\",[155,54.116]],[\"comment/1505\",[]],[\"name/1506\",[144,54.116]],[\"comment/1506\",[]],[\"name/1507\",[146,54.116]],[\"comment/1507\",[]],[\"name/1508\",[156,54.116]],[\"comment/1508\",[]],[\"name/1509\",[143,54.116]],[\"comment/1509\",[]],[\"name/1510\",[157,54.116]],[\"comment/1510\",[]],[\"name/1511\",[161,54.116]],[\"comment/1511\",[]],[\"name/1512\",[148,54.116]],[\"comment/1512\",[]],[\"name/1513\",[457,70.211]],[\"comment/1513\",[]],[\"name/1514\",[458,70.211]],[\"comment/1514\",[]],[\"name/1515\",[248,50.752]],[\"comment/1515\",[]],[\"name/1516\",[33,43.585]],[\"comment/1516\",[]],[\"name/1517\",[22,46.232]],[\"comment/1517\",[]],[\"name/1518\",[286,54.116]],[\"comment/1518\",[]],[\"name/1519\",[23,46.857]],[\"comment/1519\",[]],[\"name/1520\",[256,48.239]],[\"comment/1520\",[]],[\"name/1521\",[287,54.116]],[\"comment/1521\",[]],[\"name/1522\",[288,54.116]],[\"comment/1522\",[]],[\"name/1523\",[289,54.116]],[\"comment/1523\",[]],[\"name/1524\",[290,54.116]],[\"comment/1524\",[]],[\"name/1525\",[241,49.008]],[\"comment/1525\",[]],[\"name/1526\",[243,50.752]],[\"comment/1526\",[]],[\"name/1527\",[245,50.752]],[\"comment/1527\",[]],[\"name/1528\",[247,50.752]],[\"comment/1528\",[]],[\"name/1529\",[239,48.239]],[\"comment/1529\",[]],[\"name/1530\",[25,42.279]],[\"comment/1530\",[]],[\"name/1531\",[249,50.752]],[\"comment/1531\",[]],[\"name/1532\",[48,42.695]],[\"comment/1532\",[]],[\"name/1533\",[49,41.879]],[\"comment/1533\",[]],[\"name/1534\",[250,50.752]],[\"comment/1534\",[]],[\"name/1535\",[251,50.752]],[\"comment/1535\",[]],[\"name/1536\",[252,50.752]],[\"comment/1536\",[]],[\"name/1537\",[253,49.842]],[\"comment/1537\",[]],[\"name/1538\",[254,50.752]],[\"comment/1538\",[]],[\"name/1539\",[255,50.752]],[\"comment/1539\",[]],[\"name/1540\",[29,44.561]],[\"comment/1540\",[]],[\"name/1541\",[257,50.752]],[\"comment/1541\",[]],[\"name/1542\",[258,50.752]],[\"comment/1542\",[]],[\"name/1543\",[259,50.752]],[\"comment/1543\",[]],[\"name/1544\",[260,50.752]],[\"comment/1544\",[]],[\"name/1545\",[261,50.752]],[\"comment/1545\",[]],[\"name/1546\",[262,50.752]],[\"comment/1546\",[]],[\"name/1547\",[263,50.752]],[\"comment/1547\",[]],[\"name/1548\",[264,50.752]],[\"comment/1548\",[]],[\"name/1549\",[265,50.752]],[\"comment/1549\",[]],[\"name/1550\",[266,48.239]],[\"comment/1550\",[]],[\"name/1551\",[267,50.752]],[\"comment/1551\",[]],[\"name/1552\",[268,50.752]],[\"comment/1552\",[]],[\"name/1553\",[269,50.752]],[\"comment/1553\",[]],[\"name/1554\",[270,50.752]],[\"comment/1554\",[]],[\"name/1555\",[271,50.752]],[\"comment/1555\",[]],[\"name/1556\",[459,70.211]],[\"comment/1556\",[]],[\"name/1557\",[460,70.211]],[\"comment/1557\",[]],[\"name/1558\",[461,70.211]],[\"comment/1558\",[]],[\"name/1559\",[214,65.103]],[\"comment/1559\",[]],[\"name/1560\",[151,54.116]],[\"comment/1560\",[]],[\"name/1561\",[152,54.116]],[\"comment/1561\",[]],[\"name/1562\",[153,54.116]],[\"comment/1562\",[]],[\"name/1563\",[154,54.116]],[\"comment/1563\",[]],[\"name/1564\",[145,54.116]],[\"comment/1564\",[]],[\"name/1565\",[147,54.116]],[\"comment/1565\",[]],[\"name/1566\",[155,54.116]],[\"comment/1566\",[]],[\"name/1567\",[144,54.116]],[\"comment/1567\",[]],[\"name/1568\",[146,54.116]],[\"comment/1568\",[]],[\"name/1569\",[156,54.116]],[\"comment/1569\",[]],[\"name/1570\",[143,54.116]],[\"comment/1570\",[]],[\"name/1571\",[157,54.116]],[\"comment/1571\",[]],[\"name/1572\",[161,54.116]],[\"comment/1572\",[]],[\"name/1573\",[148,54.116]],[\"comment/1573\",[]],[\"name/1574\",[462,70.211]],[\"comment/1574\",[]],[\"name/1575\",[463,70.211]],[\"comment/1575\",[]],[\"name/1576\",[464,70.211]],[\"comment/1576\",[]],[\"name/1577\",[120,37.009]],[\"comment/1577\",[]],[\"name/1578\",[465,70.211]],[\"comment/1578\",[]],[\"name/1579\",[466,70.211]],[\"comment/1579\",[]],[\"name/1580\",[467,70.211]],[\"comment/1580\",[]],[\"name/1581\",[468,70.211]],[\"comment/1581\",[]],[\"name/1582\",[469,70.211]],[\"comment/1582\",[]],[\"name/1583\",[470,70.211]],[\"comment/1583\",[]],[\"name/1584\",[471,70.211]],[\"comment/1584\",[]],[\"name/1585\",[472,70.211]],[\"comment/1585\",[]],[\"name/1586\",[473,70.211]],[\"comment/1586\",[]],[\"name/1587\",[474,70.211]],[\"comment/1587\",[]],[\"name/1588\",[475,70.211]],[\"comment/1588\",[]],[\"name/1589\",[476,70.211]],[\"comment/1589\",[]],[\"name/1590\",[477,70.211]],[\"comment/1590\",[]],[\"name/1591\",[478,70.211]],[\"comment/1591\",[]],[\"name/1592\",[479,70.211]],[\"comment/1592\",[]],[\"name/1593\",[241,49.008]],[\"comment/1593\",[]],[\"name/1594\",[480,70.211]],[\"comment/1594\",[]],[\"name/1595\",[481,70.211]],[\"comment/1595\",[]],[\"name/1596\",[236,52.865]],[\"comment/1596\",[]],[\"name/1597\",[239,48.239]],[\"comment/1597\",[]],[\"name/1598\",[229,51.753]],[\"comment/1598\",[]],[\"name/1599\",[231,51.753]],[\"comment/1599\",[]],[\"name/1600\",[482,70.211]],[\"comment/1600\",[]],[\"name/1601\",[483,70.211]],[\"comment/1601\",[]],[\"name/1602\",[484,70.211]],[\"comment/1602\",[]],[\"name/1603\",[485,70.211]],[\"comment/1603\",[]],[\"name/1604\",[486,70.211]],[\"comment/1604\",[]],[\"name/1605\",[487,70.211]],[\"comment/1605\",[]],[\"name/1606\",[488,70.211]],[\"comment/1606\",[]],[\"name/1607\",[489,70.211]],[\"comment/1607\",[]],[\"name/1608\",[490,70.211]],[\"comment/1608\",[]],[\"name/1609\",[120,37.009]],[\"comment/1609\",[]],[\"name/1610\",[491,70.211]],[\"comment/1610\",[]],[\"name/1611\",[492,70.211]],[\"comment/1611\",[]],[\"name/1612\",[493,70.211]],[\"comment/1612\",[]],[\"name/1613\",[494,70.211]],[\"comment/1613\",[]],[\"name/1614\",[495,70.211]],[\"comment/1614\",[]],[\"name/1615\",[496,70.211]],[\"comment/1615\",[]],[\"name/1616\",[120,37.009]],[\"comment/1616\",[]],[\"name/1617\",[241,49.008]],[\"comment/1617\",[]],[\"name/1618\",[497,70.211]],[\"comment/1618\",[]],[\"name/1619\",[498,70.211]],[\"comment/1619\",[]],[\"name/1620\",[499,70.211]],[\"comment/1620\",[]],[\"name/1621\",[500,70.211]],[\"comment/1621\",[]],[\"name/1622\",[501,70.211]],[\"comment/1622\",[]],[\"name/1623\",[502,70.211]],[\"comment/1623\",[]],[\"name/1624\",[503,70.211]],[\"comment/1624\",[]],[\"name/1625\",[3,43.13]],[\"comment/1625\",[]],[\"name/1626\",[504,70.211]],[\"comment/1626\",[]],[\"name/1627\",[131,46.232]],[\"comment/1627\",[]],[\"name/1628\",[505,70.211]],[\"comment/1628\",[]],[\"name/1629\",[120,37.009]],[\"comment/1629\",[]],[\"name/1630\",[506,70.211]],[\"comment/1630\",[]],[\"name/1631\",[120,37.009]],[\"comment/1631\",[]],[\"name/1632\",[115,55.547]],[\"comment/1632\",[]],[\"name/1633\",[507,70.211]],[\"comment/1633\",[]],[\"name/1634\",[508,70.211]],[\"comment/1634\",[]],[\"name/1635\",[509,70.211]],[\"comment/1635\",[]],[\"name/1636\",[510,70.211]],[\"comment/1636\",[]],[\"name/1637\",[120,37.009]],[\"comment/1637\",[]],[\"name/1638\",[359,59.225]],[\"comment/1638\",[]],[\"name/1639\",[120,37.009]],[\"comment/1639\",[]],[\"name/1640\",[422,65.103]],[\"comment/1640\",[]],[\"name/1641\",[511,65.103]],[\"comment/1641\",[]],[\"name/1642\",[512,70.211]],[\"comment/1642\",[]],[\"name/1643\",[120,37.009]],[\"comment/1643\",[]],[\"name/1644\",[513,70.211]],[\"comment/1644\",[]],[\"name/1645\",[511,65.103]],[\"comment/1645\",[]],[\"name/1646\",[425,65.103]],[\"comment/1646\",[]],[\"name/1647\",[120,37.009]],[\"comment/1647\",[]],[\"name/1648\",[514,70.211]],[\"comment/1648\",[]],[\"name/1649\",[120,37.009]],[\"comment/1649\",[]],[\"name/1650\",[515,70.211]],[\"comment/1650\",[]],[\"name/1651\",[516,70.211]],[\"comment/1651\",[]],[\"name/1652\",[517,70.211]],[\"comment/1652\",[]],[\"name/1653\",[518,70.211]],[\"comment/1653\",[]],[\"name/1654\",[120,37.009]],[\"comment/1654\",[]],[\"name/1655\",[519,70.211]],[\"comment/1655\",[]],[\"name/1656\",[120,37.009]],[\"comment/1656\",[]],[\"name/1657\",[520,70.211]],[\"comment/1657\",[]],[\"name/1658\",[120,37.009]],[\"comment/1658\",[]],[\"name/1659\",[521,70.211]],[\"comment/1659\",[]],[\"name/1660\",[120,37.009]],[\"comment/1660\",[]],[\"name/1661\",[522,70.211]],[\"comment/1661\",[]],[\"name/1662\",[120,37.009]],[\"comment/1662\",[]],[\"name/1663\",[523,70.211]],[\"comment/1663\",[]],[\"name/1664\",[524,70.211]],[\"comment/1664\",[]],[\"name/1665\",[120,37.009]],[\"comment/1665\",[]],[\"name/1666\",[525,70.211]],[\"comment/1666\",[]],[\"name/1667\",[120,37.009]],[\"comment/1667\",[]],[\"name/1668\",[131,46.232]],[\"comment/1668\",[]],[\"name/1669\",[526,70.211]],[\"comment/1669\",[]],[\"name/1670\",[527,70.211]],[\"comment/1670\",[]],[\"name/1671\",[528,70.211]],[\"comment/1671\",[]],[\"name/1672\",[120,37.009]],[\"comment/1672\",[]],[\"name/1673\",[131,46.232]],[\"comment/1673\",[]],[\"name/1674\",[529,70.211]],[\"comment/1674\",[]],[\"name/1675\",[120,37.009]],[\"comment/1675\",[]],[\"name/1676\",[131,46.232]],[\"comment/1676\",[]],[\"name/1677\",[530,70.211]],[\"comment/1677\",[]],[\"name/1678\",[531,70.211]],[\"comment/1678\",[]]],\"invertedIndex\":[[\"__type\",{\"_index\":120,\"name\":{\"278\":{},\"280\":{},\"357\":{},\"365\":{},\"369\":{},\"440\":{},\"448\":{},\"452\":{},\"508\":{},\"516\":{},\"520\":{},\"594\":{},\"602\":{},\"606\":{},\"1100\":{},\"1102\":{},\"1118\":{},\"1120\":{},\"1142\":{},\"1144\":{},\"1303\":{},\"1307\":{},\"1577\":{},\"1609\":{},\"1616\":{},\"1629\":{},\"1631\":{},\"1637\":{},\"1639\":{},\"1643\":{},\"1647\":{},\"1649\":{},\"1654\":{},\"1656\":{},\"1658\":{},\"1660\":{},\"1662\":{},\"1665\":{},\"1667\":{},\"1672\":{},\"1675\":{}},\"comment\":{}}],[\"_accumulatedbypropertyname\",{\"_index\":280,\"name\":{\"685\":{},\"743\":{},\"808\":{},\"920\":{},\"989\":{},\"1081\":{}},\"comment\":{}}],[\"_addedgeonly\",{\"_index\":181,\"name\":{\"376\":{},\"421\":{},\"490\":{},\"575\":{}},\"comment\":{}}],[\"_addto\",{\"_index\":272,\"name\":{\"676\":{},\"734\":{},\"799\":{},\"911\":{},\"980\":{},\"1013\":{}},\"comment\":{}}],[\"_addvertexonly\",{\"_index\":182,\"name\":{\"377\":{},\"459\":{},\"527\":{},\"613\":{}},\"comment\":{}}],[\"_balancefactor\",{\"_index\":319,\"name\":{\"864\":{},\"1030\":{}},\"comment\":{}}],[\"_balancell\",{\"_index\":322,\"name\":{\"867\":{},\"1033\":{}},\"comment\":{}}],[\"_balancelr\",{\"_index\":323,\"name\":{\"868\":{},\"1034\":{}},\"comment\":{}}],[\"_balancepath\",{\"_index\":321,\"name\":{\"866\":{},\"1032\":{}},\"comment\":{}}],[\"_balancerl\",{\"_index\":325,\"name\":{\"870\":{},\"1036\":{}},\"comment\":{}}],[\"_balancerr\",{\"_index\":324,\"name\":{\"869\":{},\"1035\":{}},\"comment\":{}}],[\"_bottomright\",{\"_index\":225,\"name\":{\"552\":{}},\"comment\":{}}],[\"_buckets\",{\"_index\":13,\"name\":{\"14\":{}},\"comment\":{}}],[\"_capacity\",{\"_index\":11,\"name\":{\"12\":{},\"281\":{}},\"comment\":{}}],[\"_capacitymultiplier\",{\"_index\":44,\"name\":{\"60\":{}},\"comment\":{}}],[\"_character\",{\"_index\":427,\"name\":{\"1310\":{}},\"comment\":{}}],[\"_children\",{\"_index\":352,\"name\":{\"1091\":{},\"1319\":{}},\"comment\":{}}],[\"_clearresults\",{\"_index\":278,\"name\":{\"683\":{},\"741\":{},\"806\":{},\"918\":{},\"987\":{},\"1079\":{}},\"comment\":{}}],[\"_color\",{\"_index\":328,\"name\":{\"926\":{}},\"comment\":{}}],[\"_comparator\",{\"_index\":291,\"name\":{\"766\":{},\"879\":{},\"947\":{},\"1043\":{},\"1176\":{},\"1208\":{},\"1240\":{}},\"comment\":{}}],[\"_compare\",{\"_index\":292,\"name\":{\"767\":{},\"880\":{},\"948\":{},\"1044\":{},\"1177\":{},\"1209\":{},\"1241\":{}},\"comment\":{}}],[\"_count\",{\"_index\":334,\"name\":{\"997\":{},\"1008\":{}},\"comment\":{}}],[\"_cur\",{\"_index\":426,\"name\":{\"1309\":{}},\"comment\":{}}],[\"_defaulthashfn\",{\"_index\":15,\"name\":{\"16\":{}},\"comment\":{}}],[\"_dest\",{\"_index\":190,\"name\":{\"389\":{}},\"comment\":{}}],[\"_edges\",{\"_index\":212,\"name\":{\"478\":{}},\"comment\":{}}],[\"_elements\",{\"_index\":107,\"name\":{\"179\":{}},\"comment\":{}}],[\"_end\",{\"_index\":304,\"name\":{\"823\":{},\"839\":{}},\"comment\":{}}],[\"_expand\",{\"_index\":24,\"name\":{\"25\":{}},\"comment\":{}}],[\"_first\",{\"_index\":121,\"name\":{\"283\":{}},\"comment\":{}}],[\"_fix\",{\"_index\":381,\"name\":{\"1186\":{},\"1218\":{},\"1250\":{}},\"comment\":{}}],[\"_getcomparedchild\",{\"_index\":378,\"name\":{\"1183\":{},\"1215\":{},\"1247\":{}},\"comment\":{}}],[\"_getleft\",{\"_index\":376,\"name\":{\"1181\":{},\"1213\":{},\"1245\":{}},\"comment\":{}}],[\"_getparent\",{\"_index\":375,\"name\":{\"1180\":{},\"1212\":{},\"1244\":{}},\"comment\":{}}],[\"_getresultbypropertyname\",{\"_index\":281,\"name\":{\"686\":{},\"744\":{},\"809\":{},\"921\":{},\"990\":{},\"1082\":{}},\"comment\":{}}],[\"_getright\",{\"_index\":377,\"name\":{\"1182\":{},\"1214\":{},\"1246\":{}},\"comment\":{}}],[\"_getvertex\",{\"_index\":183,\"name\":{\"378\":{},\"460\":{},\"528\":{},\"614\":{}},\"comment\":{}}],[\"_getvertexid\",{\"_index\":184,\"name\":{\"379\":{},\"461\":{},\"529\":{},\"615\":{}},\"comment\":{}}],[\"_hash\",{\"_index\":18,\"name\":{\"19\":{},\"64\":{}},\"comment\":{}}],[\"_hashcode\",{\"_index\":135,\"name\":{\"326\":{},\"393\":{},\"473\":{},\"545\":{}},\"comment\":{}}],[\"_hashfn\",{\"_index\":14,\"name\":{\"15\":{},\"63\":{}},\"comment\":{}}],[\"_head\",{\"_index\":56,\"name\":{\"82\":{},\"120\":{},\"168\":{}},\"comment\":{}}],[\"_heapifydown\",{\"_index\":380,\"name\":{\"1185\":{},\"1217\":{},\"1249\":{}},\"comment\":{}}],[\"_heapifyup\",{\"_index\":379,\"name\":{\"1184\":{},\"1216\":{},\"1248\":{}},\"comment\":{}}],[\"_height\",{\"_index\":234,\"name\":{\"629\":{}},\"comment\":{}}],[\"_id\",{\"_index\":130,\"name\":{\"316\":{},\"619\":{},\"1087\":{}},\"comment\":{}}],[\"_inedgemap\",{\"_index\":195,\"name\":{\"400\":{}},\"comment\":{}}],[\"_initialcapacity\",{\"_index\":42,\"name\":{\"58\":{}},\"comment\":{}}],[\"_isend\",{\"_index\":432,\"name\":{\"1321\":{}},\"comment\":{}}],[\"_isvalidindex\",{\"_index\":374,\"name\":{\"1179\":{},\"1211\":{},\"1243\":{}},\"comment\":{}}],[\"_joint\",{\"_index\":27,\"name\":{\"29\":{},\"38\":{}},\"comment\":{}}],[\"_last\",{\"_index\":123,\"name\":{\"285\":{}},\"comment\":{}}],[\"_lat\",{\"_index\":217,\"name\":{\"533\":{}},\"comment\":{}}],[\"_left\",{\"_index\":228,\"name\":{\"623\":{},\"829\":{}},\"comment\":{}}],[\"_length\",{\"_index\":60,\"name\":{\"86\":{},\"124\":{}},\"comment\":{}}],[\"_level\",{\"_index\":102,\"name\":{\"169\":{}},\"comment\":{}}],[\"_loadfactor\",{\"_index\":43,\"name\":{\"59\":{}},\"comment\":{}}],[\"_long\",{\"_index\":219,\"name\":{\"535\":{}},\"comment\":{}}],[\"_looptype\",{\"_index\":240,\"name\":{\"638\":{}},\"comment\":{}}],[\"_matrix\",{\"_index\":385,\"name\":{\"1253\":{},\"1296\":{},\"1308\":{}},\"comment\":{}}],[\"_maxlevel\",{\"_index\":103,\"name\":{\"170\":{}},\"comment\":{}}],[\"_multiplicativestringhashfn\",{\"_index\":16,\"name\":{\"17\":{}},\"comment\":{}}],[\"_murmurstringhashfn\",{\"_index\":17,\"name\":{\"18\":{}},\"comment\":{}}],[\"_next\",{\"_index\":53,\"name\":{\"77\":{},\"113\":{}},\"comment\":{}}],[\"_nodes\",{\"_index\":114,\"name\":{\"221\":{},\"277\":{},\"301\":{},\"1159\":{},\"1191\":{},\"1223\":{}},\"comment\":{}}],[\"_objecthash\",{\"_index\":20,\"name\":{\"21\":{}},\"comment\":{}}],[\"_offset\",{\"_index\":116,\"name\":{\"223\":{}},\"comment\":{}}],[\"_origin\",{\"_index\":223,\"name\":{\"550\":{}},\"comment\":{}}],[\"_outedgemap\",{\"_index\":193,\"name\":{\"398\":{}},\"comment\":{}}],[\"_parent\",{\"_index\":232,\"name\":{\"627\":{}},\"comment\":{}}],[\"_pq\",{\"_index\":356,\"name\":{\"1097\":{},\"1115\":{},\"1139\":{}},\"comment\":{}}],[\"_prev\",{\"_index\":80,\"name\":{\"115\":{}},\"comment\":{}}],[\"_priority\",{\"_index\":364,\"name\":{\"1133\":{}},\"comment\":{}}],[\"_priorityextractor\",{\"_index\":358,\"name\":{\"1099\":{},\"1117\":{},\"1141\":{}},\"comment\":{}}],[\"_probability\",{\"_index\":104,\"name\":{\"171\":{}},\"comment\":{}}],[\"_pushbypropertynamestopornot\",{\"_index\":279,\"name\":{\"684\":{},\"742\":{},\"807\":{},\"919\":{},\"988\":{},\"1080\":{}},\"comment\":{}}],[\"_right\",{\"_index\":230,\"name\":{\"625\":{},\"831\":{}},\"comment\":{}}],[\"_root\",{\"_index\":238,\"name\":{\"634\":{},\"841\":{},\"1325\":{}},\"comment\":{}}],[\"_senodes\",{\"_index\":125,\"name\":{\"297\":{}},\"comment\":{}}],[\"_setcount\",{\"_index\":348,\"name\":{\"1029\":{}},\"comment\":{}}],[\"_setedges\",{\"_index\":215,\"name\":{\"491\":{}},\"comment\":{}}],[\"_setend\",{\"_index\":316,\"name\":{\"848\":{}},\"comment\":{}}],[\"_sethashcode\",{\"_index\":137,\"name\":{\"328\":{},\"395\":{},\"475\":{},\"547\":{}},\"comment\":{}}],[\"_setinedgemap\",{\"_index\":208,\"name\":{\"423\":{},\"577\":{}},\"comment\":{}}],[\"_setjoint\",{\"_index\":31,\"name\":{\"35\":{},\"43\":{}},\"comment\":{}}],[\"_setlooptype\",{\"_index\":273,\"name\":{\"677\":{},\"735\":{},\"800\":{},\"912\":{},\"981\":{},\"1073\":{}},\"comment\":{}}],[\"_setnodes\",{\"_index\":372,\"name\":{\"1175\":{},\"1207\":{},\"1239\":{}},\"comment\":{}}],[\"_setoutedgemap\",{\"_index\":207,\"name\":{\"422\":{},\"576\":{}},\"comment\":{}}],[\"_setroot\",{\"_index\":277,\"name\":{\"681\":{},\"739\":{},\"804\":{},\"849\":{},\"916\":{},\"985\":{},\"1077\":{}},\"comment\":{}}],[\"_setsize\",{\"_index\":126,\"name\":{\"298\":{},\"682\":{},\"740\":{},\"805\":{},\"917\":{},\"986\":{},\"1078\":{}},\"comment\":{}}],[\"_setstart\",{\"_index\":315,\"name\":{\"847\":{}},\"comment\":{}}],[\"_setsumtree\",{\"_index\":300,\"name\":{\"818\":{}},\"comment\":{}}],[\"_setvalues\",{\"_index\":314,\"name\":{\"846\":{}},\"comment\":{}}],[\"_setvertices\",{\"_index\":185,\"name\":{\"380\":{},\"462\":{},\"530\":{},\"616\":{}},\"comment\":{}}],[\"_setvisitedid\",{\"_index\":274,\"name\":{\"678\":{},\"736\":{},\"801\":{},\"913\":{},\"982\":{},\"1074\":{}},\"comment\":{}}],[\"_setvisitednode\",{\"_index\":276,\"name\":{\"680\":{},\"738\":{},\"803\":{},\"915\":{},\"984\":{},\"1076\":{}},\"comment\":{}}],[\"_setvisitedval\",{\"_index\":275,\"name\":{\"679\":{},\"737\":{},\"802\":{},\"914\":{},\"983\":{},\"1075\":{}},\"comment\":{}}],[\"_size\",{\"_index\":12,\"name\":{\"13\":{},\"61\":{},\"287\":{},\"636\":{}},\"comment\":{}}],[\"_src\",{\"_index\":188,\"name\":{\"387\":{}},\"comment\":{}}],[\"_start\",{\"_index\":302,\"name\":{\"821\":{},\"837\":{}},\"comment\":{}}],[\"_stringhash\",{\"_index\":19,\"name\":{\"20\":{}},\"comment\":{}}],[\"_sum\",{\"_index\":306,\"name\":{\"827\":{}},\"comment\":{}}],[\"_sumtree\",{\"_index\":295,\"name\":{\"813\":{}},\"comment\":{}}],[\"_swap\",{\"_index\":373,\"name\":{\"1178\":{},\"1210\":{},\"1242\":{}},\"comment\":{}}],[\"_table\",{\"_index\":45,\"name\":{\"62\":{}},\"comment\":{}}],[\"_tail\",{\"_index\":58,\"name\":{\"84\":{},\"122\":{}},\"comment\":{}}],[\"_updateheight\",{\"_index\":320,\"name\":{\"865\":{},\"1031\":{}},\"comment\":{}}],[\"_val\",{\"_index\":52,\"name\":{\"75\":{},\"111\":{},\"318\":{},\"322\":{},\"621\":{},\"825\":{},\"1135\":{},\"1317\":{}},\"comment\":{}}],[\"_value\",{\"_index\":351,\"name\":{\"1089\":{}},\"comment\":{}}],[\"_values\",{\"_index\":309,\"name\":{\"835\":{}},\"comment\":{}}],[\"_vertices\",{\"_index\":139,\"name\":{\"331\":{},\"469\":{}},\"comment\":{}}],[\"_visited\",{\"_index\":428,\"name\":{\"1311\":{}},\"comment\":{}}],[\"_visitedid\",{\"_index\":242,\"name\":{\"640\":{}},\"comment\":{}}],[\"_visitednode\",{\"_index\":246,\"name\":{\"644\":{}},\"comment\":{}}],[\"_visitedval\",{\"_index\":244,\"name\":{\"642\":{}},\"comment\":{}}],[\"_weight\",{\"_index\":133,\"name\":{\"324\":{}},\"comment\":{}}],[\"aatree\",{\"_index\":332,\"name\":{\"993\":{}},\"comment\":{}}],[\"abs\",{\"_index\":396,\"name\":{\"1267\":{}},\"comment\":{}}],[\"abstractbinarytree\",{\"_index\":237,\"name\":{\"632\":{}},\"comment\":{}}],[\"abstractbinarytreenode\",{\"_index\":227,\"name\":{\"617\":{}},\"comment\":{}}],[\"abstractbinarytreenodenested\",{\"_index\":495,\"name\":{\"1614\":{}},\"comment\":{}}],[\"abstractbinarytreenodeproperties\",{\"_index\":494,\"name\":{\"1613\":{}},\"comment\":{}}],[\"abstractbinarytreenodeproperty\",{\"_index\":493,\"name\":{\"1612\":{}},\"comment\":{}}],[\"abstractbinarytreeoptions\",{\"_index\":496,\"name\":{\"1615\":{}},\"comment\":{}}],[\"abstractedge\",{\"_index\":132,\"name\":{\"320\":{}},\"comment\":{}}],[\"abstractgraph\",{\"_index\":138,\"name\":{\"329\":{}},\"comment\":{}}],[\"abstractvertex\",{\"_index\":129,\"name\":{\"314\":{}},\"comment\":{}}],[\"add\",{\"_index\":33,\"name\":{\"41\":{},\"173\":{},\"650\":{},\"708\":{},\"757\":{},\"862\":{},\"938\":{},\"1012\":{},\"1107\":{},\"1125\":{},\"1149\":{},\"1163\":{},\"1195\":{},\"1227\":{},\"1256\":{},\"1286\":{},\"1327\":{},\"1361\":{},\"1404\":{},\"1450\":{},\"1516\":{}},\"comment\":{}}],[\"addchildren\",{\"_index\":354,\"name\":{\"1093\":{}},\"comment\":{}}],[\"addedge\",{\"_index\":156,\"name\":{\"348\":{},\"431\":{},\"499\":{},\"585\":{},\"1397\":{},\"1508\":{},\"1569\":{}},\"comment\":{}}],[\"addfirst\",{\"_index\":86,\"name\":{\"133\":{},\"251\":{},\"289\":{},\"306\":{}},\"comment\":{}}],[\"addlast\",{\"_index\":83,\"name\":{\"127\":{},\"245\":{},\"290\":{},\"303\":{}},\"comment\":{}}],[\"addmany\",{\"_index\":250,\"name\":{\"651\":{},\"709\":{},\"758\":{},\"871\":{},\"939\":{},\"1014\":{},\"1362\":{},\"1423\":{},\"1468\":{},\"1534\":{}},\"comment\":{}}],[\"addvertex\",{\"_index\":152,\"name\":{\"344\":{},\"427\":{},\"495\":{},\"581\":{},\"1389\":{},\"1500\":{},\"1561\":{}},\"comment\":{}}],[\"allgreaternodesadd\",{\"_index\":288,\"name\":{\"763\":{},\"876\":{},\"944\":{},\"1041\":{},\"1411\":{},\"1456\":{},\"1522\":{}},\"comment\":{}}],[\"allgreaternodesaddcount\",{\"_index\":347,\"name\":{\"1027\":{}},\"comment\":{}}],[\"angle\",{\"_index\":401,\"name\":{\"1272\":{}},\"comment\":{}}],[\"arraydeque\",{\"_index\":127,\"name\":{\"299\":{}},\"comment\":{}}],[\"arrayremove\",{\"_index\":441,\"name\":{\"1336\":{}},\"comment\":{}}],[\"articulationpoints\",{\"_index\":178,\"name\":{\"373\":{},\"456\":{},\"524\":{},\"610\":{}},\"comment\":{}}],[\"avltree\",{\"_index\":318,\"name\":{\"859\":{}},\"comment\":{}}],[\"avltreenode\",{\"_index\":317,\"name\":{\"850\":{}},\"comment\":{}}],[\"avltreenodenested\",{\"_index\":471,\"name\":{\"1584\":{}},\"comment\":{}}],[\"avltreeoptions\",{\"_index\":472,\"name\":{\"1585\":{}},\"comment\":{}}],[\"bellmanford\",{\"_index\":164,\"name\":{\"356\":{},\"439\":{},\"507\":{},\"593\":{}},\"comment\":{}}],[\"bfs\",{\"_index\":265,\"name\":{\"669\":{},\"727\":{},\"792\":{},\"904\":{},\"973\":{},\"1066\":{},\"1380\":{},\"1438\":{},\"1483\":{},\"1549\":{}},\"comment\":{}}],[\"bfscount\",{\"_index\":341,\"name\":{\"1021\":{}},\"comment\":{}}],[\"binaryindexedtree\",{\"_index\":293,\"name\":{\"810\":{}},\"comment\":{}}],[\"binarytree\",{\"_index\":283,\"name\":{\"696\":{}},\"comment\":{}}],[\"binarytreedeletedresult\",{\"_index\":490,\"name\":{\"1608\":{}},\"comment\":{}}],[\"binarytreenode\",{\"_index\":282,\"name\":{\"687\":{}},\"comment\":{}}],[\"binarytreenodeid\",{\"_index\":489,\"name\":{\"1607\":{}},\"comment\":{}}],[\"binarytreenodenested\",{\"_index\":462,\"name\":{\"1574\":{}},\"comment\":{}}],[\"binarytreenodepropertyname\",{\"_index\":486,\"name\":{\"1604\":{}},\"comment\":{}}],[\"binarytreeoptions\",{\"_index\":463,\"name\":{\"1575\":{}},\"comment\":{}}],[\"black\",{\"_index\":499,\"name\":{\"1620\":{}},\"comment\":{}}],[\"bottomright\",{\"_index\":226,\"name\":{\"553\":{}},\"comment\":{}}],[\"bridges\",{\"_index\":177,\"name\":{\"372\":{},\"455\":{},\"523\":{},\"609\":{}},\"comment\":{}}],[\"bst\",{\"_index\":285,\"name\":{\"754\":{}},\"comment\":{}}],[\"bstcomparator\",{\"_index\":464,\"name\":{\"1576\":{}},\"comment\":{}}],[\"bstnode\",{\"_index\":284,\"name\":{\"745\":{}},\"comment\":{}}],[\"bstnodenested\",{\"_index\":465,\"name\":{\"1578\":{}},\"comment\":{}}],[\"bstoptions\",{\"_index\":466,\"name\":{\"1579\":{}},\"comment\":{}}],[\"btree\",{\"_index\":326,\"name\":{\"922\":{}},\"comment\":{}}],[\"buckets\",{\"_index\":9,\"name\":{\"10\":{}},\"comment\":{}}],[\"build\",{\"_index\":311,\"name\":{\"843\":{}},\"comment\":{}}],[\"capacity\",{\"_index\":10,\"name\":{\"11\":{},\"282\":{}},\"comment\":{}}],[\"capacitymultiplier\",{\"_index\":39,\"name\":{\"54\":{}},\"comment\":{}}],[\"character\",{\"_index\":421,\"name\":{\"1299\":{}},\"comment\":{}}],[\"chardir\",{\"_index\":516,\"name\":{\"1651\":{}},\"comment\":{}}],[\"check\",{\"_index\":429,\"name\":{\"1313\":{}},\"comment\":{}}],[\"children\",{\"_index\":353,\"name\":{\"1092\":{},\"1320\":{}},\"comment\":{}}],[\"clear\",{\"_index\":48,\"name\":{\"70\":{},\"99\":{},\"145\":{},\"186\":{},\"208\":{},\"235\":{},\"263\":{},\"648\":{},\"706\":{},\"775\":{},\"888\":{},\"956\":{},\"1028\":{},\"1112\":{},\"1130\":{},\"1154\":{},\"1169\":{},\"1201\":{},\"1233\":{},\"1359\":{},\"1421\":{},\"1466\":{},\"1532\":{}},\"comment\":{}}],[\"clone\",{\"_index\":109,\"name\":{\"187\":{},\"236\":{},\"1171\":{},\"1203\":{},\"1235\":{}},\"comment\":{}}],[\"color\",{\"_index\":329,\"name\":{\"927\":{}},\"comment\":{}}],[\"comparator\",{\"_index\":508,\"name\":{\"1634\":{}},\"comment\":{}}],[\"constructor\",{\"_index\":1,\"name\":{\"1\":{},\"8\":{},\"28\":{},\"37\":{},\"45\":{},\"47\":{},\"49\":{},\"51\":{},\"74\":{},\"81\":{},\"110\":{},\"119\":{},\"158\":{},\"163\":{},\"178\":{},\"190\":{},\"220\":{},\"240\":{},\"276\":{},\"300\":{},\"315\":{},\"321\":{},\"330\":{},\"382\":{},\"386\":{},\"397\":{},\"464\":{},\"468\":{},\"477\":{},\"532\":{},\"540\":{},\"549\":{},\"618\":{},\"633\":{},\"688\":{},\"697\":{},\"746\":{},\"755\":{},\"812\":{},\"820\":{},\"834\":{},\"851\":{},\"860\":{},\"923\":{},\"925\":{},\"936\":{},\"992\":{},\"994\":{},\"996\":{},\"1007\":{},\"1084\":{},\"1086\":{},\"1096\":{},\"1114\":{},\"1132\":{},\"1138\":{},\"1158\":{},\"1190\":{},\"1222\":{},\"1252\":{},\"1274\":{},\"1295\":{},\"1300\":{},\"1305\":{},\"1316\":{},\"1324\":{}},\"comment\":{}}],[\"coordinatemap\",{\"_index\":26,\"name\":{\"27\":{}},\"comment\":{}}],[\"coordinateset\",{\"_index\":32,\"name\":{\"36\":{}},\"comment\":{}}],[\"costs\",{\"_index\":172,\"name\":{\"366\":{},\"449\":{},\"517\":{},\"603\":{}},\"comment\":{}}],[\"count\",{\"_index\":335,\"name\":{\"998\":{},\"1009\":{}},\"comment\":{}}],[\"countoccurrences\",{\"_index\":78,\"name\":{\"107\":{},\"216\":{}},\"comment\":{}}],[\"cp\",{\"_index\":467,\"name\":{\"1580\":{}},\"comment\":{}}],[\"createedge\",{\"_index\":142,\"name\":{\"334\":{},\"403\":{},\"481\":{},\"555\":{}},\"comment\":{}}],[\"createnode\",{\"_index\":248,\"name\":{\"646\":{},\"698\":{},\"756\":{},\"861\":{},\"937\":{},\"1010\":{},\"1351\":{},\"1406\":{},\"1449\":{},\"1515\":{}},\"comment\":{}}],[\"createvertex\",{\"_index\":141,\"name\":{\"333\":{},\"402\":{},\"480\":{},\"554\":{}},\"comment\":{}}],[\"cur\",{\"_index\":515,\"name\":{\"1650\":{}},\"comment\":{}}],[\"cycles\",{\"_index\":180,\"name\":{\"375\":{},\"458\":{},\"526\":{},\"612\":{}},\"comment\":{}}],[\"default_capacity\",{\"_index\":6,\"name\":{\"6\":{}},\"comment\":{}}],[\"degreeof\",{\"_index\":145,\"name\":{\"337\":{},\"410\":{},\"485\":{},\"564\":{},\"1392\":{},\"1503\":{},\"1564\":{}},\"comment\":{}}],[\"delete\",{\"_index\":30,\"name\":{\"34\":{},\"42\":{},\"96\":{},\"142\":{},\"205\":{},\"260\":{}},\"comment\":{}}],[\"deleteat\",{\"_index\":69,\"name\":{\"95\":{},\"141\":{},\"204\":{},\"259\":{}},\"comment\":{}}],[\"deleted\",{\"_index\":491,\"name\":{\"1610\":{}},\"comment\":{}}],[\"deque\",{\"_index\":118,\"name\":{\"238\":{}},\"comment\":{}}],[\"dequeue\",{\"_index\":112,\"name\":{\"192\":{},\"231\":{}},\"comment\":{}}],[\"dest\",{\"_index\":191,\"name\":{\"390\":{},\"542\":{}},\"comment\":{}}],[\"dfnmap\",{\"_index\":175,\"name\":{\"370\":{},\"453\":{},\"521\":{},\"607\":{}},\"comment\":{}}],[\"dfs\",{\"_index\":266,\"name\":{\"670\":{},\"728\":{},\"793\":{},\"905\":{},\"974\":{},\"1067\":{},\"1174\":{},\"1206\":{},\"1238\":{},\"1381\":{},\"1439\":{},\"1484\":{},\"1550\":{}},\"comment\":{}}],[\"dfscount\",{\"_index\":345,\"name\":{\"1025\":{}},\"comment\":{}}],[\"dfsiterative\",{\"_index\":267,\"name\":{\"671\":{},\"729\":{},\"794\":{},\"906\":{},\"975\":{},\"1068\":{},\"1382\":{},\"1440\":{},\"1485\":{},\"1551\":{}},\"comment\":{}}],[\"dfsiterativecount\",{\"_index\":344,\"name\":{\"1024\":{}},\"comment\":{}}],[\"dfsorderpattern\",{\"_index\":488,\"name\":{\"1606\":{}},\"comment\":{}}],[\"dijkstra\",{\"_index\":163,\"name\":{\"355\":{},\"438\":{},\"506\":{},\"592\":{}},\"comment\":{}}],[\"dijkstraresult\",{\"_index\":478,\"name\":{\"1591\":{}},\"comment\":{}}],[\"dijkstrawithoutheap\",{\"_index\":162,\"name\":{\"354\":{},\"437\":{},\"505\":{},\"591\":{}},\"comment\":{}}],[\"directededge\",{\"_index\":187,\"name\":{\"385\":{}},\"comment\":{}}],[\"directedgraph\",{\"_index\":192,\"name\":{\"396\":{}},\"comment\":{}}],[\"directedvertex\",{\"_index\":186,\"name\":{\"381\":{}},\"comment\":{}}],[\"direction\",{\"_index\":422,\"name\":{\"1301\":{},\"1640\":{}},\"comment\":{}}],[\"distance\",{\"_index\":398,\"name\":{\"1269\":{}},\"comment\":{}}],[\"distancesq\",{\"_index\":399,\"name\":{\"1270\":{}},\"comment\":{}}],[\"distmap\",{\"_index\":166,\"name\":{\"359\":{},\"442\":{},\"510\":{},\"596\":{}},\"comment\":{}}],[\"divide\",{\"_index\":390,\"name\":{\"1260\":{}},\"comment\":{}}],[\"dot\",{\"_index\":397,\"name\":{\"1268\":{}},\"comment\":{}}],[\"doublylinkedlist\",{\"_index\":82,\"name\":{\"117\":{}},\"comment\":{}}],[\"doublylinkedlistnode\",{\"_index\":79,\"name\":{\"109\":{}},\"comment\":{}}],[\"dummyany\",{\"_index\":531,\"name\":{\"1678\":{}},\"comment\":{}}],[\"edgeid\",{\"_index\":477,\"name\":{\"1590\":{}},\"comment\":{}}],[\"edges\",{\"_index\":213,\"name\":{\"479\":{}},\"comment\":{}}],[\"edgeset\",{\"_index\":146,\"name\":{\"338\":{},\"418\":{},\"487\":{},\"572\":{},\"1396\":{},\"1507\":{},\"1568\":{}},\"comment\":{}}],[\"edgesof\",{\"_index\":147,\"name\":{\"339\":{},\"413\":{},\"486\":{},\"567\":{},\"1393\":{},\"1504\":{},\"1565\":{}},\"comment\":{}}],[\"empty\",{\"_index\":411,\"name\":{\"1284\":{}},\"comment\":{}}],[\"end\",{\"_index\":305,\"name\":{\"824\":{},\"840\":{}},\"comment\":{}}],[\"enqueue\",{\"_index\":111,\"name\":{\"191\":{},\"230\":{}},\"comment\":{}}],[\"entries\",{\"_index\":47,\"name\":{\"69\":{}},\"comment\":{}}],[\"eq\",{\"_index\":469,\"name\":{\"1582\":{}},\"comment\":{}}],[\"equals\",{\"_index\":391,\"name\":{\"1261\":{}},\"comment\":{}}],[\"equalsrounded\",{\"_index\":392,\"name\":{\"1262\":{}},\"comment\":{}}],[\"familyposition\",{\"_index\":236,\"name\":{\"631\":{},\"695\":{},\"753\":{},\"858\":{},\"934\":{},\"1005\":{},\"1348\":{},\"1596\":{}},\"comment\":{}}],[\"fill\",{\"_index\":251,\"name\":{\"652\":{},\"710\":{},\"777\":{},\"890\":{},\"958\":{},\"1052\":{},\"1363\":{},\"1424\":{},\"1469\":{},\"1535\":{}},\"comment\":{}}],[\"filter\",{\"_index\":93,\"name\":{\"153\":{},\"271\":{}},\"comment\":{}}],[\"find\",{\"_index\":73,\"name\":{\"102\":{},\"146\":{},\"211\":{},\"264\":{}},\"comment\":{}}],[\"findlast\",{\"_index\":89,\"name\":{\"148\":{},\"266\":{}},\"comment\":{}}],[\"findnode\",{\"_index\":75,\"name\":{\"104\":{},\"139\":{},\"213\":{},\"257\":{}},\"comment\":{}}],[\"first\",{\"_index\":122,\"name\":{\"284\":{}},\"comment\":{}}],[\"floyd\",{\"_index\":171,\"name\":{\"364\":{},\"447\":{},\"515\":{},\"601\":{}},\"comment\":{}}],[\"foreach\",{\"_index\":91,\"name\":{\"151\":{},\"269\":{}},\"comment\":{}}],[\"forward\",{\"_index\":97,\"name\":{\"161\":{}},\"comment\":{}}],[\"fromarray\",{\"_index\":55,\"name\":{\"80\":{},\"118\":{},\"177\":{},\"189\":{},\"219\":{},\"239\":{}},\"comment\":{}}],[\"get\",{\"_index\":22,\"name\":{\"23\":{},\"33\":{},\"67\":{},\"174\":{},\"295\":{},\"309\":{},\"660\":{},\"718\":{},\"759\":{},\"872\":{},\"940\":{},\"1037\":{},\"1371\":{},\"1407\":{},\"1451\":{},\"1517\":{}},\"comment\":{}}],[\"getall\",{\"_index\":439,\"name\":{\"1334\":{}},\"comment\":{}}],[\"getallpathsbetween\",{\"_index\":158,\"name\":{\"350\":{},\"433\":{},\"501\":{},\"587\":{}},\"comment\":{}}],[\"getat\",{\"_index\":67,\"name\":{\"93\":{},\"137\":{},\"202\":{},\"232\":{},\"255\":{}},\"comment\":{}}],[\"getdepth\",{\"_index\":252,\"name\":{\"654\":{},\"712\":{},\"779\":{},\"891\":{},\"960\":{},\"1053\":{},\"1365\":{},\"1425\":{},\"1470\":{},\"1536\":{}},\"comment\":{}}],[\"getdestinations\",{\"_index\":205,\"name\":{\"416\":{},\"570\":{}},\"comment\":{}}],[\"getedge\",{\"_index\":144,\"name\":{\"336\":{},\"404\":{},\"482\":{},\"558\":{},\"1395\":{},\"1506\":{},\"1567\":{}},\"comment\":{}}],[\"getedgedest\",{\"_index\":204,\"name\":{\"415\":{},\"569\":{},\"1496\":{}},\"comment\":{}}],[\"getedgesrc\",{\"_index\":203,\"name\":{\"414\":{},\"568\":{},\"1495\":{}},\"comment\":{}}],[\"getendsofedge\",{\"_index\":149,\"name\":{\"341\":{},\"420\":{},\"489\":{},\"574\":{}},\"comment\":{}}],[\"getheight\",{\"_index\":253,\"name\":{\"655\":{},\"713\":{},\"780\":{},\"892\":{},\"961\":{},\"1054\":{},\"1094\":{},\"1366\":{},\"1426\":{},\"1471\":{},\"1537\":{}},\"comment\":{}}],[\"getleftmost\",{\"_index\":258,\"name\":{\"662\":{},\"720\":{},\"785\":{},\"897\":{},\"966\":{},\"1059\":{},\"1373\":{},\"1431\":{},\"1476\":{},\"1542\":{}},\"comment\":{}}],[\"getlength\",{\"_index\":62,\"name\":{\"88\":{},\"197\":{}},\"comment\":{}}],[\"getlongestcommonprefix\",{\"_index\":438,\"name\":{\"1333\":{}},\"comment\":{}}],[\"getmincostbetween\",{\"_index\":160,\"name\":{\"352\":{},\"435\":{},\"503\":{},\"589\":{}},\"comment\":{}}],[\"getminheight\",{\"_index\":254,\"name\":{\"656\":{},\"714\":{},\"781\":{},\"893\":{},\"962\":{},\"1055\":{},\"1367\":{},\"1427\":{},\"1472\":{},\"1538\":{}},\"comment\":{}}],[\"getminpathbetween\",{\"_index\":161,\"name\":{\"353\":{},\"436\":{},\"504\":{},\"590\":{},\"1400\":{},\"1511\":{},\"1572\":{}},\"comment\":{}}],[\"getneighbors\",{\"_index\":148,\"name\":{\"340\":{},\"419\":{},\"488\":{},\"573\":{},\"1401\":{},\"1512\":{},\"1573\":{}},\"comment\":{}}],[\"getnodeat\",{\"_index\":68,\"name\":{\"94\":{},\"138\":{},\"203\":{},\"256\":{}},\"comment\":{}}],[\"getnodes\",{\"_index\":256,\"name\":{\"658\":{},\"716\":{},\"761\":{},\"874\":{},\"942\":{},\"1039\":{},\"1162\":{},\"1194\":{},\"1226\":{},\"1369\":{},\"1409\":{},\"1454\":{},\"1520\":{}},\"comment\":{}}],[\"getnodesbycount\",{\"_index\":340,\"name\":{\"1020\":{}},\"comment\":{}}],[\"getpathsumweight\",{\"_index\":159,\"name\":{\"351\":{},\"434\":{},\"502\":{},\"588\":{}},\"comment\":{}}],[\"getpathtoroot\",{\"_index\":257,\"name\":{\"661\":{},\"719\":{},\"784\":{},\"896\":{},\"965\":{},\"1058\":{},\"1372\":{},\"1430\":{},\"1475\":{},\"1541\":{}},\"comment\":{}}],[\"getpredecessor\",{\"_index\":270,\"name\":{\"674\":{},\"732\":{},\"797\":{},\"909\":{},\"978\":{},\"1071\":{},\"1385\":{},\"1443\":{},\"1488\":{},\"1554\":{}},\"comment\":{}}],[\"getprefixsum\",{\"_index\":298,\"name\":{\"816\":{}},\"comment\":{}}],[\"getrangesum\",{\"_index\":299,\"name\":{\"817\":{}},\"comment\":{}}],[\"getrightmost\",{\"_index\":259,\"name\":{\"663\":{},\"721\":{},\"786\":{},\"898\":{},\"967\":{},\"1060\":{},\"1374\":{},\"1432\":{},\"1477\":{},\"1543\":{}},\"comment\":{}}],[\"getsubtreecount\",{\"_index\":337,\"name\":{\"1017\":{}},\"comment\":{}}],[\"getsubtreesize\",{\"_index\":262,\"name\":{\"666\":{},\"724\":{},\"789\":{},\"901\":{},\"970\":{},\"1063\":{},\"1377\":{},\"1435\":{},\"1480\":{},\"1546\":{}},\"comment\":{}}],[\"getvertex\",{\"_index\":150,\"name\":{\"342\":{},\"425\":{},\"493\":{},\"579\":{}},\"comment\":{}}],[\"gt\",{\"_index\":470,\"name\":{\"1583\":{}},\"comment\":{}}],[\"has\",{\"_index\":29,\"name\":{\"31\":{},\"40\":{},\"659\":{},\"717\":{},\"783\":{},\"895\":{},\"964\":{},\"1057\":{},\"1109\":{},\"1127\":{},\"1151\":{},\"1164\":{},\"1196\":{},\"1228\":{},\"1328\":{},\"1370\":{},\"1429\":{},\"1474\":{},\"1540\":{}},\"comment\":{}}],[\"hasedge\",{\"_index\":155,\"name\":{\"347\":{},\"430\":{},\"498\":{},\"584\":{},\"1394\":{},\"1505\":{},\"1566\":{}},\"comment\":{}}],[\"hashcode\",{\"_index\":136,\"name\":{\"327\":{},\"394\":{},\"474\":{},\"546\":{}},\"comment\":{}}],[\"hashfn\",{\"_index\":8,\"name\":{\"9\":{},\"52\":{}},\"comment\":{}}],[\"hashfunction\",{\"_index\":518,\"name\":{\"1653\":{}},\"comment\":{}}],[\"hashmap\",{\"_index\":37,\"name\":{\"50\":{}},\"comment\":{}}],[\"hashtable\",{\"_index\":5,\"name\":{\"5\":{}},\"comment\":{}}],[\"hashtablenode\",{\"_index\":0,\"name\":{\"0\":{}},\"comment\":{}}],[\"hasnegativecycle\",{\"_index\":165,\"name\":{\"358\":{},\"441\":{},\"509\":{},\"595\":{}},\"comment\":{}}],[\"hasvertex\",{\"_index\":151,\"name\":{\"343\":{},\"426\":{},\"494\":{},\"580\":{},\"1388\":{},\"1499\":{},\"1560\":{}},\"comment\":{}}],[\"head\",{\"_index\":57,\"name\":{\"83\":{},\"121\":{},\"167\":{},\"194\":{},\"241\":{}},\"comment\":{}}],[\"heap\",{\"_index\":366,\"name\":{\"1137\":{}},\"comment\":{}}],[\"heapify\",{\"_index\":368,\"name\":{\"1156\":{},\"1188\":{},\"1220\":{}},\"comment\":{}}],[\"heapitem\",{\"_index\":363,\"name\":{\"1131\":{}},\"comment\":{}}],[\"heapoptions\",{\"_index\":510,\"name\":{\"1636\":{}},\"comment\":{}}],[\"height\",{\"_index\":235,\"name\":{\"630\":{},\"694\":{},\"752\":{},\"857\":{},\"933\":{},\"1004\":{},\"1349\":{}},\"comment\":{}}],[\"iabstractbinarytree\",{\"_index\":448,\"name\":{\"1350\":{}},\"comment\":{}}],[\"iabstractbinarytreenode\",{\"_index\":447,\"name\":{\"1342\":{}},\"comment\":{}}],[\"iabstractgraph\",{\"_index\":449,\"name\":{\"1387\":{}},\"comment\":{}}],[\"iavltree\",{\"_index\":451,\"name\":{\"1403\":{}},\"comment\":{}}],[\"iavltreenode\",{\"_index\":450,\"name\":{\"1402\":{}},\"comment\":{}}],[\"ibinarytree\",{\"_index\":453,\"name\":{\"1446\":{}},\"comment\":{}}],[\"ibinarytreenode\",{\"_index\":452,\"name\":{\"1445\":{}},\"comment\":{}}],[\"ibst\",{\"_index\":455,\"name\":{\"1448\":{}},\"comment\":{}}],[\"ibstnode\",{\"_index\":454,\"name\":{\"1447\":{}},\"comment\":{}}],[\"id\",{\"_index\":131,\"name\":{\"317\":{},\"383\":{},\"465\":{},\"537\":{},\"620\":{},\"689\":{},\"747\":{},\"852\":{},\"928\":{},\"999\":{},\"1088\":{},\"1343\":{},\"1627\":{},\"1668\":{},\"1673\":{},\"1676\":{}},\"comment\":{}}],[\"identity\",{\"_index\":412,\"name\":{\"1285\":{}},\"comment\":{}}],[\"idirectedgraph\",{\"_index\":456,\"name\":{\"1490\":{}},\"comment\":{}}],[\"incomingedgesof\",{\"_index\":199,\"name\":{\"408\":{},\"562\":{},\"1491\":{}},\"comment\":{}}],[\"indegreeof\",{\"_index\":201,\"name\":{\"411\":{},\"565\":{},\"1493\":{}},\"comment\":{}}],[\"indexof\",{\"_index\":74,\"name\":{\"103\":{},\"147\":{},\"212\":{},\"265\":{}},\"comment\":{}}],[\"inedgemap\",{\"_index\":196,\"name\":{\"401\":{},\"557\":{}},\"comment\":{}}],[\"init\",{\"_index\":514,\"name\":{\"1648\":{}},\"comment\":{}}],[\"initialcapacity\",{\"_index\":41,\"name\":{\"56\":{}},\"comment\":{}}],[\"insert\",{\"_index\":128,\"name\":{\"311\":{}},\"comment\":{}}],[\"insertafter\",{\"_index\":77,\"name\":{\"106\":{},\"155\":{},\"215\":{},\"273\":{}},\"comment\":{}}],[\"insertat\",{\"_index\":70,\"name\":{\"97\":{},\"140\":{},\"206\":{},\"258\":{}},\"comment\":{}}],[\"insertbefore\",{\"_index\":76,\"name\":{\"105\":{},\"156\":{},\"214\":{},\"274\":{}},\"comment\":{}}],[\"irbtree\",{\"_index\":458,\"name\":{\"1514\":{}},\"comment\":{}}],[\"irbtreenode\",{\"_index\":457,\"name\":{\"1513\":{}},\"comment\":{}}],[\"isabsprefix\",{\"_index\":435,\"name\":{\"1330\":{}},\"comment\":{}}],[\"isavlbalanced\",{\"_index\":290,\"name\":{\"765\":{},\"878\":{},\"946\":{},\"1042\":{},\"1413\":{},\"1458\":{},\"1524\":{}},\"comment\":{}}],[\"isbst\",{\"_index\":261,\"name\":{\"665\":{},\"723\":{},\"788\":{},\"900\":{},\"969\":{},\"1062\":{},\"1376\":{},\"1434\":{},\"1479\":{},\"1545\":{}},\"comment\":{}}],[\"iscommonprefix\",{\"_index\":437,\"name\":{\"1332\":{}},\"comment\":{}}],[\"isempty\",{\"_index\":49,\"name\":{\"71\":{},\"98\":{},\"144\":{},\"180\":{},\"207\":{},\"233\":{},\"262\":{},\"296\":{},\"313\":{},\"649\":{},\"707\":{},\"776\":{},\"889\":{},\"957\":{},\"1051\":{},\"1104\":{},\"1122\":{},\"1146\":{},\"1168\":{},\"1200\":{},\"1232\":{},\"1360\":{},\"1422\":{},\"1467\":{},\"1533\":{}},\"comment\":{}}],[\"isend\",{\"_index\":433,\"name\":{\"1322\":{}},\"comment\":{}}],[\"isfix\",{\"_index\":507,\"name\":{\"1633\":{}},\"comment\":{}}],[\"isolated\",{\"_index\":484,\"name\":{\"1602\":{}},\"comment\":{}}],[\"isperfectlybalanced\",{\"_index\":255,\"name\":{\"657\":{},\"715\":{},\"782\":{},\"894\":{},\"963\":{},\"1056\":{},\"1368\":{},\"1428\":{},\"1473\":{},\"1539\":{}},\"comment\":{}}],[\"isprefix\",{\"_index\":436,\"name\":{\"1331\":{}},\"comment\":{}}],[\"ispriorityqueueified\",{\"_index\":369,\"name\":{\"1157\":{},\"1189\":{},\"1221\":{}},\"comment\":{}}],[\"issubtreebst\",{\"_index\":260,\"name\":{\"664\":{},\"722\":{},\"787\":{},\"899\":{},\"968\":{},\"1061\":{},\"1375\":{},\"1433\":{},\"1478\":{},\"1544\":{}},\"comment\":{}}],[\"isthunk\",{\"_index\":443,\"name\":{\"1338\":{}},\"comment\":{}}],[\"isvalid\",{\"_index\":371,\"name\":{\"1172\":{},\"1204\":{},\"1236\":{}},\"comment\":{}}],[\"iszero\",{\"_index\":406,\"name\":{\"1278\":{}},\"comment\":{}}],[\"iterative\",{\"_index\":480,\"name\":{\"1594\":{}},\"comment\":{}}],[\"iterator\",{\"_index\":50,\"name\":{\"72\":{},\"108\":{},\"217\":{},\"237\":{}},\"comment\":{}}],[\"itreemultiset\",{\"_index\":460,\"name\":{\"1557\":{}},\"comment\":{}}],[\"itreemultisetnode\",{\"_index\":459,\"name\":{\"1556\":{}},\"comment\":{}}],[\"iundirectedgraph\",{\"_index\":461,\"name\":{\"1558\":{}},\"comment\":{}}],[\"joint\",{\"_index\":28,\"name\":{\"30\":{},\"39\":{}},\"comment\":{}}],[\"key\",{\"_index\":2,\"name\":{\"2\":{},\"159\":{}},\"comment\":{}}],[\"keyvalueobject\",{\"_index\":524,\"name\":{\"1664\":{}},\"comment\":{}}],[\"keyvalueobjectwithid\",{\"_index\":525,\"name\":{\"1666\":{}},\"comment\":{}}],[\"last\",{\"_index\":124,\"name\":{\"286\":{}},\"comment\":{}}],[\"lastkey\",{\"_index\":286,\"name\":{\"760\":{},\"873\":{},\"941\":{},\"1038\":{},\"1408\":{},\"1452\":{},\"1518\":{}},\"comment\":{}}],[\"lat\",{\"_index\":218,\"name\":{\"534\":{}},\"comment\":{}}],[\"leaf\",{\"_index\":370,\"name\":{\"1167\":{},\"1199\":{},\"1231\":{}},\"comment\":{}}],[\"left\",{\"_index\":229,\"name\":{\"624\":{},\"691\":{},\"749\":{},\"830\":{},\"854\":{},\"930\":{},\"1001\":{},\"1345\":{},\"1598\":{}},\"comment\":{}}],[\"length\",{\"_index\":61,\"name\":{\"87\":{},\"125\":{},\"196\":{},\"243\":{},\"1279\":{}},\"comment\":{}}],[\"lengthsq\",{\"_index\":407,\"name\":{\"1280\":{}},\"comment\":{}}],[\"lessersum\",{\"_index\":287,\"name\":{\"762\":{},\"875\":{},\"943\":{},\"1040\":{},\"1410\":{},\"1455\":{},\"1521\":{}},\"comment\":{}}],[\"lessersumcount\",{\"_index\":346,\"name\":{\"1026\":{}},\"comment\":{}}],[\"level\",{\"_index\":101,\"name\":{\"166\":{}},\"comment\":{}}],[\"leveliterative\",{\"_index\":268,\"name\":{\"672\":{},\"730\":{},\"795\":{},\"907\":{},\"976\":{},\"1069\":{},\"1383\":{},\"1441\":{},\"1486\":{},\"1552\":{}},\"comment\":{}}],[\"linkedlistqueue\",{\"_index\":110,\"name\":{\"188\":{}},\"comment\":{}}],[\"listlevels\",{\"_index\":269,\"name\":{\"673\":{},\"731\":{},\"796\":{},\"908\":{},\"977\":{},\"1070\":{},\"1384\":{},\"1442\":{},\"1487\":{},\"1553\":{}},\"comment\":{}}],[\"listlevelscount\",{\"_index\":342,\"name\":{\"1022\":{}},\"comment\":{}}],[\"load_factor\",{\"_index\":7,\"name\":{\"7\":{}},\"comment\":{}}],[\"loadfactor\",{\"_index\":40,\"name\":{\"55\":{}},\"comment\":{}}],[\"long\",{\"_index\":220,\"name\":{\"536\":{}},\"comment\":{}}],[\"looptype\",{\"_index\":241,\"name\":{\"639\":{},\"701\":{},\"770\":{},\"883\":{},\"951\":{},\"1047\":{},\"1352\":{},\"1414\":{},\"1459\":{},\"1525\":{},\"1593\":{},\"1617\":{}},\"comment\":{}}],[\"lowbit\",{\"_index\":294,\"name\":{\"811\":{}},\"comment\":{}}],[\"lowmap\",{\"_index\":176,\"name\":{\"371\":{},\"454\":{},\"522\":{},\"608\":{}},\"comment\":{}}],[\"lt\",{\"_index\":468,\"name\":{\"1581\":{}},\"comment\":{}}],[\"m\",{\"_index\":419,\"name\":{\"1297\":{}},\"comment\":{}}],[\"mal_node\",{\"_index\":485,\"name\":{\"1603\":{}},\"comment\":{}}],[\"map\",{\"_index\":92,\"name\":{\"152\":{},\"270\":{}},\"comment\":{}}],[\"mapedge\",{\"_index\":221,\"name\":{\"539\":{}},\"comment\":{}}],[\"mapgraph\",{\"_index\":222,\"name\":{\"548\":{}},\"comment\":{}}],[\"mapgraphcoordinate\",{\"_index\":479,\"name\":{\"1592\":{}},\"comment\":{}}],[\"mapvertex\",{\"_index\":216,\"name\":{\"531\":{}},\"comment\":{}}],[\"matrix\",{\"_index\":513,\"name\":{\"1644\":{}},\"comment\":{}}],[\"matrix2d\",{\"_index\":410,\"name\":{\"1283\":{}},\"comment\":{}}],[\"matrixnti2d\",{\"_index\":384,\"name\":{\"1251\":{}},\"comment\":{}}],[\"maxheap\",{\"_index\":355,\"name\":{\"1095\":{}},\"comment\":{}}],[\"maxlevel\",{\"_index\":100,\"name\":{\"165\":{}},\"comment\":{}}],[\"maxpriorityqueue\",{\"_index\":383,\"name\":{\"1219\":{}},\"comment\":{}}],[\"min\",{\"_index\":169,\"name\":{\"362\":{},\"445\":{},\"513\":{},\"599\":{}},\"comment\":{}}],[\"minheap\",{\"_index\":362,\"name\":{\"1113\":{}},\"comment\":{}}],[\"minpath\",{\"_index\":170,\"name\":{\"363\":{},\"446\":{},\"514\":{},\"600\":{}},\"comment\":{}}],[\"minpriorityqueue\",{\"_index\":382,\"name\":{\"1187\":{}},\"comment\":{}}],[\"morris\",{\"_index\":271,\"name\":{\"675\":{},\"733\":{},\"798\":{},\"910\":{},\"979\":{},\"1072\":{},\"1386\":{},\"1444\":{},\"1489\":{},\"1555\":{}},\"comment\":{}}],[\"morriscount\",{\"_index\":343,\"name\":{\"1023\":{}},\"comment\":{}}],[\"move\",{\"_index\":430,\"name\":{\"1314\":{}},\"comment\":{}}],[\"multiply\",{\"_index\":389,\"name\":{\"1259\":{},\"1288\":{}},\"comment\":{}}],[\"multiplybyvalue\",{\"_index\":413,\"name\":{\"1289\":{}},\"comment\":{}}],[\"multiplybyvector\",{\"_index\":414,\"name\":{\"1290\":{}},\"comment\":{}}],[\"navigator\",{\"_index\":424,\"name\":{\"1304\":{}},\"comment\":{}}],[\"navigatorparams\",{\"_index\":512,\"name\":{\"1642\":{}},\"comment\":{}}],[\"needbalanced\",{\"_index\":492,\"name\":{\"1611\":{}},\"comment\":{}}],[\"next\",{\"_index\":4,\"name\":{\"4\":{},\"78\":{},\"114\":{}},\"comment\":{}}],[\"node\",{\"_index\":504,\"name\":{\"1626\":{}},\"comment\":{}}],[\"nodeorpropertyname\",{\"_index\":487,\"name\":{\"1605\":{}},\"comment\":{}}],[\"nodes\",{\"_index\":115,\"name\":{\"222\":{},\"279\":{},\"1160\":{},\"1192\":{},\"1224\":{},\"1632\":{}},\"comment\":{}}],[\"nonnumbernonobjectbutdefined\",{\"_index\":526,\"name\":{\"1669\":{}},\"comment\":{}}],[\"normalize\",{\"_index\":393,\"name\":{\"1263\":{}},\"comment\":{}}],[\"objectdeque\",{\"_index\":119,\"name\":{\"275\":{}},\"comment\":{}}],[\"objectwithnonnumberid\",{\"_index\":528,\"name\":{\"1671\":{}},\"comment\":{}}],[\"objectwithnumberid\",{\"_index\":529,\"name\":{\"1674\":{}},\"comment\":{}}],[\"objectwithoutid\",{\"_index\":527,\"name\":{\"1670\":{}},\"comment\":{}}],[\"offset\",{\"_index\":117,\"name\":{\"224\":{}},\"comment\":{}}],[\"onmove\",{\"_index\":425,\"name\":{\"1306\":{},\"1646\":{}},\"comment\":{}}],[\"origin\",{\"_index\":224,\"name\":{\"551\":{}},\"comment\":{}}],[\"outdegreeof\",{\"_index\":202,\"name\":{\"412\":{},\"566\":{},\"1494\":{}},\"comment\":{}}],[\"outedgemap\",{\"_index\":194,\"name\":{\"399\":{},\"556\":{}},\"comment\":{}}],[\"outgoingedgesof\",{\"_index\":200,\"name\":{\"409\":{},\"563\":{},\"1492\":{}},\"comment\":{}}],[\"pair\",{\"_index\":34,\"name\":{\"44\":{}},\"comment\":{}}],[\"parent\",{\"_index\":233,\"name\":{\"628\":{},\"693\":{},\"751\":{},\"856\":{},\"932\":{},\"1003\":{},\"1347\":{}},\"comment\":{}}],[\"paths\",{\"_index\":168,\"name\":{\"361\":{},\"444\":{},\"512\":{},\"598\":{}},\"comment\":{}}],[\"peek\",{\"_index\":108,\"name\":{\"182\":{},\"193\":{},\"228\":{},\"1105\":{},\"1123\":{},\"1147\":{},\"1165\":{},\"1197\":{},\"1229\":{}},\"comment\":{}}],[\"peekfirst\",{\"_index\":87,\"name\":{\"134\":{},\"252\":{},\"292\":{},\"307\":{}},\"comment\":{}}],[\"peeklast\",{\"_index\":88,\"name\":{\"135\":{},\"229\":{},\"253\":{},\"294\":{},\"308\":{},\"1106\":{},\"1124\":{},\"1148\":{}},\"comment\":{}}],[\"perfectlybalance\",{\"_index\":289,\"name\":{\"764\":{},\"877\":{},\"945\":{},\"1015\":{},\"1412\":{},\"1457\":{},\"1523\":{}},\"comment\":{}}],[\"perp\",{\"_index\":395,\"name\":{\"1265\":{}},\"comment\":{}}],[\"poll\",{\"_index\":360,\"name\":{\"1108\":{},\"1126\":{},\"1150\":{},\"1166\":{},\"1198\":{},\"1230\":{}},\"comment\":{}}],[\"pollfirst\",{\"_index\":85,\"name\":{\"131\":{},\"249\":{},\"291\":{},\"305\":{}},\"comment\":{}}],[\"polllast\",{\"_index\":84,\"name\":{\"129\":{},\"247\":{},\"293\":{},\"304\":{}},\"comment\":{}}],[\"pop\",{\"_index\":64,\"name\":{\"90\":{},\"128\":{},\"184\":{},\"199\":{},\"246\":{}},\"comment\":{}}],[\"pq\",{\"_index\":357,\"name\":{\"1098\":{},\"1116\":{},\"1140\":{}},\"comment\":{}}],[\"predecessor\",{\"_index\":173,\"name\":{\"367\":{},\"450\":{},\"518\":{},\"604\":{}},\"comment\":{}}],[\"premap\",{\"_index\":167,\"name\":{\"360\":{},\"443\":{},\"511\":{},\"597\":{}},\"comment\":{}}],[\"prev\",{\"_index\":81,\"name\":{\"116\":{}},\"comment\":{}}],[\"priority\",{\"_index\":365,\"name\":{\"1134\":{}},\"comment\":{}}],[\"priorityextractor\",{\"_index\":359,\"name\":{\"1101\":{},\"1119\":{},\"1143\":{},\"1638\":{}},\"comment\":{}}],[\"priorityqueue\",{\"_index\":367,\"name\":{\"1155\":{}},\"comment\":{}}],[\"priorityqueuecomparator\",{\"_index\":505,\"name\":{\"1628\":{}},\"comment\":{}}],[\"priorityqueuedfsorderpattern\",{\"_index\":509,\"name\":{\"1635\":{}},\"comment\":{}}],[\"priorityqueueoptions\",{\"_index\":506,\"name\":{\"1630\":{}},\"comment\":{}}],[\"probability\",{\"_index\":99,\"name\":{\"164\":{}},\"comment\":{}}],[\"push\",{\"_index\":63,\"name\":{\"89\":{},\"126\":{},\"183\":{},\"198\":{},\"226\":{},\"244\":{}},\"comment\":{}}],[\"querysumbyrange\",{\"_index\":313,\"name\":{\"845\":{}},\"comment\":{}}],[\"queue\",{\"_index\":113,\"name\":{\"218\":{}},\"comment\":{}}],[\"random\",{\"_index\":402,\"name\":{\"1273\":{}},\"comment\":{}}],[\"randomlevel\",{\"_index\":105,\"name\":{\"172\":{}},\"comment\":{}}],[\"rbcolor\",{\"_index\":497,\"name\":{\"1618\":{}},\"comment\":{}}],[\"rbtree\",{\"_index\":330,\"name\":{\"935\":{}},\"comment\":{}}],[\"rbtreenode\",{\"_index\":327,\"name\":{\"924\":{}},\"comment\":{}}],[\"rbtreenodenested\",{\"_index\":500,\"name\":{\"1621\":{}},\"comment\":{}}],[\"rbtreeoptions\",{\"_index\":501,\"name\":{\"1622\":{}},\"comment\":{}}],[\"recursive\",{\"_index\":481,\"name\":{\"1595\":{}},\"comment\":{}}],[\"red\",{\"_index\":498,\"name\":{\"1619\":{}},\"comment\":{}}],[\"reduce\",{\"_index\":94,\"name\":{\"154\":{},\"272\":{}},\"comment\":{}}],[\"remove\",{\"_index\":23,\"name\":{\"24\":{},\"68\":{},\"175\":{},\"312\":{},\"653\":{},\"711\":{},\"778\":{},\"863\":{},\"959\":{},\"1016\":{},\"1329\":{},\"1364\":{},\"1405\":{},\"1453\":{},\"1519\":{}},\"comment\":{}}],[\"removeallvertices\",{\"_index\":154,\"name\":{\"346\":{},\"429\":{},\"497\":{},\"583\":{},\"1391\":{},\"1502\":{},\"1563\":{}},\"comment\":{}}],[\"removeedge\",{\"_index\":143,\"name\":{\"335\":{},\"406\":{},\"484\":{},\"560\":{},\"1398\":{},\"1509\":{},\"1570\":{}},\"comment\":{}}],[\"removeedgebetween\",{\"_index\":214,\"name\":{\"483\":{},\"1559\":{}},\"comment\":{}}],[\"removeedgesbetween\",{\"_index\":198,\"name\":{\"407\":{},\"561\":{},\"1498\":{}},\"comment\":{}}],[\"removeedgesrctodest\",{\"_index\":197,\"name\":{\"405\":{},\"559\":{},\"1497\":{}},\"comment\":{}}],[\"removevertex\",{\"_index\":153,\"name\":{\"345\":{},\"428\":{},\"496\":{},\"582\":{},\"1390\":{},\"1501\":{},\"1562\":{}},\"comment\":{}}],[\"resizetable\",{\"_index\":46,\"name\":{\"65\":{}},\"comment\":{}}],[\"restrictvalbyid\",{\"_index\":530,\"name\":{\"1677\":{}},\"comment\":{}}],[\"reverse\",{\"_index\":72,\"name\":{\"101\":{},\"150\":{},\"210\":{},\"268\":{},\"1266\":{}},\"comment\":{}}],[\"right\",{\"_index\":231,\"name\":{\"626\":{},\"692\":{},\"750\":{},\"832\":{},\"855\":{},\"931\":{},\"1002\":{},\"1346\":{},\"1599\":{}},\"comment\":{}}],[\"root\",{\"_index\":239,\"name\":{\"635\":{},\"699\":{},\"768\":{},\"842\":{},\"881\":{},\"949\":{},\"1045\":{},\"1326\":{},\"1356\":{},\"1418\":{},\"1463\":{},\"1529\":{},\"1597\":{}},\"comment\":{}}],[\"root_left\",{\"_index\":482,\"name\":{\"1600\":{}},\"comment\":{}}],[\"root_right\",{\"_index\":483,\"name\":{\"1601\":{}},\"comment\":{}}],[\"rotate\",{\"_index\":417,\"name\":{\"1293\":{}},\"comment\":{}}],[\"rounded\",{\"_index\":408,\"name\":{\"1281\":{}},\"comment\":{}}],[\"scale\",{\"_index\":416,\"name\":{\"1292\":{}},\"comment\":{}}],[\"sccs\",{\"_index\":179,\"name\":{\"374\":{},\"457\":{},\"525\":{},\"611\":{}},\"comment\":{}}],[\"segmenttree\",{\"_index\":308,\"name\":{\"833\":{}},\"comment\":{}}],[\"segmenttreenode\",{\"_index\":301,\"name\":{\"819\":{}},\"comment\":{}}],[\"segmenttreenodeval\",{\"_index\":473,\"name\":{\"1586\":{}},\"comment\":{}}],[\"set\",{\"_index\":21,\"name\":{\"22\":{},\"32\":{},\"66\":{},\"310\":{}},\"comment\":{}}],[\"setedgeweight\",{\"_index\":157,\"name\":{\"349\":{},\"432\":{},\"500\":{},\"586\":{},\"1399\":{},\"1510\":{},\"1571\":{}},\"comment\":{}}],[\"shift\",{\"_index\":65,\"name\":{\"91\":{},\"130\":{},\"200\":{},\"227\":{},\"248\":{}},\"comment\":{}}],[\"sign\",{\"_index\":400,\"name\":{\"1271\":{}},\"comment\":{}}],[\"singlylinkedlist\",{\"_index\":54,\"name\":{\"79\":{}},\"comment\":{}}],[\"singlylinkedlistnode\",{\"_index\":51,\"name\":{\"73\":{}},\"comment\":{}}],[\"size\",{\"_index\":25,\"name\":{\"26\":{},\"57\":{},\"136\":{},\"181\":{},\"225\":{},\"254\":{},\"288\":{},\"302\":{},\"637\":{},\"700\":{},\"769\":{},\"882\":{},\"950\":{},\"1046\":{},\"1103\":{},\"1121\":{},\"1145\":{},\"1161\":{},\"1193\":{},\"1225\":{},\"1357\":{},\"1419\":{},\"1464\":{},\"1530\":{}},\"comment\":{}}],[\"skiplist\",{\"_index\":98,\"name\":{\"162\":{}},\"comment\":{}}],[\"skiplistnode\",{\"_index\":95,\"name\":{\"157\":{}},\"comment\":{}}],[\"sort\",{\"_index\":361,\"name\":{\"1111\":{},\"1129\":{},\"1153\":{},\"1173\":{},\"1205\":{},\"1237\":{}},\"comment\":{}}],[\"specifyoptional\",{\"_index\":523,\"name\":{\"1663\":{}},\"comment\":{}}],[\"splaytree\",{\"_index\":331,\"name\":{\"991\":{}},\"comment\":{}}],[\"src\",{\"_index\":189,\"name\":{\"388\":{},\"541\":{}},\"comment\":{}}],[\"stack\",{\"_index\":106,\"name\":{\"176\":{}},\"comment\":{}}],[\"start\",{\"_index\":303,\"name\":{\"822\":{},\"838\":{},\"1312\":{}},\"comment\":{}}],[\"subtract\",{\"_index\":387,\"name\":{\"1257\":{},\"1287\":{}},\"comment\":{}}],[\"subtractvalue\",{\"_index\":388,\"name\":{\"1258\":{}},\"comment\":{}}],[\"subtreeadd\",{\"_index\":264,\"name\":{\"668\":{},\"726\":{},\"791\":{},\"903\":{},\"972\":{},\"1065\":{},\"1379\":{},\"1437\":{},\"1482\":{},\"1548\":{}},\"comment\":{}}],[\"subtreeaddcount\",{\"_index\":339,\"name\":{\"1019\":{}},\"comment\":{}}],[\"subtreesum\",{\"_index\":263,\"name\":{\"667\":{},\"725\":{},\"790\":{},\"902\":{},\"971\":{},\"1064\":{},\"1378\":{},\"1436\":{},\"1481\":{},\"1547\":{}},\"comment\":{}}],[\"subtreesumcount\",{\"_index\":338,\"name\":{\"1018\":{}},\"comment\":{}}],[\"sum\",{\"_index\":307,\"name\":{\"828\":{}},\"comment\":{}}],[\"sumtree\",{\"_index\":296,\"name\":{\"814\":{}},\"comment\":{}}],[\"swaplocation\",{\"_index\":249,\"name\":{\"647\":{},\"705\":{},\"774\":{},\"887\":{},\"955\":{},\"1011\":{},\"1358\":{},\"1420\":{},\"1465\":{},\"1531\":{}},\"comment\":{}}],[\"table\",{\"_index\":38,\"name\":{\"53\":{}},\"comment\":{}}],[\"tail\",{\"_index\":59,\"name\":{\"85\":{},\"123\":{},\"195\":{},\"242\":{}},\"comment\":{}}],[\"tarjan\",{\"_index\":174,\"name\":{\"368\":{},\"451\":{},\"519\":{},\"605\":{}},\"comment\":{}}],[\"thunk\",{\"_index\":520,\"name\":{\"1657\":{}},\"comment\":{}}],[\"thunk_symbol\",{\"_index\":442,\"name\":{\"1337\":{}},\"comment\":{}}],[\"toarray\",{\"_index\":71,\"name\":{\"100\":{},\"143\":{},\"185\":{},\"209\":{},\"234\":{},\"261\":{},\"1110\":{},\"1128\":{},\"1152\":{},\"1170\":{},\"1202\":{},\"1234\":{},\"1254\":{}},\"comment\":{}}],[\"toarrayreverse\",{\"_index\":90,\"name\":{\"149\":{},\"267\":{}},\"comment\":{}}],[\"topologicalproperty\",{\"_index\":503,\"name\":{\"1624\":{}},\"comment\":{}}],[\"topologicalsort\",{\"_index\":206,\"name\":{\"417\":{},\"571\":{}},\"comment\":{}}],[\"topologicalstatus\",{\"_index\":502,\"name\":{\"1623\":{}},\"comment\":{}}],[\"tothunk\",{\"_index\":444,\"name\":{\"1339\":{}},\"comment\":{}}],[\"tothunkfn\",{\"_index\":519,\"name\":{\"1655\":{}},\"comment\":{}}],[\"tovector\",{\"_index\":420,\"name\":{\"1298\":{}},\"comment\":{}}],[\"trampoline\",{\"_index\":445,\"name\":{\"1340\":{}},\"comment\":{}}],[\"trampolineasync\",{\"_index\":446,\"name\":{\"1341\":{}},\"comment\":{}}],[\"translate\",{\"_index\":418,\"name\":{\"1294\":{}},\"comment\":{}}],[\"treemap\",{\"_index\":35,\"name\":{\"46\":{}},\"comment\":{}}],[\"treemultiset\",{\"_index\":336,\"name\":{\"1006\":{}},\"comment\":{}}],[\"treemultisetnode\",{\"_index\":333,\"name\":{\"995\":{}},\"comment\":{}}],[\"treemultisetnodenested\",{\"_index\":474,\"name\":{\"1587\":{}},\"comment\":{}}],[\"treemultisetoptions\",{\"_index\":475,\"name\":{\"1588\":{}},\"comment\":{}}],[\"treenode\",{\"_index\":350,\"name\":{\"1085\":{}},\"comment\":{}}],[\"treeset\",{\"_index\":36,\"name\":{\"48\":{}},\"comment\":{}}],[\"trie\",{\"_index\":434,\"name\":{\"1323\":{}},\"comment\":{}}],[\"trienode\",{\"_index\":431,\"name\":{\"1315\":{}},\"comment\":{}}],[\"trlasyncfn\",{\"_index\":522,\"name\":{\"1661\":{}},\"comment\":{}}],[\"trlfn\",{\"_index\":521,\"name\":{\"1659\":{}},\"comment\":{}}],[\"truncate\",{\"_index\":394,\"name\":{\"1264\":{}},\"comment\":{}}],[\"turn\",{\"_index\":423,\"name\":{\"1302\":{}},\"comment\":{}}],[\"turning\",{\"_index\":511,\"name\":{\"1641\":{},\"1645\":{}},\"comment\":{}}],[\"twothreetree\",{\"_index\":349,\"name\":{\"1083\":{}},\"comment\":{}}],[\"undirectededge\",{\"_index\":210,\"name\":{\"467\":{}},\"comment\":{}}],[\"undirectedgraph\",{\"_index\":211,\"name\":{\"476\":{}},\"comment\":{}}],[\"undirectedvertex\",{\"_index\":209,\"name\":{\"463\":{}},\"comment\":{}}],[\"unshift\",{\"_index\":66,\"name\":{\"92\":{},\"132\":{},\"201\":{},\"250\":{}},\"comment\":{}}],[\"update\",{\"_index\":297,\"name\":{\"815\":{}},\"comment\":{}}],[\"updatenode\",{\"_index\":312,\"name\":{\"844\":{}},\"comment\":{}}],[\"uuidv4\",{\"_index\":440,\"name\":{\"1335\":{}},\"comment\":{}}],[\"val\",{\"_index\":3,\"name\":{\"3\":{},\"76\":{},\"112\":{},\"319\":{},\"323\":{},\"384\":{},\"391\":{},\"466\":{},\"471\":{},\"538\":{},\"543\":{},\"622\":{},\"690\":{},\"748\":{},\"826\":{},\"853\":{},\"929\":{},\"1000\":{},\"1136\":{},\"1318\":{},\"1344\":{},\"1625\":{}},\"comment\":{}}],[\"value\",{\"_index\":96,\"name\":{\"160\":{},\"1090\":{}},\"comment\":{}}],[\"values\",{\"_index\":310,\"name\":{\"836\":{}},\"comment\":{}}],[\"vector2d\",{\"_index\":386,\"name\":{\"1255\":{}},\"comment\":{}}],[\"vertexid\",{\"_index\":476,\"name\":{\"1589\":{}},\"comment\":{}}],[\"vertices\",{\"_index\":140,\"name\":{\"332\":{},\"424\":{},\"470\":{},\"492\":{},\"578\":{}},\"comment\":{}}],[\"view\",{\"_index\":415,\"name\":{\"1291\":{}},\"comment\":{}}],[\"visited\",{\"_index\":517,\"name\":{\"1652\":{}},\"comment\":{}}],[\"visitedid\",{\"_index\":243,\"name\":{\"641\":{},\"702\":{},\"771\":{},\"884\":{},\"952\":{},\"1048\":{},\"1353\":{},\"1415\":{},\"1460\":{},\"1526\":{}},\"comment\":{}}],[\"visitednode\",{\"_index\":247,\"name\":{\"645\":{},\"704\":{},\"773\":{},\"886\":{},\"954\":{},\"1050\":{},\"1355\":{},\"1417\":{},\"1462\":{},\"1528\":{}},\"comment\":{}}],[\"visitedval\",{\"_index\":245,\"name\":{\"643\":{},\"703\":{},\"772\":{},\"885\":{},\"953\":{},\"1049\":{},\"1354\":{},\"1416\":{},\"1461\":{},\"1527\":{}},\"comment\":{}}],[\"w\",{\"_index\":405,\"name\":{\"1277\":{}},\"comment\":{}}],[\"weight\",{\"_index\":134,\"name\":{\"325\":{},\"392\":{},\"472\":{},\"544\":{}},\"comment\":{}}],[\"x\",{\"_index\":403,\"name\":{\"1275\":{}},\"comment\":{}}],[\"y\",{\"_index\":404,\"name\":{\"1276\":{}},\"comment\":{}}],[\"zero\",{\"_index\":409,\"name\":{\"1282\":{}},\"comment\":{}}]],\"pipeline\":[]}}"); \ No newline at end of file diff --git a/docs/assets/style.css b/docs/assets/style.css deleted file mode 100644 index 18b4f8f..0000000 --- a/docs/assets/style.css +++ /dev/null @@ -1,1367 +0,0 @@ -:root { - /* Light */ - --light-color-background: #f2f4f8; - --light-color-background-secondary: #eff0f1; - --light-color-warning-text: #222; - --light-color-background-warning: #e6e600; - --light-color-icon-background: var(--light-color-background); - --light-color-accent: #c5c7c9; - --light-color-active-menu-item: var(--light-color-accent); - --light-color-text: #222; - --light-color-text-aside: #6e6e6e; - --light-color-link: #1f70c2; - - --light-color-ts-project: #b111c9; - --light-color-ts-module: var(--light-color-ts-project); - --light-color-ts-namespace: var(--light-color-ts-project); - --light-color-ts-enum: #7e6f15; - --light-color-ts-enum-member: var(--light-color-ts-enum); - --light-color-ts-variable: #4760ec; - --light-color-ts-function: #572be7; - --light-color-ts-class: #1f70c2; - --light-color-ts-interface: #108024; - --light-color-ts-constructor: var(--light-color-ts-class); - --light-color-ts-property: var(--light-color-ts-variable); - --light-color-ts-method: var(--light-color-ts-function); - --light-color-ts-call-signature: var(--light-color-ts-method); - --light-color-ts-index-signature: var(--light-color-ts-property); - --light-color-ts-constructor-signature: var(--light-color-ts-constructor); - --light-color-ts-parameter: var(--light-color-ts-variable); - /* type literal not included as links will never be generated to it */ - --light-color-ts-type-parameter: var(--light-color-ts-type-alias); - --light-color-ts-accessor: var(--light-color-ts-property); - --light-color-ts-get-signature: var(--light-color-ts-accessor); - --light-color-ts-set-signature: var(--light-color-ts-accessor); - /* object literal not included as it is not used and will be removed in 0.25 */ - --light-color-ts-type-alias: #d51270; - /* reference not included as links will be colored with the kind that it points to */ - - --light-external-icon: url("data:image/svg+xml;utf8,"); - --light-color-scheme: light; - - /* Dark */ - --dark-color-background: #2b2e33; - --dark-color-background-secondary: #1e2024; - --dark-color-background-warning: #bebe00; - --dark-color-warning-text: #222; - --dark-color-icon-background: var(--dark-color-background-secondary); - --dark-color-accent: #9096a2; - --dark-color-active-menu-item: #5d5d6a; - --dark-color-text: #f5f5f5; - --dark-color-text-aside: #dddddd; - --dark-color-link: #00aff4; - - --dark-color-ts-project: #e358ff; - --dark-color-ts-module: var(--dark-color-ts-project); - --dark-color-ts-namespace: var(--dark-color-ts-project); - --dark-color-ts-enum: #f4d93e; - --dark-color-ts-enum-member: var(--dark-color-ts-enum); - --dark-color-ts-variable: #798dff; - --dark-color-ts-function: #a280ff; - --dark-color-ts-class: #8ac4ff; - --dark-color-ts-interface: #6cff87; - --dark-color-ts-constructor: var(--dark-color-ts-class); - --dark-color-ts-property: var(--dark-color-ts-variable); - --dark-color-ts-method: var(--dark-color-ts-function); - --dark-color-ts-call-signature: var(--dark-color-ts-method); - --dark-color-ts-index-signature: var(--dark-color-ts-property); - --dark-color-ts-constructor-signature: var(--dark-color-ts-constructor); - --dark-color-ts-parameter: var(--dark-color-ts-variable); - /* type literal not included as links will never be generated to it */ - --dark-color-ts-type-parameter: var(--dark-color-ts-type-alias); - --dark-color-ts-accessor: var(--dark-color-ts-property); - --dark-color-ts-get-signature: var(--dark-color-ts-accessor); - --dark-color-ts-set-signature: var(--dark-color-ts-accessor); - /* object literal not included as it is not used and will be removed in 0.25 */ - --dark-color-ts-type-alias: #ff6492; - /* reference not included as links will be colored with the kind that it points to */ - - --dark-external-icon: url("data:image/svg+xml;utf8,"); - --dark-color-scheme: dark; -} - -@media (prefers-color-scheme: light) { - :root { - --color-background: var(--light-color-background); - --color-background-secondary: var(--light-color-background-secondary); - --color-background-warning: var(--light-color-background-warning); - --color-warning-text: var(--light-color-warning-text); - --color-icon-background: var(--light-color-icon-background); - --color-accent: var(--light-color-accent); - --color-active-menu-item: var(--light-color-active-menu-item); - --color-text: var(--light-color-text); - --color-text-aside: var(--light-color-text-aside); - --color-link: var(--light-color-link); - - --color-ts-module: var(--light-color-ts-module); - --color-ts-namespace: var(--light-color-ts-namespace); - --color-ts-enum: var(--light-color-ts-enum); - --color-ts-enum-member: var(--light-color-ts-enum-member); - --color-ts-variable: var(--light-color-ts-variable); - --color-ts-function: var(--light-color-ts-function); - --color-ts-class: var(--light-color-ts-class); - --color-ts-interface: var(--light-color-ts-interface); - --color-ts-constructor: var(--light-color-ts-constructor); - --color-ts-property: var(--light-color-ts-property); - --color-ts-method: var(--light-color-ts-method); - --color-ts-call-signature: var(--light-color-ts-call-signature); - --color-ts-index-signature: var(--light-color-ts-index-signature); - --color-ts-constructor-signature: var( - --light-color-ts-constructor-signature - ); - --color-ts-parameter: var(--light-color-ts-parameter); - --color-ts-type-parameter: var(--light-color-ts-type-parameter); - --color-ts-accessor: var(--light-color-ts-accessor); - --color-ts-get-signature: var(--light-color-ts-get-signature); - --color-ts-set-signature: var(--light-color-ts-set-signature); - --color-ts-type-alias: var(--light-color-ts-type-alias); - - --external-icon: var(--light-external-icon); - --color-scheme: var(--light-color-scheme); - } -} - -@media (prefers-color-scheme: dark) { - :root { - --color-background: var(--dark-color-background); - --color-background-secondary: var(--dark-color-background-secondary); - --color-background-warning: var(--dark-color-background-warning); - --color-warning-text: var(--dark-color-warning-text); - --color-icon-background: var(--dark-color-icon-background); - --color-accent: var(--dark-color-accent); - --color-active-menu-item: var(--dark-color-active-menu-item); - --color-text: var(--dark-color-text); - --color-text-aside: var(--dark-color-text-aside); - --color-link: var(--dark-color-link); - - --color-ts-module: var(--dark-color-ts-module); - --color-ts-namespace: var(--dark-color-ts-namespace); - --color-ts-enum: var(--dark-color-ts-enum); - --color-ts-enum-member: var(--dark-color-ts-enum-member); - --color-ts-variable: var(--dark-color-ts-variable); - --color-ts-function: var(--dark-color-ts-function); - --color-ts-class: var(--dark-color-ts-class); - --color-ts-interface: var(--dark-color-ts-interface); - --color-ts-constructor: var(--dark-color-ts-constructor); - --color-ts-property: var(--dark-color-ts-property); - --color-ts-method: var(--dark-color-ts-method); - --color-ts-call-signature: var(--dark-color-ts-call-signature); - --color-ts-index-signature: var(--dark-color-ts-index-signature); - --color-ts-constructor-signature: var( - --dark-color-ts-constructor-signature - ); - --color-ts-parameter: var(--dark-color-ts-parameter); - --color-ts-type-parameter: var(--dark-color-ts-type-parameter); - --color-ts-accessor: var(--dark-color-ts-accessor); - --color-ts-get-signature: var(--dark-color-ts-get-signature); - --color-ts-set-signature: var(--dark-color-ts-set-signature); - --color-ts-type-alias: var(--dark-color-ts-type-alias); - - --external-icon: var(--dark-external-icon); - --color-scheme: var(--dark-color-scheme); - } -} - -html { - color-scheme: var(--color-scheme); -} - -body { - margin: 0; -} - -:root[data-theme="light"] { - --color-background: var(--light-color-background); - --color-background-secondary: var(--light-color-background-secondary); - --color-background-warning: var(--light-color-background-warning); - --color-warning-text: var(--light-color-warning-text); - --color-icon-background: var(--light-color-icon-background); - --color-accent: var(--light-color-accent); - --color-active-menu-item: var(--light-color-active-menu-item); - --color-text: var(--light-color-text); - --color-text-aside: var(--light-color-text-aside); - --color-link: var(--light-color-link); - - --color-ts-module: var(--light-color-ts-module); - --color-ts-namespace: var(--light-color-ts-namespace); - --color-ts-enum: var(--light-color-ts-enum); - --color-ts-enum-member: var(--light-color-ts-enum-member); - --color-ts-variable: var(--light-color-ts-variable); - --color-ts-function: var(--light-color-ts-function); - --color-ts-class: var(--light-color-ts-class); - --color-ts-interface: var(--light-color-ts-interface); - --color-ts-constructor: var(--light-color-ts-constructor); - --color-ts-property: var(--light-color-ts-property); - --color-ts-method: var(--light-color-ts-method); - --color-ts-call-signature: var(--light-color-ts-call-signature); - --color-ts-index-signature: var(--light-color-ts-index-signature); - --color-ts-constructor-signature: var( - --light-color-ts-constructor-signature - ); - --color-ts-parameter: var(--light-color-ts-parameter); - --color-ts-type-parameter: var(--light-color-ts-type-parameter); - --color-ts-accessor: var(--light-color-ts-accessor); - --color-ts-get-signature: var(--light-color-ts-get-signature); - --color-ts-set-signature: var(--light-color-ts-set-signature); - --color-ts-type-alias: var(--light-color-ts-type-alias); - - --external-icon: var(--light-external-icon); - --color-scheme: var(--light-color-scheme); -} - -:root[data-theme="dark"] { - --color-background: var(--dark-color-background); - --color-background-secondary: var(--dark-color-background-secondary); - --color-background-warning: var(--dark-color-background-warning); - --color-warning-text: var(--dark-color-warning-text); - --color-icon-background: var(--dark-color-icon-background); - --color-accent: var(--dark-color-accent); - --color-active-menu-item: var(--dark-color-active-menu-item); - --color-text: var(--dark-color-text); - --color-text-aside: var(--dark-color-text-aside); - --color-link: var(--dark-color-link); - - --color-ts-module: var(--dark-color-ts-module); - --color-ts-namespace: var(--dark-color-ts-namespace); - --color-ts-enum: var(--dark-color-ts-enum); - --color-ts-enum-member: var(--dark-color-ts-enum-member); - --color-ts-variable: var(--dark-color-ts-variable); - --color-ts-function: var(--dark-color-ts-function); - --color-ts-class: var(--dark-color-ts-class); - --color-ts-interface: var(--dark-color-ts-interface); - --color-ts-constructor: var(--dark-color-ts-constructor); - --color-ts-property: var(--dark-color-ts-property); - --color-ts-method: var(--dark-color-ts-method); - --color-ts-call-signature: var(--dark-color-ts-call-signature); - --color-ts-index-signature: var(--dark-color-ts-index-signature); - --color-ts-constructor-signature: var( - --dark-color-ts-constructor-signature - ); - --color-ts-parameter: var(--dark-color-ts-parameter); - --color-ts-type-parameter: var(--dark-color-ts-type-parameter); - --color-ts-accessor: var(--dark-color-ts-accessor); - --color-ts-get-signature: var(--dark-color-ts-get-signature); - --color-ts-set-signature: var(--dark-color-ts-set-signature); - --color-ts-type-alias: var(--dark-color-ts-type-alias); - - --external-icon: var(--dark-external-icon); - --color-scheme: var(--dark-color-scheme); -} - -.always-visible, -.always-visible .tsd-signatures { - display: inherit !important; -} - -h1, -h2, -h3, -h4, -h5, -h6 { - line-height: 1.2; -} - -h1 > a, -h2 > a, -h3 > a, -h4 > a, -h5 > a, -h6 > a { - text-decoration: none; - color: var(--color-text); -} - -h1 { - font-size: 1.875rem; - margin: 0.67rem 0; -} - -h2 { - font-size: 1.5rem; - margin: 0.83rem 0; -} - -h3 { - font-size: 1.25rem; - margin: 1rem 0; -} - -h4 { - font-size: 1.05rem; - margin: 1.33rem 0; -} - -h5 { - font-size: 1rem; - margin: 1.5rem 0; -} - -h6 { - font-size: 0.875rem; - margin: 2.33rem 0; -} - -.uppercase { - text-transform: uppercase; -} - -dl, -menu, -ol, -ul { - margin: 1em 0; -} - -dd { - margin: 0 0 0 40px; -} - -.container { - max-width: 1700px; - padding: 0 2rem; -} - -/* Footer */ -.tsd-generator { - border-top: 1px solid var(--color-accent); - padding-top: 1rem; - padding-bottom: 1rem; - max-height: 3.5rem; -} - -.tsd-generator > p { - margin-top: 0; - margin-bottom: 0; - padding: 0 1rem; -} - -.container-main { - margin: 0 auto; - /* toolbar, footer, margin */ - min-height: calc(100vh - 41px - 56px - 4rem); -} - -@keyframes fade-in { - from { - opacity: 0; - } - to { - opacity: 1; - } -} -@keyframes fade-out { - from { - opacity: 1; - visibility: visible; - } - to { - opacity: 0; - } -} -@keyframes fade-in-delayed { - 0% { - opacity: 0; - } - 33% { - opacity: 0; - } - 100% { - opacity: 1; - } -} -@keyframes fade-out-delayed { - 0% { - opacity: 1; - visibility: visible; - } - 66% { - opacity: 0; - } - 100% { - opacity: 0; - } -} -@keyframes pop-in-from-right { - from { - transform: translate(100%, 0); - } - to { - transform: translate(0, 0); - } -} -@keyframes pop-out-to-right { - from { - transform: translate(0, 0); - visibility: visible; - } - to { - transform: translate(100%, 0); - } -} -body { - background: var(--color-background); - font-family: "Segoe UI", sans-serif; - font-size: 16px; - color: var(--color-text); -} - -a { - color: var(--color-link); - text-decoration: none; -} -a:hover { - text-decoration: underline; -} -a.external[target="_blank"] { - background-image: var(--external-icon); - background-position: top 3px right; - background-repeat: no-repeat; - padding-right: 13px; -} - -code, -pre { - font-family: Menlo, Monaco, Consolas, "Courier New", monospace; - padding: 0.2em; - margin: 0; - font-size: 0.875rem; - border-radius: 0.8em; -} - -pre { - position: relative; - white-space: pre; - white-space: pre-wrap; - word-wrap: break-word; - padding: 10px; - border: 1px solid var(--color-accent); -} -pre code { - padding: 0; - font-size: 100%; -} -pre > button { - position: absolute; - top: 10px; - right: 10px; - opacity: 0; - transition: opacity 0.1s; - box-sizing: border-box; -} -pre:hover > button, -pre > button.visible { - opacity: 1; -} - -blockquote { - margin: 1em 0; - padding-left: 1em; - border-left: 4px solid gray; -} - -.tsd-typography { - line-height: 1.333em; -} -.tsd-typography ul { - list-style: square; - padding: 0 0 0 20px; - margin: 0; -} -.tsd-typography h4, -.tsd-typography .tsd-index-panel h3, -.tsd-index-panel .tsd-typography h3, -.tsd-typography h5, -.tsd-typography h6 { - font-size: 1em; - margin: 0; -} -.tsd-typography h5, -.tsd-typography h6 { - font-weight: normal; -} -.tsd-typography p, -.tsd-typography ul, -.tsd-typography ol { - margin: 1em 0; -} - -.tsd-breadcrumb { - margin: 0; - padding: 0; - color: var(--color-text-aside); -} -.tsd-breadcrumb a { - color: var(--color-text-aside); - text-decoration: none; -} -.tsd-breadcrumb a:hover { - text-decoration: underline; -} -.tsd-breadcrumb li { - display: inline; -} -.tsd-breadcrumb li:after { - content: " / "; -} - -.tsd-comment-tags { - display: flex; - flex-direction: column; -} -dl.tsd-comment-tag-group { - display: flex; - align-items: center; - overflow: hidden; - margin: 0.5em 0; -} -dl.tsd-comment-tag-group dt { - display: flex; - margin-right: 0.5em; - font-size: 0.875em; - font-weight: normal; -} -dl.tsd-comment-tag-group dd { - margin: 0; -} -code.tsd-tag { - padding: 0.25em 0.4em; - border: 0.1em solid var(--color-accent); - margin-right: 0.25em; - font-size: 70%; -} -h1 code.tsd-tag:first-of-type { - margin-left: 0.25em; -} - -dl.tsd-comment-tag-group dd:before, -dl.tsd-comment-tag-group dd:after { - content: " "; -} -dl.tsd-comment-tag-group dd pre, -dl.tsd-comment-tag-group dd:after { - clear: both; -} -dl.tsd-comment-tag-group p { - margin: 0; -} - -.tsd-panel.tsd-comment .lead { - font-size: 1.1em; - line-height: 1.333em; - margin-bottom: 2em; -} -.tsd-panel.tsd-comment .lead:last-child { - margin-bottom: 0; -} - -.tsd-filter-visibility h4 { - font-size: 1rem; - padding-top: 0.75rem; - padding-bottom: 0.5rem; - margin: 0; -} -.tsd-filter-item:not(:last-child) { - margin-bottom: 0.5rem; -} -.tsd-filter-input { - display: flex; - width: fit-content; - width: -moz-fit-content; - align-items: center; - user-select: none; - -webkit-user-select: none; - -moz-user-select: none; - -ms-user-select: none; - cursor: pointer; -} -.tsd-filter-input input[type="checkbox"] { - cursor: pointer; - position: absolute; - width: 1.5em; - height: 1.5em; - opacity: 0; -} -.tsd-filter-input input[type="checkbox"]:disabled { - pointer-events: none; -} -.tsd-filter-input svg { - cursor: pointer; - width: 1.5em; - height: 1.5em; - margin-right: 0.5em; - border-radius: 0.33em; - /* Leaving this at full opacity breaks event listeners on Firefox. - Don't remove unless you know what you're doing. */ - opacity: 0.99; -} -.tsd-filter-input input[type="checkbox"]:focus + svg { - transform: scale(0.95); -} -.tsd-filter-input input[type="checkbox"]:focus:not(:focus-visible) + svg { - transform: scale(1); -} -.tsd-checkbox-background { - fill: var(--color-accent); -} -input[type="checkbox"]:checked ~ svg .tsd-checkbox-checkmark { - stroke: var(--color-text); -} -.tsd-filter-input input:disabled ~ svg > .tsd-checkbox-background { - fill: var(--color-background); - stroke: var(--color-accent); - stroke-width: 0.25rem; -} -.tsd-filter-input input:disabled ~ svg > .tsd-checkbox-checkmark { - stroke: var(--color-accent); -} - -.tsd-theme-toggle { - padding-top: 0.75rem; -} -.tsd-theme-toggle > h4 { - display: inline; - vertical-align: middle; - margin-right: 0.75rem; -} - -.tsd-hierarchy { - list-style: square; - margin: 0; -} -.tsd-hierarchy .target { - font-weight: bold; -} - -.tsd-panel-group.tsd-index-group { - margin-bottom: 0; -} -.tsd-index-panel .tsd-index-list { - list-style: none; - line-height: 1.333em; - margin: 0; - padding: 0.25rem 0 0 0; - overflow: hidden; - display: grid; - grid-template-columns: repeat(3, 1fr); - column-gap: 1rem; - grid-template-rows: auto; -} -@media (max-width: 1024px) { - .tsd-index-panel .tsd-index-list { - grid-template-columns: repeat(2, 1fr); - } -} -@media (max-width: 768px) { - .tsd-index-panel .tsd-index-list { - grid-template-columns: repeat(1, 1fr); - } -} -.tsd-index-panel .tsd-index-list li { - -webkit-page-break-inside: avoid; - -moz-page-break-inside: avoid; - -ms-page-break-inside: avoid; - -o-page-break-inside: avoid; - page-break-inside: avoid; -} - -.tsd-flag { - display: inline-block; - padding: 0.25em 0.4em; - border-radius: 4px; - color: var(--color-comment-tag-text); - background-color: var(--color-comment-tag); - text-indent: 0; - font-size: 75%; - line-height: 1; - font-weight: normal; -} - -.tsd-anchor { - position: relative; - top: -100px; -} - -.tsd-member { - position: relative; -} -.tsd-member .tsd-anchor + h3 { - display: flex; - align-items: center; - margin-top: 0; - margin-bottom: 0; - border-bottom: none; -} - -.tsd-navigation.settings { - margin: 1rem 0; -} -.tsd-navigation > a, -.tsd-navigation .tsd-accordion-summary { - width: calc(100% - 0.5rem); -} -.tsd-navigation a, -.tsd-navigation summary > span, -.tsd-page-navigation a { - display: inline-flex; - align-items: center; - padding: 0.25rem; - color: var(--color-text); - text-decoration: none; - box-sizing: border-box; -} -.tsd-navigation a.current, -.tsd-page-navigation a.current { - background: var(--color-active-menu-item); -} -.tsd-navigation a:hover, -.tsd-page-navigation a:hover { - text-decoration: underline; -} -.tsd-navigation ul, -.tsd-page-navigation ul { - margin-top: 0; - margin-bottom: 0; - padding: 0; - list-style: none; -} -.tsd-navigation li, -.tsd-page-navigation li { - padding: 0; - max-width: 100%; -} -.tsd-nested-navigation { - margin-left: 3rem; -} -.tsd-nested-navigation > li > details { - margin-left: -1.5rem; -} -.tsd-small-nested-navigation { - margin-left: 1.5rem; -} -.tsd-small-nested-navigation > li > details { - margin-left: -1.5rem; -} - -.tsd-nested-navigation > li > a, -.tsd-nested-navigation > li > span { - width: calc(100% - 1.75rem - 0.5rem); -} - -.tsd-page-navigation ul { - padding-left: 1.75rem; -} - -#tsd-sidebar-links a { - margin-top: 0; - margin-bottom: 0.5rem; - line-height: 1.25rem; -} -#tsd-sidebar-links a:last-of-type { - margin-bottom: 0; -} - -a.tsd-index-link { - padding: 0.25rem 0 !important; - font-size: 1rem; - line-height: 1.25rem; - display: inline-flex; - align-items: center; - color: var(--color-text); -} -.tsd-accordion-summary { - list-style-type: none; /* hide marker on non-safari */ - outline: none; /* broken on safari, so just hide it */ -} -.tsd-accordion-summary::-webkit-details-marker { - display: none; /* hide marker on safari */ -} -.tsd-accordion-summary, -.tsd-accordion-summary a { - user-select: none; - -moz-user-select: none; - -webkit-user-select: none; - -ms-user-select: none; - - cursor: pointer; -} -.tsd-accordion-summary a { - width: calc(100% - 1.5rem); -} -.tsd-accordion-summary > * { - margin-top: 0; - margin-bottom: 0; - padding-top: 0; - padding-bottom: 0; -} -.tsd-index-accordion .tsd-accordion-summary > svg { - margin-left: 0.25rem; -} -.tsd-index-content > :not(:first-child) { - margin-top: 0.75rem; -} -.tsd-index-heading { - margin-top: 1.5rem; - margin-bottom: 0.75rem; -} - -.tsd-kind-icon { - margin-right: 0.5rem; - width: 1.25rem; - height: 1.25rem; - min-width: 1.25rem; - min-height: 1.25rem; -} -.tsd-kind-icon path { - transform-origin: center; - transform: scale(1.1); -} -.tsd-signature > .tsd-kind-icon { - margin-right: 0.8rem; -} - -.tsd-panel { - margin-bottom: 2.5rem; -} -.tsd-panel.tsd-member { - margin-bottom: 4rem; -} -.tsd-panel:empty { - display: none; -} -.tsd-panel > h1, -.tsd-panel > h2, -.tsd-panel > h3 { - margin: 1.5rem -1.5rem 0.75rem -1.5rem; - padding: 0 1.5rem 0.75rem 1.5rem; -} -.tsd-panel > h1.tsd-before-signature, -.tsd-panel > h2.tsd-before-signature, -.tsd-panel > h3.tsd-before-signature { - margin-bottom: 0; - border-bottom: none; -} - -.tsd-panel-group { - margin: 4rem 0; -} -.tsd-panel-group.tsd-index-group { - margin: 2rem 0; -} -.tsd-panel-group.tsd-index-group details { - margin: 2rem 0; -} - -#tsd-search { - transition: background-color 0.2s; -} -#tsd-search .title { - position: relative; - z-index: 2; -} -#tsd-search .field { - position: absolute; - left: 0; - top: 0; - right: 2.5rem; - height: 100%; -} -#tsd-search .field input { - box-sizing: border-box; - position: relative; - top: -50px; - z-index: 1; - width: 100%; - padding: 0 10px; - opacity: 0; - outline: 0; - border: 0; - background: transparent; - color: var(--color-text); -} -#tsd-search .field label { - position: absolute; - overflow: hidden; - right: -40px; -} -#tsd-search .field input, -#tsd-search .title, -#tsd-toolbar-links a { - transition: opacity 0.2s; -} -#tsd-search .results { - position: absolute; - visibility: hidden; - top: 40px; - width: 100%; - margin: 0; - padding: 0; - list-style: none; - box-shadow: 0 0 4px rgba(0, 0, 0, 0.25); -} -#tsd-search .results li { - padding: 0 10px; - background-color: var(--color-background); -} -#tsd-search .results li:nth-child(even) { - background-color: var(--color-background-secondary); -} -#tsd-search .results li.state { - display: none; -} -#tsd-search .results li.current, -#tsd-search .results li:hover { - background-color: var(--color-accent); -} -#tsd-search .results a { - display: block; -} -#tsd-search .results a:before { - top: 10px; -} -#tsd-search .results span.parent { - color: var(--color-text-aside); - font-weight: normal; -} -#tsd-search.has-focus { - background-color: var(--color-accent); -} -#tsd-search.has-focus .field input { - top: 0; - opacity: 1; -} -#tsd-search.has-focus .title, -#tsd-search.has-focus #tsd-toolbar-links a { - z-index: 0; - opacity: 0; -} -#tsd-search.has-focus .results { - visibility: visible; -} -#tsd-search.loading .results li.state.loading { - display: block; -} -#tsd-search.failure .results li.state.failure { - display: block; -} - -#tsd-toolbar-links { - position: absolute; - top: 0; - right: 2rem; - height: 100%; - display: flex; - align-items: center; - justify-content: flex-end; -} -#tsd-toolbar-links a { - margin-left: 1.5rem; -} -#tsd-toolbar-links a:hover { - text-decoration: underline; -} - -.tsd-signature { - margin: 0 0 1rem 0; - padding: 1rem 0.5rem; - border: 1px solid var(--color-accent); - font-family: Menlo, Monaco, Consolas, "Courier New", monospace; - font-size: 14px; - overflow-x: auto; -} - -.tsd-signature-symbol { - color: var(--color-text-aside); - font-weight: normal; -} - -.tsd-signature-type { - font-style: italic; - font-weight: normal; -} - -.tsd-signatures { - padding: 0; - margin: 0 0 1em 0; - list-style-type: none; -} -.tsd-signatures .tsd-signature { - margin: 0; - border-color: var(--color-accent); - border-width: 1px 0; - transition: background-color 0.1s; -} -.tsd-description .tsd-signatures .tsd-signature { - border-width: 1px; -} - -ul.tsd-parameter-list, -ul.tsd-type-parameter-list { - list-style: square; - margin: 0; - padding-left: 20px; -} -ul.tsd-parameter-list > li.tsd-parameter-signature, -ul.tsd-type-parameter-list > li.tsd-parameter-signature { - list-style: none; - margin-left: -20px; -} -ul.tsd-parameter-list h5, -ul.tsd-type-parameter-list h5 { - font-size: 16px; - margin: 1em 0 0.5em 0; -} -.tsd-sources { - margin-top: 1rem; - font-size: 0.875em; -} -.tsd-sources a { - color: var(--color-text-aside); - text-decoration: underline; -} -.tsd-sources ul { - list-style: none; - padding: 0; -} - -.tsd-page-toolbar { - position: sticky; - z-index: 1; - top: 0; - left: 0; - width: 100%; - color: var(--color-text); - background: var(--color-background-secondary); - border-bottom: 1px var(--color-accent) solid; - transition: transform 0.3s ease-in-out; -} -.tsd-page-toolbar a { - color: var(--color-text); - text-decoration: none; -} -.tsd-page-toolbar a.title { - font-weight: bold; -} -.tsd-page-toolbar a.title:hover { - text-decoration: underline; -} -.tsd-page-toolbar .tsd-toolbar-contents { - display: flex; - justify-content: space-between; - height: 2.5rem; - margin: 0 auto; -} -.tsd-page-toolbar .table-cell { - position: relative; - white-space: nowrap; - line-height: 40px; -} -.tsd-page-toolbar .table-cell:first-child { - width: 100%; -} -.tsd-page-toolbar .tsd-toolbar-icon { - box-sizing: border-box; - line-height: 0; - padding: 12px 0; -} - -.tsd-widget { - display: inline-block; - overflow: hidden; - opacity: 0.8; - height: 40px; - transition: opacity 0.1s, background-color 0.2s; - vertical-align: bottom; - cursor: pointer; -} -.tsd-widget:hover { - opacity: 0.9; -} -.tsd-widget.active { - opacity: 1; - background-color: var(--color-accent); -} -.tsd-widget.no-caption { - width: 40px; -} -.tsd-widget.no-caption:before { - margin: 0; -} - -.tsd-widget.options, -.tsd-widget.menu { - display: none; -} -input[type="checkbox"] + .tsd-widget:before { - background-position: -120px 0; -} -input[type="checkbox"]:checked + .tsd-widget:before { - background-position: -160px 0; -} - -img { - max-width: 100%; -} - -.tsd-anchor-icon { - display: inline-flex; - align-items: center; - margin-left: 0.5rem; - vertical-align: middle; - color: var(--color-text); -} - -.tsd-anchor-icon svg { - width: 1em; - height: 1em; - visibility: hidden; -} - -.tsd-anchor-link:hover > .tsd-anchor-icon svg { - visibility: visible; -} - -.deprecated { - text-decoration: line-through; -} - -.warning { - padding: 1rem; - color: var(--color-warning-text); - background: var(--color-background-warning); -} - -.tsd-kind-project { - color: var(--color-ts-project); -} -.tsd-kind-module { - color: var(--color-ts-module); -} -.tsd-kind-namespace { - color: var(--color-ts-namespace); -} -.tsd-kind-enum { - color: var(--color-ts-enum); -} -.tsd-kind-enum-member { - color: var(--color-ts-enum-member); -} -.tsd-kind-variable { - color: var(--color-ts-variable); -} -.tsd-kind-function { - color: var(--color-ts-function); -} -.tsd-kind-class { - color: var(--color-ts-class); -} -.tsd-kind-interface { - color: var(--color-ts-interface); -} -.tsd-kind-constructor { - color: var(--color-ts-constructor); -} -.tsd-kind-property { - color: var(--color-ts-property); -} -.tsd-kind-method { - color: var(--color-ts-method); -} -.tsd-kind-call-signature { - color: var(--color-ts-call-signature); -} -.tsd-kind-index-signature { - color: var(--color-ts-index-signature); -} -.tsd-kind-constructor-signature { - color: var(--color-ts-constructor-signature); -} -.tsd-kind-parameter { - color: var(--color-ts-parameter); -} -.tsd-kind-type-literal { - color: var(--color-ts-type-literal); -} -.tsd-kind-type-parameter { - color: var(--color-ts-type-parameter); -} -.tsd-kind-accessor { - color: var(--color-ts-accessor); -} -.tsd-kind-get-signature { - color: var(--color-ts-get-signature); -} -.tsd-kind-set-signature { - color: var(--color-ts-set-signature); -} -.tsd-kind-type-alias { - color: var(--color-ts-type-alias); -} - -/* if we have a kind icon, don't color the text by kind */ -.tsd-kind-icon ~ span { - color: var(--color-text); -} - -* { - scrollbar-width: thin; - scrollbar-color: var(--color-accent) var(--color-icon-background); -} - -*::-webkit-scrollbar { - width: 0.75rem; -} - -*::-webkit-scrollbar-track { - background: var(--color-icon-background); -} - -*::-webkit-scrollbar-thumb { - background-color: var(--color-accent); - border-radius: 999rem; - border: 0.25rem solid var(--color-icon-background); -} - -/* mobile */ -@media (max-width: 769px) { - .tsd-widget.options, - .tsd-widget.menu { - display: inline-block; - } - - .container-main { - display: flex; - } - html .col-content { - float: none; - max-width: 100%; - width: 100%; - } - html .col-sidebar { - position: fixed !important; - overflow-y: auto; - -webkit-overflow-scrolling: touch; - z-index: 1024; - top: 0 !important; - bottom: 0 !important; - left: auto !important; - right: 0 !important; - padding: 1.5rem 1.5rem 0 0; - width: 75vw; - visibility: hidden; - background-color: var(--color-background); - transform: translate(100%, 0); - } - html .col-sidebar > *:last-child { - padding-bottom: 20px; - } - html .overlay { - content: ""; - display: block; - position: fixed; - z-index: 1023; - top: 0; - left: 0; - right: 0; - bottom: 0; - background-color: rgba(0, 0, 0, 0.75); - visibility: hidden; - } - - .to-has-menu .overlay { - animation: fade-in 0.4s; - } - - .to-has-menu .col-sidebar { - animation: pop-in-from-right 0.4s; - } - - .from-has-menu .overlay { - animation: fade-out 0.4s; - } - - .from-has-menu .col-sidebar { - animation: pop-out-to-right 0.4s; - } - - .has-menu body { - overflow: hidden; - } - .has-menu .overlay { - visibility: visible; - } - .has-menu .col-sidebar { - visibility: visible; - transform: translate(0, 0); - display: flex; - flex-direction: column; - gap: 1.5rem; - max-height: 100vh; - padding: 1rem 2rem; - } - .has-menu .tsd-navigation { - max-height: 100%; - } -} - -/* one sidebar */ -@media (min-width: 770px) { - .container-main { - display: grid; - grid-template-columns: minmax(0, 1fr) minmax(0, 2fr); - grid-template-areas: "sidebar content"; - margin: 2rem auto; - } - - .col-sidebar { - grid-area: sidebar; - } - .col-content { - grid-area: content; - padding: 0 1rem; - } -} -@media (min-width: 770px) and (max-width: 1399px) { - .col-sidebar { - max-height: calc(100vh - 2rem - 42px); - overflow: auto; - position: sticky; - top: 42px; - padding-top: 1rem; - } - .site-menu { - margin-top: 1rem; - } -} - -/* two sidebars */ -@media (min-width: 1200px) { - .container-main { - grid-template-columns: minmax(0, 1fr) minmax(0, 2.5fr) minmax(0, 20rem); - grid-template-areas: "sidebar content toc"; - } - - .col-sidebar { - display: contents; - } - - .page-menu { - grid-area: toc; - padding-left: 1rem; - } - .site-menu { - grid-area: sidebar; - } - - .site-menu { - margin-top: 1rem 0; - } - - .page-menu, - .site-menu { - max-height: calc(100vh - 2rem - 42px); - overflow: auto; - position: sticky; - top: 42px; - } -} diff --git a/docs/classes/AVLTree.html b/docs/classes/AVLTree.html deleted file mode 100644 index 2b04533..0000000 --- a/docs/classes/AVLTree.html +++ /dev/null @@ -1,2145 +0,0 @@ -AVLTree | data-structure-typed
-
- -
-
-
-
- -

Class AVLTree<N>

-
-

Type Parameters

-
-
-

Hierarchy

-
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_comparator -
-
-

Accessors

-
loopType -root -size -visitedId -visitedNode -visitedVal -
-
-

Methods

-
BFS -DFS -DFSIterative -_accumulatedByPropertyName -_addTo -_balanceFactor -_balanceLL -_balanceLR -_balancePath -_balanceRL -_balanceRR -_clearResults -_compare -_getResultByPropertyName -_pushByPropertyNameStopOrNot -_setLoopType -_setRoot -_setSize -_setVisitedId -_setVisitedNode -_setVisitedVal -_updateHeight -add -addMany -allGreaterNodesAdd -clear -createNode -fill -get -getDepth -getHeight -getLeftMost -getMinHeight -getNodes -getPathToRoot -getPredecessor -getRightMost -getSubTreeSize -has -isAVLBalanced -isBST -isEmpty -isPerfectlyBalanced -isSubtreeBST -lastKey -lesserSum -levelIterative -listLevels -morris -perfectlyBalance -remove -subTreeAdd -subTreeSum -swapLocation -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Protected _comparator

-
_comparator: BSTComparator = ...
-
-

Accessors

-
-

loopType

-
-
-

root

-
-
-

size

-
-
-

visitedId

-
-
-

visitedNode

-
-
-

visitedVal

-
-
-

Methods

-
-

BFS

-
    - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N["val"][]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

DFS

-
    - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

DFSIterative

-
    - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

Protected _accumulatedByPropertyName

-
    -
  • _accumulatedByPropertyName(node, nodeOrPropertyName?): void
    • -
  • -

    The function _accumulatedByPropertyName accumulates values from a given node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The node parameter is of type N, which represents a node in a data structure.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: NodeOrPropertyName
      -

      The nodeOrPropertyName parameter is an optional parameter that -can be either a string representing a property name or a reference to a Node object. If it is a string, it -specifies the property name to be used for accumulating values. If it is a Node object, it specifies

      -
      -
    -

    Returns void

    -
-
-

Protected _addTo

-
    -
  • _addTo(newNode, parent): undefined | null | N
    • -
  • -

    The function adds a new node to a binary tree if there is an available position.

    -
    -
    -

    Parameters

    -
      -
    • -
      newNode: null | N
      -

      The newNode parameter is of type N | null, which means it can either be a node of -type N or null. It represents the node that you want to add to the binary tree.

      -
      -
      • -
    • -
      parent: N
      -

      The parent parameter is of type N, which represents a node in a binary tree.

      -
      -
    -

    Returns undefined | null | N

    either the left or right child node of the parent node, depending on which child is available for adding -the new node. If a new node is added, the function also updates the size of the binary tree. If neither the left nor -right child is available, the function returns undefined. If the parent node is null, the function also returns -undefined.

    - -
-
-

Protected _balanceFactor

-
    -
  • _balanceFactor(node): number
    • -
  • -

    The balance factor of a given AVL tree node is calculated by subtracting the height of its left subtree from the -height of its right subtree.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The parameter "node" is of type N, which represents a node in an AVL tree.

      -
      -
    -

    Returns number

    The balance factor of the given AVL tree node.

    - -
-
-

Protected _balanceLL

-
    -
  • _balanceLL(A): void
    • -
  • -

    The _balanceLL function performs a left-left rotation on an AVL tree to balance it.

    -
    -
    -

    Parameters

    -
      -
    • -
      A: N
      -

      The parameter A is an AVLTreeNode object.

      -
      -
    -

    Returns void

    -
-
-

Protected _balanceLR

-
    -
  • _balanceLR(A): void
    • -
  • -

    The _balanceLR function performs a left-right rotation to balance an AVL tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      A: N
      -

      A is an AVLTreeNode object.

      -
      -
    -

    Returns void

    -
-
-

Protected _balancePath

-
    -
  • _balancePath(node): void
    • -
  • -

    The _balancePath function balances the AVL tree by performing appropriate rotations based on the balance factor of -each node in the path from the given node to the root.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The node parameter is an AVLTreeNode object, which represents a node in an AVL tree.

      -
      -
    -

    Returns void

    -
-
-

Protected _balanceRL

-
    -
  • _balanceRL(A): void
    • -
  • -

    The _balanceRL function performs a right-left rotation to balance an AVL tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      A: N
      -

      A is an AVLTreeNode object.

      -
      -
    -

    Returns void

    -
-
-

Protected _balanceRR

-
    -
  • _balanceRR(A): void
    • -
  • -

    The _balanceRR function performs a right-right rotation on an AVL tree to balance it.

    -
    -
    -

    Parameters

    -
      -
    • -
      A: N
      -

      The parameter A is an AVLTreeNode object.

      -
      -
    -

    Returns void

    -
-
-

Protected _clearResults

-
-
-

Protected _compare

-
    -
  • _compare(a, b): CP
    • -
  • -

    The function compares two binary tree node IDs using a comparator function and returns whether the first ID is -greater than, less than, or equal to the second ID.

    -
    -
    -

    Parameters

    -
      -
    • -
      a: number
      -

      a is a BinaryTreeNodeId, which represents the identifier of a binary tree node.

      -
      -
      • -
    • -
      b: number
      -

      The parameter "b" in the above code refers to a BinaryTreeNodeId.

      -
      -
    -

    Returns CP

    a value of type CP (ComparisonResult). The possible return values are CP.gt (greater than), CP.lt (less -than), or CP.eq (equal).

    - -
-
-

Protected _getResultByPropertyName

-
-
-

Protected _pushByPropertyNameStopOrNot

-
    -
  • _pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName?, onlyOne?): undefined | boolean
    • -
  • -

    The function checks if a given property of a binary tree node matches a specified value, and if so, adds the node to -a result array.

    -
    -
    -

    Parameters

    -
      -
    • -
      cur: N
      -

      The current node being processed.

      -
      -
      • -
    • -
      result: (undefined | null | N)[]
      -

      An array that stores the matching nodes.

      -
      -
      • -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter is either a BinaryTreeNodeId or a N -type. It represents the property value that we are comparing against in the switch statement.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to compare against when pushing nodes into the result array. It can be either 'id' -or 'val'. If it is not provided or is not equal to 'id' or 'val', the

      -
      -
      • -
    • -
      Optional onlyOne: boolean
      -

      The onlyOne parameter is an optional boolean parameter that determines whether to -stop after finding the first matching node or continue searching for all matching nodes. If onlyOne is set to -true, the function will stop after finding the first matching node and return true. If `onlyOne

      -
      -
    -

    Returns undefined | boolean

    a boolean value indicating whether only one matching node should be pushed into the result array.

    - -
-
-

Protected _setLoopType

-
-
-

Protected _setRoot

-
    -
  • _setRoot(v): void
    • -
  • -

    The function sets the root property of an object to a given value, and if the value is not null, it also sets the -parent property of the value to undefined.

    -
    -
    -

    Parameters

    -
      -
    • -
      v: null | N
      -

      The parameter v is of type N | null, which means it can either be of type N or null.

      -
      -
    -

    Returns void

    -
-
-

Protected _setSize

-
-
-

Protected _setVisitedId

-
-
-

Protected _setVisitedNode

-
-
-

Protected _setVisitedVal

-
-
-

Protected _updateHeight

-
    -
  • _updateHeight(node): void
    • -
  • -

    The function updates the height of a node in an AVL tree based on the heights of its left and right subtrees.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The parameter node is an AVLTreeNode object, which represents a node in an AVL tree.

      -
      -
    -

    Returns void

    -
-
-

add

-
    - -
  • -

    The function overrides the add method of a binary tree node and balances the tree after inserting a new node.

    -
    -
    -

    Parameters

    -
      -
    • -
      id: number
      -

      The id parameter is the identifier of the binary tree node that we want to add.

      -
      -
      • -
    • -
      Optional val: N["val"]
      -

      The val parameter is an optional value that can be assigned to the node being added. It is of type -N['val'], which means it should be of the same type as the val property of the nodes in the binary tree.

      -
      -
    -

    Returns undefined | null | N

    The method is returning the inserted node, or null or undefined if the insertion was not successful.

    - -
-
-

addMany

-
    - -
  • -

    The addMany function overrides the base class method to add multiple nodes to a binary search tree in a balanced -manner.

    -
    -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number)[] | (null | N)[]
      -

      The idsOrNodes parameter in the addMany function is an array of -BinaryTreeNodeId or N (node) objects, or null values. It represents the nodes or node IDs that need to be added -to the binary search tree.

      -
      -
      • -
    • -
      Optional data: N["val"][]
      -

      The values of tree nodes

      -
      -
      • -
    • -
      isBalanceAdd: boolean = false
      -

      If true the nodes will be balance inserted in binary search method.

      -
      -
    -

    Returns (undefined | null | N)[]

    The function addMany returns an array of N, null, or undefined values.

    - -
-
-

allGreaterNodesAdd

-
    - -
  • -

    The allGreaterNodesAdd function adds a delta value to the specified property of all nodes in a binary tree that -have a greater value than a given node.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | number | N
      -

      The node parameter can be either of type N (a generic type), -BinaryTreeNodeId, or null. It represents the node in the binary tree to which the delta value will be added.

      -
      -
      • -
    • -
      delta: number
      -

      The delta parameter is a number that represents the amount by which the property value of -each greater node should be increased.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name of the nodes in the binary tree that you want to update. If not provided, it defaults to -'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

clear

-
-
-

createNode

-
    - -
  • -

    The function creates a new AVL tree node with the given id and value.

    -
    -
    -

    Parameters

    -
      -
    • -
      id: number
      -

      The id parameter is the identifier for the binary tree node. It is used to uniquely -identify each node in the tree.

      -
      -
      • -
    • -
      Optional val: N["val"]
      -

      The val parameter is an optional value that can be assigned to the node. It represents the value -that will be stored in the node.

      -
      -
    -

    Returns N

    a new AVLTreeNode object with the specified id and value.

    - -
-
-

fill

-
    - -
  • -

    The fill function clears the binary tree and adds multiple nodes with the given IDs or nodes and optional data.

    -
    -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number)[] | (null | N)[]
      -

      The idsOrNodes parameter is an array that can contain either -BinaryTreeNodeId or N values.

      -
      -
      • -
    • -
      Optional data: N[] | N["val"][]
      -

      The data parameter is an optional array of values that will be assigned to -the nodes being added. If provided, the length of the data array should be equal to the length of the idsOrNodes -array. Each value in the data array will be assigned to the

      -
      -
    -

    Returns boolean

    The method is returning a boolean value.

    - -
-
-

get

-
    - -
  • -

    The function returns the first node in a binary tree that matches the given property name and value.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or a -generic type N. It represents the property of the binary tree node that you want to search for.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to use for searching the binary tree nodes. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns null | N

    The method is returning either a BinaryTreeNodeId or N (generic type) or null.

    - -
-
-

getDepth

-
-
-

getHeight

-
    - -
  • -

    The getHeight function calculates the maximum height of a binary tree, either recursively or iteratively.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | number | N
      -

      The beginRoot parameter is optional and can be of type N (a -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node), or null.

      -
      -
    -

    Returns number

    the height of the binary tree.

    - -
-
-

getLeftMost

-
    - -
  • -

    The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if -no node is specified. -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node), or null.

    -
    -

    Returns null | N

    The function getLeftMost returns the leftmost node in a binary tree. If the beginRoot parameter is -provided, it starts the traversal from that node. If beginRoot is not provided or is null, it starts the traversal -from the root of the binary tree. The function returns the leftmost node found during the traversal. If no leftmost -node is found (

    - -
    • - -
  • -

    The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if -no node is specified.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional node: N
      -

      The beginRoot parameter is optional and can be of type N (a -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node).

      -
      -
    -

    Returns N

    The function getLeftMost returns the leftmost node in a binary tree. If the beginRoot parameter is -provided, it starts the traversal from that node. If beginRoot is not provided or is null, it starts the traversal -from the root of the binary tree. The function returns the leftmost node found during the traversal. If no leftmost -node is found (

    - -
-
-

getMinHeight

-
    - -
  • -

    The getMinHeight function calculates the minimum height of a binary tree using either a recursive or iterative -approach.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | N
      -

      The beginRoot parameter is an optional parameter of type N or null. It -represents the starting node from which to calculate the minimum height of a binary tree. If no value is provided -for beginRoot, the this.root property is used as the default value.

      -
      -
    -

    Returns number

    The function getMinHeight returns the minimum height of the binary tree.

    - -
-
-

getNodes

-
    - -
  • -

    The function getNodes returns an array of nodes in a binary tree that match a given property value.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or an -N type. It represents the property of the binary tree node that you want to compare with.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName = 'id'
      -

      The propertyName parameter is an optional parameter that -specifies the property name to use for comparison. If not provided, it defaults to 'id'.

      -
      -
      • -
    • -
      Optional onlyOne: boolean
      -

      The onlyOne parameter is an optional boolean parameter that determines whether to -return only one node that matches the given nodeProperty or all nodes that match the nodeProperty. If onlyOne -is set to true, the function will return an array with only one node (if

      -
      -
    -

    Returns N[]

    an array of nodes (type N).

    - -
-
-

getPathToRoot

-
    - -
  • -

    The function getPathToRoot returns an array of nodes representing the path from a given node to the root node, with -an option to reverse the order of the nodes.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The node parameter represents a node in a tree structure. It is of type N, which could be any -type that represents a node in your specific implementation.

      -
      -
      • -
    • -
      Optional isReverse: boolean = true
      -

      The isReverse parameter is a boolean flag that determines whether the resulting -path should be reversed or not. If isReverse is set to true, the path will be reversed before returning it. If -isReverse is set to false or not provided, the path will

      -
      -
    -

    Returns N[]

    The function getPathToRoot returns an array of nodes (N[]).

    - -
-
-

getPredecessor

-
-
-

getRightMost

-
    - -
  • -

    The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail -recursion optimization.

    -
    -

    Returns null | N

    The getRightMost function returns the rightmost node in a binary tree. It returns the -rightmost node starting from the root of the binary tree.

    - -
    • - -
  • -

    The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail -recursion optimization.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional node: N
      -

      The node parameter is an optional parameter of type N or null. It represents the -starting node from which we want to find the rightmost node. If no node is provided, the function will default to -using the root node of the data structure.

      -
      -
    -

    Returns N

    The getRightMost function returns the rightmost node in a binary tree. It returns the rightmost node -starting from that node.

    - -
-
-

getSubTreeSize

-
    - -
  • -

    The function calculates the size of a subtree by traversing it either recursively or iteratively.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: undefined | null | N
      -

      The subTreeRoot parameter represents the root node of a subtree in a -binary tree.

      -
      -
    -

    Returns number

    the size of the subtree rooted at subTreeRoot.

    - -
-
-

has

-
    - -
  • -

    The function checks if a binary tree node has a specific property.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or N. -It represents the property of the binary tree node that you want to check.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the name of the property to be checked in the nodes. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

isAVLBalanced

-
-
-

isBST

-
-
-

isEmpty

-
-
-

isPerfectlyBalanced

-
    - -
  • -

    The function checks if a binary tree is perfectly balanced by comparing the minimum height and the height of the -tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | N
      -

      The parameter beginRoot is of type N or null. It represents the root node of a -tree or null if the tree is empty.

      -
      -
    -

    Returns boolean

    The method is returning a boolean value.

    - -
-
-

isSubtreeBST

-
-
-

lastKey

-
    - -
  • -

    The function returns the id of the rightmost node if the comparison between two values is less than, the id of the -leftmost node if the comparison is greater than, and the id of the rightmost node otherwise.

    -
    -

    Returns number

    The method lastKey() returns the id of the rightmost node in the binary tree if the comparison between -the values at index 0 and 1 is less than, otherwise it returns the id of the leftmost node. If the comparison is -equal, it returns the id of the rightmost node. If there are no nodes in the tree, it returns 0.

    - -
-
-

lesserSum

-
    - -
  • -

    The lesserSum function calculates the sum of property values in a binary tree for nodes that have a property value -less than a given node.

    -
    -
    -

    Parameters

    -
      -
    • -
      beginNode: null | number | N
      -

      The beginNode parameter can be one of the following:

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to use for calculating the sum. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns number

    The function lesserSum returns a number, which represents the sum of the values of the nodes in the -binary tree that have a lesser value than the specified beginNode based on the propertyName.

    - -
-
-

levelIterative

-
    - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on their 'id' property.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N["val"][]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

listLevels

-
    - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
    -

    Returns number[][]

    A 2D array of AbstractBinaryTreeNodeProperty objects.

    - -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
    -

    Returns number[][]

    -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N["val"][][]

    A 2D array of 'val' properties from each node.

    - -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[][]

    A 2D array of binary tree nodes.

    - -
-
-

morris

-
    - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

perfectlyBalance

-
    - -
  • -

    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 boolean

    The function perfectlyBalance() returns a boolean value.

    - -
-
-

remove

-
-
-

subTreeAdd

-
    - -
  • -

    The function subTreeAdd adds a delta value to a specified property of each node in a subtree.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: null | number | N
      -

      The subTreeRoot parameter represents the root node of a binary -tree or the ID of a node in the binary tree. It can also be null if there is no subtree to add to.

      -
      -
      • -
    • -
      delta: number
      -

      The delta parameter is a number that represents the amount by which the property value of -each node in the subtree should be incremented.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property of the binary tree node that should be modified. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

subTreeSum

-
    - -
  • -

    The function subTreeSum calculates the sum of a specified property in a binary tree or subtree.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: null | number | N
      -

      The subTreeRoot parameter represents the root node of a binary -tree or the ID of a binary tree node. It can also be null if there is no subtree.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      propertyName is an optional parameter that specifies the -property of the binary tree node to use for calculating the sum. It can be either 'id' or 'val'. If propertyName is -not provided, it defaults to 'id'.

      -
      -
    -

    Returns number

    a number, which is the sum of the values of the specified property in the subtree rooted at subTreeRoot.

    - -
-
-

swapLocation

-
    - -
  • -

    The swapLocation function swaps the location of two nodes in a binary tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcNode: N
      -

      The source node that you want to swap with the destination node.

      -
      -
      • -
    • -
      destNode: N
      -

      The destNode parameter represents the destination node where the values from srcNode will -be swapped to.

      -
      -
    -

    Returns N

    The destNode is being returned.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/AVLTreeNode.html b/docs/classes/AVLTreeNode.html deleted file mode 100644 index 23bf7cd..0000000 --- a/docs/classes/AVLTreeNode.html +++ /dev/null @@ -1,403 +0,0 @@ -AVLTreeNode | data-structure-typed
-
- -
-
-
-
- -

Class AVLTreeNode<V, NEIGHBOR>

-
-

Type Parameters

-
-
-

Hierarchy

-
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Accessors

-
familyPosition -height -id -left -parent -right -val -
-
-

Constructors

-
-

constructor

-
-
-

Accessors

-
-

familyPosition

-
-
-

height

-
-
-

id

-
-
-

left

-
-
-

parent

-
-
-

right

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/AaTree.html b/docs/classes/AaTree.html deleted file mode 100644 index b880de2..0000000 --- a/docs/classes/AaTree.html +++ /dev/null @@ -1,206 +0,0 @@ -AaTree | data-structure-typed
-
- -
-
-
-
- -

Class AaTree

-
-

Hierarchy

-
    -
  • AaTree
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Constructors

-
-

constructor

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/AbstractBinaryTree.html b/docs/classes/AbstractBinaryTree.html deleted file mode 100644 index f5616ad..0000000 --- a/docs/classes/AbstractBinaryTree.html +++ /dev/null @@ -1,1794 +0,0 @@ -AbstractBinaryTree | data-structure-typed
-
- -
-
-
-
- -

Class AbstractBinaryTree<N>Abstract

-
-

Type Parameters

-
-
-

Hierarchy

-
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_loopType -_root -_size -_visitedId -_visitedNode -_visitedVal -
-
-

Accessors

-
loopType -root -size -visitedId -visitedNode -visitedVal -
-
-

Methods

-
BFS -DFS -DFSIterative -_accumulatedByPropertyName -_addTo -_clearResults -_getResultByPropertyName -_pushByPropertyNameStopOrNot -_setLoopType -_setRoot -_setSize -_setVisitedId -_setVisitedNode -_setVisitedVal -add -addMany -clear -createNode -fill -get -getDepth -getHeight -getLeftMost -getMinHeight -getNodes -getPathToRoot -getPredecessor -getRightMost -getSubTreeSize -has -isBST -isEmpty -isPerfectlyBalanced -isSubtreeBST -levelIterative -listLevels -morris -remove -subTreeAdd -subTreeSum -swapLocation -
-
-

Constructors

-
-

Protected constructor

-
-
-

Properties

-
-

Private _loopType

-
_loopType: LoopType = LoopType.ITERATIVE
-
-

Private _root

-
_root: null | N = null
-
-

Private _size

-
_size: number = 0
-
-

Private _visitedId

-
_visitedId: number[] = []
-
-

Private _visitedNode

-
_visitedNode: N[] = []
-
-

Private _visitedVal

-
_visitedVal: N["val"][] = []
-
-

Accessors

-
-

loopType

-
-
-

root

-
-
-

size

-
-
-

visitedId

-
-
-

visitedNode

-
-
-

visitedVal

-
-
-

Methods

-
-

BFS

-
-
-

DFS

-
    - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

DFSIterative

-
    - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

Protected _accumulatedByPropertyName

-
    -
  • _accumulatedByPropertyName(node, nodeOrPropertyName?): void
    • -
  • -

    The function _accumulatedByPropertyName accumulates values from a given node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The node parameter is of type N, which represents a node in a data structure.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: NodeOrPropertyName
      -

      The nodeOrPropertyName parameter is an optional parameter that -can be either a string representing a property name or a reference to a Node object. If it is a string, it -specifies the property name to be used for accumulating values. If it is a Node object, it specifies

      -
      -
    -

    Returns void

    -
-
-

Protected _addTo

-
    -
  • _addTo(newNode, parent): undefined | null | N
    • -
  • -

    The function adds a new node to a binary tree if there is an available position.

    -
    -
    -

    Parameters

    -
      -
    • -
      newNode: null | N
      -

      The newNode parameter is of type N | null, which means it can either be a node of -type N or null. It represents the node that you want to add to the binary tree.

      -
      -
      • -
    • -
      parent: N
      -

      The parent parameter is of type N, which represents a node in a binary tree.

      -
      -
    -

    Returns undefined | null | N

    either the left or right child node of the parent node, depending on which child is available for adding -the new node. If a new node is added, the function also updates the size of the binary tree. If neither the left nor -right child is available, the function returns undefined. If the parent node is null, the function also returns -undefined.

    - -
-
-

Protected _clearResults

-
-
-

Protected _getResultByPropertyName

-
-
-

Protected _pushByPropertyNameStopOrNot

-
    -
  • _pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName?, onlyOne?): undefined | boolean
    • -
  • -

    The function checks if a given property of a binary tree node matches a specified value, and if so, adds the node to -a result array.

    -
    -
    -

    Parameters

    -
      -
    • -
      cur: N
      -

      The current node being processed.

      -
      -
      • -
    • -
      result: (undefined | null | N)[]
      -

      An array that stores the matching nodes.

      -
      -
      • -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter is either a BinaryTreeNodeId or a N -type. It represents the property value that we are comparing against in the switch statement.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to compare against when pushing nodes into the result array. It can be either 'id' -or 'val'. If it is not provided or is not equal to 'id' or 'val', the

      -
      -
      • -
    • -
      Optional onlyOne: boolean
      -

      The onlyOne parameter is an optional boolean parameter that determines whether to -stop after finding the first matching node or continue searching for all matching nodes. If onlyOne is set to -true, the function will stop after finding the first matching node and return true. If `onlyOne

      -
      -
    -

    Returns undefined | boolean

    a boolean value indicating whether only one matching node should be pushed into the result array.

    - -
-
-

Protected _setLoopType

-
-
-

Protected _setRoot

-
    -
  • _setRoot(v): void
    • -
  • -

    The function sets the root property of an object to a given value, and if the value is not null, it also sets the -parent property of the value to undefined.

    -
    -
    -

    Parameters

    -
      -
    • -
      v: null | N
      -

      The parameter v is of type N | null, which means it can either be of type N or null.

      -
      -
    -

    Returns void

    -
-
-

Protected _setSize

-
-
-

Protected _setVisitedId

-
-
-

Protected _setVisitedNode

-
-
-

Protected _setVisitedVal

-
-
-

add

-
    - -
  • -

    The add function adds a new node to a binary tree, either by ID or by creating a new node with a given value.

    -
    -
    -

    Parameters

    -
      -
    • -
      idOrNode: null | number | N
      -

      The idOrNode parameter can be either a BinaryTreeNodeId, which -is a number representing the ID of a binary tree node, or it can be a N object, which represents a binary tree -node itself. It can also be null if no node is specified.

      -
      -
      • -
    • -
      Optional val: N["val"]
      -

      The val parameter is an optional value that can be assigned to the val property of the new node -being added to the binary tree.

      -
      -
    -

    Returns undefined | null | N

    The function add returns either the inserted node (N), null, or undefined.

    - -
-
-

addMany

-
    - -
  • -

    The addMany function takes an array of binary tree node IDs or nodes, and optionally an array of corresponding data -values, and adds them to the binary tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number)[] | (null | N)[]
      -

      An array of BinaryTreeNodeId or BinaryTreeNode -objects, or null values.

      -
      -
      • -
    • -
      Optional data: N["val"][]
      -

      The data parameter is an optional array of values (N['val'][]) that corresponds to -the nodes or node IDs being added. It is used to set the value of each node being added. If data is not provided, -the value of the nodes will be undefined.

      -
      -
    -

    Returns (undefined | null | N)[]

    The function addMany returns an array of N, null, or undefined values.

    - -
-
-

clear

-
-
-

Abstract createNode

-
-
-

fill

-
    - -
  • -

    The fill function clears the binary tree and adds multiple nodes with the given IDs or nodes and optional data.

    -
    -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number)[] | (null | N)[]
      -

      The idsOrNodes parameter is an array that can contain either -BinaryTreeNodeId or N values.

      -
      -
      • -
    • -
      Optional data: N["val"][] | N[]
      -

      The data parameter is an optional array of values that will be assigned to -the nodes being added. If provided, the length of the data array should be equal to the length of the idsOrNodes -array. Each value in the data array will be assigned to the

      -
      -
    -

    Returns boolean

    The method is returning a boolean value.

    - -
-
-

get

-
    - -
  • -

    The function returns the first node that matches the given property name and value, or null if no matching node is -found.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or N. -It represents the property of the binary tree node that you want to search for.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to be used for searching the binary tree nodes. If this parameter is not provided, the -default value is set to 'id'.

      -
      -
    -

    Returns null | N

    either the value of the specified property of the node, or the node itself if no property name is provided. -If no matching node is found, it returns null.

    - -
-
-

getDepth

-
-
-

getHeight

-
    - -
  • -

    The getHeight function calculates the maximum height of a binary tree, either recursively or iteratively.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | number | N
      -

      The beginRoot parameter is optional and can be of type N (a -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node), or null.

      -
      -
    -

    Returns number

    the height of the binary tree.

    - -
-
-

getLeftMost

-
    - -
  • -

    The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if -no node is specified. -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node), or null.

    -
    -

    Returns null | N

    The function getLeftMost returns the leftmost node in a binary tree. If the beginRoot parameter is -provided, it starts the traversal from that node. If beginRoot is not provided or is null, it starts the traversal -from the root of the binary tree. The function returns the leftmost node found during the traversal. If no leftmost -node is found (

    - -
    • - -
  • -

    The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if -no node is specified.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional node: N
      -

      The beginRoot parameter is optional and can be of type N (a -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node).

      -
      -
    -

    Returns N

    The function getLeftMost returns the leftmost node in a binary tree. If the beginRoot parameter is -provided, it starts the traversal from that node. If beginRoot is not provided or is null, it starts the traversal -from the root of the binary tree. The function returns the leftmost node found during the traversal. If no leftmost -node is found (

    - -
-
-

getMinHeight

-
    - -
  • -

    The getMinHeight function calculates the minimum height of a binary tree using either a recursive or iterative -approach.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | N
      -

      The beginRoot parameter is an optional parameter of type N or null. It -represents the starting node from which to calculate the minimum height of a binary tree. If no value is provided -for beginRoot, the this.root property is used as the default value.

      -
      -
    -

    Returns number

    The function getMinHeight returns the minimum height of the binary tree.

    - -
-
-

getNodes

-
    - -
  • -

    The function getNodes returns an array of nodes that match a given property name and value in a binary tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or a -generic type N. It represents the property of the binary tree node that you want to search for.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to use when searching for nodes. If not provided, it defaults to 'id'.

      -
      -
      • -
    • -
      Optional onlyOne: boolean
      -

      The onlyOne parameter is an optional boolean parameter that determines whether to -return only one node that matches the given nodeProperty or propertyName. If onlyOne is set to true, the -function will stop traversing the tree and return the first matching node. If `only

      -
      -
    -

    Returns N[]

    an array of nodes (type N).

    - -
-
-

getPathToRoot

-
    - -
  • -

    The function getPathToRoot returns an array of nodes representing the path from a given node to the root node, with -an option to reverse the order of the nodes.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The node parameter represents a node in a tree structure. It is of type N, which could be any -type that represents a node in your specific implementation.

      -
      -
      • -
    • -
      Optional isReverse: boolean = true
      -

      The isReverse parameter is a boolean flag that determines whether the resulting -path should be reversed or not. If isReverse is set to true, the path will be reversed before returning it. If -isReverse is set to false or not provided, the path will

      -
      -
    -

    Returns N[]

    The function getPathToRoot returns an array of nodes (N[]).

    - -
-
-

getPredecessor

-
-
-

getRightMost

-
    - -
  • -

    The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail -recursion optimization.

    -
    -

    Returns null | N

    The getRightMost function returns the rightmost node in a binary tree. It returns the -rightmost node starting from the root of the binary tree.

    - -
    • - -
  • -

    The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail -recursion optimization.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional node: N
      -

      The node parameter is an optional parameter of type N or null. It represents the -starting node from which we want to find the rightmost node. If no node is provided, the function will default to -using the root node of the data structure.

      -
      -
    -

    Returns N

    The getRightMost function returns the rightmost node in a binary tree. It returns the rightmost node -starting from that node.

    - -
-
-

getSubTreeSize

-
    - -
  • -

    The function calculates the size of a subtree by traversing it either recursively or iteratively.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: undefined | null | N
      -

      The subTreeRoot parameter represents the root node of a subtree in a -binary tree.

      -
      -
    -

    Returns number

    the size of the subtree rooted at subTreeRoot.

    - -
-
-

has

-
    - -
  • -

    The function checks if a binary tree node has a specific property.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or N. -It represents the property of the binary tree node that you want to check.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the name of the property to be checked in the nodes. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

isBST

-
-
-

isEmpty

-
-
-

isPerfectlyBalanced

-
    - -
  • -

    The function checks if a binary tree is perfectly balanced by comparing the minimum height and the height of the -tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | N
      -

      The parameter beginRoot is of type N or null. It represents the root node of a -tree or null if the tree is empty.

      -
      -
    -

    Returns boolean

    The method is returning a boolean value.

    - -
-
-

isSubtreeBST

-
-
-

levelIterative

-
    - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on their 'id' property.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N["val"][]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

listLevels

-
    - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
    -

    Returns number[][]

    A 2D array of AbstractBinaryTreeNodeProperty objects.

    - -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
    -

    Returns number[][]

    -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N["val"][][]

    A 2D array of 'val' properties from each node.

    - -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[][]

    A 2D array of binary tree nodes.

    - -
-
-

morris

-
    - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

remove

-
-
-

subTreeAdd

-
    - -
  • -

    The function subTreeAdd adds a delta value to a specified property of each node in a subtree.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: null | number | N
      -

      The subTreeRoot parameter represents the root node of a binary -tree or the ID of a node in the binary tree. It can also be null if there is no subtree to add to.

      -
      -
      • -
    • -
      delta: number
      -

      The delta parameter is a number that represents the amount by which the property value of -each node in the subtree should be incremented.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property of the binary tree node that should be modified. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

subTreeSum

-
    - -
  • -

    The function subTreeSum calculates the sum of a specified property in a binary tree or subtree.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: null | number | N
      -

      The subTreeRoot parameter represents the root node of a binary -tree or the ID of a binary tree node. It can also be null if there is no subtree.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      propertyName is an optional parameter that specifies the -property of the binary tree node to use for calculating the sum. It can be either 'id' or 'val'. If propertyName is -not provided, it defaults to 'id'.

      -
      -
    -

    Returns number

    a number, which is the sum of the values of the specified property in the subtree rooted at subTreeRoot.

    - -
-
-

swapLocation

-
    - -
  • -

    The swapLocation function swaps the location of two nodes in a binary tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcNode: N
      -

      The source node that you want to swap with the destination node.

      -
      -
      • -
    • -
      destNode: N
      -

      The destNode parameter represents the destination node where the values from srcNode will -be swapped to.

      -
      -
    -

    Returns N

    The destNode is being returned.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/AbstractBinaryTreeNode.html b/docs/classes/AbstractBinaryTreeNode.html deleted file mode 100644 index b395ebe..0000000 --- a/docs/classes/AbstractBinaryTreeNode.html +++ /dev/null @@ -1,445 +0,0 @@ -AbstractBinaryTreeNode | data-structure-typed
-
- -
-
-
-
- -

Class AbstractBinaryTreeNode<V, NEIGHBOR>Abstract

-
-

Type Parameters

-
-
-

Hierarchy

-
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_height -_id -_left -_parent -_right -_val -
-
-

Accessors

-
familyPosition -height -id -left -parent -right -val -
-
-

Constructors

-
-

Protected constructor

-
    - -
  • -

    The constructor function initializes a BinaryTreeNode object with an id and an optional value.

    -
    -
    -

    Type Parameters

    -
    -
    -

    Parameters

    -
      -
    • -
      id: number
      -

      The id parameter is of type BinaryTreeNodeId and represents the unique identifier -of the binary tree node. It is used to distinguish one node from another in the binary tree.

      -
      -
      • -
    • -
      Optional val: V
      -

      The "val" parameter is an optional parameter of type V. It represents the value that will be -stored in the binary tree node. If no value is provided, it will be set to undefined.

      -
      -
    -

    Returns AbstractBinaryTreeNode<V, NEIGHBOR>

    -
-
-

Properties

-
-

Private _height

-
_height: number = 0
-
-

Private _id

-
_id: number
-
-

Private _left

-
_left: undefined | null | NEIGHBOR
-
-

Private _parent

-
_parent: undefined | null | NEIGHBOR
-
-

Private _right

-
_right: undefined | null | NEIGHBOR
-
-

Private _val

-
_val: undefined | V
-
-

Accessors

-
-

familyPosition

-
-
-

height

-
-
-

id

-
-
-

left

-
-
-

parent

-
-
-

right

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/AbstractEdge.html b/docs/classes/AbstractEdge.html deleted file mode 100644 index 3ab2b38..0000000 --- a/docs/classes/AbstractEdge.html +++ /dev/null @@ -1,349 +0,0 @@ -AbstractEdge | data-structure-typed
-
- -
-
-
-
- -

Class AbstractEdge<V>Abstract

-
-

Type Parameters

-
    -
  • -

    V = any

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_hashCode -_val -_weight -
-
-

Accessors

-
hashCode -val -weight -
-
-

Methods

-
_setHashCode -
-
-

Constructors

-
-

Protected constructor

-
    - -
  • -

    The above function is a protected constructor that initializes the weight, value, and hash code properties of an -object.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      V = any

    -
    -

    Parameters

    -
      -
    • -
      Optional weight: number
      -

      The weight parameter is an optional number that represents the weight of the object. If -a value is provided, it will be assigned to the _weight property. If no value is provided, the default value of 1 -will be assigned.

      -
      -
      • -
    • -
      Optional val: V
      -

      The val parameter is of type V, which means it can be any type. It is an optional parameter, -meaning it can be omitted when creating an instance of the class.

      -
      -
    -

    Returns AbstractEdge<V>

    -
-
-

Properties

-
-

Protected _hashCode

-
_hashCode: string
-
-

Private _val

-
_val: undefined | V
-
-

Private _weight

-
_weight: number
-
-

Accessors

-
-

hashCode

-
-
-

val

-
-
-

weight

-
-
-

Methods

-
-

Protected _setHashCode

-
    -
  • _setHashCode(v): void
    • -
  • -

    The function sets the value of the _hashCode property to the provided string.

    -
    -
    -

    Parameters

    -
      -
    • -
      v: string
      -

      The parameter "v" is of type string and represents the value that will be assigned to the -"_hashCode" property.

      -
      -
    -

    Returns void

    -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/AbstractGraph.html b/docs/classes/AbstractGraph.html deleted file mode 100644 index 240558a..0000000 --- a/docs/classes/AbstractGraph.html +++ /dev/null @@ -1,1109 +0,0 @@ -AbstractGraph | data-structure-typed
-
- -
-
-
-
- -

Class AbstractGraph<V, E>Abstract

-
-

Type Parameters

-
-
-

Hierarchy

-
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_vertices -
-
-

Accessors

-
vertices -
-
-

Methods

-
_addEdgeOnly -_addVertexOnly -_getVertex -_getVertexId -_setVertices -addEdge -addVertex -bellmanFord -createEdge -createVertex -degreeOf -dijkstra -dijkstraWithoutHeap -edgeSet -edgesOf -floyd -getAllPathsBetween -getEdge -getEndsOfEdge -getMinCostBetween -getMinPathBetween -getNeighbors -getPathSumWeight -getVertex -hasEdge -hasVertex -removeAllVertices -removeEdge -removeVertex -setEdgeWeight -tarjan -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Private _vertices

-
_vertices: Map<VertexId, V> = ...
-
-

Accessors

-
-

vertices

-
-
-

Methods

-
-

Protected Abstract _addEdgeOnly

-
-
-

Protected _addVertexOnly

-
-
-

Protected _getVertex

-
-
-

Protected _getVertexId

-
-
-

Protected _setVertices

-
-
-

addEdge

-
-
-

addVertex

-
-
-

bellmanFord

-
    - -
  • -

    BellmanFord time:O(VE) space:O(V) -one to rest pairs -/

    -

    /** -BellmanFord time:O(VE) space:O(V) -one to rest pairs -The Bellman-Ford algorithm is also used to find the shortest paths from a source node to all other nodes in a graph. Unlike Dijkstra's algorithm, it can handle edge weights that are negative. Its basic idea involves iterative relaxation of all edges for several rounds to gradually approximate the shortest paths. Due to its ability to handle negative-weight edges, the Bellman-Ford algorithm is more flexible in some scenarios. -The bellmanFord function implements the Bellman-Ford algorithm to find the shortest path from a source vertex to -all other vertices in a graph, and optionally detects negative cycles and generates the minimum path.

    -
    -
    -

    Parameters

    -
      -
    • -
      src: VertexId | V
      -

      The src parameter is the source vertex from which the Bellman-Ford algorithm will -start calculating the shortest paths. It can be either a vertex object or a vertex ID.

      -
      -
      • -
    • -
      Optional scanNegativeCycle: boolean
      -

      A boolean flag indicating whether to scan for negative cycles in the graph.

      -
      -
      • -
    • -
      Optional getMin: boolean
      -

      The getMin parameter is a boolean flag that determines whether the algorithm should -calculate the minimum distance from the source vertex to all other vertices in the graph. If getMin is set to -true, the algorithm will find the minimum distance and update the min variable with the minimum

      -
      -
      • -
    • -
      Optional genPath: boolean
      -

      A boolean flag indicating whether to generate paths for all vertices from the source -vertex.

      -
      -
    -

    Returns {
        distMap: Map<V, number>;
        hasNegativeCycle: undefined | boolean;
        min: number;
        minPath: V[];
        paths: V[][];
        preMap: Map<V, V>;
    }

    The function bellmanFord returns an object with the following properties:

    - -
      -
    • -
      distMap: Map<V, number>
      • -
    • -
      hasNegativeCycle: undefined | boolean
      • -
    • -
      min: number
      • -
    • -
      minPath: V[]
      • -
    • -
      paths: V[][]
      • -
    • -
      preMap: Map<V, V>
    -
-
-

Abstract createEdge

-
    - -
  • -

    In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it. -This means that using abstract methods in the parent class cannot constrain the grandchild classes. Defining methods within an interface also cannot constrain the descendant classes. When inheriting from this class, developers need to be aware that this method needs to be overridden.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcOrV1: VertexId
      -
      • -
    • -
      destOrV2: VertexId
      -
      • -
    • -
      Optional weight: number
      -
      • -
    • -
      Optional val: E
      -
    -

    Returns E

    -
-
-

Abstract createVertex

-
    - -
  • -

    In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it. -This means that using abstract methods in the parent class cannot constrain the grandchild classes. Defining methods within an interface also cannot constrain the descendant classes. When inheriting from this class, developers need to be aware that this method needs to be overridden.

    -
    -
    -

    Parameters

    -
    -

    Returns V

    -
-
-

Abstract degreeOf

-
-
-

dijkstra

-
    - -
  • -

    Dijkstra algorithm time: O(logVE) space: O(V + E)

    -

    Dijkstra's algorithm only solves the single-source shortest path problem, while the Bellman-Ford algorithm and Floyd-Warshall algorithm can address shortest paths between all pairs of nodes. -Dijkstra's algorithm is suitable for graphs with non-negative edge weights, whereas the Bellman-Ford algorithm and Floyd-Warshall algorithm can handle negative-weight edges. -The time complexity of Dijkstra's algorithm and the Bellman-Ford algorithm depends on the size of the graph, while the time complexity of the Floyd-Warshall algorithm is O(V^3), where V is the number of nodes. For dense graphs, Floyd-Warshall might become slower.

    -

    /

    -

    /** -Dijkstra's algorithm is used to find the shortest paths from a source node to all other nodes in a graph. Its basic idea is to repeatedly choose the node closest to the source node and update the distances of other nodes using this node as an intermediary. Dijkstra's algorithm requires that the edge weights in the graph are non-negative. -The dijkstra function implements Dijkstra's algorithm to find the shortest path between a source vertex and an -optional destination vertex, and optionally returns the minimum distance, the paths, and other information.

    -
    -
    -

    Parameters

    -
      -
    • -
      src: VertexId | V
      -

      The src parameter represents the source vertex from which the Dijkstra algorithm will -start. It can be either a vertex object or a vertex ID.

      -
      -
      • -
    • -
      Optional dest: null | VertexId | V
      -

      The dest parameter is the destination vertex or vertex ID. It specifies the -vertex to which the shortest path is calculated from the source vertex. If no destination is provided, the algorithm -will calculate the shortest paths to all other vertices from the source vertex.

      -
      -
      • -
    • -
      Optional getMinDist: boolean
      -

      The getMinDist parameter is a boolean flag that determines whether the minimum -distance from the source vertex to the destination vertex should be calculated and returned in the result. If -getMinDist is set to true, the minDist property in the result will contain the minimum distance

      -
      -
      • -
    • -
      Optional genPaths: boolean
      -

      The genPaths parameter is a boolean flag that determines whether or not to generate -paths in the Dijkstra algorithm. If genPaths is set to true, the algorithm will calculate and return the -shortest paths from the source vertex to all other vertices in the graph. If genPaths @returns The function dijkstrareturns an object of typeDijkstraResult`.

      -
      -
    -

    Returns DijkstraResult<V>

    -
-
-

dijkstraWithoutHeap

-
    - -
  • -

    Dijkstra algorithm time: O(VE) space: O(V + E) -/

    -

    /** -Dijkstra algorithm time: O(VE) space: O(V + E) -The function dijkstraWithoutHeap implements Dijkstra's algorithm to find the shortest path between two vertices in -a graph without using a heap data structure.

    -
    -
    -

    Parameters

    -
      -
    • -
      src: VertexId | V
      -

      The source vertex from which to start the Dijkstra's algorithm. It can be either a -vertex object or a vertex ID.

      -
      -
      • -
    • -
      Optional dest: null | VertexId | V
      -

      The dest parameter in the dijkstraWithoutHeap function is an optional -parameter that specifies the destination vertex for the Dijkstra algorithm. It can be either a vertex object or its -identifier. If no destination is provided, the value is set to null.

      -
      -
      • -
    • -
      Optional getMinDist: boolean
      -

      The getMinDist parameter is a boolean flag that determines whether the minimum -distance from the source vertex to the destination vertex should be calculated and returned in the result. If -getMinDist is set to true, the minDist property in the result will contain the minimum distance

      -
      -
      • -
    • -
      Optional genPaths: boolean
      -

      The genPaths parameter is a boolean flag that determines whether or not to generate -paths in the Dijkstra algorithm. If genPaths is set to true, the algorithm will calculate and return the -shortest paths from the source vertex to all other vertices in the graph. If genPaths @returns The function dijkstraWithoutHeapreturns an object of typeDijkstraResult`.

      -
      -
    -

    Returns DijkstraResult<V>

    -
-
-

Abstract edgeSet

-
-
-

Abstract edgesOf

-
-
-

floyd

-
    - -
  • -

    Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle -all pairs -/

    -

    /** -Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle -all pairs -The Floyd-Warshall algorithm is used to find the shortest paths between all pairs of nodes in a graph. It employs dynamic programming to compute the shortest paths from any node to any other node. The Floyd-Warshall algorithm's advantage lies in its ability to handle graphs with negative-weight edges, and it can simultaneously compute shortest paths between any two nodes. -The function implements the Floyd-Warshall algorithm to find the shortest path between all pairs of vertices in a -graph.

    -
    -

    Returns {
        costs: number[][];
        predecessor: (null | V)[][];
    }

    The function floyd() returns an object with two properties: costs and predecessor. The costs -property is a 2D array of numbers representing the shortest path costs between vertices in a graph. The -predecessor property is a 2D array of vertices (or null) representing the predecessor vertices in the shortest -path between vertices in the

    - -
      -
    • -
      costs: number[][]
      • -
    • -
      predecessor: (null | V)[][]
    -
-
-

getAllPathsBetween

-
    - -
  • -

    The function getAllPathsBetween finds all paths between two vertices in a graph using depth-first search.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 represents either a vertex object (V) or a vertex ID (VertexId). -It is the starting vertex for finding paths.

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      The parameter v2 represents either a vertex object (V) or a vertex ID (VertexId).

      -
      -
    -

    Returns V[][]

    The function getAllPathsBetween returns an array of arrays of vertices (V[][]).

    - -
-
-

Abstract getEdge

-
-
-

Abstract getEndsOfEdge

-
-
-

getMinCostBetween

-
    - -
  • -

    The function getMinCostBetween calculates the minimum cost between two vertices in a graph, either based on edge -weights or using a breadth-first search algorithm.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 represents the starting vertex or its ID.

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      The parameter v2 represents the destination vertex or its ID. It is the vertex to which -you want to find the minimum cost or weight from the source vertex v1.

      -
      -
      • -
    • -
      Optional isWeight: boolean
      -

      isWeight is an optional parameter that indicates whether the graph edges have weights. -If isWeight is set to true, the function will calculate the minimum cost between v1 and v2 based on the weights of -the edges. If isWeight is set to false or not provided, the function will calculate the

      -
      -
    -

    Returns null | number

    The function getMinCostBetween returns a number representing the minimum cost between two vertices (v1 -and v2). If the isWeight parameter is true, it calculates the minimum weight among all paths between the -vertices. If isWeight is false or not provided, it uses a breadth-first search (BFS) algorithm to calculate the -minimum number of

    - -
-
-

getMinPathBetween

-
    - -
  • -

    The function getMinPathBetween returns the minimum path between two vertices in a graph, either based on weight or -using a breadth-first search algorithm.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 represents the starting vertex of the path. It can be either a vertex -object (V) or a vertex ID (VertexId).

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      V | VertexId - The second vertex or vertex ID between which we want to find the minimum -path.

      -
      -
      • -
    • -
      Optional isWeight: boolean
      -

      A boolean flag indicating whether to consider the weight of edges in finding the -minimum path. If set to true, the function will use Dijkstra's algorithm to find the minimum weighted path. If set -to false, the function will use breadth-first search (BFS) to find the minimum path.

      -
      -
    -

    Returns null | V[]

    The function getMinPathBetween returns an array of vertices (V[]) representing the minimum path between -two vertices (v1 and v2). If there is no path between the vertices, it returns null.

    - -
-
-

Abstract getNeighbors

-
-
-

getPathSumWeight

-
    - -
  • -

    The function calculates the sum of weights along a given path.

    -
    -
    -

    Parameters

    -
      -
    • -
      path: V[]
      -

      An array of vertices (V) representing a path in a graph.

      -
      -
    -

    Returns number

    The function getPathSumWeight returns the sum of the weights of the edges in the given path.

    - -
-
-

getVertex

-
    - -
  • -

    The function "getVertex" returns the vertex with the specified ID or null if it doesn't exist.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexId: VertexId
      -

      The vertexId parameter is the identifier of the vertex that you want to retrieve from -the _vertices map.

      -
      -
    -

    Returns null | V

    The method getVertex returns the vertex with the specified vertexId if it exists in the _vertices -map. If the vertex does not exist, it returns null.

    - -
-
-

hasEdge

-
    - -
  • -

    The function checks if there is an edge between two vertices and returns a boolean value indicating the result.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 can be either a VertexId or a V. A VertexId represents the unique -identifier of a vertex in a graph, while V represents the type of the vertex object itself.

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      The parameter v2 represents the second vertex in the edge. It can be either a -VertexId or a V type, which represents the type of the vertex.

      -
      -
    -

    Returns boolean

    A boolean value is being returned.

    - -
-
-

hasVertex

-
-
-

removeAllVertices

-
    - -
  • -

    The function removes all vertices from a graph and returns a boolean indicating if any vertices were removed.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertices: VertexId[] | V[]
      -

      The vertices parameter can be either an array of vertices (V[]) or an array -of vertex IDs (VertexId[]).

      -
      -
    -

    Returns boolean

    a boolean value. It returns true if at least one vertex was successfully removed, and false if no vertices -were removed.

    - -
-
-

Abstract removeEdge

-
-
-

removeVertex

-
    - -
  • -

    The removeVertex function removes a vertex from a graph by its ID or by the vertex object itself.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can be either a vertex object (V) or a vertex ID -(VertexId).

      -
      -
    -

    Returns boolean

    The method is returning a boolean value.

    - -
-
-

setEdgeWeight

-
    - -
  • -

    The function sets the weight of an edge between two vertices in a graph.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcOrId: VertexId | V
      -

      The srcOrId parameter can be either a VertexId or a V object. It represents -the source vertex of the edge.

      -
      -
      • -
    • -
      destOrId: VertexId | V
      -

      The destOrId parameter represents the destination vertex of the edge. It can be -either a VertexId or a vertex object V.

      -
      -
      • -
    • -
      weight: number
      -

      The weight parameter represents the weight of the edge between the source vertex (srcOrId) -and the destination vertex (destOrId).

      -
      -
    -

    Returns boolean

    a boolean value. If the edge exists between the source and destination vertices, the function will update -the weight of the edge and return true. If the edge does not exist, the function will return false.

    - -
-
-

tarjan

-
    - -
  • -

    Tarjan is an algorithm based on DFS,which is used to solve the connectivity problem of graphs. -Tarjan can find cycles in directed or undirected graph -Tarjan can find the articulation points and bridges(critical edges) of undirected graphs in linear time, -Tarjan solve the bi-connected components of undirected graphs; -Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs. -/

    -

    /** -Tarjan is an algorithm based on DFS,which is used to solve the connectivity problem of graphs. -Tarjan can find cycles in directed or undirected graph -Tarjan can find the articulation points and bridges(critical edges) of undirected graphs in linear time, -Tarjan solve the bi-connected components of undirected graphs; -Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs. -The tarjan function is used to perform various graph analysis tasks such as finding articulation points, bridges, -strongly connected components (SCCs), and cycles in a graph.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional needArticulationPoints: boolean
      -

      A boolean value indicating whether or not to calculate and return the -articulation points in the graph. Articulation points are the vertices in a graph whose removal would increase the -number of connected components in the graph.

      -
      -
      • -
    • -
      Optional needBridges: boolean
      -

      A boolean flag indicating whether the algorithm should find and return the bridges -(edges whose removal would increase the number of connected components in the graph).

      -
      -
      • -
    • -
      Optional needSCCs: boolean
      -

      A boolean value indicating whether the Strongly Connected Components (SCCs) of the -graph are needed. If set to true, the function will calculate and return the SCCs of the graph. If set to false, the -SCCs will not be calculated or returned.

      -
      -
      • -
    • -
      Optional needCycles: boolean
      -

      A boolean flag indicating whether the algorithm should find cycles in the graph. If -set to true, the algorithm will return a map of cycles, where the keys are the low values of the SCCs and the values -are arrays of vertices that form cycles within the SCCs.

      -
      -
    -

    Returns {
        SCCs: Map<number, V[]>;
        articulationPoints: V[];
        bridges: E[];
        cycles: Map<number, V[]>;
        dfnMap: Map<V, number>;
        lowMap: Map<V, number>;
    }

    The function tarjan returns an object with the following properties:

    - -
      -
    • -
      SCCs: Map<number, V[]>
      • -
    • -
      articulationPoints: V[]
      • -
    • -
      bridges: E[]
      • -
    • -
      cycles: Map<number, V[]>
      • -
    • -
      dfnMap: Map<V, number>
      • -
    • -
      lowMap: Map<V, number>
    -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/AbstractVertex.html b/docs/classes/AbstractVertex.html deleted file mode 100644 index a3e2676..0000000 --- a/docs/classes/AbstractVertex.html +++ /dev/null @@ -1,303 +0,0 @@ -AbstractVertex | data-structure-typed
-
- -
-
-
-
- -

Class AbstractVertex<V>Abstract

-
-

Type Parameters

-
    -
  • -

    V = any

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_id -_val -
-
-

Accessors

-
id -val -
-
-

Constructors

-
-

Protected constructor

-
    - -
  • -

    The function is a protected constructor that takes an id and an optional value as parameters.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      V = any

    -
    -

    Parameters

    -
      -
    • -
      id: VertexId
      -

      The id parameter is of type VertexId and represents the identifier of the vertex. It is -used to uniquely identify the vertex object.

      -
      -
      • -
    • -
      Optional val: V
      -

      The parameter "val" is an optional parameter of type V. It is used to assign a value to the -vertex. If no value is provided, it will be set to undefined.

      -
      -
    -

    Returns AbstractVertex<V>

    -
-
-

Properties

-
-

Private _id

-
_id: VertexId
-
-

Private _val

-
_val: undefined | V
-
-

Accessors

-
-

id

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/ArrayDeque.html b/docs/classes/ArrayDeque.html deleted file mode 100644 index 0f91269..0000000 --- a/docs/classes/ArrayDeque.html +++ /dev/null @@ -1,473 +0,0 @@ -ArrayDeque | data-structure-typed
-
- -
-
-
-
- -

Class ArrayDeque<E>

-
-

Type Parameters

-
    -
  • -

    E

-
-

Hierarchy

-
    -
  • ArrayDeque
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_nodes -
-
-

Accessors

-
size -
-
-

Methods

-
addFirst -addLast -get -insert -isEmpty -peekFirst -peekLast -pollFirst -pollLast -remove -set -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Protected _nodes

-
_nodes: E[] = []
-
-

Accessors

-
-

size

-
-
-

Methods

-
-

addFirst

-
    - -
  • -

    The function "addFirst" adds a value to the beginning of an array.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: E
      -

      The value parameter represents the value that you want to add to the beginning of the array.

      -
      -
    -

    Returns number

    The return value of the addFirst function is the new length of the array _nodes after adding the -value at the beginning.

    - -
-
-

addLast

-
    - -
  • -

    The function "addLast" adds a value to the end of an array.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: E
      -

      The value parameter represents the value that you want to add to the end of the array.

      -
      -
    -

    Returns number

    The return value is the new length of the array after the value has been added.

    - -
-
-

get

-
    - -
  • -

    The get function returns the element at the specified index in an array, or null if the index is out of bounds.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter is a number that represents the position of the element you want to -retrieve from the array.

      -
      -
    -

    Returns null | E

    The method is returning the element at the specified index in the _nodes array. If the element exists, it -will be returned. If the element does not exist (i.e., the index is out of bounds), null will be returned.

    - -
-
-

insert

-
    - -
  • -

    The insert function adds a value at a specified index in an array.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter specifies the position at which the value should be inserted in the -array. It is a number that represents the index of the array where the value should be inserted. The index starts -from 0, so the first element of the array has an index of 0, the second element has

      -
      -
      • -
    • -
      value: E
      -

      The value parameter represents the value that you want to insert into the array at the specified -index.

      -
      -
    -

    Returns E[]

    The splice method returns an array containing the removed elements, if any. In this case, since no elements -are being removed, an empty array will be returned.

    - -
-
-

isEmpty

-
    - -
  • -

    The function checks if an array called "_nodes" is empty.

    -
    -

    Returns boolean

    The method isEmpty() is returning a boolean value. It returns true if the length of the _nodes array -is 0, indicating that the array is empty. Otherwise, it returns false.

    - -
-
-

peekFirst

-
    - -
  • -

    The peekFirst function returns the first element of an array or null if the array is empty.

    -
    -

    Returns null | E

    The function peekFirst() is returning the first element (E) of the _nodes array. If the array is -empty, it will return null.

    - -
-
-

peekLast

-
    - -
  • -

    The peekLast function returns the last element of an array or null if the array is empty.

    -
    -

    Returns null | E

    The method peekLast() returns the last element of the _nodes array, or null if the array is empty.

    - -
-
-

pollFirst

-
    - -
  • -

    The pollFirst function removes and returns the first element from an array, or returns null if the array is empty.

    -
    -

    Returns null | E

    The pollFirst() function returns the first element of the _nodes array, or null if the array is -empty.

    - -
-
-

pollLast

-
    - -
  • -

    The function "pollLast" returns and removes the last element from an array, or returns null if the array is empty.

    -
    -

    Returns null | E

    The method pollLast() returns the last element of the _nodes array, or null if the array is empty.

    - -
-
-

remove

-
    - -
  • -

    The remove function removes an element from an array at a specified index.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter specifies the position of the element to be removed from the array. It -is a number that represents the index of the element to be removed.

      -
      -
    -

    Returns E[]

    The method is returning an array containing the removed element.

    - -
-
-

set

-
    - -
  • -

    The set function assigns a value to a specific index in an array.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter is a number that represents the position of the element in the array -that you want to set a new value for.

      -
      -
      • -
    • -
      value: E
      -

      The value parameter represents the new value that you want to set at the specified index in the -_nodes array.

      -
      -
    -

    Returns E

    The value that is being set at the specified index in the _nodes array.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/BST.html b/docs/classes/BST.html deleted file mode 100644 index 666cd00..0000000 --- a/docs/classes/BST.html +++ /dev/null @@ -1,1989 +0,0 @@ -BST | data-structure-typed
-
- -
-
-
-
- -

Class BST<N>

-
-

Type Parameters

-
-
-

Hierarchy

-
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_comparator -
-
-

Accessors

-
loopType -root -size -visitedId -visitedNode -visitedVal -
-
-

Methods

-
BFS -DFS -DFSIterative -_accumulatedByPropertyName -_addTo -_clearResults -_compare -_getResultByPropertyName -_pushByPropertyNameStopOrNot -_setLoopType -_setRoot -_setSize -_setVisitedId -_setVisitedNode -_setVisitedVal -add -addMany -allGreaterNodesAdd -clear -createNode -fill -get -getDepth -getHeight -getLeftMost -getMinHeight -getNodes -getPathToRoot -getPredecessor -getRightMost -getSubTreeSize -has -isAVLBalanced -isBST -isEmpty -isPerfectlyBalanced -isSubtreeBST -lastKey -lesserSum -levelIterative -listLevels -morris -perfectlyBalance -remove -subTreeAdd -subTreeSum -swapLocation -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Protected _comparator

-
_comparator: BSTComparator = ...
-
-

Accessors

-
-

loopType

-
-
-

root

-
-
-

size

-
-
-

visitedId

-
-
-

visitedNode

-
-
-

visitedVal

-
-
-

Methods

-
-

BFS

-
    - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N["val"][]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

DFS

-
    - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

DFSIterative

-
    - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

Protected _accumulatedByPropertyName

-
    -
  • _accumulatedByPropertyName(node, nodeOrPropertyName?): void
    • -
  • -

    The function _accumulatedByPropertyName accumulates values from a given node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The node parameter is of type N, which represents a node in a data structure.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: NodeOrPropertyName
      -

      The nodeOrPropertyName parameter is an optional parameter that -can be either a string representing a property name or a reference to a Node object. If it is a string, it -specifies the property name to be used for accumulating values. If it is a Node object, it specifies

      -
      -
    -

    Returns void

    -
-
-

Protected _addTo

-
    -
  • _addTo(newNode, parent): undefined | null | N
    • -
  • -

    The function adds a new node to a binary tree if there is an available position.

    -
    -
    -

    Parameters

    -
      -
    • -
      newNode: null | N
      -

      The newNode parameter is of type N | null, which means it can either be a node of -type N or null. It represents the node that you want to add to the binary tree.

      -
      -
      • -
    • -
      parent: N
      -

      The parent parameter is of type N, which represents a node in a binary tree.

      -
      -
    -

    Returns undefined | null | N

    either the left or right child node of the parent node, depending on which child is available for adding -the new node. If a new node is added, the function also updates the size of the binary tree. If neither the left nor -right child is available, the function returns undefined. If the parent node is null, the function also returns -undefined.

    - -
-
-

Protected _clearResults

-
-
-

Protected _compare

-
    -
  • _compare(a, b): CP
    • -
  • -

    The function compares two binary tree node IDs using a comparator function and returns whether the first ID is -greater than, less than, or equal to the second ID.

    -
    -
    -

    Parameters

    -
      -
    • -
      a: number
      -

      a is a BinaryTreeNodeId, which represents the identifier of a binary tree node.

      -
      -
      • -
    • -
      b: number
      -

      The parameter "b" in the above code refers to a BinaryTreeNodeId.

      -
      -
    -

    Returns CP

    a value of type CP (ComparisonResult). The possible return values are CP.gt (greater than), CP.lt (less -than), or CP.eq (equal).

    - -
-
-

Protected _getResultByPropertyName

-
-
-

Protected _pushByPropertyNameStopOrNot

-
    -
  • _pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName?, onlyOne?): undefined | boolean
    • -
  • -

    The function checks if a given property of a binary tree node matches a specified value, and if so, adds the node to -a result array.

    -
    -
    -

    Parameters

    -
      -
    • -
      cur: N
      -

      The current node being processed.

      -
      -
      • -
    • -
      result: (undefined | null | N)[]
      -

      An array that stores the matching nodes.

      -
      -
      • -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter is either a BinaryTreeNodeId or a N -type. It represents the property value that we are comparing against in the switch statement.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to compare against when pushing nodes into the result array. It can be either 'id' -or 'val'. If it is not provided or is not equal to 'id' or 'val', the

      -
      -
      • -
    • -
      Optional onlyOne: boolean
      -

      The onlyOne parameter is an optional boolean parameter that determines whether to -stop after finding the first matching node or continue searching for all matching nodes. If onlyOne is set to -true, the function will stop after finding the first matching node and return true. If `onlyOne

      -
      -
    -

    Returns undefined | boolean

    a boolean value indicating whether only one matching node should be pushed into the result array.

    - -
-
-

Protected _setLoopType

-
-
-

Protected _setRoot

-
    -
  • _setRoot(v): void
    • -
  • -

    The function sets the root property of an object to a given value, and if the value is not null, it also sets the -parent property of the value to undefined.

    -
    -
    -

    Parameters

    -
      -
    • -
      v: null | N
      -

      The parameter v is of type N | null, which means it can either be of type N or null.

      -
      -
    -

    Returns void

    -
-
-

Protected _setSize

-
-
-

Protected _setVisitedId

-
-
-

Protected _setVisitedNode

-
-
-

Protected _setVisitedVal

-
-
-

add

-
    - -
  • -

    The add function adds a new node to a binary search tree, either by creating a new node or by updating an existing -node with the same ID.

    -
    -
    -

    Parameters

    -
      -
    • -
      idOrNode: null | number | N
      -

      The idOrNode parameter can be either a BinaryTreeNodeId or a N -(which represents a binary tree node) or null.

      -
      -
      • -
    • -
      Optional val: N["val"]
      -

      The val parameter is an optional value that can be assigned to the val property of the new node -being added to the binary search tree.

      -
      -
    -

    Returns undefined | null | N

    The function add returns the inserted node (inserted) which can be of type N, null, or undefined.

    - -
-
-

addMany

-
    - -
  • -

    The addMany function overrides the base class method to add multiple nodes to a binary search tree in a balanced -manner.

    -
    -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number)[] | (null | N)[]
      -

      The idsOrNodes parameter in the addMany function is an array of -BinaryTreeNodeId or N (node) objects, or null values. It represents the nodes or node IDs that need to be added -to the binary search tree.

      -
      -
      • -
    • -
      Optional data: N["val"][]
      -

      The values of tree nodes

      -
      -
      • -
    • -
      isBalanceAdd: boolean = false
      -

      If true the nodes will be balance inserted in binary search method.

      -
      -
    -

    Returns (undefined | null | N)[]

    The function addMany returns an array of N, null, or undefined values.

    - -
-
-

allGreaterNodesAdd

-
    - -
  • -

    The allGreaterNodesAdd function adds a delta value to the specified property of all nodes in a binary tree that -have a greater value than a given node.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | number | N
      -

      The node parameter can be either of type N (a generic type), -BinaryTreeNodeId, or null. It represents the node in the binary tree to which the delta value will be added.

      -
      -
      • -
    • -
      delta: number
      -

      The delta parameter is a number that represents the amount by which the property value of -each greater node should be increased.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name of the nodes in the binary tree that you want to update. If not provided, it defaults to -'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

clear

-
-
-

createNode

-
    - -
  • -

    The function creates a new binary search tree node with the given id and value.

    -
    -
    -

    Parameters

    -
      -
    • -
      id: number
      -

      The id parameter is the identifier for the binary tree node. It is used to uniquely -identify each node in the binary tree.

      -
      -
      • -
    • -
      Optional val: N["val"]
      -

      The val parameter is an optional value that can be assigned to the node. It represents the value -that will be stored in the node.

      -
      -
    -

    Returns N

    a new instance of the BSTNode class with the specified id and value.

    - -
-
-

fill

-
    - -
  • -

    The fill function clears the binary tree and adds multiple nodes with the given IDs or nodes and optional data.

    -
    -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number)[] | (null | N)[]
      -

      The idsOrNodes parameter is an array that can contain either -BinaryTreeNodeId or N values.

      -
      -
      • -
    • -
      Optional data: N["val"][] | N[]
      -

      The data parameter is an optional array of values that will be assigned to -the nodes being added. If provided, the length of the data array should be equal to the length of the idsOrNodes -array. Each value in the data array will be assigned to the

      -
      -
    -

    Returns boolean

    The method is returning a boolean value.

    - -
-
-

get

-
    - -
  • -

    The function returns the first node in a binary tree that matches the given property name and value.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or a -generic type N. It represents the property of the binary tree node that you want to search for.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to use for searching the binary tree nodes. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns null | N

    The method is returning either a BinaryTreeNodeId or N (generic type) or null.

    - -
-
-

getDepth

-
-
-

getHeight

-
    - -
  • -

    The getHeight function calculates the maximum height of a binary tree, either recursively or iteratively.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | number | N
      -

      The beginRoot parameter is optional and can be of type N (a -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node), or null.

      -
      -
    -

    Returns number

    the height of the binary tree.

    - -
-
-

getLeftMost

-
    - -
  • -

    The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if -no node is specified. -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node), or null.

    -
    -

    Returns null | N

    The function getLeftMost returns the leftmost node in a binary tree. If the beginRoot parameter is -provided, it starts the traversal from that node. If beginRoot is not provided or is null, it starts the traversal -from the root of the binary tree. The function returns the leftmost node found during the traversal. If no leftmost -node is found (

    - -
    • - -
  • -

    The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if -no node is specified.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional node: N
      -

      The beginRoot parameter is optional and can be of type N (a -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node).

      -
      -
    -

    Returns N

    The function getLeftMost returns the leftmost node in a binary tree. If the beginRoot parameter is -provided, it starts the traversal from that node. If beginRoot is not provided or is null, it starts the traversal -from the root of the binary tree. The function returns the leftmost node found during the traversal. If no leftmost -node is found (

    - -
-
-

getMinHeight

-
    - -
  • -

    The getMinHeight function calculates the minimum height of a binary tree using either a recursive or iterative -approach.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | N
      -

      The beginRoot parameter is an optional parameter of type N or null. It -represents the starting node from which to calculate the minimum height of a binary tree. If no value is provided -for beginRoot, the this.root property is used as the default value.

      -
      -
    -

    Returns number

    The function getMinHeight returns the minimum height of the binary tree.

    - -
-
-

getNodes

-
    - -
  • -

    The function getNodes returns an array of nodes in a binary tree that match a given property value.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or an -N type. It represents the property of the binary tree node that you want to compare with.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName = 'id'
      -

      The propertyName parameter is an optional parameter that -specifies the property name to use for comparison. If not provided, it defaults to 'id'.

      -
      -
      • -
    • -
      Optional onlyOne: boolean
      -

      The onlyOne parameter is an optional boolean parameter that determines whether to -return only one node that matches the given nodeProperty or all nodes that match the nodeProperty. If onlyOne -is set to true, the function will return an array with only one node (if

      -
      -
    -

    Returns N[]

    an array of nodes (type N).

    - -
-
-

getPathToRoot

-
    - -
  • -

    The function getPathToRoot returns an array of nodes representing the path from a given node to the root node, with -an option to reverse the order of the nodes.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The node parameter represents a node in a tree structure. It is of type N, which could be any -type that represents a node in your specific implementation.

      -
      -
      • -
    • -
      Optional isReverse: boolean = true
      -

      The isReverse parameter is a boolean flag that determines whether the resulting -path should be reversed or not. If isReverse is set to true, the path will be reversed before returning it. If -isReverse is set to false or not provided, the path will

      -
      -
    -

    Returns N[]

    The function getPathToRoot returns an array of nodes (N[]).

    - -
-
-

getPredecessor

-
-
-

getRightMost

-
    - -
  • -

    The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail -recursion optimization.

    -
    -

    Returns null | N

    The getRightMost function returns the rightmost node in a binary tree. It returns the -rightmost node starting from the root of the binary tree.

    - -
    • - -
  • -

    The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail -recursion optimization.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional node: N
      -

      The node parameter is an optional parameter of type N or null. It represents the -starting node from which we want to find the rightmost node. If no node is provided, the function will default to -using the root node of the data structure.

      -
      -
    -

    Returns N

    The getRightMost function returns the rightmost node in a binary tree. It returns the rightmost node -starting from that node.

    - -
-
-

getSubTreeSize

-
-
-

has

-
    - -
  • -

    The function checks if a binary tree node has a specific property.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or N. -It represents the property of the binary tree node that you want to check.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the name of the property to be checked in the nodes. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

isAVLBalanced

-
-
-

isBST

-
-
-

isEmpty

-
-
-

isPerfectlyBalanced

-
    - -
  • -

    The function checks if a binary tree is perfectly balanced by comparing the minimum height and the height of the -tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | N
      -

      The parameter beginRoot is of type N or null. It represents the root node of a -tree or null if the tree is empty.

      -
      -
    -

    Returns boolean

    The method is returning a boolean value.

    - -
-
-

isSubtreeBST

-
-
-

lastKey

-
    - -
  • -

    The function returns the id of the rightmost node if the comparison between two values is less than, the id of the -leftmost node if the comparison is greater than, and the id of the rightmost node otherwise.

    -
    -

    Returns number

    The method lastKey() returns the id of the rightmost node in the binary tree if the comparison between -the values at index 0 and 1 is less than, otherwise it returns the id of the leftmost node. If the comparison is -equal, it returns the id of the rightmost node. If there are no nodes in the tree, it returns 0.

    - -
-
-

lesserSum

-
    - -
  • -

    The lesserSum function calculates the sum of property values in a binary tree for nodes that have a property value -less than a given node.

    -
    -
    -

    Parameters

    -
      -
    • -
      beginNode: null | number | N
      -

      The beginNode parameter can be one of the following:

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to use for calculating the sum. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns number

    The function lesserSum returns a number, which represents the sum of the values of the nodes in the -binary tree that have a lesser value than the specified beginNode based on the propertyName.

    - -
-
-

levelIterative

-
    - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on their 'id' property.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N["val"][]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

listLevels

-
    - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
    -

    Returns number[][]

    A 2D array of AbstractBinaryTreeNodeProperty objects.

    - -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
    -

    Returns number[][]

    -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N["val"][][]

    A 2D array of 'val' properties from each node.

    - -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[][]

    A 2D array of binary tree nodes.

    - -
-
-

morris

-
    - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

perfectlyBalance

-
    - -
  • -

    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 boolean

    The function perfectlyBalance() returns a boolean value.

    - -
-
-

remove

-
-
-

subTreeAdd

-
    - -
  • -

    The function subTreeAdd adds a delta value to a specified property of each node in a subtree.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: null | number | N
      -

      The subTreeRoot parameter represents the root node of a binary -tree or the ID of a node in the binary tree. It can also be null if there is no subtree to add to.

      -
      -
      • -
    • -
      delta: number
      -

      The delta parameter is a number that represents the amount by which the property value of -each node in the subtree should be incremented.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property of the binary tree node that should be modified. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

subTreeSum

-
    - -
  • -

    The function subTreeSum calculates the sum of a specified property in a binary tree or subtree.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: null | number | N
      -

      The subTreeRoot parameter represents the root node of a binary -tree or the ID of a binary tree node. It can also be null if there is no subtree.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      propertyName is an optional parameter that specifies the -property of the binary tree node to use for calculating the sum. It can be either 'id' or 'val'. If propertyName is -not provided, it defaults to 'id'.

      -
      -
    -

    Returns number

    a number, which is the sum of the values of the specified property in the subtree rooted at subTreeRoot.

    - -
-
-

swapLocation

-
    - -
  • -

    The swapLocation function swaps the location of two nodes in a binary tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcNode: N
      -

      The source node that you want to swap with the destination node.

      -
      -
      • -
    • -
      destNode: N
      -

      The destNode parameter represents the destination node where the values from srcNode will -be swapped to.

      -
      -
    -

    Returns N

    The destNode is being returned.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/BSTNode.html b/docs/classes/BSTNode.html deleted file mode 100644 index 4692bef..0000000 --- a/docs/classes/BSTNode.html +++ /dev/null @@ -1,404 +0,0 @@ -BSTNode | data-structure-typed
-
- -
-
-
-
- -

Class BSTNode<V, NEIGHBOR>

-
-

Type Parameters

-
-
-

Hierarchy

-
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Accessors

-
familyPosition -height -id -left -parent -right -val -
-
-

Constructors

-
-

constructor

-
-
-

Accessors

-
-

familyPosition

-
-
-

height

-
-
-

id

-
-
-

left

-
-
-

parent

-
-
-

right

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/BTree.html b/docs/classes/BTree.html deleted file mode 100644 index 19dedf0..0000000 --- a/docs/classes/BTree.html +++ /dev/null @@ -1,206 +0,0 @@ -BTree | data-structure-typed
-
- -
-
-
-
- -

Class BTree

-
-

Hierarchy

-
    -
  • BTree
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Constructors

-
-

constructor

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/BinaryIndexedTree.html b/docs/classes/BinaryIndexedTree.html deleted file mode 100644 index 966fb00..0000000 --- a/docs/classes/BinaryIndexedTree.html +++ /dev/null @@ -1,375 +0,0 @@ -BinaryIndexedTree | data-structure-typed
-
- -
-
-
-
- -

Class BinaryIndexedTree

-
-

data-structure-typed

-
-
-

Author

Tyler Zeng

- -

Copyright

Copyright (c) 2022 Tyler Zeng zrwusa@gmail.com

- -

License

MIT License

-
-
-

Hierarchy

-
    -
  • BinaryIndexedTree
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_sumTree -
-
-

Accessors

-
sumTree -
-
-

Methods

-
_setSumTree -getPrefixSum -getRangeSum -update -lowBit -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor initializes an array with a specified length and fills it with zeros.

    -
    -
    -

    Parameters

    -
      -
    • -
      n: number
      -

      The parameter n represents the size of the array that will be used to store the sum tree. The -sum tree is a binary tree data structure used to efficiently calculate the sum of a range of elements in an array. -The size of the sum tree array is n + 1 because

      -
      -
    -

    Returns BinaryIndexedTree

    -
-
-

Properties

-
-

Private _sumTree

-
_sumTree: number[]
-
-

Accessors

-
-

sumTree

-
-
-

Methods

-
-

Protected _setSumTree

-
-
-

getPrefixSum

-
    - -
  • -

    The function calculates the prefix sum of an array using a binary indexed tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      i: number
      -

      The parameter "i" in the function "getPrefixSum" represents the index of the element in the -array for which we want to calculate the prefix sum.

      -
      -
    -

    Returns number

    The function getPrefixSum returns the prefix sum of the elements in the binary indexed tree up to index -i.

    - -
-
-

getRangeSum

-
    - -
  • -

    The function getRangeSum calculates the sum of a range of numbers in an array.

    -
    -
    -

    Parameters

    -
      -
    • -
      start: number
      -

      The start parameter is the starting index of the range for which we want to calculate the -sum.

      -
      -
      • -
    • -
      end: number
      -

      The "end" parameter represents the ending index of the range for which we want to calculate -the sum.

      -
      -
    -

    Returns number

    the sum of the elements in the range specified by the start and end indices.

    - -
-
-

update

-
    - -
  • -

    The update function updates the values in a binary indexed tree by adding a delta value to the specified index and -its ancestors.

    -
    -
    -

    Parameters

    -
      -
    • -
      i: number
      -

      The parameter i represents the index of the element in the _sumTree array that needs to be -updated.

      -
      -
      • -
    • -
      delta: number
      -

      The "delta" parameter represents the change in value that needs to be added to the element -at index "i" in the "_sumTree" array.

      -
      -
    -

    Returns void

    -
-
-

Static lowBit

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/BinaryTree.html b/docs/classes/BinaryTree.html deleted file mode 100644 index 962f1ff..0000000 --- a/docs/classes/BinaryTree.html +++ /dev/null @@ -1,1830 +0,0 @@ -BinaryTree | data-structure-typed
-
- -
-
-
-
- -

Class BinaryTree<N>

-
-

Type Parameters

-
-
-

Hierarchy

-
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Accessors

-
loopType -root -size -visitedId -visitedNode -visitedVal -
-
-

Methods

-
BFS -DFS -DFSIterative -_accumulatedByPropertyName -_addTo -_clearResults -_getResultByPropertyName -_pushByPropertyNameStopOrNot -_setLoopType -_setRoot -_setSize -_setVisitedId -_setVisitedNode -_setVisitedVal -add -addMany -clear -createNode -fill -get -getDepth -getHeight -getLeftMost -getMinHeight -getNodes -getPathToRoot -getPredecessor -getRightMost -getSubTreeSize -has -isBST -isEmpty -isPerfectlyBalanced -isSubtreeBST -levelIterative -listLevels -morris -remove -subTreeAdd -subTreeSum -swapLocation -
-
-

Constructors

-
-

constructor

-
-
-

Accessors

-
-

loopType

-
-
-

root

-
-
-

size

-
-
-

visitedId

-
-
-

visitedNode

-
-
-

visitedVal

-
-
-

Methods

-
-

BFS

-
    - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N["val"][]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

DFS

-
    - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

DFSIterative

-
    - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

Protected _accumulatedByPropertyName

-
    -
  • _accumulatedByPropertyName(node, nodeOrPropertyName?): void
    • -
  • -

    The function _accumulatedByPropertyName accumulates values from a given node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The node parameter is of type N, which represents a node in a data structure.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: NodeOrPropertyName
      -

      The nodeOrPropertyName parameter is an optional parameter that -can be either a string representing a property name or a reference to a Node object. If it is a string, it -specifies the property name to be used for accumulating values. If it is a Node object, it specifies

      -
      -
    -

    Returns void

    -
-
-

Protected _addTo

-
    -
  • _addTo(newNode, parent): undefined | null | N
    • -
  • -

    The function adds a new node to a binary tree if there is an available position.

    -
    -
    -

    Parameters

    -
      -
    • -
      newNode: null | N
      -

      The newNode parameter is of type N | null, which means it can either be a node of -type N or null. It represents the node that you want to add to the binary tree.

      -
      -
      • -
    • -
      parent: N
      -

      The parent parameter is of type N, which represents a node in a binary tree.

      -
      -
    -

    Returns undefined | null | N

    either the left or right child node of the parent node, depending on which child is available for adding -the new node. If a new node is added, the function also updates the size of the binary tree. If neither the left nor -right child is available, the function returns undefined. If the parent node is null, the function also returns -undefined.

    - -
-
-

Protected _clearResults

-
-
-

Protected _getResultByPropertyName

-
-
-

Protected _pushByPropertyNameStopOrNot

-
    -
  • _pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName?, onlyOne?): undefined | boolean
    • -
  • -

    The function checks if a given property of a binary tree node matches a specified value, and if so, adds the node to -a result array.

    -
    -
    -

    Parameters

    -
      -
    • -
      cur: N
      -

      The current node being processed.

      -
      -
      • -
    • -
      result: (undefined | null | N)[]
      -

      An array that stores the matching nodes.

      -
      -
      • -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter is either a BinaryTreeNodeId or a N -type. It represents the property value that we are comparing against in the switch statement.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to compare against when pushing nodes into the result array. It can be either 'id' -or 'val'. If it is not provided or is not equal to 'id' or 'val', the

      -
      -
      • -
    • -
      Optional onlyOne: boolean
      -

      The onlyOne parameter is an optional boolean parameter that determines whether to -stop after finding the first matching node or continue searching for all matching nodes. If onlyOne is set to -true, the function will stop after finding the first matching node and return true. If `onlyOne

      -
      -
    -

    Returns undefined | boolean

    a boolean value indicating whether only one matching node should be pushed into the result array.

    - -
-
-

Protected _setLoopType

-
-
-

Protected _setRoot

-
    -
  • _setRoot(v): void
    • -
  • -

    The function sets the root property of an object to a given value, and if the value is not null, it also sets the -parent property of the value to undefined.

    -
    -
    -

    Parameters

    -
      -
    • -
      v: null | N
      -

      The parameter v is of type N | null, which means it can either be of type N or null.

      -
      -
    -

    Returns void

    -
-
-

Protected _setSize

-
-
-

Protected _setVisitedId

-
-
-

Protected _setVisitedNode

-
-
-

Protected _setVisitedVal

-
-
-

add

-
    - -
  • -

    The add function adds a new node to a binary tree, either by ID or by creating a new node with a given value.

    -
    -
    -

    Parameters

    -
      -
    • -
      idOrNode: null | number | N
      -

      The idOrNode parameter can be either a BinaryTreeNodeId, which -is a number representing the ID of a binary tree node, or it can be a N object, which represents a binary tree -node itself. It can also be null if no node is specified.

      -
      -
      • -
    • -
      Optional val: N["val"]
      -

      The val parameter is an optional value that can be assigned to the val property of the new node -being added to the binary tree.

      -
      -
    -

    Returns undefined | null | N

    The function add returns either the inserted node (N), null, or undefined.

    - -
-
-

addMany

-
    - -
  • -

    The addMany function takes an array of binary tree node IDs or nodes, and optionally an array of corresponding data -values, and adds them to the binary tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number)[] | (null | N)[]
      -

      An array of BinaryTreeNodeId or BinaryTreeNode -objects, or null values.

      -
      -
      • -
    • -
      Optional data: N["val"][]
      -

      The data parameter is an optional array of values (N['val'][]) that corresponds to -the nodes or node IDs being added. It is used to set the value of each node being added. If data is not provided, -the value of the nodes will be undefined.

      -
      -
    -

    Returns (undefined | null | N)[]

    The function addMany returns an array of N, null, or undefined values.

    - -
-
-

clear

-
-
-

createNode

-
    - -
  • -

    The function creates a new binary tree node with an optional value.

    -
    -
    -

    Parameters

    -
      -
    • -
      id: number
      -

      The id parameter is the identifier for the binary tree node. It is of type -BinaryTreeNodeId, which represents the unique identifier for each node in the binary tree.

      -
      -
      • -
    • -
      Optional val: N["val"]
      -

      The val parameter is an optional value that can be assigned to the node. It represents the value -stored in the node.

      -
      -
    -

    Returns N

    a new instance of a BinaryTreeNode with the specified id and value.

    - -
-
-

fill

-
    - -
  • -

    The fill function clears the binary tree and adds multiple nodes with the given IDs or nodes and optional data.

    -
    -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number)[] | (null | N)[]
      -

      The idsOrNodes parameter is an array that can contain either -BinaryTreeNodeId or N values.

      -
      -
      • -
    • -
      Optional data: N["val"][] | N[]
      -

      The data parameter is an optional array of values that will be assigned to -the nodes being added. If provided, the length of the data array should be equal to the length of the idsOrNodes -array. Each value in the data array will be assigned to the

      -
      -
    -

    Returns boolean

    The method is returning a boolean value.

    - -
-
-

get

-
    - -
  • -

    The function returns the first node that matches the given property name and value, or null if no matching node is -found.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or N. -It represents the property of the binary tree node that you want to search for.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to be used for searching the binary tree nodes. If this parameter is not provided, the -default value is set to 'id'.

      -
      -
    -

    Returns null | N

    either the value of the specified property of the node, or the node itself if no property name is provided. -If no matching node is found, it returns null.

    - -
-
-

getDepth

-
-
-

getHeight

-
    - -
  • -

    The getHeight function calculates the maximum height of a binary tree, either recursively or iteratively.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | number | N
      -

      The beginRoot parameter is optional and can be of type N (a -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node), or null.

      -
      -
    -

    Returns number

    the height of the binary tree.

    - -
-
-

getLeftMost

-
    - -
  • -

    The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if -no node is specified. -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node), or null.

    -
    -

    Returns null | N

    The function getLeftMost returns the leftmost node in a binary tree. If the beginRoot parameter is -provided, it starts the traversal from that node. If beginRoot is not provided or is null, it starts the traversal -from the root of the binary tree. The function returns the leftmost node found during the traversal. If no leftmost -node is found (

    - -
    • - -
  • -

    The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if -no node is specified.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional node: N
      -

      The beginRoot parameter is optional and can be of type N (a -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node).

      -
      -
    -

    Returns N

    The function getLeftMost returns the leftmost node in a binary tree. If the beginRoot parameter is -provided, it starts the traversal from that node. If beginRoot is not provided or is null, it starts the traversal -from the root of the binary tree. The function returns the leftmost node found during the traversal. If no leftmost -node is found (

    - -
-
-

getMinHeight

-
    - -
  • -

    The getMinHeight function calculates the minimum height of a binary tree using either a recursive or iterative -approach.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | N
      -

      The beginRoot parameter is an optional parameter of type N or null. It -represents the starting node from which to calculate the minimum height of a binary tree. If no value is provided -for beginRoot, the this.root property is used as the default value.

      -
      -
    -

    Returns number

    The function getMinHeight returns the minimum height of the binary tree.

    - -
-
-

getNodes

-
    - -
  • -

    The function getNodes returns an array of nodes that match a given property name and value in a binary tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or a -generic type N. It represents the property of the binary tree node that you want to search for.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to use when searching for nodes. If not provided, it defaults to 'id'.

      -
      -
      • -
    • -
      Optional onlyOne: boolean
      -

      The onlyOne parameter is an optional boolean parameter that determines whether to -return only one node that matches the given nodeProperty or propertyName. If onlyOne is set to true, the -function will stop traversing the tree and return the first matching node. If `only

      -
      -
    -

    Returns N[]

    an array of nodes (type N).

    - -
-
-

getPathToRoot

-
    - -
  • -

    The function getPathToRoot returns an array of nodes representing the path from a given node to the root node, with -an option to reverse the order of the nodes.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The node parameter represents a node in a tree structure. It is of type N, which could be any -type that represents a node in your specific implementation.

      -
      -
      • -
    • -
      Optional isReverse: boolean = true
      -

      The isReverse parameter is a boolean flag that determines whether the resulting -path should be reversed or not. If isReverse is set to true, the path will be reversed before returning it. If -isReverse is set to false or not provided, the path will

      -
      -
    -

    Returns N[]

    The function getPathToRoot returns an array of nodes (N[]).

    - -
-
-

getPredecessor

-
-
-

getRightMost

-
    - -
  • -

    The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail -recursion optimization.

    -
    -

    Returns null | N

    The getRightMost function returns the rightmost node in a binary tree. It returns the -rightmost node starting from the root of the binary tree.

    - -
    • - -
  • -

    The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail -recursion optimization.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional node: N
      -

      The node parameter is an optional parameter of type N or null. It represents the -starting node from which we want to find the rightmost node. If no node is provided, the function will default to -using the root node of the data structure.

      -
      -
    -

    Returns N

    The getRightMost function returns the rightmost node in a binary tree. It returns the rightmost node -starting from that node.

    - -
-
-

getSubTreeSize

-
    - -
  • -

    The function calculates the size of a subtree by traversing it either recursively or iteratively.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: undefined | null | N
      -

      The subTreeRoot parameter represents the root node of a subtree in a -binary tree.

      -
      -
    -

    Returns number

    the size of the subtree rooted at subTreeRoot.

    - -
-
-

has

-
    - -
  • -

    The function checks if a binary tree node has a specific property.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or N. -It represents the property of the binary tree node that you want to check.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the name of the property to be checked in the nodes. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

isBST

-
-
-

isEmpty

-
-
-

isPerfectlyBalanced

-
    - -
  • -

    The function checks if a binary tree is perfectly balanced by comparing the minimum height and the height of the -tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | N
      -

      The parameter beginRoot is of type N or null. It represents the root node of a -tree or null if the tree is empty.

      -
      -
    -

    Returns boolean

    The method is returning a boolean value.

    - -
-
-

isSubtreeBST

-
    - -
  • -

    The function checks if a binary search tree is valid by traversing it either recursively or iteratively.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The node parameter represents the root node of a binary search tree (BST).

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

levelIterative

-
    - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on their 'id' property.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N["val"][]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

listLevels

-
    - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
    -

    Returns number[][]

    A 2D array of AbstractBinaryTreeNodeProperty objects.

    - -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
    -

    Returns number[][]

    -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N["val"][][]

    A 2D array of 'val' properties from each node.

    - -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[][]

    A 2D array of binary tree nodes.

    - -
-
-

morris

-
    - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

remove

-
    - -
  • -

    The remove function in TypeScript is used to delete a node from a binary search tree and returns an array of objects -containing the deleted node and the node that needs to be balanced.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrId: number | N
      -

      The nodeOrId parameter can be either a node object (N) or a binary tree -node ID (BinaryTreeNodeId).

      -
      -
    -

    Returns BinaryTreeDeletedResult<N>[]

    The function remove returns an array of BinaryTreeDeletedResult<N> objects.

    - -
-
-

subTreeAdd

-
    - -
  • -

    The function subTreeAdd adds a delta value to a specified property of each node in a subtree.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: null | number | N
      -

      The subTreeRoot parameter represents the root node of a binary -tree or the ID of a node in the binary tree. It can also be null if there is no subtree to add to.

      -
      -
      • -
    • -
      delta: number
      -

      The delta parameter is a number that represents the amount by which the property value of -each node in the subtree should be incremented.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property of the binary tree node that should be modified. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

subTreeSum

-
    - -
  • -

    The function subTreeSum calculates the sum of a specified property in a binary tree or subtree.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: null | number | N
      -

      The subTreeRoot parameter represents the root node of a binary -tree or the ID of a binary tree node. It can also be null if there is no subtree.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      propertyName is an optional parameter that specifies the -property of the binary tree node to use for calculating the sum. It can be either 'id' or 'val'. If propertyName is -not provided, it defaults to 'id'.

      -
      -
    -

    Returns number

    a number, which is the sum of the values of the specified property in the subtree rooted at subTreeRoot.

    - -
-
-

swapLocation

-
    - -
  • -

    The swapLocation function swaps the location of two nodes in a binary tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcNode: N
      -

      The source node that you want to swap with the destination node.

      -
      -
      • -
    • -
      destNode: N
      -

      The destNode parameter represents the destination node where the values from srcNode will -be swapped to.

      -
      -
    -

    Returns N

    The destNode is being returned.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/BinaryTreeNode.html b/docs/classes/BinaryTreeNode.html deleted file mode 100644 index f188686..0000000 --- a/docs/classes/BinaryTreeNode.html +++ /dev/null @@ -1,403 +0,0 @@ -BinaryTreeNode | data-structure-typed
-
- -
-
-
-
- -

Class BinaryTreeNode<V, NEIGHBOR>

-
-

Type Parameters

-
-
-

Hierarchy

-
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Accessors

-
familyPosition -height -id -left -parent -right -val -
-
-

Constructors

-
-

constructor

-
-
-

Accessors

-
-

familyPosition

-
-
-

height

-
-
-

id

-
-
-

left

-
-
-

parent

-
-
-

right

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/Character.html b/docs/classes/Character.html deleted file mode 100644 index df43057..0000000 --- a/docs/classes/Character.html +++ /dev/null @@ -1,254 +0,0 @@ -Character | data-structure-typed
-
- -
-
-
-
- -

Class Character

-
-

Hierarchy

-
    -
  • Character
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
direction -turn -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor function takes in a direction and turning object and sets the direction and turn properties of the -Character class.

    -
    -
    -

    Parameters

    -
      -
    • -
      direction: Direction
      -

      The direction parameter is used to specify the current direction of the character. It -can be any value that represents a direction, such as "north", "south", "east", or "west".

      -
      -
      • -
    • -
      turning: Turning
      -

      The turning parameter is an object that maps each direction to the corresponding -turning direction. It is used to determine the new direction when the character turns.

      -
      -
    -

    Returns Character

    -
-
-

Properties

-
-

direction

-
direction: Direction
-
-

turn

-
turn: (() => Character)
-
-

Type declaration

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/CoordinateMap.html b/docs/classes/CoordinateMap.html deleted file mode 100644 index 5f1aa23..0000000 --- a/docs/classes/CoordinateMap.html +++ /dev/null @@ -1,517 +0,0 @@ -CoordinateMap | data-structure-typed
-
- -
-
-
-
- -

Class CoordinateMap<V>

-
-

data-structure-typed

-
-
-

Author

Tyler Zeng

- -

Copyright

Copyright (c) 2022 Tyler Zeng zrwusa@gmail.com

- -

License

MIT License

-
-
-

Type Parameters

-
    -
  • -

    V

-
-

Hierarchy

-
    -
  • Map<any, V> -
      -
    • CoordinateMap
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
[toStringTag] -_joint -size -[species] -
-
-

Accessors

-
joint -
-
-

Methods

-
[iterator] -_setJoint -clear -delete -entries -forEach -get -has -keys -set -values -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Readonly [toStringTag]

-
[toStringTag]: string
-
-

Protected _joint

-
_joint: string = '_'
-
-

Readonly size

-
size: number
-
-

Returns

the number of elements in the Map.

-
-
-

Static Readonly [species]

-
[species]: MapConstructor
-
-

Accessors

-
-

joint

-
-
-

Methods

-
-

[iterator]

-
    -
  • [iterator](): IterableIterator<[any, V]>
    • -
  • -

    Returns an iterable of entries in the map.

    -
    -

    Returns IterableIterator<[any, V]>

    -
-
-

Protected _setJoint

-
-
-

clear

-
    - -
  • -

    Returns void

-
-

delete

-
    - -
  • -

    The function overrides the delete method and joins the key array using a specified joint character before calling -the super delete method.

    -
    -
    -

    Parameters

    -
      -
    • -
      key: number[]
      -

      An array of numbers that represents the key to be deleted.

      -
      -
    -

    Returns boolean

    The delete method is returning the result of calling the delete method on the superclass, with the -key array joined together using the _joint property.

    - -
-
-

entries

-
    - -
  • -

    Returns an iterable of key, value pairs for every entry in the map.

    -
    -

    Returns IterableIterator<[any, V]>

    -
-
-

forEach

-
    - -
  • -

    Executes a provided function once per each key/value pair in the Map, in insertion order.

    -
    -
    -

    Parameters

    -
      -
    • -
      callbackfn: ((value, key, map) => void)
      -
        -
      • -
          -
        • (value, key, map): void
          • -
        • -
          -

          Parameters

          -
            -
          • -
            value: V
            • -
          • -
            key: any
            • -
          • -
            map: Map<any, V>
          -

          Returns void

      • -
    • -
      Optional thisArg: any
    -

    Returns void

    -
-
-

get

-
    - -
  • -

    The function overrides the get method to join the key array with a specified joint and then calls the super get -method.

    -
    -
    -

    Parameters

    -
      -
    • -
      key: number[]
      -

      An array of numbers

      -
      -
    -

    Returns undefined | V

    The code is returning the value associated with the specified key in the map.

    - -
-
-

has

-
    - -
  • -

    The "has" function overrides the base class's "has" function and checks if a key exists in the map by joining the -key array with a specified delimiter.

    -
    -
    -

    Parameters

    -
      -
    • -
      key: number[]
      -

      The parameter "key" is an array of numbers.

      -
      -
    -

    Returns boolean

    The has method is being overridden to return the result of calling the has method of the superclass -(super.has) with the key array joined together using the _joint property.

    - -
-
-

keys

-
    - -
  • -

    Returns an iterable of keys in the map

    -
    -

    Returns IterableIterator<any>

    -
-
-

set

-
    - -
  • -

    The function overrides the set method of a Map object to convert the key from an array to a string using a specified -delimiter before calling the original set method.

    -
    -
    -

    Parameters

    -
      -
    • -
      key: number[]
      -

      The key parameter is an array of numbers.

      -
      -
      • -
    • -
      value: V
      -

      The value parameter is the value that you want to associate with the specified key.

      -
      -
    -

    Returns CoordinateMap<V>

    The set method is returning the result of calling the set method of the superclass -(super.set(key.join(this._joint), value)).

    - -
-
-

values

-
    - -
  • -

    Returns an iterable of values in the map

    -
    -

    Returns IterableIterator<V>

    -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/CoordinateSet.html b/docs/classes/CoordinateSet.html deleted file mode 100644 index 28829b6..0000000 --- a/docs/classes/CoordinateSet.html +++ /dev/null @@ -1,478 +0,0 @@ -CoordinateSet | data-structure-typed
-
- -
-
-
-
- -

Class CoordinateSet

-
-

data-structure-typed

-
-
-

Author

Tyler Zeng

- -

Copyright

Copyright (c) 2022 Tyler Zeng zrwusa@gmail.com

- -

License

MIT License

-
-
-

Hierarchy

-
    -
  • Set<any> -
      -
    • CoordinateSet
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
[toStringTag] -_joint -size -[species] -
-
-

Accessors

-
joint -
-
-

Methods

-
[iterator] -_setJoint -add -clear -delete -entries -forEach -has -keys -values -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Readonly [toStringTag]

-
[toStringTag]: string
-
-

Protected _joint

-
_joint: string = '_'
-
-

Readonly size

-
size: number
-
-

Returns

the number of (unique) elements in Set.

-
-
-

Static Readonly [species]

-
[species]: SetConstructor
-
-

Accessors

-
-

joint

-
-
-

Methods

-
-

[iterator]

-
    -
  • [iterator](): IterableIterator<any>
    • -
  • -

    Iterates over values in the set.

    -
    -

    Returns IterableIterator<any>

    -
-
-

Protected _setJoint

-
-
-

add

-
    - -
  • -

    The "add" function overrides the parent class's "add" function by joining the elements of the input array with a -specified delimiter before calling the parent class's "add" function.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: number[]
      -

      An array of numbers

      -
      -
    -

    Returns CoordinateSet

    The overridden add method is returning the result of calling the add method of the superclass -(super.add) with the joined string representation of the value array (value.join(this._joint)).

    - -
-
-

clear

-
    - -
  • -

    Returns void

-
-

delete

-
    - -
  • -

    The function overrides the delete method and deletes an element from a Set by joining the elements of the input -array with a specified joint and then calling the delete method of the parent class.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: number[]
      -

      An array of numbers

      -
      -
    -

    Returns boolean

    The delete method is returning the result of calling the delete method of the superclass, with the -value array joined together using the _joint property.

    - -
-
-

entries

-
    - -
  • -

    Returns an iterable of [v,v] pairs for every value v in the set.

    -
    -

    Returns IterableIterator<[any, any]>

    -
-
-

forEach

-
    - -
  • -

    Executes a provided function once per each value in the Set object, in insertion order.

    -
    -
    -

    Parameters

    -
      -
    • -
      callbackfn: ((value, value2, set) => void)
      -
        -
      • -
          -
        • (value, value2, set): void
          • -
        • -
          -

          Parameters

          -
            -
          • -
            value: any
            • -
          • -
            value2: any
            • -
          • -
            set: Set<any>
          -

          Returns void

      • -
    • -
      Optional thisArg: any
    -

    Returns void

    -
-
-

has

-
    - -
  • -

    The "has" function overrides the "has" method of the superclass and checks if a value exists in an array after -joining its elements with a specified separator.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: number[]
      -

      The parameter "value" is an array of numbers.

      -
      -
    -

    Returns boolean

    The overridden has method is returning the result of calling the has method of the superclass, passing -in the joined value as an argument.

    - -
-
-

keys

-
    - -
  • -

    Despite its name, returns an iterable of the values in the set.

    -
    -

    Returns IterableIterator<any>

    -
-
-

values

-
    - -
  • -

    Returns an iterable of values in the set.

    -
    -

    Returns IterableIterator<any>

    -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/Deque.html b/docs/classes/Deque.html deleted file mode 100644 index fbdd855..0000000 --- a/docs/classes/Deque.html +++ /dev/null @@ -1,1142 +0,0 @@ -Deque | data-structure-typed
-
- -
-
-
-
- -

Class Deque<E>

-
-

Type Parameters

-
    -
  • -

    E = any

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Accessors

-
head -length -size -tail -
-
-

Methods

-
addFirst -addLast -clear -delete -deleteAt -filter -find -findLast -findNode -forEach -getAt -getNodeAt -indexOf -insertAfter -insertAt -insertBefore -isEmpty -map -peekFirst -peekLast -pollFirst -pollLast -pop -push -reduce -reverse -shift -toArray -toArrayReverse -unshift -fromArray -
-
-

Constructors

-
-

constructor

-
-
-

Accessors

-
-

head

-
-
-

length

-
-
-

size

-
-
-

tail

-
-
-

Methods

-
-

addFirst

-
    - -
  • -

    The addFirst function adds a new node with the given value to the beginning of a doubly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      val: E
      -

      The val parameter represents the value of the new node that will be added to the beginning of the -doubly linked list.

      -
      -
    -

    Returns void

    -
-
-

addLast

-
-
-

clear

-
-
-

delete

-
    - -
  • -

    The delete function removes a node from a doubly linked list based on either the node itself or its value.

    -
    -
    -

    Parameters

    -
      -
    • -
      valOrNode: E
      -

      The valOrNode parameter can accept either a value of type E or -a DoublyLinkedListNode<E> object.

      -
      -
    -

    Returns boolean

    The delete method returns a boolean value. It returns true if the value or node was successfully -deleted from the doubly linked list, and false if the value or node was not found in the list.

    - -
    • - -
  • -

    The delete function removes a node from a doubly linked list based on either the node itself or its value.

    -
    -
    -

    Parameters

    -
      -
    • -
      valOrNode: DoublyLinkedListNode<E>
      -

      The valOrNode parameter can accept either a value of type E or -a DoublyLinkedListNode<E> object.

      -
      -
    -

    Returns boolean

    The delete method returns a boolean value. It returns true if the value or node was successfully -deleted from the doubly linked list, and false if the value or node was not found in the list.

    - -
-
-

deleteAt

-
    - -
  • -

    The deleteAt function removes an element at a specified index from a linked list and returns the removed element.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter represents the position of the element that needs to be deleted in the -data structure. It is of type number.

      -
      -
    -

    Returns undefined | E

    The method deleteAt returns the value of the node that was deleted, or null if the index is out of -bounds.

    - -
-
-

filter

-
    - -
  • -

    The filter function iterates through a DoublyLinkedList and returns a new DoublyLinkedList containing only the -elements that satisfy the given callback function.

    -
    -
    -

    Parameters

    -
      -
    • -
      callback: ((val) => boolean)
      -

      The callback parameter is a function that takes a value of type E and returns a boolean value. -It is used to determine whether a value should be included in the filtered list or not.

      -
      -
      -
        -
      • -
          -
        • (val): boolean
          • -
        • -
          -

          Parameters

          -
            -
          • -
            val: E
          -

          Returns boolean

    -

    Returns DoublyLinkedList<E>

    The filtered list, which is an instance of the DoublyLinkedList class.

    - -
-
-

find

-
    - -
  • -

    The find function iterates through a linked list and returns the first element that satisfies a given condition.

    -
    -
    -

    Parameters

    -
      -
    • -
      callback: ((val) => boolean)
      -

      A function that takes a value of type E as its parameter and returns a boolean value. This -function is used to determine whether a particular value in the linked list satisfies a certain condition.

      -
      -
      -
        -
      • -
          -
        • (val): boolean
          • -
        • -
          -

          Parameters

          -
            -
          • -
            val: E
          -

          Returns boolean

    -

    Returns null | E

    The method find returns the first element in the linked list that satisfies the condition specified by -the callback function. If no element satisfies the condition, it returns null.

    - -
-
-

findLast

-
    - -
  • -

    The findLast function iterates through a linked list from the last node to the first node and returns the last -value that satisfies the given callback function, or null if no value satisfies the callback.

    -
    -
    -

    Parameters

    -
      -
    • -
      callback: ((val) => boolean)
      -

      A function that takes a value of type E as its parameter and returns a boolean value. This -function is used to determine whether a given value satisfies a certain condition.

      -
      -
      -
        -
      • -
          -
        • (val): boolean
          • -
        • -
          -

          Parameters

          -
            -
          • -
            val: E
          -

          Returns boolean

    -

    Returns null | E

    The method findLast returns the last value in the linked list that satisfies the condition specified by -the callback function. If no value satisfies the condition, it returns null.

    - -
-
-

findNode

-
    - -
  • -

    The function findNodeByValue searches for a node with a specific value in a doubly linked list and returns the -node if found, otherwise it returns null.

    -
    -
    -

    Parameters

    -
      -
    • -
      val: E
      -

      The val parameter is the value that we want to search for in the doubly linked list.

      -
      -
    -

    Returns null | DoublyLinkedListNode<E>

    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.

    - -
-
-

forEach

-
    - -
  • -

    The forEach function iterates over each element in a linked list and applies a callback function to each element.

    -
    -
    -

    Parameters

    -
      -
    • -
      callback: ((val, index) => void)
      -

      The callback parameter is a function that takes two arguments: val and index. The val argument -represents the value of the current node in the linked list, and the index argument represents the index of the -current node in the linked list.

      -
      -
      -
        -
      • -
          -
        • (val, index): void
          • -
        • -
          -

          Parameters

          -
            -
          • -
            val: E
            • -
          • -
            index: number
          -

          Returns void

    -

    Returns void

    -
-
-

getAt

-
    - -
  • -

    The getAt function returns the value at a specified index in a linked list, or null if the index is out of bounds.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter is a number that represents the position of the element we want to -retrieve from the list.

      -
      -
    -

    Returns undefined | E

    The method is returning the value at the specified index in the linked list. If the index is out of bounds -or the linked list is empty, it will return null.

    - -
-
-

getNodeAt

-
    - -
  • -

    The function getNodeAt returns the node at a given index in a doubly linked list, or null if the index is out of -range.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter is a number that represents the position of the node we want to -retrieve from the doubly linked list. It indicates the zero-based index of the node we want to access.

      -
      -
    -

    Returns null | DoublyLinkedListNode<E>

    The method getNodeAt(index: number) returns a DoublyLinkedListNode<E> object if the index is within the -valid range of the linked list, otherwise it returns null.

    - -
-
-

indexOf

-
    - -
  • -

    The function returns the index of the first occurrence of a given value in a linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      val: E
      -

      The parameter val is of type E, which means it can be any data type. It represents the value -that we are searching for in the linked list.

      -
      -
    -

    Returns number

    The method indexOf returns the index of the first occurrence of the specified value val in the linked -list. If the value is not found, it returns -1.

    - -
-
-

insertAfter

-
    - -
  • -

    The insertAfter function inserts a new node with a given value after an existing node in a doubly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValueOrNode: E
      -

      The existing value or node in the doubly linked list -after which the new value will be inserted. It can be either the value of the existing node or the existing node -itself.

      -
      -
      • -
    • -
      newValue: E
      -

      The value that you want to insert into the doubly linked list.

      -
      -
    -

    Returns boolean

    The method returns a boolean value. It returns true if the insertion is successful, and false if the -existing value or node is not found in the doubly linked list.

    - -
    • - -
  • -

    The insertAfter function inserts a new node with a given value after an existing node in a doubly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValueOrNode: DoublyLinkedListNode<E>
      -

      The existing value or node in the doubly linked list -after which the new value will be inserted. It can be either the value of the existing node or the existing node -itself.

      -
      -
      • -
    • -
      newValue: E
      -

      The value that you want to insert into the doubly linked list.

      -
      -
    -

    Returns boolean

    The method returns a boolean value. It returns true if the insertion is successful, and false if the -existing value or node is not found in the doubly linked list.

    - -
-
-

insertAt

-
    - -
  • -

    The insert function inserts a value at a specified index in a doubly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter represents the position at which the new value should be inserted in the -DoublyLinkedList. It is of type number.

      -
      -
      • -
    • -
      val: E
      -

      The val parameter represents the value that you want to insert into the Doubly Linked List at the -specified index.

      -
      -
    -

    Returns boolean

    The insert method returns a boolean value. It returns true if the insertion is successful, and false -if the index is out of bounds.

    - -
-
-

insertBefore

-
    - -
  • -

    The insertBefore function inserts a new value before an existing value or node in a doubly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValueOrNode: E
      -

      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.

      -
      -
      • -
    • -
      newValue: E
      -

      The newValue parameter represents the value that you want to insert into the doubly linked -list.

      -
      -
    -

    Returns boolean

    The method returns a boolean value. It returns true if the insertion is successful, and false if the -insertion fails.

    - -
    • - -
  • -

    The insertBefore function inserts a new value before an existing value or node in a doubly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValueOrNode: DoublyLinkedListNode<E>
      -

      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.

      -
      -
      • -
    • -
      newValue: E
      -

      The newValue parameter represents the value that you want to insert into the doubly linked -list.

      -
      -
    -

    Returns boolean

    The method returns a boolean value. It returns true if the insertion is successful, and false if the -insertion fails.

    - -
-
-

isEmpty

-
-
-

map

-
    - -
  • -

    The map function takes a callback function and applies it to each element in the DoublyLinkedList, returning a new -DoublyLinkedList with the transformed values.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      U

    -
    -

    Parameters

    -
      -
    • -
      callback: ((val) => U)
      -

      The callback parameter is a function that takes a value of type E (the type of values stored in -the original DoublyLinkedList) and returns a value of type U (the type of values that will be stored in the mapped -DoublyLinkedList).

      -
      -
      -
        -
      • -
          -
        • (val): U
          • -
        • -
          -

          Parameters

          -
            -
          • -
            val: E
          -

          Returns U

    -

    Returns DoublyLinkedList<U>

    The map function is returning a new instance of DoublyLinkedList<U> that contains the mapped values.

    - -
-
-

peekFirst

-
-
-

peekLast

-
-
-

pollFirst

-
-
-

pollLast

-
    - -
  • -

    The pollLast() function removes and returns the value of the last node in a doubly linked list.

    -
    -

    Returns undefined | E

    The method is returning the value of the removed node (removedNode.val) if the list is not empty. If the -list is empty, it returns null.

    - -
-
-

pop

-
    - -
  • -

    The pop() function removes and returns the value of the last node in a doubly linked list.

    -
    -

    Returns undefined | E

    The method is returning the value of the removed node (removedNode.val) if the list is not empty. If the -list is empty, it returns null.

    - -
-
-

push

-
-
-

reduce

-
    - -
  • -

    The reduce function iterates over a linked list and applies a callback function to each element, accumulating a -single value.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      U

    -
    -

    Parameters

    -
      -
    • -
      callback: ((accumulator, val) => U)
      -

      The callback parameter is a function that takes two arguments: accumulator and val. It is -used to perform a specific operation on each element of the linked list.

      -
      -
      -
        -
      • -
          -
        • (accumulator, val): U
          • -
        • -
          -

          Parameters

          -
            -
          • -
            accumulator: U
            • -
          • -
            val: E
          -

          Returns U

      • -
    • -
      initialValue: U
      -

      The initialValue parameter is the initial value of the accumulator. It is the starting -point for the reduction operation.

      -
      -
    -

    Returns U

    The reduce method is returning the final value of the accumulator after iterating through all the -elements in the linked list.

    - -
-
-

reverse

-
-
-

shift

-
-
-

toArray

-
-
-

toArrayReverse

-
-
-

unshift

-
    - -
  • -

    The unshift function adds a new node with the given value to the beginning of a doubly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      val: E
      -

      The val parameter represents the value of the new node that will be added to the beginning of the -doubly linked list.

      -
      -
    -

    Returns void

    -
-
-

Static fromArray

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/DirectedEdge.html b/docs/classes/DirectedEdge.html deleted file mode 100644 index ff9f44e..0000000 --- a/docs/classes/DirectedEdge.html +++ /dev/null @@ -1,408 +0,0 @@ -DirectedEdge | data-structure-typed
-
- -
-
-
-
- -

Class DirectedEdge<V>

-
-

Type Parameters

-
    -
  • -

    V = any

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_dest -_hashCode -_src -
-
-

Accessors

-
dest -hashCode -src -val -weight -
-
-

Methods

-
_setHashCode -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor function initializes the source and destination vertices of an edge, along with an optional weight -and value.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      V = any

    -
    -

    Parameters

    -
      -
    • -
      src: VertexId
      -

      The src parameter is the source vertex ID. It represents the starting point of an edge in -a graph.

      -
      -
      • -
    • -
      dest: VertexId
      -

      The dest parameter represents the destination vertex of an edge. It is of type -VertexId, which is likely a unique identifier for a vertex in a graph.

      -
      -
      • -
    • -
      Optional weight: number
      -

      The weight parameter is an optional number that represents the weight of the edge.

      -
      -
      • -
    • -
      Optional val: V
      -

      The val parameter is an optional parameter of type V. It represents the value associated with -the edge.

      -
      -
    -

    Returns DirectedEdge<V>

    -
-
-

Properties

-
-

Private _dest

-
_dest: VertexId
-
-

Protected _hashCode

-
_hashCode: string
-
-

Private _src

-
_src: VertexId
-
-

Accessors

-
-

dest

-
-
-

hashCode

-
-
-

src

-
-
-

val

-
-
-

weight

-
-
-

Methods

-
-

Protected _setHashCode

-
    -
  • _setHashCode(v): void
    • -
  • -

    The function sets the value of the _hashCode property to the provided string.

    -
    -
    -

    Parameters

    -
      -
    • -
      v: string
      -

      The parameter "v" is of type string and represents the value that will be assigned to the -"_hashCode" property.

      -
      -
    -

    Returns void

    -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/DirectedGraph.html b/docs/classes/DirectedGraph.html deleted file mode 100644 index 04b6f2c..0000000 --- a/docs/classes/DirectedGraph.html +++ /dev/null @@ -1,1534 +0,0 @@ -DirectedGraph | data-structure-typed
-
- -
-
-
-
- -

Class DirectedGraph<V, E>

-
-

Type Parameters

-
-
-

Hierarchy

-
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_inEdgeMap -_outEdgeMap -
-
-

Accessors

-
inEdgeMap -outEdgeMap -vertices -
-
-

Methods

-
_addEdgeOnly -_addVertexOnly -_getVertex -_getVertexId -_setInEdgeMap -_setOutEdgeMap -_setVertices -addEdge -addVertex -bellmanFord -createEdge -createVertex -degreeOf -dijkstra -dijkstraWithoutHeap -edgeSet -edgesOf -floyd -getAllPathsBetween -getDestinations -getEdge -getEdgeDest -getEdgeSrc -getEndsOfEdge -getMinCostBetween -getMinPathBetween -getNeighbors -getPathSumWeight -getVertex -hasEdge -hasVertex -inDegreeOf -incomingEdgesOf -outDegreeOf -outgoingEdgesOf -removeAllVertices -removeEdge -removeEdgeSrcToDest -removeEdgesBetween -removeVertex -setEdgeWeight -tarjan -topologicalSort -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Private _inEdgeMap

-
_inEdgeMap: Map<V, E[]> = ...
-
-

Private _outEdgeMap

-
_outEdgeMap: Map<V, E[]> = ...
-
-

Accessors

-
-

inEdgeMap

-
-
-

outEdgeMap

-
-
-

vertices

-
-
-

Methods

-
-

Protected _addEdgeOnly

-
    -
  • _addEdgeOnly(edge): boolean
    • -
  • -

    The function _addEdgeOnly adds an edge to a graph if the source and destination vertices exist.

    -
    -
    -

    Parameters

    -
      -
    • -
      edge: E
      -

      The parameter edge is of type E, which represents an edge in a graph. It is the edge that -needs to be added to the graph.

      -
      -
    -

    Returns boolean

    a boolean value. It returns true if the edge was successfully added to the graph, and false if either the -source or destination vertex does not exist in the graph.

    - -
-
-

Protected _addVertexOnly

-
-
-

Protected _getVertex

-
-
-

Protected _getVertexId

-
-
-

Protected _setInEdgeMap

-
-
-

Protected _setOutEdgeMap

-
-
-

Protected _setVertices

-
-
-

addEdge

-
-
-

addVertex

-
-
-

bellmanFord

-
    - -
  • -

    BellmanFord time:O(VE) space:O(V) -one to rest pairs -/

    -

    /** -BellmanFord time:O(VE) space:O(V) -one to rest pairs -The Bellman-Ford algorithm is also used to find the shortest paths from a source node to all other nodes in a graph. Unlike Dijkstra's algorithm, it can handle edge weights that are negative. Its basic idea involves iterative relaxation of all edges for several rounds to gradually approximate the shortest paths. Due to its ability to handle negative-weight edges, the Bellman-Ford algorithm is more flexible in some scenarios. -The bellmanFord function implements the Bellman-Ford algorithm to find the shortest path from a source vertex to -all other vertices in a graph, and optionally detects negative cycles and generates the minimum path.

    -
    -
    -

    Parameters

    -
      -
    • -
      src: VertexId | V
      -

      The src parameter is the source vertex from which the Bellman-Ford algorithm will -start calculating the shortest paths. It can be either a vertex object or a vertex ID.

      -
      -
      • -
    • -
      Optional scanNegativeCycle: boolean
      -

      A boolean flag indicating whether to scan for negative cycles in the graph.

      -
      -
      • -
    • -
      Optional getMin: boolean
      -

      The getMin parameter is a boolean flag that determines whether the algorithm should -calculate the minimum distance from the source vertex to all other vertices in the graph. If getMin is set to -true, the algorithm will find the minimum distance and update the min variable with the minimum

      -
      -
      • -
    • -
      Optional genPath: boolean
      -

      A boolean flag indicating whether to generate paths for all vertices from the source -vertex.

      -
      -
    -

    Returns {
        distMap: Map<V, number>;
        hasNegativeCycle: undefined | boolean;
        min: number;
        minPath: V[];
        paths: V[][];
        preMap: Map<V, V>;
    }

    The function bellmanFord returns an object with the following properties:

    - -
      -
    • -
      distMap: Map<V, number>
      • -
    • -
      hasNegativeCycle: undefined | boolean
      • -
    • -
      min: number
      • -
    • -
      minPath: V[]
      • -
    • -
      paths: V[][]
      • -
    • -
      preMap: Map<V, V>
    -
-
-

createEdge

-
    - -
  • -

    The function creates a directed edge between two vertices with an optional weight and value.

    -
    -
    -

    Parameters

    -
      -
    • -
      src: VertexId
      -

      The source vertex ID of the edge. It represents the starting point of the edge.

      -
      -
      • -
    • -
      dest: VertexId
      -

      The dest parameter is the identifier of the destination vertex for the edge.

      -
      -
      • -
    • -
      Optional weight: number
      -

      The weight parameter is an optional number that represents the weight of the edge. If no -weight is provided, it defaults to 1.

      -
      -
      • -
    • -
      Optional val: E["val"]
      -

      The 'val' parameter is an optional value that can be assigned to the edge. It can be of any type and -is used to store additional information or data associated with the edge.

      -
      -
    -

    Returns E

    a new instance of a DirectedEdge object, casted as type E.

    - -
-
-

createVertex

-
    - -
  • -

    The function creates a new vertex with an optional value and returns it.

    -
    -
    -

    Parameters

    -
      -
    • -
      id: VertexId
      -

      The id parameter is the unique identifier for the vertex. It is of type VertexId, which -could be a number or a string depending on how you want to identify your vertices.

      -
      -
      • -
    • -
      Optional val: V["val"]
      -

      The 'val' parameter is an optional value that can be assigned to the vertex. If a value is provided, -it will be assigned to the 'val' property of the vertex. If no value is provided, the 'val' property will be -assigned the same value as the 'id' parameter

      -
      -
    -

    Returns V

    a new instance of a DirectedVertex object, casted as type V.

    - -
-
-

degreeOf

-
    - -
  • -

    The function "degreeOf" returns the total degree of a vertex, which is the sum of its out-degree and in-degree.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can be either a VertexId or a V.

      -
      -
    -

    Returns number

    The sum of the out-degree and in-degree of the specified vertex or vertex ID.

    - -
-
-

dijkstra

-
    - -
  • -

    Dijkstra algorithm time: O(logVE) space: O(V + E)

    -

    Dijkstra's algorithm only solves the single-source shortest path problem, while the Bellman-Ford algorithm and Floyd-Warshall algorithm can address shortest paths between all pairs of nodes. -Dijkstra's algorithm is suitable for graphs with non-negative edge weights, whereas the Bellman-Ford algorithm and Floyd-Warshall algorithm can handle negative-weight edges. -The time complexity of Dijkstra's algorithm and the Bellman-Ford algorithm depends on the size of the graph, while the time complexity of the Floyd-Warshall algorithm is O(V^3), where V is the number of nodes. For dense graphs, Floyd-Warshall might become slower.

    -

    /

    -

    /** -Dijkstra's algorithm is used to find the shortest paths from a source node to all other nodes in a graph. Its basic idea is to repeatedly choose the node closest to the source node and update the distances of other nodes using this node as an intermediary. Dijkstra's algorithm requires that the edge weights in the graph are non-negative. -The dijkstra function implements Dijkstra's algorithm to find the shortest path between a source vertex and an -optional destination vertex, and optionally returns the minimum distance, the paths, and other information.

    -
    -
    -

    Parameters

    -
      -
    • -
      src: VertexId | V
      -

      The src parameter represents the source vertex from which the Dijkstra algorithm will -start. It can be either a vertex object or a vertex ID.

      -
      -
      • -
    • -
      Optional dest: null | VertexId | V
      -

      The dest parameter is the destination vertex or vertex ID. It specifies the -vertex to which the shortest path is calculated from the source vertex. If no destination is provided, the algorithm -will calculate the shortest paths to all other vertices from the source vertex.

      -
      -
      • -
    • -
      Optional getMinDist: boolean
      -

      The getMinDist parameter is a boolean flag that determines whether the minimum -distance from the source vertex to the destination vertex should be calculated and returned in the result. If -getMinDist is set to true, the minDist property in the result will contain the minimum distance

      -
      -
      • -
    • -
      Optional genPaths: boolean
      -

      The genPaths parameter is a boolean flag that determines whether or not to generate -paths in the Dijkstra algorithm. If genPaths is set to true, the algorithm will calculate and return the -shortest paths from the source vertex to all other vertices in the graph. If genPaths @returns The function dijkstrareturns an object of typeDijkstraResult`.

      -
      -
    -

    Returns DijkstraResult<V>

    -
-
-

dijkstraWithoutHeap

-
    - -
  • -

    Dijkstra algorithm time: O(VE) space: O(V + E) -/

    -

    /** -Dijkstra algorithm time: O(VE) space: O(V + E) -The function dijkstraWithoutHeap implements Dijkstra's algorithm to find the shortest path between two vertices in -a graph without using a heap data structure.

    -
    -
    -

    Parameters

    -
      -
    • -
      src: VertexId | V
      -

      The source vertex from which to start the Dijkstra's algorithm. It can be either a -vertex object or a vertex ID.

      -
      -
      • -
    • -
      Optional dest: null | VertexId | V
      -

      The dest parameter in the dijkstraWithoutHeap function is an optional -parameter that specifies the destination vertex for the Dijkstra algorithm. It can be either a vertex object or its -identifier. If no destination is provided, the value is set to null.

      -
      -
      • -
    • -
      Optional getMinDist: boolean
      -

      The getMinDist parameter is a boolean flag that determines whether the minimum -distance from the source vertex to the destination vertex should be calculated and returned in the result. If -getMinDist is set to true, the minDist property in the result will contain the minimum distance

      -
      -
      • -
    • -
      Optional genPaths: boolean
      -

      The genPaths parameter is a boolean flag that determines whether or not to generate -paths in the Dijkstra algorithm. If genPaths is set to true, the algorithm will calculate and return the -shortest paths from the source vertex to all other vertices in the graph. If genPaths @returns The function dijkstraWithoutHeapreturns an object of typeDijkstraResult`.

      -
      -
    -

    Returns DijkstraResult<V>

    -
-
-

edgeSet

-
-
-

edgesOf

-
-
-

floyd

-
    - -
  • -

    Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle -all pairs -/

    -

    /** -Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle -all pairs -The Floyd-Warshall algorithm is used to find the shortest paths between all pairs of nodes in a graph. It employs dynamic programming to compute the shortest paths from any node to any other node. The Floyd-Warshall algorithm's advantage lies in its ability to handle graphs with negative-weight edges, and it can simultaneously compute shortest paths between any two nodes. -The function implements the Floyd-Warshall algorithm to find the shortest path between all pairs of vertices in a -graph.

    -
    -

    Returns {
        costs: number[][];
        predecessor: (null | V)[][];
    }

    The function floyd() returns an object with two properties: costs and predecessor. The costs -property is a 2D array of numbers representing the shortest path costs between vertices in a graph. The -predecessor property is a 2D array of vertices (or null) representing the predecessor vertices in the shortest -path between vertices in the

    - -
      -
    • -
      costs: number[][]
      • -
    • -
      predecessor: (null | V)[][]
    -
-
-

getAllPathsBetween

-
    - -
  • -

    The function getAllPathsBetween finds all paths between two vertices in a graph using depth-first search.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 represents either a vertex object (V) or a vertex ID (VertexId). -It is the starting vertex for finding paths.

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      The parameter v2 represents either a vertex object (V) or a vertex ID (VertexId).

      -
      -
    -

    Returns V[][]

    The function getAllPathsBetween returns an array of arrays of vertices (V[][]).

    - -
-
-

getDestinations

-
    - -
  • -

    The function getDestinations returns an array of destination vertices connected to a given vertex.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertex: null | VertexId | V
      -

      The vertex parameter represents the starting vertex from which we want to -find the destinations. It can be either a V object, a VertexId value, or null.

      -
      -
    -

    Returns V[]

    an array of vertices (V[]).

    - -
-
-

getEdge

-
    - -
  • -

    The getEdge function retrieves an edge between two vertices based on their source and destination IDs.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcOrId: null | VertexId | V
      -

      The source vertex or its ID. It can be either a vertex object or a vertex ID.

      -
      -
      • -
    • -
      destOrId: null | VertexId | V
      -

      The destOrId parameter in the getEdge function represents the -destination vertex of the edge. It can be either a vertex object (V), a vertex ID (VertexId), or null if the -destination is not specified.

      -
      -
    -

    Returns null | E

    the first edge found between the source and destination vertices, or null if no such edge is found.

    - -
-
-

getEdgeDest

-
    - -
  • -

    The function "getEdgeDest" returns the destination vertex of an edge.

    -
    -
    -

    Parameters

    -
      -
    • -
      e: E
      -

      The parameter "e" is of type "E", which represents an edge in a graph.

      -
      -
    -

    Returns null | V

    either a vertex object of type V or null.

    - -
-
-

getEdgeSrc

-
    - -
  • -

    The function "getEdgeSrc" returns the source vertex of an edge, or null if the edge does not exist.

    -
    -
    -

    Parameters

    -
      -
    • -
      e: E
      -

      The parameter "e" is of type E, which represents an edge in a graph.

      -
      -
    -

    Returns null | V

    either a vertex object (V) or null.

    - -
-
-

getEndsOfEdge

-
    - -
  • -

    The function "getEndsOfEdge" returns the source and destination vertices of an edge if it exists in the graph, -otherwise it returns null.

    -
    -
    -

    Parameters

    -
      -
    • -
      edge: E
      -

      The parameter edge is of type E, which represents an edge in a graph.

      -
      -
    -

    Returns null | [V, V]

    The function getEndsOfEdge returns an array containing two vertices [V, V] if the edge exists in the -graph. If the edge does not exist, it returns null.

    - -
-
-

getMinCostBetween

-
    - -
  • -

    The function getMinCostBetween calculates the minimum cost between two vertices in a graph, either based on edge -weights or using a breadth-first search algorithm.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 represents the starting vertex or its ID.

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      The parameter v2 represents the destination vertex or its ID. It is the vertex to which -you want to find the minimum cost or weight from the source vertex v1.

      -
      -
      • -
    • -
      Optional isWeight: boolean
      -

      isWeight is an optional parameter that indicates whether the graph edges have weights. -If isWeight is set to true, the function will calculate the minimum cost between v1 and v2 based on the weights of -the edges. If isWeight is set to false or not provided, the function will calculate the

      -
      -
    -

    Returns null | number

    The function getMinCostBetween returns a number representing the minimum cost between two vertices (v1 -and v2). If the isWeight parameter is true, it calculates the minimum weight among all paths between the -vertices. If isWeight is false or not provided, it uses a breadth-first search (BFS) algorithm to calculate the -minimum number of

    - -
-
-

getMinPathBetween

-
    - -
  • -

    The function getMinPathBetween returns the minimum path between two vertices in a graph, either based on weight or -using a breadth-first search algorithm.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 represents the starting vertex of the path. It can be either a vertex -object (V) or a vertex ID (VertexId).

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      V | VertexId - The second vertex or vertex ID between which we want to find the minimum -path.

      -
      -
      • -
    • -
      Optional isWeight: boolean
      -

      A boolean flag indicating whether to consider the weight of edges in finding the -minimum path. If set to true, the function will use Dijkstra's algorithm to find the minimum weighted path. If set -to false, the function will use breadth-first search (BFS) to find the minimum path.

      -
      -
    -

    Returns null | V[]

    The function getMinPathBetween returns an array of vertices (V[]) representing the minimum path between -two vertices (v1 and v2). If there is no path between the vertices, it returns null.

    - -
-
-

getNeighbors

-
-
-

getPathSumWeight

-
    - -
  • -

    The function calculates the sum of weights along a given path.

    -
    -
    -

    Parameters

    -
      -
    • -
      path: V[]
      -

      An array of vertices (V) representing a path in a graph.

      -
      -
    -

    Returns number

    The function getPathSumWeight returns the sum of the weights of the edges in the given path.

    - -
-
-

getVertex

-
    - -
  • -

    The function "getVertex" returns the vertex with the specified ID or null if it doesn't exist.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexId: VertexId
      -

      The vertexId parameter is the identifier of the vertex that you want to retrieve from -the _vertices map.

      -
      -
    -

    Returns null | V

    The method getVertex returns the vertex with the specified vertexId if it exists in the _vertices -map. If the vertex does not exist, it returns null.

    - -
-
-

hasEdge

-
    - -
  • -

    The function checks if there is an edge between two vertices and returns a boolean value indicating the result.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 can be either a VertexId or a V. A VertexId represents the unique -identifier of a vertex in a graph, while V represents the type of the vertex object itself.

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      The parameter v2 represents the second vertex in the edge. It can be either a -VertexId or a V type, which represents the type of the vertex.

      -
      -
    -

    Returns boolean

    A boolean value is being returned.

    - -
-
-

hasVertex

-
-
-

inDegreeOf

-
    - -
  • -

    The function "inDegreeOf" returns the number of incoming edges for a given vertex.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can be either a VertexId or a V.

      -
      -
    -

    Returns number

    The number of incoming edges of the specified vertex or vertex ID.

    - -
-
-

incomingEdgesOf

-
    - -
  • -

    The function incomingEdgesOf returns an array of incoming edges for a given vertex or vertex ID.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can be either a vertex object (V) or a vertex ID -(VertexId).

      -
      -
    -

    Returns E[]

    The method incomingEdgesOf returns an array of edges (E[]).

    - -
-
-

outDegreeOf

-
    - -
  • -

    The function outDegreeOf returns the number of outgoing edges from a given vertex.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can be either a VertexId or a V.

      -
      -
    -

    Returns number

    The number of outgoing edges from the specified vertex or vertex ID.

    - -
-
-

outgoingEdgesOf

-
    - -
  • -

    The function outgoingEdgesOf returns an array of outgoing edges from a given vertex or vertex ID.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can accept either a vertex object (V) or a vertex ID -(VertexId).

      -
      -
    -

    Returns E[]

    The method outgoingEdgesOf returns an array of edges (E[]).

    - -
-
-

removeAllVertices

-
    - -
  • -

    The function removes all vertices from a graph and returns a boolean indicating if any vertices were removed.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertices: VertexId[] | V[]
      -

      The vertices parameter can be either an array of vertices (V[]) or an array -of vertex IDs (VertexId[]).

      -
      -
    -

    Returns boolean

    a boolean value. It returns true if at least one vertex was successfully removed, and false if no vertices -were removed.

    - -
-
-

removeEdge

-
    - -
  • -

    The function removes an edge from a graph and returns the removed edge, or null if the edge was not found.

    -
    -
    -

    Parameters

    -
      -
    • -
      edge: E
      -

      The edge parameter is an object that represents an edge in a graph. It has two properties: src -and dest, which represent the source and destination vertices of the edge, respectively.

      -
      -
    -

    Returns null | E

    The method removeEdge returns the removed edge (E) if it exists, or null if the edge does not exist.

    - -
-
-

removeEdgeSrcToDest

-
    - -
  • -

    The function removes an edge between two vertices in a graph and returns the removed edge.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcOrId: VertexId | V
      -

      The source vertex or its ID.

      -
      -
      • -
    • -
      destOrId: VertexId | V
      -

      The destOrId parameter represents the destination vertex or its ID.

      -
      -
    -

    Returns null | E

    the removed edge (E) if it exists, or null if either the source or destination vertex does not exist.

    - -
-
-

removeEdgesBetween

-
    - -
  • -

    The function removes edges between two vertices and returns the removed edges.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 can be either a VertexId or a V. A VertexId represents the -unique identifier of a vertex in a graph, while V represents the actual vertex object.

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      The parameter v2 represents either a VertexId or a V object. It is used to specify -the second vertex in the edge that needs to be removed.

      -
      -
    -

    Returns E[]

    an array of removed edges (E[]).

    - -
-
-

removeVertex

-
-
-

setEdgeWeight

-
    - -
  • -

    The function sets the weight of an edge between two vertices in a graph.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcOrId: VertexId | V
      -

      The srcOrId parameter can be either a VertexId or a V object. It represents -the source vertex of the edge.

      -
      -
      • -
    • -
      destOrId: VertexId | V
      -

      The destOrId parameter represents the destination vertex of the edge. It can be -either a VertexId or a vertex object V.

      -
      -
      • -
    • -
      weight: number
      -

      The weight parameter represents the weight of the edge between the source vertex (srcOrId) -and the destination vertex (destOrId).

      -
      -
    -

    Returns boolean

    a boolean value. If the edge exists between the source and destination vertices, the function will update -the weight of the edge and return true. If the edge does not exist, the function will return false.

    - -
-
-

tarjan

-
    - -
  • -

    Tarjan is an algorithm based on DFS,which is used to solve the connectivity problem of graphs. -Tarjan can find cycles in directed or undirected graph -Tarjan can find the articulation points and bridges(critical edges) of undirected graphs in linear time, -Tarjan solve the bi-connected components of undirected graphs; -Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs. -/

    -

    /** -Tarjan is an algorithm based on DFS,which is used to solve the connectivity problem of graphs. -Tarjan can find cycles in directed or undirected graph -Tarjan can find the articulation points and bridges(critical edges) of undirected graphs in linear time, -Tarjan solve the bi-connected components of undirected graphs; -Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs. -The tarjan function is used to perform various graph analysis tasks such as finding articulation points, bridges, -strongly connected components (SCCs), and cycles in a graph.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional needArticulationPoints: boolean
      -

      A boolean value indicating whether or not to calculate and return the -articulation points in the graph. Articulation points are the vertices in a graph whose removal would increase the -number of connected components in the graph.

      -
      -
      • -
    • -
      Optional needBridges: boolean
      -

      A boolean flag indicating whether the algorithm should find and return the bridges -(edges whose removal would increase the number of connected components in the graph).

      -
      -
      • -
    • -
      Optional needSCCs: boolean
      -

      A boolean value indicating whether the Strongly Connected Components (SCCs) of the -graph are needed. If set to true, the function will calculate and return the SCCs of the graph. If set to false, the -SCCs will not be calculated or returned.

      -
      -
      • -
    • -
      Optional needCycles: boolean
      -

      A boolean flag indicating whether the algorithm should find cycles in the graph. If -set to true, the algorithm will return a map of cycles, where the keys are the low values of the SCCs and the values -are arrays of vertices that form cycles within the SCCs.

      -
      -
    -

    Returns {
        SCCs: Map<number, V[]>;
        articulationPoints: V[];
        bridges: E[];
        cycles: Map<number, V[]>;
        dfnMap: Map<V, number>;
        lowMap: Map<V, number>;
    }

    The function tarjan returns an object with the following properties:

    - -
      -
    • -
      SCCs: Map<number, V[]>
      • -
    • -
      articulationPoints: V[]
      • -
    • -
      bridges: E[]
      • -
    • -
      cycles: Map<number, V[]>
      • -
    • -
      dfnMap: Map<V, number>
      • -
    • -
      lowMap: Map<V, number>
    -
-
-

topologicalSort

-
    - -
  • -

    The topologicalSort function performs a topological sort on a graph and returns an array of vertices or vertex IDs -in the sorted order, or null if the graph contains a cycle.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional propertyName: "id" | "vertex"
      -

      The propertyName parameter is an optional parameter that specifies the -property to use for sorting the vertices. It can have two possible values: 'vertex' or 'id'. If 'vertex' is -specified, the vertices themselves will be used for sorting. If 'id' is specified, the ids of

      -
      -
    -

    Returns null | (VertexId | V)[]

    an array of vertices or vertex IDs in topological order. If there is a cycle in the graph, it returns null.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/DirectedVertex.html b/docs/classes/DirectedVertex.html deleted file mode 100644 index 54da2db..0000000 --- a/docs/classes/DirectedVertex.html +++ /dev/null @@ -1,290 +0,0 @@ -DirectedVertex | data-structure-typed
-
- -
-
-
-
- -

Class DirectedVertex<V>

-
-

Type Parameters

-
    -
  • -

    V = any

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Accessors

-
id -val -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor function initializes a vertex with an optional value.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      V = any

    -
    -

    Parameters

    -
      -
    • -
      id: VertexId
      -

      The id parameter is of type VertexId and represents the identifier of the vertex. It is -used to uniquely identify the vertex within a graph or data structure.

      -
      -
      • -
    • -
      Optional val: V
      -

      The "val" parameter is an optional parameter of type V. It is used to initialize the value of the -vertex. If no value is provided, the vertex will be initialized with a default value.

      -
      -
    -

    Returns DirectedVertex<V>

    -
-
-

Accessors

-
-

id

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/DoublyLinkedList.html b/docs/classes/DoublyLinkedList.html deleted file mode 100644 index 7fb0fa4..0000000 --- a/docs/classes/DoublyLinkedList.html +++ /dev/null @@ -1,1127 +0,0 @@ -DoublyLinkedList | data-structure-typed
-
- -
-
-
-
- -

Class DoublyLinkedList<E>

-
-

Type Parameters

-
    -
  • -

    E = any

-
-

Hierarchy

-
    -
  • DoublyLinkedList -
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_head -_length -_tail -
-
-

Accessors

-
head -length -size -tail -
-
-

Methods

-
addFirst -addLast -clear -delete -deleteAt -filter -find -findLast -findNode -forEach -getAt -getNodeAt -indexOf -insertAfter -insertAt -insertBefore -isEmpty -map -peekFirst -peekLast -pollFirst -pollLast -pop -push -reduce -reverse -shift -toArray -toArrayReverse -unshift -fromArray -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Private _head

-
_head: null | DoublyLinkedListNode<E>
-
-

Private _length

-
_length: number
-
-

Private _tail

-
_tail: null | DoublyLinkedListNode<E>
-
-

Accessors

-
-

head

-
-
-

length

-
-
-

size

-
-
-

tail

-
-
-

Methods

-
-

addFirst

-
    - -
  • -

    The addFirst function adds a new node with the given value to the beginning of a doubly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      val: E
      -

      The val parameter represents the value of the new node that will be added to the beginning of the -doubly linked list.

      -
      -
    -

    Returns void

    -
-
-

addLast

-
-
-

clear

-
-
-

delete

-
    - -
  • -

    The delete function removes a node from a doubly linked list based on either the node itself or its value.

    -
    -
    -

    Parameters

    -
      -
    • -
      valOrNode: E
      -

      The valOrNode parameter can accept either a value of type E or -a DoublyLinkedListNode<E> object.

      -
      -
    -

    Returns boolean

    The delete method returns a boolean value. It returns true if the value or node was successfully -deleted from the doubly linked list, and false if the value or node was not found in the list.

    - -
    • - -
  • -

    The delete function removes a node from a doubly linked list based on either the node itself or its value.

    -
    -
    -

    Parameters

    -
      -
    • -
      valOrNode: DoublyLinkedListNode<E>
      -

      The valOrNode parameter can accept either a value of type E or -a DoublyLinkedListNode<E> object.

      -
      -
    -

    Returns boolean

    The delete method returns a boolean value. It returns true if the value or node was successfully -deleted from the doubly linked list, and false if the value or node was not found in the list.

    - -
-
-

deleteAt

-
    - -
  • -

    The deleteAt function removes an element at a specified index from a linked list and returns the removed element.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter represents the position of the element that needs to be deleted in the -data structure. It is of type number.

      -
      -
    -

    Returns undefined | E

    The method deleteAt returns the value of the node that was deleted, or null if the index is out of -bounds.

    - -
-
-

filter

-
    - -
  • -

    The filter function iterates through a DoublyLinkedList and returns a new DoublyLinkedList containing only the -elements that satisfy the given callback function.

    -
    -
    -

    Parameters

    -
      -
    • -
      callback: ((val) => boolean)
      -

      The callback parameter is a function that takes a value of type E and returns a boolean value. -It is used to determine whether a value should be included in the filtered list or not.

      -
      -
      -
        -
      • -
          -
        • (val): boolean
          • -
        • -
          -

          Parameters

          -
            -
          • -
            val: E
          -

          Returns boolean

    -

    Returns DoublyLinkedList<E>

    The filtered list, which is an instance of the DoublyLinkedList class.

    - -
-
-

find

-
    - -
  • -

    The find function iterates through a linked list and returns the first element that satisfies a given condition.

    -
    -
    -

    Parameters

    -
      -
    • -
      callback: ((val) => boolean)
      -

      A function that takes a value of type E as its parameter and returns a boolean value. This -function is used to determine whether a particular value in the linked list satisfies a certain condition.

      -
      -
      -
        -
      • -
          -
        • (val): boolean
          • -
        • -
          -

          Parameters

          -
            -
          • -
            val: E
          -

          Returns boolean

    -

    Returns null | E

    The method find returns the first element in the linked list that satisfies the condition specified by -the callback function. If no element satisfies the condition, it returns null.

    - -
-
-

findLast

-
    - -
  • -

    The findLast function iterates through a linked list from the last node to the first node and returns the last -value that satisfies the given callback function, or null if no value satisfies the callback.

    -
    -
    -

    Parameters

    -
      -
    • -
      callback: ((val) => boolean)
      -

      A function that takes a value of type E as its parameter and returns a boolean value. This -function is used to determine whether a given value satisfies a certain condition.

      -
      -
      -
        -
      • -
          -
        • (val): boolean
          • -
        • -
          -

          Parameters

          -
            -
          • -
            val: E
          -

          Returns boolean

    -

    Returns null | E

    The method findLast returns the last value in the linked list that satisfies the condition specified by -the callback function. If no value satisfies the condition, it returns null.

    - -
-
-

findNode

-
    - -
  • -

    The function findNodeByValue searches for a node with a specific value in a doubly linked list and returns the -node if found, otherwise it returns null.

    -
    -
    -

    Parameters

    -
      -
    • -
      val: E
      -

      The val parameter is the value that we want to search for in the doubly linked list.

      -
      -
    -

    Returns null | DoublyLinkedListNode<E>

    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.

    - -
-
-

forEach

-
    - -
  • -

    The forEach function iterates over each element in a linked list and applies a callback function to each element.

    -
    -
    -

    Parameters

    -
      -
    • -
      callback: ((val, index) => void)
      -

      The callback parameter is a function that takes two arguments: val and index. The val argument -represents the value of the current node in the linked list, and the index argument represents the index of the -current node in the linked list.

      -
      -
      -
        -
      • -
          -
        • (val, index): void
          • -
        • -
          -

          Parameters

          -
            -
          • -
            val: E
            • -
          • -
            index: number
          -

          Returns void

    -

    Returns void

    -
-
-

getAt

-
    - -
  • -

    The getAt function returns the value at a specified index in a linked list, or null if the index is out of bounds.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter is a number that represents the position of the element we want to -retrieve from the list.

      -
      -
    -

    Returns undefined | E

    The method is returning the value at the specified index in the linked list. If the index is out of bounds -or the linked list is empty, it will return null.

    - -
-
-

getNodeAt

-
    - -
  • -

    The function getNodeAt returns the node at a given index in a doubly linked list, or null if the index is out of -range.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter is a number that represents the position of the node we want to -retrieve from the doubly linked list. It indicates the zero-based index of the node we want to access.

      -
      -
    -

    Returns null | DoublyLinkedListNode<E>

    The method getNodeAt(index: number) returns a DoublyLinkedListNode<E> object if the index is within the -valid range of the linked list, otherwise it returns null.

    - -
-
-

indexOf

-
    - -
  • -

    The function returns the index of the first occurrence of a given value in a linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      val: E
      -

      The parameter val is of type E, which means it can be any data type. It represents the value -that we are searching for in the linked list.

      -
      -
    -

    Returns number

    The method indexOf returns the index of the first occurrence of the specified value val in the linked -list. If the value is not found, it returns -1.

    - -
-
-

insertAfter

-
    - -
  • -

    The insertAfter function inserts a new node with a given value after an existing node in a doubly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValueOrNode: E
      -

      The existing value or node in the doubly linked list -after which the new value will be inserted. It can be either the value of the existing node or the existing node -itself.

      -
      -
      • -
    • -
      newValue: E
      -

      The value that you want to insert into the doubly linked list.

      -
      -
    -

    Returns boolean

    The method returns a boolean value. It returns true if the insertion is successful, and false if the -existing value or node is not found in the doubly linked list.

    - -
    • - -
  • -

    The insertAfter function inserts a new node with a given value after an existing node in a doubly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValueOrNode: DoublyLinkedListNode<E>
      -

      The existing value or node in the doubly linked list -after which the new value will be inserted. It can be either the value of the existing node or the existing node -itself.

      -
      -
      • -
    • -
      newValue: E
      -

      The value that you want to insert into the doubly linked list.

      -
      -
    -

    Returns boolean

    The method returns a boolean value. It returns true if the insertion is successful, and false if the -existing value or node is not found in the doubly linked list.

    - -
-
-

insertAt

-
    - -
  • -

    The insert function inserts a value at a specified index in a doubly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter represents the position at which the new value should be inserted in the -DoublyLinkedList. It is of type number.

      -
      -
      • -
    • -
      val: E
      -

      The val parameter represents the value that you want to insert into the Doubly Linked List at the -specified index.

      -
      -
    -

    Returns boolean

    The insert method returns a boolean value. It returns true if the insertion is successful, and false -if the index is out of bounds.

    - -
-
-

insertBefore

-
    - -
  • -

    The insertBefore function inserts a new value before an existing value or node in a doubly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValueOrNode: E
      -

      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.

      -
      -
      • -
    • -
      newValue: E
      -

      The newValue parameter represents the value that you want to insert into the doubly linked -list.

      -
      -
    -

    Returns boolean

    The method returns a boolean value. It returns true if the insertion is successful, and false if the -insertion fails.

    - -
    • - -
  • -

    The insertBefore function inserts a new value before an existing value or node in a doubly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValueOrNode: DoublyLinkedListNode<E>
      -

      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.

      -
      -
      • -
    • -
      newValue: E
      -

      The newValue parameter represents the value that you want to insert into the doubly linked -list.

      -
      -
    -

    Returns boolean

    The method returns a boolean value. It returns true if the insertion is successful, and false if the -insertion fails.

    - -
-
-

isEmpty

-
-
-

map

-
    - -
  • -

    The map function takes a callback function and applies it to each element in the DoublyLinkedList, returning a new -DoublyLinkedList with the transformed values.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      U

    -
    -

    Parameters

    -
      -
    • -
      callback: ((val) => U)
      -

      The callback parameter is a function that takes a value of type E (the type of values stored in -the original DoublyLinkedList) and returns a value of type U (the type of values that will be stored in the mapped -DoublyLinkedList).

      -
      -
      -
        -
      • -
          -
        • (val): U
          • -
        • -
          -

          Parameters

          -
            -
          • -
            val: E
          -

          Returns U

    -

    Returns DoublyLinkedList<U>

    The map function is returning a new instance of DoublyLinkedList<U> that contains the mapped values.

    - -
-
-

peekFirst

-
    - -
  • -

    The peekFirst function returns the first node in a doubly linked list, or null if the list is empty.

    -
    -

    Returns undefined | E

    The method peekFirst() returns the first node of the doubly linked list, or null if the list is empty.

    - -
-
-

peekLast

-
    - -
  • -

    The peekLast function returns the last node in a doubly linked list, or null if the list is empty.

    -
    -

    Returns undefined | E

    The method peekLast() returns the last node of the doubly linked list, or null if the list is empty.

    - -
-
-

pollFirst

-
    - -
  • -

    The pollFirst() function removes and returns the value of the first node in a doubly linked list.

    -
    -

    Returns undefined | E

    The method shift() returns the value of the node that is removed from the beginning of the doubly linked -list.

    - -
-
-

pollLast

-
    - -
  • -

    The pollLast() function removes and returns the value of the last node in a doubly linked list.

    -
    -

    Returns undefined | E

    The method is returning the value of the removed node (removedNode.val) if the list is not empty. If the -list is empty, it returns null.

    - -
-
-

pop

-
    - -
  • -

    The pop() function removes and returns the value of the last node in a doubly linked list.

    -
    -

    Returns undefined | E

    The method is returning the value of the removed node (removedNode.val) if the list is not empty. If the -list is empty, it returns null.

    - -
-
-

push

-
-
-

reduce

-
    - -
  • -

    The reduce function iterates over a linked list and applies a callback function to each element, accumulating a -single value.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      U

    -
    -

    Parameters

    -
      -
    • -
      callback: ((accumulator, val) => U)
      -

      The callback parameter is a function that takes two arguments: accumulator and val. It is -used to perform a specific operation on each element of the linked list.

      -
      -
      -
        -
      • -
          -
        • (accumulator, val): U
          • -
        • -
          -

          Parameters

          -
            -
          • -
            accumulator: U
            • -
          • -
            val: E
          -

          Returns U

      • -
    • -
      initialValue: U
      -

      The initialValue parameter is the initial value of the accumulator. It is the starting -point for the reduction operation.

      -
      -
    -

    Returns U

    The reduce method is returning the final value of the accumulator after iterating through all the -elements in the linked list.

    - -
-
-

reverse

-
-
-

shift

-
    - -
  • -

    The shift() function removes and returns the value of the first node in a doubly linked list.

    -
    -

    Returns undefined | E

    The method shift() returns the value of the node that is removed from the beginning of the doubly linked -list.

    - -
-
-

toArray

-
-
-

toArrayReverse

-
-
-

unshift

-
    - -
  • -

    The unshift function adds a new node with the given value to the beginning of a doubly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      val: E
      -

      The val parameter represents the value of the new node that will be added to the beginning of the -doubly linked list.

      -
      -
    -

    Returns void

    -
-
-

Static fromArray

-
    - -
  • -

    The fromArray function creates a new instance of a DoublyLinkedList and populates it with the elements from the -given array.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      E

    -
    -

    Parameters

    -
      -
    • -
      data: E[]
      -

      The data parameter is an array of elements of type E.

      -
      -
    -

    Returns DoublyLinkedList<E>

    The fromArray function returns a DoublyLinkedList object.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/DoublyLinkedListNode.html b/docs/classes/DoublyLinkedListNode.html deleted file mode 100644 index a87518f..0000000 --- a/docs/classes/DoublyLinkedListNode.html +++ /dev/null @@ -1,331 +0,0 @@ -DoublyLinkedListNode | data-structure-typed
-
- -
-
-
-
- -

Class DoublyLinkedListNode<E>

-
-

data-structure-typed

-
-
-

Author

Tyler Zeng

- -

Copyright

Copyright (c) 2022 Tyler Zeng zrwusa@gmail.com

- -

License

MIT License

-
-
-

Type Parameters

-
    -
  • -

    E = any

-
-

Hierarchy

-
    -
  • DoublyLinkedListNode
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_next -_prev -_val -
-
-

Accessors

-
next -prev -val -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Private _next

-
_next: null | DoublyLinkedListNode<E>
-
-

Private _prev

-
_prev: null | DoublyLinkedListNode<E>
-
-

Private _val

-
_val: E
-
-

Accessors

-
-

next

-
-
-

prev

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/HashTable.html b/docs/classes/HashTable.html deleted file mode 100644 index d84c518..0000000 --- a/docs/classes/HashTable.html +++ /dev/null @@ -1,599 +0,0 @@ -HashTable | data-structure-typed
-
- -
-
-
-
- -

Class HashTable<K, V>

-
-

Type Parameters

-
    -
  • -

    K

    • -
  • -

    V

-
-

Hierarchy

-
    -
  • HashTable
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_buckets -_capacity -_hashFn -_size -DEFAULT_CAPACITY -LOAD_FACTOR -
-
-

Accessors

-
buckets -capacity -hashFn -size -
-
-

Methods

-
_defaultHashFn -_expand -_hash -_multiplicativeStringHashFn -_murmurStringHashFn -_objectHash -_stringHash -get -remove -set -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Private _buckets

-
_buckets: (null | HashTableNode<K, V>)[]
-
-

Private _capacity

-
_capacity: number
-
-

Private _hashFn

-
_hashFn: HashFunction<K>
-
-

Private _size

-
_size: number
-
-

Static Private Readonly DEFAULT_CAPACITY

-
DEFAULT_CAPACITY: 16 = 16
-
-

Static Private Readonly LOAD_FACTOR

-
LOAD_FACTOR: 0.75 = 0.75
-
-

Accessors

-
-

buckets

-
-
-

capacity

-
-
-

hashFn

-
-
-

size

-
-
-

Methods

-
-

Protected _defaultHashFn

-
    -
  • _defaultHashFn(key): number
    • -
  • -

    The function _defaultHashFn calculates the hash value of a given key and returns the remainder when divided by the -capacity of the data structure.

    -
    -
    -

    Parameters

    -
      -
    • -
      key: K
      -

      The key parameter is the input value that needs to be hashed. It can be of any type, but in this -code snippet, it is checked whether the key is a string or an object. If it is a string, the _murmurStringHashFn -function is used to

      -
      -
    -

    Returns number

    the hash value of the key modulo the capacity of the data structure.

    - -
-
-

Protected _expand

-
    -
  • _expand(): void
    • -
  • -

    The expand function increases the capacity of a hash table by creating a new array of buckets with double the -capacity and rehashing all the existing key-value pairs into the new buckets.

    -
    -

    Returns void

    -
-
-

Protected _hash

-
    -
  • _hash(key): number
    • -
  • -

    The _hash function takes a key and returns a number.

    -
    -
    -

    Parameters

    -
      -
    • -
      key: K
      -

      The parameter "key" is of type K, which represents the type of the key that will be hashed.

      -
      -
    -

    Returns number

    The hash function is returning a number.

    - -
-
-

Protected _multiplicativeStringHashFn

-
    -
  • _multiplicativeStringHashFn<K>(key): number
    • -
  • -

    The _multiplicativeStringHashFn function calculates a hash value for a given string key using the multiplicative -string hash function.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      K

    -
    -

    Parameters

    -
      -
    • -
      key: K
      -

      The key parameter is the input value for which we want to calculate the hash. It can be of any -type, as it is generic (K). The function converts the key to a string using the String() function.

      -
      -
    -

    Returns number

    a number, which is the result of the multiplicative string hash function applied to the input key.

    - -
-
-

Protected _murmurStringHashFn

-
    -
  • _murmurStringHashFn<K>(key): number
    • -
  • -

    The function _murmurStringHashFn calculates a hash value for a given string key using the MurmurHash algorithm.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      K

    -
    -

    Parameters

    -
      -
    • -
      key: K
      -

      The key parameter is the input value for which you want to calculate the hash. It can be of any -type, but it will be converted to a string using the String() function before calculating the hash.

      -
      -
    -

    Returns number

    a number, which is the hash value calculated for the given key.

    - -
-
-

Protected _objectHash

-
    -
  • _objectHash(key): number
    • -
  • -

    The function _objectHash takes a key and returns a hash value, using a custom hash function for objects.

    -
    -
    -

    Parameters

    -
      -
    • -
      key: K
      -

      The parameter "key" is of type "K", which means it can be any type. It could be a string, number, -boolean, object, or any other type of value. The purpose of the objectHash function is to generate a hash value for -the key, which can be used for

      -
      -
    -

    Returns number

    a number, which is the hash value of the key.

    - -
-
-

Protected _stringHash

-
    -
  • _stringHash(key): number
    • -
  • -

    The function calculates a hash value for a given string using the djb2 algorithm.

    -
    -
    -

    Parameters

    -
      -
    • -
      key: string
      -

      The key parameter in the stringHash function is a string value that represents the input for -which we want to calculate the hash value.

      -
      -
    -

    Returns number

    a number, which is the hash value of the input string.

    - -
-
-

get

-
    - -
  • -

    The get function retrieves the value associated with a given key from a hash table.

    -
    -
    -

    Parameters

    -
      -
    • -
      key: K
      -

      The key parameter represents the key of the element that we want to retrieve from the data -structure.

      -
      -
    -

    Returns undefined | V

    The method is returning the value associated with the given key if it exists in the hash table. If the key is -not found, it returns undefined.

    - -
-
-

remove

-
    - -
  • -

    The remove function removes a key-value pair from a hash table.

    -
    -
    -

    Parameters

    -
      -
    • -
      key: K
      -

      The key parameter represents the key of the key-value pair that needs to be removed from the hash -table.

      -
      -
    -

    Returns void

    Nothing is being returned. The remove method has a return type of void, which means it does not return -any value.

    - -
-
-

set

-
    - -
  • -

    The set function adds a key-value pair to the hash table, handling collisions and resizing if necessary.

    -
    -
    -

    Parameters

    -
      -
    • -
      key: K
      -

      The key parameter represents the key of the key-value pair that you want to insert into the hash -table. It is of type K, which is a generic type representing the key's data type.

      -
      -
      • -
    • -
      val: V
      -

      The parameter val represents the value that you want to associate with the given key in the hash -table.

      -
      -
    -

    Returns void

    Nothing is being returned. The return type of the put method is void, which means it does not return any -value.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/Heap.html b/docs/classes/Heap.html deleted file mode 100644 index a3725e1..0000000 --- a/docs/classes/Heap.html +++ /dev/null @@ -1,651 +0,0 @@ -Heap | data-structure-typed
-
- -
-
-
-
- -

Class Heap<V>Abstract

-
-

Type Parameters

-
    -
  • -

    V = number

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_pq -_priorityExtractor -
-
-

Accessors

-
pq -priorityExtractor -size -
-
-

Methods

-
add -clear -has -isEmpty -peek -peekLast -poll -sort -toArray -
-
-

Constructors

-
-

Protected constructor

-
    - -
  • -

    The function is a constructor for a class that initializes a priority callback function based on the -options provided.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      V = number

    -
    -

    Parameters

    -
      -
    • -
      Optional options: HeapOptions<V>
      -

      An optional object that contains configuration options for the Heap.

      -
      -
    -

    Returns Heap<V>

    -
-
-

Properties

-
-

Protected Abstract _pq

-
_pq: PriorityQueue<HeapItem<V>>
-
-

Protected _priorityExtractor

-
_priorityExtractor: ((val) => number)
-
-

Type declaration

-
    -
  • -
      -
    • (val): number
      • -
    • -
      -

      Parameters

      -
        -
      • -
        val: V
      -

      Returns number

-
-

Accessors

-
-

pq

-
-
-

priorityExtractor

-
    -
  • get priorityExtractor(): ((val) => number)
    • -
  • -

    Returns ((val) => number)

    -
      -
    • -
        -
      • (val): number
        • -
      • -
        -

        Parameters

        -
          -
        • -
          val: V
        -

        Returns number

-
-

size

-
    -
  • get size(): number
    • -
  • -

    The function returns the size of a priority queue.

    -
    -

    Returns number

    The size of the priority queue.

    - -
-
-

Methods

-
-

add

-
    - -
  • -

    The add function adds an val to a priority queue with an optional priority value.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional priority: number
      -

      The priority parameter is an optional number that represents the priority of the -val being added to the heap. If the val parameter is a number, then the priority parameter is set to -the value of val. If the val parameter is not a number, then the

      -
      -
      • -
    • -
      Optional val: V
      -

      The val parameter represents the value that you want to add to the heap. It can be of any -type.

      -
      -
    -

    Returns Heap<V>

    The add method returns the instance of the Heap class.

    - -
    -

    Throws

    if priority is not a valid number

    -
-
-

clear

-
-
-

has

-
    - -
  • -

    The function checks if a given node or value exists in the priority queue.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: V | HeapItem<V>
      -

      The parameter node can be of type V or HeapItem<V>.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

isEmpty

-
    - -
  • -

    The function checks if a priority queue is empty.

    -
    -

    Returns boolean

    A boolean value indicating whether the size of the priority queue is less than 1.

    - -
-
-

peek

-
    - -
  • -

    The peek function returns the top item in the priority queue without removing it.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
    -

    Returns undefined | V

    The peek() method is returning either a HeapItem<V> object or null.Returns an val with the highest priority in the queue

    - -
    • - -
  • -

    The peek function returns the top item in the priority queue without removing it.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
    -

    Returns undefined | V

    The peek() method is returning either a HeapItem<V> object or null.Returns an val with the highest priority in the queue

    - -
    • - -
  • -

    The peek function returns the top item in the priority queue without removing it.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
    -

    Returns null | HeapItem<V>

    The peek() method is returning either a HeapItem<V> object or null.Returns an val with the highest priority in the queue

    - -
-
-

peekLast

-
    - -
  • -

    The peekLast function returns the last item in the heap.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
    -

    Returns undefined | V

    The method peekLast() returns either a HeapItem<V> object or null.Returns an val with the lowest priority in the queue

    - -
    • - -
  • -

    The peekLast function returns the last item in the heap.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
    -

    Returns undefined | V

    The method peekLast() returns either a HeapItem<V> object or null.Returns an val with the lowest priority in the queue

    - -
    • - -
  • -

    The peekLast function returns the last item in the heap.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
    -

    Returns null | HeapItem<V>

    The method peekLast() returns either a HeapItem<V> object or null.Returns an val with the lowest priority in the queue

    - -
-
-

poll

-
    - -
  • -

    The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
    -

    Returns undefined | V

    either a HeapItem object or null.

    - -
    • - -
  • -

    The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
    -

    Returns undefined | V

    either a HeapItem object or null.

    - -
    • - -
  • -

    The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
    -

    Returns null | HeapItem<V>

    either a HeapItem object or null.

    - -
-
-

sort

-
    - -
  • -

    The function sorts the elements in the priority queue and returns either the sorted items or their values depending -on the value of the isItem parameter.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
      -

      The isItem parameter is a boolean flag that indicates whether the sorted result should -be an array of HeapItem<V> objects or an array of the values (V) of those objects. If isItem is true, the -sorted result will be an array of HeapItem @returns an array of either HeapItem, null, V, or undefined` values.

      -
      -
    -

    Returns (undefined | V)[]

    -
    • - -
  • -

    The function sorts the elements in the priority queue and returns either the sorted items or their values depending -on the value of the isItem parameter.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
      -

      The isItem parameter is a boolean flag that indicates whether the sorted result should -be an array of HeapItem<V> objects or an array of the values (V) of those objects. If isItem is true, the -sorted result will be an array of HeapItem @returns an array of either HeapItem, null, V, or undefined` values.

      -
      -
    -

    Returns (undefined | V)[]

    -
    • - -
  • -

    The function sorts the elements in the priority queue and returns either the sorted items or their values depending -on the value of the isItem parameter.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
      -

      The isItem parameter is a boolean flag that indicates whether the sorted result should -be an array of HeapItem<V> objects or an array of the values (V) of those objects. If isItem is true, the -sorted result will be an array of HeapItem @returns an array of either HeapItem, null, V, or undefined` values.

      -
      -
    -

    Returns (null | HeapItem<V>)[]

    -
-
-

toArray

-
    - -
  • -

    The toArray function returns an array of HeapItem<V> objects.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
    -

    Returns (undefined | V)[]

    An array of HeapItem objects.Returns a sorted list of vals

    - -
    • - -
  • -

    The toArray function returns an array of HeapItem<V> objects.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
    -

    Returns (undefined | V)[]

    An array of HeapItem objects.Returns a sorted list of vals

    - -
    • - -
  • -

    The toArray function returns an array of HeapItem<V> objects.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
    -

    Returns (null | HeapItem<V>)[]

    An array of HeapItem objects.Returns a sorted list of vals

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/HeapItem.html b/docs/classes/HeapItem.html deleted file mode 100644 index a2ab563..0000000 --- a/docs/classes/HeapItem.html +++ /dev/null @@ -1,300 +0,0 @@ -HeapItem | data-structure-typed
-
- -
-
-
-
- -

Class HeapItem<V>

-
-

Type Parameters

-
    -
  • -

    V = any

-
-

Hierarchy

-
    -
  • HeapItem
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_priority -_val -
-
-

Accessors

-
priority -val -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor function initializes an instance of a class with a priority and a value.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      V = any

    -
    -

    Parameters

    -
      -
    • -
      priority: number = Number.MAX_SAFE_INTEGER
      -

      The priority parameter is a number that represents the priority of the value. It is -optional and has a default value of NaN.

      -
      -
      • -
    • -
      Optional val: null | V = null
      -

      The val parameter is of type V | null, which means it can accept a value of type -V or null.

      -
      -
    -

    Returns HeapItem<V>

    -
-
-

Properties

-
-

Private _priority

-
_priority: number
-
-

Private _val

-
_val: null | V
-
-

Accessors

-
-

priority

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/LinkedListQueue.html b/docs/classes/LinkedListQueue.html deleted file mode 100644 index 1b478e2..0000000 --- a/docs/classes/LinkedListQueue.html +++ /dev/null @@ -1,888 +0,0 @@ -LinkedListQueue | data-structure-typed
-
- -
-
-
-
- -

Class LinkedListQueue<E>

-
-

Type Parameters

-
    -
  • -

    E = any

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Accessors

-
head -length -tail -
-
-

Methods

-
[iterator] -clear -countOccurrences -delete -deleteAt -dequeue -enqueue -find -findNode -getAt -getLength -getNodeAt -indexOf -insertAfter -insertAt -insertBefore -isEmpty -peek -pop -push -reverse -shift -toArray -unshift -fromArray -
-
-

Constructors

-
-

constructor

-
-
-

Accessors

-
-

head

-
-
-

length

-
-
-

tail

-
-
-

Methods

-
-

[iterator]

-
-
-

clear

-
-
-

countOccurrences

-
    - -
  • -

    The function counts the number of occurrences of a given value in a linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: E
      -

      The value parameter is the value that you want to count the occurrences of in the linked list.

      -
      -
    -

    Returns number

    The count of occurrences of the given value in the linked list.

    - -
-
-

delete

-
    - -
  • -

    The delete function removes a node with a specific value from a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      valueOrNode: E
      -

      The valueOrNode parameter can accept either a value of type E -or a SinglyLinkedListNode<E> object.

      -
      -
    -

    Returns boolean

    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.

    - -
    • - -
  • -

    The delete function removes a node with a specific value from a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      valueOrNode: SinglyLinkedListNode<E>
      -

      The valueOrNode parameter can accept either a value of type E -or a SinglyLinkedListNode<E> object.

      -
      -
    -

    Returns boolean

    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.

    - -
-
-

deleteAt

-
    - -
  • -

    The deleteAt function removes an element at a specified index from a linked list and returns the removed element.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter represents the position of the element that needs to be deleted in the -data structure. It is of type number.

      -
      -
    -

    Returns undefined | E

    The method deleteAt returns the value of the node that was deleted, or null if the index is out of -bounds.

    - -
-
-

dequeue

-
    - -
  • -

    The dequeue function removes and returns the first element from a queue, or returns null if the queue is empty.

    -
    -

    Returns undefined | E

    The method is returning the element at the front of the queue, or null if the queue is empty.

    - -
-
-

enqueue

-
    - -
  • -

    The enqueue function adds a value to the end of an array.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: E
      -

      The value parameter represents the value that you want to add to the queue.

      -
      -
    -

    Returns void

    -
-
-

find

-
    - -
  • -

    The find function iterates through a linked list and returns the first element that satisfies a given condition.

    -
    -
    -

    Parameters

    -
      -
    • -
      callback: ((val) => boolean)
      -

      A function that takes a value of type E as its parameter and returns a boolean value. This -function is used to determine whether a particular value in the linked list satisfies a certain condition.

      -
      -
      -
        -
      • -
          -
        • (val): boolean
          • -
        • -
          -

          Parameters

          -
            -
          • -
            val: E
          -

          Returns boolean

    -

    Returns null | E

    The method find returns the first element in the linked list that satisfies the condition specified by -the callback function. If no element satisfies the condition, it returns null.

    - -
-
-

findNode

-
    - -
  • -

    The function finds a node in a singly linked list by its value and returns the node if found, otherwise returns -null.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: E
      -

      The value parameter is the value that we want to search for in the linked list.

      -
      -
    -

    Returns null | SinglyLinkedListNode<E>

    a SinglyLinkedListNode<E> if a node with the specified value is found in the linked list. If no node with -the specified value is found, the function returns null.

    - -
-
-

getAt

-
    - -
  • -

    The function getAt returns the value at a specified index in a linked list, or null if the index is out of range.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter is a number that represents the position of the element we want to -retrieve from the list.

      -
      -
    -

    Returns undefined | E

    The method getAt(index: number): E | null returns the value at the specified index in the linked list, or -null if the index is out of bounds.

    - -
-
-

getLength

-
-
-

getNodeAt

-
    - -
  • -

    The function getNodeAt returns the node at a given index in a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter is a number that represents the position of the node we want to -retrieve from the linked list. It indicates the zero-based index of the node we want to access.

      -
      -
    -

    Returns null | SinglyLinkedListNode<E>

    The method getNodeAt(index: number) returns a SinglyLinkedListNode<E> object if the node at the -specified index exists, or null if the index is out of bounds.

    - -
-
-

indexOf

-
    - -
  • -

    The indexOf function returns the index of the first occurrence of a given value in a linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: E
      -

      The value parameter is the value that you want to find the index of in the linked list.

      -
      -
    -

    Returns number

    The method is returning the index of the first occurrence of the specified value in the linked list. If the -value is not found, it returns -1.

    - -
-
-

insertAfter

-
    - -
  • -

    The insertAfter function inserts a new node with a given value after an existing node in a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValueOrNode: E
      -

      The existing value or node in the linked list after which -the new value will be inserted. It can be either the value of the existing node or the existing node itself.

      -
      -
      • -
    • -
      newValue: E
      -

      The value that you want to insert into the linked list after the existing value or node.

      -
      -
    -

    Returns boolean

    The method returns a boolean value. It returns true if the new value was successfully inserted after the -existing value or node, and false if the existing value or node was not found in the linked list.

    - -
    • - -
  • -

    The insertAfter function inserts a new node with a given value after an existing node in a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValueOrNode: SinglyLinkedListNode<E>
      -

      The existing value or node in the linked list after which -the new value will be inserted. It can be either the value of the existing node or the existing node itself.

      -
      -
      • -
    • -
      newValue: E
      -

      The value that you want to insert into the linked list after the existing value or node.

      -
      -
    -

    Returns boolean

    The method returns a boolean value. It returns true if the new value was successfully inserted after the -existing value or node, and false if the existing value or node was not found in the linked list.

    - -
-
-

insertAt

-
    - -
  • -

    The insertAt function inserts a value at a specified index in a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter represents the position at which the new value should be inserted in the -linked list. It is of type number.

      -
      -
      • -
    • -
      val: E
      -

      The val parameter represents the value that you want to insert into the linked list at the -specified index.

      -
      -
    -

    Returns boolean

    The insert method returns a boolean value. It returns true if the insertion is successful, and false -if the index is out of bounds.

    - -
-
-

insertBefore

-
    - -
  • -

    The insertBefore function inserts a new value before an existing value in a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValue: E
      • -
    • -
      newValue: E
      -

      The newValue parameter represents the value that you want to insert into the linked list.

      -
      -
    -

    Returns boolean

    The method insertBefore returns a boolean value. It returns true if the new value was successfully -inserted before the existing value, and false otherwise.

    - -
    • - -
  • -

    The insertBefore function inserts a new value before an existing value in a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValue: SinglyLinkedListNode<E>
      • -
    • -
      newValue: E
      -

      The newValue parameter represents the value that you want to insert into the linked list.

      -
      -
    -

    Returns boolean

    The method insertBefore returns a boolean value. It returns true if the new value was successfully -inserted before the existing value, and false otherwise.

    - -
-
-

isEmpty

-
-
-

peek

-
    - -
  • -

    The peek function returns the value of the head node in a linked list, or undefined if the list is empty.

    -
    -

    Returns undefined | E

    The peek() method is returning the value of the head node if it exists, otherwise it returns undefined.

    - -
-
-

pop

-
    - -
  • -

    The pop() function removes and returns the value of the last element in a linked list, updating the head and tail -pointers accordingly.

    -
    -

    Returns undefined | E

    The method pop() returns the value of the node that is being removed from the end of the linked list. If -the linked list is empty, it returns null.

    - -
-
-

push

-
    - -
  • -

    The push function adds a new node with the given data to the end of a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      data: E
      -

      The "data" parameter represents the value that you want to add to the linked list. It can be of -any type (E) as specified in the generic type declaration of the class or function.

      -
      -
    -

    Returns void

    -
-
-

reverse

-
-
-

shift

-
-
-

toArray

-
-
-

unshift

-
-
-

Static fromArray

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/MapEdge.html b/docs/classes/MapEdge.html deleted file mode 100644 index 95ddc3c..0000000 --- a/docs/classes/MapEdge.html +++ /dev/null @@ -1,395 +0,0 @@ -MapEdge | data-structure-typed
-
- -
-
-
-
- -

Class MapEdge<V>

-
-

Type Parameters

-
    -
  • -

    V = any

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_hashCode -
-
-

Accessors

-
dest -hashCode -src -val -weight -
-
-

Methods

-
_setHashCode -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor function initializes a new instance of a class with the given source, destination, weight, and -value.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      V = any

    -
    -

    Parameters

    -
      -
    • -
      src: VertexId
      -

      The src parameter is the source vertex ID. It represents the starting point of an edge in -a graph.

      -
      -
      • -
    • -
      dest: VertexId
      -

      The dest parameter is the identifier of the destination vertex for an edge.

      -
      -
      • -
    • -
      Optional weight: number
      -

      The weight parameter is an optional number that represents the weight of the edge.

      -
      -
      • -
    • -
      Optional val: V
      -

      The "val" parameter is an optional parameter of type V. It is used to store additional -information or data associated with the edge.

      -
      -
    -

    Returns MapEdge<V>

    -
-
-

Properties

-
-

Protected _hashCode

-
_hashCode: string
-
-

Accessors

-
-

dest

-
-
-

hashCode

-
-
-

src

-
-
-

val

-
-
-

weight

-
-
-

Methods

-
-

Protected _setHashCode

-
    -
  • _setHashCode(v): void
    • -
  • -

    The function sets the value of the _hashCode property to the provided string.

    -
    -
    -

    Parameters

    -
      -
    • -
      v: string
      -

      The parameter "v" is of type string and represents the value that will be assigned to the -"_hashCode" property.

      -
      -
    -

    Returns void

    -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/MapGraph.html b/docs/classes/MapGraph.html deleted file mode 100644 index 53b0635..0000000 --- a/docs/classes/MapGraph.html +++ /dev/null @@ -1,1587 +0,0 @@ -MapGraph | data-structure-typed
-
- -
-
-
-
- -

Class MapGraph<V, E>

-
-

Type Parameters

-
-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_bottomRight -_origin -
-
-

Accessors

-
bottomRight -inEdgeMap -origin -outEdgeMap -vertices -
-
-

Methods

-
_addEdgeOnly -_addVertexOnly -_getVertex -_getVertexId -_setInEdgeMap -_setOutEdgeMap -_setVertices -addEdge -addVertex -bellmanFord -createEdge -createVertex -degreeOf -dijkstra -dijkstraWithoutHeap -edgeSet -edgesOf -floyd -getAllPathsBetween -getDestinations -getEdge -getEdgeDest -getEdgeSrc -getEndsOfEdge -getMinCostBetween -getMinPathBetween -getNeighbors -getPathSumWeight -getVertex -hasEdge -hasVertex -inDegreeOf -incomingEdgesOf -outDegreeOf -outgoingEdgesOf -removeAllVertices -removeEdge -removeEdgeSrcToDest -removeEdgesBetween -removeVertex -setEdgeWeight -tarjan -topologicalSort -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor function initializes the origin and bottomRight properties of a MapGraphCoordinate object.

    -
    -
    -

    Type Parameters

    -
    -
    -

    Parameters

    -
      -
    • -
      origin: MapGraphCoordinate
      -

      The origin parameter is a MapGraphCoordinate object that represents the -starting point or reference point of the map graph. It defines the coordinates of the top-left corner of the map -graph.

      -
      -
      • -
    • -
      Optional bottomRight: MapGraphCoordinate
      -

      The bottomRight parameter is an optional parameter of type -MapGraphCoordinate. It represents the bottom right coordinate of a map graph. If this parameter is not provided, -it will default to undefined.

      -
      -
    -

    Returns MapGraph<V, E>

    -
-
-

Properties

-
-

Private _bottomRight

-
_bottomRight: undefined | MapGraphCoordinate
-
-

Private _origin

-
_origin: MapGraphCoordinate = ...
-
-

Accessors

-
-

bottomRight

-
-
-

inEdgeMap

-
-
-

origin

-
-
-

outEdgeMap

-
-
-

vertices

-
-
-

Methods

-
-

Protected _addEdgeOnly

-
    -
  • _addEdgeOnly(edge): boolean
    • -
  • -

    The function _addEdgeOnly adds an edge to a graph if the source and destination vertices exist.

    -
    -
    -

    Parameters

    -
      -
    • -
      edge: E
      -

      The parameter edge is of type E, which represents an edge in a graph. It is the edge that -needs to be added to the graph.

      -
      -
    -

    Returns boolean

    a boolean value. It returns true if the edge was successfully added to the graph, and false if either the -source or destination vertex does not exist in the graph.

    - -
-
-

Protected _addVertexOnly

-
-
-

Protected _getVertex

-
-
-

Protected _getVertexId

-
-
-

Protected _setInEdgeMap

-
-
-

Protected _setOutEdgeMap

-
-
-

Protected _setVertices

-
-
-

addEdge

-
-
-

addVertex

-
-
-

bellmanFord

-
    - -
  • -

    BellmanFord time:O(VE) space:O(V) -one to rest pairs -/

    -

    /** -BellmanFord time:O(VE) space:O(V) -one to rest pairs -The Bellman-Ford algorithm is also used to find the shortest paths from a source node to all other nodes in a graph. Unlike Dijkstra's algorithm, it can handle edge weights that are negative. Its basic idea involves iterative relaxation of all edges for several rounds to gradually approximate the shortest paths. Due to its ability to handle negative-weight edges, the Bellman-Ford algorithm is more flexible in some scenarios. -The bellmanFord function implements the Bellman-Ford algorithm to find the shortest path from a source vertex to -all other vertices in a graph, and optionally detects negative cycles and generates the minimum path.

    -
    -
    -

    Parameters

    -
      -
    • -
      src: VertexId | V
      -

      The src parameter is the source vertex from which the Bellman-Ford algorithm will -start calculating the shortest paths. It can be either a vertex object or a vertex ID.

      -
      -
      • -
    • -
      Optional scanNegativeCycle: boolean
      -

      A boolean flag indicating whether to scan for negative cycles in the graph.

      -
      -
      • -
    • -
      Optional getMin: boolean
      -

      The getMin parameter is a boolean flag that determines whether the algorithm should -calculate the minimum distance from the source vertex to all other vertices in the graph. If getMin is set to -true, the algorithm will find the minimum distance and update the min variable with the minimum

      -
      -
      • -
    • -
      Optional genPath: boolean
      -

      A boolean flag indicating whether to generate paths for all vertices from the source -vertex.

      -
      -
    -

    Returns {
        distMap: Map<V, number>;
        hasNegativeCycle: undefined | boolean;
        min: number;
        minPath: V[];
        paths: V[][];
        preMap: Map<V, V>;
    }

    The function bellmanFord returns an object with the following properties:

    - -
      -
    • -
      distMap: Map<V, number>
      • -
    • -
      hasNegativeCycle: undefined | boolean
      • -
    • -
      min: number
      • -
    • -
      minPath: V[]
      • -
    • -
      paths: V[][]
      • -
    • -
      preMap: Map<V, V>
    -
-
-

createEdge

-
    - -
  • -

    The function creates a new instance of a MapEdge with the given source, destination, weight, and value.

    -
    -
    -

    Parameters

    -
      -
    • -
      src: VertexId
      -

      The source vertex ID of the edge. It represents the starting point of the edge.

      -
      -
      • -
    • -
      dest: VertexId
      -

      The dest parameter is the identifier of the destination vertex for the edge being -created.

      -
      -
      • -
    • -
      Optional weight: number
      -

      The weight parameter is an optional number that represents the weight of the edge. It -is used to assign a numerical value to the edge, which can be used in algorithms such as shortest path algorithms. -If the weight is not provided, it can be set to a default value or left undefined.

      -
      -
      • -
    • -
      Optional val: E["val"]
      -

      The val parameter is an optional value that can be assigned to the edge. It can be of any type, -depending on the specific implementation of the MapEdge class.

      -
      -
    -

    Returns E

    a new instance of the MapEdge class, casted as type E.

    - -
-
-

createVertex

-
    - -
  • -

    The function creates a new vertex with the given id, value, latitude, and longitude.

    -
    -
    -

    Parameters

    -
      -
    • -
      id: VertexId
      -

      The id parameter is the unique identifier for the vertex. It is of type VertexId, which could -be a string or a number depending on how you define it in your code.

      -
      -
      • -
    • -
      Optional val: V["val"]
      -

      The val parameter is an optional value that can be assigned to the val property of the vertex. It -is of type V['val'], which means it should be of the same type as the val property of the vertex class V.

      -
      -
      • -
    • -
      lat: number = ...
      -

      The lat parameter represents the latitude of the vertex. It is a number that specifies the -position of the vertex on the Earth's surface in the north-south direction.

      -
      -
      • -
    • -
      long: number = ...
      -

      The long parameter represents the longitude coordinate of the vertex.

      -
      -
    -

    Returns V

    The method is returning a new instance of the MapVertex class, casted as type V.

    - -
-
-

degreeOf

-
    - -
  • -

    The function "degreeOf" returns the total degree of a vertex, which is the sum of its out-degree and in-degree.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can be either a VertexId or a V.

      -
      -
    -

    Returns number

    The sum of the out-degree and in-degree of the specified vertex or vertex ID.

    - -
-
-

dijkstra

-
    - -
  • -

    Dijkstra algorithm time: O(logVE) space: O(V + E)

    -

    Dijkstra's algorithm only solves the single-source shortest path problem, while the Bellman-Ford algorithm and Floyd-Warshall algorithm can address shortest paths between all pairs of nodes. -Dijkstra's algorithm is suitable for graphs with non-negative edge weights, whereas the Bellman-Ford algorithm and Floyd-Warshall algorithm can handle negative-weight edges. -The time complexity of Dijkstra's algorithm and the Bellman-Ford algorithm depends on the size of the graph, while the time complexity of the Floyd-Warshall algorithm is O(V^3), where V is the number of nodes. For dense graphs, Floyd-Warshall might become slower.

    -

    /

    -

    /** -Dijkstra's algorithm is used to find the shortest paths from a source node to all other nodes in a graph. Its basic idea is to repeatedly choose the node closest to the source node and update the distances of other nodes using this node as an intermediary. Dijkstra's algorithm requires that the edge weights in the graph are non-negative. -The dijkstra function implements Dijkstra's algorithm to find the shortest path between a source vertex and an -optional destination vertex, and optionally returns the minimum distance, the paths, and other information.

    -
    -
    -

    Parameters

    -
      -
    • -
      src: VertexId | V
      -

      The src parameter represents the source vertex from which the Dijkstra algorithm will -start. It can be either a vertex object or a vertex ID.

      -
      -
      • -
    • -
      Optional dest: null | VertexId | V
      -

      The dest parameter is the destination vertex or vertex ID. It specifies the -vertex to which the shortest path is calculated from the source vertex. If no destination is provided, the algorithm -will calculate the shortest paths to all other vertices from the source vertex.

      -
      -
      • -
    • -
      Optional getMinDist: boolean
      -

      The getMinDist parameter is a boolean flag that determines whether the minimum -distance from the source vertex to the destination vertex should be calculated and returned in the result. If -getMinDist is set to true, the minDist property in the result will contain the minimum distance

      -
      -
      • -
    • -
      Optional genPaths: boolean
      -

      The genPaths parameter is a boolean flag that determines whether or not to generate -paths in the Dijkstra algorithm. If genPaths is set to true, the algorithm will calculate and return the -shortest paths from the source vertex to all other vertices in the graph. If genPaths @returns The function dijkstrareturns an object of typeDijkstraResult`.

      -
      -
    -

    Returns DijkstraResult<V>

    -
-
-

dijkstraWithoutHeap

-
    - -
  • -

    Dijkstra algorithm time: O(VE) space: O(V + E) -/

    -

    /** -Dijkstra algorithm time: O(VE) space: O(V + E) -The function dijkstraWithoutHeap implements Dijkstra's algorithm to find the shortest path between two vertices in -a graph without using a heap data structure.

    -
    -
    -

    Parameters

    -
      -
    • -
      src: VertexId | V
      -

      The source vertex from which to start the Dijkstra's algorithm. It can be either a -vertex object or a vertex ID.

      -
      -
      • -
    • -
      Optional dest: null | VertexId | V
      -

      The dest parameter in the dijkstraWithoutHeap function is an optional -parameter that specifies the destination vertex for the Dijkstra algorithm. It can be either a vertex object or its -identifier. If no destination is provided, the value is set to null.

      -
      -
      • -
    • -
      Optional getMinDist: boolean
      -

      The getMinDist parameter is a boolean flag that determines whether the minimum -distance from the source vertex to the destination vertex should be calculated and returned in the result. If -getMinDist is set to true, the minDist property in the result will contain the minimum distance

      -
      -
      • -
    • -
      Optional genPaths: boolean
      -

      The genPaths parameter is a boolean flag that determines whether or not to generate -paths in the Dijkstra algorithm. If genPaths is set to true, the algorithm will calculate and return the -shortest paths from the source vertex to all other vertices in the graph. If genPaths @returns The function dijkstraWithoutHeapreturns an object of typeDijkstraResult`.

      -
      -
    -

    Returns DijkstraResult<V>

    -
-
-

edgeSet

-
-
-

edgesOf

-
    - -
  • -

    The function "edgesOf" returns an array of both outgoing and incoming edges of a given vertex or vertex ID.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can be either a VertexId or a V.

      -
      -
    -

    Returns E[]

    The function edgesOf returns an array of edges.

    - -
-
-

floyd

-
    - -
  • -

    Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle -all pairs -/

    -

    /** -Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle -all pairs -The Floyd-Warshall algorithm is used to find the shortest paths between all pairs of nodes in a graph. It employs dynamic programming to compute the shortest paths from any node to any other node. The Floyd-Warshall algorithm's advantage lies in its ability to handle graphs with negative-weight edges, and it can simultaneously compute shortest paths between any two nodes. -The function implements the Floyd-Warshall algorithm to find the shortest path between all pairs of vertices in a -graph.

    -
    -

    Returns {
        costs: number[][];
        predecessor: (null | V)[][];
    }

    The function floyd() returns an object with two properties: costs and predecessor. The costs -property is a 2D array of numbers representing the shortest path costs between vertices in a graph. The -predecessor property is a 2D array of vertices (or null) representing the predecessor vertices in the shortest -path between vertices in the

    - -
      -
    • -
      costs: number[][]
      • -
    • -
      predecessor: (null | V)[][]
    -
-
-

getAllPathsBetween

-
    - -
  • -

    The function getAllPathsBetween finds all paths between two vertices in a graph using depth-first search.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 represents either a vertex object (V) or a vertex ID (VertexId). -It is the starting vertex for finding paths.

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      The parameter v2 represents either a vertex object (V) or a vertex ID (VertexId).

      -
      -
    -

    Returns V[][]

    The function getAllPathsBetween returns an array of arrays of vertices (V[][]).

    - -
-
-

getDestinations

-
    - -
  • -

    The function getDestinations returns an array of destination vertices connected to a given vertex.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertex: null | VertexId | V
      -

      The vertex parameter represents the starting vertex from which we want to -find the destinations. It can be either a V object, a VertexId value, or null.

      -
      -
    -

    Returns V[]

    an array of vertices (V[]).

    - -
-
-

getEdge

-
    - -
  • -

    The getEdge function retrieves an edge between two vertices based on their source and destination IDs.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcOrId: null | VertexId | V
      -

      The source vertex or its ID. It can be either a vertex object or a vertex ID.

      -
      -
      • -
    • -
      destOrId: null | VertexId | V
      -

      The destOrId parameter in the getEdge function represents the -destination vertex of the edge. It can be either a vertex object (V), a vertex ID (VertexId), or null if the -destination is not specified.

      -
      -
    -

    Returns null | E

    the first edge found between the source and destination vertices, or null if no such edge is found.

    - -
-
-

getEdgeDest

-
    - -
  • -

    The function "getEdgeDest" returns the destination vertex of an edge.

    -
    -
    -

    Parameters

    -
      -
    • -
      e: E
      -

      The parameter "e" is of type "E", which represents an edge in a graph.

      -
      -
    -

    Returns null | V

    either a vertex object of type V or null.

    - -
-
-

getEdgeSrc

-
    - -
  • -

    The function "getEdgeSrc" returns the source vertex of an edge, or null if the edge does not exist.

    -
    -
    -

    Parameters

    -
      -
    • -
      e: E
      -

      The parameter "e" is of type E, which represents an edge in a graph.

      -
      -
    -

    Returns null | V

    either a vertex object (V) or null.

    - -
-
-

getEndsOfEdge

-
    - -
  • -

    The function "getEndsOfEdge" returns the source and destination vertices of an edge if it exists in the graph, -otherwise it returns null.

    -
    -
    -

    Parameters

    -
      -
    • -
      edge: E
      -

      The parameter edge is of type E, which represents an edge in a graph.

      -
      -
    -

    Returns null | [V, V]

    The function getEndsOfEdge returns an array containing two vertices [V, V] if the edge exists in the -graph. If the edge does not exist, it returns null.

    - -
-
-

getMinCostBetween

-
    - -
  • -

    The function getMinCostBetween calculates the minimum cost between two vertices in a graph, either based on edge -weights or using a breadth-first search algorithm.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 represents the starting vertex or its ID.

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      The parameter v2 represents the destination vertex or its ID. It is the vertex to which -you want to find the minimum cost or weight from the source vertex v1.

      -
      -
      • -
    • -
      Optional isWeight: boolean
      -

      isWeight is an optional parameter that indicates whether the graph edges have weights. -If isWeight is set to true, the function will calculate the minimum cost between v1 and v2 based on the weights of -the edges. If isWeight is set to false or not provided, the function will calculate the

      -
      -
    -

    Returns null | number

    The function getMinCostBetween returns a number representing the minimum cost between two vertices (v1 -and v2). If the isWeight parameter is true, it calculates the minimum weight among all paths between the -vertices. If isWeight is false or not provided, it uses a breadth-first search (BFS) algorithm to calculate the -minimum number of

    - -
-
-

getMinPathBetween

-
    - -
  • -

    The function getMinPathBetween returns the minimum path between two vertices in a graph, either based on weight or -using a breadth-first search algorithm.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 represents the starting vertex of the path. It can be either a vertex -object (V) or a vertex ID (VertexId).

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      V | VertexId - The second vertex or vertex ID between which we want to find the minimum -path.

      -
      -
      • -
    • -
      Optional isWeight: boolean
      -

      A boolean flag indicating whether to consider the weight of edges in finding the -minimum path. If set to true, the function will use Dijkstra's algorithm to find the minimum weighted path. If set -to false, the function will use breadth-first search (BFS) to find the minimum path.

      -
      -
    -

    Returns null | V[]

    The function getMinPathBetween returns an array of vertices (V[]) representing the minimum path between -two vertices (v1 and v2). If there is no path between the vertices, it returns null.

    - -
-
-

getNeighbors

-
    - -
  • -

    The function getNeighbors returns an array of neighboring vertices of a given vertex or vertex ID in a graph.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can be either a vertex object (V) or a vertex ID -(VertexId).

      -
      -
    -

    Returns V[]

    an array of vertices (V[]).

    - -
-
-

getPathSumWeight

-
    - -
  • -

    The function calculates the sum of weights along a given path.

    -
    -
    -

    Parameters

    -
      -
    • -
      path: V[]
      -

      An array of vertices (V) representing a path in a graph.

      -
      -
    -

    Returns number

    The function getPathSumWeight returns the sum of the weights of the edges in the given path.

    - -
-
-

getVertex

-
    - -
  • -

    The function "getVertex" returns the vertex with the specified ID or null if it doesn't exist.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexId: VertexId
      -

      The vertexId parameter is the identifier of the vertex that you want to retrieve from -the _vertices map.

      -
      -
    -

    Returns null | V

    The method getVertex returns the vertex with the specified vertexId if it exists in the _vertices -map. If the vertex does not exist, it returns null.

    - -
-
-

hasEdge

-
    - -
  • -

    The function checks if there is an edge between two vertices and returns a boolean value indicating the result.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 can be either a VertexId or a V. A VertexId represents the unique -identifier of a vertex in a graph, while V represents the type of the vertex object itself.

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      The parameter v2 represents the second vertex in the edge. It can be either a -VertexId or a V type, which represents the type of the vertex.

      -
      -
    -

    Returns boolean

    A boolean value is being returned.

    - -
-
-

hasVertex

-
-
-

inDegreeOf

-
    - -
  • -

    The function "inDegreeOf" returns the number of incoming edges for a given vertex.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can be either a VertexId or a V.

      -
      -
    -

    Returns number

    The number of incoming edges of the specified vertex or vertex ID.

    - -
-
-

incomingEdgesOf

-
    - -
  • -

    The function incomingEdgesOf returns an array of incoming edges for a given vertex or vertex ID.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can be either a vertex object (V) or a vertex ID -(VertexId).

      -
      -
    -

    Returns E[]

    The method incomingEdgesOf returns an array of edges (E[]).

    - -
-
-

outDegreeOf

-
    - -
  • -

    The function outDegreeOf returns the number of outgoing edges from a given vertex.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can be either a VertexId or a V.

      -
      -
    -

    Returns number

    The number of outgoing edges from the specified vertex or vertex ID.

    - -
-
-

outgoingEdgesOf

-
    - -
  • -

    The function outgoingEdgesOf returns an array of outgoing edges from a given vertex or vertex ID.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can accept either a vertex object (V) or a vertex ID -(VertexId).

      -
      -
    -

    Returns E[]

    The method outgoingEdgesOf returns an array of edges (E[]).

    - -
-
-

removeAllVertices

-
    - -
  • -

    The function removes all vertices from a graph and returns a boolean indicating if any vertices were removed.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertices: VertexId[] | V[]
      -

      The vertices parameter can be either an array of vertices (V[]) or an array -of vertex IDs (VertexId[]).

      -
      -
    -

    Returns boolean

    a boolean value. It returns true if at least one vertex was successfully removed, and false if no vertices -were removed.

    - -
-
-

removeEdge

-
    - -
  • -

    The function removes an edge from a graph and returns the removed edge, or null if the edge was not found.

    -
    -
    -

    Parameters

    -
      -
    • -
      edge: E
      -

      The edge parameter is an object that represents an edge in a graph. It has two properties: src -and dest, which represent the source and destination vertices of the edge, respectively.

      -
      -
    -

    Returns null | E

    The method removeEdge returns the removed edge (E) if it exists, or null if the edge does not exist.

    - -
-
-

removeEdgeSrcToDest

-
    - -
  • -

    The function removes an edge between two vertices in a graph and returns the removed edge.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcOrId: VertexId | V
      -

      The source vertex or its ID.

      -
      -
      • -
    • -
      destOrId: VertexId | V
      -

      The destOrId parameter represents the destination vertex or its ID.

      -
      -
    -

    Returns null | E

    the removed edge (E) if it exists, or null if either the source or destination vertex does not exist.

    - -
-
-

removeEdgesBetween

-
    - -
  • -

    The function removes edges between two vertices and returns the removed edges.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 can be either a VertexId or a V. A VertexId represents the -unique identifier of a vertex in a graph, while V represents the actual vertex object.

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      The parameter v2 represents either a VertexId or a V object. It is used to specify -the second vertex in the edge that needs to be removed.

      -
      -
    -

    Returns E[]

    an array of removed edges (E[]).

    - -
-
-

removeVertex

-
    - -
  • -

    The removeVertex function removes a vertex from a graph by its ID or by the vertex object itself.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can be either a vertex object (V) or a vertex ID -(VertexId).

      -
      -
    -

    Returns boolean

    The method is returning a boolean value.

    - -
-
-

setEdgeWeight

-
    - -
  • -

    The function sets the weight of an edge between two vertices in a graph.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcOrId: VertexId | V
      -

      The srcOrId parameter can be either a VertexId or a V object. It represents -the source vertex of the edge.

      -
      -
      • -
    • -
      destOrId: VertexId | V
      -

      The destOrId parameter represents the destination vertex of the edge. It can be -either a VertexId or a vertex object V.

      -
      -
      • -
    • -
      weight: number
      -

      The weight parameter represents the weight of the edge between the source vertex (srcOrId) -and the destination vertex (destOrId).

      -
      -
    -

    Returns boolean

    a boolean value. If the edge exists between the source and destination vertices, the function will update -the weight of the edge and return true. If the edge does not exist, the function will return false.

    - -
-
-

tarjan

-
    - -
  • -

    Tarjan is an algorithm based on DFS,which is used to solve the connectivity problem of graphs. -Tarjan can find cycles in directed or undirected graph -Tarjan can find the articulation points and bridges(critical edges) of undirected graphs in linear time, -Tarjan solve the bi-connected components of undirected graphs; -Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs. -/

    -

    /** -Tarjan is an algorithm based on DFS,which is used to solve the connectivity problem of graphs. -Tarjan can find cycles in directed or undirected graph -Tarjan can find the articulation points and bridges(critical edges) of undirected graphs in linear time, -Tarjan solve the bi-connected components of undirected graphs; -Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs. -The tarjan function is used to perform various graph analysis tasks such as finding articulation points, bridges, -strongly connected components (SCCs), and cycles in a graph.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional needArticulationPoints: boolean
      -

      A boolean value indicating whether or not to calculate and return the -articulation points in the graph. Articulation points are the vertices in a graph whose removal would increase the -number of connected components in the graph.

      -
      -
      • -
    • -
      Optional needBridges: boolean
      -

      A boolean flag indicating whether the algorithm should find and return the bridges -(edges whose removal would increase the number of connected components in the graph).

      -
      -
      • -
    • -
      Optional needSCCs: boolean
      -

      A boolean value indicating whether the Strongly Connected Components (SCCs) of the -graph are needed. If set to true, the function will calculate and return the SCCs of the graph. If set to false, the -SCCs will not be calculated or returned.

      -
      -
      • -
    • -
      Optional needCycles: boolean
      -

      A boolean flag indicating whether the algorithm should find cycles in the graph. If -set to true, the algorithm will return a map of cycles, where the keys are the low values of the SCCs and the values -are arrays of vertices that form cycles within the SCCs.

      -
      -
    -

    Returns {
        SCCs: Map<number, V[]>;
        articulationPoints: V[];
        bridges: E[];
        cycles: Map<number, V[]>;
        dfnMap: Map<V, number>;
        lowMap: Map<V, number>;
    }

    The function tarjan returns an object with the following properties:

    - -
      -
    • -
      SCCs: Map<number, V[]>
      • -
    • -
      articulationPoints: V[]
      • -
    • -
      bridges: E[]
      • -
    • -
      cycles: Map<number, V[]>
      • -
    • -
      dfnMap: Map<V, number>
      • -
    • -
      lowMap: Map<V, number>
    -
-
-

topologicalSort

-
    - -
  • -

    The topologicalSort function performs a topological sort on a graph and returns an array of vertices or vertex IDs -in the sorted order, or null if the graph contains a cycle.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional propertyName: "id" | "vertex"
      -

      The propertyName parameter is an optional parameter that specifies the -property to use for sorting the vertices. It can have two possible values: 'vertex' or 'id'. If 'vertex' is -specified, the vertices themselves will be used for sorting. If 'id' is specified, the ids of

      -
      -
    -

    Returns null | (VertexId | V)[]

    an array of vertices or vertex IDs in topological order. If there is a cycle in the graph, it returns null.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/MapVertex.html b/docs/classes/MapVertex.html deleted file mode 100644 index 97a24e5..0000000 --- a/docs/classes/MapVertex.html +++ /dev/null @@ -1,360 +0,0 @@ -MapVertex | data-structure-typed
-
- -
-
-
-
- -

Class MapVertex<V>

-
-

Type Parameters

-
    -
  • -

    V = any

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_lat -_long -
-
-

Accessors

-
id -lat -long -val -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor function initializes an object with an id, latitude, longitude, and an optional value.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      V = any

    -
    -

    Parameters

    -
      -
    • -
      id: VertexId
      -

      The id parameter is of type VertexId and represents the identifier of the vertex.

      -
      -
      • -
    • -
      lat: number
      -

      The "lat" parameter represents the latitude of a vertex. Latitude is a geographic coordinate -that specifies the north-south position of a point on the Earth's surface. It is measured in degrees, with positive -values representing points north of the equator and negative values representing points south of the equator.

      -
      -
      • -
    • -
      long: number
      -

      The "long" parameter represents the longitude of a location. Longitude is a geographic -coordinate that specifies the east-west position of a point on the Earth's surface. It is measured in degrees, with -values ranging from -180 to 180.

      -
      -
      • -
    • -
      Optional val: V
      -

      The "val" parameter is an optional value of type V. It is not required to be provided when -creating an instance of the class.

      -
      -
    -

    Returns MapVertex<V>

    -
-
-

Properties

-
-

Private _lat

-
_lat: number
-
-

Private _long

-
_long: number
-
-

Accessors

-
-

id

-
-
-

lat

-
-
-

long

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/Matrix2D.html b/docs/classes/Matrix2D.html deleted file mode 100644 index d22b3ee..0000000 --- a/docs/classes/Matrix2D.html +++ /dev/null @@ -1,536 +0,0 @@ -Matrix2D | data-structure-typed
-
- -
-
-
-
- -

Class Matrix2D

-
-

Hierarchy

-
    -
  • Matrix2D
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_matrix -
-
-

Accessors

-
m -empty -identity -
-
-

Methods

-
toVector -add -multiply -multiplyByValue -multiplyByVector -rotate -scale -subtract -translate -view -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor function initializes a Matrix2D object with either a default identity matrix, or a provided matrix -or Vector2D object.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional value: number[][] | Vector2D
      -

      The value parameter can be either a 2D array of numbers (number[][]) or -an instance of the Vector2D class.

      -
      -
    -

    Returns Matrix2D

    -
-
-

Properties

-
-

Private Readonly _matrix

-
_matrix: number[][]
-
-

Accessors

-
-

m

-
    -
  • get m(): number[][]
    • -
  • -

    The function returns a two-dimensional array of numbers.

    -
    -

    Returns number[][]

    The getter method is returning the value of the private variable _matrix, which is a two-dimensional -array of numbers.

    - -
-
-

Static empty

-
    -
  • get empty(): number[][]
    • -
  • -

    The function returns a 2D array with three empty arrays.

    -
    -

    Returns number[][]

    An empty 2-dimensional array with 3 empty arrays inside.

    - -
-
-

Static identity

-
    -
  • get identity(): number[][]
    • -
  • -

    The above function returns a 3x3 identity matrix.

    -
    -

    Returns number[][]

    The method is returning a 2-dimensional array of numbers representing the identity matrix.

    - -
-
-

Methods

-
-

toVector

-
    - -
  • -

    The function "toVector" returns a new Vector2D object with the values from the first and second elements of the -_matrix array.

    -
    -

    Returns Vector2D

    A new instance of the Vector2D class is being returned. The values of the returned vector are taken from -the first column of the matrix.

    - -
-
-

Static add

-
    - -
  • -

    The function takes two 2D matrices as input and returns their sum as a new 2D matrix.

    -
    -
    -

    Parameters

    -
      -
    • -
      matrix1: Matrix2D
      -

      Matrix2D - The first matrix to be added.

      -
      -
      • -
    • -
      matrix2: Matrix2D
      -

      The parameter matrix2 is a Matrix2D object.

      -
      -
    -

    Returns Matrix2D

    a new instance of the Matrix2D class, which is created using the result array.

    - -
-
-

Static multiply

-
    - -
  • -

    The function multiplies two 2D matrices and returns the result as a new Matrix2D object.

    -
    -
    -

    Parameters

    -
      -
    • -
      matrix1: Matrix2D
      -

      A 2D matrix represented by the Matrix2D class.

      -
      -
      • -
    • -
      matrix2: Matrix2D
      -

      The parameter matrix2 is a 2D matrix of size 3x3.

      -
      -
    -

    Returns Matrix2D

    a new instance of the Matrix2D class, created using the result array.

    - -
-
-

Static multiplyByValue

-
    - -
  • -

    The function multiplies each element of a 2D matrix by a given value and returns the resulting matrix.

    -
    -
    -

    Parameters

    -
      -
    • -
      matrix: Matrix2D
      -

      The matrix parameter is an instance of the Matrix2D class, which represents a 2D -matrix. It contains a property m that is a 2D array representing the matrix elements.

      -
      -
      • -
    • -
      value: number
      -

      The value parameter is a number that you want to multiply each element of the matrix by.

      -
      -
    -

    Returns Matrix2D

    a new instance of the Matrix2D class, which is created using the result array.

    - -
-
-

Static multiplyByVector

-
    - -
  • -

    The function multiplies a 2D matrix by a 2D vector and returns the result as a 2D vector.

    -
    -
    -

    Parameters

    -
      -
    • -
      matrix: Matrix2D
      -

      The parameter "matrix" is of type Matrix2D. It represents a 2-dimensional matrix.

      -
      -
      • -
    • -
      vector: Vector2D
      -

      The "vector" parameter is a 2D vector, represented by an object of type Vector2D.

      -
      -
    -

    Returns Vector2D

    a Vector2D.

    - -
-
-

Static rotate

-
    - -
  • -

    The function "rotate" takes an angle in radians and returns a 2D transformation matrix for rotating objects.

    -
    -
    -

    Parameters

    -
      -
    • -
      radians: number
      -

      The "radians" parameter is the angle in radians by which you want to rotate an object.

      -
      -
    -

    Returns Matrix2D

    The code is returning a new instance of a Matrix2D object.

    - -
-
-

Static scale

-
    - -
  • -

    The function scales a matrix by a given factor.

    -
    -
    -

    Parameters

    -
      -
    • -
      factor: number
      -

      The factor parameter is a number that represents the scaling factor by which the matrix -should be scaled.

      -
      -
    -

    Returns Matrix2D

    the result of multiplying a new instance of Matrix2D by the given factor.

    - -
-
-

Static subtract

-
    - -
  • -

    The function subtracts two 2D matrices and returns the result as a new Matrix2D object.

    -
    -
    -

    Parameters

    -
      -
    • -
      matrix1: Matrix2D
      -

      Matrix2D - The first matrix to subtract from.

      -
      -
      • -
    • -
      matrix2: Matrix2D
      -

      Matrix2D is a class representing a 2D matrix. It has a property m which is a 2D array -representing the matrix elements.

      -
      -
    -

    Returns Matrix2D

    a new instance of the Matrix2D class, which is created using the result array.

    - -
-
-

Static translate

-
    - -
  • -

    The translate function takes a 2D vector and returns a 2D matrix that represents a translation transformation.

    -
    -
    -

    Parameters

    -
      -
    • -
      vector: Vector2D
      -

      The parameter "vector" is of type Vector2D. It represents a 2D vector with components x -and y, and an optional w component.

      -
      -
    -

    Returns Matrix2D

    The method is returning a new instance of the Matrix2D class.

    - -
-
-

Static view

-
    - -
  • -

    The function returns a 2D matrix that scales and flips a vector around the center of a given width and height.

    -
    -
    -

    Parameters

    -
      -
    • -
      width: number
      -

      The width parameter represents the width of the view or the canvas. It is a number that -specifies the width in pixels or any other unit of measurement.

      -
      -
      • -
    • -
      height: number
      -

      The height parameter represents the height of the view or the canvas. It is used to -calculate the centerY value, which is the vertical center of the view.

      -
      -
    -

    Returns Matrix2D

    a Matrix2D object.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/MatrixNTI2D.html b/docs/classes/MatrixNTI2D.html deleted file mode 100644 index 3a3cbc0..0000000 --- a/docs/classes/MatrixNTI2D.html +++ /dev/null @@ -1,274 +0,0 @@ -MatrixNTI2D | data-structure-typed
-
- -
-
-
-
- -

Class MatrixNTI2D<V>

-
-

data-structure-typed

-
-
-

Author

Tyler Zeng

- -

Copyright

Copyright (c) 2022 Tyler Zeng zrwusa@gmail.com

- -

License

MIT License

-
-
-

Type Parameters

-
    -
  • -

    V = any

-
-

Hierarchy

-
    -
  • MatrixNTI2D
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_matrix -
-
-

Methods

-
toArray -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor creates a matrix with the specified number of rows and columns, and initializes all elements to a -given initial value or 0 if not provided.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      V = any

    -
    -

    Parameters

    -
      -
    • -
      options: {
          col: number;
          initialVal?: V;
          row: number;
      }
      -

      An object containing the following properties:

      -
      -
      -
        -
      • -
        col: number
        • -
      • -
        Optional initialVal?: V
        • -
      • -
        row: number
    -

    Returns MatrixNTI2D<V>

    -
-
-

Properties

-
-

Private Readonly _matrix

-
_matrix: V[][]
-
-

Methods

-
-

toArray

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/MaxHeap.html b/docs/classes/MaxHeap.html deleted file mode 100644 index c584eb8..0000000 --- a/docs/classes/MaxHeap.html +++ /dev/null @@ -1,675 +0,0 @@ -MaxHeap | data-structure-typed
-
- -
-
-
-
- -

Class MaxHeap<V>

-
-

Type Parameters

-
    -
  • -

    V = any

-
-

Hierarchy

-
    -
  • Heap<V> -
      -
    • MaxHeap
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_pq -_priorityExtractor -
-
-

Accessors

-
pq -priorityExtractor -size -
-
-

Methods

-
add -clear -has -isEmpty -peek -peekLast -poll -sort -toArray -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor initializes a PriorityQueue with a custom comparator function.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      V = any

    -
    -

    Parameters

    -
      -
    • -
      Optional options: HeapOptions<V>
      -

      The options parameter is an optional object that can be passed to the constructor. It is of -type HeapOptions<V>, which is a generic type that represents the options for the heap.

      -
      -
    -

    Returns MaxHeap<V>

    -
-
-

Properties

-
-

Protected _pq

-
_pq: PriorityQueue<HeapItem<V>>
-
-

Protected _priorityExtractor

-
_priorityExtractor: ((val) => number)
-
-

Type declaration

-
    -
  • -
      -
    • (val): number
      • -
    • -
      -

      Parameters

      -
        -
      • -
        val: V
      -

      Returns number

-
-

Accessors

-
-

pq

-
-
-

priorityExtractor

-
    -
  • get priorityExtractor(): ((val) => number)
    • -
  • -

    Returns ((val) => number)

    -
      -
    • -
        -
      • (val): number
        • -
      • -
        -

        Parameters

        -
          -
        • -
          val: V
        -

        Returns number

-
-

size

-
    -
  • get size(): number
    • -
  • -

    The function returns the size of a priority queue.

    -
    -

    Returns number

    The size of the priority queue.

    - -
-
-

Methods

-
-

add

-
    - -
  • -

    The add function adds an val to a priority queue with an optional priority value.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional priority: number
      -

      The priority parameter is an optional number that represents the priority of the -val being added to the heap. If the val parameter is a number, then the priority parameter is set to -the value of val. If the val parameter is not a number, then the

      -
      -
      • -
    • -
      Optional val: V
      -

      The val parameter represents the value that you want to add to the heap. It can be of any -type.

      -
      -
    -

    Returns Heap<V>

    The add method returns the instance of the Heap class.

    - -
    -

    Throws

    if priority is not a valid number

    -
-
-

clear

-
-
-

has

-
    - -
  • -

    The function checks if a given node or value exists in the priority queue.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: V | HeapItem<V>
      -

      The parameter node can be of type V or HeapItem<V>.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

isEmpty

-
    - -
  • -

    The function checks if a priority queue is empty.

    -
    -

    Returns boolean

    A boolean value indicating whether the size of the priority queue is less than 1.

    - -
-
-

peek

-
    - -
  • -

    The peek function returns the top item in the priority queue without removing it.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
    -

    Returns undefined | V

    The peek() method is returning either a HeapItem<V> object or null.Returns an val with the highest priority in the queue

    - -
    • - -
  • -

    The peek function returns the top item in the priority queue without removing it.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
    -

    Returns undefined | V

    The peek() method is returning either a HeapItem<V> object or null.Returns an val with the highest priority in the queue

    - -
    • - -
  • -

    The peek function returns the top item in the priority queue without removing it.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
    -

    Returns null | HeapItem<V>

    The peek() method is returning either a HeapItem<V> object or null.Returns an val with the highest priority in the queue

    - -
-
-

peekLast

-
    - -
  • -

    The peekLast function returns the last item in the heap.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
    -

    Returns undefined | V

    The method peekLast() returns either a HeapItem<V> object or null.Returns an val with the lowest priority in the queue

    - -
    • - -
  • -

    The peekLast function returns the last item in the heap.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
    -

    Returns undefined | V

    The method peekLast() returns either a HeapItem<V> object or null.Returns an val with the lowest priority in the queue

    - -
    • - -
  • -

    The peekLast function returns the last item in the heap.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
    -

    Returns null | HeapItem<V>

    The method peekLast() returns either a HeapItem<V> object or null.Returns an val with the lowest priority in the queue

    - -
-
-

poll

-
    - -
  • -

    The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
    -

    Returns undefined | V

    either a HeapItem object or null.

    - -
    • - -
  • -

    The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
    -

    Returns undefined | V

    either a HeapItem object or null.

    - -
    • - -
  • -

    The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
    -

    Returns null | HeapItem<V>

    either a HeapItem object or null.

    - -
-
-

sort

-
    - -
  • -

    The function sorts the elements in the priority queue and returns either the sorted items or their values depending -on the value of the isItem parameter.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
      -

      The isItem parameter is a boolean flag that indicates whether the sorted result should -be an array of HeapItem<V> objects or an array of the values (V) of those objects. If isItem is true, the -sorted result will be an array of HeapItem @returns an array of either HeapItem, null, V, or undefined` values.

      -
      -
    -

    Returns (undefined | V)[]

    -
    • - -
  • -

    The function sorts the elements in the priority queue and returns either the sorted items or their values depending -on the value of the isItem parameter.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
      -

      The isItem parameter is a boolean flag that indicates whether the sorted result should -be an array of HeapItem<V> objects or an array of the values (V) of those objects. If isItem is true, the -sorted result will be an array of HeapItem @returns an array of either HeapItem, null, V, or undefined` values.

      -
      -
    -

    Returns (undefined | V)[]

    -
    • - -
  • -

    The function sorts the elements in the priority queue and returns either the sorted items or their values depending -on the value of the isItem parameter.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
      -

      The isItem parameter is a boolean flag that indicates whether the sorted result should -be an array of HeapItem<V> objects or an array of the values (V) of those objects. If isItem is true, the -sorted result will be an array of HeapItem @returns an array of either HeapItem, null, V, or undefined` values.

      -
      -
    -

    Returns (null | HeapItem<V>)[]

    -
-
-

toArray

-
    - -
  • -

    The toArray function returns an array of HeapItem<V> objects.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
    -

    Returns (undefined | V)[]

    An array of HeapItem objects.Returns a sorted list of vals

    - -
    • - -
  • -

    The toArray function returns an array of HeapItem<V> objects.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
    -

    Returns (undefined | V)[]

    An array of HeapItem objects.Returns a sorted list of vals

    - -
    • - -
  • -

    The toArray function returns an array of HeapItem<V> objects.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
    -

    Returns (null | HeapItem<V>)[]

    An array of HeapItem objects.Returns a sorted list of vals

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/MaxPriorityQueue.html b/docs/classes/MaxPriorityQueue.html deleted file mode 100644 index 380ff9c..0000000 --- a/docs/classes/MaxPriorityQueue.html +++ /dev/null @@ -1,870 +0,0 @@ -MaxPriorityQueue | data-structure-typed
-
- -
-
-
-
- -

Class MaxPriorityQueue<E>

-
-

Type Parameters

-
    -
  • -

    E = any

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_comparator -_nodes -
-
-

Accessors

-
nodes -size -
-
-

Methods

-
DFS -_compare -_fix -_getComparedChild -_getLeft -_getParent -_getRight -_heapifyDown -_heapifyUp -_isValidIndex -_setNodes -_swap -add -clear -clone -getNodes -has -isEmpty -isValid -leaf -peek -poll -sort -toArray -heapify -isPriorityQueueified -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Protected Readonly _comparator

-
_comparator: PriorityQueueComparator<E> = ...
-
-

Protected _nodes

-
_nodes: E[] = []
-
-

Accessors

-
-

nodes

-
-
-

size

-
-
-

Methods

-
-

DFS

-
    - -
  • -

    The DFS function performs a depth-first search traversal on a binary tree and returns an array of visited nodes -based on the specified traversal order.

    -
    -
    -

    Parameters

    -
      -
    • -
      dfsMode: PriorityQueueDFSOrderPattern
      -

      The dfsMode parameter is a string that specifies the order in which -the nodes should be visited during the Depth-First Search (DFS) traversal. It can have one of the following values:

      -
      -
    -

    Returns (null | E)[]

    an array of type (E | null)[].

    - -
-
-

Protected _compare

-
    -
  • _compare(a, b): boolean
    • -
  • -

    The function compares two numbers using a custom comparator function.

    -
    -
    -

    Parameters

    -
      -
    • -
      a: number
      -

      The parameter "a" is a number that represents the index of a node in an array.

      -
      -
      • -
    • -
      b: number
      -

      The parameter "b" is a number.

      -
      -
    -

    Returns boolean

    the result of the comparison between the elements at indices a and b in the nodes array. The -comparison is done using the _comparator function, and if the result is greater than 0, true is returned, -indicating that the element at index a is greater than the element at index b.

    - -
-
-

Protected _fix

-
-
-

Protected _getComparedChild

-
    -
  • _getComparedChild(parent): number
    • -
  • -

    The function returns the index of the smallest child node of a given parent node.

    -
    -
    -

    Parameters

    -
      -
    • -
      parent: number
      -

      The parent parameter is a number that represents the index of the parent node in a binary -tree.

      -
      -
    -

    Returns number

    the minimum value between the parent node and its left and right child nodes.

    - -
-
-

Protected _getLeft

-
    -
  • _getLeft(parent): number
    • -
  • -

    The function returns the index of the left child node in a binary tree given the index of its parent node.

    -
    -
    -

    Parameters

    -
      -
    • -
      parent: number
      -

      The parameter "parent" is a number that represents the index of a node in a binary tree.

      -
      -
    -

    Returns number

    the left child of a given parent node in a binary tree.

    - -
-
-

Protected _getParent

-
    -
  • _getParent(child): number
    • -
  • -

    The function returns the index of the parent node given the index of a child node in a binary tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      child: number
      -

      The "child" parameter is a number representing the index of a child node in a binary tree.

      -
      -
    -

    Returns number

    the parent of the given child node.

    - -
-
-

Protected _getRight

-
    -
  • _getRight(parent): number
    • -
  • -

    The function returns the index of the right child node in a binary tree given the index of its parent node.

    -
    -
    -

    Parameters

    -
      -
    • -
      parent: number
      -

      The parameter "parent" is a number that represents the index of a node in a binary tree.

      -
      -
    -

    Returns number

    the right child of a given parent node in a binary tree.

    - -
-
-

Protected _heapifyDown

-
    -
  • _heapifyDown(start): void
    • -
  • -

    The function performs a heapify operation by comparing and swapping elements in a binary heap.

    -
    -
    -

    Parameters

    -
      -
    • -
      start: number
      -

      The start parameter is the index of the element in the heap from where the heapifyDown -operation should start.

      -
      -
    -

    Returns void

    -
-
-

Protected _heapifyUp

-
    -
  • _heapifyUp(start): void
    • -
  • -

    The function _heapifyUp is used to maintain the heap property by moving an element up the heap until it is in the -correct position.

    -
    -
    -

    Parameters

    -
      -
    • -
      start: number
      -

      The start parameter is the index of the element that needs to be moved up in the heap.

      -
      -
    -

    Returns void

    -
-
-

Protected _isValidIndex

-
    -
  • _isValidIndex(index): boolean
    • -
  • -

    The function checks if a given index is valid within an array.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The parameter "index" is of type number and represents the index value that needs to be -checked for validity.

      -
      -
    -

    Returns boolean

    A boolean value indicating whether the given index is valid or not.

    - -
-
-

Protected _setNodes

-
-
-

Protected _swap

-
-
-

add

-
    - -
  • -

    The "add" function adds a node to the heap and ensures that the heap property is maintained.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: E
      -

      The parameter "node" is of type E, which means it can be any data type. It represents the node -that needs to be added to the heap.

      -
      -
    -

    Returns void

    -
-
-

clear

-
-
-

clone

-
-
-

getNodes

-
    - -
  • -

    Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.

    -
    -

    Returns E[]

    -
-
-

has

-
    - -
  • -

    The "has" function checks if a given node is present in the list of nodes.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: E
      -

      The parameter node is of type E, which means it can be any type. It represents the node that -we want to check if it exists in the nodes array.

      -
      -
    -

    Returns boolean

    a boolean value indicating whether the given node is included in the array of nodes.

    - -
-
-

isEmpty

-
    - -
  • -

    The function checks if the size of an object is equal to zero and returns a boolean value indicating whether the -object is empty or not.

    -
    -

    Returns boolean

    The method isEmpty() is returning a boolean value indicating whether the size of the object is equal to -0.

    - -
-
-

isValid

-
-
-

leaf

-
    - -
  • -

    The leaf function returns the last element in the nodes array or null if the array is empty.

    -
    -

    Returns null | E

    The method leaf() is returning the last element (E) in the nodes array if it exists. If the array is -empty or the last element is null, then it returns null.

    - -
-
-

peek

-
    - -
  • -

    The peek function returns the first element of the nodes array if it exists, otherwise it returns null.

    -
    -

    Returns null | E

    The peek() function is returning the first element (E) of the nodes array if the size is not zero. -Otherwise, it returns null.

    - -
-
-

poll

-
-
-

sort

-
-
-

toArray

-
-
-

Static heapify

-
-
-

Static isPriorityQueueified

-
    - -
  • -

    The function checks if a priority queue is valid by creating a new priority queue with a fix option and then calling -the isValid method.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      E

    -
    -

    Parameters

    -
      -
    • -
      options: Omit<PriorityQueueOptions<E>, "isFix">
      -

      An object containing options for creating a priority queue. The options object should have the -following properties:

      -
      -
    -

    Returns boolean

    the result of calling the isValid() method on a new instance of the PriorityQueue class.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/MinHeap.html b/docs/classes/MinHeap.html deleted file mode 100644 index 95ad6b3..0000000 --- a/docs/classes/MinHeap.html +++ /dev/null @@ -1,676 +0,0 @@ -MinHeap | data-structure-typed
-
- -
-
-
-
- -

Class MinHeap<V>

-
-

Type Parameters

-
    -
  • -

    V = any

-
-

Hierarchy

-
    -
  • Heap<V> -
      -
    • MinHeap
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_pq -_priorityExtractor -
-
-

Accessors

-
pq -priorityExtractor -size -
-
-

Methods

-
add -clear -has -isEmpty -peek -peekLast -poll -sort -toArray -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor initializes a PriorityQueue with a comparator function that compares the priority of two HeapItem -objects.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      V = any

    -
    -

    Parameters

    -
      -
    • -
      Optional options: HeapOptions<V>
      -

      The options parameter is an optional object that can be passed to the constructor. It is of -type HeapOptions<V>, which is a generic type that represents the options for the heap.

      -
      -
    -

    Returns MinHeap<V>

    -
-
-

Properties

-
-

Protected _pq

-
_pq: PriorityQueue<HeapItem<V>>
-
-

Protected _priorityExtractor

-
_priorityExtractor: ((val) => number)
-
-

Type declaration

-
    -
  • -
      -
    • (val): number
      • -
    • -
      -

      Parameters

      -
        -
      • -
        val: V
      -

      Returns number

-
-

Accessors

-
-

pq

-
-
-

priorityExtractor

-
    -
  • get priorityExtractor(): ((val) => number)
    • -
  • -

    Returns ((val) => number)

    -
      -
    • -
        -
      • (val): number
        • -
      • -
        -

        Parameters

        -
          -
        • -
          val: V
        -

        Returns number

-
-

size

-
    -
  • get size(): number
    • -
  • -

    The function returns the size of a priority queue.

    -
    -

    Returns number

    The size of the priority queue.

    - -
-
-

Methods

-
-

add

-
    - -
  • -

    The add function adds an val to a priority queue with an optional priority value.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional priority: number
      -

      The priority parameter is an optional number that represents the priority of the -val being added to the heap. If the val parameter is a number, then the priority parameter is set to -the value of val. If the val parameter is not a number, then the

      -
      -
      • -
    • -
      Optional val: V
      -

      The val parameter represents the value that you want to add to the heap. It can be of any -type.

      -
      -
    -

    Returns Heap<V>

    The add method returns the instance of the Heap class.

    - -
    -

    Throws

    if priority is not a valid number

    -
-
-

clear

-
-
-

has

-
    - -
  • -

    The function checks if a given node or value exists in the priority queue.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: V | HeapItem<V>
      -

      The parameter node can be of type V or HeapItem<V>.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

isEmpty

-
    - -
  • -

    The function checks if a priority queue is empty.

    -
    -

    Returns boolean

    A boolean value indicating whether the size of the priority queue is less than 1.

    - -
-
-

peek

-
    - -
  • -

    The peek function returns the top item in the priority queue without removing it.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
    -

    Returns undefined | V

    The peek() method is returning either a HeapItem<V> object or null.Returns an val with the highest priority in the queue

    - -
    • - -
  • -

    The peek function returns the top item in the priority queue without removing it.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
    -

    Returns undefined | V

    The peek() method is returning either a HeapItem<V> object or null.Returns an val with the highest priority in the queue

    - -
    • - -
  • -

    The peek function returns the top item in the priority queue without removing it.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
    -

    Returns null | HeapItem<V>

    The peek() method is returning either a HeapItem<V> object or null.Returns an val with the highest priority in the queue

    - -
-
-

peekLast

-
    - -
  • -

    The peekLast function returns the last item in the heap.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
    -

    Returns undefined | V

    The method peekLast() returns either a HeapItem<V> object or null.Returns an val with the lowest priority in the queue

    - -
    • - -
  • -

    The peekLast function returns the last item in the heap.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
    -

    Returns undefined | V

    The method peekLast() returns either a HeapItem<V> object or null.Returns an val with the lowest priority in the queue

    - -
    • - -
  • -

    The peekLast function returns the last item in the heap.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
    -

    Returns null | HeapItem<V>

    The method peekLast() returns either a HeapItem<V> object or null.Returns an val with the lowest priority in the queue

    - -
-
-

poll

-
    - -
  • -

    The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
    -

    Returns undefined | V

    either a HeapItem object or null.

    - -
    • - -
  • -

    The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
    -

    Returns undefined | V

    either a HeapItem object or null.

    - -
    • - -
  • -

    The poll function returns the top item from a priority queue or null if the queue is empty.Removes and returns an val with the highest priority in the queue

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
    -

    Returns null | HeapItem<V>

    either a HeapItem object or null.

    - -
-
-

sort

-
    - -
  • -

    The function sorts the elements in the priority queue and returns either the sorted items or their values depending -on the value of the isItem parameter.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
      -

      The isItem parameter is a boolean flag that indicates whether the sorted result should -be an array of HeapItem<V> objects or an array of the values (V) of those objects. If isItem is true, the -sorted result will be an array of HeapItem @returns an array of either HeapItem, null, V, or undefined` values.

      -
      -
    -

    Returns (undefined | V)[]

    -
    • - -
  • -

    The function sorts the elements in the priority queue and returns either the sorted items or their values depending -on the value of the isItem parameter.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
      -

      The isItem parameter is a boolean flag that indicates whether the sorted result should -be an array of HeapItem<V> objects or an array of the values (V) of those objects. If isItem is true, the -sorted result will be an array of HeapItem @returns an array of either HeapItem, null, V, or undefined` values.

      -
      -
    -

    Returns (undefined | V)[]

    -
    • - -
  • -

    The function sorts the elements in the priority queue and returns either the sorted items or their values depending -on the value of the isItem parameter.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
      -

      The isItem parameter is a boolean flag that indicates whether the sorted result should -be an array of HeapItem<V> objects or an array of the values (V) of those objects. If isItem is true, the -sorted result will be an array of HeapItem @returns an array of either HeapItem, null, V, or undefined` values.

      -
      -
    -

    Returns (null | HeapItem<V>)[]

    -
-
-

toArray

-
    - -
  • -

    The toArray function returns an array of HeapItem<V> objects.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional isItem: undefined
    -

    Returns (undefined | V)[]

    An array of HeapItem objects.Returns a sorted list of vals

    - -
    • - -
  • -

    The toArray function returns an array of HeapItem<V> objects.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: false
    -

    Returns (undefined | V)[]

    An array of HeapItem objects.Returns a sorted list of vals

    - -
    • - -
  • -

    The toArray function returns an array of HeapItem<V> objects.

    -
    -
    -

    Parameters

    -
      -
    • -
      isItem: true
    -

    Returns (null | HeapItem<V>)[]

    An array of HeapItem objects.Returns a sorted list of vals

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/MinPriorityQueue.html b/docs/classes/MinPriorityQueue.html deleted file mode 100644 index 672f3b6..0000000 --- a/docs/classes/MinPriorityQueue.html +++ /dev/null @@ -1,872 +0,0 @@ -MinPriorityQueue | data-structure-typed
-
- -
-
-
-
- -

Class MinPriorityQueue<E>

-
-

Type Parameters

-
    -
  • -

    E = any

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_comparator -_nodes -
-
-

Accessors

-
nodes -size -
-
-

Methods

-
DFS -_compare -_fix -_getComparedChild -_getLeft -_getParent -_getRight -_heapifyDown -_heapifyUp -_isValidIndex -_setNodes -_swap -add -clear -clone -getNodes -has -isEmpty -isValid -leaf -peek -poll -sort -toArray -heapify -isPriorityQueueified -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Protected Readonly _comparator

-
_comparator: PriorityQueueComparator<E> = ...
-
-

Protected _nodes

-
_nodes: E[] = []
-
-

Accessors

-
-

nodes

-
-
-

size

-
-
-

Methods

-
-

DFS

-
    - -
  • -

    The DFS function performs a depth-first search traversal on a binary tree and returns an array of visited nodes -based on the specified traversal order.

    -
    -
    -

    Parameters

    -
      -
    • -
      dfsMode: PriorityQueueDFSOrderPattern
      -

      The dfsMode parameter is a string that specifies the order in which -the nodes should be visited during the Depth-First Search (DFS) traversal. It can have one of the following values:

      -
      -
    -

    Returns (null | E)[]

    an array of type (E | null)[].

    - -
-
-

Protected _compare

-
    -
  • _compare(a, b): boolean
    • -
  • -

    The function compares two numbers using a custom comparator function.

    -
    -
    -

    Parameters

    -
      -
    • -
      a: number
      -

      The parameter "a" is a number that represents the index of a node in an array.

      -
      -
      • -
    • -
      b: number
      -

      The parameter "b" is a number.

      -
      -
    -

    Returns boolean

    the result of the comparison between the elements at indices a and b in the nodes array. The -comparison is done using the _comparator function, and if the result is greater than 0, true is returned, -indicating that the element at index a is greater than the element at index b.

    - -
-
-

Protected _fix

-
-
-

Protected _getComparedChild

-
    -
  • _getComparedChild(parent): number
    • -
  • -

    The function returns the index of the smallest child node of a given parent node.

    -
    -
    -

    Parameters

    -
      -
    • -
      parent: number
      -

      The parent parameter is a number that represents the index of the parent node in a binary -tree.

      -
      -
    -

    Returns number

    the minimum value between the parent node and its left and right child nodes.

    - -
-
-

Protected _getLeft

-
    -
  • _getLeft(parent): number
    • -
  • -

    The function returns the index of the left child node in a binary tree given the index of its parent node.

    -
    -
    -

    Parameters

    -
      -
    • -
      parent: number
      -

      The parameter "parent" is a number that represents the index of a node in a binary tree.

      -
      -
    -

    Returns number

    the left child of a given parent node in a binary tree.

    - -
-
-

Protected _getParent

-
    -
  • _getParent(child): number
    • -
  • -

    The function returns the index of the parent node given the index of a child node in a binary tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      child: number
      -

      The "child" parameter is a number representing the index of a child node in a binary tree.

      -
      -
    -

    Returns number

    the parent of the given child node.

    - -
-
-

Protected _getRight

-
    -
  • _getRight(parent): number
    • -
  • -

    The function returns the index of the right child node in a binary tree given the index of its parent node.

    -
    -
    -

    Parameters

    -
      -
    • -
      parent: number
      -

      The parameter "parent" is a number that represents the index of a node in a binary tree.

      -
      -
    -

    Returns number

    the right child of a given parent node in a binary tree.

    - -
-
-

Protected _heapifyDown

-
    -
  • _heapifyDown(start): void
    • -
  • -

    The function performs a heapify operation by comparing and swapping elements in a binary heap.

    -
    -
    -

    Parameters

    -
      -
    • -
      start: number
      -

      The start parameter is the index of the element in the heap from where the heapifyDown -operation should start.

      -
      -
    -

    Returns void

    -
-
-

Protected _heapifyUp

-
    -
  • _heapifyUp(start): void
    • -
  • -

    The function _heapifyUp is used to maintain the heap property by moving an element up the heap until it is in the -correct position.

    -
    -
    -

    Parameters

    -
      -
    • -
      start: number
      -

      The start parameter is the index of the element that needs to be moved up in the heap.

      -
      -
    -

    Returns void

    -
-
-

Protected _isValidIndex

-
    -
  • _isValidIndex(index): boolean
    • -
  • -

    The function checks if a given index is valid within an array.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The parameter "index" is of type number and represents the index value that needs to be -checked for validity.

      -
      -
    -

    Returns boolean

    A boolean value indicating whether the given index is valid or not.

    - -
-
-

Protected _setNodes

-
-
-

Protected _swap

-
-
-

add

-
    - -
  • -

    The "add" function adds a node to the heap and ensures that the heap property is maintained.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: E
      -

      The parameter "node" is of type E, which means it can be any data type. It represents the node -that needs to be added to the heap.

      -
      -
    -

    Returns void

    -
-
-

clear

-
-
-

clone

-
-
-

getNodes

-
    - -
  • -

    Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.

    -
    -

    Returns E[]

    -
-
-

has

-
    - -
  • -

    The "has" function checks if a given node is present in the list of nodes.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: E
      -

      The parameter node is of type E, which means it can be any type. It represents the node that -we want to check if it exists in the nodes array.

      -
      -
    -

    Returns boolean

    a boolean value indicating whether the given node is included in the array of nodes.

    - -
-
-

isEmpty

-
    - -
  • -

    The function checks if the size of an object is equal to zero and returns a boolean value indicating whether the -object is empty or not.

    -
    -

    Returns boolean

    The method isEmpty() is returning a boolean value indicating whether the size of the object is equal to -0.

    - -
-
-

isValid

-
-
-

leaf

-
    - -
  • -

    The leaf function returns the last element in the nodes array or null if the array is empty.

    -
    -

    Returns null | E

    The method leaf() is returning the last element (E) in the nodes array if it exists. If the array is -empty or the last element is null, then it returns null.

    - -
-
-

peek

-
    - -
  • -

    The peek function returns the first element of the nodes array if it exists, otherwise it returns null.

    -
    -

    Returns null | E

    The peek() function is returning the first element (E) of the nodes array if the size is not zero. -Otherwise, it returns null.

    - -
-
-

poll

-
-
-

sort

-
-
-

toArray

-
-
-

Static heapify

-
    - -
  • -

    The function heapify creates a new MinPriorityQueue instance and sets the comparator function based on the options -provided, and then fixes the heap structure of the queue.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      E extends number

    -
    -

    Parameters

    -
      -
    • -
      Optional options: Omit<PriorityQueueOptions<E>, "comparator">
      -

      The options parameter is an object that contains configuration options for creating a priority -queue. It can have the following properties:

      -
      -
    -

    Returns MinPriorityQueue<E>

    a MinPriorityQueue object.

    - -
    • - -
  • -

    The function heapify creates a new MinPriorityQueue instance and sets the comparator function based on the options -provided, and then fixes the heap structure of the queue.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      E

    -
    -

    Parameters

    -
      -
    • -
      options: PriorityQueueOptions<E>
      -

      The options parameter is an object that contains configuration options for creating a priority -queue. It can have the following properties:

      -
      -
    -

    Returns MinPriorityQueue<E>

    a MinPriorityQueue object.

    - -
-
-

Static isPriorityQueueified

-
    - -
  • -

    The function checks if a priority queue is valid by creating a new priority queue with a fix option and then calling -the isValid method.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      E

    -
    -

    Parameters

    -
      -
    • -
      options: Omit<PriorityQueueOptions<E>, "isFix">
      -

      An object containing options for creating a priority queue. The options object should have the -following properties:

      -
      -
    -

    Returns boolean

    the result of calling the isValid() method on a new instance of the PriorityQueue class.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/Navigator.html b/docs/classes/Navigator.html deleted file mode 100644 index 8526909..0000000 --- a/docs/classes/Navigator.html +++ /dev/null @@ -1,347 +0,0 @@ -Navigator | data-structure-typed
-
- -
-
-
-
- -

Class Navigator<T>

-
-

Type Parameters

-
    -
  • -

    T = number

-
-

Hierarchy

-
    -
  • Navigator
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_VISITED -_character -_cur -_matrix -onMove -
-
-

Methods

-
check -move -start -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor initializes the Navigator object with the given parameters and sets the current position as visited -in the matrix.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      T = number

    -
    -

    Parameters

    -
      -
    • -
      -: NavigatorParams<T>
      -

      matrix: a 2D array representing the grid or map

      -
      -
    -

    Returns Navigator<T>

    -
-
-

Properties

-
-

Private Readonly _VISITED

-
_VISITED: T
-
-

Private _character

-
_character: Character
-
-

Private Readonly _cur

-
_cur: [number, number]
-
-

Private Readonly _matrix

-
_matrix: T[][]
-
-

onMove

-
onMove: ((cur) => void)
-
-

Type declaration

-
    -
  • -
      -
    • (cur): void
      • -
    • -
      -

      Parameters

      -
        -
      • -
        cur: [number, number]
      -

      Returns void

-
-

Methods

-
-

check

-
    - -
  • -

    The function checks if there is a valid move in the specified direction in a matrix.

    -
    -
    -

    Parameters

    -
      -
    • -
      direction: Direction
      -

      The direction parameter is a string that represents the direction in which to check. -It can be one of the following values: 'up', 'right', 'down', or 'left'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

move

-
    - -
  • -

    The move function updates the current position based on the given direction and updates the matrix accordingly.

    -
    -
    -

    Parameters

    -
      -
    • -
      direction: Direction
      -

      The direction parameter is a string that represents the direction in which to move. -It can have one of the following values: 'up', 'right', 'down', or 'left'.

      -
      -
    -

    Returns void

    -
-
-

start

-
    - -
  • -

    The "start" function moves the character in its current direction until it encounters an obstacle, then it turns the -character and repeats the process.

    -
    -

    Returns void

    -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/ObjectDeque.html b/docs/classes/ObjectDeque.html deleted file mode 100644 index 5e15154..0000000 --- a/docs/classes/ObjectDeque.html +++ /dev/null @@ -1,531 +0,0 @@ -ObjectDeque | data-structure-typed
-
- -
-
-
-
- -

Class ObjectDeque<E>

-
-

Type Parameters

-
    -
  • -

    E = number

-
-

Hierarchy

-
    -
  • ObjectDeque
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_capacity -_first -_last -_nodes -_size -
-
-

Accessors

-
capacity -first -last -nodes -size -
-
-

Methods

-
_seNodes -_setSize -addFirst -addLast -get -isEmpty -peekFirst -peekLast -pollFirst -pollLast -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Private _capacity

-
_capacity: number = Number.MAX_SAFE_INTEGER
-
-

Private _first

-
_first: number = -1
-
-

Private _last

-
_last: number = -1
-
-

Private _nodes

-
_nodes: {
    [key: number]: E;
} = {}
-
-

Type declaration

-
    -
  • -
    [key: number]: E
-
-

Private _size

-
_size: number = 0
-
-

Accessors

-
-

capacity

-
-
-

first

-
-
-

last

-
-
-

nodes

-
-
-

size

-
-
-

Methods

-
-

Protected _seNodes

-
-
-

Protected _setSize

-
-
-

addFirst

-
    - -
  • -

    The "addFirst" function adds a value to the beginning of an array-like data structure.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: E
      -

      The value parameter represents the value that you want to add to the beginning of the data -structure.

      -
      -
    -

    Returns void

    -
-
-

addLast

-
    - -
  • -

    The addLast function adds a value to the end of an array-like data structure.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: E
      -

      The value parameter represents the value that you want to add to the end of the data structure.

      -
      -
    -

    Returns void

    -
-
-

get

-
    - -
  • -

    The get function returns the element at the specified index in an array-like data structure.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter is a number that represents the position of the element you want to -retrieve from the array.

      -
      -
    -

    Returns null | NonNullable<E>

    The element at the specified index in the _nodes array is being returned. If there is no element at that -index, null is returned.

    - -
-
-

isEmpty

-
    - -
  • -

    The function checks if the size of a data structure is less than or equal to zero.

    -
    -

    Returns boolean

    The method is returning a boolean value indicating whether the size of the object is less than or equal to 0.

    - -
-
-

peekFirst

-
    - -
  • -

    The peekFirst function returns the first element in an array-like data structure if it exists.

    -
    -

    Returns undefined | E

    The element at the first position of the _nodes array.

    - -
-
-

peekLast

-
    - -
  • -

    The peekLast() function returns the last element in an array-like data structure.

    -
    -

    Returns undefined | E

    The last element in the array "_nodes" is being returned.

    - -
-
-

pollFirst

-
    - -
  • -

    The function pollFirst() removes and returns the first element in a data structure.

    -
    -

    Returns undefined | E

    The value of the first element in the data structure.

    - -
-
-

pollLast

-
    - -
  • -

    The pollLast() function removes and returns the last element in a data structure.

    -
    -

    Returns undefined | E

    The value that was removed from the data structure.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/Pair.html b/docs/classes/Pair.html deleted file mode 100644 index fa8eb5b..0000000 --- a/docs/classes/Pair.html +++ /dev/null @@ -1,206 +0,0 @@ -Pair | data-structure-typed
-
- -
-
-
-
- -

Class Pair

-
-

Hierarchy

-
    -
  • Pair
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Constructors

-
-

constructor

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/PriorityQueue.html b/docs/classes/PriorityQueue.html deleted file mode 100644 index 93cdca3..0000000 --- a/docs/classes/PriorityQueue.html +++ /dev/null @@ -1,794 +0,0 @@ -PriorityQueue | data-structure-typed
-
- -
-
-
-
- -

Class PriorityQueue<E>

-
-

Type Parameters

-
    -
  • -

    E = any

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_comparator -_nodes -
-
-

Accessors

-
nodes -size -
-
-

Methods

-
DFS -_compare -_fix -_getComparedChild -_getLeft -_getParent -_getRight -_heapifyDown -_heapifyUp -_isValidIndex -_setNodes -_swap -add -clear -clone -getNodes -has -isEmpty -isValid -leaf -peek -poll -sort -toArray -heapify -isPriorityQueueified -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Protected Readonly _comparator

-
_comparator: PriorityQueueComparator<E> = ...
-
-

Protected _nodes

-
_nodes: E[] = []
-
-

Accessors

-
-

nodes

-
-
-

size

-
-
-

Methods

-
-

DFS

-
    - -
  • -

    The DFS function performs a depth-first search traversal on a binary tree and returns an array of visited nodes -based on the specified traversal order.

    -
    -
    -

    Parameters

    -
      -
    • -
      dfsMode: PriorityQueueDFSOrderPattern
      -

      The dfsMode parameter is a string that specifies the order in which -the nodes should be visited during the Depth-First Search (DFS) traversal. It can have one of the following values:

      -
      -
    -

    Returns (null | E)[]

    an array of type (E | null)[].

    - -
-
-

Protected _compare

-
    -
  • _compare(a, b): boolean
    • -
  • -

    The function compares two numbers using a custom comparator function.

    -
    -
    -

    Parameters

    -
      -
    • -
      a: number
      -

      The parameter "a" is a number that represents the index of a node in an array.

      -
      -
      • -
    • -
      b: number
      -

      The parameter "b" is a number.

      -
      -
    -

    Returns boolean

    the result of the comparison between the elements at indices a and b in the nodes array. The -comparison is done using the _comparator function, and if the result is greater than 0, true is returned, -indicating that the element at index a is greater than the element at index b.

    - -
-
-

Protected _fix

-
-
-

Protected _getComparedChild

-
    -
  • _getComparedChild(parent): number
    • -
  • -

    The function returns the index of the smallest child node of a given parent node.

    -
    -
    -

    Parameters

    -
      -
    • -
      parent: number
      -

      The parent parameter is a number that represents the index of the parent node in a binary -tree.

      -
      -
    -

    Returns number

    the minimum value between the parent node and its left and right child nodes.

    - -
-
-

Protected _getLeft

-
    -
  • _getLeft(parent): number
    • -
  • -

    The function returns the index of the left child node in a binary tree given the index of its parent node.

    -
    -
    -

    Parameters

    -
      -
    • -
      parent: number
      -

      The parameter "parent" is a number that represents the index of a node in a binary tree.

      -
      -
    -

    Returns number

    the left child of a given parent node in a binary tree.

    - -
-
-

Protected _getParent

-
    -
  • _getParent(child): number
    • -
  • -

    The function returns the index of the parent node given the index of a child node in a binary tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      child: number
      -

      The "child" parameter is a number representing the index of a child node in a binary tree.

      -
      -
    -

    Returns number

    the parent of the given child node.

    - -
-
-

Protected _getRight

-
    -
  • _getRight(parent): number
    • -
  • -

    The function returns the index of the right child node in a binary tree given the index of its parent node.

    -
    -
    -

    Parameters

    -
      -
    • -
      parent: number
      -

      The parameter "parent" is a number that represents the index of a node in a binary tree.

      -
      -
    -

    Returns number

    the right child of a given parent node in a binary tree.

    - -
-
-

Protected _heapifyDown

-
    -
  • _heapifyDown(start): void
    • -
  • -

    The function performs a heapify operation by comparing and swapping elements in a binary heap.

    -
    -
    -

    Parameters

    -
      -
    • -
      start: number
      -

      The start parameter is the index of the element in the heap from where the heapifyDown -operation should start.

      -
      -
    -

    Returns void

    -
-
-

Protected _heapifyUp

-
    -
  • _heapifyUp(start): void
    • -
  • -

    The function _heapifyUp is used to maintain the heap property by moving an element up the heap until it is in the -correct position.

    -
    -
    -

    Parameters

    -
      -
    • -
      start: number
      -

      The start parameter is the index of the element that needs to be moved up in the heap.

      -
      -
    -

    Returns void

    -
-
-

Protected _isValidIndex

-
    -
  • _isValidIndex(index): boolean
    • -
  • -

    The function checks if a given index is valid within an array.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The parameter "index" is of type number and represents the index value that needs to be -checked for validity.

      -
      -
    -

    Returns boolean

    A boolean value indicating whether the given index is valid or not.

    - -
-
-

Protected _setNodes

-
-
-

Protected _swap

-
    -
  • _swap(a, b): void
    • -
  • -

    The function swaps two elements in an array.

    -
    -
    -

    Parameters

    -
      -
    • -
      a: number
      -

      The parameter "a" is a number that represents the index of an element in an array.

      -
      -
      • -
    • -
      b: number
      -

      The parameter "b" is a number.

      -
      -
    -

    Returns void

    -
-
-

add

-
    - -
  • -

    The "add" function adds a node to the heap and ensures that the heap property is maintained.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: E
      -

      The parameter "node" is of type E, which means it can be any data type. It represents the node -that needs to be added to the heap.

      -
      -
    -

    Returns void

    -
-
-

clear

-
-
-

clone

-
    - -
  • -

    The clone function returns a new instance of the PriorityQueue class with the same nodes and comparator as the -original instance.

    -
    -

    Returns PriorityQueue<E>

    The clone() method is returning a new instance of the PriorityQueue class with the same nodes and -comparator properties as the original instance.

    - -
-
-

getNodes

-
    - -
  • -

    Starting from TypeScript version 5.0 and onwards, the use of distinct access modifiers for Getters and Setters is not permitted. As an alternative, to ensure compatibility, it is necessary to adopt a Java-style approach for Setters (using the same name as the property) while utilizing separate method names for Getters.

    -
    -

    Returns E[]

    -
-
-

has

-
    - -
  • -

    The "has" function checks if a given node is present in the list of nodes.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: E
      -

      The parameter node is of type E, which means it can be any type. It represents the node that -we want to check if it exists in the nodes array.

      -
      -
    -

    Returns boolean

    a boolean value indicating whether the given node is included in the array of nodes.

    - -
-
-

isEmpty

-
    - -
  • -

    The function checks if the size of an object is equal to zero and returns a boolean value indicating whether the -object is empty or not.

    -
    -

    Returns boolean

    The method isEmpty() is returning a boolean value indicating whether the size of the object is equal to -0.

    - -
-
-

isValid

-
-
-

leaf

-
    - -
  • -

    The leaf function returns the last element in the nodes array or null if the array is empty.

    -
    -

    Returns null | E

    The method leaf() is returning the last element (E) in the nodes array if it exists. If the array is -empty or the last element is null, then it returns null.

    - -
-
-

peek

-
    - -
  • -

    The peek function returns the first element of the nodes array if it exists, otherwise it returns null.

    -
    -

    Returns null | E

    The peek() function is returning the first element (E) of the nodes array if the size is not zero. -Otherwise, it returns null.

    - -
-
-

poll

-
-
-

sort

-
    - -
  • -

    The function sorts the elements in a data structure and returns them in an array. -Plan to support sorting of duplicate elements.

    -
    -

    Returns E[]

    The sort() method is returning an array of type E[].

    - -
-
-

toArray

-
-
-

Static heapify

-
    - -
  • -

    The heapify function creates a new PriorityQueue instance and fixes the heap property.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      E

    -
    -

    Parameters

    -
      -
    • -
      options: PriorityQueueOptions<E>
      -

      The "options" parameter is an object that contains the configuration options for the PriorityQueue. -It can include properties such as "comparator" which specifies the comparison function used to order the elements in -the priority queue, and "initialValues" which is an array of initial values to be added to the priority

      -
      -
    -

    Returns PriorityQueue<E>

    a new instance of the PriorityQueue class after performing the heapify operation on it.

    - -
-
-

Static isPriorityQueueified

-
    - -
  • -

    The function checks if a priority queue is valid by creating a new priority queue with a fix option and then calling -the isValid method.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      E

    -
    -

    Parameters

    -
      -
    • -
      options: Omit<PriorityQueueOptions<E>, "isFix">
      -

      An object containing options for creating a priority queue. The options object should have the -following properties:

      -
      -
    -

    Returns boolean

    the result of calling the isValid() method on a new instance of the PriorityQueue class.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/Queue.html b/docs/classes/Queue.html deleted file mode 100644 index 5bea3c1..0000000 --- a/docs/classes/Queue.html +++ /dev/null @@ -1,525 +0,0 @@ -Queue | data-structure-typed
-
- -
-
-
-
- -

Class Queue<E>

-
-

Type Parameters

-
    -
  • -

    E = any

-
-

Hierarchy

-
    -
  • Queue
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_nodes -_offset -
-
-

Accessors

-
nodes -offset -size -
-
-

Methods

-
[iterator] -clear -clone -dequeue -enqueue -getAt -isEmpty -peek -peekLast -push -shift -toArray -fromArray -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor initializes an instance of a class with an optional array of elements and sets the offset to 0.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      E = any

    -
    -

    Parameters

    -
      -
    • -
      Optional elements: E[]
      -

      The elements parameter is an optional array of elements of type E. If provided, it -will be used to initialize the _nodes property of the class. If not provided, the _nodes property will be -initialized as an empty array.

      -
      -
    -

    Returns Queue<E>

    -
-
-

Properties

-
-

Private _nodes

-
_nodes: E[]
-
-

Private _offset

-
_offset: number
-
-

Accessors

-
-

nodes

-
-
-

offset

-
-
-

size

-
    -
  • get size(): number
    • -
  • -

    The size function returns the number of elements in an array.

    -
    -

    Returns number

    The size of the array, which is the difference between the length of the array and the offset.

    - -
-
-

Methods

-
-

[iterator]

-
-
-

clear

-
-
-

clone

-
    - -
  • -

    The clone() function returns a new Queue object with the same elements as the original Queue.

    -
    -

    Returns Queue<E>

    The clone() method is returning a new instance of the Queue class.

    - -
-
-

dequeue

-
    - -
  • -

    The dequeue function removes and returns the first element from a queue, or returns null if the queue is empty.

    -
    -

    Returns undefined | E

    The method is returning a value of type E or null.

    - -
-
-

enqueue

-
    - -
  • -

    The enqueue function adds a value to the end of a queue.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: E
      -

      The value parameter represents the value that you want to add to the queue.

      -
      -
    -

    Returns void

    -
-
-

getAt

-
-
-

isEmpty

-
    - -
  • -

    The function checks if a data structure is empty by comparing its size to zero.

    -
    -

    Returns boolean

    A boolean value indicating whether the size of the object is 0 or not.

    - -
-
-

peek

-
    - -
  • -

    The peek function returns the first element of the array _nodes if it exists, otherwise it returns null.

    -
    -

    Returns undefined | E

    The peek() method returns the first element of the data structure, represented by the _nodes array at -the _offset index. If the data structure is empty (size is 0), it returns null.

    - -
-
-

peekLast

-
    - -
  • -

    The peekLast function returns the last element in an array-like data structure, or null if the structure is empty.

    -
    -

    Returns undefined | E

    The method peekLast() returns the last element of the _nodes array if the array is not empty. If the -array is empty, it returns null.

    - -
-
-

push

-
    - -
  • -

    The push function adds an element to the end of the queue and returns the updated queue.Adds an element at the back of the queue.

    -
    -
    -

    Parameters

    -
      -
    • -
      element: E
      -

      The element parameter represents the element that you want to add to the queue.

      -
      -
    -

    Returns Queue<E>

    The add method is returning a Queue<E> object.

    - -
-
-

shift

-
    - -
  • -

    The shift function removes and returns the first element in the queue, and adjusts the internal data structure if -necessary to optimize performance.

    -
    -

    Returns undefined | E

    The function shift() returns either the first element in the queue or null if the queue is empty.

    - -
-
-

toArray

-
    - -
  • -

    The toArray() function returns an array of elements from the current offset to the end of the _nodes array.

    -
    -

    Returns E[]

    An array of type E is being returned.

    - -
-
-

Static fromArray

-
    - -
  • -

    The function "fromArray" creates a new Queue object from an array of elements.Creates a queue from an existing array.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      E

    -
    -

    Parameters

    -
      -
    • -
      elements: E[]
      -

      The "elements" parameter is an array of elements of type E.

      -
      -
    -

    Returns Queue<E>

    The method is returning a new instance of the Queue class, initialized with the elements from the input -array.

    - -
    -

    Static

-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/RBTree.html b/docs/classes/RBTree.html deleted file mode 100644 index 9db61b6..0000000 --- a/docs/classes/RBTree.html +++ /dev/null @@ -1,1987 +0,0 @@ -RBTree | data-structure-typed
-
- -
-
-
-
- -

Class RBTree<N>

-
-

Type Parameters

-
-
-

Hierarchy

-
    -
  • BST<N> -
      -
    • RBTree
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_comparator -
-
-

Accessors

-
loopType -root -size -visitedId -visitedNode -visitedVal -
-
-

Methods

-
BFS -DFS -DFSIterative -_accumulatedByPropertyName -_addTo -_clearResults -_compare -_getResultByPropertyName -_pushByPropertyNameStopOrNot -_setLoopType -_setRoot -_setSize -_setVisitedId -_setVisitedNode -_setVisitedVal -add -addMany -allGreaterNodesAdd -clear -createNode -fill -get -getDepth -getHeight -getLeftMost -getMinHeight -getNodes -getPathToRoot -getPredecessor -getRightMost -getSubTreeSize -has -isAVLBalanced -isBST -isEmpty -isPerfectlyBalanced -isSubtreeBST -lastKey -lesserSum -levelIterative -listLevels -morris -perfectlyBalance -remove -subTreeAdd -subTreeSum -swapLocation -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Protected _comparator

-
_comparator: BSTComparator = ...
-
-

Accessors

-
-

loopType

-
-
-

root

-
-
-

size

-
-
-

visitedId

-
-
-

visitedNode

-
-
-

visitedVal

-
-
-

Methods

-
-

BFS

-
    - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N["val"][]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

DFS

-
    - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

DFSIterative

-
    - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

Protected _accumulatedByPropertyName

-
    -
  • _accumulatedByPropertyName(node, nodeOrPropertyName?): void
    • -
  • -

    The function _accumulatedByPropertyName accumulates values from a given node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The node parameter is of type N, which represents a node in a data structure.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: NodeOrPropertyName
      -

      The nodeOrPropertyName parameter is an optional parameter that -can be either a string representing a property name or a reference to a Node object. If it is a string, it -specifies the property name to be used for accumulating values. If it is a Node object, it specifies

      -
      -
    -

    Returns void

    -
-
-

Protected _addTo

-
    -
  • _addTo(newNode, parent): undefined | null | N
    • -
  • -

    The function adds a new node to a binary tree if there is an available position.

    -
    -
    -

    Parameters

    -
      -
    • -
      newNode: null | N
      -

      The newNode parameter is of type N | null, which means it can either be a node of -type N or null. It represents the node that you want to add to the binary tree.

      -
      -
      • -
    • -
      parent: N
      -

      The parent parameter is of type N, which represents a node in a binary tree.

      -
      -
    -

    Returns undefined | null | N

    either the left or right child node of the parent node, depending on which child is available for adding -the new node. If a new node is added, the function also updates the size of the binary tree. If neither the left nor -right child is available, the function returns undefined. If the parent node is null, the function also returns -undefined.

    - -
-
-

Protected _clearResults

-
-
-

Protected _compare

-
    -
  • _compare(a, b): CP
    • -
  • -

    The function compares two binary tree node IDs using a comparator function and returns whether the first ID is -greater than, less than, or equal to the second ID.

    -
    -
    -

    Parameters

    -
      -
    • -
      a: number
      -

      a is a BinaryTreeNodeId, which represents the identifier of a binary tree node.

      -
      -
      • -
    • -
      b: number
      -

      The parameter "b" in the above code refers to a BinaryTreeNodeId.

      -
      -
    -

    Returns CP

    a value of type CP (ComparisonResult). The possible return values are CP.gt (greater than), CP.lt (less -than), or CP.eq (equal).

    - -
-
-

Protected _getResultByPropertyName

-
-
-

Protected _pushByPropertyNameStopOrNot

-
    -
  • _pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName?, onlyOne?): undefined | boolean
    • -
  • -

    The function checks if a given property of a binary tree node matches a specified value, and if so, adds the node to -a result array.

    -
    -
    -

    Parameters

    -
      -
    • -
      cur: N
      -

      The current node being processed.

      -
      -
      • -
    • -
      result: (undefined | null | N)[]
      -

      An array that stores the matching nodes.

      -
      -
      • -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter is either a BinaryTreeNodeId or a N -type. It represents the property value that we are comparing against in the switch statement.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to compare against when pushing nodes into the result array. It can be either 'id' -or 'val'. If it is not provided or is not equal to 'id' or 'val', the

      -
      -
      • -
    • -
      Optional onlyOne: boolean
      -

      The onlyOne parameter is an optional boolean parameter that determines whether to -stop after finding the first matching node or continue searching for all matching nodes. If onlyOne is set to -true, the function will stop after finding the first matching node and return true. If `onlyOne

      -
      -
    -

    Returns undefined | boolean

    a boolean value indicating whether only one matching node should be pushed into the result array.

    - -
-
-

Protected _setLoopType

-
-
-

Protected _setRoot

-
    -
  • _setRoot(v): void
    • -
  • -

    The function sets the root property of an object to a given value, and if the value is not null, it also sets the -parent property of the value to undefined.

    -
    -
    -

    Parameters

    -
      -
    • -
      v: null | N
      -

      The parameter v is of type N | null, which means it can either be of type N or null.

      -
      -
    -

    Returns void

    -
-
-

Protected _setSize

-
-
-

Protected _setVisitedId

-
-
-

Protected _setVisitedNode

-
-
-

Protected _setVisitedVal

-
-
-

add

-
    - -
  • -

    The add function adds a new node to a binary search tree, either by creating a new node or by updating an existing -node with the same ID.

    -
    -
    -

    Parameters

    -
      -
    • -
      idOrNode: null | number | N
      -

      The idOrNode parameter can be either a BinaryTreeNodeId or a N -(which represents a binary tree node) or null.

      -
      -
      • -
    • -
      Optional val: N["val"]
      -

      The val parameter is an optional value that can be assigned to the val property of the new node -being added to the binary search tree.

      -
      -
    -

    Returns undefined | null | N

    The function add returns the inserted node (inserted) which can be of type N, null, or undefined.

    - -
-
-

addMany

-
    - -
  • -

    The addMany function overrides the base class method to add multiple nodes to a binary search tree in a balanced -manner.

    -
    -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number)[] | (null | N)[]
      -

      The idsOrNodes parameter in the addMany function is an array of -BinaryTreeNodeId or N (node) objects, or null values. It represents the nodes or node IDs that need to be added -to the binary search tree.

      -
      -
      • -
    • -
      Optional data: N["val"][]
      -

      The values of tree nodes

      -
      -
      • -
    • -
      isBalanceAdd: boolean = false
      -

      If true the nodes will be balance inserted in binary search method.

      -
      -
    -

    Returns (undefined | null | N)[]

    The function addMany returns an array of N, null, or undefined values.

    - -
-
-

allGreaterNodesAdd

-
    - -
  • -

    The allGreaterNodesAdd function adds a delta value to the specified property of all nodes in a binary tree that -have a greater value than a given node.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | number | N
      -

      The node parameter can be either of type N (a generic type), -BinaryTreeNodeId, or null. It represents the node in the binary tree to which the delta value will be added.

      -
      -
      • -
    • -
      delta: number
      -

      The delta parameter is a number that represents the amount by which the property value of -each greater node should be increased.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name of the nodes in the binary tree that you want to update. If not provided, it defaults to -'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

clear

-
-
-

createNode

-
    - -
  • -

    The function creates a new binary search tree node with the given id and value.

    -
    -
    -

    Parameters

    -
      -
    • -
      id: number
      -

      The id parameter is the identifier for the binary tree node. It is used to uniquely -identify each node in the binary tree.

      -
      -
      • -
    • -
      Optional val: N["val"]
      -

      The val parameter is an optional value that can be assigned to the node. It represents the value -that will be stored in the node.

      -
      -
    -

    Returns N

    a new instance of the BSTNode class with the specified id and value.

    - -
-
-

fill

-
    - -
  • -

    The fill function clears the binary tree and adds multiple nodes with the given IDs or nodes and optional data.

    -
    -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number)[] | (null | N)[]
      -

      The idsOrNodes parameter is an array that can contain either -BinaryTreeNodeId or N values.

      -
      -
      • -
    • -
      Optional data: N[] | N["val"][]
      -

      The data parameter is an optional array of values that will be assigned to -the nodes being added. If provided, the length of the data array should be equal to the length of the idsOrNodes -array. Each value in the data array will be assigned to the

      -
      -
    -

    Returns boolean

    The method is returning a boolean value.

    - -
-
-

get

-
    - -
  • -

    The function returns the first node in a binary tree that matches the given property name and value.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or a -generic type N. It represents the property of the binary tree node that you want to search for.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to use for searching the binary tree nodes. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns null | N

    The method is returning either a BinaryTreeNodeId or N (generic type) or null.

    - -
-
-

getDepth

-
-
-

getHeight

-
    - -
  • -

    The getHeight function calculates the maximum height of a binary tree, either recursively or iteratively.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | number | N
      -

      The beginRoot parameter is optional and can be of type N (a -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node), or null.

      -
      -
    -

    Returns number

    the height of the binary tree.

    - -
-
-

getLeftMost

-
    - -
  • -

    The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if -no node is specified. -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node), or null.

    -
    -

    Returns null | N

    The function getLeftMost returns the leftmost node in a binary tree. If the beginRoot parameter is -provided, it starts the traversal from that node. If beginRoot is not provided or is null, it starts the traversal -from the root of the binary tree. The function returns the leftmost node found during the traversal. If no leftmost -node is found (

    - -
    • - -
  • -

    The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if -no node is specified.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional node: N
      -

      The beginRoot parameter is optional and can be of type N (a -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node).

      -
      -
    -

    Returns N

    The function getLeftMost returns the leftmost node in a binary tree. If the beginRoot parameter is -provided, it starts the traversal from that node. If beginRoot is not provided or is null, it starts the traversal -from the root of the binary tree. The function returns the leftmost node found during the traversal. If no leftmost -node is found (

    - -
-
-

getMinHeight

-
    - -
  • -

    The getMinHeight function calculates the minimum height of a binary tree using either a recursive or iterative -approach.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | N
      -

      The beginRoot parameter is an optional parameter of type N or null. It -represents the starting node from which to calculate the minimum height of a binary tree. If no value is provided -for beginRoot, the this.root property is used as the default value.

      -
      -
    -

    Returns number

    The function getMinHeight returns the minimum height of the binary tree.

    - -
-
-

getNodes

-
    - -
  • -

    The function getNodes returns an array of nodes in a binary tree that match a given property value.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or an -N type. It represents the property of the binary tree node that you want to compare with.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName = 'id'
      -

      The propertyName parameter is an optional parameter that -specifies the property name to use for comparison. If not provided, it defaults to 'id'.

      -
      -
      • -
    • -
      Optional onlyOne: boolean
      -

      The onlyOne parameter is an optional boolean parameter that determines whether to -return only one node that matches the given nodeProperty or all nodes that match the nodeProperty. If onlyOne -is set to true, the function will return an array with only one node (if

      -
      -
    -

    Returns N[]

    an array of nodes (type N).

    - -
-
-

getPathToRoot

-
    - -
  • -

    The function getPathToRoot returns an array of nodes representing the path from a given node to the root node, with -an option to reverse the order of the nodes.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The node parameter represents a node in a tree structure. It is of type N, which could be any -type that represents a node in your specific implementation.

      -
      -
      • -
    • -
      Optional isReverse: boolean = true
      -

      The isReverse parameter is a boolean flag that determines whether the resulting -path should be reversed or not. If isReverse is set to true, the path will be reversed before returning it. If -isReverse is set to false or not provided, the path will

      -
      -
    -

    Returns N[]

    The function getPathToRoot returns an array of nodes (N[]).

    - -
-
-

getPredecessor

-
-
-

getRightMost

-
    - -
  • -

    The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail -recursion optimization.

    -
    -

    Returns null | N

    The getRightMost function returns the rightmost node in a binary tree. It returns the -rightmost node starting from the root of the binary tree.

    - -
    • - -
  • -

    The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail -recursion optimization.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional node: N
      -

      The node parameter is an optional parameter of type N or null. It represents the -starting node from which we want to find the rightmost node. If no node is provided, the function will default to -using the root node of the data structure.

      -
      -
    -

    Returns N

    The getRightMost function returns the rightmost node in a binary tree. It returns the rightmost node -starting from that node.

    - -
-
-

getSubTreeSize

-
    - -
  • -

    The function calculates the size of a subtree by traversing it either recursively or iteratively.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: undefined | null | N
      -

      The subTreeRoot parameter represents the root node of a subtree in a -binary tree.

      -
      -
    -

    Returns number

    the size of the subtree rooted at subTreeRoot.

    - -
-
-

has

-
    - -
  • -

    The function checks if a binary tree node has a specific property.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or N. -It represents the property of the binary tree node that you want to check.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the name of the property to be checked in the nodes. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

isAVLBalanced

-
-
-

isBST

-
-
-

isEmpty

-
-
-

isPerfectlyBalanced

-
    - -
  • -

    The function checks if a binary tree is perfectly balanced by comparing the minimum height and the height of the -tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | N
      -

      The parameter beginRoot is of type N or null. It represents the root node of a -tree or null if the tree is empty.

      -
      -
    -

    Returns boolean

    The method is returning a boolean value.

    - -
-
-

isSubtreeBST

-
-
-

lastKey

-
    - -
  • -

    The function returns the id of the rightmost node if the comparison between two values is less than, the id of the -leftmost node if the comparison is greater than, and the id of the rightmost node otherwise.

    -
    -

    Returns number

    The method lastKey() returns the id of the rightmost node in the binary tree if the comparison between -the values at index 0 and 1 is less than, otherwise it returns the id of the leftmost node. If the comparison is -equal, it returns the id of the rightmost node. If there are no nodes in the tree, it returns 0.

    - -
-
-

lesserSum

-
    - -
  • -

    The lesserSum function calculates the sum of property values in a binary tree for nodes that have a property value -less than a given node.

    -
    -
    -

    Parameters

    -
      -
    • -
      beginNode: null | number | N
      -

      The beginNode parameter can be one of the following:

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to use for calculating the sum. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns number

    The function lesserSum returns a number, which represents the sum of the values of the nodes in the -binary tree that have a lesser value than the specified beginNode based on the propertyName.

    - -
-
-

levelIterative

-
    - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on their 'id' property.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N["val"][]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

listLevels

-
    - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
    -

    Returns number[][]

    A 2D array of AbstractBinaryTreeNodeProperty objects.

    - -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
    -

    Returns number[][]

    -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N["val"][][]

    A 2D array of 'val' properties from each node.

    - -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[][]

    A 2D array of binary tree nodes.

    - -
-
-

morris

-
    - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

perfectlyBalance

-
    - -
  • -

    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 boolean

    The function perfectlyBalance() returns a boolean value.

    - -
-
-

remove

-
    - -
  • -

    The remove function in TypeScript is used to delete a node from a binary search tree and returns an array of objects -containing the deleted node and the node that needs to be balanced.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrId: number | N
      -

      The nodeOrId parameter can be either a node object (N) or a binary tree -node ID (BinaryTreeNodeId).

      -
      -
    -

    Returns BinaryTreeDeletedResult<N>[]

    The function remove returns an array of BinaryTreeDeletedResult<N> objects.

    - -
-
-

subTreeAdd

-
    - -
  • -

    The function subTreeAdd adds a delta value to a specified property of each node in a subtree.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: null | number | N
      -

      The subTreeRoot parameter represents the root node of a binary -tree or the ID of a node in the binary tree. It can also be null if there is no subtree to add to.

      -
      -
      • -
    • -
      delta: number
      -

      The delta parameter is a number that represents the amount by which the property value of -each node in the subtree should be incremented.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property of the binary tree node that should be modified. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

subTreeSum

-
    - -
  • -

    The function subTreeSum calculates the sum of a specified property in a binary tree or subtree.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: null | number | N
      -

      The subTreeRoot parameter represents the root node of a binary -tree or the ID of a binary tree node. It can also be null if there is no subtree.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      propertyName is an optional parameter that specifies the -property of the binary tree node to use for calculating the sum. It can be either 'id' or 'val'. If propertyName is -not provided, it defaults to 'id'.

      -
      -
    -

    Returns number

    a number, which is the sum of the values of the specified property in the subtree rooted at subTreeRoot.

    - -
-
-

swapLocation

-
    - -
  • -

    The swapLocation function swaps the location of two nodes in a binary tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcNode: N
      -

      The source node that you want to swap with the destination node.

      -
      -
      • -
    • -
      destNode: N
      -

      The destNode parameter represents the destination node where the values from srcNode will -be swapped to.

      -
      -
    -

    Returns N

    The destNode is being returned.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/RBTreeNode.html b/docs/classes/RBTreeNode.html deleted file mode 100644 index bb3496f..0000000 --- a/docs/classes/RBTreeNode.html +++ /dev/null @@ -1,433 +0,0 @@ -RBTreeNode | data-structure-typed
-
- -
-
-
-
- -

Class RBTreeNode<V, NEIGHBOR>

-
-

Type Parameters

-
-
-

Hierarchy

-
    -
  • BSTNode<V, NEIGHBOR> -
      -
    • RBTreeNode
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_color -
-
-

Accessors

-
color -familyPosition -height -id -left -parent -right -val -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Private _color

-
_color: RBColor
-
-

Accessors

-
-

color

-
-
-

familyPosition

-
-
-

height

-
-
-

id

-
-
-

left

-
-
-

parent

-
-
-

right

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/SegmentTree.html b/docs/classes/SegmentTree.html deleted file mode 100644 index a3a43fe..0000000 --- a/docs/classes/SegmentTree.html +++ /dev/null @@ -1,468 +0,0 @@ -SegmentTree | data-structure-typed
-
- -
-
-
-
- -

Class SegmentTree

-
-

Hierarchy

-
    -
  • SegmentTree
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_end -_root -_start -_values -
-
-

Accessors

-
end -root -start -values -
-
-

Methods

-
_setEnd -_setRoot -_setStart -_setValues -build -querySumByRange -updateNode -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor initializes the values, start, end, and root properties of an object.

    -
    -
    -

    Parameters

    -
      -
    • -
      values: number[]
      -

      An array of numbers that will be used to build a binary search tree.

      -
      -
      • -
    • -
      Optional start: number
      -

      The start parameter is the index of the first element in the values array that should -be included in the range. If no value is provided for start, it defaults to 0, which means the range starts from -the beginning of the array.

      -
      -
      • -
    • -
      Optional end: number
      -

      The "end" parameter is the index of the last element in the "values" array that should be -included in the range. If not provided, it defaults to the index of the last element in the "values" array.

      -
      -
    -

    Returns SegmentTree

    -
-
-

Properties

-
-

Private _end

-
_end: number
-
-

Private _root

-
_root: null | SegmentTreeNode
-
-

Private _start

-
_start: number = 0
-
-

Private _values

-
_values: number[] = []
-
-

Accessors

-
-

end

-
-
-

root

-
-
-

start

-
-
-

values

-
-
-

Methods

-
-

Protected _setEnd

-
-
-

Protected _setRoot

-
-
-

Protected _setStart

-
-
-

Protected _setValues

-
-
-

build

-
    - -
  • -

    The build function creates a segment tree by recursively dividing the given range into smaller segments and assigning -the sum of values to each segment.

    -
    -
    -

    Parameters

    -
      -
    • -
      start: number
      -

      The start parameter represents the starting index of the segment or range for which we are -building the segment tree.

      -
      -
      • -
    • -
      end: number
      -

      The "end" parameter represents the ending index of the segment or range for which we want to -build a segment tree.

      -
      -
    -

    Returns SegmentTreeNode

    a SegmentTreeNode object.

    - -
-
-

querySumByRange

-
    - -
  • -

    The function querySumByRange calculates the sum of values within a given range in a segment tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      indexA: number
      -

      The starting index of the range for which you want to calculate the sum.

      -
      -
      • -
    • -
      indexB: number
      -

      The parameter indexB represents the ending index of the range for which you want to -calculate the sum.

      -
      -
    -

    Returns number

    The function querySumByRange returns a number.

    - -
-
-

updateNode

-
    - -
  • -

    The function updates the value of a node in a segment tree and recalculates the sum of its children if they exist.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter represents the index of the node in the segment tree that needs to be -updated.

      -
      -
      • -
    • -
      sum: number
      -

      The sum parameter represents the new value that should be assigned to the sum property of -the SegmentTreeNode at the specified index.

      -
      -
      • -
    • -
      Optional val: number
      -

      The val parameter is an optional value that can be assigned to the val -property of the SegmentTreeNode object. It is not currently used in the code, but you can uncomment the line // cur.val = val; and pass a value for val in the

      -
      -
    -

    Returns void

    The function does not return anything.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/SegmentTreeNode.html b/docs/classes/SegmentTreeNode.html deleted file mode 100644 index ada68d2..0000000 --- a/docs/classes/SegmentTreeNode.html +++ /dev/null @@ -1,391 +0,0 @@ -SegmentTreeNode | data-structure-typed
-
- -
-
-
-
- -

Class SegmentTreeNode

-
-

Hierarchy

-
    -
  • SegmentTreeNode
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_end -_left -_right -_start -_sum -_val -
-
-

Accessors

-
end -left -right -start -sum -val -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Private _end

-
_end: number = 0
-
-

Private _left

-
_left: null | SegmentTreeNode = null
-
-

Private _right

-
_right: null | SegmentTreeNode = null
-
-

Private _start

-
_start: number = 0
-
-

Private _sum

-
_sum: number = 0
-
-

Private _val

-
_val: null | number = null
-
-

Accessors

-
-

end

-
-
-

left

-
-
-

right

-
-
-

start

-
-
-

sum

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/SinglyLinkedList.html b/docs/classes/SinglyLinkedList.html deleted file mode 100644 index 552566d..0000000 --- a/docs/classes/SinglyLinkedList.html +++ /dev/null @@ -1,834 +0,0 @@ -SinglyLinkedList | data-structure-typed
-
- -
-
-
-
- -

Class SinglyLinkedList<E>

-
-

Type Parameters

-
    -
  • -

    E = any

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_head -_length -_tail -
-
-

Accessors

-
head -length -tail -
-
-

Methods

-
[iterator] -clear -countOccurrences -delete -deleteAt -find -findNode -getAt -getLength -getNodeAt -indexOf -insertAfter -insertAt -insertBefore -isEmpty -pop -push -reverse -shift -toArray -unshift -fromArray -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Private _head

-
_head: null | SinglyLinkedListNode<E>
-
-

Private _length

-
_length: number
-
-

Private _tail

-
_tail: null | SinglyLinkedListNode<E>
-
-

Accessors

-
-

head

-
-
-

length

-
-
-

tail

-
-
-

Methods

-
-

[iterator]

-
-
-

clear

-
-
-

countOccurrences

-
    - -
  • -

    The function counts the number of occurrences of a given value in a linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: E
      -

      The value parameter is the value that you want to count the occurrences of in the linked list.

      -
      -
    -

    Returns number

    The count of occurrences of the given value in the linked list.

    - -
-
-

delete

-
    - -
  • -

    The delete function removes a node with a specific value from a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      valueOrNode: E
      -

      The valueOrNode parameter can accept either a value of type E -or a SinglyLinkedListNode<E> object.

      -
      -
    -

    Returns boolean

    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.

    - -
    • - -
  • -

    The delete function removes a node with a specific value from a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      valueOrNode: SinglyLinkedListNode<E>
      -

      The valueOrNode parameter can accept either a value of type E -or a SinglyLinkedListNode<E> object.

      -
      -
    -

    Returns boolean

    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.

    - -
-
-

deleteAt

-
    - -
  • -

    The deleteAt function removes an element at a specified index from a linked list and returns the removed element.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter represents the position of the element that needs to be deleted in the -data structure. It is of type number.

      -
      -
    -

    Returns undefined | E

    The method deleteAt returns the value of the node that was deleted, or null if the index is out of -bounds.

    - -
-
-

find

-
    - -
  • -

    The find function iterates through a linked list and returns the first element that satisfies a given condition.

    -
    -
    -

    Parameters

    -
      -
    • -
      callback: ((val) => boolean)
      -

      A function that takes a value of type E as its parameter and returns a boolean value. This -function is used to determine whether a particular value in the linked list satisfies a certain condition.

      -
      -
      -
        -
      • -
          -
        • (val): boolean
          • -
        • -
          -

          Parameters

          -
            -
          • -
            val: E
          -

          Returns boolean

    -

    Returns null | E

    The method find returns the first element in the linked list that satisfies the condition specified by -the callback function. If no element satisfies the condition, it returns null.

    - -
-
-

findNode

-
    - -
  • -

    The function finds a node in a singly linked list by its value and returns the node if found, otherwise returns -null.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: E
      -

      The value parameter is the value that we want to search for in the linked list.

      -
      -
    -

    Returns null | SinglyLinkedListNode<E>

    a SinglyLinkedListNode<E> if a node with the specified value is found in the linked list. If no node with -the specified value is found, the function returns null.

    - -
-
-

getAt

-
    - -
  • -

    The function getAt returns the value at a specified index in a linked list, or null if the index is out of range.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter is a number that represents the position of the element we want to -retrieve from the list.

      -
      -
    -

    Returns undefined | E

    The method getAt(index: number): E | null returns the value at the specified index in the linked list, or -null if the index is out of bounds.

    - -
-
-

getLength

-
-
-

getNodeAt

-
    - -
  • -

    The function getNodeAt returns the node at a given index in a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter is a number that represents the position of the node we want to -retrieve from the linked list. It indicates the zero-based index of the node we want to access.

      -
      -
    -

    Returns null | SinglyLinkedListNode<E>

    The method getNodeAt(index: number) returns a SinglyLinkedListNode<E> object if the node at the -specified index exists, or null if the index is out of bounds.

    - -
-
-

indexOf

-
    - -
  • -

    The indexOf function returns the index of the first occurrence of a given value in a linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      value: E
      -

      The value parameter is the value that you want to find the index of in the linked list.

      -
      -
    -

    Returns number

    The method is returning the index of the first occurrence of the specified value in the linked list. If the -value is not found, it returns -1.

    - -
-
-

insertAfter

-
    - -
  • -

    The insertAfter function inserts a new node with a given value after an existing node in a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValueOrNode: E
      -

      The existing value or node in the linked list after which -the new value will be inserted. It can be either the value of the existing node or the existing node itself.

      -
      -
      • -
    • -
      newValue: E
      -

      The value that you want to insert into the linked list after the existing value or node.

      -
      -
    -

    Returns boolean

    The method returns a boolean value. It returns true if the new value was successfully inserted after the -existing value or node, and false if the existing value or node was not found in the linked list.

    - -
    • - -
  • -

    The insertAfter function inserts a new node with a given value after an existing node in a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValueOrNode: SinglyLinkedListNode<E>
      -

      The existing value or node in the linked list after which -the new value will be inserted. It can be either the value of the existing node or the existing node itself.

      -
      -
      • -
    • -
      newValue: E
      -

      The value that you want to insert into the linked list after the existing value or node.

      -
      -
    -

    Returns boolean

    The method returns a boolean value. It returns true if the new value was successfully inserted after the -existing value or node, and false if the existing value or node was not found in the linked list.

    - -
-
-

insertAt

-
    - -
  • -

    The insertAt function inserts a value at a specified index in a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      index: number
      -

      The index parameter represents the position at which the new value should be inserted in the -linked list. It is of type number.

      -
      -
      • -
    • -
      val: E
      -

      The val parameter represents the value that you want to insert into the linked list at the -specified index.

      -
      -
    -

    Returns boolean

    The insert method returns a boolean value. It returns true if the insertion is successful, and false -if the index is out of bounds.

    - -
-
-

insertBefore

-
    - -
  • -

    The insertBefore function inserts a new value before an existing value in a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValue: E
      • -
    • -
      newValue: E
      -

      The newValue parameter represents the value that you want to insert into the linked list.

      -
      -
    -

    Returns boolean

    The method insertBefore returns a boolean value. It returns true if the new value was successfully -inserted before the existing value, and false otherwise.

    - -
    • - -
  • -

    The insertBefore function inserts a new value before an existing value in a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      existingValue: SinglyLinkedListNode<E>
      • -
    • -
      newValue: E
      -

      The newValue parameter represents the value that you want to insert into the linked list.

      -
      -
    -

    Returns boolean

    The method insertBefore returns a boolean value. It returns true if the new value was successfully -inserted before the existing value, and false otherwise.

    - -
-
-

isEmpty

-
    - -
  • -

    The function checks if the length of a data structure is equal to zero and returns a boolean value indicating -whether it is empty or not.

    -
    -

    Returns boolean

    A boolean value indicating whether the length of the object is equal to 0.

    - -
-
-

pop

-
    - -
  • -

    The pop() function removes and returns the value of the last element in a linked list, updating the head and tail -pointers accordingly.

    -
    -

    Returns undefined | E

    The method pop() returns the value of the node that is being removed from the end of the linked list. If -the linked list is empty, it returns null.

    - -
-
-

push

-
    - -
  • -

    The push function adds a new node with the given data to the end of a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      data: E
      -

      The "data" parameter represents the value that you want to add to the linked list. It can be of -any type (E) as specified in the generic type declaration of the class or function.

      -
      -
    -

    Returns void

    -
-
-

reverse

-
-
-

shift

-
    - -
  • -

    The shift() function removes and returns the value of the first node in a linked list.

    -
    -

    Returns undefined | E

    The value of the node that is being removed from the beginning of the linked list.

    - -
-
-

toArray

-
-
-

unshift

-
    - -
  • -

    The unshift function adds a new node with the given value to the beginning of a singly linked list.

    -
    -
    -

    Parameters

    -
      -
    • -
      val: E
      -

      The parameter "val" represents the value of the new node that will be added to the beginning of the -linked list.

      -
      -
    -

    Returns void

    -
-
-

Static fromArray

-
    - -
  • -

    The fromArray function creates a new SinglyLinkedList instance and populates it with the elements from the given -array.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      E

    -
    -

    Parameters

    -
      -
    • -
      data: E[]
      -

      The data parameter is an array of elements of type E.

      -
      -
    -

    Returns SinglyLinkedList<E>

    The fromArray function returns a SinglyLinkedList object.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/SinglyLinkedListNode.html b/docs/classes/SinglyLinkedListNode.html deleted file mode 100644 index b1cf94c..0000000 --- a/docs/classes/SinglyLinkedListNode.html +++ /dev/null @@ -1,304 +0,0 @@ -SinglyLinkedListNode | data-structure-typed
-
- -
-
-
-
- -

Class SinglyLinkedListNode<E>

-
-

data-structure-typed

-
-
-

Author

Tyler Zeng

- -

Copyright

Copyright (c) 2022 Tyler Zeng zrwusa@gmail.com

- -

License

MIT License

-
-
-

Type Parameters

-
    -
  • -

    E = any

-
-

Hierarchy

-
    -
  • SinglyLinkedListNode
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_next -_val -
-
-

Accessors

-
next -val -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor function initializes an instance of a class with a given value and sets the next property to null.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      E = any

    -
    -

    Parameters

    -
      -
    • -
      val: E
      -

      The "val" parameter is of type E, which means it can be any data type. It represents the value that -will be stored in the node of a linked list.

      -
      -
    -

    Returns SinglyLinkedListNode<E>

    -
-
-

Properties

-
-

Private _next

-
_next: null | SinglyLinkedListNode<E>
-
-

Private _val

-
_val: E
-
-

Accessors

-
-

next

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/SplayTree.html b/docs/classes/SplayTree.html deleted file mode 100644 index d8a24d4..0000000 --- a/docs/classes/SplayTree.html +++ /dev/null @@ -1,206 +0,0 @@ -SplayTree | data-structure-typed
-
- -
-
-
-
- -

Class SplayTree

-
-

Hierarchy

-
    -
  • SplayTree
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Constructors

-
-

constructor

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/Stack.html b/docs/classes/Stack.html deleted file mode 100644 index 42c4a8b..0000000 --- a/docs/classes/Stack.html +++ /dev/null @@ -1,402 +0,0 @@ -Stack | data-structure-typed
-
- -
-
-
-
- -

Class Stack<E>

-
-
-

License

MIT

- -

Copyright

Tyler Zeng zrwusa@gmail.com

-
-
-

Type Parameters

-
    -
  • -

    E = any

-
-

Hierarchy

-
    -
  • Stack
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_elements -
-
-

Methods

-
clear -clone -isEmpty -peek -pop -push -size -toArray -fromArray -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor initializes an array of elements, which can be provided as an optional parameter.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      E = any

    -
    -

    Parameters

    -
      -
    • -
      Optional elements: E[]
      -

      The elements parameter is an optional parameter of type E[], which represents an array -of elements of type E. It is used to initialize the _elements property of the class. If the elements parameter -is provided and is an array, it is assigned to the `_elements

      -
      -
    -

    Returns Stack<E>

    -
-
-

Properties

-
-

Protected _elements

-
_elements: E[]
-
-

Methods

-
-

clear

-
-
-

clone

-
    - -
  • -

    The clone() function returns a new Stack object with the same elements as the original stack.

    -
    -

    Returns Stack<E>

    The clone() method is returning a new Stack object with a copy of the _elements array.

    - -
-
-

isEmpty

-
    - -
  • -

    The function checks if an array is empty and returns a boolean value.

    -
    -

    Returns boolean

    A boolean value indicating whether the _elements array is empty or not.

    - -
-
-

peek

-
    - -
  • -

    The peek function returns the last element of an array, or null if the array is empty.

    -
    -

    Returns null | E

    The peek() function returns the last element of the _elements array, or null if the array is empty.

    - -
-
-

pop

-
    - -
  • -

    The pop function removes and returns the last element from an array, or returns null if the array is empty.

    -
    -

    Returns null | E

    The pop() method is returning the last element of the array _elements if the array is not empty. If the -array is empty, it returns null.

    - -
-
-

push

-
    - -
  • -

    The push function adds an element to the stack and returns the updated stack.

    -
    -
    -

    Parameters

    -
      -
    • -
      element: E
      -

      The parameter "element" is of type E, which means it can be any data type.

      -
      -
    -

    Returns Stack<E>

    The push method is returning the updated Stack<E> object.

    - -
-
-

size

-
    - -
  • -

    The size() function returns the number of elements in an array.

    -
    -

    Returns number

    The size of the elements array.

    - -
-
-

toArray

-
-
-

Static fromArray

-
    - -
  • -

    The function "fromArray" creates a new Stack object from an array of elements.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      E

    -
    -

    Parameters

    -
      -
    • -
      elements: E[]
      -

      The elements parameter is an array of elements of type E.

      -
      -
    -

    Returns Stack<E>

    The method is returning a new instance of the Stack class, initialized with the elements from the input -array.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/TreeMap.html b/docs/classes/TreeMap.html deleted file mode 100644 index 4f7edf4..0000000 --- a/docs/classes/TreeMap.html +++ /dev/null @@ -1,206 +0,0 @@ -TreeMap | data-structure-typed
-
- -
-
-
-
- -

Class TreeMap

-
-

Hierarchy

-
    -
  • TreeMap
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Constructors

-
-

constructor

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/TreeMultiset.html b/docs/classes/TreeMultiset.html deleted file mode 100644 index fd3c46a..0000000 --- a/docs/classes/TreeMultiset.html +++ /dev/null @@ -1,2480 +0,0 @@ -TreeMultiset | data-structure-typed
-
- -
-
-
-
- -

Class TreeMultiset<N>

-
-

The only distinction between a TreeMultiset and a AVLTree lies in the ability of the former to store duplicate nodes through the utilization of counters.

-
-
-
-

Type Parameters

-
-
-

Hierarchy

-
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_comparator -_count -
-
-

Accessors

-
count -loopType -root -size -visitedId -visitedNode -visitedVal -
-
-

Methods

-
BFS -BFSCount -DFS -DFSCount -DFSIterative -DFSIterativeCount -_accumulatedByPropertyName -_addTo -_balanceFactor -_balanceLL -_balanceLR -_balancePath -_balanceRL -_balanceRR -_clearResults -_compare -_getResultByPropertyName -_pushByPropertyNameStopOrNot -_setCount -_setLoopType -_setRoot -_setSize -_setVisitedId -_setVisitedNode -_setVisitedVal -_updateHeight -add -addMany -allGreaterNodesAdd -allGreaterNodesAddCount -clear -createNode -fill -get -getDepth -getHeight -getLeftMost -getMinHeight -getNodes -getNodesByCount -getPathToRoot -getPredecessor -getRightMost -getSubTreeCount -getSubTreeSize -has -isAVLBalanced -isBST -isEmpty -isPerfectlyBalanced -isSubtreeBST -lastKey -lesserSum -lesserSumCount -levelIterative -listLevels -listLevelsCount -morris -morrisCount -perfectlyBalance -remove -subTreeAdd -subTreeAddCount -subTreeSum -subTreeSumCount -swapLocation -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Protected _comparator

-
_comparator: BSTComparator = ...
-
-

Private _count

-
_count: number = 0
-
-

Accessors

-
-

count

-
-
-

loopType

-
-
-

root

-
-
-

size

-
-
-

visitedId

-
-
-

visitedNode

-
-
-

visitedVal

-
-
-

Methods

-
-

BFS

-
    - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N["val"][]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a breadth-first search (BFS) on a binary tree, accumulating nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

BFSCount

-
    - -
  • -

    The BFSCount function returns an array of counts from a breadth-first search of nodes.

    -
    -

    Returns number[]

    The BFSCount() function returns an array of numbers, specifically the count property of each node in the -BFS traversal.

    - -
-
-

DFS

-
    - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

DFSCount

-
    - -
  • -

    The DFSCount function returns an array of counts for each node in a depth-first search traversal.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The pattern parameter is an optional parameter that specifies the order in which -the Depth-First Search (DFS) algorithm should traverse the nodes. It can have one of the following values:

      -
      -
    -

    Returns number[]

    The DFSCount function returns an array of numbers, specifically the count property of each node in the DFS -traversal.

    - -
-
-

DFSIterative

-
    - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on their 'id' property.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs an iterative depth-first search (DFS) traversal on a binary tree and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

DFSIterativeCount

-
    - -
  • -

    The function DFSIterativeCount performs an iterative depth-first search and returns an array of node counts based on -the specified traversal pattern.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: "in" | "pre" | "post"
      -

      The pattern parameter is a string that specifies the traversal order for -the Depth-First Search (DFS) algorithm. It can have three possible values: 'in', 'pre', or 'post'.

      -
      -
    -

    Returns number[]

    The DFSIterativeCount function returns an array of numbers, which represents the count property of each node -in the DFS traversal.

    - -
-
-

Protected _accumulatedByPropertyName

-
    -
  • _accumulatedByPropertyName(node, nodeOrPropertyName?): void
    • -
  • -

    The function _accumulatedByPropertyName accumulates values from a given node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The node parameter is of type N, which represents a node in a data structure.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: NodeOrPropertyName
      -

      The nodeOrPropertyName parameter is an optional parameter that -can be either a string representing a property name or a reference to a Node object. If it is a string, it -specifies the property name to be used for accumulating values. If it is a Node object, it specifies

      -
      -
    -

    Returns void

    -
-
-

_addTo

-
    -
  • _addTo(newNode, parent): undefined | null | N
    • -
  • -

    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.

    -
    -
    -

    Parameters

    -
      -
    • -
      newNode: null | N
      -

      The newNode parameter represents the node that needs to be added to the tree. It can -be either a node object (N) or null.

      -
      -
      • -
    • -
      parent: N
      -

      The parent parameter represents the parent node to which the new node will be added as a -child.

      -
      -
    -

    Returns undefined | null | N

    The method returns either the parent.left, parent.right, or undefined.

    - -
-
-

Protected _balanceFactor

-
    -
  • _balanceFactor(node): number
    • -
  • -

    The balance factor of a given AVL tree node is calculated by subtracting the height of its left subtree from the -height of its right subtree.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The parameter "node" is of type N, which represents a node in an AVL tree.

      -
      -
    -

    Returns number

    The balance factor of the given AVL tree node.

    - -
-
-

Protected _balanceLL

-
-
-

Protected _balanceLR

-
-
-

Protected _balancePath

-
    -
  • _balancePath(node): void
    • -
  • -

    The _balancePath function balances the AVL tree by performing appropriate rotations based on the balance factor of -each node in the path from the given node to the root.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The node parameter is an AVLTreeNode object, which represents a node in an AVL tree.

      -
      -
    -

    Returns void

    -
-
-

Protected _balanceRL

-
-
-

Protected _balanceRR

-
-
-

Protected _clearResults

-
-
-

Protected _compare

-
    -
  • _compare(a, b): CP
    • -
  • -

    The function compares two binary tree node IDs using a comparator function and returns whether the first ID is -greater than, less than, or equal to the second ID.

    -
    -
    -

    Parameters

    -
      -
    • -
      a: number
      -

      a is a BinaryTreeNodeId, which represents the identifier of a binary tree node.

      -
      -
      • -
    • -
      b: number
      -

      The parameter "b" in the above code refers to a BinaryTreeNodeId.

      -
      -
    -

    Returns CP

    a value of type CP (ComparisonResult). The possible return values are CP.gt (greater than), CP.lt (less -than), or CP.eq (equal).

    - -
-
-

Protected _getResultByPropertyName

-
-
-

Protected _pushByPropertyNameStopOrNot

-
    -
  • _pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName?, onlyOne?): undefined | boolean
    • -
  • -

    The function checks if a given property of a binary tree node matches a specified value, and if so, adds the node to -a result array.

    -
    -
    -

    Parameters

    -
      -
    • -
      cur: N
      -

      The current node being processed.

      -
      -
      • -
    • -
      result: (undefined | null | N)[]
      -

      An array that stores the matching nodes.

      -
      -
      • -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter is either a BinaryTreeNodeId or a N -type. It represents the property value that we are comparing against in the switch statement.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to compare against when pushing nodes into the result array. It can be either 'id' -or 'val'. If it is not provided or is not equal to 'id' or 'val', the

      -
      -
      • -
    • -
      Optional onlyOne: boolean
      -

      The onlyOne parameter is an optional boolean parameter that determines whether to -stop after finding the first matching node or continue searching for all matching nodes. If onlyOne is set to -true, the function will stop after finding the first matching node and return true. If `onlyOne

      -
      -
    -

    Returns undefined | boolean

    a boolean value indicating whether only one matching node should be pushed into the result array.

    - -
-
-

Protected _setCount

-
-
-

Protected _setLoopType

-
-
-

Protected _setRoot

-
    -
  • _setRoot(v): void
    • -
  • -

    The function sets the root property of an object to a given value, and if the value is not null, it also sets the -parent property of the value to undefined.

    -
    -
    -

    Parameters

    -
      -
    • -
      v: null | N
      -

      The parameter v is of type N | null, which means it can either be of type N or null.

      -
      -
    -

    Returns void

    -
-
-

Protected _setSize

-
-
-

Protected _setVisitedId

-
-
-

Protected _setVisitedNode

-
-
-

Protected _setVisitedVal

-
-
-

Protected _updateHeight

-
    -
  • _updateHeight(node): void
    • -
  • -

    The function updates the height of a node in an AVL tree based on the heights of its left and right subtrees.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The parameter node is an AVLTreeNode object, which represents a node in an AVL tree.

      -
      -
    -

    Returns void

    -
-
-

add

-
    - -
  • -

    The add function adds a new node to a binary search tree, maintaining the tree's properties and balancing if -necessary.

    -
    -
    -

    Parameters

    -
      -
    • -
      idOrNode: null | number | N
      -

      The idOrNode parameter can be either a BinaryTreeNodeId or a N (which -represents a BinaryTreeNode).

      -
      -
      • -
    • -
      Optional val: N["val"]
      -

      The val parameter represents the value to be added to the binary tree node.

      -
      -
      • -
    • -
      Optional count: number
      -

      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 undefined | null | N

    The method add returns either the inserted node (N), null, or undefined.

    - -
-
-

addMany

-
    - -
  • -

    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.

    -
    -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number)[] | (null | N)[]
      -

      An array of BinaryTreeNodeId or BinaryTreeNode -objects, or null values.

      -
      -
      • -
    • -
      Optional data: N["val"][]
      -

      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 idOrNode and data arguments in the this.add() -method. If provided, the data array should

      -
      -
    -

    Returns (undefined | null | N)[]

    The function addMany returns an array of N, null, or undefined values.

    - -
-
-

allGreaterNodesAdd

-
    - -
  • -

    The allGreaterNodesAdd function adds a delta value to the specified property of all nodes in a binary tree that -have a greater value than a given node.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | number | N
      -

      The node parameter can be either of type N (a generic type), -BinaryTreeNodeId, or null. It represents the node in the binary tree to which the delta value will be added.

      -
      -
      • -
    • -
      delta: number
      -

      The delta parameter is a number that represents the amount by which the property value of -each greater node should be increased.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name of the nodes in the binary tree that you want to update. If not provided, it defaults to -'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

allGreaterNodesAddCount

-
    - -
  • -

    The function allGreaterNodesAddCount updates the count property of all nodes in a binary tree that have an ID -greater than a given ID by a specified delta value.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | number | N
      -

      The node parameter can be one of the following:

      -
      -
      • -
    • -
      delta: number
      -

      The delta parameter is a number that represents the amount by which the count property -of each node should be increased.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

clear

-
-
-

createNode

-
    - -
  • -

    The function creates a new BSTNode with the given id, value, and count.

    -
    -
    -

    Parameters

    -
      -
    • -
      id: number
      -

      The id parameter is the unique identifier for the binary tree node. It is used to -distinguish one node from another in the tree.

      -
      -
      • -
    • -
      Optional val: N["val"]
      -

      The val parameter represents the value that will be stored in the binary search tree node.

      -
      -
      • -
    • -
      Optional count: number
      -

      The "count" parameter is an optional parameter of type number. It represents the number of -occurrences of the value in the binary search tree node. If not provided, the count will default to 1.

      -
      -
    -

    Returns N

    A new instance of the BSTNode class with the specified id, value, and count (if provided).

    - -
-
-

fill

-
    - -
  • -

    The fill function clears the binary tree and adds multiple nodes with the given IDs or nodes and optional data.

    -
    -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number)[] | (null | N)[]
      -

      The idsOrNodes parameter is an array that can contain either -BinaryTreeNodeId or N values.

      -
      -
      • -
    • -
      Optional data: N["val"][] | N[]
      -

      The data parameter is an optional array of values that will be assigned to -the nodes being added. If provided, the length of the data array should be equal to the length of the idsOrNodes -array. Each value in the data array will be assigned to the

      -
      -
    -

    Returns boolean

    The method is returning a boolean value.

    - -
-
-

get

-
    - -
  • -

    The function returns the first node in a binary tree that matches the given property name and value.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or a -generic type N. It represents the property of the binary tree node that you want to search for.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to use for searching the binary tree nodes. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns null | N

    The method is returning either a BinaryTreeNodeId or N (generic type) or null.

    - -
-
-

getDepth

-
    - -
  • -

    The function calculates the depth of a node in a binary tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      beginRoot: null | number | N
      -

      The beginRoot parameter can be one of the following:

      -
      -
    -

    Returns number

    the depth of the given node or binary tree.

    - -
-
-

getHeight

-
    - -
  • -

    The getHeight function calculates the maximum height of a binary tree, either recursively or iteratively.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | number | N
      -

      The beginRoot parameter is optional and can be of type N (a -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node), or null.

      -
      -
    -

    Returns number

    the height of the binary tree.

    - -
-
-

getLeftMost

-
    - -
  • -

    The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if -no node is specified. -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node), or null.

    -
    -

    Returns null | N

    The function getLeftMost returns the leftmost node in a binary tree. If the beginRoot parameter is -provided, it starts the traversal from that node. If beginRoot is not provided or is null, it starts the traversal -from the root of the binary tree. The function returns the leftmost node found during the traversal. If no leftmost -node is found (

    - -
    • - -
  • -

    The function getLeftMost returns the leftmost node in a binary tree, starting from a specified node or the root if -no node is specified.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional node: N
      -

      The beginRoot parameter is optional and can be of type N (a -generic type representing a node in a binary tree), BinaryTreeNodeId (a type representing the ID of a binary tree -node).

      -
      -
    -

    Returns N

    The function getLeftMost returns the leftmost node in a binary tree. If the beginRoot parameter is -provided, it starts the traversal from that node. If beginRoot is not provided or is null, it starts the traversal -from the root of the binary tree. The function returns the leftmost node found during the traversal. If no leftmost -node is found (

    - -
-
-

getMinHeight

-
    - -
  • -

    The getMinHeight function calculates the minimum height of a binary tree using either a recursive or iterative -approach.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | N
      -

      The beginRoot parameter is an optional parameter of type N or null. It -represents the starting node from which to calculate the minimum height of a binary tree. If no value is provided -for beginRoot, the this.root property is used as the default value.

      -
      -
    -

    Returns number

    The function getMinHeight returns the minimum height of the binary tree.

    - -
-
-

getNodes

-
    - -
  • -

    The function getNodes returns an array of nodes in a binary tree that match a given property value.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or an -N type. It represents the property of the binary tree node that you want to compare with.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName = 'id'
      -

      The propertyName parameter is an optional parameter that -specifies the property name to use for comparison. If not provided, it defaults to 'id'.

      -
      -
      • -
    • -
      Optional onlyOne: boolean
      -

      The onlyOne parameter is an optional boolean parameter that determines whether to -return only one node that matches the given nodeProperty or all nodes that match the nodeProperty. If onlyOne -is set to true, the function will return an array with only one node (if

      -
      -
    -

    Returns N[]

    an array of nodes (type N).

    - -
-
-

getNodesByCount

-
    - -
  • -

    The function getNodesByCount returns an array of nodes that have a specific count property, either recursively or -using a queue.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or a -N. It represents the property of the nodes that you want to search for.

      -
      -
      • -
    • -
      Optional onlyOne: boolean
      -

      The onlyOne parameter is an optional boolean parameter that determines whether to -return only one node that matches the nodeProperty or all nodes that match the nodeProperty. If onlyOne is set -to true, the function will return only one node. If onlyOne

      -
      -
    -

    Returns N[]

    an array of nodes that match the given nodeProperty.

    - -
-
-

getPathToRoot

-
    - -
  • -

    The function getPathToRoot returns an array of nodes representing the path from a given node to the root node, with -an option to reverse the order of the nodes.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The node parameter represents a node in a tree structure. It is of type N, which could be any -type that represents a node in your specific implementation.

      -
      -
      • -
    • -
      Optional isReverse: boolean = true
      -

      The isReverse parameter is a boolean flag that determines whether the resulting -path should be reversed or not. If isReverse is set to true, the path will be reversed before returning it. If -isReverse is set to false or not provided, the path will

      -
      -
    -

    Returns N[]

    The function getPathToRoot returns an array of nodes (N[]).

    - -
-
-

getPredecessor

-
    - -
  • -

    The function returns the predecessor of a given node in a binary tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: N
      -

      The parameter node is a BinaryTreeNode object, representing a node in a binary tree.

      -
      -
    -

    Returns N

    the predecessor of the given node in a binary tree.

    - -
-
-

getRightMost

-
    - -
  • -

    The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail -recursion optimization.

    -
    -

    Returns null | N

    The getRightMost function returns the rightmost node in a binary tree. It returns the -rightmost node starting from the root of the binary tree.

    - -
    • - -
  • -

    The getRightMost function returns the rightmost node in a binary tree, either recursively or iteratively using tail -recursion optimization.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional node: N
      -

      The node parameter is an optional parameter of type N or null. It represents the -starting node from which we want to find the rightmost node. If no node is provided, the function will default to -using the root node of the data structure.

      -
      -
    -

    Returns N

    The getRightMost function returns the rightmost node in a binary tree. It returns the rightmost node -starting from that node.

    - -
-
-

getSubTreeCount

-
    - -
  • -

    The function getSubTreeCount calculates the number of nodes and the sum of their counts in a subtree, using either -recursive or iterative traversal.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: undefined | null | N
      -

      The subTreeRoot parameter represents the root node of a subtree in a -binary tree.

      -
      -
    -

    Returns [number, number]

    The function getSubTreeCount returns an array [number, number].

    - -
-
-

getSubTreeSize

-
    - -
  • -

    The function calculates the size of a subtree by traversing it either recursively or iteratively.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: undefined | null | N
      -

      The subTreeRoot parameter represents the root node of a subtree in a -binary tree.

      -
      -
    -

    Returns number

    the size of the subtree rooted at subTreeRoot.

    - -
-
-

has

-
    - -
  • -

    The function checks if a binary tree node has a specific property.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeProperty: number | N
      -

      The nodeProperty parameter can be either a BinaryTreeNodeId or N. -It represents the property of the binary tree node that you want to check.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the name of the property to be checked in the nodes. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

isAVLBalanced

-
-
-

isBST

-
-
-

isEmpty

-
-
-

isPerfectlyBalanced

-
    - -
  • -

    The function checks if a binary tree is perfectly balanced by comparing the minimum height and the height of the -tree.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | N
      -

      The parameter beginRoot is of type N or null. It represents the root node of a -tree or null if the tree is empty.

      -
      -
    -

    Returns boolean

    The method is returning a boolean value.

    - -
-
-

isSubtreeBST

-
    - -
  • -

    The function checks if a binary search tree is valid by traversing it either recursively or iteratively.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The node parameter represents the root node of a binary search tree (BST).

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

lastKey

-
    - -
  • -

    The function returns the id of the rightmost node if the comparison between two values is less than, the id of the -leftmost node if the comparison is greater than, and the id of the rightmost node otherwise.

    -
    -

    Returns number

    The method lastKey() returns the id of the rightmost node in the binary tree if the comparison between -the values at index 0 and 1 is less than, otherwise it returns the id of the leftmost node. If the comparison is -equal, it returns the id of the rightmost node. If there are no nodes in the tree, it returns 0.

    - -
-
-

lesserSum

-
    - -
  • -

    The lesserSum function calculates the sum of property values in a binary tree for nodes that have a property value -less than a given node.

    -
    -
    -

    Parameters

    -
      -
    • -
      beginNode: null | number | N
      -

      The beginNode parameter can be one of the following:

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property name to use for calculating the sum. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns number

    The function lesserSum returns a number, which represents the sum of the values of the nodes in the -binary tree that have a lesser value than the specified beginNode based on the propertyName.

    - -
-
-

lesserSumCount

-
    - -
  • -

    The lesserSumCount function calculates the sum of the counts of all nodes in a binary tree that have a lesser -value than a given node.

    -
    -
    -

    Parameters

    -
      -
    • -
      beginNode: null | number | N
      -

      The beginNode parameter can be one of the following:

      -
      -
    -

    Returns number

    the sum of the counts of nodes in the binary tree that have a lesser value than the given beginNode.

    - -
-
-

levelIterative

-
    - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on their 'id' property.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N["val"][]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs a level-order traversal on a binary tree starting from the specified node and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The starting node for the level order traversal. If null, the root node of the tree is used as the starting node.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

listLevels

-
    - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
    -

    Returns number[][]

    A 2D array of AbstractBinaryTreeNodeProperty objects.

    - -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
    -

    Returns number[][]

    -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N["val"][][]

    A 2D array of 'val' properties from each node.

    - -
    • - -
  • -

    Collects nodes from a binary tree by a specified property and organizes them into levels.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The root node of the binary tree or null. If null, the function will use the root node of the current binary tree instance.

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[][]

    A 2D array of binary tree nodes.

    - -
-
-

listLevelsCount

-
    - -
  • -

    The function "listLevelsCount" takes a node and returns an array of arrays, where each inner array contains the -count property of each node at that level.

    -
    -
    -

    Parameters

    -
      -
    • -
      node: null | N
      -

      The parameter node is of type N | null. This means that it can either be an instance of -the class N or null.

      -
      -
    -

    Returns number[][]

    a 2D array of numbers. Each inner array represents a level in the binary tree, and each number in the inner -array represents the count property of a node in that level.

    - -
-
-

morris

-
    - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm.

    -
    -

    Returns number[]

    An array of binary tree node IDs.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates properties of each node based on the specified property name.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "id"
      -

      The name of the property to accumulate.

      -
      -
    -

    Returns number[]

    An array of values corresponding to the specified property.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates the 'val' property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "val"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[]

    An array of 'val' properties from each node.

    - -
    • - -
  • -

    Performs an in-order, pre-order, or post-order traversal on a binary tree using the Morris traversal algorithm and accumulates nodes themselves.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: DFSOrderPattern
      -

      The traversal pattern: 'in' (in-order), 'pre' (pre-order), or 'post' (post-order).

      -
      -
      • -
    • -
      Optional nodeOrPropertyName: "node"
      -

      The property of the BinaryTreeNode object to collect at each level.

      -
      -
    -

    Returns N[]

    An array of binary tree nodes.

    - -
-
-

morrisCount

-
    - -
  • -

    The morrisCount function returns an array of counts for each node in a binary tree, based on a specified traversal -pattern.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional pattern: "in" | "pre" | "post"
      -

      The pattern parameter is an optional parameter that specifies the -traversal pattern for the Morris traversal algorithm. It can have one of three values: 'in', 'pre', or 'post'.

      -
      -
    -

    Returns number[]

    The function morrisCount returns an array of numbers.

    - -
-
-

perfectlyBalance

-
    - -
  • -

    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 boolean

    The function perfectlyBalance() returns a boolean value.

    - -
-
-

remove

-
    - -
  • -

    The remove function removes a node from a binary search tree and returns the deleted node along with the parent -node that needs to be balanced.

    -
    -
    -

    Parameters

    -
      -
    • -
      nodeOrId: number | N
      -

      The nodeOrId parameter can be one of the following:

      -
      -
      • -
    • -
      Optional ignoreCount: boolean
      -

      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 removereturns an array ofBinaryTreeDeletedResult` objects.

      -
      -
    -

    Returns BinaryTreeDeletedResult<N>[]

    -
-
-

subTreeAdd

-
    - -
  • -

    The function subTreeAdd adds a delta value to a specified property of each node in a subtree.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: null | number | N
      -

      The subTreeRoot parameter represents the root node of a binary -tree or the ID of a node in the binary tree. It can also be null if there is no subtree to add to.

      -
      -
      • -
    • -
      delta: number
      -

      The delta parameter is a number that represents the amount by which the property value of -each node in the subtree should be incremented.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      The propertyName parameter is an optional parameter that -specifies the property of the binary tree node that should be modified. If not provided, it defaults to 'id'.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

subTreeAddCount

-
    - -
  • -

    The function subTreeAddCount recursively or iteratively traverses a binary tree and adds a given delta value to -the count property of each node.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: null | number | N
      -

      The subTreeRoot parameter represents the root node of a subtree -in a binary tree. It can be either a BinaryTreeNodeId (a unique identifier for a node in the binary tree), a -BinaryTreeNode object, or null if the subtree is empty.

      -
      -
      • -
    • -
      delta: number
      -

      The delta parameter is a number that represents the amount by which the count of each node -in the subtree should be increased or decreased.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

subTreeSum

-
    - -
  • -

    The function subTreeSum calculates the sum of a specified property in a binary tree or subtree.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: null | number | N
      -

      The subTreeRoot parameter represents the root node of a binary -tree or the ID of a binary tree node. It can also be null if there is no subtree.

      -
      -
      • -
    • -
      Optional propertyName: BinaryTreeNodePropertyName
      -

      propertyName is an optional parameter that specifies the -property of the binary tree node to use for calculating the sum. It can be either 'id' or 'val'. If propertyName is -not provided, it defaults to 'id'.

      -
      -
    -

    Returns number

    a number, which is the sum of the values of the specified property in the subtree rooted at subTreeRoot.

    - -
-
-

subTreeSumCount

-
    - -
  • -

    The function subTreeSumCount calculates the sum of the count property of each node in a subtree, either -recursively or iteratively.

    -
    -
    -

    Parameters

    -
      -
    • -
      subTreeRoot: null | number | N
      -

      The subTreeRoot parameter represents the root node of a subtree -in a binary tree. It can be either a BinaryTreeNodeId (a unique identifier for a node in the binary tree) or -null if the subtree is empty.

      -
      -
    -

    Returns number

    the sum of the count values of all nodes in the subtree rooted at subTreeRoot.

    - -
-
-

swapLocation

-
    - -
  • -

    The function swaps the location of two nodes in a tree data structure.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcNode: N
      -

      The source node that we want to swap with the destination node.

      -
      -
      • -
    • -
      destNode: N
      -

      The destNode parameter represents the destination node where the values from srcNode will -be swapped with.

      -
      -
    -

    Returns N

    the destNode after swapping its values with the srcNode.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/TreeMultisetNode.html b/docs/classes/TreeMultisetNode.html deleted file mode 100644 index e4519f1..0000000 --- a/docs/classes/TreeMultisetNode.html +++ /dev/null @@ -1,451 +0,0 @@ -TreeMultisetNode | data-structure-typed
-
- -
-
-
-
- -

Class TreeMultisetNode<V, NEIGHBOR>

-
-

Type Parameters

-
-
-

Hierarchy

-
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_count -
-
-

Accessors

-
count -familyPosition -height -id -left -parent -right -val -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor function initializes a BinaryTreeNode object with an id, value, and count.

    -
    -
    -

    Type Parameters

    -
    -
    -

    Parameters

    -
      -
    • -
      id: number
      -

      The id parameter is of type BinaryTreeNodeId and represents the unique identifier -of the binary tree node.

      -
      -
      • -
    • -
      Optional val: V
      -

      The val parameter is an optional parameter of type V. It represents the value of the binary -tree node. If no value is provided, it will be undefined.

      -
      -
      • -
    • -
      Optional count: number = 1
      -

      The count parameter is a number that represents the number of times a particular value -occurs in a binary tree node. It has a default value of 1, which means that if no value is provided for the count -parameter when creating a new instance of the BinaryTreeNode class,

      -
      -
    -

    Returns TreeMultisetNode<V, NEIGHBOR>

    -
-
-

Properties

-
-

Private _count

-
_count: number
-
-

Accessors

-
-

count

-
-
-

familyPosition

-
-
-

height

-
-
-

id

-
-
-

left

-
-
-

parent

-
-
-

right

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/TreeNode.html b/docs/classes/TreeNode.html deleted file mode 100644 index fb7bc41..0000000 --- a/docs/classes/TreeNode.html +++ /dev/null @@ -1,348 +0,0 @@ -TreeNode | data-structure-typed
-
- -
-
-
-
- -

Class TreeNode<V>

-
-

Type Parameters

-
    -
  • -

    V = any

-
-

Hierarchy

-
    -
  • TreeNode
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_children? -_id -_value? -
-
-

Accessors

-
children -id -value -
-
-

Methods

-
addChildren -getHeight -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Private Optional _children

-
_children?: TreeNode<V>[]
-
-

Private _id

-
_id: string
-
-

Private Optional _value

-
_value?: V
-
-

Accessors

-
-

children

-
-
-

id

-
-
-

value

-
-
-

Methods

-
-

addChildren

-
-
-

getHeight

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/TreeSet.html b/docs/classes/TreeSet.html deleted file mode 100644 index 9e8fad4..0000000 --- a/docs/classes/TreeSet.html +++ /dev/null @@ -1,206 +0,0 @@ -TreeSet | data-structure-typed
-
- -
-
-
-
- -

Class TreeSet

-
-

Hierarchy

-
    -
  • TreeSet
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Constructors

-
-

constructor

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/Trie.html b/docs/classes/Trie.html deleted file mode 100644 index 01fd35e..0000000 --- a/docs/classes/Trie.html +++ /dev/null @@ -1,406 +0,0 @@ -Trie | data-structure-typed
-
- -
-
-
-
- -

Class Trie

-
-

Hierarchy

-
    -
  • Trie
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_root -
-
-

Accessors

-
root -
-
-

Methods

-
add -getAll -getLongestCommonPrefix -has -isAbsPrefix -isCommonPrefix -isPrefix -remove -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Protected _root

-
_root: TrieNode
-
-

Accessors

-
-

root

-
-
-

Methods

-
-

add

-
-
-

getAll

-
    - -
  • -

    The getAll function returns an array of all words in a Trie data structure that start with a given prefix.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional prefix: string = ''
      -

      The prefix parameter is a string that represents the prefix that we want to search for in the -trie. It is an optional parameter, so if no prefix is provided, it will default to an empty string.

      -
      -
    -

    Returns string[]

    an array of strings.

    - -
-
-

getLongestCommonPrefix

-
    - -
  • -

    The function getLongestCommonPrefix returns the longest common prefix among all the words stored in a Trie data -structure.

    -
    -

    Returns string

    The function getLongestCommonPrefix returns a string, which is the longest common prefix found in the -Trie.

    - -
-
-

has

-
-
-

isAbsPrefix

-
    - -
  • -

    The function checks if a given input string has an absolute prefix in a tree data structure.Only can present as a prefix, not a word

    -
    -
    -

    Parameters

    -
      -
    • -
      input: string
      -

      The input parameter is a string that represents the input value for the function.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

isCommonPrefix

-
    - -
  • -

    The function checks if the input string is a common prefix in a Trie data structure.Check if the input string is the common prefix of all the words

    -
    -
    -

    Parameters

    -
      -
    • -
      input: string
      -

      The input parameter is a string that represents the common prefix that we want to check for -in the Trie data structure.

      -
      -
    -

    Returns boolean

    a boolean value indicating whether the input string is a common prefix in the Trie data structure.

    - -
-
-

isPrefix

-
    - -
  • -

    The function checks if a given input string is a prefix of any existing string in a tree structure.Can present as a abs prefix or word

    -
    -
    -

    Parameters

    -
      -
    • -
      input: string
      -

      The input parameter is a string that represents the prefix we want to check.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

remove

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/TrieNode.html b/docs/classes/TrieNode.html deleted file mode 100644 index 45ea729..0000000 --- a/docs/classes/TrieNode.html +++ /dev/null @@ -1,314 +0,0 @@ -TrieNode | data-structure-typed
-
- -
-
-
-
- -

Class TrieNode

-
-

data-structure-typed

-
-
-

Author

Tyler Zeng

- -

Copyright

Copyright (c) 2022 Tyler Zeng zrwusa@gmail.com

- -

License

MIT License

-
-
-

Hierarchy

-
    -
  • TrieNode
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_children -_isEnd -_val -
-
-

Accessors

-
children -isEnd -val -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Protected _children

-
_children: Map<string, TrieNode>
-
-

Protected _isEnd

-
_isEnd: boolean
-
-

Private _val

-
_val: string
-
-

Accessors

-
-

children

-
-
-

isEnd

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/TwoThreeTree.html b/docs/classes/TwoThreeTree.html deleted file mode 100644 index defb3bd..0000000 --- a/docs/classes/TwoThreeTree.html +++ /dev/null @@ -1,206 +0,0 @@ -TwoThreeTree | data-structure-typed
-
- -
-
-
-
- -

Class TwoThreeTree

-
-

Hierarchy

-
    -
  • TwoThreeTree
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Constructors

-
-

constructor

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/UndirectedEdge.html b/docs/classes/UndirectedEdge.html deleted file mode 100644 index a2de963..0000000 --- a/docs/classes/UndirectedEdge.html +++ /dev/null @@ -1,378 +0,0 @@ -UndirectedEdge | data-structure-typed
-
- -
-
-
-
- -

Class UndirectedEdge<V>

-
-

Type Parameters

-
    -
  • -

    V = number

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_hashCode -_vertices -
-
-

Accessors

-
hashCode -val -vertices -weight -
-
-

Methods

-
_setHashCode -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor function creates an instance of a class with two vertex IDs, an optional weight, and an optional -value.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      V = number

    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId
      -

      The first vertex ID of the edge.

      -
      -
      • -
    • -
      v2: VertexId
      -

      The parameter v2 is a VertexId, which represents the identifier of the second vertex in a -graph edge.

      -
      -
      • -
    • -
      Optional weight: number
      -

      The weight parameter is an optional number that represents the weight of the edge.

      -
      -
      • -
    • -
      Optional val: V
      -

      The "val" parameter is an optional parameter of type V. It is used to store a value associated -with the edge.

      -
      -
    -

    Returns UndirectedEdge<V>

    -
-
-

Properties

-
-

Protected _hashCode

-
_hashCode: string
-
-

Private _vertices

-
_vertices: [VertexId, VertexId]
-
-

Accessors

-
-

hashCode

-
-
-

val

-
-
-

vertices

-
-
-

weight

-
-
-

Methods

-
-

Protected _setHashCode

-
    -
  • _setHashCode(v): void
    • -
  • -

    The function sets the value of the _hashCode property to the provided string.

    -
    -
    -

    Parameters

    -
      -
    • -
      v: string
      -

      The parameter "v" is of type string and represents the value that will be assigned to the -"_hashCode" property.

      -
      -
    -

    Returns void

    -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/UndirectedGraph.html b/docs/classes/UndirectedGraph.html deleted file mode 100644 index f0817dc..0000000 --- a/docs/classes/UndirectedGraph.html +++ /dev/null @@ -1,1289 +0,0 @@ -UndirectedGraph | data-structure-typed
-
- -
-
-
-
- -

Class UndirectedGraph<V, E>

-
-

Type Parameters

-
-
-

Hierarchy

-
-
-

Implements

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
_edges -
-
-

Accessors

-
edges -vertices -
-
-

Methods

-
_addEdgeOnly -_addVertexOnly -_getVertex -_getVertexId -_setEdges -_setVertices -addEdge -addVertex -bellmanFord -createEdge -createVertex -degreeOf -dijkstra -dijkstraWithoutHeap -edgeSet -edgesOf -floyd -getAllPathsBetween -getEdge -getEndsOfEdge -getMinCostBetween -getMinPathBetween -getNeighbors -getPathSumWeight -getVertex -hasEdge -hasVertex -removeAllVertices -removeEdge -removeEdgeBetween -removeVertex -setEdgeWeight -tarjan -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

Protected _edges

-
_edges: Map<V, E[]>
-
-

Accessors

-
-

edges

-
-
-

vertices

-
-
-

Methods

-
-

Protected _addEdgeOnly

-
    -
  • _addEdgeOnly(edge): boolean
    • -
  • -

    The function adds an edge to the graph by updating the adjacency list with the vertices of the edge.

    -
    -
    -

    Parameters

    -
      -
    • -
      edge: E
      -

      The parameter "edge" is of type E, which represents an edge in a graph.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

Protected _addVertexOnly

-
-
-

Protected _getVertex

-
-
-

Protected _getVertexId

-
-
-

Protected _setEdges

-
    -
  • _setEdges(v): void
    • -
  • -

    The function sets the edges of a graph.

    -
    -
    -

    Parameters

    -
      -
    • -
      v: Map<V, E[]>
      -

      A map where the keys are of type V and the values are arrays of type E.

      -
      -
    -

    Returns void

    -
-
-

Protected _setVertices

-
-
-

addEdge

-
-
-

addVertex

-
-
-

bellmanFord

-
    - -
  • -

    BellmanFord time:O(VE) space:O(V) -one to rest pairs -/

    -

    /** -BellmanFord time:O(VE) space:O(V) -one to rest pairs -The Bellman-Ford algorithm is also used to find the shortest paths from a source node to all other nodes in a graph. Unlike Dijkstra's algorithm, it can handle edge weights that are negative. Its basic idea involves iterative relaxation of all edges for several rounds to gradually approximate the shortest paths. Due to its ability to handle negative-weight edges, the Bellman-Ford algorithm is more flexible in some scenarios. -The bellmanFord function implements the Bellman-Ford algorithm to find the shortest path from a source vertex to -all other vertices in a graph, and optionally detects negative cycles and generates the minimum path.

    -
    -
    -

    Parameters

    -
      -
    • -
      src: VertexId | V
      -

      The src parameter is the source vertex from which the Bellman-Ford algorithm will -start calculating the shortest paths. It can be either a vertex object or a vertex ID.

      -
      -
      • -
    • -
      Optional scanNegativeCycle: boolean
      -

      A boolean flag indicating whether to scan for negative cycles in the graph.

      -
      -
      • -
    • -
      Optional getMin: boolean
      -

      The getMin parameter is a boolean flag that determines whether the algorithm should -calculate the minimum distance from the source vertex to all other vertices in the graph. If getMin is set to -true, the algorithm will find the minimum distance and update the min variable with the minimum

      -
      -
      • -
    • -
      Optional genPath: boolean
      -

      A boolean flag indicating whether to generate paths for all vertices from the source -vertex.

      -
      -
    -

    Returns {
        distMap: Map<V, number>;
        hasNegativeCycle: undefined | boolean;
        min: number;
        minPath: V[];
        paths: V[][];
        preMap: Map<V, V>;
    }

    The function bellmanFord returns an object with the following properties:

    - -
      -
    • -
      distMap: Map<V, number>
      • -
    • -
      hasNegativeCycle: undefined | boolean
      • -
    • -
      min: number
      • -
    • -
      minPath: V[]
      • -
    • -
      paths: V[][]
      • -
    • -
      preMap: Map<V, V>
    -
-
-

createEdge

-
    - -
  • -

    The function creates an undirected edge between two vertices with an optional weight and value.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId
      -

      The parameter v1 represents the first vertex of the edge.

      -
      -
      • -
    • -
      v2: VertexId
      -

      The parameter v2 represents the second vertex of the edge.

      -
      -
      • -
    • -
      Optional weight: number
      -

      The weight parameter is an optional number that represents the weight of the edge. If -no weight is provided, it defaults to 1.

      -
      -
      • -
    • -
      Optional val: E["val"]
      -

      The val parameter is an optional value that can be assigned to the edge. It can be of any type and -is used to store additional information or data associated with the edge.

      -
      -
    -

    Returns E

    a new instance of the UndirectedEdge class, which is casted as type E.

    - -
-
-

createVertex

-
    - -
  • -

    The function creates a new vertex with an optional value and returns it.

    -
    -
    -

    Parameters

    -
      -
    • -
      id: VertexId
      -

      The id parameter is the unique identifier for the vertex. It is used to distinguish one -vertex from another in the graph.

      -
      -
      • -
    • -
      Optional val: V["val"]
      -

      The val parameter is an optional value that can be assigned to the vertex. If a value is provided, -it will be used as the value of the vertex. If no value is provided, the id parameter will be used as the value of -the vertex.

      -
      -
    -

    Returns V

    The method is returning a new instance of the UndirectedVertex class, casted as type V.

    - -
-
-

degreeOf

-
    - -
  • -

    The function degreeOf returns the degree of a vertex in a graph, which is the number of edges connected to that -vertex.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexOrId: VertexId | V
      -

      The parameter vertexOrId can be either a VertexId or a V.

      -
      -
    -

    Returns number

    The function degreeOf returns the degree of a vertex in a graph. The degree of a vertex is the number of -edges connected to that vertex.

    - -
-
-

dijkstra

-
    - -
  • -

    Dijkstra algorithm time: O(logVE) space: O(V + E)

    -

    Dijkstra's algorithm only solves the single-source shortest path problem, while the Bellman-Ford algorithm and Floyd-Warshall algorithm can address shortest paths between all pairs of nodes. -Dijkstra's algorithm is suitable for graphs with non-negative edge weights, whereas the Bellman-Ford algorithm and Floyd-Warshall algorithm can handle negative-weight edges. -The time complexity of Dijkstra's algorithm and the Bellman-Ford algorithm depends on the size of the graph, while the time complexity of the Floyd-Warshall algorithm is O(V^3), where V is the number of nodes. For dense graphs, Floyd-Warshall might become slower.

    -

    /

    -

    /** -Dijkstra's algorithm is used to find the shortest paths from a source node to all other nodes in a graph. Its basic idea is to repeatedly choose the node closest to the source node and update the distances of other nodes using this node as an intermediary. Dijkstra's algorithm requires that the edge weights in the graph are non-negative. -The dijkstra function implements Dijkstra's algorithm to find the shortest path between a source vertex and an -optional destination vertex, and optionally returns the minimum distance, the paths, and other information.

    -
    -
    -

    Parameters

    -
      -
    • -
      src: VertexId | V
      -

      The src parameter represents the source vertex from which the Dijkstra algorithm will -start. It can be either a vertex object or a vertex ID.

      -
      -
      • -
    • -
      Optional dest: null | VertexId | V
      -

      The dest parameter is the destination vertex or vertex ID. It specifies the -vertex to which the shortest path is calculated from the source vertex. If no destination is provided, the algorithm -will calculate the shortest paths to all other vertices from the source vertex.

      -
      -
      • -
    • -
      Optional getMinDist: boolean
      -

      The getMinDist parameter is a boolean flag that determines whether the minimum -distance from the source vertex to the destination vertex should be calculated and returned in the result. If -getMinDist is set to true, the minDist property in the result will contain the minimum distance

      -
      -
      • -
    • -
      Optional genPaths: boolean
      -

      The genPaths parameter is a boolean flag that determines whether or not to generate -paths in the Dijkstra algorithm. If genPaths is set to true, the algorithm will calculate and return the -shortest paths from the source vertex to all other vertices in the graph. If genPaths @returns The function dijkstrareturns an object of typeDijkstraResult`.

      -
      -
    -

    Returns DijkstraResult<V>

    -
-
-

dijkstraWithoutHeap

-
    - -
  • -

    Dijkstra algorithm time: O(VE) space: O(V + E) -/

    -

    /** -Dijkstra algorithm time: O(VE) space: O(V + E) -The function dijkstraWithoutHeap implements Dijkstra's algorithm to find the shortest path between two vertices in -a graph without using a heap data structure.

    -
    -
    -

    Parameters

    -
      -
    • -
      src: VertexId | V
      -

      The source vertex from which to start the Dijkstra's algorithm. It can be either a -vertex object or a vertex ID.

      -
      -
      • -
    • -
      Optional dest: null | VertexId | V
      -

      The dest parameter in the dijkstraWithoutHeap function is an optional -parameter that specifies the destination vertex for the Dijkstra algorithm. It can be either a vertex object or its -identifier. If no destination is provided, the value is set to null.

      -
      -
      • -
    • -
      Optional getMinDist: boolean
      -

      The getMinDist parameter is a boolean flag that determines whether the minimum -distance from the source vertex to the destination vertex should be calculated and returned in the result. If -getMinDist is set to true, the minDist property in the result will contain the minimum distance

      -
      -
      • -
    • -
      Optional genPaths: boolean
      -

      The genPaths parameter is a boolean flag that determines whether or not to generate -paths in the Dijkstra algorithm. If genPaths is set to true, the algorithm will calculate and return the -shortest paths from the source vertex to all other vertices in the graph. If genPaths @returns The function dijkstraWithoutHeapreturns an object of typeDijkstraResult`.

      -
      -
    -

    Returns DijkstraResult<V>

    -
-
-

edgeSet

-
-
-

edgesOf

-
-
-

floyd

-
    - -
  • -

    Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle -all pairs -/

    -

    /** -Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle -all pairs -The Floyd-Warshall algorithm is used to find the shortest paths between all pairs of nodes in a graph. It employs dynamic programming to compute the shortest paths from any node to any other node. The Floyd-Warshall algorithm's advantage lies in its ability to handle graphs with negative-weight edges, and it can simultaneously compute shortest paths between any two nodes. -The function implements the Floyd-Warshall algorithm to find the shortest path between all pairs of vertices in a -graph.

    -
    -

    Returns {
        costs: number[][];
        predecessor: (null | V)[][];
    }

    The function floyd() returns an object with two properties: costs and predecessor. The costs -property is a 2D array of numbers representing the shortest path costs between vertices in a graph. The -predecessor property is a 2D array of vertices (or null) representing the predecessor vertices in the shortest -path between vertices in the

    - -
      -
    • -
      costs: number[][]
      • -
    • -
      predecessor: (null | V)[][]
    -
-
-

getAllPathsBetween

-
    - -
  • -

    The function getAllPathsBetween finds all paths between two vertices in a graph using depth-first search.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 represents either a vertex object (V) or a vertex ID (VertexId). -It is the starting vertex for finding paths.

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      The parameter v2 represents either a vertex object (V) or a vertex ID (VertexId).

      -
      -
    -

    Returns V[][]

    The function getAllPathsBetween returns an array of arrays of vertices (V[][]).

    - -
-
-

getEdge

-
    - -
  • -

    The function getEdge returns the first edge that connects two vertices, or null if no such edge exists.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: null | VertexId | V
      -

      The parameter v1 represents a vertex or vertex ID. It can be of type V (vertex -object), null, or VertexId (a string or number representing the ID of a vertex).

      -
      -
      • -
    • -
      v2: null | VertexId | V
      -

      The parameter v2 represents a vertex or vertex ID. It can be of type V (vertex -object), null, or VertexId (vertex ID).

      -
      -
    -

    Returns null | E

    an edge (E) or null.

    - -
-
-

getEndsOfEdge

-
    - -
  • -

    The function "getEndsOfEdge" returns the vertices at the ends of an edge if the edge exists in the graph, otherwise -it returns null.

    -
    -
    -

    Parameters

    -
      -
    • -
      edge: E
      -

      The parameter "edge" is of type E, which represents an edge in a graph.

      -
      -
    -

    Returns null | [V, V]

    The function getEndsOfEdge returns an array containing two vertices [V, V] if the edge exists in the -graph. If the edge does not exist, it returns null.

    - -
-
-

getMinCostBetween

-
    - -
  • -

    The function getMinCostBetween calculates the minimum cost between two vertices in a graph, either based on edge -weights or using a breadth-first search algorithm.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 represents the starting vertex or its ID.

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      The parameter v2 represents the destination vertex or its ID. It is the vertex to which -you want to find the minimum cost or weight from the source vertex v1.

      -
      -
      • -
    • -
      Optional isWeight: boolean
      -

      isWeight is an optional parameter that indicates whether the graph edges have weights. -If isWeight is set to true, the function will calculate the minimum cost between v1 and v2 based on the weights of -the edges. If isWeight is set to false or not provided, the function will calculate the

      -
      -
    -

    Returns null | number

    The function getMinCostBetween returns a number representing the minimum cost between two vertices (v1 -and v2). If the isWeight parameter is true, it calculates the minimum weight among all paths between the -vertices. If isWeight is false or not provided, it uses a breadth-first search (BFS) algorithm to calculate the -minimum number of

    - -
-
-

getMinPathBetween

-
    - -
  • -

    The function getMinPathBetween returns the minimum path between two vertices in a graph, either based on weight or -using a breadth-first search algorithm.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 represents the starting vertex of the path. It can be either a vertex -object (V) or a vertex ID (VertexId).

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      V | VertexId - The second vertex or vertex ID between which we want to find the minimum -path.

      -
      -
      • -
    • -
      Optional isWeight: boolean
      -

      A boolean flag indicating whether to consider the weight of edges in finding the -minimum path. If set to true, the function will use Dijkstra's algorithm to find the minimum weighted path. If set -to false, the function will use breadth-first search (BFS) to find the minimum path.

      -
      -
    -

    Returns null | V[]

    The function getMinPathBetween returns an array of vertices (V[]) representing the minimum path between -two vertices (v1 and v2). If there is no path between the vertices, it returns null.

    - -
-
-

getNeighbors

-
-
-

getPathSumWeight

-
    - -
  • -

    The function calculates the sum of weights along a given path.

    -
    -
    -

    Parameters

    -
      -
    • -
      path: V[]
      -

      An array of vertices (V) representing a path in a graph.

      -
      -
    -

    Returns number

    The function getPathSumWeight returns the sum of the weights of the edges in the given path.

    - -
-
-

getVertex

-
    - -
  • -

    The function "getVertex" returns the vertex with the specified ID or null if it doesn't exist.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertexId: VertexId
      -

      The vertexId parameter is the identifier of the vertex that you want to retrieve from -the _vertices map.

      -
      -
    -

    Returns null | V

    The method getVertex returns the vertex with the specified vertexId if it exists in the _vertices -map. If the vertex does not exist, it returns null.

    - -
-
-

hasEdge

-
    - -
  • -

    The function checks if there is an edge between two vertices and returns a boolean value indicating the result.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 can be either a VertexId or a V. A VertexId represents the unique -identifier of a vertex in a graph, while V represents the type of the vertex object itself.

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      The parameter v2 represents the second vertex in the edge. It can be either a -VertexId or a V type, which represents the type of the vertex.

      -
      -
    -

    Returns boolean

    A boolean value is being returned.

    - -
-
-

hasVertex

-
-
-

removeAllVertices

-
    - -
  • -

    The function removes all vertices from a graph and returns a boolean indicating if any vertices were removed.

    -
    -
    -

    Parameters

    -
      -
    • -
      vertices: VertexId[] | V[]
      -

      The vertices parameter can be either an array of vertices (V[]) or an array -of vertex IDs (VertexId[]).

      -
      -
    -

    Returns boolean

    a boolean value. It returns true if at least one vertex was successfully removed, and false if no vertices -were removed.

    - -
-
-

removeEdge

-
-
-

removeEdgeBetween

-
    - -
  • -

    The function removes an edge between two vertices in a graph and returns the removed edge.

    -
    -
    -

    Parameters

    -
      -
    • -
      v1: VertexId | V
      -

      The parameter v1 represents either a vertex object (V) or a vertex ID (VertexId).

      -
      -
      • -
    • -
      v2: VertexId | V
      -

      V | VertexId - This parameter can be either a vertex object (V) or a vertex ID -(VertexId). It represents the second vertex of the edge that needs to be removed.

      -
      -
    -

    Returns null | E

    the removed edge (E) if it exists, or null if either of the vertices (V) does not exist.

    - -
-
-

removeVertex

-
-
-

setEdgeWeight

-
    - -
  • -

    The function sets the weight of an edge between two vertices in a graph.

    -
    -
    -

    Parameters

    -
      -
    • -
      srcOrId: VertexId | V
      -

      The srcOrId parameter can be either a VertexId or a V object. It represents -the source vertex of the edge.

      -
      -
      • -
    • -
      destOrId: VertexId | V
      -

      The destOrId parameter represents the destination vertex of the edge. It can be -either a VertexId or a vertex object V.

      -
      -
      • -
    • -
      weight: number
      -

      The weight parameter represents the weight of the edge between the source vertex (srcOrId) -and the destination vertex (destOrId).

      -
      -
    -

    Returns boolean

    a boolean value. If the edge exists between the source and destination vertices, the function will update -the weight of the edge and return true. If the edge does not exist, the function will return false.

    - -
-
-

tarjan

-
    - -
  • -

    Tarjan is an algorithm based on DFS,which is used to solve the connectivity problem of graphs. -Tarjan can find cycles in directed or undirected graph -Tarjan can find the articulation points and bridges(critical edges) of undirected graphs in linear time, -Tarjan solve the bi-connected components of undirected graphs; -Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs. -/

    -

    /** -Tarjan is an algorithm based on DFS,which is used to solve the connectivity problem of graphs. -Tarjan can find cycles in directed or undirected graph -Tarjan can find the articulation points and bridges(critical edges) of undirected graphs in linear time, -Tarjan solve the bi-connected components of undirected graphs; -Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs. -The tarjan function is used to perform various graph analysis tasks such as finding articulation points, bridges, -strongly connected components (SCCs), and cycles in a graph.

    -
    -
    -

    Parameters

    -
      -
    • -
      Optional needArticulationPoints: boolean
      -

      A boolean value indicating whether or not to calculate and return the -articulation points in the graph. Articulation points are the vertices in a graph whose removal would increase the -number of connected components in the graph.

      -
      -
      • -
    • -
      Optional needBridges: boolean
      -

      A boolean flag indicating whether the algorithm should find and return the bridges -(edges whose removal would increase the number of connected components in the graph).

      -
      -
      • -
    • -
      Optional needSCCs: boolean
      -

      A boolean value indicating whether the Strongly Connected Components (SCCs) of the -graph are needed. If set to true, the function will calculate and return the SCCs of the graph. If set to false, the -SCCs will not be calculated or returned.

      -
      -
      • -
    • -
      Optional needCycles: boolean
      -

      A boolean flag indicating whether the algorithm should find cycles in the graph. If -set to true, the algorithm will return a map of cycles, where the keys are the low values of the SCCs and the values -are arrays of vertices that form cycles within the SCCs.

      -
      -
    -

    Returns {
        SCCs: Map<number, V[]>;
        articulationPoints: V[];
        bridges: E[];
        cycles: Map<number, V[]>;
        dfnMap: Map<V, number>;
        lowMap: Map<V, number>;
    }

    The function tarjan returns an object with the following properties:

    - -
      -
    • -
      SCCs: Map<number, V[]>
      • -
    • -
      articulationPoints: V[]
      • -
    • -
      bridges: E[]
      • -
    • -
      cycles: Map<number, V[]>
      • -
    • -
      dfnMap: Map<V, number>
      • -
    • -
      lowMap: Map<V, number>
    -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/UndirectedVertex.html b/docs/classes/UndirectedVertex.html deleted file mode 100644 index 6a39e79..0000000 --- a/docs/classes/UndirectedVertex.html +++ /dev/null @@ -1,288 +0,0 @@ -UndirectedVertex | data-structure-typed
-
- -
-
-
-
- -

Class UndirectedVertex<V>

-
-

Type Parameters

-
    -
  • -

    V = any

-
-

Hierarchy

-
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Accessors

-
id -val -
-
-

Constructors

-
-

constructor

-
    - -
  • -

    The constructor function initializes a vertex with an optional value.

    -
    -
    -

    Type Parameters

    -
      -
    • -

      V = any

    -
    -

    Parameters

    -
      -
    • -
      id: VertexId
      -

      The id parameter is of type VertexId and represents the identifier of the vertex. It is -used to uniquely identify the vertex within a graph or network.

      -
      -
      • -
    • -
      Optional val: V
      -

      The "val" parameter is an optional parameter of type V. It is used to initialize the value of the -vertex. If no value is provided, the vertex will be initialized with a default value.

      -
      -
    -

    Returns UndirectedVertex<V>

    -
-
-

Accessors

-
-

id

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/classes/Vector2D.html b/docs/classes/Vector2D.html deleted file mode 100644 index 2dcbc0a..0000000 --- a/docs/classes/Vector2D.html +++ /dev/null @@ -1,839 +0,0 @@ -Vector2D | data-structure-typed
-
- -
-
-
-
- -

Class Vector2D

-
-

data-structure-typed

-
-
-

Author

Tyler Zeng

- -

Copyright

Copyright (c) 2022 Tyler Zeng zrwusa@gmail.com

- -

License

MIT License

-
-
-

Hierarchy

-
    -
  • Vector2D
-
-
-
- -
-
-

Constructors

-
constructor -
-
-

Properties

-
w -x -y -
-
-

Accessors

-
isZero -length -lengthSq -rounded -
-
-

Methods

-
zero -abs -add -angle -distance -distanceSq -divide -dot -equals -equalsRounded -multiply -normalize -perp -random -reverse -sign -subtract -subtractValue -truncate -
-
-

Constructors

-
-

constructor

-
-
-

Properties

-
-

w

-
w: number = 1
-
-

x

-
x: number = 0
-
-

y

-
y: number = 0
-
-

Accessors

-
-

isZero

-
    -
  • get isZero(): boolean
    • -
  • -

    The function checks if the x and y values of a point are both zero.

    -
    -

    Returns boolean

    A boolean value indicating whether both the x and y properties of the object are equal to 0.

    - -
-
-

length

-
    -
  • get length(): number
    • -
  • -

    The above function calculates the length of a vector using the Pythagorean theorem.

    -
    -

    Returns number

    The length of a vector, calculated using the Pythagorean theorem.

    - -
-
-

lengthSq

-
    -
  • get lengthSq(): number
    • -
  • -

    The function calculates the square of the length of a vector.

    -
    -

    Returns number

    The method is returning the sum of the squares of the x and y values.

    - -
-
-

rounded

-
    -
  • get rounded(): Vector2D
    • -
  • -

    The "rounded" function returns a new Vector2D object with the x and y values rounded to the nearest whole number.

    -
    -

    Returns Vector2D

    The method is returning a new instance of the Vector2D class with the x and y values rounded to the nearest -whole number.

    - -
-
-

Methods

-
-

zero

-
-
-

Static abs

-
    - -
  • -

    The function takes a Vector2D object as input and returns a new Vector2D object with the absolute values of its x -and y components.

    -
    -
    -

    Parameters

    -
      -
    • -
      vector: Vector2D
      -

      The parameter "vector" is of type Vector2D, which represents a 2-dimensional vector. It -has two properties: "x" and "y", which represent the x and y components of the vector, respectively.

      -
      -
    -

    Returns Vector2D

    The method is returning a new Vector2D object with the absolute values of the x and y components of the -input vector.

    - -
-
-

Static add

-
    - -
  • -

    The function "add" takes two Vector2D objects as parameters and returns a new Vector2D object with the sum of their -x and y components.

    -
    -
    -

    Parameters

    -
      -
    • -
      vector1: Vector2D
      -

      The parameter vector1 is an instance of the Vector2D class. It represents a -2-dimensional vector with an x and y component.

      -
      -
      • -
    • -
      vector2: Vector2D
      -

      The parameter "vector2" is of type Vector2D. It represents a 2-dimensional vector with -an x and y component.

      -
      -
    -

    Returns Vector2D

    The method is returning a new instance of the Vector2D class with the x and y components of the two input -vectors added together.

    - -
-
-

Static angle

-
    - -
  • -

    The function calculates the angle between a given vector and the negative y-axis.

    -
    -
    -

    Parameters

    -
      -
    • -
      vector: Vector2D
      -

      The "vector" parameter is an instance of the Vector2D class, which represents a -2-dimensional vector. It has two properties: "x" and "y", which represent the x and y components of the vector, -respectively.

      -
      -
    -

    Returns number

    the angle between the given vector and the vector (0, -1) in radians.Returns the angle between origin and the given vector in radians

    - -
-
-

Static distance

-
    - -
  • -

    The function calculates the distance between two points in a two-dimensional space.

    -
    -
    -

    Parameters

    -
      -
    • -
      vector1: Vector2D
      -

      The parameter vector1 represents the first vector in 2D space, while vector2 -represents the second vector. Each vector has an x and y component, which represent their respective coordinates -in the 2D space.

      -
      -
      • -
    • -
      vector2: Vector2D
      -

      The vector2 parameter represents the second vector in the calculation of distance. It -is an instance of the Vector2D class, which typically has properties x and y representing the coordinates of -the vector in a 2D space.

      -
      -
    -

    Returns number

    The distance between vector1 and vector2.

    - -
-
-

Static distanceSq

-
    - -
  • -

    The function calculates the squared distance between two 2D vectors.

    -
    -
    -

    Parameters

    -
      -
    • -
      vector1: Vector2D
      -

      The parameter vector1 represents the first vector, which is an instance of the -Vector2D class. It contains the x and y coordinates of the vector.

      -
      -
      • -
    • -
      vector2: Vector2D
      -

      The vector2 parameter represents the second vector in a two-dimensional space. It has -properties x and y which represent the coordinates of the vector.

      -
      -
    -

    Returns number

    the square of the distance between the two input vectors.

    - -
-
-

Static divide

-
    - -
  • -

    The function divides the x and y components of a Vector2D by a given value and returns a new Vector2D.

    -
    -
    -

    Parameters

    -
      -
    • -
      vector: Vector2D
      -

      The parameter "vector" is of type Vector2D, which represents a 2-dimensional vector with -x and y components.

      -
      -
      • -
    • -
      value: number
      -

      The value parameter is a number that will be used to divide the x and y components of the -vector.

      -
      -
    -

    Returns Vector2D

    A new instance of the Vector2D class with the x and y values divided by the given value.

    - -
-
-

Static dot

-
    - -
  • -

    The dot function calculates the dot product of two 2D vectors.The dot product of v1 and v2

    -
    -
    -

    Parameters

    -
      -
    • -
      vector1: Vector2D
      -

      The parameter vector1 represents a 2D vector with its x and y components.

      -
      -
      • -
    • -
      vector2: Vector2D
      -

      The "vector2" parameter is a Vector2D object. It represents a two-dimensional vector -with an x and y component.

      -
      -
    -

    Returns number

    The dot product of the two input vectors.

    - -
-
-

Static equals

-
    - -
  • -

    The function checks if two Vector2D objects are equal by comparing their x and y values.

    -
    -
    -

    Parameters

    -
      -
    • -
      vector1: Vector2D
      -

      The parameter vector1 is of type Vector2D, which represents a 2-dimensional vector. -It has two properties: x and y, which represent the x and y components of the vector, respectively.

      -
      -
      • -
    • -
      vector2: Vector2D
      -

      The parameter "vector2" is of type Vector2D.

      -
      -
    -

    Returns boolean

    a boolean value, which indicates whether the two input vectors are equal or not.

    - -
-
-

Static equalsRounded

-
    - -
  • -

    The function checks if two Vector2D objects are equal within a specified rounding factor.

    -
    -
    -

    Parameters

    -
      -
    • -
      vector1: Vector2D
      -

      The first vector to compare.

      -
      -
      • -
    • -
      vector2: Vector2D
      -

      The parameter "vector2" is a Vector2D object, which represents a 2-dimensional vector. -It is used as one of the inputs for the "equalsRounded" function.

      -
      -
      • -
    • -
      Optional roundingFactor: number = 12
      -

      The roundingFactor parameter is used to determine the threshold for considering two -vectors as equal. If the absolute difference in the x and y components of the vectors is less than the -roundingFactor, the vectors are considered equal.

      -
      -
    -

    Returns boolean

    a boolean value.

    - -
-
-

Static multiply

-
    - -
  • -

    The function multiplies a Vector2D object by a given value.

    -
    -
    -

    Parameters

    -
      -
    • -
      vector: Vector2D
      -

      The parameter "vector" is of type Vector2D, which represents a 2-dimensional vector with -x and y components.

      -
      -
      • -
    • -
      value: number
      -

      The "value" parameter is a number that represents the value by which the x and y components -of the vector will be multiplied.

      -
      -
    -

    Returns Vector2D

    A new Vector2D object with the x and y values multiplied by the given value.

    - -
-
-

Static normalize

-
    - -
  • -

    The normalize function takes a vector as input and returns a normalized version of the vector.Normalizes the vector if it matches a certain condition

    -
    -
    -

    Parameters

    -
      -
    • -
      vector: Vector2D
      -

      The parameter "vector" is of type Vector2D.

      -
      -
    -

    Returns Vector2D

    the normalized vector if its length is greater than a very small value (epsilon), otherwise it returns the -original vector.

    - -
-
-

Static perp

-
    - -
  • -

    The function returns a new Vector2D object that is perpendicular to the input vector.The vector that is perpendicular to this one

    -
    -
    -

    Parameters

    -
      -
    • -
      vector: Vector2D
      -

      The parameter "vector" is of type Vector2D.

      -
      -
    -

    Returns Vector2D

    A new Vector2D object is being returned.

    - -
-
-

Static random

-
    - -
  • -

    The function "random" generates a random Vector2D object with x and y values within the specified range.

    -
    -
    -

    Parameters

    -
      -
    • -
      maxX: number
      -

      The maxX parameter represents the maximum value for the x-coordinate of the random vector.

      -
      -
      • -
    • -
      maxY: number
      -

      The maxY parameter represents the maximum value for the y-coordinate of the generated -random vector.

      -
      -
    -

    Returns Vector2D

    a new instance of the Vector2D class with random x and y values.

    - -
-
-

Static reverse

-
    - -
  • -

    The reverse function takes a Vector2D object and returns a new Vector2D object with the negated x and y values.

    -
    -
    -

    Parameters

    -
      -
    • -
      vector: Vector2D
      -

      The parameter "vector" is of type Vector2D, which represents a 2-dimensional vector. It -has two properties: "x" and "y", which represent the x and y components of the vector, respectively.

      -
      -
    -

    Returns Vector2D

    A new Vector2D object with the negated x and y values of the input vector. Returns the vector that is the reverse of this vector

    - -
-
-

Static sign

-
    - -
  • -

    The sign function determines the sign of the cross product between two 2D vectors. -(assuming the Y axis is pointing down, X axis to right like a Window app)

    -
    -
    -

    Parameters

    -
      -
    • -
      vector1: Vector2D
      -

      The parameter vector1 is of type Vector2D, which represents a 2-dimensional vector. -It likely has properties x and y representing the x and y components of the vector, respectively.

      -
      -
      • -
    • -
      vector2: Vector2D
      -

      The above code defines a function called "sign" that takes two parameters: vector1 and -vector2. Both vector1 and vector2 are of type Vector2D.

      -
      -
    -

    Returns number

    either -1 or 1. Returns positive if v2 is clockwise of this vector, negative if counterclockwise

    - -
-
-

Static subtract

-
    - -
  • -

    The subtract function takes two Vector2D objects as parameters and returns a new Vector2D object with the x and y -components subtracted.

    -
    -
    -

    Parameters

    -
      -
    • -
      vector1: Vector2D
      -

      The parameter vector1 is an instance of the Vector2D class, representing a -2-dimensional vector. It has properties x and y which represent the x and y components of the vector -respectively.

      -
      -
      • -
    • -
      vector2: Vector2D
      -

      The parameter "vector2" is a Vector2D object. It represents the second vector that you -want to subtract from the first vector.

      -
      -
    -

    Returns Vector2D

    The method is returning a new Vector2D object with the x and y components subtracted from vector1 and -vector2.

    - -
-
-

Static subtractValue

-
    - -
  • -

    The function subtracts a given value from the x and y components of a Vector2D object and returns a new Vector2D -object.

    -
    -
    -

    Parameters

    -
      -
    • -
      vector: Vector2D
      -

      The parameter "vector" is of type Vector2D, which represents a 2-dimensional vector with -x and y components.

      -
      -
      • -
    • -
      value: number
      -

      The "value" parameter is a number that will be subtracted from both the x and y components -of the "vector" parameter.

      -
      -
    -

    Returns Vector2D

    A new Vector2D object with the x and y values subtracted by the given value.

    - -
-
-

Static truncate

-
    - -
  • -

    The function truncates a vector to a maximum length if it exceeds that length.Adjusts x and y so that the length of the vector does not exceed max

    -
    -
    -

    Parameters

    -
      -
    • -
      vector: Vector2D
      -

      A 2D vector represented by the Vector2D class.

      -
      -
      • -
    • -
      max: number
      -

      The max parameter is a number that represents the maximum length that the vector should -have.

      -
      -
    -

    Returns Vector2D

    either the original vector or a truncated version of the vector, depending on whether the length of the -vector is greater than the maximum value specified.

    - -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/enums/CP.html b/docs/enums/CP.html deleted file mode 100644 index 647d36e..0000000 --- a/docs/enums/CP.html +++ /dev/null @@ -1,215 +0,0 @@ -CP | data-structure-typed
-
- -
-
-
-
- -

Enumeration CP

-
-
-
- -
-
-

Enumeration Members

-
eq -gt -lt -
-
-

Enumeration Members

-
-

eq

-
eq: "eq"
-
-

gt

-
gt: "gt"
-
-

lt

-
lt: "lt"
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/enums/FamilyPosition.html b/docs/enums/FamilyPosition.html deleted file mode 100644 index 4c1ed01..0000000 --- a/docs/enums/FamilyPosition.html +++ /dev/null @@ -1,243 +0,0 @@ -FamilyPosition | data-structure-typed
-
- -
-
-
-
- -

Enumeration FamilyPosition

-
-
-
- -
-
-

Enumeration Members

-
ISOLATED -LEFT -MAL_NODE -RIGHT -ROOT -ROOT_LEFT -ROOT_RIGHT -
-
-

Enumeration Members

-
-

ISOLATED

-
ISOLATED: "ISOLATED"
-
-

LEFT

-
LEFT: "LEFT"
-
-

MAL_NODE

-
MAL_NODE: "MAL_NODE"
-
-

RIGHT

-
RIGHT: "RIGHT"
-
-

ROOT

-
ROOT: "ROOT"
-
-

ROOT_LEFT

-
ROOT_LEFT: "ROOT_LEFT"
-
-

ROOT_RIGHT

-
ROOT_RIGHT: "ROOT_RIGHT"
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/enums/LoopType.html b/docs/enums/LoopType.html deleted file mode 100644 index 5fd038a..0000000 --- a/docs/enums/LoopType.html +++ /dev/null @@ -1,216 +0,0 @@ -LoopType | data-structure-typed
-
- -
-
-
-
- -

Enumeration LoopType

-
-

Enum representing different loop types.

-
    -
  • iterative: Indicates the iterative loop type (with loops that use iterations).
    • -
  • recursive: Indicates the recursive loop type (with loops that call themselves).
    • -
-
-
-
-
-
- -
-
-

Enumeration Members

-
ITERATIVE -RECURSIVE -
-
-

Enumeration Members

-
-

ITERATIVE

-
ITERATIVE: "ITERATIVE"
-
-

RECURSIVE

-
RECURSIVE: "RECURSIVE"
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/enums/RBColor.html b/docs/enums/RBColor.html deleted file mode 100644 index db70dec..0000000 --- a/docs/enums/RBColor.html +++ /dev/null @@ -1,208 +0,0 @@ -RBColor | data-structure-typed
-
- -
-
-
-
- -

Enumeration RBColor

-
-
-
- -
-
-

Enumeration Members

-
BLACK -RED -
-
-

Enumeration Members

-
-

BLACK

-
BLACK: "BLACK"
-
-

RED

-
RED: "RED"
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/enums/TopologicalProperty.html b/docs/enums/TopologicalProperty.html deleted file mode 100644 index 0bc706b..0000000 --- a/docs/enums/TopologicalProperty.html +++ /dev/null @@ -1,215 +0,0 @@ -TopologicalProperty | data-structure-typed
-
- -
-
-
-
- -

Enumeration TopologicalProperty

-
-
-
- -
-
-

Enumeration Members

-
ID -NODE -VAL -
-
-

Enumeration Members

-
-

ID

-
ID: "ID"
-
-

NODE

-
NODE: "NODE"
-
-

VAL

-
VAL: "VAL"
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/functions/arrayRemove.html b/docs/functions/arrayRemove.html deleted file mode 100644 index 739e68e..0000000 --- a/docs/functions/arrayRemove.html +++ /dev/null @@ -1,212 +0,0 @@ -arrayRemove | data-structure-typed
-
- -
-
-
-
- -

Function arrayRemove

-
-
    - -
  • -
    -

    Type Parameters

    -
      -
    • -

      T

    -
    -

    Parameters

    -
      -
    • -
      array: T[]
      • -
    • -
      predicate: ((item, index, array) => boolean)
      -
        -
      • -
          -
        • (item, index, array): boolean
          • -
        • -
          -

          Parameters

          -
            -
          • -
            item: T
            • -
          • -
            index: number
            • -
          • -
            array: T[]
          -

          Returns boolean

    -

    Returns T[]

-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/functions/isThunk.html b/docs/functions/isThunk.html deleted file mode 100644 index ddc5405..0000000 --- a/docs/functions/isThunk.html +++ /dev/null @@ -1,190 +0,0 @@ -isThunk | data-structure-typed
-
- -
-
-
-
- -

Function isThunk

-
-
    - -
  • -
    -

    Parameters

    -
      -
    • -
      fnOrValue: any
    -

    Returns boolean

-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/functions/toThunk.html b/docs/functions/toThunk.html deleted file mode 100644 index b5c21c2..0000000 --- a/docs/functions/toThunk.html +++ /dev/null @@ -1,190 +0,0 @@ -toThunk | data-structure-typed
-
- -
-
-
-
- -

Function toThunk

-
-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/functions/trampoline.html b/docs/functions/trampoline.html deleted file mode 100644 index 6eaa1cd..0000000 --- a/docs/functions/trampoline.html +++ /dev/null @@ -1,190 +0,0 @@ -trampoline | data-structure-typed
-
- -
-
-
-
- -

Function trampoline

-
-
    - -
  • -
    -

    Parameters

    -
    -

    Returns ((...args) => any) & {
        cont: ((...args) => Thunk);
    }

-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/functions/trampolineAsync.html b/docs/functions/trampolineAsync.html deleted file mode 100644 index cc00851..0000000 --- a/docs/functions/trampolineAsync.html +++ /dev/null @@ -1,190 +0,0 @@ -trampolineAsync | data-structure-typed
-
- -
-
-
-
- -

Function trampolineAsync

-
-
    - -
  • -
    -

    Parameters

    -
    -

    Returns ((...args) => Promise<any>) & {
        cont: ((...args) => Thunk);
    }

-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/functions/uuidV4.html b/docs/functions/uuidV4.html deleted file mode 100644 index 4e8485d..0000000 --- a/docs/functions/uuidV4.html +++ /dev/null @@ -1,185 +0,0 @@ -uuidV4 | data-structure-typed
-
- -
-
-
-
- -

Function uuidV4

-
-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/index.html b/docs/index.html deleted file mode 100644 index e3b0570..0000000 --- a/docs/index.html +++ /dev/null @@ -1,882 +0,0 @@ -data-structure-typed
-
- -
-
-
-
-

data-structure-typed

-

Data Structure Typed

Data Structures of Javascript & TypeScript.

-

Do you envy languages like C++ with std, Python with collections, and Java with java.util ? Well, no need to envy anymore! JavaScript and TypeScript now have data-structure-typed.

-

Now you can use this library in Node.js and browser environments in CommonJS(require export.modules = ), ESModule(import export), Typescript(import export), UMD(var Queue = dataStructureTyped.Queue)

-

License -Language -GitHub release (latest by date) -Branches -npm -eslint

-

Built-in classic algorithms

DFS(Depth-First Search), DFSIterative, BFS(Breadth-First Search), morris, Bellman-Ford Algorithm, Dijkstra's Algorithm, -Floyd-Warshall Algorithm, Tarjan's Algorithm.

-

Installation and Usage

npm

npm i data-structure-typed --save
-
-

yarn

yarn add data-structure-typed
-
-

CDN


<script src='https://cdn.jsdelivr.net/npm/data-structure-typed/umd/bundle.min.js'></script>
-
-
const {AVLTree} = dataStructureTyped;
const {
  Heap,
  MinHeap,
  SinglyLinkedList,
  Stack,
  AVLTreeNode,
  BST,
  Trie,
  DirectedGraph,
  DirectedVertex,
  TreeMultiset
} = dataStructureTyped;
-
-

- - - - - -

-

API docs & Examples

API Docs

-

Live Examples

-

Examples Repository

-

Code Snippet

Binary Search Tree (BST) snippet

TS

import {BST, BSTNode} from 'data-structure-typed';

const bst = new BST();
bst.add(11);
bst.add(3);
bst.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
bst.size === 16;                // true
bst.has(6);                     // true
const node6 = bst.get(6);       // BSTNode
bst.getHeight(6) === 2;         // true
bst.getHeight() === 5;          // true
bst.getDepth(6) === 3;          // true

bst.getLeftMost()?.id === 1;    // true

bst.remove(6);
bst.get(6);                     // null
bst.isAVLBalanced();            // true
bst.BFS()[0] === 11;            // true

const objBST = new BST<BSTNode<{id: number, keyA: number}>>();
objBST.add(11, {id: 11, keyA: 11});
objBST.add(3, {id: 3, keyA: 3});

objBST.addMany([{id: 15, keyA: 15}, {id: 1, keyA: 1}, {id: 8, keyA: 8},
  {id: 13, keyA: 13}, {id: 16, keyA: 16}, {id: 2, keyA: 2},
  {id: 6, keyA: 6}, {id: 9, keyA: 9}, {id: 12, keyA: 12},
  {id: 14, keyA: 14}, {id: 4, keyA: 4}, {id: 7, keyA: 7},
  {id: 10, keyA: 10}, {id: 5, keyA: 5}]);

objBST.remove(11);
-
-

JS

const {BST, BSTNode} = require('data-structure-typed');

const bst = new BST();
bst.add(11);
bst.add(3);
bst.addMany([15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5]);
bst.size === 16;        // true
bst.has(6);             // true
const node6 = bst.get(6);
bst.getHeight(6) === 2; // true
bst.getHeight() === 5;  // true
bst.getDepth(6) === 3;  // true
const leftMost = bst.getLeftMost();
leftMost?.id === 1;     // true
expect(leftMost?.id).toBe(1);
bst.remove(6);
bst.get(6);             // null
bst.isAVLBalanced();    // true or false
const bfsIDs = bst.BFS();
bfsIDs[0] === 11;       // true
expect(bfsIDs[0]).toBe(11);

const objBST = new BST();
objBST.add(11, {id: 11, keyA: 11});
objBST.add(3, {id: 3, keyA: 3});

objBST.addMany([{id: 15, keyA: 15}, {id: 1, keyA: 1}, {id: 8, keyA: 8},
  {id: 13, keyA: 13}, {id: 16, keyA: 16}, {id: 2, keyA: 2},
  {id: 6, keyA: 6}, {id: 9, keyA: 9}, {id: 12, keyA: 12},
  {id: 14, keyA: 14}, {id: 4, keyA: 4}, {id: 7, keyA: 7},
  {id: 10, keyA: 10}, {id: 5, keyA: 5}]);

objBST.remove(11);

const avlTree = new AVLTree();
avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
avlTree.isAVLBalanced();    // true
avlTree.remove(10);
avlTree.isAVLBalanced();    // true
-
-

AVLTree snippet

TS

import {AVLTree} from 'data-structure-typed';

const avlTree = new AVLTree();
avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
avlTree.isAVLBalanced();    // true
avlTree.remove(10);
avlTree.isAVLBalanced();    // true
-
-

JS

const {AVLTree} = require('data-structure-typed');

const avlTree = new AVLTree();
avlTree.addMany([11, 3, 15, 1, 8, 13, 16, 2, 6, 9, 12, 14, 4, 7, 10, 5])
avlTree.isAVLBalanced();    // true
avlTree.remove(10);
avlTree.isAVLBalanced();    // true
-
-

Directed Graph simple snippet

TS or JS

import {DirectedGraph} from 'data-structure-typed';

const graph = new DirectedGraph();

graph.addVertex('A');
graph.addVertex('B');

graph.hasVertex('A');       // true
graph.hasVertex('B');       // true
graph.hasVertex('C');       // false

graph.addEdge('A', 'B');
graph.hasEdge('A', 'B');    // true
graph.hasEdge('B', 'A');    // false

graph.removeEdgeSrcToDest('A', 'B');
graph.hasEdge('A', 'B');    // false

graph.addVertex('C');

graph.addEdge('A', 'B');
graph.addEdge('B', 'C');

const topologicalOrderIds = graph.topologicalSort(); // ['A', 'B', 'C']
-
-

Undirected Graph snippet

TS or JS

import {UndirectedGraph} from 'data-structure-typed';

const graph = new UndirectedGraph();
graph.addVertex('A');
graph.addVertex('B');
graph.addVertex('C');
graph.addVertex('D');
graph.removeVertex('C');
graph.addEdge('A', 'B');
graph.addEdge('B', 'D');

const dijkstraResult = graph.dijkstra('A');
Array.from(dijkstraResult?.seen ?? []).map(vertex => vertex.id) // ['A', 'B', 'D']
-
-

Data Structures

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Data StructureUnit TestPerformance TestAPI DocumentationImplemented
Binary TreeBinary Tree
Binary Search Tree (BST)BST
AVL TreeAVLTree
Tree MultisetTreeMultiset
Segment TreeSegmentTree
Binary Indexed TreeBinaryIndexedTree
GraphAbstractGraph
Directed GraphDirectedGraph
Undirected GraphUndirectedGraph
Linked ListSinglyLinkedList
Singly Linked ListSinglyLinkedList
Doubly Linked ListDoublyLinkedList
QueueQueue
Object DequeObjectDeque
Array DequeArrayDeque
StackStack
Coordinate SetCoordinateSet
Coordinate MapCoordinateMap
HeapHeap
Priority QueuePriorityQueue
Max Priority QueueMaxPriorityQueue
Min Priority QueueMinPriorityQueue
TrieTrie
- - - -

Standard library data structure comparison

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Data StructureC++ stdData Structure Typedjava.utilPython collections
Dynamic Arraystd::vector<T>Array<E>ArrayList<E>list
Linked Liststd::list<T>DoublyLinkedList<E>LinkedList<E>deque
Setstd::set<T>Set<E>HashSet<E>set
Mapstd::map<K, V>Map<K, V>HashMap<K, V>dict
Unordered Setstd::unordered_set<T>N/AHashSet<E>N/A
Unordered Mapstd::unordered_map<K, V>HashTable<K, V>HashMap<K, V>defaultdict
Queuestd::queue<T>Queue<E>Queue<E>N/A
Priority Queuestd::priority_queue<T>PriorityQueue<E>PriorityQueue<E>N/A
Stackstd::stack<T>Stack<E>Stack<E>N/A
Bitsetstd::bitset<N>N/AN/AN/A
Dequestd::deque<T>Deque<E>N/AN/A
Multisetstd::multiset<T>N/AN/AN/A
Multimapstd::multimap<K, V>N/AN/AN/A
Unordered Multisetstd::unordered_multisetN/ACounterN/A
Ordered DictionaryN/AMap<K, V>N/AOrderedDict
Double-Ended Queue (Deque)std::deque<T>Deque<E>N/AN/A
Linked Hash SetN/AN/ALinkedHashSet<E>N/A
Linked Hash MapN/AN/ALinkedHashMap<K, V>N/A
Sorted SetN/AAVLTree, RBTreeTreeSet<E>N/A
Sorted MapN/AAVLTree, RBTreeTreeMap<K, V>N/A
Tree Setstd::setAVLTree, RBTreeTreeSet<E>N/A
Persistent CollectionsN/AN/AN/AN/A
unordered multisetunordered multiset<T>N/AN/AN/A
Unordered Multimapstd::unordered_multimap<K, V>N/AN/AN/A
- - -

Code design

By strictly adhering to object-oriented design (BinaryTree -> BST -> AVLTree -> TreeMultiset), you can seamlessly -inherit the existing data structures to implement the customized ones you need. Object-oriented design stands as the -optimal approach to data structure design.

-

Complexities

performance of Big O

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Big O NotationTypeComputations for 10 elementsComputations for 100 elementsComputations for 1000 elements
O(1)Constant111
O(log N)Logarithmic369
O(N)Linear101001000
O(N log N)n log(n)306009000
O(N^2)Quadratic100100001000000
O(2^N)Exponential10241.26e+291.07e+301
O(N!)Factorial36288009.3e+1574.02e+2567
- -

Data Structure Complexity

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Data StructureAccessSearchInsertionDeletionComments
Array1nnn
Stacknn11
Queuenn11
Linked Listnn1n
Hash Table-nnnIn case of perfect hash function costs would be O(1)
Binary Search TreennnnIn case of balanced tree costs would be O(log(n))
B-Treelog(n)log(n)log(n)log(n)
Red-Black Treelog(n)log(n)log(n)log(n)
AVL Treelog(n)log(n)log(n)log(n)
Bloom Filter-11-False positives are possible while searching
- -

Sorting Complexity

- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
NameBestAverageWorstMemoryStableComments
Bubble sortnn2n21Yes
Insertion sortnn2n21Yes
Selection sortn2n2n21No
Heap sortn log(n)n log(n)n log(n)1No
Merge sortn log(n)n log(n)n log(n)nYes
Quick sortn log(n)n log(n)n2log(n)NoQuicksort is usually done in-place with O(log(n)) stack space
Shell sortn log(n)depends on gap sequencen (log(n))21No
Counting sortn + rn + rn + rn + rYesr - biggest number in array
Radix sortn * kn * kn * kn + kYesk - length of longest key
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/interfaces/IAVLTree.html b/docs/interfaces/IAVLTree.html deleted file mode 100644 index 99dcd77..0000000 --- a/docs/interfaces/IAVLTree.html +++ /dev/null @@ -1,1236 +0,0 @@ -IAVLTree | data-structure-typed
-
- -
-
-
-
- -

Interface IAVLTree<N>

-
-

Type Parameters

-
-
-

Hierarchy

-
    -
  • IBST<N> -
      -
    • IAVLTree
-
-

Implemented by

-
-
-
-
- -
-
-

Accessors

-
loopType -root -size -visitedId -visitedNode -visitedVal -
-
-

Methods

-
BFS -DFS -DFSIterative -add -addMany -allGreaterNodesAdd -clear -createNode -fill -get -getDepth -getHeight -getLeftMost -getMinHeight -getNodes -getPathToRoot -getPredecessor -getRightMost -getSubTreeSize -has -isAVLBalanced -isBST -isEmpty -isPerfectlyBalanced -isSubtreeBST -lastKey -lesserSum -levelIterative -listLevels -morris -perfectlyBalance -remove -subTreeAdd -subTreeSum -swapLocation -
-
-

Accessors

-
-

loopType

-
-
-

root

-
-
-

size

-
-
-

visitedId

-
-
-

visitedNode

-
-
-

visitedVal

-
-
-

Methods

-
-

BFS

-
-
-

DFS

-
-
-

DFSIterative

-
-
-

add

-
    - -
  • -
    -

    Parameters

    -
      -
    • -
      id: number
      • -
    • -
      Optional val: null | N["val"]
    -

    Returns undefined | null | N

-
-

addMany

-
-
-

allGreaterNodesAdd

-
-
-

clear

-
-
-

createNode

-
    - -
  • -
    -

    Parameters

    -
      -
    • -
      id: number
      • -
    • -
      Optional val: N["val"]
      • -
    • -
      Optional count: number
    -

    Returns N

-
-

fill

-
-
-

get

-
-
-

getDepth

-
-
-

getHeight

-
-
-

getLeftMost

-
-
-

getMinHeight

-
-
-

getNodes

-
-
-

getPathToRoot

-
-
-

getPredecessor

-
-
-

getRightMost

-
-
-

getSubTreeSize

-
-
-

has

-
-
-

isAVLBalanced

-
-
-

isBST

-
-
-

isEmpty

-
-
-

isPerfectlyBalanced

-
-
-

isSubtreeBST

-
-
-

lastKey

-
-
-

lesserSum

-
-
-

levelIterative

-
-
-

listLevels

-
-
-

morris

-
-
-

perfectlyBalance

-
-
-

remove

-
-
-

subTreeAdd

-
-
-

subTreeSum

-
-
-

swapLocation

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/interfaces/IAbstractBinaryTree.html b/docs/interfaces/IAbstractBinaryTree.html deleted file mode 100644 index 8167ec2..0000000 --- a/docs/interfaces/IAbstractBinaryTree.html +++ /dev/null @@ -1,1095 +0,0 @@ -IAbstractBinaryTree | data-structure-typed
-
- -
-
-
-
- -

Interface IAbstractBinaryTree<N>

-
-

Type Parameters

-
-
-

Hierarchy

-
    -
  • IAbstractBinaryTree
-
-

Implemented by

-
-
-
-
- -
-
-

Accessors

-
loopType -root -size -visitedId -visitedNode -visitedVal -
-
-

Methods

-
BFS -DFS -DFSIterative -add -addMany -clear -createNode -fill -get -getDepth -getHeight -getLeftMost -getMinHeight -getNodes -getPathToRoot -getPredecessor -getRightMost -getSubTreeSize -has -isBST -isEmpty -isPerfectlyBalanced -isSubtreeBST -levelIterative -listLevels -morris -remove -subTreeAdd -subTreeSum -swapLocation -
-
-

Accessors

-
-

loopType

-
-
-

root

-
-
-

size

-
-
-

visitedId

-
-
-

visitedNode

-
-
-

visitedVal

-
-
-

Methods

-
-

BFS

-
-
-

DFS

-
-
-

DFSIterative

-
-
-

add

-
-
-

addMany

-
    - -
  • -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number | N)[]
      • -
    • -
      Optional data: N["val"][]
    -

    Returns (undefined | null | N)[]

-
-

clear

-
-
-

createNode

-
-
-

fill

-
-
-

get

-
-
-

getDepth

-
-
-

getHeight

-
-
-

getLeftMost

-
-
-

getMinHeight

-
-
-

getNodes

-
-
-

getPathToRoot

-
-
-

getPredecessor

-
-
-

getRightMost

-
-
-

getSubTreeSize

-
-
-

has

-
-
-

isBST

-
-
-

isEmpty

-
-
-

isPerfectlyBalanced

-
-
-

isSubtreeBST

-
-
-

levelIterative

-
-
-

listLevels

-
-
-

morris

-
-
-

remove

-
-
-

subTreeAdd

-
-
-

subTreeSum

-
-
-

swapLocation

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/interfaces/IAbstractBinaryTreeNode.html b/docs/interfaces/IAbstractBinaryTreeNode.html deleted file mode 100644 index 0ea9503..0000000 --- a/docs/interfaces/IAbstractBinaryTreeNode.html +++ /dev/null @@ -1,339 +0,0 @@ -IAbstractBinaryTreeNode | data-structure-typed
-
- -
-
-
-
- -

Interface IAbstractBinaryTreeNode<T, NEIGHBOR>

-
-

Type Parameters

-
-
-

Hierarchy

-
    -
  • IAbstractBinaryTreeNode
-
-

Implemented by

-
-
-
-
- -
-
-

Accessors

-
familyPosition -height -id -left -parent -right -val -
-
-

Accessors

-
-

familyPosition

-
-
-

height

-
-
-

id

-
-
-

left

-
-
-

parent

-
-
-

right

-
-
-

val

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/interfaces/IAbstractGraph.html b/docs/interfaces/IAbstractGraph.html deleted file mode 100644 index 3fec73d..0000000 --- a/docs/interfaces/IAbstractGraph.html +++ /dev/null @@ -1,437 +0,0 @@ -IAbstractGraph | data-structure-typed
-
- -
-
-
-
- -

Interface IAbstractGraph<V, E>

-
-

Type Parameters

-
    -
  • -

    V

    • -
  • -

    E

-
-

Hierarchy

-
-
-

Implemented by

-
-
-
-
- -
-
-

Methods

-
addEdge -addVertex -degreeOf -edgeSet -edgesOf -getEdge -getMinPathBetween -getNeighbors -hasEdge -hasVertex -removeAllVertices -removeEdge -removeVertex -setEdgeWeight -
-
-

Methods

-
-

addEdge

-
-
-

addVertex

-
-
-

degreeOf

-
-
-

edgeSet

-
-
-

edgesOf

-
-
-

getEdge

-
-
-

getMinPathBetween

-
-
-

getNeighbors

-
-
-

hasEdge

-
-
-

hasVertex

-
-
-

removeAllVertices

-
-
-

removeEdge

-
-
-

removeVertex

-
-
-

setEdgeWeight

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/interfaces/IBST.html b/docs/interfaces/IBST.html deleted file mode 100644 index 12eb064..0000000 --- a/docs/interfaces/IBST.html +++ /dev/null @@ -1,1238 +0,0 @@ -IBST | data-structure-typed
-
- -
-
-
-
- -

Interface IBST<N>

-
-

Type Parameters

-
-
-

Hierarchy

-
-
-

Implemented by

-
-
-
-
- -
-
-

Accessors

-
loopType -root -size -visitedId -visitedNode -visitedVal -
-
-

Methods

-
BFS -DFS -DFSIterative -add -addMany -allGreaterNodesAdd -clear -createNode -fill -get -getDepth -getHeight -getLeftMost -getMinHeight -getNodes -getPathToRoot -getPredecessor -getRightMost -getSubTreeSize -has -isAVLBalanced -isBST -isEmpty -isPerfectlyBalanced -isSubtreeBST -lastKey -lesserSum -levelIterative -listLevels -morris -perfectlyBalance -remove -subTreeAdd -subTreeSum -swapLocation -
-
-

Accessors

-
-

loopType

-
-
-

root

-
-
-

size

-
-
-

visitedId

-
-
-

visitedNode

-
-
-

visitedVal

-
-
-

Methods

-
-

BFS

-
-
-

DFS

-
-
-

DFSIterative

-
-
-

add

-
    - -
  • -
    -

    Parameters

    -
      -
    • -
      id: number
      • -
    • -
      Optional val: null | N["val"]
      • -
    • -
      Optional count: number
    -

    Returns undefined | null | N

-
-

addMany

-
    - -
  • -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number | N)[]
      • -
    • -
      Optional data: N["val"][]
    -

    Returns (undefined | null | N)[]

-
-

allGreaterNodesAdd

-
-
-

clear

-
-
-

createNode

-
    - -
  • -
    -

    Parameters

    -
      -
    • -
      id: number
      • -
    • -
      Optional val: N["val"]
      • -
    • -
      Optional count: number
    -

    Returns N

-
-

fill

-
    - -
  • -
    -

    Parameters

    -
      -
    • -
      idsOrNodes: (null | number | N)[]
      • -
    • -
      Optional data: N[] | N["val"][]
    -

    Returns boolean

-
-

get

-
-
-

getDepth

-
-
-

getHeight

-
-
-

getLeftMost

-
-
-

getMinHeight

-
-
-

getNodes

-
    - -
  • -
    -

    Parameters

    -
    -

    Returns N[]

-
-

getPathToRoot

-
-
-

getPredecessor

-
-
-

getRightMost

-
-
-

getSubTreeSize

-
-
-

has

-
-
-

isAVLBalanced

-
-
-

isBST

-
-
-

isEmpty

-
-
-

isPerfectlyBalanced

-
    - -
  • -
    -

    Parameters

    -
      -
    • -
      Optional beginRoot: null | N
    -

    Returns boolean

-
-

isSubtreeBST

-
-
-

lastKey

-
-
-

lesserSum

-
-
-

levelIterative

-
-
-

listLevels

-
-
-

morris

-
-
-

perfectlyBalance

-
-
-

remove

-
-
-

subTreeAdd

-
-
-

subTreeSum

-
-
-

swapLocation

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/interfaces/IDirectedGraph.html b/docs/interfaces/IDirectedGraph.html deleted file mode 100644 index 98d973f..0000000 --- a/docs/interfaces/IDirectedGraph.html +++ /dev/null @@ -1,574 +0,0 @@ -IDirectedGraph | data-structure-typed
-
- -
-
-
-
- -

Interface IDirectedGraph<V, E>

-
-

Type Parameters

-
    -
  • -

    V

    • -
  • -

    E

-
-

Hierarchy

-
-
-

Implemented by

-
-
-
-
- -
-
-

Methods

-
addEdge -addVertex -degreeOf -edgeSet -edgesOf -getEdge -getEdgeDest -getEdgeSrc -getMinPathBetween -getNeighbors -hasEdge -hasVertex -inDegreeOf -incomingEdgesOf -outDegreeOf -outgoingEdgesOf -removeAllVertices -removeEdge -removeEdgeSrcToDest -removeEdgesBetween -removeVertex -setEdgeWeight -
-
-

Methods

-
-

addEdge

-
-
-

addVertex

-
-
-

degreeOf

-
-
-

edgeSet

-
-
-

edgesOf

-
-
-

getEdge

-
-
-

getEdgeDest

-
-
-

getEdgeSrc

-
-
-

getMinPathBetween

-
-
-

getNeighbors

-
-
-

hasEdge

-
-
-

hasVertex

-
-
-

inDegreeOf

-
-
-

incomingEdgesOf

-
-
-

outDegreeOf

-
-
-

outgoingEdgesOf

-
-
-

removeAllVertices

-
-
-

removeEdge

-
-
-

removeEdgeSrcToDest

-
-
-

removeEdgesBetween

-
-
-

removeVertex

-
-
-

setEdgeWeight

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/interfaces/IRBTree.html b/docs/interfaces/IRBTree.html deleted file mode 100644 index 36e70d3..0000000 --- a/docs/interfaces/IRBTree.html +++ /dev/null @@ -1,1240 +0,0 @@ -IRBTree | data-structure-typed
-
- -
-
-
-
- -

Interface IRBTree<N>

-
-

Type Parameters

-
-
-

Hierarchy

-
    -
  • IBST<N> -
      -
    • IRBTree
-
-

Implemented by

-
-
-
-
- -
-
-

Accessors

-
loopType -root -size -visitedId -visitedNode -visitedVal -
-
-

Methods

-
BFS -DFS -DFSIterative -add -addMany -allGreaterNodesAdd -clear -createNode -fill -get -getDepth -getHeight -getLeftMost -getMinHeight -getNodes -getPathToRoot -getPredecessor -getRightMost -getSubTreeSize -has -isAVLBalanced -isBST -isEmpty -isPerfectlyBalanced -isSubtreeBST -lastKey -lesserSum -levelIterative -listLevels -morris -perfectlyBalance -remove -subTreeAdd -subTreeSum -swapLocation -
-
-

Accessors

-
-

loopType

-
-
-

root

-
-
-

size

-
-
-

visitedId

-
-
-

visitedNode

-
-
-

visitedVal

-
-
-

Methods

-
-

BFS

-
-
-

DFS

-
-
-

DFSIterative

-
-
-

add

-
    - -
  • -
    -

    Parameters

    -
      -
    • -
      id: number
      • -
    • -
      Optional val: null | N["val"]
      • -
    • -
      Optional count: number
    -

    Returns undefined | null | N

-
-

addMany

-
-
-

allGreaterNodesAdd

-
-
-

clear

-
-
-

createNode

-
-
-

fill

-
-
-

get

-
-
-

getDepth

-
-
-

getHeight

-
-
-

getLeftMost

-
-
-

getMinHeight

-
-
-

getNodes

-
-
-

getPathToRoot

-
-
-

getPredecessor

-
-
-

getRightMost

-
-
-

getSubTreeSize

-
-
-

has

-
-
-

isAVLBalanced

-
-
-

isBST

-
-
-

isEmpty

-
-
-

isPerfectlyBalanced

-
-
-

isSubtreeBST

-
-
-

lastKey

-
-
-

lesserSum

-
-
-

levelIterative

-
-
-

listLevels

-
-
-

morris

-
-
-

perfectlyBalance

-
-
-

remove

-
-
-

subTreeAdd

-
-
-

subTreeSum

-
-
-

swapLocation

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/interfaces/IUNDirectedGraph.html b/docs/interfaces/IUNDirectedGraph.html deleted file mode 100644 index e4fe361..0000000 --- a/docs/interfaces/IUNDirectedGraph.html +++ /dev/null @@ -1,467 +0,0 @@ -IUNDirectedGraph | data-structure-typed
-
- -
-
-
-
- -

Interface IUNDirectedGraph<V, E>

-
-

Type Parameters

-
    -
  • -

    V

    • -
  • -

    E

-
-

Hierarchy

-
-
-

Implemented by

-
-
-
-
- -
-
-

Methods

-
addEdge -addVertex -degreeOf -edgeSet -edgesOf -getEdge -getMinPathBetween -getNeighbors -hasEdge -hasVertex -removeAllVertices -removeEdge -removeEdgeBetween -removeVertex -setEdgeWeight -
-
-

Methods

-
-

addEdge

-
-
-

addVertex

-
-
-

degreeOf

-
-
-

edgeSet

-
-
-

edgesOf

-
-
-

getEdge

-
-
-

getMinPathBetween

-
-
-

getNeighbors

-
-
-

hasEdge

-
-
-

hasVertex

-
-
-

removeAllVertices

-
-
-

removeEdge

-
-
-

removeEdgeBetween

-
-
-

removeVertex

-
-
-

setEdgeWeight

-
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-

On This Page

 -
-
-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/modules.html b/docs/modules.html deleted file mode 100644 index b5b5293..0000000 --- a/docs/modules.html +++ /dev/null @@ -1,336 +0,0 @@ -data-structure-typed
-
- -
-
-
-
-

data-structure-typed

-
-
-

Index

-
-

Enumerations

-
CP -FamilyPosition -LoopType -RBColor -TopologicalProperty -
-
-

Classes

-
AVLTree -AVLTreeNode -AaTree -AbstractBinaryTree -AbstractBinaryTreeNode -AbstractEdge -AbstractGraph -AbstractVertex -ArrayDeque -BST -BSTNode -BTree -BinaryIndexedTree -BinaryTree -BinaryTreeNode -Character -CoordinateMap -CoordinateSet -Deque -DirectedEdge -DirectedGraph -DirectedVertex -DoublyLinkedList -DoublyLinkedListNode -HashMap -HashTable -HashTableNode -Heap -HeapItem -LinkedListQueue -MapEdge -MapGraph -MapVertex -Matrix2D -MatrixNTI2D -MaxHeap -MaxPriorityQueue -MinHeap -MinPriorityQueue -Navigator -ObjectDeque -Pair -PriorityQueue -Queue -RBTree -RBTreeNode -SegmentTree -SegmentTreeNode -SinglyLinkedList -SinglyLinkedListNode -SkipList -SkipListNode -SplayTree -Stack -TreeMap -TreeMultiset -TreeMultisetNode -TreeNode -TreeSet -Trie -TrieNode -TwoThreeTree -UndirectedEdge -UndirectedGraph -UndirectedVertex -Vector2D -
-
-

Interfaces

-
IAVLTree -IAbstractBinaryTree -IAbstractBinaryTreeNode -IAbstractGraph -IBST -IDirectedGraph -IRBTree -IUNDirectedGraph -
-
-

Type Aliases

-
AVLTreeNodeNested -AVLTreeOptions -AbstractBinaryTreeNodeNested -AbstractBinaryTreeNodeProperties -AbstractBinaryTreeNodeProperty -AbstractBinaryTreeOptions -BSTComparator -BSTNodeNested -BSTOptions -BinaryTreeDeletedResult -BinaryTreeNodeId -BinaryTreeNodeNested -BinaryTreeNodePropertyName -BinaryTreeOptions -DFSOrderPattern -DijkstraResult -Direction -DummyAny -EdgeId -HashFunction -HeapOptions -IAVLTreeNode -IBSTNode -IBinaryTree -IBinaryTreeNode -IRBTreeNode -ITreeMultiset -ITreeMultisetNode -KeyValueObject -KeyValueObjectWithId -MapGraphCoordinate -NavigatorParams -NodeOrPropertyName -NonNumberNonObjectButDefined -ObjectWithNonNumberId -ObjectWithNumberId -ObjectWithoutId -PriorityQueueComparator -PriorityQueueDFSOrderPattern -PriorityQueueOptions -RBTreeNodeNested -RBTreeOptions -RestrictValById -SegmentTreeNodeVal -SpecifyOptional -Thunk -ToThunkFn -TopologicalStatus -TreeMultisetNodeNested -TreeMultisetOptions -TrlAsyncFn -TrlFn -Turning -VertexId -
-
-

Variables

-
THUNK_SYMBOL -
-
-

Functions

-
arrayRemove -isThunk -toThunk -trampoline -trampolineAsync -uuidV4 -
-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/types/AVLTreeNodeNested.html b/docs/types/AVLTreeNodeNested.html deleted file mode 100644 index bb9f948..0000000 --- a/docs/types/AVLTreeNodeNested.html +++ /dev/null @@ -1,186 +0,0 @@ -AVLTreeNodeNested | data-structure-typed
-
- -
-
-
-
- -

Type alias AVLTreeNodeNested<T>

-
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>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
-
-

Type Parameters

-
    -
  • -

    T

-
-
-
-
-

Settings

 -
-
-

Member Visibility

-
    -
    • -
    • -
    • -
-
-

Theme

-
-
-
-

Generated using TypeDoc

-
\ No newline at end of file diff --git a/docs/types/AVLTreeOptions.html b/docs/types/AVLTreeOptions.html deleted file mode 100644 index ba2106a..0000000 --- a/docs/types/AVLTreeOptions.html +++ /dev/null @@ -1,184 +0,0 @@ -AVLTreeOptions | data-structure-typed
-
- -
-
-
-
- -

Type alias AVLTreeOptions

-
AVLTreeOptions: BSTOptions & {}
-
-

Type declaration

-
    -
    -
    -
    -
    -

    Settings

     -
    -
    -

    Member Visibility

    -
      -
      • -
      • -
      • -
    -
    -

    Theme

    -
    -
    -
    -

    Generated using TypeDoc

    -
    \ No newline at end of file diff --git a/docs/types/AbstractBinaryTreeNodeNested.html b/docs/types/AbstractBinaryTreeNodeNested.html deleted file mode 100644 index 6c6d94e..0000000 --- a/docs/types/AbstractBinaryTreeNodeNested.html +++ /dev/null @@ -1,186 +0,0 @@ -AbstractBinaryTreeNodeNested | data-structure-typed
    -
    - -
    -
    -
    -
    - -

    Type alias AbstractBinaryTreeNodeNested<T>

    -
    AbstractBinaryTreeNodeNested<T>: AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, AbstractBinaryTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    -
    -

    Type Parameters

    -
      -
    • -

      T

    -
    -
    -
    -
    -

    Settings

     -
    -
    -

    Member Visibility

    -
      -
      • -
      • -
      • -
    -
    -

    Theme

    -
    -
    -
    -

    Generated using TypeDoc

    -
    \ No newline at end of file diff --git a/docs/types/AbstractBinaryTreeNodeProperties.html b/docs/types/AbstractBinaryTreeNodeProperties.html deleted file mode 100644 index 8ce2817..0000000 --- a/docs/types/AbstractBinaryTreeNodeProperties.html +++ /dev/null @@ -1,186 +0,0 @@ -AbstractBinaryTreeNodeProperties | data-structure-typed
    -
    - -
    -
    -
    -
    - -

    Type alias AbstractBinaryTreeNodeProperties<N>

    -
    AbstractBinaryTreeNodeProperties<N>: AbstractBinaryTreeNodeProperty<N>[]
    -
    -

    Type Parameters

    -
    -
    -
    -
    -
    -

    Settings

     -
    -
    -

    Member Visibility

    -
      -
      • -
      • -
      • -
    -
    -

    Theme

    -
    -
    -
    -

    Generated using TypeDoc

    -
    \ No newline at end of file diff --git a/docs/types/AbstractBinaryTreeNodeProperty.html b/docs/types/AbstractBinaryTreeNodeProperty.html deleted file mode 100644 index 69d3a2b..0000000 --- a/docs/types/AbstractBinaryTreeNodeProperty.html +++ /dev/null @@ -1,186 +0,0 @@ -AbstractBinaryTreeNodeProperty | data-structure-typed
    -
    - -
    -
    -
    -
    - -

    Type alias AbstractBinaryTreeNodeProperty<N>

    -
    AbstractBinaryTreeNodeProperty<N>: N["val"] | N | number | BinaryTreeNodeId
    -
    -

    Type Parameters

    -
    -
    -
    -
    -
    -

    Settings

     -
    -
    -

    Member Visibility

    -
      -
      • -
      • -
      • -
    -
    -

    Theme

    -
    -
    -
    -

    Generated using TypeDoc

    -
    \ No newline at end of file diff --git a/docs/types/AbstractBinaryTreeOptions.html b/docs/types/AbstractBinaryTreeOptions.html deleted file mode 100644 index b26e7ed..0000000 --- a/docs/types/AbstractBinaryTreeOptions.html +++ /dev/null @@ -1,186 +0,0 @@ -AbstractBinaryTreeOptions | data-structure-typed
    -
    - -
    -
    -
    -
    - -

    Type alias AbstractBinaryTreeOptions

    -
    AbstractBinaryTreeOptions: {
        loopType?: LoopType;
    }
    -
    -

    Type declaration

    -
    -
    -
    -
    -
    -

    Settings

     -
    -
    -

    Member Visibility

    -
      -
      • -
      • -
      • -
    -
    -

    Theme

    -
    -
    -
    -

    Generated using TypeDoc

    -
    \ No newline at end of file diff --git a/docs/types/BSTComparator.html b/docs/types/BSTComparator.html deleted file mode 100644 index 4a1353d..0000000 --- a/docs/types/BSTComparator.html +++ /dev/null @@ -1,196 +0,0 @@ -BSTComparator | data-structure-typed
    -
    - -
    -
    -
    -
    - -

    Type alias BSTComparator

    -
    BSTComparator: ((a, b) => number)
    -
    -

    Type declaration

    -
    -
    -
    -
    -
    -

    Settings

     -
    -
    -

    Member Visibility

    -
      -
      • -
      • -
      • -
    -
    -

    Theme

    -
    -
    -
    -

    Generated using TypeDoc

    -
    \ No newline at end of file diff --git a/docs/types/BSTNodeNested.html b/docs/types/BSTNodeNested.html deleted file mode 100644 index 1598e57..0000000 --- a/docs/types/BSTNodeNested.html +++ /dev/null @@ -1,186 +0,0 @@ -BSTNodeNested | data-structure-typed
    -
    - -
    -
    -
    -
    - -

    Type alias BSTNodeNested<T>

    -
    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>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    -
    -

    Type Parameters

    -
      -
    • -

      T

    -
    -
    -
    -
    -

    Settings

     -
    -
    -

    Member Visibility

    -
      -
      • -
      • -
      • -
    -
    -

    Theme

    -
    -
    -
    -

    Generated using TypeDoc

    -
    \ No newline at end of file diff --git a/docs/types/BSTOptions.html b/docs/types/BSTOptions.html deleted file mode 100644 index b5040c5..0000000 --- a/docs/types/BSTOptions.html +++ /dev/null @@ -1,186 +0,0 @@ -BSTOptions | data-structure-typed
    -
    - -
    -
    -
    -
    - -

    Type alias BSTOptions

    -
    BSTOptions: BinaryTreeOptions & {
        comparator?: BSTComparator;
    }
    -
    -

    Type declaration

    -
    -
    -
    -
    -
    -

    Settings

     -
    -
    -

    Member Visibility

    -
      -
      • -
      • -
      • -
    -
    -

    Theme

    -
    -
    -
    -

    Generated using TypeDoc

    -
    \ No newline at end of file diff --git a/docs/types/BinaryTreeDeletedResult.html b/docs/types/BinaryTreeDeletedResult.html deleted file mode 100644 index 0e2c734..0000000 --- a/docs/types/BinaryTreeDeletedResult.html +++ /dev/null @@ -1,193 +0,0 @@ -BinaryTreeDeletedResult | data-structure-typed
    -
    - -
    -
    -
    -
    - -

    Type alias BinaryTreeDeletedResult<N>

    -
    BinaryTreeDeletedResult<N>: {
        deleted: N | null | undefined;
        needBalanced: N | null;
    }
    -
    -

    Type Parameters

    -
      -
    • -

      N

    -
    -

    Type declaration

    -
      -
    • -
      deleted: N | null | undefined
      • -
    • -
      needBalanced: N | null
    -
    -
    -
    -
    -

    Settings

     -
    -
    -

    Member Visibility

    -
      -
      • -
      • -
      • -
    -
    -

    Theme

    -
    -
    -
    -

    Generated using TypeDoc

    -
    \ No newline at end of file diff --git a/docs/types/BinaryTreeNodeId.html b/docs/types/BinaryTreeNodeId.html deleted file mode 100644 index 170291e..0000000 --- a/docs/types/BinaryTreeNodeId.html +++ /dev/null @@ -1,181 +0,0 @@ -BinaryTreeNodeId | data-structure-typed
    -
    - -
    -
    -
    -
    - -

    Type alias BinaryTreeNodeId

    -
    BinaryTreeNodeId: number
    -
    -
    -
    -
    -

    Settings

     -
    -
    -

    Member Visibility

    -
      -
      • -
      • -
      • -
    -
    -

    Theme

    -
    -
    -
    -

    Generated using TypeDoc

    -
    \ No newline at end of file diff --git a/docs/types/BinaryTreeNodeNested.html b/docs/types/BinaryTreeNodeNested.html deleted file mode 100644 index 8ea27a7..0000000 --- a/docs/types/BinaryTreeNodeNested.html +++ /dev/null @@ -1,186 +0,0 @@ -BinaryTreeNodeNested | data-structure-typed
    -
    - -
    -
    -
    -
    - -

    Type alias BinaryTreeNodeNested<T>

    -
    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>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
    -
    -

    Type Parameters

    -
      -
    • -

      T

    -
    -
    -
    -
    -

    Settings

     -
    -
    -

    Member Visibility

    -
      -
      • -
      • -
      • -
    -
    -

    Theme

    -
    -
    -
    -

    Generated using TypeDoc

    -
    \ No newline at end of file diff --git a/docs/types/BinaryTreeNodePropertyName.html b/docs/types/BinaryTreeNodePropertyName.html deleted file mode 100644 index 0ed85cf..0000000 --- a/docs/types/BinaryTreeNodePropertyName.html +++ /dev/null @@ -1,181 +0,0 @@ -BinaryTreeNodePropertyName | data-structure-typed
    -
    - -
    -
    -
    -
    - -

    Type alias BinaryTreeNodePropertyName

    -
    BinaryTreeNodePropertyName: "id" | "val"
    -
    -
    -
    -
    -

    Settings

     -
    -
    -

    Member Visibility

    -
      -
      • -
      • -
      • -
    -
    -

    Theme

    -
    -
    -
    -

    Generated using TypeDoc

    -
    \ No newline at end of file diff --git a/docs/types/BinaryTreeOptions.html b/docs/types/BinaryTreeOptions.html deleted file mode 100644 index 38e2a5b..0000000 --- a/docs/types/BinaryTreeOptions.html +++ /dev/null @@ -1,184 +0,0 @@ -BinaryTreeOptions | data-structure-typed
    -
    - -
    -
    -
    -
    - -

    Type alias BinaryTreeOptions

    -
    BinaryTreeOptions: AbstractBinaryTreeOptions & {}
    -
    -

    Type declaration

    -
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/DFSOrderPattern.html b/docs/types/DFSOrderPattern.html deleted file mode 100644 index c47bc1a..0000000 --- a/docs/types/DFSOrderPattern.html +++ /dev/null @@ -1,181 +0,0 @@ -DFSOrderPattern | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias DFSOrderPattern

      -
      DFSOrderPattern: "in" | "pre" | "post"
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/DijkstraResult.html b/docs/types/DijkstraResult.html deleted file mode 100644 index 63e8b9d..0000000 --- a/docs/types/DijkstraResult.html +++ /dev/null @@ -1,203 +0,0 @@ -DijkstraResult | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias DijkstraResult<V>

      -
      DijkstraResult<V>: {
          distMap: Map<V, number>;
          distPaths?: Map<V, V[]>;
          minDist: number;
          minPath: V[];
          paths: V[][];
          preMap: Map<V, V | null>;
          seen: Set<V>;
      } | null
      -
      -

      Type Parameters

      -
        -
      • -

        V

      -
      -

      Type declaration

      -
        -
      • -
        distMap: Map<V, number>
        • -
      • -
        Optional distPaths?: Map<V, V[]>
        • -
      • -
        minDist: number
        • -
      • -
        minPath: V[]
        • -
      • -
        paths: V[][]
        • -
      • -
        preMap: Map<V, V | null>
        • -
      • -
        seen: Set<V>
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/Direction.html b/docs/types/Direction.html deleted file mode 100644 index d9e816d..0000000 --- a/docs/types/Direction.html +++ /dev/null @@ -1,181 +0,0 @@ -Direction | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias Direction

      -
      Direction: "up" | "right" | "down" | "left"
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/DummyAny.html b/docs/types/DummyAny.html deleted file mode 100644 index f030c37..0000000 --- a/docs/types/DummyAny.html +++ /dev/null @@ -1,194 +0,0 @@ -DummyAny | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias DummyAny

      -
      DummyAny: string | number | boolean | null | undefined | object | symbol | void | ((...args) => any) | never
      -
      -

      Type declaration

      -
        -
      • -
          -
        • (...args): any
          • -
        • -
          -

          Parameters

          -
            -
          • -
            Rest ...args: []
          -

          Returns any

      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/EdgeId.html b/docs/types/EdgeId.html deleted file mode 100644 index 812f369..0000000 --- a/docs/types/EdgeId.html +++ /dev/null @@ -1,181 +0,0 @@ -EdgeId | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias EdgeId

      -
      EdgeId: string
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/HeapOptions.html b/docs/types/HeapOptions.html deleted file mode 100644 index fce0f81..0000000 --- a/docs/types/HeapOptions.html +++ /dev/null @@ -1,202 +0,0 @@ -HeapOptions | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias HeapOptions<T>

      -
      HeapOptions<T>: {
          priorityExtractor?: ((element) => number);
      }
      -
      -

      Type Parameters

      -
        -
      • -

        T

      -
      -

      Type declaration

      -
        -
      • -
        Optional priorityExtractor?: ((element) => number)
        -
          -
        • -
            -
          • (element): number
            • -
          • -
            -

            Parameters

            -
              -
            • -
              element: T
            -

            Returns number

      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/IAVLTreeNode.html b/docs/types/IAVLTreeNode.html deleted file mode 100644 index 29832ee..0000000 --- a/docs/types/IAVLTreeNode.html +++ /dev/null @@ -1,188 +0,0 @@ -IAVLTreeNode | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias IAVLTreeNode<T, NEIGHBOR>

      -
      IAVLTreeNode<T, NEIGHBOR>: IBSTNode<T, NEIGHBOR>
      -
      -

      Type Parameters

      -
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/IBSTNode.html b/docs/types/IBSTNode.html deleted file mode 100644 index 889618a..0000000 --- a/docs/types/IBSTNode.html +++ /dev/null @@ -1,188 +0,0 @@ -IBSTNode | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias IBSTNode<T, NEIGHBOR>

      -
      IBSTNode<T, NEIGHBOR>: IBinaryTreeNode<T, NEIGHBOR>
      -
      -

      Type Parameters

      -
        -
      • -

        T

        • -
      • -

        NEIGHBOR extends IBSTNode<T, NEIGHBOR>

      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/IBinaryTree.html b/docs/types/IBinaryTree.html deleted file mode 100644 index ae1893c..0000000 --- a/docs/types/IBinaryTree.html +++ /dev/null @@ -1,186 +0,0 @@ -IBinaryTree | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias IBinaryTree<N>

      -
      IBinaryTree<N>: IAbstractBinaryTree<N>
      -
      -

      Type Parameters

      -
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/IBinaryTreeNode.html b/docs/types/IBinaryTreeNode.html deleted file mode 100644 index 732be7f..0000000 --- a/docs/types/IBinaryTreeNode.html +++ /dev/null @@ -1,188 +0,0 @@ -IBinaryTreeNode | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias IBinaryTreeNode<T, NEIGHBOR>

      -
      IBinaryTreeNode<T, NEIGHBOR>: IAbstractBinaryTreeNode<T, NEIGHBOR>
      -
      -

      Type Parameters

      -
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/IRBTreeNode.html b/docs/types/IRBTreeNode.html deleted file mode 100644 index 153475f..0000000 --- a/docs/types/IRBTreeNode.html +++ /dev/null @@ -1,188 +0,0 @@ -IRBTreeNode | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias IRBTreeNode<T, NEIGHBOR>

      -
      IRBTreeNode<T, NEIGHBOR>: IBSTNode<T, NEIGHBOR>
      -
      -

      Type Parameters

      -
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/ITreeMultiset.html b/docs/types/ITreeMultiset.html deleted file mode 100644 index 61bd32d..0000000 --- a/docs/types/ITreeMultiset.html +++ /dev/null @@ -1,186 +0,0 @@ -ITreeMultiset | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias ITreeMultiset<N>

      -
      ITreeMultiset<N>: IAVLTree<N>
      -
      -

      Type Parameters

      -
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/ITreeMultisetNode.html b/docs/types/ITreeMultisetNode.html deleted file mode 100644 index 0934649..0000000 --- a/docs/types/ITreeMultisetNode.html +++ /dev/null @@ -1,188 +0,0 @@ -ITreeMultisetNode | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias ITreeMultisetNode<T, NEIGHBOR>

      -
      ITreeMultisetNode<T, NEIGHBOR>: IBSTNode<T, NEIGHBOR>
      -
      -

      Type Parameters

      -
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/KeyValueObject.html b/docs/types/KeyValueObject.html deleted file mode 100644 index faec4da..0000000 --- a/docs/types/KeyValueObject.html +++ /dev/null @@ -1,186 +0,0 @@ -KeyValueObject | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias KeyValueObject

      -
      KeyValueObject: {
          [key: string]: any;
      }
      -
      -

      Type declaration

      -
        -
      • -
        [key: string]: any
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/KeyValueObjectWithId.html b/docs/types/KeyValueObjectWithId.html deleted file mode 100644 index b8cb8ca..0000000 --- a/docs/types/KeyValueObjectWithId.html +++ /dev/null @@ -1,188 +0,0 @@ -KeyValueObjectWithId | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias KeyValueObjectWithId

      -
      KeyValueObjectWithId: {
          id: string | number | symbol;
          [key: string]: any;
      }
      -
      -

      Type declaration

      -
        -
      • -
        [key: string]: any
        • -
      • -
        id: string | number | symbol
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/MapGraphCoordinate.html b/docs/types/MapGraphCoordinate.html deleted file mode 100644 index 4b948a3..0000000 --- a/docs/types/MapGraphCoordinate.html +++ /dev/null @@ -1,181 +0,0 @@ -MapGraphCoordinate | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias MapGraphCoordinate

      -
      MapGraphCoordinate: [number, number]
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/NavigatorParams.html b/docs/types/NavigatorParams.html deleted file mode 100644 index 6ae018f..0000000 --- a/docs/types/NavigatorParams.html +++ /dev/null @@ -1,215 +0,0 @@ -NavigatorParams | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias NavigatorParams<T>

      -
      NavigatorParams<T>: {
          init: {
              VISITED: T;
              charDir: Direction;
              cur: [number, number];
          };
          matrix: T[][];
          onMove: ((cur) => void);
          turning: Turning;
      }
      -
      -

      Type Parameters

      -
        -
      • -

        T = any

      -
      -

      Type declaration

      -
        -
      • -
        init: {
            VISITED: T;
            charDir: Direction;
            cur: [number, number];
        }
        -
          -
        • -
          VISITED: T
          • -
        • -
          charDir: Direction
          • -
        • -
          cur: [number, number]
        • -
      • -
        matrix: T[][]
        • -
      • -
        onMove: ((cur) => void)
        -
          -
        • -
            -
          • (cur): void
            • -
          • -
            -

            Parameters

            -
              -
            • -
              cur: [number, number]
            -

            Returns void

        • -
      • -
        turning: Turning
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/NodeOrPropertyName.html b/docs/types/NodeOrPropertyName.html deleted file mode 100644 index 6abc873..0000000 --- a/docs/types/NodeOrPropertyName.html +++ /dev/null @@ -1,181 +0,0 @@ -NodeOrPropertyName | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias NodeOrPropertyName

      -
      NodeOrPropertyName: "node" | BinaryTreeNodePropertyName
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/NonNumberNonObjectButDefined.html b/docs/types/NonNumberNonObjectButDefined.html deleted file mode 100644 index 8da41af..0000000 --- a/docs/types/NonNumberNonObjectButDefined.html +++ /dev/null @@ -1,181 +0,0 @@ -NonNumberNonObjectButDefined | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias NonNumberNonObjectButDefined

      -
      NonNumberNonObjectButDefined: string | boolean | symbol | null
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/ObjectWithNonNumberId.html b/docs/types/ObjectWithNonNumberId.html deleted file mode 100644 index 9b346d2..0000000 --- a/docs/types/ObjectWithNonNumberId.html +++ /dev/null @@ -1,188 +0,0 @@ -ObjectWithNonNumberId | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias ObjectWithNonNumberId

      -
      ObjectWithNonNumberId: {
          id: string | boolean | symbol | null | object | undefined;
          [key: string]: any;
      }
      -
      -

      Type declaration

      -
        -
      • -
        [key: string]: any
        • -
      • -
        id: string | boolean | symbol | null | object | undefined
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/ObjectWithNumberId.html b/docs/types/ObjectWithNumberId.html deleted file mode 100644 index 3432737..0000000 --- a/docs/types/ObjectWithNumberId.html +++ /dev/null @@ -1,188 +0,0 @@ -ObjectWithNumberId | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias ObjectWithNumberId

      -
      ObjectWithNumberId: {
          id: number;
          [key: string]: any;
      }
      -
      -

      Type declaration

      -
        -
      • -
        [key: string]: any
        • -
      • -
        id: number
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/ObjectWithoutId.html b/docs/types/ObjectWithoutId.html deleted file mode 100644 index 1ae3ab1..0000000 --- a/docs/types/ObjectWithoutId.html +++ /dev/null @@ -1,181 +0,0 @@ -ObjectWithoutId | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias ObjectWithoutId

      -
      ObjectWithoutId: Omit<KeyValueObject, "id">
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/PriorityQueueComparator.html b/docs/types/PriorityQueueComparator.html deleted file mode 100644 index 72a6693..0000000 --- a/docs/types/PriorityQueueComparator.html +++ /dev/null @@ -1,201 +0,0 @@ -PriorityQueueComparator | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias PriorityQueueComparator<T>

      -
      PriorityQueueComparator<T>: ((a, b) => number)
      -
      -

      Type Parameters

      -
        -
      • -

        T

      -
      -

      Type declaration

      -
        -
      • -
          -
        • (a, b): number
          • -
        • -
          -

          Parameters

          -
            -
          • -
            a: T
            • -
          • -
            b: T
          -

          Returns number

      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/PriorityQueueDFSOrderPattern.html b/docs/types/PriorityQueueDFSOrderPattern.html deleted file mode 100644 index b8ada38..0000000 --- a/docs/types/PriorityQueueDFSOrderPattern.html +++ /dev/null @@ -1,181 +0,0 @@ -PriorityQueueDFSOrderPattern | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias PriorityQueueDFSOrderPattern

      -
      PriorityQueueDFSOrderPattern: "pre" | "in" | "post"
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/PriorityQueueOptions.html b/docs/types/PriorityQueueOptions.html deleted file mode 100644 index 114fe7d..0000000 --- a/docs/types/PriorityQueueOptions.html +++ /dev/null @@ -1,195 +0,0 @@ -PriorityQueueOptions | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias PriorityQueueOptions<T>

      -
      PriorityQueueOptions<T>: {
          comparator: PriorityQueueComparator<T>;
          isFix?: boolean;
          nodes?: T[];
      }
      -
      -

      Type Parameters

      -
        -
      • -

        T

      -
      -

      Type declaration

      -
      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/RBTreeNodeNested.html b/docs/types/RBTreeNodeNested.html deleted file mode 100644 index ad34ffc..0000000 --- a/docs/types/RBTreeNodeNested.html +++ /dev/null @@ -1,186 +0,0 @@ -RBTreeNodeNested | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias RBTreeNodeNested<T>

      -
      RBTreeNodeNested<T>: RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, RBTreeNode<T, any>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
      -
      -

      Type Parameters

      -
        -
      • -

        T

      -
      -
      -
      -
      -

      Settings

       -
      -
      -

      Member Visibility

      -
        -
        • -
        • -
        • -
      -
      -

      Theme

      -
      -
      -
      -

      Generated using TypeDoc

      -
      \ No newline at end of file diff --git a/docs/types/RBTreeOptions.html b/docs/types/RBTreeOptions.html deleted file mode 100644 index 5635274..0000000 --- a/docs/types/RBTreeOptions.html +++ /dev/null @@ -1,184 +0,0 @@ -RBTreeOptions | data-structure-typed
      -
      - -
      -
      -
      -
      - -

      Type alias RBTreeOptions

      -
      RBTreeOptions: BinaryTreeOptions & {}
      -
      -

      Type declaration

      -
        -
        -
        -
        -
        -

        Settings

         -
        -
        -

        Member Visibility

        -
          -
          • -
          • -
          • -
        -
        -

        Theme

        -
        -
        -
        -

        Generated using TypeDoc

        -
        \ No newline at end of file diff --git a/docs/types/RestrictValById.html b/docs/types/RestrictValById.html deleted file mode 100644 index 2d9914e..0000000 --- a/docs/types/RestrictValById.html +++ /dev/null @@ -1,181 +0,0 @@ -RestrictValById | data-structure-typed
        -
        - -
        -
        -
        -
        - -

        Type alias RestrictValById

        -
        RestrictValById: NonNumberNonObjectButDefined | ObjectWithoutId | ObjectWithNonNumberId | ObjectWithNumberId
        -
        -
        -
        -
        -

        Settings

         -
        -
        -

        Member Visibility

        -
          -
          • -
          • -
          • -
        -
        -

        Theme

        -
        -
        -
        -

        Generated using TypeDoc

        -
        \ No newline at end of file diff --git a/docs/types/SegmentTreeNodeVal.html b/docs/types/SegmentTreeNodeVal.html deleted file mode 100644 index 0991913..0000000 --- a/docs/types/SegmentTreeNodeVal.html +++ /dev/null @@ -1,181 +0,0 @@ -SegmentTreeNodeVal | data-structure-typed
        -
        - -
        -
        -
        -
        - -

        Type alias SegmentTreeNodeVal

        -
        SegmentTreeNodeVal: number
        -
        -
        -
        -
        -

        Settings

         -
        -
        -

        Member Visibility

        -
          -
          • -
          • -
          • -
        -
        -

        Theme

        -
        -
        -
        -

        Generated using TypeDoc

        -
        \ No newline at end of file diff --git a/docs/types/SpecifyOptional.html b/docs/types/SpecifyOptional.html deleted file mode 100644 index 3b550b0..0000000 --- a/docs/types/SpecifyOptional.html +++ /dev/null @@ -1,188 +0,0 @@ -SpecifyOptional | data-structure-typed
        -
        - -
        -
        -
        -
        - -

        Type alias SpecifyOptional<T, K>

        -
        SpecifyOptional<T, K>: Omit<T, K> & Partial<Pick<T, K>>
        -
        -

        Type Parameters

        -
          -
        • -

          T

          • -
        • -

          K extends keyof T

        -
        -
        -
        -
        -

        Settings

         -
        -
        -

        Member Visibility

        -
          -
          • -
          • -
          • -
        -
        -

        Theme

        -
        -
        -
        -

        Generated using TypeDoc

        -
        \ No newline at end of file diff --git a/docs/types/Thunk.html b/docs/types/Thunk.html deleted file mode 100644 index 41e973c..0000000 --- a/docs/types/Thunk.html +++ /dev/null @@ -1,189 +0,0 @@ -Thunk | data-structure-typed
        -
        - -
        -
        -
        -
        - -

        Type alias Thunk

        -
        Thunk: (() => ReturnType<ToThunkFn> & {
            __THUNK__: symbol;
        })
        -
        -

        Type declaration

        -
          -
        • -
            -
          • (): ReturnType<ToThunkFn> & {
                __THUNK__: symbol;
            }
            • -
          • -

            Returns ReturnType<ToThunkFn> & {
                __THUNK__: symbol;
            }

        -
        -
        -
        -
        -

        Settings

         -
        -
        -

        Member Visibility

        -
          -
          • -
          • -
          • -
        -
        -

        Theme

        -
        -
        -
        -

        Generated using TypeDoc

        -
        \ No newline at end of file diff --git a/docs/types/ToThunkFn.html b/docs/types/ToThunkFn.html deleted file mode 100644 index 037d23e..0000000 --- a/docs/types/ToThunkFn.html +++ /dev/null @@ -1,189 +0,0 @@ -ToThunkFn | data-structure-typed
        -
        - -
        -
        -
        -
        - -

        Type alias ToThunkFn

        -
        ToThunkFn: (() => ReturnType<TrlFn>)
        -
        -

        Type declaration

        -
          -
        • -
            -
          • (): ReturnType<TrlFn>
            • -
          • -

            Returns ReturnType<TrlFn>

        -
        -
        -
        -
        -

        Settings

         -
        -
        -

        Member Visibility

        -
          -
          • -
          • -
          • -
        -
        -

        Theme

        -
        -
        -
        -

        Generated using TypeDoc

        -
        \ No newline at end of file diff --git a/docs/types/TopologicalStatus.html b/docs/types/TopologicalStatus.html deleted file mode 100644 index 1c30684..0000000 --- a/docs/types/TopologicalStatus.html +++ /dev/null @@ -1,181 +0,0 @@ -TopologicalStatus | data-structure-typed
        -
        - -
        -
        -
        -
        - -

        Type alias TopologicalStatus

        -
        TopologicalStatus: 0 | 1 | 2
        -
        -
        -
        -
        -

        Settings

         -
        -
        -

        Member Visibility

        -
          -
          • -
          • -
          • -
        -
        -

        Theme

        -
        -
        -
        -

        Generated using TypeDoc

        -
        \ No newline at end of file diff --git a/docs/types/TreeMultisetNodeNested.html b/docs/types/TreeMultisetNodeNested.html deleted file mode 100644 index 9b98e8f..0000000 --- a/docs/types/TreeMultisetNodeNested.html +++ /dev/null @@ -1,186 +0,0 @@ -TreeMultisetNodeNested | data-structure-typed
        -
        - -
        -
        -
        -
        - -

        Type alias TreeMultisetNodeNested<T>

        -
        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>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>
        -
        -

        Type Parameters

        -
          -
        • -

          T

        -
        -
        -
        -
        -

        Settings

         -
        -
        -

        Member Visibility

        -
          -
          • -
          • -
          • -
        -
        -

        Theme

        -
        -
        -
        -

        Generated using TypeDoc

        -
        \ No newline at end of file diff --git a/docs/types/TreeMultisetOptions.html b/docs/types/TreeMultisetOptions.html deleted file mode 100644 index 30935c2..0000000 --- a/docs/types/TreeMultisetOptions.html +++ /dev/null @@ -1,184 +0,0 @@ -TreeMultisetOptions | data-structure-typed
        -
        - -
        -
        -
        -
        - -

        Type alias TreeMultisetOptions

        -
        TreeMultisetOptions: Omit<AVLTreeOptions, "isMergeDuplicatedNodeById"> & {}
        -
        -

        Type declaration

        -
          -
          -
          -
          -
          -

          Settings

           -
          -
          -

          Member Visibility

          -
            -
            • -
            • -
            • -
          -
          -

          Theme

          -
          -
          -
          -

          Generated using TypeDoc

          -
          \ No newline at end of file diff --git a/docs/types/TrlAsyncFn.html b/docs/types/TrlAsyncFn.html deleted file mode 100644 index 5d04ace..0000000 --- a/docs/types/TrlAsyncFn.html +++ /dev/null @@ -1,194 +0,0 @@ -TrlAsyncFn | data-structure-typed
          -
          - -
          -
          -
          -
          - -

          Type alias TrlAsyncFn

          -
          TrlAsyncFn: ((...args) => any)
          -
          -

          Type declaration

          -
            -
          • -
              -
            • (...args): any
              • -
            • -
              -

              Parameters

              -
                -
              • -
                Rest ...args: any[]
              -

              Returns any

          -
          -
          -
          -
          -

          Settings

           -
          -
          -

          Member Visibility

          -
            -
            • -
            • -
            • -
          -
          -

          Theme

          -
          -
          -
          -

          Generated using TypeDoc

          -
          \ No newline at end of file diff --git a/docs/types/TrlFn.html b/docs/types/TrlFn.html deleted file mode 100644 index a18b83a..0000000 --- a/docs/types/TrlFn.html +++ /dev/null @@ -1,194 +0,0 @@ -TrlFn | data-structure-typed
          -
          - -
          -
          -
          -
          - -

          Type alias TrlFn

          -
          TrlFn: ((...args) => any)
          -
          -

          Type declaration

          -
            -
          • -
              -
            • (...args): any
              • -
            • -
              -

              Parameters

              -
                -
              • -
                Rest ...args: any[]
              -

              Returns any

          -
          -
          -
          -
          -

          Settings

           -
          -
          -

          Member Visibility

          -
            -
            • -
            • -
            • -
          -
          -

          Theme

          -
          -
          -
          -

          Generated using TypeDoc

          -
          \ No newline at end of file diff --git a/docs/types/Turning.html b/docs/types/Turning.html deleted file mode 100644 index 2eacb1e..0000000 --- a/docs/types/Turning.html +++ /dev/null @@ -1,181 +0,0 @@ -Turning | data-structure-typed
          -
          - -
          -
          -
          -
          - -

          Type alias Turning

          -
          Turning: {
              [key in Direction]: Direction
          }
          -
          -
          -
          -
          -

          Settings

           -
          -
          -

          Member Visibility

          -
            -
            • -
            • -
            • -
          -
          -

          Theme

          -
          -
          -
          -

          Generated using TypeDoc

          -
          \ No newline at end of file diff --git a/docs/types/VertexId.html b/docs/types/VertexId.html deleted file mode 100644 index 9b8c4fa..0000000 --- a/docs/types/VertexId.html +++ /dev/null @@ -1,181 +0,0 @@ -VertexId | data-structure-typed
          -
          - -
          -
          -
          -
          - -

          Type alias VertexId

          -
          VertexId: string | number
          -
          -
          -
          -
          -

          Settings

           -
          -
          -

          Member Visibility

          -
            -
            • -
            • -
            • -
          -
          -

          Theme

          -
          -
          -
          -

          Generated using TypeDoc

          -
          \ No newline at end of file diff --git a/docs/variables/THUNK_SYMBOL.html b/docs/variables/THUNK_SYMBOL.html deleted file mode 100644 index 4f0afa8..0000000 --- a/docs/variables/THUNK_SYMBOL.html +++ /dev/null @@ -1,181 +0,0 @@ -THUNK_SYMBOL | data-structure-typed
          -
          - -
          -
          -
          -
          - -

          Variable THUNK_SYMBOLConst

          -
          THUNK_SYMBOL: typeof THUNK_SYMBOL = ...
          -
          -
          -
          -
          -

          Settings

           -
          -
          -

          Member Visibility

          -
            -
            • -
            • -
            • -
          -
          -

          Theme

          -
          -
          -
          -

          Generated using TypeDoc

          -
          \ No newline at end of file