npm - data-structure-typed - Versions diffs - 1.32.2 → 1.32.9 - Mend

data-structure-typed 1.32.2 → 1.32.9

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

Files changed (246) hide show

package/.idea/data-structure-typed.iml +19 -0
package/.idea/inspectionProfiles/Project_Default.xml +6 -0
package/.idea/misc.xml +6 -0
package/.idea/modules.xml +8 -0
package/.idea/vcs.xml +6 -0
package/CHANGELOG.md +1 -1
package/README.md +366 -76
package/coverage/coverage-final.json +4 -4
package/docs/index.html +260 -9
package/package.json +48 -16
package/test/unit/data-structures/binary-tree/tree-multiset.test.ts +46 -1
package/coverage/clover.xml +0 -3393
package/coverage/lcov-report/base.css +0 -224
package/coverage/lcov-report/block-navigation.js +0 -87
package/coverage/lcov-report/favicon.png +0 -0
package/coverage/lcov-report/index.html +0 -386
package/coverage/lcov-report/prettify.css +0 -1
package/coverage/lcov-report/prettify.js +0 -2
package/coverage/lcov-report/sort-arrow-sprite.png +0 -0
package/coverage/lcov-report/sorter.js +0 -196
package/coverage/lcov-report/src/data-structures/binary-tree/aa-tree.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/binary-tree/abstract-binary-tree.ts.html +0 -4978
package/coverage/lcov-report/src/data-structures/binary-tree/avl-tree.ts.html +0 -1015
package/coverage/lcov-report/src/data-structures/binary-tree/b-tree.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/binary-tree/binary-indexed-tree.ts.html +0 -313
package/coverage/lcov-report/src/data-structures/binary-tree/binary-tree.ts.html +0 -226
package/coverage/lcov-report/src/data-structures/binary-tree/bst.ts.html +0 -1696
package/coverage/lcov-report/src/data-structures/binary-tree/index.html +0 -296
package/coverage/lcov-report/src/data-structures/binary-tree/index.ts.html +0 -121
package/coverage/lcov-report/src/data-structures/binary-tree/rb-tree.ts.html +0 -388
package/coverage/lcov-report/src/data-structures/binary-tree/segment-tree.ts.html +0 -811
package/coverage/lcov-report/src/data-structures/binary-tree/splay-tree.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/binary-tree/tree-multiset.ts.html +0 -2185
package/coverage/lcov-report/src/data-structures/binary-tree/two-three-tree.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/graph/abstract-graph.ts.html +0 -3205
package/coverage/lcov-report/src/data-structures/graph/directed-graph.ts.html +0 -1495
package/coverage/lcov-report/src/data-structures/graph/index.html +0 -176
package/coverage/lcov-report/src/data-structures/graph/index.ts.html +0 -97
package/coverage/lcov-report/src/data-structures/graph/map-graph.ts.html +0 -472
package/coverage/lcov-report/src/data-structures/graph/undirected-graph.ts.html +0 -907
package/coverage/lcov-report/src/data-structures/hash/coordinate-map.ts.html +0 -286
package/coverage/lcov-report/src/data-structures/hash/coordinate-set.ts.html +0 -253
package/coverage/lcov-report/src/data-structures/hash/hash-table.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/hash/index.html +0 -206
package/coverage/lcov-report/src/data-structures/hash/index.ts.html +0 -103
package/coverage/lcov-report/src/data-structures/hash/pair.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/hash/tree-map.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/hash/tree-set.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/heap/heap.ts.html +0 -721
package/coverage/lcov-report/src/data-structures/heap/index.html +0 -161
package/coverage/lcov-report/src/data-structures/heap/index.ts.html +0 -94
package/coverage/lcov-report/src/data-structures/heap/max-heap.ts.html +0 -178
package/coverage/lcov-report/src/data-structures/heap/min-heap.ts.html +0 -181
package/coverage/lcov-report/src/data-structures/index.html +0 -116
package/coverage/lcov-report/src/data-structures/index.ts.html +0 -118
package/coverage/lcov-report/src/data-structures/linked-list/doubly-linked-list.ts.html +0 -1804
package/coverage/lcov-report/src/data-structures/linked-list/index.html +0 -161
package/coverage/lcov-report/src/data-structures/linked-list/index.ts.html +0 -94
package/coverage/lcov-report/src/data-structures/linked-list/singly-linked-list.ts.html +0 -1588
package/coverage/lcov-report/src/data-structures/linked-list/skip-linked-list.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/matrix/index.html +0 -176
package/coverage/lcov-report/src/data-structures/matrix/index.ts.html +0 -97
package/coverage/lcov-report/src/data-structures/matrix/matrix.ts.html +0 -166
package/coverage/lcov-report/src/data-structures/matrix/matrix2d.ts.html +0 -721
package/coverage/lcov-report/src/data-structures/matrix/navigator.ts.html +0 -448
package/coverage/lcov-report/src/data-structures/matrix/vector2d.ts.html +0 -1033
package/coverage/lcov-report/src/data-structures/priority-queue/index.html +0 -161
package/coverage/lcov-report/src/data-structures/priority-queue/index.ts.html +0 -94
package/coverage/lcov-report/src/data-structures/priority-queue/max-priority-queue.ts.html +0 -253
package/coverage/lcov-report/src/data-structures/priority-queue/min-priority-queue.ts.html +0 -256
package/coverage/lcov-report/src/data-structures/priority-queue/priority-queue.ts.html +0 -1162
package/coverage/lcov-report/src/data-structures/queue/deque.ts.html +0 -976
package/coverage/lcov-report/src/data-structures/queue/index.html +0 -146
package/coverage/lcov-report/src/data-structures/queue/index.ts.html +0 -91
package/coverage/lcov-report/src/data-structures/queue/queue.ts.html +0 -658
package/coverage/lcov-report/src/data-structures/stack/index.html +0 -131
package/coverage/lcov-report/src/data-structures/stack/index.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/stack/stack.ts.html +0 -379
package/coverage/lcov-report/src/data-structures/tree/index.html +0 -131
package/coverage/lcov-report/src/data-structures/tree/index.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/tree/tree.ts.html +0 -292
package/coverage/lcov-report/src/data-structures/trie/index.html +0 -131
package/coverage/lcov-report/src/data-structures/trie/index.ts.html +0 -88
package/coverage/lcov-report/src/data-structures/trie/trie.ts.html +0 -760
package/coverage/lcov-report/src/index.html +0 -116
package/coverage/lcov-report/src/index.ts.html +0 -97
package/coverage/lcov-report/src/interfaces/index.html +0 -116
package/coverage/lcov-report/src/interfaces/index.ts.html +0 -130
package/coverage/lcov-report/src/types/data-structures/abstract-binary-tree.ts.html +0 -235
package/coverage/lcov-report/src/types/data-structures/bst.ts.html +0 -124
package/coverage/lcov-report/src/types/data-structures/directed-graph.ts.html +0 -109
package/coverage/lcov-report/src/types/data-structures/index.html +0 -176
package/coverage/lcov-report/src/types/data-structures/index.ts.html +0 -130
package/coverage/lcov-report/src/types/data-structures/rb-tree.ts.html +0 -106
package/coverage/lcov-report/src/types/index.html +0 -116
package/coverage/lcov-report/src/types/index.ts.html +0 -94
package/coverage/lcov-report/src/types/utils/index.html +0 -116
package/coverage/lcov-report/src/types/utils/index.ts.html +0 -91
package/coverage/lcov-report/src/utils/index.html +0 -131
package/coverage/lcov-report/src/utils/index.ts.html +0 -88
package/coverage/lcov-report/src/utils/utils.ts.html +0 -322
package/coverage/lcov-report/test/utils/index.html +0 -146
package/coverage/lcov-report/test/utils/index.ts.html +0 -91
package/coverage/lcov-report/test/utils/magnitude.ts.html +0 -148
package/coverage/lcov-report/test/utils/number.ts.html +0 -94
package/coverage/lcov.info +0 -6676
package/docs/assets/highlight.css +0 -127
package/docs/assets/main.js +0 -58
package/docs/assets/search.js +0 -1
package/docs/assets/style.css +0 -1367
package/docs/classes/AVLTree.html +0 -2182
package/docs/classes/AVLTreeNode.html +0 -399
package/docs/classes/AaTree.html +0 -202
package/docs/classes/AbstractBinaryTree.html +0 -1836
package/docs/classes/AbstractBinaryTreeNode.html +0 -441
package/docs/classes/AbstractEdge.html +0 -345
package/docs/classes/AbstractGraph.html +0 -1105
package/docs/classes/AbstractVertex.html +0 -299
package/docs/classes/ArrayDeque.html +0 -469
package/docs/classes/BST.html +0 -2026
package/docs/classes/BSTNode.html +0 -400
package/docs/classes/BTree.html +0 -202
package/docs/classes/BinaryIndexedTree.html +0 -371
package/docs/classes/BinaryTree.html +0 -1867
package/docs/classes/BinaryTreeNode.html +0 -399
package/docs/classes/Character.html +0 -250
package/docs/classes/CoordinateMap.html +0 -513
package/docs/classes/CoordinateSet.html +0 -474
package/docs/classes/Deque.html +0 -1005
package/docs/classes/DirectedEdge.html +0 -404
package/docs/classes/DirectedGraph.html +0 -1530
package/docs/classes/DirectedVertex.html +0 -286
package/docs/classes/DoublyLinkedList.html +0 -998
package/docs/classes/DoublyLinkedListNode.html +0 -327
package/docs/classes/HashTable.html +0 -202
package/docs/classes/Heap.html +0 -647
package/docs/classes/HeapItem.html +0 -296
package/docs/classes/LinkedListQueue.html +0 -884
package/docs/classes/MapEdge.html +0 -391
package/docs/classes/MapGraph.html +0 -1583
package/docs/classes/MapVertex.html +0 -356
package/docs/classes/Matrix2D.html +0 -532
package/docs/classes/MatrixNTI2D.html +0 -270
package/docs/classes/MaxHeap.html +0 -671
package/docs/classes/MaxPriorityQueue.html +0 -866
package/docs/classes/MinHeap.html +0 -672
package/docs/classes/MinPriorityQueue.html +0 -868
package/docs/classes/Navigator.html +0 -343
package/docs/classes/ObjectDeque.html +0 -527
package/docs/classes/Pair.html +0 -202
package/docs/classes/PriorityQueue.html +0 -790
package/docs/classes/Queue.html +0 -521
package/docs/classes/RBTree.html +0 -2024
package/docs/classes/RBTreeNode.html +0 -431
package/docs/classes/SegmentTree.html +0 -464
package/docs/classes/SegmentTreeNode.html +0 -387
package/docs/classes/SinglyLinkedList.html +0 -830
package/docs/classes/SinglyLinkedListNode.html +0 -300
package/docs/classes/SkipLinkedList.html +0 -202
package/docs/classes/SplayTree.html +0 -202
package/docs/classes/Stack.html +0 -398
package/docs/classes/TreeMap.html +0 -202
package/docs/classes/TreeMultiset.html +0 -2510
package/docs/classes/TreeMultisetNode.html +0 -447
package/docs/classes/TreeNode.html +0 -344
package/docs/classes/TreeSet.html +0 -202
package/docs/classes/Trie.html +0 -402
package/docs/classes/TrieNode.html +0 -310
package/docs/classes/TwoThreeTree.html +0 -202
package/docs/classes/UndirectedEdge.html +0 -374
package/docs/classes/UndirectedGraph.html +0 -1285
package/docs/classes/UndirectedVertex.html +0 -284
package/docs/classes/Vector2D.html +0 -835
package/docs/enums/CP.html +0 -211
package/docs/enums/FamilyPosition.html +0 -239
package/docs/enums/LoopType.html +0 -212
package/docs/enums/RBColor.html +0 -204
package/docs/enums/TopologicalProperty.html +0 -211
package/docs/functions/arrayRemove.html +0 -208
package/docs/functions/isThunk.html +0 -186
package/docs/functions/toThunk.html +0 -186
package/docs/functions/trampoline.html +0 -186
package/docs/functions/trampolineAsync.html +0 -186
package/docs/functions/uuidV4.html +0 -181
package/docs/interfaces/IAVLTree.html +0 -1245
package/docs/interfaces/IAbstractBinaryTree.html +0 -1101
package/docs/interfaces/IAbstractBinaryTreeNode.html +0 -335
package/docs/interfaces/IAbstractGraph.html +0 -433
package/docs/interfaces/IBST.html +0 -1245
package/docs/interfaces/IDirectedGraph.html +0 -570
package/docs/interfaces/IRBTree.html +0 -1247
package/docs/interfaces/IUNDirectedGraph.html +0 -463
package/docs/types/AVLTreeNodeNested.html +0 -182
package/docs/types/AVLTreeOptions.html +0 -180
package/docs/types/AbstractBinaryTreeNodeNested.html +0 -182
package/docs/types/AbstractBinaryTreeNodeProperties.html +0 -182
package/docs/types/AbstractBinaryTreeNodeProperty.html +0 -182
package/docs/types/AbstractBinaryTreeOptions.html +0 -182
package/docs/types/BSTComparator.html +0 -192
package/docs/types/BSTNodeNested.html +0 -182
package/docs/types/BSTOptions.html +0 -182
package/docs/types/BinaryTreeDeletedResult.html +0 -189
package/docs/types/BinaryTreeNodeId.html +0 -177
package/docs/types/BinaryTreeNodeNested.html +0 -182
package/docs/types/BinaryTreeNodePropertyName.html +0 -177
package/docs/types/BinaryTreeOptions.html +0 -180
package/docs/types/DFSOrderPattern.html +0 -177
package/docs/types/DijkstraResult.html +0 -199
package/docs/types/Direction.html +0 -177
package/docs/types/DummyAny.html +0 -190
package/docs/types/EdgeId.html +0 -177
package/docs/types/HeapOptions.html +0 -198
package/docs/types/IAVLTreeNode.html +0 -184
package/docs/types/IBSTNode.html +0 -184
package/docs/types/IBinaryTree.html +0 -182
package/docs/types/IBinaryTreeNode.html +0 -184
package/docs/types/IRBTreeNode.html +0 -184
package/docs/types/ITreeMultiset.html +0 -182
package/docs/types/ITreeMultisetNode.html +0 -184
package/docs/types/KeyValueObject.html +0 -182
package/docs/types/KeyValueObjectWithId.html +0 -184
package/docs/types/MapGraphCoordinate.html +0 -177
package/docs/types/NavigatorParams.html +0 -211
package/docs/types/NodeOrPropertyName.html +0 -177
package/docs/types/NonNumberNonObjectButDefined.html +0 -177
package/docs/types/ObjectWithNonNumberId.html +0 -184
package/docs/types/ObjectWithNumberId.html +0 -184
package/docs/types/ObjectWithoutId.html +0 -177
package/docs/types/PriorityQueueComparator.html +0 -197
package/docs/types/PriorityQueueDFSOrderPattern.html +0 -177
package/docs/types/PriorityQueueOptions.html +0 -191
package/docs/types/RBTreeNodeNested.html +0 -182
package/docs/types/RBTreeOptions.html +0 -180
package/docs/types/RestrictValById.html +0 -177
package/docs/types/SegmentTreeNodeVal.html +0 -177
package/docs/types/SpecifyOptional.html +0 -184
package/docs/types/Thunk.html +0 -185
package/docs/types/ToThunkFn.html +0 -185
package/docs/types/TopologicalStatus.html +0 -177
package/docs/types/TreeMultisetNodeNested.html +0 -182
package/docs/types/TreeMultisetOptions.html +0 -180
package/docs/types/TrlAsyncFn.html +0 -190
package/docs/types/TrlFn.html +0 -190
package/docs/types/Turning.html +0 -177
package/docs/types/VertexId.html +0 -177
package/docs/variables/THUNK_SYMBOL.html +0 -177

package/coverage/lcov-report/src/data-structures/binary-tree/bst.ts.html DELETED Viewed

@@ -1,1696 +0,0 @@
-<!doctype html>
-<html lang="en">
-<head>
-    <title>Code coverage report for src/data-structures/binary-tree/bst.ts</title>
-    <meta charset="utf-8" />
-    <link rel="stylesheet" href="../../../prettify.css" />
-    <link rel="stylesheet" href="../../../base.css" />
-    <link rel="shortcut icon" type="image/x-icon" href="../../../favicon.png" />
-    <meta name="viewport" content="width=device-width, initial-scale=1" />
-    <style type='text/css'>
-        .coverage-summary .sorter {
-            background-image: url(../../../sort-arrow-sprite.png);
-        }
-    </style>
-</head>
-<body>
-<div class='wrapper'>
-    <div class='pad1'>
-        <h1><a href="../../../index.html">All files</a> / <a href="index.html">src/data-structures/binary-tree</a> bst.ts</h1>
-        <div class='clearfix'>
-            <div class='fl pad1y space-right2'>
-                <span class="strong">46.75% </span>
-                <span class="quiet">Statements</span>
-                <span class='fraction'>144/308</span>
-            </div>
-            <div class='fl pad1y space-right2'>
-                <span class="strong">38.26% </span>
-                <span class="quiet">Branches</span>
-                <span class='fraction'>88/230</span>
-            </div>
-            <div class='fl pad1y space-right2'>
-                <span class="strong">41.93% </span>
-                <span class="quiet">Functions</span>
-                <span class='fraction'>13/31</span>
-            </div>
-            <div class='fl pad1y space-right2'>
-                <span class="strong">51.17% </span>
-                <span class="quiet">Lines</span>
-                <span class='fraction'>131/256</span>
-            </div>
-        </div>
-        <p class="quiet">
-            Press <em>n</em> or <em>j</em> to go to the next uncovered block, <em>b</em>, <em>p</em> or <em>k</em> for the previous block.
-        </p>
-        <template id="filterTemplate">
-            <div class="quiet">
-                Filter:
-                <input oninput="onInput()" type="search" id="fileSearch">
-            </div>
-        </template>
-    </div>
-    <div class='status-line low'></div>
-    <pre><table class="coverage">
-<tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
-<a name='L2'></a><a href='#L2'>2</a>
-<a name='L3'></a><a href='#L3'>3</a>
-<a name='L4'></a><a href='#L4'>4</a>
-<a name='L5'></a><a href='#L5'>5</a>
-<a name='L6'></a><a href='#L6'>6</a>
-<a name='L7'></a><a href='#L7'>7</a>
-<a name='L8'></a><a href='#L8'>8</a>
-<a name='L9'></a><a href='#L9'>9</a>
-<a name='L10'></a><a href='#L10'>10</a>
-<a name='L11'></a><a href='#L11'>11</a>
-<a name='L12'></a><a href='#L12'>12</a>
-<a name='L13'></a><a href='#L13'>13</a>
-<a name='L14'></a><a href='#L14'>14</a>
-<a name='L15'></a><a href='#L15'>15</a>
-<a name='L16'></a><a href='#L16'>16</a>
-<a name='L17'></a><a href='#L17'>17</a>
-<a name='L18'></a><a href='#L18'>18</a>
-<a name='L19'></a><a href='#L19'>19</a>
-<a name='L20'></a><a href='#L20'>20</a>
-<a name='L21'></a><a href='#L21'>21</a>
-<a name='L22'></a><a href='#L22'>22</a>
-<a name='L23'></a><a href='#L23'>23</a>
-<a name='L24'></a><a href='#L24'>24</a>
-<a name='L25'></a><a href='#L25'>25</a>
-<a name='L26'></a><a href='#L26'>26</a>
-<a name='L27'></a><a href='#L27'>27</a>
-<a name='L28'></a><a href='#L28'>28</a>
-<a name='L29'></a><a href='#L29'>29</a>
-<a name='L30'></a><a href='#L30'>30</a>
-<a name='L31'></a><a href='#L31'>31</a>
-<a name='L32'></a><a href='#L32'>32</a>
-<a name='L33'></a><a href='#L33'>33</a>
-<a name='L34'></a><a href='#L34'>34</a>
-<a name='L35'></a><a href='#L35'>35</a>
-<a name='L36'></a><a href='#L36'>36</a>
-<a name='L37'></a><a href='#L37'>37</a>
-<a name='L38'></a><a href='#L38'>38</a>
-<a name='L39'></a><a href='#L39'>39</a>
-<a name='L40'></a><a href='#L40'>40</a>
-<a name='L41'></a><a href='#L41'>41</a>
-<a name='L42'></a><a href='#L42'>42</a>
-<a name='L43'></a><a href='#L43'>43</a>
-<a name='L44'></a><a href='#L44'>44</a>
-<a name='L45'></a><a href='#L45'>45</a>
-<a name='L46'></a><a href='#L46'>46</a>
-<a name='L47'></a><a href='#L47'>47</a>
-<a name='L48'></a><a href='#L48'>48</a>
-<a name='L49'></a><a href='#L49'>49</a>
-<a name='L50'></a><a href='#L50'>50</a>
-<a name='L51'></a><a href='#L51'>51</a>
-<a name='L52'></a><a href='#L52'>52</a>
-<a name='L53'></a><a href='#L53'>53</a>
-<a name='L54'></a><a href='#L54'>54</a>
-<a name='L55'></a><a href='#L55'>55</a>
-<a name='L56'></a><a href='#L56'>56</a>
-<a name='L57'></a><a href='#L57'>57</a>
-<a name='L58'></a><a href='#L58'>58</a>
-<a name='L59'></a><a href='#L59'>59</a>
-<a name='L60'></a><a href='#L60'>60</a>
-<a name='L61'></a><a href='#L61'>61</a>
-<a name='L62'></a><a href='#L62'>62</a>
-<a name='L63'></a><a href='#L63'>63</a>
-<a name='L64'></a><a href='#L64'>64</a>
-<a name='L65'></a><a href='#L65'>65</a>
-<a name='L66'></a><a href='#L66'>66</a>
-<a name='L67'></a><a href='#L67'>67</a>
-<a name='L68'></a><a href='#L68'>68</a>
-<a name='L69'></a><a href='#L69'>69</a>
-<a name='L70'></a><a href='#L70'>70</a>
-<a name='L71'></a><a href='#L71'>71</a>
-<a name='L72'></a><a href='#L72'>72</a>
-<a name='L73'></a><a href='#L73'>73</a>
-<a name='L74'></a><a href='#L74'>74</a>
-<a name='L75'></a><a href='#L75'>75</a>
-<a name='L76'></a><a href='#L76'>76</a>
-<a name='L77'></a><a href='#L77'>77</a>
-<a name='L78'></a><a href='#L78'>78</a>
-<a name='L79'></a><a href='#L79'>79</a>
-<a name='L80'></a><a href='#L80'>80</a>
-<a name='L81'></a><a href='#L81'>81</a>
-<a name='L82'></a><a href='#L82'>82</a>
-<a name='L83'></a><a href='#L83'>83</a>
-<a name='L84'></a><a href='#L84'>84</a>
-<a name='L85'></a><a href='#L85'>85</a>
-<a name='L86'></a><a href='#L86'>86</a>
-<a name='L87'></a><a href='#L87'>87</a>
-<a name='L88'></a><a href='#L88'>88</a>
-<a name='L89'></a><a href='#L89'>89</a>
-<a name='L90'></a><a href='#L90'>90</a>
-<a name='L91'></a><a href='#L91'>91</a>
-<a name='L92'></a><a href='#L92'>92</a>
-<a name='L93'></a><a href='#L93'>93</a>
-<a name='L94'></a><a href='#L94'>94</a>
-<a name='L95'></a><a href='#L95'>95</a>
-<a name='L96'></a><a href='#L96'>96</a>
-<a name='L97'></a><a href='#L97'>97</a>
-<a name='L98'></a><a href='#L98'>98</a>
-<a name='L99'></a><a href='#L99'>99</a>
-<a name='L100'></a><a href='#L100'>100</a>
-<a name='L101'></a><a href='#L101'>101</a>
-<a name='L102'></a><a href='#L102'>102</a>
-<a name='L103'></a><a href='#L103'>103</a>
-<a name='L104'></a><a href='#L104'>104</a>
-<a name='L105'></a><a href='#L105'>105</a>
-<a name='L106'></a><a href='#L106'>106</a>
-<a name='L107'></a><a href='#L107'>107</a>
-<a name='L108'></a><a href='#L108'>108</a>
-<a name='L109'></a><a href='#L109'>109</a>
-<a name='L110'></a><a href='#L110'>110</a>
-<a name='L111'></a><a href='#L111'>111</a>
-<a name='L112'></a><a href='#L112'>112</a>
-<a name='L113'></a><a href='#L113'>113</a>
-<a name='L114'></a><a href='#L114'>114</a>
-<a name='L115'></a><a href='#L115'>115</a>
-<a name='L116'></a><a href='#L116'>116</a>
-<a name='L117'></a><a href='#L117'>117</a>
-<a name='L118'></a><a href='#L118'>118</a>
-<a name='L119'></a><a href='#L119'>119</a>
-<a name='L120'></a><a href='#L120'>120</a>
-<a name='L121'></a><a href='#L121'>121</a>
-<a name='L122'></a><a href='#L122'>122</a>
-<a name='L123'></a><a href='#L123'>123</a>
-<a name='L124'></a><a href='#L124'>124</a>
-<a name='L125'></a><a href='#L125'>125</a>
-<a name='L126'></a><a href='#L126'>126</a>
-<a name='L127'></a><a href='#L127'>127</a>
-<a name='L128'></a><a href='#L128'>128</a>
-<a name='L129'></a><a href='#L129'>129</a>
-<a name='L130'></a><a href='#L130'>130</a>
-<a name='L131'></a><a href='#L131'>131</a>
-<a name='L132'></a><a href='#L132'>132</a>
-<a name='L133'></a><a href='#L133'>133</a>
-<a name='L134'></a><a href='#L134'>134</a>
-<a name='L135'></a><a href='#L135'>135</a>
-<a name='L136'></a><a href='#L136'>136</a>
-<a name='L137'></a><a href='#L137'>137</a>
-<a name='L138'></a><a href='#L138'>138</a>
-<a name='L139'></a><a href='#L139'>139</a>
-<a name='L140'></a><a href='#L140'>140</a>
-<a name='L141'></a><a href='#L141'>141</a>
-<a name='L142'></a><a href='#L142'>142</a>
-<a name='L143'></a><a href='#L143'>143</a>
-<a name='L144'></a><a href='#L144'>144</a>
-<a name='L145'></a><a href='#L145'>145</a>
-<a name='L146'></a><a href='#L146'>146</a>
-<a name='L147'></a><a href='#L147'>147</a>
-<a name='L148'></a><a href='#L148'>148</a>
-<a name='L149'></a><a href='#L149'>149</a>
-<a name='L150'></a><a href='#L150'>150</a>
-<a name='L151'></a><a href='#L151'>151</a>
-<a name='L152'></a><a href='#L152'>152</a>
-<a name='L153'></a><a href='#L153'>153</a>
-<a name='L154'></a><a href='#L154'>154</a>
-<a name='L155'></a><a href='#L155'>155</a>
-<a name='L156'></a><a href='#L156'>156</a>
-<a name='L157'></a><a href='#L157'>157</a>
-<a name='L158'></a><a href='#L158'>158</a>
-<a name='L159'></a><a href='#L159'>159</a>
-<a name='L160'></a><a href='#L160'>160</a>
-<a name='L161'></a><a href='#L161'>161</a>
-<a name='L162'></a><a href='#L162'>162</a>
-<a name='L163'></a><a href='#L163'>163</a>
-<a name='L164'></a><a href='#L164'>164</a>
-<a name='L165'></a><a href='#L165'>165</a>
-<a name='L166'></a><a href='#L166'>166</a>
-<a name='L167'></a><a href='#L167'>167</a>
-<a name='L168'></a><a href='#L168'>168</a>
-<a name='L169'></a><a href='#L169'>169</a>
-<a name='L170'></a><a href='#L170'>170</a>
-<a name='L171'></a><a href='#L171'>171</a>
-<a name='L172'></a><a href='#L172'>172</a>
-<a name='L173'></a><a href='#L173'>173</a>
-<a name='L174'></a><a href='#L174'>174</a>
-<a name='L175'></a><a href='#L175'>175</a>
-<a name='L176'></a><a href='#L176'>176</a>
-<a name='L177'></a><a href='#L177'>177</a>
-<a name='L178'></a><a href='#L178'>178</a>
-<a name='L179'></a><a href='#L179'>179</a>
-<a name='L180'></a><a href='#L180'>180</a>
-<a name='L181'></a><a href='#L181'>181</a>
-<a name='L182'></a><a href='#L182'>182</a>
-<a name='L183'></a><a href='#L183'>183</a>
-<a name='L184'></a><a href='#L184'>184</a>
-<a name='L185'></a><a href='#L185'>185</a>
-<a name='L186'></a><a href='#L186'>186</a>
-<a name='L187'></a><a href='#L187'>187</a>
-<a name='L188'></a><a href='#L188'>188</a>
-<a name='L189'></a><a href='#L189'>189</a>
-<a name='L190'></a><a href='#L190'>190</a>
-<a name='L191'></a><a href='#L191'>191</a>
-<a name='L192'></a><a href='#L192'>192</a>
-<a name='L193'></a><a href='#L193'>193</a>
-<a name='L194'></a><a href='#L194'>194</a>
-<a name='L195'></a><a href='#L195'>195</a>
-<a name='L196'></a><a href='#L196'>196</a>
-<a name='L197'></a><a href='#L197'>197</a>
-<a name='L198'></a><a href='#L198'>198</a>
-<a name='L199'></a><a href='#L199'>199</a>
-<a name='L200'></a><a href='#L200'>200</a>
-<a name='L201'></a><a href='#L201'>201</a>
-<a name='L202'></a><a href='#L202'>202</a>
-<a name='L203'></a><a href='#L203'>203</a>
-<a name='L204'></a><a href='#L204'>204</a>
-<a name='L205'></a><a href='#L205'>205</a>
-<a name='L206'></a><a href='#L206'>206</a>
-<a name='L207'></a><a href='#L207'>207</a>
-<a name='L208'></a><a href='#L208'>208</a>
-<a name='L209'></a><a href='#L209'>209</a>
-<a name='L210'></a><a href='#L210'>210</a>
-<a name='L211'></a><a href='#L211'>211</a>
-<a name='L212'></a><a href='#L212'>212</a>
-<a name='L213'></a><a href='#L213'>213</a>
-<a name='L214'></a><a href='#L214'>214</a>
-<a name='L215'></a><a href='#L215'>215</a>
-<a name='L216'></a><a href='#L216'>216</a>
-<a name='L217'></a><a href='#L217'>217</a>
-<a name='L218'></a><a href='#L218'>218</a>
-<a name='L219'></a><a href='#L219'>219</a>
-<a name='L220'></a><a href='#L220'>220</a>
-<a name='L221'></a><a href='#L221'>221</a>
-<a name='L222'></a><a href='#L222'>222</a>
-<a name='L223'></a><a href='#L223'>223</a>
-<a name='L224'></a><a href='#L224'>224</a>
-<a name='L225'></a><a href='#L225'>225</a>
-<a name='L226'></a><a href='#L226'>226</a>
-<a name='L227'></a><a href='#L227'>227</a>
-<a name='L228'></a><a href='#L228'>228</a>
-<a name='L229'></a><a href='#L229'>229</a>
-<a name='L230'></a><a href='#L230'>230</a>
-<a name='L231'></a><a href='#L231'>231</a>
-<a name='L232'></a><a href='#L232'>232</a>
-<a name='L233'></a><a href='#L233'>233</a>
-<a name='L234'></a><a href='#L234'>234</a>
-<a name='L235'></a><a href='#L235'>235</a>
-<a name='L236'></a><a href='#L236'>236</a>
-<a name='L237'></a><a href='#L237'>237</a>
-<a name='L238'></a><a href='#L238'>238</a>
-<a name='L239'></a><a href='#L239'>239</a>
-<a name='L240'></a><a href='#L240'>240</a>
-<a name='L241'></a><a href='#L241'>241</a>
-<a name='L242'></a><a href='#L242'>242</a>
-<a name='L243'></a><a href='#L243'>243</a>
-<a name='L244'></a><a href='#L244'>244</a>
-<a name='L245'></a><a href='#L245'>245</a>
-<a name='L246'></a><a href='#L246'>246</a>
-<a name='L247'></a><a href='#L247'>247</a>
-<a name='L248'></a><a href='#L248'>248</a>
-<a name='L249'></a><a href='#L249'>249</a>
-<a name='L250'></a><a href='#L250'>250</a>
-<a name='L251'></a><a href='#L251'>251</a>
-<a name='L252'></a><a href='#L252'>252</a>
-<a name='L253'></a><a href='#L253'>253</a>
-<a name='L254'></a><a href='#L254'>254</a>
-<a name='L255'></a><a href='#L255'>255</a>
-<a name='L256'></a><a href='#L256'>256</a>
-<a name='L257'></a><a href='#L257'>257</a>
-<a name='L258'></a><a href='#L258'>258</a>
-<a name='L259'></a><a href='#L259'>259</a>
-<a name='L260'></a><a href='#L260'>260</a>
-<a name='L261'></a><a href='#L261'>261</a>
-<a name='L262'></a><a href='#L262'>262</a>
-<a name='L263'></a><a href='#L263'>263</a>
-<a name='L264'></a><a href='#L264'>264</a>
-<a name='L265'></a><a href='#L265'>265</a>
-<a name='L266'></a><a href='#L266'>266</a>
-<a name='L267'></a><a href='#L267'>267</a>
-<a name='L268'></a><a href='#L268'>268</a>
-<a name='L269'></a><a href='#L269'>269</a>
-<a name='L270'></a><a href='#L270'>270</a>
-<a name='L271'></a><a href='#L271'>271</a>
-<a name='L272'></a><a href='#L272'>272</a>
-<a name='L273'></a><a href='#L273'>273</a>
-<a name='L274'></a><a href='#L274'>274</a>
-<a name='L275'></a><a href='#L275'>275</a>
-<a name='L276'></a><a href='#L276'>276</a>
-<a name='L277'></a><a href='#L277'>277</a>
-<a name='L278'></a><a href='#L278'>278</a>
-<a name='L279'></a><a href='#L279'>279</a>
-<a name='L280'></a><a href='#L280'>280</a>
-<a name='L281'></a><a href='#L281'>281</a>
-<a name='L282'></a><a href='#L282'>282</a>
-<a name='L283'></a><a href='#L283'>283</a>
-<a name='L284'></a><a href='#L284'>284</a>
-<a name='L285'></a><a href='#L285'>285</a>
-<a name='L286'></a><a href='#L286'>286</a>
-<a name='L287'></a><a href='#L287'>287</a>
-<a name='L288'></a><a href='#L288'>288</a>
-<a name='L289'></a><a href='#L289'>289</a>
-<a name='L290'></a><a href='#L290'>290</a>
-<a name='L291'></a><a href='#L291'>291</a>
-<a name='L292'></a><a href='#L292'>292</a>
-<a name='L293'></a><a href='#L293'>293</a>
-<a name='L294'></a><a href='#L294'>294</a>
-<a name='L295'></a><a href='#L295'>295</a>
-<a name='L296'></a><a href='#L296'>296</a>
-<a name='L297'></a><a href='#L297'>297</a>
-<a name='L298'></a><a href='#L298'>298</a>
-<a name='L299'></a><a href='#L299'>299</a>
-<a name='L300'></a><a href='#L300'>300</a>
-<a name='L301'></a><a href='#L301'>301</a>
-<a name='L302'></a><a href='#L302'>302</a>
-<a name='L303'></a><a href='#L303'>303</a>
-<a name='L304'></a><a href='#L304'>304</a>
-<a name='L305'></a><a href='#L305'>305</a>
-<a name='L306'></a><a href='#L306'>306</a>
-<a name='L307'></a><a href='#L307'>307</a>
-<a name='L308'></a><a href='#L308'>308</a>
-<a name='L309'></a><a href='#L309'>309</a>
-<a name='L310'></a><a href='#L310'>310</a>
-<a name='L311'></a><a href='#L311'>311</a>
-<a name='L312'></a><a href='#L312'>312</a>
-<a name='L313'></a><a href='#L313'>313</a>
-<a name='L314'></a><a href='#L314'>314</a>
-<a name='L315'></a><a href='#L315'>315</a>
-<a name='L316'></a><a href='#L316'>316</a>
-<a name='L317'></a><a href='#L317'>317</a>
-<a name='L318'></a><a href='#L318'>318</a>
-<a name='L319'></a><a href='#L319'>319</a>
-<a name='L320'></a><a href='#L320'>320</a>
-<a name='L321'></a><a href='#L321'>321</a>
-<a name='L322'></a><a href='#L322'>322</a>
-<a name='L323'></a><a href='#L323'>323</a>
-<a name='L324'></a><a href='#L324'>324</a>
-<a name='L325'></a><a href='#L325'>325</a>
-<a name='L326'></a><a href='#L326'>326</a>
-<a name='L327'></a><a href='#L327'>327</a>
-<a name='L328'></a><a href='#L328'>328</a>
-<a name='L329'></a><a href='#L329'>329</a>
-<a name='L330'></a><a href='#L330'>330</a>
-<a name='L331'></a><a href='#L331'>331</a>
-<a name='L332'></a><a href='#L332'>332</a>
-<a name='L333'></a><a href='#L333'>333</a>
-<a name='L334'></a><a href='#L334'>334</a>
-<a name='L335'></a><a href='#L335'>335</a>
-<a name='L336'></a><a href='#L336'>336</a>
-<a name='L337'></a><a href='#L337'>337</a>
-<a name='L338'></a><a href='#L338'>338</a>
-<a name='L339'></a><a href='#L339'>339</a>
-<a name='L340'></a><a href='#L340'>340</a>
-<a name='L341'></a><a href='#L341'>341</a>
-<a name='L342'></a><a href='#L342'>342</a>
-<a name='L343'></a><a href='#L343'>343</a>
-<a name='L344'></a><a href='#L344'>344</a>
-<a name='L345'></a><a href='#L345'>345</a>
-<a name='L346'></a><a href='#L346'>346</a>
-<a name='L347'></a><a href='#L347'>347</a>
-<a name='L348'></a><a href='#L348'>348</a>
-<a name='L349'></a><a href='#L349'>349</a>
-<a name='L350'></a><a href='#L350'>350</a>
-<a name='L351'></a><a href='#L351'>351</a>
-<a name='L352'></a><a href='#L352'>352</a>
-<a name='L353'></a><a href='#L353'>353</a>
-<a name='L354'></a><a href='#L354'>354</a>
-<a name='L355'></a><a href='#L355'>355</a>
-<a name='L356'></a><a href='#L356'>356</a>
-<a name='L357'></a><a href='#L357'>357</a>
-<a name='L358'></a><a href='#L358'>358</a>
-<a name='L359'></a><a href='#L359'>359</a>
-<a name='L360'></a><a href='#L360'>360</a>
-<a name='L361'></a><a href='#L361'>361</a>
-<a name='L362'></a><a href='#L362'>362</a>
-<a name='L363'></a><a href='#L363'>363</a>
-<a name='L364'></a><a href='#L364'>364</a>
-<a name='L365'></a><a href='#L365'>365</a>
-<a name='L366'></a><a href='#L366'>366</a>
-<a name='L367'></a><a href='#L367'>367</a>
-<a name='L368'></a><a href='#L368'>368</a>
-<a name='L369'></a><a href='#L369'>369</a>
-<a name='L370'></a><a href='#L370'>370</a>
-<a name='L371'></a><a href='#L371'>371</a>
-<a name='L372'></a><a href='#L372'>372</a>
-<a name='L373'></a><a href='#L373'>373</a>
-<a name='L374'></a><a href='#L374'>374</a>
-<a name='L375'></a><a href='#L375'>375</a>
-<a name='L376'></a><a href='#L376'>376</a>
-<a name='L377'></a><a href='#L377'>377</a>
-<a name='L378'></a><a href='#L378'>378</a>
-<a name='L379'></a><a href='#L379'>379</a>
-<a name='L380'></a><a href='#L380'>380</a>
-<a name='L381'></a><a href='#L381'>381</a>
-<a name='L382'></a><a href='#L382'>382</a>
-<a name='L383'></a><a href='#L383'>383</a>
-<a name='L384'></a><a href='#L384'>384</a>
-<a name='L385'></a><a href='#L385'>385</a>
-<a name='L386'></a><a href='#L386'>386</a>
-<a name='L387'></a><a href='#L387'>387</a>
-<a name='L388'></a><a href='#L388'>388</a>
-<a name='L389'></a><a href='#L389'>389</a>
-<a name='L390'></a><a href='#L390'>390</a>
-<a name='L391'></a><a href='#L391'>391</a>
-<a name='L392'></a><a href='#L392'>392</a>
-<a name='L393'></a><a href='#L393'>393</a>
-<a name='L394'></a><a href='#L394'>394</a>
-<a name='L395'></a><a href='#L395'>395</a>
-<a name='L396'></a><a href='#L396'>396</a>
-<a name='L397'></a><a href='#L397'>397</a>
-<a name='L398'></a><a href='#L398'>398</a>
-<a name='L399'></a><a href='#L399'>399</a>
-<a name='L400'></a><a href='#L400'>400</a>
-<a name='L401'></a><a href='#L401'>401</a>
-<a name='L402'></a><a href='#L402'>402</a>
-<a name='L403'></a><a href='#L403'>403</a>
-<a name='L404'></a><a href='#L404'>404</a>
-<a name='L405'></a><a href='#L405'>405</a>
-<a name='L406'></a><a href='#L406'>406</a>
-<a name='L407'></a><a href='#L407'>407</a>
-<a name='L408'></a><a href='#L408'>408</a>
-<a name='L409'></a><a href='#L409'>409</a>
-<a name='L410'></a><a href='#L410'>410</a>
-<a name='L411'></a><a href='#L411'>411</a>
-<a name='L412'></a><a href='#L412'>412</a>
-<a name='L413'></a><a href='#L413'>413</a>
-<a name='L414'></a><a href='#L414'>414</a>
-<a name='L415'></a><a href='#L415'>415</a>
-<a name='L416'></a><a href='#L416'>416</a>
-<a name='L417'></a><a href='#L417'>417</a>
-<a name='L418'></a><a href='#L418'>418</a>
-<a name='L419'></a><a href='#L419'>419</a>
-<a name='L420'></a><a href='#L420'>420</a>
-<a name='L421'></a><a href='#L421'>421</a>
-<a name='L422'></a><a href='#L422'>422</a>
-<a name='L423'></a><a href='#L423'>423</a>
-<a name='L424'></a><a href='#L424'>424</a>
-<a name='L425'></a><a href='#L425'>425</a>
-<a name='L426'></a><a href='#L426'>426</a>
-<a name='L427'></a><a href='#L427'>427</a>
-<a name='L428'></a><a href='#L428'>428</a>
-<a name='L429'></a><a href='#L429'>429</a>
-<a name='L430'></a><a href='#L430'>430</a>
-<a name='L431'></a><a href='#L431'>431</a>
-<a name='L432'></a><a href='#L432'>432</a>
-<a name='L433'></a><a href='#L433'>433</a>
-<a name='L434'></a><a href='#L434'>434</a>
-<a name='L435'></a><a href='#L435'>435</a>
-<a name='L436'></a><a href='#L436'>436</a>
-<a name='L437'></a><a href='#L437'>437</a>
-<a name='L438'></a><a href='#L438'>438</a>
-<a name='L439'></a><a href='#L439'>439</a>
-<a name='L440'></a><a href='#L440'>440</a>
-<a name='L441'></a><a href='#L441'>441</a>
-<a name='L442'></a><a href='#L442'>442</a>
-<a name='L443'></a><a href='#L443'>443</a>
-<a name='L444'></a><a href='#L444'>444</a>
-<a name='L445'></a><a href='#L445'>445</a>
-<a name='L446'></a><a href='#L446'>446</a>
-<a name='L447'></a><a href='#L447'>447</a>
-<a name='L448'></a><a href='#L448'>448</a>
-<a name='L449'></a><a href='#L449'>449</a>
-<a name='L450'></a><a href='#L450'>450</a>
-<a name='L451'></a><a href='#L451'>451</a>
-<a name='L452'></a><a href='#L452'>452</a>
-<a name='L453'></a><a href='#L453'>453</a>
-<a name='L454'></a><a href='#L454'>454</a>
-<a name='L455'></a><a href='#L455'>455</a>
-<a name='L456'></a><a href='#L456'>456</a>
-<a name='L457'></a><a href='#L457'>457</a>
-<a name='L458'></a><a href='#L458'>458</a>
-<a name='L459'></a><a href='#L459'>459</a>
-<a name='L460'></a><a href='#L460'>460</a>
-<a name='L461'></a><a href='#L461'>461</a>
-<a name='L462'></a><a href='#L462'>462</a>
-<a name='L463'></a><a href='#L463'>463</a>
-<a name='L464'></a><a href='#L464'>464</a>
-<a name='L465'></a><a href='#L465'>465</a>
-<a name='L466'></a><a href='#L466'>466</a>
-<a name='L467'></a><a href='#L467'>467</a>
-<a name='L468'></a><a href='#L468'>468</a>
-<a name='L469'></a><a href='#L469'>469</a>
-<a name='L470'></a><a href='#L470'>470</a>
-<a name='L471'></a><a href='#L471'>471</a>
-<a name='L472'></a><a href='#L472'>472</a>
-<a name='L473'></a><a href='#L473'>473</a>
-<a name='L474'></a><a href='#L474'>474</a>
-<a name='L475'></a><a href='#L475'>475</a>
-<a name='L476'></a><a href='#L476'>476</a>
-<a name='L477'></a><a href='#L477'>477</a>
-<a name='L478'></a><a href='#L478'>478</a>
-<a name='L479'></a><a href='#L479'>479</a>
-<a name='L480'></a><a href='#L480'>480</a>
-<a name='L481'></a><a href='#L481'>481</a>
-<a name='L482'></a><a href='#L482'>482</a>
-<a name='L483'></a><a href='#L483'>483</a>
-<a name='L484'></a><a href='#L484'>484</a>
-<a name='L485'></a><a href='#L485'>485</a>
-<a name='L486'></a><a href='#L486'>486</a>
-<a name='L487'></a><a href='#L487'>487</a>
-<a name='L488'></a><a href='#L488'>488</a>
-<a name='L489'></a><a href='#L489'>489</a>
-<a name='L490'></a><a href='#L490'>490</a>
-<a name='L491'></a><a href='#L491'>491</a>
-<a name='L492'></a><a href='#L492'>492</a>
-<a name='L493'></a><a href='#L493'>493</a>
-<a name='L494'></a><a href='#L494'>494</a>
-<a name='L495'></a><a href='#L495'>495</a>
-<a name='L496'></a><a href='#L496'>496</a>
-<a name='L497'></a><a href='#L497'>497</a>
-<a name='L498'></a><a href='#L498'>498</a>
-<a name='L499'></a><a href='#L499'>499</a>
-<a name='L500'></a><a href='#L500'>500</a>
-<a name='L501'></a><a href='#L501'>501</a>
-<a name='L502'></a><a href='#L502'>502</a>
-<a name='L503'></a><a href='#L503'>503</a>
-<a name='L504'></a><a href='#L504'>504</a>
-<a name='L505'></a><a href='#L505'>505</a>
-<a name='L506'></a><a href='#L506'>506</a>
-<a name='L507'></a><a href='#L507'>507</a>
-<a name='L508'></a><a href='#L508'>508</a>
-<a name='L509'></a><a href='#L509'>509</a>
-<a name='L510'></a><a href='#L510'>510</a>
-<a name='L511'></a><a href='#L511'>511</a>
-<a name='L512'></a><a href='#L512'>512</a>
-<a name='L513'></a><a href='#L513'>513</a>
-<a name='L514'></a><a href='#L514'>514</a>
-<a name='L515'></a><a href='#L515'>515</a>
-<a name='L516'></a><a href='#L516'>516</a>
-<a name='L517'></a><a href='#L517'>517</a>
-<a name='L518'></a><a href='#L518'>518</a>
-<a name='L519'></a><a href='#L519'>519</a>
-<a name='L520'></a><a href='#L520'>520</a>
-<a name='L521'></a><a href='#L521'>521</a>
-<a name='L522'></a><a href='#L522'>522</a>
-<a name='L523'></a><a href='#L523'>523</a>
-<a name='L524'></a><a href='#L524'>524</a>
-<a name='L525'></a><a href='#L525'>525</a>
-<a name='L526'></a><a href='#L526'>526</a>
-<a name='L527'></a><a href='#L527'>527</a>
-<a name='L528'></a><a href='#L528'>528</a>
-<a name='L529'></a><a href='#L529'>529</a>
-<a name='L530'></a><a href='#L530'>530</a>
-<a name='L531'></a><a href='#L531'>531</a>
-<a name='L532'></a><a href='#L532'>532</a>
-<a name='L533'></a><a href='#L533'>533</a>
-<a name='L534'></a><a href='#L534'>534</a>
-<a name='L535'></a><a href='#L535'>535</a>
-<a name='L536'></a><a href='#L536'>536</a>
-<a name='L537'></a><a href='#L537'>537</a>
-<a name='L538'></a><a href='#L538'>538</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">19x</span>
-<span class="cline-any cline-yes">19x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">19x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">218x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">19x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">8x</span>
-<span class="cline-any cline-yes">8x</span>
-<span class="cline-any cline-yes">2x</span>
-<span class="cline-any cline-yes">2x</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">108x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">144x</span>
-<span class="cline-any cline-yes">144x</span>
-<span class="cline-any cline-yes">144x</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-yes">144x</span>
-<span class="cline-any cline-yes">144x</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">144x</span>
-<span class="cline-any cline-yes">9x</span>
-<span class="cline-any cline-yes">9x</span>
-<span class="cline-any cline-yes">9x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">135x</span>
-<span class="cline-any cline-yes">135x</span>
-<span class="cline-any cline-yes">135x</span>
-<span class="cline-any cline-yes">372x</span>
-<span class="cline-any cline-yes">372x</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-yes">372x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">181x</span>
-<span class="cline-any cline-yes">60x</span>
-<span class="cline-any cline-yes">60x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">60x</span>
-<span class="cline-any cline-yes">60x</span>
-<span class="cline-any cline-yes">60x</span>
-<span class="cline-any cline-yes">60x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">121x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">191x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">191x</span>
-<span class="cline-any cline-yes">75x</span>
-<span class="cline-any cline-yes">75x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">75x</span>
-<span class="cline-any cline-yes">75x</span>
-<span class="cline-any cline-yes">75x</span>
-<span class="cline-any cline-yes">75x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">116x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">144x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">5x</span>
-<span class="cline-any cline-yes">5x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">98x</span>
-<span class="cline-any cline-yes">98x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">104x</span>
-<span class="cline-any cline-yes">104x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">104x</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">104x</span>
-<span class="cline-any cline-yes">104x</span>
-<span class="cline-any cline-yes">333x</span>
-<span class="cline-any cline-yes">333x</span>
-<span class="cline-any cline-yes">333x</span>
-<span class="cline-any cline-yes">241x</span>
-<span class="cline-any cline-yes">222x</span>
-<span class="cline-any cline-yes">222x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">19x</span>
-<span class="cline-any cline-yes">19x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">12x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">4x</span>
-<span class="cline-any cline-yes">4x</span>
-<span class="cline-any cline-yes">4x</span>
-<span class="cline-any cline-yes">4x</span>
-<span class="cline-any cline-yes">4x</span>
-<span class="cline-any cline-yes">4x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">12x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">12x</span>
-<span class="cline-any cline-yes">12x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">12x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">4x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">4x</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">4x</span>
-<span class="cline-any cline-yes">4x</span>
-<span class="cline-any cline-yes">20x</span>
-<span class="cline-any cline-yes">20x</span>
-<span class="cline-any cline-yes">20x</span>
-<span class="cline-any cline-yes">20x</span>
-<span class="cline-any cline-yes">4x</span>
-<span class="cline-any cline-yes">4x</span>
-<span class="cline-any cline-yes">16x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">12x</span>
-<span class="cline-any cline-yes">12x</span>
-<span class="cline-any cline-yes">12x</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">4x</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">3x</span>
-<span class="cline-any cline-yes">3x</span>
-<span class="cline-any cline-yes">3x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">3x</span>
-<span class="cline-any cline-yes">3x</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">3x</span>
-<span class="cline-any cline-yes">3x</span>
-<span class="cline-any cline-yes">99x</span>
-<span class="cline-any cline-yes">99x</span>
-<span class="cline-any cline-yes">99x</span>
-<span class="cline-any cline-yes">99x</span>
-<span class="cline-any cline-yes">48x</span>
-<span class="cline-any cline-yes">48x</span>
-<span class="cline-any cline-yes">48x</span>
-<span class="cline-any cline-yes">48x</span>
-<span class="cline-any cline-yes">48x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">3x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">63x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">63x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">63x</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-no">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">63x</span>
-<span class="cline-any cline-yes">63x</span>
-<span class="cline-any cline-yes">63x</span>
-<span class="cline-any cline-yes">63x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">63x</span>
-<span class="cline-any cline-yes">1442x</span>
-<span class="cline-any cline-yes">580x</span>
-<span class="cline-any cline-yes">580x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">862x</span>
-<span class="cline-any cline-yes">862x</span>
-<span class="cline-any cline-yes">574x</span>
-<span class="cline-any cline-yes">574x</span>
-<span class="cline-any cline-yes">574x</span>
-<span class="cline-any cline-yes">574x</span>
-<span class="cline-any cline-yes">574x</span>
-<span class="cline-any cline-yes">560x</span>
-<span class="cline-any cline-yes">560x</span>
-<span class="cline-any cline-yes">560x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">288x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">49x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">1740x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-yes">1740x</span>
-<span class="cline-any cline-yes">1740x</span>
-<span class="cline-any cline-yes">1032x</span>
-<span class="cline-any cline-yes">19x</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span>
-<span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">/**
- * data-structure-typed
- *
- * @author Tyler Zeng
- * @copyright Copyright (c) 2022 Tyler Zeng &lt;zrwusa@gmail.com&gt;
- * @license MIT License
- */
-import type {BinaryTreeNodeId, BinaryTreeNodePropertyName, BSTComparator, BSTNodeNested, BSTOptions} from '../../types';
-import {CP, LoopType} from '../../types';
-import {BinaryTree, BinaryTreeNode} from './binary-tree';
-import {IBST, IBSTNode} from '../../interfaces';
-&nbsp;
-export class BSTNode&lt;T = any, NEIGHBOR extends BSTNode&lt;T, NEIGHBOR&gt; = BSTNodeNested&lt;T&gt;&gt;
-  extends BinaryTreeNode&lt;T, NEIGHBOR&gt;
-  implements IBSTNode&lt;T, NEIGHBOR&gt;
-{
-  constructor(id: BinaryTreeNodeId, val?: T) {
-    super(id, val);
-  }
-}
-&nbsp;
-export class BST&lt;N extends BSTNode&lt;N['val'], N&gt; = BSTNode&gt; extends BinaryTree&lt;N&gt; implements IBST&lt;N&gt; {
-  /**
-   * The constructor function initializes a binary search tree object with an optional comparator function.
-   * @param {BSTOptions} [options] - An optional object that contains configuration options for the binary search tree.
-   */
-  constructor(options?: BSTOptions) {
-    super(options);
-    if (options !== undefined) {
-      const {comparator} = options;
-      <span class="missing-if-branch" title="if path not taken" >I</span>if (comparator !== undefined) {
-<span class="cstat-no" title="statement not covered" >        this._comparator = comparator;</span>
-      }
-    }
-  }
-&nbsp;
-  /**
-   * The function creates a new binary search tree node with the given id and value.
-   * @param {BinaryTreeNodeId} id - The `id` parameter is the identifier for the binary tree node. It is used to uniquely
-   * identify each node in the binary tree.
-   * @param [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 a new instance of the BSTNode class with the specified id and value.
-   */
-  override createNode(id: BinaryTreeNodeId, val?: N['val']): N {
-    return new BSTNode&lt;N['val'], N&gt;(id, val) as N;
-  }
-&nbsp;
-  /**
-   * 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.
-   * @param {BinaryTreeNodeId | N | null} idOrNode - The `idOrNode` parameter can be either a `BinaryTreeNodeId` or a `N`
-   * (which represents a binary tree node) or `null`.
-   * @param [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 The function `add` returns the inserted node (`inserted`) which can be of type `N`, `null`, or `undefined`.
-   */
-  override add(idOrNode: BinaryTreeNodeId | N | null, val?: N['val']): N | null | undefined {
-    // TODO support node as a param
-    let inserted: N | null = null;
-    let newNode: N | null = null;
-    <span class="missing-if-branch" title="if path not taken" >I</span>if (idOrNode instanceof BSTNode) {
-<span class="cstat-no" title="statement not covered" >      newNode = idOrNode;</span>
-    } else if (typeof idOrNode === 'number') {
-      newNode = this.createNode(idOrNode, val);
-    } else <span class="cstat-no" title="statement not covered" ><span class="missing-if-branch" title="if path not taken" >I</span><span class="missing-if-branch" title="else path not taken" >E</span>if (idOrNode === null) {</span>
-<span class="cstat-no" title="statement not covered" >      newNode = null;</span>
-    }
-    if (this.root === null) {
-      this._setRoot(newNode);
-      this._setSize(this.size + 1);
-      inserted = this.root;
-    } else {
-      let cur = this.root;
-      let traversing = true;
-      while (traversing) {
-        if (cur !== null &amp;&amp; newNode !== null) {
-          <span class="missing-if-branch" title="if path not taken" >I</span>if (this._compare(cur.id, newNode.id) === CP.eq) {
-<span class="cstat-no" title="statement not covered" >            <span class="missing-if-branch" title="if path not taken" >I</span>if (newNode) {</span>
-<span class="cstat-no" title="statement not covered" >              cur.val = newNode.val;</span>
-            }
-            //Duplicates are not accepted.
-<span class="cstat-no" title="statement not covered" >            traversing = false;</span>
-<span class="cstat-no" title="statement not covered" >            inserted = cur;</span>
-          } else if (this._compare(cur.id, newNode.id) === CP.gt) {
-            // Traverse left of the node
-            if (cur.left === undefined) {
-              if (newNode) {
-                newNode.parent = cur;
-              }
-              //Add to the left of the current node
-              cur.left = newNode;
-              this._setSize(this.size + 1);
-              traversing = false;
-              inserted = cur.left;
-            } else {
-              //Traverse the left of the current node
-              if (cur.left) cur = cur.left;
-            }
-          } else if (this._compare(cur.id, newNode.id) === CP.lt) {
-            // Traverse right of the node
-            if (cur.right === undefined) {
-              if (newNode) {
-                newNode.parent = cur;
-              }
-              //Add to the right of the current node
-              cur.right = newNode;
-              this._setSize(this.size + 1);
-              traversing = false;
-              inserted = cur.right;
-            } else {
-              //Traverse the left of the current node
-              if (cur.right) cur = cur.right;
-            }
-          }
-        } else <span class="missing-if-branch" title="else path not taken" >E</span>{
-<span class="cstat-no" title="statement not covered" >          traversing = false;</span>
-        }
-      }
-    }
-    return inserted;
-  }
-&nbsp;
-  /**
-   * The `addMany` function overrides the base class method to add multiple nodes to a binary search tree in a balanced
-   * manner.
-   * @param {[BinaryTreeNodeId | N , N['val']][]} idsOrNodes - 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.
-   * @param {N['val'][]} data - The values of tree nodes
-   * @param {boolean} isBalanceAdd - If true the nodes will be balance inserted in binary search method.
-   * @returns The function `addMany` returns an array of `N`, `null`, or `undefined` values.
-   */
-  override addMany(
-    idsOrNodes: (BinaryTreeNodeId | null)[] | (N | null)[],
-    data?: N['val'][],
-    isBalanceAdd = false
-  ): (N | null | undefined)[] {
-    function <span class="fstat-no" title="function not covered" >hasNoNull(</span>arr: (BinaryTreeNodeId | null)[] | (N | null)[]): arr is BinaryTreeNodeId[] | N[] {
-<span class="cstat-no" title="statement not covered" >      return arr.indexOf(null) === -1;</span>
-    }
-    if (!isBalanceAdd || <span class="branch-1 cbranch-no" title="branch not covered" >!hasNoNull(idsOrNodes))</span> {
-      return super.addMany(idsOrNodes, data);
-    }
-    const inserted: (N | null | undefined)[] = <span class="cstat-no" title="statement not covered" >[];</span>
-    const combinedArr: [BinaryTreeNodeId | N, N['val']][] = <span class="cstat-no" title="statement not covered" >idsOrNodes.map(<span class="fstat-no" title="function not covered" >(v</span>alue, index) =&gt; <span class="cstat-no" title="statement not covered" >[value, data?.[index]])</span>;</span>
-    let sorted = <span class="cstat-no" title="statement not covered" >[];</span>
-    function <span class="fstat-no" title="function not covered" >isNodeOrNullTuple(</span>arr: [BinaryTreeNodeId | N, N['val']][]): arr is [N, N['val']][] {
-<span class="cstat-no" title="statement not covered" >      for (const [idOrNode] of arr) <span class="cstat-no" title="statement not covered" ><span class="missing-if-branch" title="if path not taken" >I</span>if (idOrNode instanceof BSTNode) <span class="cstat-no" title="statement not covered" >return true;</span></span></span>
-<span class="cstat-no" title="statement not covered" >      return false;</span>
-    }
-    function <span class="fstat-no" title="function not covered" >isBinaryTreeIdOrNullTuple(</span>arr: [BinaryTreeNodeId | N, N['val']][]): arr is [BinaryTreeNodeId, N['val']][] {
-<span class="cstat-no" title="statement not covered" >      for (const [idOrNode] of arr) <span class="cstat-no" title="statement not covered" ><span class="missing-if-branch" title="if path not taken" >I</span>if (typeof idOrNode === 'number') <span class="cstat-no" title="statement not covered" >return true;</span></span></span>
-<span class="cstat-no" title="statement not covered" >      return false;</span>
-    }
-    let sortedIdsOrNodes: (number | N | null)[] = <span class="cstat-no" title="statement not covered" >[],</span>
-      sortedData: (N['val'] | undefined)[] | undefined = <span class="cstat-no" title="statement not covered" >[];</span>
-&nbsp;
-<span class="cstat-no" title="statement not covered" >    if (isNodeOrNullTuple(combinedArr)) {</span>
-<span class="cstat-no" title="statement not covered" >      sorted = combinedArr.sort(<span class="fstat-no" title="function not covered" >(a</span>, b) =&gt; <span class="cstat-no" title="statement not covered" >a[0].id - b[0].id)</span>;</span>
-    } else <span class="cstat-no" title="statement not covered" >if (isBinaryTreeIdOrNullTuple(combinedArr)) {</span>
-<span class="cstat-no" title="statement not covered" >      sorted = combinedArr.sort(<span class="fstat-no" title="function not covered" >(a</span>, b) =&gt; <span class="cstat-no" title="statement not covered" >a[0] - b[0])</span>;</span>
-    } else {
-<span class="cstat-no" title="statement not covered" >      throw new Error('Invalid input idsOrNodes');</span>
-    }
-<span class="cstat-no" title="statement not covered" >    sortedIdsOrNodes = sorted.map(<span class="fstat-no" title="function not covered" >([</span>idOrNode]) =&gt; <span class="cstat-no" title="statement not covered" >idOrNode)</span>;</span>
-<span class="cstat-no" title="statement not covered" >    sortedData = sorted.map(<span class="fstat-no" title="function not covered" >([</span>, val]) =&gt; <span class="cstat-no" title="statement not covered" >val)</span>;</span>
-    const recursive = <span class="cstat-no" title="statement not covered" ><span class="fstat-no" title="function not covered" >(a</span>rr: (BinaryTreeNodeId | null | N)[], data?: N['val'][]) =&gt; {</span>
-<span class="cstat-no" title="statement not covered" >      <span class="missing-if-branch" title="if path not taken" >I</span>if (arr.length === 0) <span class="cstat-no" title="statement not covered" >return;</span></span>
-&nbsp;
-      const mid = <span class="cstat-no" title="statement not covered" >Math.floor((arr.length - 1) / 2);</span>
-      const newNode = <span class="cstat-no" title="statement not covered" >this.add(arr[mid], data?.[mid]);</span>
-<span class="cstat-no" title="statement not covered" >      inserted.push(newNode);</span>
-<span class="cstat-no" title="statement not covered" >      recursive(arr.slice(0, mid), data?.slice(0, mid));</span>
-<span class="cstat-no" title="statement not covered" >      recursive(arr.slice(mid + 1), data?.slice(mid + 1));</span>
-    };
-    const iterative = <span class="cstat-no" title="statement not covered" ><span class="fstat-no" title="function not covered" >() =</span>&gt; {</span>
-      const n = <span class="cstat-no" title="statement not covered" >sorted.length;</span>
-      const stack: [[number, number]] = <span class="cstat-no" title="statement not covered" >[[0, n - 1]];</span>
-<span class="cstat-no" title="statement not covered" >      while (stack.length &gt; 0) {</span>
-        const popped = <span class="cstat-no" title="statement not covered" >stack.pop();</span>
-<span class="cstat-no" title="statement not covered" >        <span class="missing-if-branch" title="if path not taken" >I</span>if (popped) {</span>
-          const [l, r] = <span class="cstat-no" title="statement not covered" >popped;</span>
-<span class="cstat-no" title="statement not covered" >          <span class="missing-if-branch" title="if path not taken" >I</span>if (l &lt;= r) {</span>
-            const m = <span class="cstat-no" title="statement not covered" >l + Math.floor((r - l) / 2);</span>
-            const newNode = <span class="cstat-no" title="statement not covered" >this.add(sortedIdsOrNodes[m], sortedData?.[m]);</span>
-<span class="cstat-no" title="statement not covered" >            inserted.push(newNode);</span>
-<span class="cstat-no" title="statement not covered" >            stack.push([m + 1, r]);</span>
-<span class="cstat-no" title="statement not covered" >            stack.push([l, m - 1]);</span>
-          }
-        }
-      }
-    };
-<span class="cstat-no" title="statement not covered" >    if (this.loopType === LoopType.RECURSIVE) {</span>
-<span class="cstat-no" title="statement not covered" >      recursive(sortedIdsOrNodes, sortedData);</span>
-    } else {
-<span class="cstat-no" title="statement not covered" >      iterative();</span>
-    }
-&nbsp;
-<span class="cstat-no" title="statement not covered" >    return inserted;</span>
-  }
-&nbsp;
-  /**
-   * The function returns the first node in a binary tree that matches the given property name and value.
-   * @param {BinaryTreeNodeId | N} nodeProperty - 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.
-   * @param {BinaryTreeNodePropertyName} [propertyName] - 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 The method is returning either a BinaryTreeNodeId or N (generic type) or null.
-   */
-  override get(nodeProperty: BinaryTreeNodeId | N, propertyName?: BinaryTreeNodePropertyName): N | null {
-    propertyName = propertyName ?? 'id';
-    return this.getNodes(nodeProperty, propertyName, true)[0] ?? null;
-  }
-&nbsp;
-  /**
-   * 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 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.
-   */
-<span class="fstat-no" title="function not covered" >  lastKey(</span>): BinaryTreeNodeId {
-<span class="cstat-no" title="statement not covered" >    if (this._compare(0, 1) === CP.lt) <span class="cstat-no" title="statement not covered" >return this.getRightMost()?.id ?? 0;</span></span>
-    else <span class="cstat-no" title="statement not covered" >if (this._compare(0, 1) === CP.gt) <span class="cstat-no" title="statement not covered" >return this.getLeftMost()?.id ?? 0;</span></span>
-    else <span class="cstat-no" title="statement not covered" >return this.getRightMost()?.id ?? 0;</span>
-  }
-&nbsp;
-  /**
-   * The function `getNodes` returns an array of nodes in a binary tree that match a given property value.
-   * @param {BinaryTreeNodeId | N} nodeProperty - 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.
-   * @param {BinaryTreeNodePropertyName} [propertyName] - The `propertyName` parameter is an optional parameter that
-   * specifies the property name to use for comparison. If not provided, it defaults to `'id'`.
-   * @param {boolean} [onlyOne] - 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 an array of nodes (type N).
-   */
-  override getNodes(
-    nodeProperty: BinaryTreeNodeId | N,
-    propertyName: BinaryTreeNodePropertyName = <span class="branch-0 cbranch-no" title="branch not covered" >'id',</span>
-    onlyOne?: boolean
-  ): N[] {
-    <span class="missing-if-branch" title="if path not taken" >I</span>if (!this.root) <span class="cstat-no" title="statement not covered" >return [];</span>
-    const result: N[] = [];
-&nbsp;
-    <span class="missing-if-branch" title="if path not taken" >I</span>if (this.loopType === LoopType.RECURSIVE) {
-      const _traverse = <span class="cstat-no" title="statement not covered" ><span class="fstat-no" title="function not covered" >(c</span>ur: N) =&gt; {</span>
-<span class="cstat-no" title="statement not covered" >        <span class="missing-if-branch" title="if path not taken" >I</span>if (this._pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne)) <span class="cstat-no" title="statement not covered" >return;</span></span>
-&nbsp;
-<span class="cstat-no" title="statement not covered" >        <span class="missing-if-branch" title="if path not taken" >I</span>if (!cur.left &amp;&amp; !cur.right) <span class="cstat-no" title="statement not covered" >return;</span></span>
-<span class="cstat-no" title="statement not covered" >        if (propertyName === 'id') {</span>
-<span class="cstat-no" title="statement not covered" >          <span class="missing-if-branch" title="if path not taken" >I</span>if (this._compare(cur.id, nodeProperty as number) === CP.gt) <span class="cstat-no" title="statement not covered" >cur.left &amp;&amp; _traverse(cur.left);</span></span>
-<span class="cstat-no" title="statement not covered" >          <span class="missing-if-branch" title="if path not taken" >I</span>if (this._compare(cur.id, nodeProperty as number) === CP.lt) <span class="cstat-no" title="statement not covered" >cur.right &amp;&amp; _traverse(cur.right);</span></span>
-        } else {
-<span class="cstat-no" title="statement not covered" >          cur.left &amp;&amp; _traverse(cur.left);</span>
-<span class="cstat-no" title="statement not covered" >          cur.right &amp;&amp; _traverse(cur.right);</span>
-        }
-      };
-&nbsp;
-<span class="cstat-no" title="statement not covered" >      _traverse(this.root);</span>
-    } else {
-      const queue: N[] = [this.root];
-      while (queue.length &gt; 0) {
-        const cur = queue.shift();
-        if (cur) {
-          if (this._pushByPropertyNameStopOrNot(cur, result, nodeProperty, propertyName, onlyOne)) return result;
-          if (propertyName === 'id') {
-            if (this._compare(cur.id, nodeProperty as number) === CP.gt) cur.left &amp;&amp; queue.push(cur.left);
-            if (this._compare(cur.id, nodeProperty as number) === CP.lt) cur.right &amp;&amp; queue.push(cur.right);
-          } else {
-            cur.left &amp;&amp; queue.push(cur.left);
-            cur.right &amp;&amp; queue.push(cur.right);
-          }
-        }
-      }
-    }
-&nbsp;
-    return result;
-  }
-&nbsp;
-  // --- start additional functions
-  /**
-   * 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.
-   * @param {N | BinaryTreeNodeId | null} beginNode - The `beginNode` parameter can be one of the following:
-   * @param {BinaryTreeNodePropertyName} [propertyName] - 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 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`.
-   */
-  lesserSum(beginNode: N | BinaryTreeNodeId | null, propertyName?: BinaryTreeNodePropertyName): number {
-    propertyName = <span class="branch-0 cbranch-no" title="branch not covered" >propertyName </span>?? 'id';
-    if (typeof beginNode === 'number') beginNode = this.get(beginNode, 'id');
-    <span class="missing-if-branch" title="if path not taken" >I</span>if (!beginNode) <span class="cstat-no" title="statement not covered" >return 0;</span>
-    <span class="missing-if-branch" title="if path not taken" >I</span>if (!this.root) <span class="cstat-no" title="statement not covered" >return 0;</span>
-    const id = beginNode.id;
-    const getSumByPropertyName = (cur: N) =&gt; {
-      let needSum: number;
-      switch (propertyName) {
-        case 'id':
-          needSum = cur.id;
-          break;
-<span class="branch-1 cbranch-no" title="branch not covered" >        default:</span>
-<span class="cstat-no" title="statement not covered" >          needSum = cur.id;</span>
-<span class="cstat-no" title="statement not covered" >          break;</span>
-      }
-      return needSum;
-    };
-&nbsp;
-    let sum = 0;
-&nbsp;
-    <span class="missing-if-branch" title="if path not taken" >I</span>if (this.loopType === LoopType.RECURSIVE) {
-      const _traverse = <span class="cstat-no" title="statement not covered" ><span class="fstat-no" title="function not covered" >(c</span>ur: N): void =&gt; {</span>
-        const compared = <span class="cstat-no" title="statement not covered" >this._compare(cur.id, id);</span>
-<span class="cstat-no" title="statement not covered" >        if (compared === CP.eq) {</span>
-<span class="cstat-no" title="statement not covered" >          <span class="missing-if-branch" title="if path not taken" >I</span>if (cur.right) <span class="cstat-no" title="statement not covered" >sum += this.subTreeSum(cur.right, propertyName);</span></span>
-<span class="cstat-no" title="statement not covered" >          return;</span>
-        } else <span class="cstat-no" title="statement not covered" >if (compared === CP.lt) {</span>
-<span class="cstat-no" title="statement not covered" >          <span class="missing-if-branch" title="if path not taken" >I</span>if (cur.left) <span class="cstat-no" title="statement not covered" >sum += this.subTreeSum(cur.left, propertyName);</span></span>
-<span class="cstat-no" title="statement not covered" >          sum += getSumByPropertyName(cur);</span>
-<span class="cstat-no" title="statement not covered" >          if (cur.right) <span class="cstat-no" title="statement not covered" >_traverse(cur.right);</span></span>
-          else <span class="cstat-no" title="statement not covered" >return;</span>
-        } else {
-<span class="cstat-no" title="statement not covered" >          if (cur.left) <span class="cstat-no" title="statement not covered" >_traverse(cur.left);</span></span>
-          else <span class="cstat-no" title="statement not covered" >return;</span>
-        }
-      };
-&nbsp;
-<span class="cstat-no" title="statement not covered" >      _traverse(this.root);</span>
-    } else {
-      const queue: N[] = [this.root];
-      while (queue.length &gt; 0) {
-        const cur = queue.shift();
-        if (cur) {
-          const compared = this._compare(cur.id, id);
-          if (compared === CP.eq) {
-            <span class="missing-if-branch" title="if path not taken" >I</span>if (cur.right) <span class="cstat-no" title="statement not covered" >sum += this.subTreeSum(cur.right, propertyName);</span>
-            return sum;
-          } else if (compared === CP.lt) {
-            // todo maybe a bug
-            if (cur.left) sum += this.subTreeSum(cur.left, propertyName);
-            sum += getSumByPropertyName(cur);
-            if (cur.right) queue.push(cur.right);
-            else <span class="cstat-no" title="statement not covered" ><span class="missing-if-branch" title="else path not taken" >E</span>return sum;</span>
-          } else {
-            if (cur.left) queue.push(cur.left);
-            else <span class="cstat-no" title="statement not covered" ><span class="missing-if-branch" title="else path not taken" >E</span>return sum;</span>
-          }
-        }
-      }
-    }
-&nbsp;
-<span class="cstat-no" title="statement not covered" >    return sum;</span>
-  }
-&nbsp;
-  /**
-   * 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.
-   * @param {N | BinaryTreeNodeId | null} node - 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.
-   * @param {number} delta - The `delta` parameter is a number that represents the amount by which the property value of
-   * each greater node should be increased.
-   * @param {BinaryTreeNodePropertyName} [propertyName] - 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 a boolean value.
-   */
-<span class="fstat-no" title="function not covered" >  allGreaterNodesAdd(</span>
-    node: N | BinaryTreeNodeId | null,
-    delta: number,
-    propertyName?: BinaryTreeNodePropertyName
-  ): boolean {
-<span class="cstat-no" title="statement not covered" >    propertyName = propertyName ?? 'id';</span>
-<span class="cstat-no" title="statement not covered" >    <span class="missing-if-branch" title="if path not taken" >I</span>if (typeof node === 'number') <span class="cstat-no" title="statement not covered" >node = this.get(node, 'id');</span></span>
-<span class="cstat-no" title="statement not covered" >    <span class="missing-if-branch" title="if path not taken" >I</span>if (!node) <span class="cstat-no" title="statement not covered" >return false;</span></span>
-    const id = <span class="cstat-no" title="statement not covered" >node.id;</span>
-<span class="cstat-no" title="statement not covered" >    <span class="missing-if-branch" title="if path not taken" >I</span>if (!this.root) <span class="cstat-no" title="statement not covered" >return false;</span></span>
-&nbsp;
-    const _sumByPropertyName = <span class="cstat-no" title="statement not covered" ><span class="fstat-no" title="function not covered" >(c</span>ur: N) =&gt; {</span>
-<span class="cstat-no" title="statement not covered" >      switch (propertyName) {</span>
-        case 'id':
-<span class="cstat-no" title="statement not covered" >          cur.id += delta;</span>
-<span class="cstat-no" title="statement not covered" >          break;</span>
-        default:
-<span class="cstat-no" title="statement not covered" >          cur.id += delta;</span>
-<span class="cstat-no" title="statement not covered" >          break;</span>
-      }
-    };
-<span class="cstat-no" title="statement not covered" >    if (this.loopType === LoopType.RECURSIVE) {</span>
-      const _traverse = <span class="cstat-no" title="statement not covered" ><span class="fstat-no" title="function not covered" >(c</span>ur: N) =&gt; {</span>
-        const compared = <span class="cstat-no" title="statement not covered" >this._compare(cur.id, id);</span>
-<span class="cstat-no" title="statement not covered" >        <span class="missing-if-branch" title="if path not taken" >I</span>if (compared === CP.gt) <span class="cstat-no" title="statement not covered" >_sumByPropertyName(cur);</span></span>
-&nbsp;
-<span class="cstat-no" title="statement not covered" >        <span class="missing-if-branch" title="if path not taken" >I</span>if (!cur.left &amp;&amp; !cur.right) <span class="cstat-no" title="statement not covered" >return;</span></span>
-<span class="cstat-no" title="statement not covered" >        <span class="missing-if-branch" title="if path not taken" >I</span>if (cur.left &amp;&amp; this._compare(cur.left.id, id) === CP.gt) <span class="cstat-no" title="statement not covered" >_traverse(cur.left);</span></span>
-<span class="cstat-no" title="statement not covered" >        <span class="missing-if-branch" title="if path not taken" >I</span>if (cur.right &amp;&amp; this._compare(cur.right.id, id) === CP.gt) <span class="cstat-no" title="statement not covered" >_traverse(cur.right);</span></span>
-      };
-&nbsp;
-<span class="cstat-no" title="statement not covered" >      _traverse(this.root);</span>
-<span class="cstat-no" title="statement not covered" >      return true;</span>
-    } else {
-      const queue: N[] = <span class="cstat-no" title="statement not covered" >[this.root];</span>
-<span class="cstat-no" title="statement not covered" >      while (queue.length &gt; 0) {</span>
-        const cur = <span class="cstat-no" title="statement not covered" >queue.shift();</span>
-<span class="cstat-no" title="statement not covered" >        <span class="missing-if-branch" title="if path not taken" >I</span>if (cur) {</span>
-          const compared = <span class="cstat-no" title="statement not covered" >this._compare(cur.id, id);</span>
-<span class="cstat-no" title="statement not covered" >          <span class="missing-if-branch" title="if path not taken" >I</span>if (compared === CP.gt) <span class="cstat-no" title="statement not covered" >_sumByPropertyName(cur);</span></span>
-&nbsp;
-<span class="cstat-no" title="statement not covered" >          <span class="missing-if-branch" title="if path not taken" >I</span>if (cur.left &amp;&amp; this._compare(cur.left.id, id) === CP.gt) <span class="cstat-no" title="statement not covered" >queue.push(cur.left);</span></span>
-<span class="cstat-no" title="statement not covered" >          <span class="missing-if-branch" title="if path not taken" >I</span>if (cur.right &amp;&amp; this._compare(cur.right.id, id) === CP.gt) <span class="cstat-no" title="statement not covered" >queue.push(cur.right);</span></span>
-        }
-      }
-<span class="cstat-no" title="statement not covered" >      return true;</span>
-    }
-  }
-&nbsp;
-  /**
-   * Balancing Adjustment:
-   * Perfectly Balanced Binary Tree: Since the balance of a perfectly balanced binary tree is already fixed, no additional balancing adjustment is needed. Any insertion or deletion operation will disrupt the perfect balance, often requiring a complete reconstruction of the tree.
-   * AVL Tree: After insertion or deletion operations, an AVL tree performs rotation adjustments based on the balance factor of nodes to restore the tree's balance. These rotations can be left rotations, right rotations, left-right rotations, or right-left rotations, performed as needed.
-   *
-   * Use Cases and Efficiency:
-   * Perfectly Balanced Binary Tree: Perfectly balanced binary trees are typically used in specific scenarios such as complete binary heaps in heap sort or certain types of Huffman trees. However, they are not suitable for dynamic operations requiring frequent insertions and deletions, as these operations often necessitate full tree reconstruction.
-   * AVL Tree: AVL trees are well-suited for scenarios involving frequent searching, insertion, and deletion operations. Through rotation adjustments, AVL trees maintain their balance, ensuring average and worst-case time complexity of O(log n).
-   */
-&nbsp;
-  /**
-   * The `perfectlyBalance` function takes a binary tree, performs a depth-first search to sort the nodes, and then
-   * constructs a balanced binary search tree using either a recursive or iterative approach.
-   * @returns The function `perfectlyBalance()` returns a boolean value.
-   */
-  perfectlyBalance(): boolean {
-    const sorted = this.DFS('in', 'node'),
-      n = sorted.length;
-    this.clear();
-&nbsp;
-    <span class="missing-if-branch" title="if path not taken" >I</span>if (sorted.length &lt; 1) <span class="cstat-no" title="statement not covered" >return false;</span>
-    <span class="missing-if-branch" title="if path not taken" >I</span>if (this.loopType === LoopType.RECURSIVE) {
-      const buildBalanceBST = <span class="cstat-no" title="statement not covered" ><span class="fstat-no" title="function not covered" >(l</span>: number, r: number) =&gt; {</span>
-<span class="cstat-no" title="statement not covered" >        <span class="missing-if-branch" title="if path not taken" >I</span>if (l &gt; r) <span class="cstat-no" title="statement not covered" >return;</span></span>
-        const m = <span class="cstat-no" title="statement not covered" >l + Math.floor((r - l) / 2);</span>
-        const midNode = <span class="cstat-no" title="statement not covered" >sorted[m];</span>
-<span class="cstat-no" title="statement not covered" >        this.add(midNode.id, midNode.val);</span>
-<span class="cstat-no" title="statement not covered" >        buildBalanceBST(l, m - 1);</span>
-<span class="cstat-no" title="statement not covered" >        buildBalanceBST(m + 1, r);</span>
-      };
-&nbsp;
-<span class="cstat-no" title="statement not covered" >      buildBalanceBST(0, n - 1);</span>
-<span class="cstat-no" title="statement not covered" >      return true;</span>
-    } else {
-      const stack: [[number, number]] = [[0, n - 1]];
-      while (stack.length &gt; 0) {
-        const popped = stack.pop();
-        if (popped) {
-          const [l, r] = popped;
-          if (l &lt;= r) {
-            const m = l + Math.floor((r - l) / 2);
-            const midNode = sorted[m];
-            this.add(midNode.id, midNode.val);
-            stack.push([m + 1, r]);
-            stack.push([l, m - 1]);
-          }
-        }
-      }
-      return true;
-    }
-  }
-&nbsp;
-  /**
-   * The function `isAVLBalanced` checks if a binary tree is balanced according to the AVL tree property.
-   * @returns a boolean value.
-   */
-  isAVLBalanced(): boolean {
-    <span class="missing-if-branch" title="if path not taken" >I</span>if (!this.root) <span class="cstat-no" title="statement not covered" >return true;</span>
-&nbsp;
-    let balanced = true;
-&nbsp;
-    <span class="missing-if-branch" title="if path not taken" >I</span>if (this.loopType === LoopType.RECURSIVE) {
-      const _height = <span class="cstat-no" title="statement not covered" ><span class="fstat-no" title="function not covered" >(c</span>ur: N | null | undefined): number =&gt; {</span>
-<span class="cstat-no" title="statement not covered" >        <span class="missing-if-branch" title="if path not taken" >I</span>if (!cur) <span class="cstat-no" title="statement not covered" >return 0;</span></span>
-        const leftHeight = <span class="cstat-no" title="statement not covered" >_height(cur.left),</span>
-          rightHeight = <span class="cstat-no" title="statement not covered" >_height(cur.right);</span>
-<span class="cstat-no" title="statement not covered" >        <span class="missing-if-branch" title="if path not taken" >I</span>if (Math.abs(leftHeight - rightHeight) &gt; 1) <span class="cstat-no" title="statement not covered" >balanced = false;</span></span>
-<span class="cstat-no" title="statement not covered" >        return Math.max(leftHeight, rightHeight) + 1;</span>
-      };
-<span class="cstat-no" title="statement not covered" >      _height(this.root);</span>
-    } else {
-      const stack: N[] = [];
-      let node: N | null | undefined = this.root,
-        last: N | null = null;
-      const depths: Map&lt;N, number&gt; = new Map();
-&nbsp;
-      while (stack.length &gt; 0 || node) {
-        if (node) {
-          stack.push(node);
-          node = node.left;
-        } else {
-          node = stack[stack.length - 1];
-          if (!node.right || last === node.right) {
-            node = stack.pop();
-            if (node) {
-              const left = node.left ? depths.get(node.left) ?? <span class="branch-1 cbranch-no" title="branch not covered" >-1 </span>: -1;
-              const right = node.right ? depths.get(node.right) ?? <span class="branch-1 cbranch-no" title="branch not covered" >-1 </span>: -1;
-              if (Math.abs(left - right) &gt; 1) return false;
-              depths.set(node, 1 + Math.max(left, right));
-              last = node;
-              node = null;
-            }
-          } else node = node.right;
-        }
-      }
-    }
-&nbsp;
-    return balanced;
-  }
-&nbsp;
-  protected _comparator: BSTComparator = (a, b) =&gt; a - b;
-&nbsp;
-  /**
-   * 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.
-   * @param {BinaryTreeNodeId} a - a is a BinaryTreeNodeId, which represents the identifier of a binary tree node.
-   * @param {BinaryTreeNodeId} b - The parameter "b" in the above code refers to a BinaryTreeNodeId.
-   * @returns a value of type CP (ComparisonResult). The possible return values are CP.gt (greater than), CP.lt (less
-   * than), or CP.eq (equal).
-   */
-  protected _compare(a: BinaryTreeNodeId, b: BinaryTreeNodeId): CP {
-    const compared = this._comparator(a, b);
-    if (compared &gt; 0) return CP.gt;
-    else if (compared &lt; 0) return CP.lt;
-    else return CP.eq;
-  }
-&nbsp;
-  // --- end additional functions
-}
-&nbsp;</pre></td></tr></table></pre>
-                <div class='push'></div><!-- for sticky footer -->
-            </div><!-- /wrapper -->
-            <div class='footer quiet pad2 space-top1 center small'>
-                Code coverage generated by
-                <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
-                at 2023-09-22T03:26:43.997Z
-            </div>
-        <script src="../../../prettify.js"></script>
-        <script>
-            window.onload = function () {
-                prettyPrint();
-            };
-        </script>
-        <script src="../../../sorter.js"></script>
-        <script src="../../../block-navigation.js"></script>
-    </body>
-</html>