data-structure-typed 1.31.0 → 1.32.1

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 (365) hide show
  1. package/.gitattributes +112 -0
  2. package/.github/workflows/ci.yml +12 -1
  3. package/.prettierrc.js +1 -1
  4. package/CHANGELOG.md +1 -1
  5. package/CODE-OF-CONDUCT.md +80 -0
  6. package/COMMANDS.md +28 -0
  7. package/README.md +20 -3
  8. package/SECURITY.md +15 -0
  9. package/coverage/clover.xml +3393 -0
  10. package/coverage/coverage-final.json +67 -0
  11. package/coverage/coverage-summary.json +68 -0
  12. package/coverage/lcov-report/base.css +224 -0
  13. package/coverage/lcov-report/block-navigation.js +87 -0
  14. package/coverage/lcov-report/favicon.png +0 -0
  15. package/coverage/lcov-report/index.html +386 -0
  16. package/coverage/lcov-report/prettify.css +1 -0
  17. package/coverage/lcov-report/prettify.js +2 -0
  18. package/coverage/lcov-report/sort-arrow-sprite.png +0 -0
  19. package/coverage/lcov-report/sorter.js +196 -0
  20. package/coverage/lcov-report/src/data-structures/binary-tree/aa-tree.ts.html +88 -0
  21. package/coverage/lcov-report/src/data-structures/binary-tree/abstract-binary-tree.ts.html +4978 -0
  22. package/coverage/lcov-report/src/data-structures/binary-tree/avl-tree.ts.html +1015 -0
  23. package/coverage/lcov-report/src/data-structures/binary-tree/b-tree.ts.html +88 -0
  24. package/coverage/lcov-report/src/data-structures/binary-tree/binary-indexed-tree.ts.html +313 -0
  25. package/coverage/lcov-report/src/data-structures/binary-tree/binary-tree.ts.html +226 -0
  26. package/coverage/lcov-report/src/data-structures/binary-tree/bst.ts.html +1696 -0
  27. package/coverage/lcov-report/src/data-structures/binary-tree/index.html +296 -0
  28. package/coverage/lcov-report/src/data-structures/binary-tree/index.ts.html +121 -0
  29. package/coverage/lcov-report/src/data-structures/binary-tree/rb-tree.ts.html +388 -0
  30. package/coverage/lcov-report/src/data-structures/binary-tree/segment-tree.ts.html +811 -0
  31. package/coverage/lcov-report/src/data-structures/binary-tree/splay-tree.ts.html +88 -0
  32. package/coverage/lcov-report/src/data-structures/binary-tree/tree-multiset.ts.html +2185 -0
  33. package/coverage/lcov-report/src/data-structures/binary-tree/two-three-tree.ts.html +88 -0
  34. package/coverage/lcov-report/src/data-structures/graph/abstract-graph.ts.html +3205 -0
  35. package/coverage/lcov-report/src/data-structures/graph/directed-graph.ts.html +1495 -0
  36. package/coverage/lcov-report/src/data-structures/graph/index.html +176 -0
  37. package/coverage/lcov-report/src/data-structures/graph/index.ts.html +97 -0
  38. package/coverage/lcov-report/src/data-structures/graph/map-graph.ts.html +472 -0
  39. package/coverage/lcov-report/src/data-structures/graph/undirected-graph.ts.html +907 -0
  40. package/coverage/lcov-report/src/data-structures/hash/coordinate-map.ts.html +286 -0
  41. package/coverage/lcov-report/src/data-structures/hash/coordinate-set.ts.html +253 -0
  42. package/coverage/lcov-report/src/data-structures/hash/hash-table.ts.html +88 -0
  43. package/coverage/lcov-report/src/data-structures/hash/index.html +206 -0
  44. package/coverage/lcov-report/src/data-structures/hash/index.ts.html +103 -0
  45. package/coverage/lcov-report/src/data-structures/hash/pair.ts.html +88 -0
  46. package/coverage/lcov-report/src/data-structures/hash/tree-map.ts.html +88 -0
  47. package/coverage/lcov-report/src/data-structures/hash/tree-set.ts.html +88 -0
  48. package/coverage/lcov-report/src/data-structures/heap/heap.ts.html +721 -0
  49. package/coverage/lcov-report/src/data-structures/heap/index.html +161 -0
  50. package/coverage/lcov-report/src/data-structures/heap/index.ts.html +94 -0
  51. package/coverage/lcov-report/src/data-structures/heap/max-heap.ts.html +178 -0
  52. package/coverage/lcov-report/src/data-structures/heap/min-heap.ts.html +181 -0
  53. package/coverage/lcov-report/src/data-structures/index.html +116 -0
  54. package/coverage/lcov-report/src/data-structures/index.ts.html +118 -0
  55. package/coverage/lcov-report/src/data-structures/linked-list/doubly-linked-list.ts.html +1804 -0
  56. package/coverage/lcov-report/src/data-structures/linked-list/index.html +161 -0
  57. package/coverage/lcov-report/src/data-structures/linked-list/index.ts.html +94 -0
  58. package/coverage/lcov-report/src/data-structures/linked-list/singly-linked-list.ts.html +1588 -0
  59. package/coverage/lcov-report/src/data-structures/linked-list/skip-linked-list.ts.html +88 -0
  60. package/coverage/lcov-report/src/data-structures/matrix/index.html +176 -0
  61. package/coverage/lcov-report/src/data-structures/matrix/index.ts.html +97 -0
  62. package/coverage/lcov-report/src/data-structures/matrix/matrix.ts.html +166 -0
  63. package/coverage/lcov-report/src/data-structures/matrix/matrix2d.ts.html +721 -0
  64. package/coverage/lcov-report/src/data-structures/matrix/navigator.ts.html +448 -0
  65. package/coverage/lcov-report/src/data-structures/matrix/vector2d.ts.html +1033 -0
  66. package/coverage/lcov-report/src/data-structures/priority-queue/index.html +161 -0
  67. package/coverage/lcov-report/src/data-structures/priority-queue/index.ts.html +94 -0
  68. package/coverage/lcov-report/src/data-structures/priority-queue/max-priority-queue.ts.html +253 -0
  69. package/coverage/lcov-report/src/data-structures/priority-queue/min-priority-queue.ts.html +256 -0
  70. package/coverage/lcov-report/src/data-structures/priority-queue/priority-queue.ts.html +1162 -0
  71. package/coverage/lcov-report/src/data-structures/queue/deque.ts.html +976 -0
  72. package/coverage/lcov-report/src/data-structures/queue/index.html +146 -0
  73. package/coverage/lcov-report/src/data-structures/queue/index.ts.html +91 -0
  74. package/coverage/lcov-report/src/data-structures/queue/queue.ts.html +658 -0
  75. package/coverage/lcov-report/src/data-structures/stack/index.html +131 -0
  76. package/coverage/lcov-report/src/data-structures/stack/index.ts.html +88 -0
  77. package/coverage/lcov-report/src/data-structures/stack/stack.ts.html +379 -0
  78. package/coverage/lcov-report/src/data-structures/tree/index.html +131 -0
  79. package/coverage/lcov-report/src/data-structures/tree/index.ts.html +88 -0
  80. package/coverage/lcov-report/src/data-structures/tree/tree.ts.html +292 -0
  81. package/coverage/lcov-report/src/data-structures/trie/index.html +131 -0
  82. package/coverage/lcov-report/src/data-structures/trie/index.ts.html +88 -0
  83. package/coverage/lcov-report/src/data-structures/trie/trie.ts.html +760 -0
  84. package/coverage/lcov-report/src/index.html +116 -0
  85. package/coverage/lcov-report/src/index.ts.html +97 -0
  86. package/coverage/lcov-report/src/interfaces/index.html +116 -0
  87. package/coverage/lcov-report/src/interfaces/index.ts.html +130 -0
  88. package/coverage/lcov-report/src/types/data-structures/abstract-binary-tree.ts.html +235 -0
  89. package/coverage/lcov-report/src/types/data-structures/bst.ts.html +124 -0
  90. package/coverage/lcov-report/src/types/data-structures/directed-graph.ts.html +109 -0
  91. package/coverage/lcov-report/src/types/data-structures/index.html +176 -0
  92. package/coverage/lcov-report/src/types/data-structures/index.ts.html +130 -0
  93. package/coverage/lcov-report/src/types/data-structures/rb-tree.ts.html +106 -0
  94. package/coverage/lcov-report/src/types/index.html +116 -0
  95. package/coverage/lcov-report/src/types/index.ts.html +94 -0
  96. package/coverage/lcov-report/src/types/utils/index.html +116 -0
  97. package/coverage/lcov-report/src/types/utils/index.ts.html +91 -0
  98. package/coverage/lcov-report/src/utils/index.html +131 -0
  99. package/coverage/lcov-report/src/utils/index.ts.html +88 -0
  100. package/coverage/lcov-report/src/utils/utils.ts.html +322 -0
  101. package/coverage/lcov-report/test/utils/index.html +146 -0
  102. package/coverage/lcov-report/test/utils/index.ts.html +91 -0
  103. package/coverage/lcov-report/test/utils/magnitude.ts.html +148 -0
  104. package/coverage/lcov-report/test/utils/number.ts.html +94 -0
  105. package/coverage/lcov.info +6676 -0
  106. package/dist/data-structures/binary-tree/abstract-binary-tree.js.map +1 -1
  107. package/dist/data-structures/binary-tree/avl-tree.js.map +1 -1
  108. package/dist/data-structures/binary-tree/binary-tree.js.map +1 -1
  109. package/dist/data-structures/binary-tree/bst.js.map +1 -1
  110. package/dist/data-structures/binary-tree/rb-tree.js.map +1 -1
  111. package/dist/data-structures/binary-tree/tree-multiset.js.map +1 -1
  112. package/dist/data-structures/graph/abstract-graph.js.map +1 -1
  113. package/dist/data-structures/graph/directed-graph.js.map +1 -1
  114. package/dist/data-structures/graph/map-graph.js.map +1 -1
  115. package/dist/data-structures/graph/undirected-graph.js.map +1 -1
  116. package/dist/data-structures/heap/heap.js.map +1 -1
  117. package/dist/data-structures/heap/max-heap.js.map +1 -1
  118. package/dist/data-structures/heap/min-heap.js.map +1 -1
  119. package/dist/data-structures/matrix/matrix.js.map +1 -1
  120. package/dist/data-structures/matrix/navigator.js.map +1 -1
  121. package/dist/data-structures/priority-queue/max-priority-queue.js.map +1 -1
  122. package/dist/data-structures/priority-queue/min-priority-queue.js.map +1 -1
  123. package/dist/data-structures/priority-queue/priority-queue.js.map +1 -1
  124. package/dist/data-structures/queue/deque.js.map +1 -1
  125. package/dist/data-structures/queue/queue.js.map +1 -1
  126. package/dist/data-structures/tree/tree.js.map +1 -1
  127. package/dist/utils/utils.js.map +1 -1
  128. package/docs/classes/AVLTree.html +205 -282
  129. package/docs/classes/AVLTreeNode.html +15 -15
  130. package/docs/classes/AaTree.html +1 -1
  131. package/docs/classes/AbstractBinaryTree.html +198 -275
  132. package/docs/classes/AbstractBinaryTreeNode.html +21 -21
  133. package/docs/classes/AbstractEdge.html +11 -11
  134. package/docs/classes/AbstractGraph.html +36 -36
  135. package/docs/classes/AbstractVertex.html +8 -8
  136. package/docs/classes/ArrayDeque.html +14 -14
  137. package/docs/classes/BST.html +198 -275
  138. package/docs/classes/BSTNode.html +15 -15
  139. package/docs/classes/BTree.html +1 -1
  140. package/docs/classes/BinaryIndexedTree.html +9 -9
  141. package/docs/classes/BinaryTree.html +191 -268
  142. package/docs/classes/BinaryTreeNode.html +15 -15
  143. package/docs/classes/Character.html +4 -4
  144. package/docs/classes/CoordinateMap.html +9 -9
  145. package/docs/classes/CoordinateSet.html +8 -8
  146. package/docs/classes/Deque.html +34 -34
  147. package/docs/classes/DirectedEdge.html +15 -15
  148. package/docs/classes/DirectedGraph.html +52 -52
  149. package/docs/classes/DirectedVertex.html +6 -6
  150. package/docs/classes/DoublyLinkedList.html +37 -37
  151. package/docs/classes/DoublyLinkedListNode.html +11 -11
  152. package/docs/classes/HashTable.html +1 -1
  153. package/docs/classes/Heap.html +26 -26
  154. package/docs/classes/HeapItem.html +8 -8
  155. package/docs/classes/LinkedListQueue.html +35 -35
  156. package/docs/classes/MapEdge.html +13 -13
  157. package/docs/classes/MapGraph.html +56 -56
  158. package/docs/classes/MapVertex.html +12 -12
  159. package/docs/classes/Matrix2D.html +16 -16
  160. package/docs/classes/MatrixNTI2D.html +4 -4
  161. package/docs/classes/MaxHeap.html +26 -26
  162. package/docs/classes/MaxPriorityQueue.html +34 -34
  163. package/docs/classes/MinHeap.html +26 -26
  164. package/docs/classes/MinPriorityQueue.html +34 -34
  165. package/docs/classes/Navigator.html +10 -10
  166. package/docs/classes/ObjectDeque.html +25 -25
  167. package/docs/classes/Pair.html +1 -1
  168. package/docs/classes/PriorityQueue.html +32 -32
  169. package/docs/classes/Queue.html +22 -22
  170. package/docs/classes/RBTree.html +198 -275
  171. package/docs/classes/RBTreeNode.html +18 -18
  172. package/docs/classes/SegmentTree.html +17 -17
  173. package/docs/classes/SegmentTreeNode.html +20 -20
  174. package/docs/classes/SinglyLinkedList.html +35 -35
  175. package/docs/classes/SinglyLinkedListNode.html +8 -8
  176. package/docs/classes/SkipLinkedList.html +1 -1
  177. package/docs/classes/SplayTree.html +1 -1
  178. package/docs/classes/Stack.html +12 -12
  179. package/docs/classes/TreeMap.html +1 -1
  180. package/docs/classes/TreeMultiset.html +219 -296
  181. package/docs/classes/TreeMultisetNode.html +18 -18
  182. package/docs/classes/TreeNode.html +13 -13
  183. package/docs/classes/TreeSet.html +1 -1
  184. package/docs/classes/Trie.html +13 -13
  185. package/docs/classes/TrieNode.html +11 -11
  186. package/docs/classes/TwoThreeTree.html +1 -1
  187. package/docs/classes/UndirectedEdge.html +12 -12
  188. package/docs/classes/UndirectedGraph.html +40 -40
  189. package/docs/classes/UndirectedVertex.html +6 -6
  190. package/docs/classes/Vector2D.html +28 -28
  191. package/docs/enums/CP.html +4 -4
  192. package/docs/enums/FamilyPosition.html +8 -8
  193. package/docs/enums/LoopType.html +3 -3
  194. package/docs/enums/RBColor.html +3 -3
  195. package/docs/enums/TopologicalProperty.html +4 -4
  196. package/docs/functions/arrayRemove.html +1 -1
  197. package/docs/functions/isThunk.html +1 -1
  198. package/docs/functions/toThunk.html +1 -1
  199. package/docs/functions/trampoline.html +1 -1
  200. package/docs/functions/trampolineAsync.html +1 -1
  201. package/docs/functions/uuidV4.html +1 -1
  202. package/docs/index.html +11 -12
  203. package/docs/interfaces/IAVLTree.html +77 -77
  204. package/docs/interfaces/IAbstractBinaryTree.html +72 -72
  205. package/docs/interfaces/IAbstractBinaryTreeNode.html +14 -14
  206. package/docs/interfaces/IAbstractGraph.html +15 -15
  207. package/docs/interfaces/IBST.html +77 -77
  208. package/docs/interfaces/IDirectedGraph.html +23 -23
  209. package/docs/interfaces/IRBTree.html +77 -77
  210. package/docs/interfaces/IUNDirectedGraph.html +16 -16
  211. package/docs/types/AVLTreeNodeNested.html +1 -1
  212. package/docs/types/AVLTreeOptions.html +1 -1
  213. package/docs/types/AbstractBinaryTreeNodeNested.html +1 -1
  214. package/docs/types/AbstractBinaryTreeNodeProperties.html +1 -1
  215. package/docs/types/AbstractBinaryTreeNodeProperty.html +1 -1
  216. package/docs/types/AbstractBinaryTreeOptions.html +1 -1
  217. package/docs/types/BSTComparator.html +1 -1
  218. package/docs/types/BSTNodeNested.html +1 -1
  219. package/docs/types/BSTOptions.html +1 -1
  220. package/docs/types/BinaryTreeDeletedResult.html +1 -1
  221. package/docs/types/BinaryTreeNodeId.html +1 -1
  222. package/docs/types/BinaryTreeNodeNested.html +1 -1
  223. package/docs/types/BinaryTreeNodePropertyName.html +1 -1
  224. package/docs/types/BinaryTreeOptions.html +1 -1
  225. package/docs/types/DFSOrderPattern.html +1 -1
  226. package/docs/types/DijkstraResult.html +1 -1
  227. package/docs/types/Direction.html +1 -1
  228. package/docs/types/DummyAny.html +1 -1
  229. package/docs/types/EdgeId.html +1 -1
  230. package/docs/types/HeapOptions.html +1 -1
  231. package/docs/types/IAVLTreeNode.html +1 -1
  232. package/docs/types/IBSTNode.html +1 -1
  233. package/docs/types/IBinaryTree.html +1 -1
  234. package/docs/types/IBinaryTreeNode.html +1 -1
  235. package/docs/types/IRBTreeNode.html +1 -1
  236. package/docs/types/ITreeMultiset.html +1 -1
  237. package/docs/types/ITreeMultisetNode.html +1 -1
  238. package/docs/types/KeyValueObject.html +1 -1
  239. package/docs/types/KeyValueObjectWithId.html +1 -1
  240. package/docs/types/MapGraphCoordinate.html +1 -1
  241. package/docs/types/NavigatorParams.html +1 -1
  242. package/docs/types/NodeOrPropertyName.html +1 -1
  243. package/docs/types/NonNumberNonObjectButDefined.html +1 -1
  244. package/docs/types/ObjectWithNonNumberId.html +1 -1
  245. package/docs/types/ObjectWithNumberId.html +1 -1
  246. package/docs/types/ObjectWithoutId.html +1 -1
  247. package/docs/types/PriorityQueueComparator.html +1 -1
  248. package/docs/types/PriorityQueueDFSOrderPattern.html +1 -1
  249. package/docs/types/PriorityQueueOptions.html +1 -1
  250. package/docs/types/RBTreeNodeNested.html +1 -1
  251. package/docs/types/RBTreeOptions.html +1 -1
  252. package/docs/types/RestrictValById.html +1 -1
  253. package/docs/types/SegmentTreeNodeVal.html +1 -1
  254. package/docs/types/SpecifyOptional.html +1 -1
  255. package/docs/types/Thunk.html +1 -1
  256. package/docs/types/ToThunkFn.html +1 -1
  257. package/docs/types/TopologicalStatus.html +1 -1
  258. package/docs/types/TreeMultisetNodeNested.html +1 -1
  259. package/docs/types/TreeMultisetOptions.html +1 -1
  260. package/docs/types/TrlAsyncFn.html +1 -1
  261. package/docs/types/TrlFn.html +1 -1
  262. package/docs/types/Turning.html +1 -1
  263. package/docs/types/VertexId.html +1 -1
  264. package/docs/variables/THUNK_SYMBOL.html +1 -1
  265. package/jest.config.js +6 -3
  266. package/lib/data-structures/binary-tree/abstract-binary-tree.d.ts +169 -2
  267. package/lib/data-structures/binary-tree/abstract-binary-tree.js +31 -47
  268. package/package.json +40 -25
  269. package/src/data-structures/binary-tree/aa-tree.ts +1 -0
  270. package/src/data-structures/binary-tree/abstract-binary-tree.ts +1631 -0
  271. package/src/data-structures/binary-tree/avl-tree.ts +310 -0
  272. package/src/data-structures/binary-tree/b-tree.ts +1 -0
  273. package/src/data-structures/binary-tree/binary-indexed-tree.ts +76 -0
  274. package/src/data-structures/binary-tree/binary-tree.ts +47 -0
  275. package/src/data-structures/binary-tree/bst.ts +537 -0
  276. package/src/data-structures/binary-tree/index.ts +12 -0
  277. package/src/data-structures/binary-tree/rb-tree.ts +101 -0
  278. package/src/data-structures/binary-tree/segment-tree.ts +242 -0
  279. package/src/data-structures/binary-tree/splay-tree.ts +1 -0
  280. package/src/data-structures/binary-tree/tree-multiset.ts +700 -0
  281. package/src/data-structures/binary-tree/two-three-tree.ts +1 -0
  282. package/src/data-structures/diagrams/README.md +5 -0
  283. package/src/data-structures/graph/abstract-graph.ts +1040 -0
  284. package/src/data-structures/graph/directed-graph.ts +470 -0
  285. package/src/data-structures/graph/index.ts +4 -0
  286. package/src/data-structures/graph/map-graph.ts +129 -0
  287. package/src/data-structures/graph/undirected-graph.ts +274 -0
  288. package/src/data-structures/hash/coordinate-map.ts +67 -0
  289. package/src/data-structures/hash/coordinate-set.ts +56 -0
  290. package/src/data-structures/hash/hash-table.ts +1 -0
  291. package/src/data-structures/hash/index.ts +6 -0
  292. package/src/data-structures/hash/pair.ts +1 -0
  293. package/src/data-structures/hash/tree-map.ts +1 -0
  294. package/src/data-structures/hash/tree-set.ts +1 -0
  295. package/src/data-structures/heap/heap.ts +212 -0
  296. package/src/data-structures/heap/index.ts +3 -0
  297. package/src/data-structures/heap/max-heap.ts +31 -0
  298. package/src/data-structures/heap/min-heap.ts +32 -0
  299. package/src/data-structures/index.ts +11 -0
  300. package/src/data-structures/linked-list/doubly-linked-list.ts +573 -0
  301. package/src/data-structures/linked-list/index.ts +3 -0
  302. package/src/data-structures/linked-list/singly-linked-list.ts +501 -0
  303. package/src/data-structures/linked-list/skip-linked-list.ts +1 -0
  304. package/src/data-structures/matrix/index.ts +4 -0
  305. package/src/data-structures/matrix/matrix.ts +27 -0
  306. package/src/data-structures/matrix/matrix2d.ts +212 -0
  307. package/src/data-structures/matrix/navigator.ts +121 -0
  308. package/src/data-structures/matrix/vector2d.ts +316 -0
  309. package/src/data-structures/priority-queue/index.ts +3 -0
  310. package/src/data-structures/priority-queue/max-priority-queue.ts +56 -0
  311. package/src/data-structures/priority-queue/min-priority-queue.ts +57 -0
  312. package/src/data-structures/priority-queue/priority-queue.ts +359 -0
  313. package/src/data-structures/queue/deque.ts +297 -0
  314. package/src/data-structures/queue/index.ts +2 -0
  315. package/src/data-structures/queue/queue.ts +191 -0
  316. package/src/data-structures/stack/index.ts +1 -0
  317. package/src/data-structures/stack/stack.ts +98 -0
  318. package/src/data-structures/tree/index.ts +1 -0
  319. package/src/data-structures/tree/tree.ts +69 -0
  320. package/src/data-structures/trie/index.ts +1 -0
  321. package/src/data-structures/trie/trie.ts +225 -0
  322. package/src/index.ts +4 -0
  323. package/src/interfaces/abstract-binary-tree.ts +191 -0
  324. package/src/interfaces/abstract-graph.ts +31 -0
  325. package/src/interfaces/avl-tree.ts +25 -0
  326. package/src/interfaces/binary-tree.ts +6 -0
  327. package/src/interfaces/bst.ts +31 -0
  328. package/src/interfaces/directed-graph.ts +20 -0
  329. package/src/interfaces/doubly-linked-list.ts +1 -0
  330. package/src/interfaces/heap.ts +1 -0
  331. package/src/interfaces/index.ts +15 -0
  332. package/src/interfaces/navigator.ts +1 -0
  333. package/src/interfaces/priority-queue.ts +1 -0
  334. package/src/interfaces/rb-tree.ts +9 -0
  335. package/src/interfaces/segment-tree.ts +1 -0
  336. package/src/interfaces/singly-linked-list.ts +1 -0
  337. package/src/interfaces/tree-multiset.ts +7 -0
  338. package/src/interfaces/undirected-graph.ts +6 -0
  339. package/src/types/data-structures/abstract-binary-tree.ts +50 -0
  340. package/src/types/data-structures/abstract-graph.ts +11 -0
  341. package/src/types/data-structures/avl-tree.ts +5 -0
  342. package/src/types/data-structures/binary-tree.ts +5 -0
  343. package/src/types/data-structures/bst.ts +13 -0
  344. package/src/types/data-structures/directed-graph.ts +8 -0
  345. package/src/types/data-structures/doubly-linked-list.ts +1 -0
  346. package/src/types/data-structures/heap.ts +5 -0
  347. package/src/types/data-structures/index.ts +15 -0
  348. package/src/types/data-structures/map-graph.ts +1 -0
  349. package/src/types/data-structures/navigator.ts +13 -0
  350. package/src/types/data-structures/priority-queue.ts +9 -0
  351. package/src/types/data-structures/rb-tree.ts +8 -0
  352. package/src/types/data-structures/segment-tree.ts +1 -0
  353. package/src/types/data-structures/singly-linked-list.ts +1 -0
  354. package/src/types/data-structures/tree-multiset.ts +6 -0
  355. package/src/types/helpers.ts +1 -0
  356. package/src/types/index.ts +3 -0
  357. package/src/types/utils/index.ts +2 -0
  358. package/src/types/utils/utils.ts +6 -0
  359. package/src/types/utils/validate-type.ts +35 -0
  360. package/src/utils/index.ts +1 -0
  361. package/src/utils/utils.ts +79 -0
  362. package/test/unit/data-structures/linked-list/singly-linked-list.test.ts +1 -1
  363. package/test/unit/data-structures/priority-queue/max-priority-queue.test.ts +3 -1
  364. package/tsconfig.json +1 -1
  365. package/umd/bundle.min.js.map +1 -1
@@ -0,0 +1,2185 @@
1
+
2
+ <!doctype html>
3
+ <html lang="en">
4
+
5
+ <head>
6
+ <title>Code coverage report for src/data-structures/binary-tree/tree-multiset.ts</title>
7
+ <meta charset="utf-8" />
8
+ <link rel="stylesheet" href="../../../prettify.css" />
9
+ <link rel="stylesheet" href="../../../base.css" />
10
+ <link rel="shortcut icon" type="image/x-icon" href="../../../favicon.png" />
11
+ <meta name="viewport" content="width=device-width, initial-scale=1" />
12
+ <style type='text/css'>
13
+ .coverage-summary .sorter {
14
+ background-image: url(../../../sort-arrow-sprite.png);
15
+ }
16
+ </style>
17
+ </head>
18
+
19
+ <body>
20
+ <div class='wrapper'>
21
+ <div class='pad1'>
22
+ <h1><a href="../../../index.html">All files</a> / <a href="index.html">src/data-structures/binary-tree</a> tree-multiset.ts</h1>
23
+ <div class='clearfix'>
24
+
25
+ <div class='fl pad1y space-right2'>
26
+ <span class="strong">50% </span>
27
+ <span class="quiet">Statements</span>
28
+ <span class='fraction'>172/344</span>
29
+ </div>
30
+
31
+
32
+ <div class='fl pad1y space-right2'>
33
+ <span class="strong">40.72% </span>
34
+ <span class="quiet">Branches</span>
35
+ <span class='fraction'>79/194</span>
36
+ </div>
37
+
38
+
39
+ <div class='fl pad1y space-right2'>
40
+ <span class="strong">43.58% </span>
41
+ <span class="quiet">Functions</span>
42
+ <span class='fraction'>17/39</span>
43
+ </div>
44
+
45
+
46
+ <div class='fl pad1y space-right2'>
47
+ <span class="strong">54.18% </span>
48
+ <span class="quiet">Lines</span>
49
+ <span class='fraction'>162/299</span>
50
+ </div>
51
+
52
+
53
+ </div>
54
+ <p class="quiet">
55
+ 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.
56
+ </p>
57
+ <template id="filterTemplate">
58
+ <div class="quiet">
59
+ Filter:
60
+ <input oninput="onInput()" type="search" id="fileSearch">
61
+ </div>
62
+ </template>
63
+ </div>
64
+ <div class='status-line medium'></div>
65
+ <pre><table class="coverage">
66
+ <tr><td class="line-count quiet"><a name='L1'></a><a href='#L1'>1</a>
67
+ <a name='L2'></a><a href='#L2'>2</a>
68
+ <a name='L3'></a><a href='#L3'>3</a>
69
+ <a name='L4'></a><a href='#L4'>4</a>
70
+ <a name='L5'></a><a href='#L5'>5</a>
71
+ <a name='L6'></a><a href='#L6'>6</a>
72
+ <a name='L7'></a><a href='#L7'>7</a>
73
+ <a name='L8'></a><a href='#L8'>8</a>
74
+ <a name='L9'></a><a href='#L9'>9</a>
75
+ <a name='L10'></a><a href='#L10'>10</a>
76
+ <a name='L11'></a><a href='#L11'>11</a>
77
+ <a name='L12'></a><a href='#L12'>12</a>
78
+ <a name='L13'></a><a href='#L13'>13</a>
79
+ <a name='L14'></a><a href='#L14'>14</a>
80
+ <a name='L15'></a><a href='#L15'>15</a>
81
+ <a name='L16'></a><a href='#L16'>16</a>
82
+ <a name='L17'></a><a href='#L17'>17</a>
83
+ <a name='L18'></a><a href='#L18'>18</a>
84
+ <a name='L19'></a><a href='#L19'>19</a>
85
+ <a name='L20'></a><a href='#L20'>20</a>
86
+ <a name='L21'></a><a href='#L21'>21</a>
87
+ <a name='L22'></a><a href='#L22'>22</a>
88
+ <a name='L23'></a><a href='#L23'>23</a>
89
+ <a name='L24'></a><a href='#L24'>24</a>
90
+ <a name='L25'></a><a href='#L25'>25</a>
91
+ <a name='L26'></a><a href='#L26'>26</a>
92
+ <a name='L27'></a><a href='#L27'>27</a>
93
+ <a name='L28'></a><a href='#L28'>28</a>
94
+ <a name='L29'></a><a href='#L29'>29</a>
95
+ <a name='L30'></a><a href='#L30'>30</a>
96
+ <a name='L31'></a><a href='#L31'>31</a>
97
+ <a name='L32'></a><a href='#L32'>32</a>
98
+ <a name='L33'></a><a href='#L33'>33</a>
99
+ <a name='L34'></a><a href='#L34'>34</a>
100
+ <a name='L35'></a><a href='#L35'>35</a>
101
+ <a name='L36'></a><a href='#L36'>36</a>
102
+ <a name='L37'></a><a href='#L37'>37</a>
103
+ <a name='L38'></a><a href='#L38'>38</a>
104
+ <a name='L39'></a><a href='#L39'>39</a>
105
+ <a name='L40'></a><a href='#L40'>40</a>
106
+ <a name='L41'></a><a href='#L41'>41</a>
107
+ <a name='L42'></a><a href='#L42'>42</a>
108
+ <a name='L43'></a><a href='#L43'>43</a>
109
+ <a name='L44'></a><a href='#L44'>44</a>
110
+ <a name='L45'></a><a href='#L45'>45</a>
111
+ <a name='L46'></a><a href='#L46'>46</a>
112
+ <a name='L47'></a><a href='#L47'>47</a>
113
+ <a name='L48'></a><a href='#L48'>48</a>
114
+ <a name='L49'></a><a href='#L49'>49</a>
115
+ <a name='L50'></a><a href='#L50'>50</a>
116
+ <a name='L51'></a><a href='#L51'>51</a>
117
+ <a name='L52'></a><a href='#L52'>52</a>
118
+ <a name='L53'></a><a href='#L53'>53</a>
119
+ <a name='L54'></a><a href='#L54'>54</a>
120
+ <a name='L55'></a><a href='#L55'>55</a>
121
+ <a name='L56'></a><a href='#L56'>56</a>
122
+ <a name='L57'></a><a href='#L57'>57</a>
123
+ <a name='L58'></a><a href='#L58'>58</a>
124
+ <a name='L59'></a><a href='#L59'>59</a>
125
+ <a name='L60'></a><a href='#L60'>60</a>
126
+ <a name='L61'></a><a href='#L61'>61</a>
127
+ <a name='L62'></a><a href='#L62'>62</a>
128
+ <a name='L63'></a><a href='#L63'>63</a>
129
+ <a name='L64'></a><a href='#L64'>64</a>
130
+ <a name='L65'></a><a href='#L65'>65</a>
131
+ <a name='L66'></a><a href='#L66'>66</a>
132
+ <a name='L67'></a><a href='#L67'>67</a>
133
+ <a name='L68'></a><a href='#L68'>68</a>
134
+ <a name='L69'></a><a href='#L69'>69</a>
135
+ <a name='L70'></a><a href='#L70'>70</a>
136
+ <a name='L71'></a><a href='#L71'>71</a>
137
+ <a name='L72'></a><a href='#L72'>72</a>
138
+ <a name='L73'></a><a href='#L73'>73</a>
139
+ <a name='L74'></a><a href='#L74'>74</a>
140
+ <a name='L75'></a><a href='#L75'>75</a>
141
+ <a name='L76'></a><a href='#L76'>76</a>
142
+ <a name='L77'></a><a href='#L77'>77</a>
143
+ <a name='L78'></a><a href='#L78'>78</a>
144
+ <a name='L79'></a><a href='#L79'>79</a>
145
+ <a name='L80'></a><a href='#L80'>80</a>
146
+ <a name='L81'></a><a href='#L81'>81</a>
147
+ <a name='L82'></a><a href='#L82'>82</a>
148
+ <a name='L83'></a><a href='#L83'>83</a>
149
+ <a name='L84'></a><a href='#L84'>84</a>
150
+ <a name='L85'></a><a href='#L85'>85</a>
151
+ <a name='L86'></a><a href='#L86'>86</a>
152
+ <a name='L87'></a><a href='#L87'>87</a>
153
+ <a name='L88'></a><a href='#L88'>88</a>
154
+ <a name='L89'></a><a href='#L89'>89</a>
155
+ <a name='L90'></a><a href='#L90'>90</a>
156
+ <a name='L91'></a><a href='#L91'>91</a>
157
+ <a name='L92'></a><a href='#L92'>92</a>
158
+ <a name='L93'></a><a href='#L93'>93</a>
159
+ <a name='L94'></a><a href='#L94'>94</a>
160
+ <a name='L95'></a><a href='#L95'>95</a>
161
+ <a name='L96'></a><a href='#L96'>96</a>
162
+ <a name='L97'></a><a href='#L97'>97</a>
163
+ <a name='L98'></a><a href='#L98'>98</a>
164
+ <a name='L99'></a><a href='#L99'>99</a>
165
+ <a name='L100'></a><a href='#L100'>100</a>
166
+ <a name='L101'></a><a href='#L101'>101</a>
167
+ <a name='L102'></a><a href='#L102'>102</a>
168
+ <a name='L103'></a><a href='#L103'>103</a>
169
+ <a name='L104'></a><a href='#L104'>104</a>
170
+ <a name='L105'></a><a href='#L105'>105</a>
171
+ <a name='L106'></a><a href='#L106'>106</a>
172
+ <a name='L107'></a><a href='#L107'>107</a>
173
+ <a name='L108'></a><a href='#L108'>108</a>
174
+ <a name='L109'></a><a href='#L109'>109</a>
175
+ <a name='L110'></a><a href='#L110'>110</a>
176
+ <a name='L111'></a><a href='#L111'>111</a>
177
+ <a name='L112'></a><a href='#L112'>112</a>
178
+ <a name='L113'></a><a href='#L113'>113</a>
179
+ <a name='L114'></a><a href='#L114'>114</a>
180
+ <a name='L115'></a><a href='#L115'>115</a>
181
+ <a name='L116'></a><a href='#L116'>116</a>
182
+ <a name='L117'></a><a href='#L117'>117</a>
183
+ <a name='L118'></a><a href='#L118'>118</a>
184
+ <a name='L119'></a><a href='#L119'>119</a>
185
+ <a name='L120'></a><a href='#L120'>120</a>
186
+ <a name='L121'></a><a href='#L121'>121</a>
187
+ <a name='L122'></a><a href='#L122'>122</a>
188
+ <a name='L123'></a><a href='#L123'>123</a>
189
+ <a name='L124'></a><a href='#L124'>124</a>
190
+ <a name='L125'></a><a href='#L125'>125</a>
191
+ <a name='L126'></a><a href='#L126'>126</a>
192
+ <a name='L127'></a><a href='#L127'>127</a>
193
+ <a name='L128'></a><a href='#L128'>128</a>
194
+ <a name='L129'></a><a href='#L129'>129</a>
195
+ <a name='L130'></a><a href='#L130'>130</a>
196
+ <a name='L131'></a><a href='#L131'>131</a>
197
+ <a name='L132'></a><a href='#L132'>132</a>
198
+ <a name='L133'></a><a href='#L133'>133</a>
199
+ <a name='L134'></a><a href='#L134'>134</a>
200
+ <a name='L135'></a><a href='#L135'>135</a>
201
+ <a name='L136'></a><a href='#L136'>136</a>
202
+ <a name='L137'></a><a href='#L137'>137</a>
203
+ <a name='L138'></a><a href='#L138'>138</a>
204
+ <a name='L139'></a><a href='#L139'>139</a>
205
+ <a name='L140'></a><a href='#L140'>140</a>
206
+ <a name='L141'></a><a href='#L141'>141</a>
207
+ <a name='L142'></a><a href='#L142'>142</a>
208
+ <a name='L143'></a><a href='#L143'>143</a>
209
+ <a name='L144'></a><a href='#L144'>144</a>
210
+ <a name='L145'></a><a href='#L145'>145</a>
211
+ <a name='L146'></a><a href='#L146'>146</a>
212
+ <a name='L147'></a><a href='#L147'>147</a>
213
+ <a name='L148'></a><a href='#L148'>148</a>
214
+ <a name='L149'></a><a href='#L149'>149</a>
215
+ <a name='L150'></a><a href='#L150'>150</a>
216
+ <a name='L151'></a><a href='#L151'>151</a>
217
+ <a name='L152'></a><a href='#L152'>152</a>
218
+ <a name='L153'></a><a href='#L153'>153</a>
219
+ <a name='L154'></a><a href='#L154'>154</a>
220
+ <a name='L155'></a><a href='#L155'>155</a>
221
+ <a name='L156'></a><a href='#L156'>156</a>
222
+ <a name='L157'></a><a href='#L157'>157</a>
223
+ <a name='L158'></a><a href='#L158'>158</a>
224
+ <a name='L159'></a><a href='#L159'>159</a>
225
+ <a name='L160'></a><a href='#L160'>160</a>
226
+ <a name='L161'></a><a href='#L161'>161</a>
227
+ <a name='L162'></a><a href='#L162'>162</a>
228
+ <a name='L163'></a><a href='#L163'>163</a>
229
+ <a name='L164'></a><a href='#L164'>164</a>
230
+ <a name='L165'></a><a href='#L165'>165</a>
231
+ <a name='L166'></a><a href='#L166'>166</a>
232
+ <a name='L167'></a><a href='#L167'>167</a>
233
+ <a name='L168'></a><a href='#L168'>168</a>
234
+ <a name='L169'></a><a href='#L169'>169</a>
235
+ <a name='L170'></a><a href='#L170'>170</a>
236
+ <a name='L171'></a><a href='#L171'>171</a>
237
+ <a name='L172'></a><a href='#L172'>172</a>
238
+ <a name='L173'></a><a href='#L173'>173</a>
239
+ <a name='L174'></a><a href='#L174'>174</a>
240
+ <a name='L175'></a><a href='#L175'>175</a>
241
+ <a name='L176'></a><a href='#L176'>176</a>
242
+ <a name='L177'></a><a href='#L177'>177</a>
243
+ <a name='L178'></a><a href='#L178'>178</a>
244
+ <a name='L179'></a><a href='#L179'>179</a>
245
+ <a name='L180'></a><a href='#L180'>180</a>
246
+ <a name='L181'></a><a href='#L181'>181</a>
247
+ <a name='L182'></a><a href='#L182'>182</a>
248
+ <a name='L183'></a><a href='#L183'>183</a>
249
+ <a name='L184'></a><a href='#L184'>184</a>
250
+ <a name='L185'></a><a href='#L185'>185</a>
251
+ <a name='L186'></a><a href='#L186'>186</a>
252
+ <a name='L187'></a><a href='#L187'>187</a>
253
+ <a name='L188'></a><a href='#L188'>188</a>
254
+ <a name='L189'></a><a href='#L189'>189</a>
255
+ <a name='L190'></a><a href='#L190'>190</a>
256
+ <a name='L191'></a><a href='#L191'>191</a>
257
+ <a name='L192'></a><a href='#L192'>192</a>
258
+ <a name='L193'></a><a href='#L193'>193</a>
259
+ <a name='L194'></a><a href='#L194'>194</a>
260
+ <a name='L195'></a><a href='#L195'>195</a>
261
+ <a name='L196'></a><a href='#L196'>196</a>
262
+ <a name='L197'></a><a href='#L197'>197</a>
263
+ <a name='L198'></a><a href='#L198'>198</a>
264
+ <a name='L199'></a><a href='#L199'>199</a>
265
+ <a name='L200'></a><a href='#L200'>200</a>
266
+ <a name='L201'></a><a href='#L201'>201</a>
267
+ <a name='L202'></a><a href='#L202'>202</a>
268
+ <a name='L203'></a><a href='#L203'>203</a>
269
+ <a name='L204'></a><a href='#L204'>204</a>
270
+ <a name='L205'></a><a href='#L205'>205</a>
271
+ <a name='L206'></a><a href='#L206'>206</a>
272
+ <a name='L207'></a><a href='#L207'>207</a>
273
+ <a name='L208'></a><a href='#L208'>208</a>
274
+ <a name='L209'></a><a href='#L209'>209</a>
275
+ <a name='L210'></a><a href='#L210'>210</a>
276
+ <a name='L211'></a><a href='#L211'>211</a>
277
+ <a name='L212'></a><a href='#L212'>212</a>
278
+ <a name='L213'></a><a href='#L213'>213</a>
279
+ <a name='L214'></a><a href='#L214'>214</a>
280
+ <a name='L215'></a><a href='#L215'>215</a>
281
+ <a name='L216'></a><a href='#L216'>216</a>
282
+ <a name='L217'></a><a href='#L217'>217</a>
283
+ <a name='L218'></a><a href='#L218'>218</a>
284
+ <a name='L219'></a><a href='#L219'>219</a>
285
+ <a name='L220'></a><a href='#L220'>220</a>
286
+ <a name='L221'></a><a href='#L221'>221</a>
287
+ <a name='L222'></a><a href='#L222'>222</a>
288
+ <a name='L223'></a><a href='#L223'>223</a>
289
+ <a name='L224'></a><a href='#L224'>224</a>
290
+ <a name='L225'></a><a href='#L225'>225</a>
291
+ <a name='L226'></a><a href='#L226'>226</a>
292
+ <a name='L227'></a><a href='#L227'>227</a>
293
+ <a name='L228'></a><a href='#L228'>228</a>
294
+ <a name='L229'></a><a href='#L229'>229</a>
295
+ <a name='L230'></a><a href='#L230'>230</a>
296
+ <a name='L231'></a><a href='#L231'>231</a>
297
+ <a name='L232'></a><a href='#L232'>232</a>
298
+ <a name='L233'></a><a href='#L233'>233</a>
299
+ <a name='L234'></a><a href='#L234'>234</a>
300
+ <a name='L235'></a><a href='#L235'>235</a>
301
+ <a name='L236'></a><a href='#L236'>236</a>
302
+ <a name='L237'></a><a href='#L237'>237</a>
303
+ <a name='L238'></a><a href='#L238'>238</a>
304
+ <a name='L239'></a><a href='#L239'>239</a>
305
+ <a name='L240'></a><a href='#L240'>240</a>
306
+ <a name='L241'></a><a href='#L241'>241</a>
307
+ <a name='L242'></a><a href='#L242'>242</a>
308
+ <a name='L243'></a><a href='#L243'>243</a>
309
+ <a name='L244'></a><a href='#L244'>244</a>
310
+ <a name='L245'></a><a href='#L245'>245</a>
311
+ <a name='L246'></a><a href='#L246'>246</a>
312
+ <a name='L247'></a><a href='#L247'>247</a>
313
+ <a name='L248'></a><a href='#L248'>248</a>
314
+ <a name='L249'></a><a href='#L249'>249</a>
315
+ <a name='L250'></a><a href='#L250'>250</a>
316
+ <a name='L251'></a><a href='#L251'>251</a>
317
+ <a name='L252'></a><a href='#L252'>252</a>
318
+ <a name='L253'></a><a href='#L253'>253</a>
319
+ <a name='L254'></a><a href='#L254'>254</a>
320
+ <a name='L255'></a><a href='#L255'>255</a>
321
+ <a name='L256'></a><a href='#L256'>256</a>
322
+ <a name='L257'></a><a href='#L257'>257</a>
323
+ <a name='L258'></a><a href='#L258'>258</a>
324
+ <a name='L259'></a><a href='#L259'>259</a>
325
+ <a name='L260'></a><a href='#L260'>260</a>
326
+ <a name='L261'></a><a href='#L261'>261</a>
327
+ <a name='L262'></a><a href='#L262'>262</a>
328
+ <a name='L263'></a><a href='#L263'>263</a>
329
+ <a name='L264'></a><a href='#L264'>264</a>
330
+ <a name='L265'></a><a href='#L265'>265</a>
331
+ <a name='L266'></a><a href='#L266'>266</a>
332
+ <a name='L267'></a><a href='#L267'>267</a>
333
+ <a name='L268'></a><a href='#L268'>268</a>
334
+ <a name='L269'></a><a href='#L269'>269</a>
335
+ <a name='L270'></a><a href='#L270'>270</a>
336
+ <a name='L271'></a><a href='#L271'>271</a>
337
+ <a name='L272'></a><a href='#L272'>272</a>
338
+ <a name='L273'></a><a href='#L273'>273</a>
339
+ <a name='L274'></a><a href='#L274'>274</a>
340
+ <a name='L275'></a><a href='#L275'>275</a>
341
+ <a name='L276'></a><a href='#L276'>276</a>
342
+ <a name='L277'></a><a href='#L277'>277</a>
343
+ <a name='L278'></a><a href='#L278'>278</a>
344
+ <a name='L279'></a><a href='#L279'>279</a>
345
+ <a name='L280'></a><a href='#L280'>280</a>
346
+ <a name='L281'></a><a href='#L281'>281</a>
347
+ <a name='L282'></a><a href='#L282'>282</a>
348
+ <a name='L283'></a><a href='#L283'>283</a>
349
+ <a name='L284'></a><a href='#L284'>284</a>
350
+ <a name='L285'></a><a href='#L285'>285</a>
351
+ <a name='L286'></a><a href='#L286'>286</a>
352
+ <a name='L287'></a><a href='#L287'>287</a>
353
+ <a name='L288'></a><a href='#L288'>288</a>
354
+ <a name='L289'></a><a href='#L289'>289</a>
355
+ <a name='L290'></a><a href='#L290'>290</a>
356
+ <a name='L291'></a><a href='#L291'>291</a>
357
+ <a name='L292'></a><a href='#L292'>292</a>
358
+ <a name='L293'></a><a href='#L293'>293</a>
359
+ <a name='L294'></a><a href='#L294'>294</a>
360
+ <a name='L295'></a><a href='#L295'>295</a>
361
+ <a name='L296'></a><a href='#L296'>296</a>
362
+ <a name='L297'></a><a href='#L297'>297</a>
363
+ <a name='L298'></a><a href='#L298'>298</a>
364
+ <a name='L299'></a><a href='#L299'>299</a>
365
+ <a name='L300'></a><a href='#L300'>300</a>
366
+ <a name='L301'></a><a href='#L301'>301</a>
367
+ <a name='L302'></a><a href='#L302'>302</a>
368
+ <a name='L303'></a><a href='#L303'>303</a>
369
+ <a name='L304'></a><a href='#L304'>304</a>
370
+ <a name='L305'></a><a href='#L305'>305</a>
371
+ <a name='L306'></a><a href='#L306'>306</a>
372
+ <a name='L307'></a><a href='#L307'>307</a>
373
+ <a name='L308'></a><a href='#L308'>308</a>
374
+ <a name='L309'></a><a href='#L309'>309</a>
375
+ <a name='L310'></a><a href='#L310'>310</a>
376
+ <a name='L311'></a><a href='#L311'>311</a>
377
+ <a name='L312'></a><a href='#L312'>312</a>
378
+ <a name='L313'></a><a href='#L313'>313</a>
379
+ <a name='L314'></a><a href='#L314'>314</a>
380
+ <a name='L315'></a><a href='#L315'>315</a>
381
+ <a name='L316'></a><a href='#L316'>316</a>
382
+ <a name='L317'></a><a href='#L317'>317</a>
383
+ <a name='L318'></a><a href='#L318'>318</a>
384
+ <a name='L319'></a><a href='#L319'>319</a>
385
+ <a name='L320'></a><a href='#L320'>320</a>
386
+ <a name='L321'></a><a href='#L321'>321</a>
387
+ <a name='L322'></a><a href='#L322'>322</a>
388
+ <a name='L323'></a><a href='#L323'>323</a>
389
+ <a name='L324'></a><a href='#L324'>324</a>
390
+ <a name='L325'></a><a href='#L325'>325</a>
391
+ <a name='L326'></a><a href='#L326'>326</a>
392
+ <a name='L327'></a><a href='#L327'>327</a>
393
+ <a name='L328'></a><a href='#L328'>328</a>
394
+ <a name='L329'></a><a href='#L329'>329</a>
395
+ <a name='L330'></a><a href='#L330'>330</a>
396
+ <a name='L331'></a><a href='#L331'>331</a>
397
+ <a name='L332'></a><a href='#L332'>332</a>
398
+ <a name='L333'></a><a href='#L333'>333</a>
399
+ <a name='L334'></a><a href='#L334'>334</a>
400
+ <a name='L335'></a><a href='#L335'>335</a>
401
+ <a name='L336'></a><a href='#L336'>336</a>
402
+ <a name='L337'></a><a href='#L337'>337</a>
403
+ <a name='L338'></a><a href='#L338'>338</a>
404
+ <a name='L339'></a><a href='#L339'>339</a>
405
+ <a name='L340'></a><a href='#L340'>340</a>
406
+ <a name='L341'></a><a href='#L341'>341</a>
407
+ <a name='L342'></a><a href='#L342'>342</a>
408
+ <a name='L343'></a><a href='#L343'>343</a>
409
+ <a name='L344'></a><a href='#L344'>344</a>
410
+ <a name='L345'></a><a href='#L345'>345</a>
411
+ <a name='L346'></a><a href='#L346'>346</a>
412
+ <a name='L347'></a><a href='#L347'>347</a>
413
+ <a name='L348'></a><a href='#L348'>348</a>
414
+ <a name='L349'></a><a href='#L349'>349</a>
415
+ <a name='L350'></a><a href='#L350'>350</a>
416
+ <a name='L351'></a><a href='#L351'>351</a>
417
+ <a name='L352'></a><a href='#L352'>352</a>
418
+ <a name='L353'></a><a href='#L353'>353</a>
419
+ <a name='L354'></a><a href='#L354'>354</a>
420
+ <a name='L355'></a><a href='#L355'>355</a>
421
+ <a name='L356'></a><a href='#L356'>356</a>
422
+ <a name='L357'></a><a href='#L357'>357</a>
423
+ <a name='L358'></a><a href='#L358'>358</a>
424
+ <a name='L359'></a><a href='#L359'>359</a>
425
+ <a name='L360'></a><a href='#L360'>360</a>
426
+ <a name='L361'></a><a href='#L361'>361</a>
427
+ <a name='L362'></a><a href='#L362'>362</a>
428
+ <a name='L363'></a><a href='#L363'>363</a>
429
+ <a name='L364'></a><a href='#L364'>364</a>
430
+ <a name='L365'></a><a href='#L365'>365</a>
431
+ <a name='L366'></a><a href='#L366'>366</a>
432
+ <a name='L367'></a><a href='#L367'>367</a>
433
+ <a name='L368'></a><a href='#L368'>368</a>
434
+ <a name='L369'></a><a href='#L369'>369</a>
435
+ <a name='L370'></a><a href='#L370'>370</a>
436
+ <a name='L371'></a><a href='#L371'>371</a>
437
+ <a name='L372'></a><a href='#L372'>372</a>
438
+ <a name='L373'></a><a href='#L373'>373</a>
439
+ <a name='L374'></a><a href='#L374'>374</a>
440
+ <a name='L375'></a><a href='#L375'>375</a>
441
+ <a name='L376'></a><a href='#L376'>376</a>
442
+ <a name='L377'></a><a href='#L377'>377</a>
443
+ <a name='L378'></a><a href='#L378'>378</a>
444
+ <a name='L379'></a><a href='#L379'>379</a>
445
+ <a name='L380'></a><a href='#L380'>380</a>
446
+ <a name='L381'></a><a href='#L381'>381</a>
447
+ <a name='L382'></a><a href='#L382'>382</a>
448
+ <a name='L383'></a><a href='#L383'>383</a>
449
+ <a name='L384'></a><a href='#L384'>384</a>
450
+ <a name='L385'></a><a href='#L385'>385</a>
451
+ <a name='L386'></a><a href='#L386'>386</a>
452
+ <a name='L387'></a><a href='#L387'>387</a>
453
+ <a name='L388'></a><a href='#L388'>388</a>
454
+ <a name='L389'></a><a href='#L389'>389</a>
455
+ <a name='L390'></a><a href='#L390'>390</a>
456
+ <a name='L391'></a><a href='#L391'>391</a>
457
+ <a name='L392'></a><a href='#L392'>392</a>
458
+ <a name='L393'></a><a href='#L393'>393</a>
459
+ <a name='L394'></a><a href='#L394'>394</a>
460
+ <a name='L395'></a><a href='#L395'>395</a>
461
+ <a name='L396'></a><a href='#L396'>396</a>
462
+ <a name='L397'></a><a href='#L397'>397</a>
463
+ <a name='L398'></a><a href='#L398'>398</a>
464
+ <a name='L399'></a><a href='#L399'>399</a>
465
+ <a name='L400'></a><a href='#L400'>400</a>
466
+ <a name='L401'></a><a href='#L401'>401</a>
467
+ <a name='L402'></a><a href='#L402'>402</a>
468
+ <a name='L403'></a><a href='#L403'>403</a>
469
+ <a name='L404'></a><a href='#L404'>404</a>
470
+ <a name='L405'></a><a href='#L405'>405</a>
471
+ <a name='L406'></a><a href='#L406'>406</a>
472
+ <a name='L407'></a><a href='#L407'>407</a>
473
+ <a name='L408'></a><a href='#L408'>408</a>
474
+ <a name='L409'></a><a href='#L409'>409</a>
475
+ <a name='L410'></a><a href='#L410'>410</a>
476
+ <a name='L411'></a><a href='#L411'>411</a>
477
+ <a name='L412'></a><a href='#L412'>412</a>
478
+ <a name='L413'></a><a href='#L413'>413</a>
479
+ <a name='L414'></a><a href='#L414'>414</a>
480
+ <a name='L415'></a><a href='#L415'>415</a>
481
+ <a name='L416'></a><a href='#L416'>416</a>
482
+ <a name='L417'></a><a href='#L417'>417</a>
483
+ <a name='L418'></a><a href='#L418'>418</a>
484
+ <a name='L419'></a><a href='#L419'>419</a>
485
+ <a name='L420'></a><a href='#L420'>420</a>
486
+ <a name='L421'></a><a href='#L421'>421</a>
487
+ <a name='L422'></a><a href='#L422'>422</a>
488
+ <a name='L423'></a><a href='#L423'>423</a>
489
+ <a name='L424'></a><a href='#L424'>424</a>
490
+ <a name='L425'></a><a href='#L425'>425</a>
491
+ <a name='L426'></a><a href='#L426'>426</a>
492
+ <a name='L427'></a><a href='#L427'>427</a>
493
+ <a name='L428'></a><a href='#L428'>428</a>
494
+ <a name='L429'></a><a href='#L429'>429</a>
495
+ <a name='L430'></a><a href='#L430'>430</a>
496
+ <a name='L431'></a><a href='#L431'>431</a>
497
+ <a name='L432'></a><a href='#L432'>432</a>
498
+ <a name='L433'></a><a href='#L433'>433</a>
499
+ <a name='L434'></a><a href='#L434'>434</a>
500
+ <a name='L435'></a><a href='#L435'>435</a>
501
+ <a name='L436'></a><a href='#L436'>436</a>
502
+ <a name='L437'></a><a href='#L437'>437</a>
503
+ <a name='L438'></a><a href='#L438'>438</a>
504
+ <a name='L439'></a><a href='#L439'>439</a>
505
+ <a name='L440'></a><a href='#L440'>440</a>
506
+ <a name='L441'></a><a href='#L441'>441</a>
507
+ <a name='L442'></a><a href='#L442'>442</a>
508
+ <a name='L443'></a><a href='#L443'>443</a>
509
+ <a name='L444'></a><a href='#L444'>444</a>
510
+ <a name='L445'></a><a href='#L445'>445</a>
511
+ <a name='L446'></a><a href='#L446'>446</a>
512
+ <a name='L447'></a><a href='#L447'>447</a>
513
+ <a name='L448'></a><a href='#L448'>448</a>
514
+ <a name='L449'></a><a href='#L449'>449</a>
515
+ <a name='L450'></a><a href='#L450'>450</a>
516
+ <a name='L451'></a><a href='#L451'>451</a>
517
+ <a name='L452'></a><a href='#L452'>452</a>
518
+ <a name='L453'></a><a href='#L453'>453</a>
519
+ <a name='L454'></a><a href='#L454'>454</a>
520
+ <a name='L455'></a><a href='#L455'>455</a>
521
+ <a name='L456'></a><a href='#L456'>456</a>
522
+ <a name='L457'></a><a href='#L457'>457</a>
523
+ <a name='L458'></a><a href='#L458'>458</a>
524
+ <a name='L459'></a><a href='#L459'>459</a>
525
+ <a name='L460'></a><a href='#L460'>460</a>
526
+ <a name='L461'></a><a href='#L461'>461</a>
527
+ <a name='L462'></a><a href='#L462'>462</a>
528
+ <a name='L463'></a><a href='#L463'>463</a>
529
+ <a name='L464'></a><a href='#L464'>464</a>
530
+ <a name='L465'></a><a href='#L465'>465</a>
531
+ <a name='L466'></a><a href='#L466'>466</a>
532
+ <a name='L467'></a><a href='#L467'>467</a>
533
+ <a name='L468'></a><a href='#L468'>468</a>
534
+ <a name='L469'></a><a href='#L469'>469</a>
535
+ <a name='L470'></a><a href='#L470'>470</a>
536
+ <a name='L471'></a><a href='#L471'>471</a>
537
+ <a name='L472'></a><a href='#L472'>472</a>
538
+ <a name='L473'></a><a href='#L473'>473</a>
539
+ <a name='L474'></a><a href='#L474'>474</a>
540
+ <a name='L475'></a><a href='#L475'>475</a>
541
+ <a name='L476'></a><a href='#L476'>476</a>
542
+ <a name='L477'></a><a href='#L477'>477</a>
543
+ <a name='L478'></a><a href='#L478'>478</a>
544
+ <a name='L479'></a><a href='#L479'>479</a>
545
+ <a name='L480'></a><a href='#L480'>480</a>
546
+ <a name='L481'></a><a href='#L481'>481</a>
547
+ <a name='L482'></a><a href='#L482'>482</a>
548
+ <a name='L483'></a><a href='#L483'>483</a>
549
+ <a name='L484'></a><a href='#L484'>484</a>
550
+ <a name='L485'></a><a href='#L485'>485</a>
551
+ <a name='L486'></a><a href='#L486'>486</a>
552
+ <a name='L487'></a><a href='#L487'>487</a>
553
+ <a name='L488'></a><a href='#L488'>488</a>
554
+ <a name='L489'></a><a href='#L489'>489</a>
555
+ <a name='L490'></a><a href='#L490'>490</a>
556
+ <a name='L491'></a><a href='#L491'>491</a>
557
+ <a name='L492'></a><a href='#L492'>492</a>
558
+ <a name='L493'></a><a href='#L493'>493</a>
559
+ <a name='L494'></a><a href='#L494'>494</a>
560
+ <a name='L495'></a><a href='#L495'>495</a>
561
+ <a name='L496'></a><a href='#L496'>496</a>
562
+ <a name='L497'></a><a href='#L497'>497</a>
563
+ <a name='L498'></a><a href='#L498'>498</a>
564
+ <a name='L499'></a><a href='#L499'>499</a>
565
+ <a name='L500'></a><a href='#L500'>500</a>
566
+ <a name='L501'></a><a href='#L501'>501</a>
567
+ <a name='L502'></a><a href='#L502'>502</a>
568
+ <a name='L503'></a><a href='#L503'>503</a>
569
+ <a name='L504'></a><a href='#L504'>504</a>
570
+ <a name='L505'></a><a href='#L505'>505</a>
571
+ <a name='L506'></a><a href='#L506'>506</a>
572
+ <a name='L507'></a><a href='#L507'>507</a>
573
+ <a name='L508'></a><a href='#L508'>508</a>
574
+ <a name='L509'></a><a href='#L509'>509</a>
575
+ <a name='L510'></a><a href='#L510'>510</a>
576
+ <a name='L511'></a><a href='#L511'>511</a>
577
+ <a name='L512'></a><a href='#L512'>512</a>
578
+ <a name='L513'></a><a href='#L513'>513</a>
579
+ <a name='L514'></a><a href='#L514'>514</a>
580
+ <a name='L515'></a><a href='#L515'>515</a>
581
+ <a name='L516'></a><a href='#L516'>516</a>
582
+ <a name='L517'></a><a href='#L517'>517</a>
583
+ <a name='L518'></a><a href='#L518'>518</a>
584
+ <a name='L519'></a><a href='#L519'>519</a>
585
+ <a name='L520'></a><a href='#L520'>520</a>
586
+ <a name='L521'></a><a href='#L521'>521</a>
587
+ <a name='L522'></a><a href='#L522'>522</a>
588
+ <a name='L523'></a><a href='#L523'>523</a>
589
+ <a name='L524'></a><a href='#L524'>524</a>
590
+ <a name='L525'></a><a href='#L525'>525</a>
591
+ <a name='L526'></a><a href='#L526'>526</a>
592
+ <a name='L527'></a><a href='#L527'>527</a>
593
+ <a name='L528'></a><a href='#L528'>528</a>
594
+ <a name='L529'></a><a href='#L529'>529</a>
595
+ <a name='L530'></a><a href='#L530'>530</a>
596
+ <a name='L531'></a><a href='#L531'>531</a>
597
+ <a name='L532'></a><a href='#L532'>532</a>
598
+ <a name='L533'></a><a href='#L533'>533</a>
599
+ <a name='L534'></a><a href='#L534'>534</a>
600
+ <a name='L535'></a><a href='#L535'>535</a>
601
+ <a name='L536'></a><a href='#L536'>536</a>
602
+ <a name='L537'></a><a href='#L537'>537</a>
603
+ <a name='L538'></a><a href='#L538'>538</a>
604
+ <a name='L539'></a><a href='#L539'>539</a>
605
+ <a name='L540'></a><a href='#L540'>540</a>
606
+ <a name='L541'></a><a href='#L541'>541</a>
607
+ <a name='L542'></a><a href='#L542'>542</a>
608
+ <a name='L543'></a><a href='#L543'>543</a>
609
+ <a name='L544'></a><a href='#L544'>544</a>
610
+ <a name='L545'></a><a href='#L545'>545</a>
611
+ <a name='L546'></a><a href='#L546'>546</a>
612
+ <a name='L547'></a><a href='#L547'>547</a>
613
+ <a name='L548'></a><a href='#L548'>548</a>
614
+ <a name='L549'></a><a href='#L549'>549</a>
615
+ <a name='L550'></a><a href='#L550'>550</a>
616
+ <a name='L551'></a><a href='#L551'>551</a>
617
+ <a name='L552'></a><a href='#L552'>552</a>
618
+ <a name='L553'></a><a href='#L553'>553</a>
619
+ <a name='L554'></a><a href='#L554'>554</a>
620
+ <a name='L555'></a><a href='#L555'>555</a>
621
+ <a name='L556'></a><a href='#L556'>556</a>
622
+ <a name='L557'></a><a href='#L557'>557</a>
623
+ <a name='L558'></a><a href='#L558'>558</a>
624
+ <a name='L559'></a><a href='#L559'>559</a>
625
+ <a name='L560'></a><a href='#L560'>560</a>
626
+ <a name='L561'></a><a href='#L561'>561</a>
627
+ <a name='L562'></a><a href='#L562'>562</a>
628
+ <a name='L563'></a><a href='#L563'>563</a>
629
+ <a name='L564'></a><a href='#L564'>564</a>
630
+ <a name='L565'></a><a href='#L565'>565</a>
631
+ <a name='L566'></a><a href='#L566'>566</a>
632
+ <a name='L567'></a><a href='#L567'>567</a>
633
+ <a name='L568'></a><a href='#L568'>568</a>
634
+ <a name='L569'></a><a href='#L569'>569</a>
635
+ <a name='L570'></a><a href='#L570'>570</a>
636
+ <a name='L571'></a><a href='#L571'>571</a>
637
+ <a name='L572'></a><a href='#L572'>572</a>
638
+ <a name='L573'></a><a href='#L573'>573</a>
639
+ <a name='L574'></a><a href='#L574'>574</a>
640
+ <a name='L575'></a><a href='#L575'>575</a>
641
+ <a name='L576'></a><a href='#L576'>576</a>
642
+ <a name='L577'></a><a href='#L577'>577</a>
643
+ <a name='L578'></a><a href='#L578'>578</a>
644
+ <a name='L579'></a><a href='#L579'>579</a>
645
+ <a name='L580'></a><a href='#L580'>580</a>
646
+ <a name='L581'></a><a href='#L581'>581</a>
647
+ <a name='L582'></a><a href='#L582'>582</a>
648
+ <a name='L583'></a><a href='#L583'>583</a>
649
+ <a name='L584'></a><a href='#L584'>584</a>
650
+ <a name='L585'></a><a href='#L585'>585</a>
651
+ <a name='L586'></a><a href='#L586'>586</a>
652
+ <a name='L587'></a><a href='#L587'>587</a>
653
+ <a name='L588'></a><a href='#L588'>588</a>
654
+ <a name='L589'></a><a href='#L589'>589</a>
655
+ <a name='L590'></a><a href='#L590'>590</a>
656
+ <a name='L591'></a><a href='#L591'>591</a>
657
+ <a name='L592'></a><a href='#L592'>592</a>
658
+ <a name='L593'></a><a href='#L593'>593</a>
659
+ <a name='L594'></a><a href='#L594'>594</a>
660
+ <a name='L595'></a><a href='#L595'>595</a>
661
+ <a name='L596'></a><a href='#L596'>596</a>
662
+ <a name='L597'></a><a href='#L597'>597</a>
663
+ <a name='L598'></a><a href='#L598'>598</a>
664
+ <a name='L599'></a><a href='#L599'>599</a>
665
+ <a name='L600'></a><a href='#L600'>600</a>
666
+ <a name='L601'></a><a href='#L601'>601</a>
667
+ <a name='L602'></a><a href='#L602'>602</a>
668
+ <a name='L603'></a><a href='#L603'>603</a>
669
+ <a name='L604'></a><a href='#L604'>604</a>
670
+ <a name='L605'></a><a href='#L605'>605</a>
671
+ <a name='L606'></a><a href='#L606'>606</a>
672
+ <a name='L607'></a><a href='#L607'>607</a>
673
+ <a name='L608'></a><a href='#L608'>608</a>
674
+ <a name='L609'></a><a href='#L609'>609</a>
675
+ <a name='L610'></a><a href='#L610'>610</a>
676
+ <a name='L611'></a><a href='#L611'>611</a>
677
+ <a name='L612'></a><a href='#L612'>612</a>
678
+ <a name='L613'></a><a href='#L613'>613</a>
679
+ <a name='L614'></a><a href='#L614'>614</a>
680
+ <a name='L615'></a><a href='#L615'>615</a>
681
+ <a name='L616'></a><a href='#L616'>616</a>
682
+ <a name='L617'></a><a href='#L617'>617</a>
683
+ <a name='L618'></a><a href='#L618'>618</a>
684
+ <a name='L619'></a><a href='#L619'>619</a>
685
+ <a name='L620'></a><a href='#L620'>620</a>
686
+ <a name='L621'></a><a href='#L621'>621</a>
687
+ <a name='L622'></a><a href='#L622'>622</a>
688
+ <a name='L623'></a><a href='#L623'>623</a>
689
+ <a name='L624'></a><a href='#L624'>624</a>
690
+ <a name='L625'></a><a href='#L625'>625</a>
691
+ <a name='L626'></a><a href='#L626'>626</a>
692
+ <a name='L627'></a><a href='#L627'>627</a>
693
+ <a name='L628'></a><a href='#L628'>628</a>
694
+ <a name='L629'></a><a href='#L629'>629</a>
695
+ <a name='L630'></a><a href='#L630'>630</a>
696
+ <a name='L631'></a><a href='#L631'>631</a>
697
+ <a name='L632'></a><a href='#L632'>632</a>
698
+ <a name='L633'></a><a href='#L633'>633</a>
699
+ <a name='L634'></a><a href='#L634'>634</a>
700
+ <a name='L635'></a><a href='#L635'>635</a>
701
+ <a name='L636'></a><a href='#L636'>636</a>
702
+ <a name='L637'></a><a href='#L637'>637</a>
703
+ <a name='L638'></a><a href='#L638'>638</a>
704
+ <a name='L639'></a><a href='#L639'>639</a>
705
+ <a name='L640'></a><a href='#L640'>640</a>
706
+ <a name='L641'></a><a href='#L641'>641</a>
707
+ <a name='L642'></a><a href='#L642'>642</a>
708
+ <a name='L643'></a><a href='#L643'>643</a>
709
+ <a name='L644'></a><a href='#L644'>644</a>
710
+ <a name='L645'></a><a href='#L645'>645</a>
711
+ <a name='L646'></a><a href='#L646'>646</a>
712
+ <a name='L647'></a><a href='#L647'>647</a>
713
+ <a name='L648'></a><a href='#L648'>648</a>
714
+ <a name='L649'></a><a href='#L649'>649</a>
715
+ <a name='L650'></a><a href='#L650'>650</a>
716
+ <a name='L651'></a><a href='#L651'>651</a>
717
+ <a name='L652'></a><a href='#L652'>652</a>
718
+ <a name='L653'></a><a href='#L653'>653</a>
719
+ <a name='L654'></a><a href='#L654'>654</a>
720
+ <a name='L655'></a><a href='#L655'>655</a>
721
+ <a name='L656'></a><a href='#L656'>656</a>
722
+ <a name='L657'></a><a href='#L657'>657</a>
723
+ <a name='L658'></a><a href='#L658'>658</a>
724
+ <a name='L659'></a><a href='#L659'>659</a>
725
+ <a name='L660'></a><a href='#L660'>660</a>
726
+ <a name='L661'></a><a href='#L661'>661</a>
727
+ <a name='L662'></a><a href='#L662'>662</a>
728
+ <a name='L663'></a><a href='#L663'>663</a>
729
+ <a name='L664'></a><a href='#L664'>664</a>
730
+ <a name='L665'></a><a href='#L665'>665</a>
731
+ <a name='L666'></a><a href='#L666'>666</a>
732
+ <a name='L667'></a><a href='#L667'>667</a>
733
+ <a name='L668'></a><a href='#L668'>668</a>
734
+ <a name='L669'></a><a href='#L669'>669</a>
735
+ <a name='L670'></a><a href='#L670'>670</a>
736
+ <a name='L671'></a><a href='#L671'>671</a>
737
+ <a name='L672'></a><a href='#L672'>672</a>
738
+ <a name='L673'></a><a href='#L673'>673</a>
739
+ <a name='L674'></a><a href='#L674'>674</a>
740
+ <a name='L675'></a><a href='#L675'>675</a>
741
+ <a name='L676'></a><a href='#L676'>676</a>
742
+ <a name='L677'></a><a href='#L677'>677</a>
743
+ <a name='L678'></a><a href='#L678'>678</a>
744
+ <a name='L679'></a><a href='#L679'>679</a>
745
+ <a name='L680'></a><a href='#L680'>680</a>
746
+ <a name='L681'></a><a href='#L681'>681</a>
747
+ <a name='L682'></a><a href='#L682'>682</a>
748
+ <a name='L683'></a><a href='#L683'>683</a>
749
+ <a name='L684'></a><a href='#L684'>684</a>
750
+ <a name='L685'></a><a href='#L685'>685</a>
751
+ <a name='L686'></a><a href='#L686'>686</a>
752
+ <a name='L687'></a><a href='#L687'>687</a>
753
+ <a name='L688'></a><a href='#L688'>688</a>
754
+ <a name='L689'></a><a href='#L689'>689</a>
755
+ <a name='L690'></a><a href='#L690'>690</a>
756
+ <a name='L691'></a><a href='#L691'>691</a>
757
+ <a name='L692'></a><a href='#L692'>692</a>
758
+ <a name='L693'></a><a href='#L693'>693</a>
759
+ <a name='L694'></a><a href='#L694'>694</a>
760
+ <a name='L695'></a><a href='#L695'>695</a>
761
+ <a name='L696'></a><a href='#L696'>696</a>
762
+ <a name='L697'></a><a href='#L697'>697</a>
763
+ <a name='L698'></a><a href='#L698'>698</a>
764
+ <a name='L699'></a><a href='#L699'>699</a>
765
+ <a name='L700'></a><a href='#L700'>700</a>
766
+ <a name='L701'></a><a href='#L701'>701</a></td><td class="line-coverage quiet"><span class="cline-any cline-neutral">&nbsp;</span>
767
+ <span class="cline-any cline-neutral">&nbsp;</span>
768
+ <span class="cline-any cline-neutral">&nbsp;</span>
769
+ <span class="cline-any cline-neutral">&nbsp;</span>
770
+ <span class="cline-any cline-neutral">&nbsp;</span>
771
+ <span class="cline-any cline-neutral">&nbsp;</span>
772
+ <span class="cline-any cline-neutral">&nbsp;</span>
773
+ <span class="cline-any cline-neutral">&nbsp;</span>
774
+ <span class="cline-any cline-yes">19x</span>
775
+ <span class="cline-any cline-neutral">&nbsp;</span>
776
+ <span class="cline-any cline-yes">19x</span>
777
+ <span class="cline-any cline-neutral">&nbsp;</span>
778
+ <span class="cline-any cline-yes">19x</span>
779
+ <span class="cline-any cline-neutral">&nbsp;</span>
780
+ <span class="cline-any cline-neutral">&nbsp;</span>
781
+ <span class="cline-any cline-neutral">&nbsp;</span>
782
+ <span class="cline-any cline-neutral">&nbsp;</span>
783
+ <span class="cline-any cline-neutral">&nbsp;</span>
784
+ <span class="cline-any cline-neutral">&nbsp;</span>
785
+ <span class="cline-any cline-neutral">&nbsp;</span>
786
+ <span class="cline-any cline-neutral">&nbsp;</span>
787
+ <span class="cline-any cline-neutral">&nbsp;</span>
788
+ <span class="cline-any cline-neutral">&nbsp;</span>
789
+ <span class="cline-any cline-neutral">&nbsp;</span>
790
+ <span class="cline-any cline-neutral">&nbsp;</span>
791
+ <span class="cline-any cline-neutral">&nbsp;</span>
792
+ <span class="cline-any cline-neutral">&nbsp;</span>
793
+ <span class="cline-any cline-yes">56x</span>
794
+ <span class="cline-any cline-yes">56x</span>
795
+ <span class="cline-any cline-neutral">&nbsp;</span>
796
+ <span class="cline-any cline-neutral">&nbsp;</span>
797
+ <span class="cline-any cline-neutral">&nbsp;</span>
798
+ <span class="cline-any cline-neutral">&nbsp;</span>
799
+ <span class="cline-any cline-neutral">&nbsp;</span>
800
+ <span class="cline-any cline-yes">156x</span>
801
+ <span class="cline-any cline-neutral">&nbsp;</span>
802
+ <span class="cline-any cline-neutral">&nbsp;</span>
803
+ <span class="cline-any cline-neutral">&nbsp;</span>
804
+ <span class="cline-any cline-yes">24x</span>
805
+ <span class="cline-any cline-neutral">&nbsp;</span>
806
+ <span class="cline-any cline-neutral">&nbsp;</span>
807
+ <span class="cline-any cline-neutral">&nbsp;</span>
808
+ <span class="cline-any cline-neutral">&nbsp;</span>
809
+ <span class="cline-any cline-neutral">&nbsp;</span>
810
+ <span class="cline-any cline-neutral">&nbsp;</span>
811
+ <span class="cline-any cline-yes">19x</span>
812
+ <span class="cline-any cline-neutral">&nbsp;</span>
813
+ <span class="cline-any cline-neutral">&nbsp;</span>
814
+ <span class="cline-any cline-neutral">&nbsp;</span>
815
+ <span class="cline-any cline-neutral">&nbsp;</span>
816
+ <span class="cline-any cline-neutral">&nbsp;</span>
817
+ <span class="cline-any cline-neutral">&nbsp;</span>
818
+ <span class="cline-any cline-neutral">&nbsp;</span>
819
+ <span class="cline-any cline-neutral">&nbsp;</span>
820
+ <span class="cline-any cline-neutral">&nbsp;</span>
821
+ <span class="cline-any cline-neutral">&nbsp;</span>
822
+ <span class="cline-any cline-yes">2x</span>
823
+ <span class="cline-any cline-neutral">&nbsp;</span>
824
+ <span class="cline-any cline-neutral">&nbsp;</span>
825
+ <span class="cline-any cline-yes">2x</span>
826
+ <span class="cline-any cline-neutral">&nbsp;</span>
827
+ <span class="cline-any cline-neutral">&nbsp;</span>
828
+ <span class="cline-any cline-yes">71x</span>
829
+ <span class="cline-any cline-neutral">&nbsp;</span>
830
+ <span class="cline-any cline-neutral">&nbsp;</span>
831
+ <span class="cline-any cline-neutral">&nbsp;</span>
832
+ <span class="cline-any cline-neutral">&nbsp;</span>
833
+ <span class="cline-any cline-neutral">&nbsp;</span>
834
+ <span class="cline-any cline-neutral">&nbsp;</span>
835
+ <span class="cline-any cline-neutral">&nbsp;</span>
836
+ <span class="cline-any cline-neutral">&nbsp;</span>
837
+ <span class="cline-any cline-neutral">&nbsp;</span>
838
+ <span class="cline-any cline-neutral">&nbsp;</span>
839
+ <span class="cline-any cline-neutral">&nbsp;</span>
840
+ <span class="cline-any cline-neutral">&nbsp;</span>
841
+ <span class="cline-any cline-yes">56x</span>
842
+ <span class="cline-any cline-neutral">&nbsp;</span>
843
+ <span class="cline-any cline-neutral">&nbsp;</span>
844
+ <span class="cline-any cline-neutral">&nbsp;</span>
845
+ <span class="cline-any cline-neutral">&nbsp;</span>
846
+ <span class="cline-any cline-neutral">&nbsp;</span>
847
+ <span class="cline-any cline-neutral">&nbsp;</span>
848
+ <span class="cline-any cline-neutral">&nbsp;</span>
849
+ <span class="cline-any cline-neutral">&nbsp;</span>
850
+ <span class="cline-any cline-neutral">&nbsp;</span>
851
+ <span class="cline-any cline-neutral">&nbsp;</span>
852
+ <span class="cline-any cline-yes">6x</span>
853
+ <span class="cline-any cline-yes">6x</span>
854
+ <span class="cline-any cline-yes">6x</span>
855
+ <span class="cline-any cline-yes">6x</span>
856
+ <span class="cline-any cline-neutral">&nbsp;</span>
857
+ <span class="cline-any cline-yes">6x</span>
858
+ <span class="cline-any cline-yes">6x</span>
859
+ <span class="cline-any cline-yes">6x</span>
860
+ <span class="cline-any cline-yes">6x</span>
861
+ <span class="cline-any cline-neutral">&nbsp;</span>
862
+ <span class="cline-any cline-yes">6x</span>
863
+ <span class="cline-any cline-yes">6x</span>
864
+ <span class="cline-any cline-yes">6x</span>
865
+ <span class="cline-any cline-yes">6x</span>
866
+ <span class="cline-any cline-neutral">&nbsp;</span>
867
+ <span class="cline-any cline-neutral">&nbsp;</span>
868
+ <span class="cline-any cline-yes">6x</span>
869
+ <span class="cline-any cline-neutral">&nbsp;</span>
870
+ <span class="cline-any cline-neutral">&nbsp;</span>
871
+ <span class="cline-any cline-neutral">&nbsp;</span>
872
+ <span class="cline-any cline-neutral">&nbsp;</span>
873
+ <span class="cline-any cline-neutral">&nbsp;</span>
874
+ <span class="cline-any cline-neutral">&nbsp;</span>
875
+ <span class="cline-any cline-neutral">&nbsp;</span>
876
+ <span class="cline-any cline-neutral">&nbsp;</span>
877
+ <span class="cline-any cline-neutral">&nbsp;</span>
878
+ <span class="cline-any cline-neutral">&nbsp;</span>
879
+ <span class="cline-any cline-neutral">&nbsp;</span>
880
+ <span class="cline-any cline-neutral">&nbsp;</span>
881
+ <span class="cline-any cline-neutral">&nbsp;</span>
882
+ <span class="cline-any cline-yes">50x</span>
883
+ <span class="cline-any cline-yes">50x</span>
884
+ <span class="cline-any cline-neutral">&nbsp;</span>
885
+ <span class="cline-any cline-yes">50x</span>
886
+ <span class="cline-any cline-no">&nbsp;</span>
887
+ <span class="cline-any cline-yes">50x</span>
888
+ <span class="cline-any cline-no">&nbsp;</span>
889
+ <span class="cline-any cline-neutral">&nbsp;</span>
890
+ <span class="cline-any cline-yes">50x</span>
891
+ <span class="cline-any cline-neutral">&nbsp;</span>
892
+ <span class="cline-any cline-yes">50x</span>
893
+ <span class="cline-any cline-yes">3x</span>
894
+ <span class="cline-any cline-yes">3x</span>
895
+ <span class="cline-any cline-yes">3x</span>
896
+ <span class="cline-any cline-yes">3x</span>
897
+ <span class="cline-any cline-neutral">&nbsp;</span>
898
+ <span class="cline-any cline-yes">47x</span>
899
+ <span class="cline-any cline-yes">47x</span>
900
+ <span class="cline-any cline-yes">47x</span>
901
+ <span class="cline-any cline-yes">131x</span>
902
+ <span class="cline-any cline-yes">131x</span>
903
+ <span class="cline-any cline-yes">131x</span>
904
+ <span class="cline-any cline-yes">2x</span>
905
+ <span class="cline-any cline-yes">2x</span>
906
+ <span class="cline-any cline-yes">2x</span>
907
+ <span class="cline-any cline-yes">2x</span>
908
+ <span class="cline-any cline-yes">2x</span>
909
+ <span class="cline-any cline-yes">129x</span>
910
+ <span class="cline-any cline-neutral">&nbsp;</span>
911
+ <span class="cline-any cline-yes">60x</span>
912
+ <span class="cline-any cline-neutral">&nbsp;</span>
913
+ <span class="cline-any cline-yes">22x</span>
914
+ <span class="cline-any cline-yes">22x</span>
915
+ <span class="cline-any cline-yes">22x</span>
916
+ <span class="cline-any cline-neutral">&nbsp;</span>
917
+ <span class="cline-any cline-yes">22x</span>
918
+ <span class="cline-any cline-yes">22x</span>
919
+ <span class="cline-any cline-neutral">&nbsp;</span>
920
+ <span class="cline-any cline-neutral">&nbsp;</span>
921
+ <span class="cline-any cline-yes">38x</span>
922
+ <span class="cline-any cline-neutral">&nbsp;</span>
923
+ <span class="cline-any cline-yes">69x</span>
924
+ <span class="cline-any cline-neutral">&nbsp;</span>
925
+ <span class="cline-any cline-yes">69x</span>
926
+ <span class="cline-any cline-neutral">&nbsp;</span>
927
+ <span class="cline-any cline-yes">23x</span>
928
+ <span class="cline-any cline-yes">23x</span>
929
+ <span class="cline-any cline-yes">23x</span>
930
+ <span class="cline-any cline-neutral">&nbsp;</span>
931
+ <span class="cline-any cline-yes">23x</span>
932
+ <span class="cline-any cline-yes">23x</span>
933
+ <span class="cline-any cline-neutral">&nbsp;</span>
934
+ <span class="cline-any cline-neutral">&nbsp;</span>
935
+ <span class="cline-any cline-yes">46x</span>
936
+ <span class="cline-any cline-neutral">&nbsp;</span>
937
+ <span class="cline-any cline-neutral">&nbsp;</span>
938
+ <span class="cline-any cline-neutral">&nbsp;</span>
939
+ <span class="cline-any cline-neutral">&nbsp;</span>
940
+ <span class="cline-any cline-neutral">&nbsp;</span>
941
+ <span class="cline-any cline-neutral">&nbsp;</span>
942
+ <span class="cline-any cline-no">&nbsp;</span>
943
+ <span class="cline-any cline-neutral">&nbsp;</span>
944
+ <span class="cline-any cline-neutral">&nbsp;</span>
945
+ <span class="cline-any cline-neutral">&nbsp;</span>
946
+ <span class="cline-any cline-yes">50x</span>
947
+ <span class="cline-any cline-yes">50x</span>
948
+ <span class="cline-any cline-neutral">&nbsp;</span>
949
+ <span class="cline-any cline-neutral">&nbsp;</span>
950
+ <span class="cline-any cline-neutral">&nbsp;</span>
951
+ <span class="cline-any cline-neutral">&nbsp;</span>
952
+ <span class="cline-any cline-neutral">&nbsp;</span>
953
+ <span class="cline-any cline-neutral">&nbsp;</span>
954
+ <span class="cline-any cline-neutral">&nbsp;</span>
955
+ <span class="cline-any cline-neutral">&nbsp;</span>
956
+ <span class="cline-any cline-neutral">&nbsp;</span>
957
+ <span class="cline-any cline-neutral">&nbsp;</span>
958
+ <span class="cline-any cline-neutral">&nbsp;</span>
959
+ <span class="cline-any cline-neutral">&nbsp;</span>
960
+ <span class="cline-any cline-no">&nbsp;</span>
961
+ <span class="cline-any cline-no">&nbsp;</span>
962
+ <span class="cline-any cline-no">&nbsp;</span>
963
+ <span class="cline-any cline-no">&nbsp;</span>
964
+ <span class="cline-any cline-no">&nbsp;</span>
965
+ <span class="cline-any cline-no">&nbsp;</span>
966
+ <span class="cline-any cline-neutral">&nbsp;</span>
967
+ <span class="cline-any cline-neutral">&nbsp;</span>
968
+ <span class="cline-any cline-no">&nbsp;</span>
969
+ <span class="cline-any cline-no">&nbsp;</span>
970
+ <span class="cline-any cline-no">&nbsp;</span>
971
+ <span class="cline-any cline-no">&nbsp;</span>
972
+ <span class="cline-any cline-no">&nbsp;</span>
973
+ <span class="cline-any cline-no">&nbsp;</span>
974
+ <span class="cline-any cline-neutral">&nbsp;</span>
975
+ <span class="cline-any cline-no">&nbsp;</span>
976
+ <span class="cline-any cline-neutral">&nbsp;</span>
977
+ <span class="cline-any cline-no">&nbsp;</span>
978
+ <span class="cline-any cline-neutral">&nbsp;</span>
979
+ <span class="cline-any cline-neutral">&nbsp;</span>
980
+ <span class="cline-any cline-no">&nbsp;</span>
981
+ <span class="cline-any cline-neutral">&nbsp;</span>
982
+ <span class="cline-any cline-neutral">&nbsp;</span>
983
+ <span class="cline-any cline-neutral">&nbsp;</span>
984
+ <span class="cline-any cline-neutral">&nbsp;</span>
985
+ <span class="cline-any cline-neutral">&nbsp;</span>
986
+ <span class="cline-any cline-neutral">&nbsp;</span>
987
+ <span class="cline-any cline-neutral">&nbsp;</span>
988
+ <span class="cline-any cline-neutral">&nbsp;</span>
989
+ <span class="cline-any cline-neutral">&nbsp;</span>
990
+ <span class="cline-any cline-neutral">&nbsp;</span>
991
+ <span class="cline-any cline-neutral">&nbsp;</span>
992
+ <span class="cline-any cline-neutral">&nbsp;</span>
993
+ <span class="cline-any cline-neutral">&nbsp;</span>
994
+ <span class="cline-any cline-neutral">&nbsp;</span>
995
+ <span class="cline-any cline-neutral">&nbsp;</span>
996
+ <span class="cline-any cline-neutral">&nbsp;</span>
997
+ <span class="cline-any cline-neutral">&nbsp;</span>
998
+ <span class="cline-any cline-yes">2x</span>
999
+ <span class="cline-any cline-neutral">&nbsp;</span>
1000
+ <span class="cline-any cline-yes">2x</span>
1001
+ <span class="cline-any cline-yes">30x</span>
1002
+ <span class="cline-any cline-neutral">&nbsp;</span>
1003
+ <span class="cline-any cline-yes">30x</span>
1004
+ <span class="cline-any cline-no">&nbsp;</span>
1005
+ <span class="cline-any cline-no">&nbsp;</span>
1006
+ <span class="cline-any cline-neutral">&nbsp;</span>
1007
+ <span class="cline-any cline-neutral">&nbsp;</span>
1008
+ <span class="cline-any cline-yes">30x</span>
1009
+ <span class="cline-any cline-no">&nbsp;</span>
1010
+ <span class="cline-any cline-no">&nbsp;</span>
1011
+ <span class="cline-any cline-neutral">&nbsp;</span>
1012
+ <span class="cline-any cline-neutral">&nbsp;</span>
1013
+ <span class="cline-any cline-yes">30x</span>
1014
+ <span class="cline-any cline-neutral">&nbsp;</span>
1015
+ <span class="cline-any cline-yes">2x</span>
1016
+ <span class="cline-any cline-neutral">&nbsp;</span>
1017
+ <span class="cline-any cline-neutral">&nbsp;</span>
1018
+ <span class="cline-any cline-neutral">&nbsp;</span>
1019
+ <span class="cline-any cline-neutral">&nbsp;</span>
1020
+ <span class="cline-any cline-neutral">&nbsp;</span>
1021
+ <span class="cline-any cline-neutral">&nbsp;</span>
1022
+ <span class="cline-any cline-neutral">&nbsp;</span>
1023
+ <span class="cline-any cline-neutral">&nbsp;</span>
1024
+ <span class="cline-any cline-yes">1x</span>
1025
+ <span class="cline-any cline-yes">1x</span>
1026
+ <span class="cline-any cline-yes">1x</span>
1027
+ <span class="cline-any cline-neutral">&nbsp;</span>
1028
+ <span class="cline-any cline-yes">1x</span>
1029
+ <span class="cline-any cline-neutral">&nbsp;</span>
1030
+ <span class="cline-any cline-yes">1x</span>
1031
+ <span class="cline-any cline-no">&nbsp;</span>
1032
+ <span class="cline-any cline-no">&nbsp;</span>
1033
+ <span class="cline-any cline-no">&nbsp;</span>
1034
+ <span class="cline-any cline-no">&nbsp;</span>
1035
+ <span class="cline-any cline-no">&nbsp;</span>
1036
+ <span class="cline-any cline-no">&nbsp;</span>
1037
+ <span class="cline-any cline-no">&nbsp;</span>
1038
+ <span class="cline-any cline-neutral">&nbsp;</span>
1039
+ <span class="cline-any cline-neutral">&nbsp;</span>
1040
+ <span class="cline-any cline-no">&nbsp;</span>
1041
+ <span class="cline-any cline-no">&nbsp;</span>
1042
+ <span class="cline-any cline-neutral">&nbsp;</span>
1043
+ <span class="cline-any cline-yes">1x</span>
1044
+ <span class="cline-any cline-yes">1x</span>
1045
+ <span class="cline-any cline-yes">33x</span>
1046
+ <span class="cline-any cline-yes">33x</span>
1047
+ <span class="cline-any cline-yes">33x</span>
1048
+ <span class="cline-any cline-yes">33x</span>
1049
+ <span class="cline-any cline-yes">16x</span>
1050
+ <span class="cline-any cline-yes">16x</span>
1051
+ <span class="cline-any cline-yes">16x</span>
1052
+ <span class="cline-any cline-yes">16x</span>
1053
+ <span class="cline-any cline-yes">16x</span>
1054
+ <span class="cline-any cline-neutral">&nbsp;</span>
1055
+ <span class="cline-any cline-neutral">&nbsp;</span>
1056
+ <span class="cline-any cline-neutral">&nbsp;</span>
1057
+ <span class="cline-any cline-yes">1x</span>
1058
+ <span class="cline-any cline-neutral">&nbsp;</span>
1059
+ <span class="cline-any cline-neutral">&nbsp;</span>
1060
+ <span class="cline-any cline-neutral">&nbsp;</span>
1061
+ <span class="cline-any cline-neutral">&nbsp;</span>
1062
+ <span class="cline-any cline-neutral">&nbsp;</span>
1063
+ <span class="cline-any cline-neutral">&nbsp;</span>
1064
+ <span class="cline-any cline-neutral">&nbsp;</span>
1065
+ <span class="cline-any cline-neutral">&nbsp;</span>
1066
+ <span class="cline-any cline-neutral">&nbsp;</span>
1067
+ <span class="cline-any cline-neutral">&nbsp;</span>
1068
+ <span class="cline-any cline-neutral">&nbsp;</span>
1069
+ <span class="cline-any cline-neutral">&nbsp;</span>
1070
+ <span class="cline-any cline-neutral">&nbsp;</span>
1071
+ <span class="cline-any cline-yes">14x</span>
1072
+ <span class="cline-any cline-yes">14x</span>
1073
+ <span class="cline-any cline-neutral">&nbsp;</span>
1074
+ <span class="cline-any cline-yes">14x</span>
1075
+ <span class="cline-any cline-yes">14x</span>
1076
+ <span class="cline-any cline-neutral">&nbsp;</span>
1077
+ <span class="cline-any cline-yes">13x</span>
1078
+ <span class="cline-any cline-yes">13x</span>
1079
+ <span class="cline-any cline-yes">13x</span>
1080
+ <span class="cline-any cline-neutral">&nbsp;</span>
1081
+ <span class="cline-any cline-yes">13x</span>
1082
+ <span class="cline-any cline-no">&nbsp;</span>
1083
+ <span class="cline-any cline-no">&nbsp;</span>
1084
+ <span class="cline-any cline-neutral">&nbsp;</span>
1085
+ <span class="cline-any cline-yes">13x</span>
1086
+ <span class="cline-any cline-yes">7x</span>
1087
+ <span class="cline-any cline-no">&nbsp;</span>
1088
+ <span class="cline-any cline-neutral">&nbsp;</span>
1089
+ <span class="cline-any cline-yes">7x</span>
1090
+ <span class="cline-any cline-yes">7x</span>
1091
+ <span class="cline-any cline-yes">2x</span>
1092
+ <span class="cline-any cline-yes">5x</span>
1093
+ <span class="cline-any cline-yes">5x</span>
1094
+ <span class="cline-any cline-neutral">&nbsp;</span>
1095
+ <span class="cline-any cline-yes">7x</span>
1096
+ <span class="cline-any cline-neutral">&nbsp;</span>
1097
+ <span class="cline-any cline-neutral">&nbsp;</span>
1098
+ <span class="cline-any cline-yes">6x</span>
1099
+ <span class="cline-any cline-yes">6x</span>
1100
+ <span class="cline-any cline-yes">6x</span>
1101
+ <span class="cline-any cline-yes">6x</span>
1102
+ <span class="cline-any cline-yes">6x</span>
1103
+ <span class="cline-any cline-yes">6x</span>
1104
+ <span class="cline-any cline-yes">2x</span>
1105
+ <span class="cline-any cline-neutral">&nbsp;</span>
1106
+ <span class="cline-any cline-yes">4x</span>
1107
+ <span class="cline-any cline-neutral">&nbsp;</span>
1108
+ <span class="cline-any cline-yes">6x</span>
1109
+ <span class="cline-any cline-neutral">&nbsp;</span>
1110
+ <span class="cline-any cline-neutral">&nbsp;</span>
1111
+ <span class="cline-any cline-neutral">&nbsp;</span>
1112
+ <span class="cline-any cline-yes">13x</span>
1113
+ <span class="cline-any cline-neutral">&nbsp;</span>
1114
+ <span class="cline-any cline-yes">13x</span>
1115
+ <span class="cline-any cline-neutral">&nbsp;</span>
1116
+ <span class="cline-any cline-neutral">&nbsp;</span>
1117
+ <span class="cline-any cline-yes">13x</span>
1118
+ <span class="cline-any cline-neutral">&nbsp;</span>
1119
+ <span class="cline-any cline-yes">13x</span>
1120
+ <span class="cline-any cline-yes">13x</span>
1121
+ <span class="cline-any cline-neutral">&nbsp;</span>
1122
+ <span class="cline-any cline-neutral">&nbsp;</span>
1123
+ <span class="cline-any cline-yes">13x</span>
1124
+ <span class="cline-any cline-neutral">&nbsp;</span>
1125
+ <span class="cline-any cline-neutral">&nbsp;</span>
1126
+ <span class="cline-any cline-neutral">&nbsp;</span>
1127
+ <span class="cline-any cline-neutral">&nbsp;</span>
1128
+ <span class="cline-any cline-neutral">&nbsp;</span>
1129
+ <span class="cline-any cline-neutral">&nbsp;</span>
1130
+ <span class="cline-any cline-neutral">&nbsp;</span>
1131
+ <span class="cline-any cline-neutral">&nbsp;</span>
1132
+ <span class="cline-any cline-neutral">&nbsp;</span>
1133
+ <span class="cline-any cline-neutral">&nbsp;</span>
1134
+ <span class="cline-any cline-no">&nbsp;</span>
1135
+ <span class="cline-any cline-no">&nbsp;</span>
1136
+ <span class="cline-any cline-neutral">&nbsp;</span>
1137
+ <span class="cline-any cline-no">&nbsp;</span>
1138
+ <span class="cline-any cline-no">&nbsp;</span>
1139
+ <span class="cline-any cline-no">&nbsp;</span>
1140
+ <span class="cline-any cline-no">&nbsp;</span>
1141
+ <span class="cline-any cline-no">&nbsp;</span>
1142
+ <span class="cline-any cline-no">&nbsp;</span>
1143
+ <span class="cline-any cline-neutral">&nbsp;</span>
1144
+ <span class="cline-any cline-neutral">&nbsp;</span>
1145
+ <span class="cline-any cline-no">&nbsp;</span>
1146
+ <span class="cline-any cline-no">&nbsp;</span>
1147
+ <span class="cline-any cline-neutral">&nbsp;</span>
1148
+ <span class="cline-any cline-no">&nbsp;</span>
1149
+ <span class="cline-any cline-neutral">&nbsp;</span>
1150
+ <span class="cline-any cline-no">&nbsp;</span>
1151
+ <span class="cline-any cline-no">&nbsp;</span>
1152
+ <span class="cline-any cline-no">&nbsp;</span>
1153
+ <span class="cline-any cline-no">&nbsp;</span>
1154
+ <span class="cline-any cline-no">&nbsp;</span>
1155
+ <span class="cline-any cline-no">&nbsp;</span>
1156
+ <span class="cline-any cline-neutral">&nbsp;</span>
1157
+ <span class="cline-any cline-neutral">&nbsp;</span>
1158
+ <span class="cline-any cline-no">&nbsp;</span>
1159
+ <span class="cline-any cline-neutral">&nbsp;</span>
1160
+ <span class="cline-any cline-neutral">&nbsp;</span>
1161
+ <span class="cline-any cline-neutral">&nbsp;</span>
1162
+ <span class="cline-any cline-neutral">&nbsp;</span>
1163
+ <span class="cline-any cline-neutral">&nbsp;</span>
1164
+ <span class="cline-any cline-neutral">&nbsp;</span>
1165
+ <span class="cline-any cline-neutral">&nbsp;</span>
1166
+ <span class="cline-any cline-neutral">&nbsp;</span>
1167
+ <span class="cline-any cline-neutral">&nbsp;</span>
1168
+ <span class="cline-any cline-neutral">&nbsp;</span>
1169
+ <span class="cline-any cline-neutral">&nbsp;</span>
1170
+ <span class="cline-any cline-neutral">&nbsp;</span>
1171
+ <span class="cline-any cline-no">&nbsp;</span>
1172
+ <span class="cline-any cline-neutral">&nbsp;</span>
1173
+ <span class="cline-any cline-no">&nbsp;</span>
1174
+ <span class="cline-any cline-neutral">&nbsp;</span>
1175
+ <span class="cline-any cline-no">&nbsp;</span>
1176
+ <span class="cline-any cline-neutral">&nbsp;</span>
1177
+ <span class="cline-any cline-no">&nbsp;</span>
1178
+ <span class="cline-any cline-no">&nbsp;</span>
1179
+ <span class="cline-any cline-no">&nbsp;</span>
1180
+ <span class="cline-any cline-no">&nbsp;</span>
1181
+ <span class="cline-any cline-no">&nbsp;</span>
1182
+ <span class="cline-any cline-neutral">&nbsp;</span>
1183
+ <span class="cline-any cline-neutral">&nbsp;</span>
1184
+ <span class="cline-any cline-no">&nbsp;</span>
1185
+ <span class="cline-any cline-neutral">&nbsp;</span>
1186
+ <span class="cline-any cline-no">&nbsp;</span>
1187
+ <span class="cline-any cline-neutral">&nbsp;</span>
1188
+ <span class="cline-any cline-no">&nbsp;</span>
1189
+ <span class="cline-any cline-no">&nbsp;</span>
1190
+ <span class="cline-any cline-no">&nbsp;</span>
1191
+ <span class="cline-any cline-no">&nbsp;</span>
1192
+ <span class="cline-any cline-no">&nbsp;</span>
1193
+ <span class="cline-any cline-neutral">&nbsp;</span>
1194
+ <span class="cline-any cline-neutral">&nbsp;</span>
1195
+ <span class="cline-any cline-neutral">&nbsp;</span>
1196
+ <span class="cline-any cline-no">&nbsp;</span>
1197
+ <span class="cline-any cline-neutral">&nbsp;</span>
1198
+ <span class="cline-any cline-neutral">&nbsp;</span>
1199
+ <span class="cline-any cline-neutral">&nbsp;</span>
1200
+ <span class="cline-any cline-neutral">&nbsp;</span>
1201
+ <span class="cline-any cline-neutral">&nbsp;</span>
1202
+ <span class="cline-any cline-neutral">&nbsp;</span>
1203
+ <span class="cline-any cline-neutral">&nbsp;</span>
1204
+ <span class="cline-any cline-neutral">&nbsp;</span>
1205
+ <span class="cline-any cline-neutral">&nbsp;</span>
1206
+ <span class="cline-any cline-neutral">&nbsp;</span>
1207
+ <span class="cline-any cline-neutral">&nbsp;</span>
1208
+ <span class="cline-any cline-neutral">&nbsp;</span>
1209
+ <span class="cline-any cline-neutral">&nbsp;</span>
1210
+ <span class="cline-any cline-yes">1x</span>
1211
+ <span class="cline-any cline-neutral">&nbsp;</span>
1212
+ <span class="cline-any cline-yes">1x</span>
1213
+ <span class="cline-any cline-neutral">&nbsp;</span>
1214
+ <span class="cline-any cline-yes">1x</span>
1215
+ <span class="cline-any cline-yes">5x</span>
1216
+ <span class="cline-any cline-yes">5x</span>
1217
+ <span class="cline-any cline-neutral">&nbsp;</span>
1218
+ <span class="cline-any cline-neutral">&nbsp;</span>
1219
+ <span class="cline-any cline-yes">1x</span>
1220
+ <span class="cline-any cline-no">&nbsp;</span>
1221
+ <span class="cline-any cline-no">&nbsp;</span>
1222
+ <span class="cline-any cline-no">&nbsp;</span>
1223
+ <span class="cline-any cline-no">&nbsp;</span>
1224
+ <span class="cline-any cline-neutral">&nbsp;</span>
1225
+ <span class="cline-any cline-neutral">&nbsp;</span>
1226
+ <span class="cline-any cline-no">&nbsp;</span>
1227
+ <span class="cline-any cline-neutral">&nbsp;</span>
1228
+ <span class="cline-any cline-yes">1x</span>
1229
+ <span class="cline-any cline-neutral">&nbsp;</span>
1230
+ <span class="cline-any cline-yes">1x</span>
1231
+ <span class="cline-any cline-yes">5x</span>
1232
+ <span class="cline-any cline-neutral">&nbsp;</span>
1233
+ <span class="cline-any cline-yes">5x</span>
1234
+ <span class="cline-any cline-yes">5x</span>
1235
+ <span class="cline-any cline-yes">5x</span>
1236
+ <span class="cline-any cline-neutral">&nbsp;</span>
1237
+ <span class="cline-any cline-neutral">&nbsp;</span>
1238
+ <span class="cline-any cline-yes">1x</span>
1239
+ <span class="cline-any cline-neutral">&nbsp;</span>
1240
+ <span class="cline-any cline-neutral">&nbsp;</span>
1241
+ <span class="cline-any cline-neutral">&nbsp;</span>
1242
+ <span class="cline-any cline-neutral">&nbsp;</span>
1243
+ <span class="cline-any cline-neutral">&nbsp;</span>
1244
+ <span class="cline-any cline-neutral">&nbsp;</span>
1245
+ <span class="cline-any cline-neutral">&nbsp;</span>
1246
+ <span class="cline-any cline-neutral">&nbsp;</span>
1247
+ <span class="cline-any cline-neutral">&nbsp;</span>
1248
+ <span class="cline-any cline-neutral">&nbsp;</span>
1249
+ <span class="cline-any cline-neutral">&nbsp;</span>
1250
+ <span class="cline-any cline-neutral">&nbsp;</span>
1251
+ <span class="cline-any cline-neutral">&nbsp;</span>
1252
+ <span class="cline-any cline-yes">2x</span>
1253
+ <span class="cline-any cline-yes">2x</span>
1254
+ <span class="cline-any cline-neutral">&nbsp;</span>
1255
+ <span class="cline-any cline-yes">2x</span>
1256
+ <span class="cline-any cline-no">&nbsp;</span>
1257
+ <span class="cline-any cline-no">&nbsp;</span>
1258
+ <span class="cline-any cline-no">&nbsp;</span>
1259
+ <span class="cline-any cline-no">&nbsp;</span>
1260
+ <span class="cline-any cline-neutral">&nbsp;</span>
1261
+ <span class="cline-any cline-neutral">&nbsp;</span>
1262
+ <span class="cline-any cline-no">&nbsp;</span>
1263
+ <span class="cline-any cline-no">&nbsp;</span>
1264
+ <span class="cline-any cline-no">&nbsp;</span>
1265
+ <span class="cline-any cline-neutral">&nbsp;</span>
1266
+ <span class="cline-any cline-neutral">&nbsp;</span>
1267
+ <span class="cline-any cline-no">&nbsp;</span>
1268
+ <span class="cline-any cline-neutral">&nbsp;</span>
1269
+ <span class="cline-any cline-yes">2x</span>
1270
+ <span class="cline-any cline-yes">2x</span>
1271
+ <span class="cline-any cline-yes">32x</span>
1272
+ <span class="cline-any cline-yes">32x</span>
1273
+ <span class="cline-any cline-yes">32x</span>
1274
+ <span class="cline-any cline-yes">16x</span>
1275
+ <span class="cline-any cline-yes">16x</span>
1276
+ <span class="cline-any cline-neutral">&nbsp;</span>
1277
+ <span class="cline-any cline-neutral">&nbsp;</span>
1278
+ <span class="cline-any cline-yes">32x</span>
1279
+ <span class="cline-any cline-yes">32x</span>
1280
+ <span class="cline-any cline-neutral">&nbsp;</span>
1281
+ <span class="cline-any cline-neutral">&nbsp;</span>
1282
+ <span class="cline-any cline-neutral">&nbsp;</span>
1283
+ <span class="cline-any cline-neutral">&nbsp;</span>
1284
+ <span class="cline-any cline-yes">2x</span>
1285
+ <span class="cline-any cline-neutral">&nbsp;</span>
1286
+ <span class="cline-any cline-neutral">&nbsp;</span>
1287
+ <span class="cline-any cline-neutral">&nbsp;</span>
1288
+ <span class="cline-any cline-neutral">&nbsp;</span>
1289
+ <span class="cline-any cline-neutral">&nbsp;</span>
1290
+ <span class="cline-any cline-neutral">&nbsp;</span>
1291
+ <span class="cline-any cline-neutral">&nbsp;</span>
1292
+ <span class="cline-any cline-neutral">&nbsp;</span>
1293
+ <span class="cline-any cline-no">&nbsp;</span>
1294
+ <span class="cline-any cline-no">&nbsp;</span>
1295
+ <span class="cline-any cline-neutral">&nbsp;</span>
1296
+ <span class="cline-any cline-neutral">&nbsp;</span>
1297
+ <span class="cline-any cline-neutral">&nbsp;</span>
1298
+ <span class="cline-any cline-neutral">&nbsp;</span>
1299
+ <span class="cline-any cline-neutral">&nbsp;</span>
1300
+ <span class="cline-any cline-neutral">&nbsp;</span>
1301
+ <span class="cline-any cline-neutral">&nbsp;</span>
1302
+ <span class="cline-any cline-neutral">&nbsp;</span>
1303
+ <span class="cline-any cline-neutral">&nbsp;</span>
1304
+ <span class="cline-any cline-neutral">&nbsp;</span>
1305
+ <span class="cline-any cline-neutral">&nbsp;</span>
1306
+ <span class="cline-any cline-no">&nbsp;</span>
1307
+ <span class="cline-any cline-no">&nbsp;</span>
1308
+ <span class="cline-any cline-neutral">&nbsp;</span>
1309
+ <span class="cline-any cline-neutral">&nbsp;</span>
1310
+ <span class="cline-any cline-neutral">&nbsp;</span>
1311
+ <span class="cline-any cline-neutral">&nbsp;</span>
1312
+ <span class="cline-any cline-neutral">&nbsp;</span>
1313
+ <span class="cline-any cline-neutral">&nbsp;</span>
1314
+ <span class="cline-any cline-neutral">&nbsp;</span>
1315
+ <span class="cline-any cline-neutral">&nbsp;</span>
1316
+ <span class="cline-any cline-neutral">&nbsp;</span>
1317
+ <span class="cline-any cline-neutral">&nbsp;</span>
1318
+ <span class="cline-any cline-no">&nbsp;</span>
1319
+ <span class="cline-any cline-no">&nbsp;</span>
1320
+ <span class="cline-any cline-no">&nbsp;</span>
1321
+ <span class="cline-any cline-neutral">&nbsp;</span>
1322
+ <span class="cline-any cline-neutral">&nbsp;</span>
1323
+ <span class="cline-any cline-neutral">&nbsp;</span>
1324
+ <span class="cline-any cline-neutral">&nbsp;</span>
1325
+ <span class="cline-any cline-neutral">&nbsp;</span>
1326
+ <span class="cline-any cline-neutral">&nbsp;</span>
1327
+ <span class="cline-any cline-neutral">&nbsp;</span>
1328
+ <span class="cline-any cline-neutral">&nbsp;</span>
1329
+ <span class="cline-any cline-neutral">&nbsp;</span>
1330
+ <span class="cline-any cline-neutral">&nbsp;</span>
1331
+ <span class="cline-any cline-neutral">&nbsp;</span>
1332
+ <span class="cline-any cline-no">&nbsp;</span>
1333
+ <span class="cline-any cline-no">&nbsp;</span>
1334
+ <span class="cline-any cline-no">&nbsp;</span>
1335
+ <span class="cline-any cline-neutral">&nbsp;</span>
1336
+ <span class="cline-any cline-neutral">&nbsp;</span>
1337
+ <span class="cline-any cline-neutral">&nbsp;</span>
1338
+ <span class="cline-any cline-neutral">&nbsp;</span>
1339
+ <span class="cline-any cline-neutral">&nbsp;</span>
1340
+ <span class="cline-any cline-neutral">&nbsp;</span>
1341
+ <span class="cline-any cline-neutral">&nbsp;</span>
1342
+ <span class="cline-any cline-neutral">&nbsp;</span>
1343
+ <span class="cline-any cline-neutral">&nbsp;</span>
1344
+ <span class="cline-any cline-neutral">&nbsp;</span>
1345
+ <span class="cline-any cline-no">&nbsp;</span>
1346
+ <span class="cline-any cline-no">&nbsp;</span>
1347
+ <span class="cline-any cline-no">&nbsp;</span>
1348
+ <span class="cline-any cline-neutral">&nbsp;</span>
1349
+ <span class="cline-any cline-neutral">&nbsp;</span>
1350
+ <span class="cline-any cline-neutral">&nbsp;</span>
1351
+ <span class="cline-any cline-neutral">&nbsp;</span>
1352
+ <span class="cline-any cline-neutral">&nbsp;</span>
1353
+ <span class="cline-any cline-neutral">&nbsp;</span>
1354
+ <span class="cline-any cline-neutral">&nbsp;</span>
1355
+ <span class="cline-any cline-neutral">&nbsp;</span>
1356
+ <span class="cline-any cline-neutral">&nbsp;</span>
1357
+ <span class="cline-any cline-no">&nbsp;</span>
1358
+ <span class="cline-any cline-no">&nbsp;</span>
1359
+ <span class="cline-any cline-no">&nbsp;</span>
1360
+ <span class="cline-any cline-no">&nbsp;</span>
1361
+ <span class="cline-any cline-neutral">&nbsp;</span>
1362
+ <span class="cline-any cline-no">&nbsp;</span>
1363
+ <span class="cline-any cline-neutral">&nbsp;</span>
1364
+ <span class="cline-any cline-no">&nbsp;</span>
1365
+ <span class="cline-any cline-no">&nbsp;</span>
1366
+ <span class="cline-any cline-no">&nbsp;</span>
1367
+ <span class="cline-any cline-no">&nbsp;</span>
1368
+ <span class="cline-any cline-no">&nbsp;</span>
1369
+ <span class="cline-any cline-no">&nbsp;</span>
1370
+ <span class="cline-any cline-no">&nbsp;</span>
1371
+ <span class="cline-any cline-no">&nbsp;</span>
1372
+ <span class="cline-any cline-no">&nbsp;</span>
1373
+ <span class="cline-any cline-no">&nbsp;</span>
1374
+ <span class="cline-any cline-no">&nbsp;</span>
1375
+ <span class="cline-any cline-neutral">&nbsp;</span>
1376
+ <span class="cline-any cline-no">&nbsp;</span>
1377
+ <span class="cline-any cline-no">&nbsp;</span>
1378
+ <span class="cline-any cline-neutral">&nbsp;</span>
1379
+ <span class="cline-any cline-neutral">&nbsp;</span>
1380
+ <span class="cline-any cline-neutral">&nbsp;</span>
1381
+ <span class="cline-any cline-no">&nbsp;</span>
1382
+ <span class="cline-any cline-neutral">&nbsp;</span>
1383
+ <span class="cline-any cline-no">&nbsp;</span>
1384
+ <span class="cline-any cline-no">&nbsp;</span>
1385
+ <span class="cline-any cline-no">&nbsp;</span>
1386
+ <span class="cline-any cline-no">&nbsp;</span>
1387
+ <span class="cline-any cline-no">&nbsp;</span>
1388
+ <span class="cline-any cline-no">&nbsp;</span>
1389
+ <span class="cline-any cline-no">&nbsp;</span>
1390
+ <span class="cline-any cline-no">&nbsp;</span>
1391
+ <span class="cline-any cline-no">&nbsp;</span>
1392
+ <span class="cline-any cline-neutral">&nbsp;</span>
1393
+ <span class="cline-any cline-no">&nbsp;</span>
1394
+ <span class="cline-any cline-no">&nbsp;</span>
1395
+ <span class="cline-any cline-no">&nbsp;</span>
1396
+ <span class="cline-any cline-no">&nbsp;</span>
1397
+ <span class="cline-any cline-neutral">&nbsp;</span>
1398
+ <span class="cline-any cline-no">&nbsp;</span>
1399
+ <span class="cline-any cline-no">&nbsp;</span>
1400
+ <span class="cline-any cline-neutral">&nbsp;</span>
1401
+ <span class="cline-any cline-neutral">&nbsp;</span>
1402
+ <span class="cline-any cline-neutral">&nbsp;</span>
1403
+ <span class="cline-any cline-neutral">&nbsp;</span>
1404
+ <span class="cline-any cline-neutral">&nbsp;</span>
1405
+ <span class="cline-any cline-no">&nbsp;</span>
1406
+ <span class="cline-any cline-neutral">&nbsp;</span>
1407
+ <span class="cline-any cline-neutral">&nbsp;</span>
1408
+ <span class="cline-any cline-neutral">&nbsp;</span>
1409
+ <span class="cline-any cline-neutral">&nbsp;</span>
1410
+ <span class="cline-any cline-neutral">&nbsp;</span>
1411
+ <span class="cline-any cline-neutral">&nbsp;</span>
1412
+ <span class="cline-any cline-neutral">&nbsp;</span>
1413
+ <span class="cline-any cline-neutral">&nbsp;</span>
1414
+ <span class="cline-any cline-neutral">&nbsp;</span>
1415
+ <span class="cline-any cline-neutral">&nbsp;</span>
1416
+ <span class="cline-any cline-neutral">&nbsp;</span>
1417
+ <span class="cline-any cline-yes">1x</span>
1418
+ <span class="cline-any cline-yes">1x</span>
1419
+ <span class="cline-any cline-yes">1x</span>
1420
+ <span class="cline-any cline-yes">1x</span>
1421
+ <span class="cline-any cline-neutral">&nbsp;</span>
1422
+ <span class="cline-any cline-yes">1x</span>
1423
+ <span class="cline-any cline-no">&nbsp;</span>
1424
+ <span class="cline-any cline-no">&nbsp;</span>
1425
+ <span class="cline-any cline-no">&nbsp;</span>
1426
+ <span class="cline-any cline-neutral">&nbsp;</span>
1427
+ <span class="cline-any cline-no">&nbsp;</span>
1428
+ <span class="cline-any cline-no">&nbsp;</span>
1429
+ <span class="cline-any cline-no">&nbsp;</span>
1430
+ <span class="cline-any cline-neutral">&nbsp;</span>
1431
+ <span class="cline-any cline-neutral">&nbsp;</span>
1432
+ <span class="cline-any cline-no">&nbsp;</span>
1433
+ <span class="cline-any cline-no">&nbsp;</span>
1434
+ <span class="cline-any cline-neutral">&nbsp;</span>
1435
+ <span class="cline-any cline-yes">1x</span>
1436
+ <span class="cline-any cline-yes">1x</span>
1437
+ <span class="cline-any cline-yes">6x</span>
1438
+ <span class="cline-any cline-yes">6x</span>
1439
+ <span class="cline-any cline-yes">6x</span>
1440
+ <span class="cline-any cline-yes">6x</span>
1441
+ <span class="cline-any cline-neutral">&nbsp;</span>
1442
+ <span class="cline-any cline-yes">6x</span>
1443
+ <span class="cline-any cline-yes">6x</span>
1444
+ <span class="cline-any cline-neutral">&nbsp;</span>
1445
+ <span class="cline-any cline-neutral">&nbsp;</span>
1446
+ <span class="cline-any cline-yes">1x</span>
1447
+ <span class="cline-any cline-neutral">&nbsp;</span>
1448
+ <span class="cline-any cline-neutral">&nbsp;</span>
1449
+ <span class="cline-any cline-neutral">&nbsp;</span>
1450
+ <span class="cline-any cline-neutral">&nbsp;</span>
1451
+ <span class="cline-any cline-neutral">&nbsp;</span>
1452
+ <span class="cline-any cline-neutral">&nbsp;</span>
1453
+ <span class="cline-any cline-neutral">&nbsp;</span>
1454
+ <span class="cline-any cline-yes">3x</span>
1455
+ <span class="cline-any cline-yes">3x</span>
1456
+ <span class="cline-any cline-neutral">&nbsp;</span>
1457
+ <span class="cline-any cline-neutral">&nbsp;</span>
1458
+ <span class="cline-any cline-neutral">&nbsp;</span>
1459
+ <span class="cline-any cline-neutral">&nbsp;</span>
1460
+ <span class="cline-any cline-neutral">&nbsp;</span>
1461
+ <span class="cline-any cline-neutral">&nbsp;</span>
1462
+ <span class="cline-any cline-neutral">&nbsp;</span>
1463
+ <span class="cline-any cline-yes">71x</span>
1464
+ <span class="cline-any cline-neutral">&nbsp;</span>
1465
+ <span class="cline-any cline-neutral">&nbsp;</span>
1466
+ <span class="cline-any cline-neutral">&nbsp;</span></td><td class="text"><pre class="prettyprint lang-js">/**
1467
+ * data-structure-typed
1468
+ *
1469
+ * @author Tyler Zeng
1470
+ * @copyright Copyright (c) 2022 Tyler Zeng &lt;zrwusa@gmail.com&gt;
1471
+ * @license MIT License
1472
+ */
1473
+ import type {BinaryTreeNodeId, TreeMultisetNodeNested, TreeMultisetOptions} from '../../types';
1474
+ import {BinaryTreeDeletedResult, CP, DFSOrderPattern, FamilyPosition, LoopType} from '../../types';
1475
+ import {ITreeMultiset, ITreeMultisetNode} from '../../interfaces';
1476
+ import {AVLTree, AVLTreeNode} from './avl-tree';
1477
+ &nbsp;
1478
+ export class TreeMultisetNode&lt;T = any, NEIGHBOR extends TreeMultisetNode&lt;T, NEIGHBOR&gt; = TreeMultisetNodeNested&lt;T&gt;&gt;
1479
+ extends AVLTreeNode&lt;T, NEIGHBOR&gt;
1480
+ implements ITreeMultisetNode&lt;T, NEIGHBOR&gt;
1481
+ {
1482
+ /**
1483
+ * The constructor function initializes a BinaryTreeNode object with an id, value, and count.
1484
+ * @param {BinaryTreeNodeId} id - The `id` parameter is of type `BinaryTreeNodeId` and represents the unique identifier
1485
+ * of the binary tree node.
1486
+ * @param {T} [val] - The `val` parameter is an optional parameter of type `T`. It represents the value of the binary
1487
+ * tree node. If no value is provided, it will be `undefined`.
1488
+ * @param {number} [count=1] - The `count` parameter is a number that represents the number of times a particular value
1489
+ * occurs in a binary tree node. It has a default value of 1, which means that if no value is provided for the `count`
1490
+ * parameter when creating a new instance of the `BinaryTreeNode` class,
1491
+ */
1492
+ constructor(id: BinaryTreeNodeId, val?: T, count = <span class="branch-0 cbranch-no" title="branch not covered" >1)</span> {
1493
+ super(id, val);
1494
+ this._count = count;
1495
+ }
1496
+ &nbsp;
1497
+ private _count: number;
1498
+ &nbsp;
1499
+ get count(): number {
1500
+ return this._count;
1501
+ }
1502
+ &nbsp;
1503
+ set count(v: number) {
1504
+ this._count = v;
1505
+ }
1506
+ }
1507
+ &nbsp;
1508
+ /**
1509
+ * The only distinction between a TreeMultiset and a AVLTree lies in the ability of the former to store duplicate nodes through the utilization of counters.
1510
+ */
1511
+ export class TreeMultiset&lt;N extends TreeMultisetNode&lt;N['val'], N&gt; = TreeMultisetNode&gt;
1512
+ extends AVLTree&lt;N&gt;
1513
+ implements ITreeMultiset&lt;N&gt;
1514
+ {
1515
+ /**
1516
+ * The constructor function for a TreeMultiset class in TypeScript, which extends another class and sets an option to
1517
+ * merge duplicated values.
1518
+ * @param {TreeMultisetOptions} [options] - An optional object that contains additional configuration options for the
1519
+ * TreeMultiset.
1520
+ */
1521
+ constructor(options?: TreeMultisetOptions) {
1522
+ super({...options});
1523
+ }
1524
+ &nbsp;
1525
+ private _count = 0;
1526
+ &nbsp;
1527
+ get count(): number {
1528
+ return this._count;
1529
+ }
1530
+ &nbsp;
1531
+ /**
1532
+ * The function creates a new BSTNode with the given id, value, and count.
1533
+ * @param {BinaryTreeNodeId} id - The id parameter is the unique identifier for the binary tree node. It is used to
1534
+ * distinguish one node from another in the tree.
1535
+ * @param {N} val - The `val` parameter represents the value that will be stored in the binary search tree node.
1536
+ * @param {number} [count] - The "count" parameter is an optional parameter of type number. It represents the number of
1537
+ * occurrences of the value in the binary search tree node. If not provided, the count will default to 1.
1538
+ * @returns A new instance of the BSTNode class with the specified id, value, and count (if provided).
1539
+ */
1540
+ override createNode(id: BinaryTreeNodeId, val?: N['val'], count?: number): N {
1541
+ return new TreeMultisetNode(id, val, count) as N;
1542
+ }
1543
+ &nbsp;
1544
+ /**
1545
+ * The function swaps the location of two nodes in a tree data structure.
1546
+ * @param {N} srcNode - The source node that we want to swap with the destination node.
1547
+ * @param {N} destNode - The `destNode` parameter represents the destination node where the values from `srcNode` will
1548
+ * be swapped with.
1549
+ * @returns the `destNode` after swapping its values with the `srcNode`.
1550
+ */
1551
+ override swapLocation(srcNode: N, destNode: N): N {
1552
+ const {id, val, count, height} = destNode;
1553
+ const tempNode = this.createNode(id, val, count);
1554
+ if (tempNode) {
1555
+ tempNode.height = height;
1556
+ &nbsp;
1557
+ destNode.id = srcNode.id;
1558
+ destNode.val = srcNode.val;
1559
+ destNode.count = srcNode.count;
1560
+ destNode.height = srcNode.height;
1561
+ &nbsp;
1562
+ srcNode.id = tempNode.id;
1563
+ srcNode.val = tempNode.val;
1564
+ srcNode.count = tempNode.count;
1565
+ srcNode.height = tempNode.height;
1566
+ }
1567
+ &nbsp;
1568
+ return destNode;
1569
+ }
1570
+ &nbsp;
1571
+ /**
1572
+ * The `add` function adds a new node to a binary search tree, maintaining the tree's properties and balancing if
1573
+ * necessary.
1574
+ * @param {BinaryTreeNodeId | N} idOrNode - The `idOrNode` parameter can be either a `BinaryTreeNodeId` or a `N` (which
1575
+ * represents a `BinaryTreeNode`).
1576
+ * @param [val] - The `val` parameter represents the value to be added to the binary tree node.
1577
+ * @param {number} [count] - The `count` parameter is an optional parameter that specifies the number of times the
1578
+ * value should be added to the binary tree. If the `count` parameter is not provided, it defaults to 1.
1579
+ * @returns The method `add` returns either the inserted node (`N`), `null`, or `undefined`.
1580
+ */
1581
+ override add(idOrNode: BinaryTreeNodeId | N | null, val?: N['val'], count?: number): N | null | undefined {
1582
+ count = count ?? 1;
1583
+ let inserted: N | null | undefined = undefined,
1584
+ newNode: N | null;
1585
+ <span class="missing-if-branch" title="if path not taken" >I</span>if (idOrNode instanceof TreeMultisetNode) {
1586
+ <span class="cstat-no" title="statement not covered" > newNode = this.createNode(idOrNode.id, idOrNode.val, idOrNode.count);</span>
1587
+ } else <span class="missing-if-branch" title="if path not taken" >I</span>if (idOrNode === null) {
1588
+ <span class="cstat-no" title="statement not covered" > newNode = null;</span>
1589
+ } else {
1590
+ newNode = this.createNode(idOrNode, val, count);
1591
+ }
1592
+ if (!this.root) {
1593
+ this._setRoot(newNode);
1594
+ this._setSize(this.size + 1);
1595
+ newNode &amp;&amp; this._setCount(this.count + newNode.count);
1596
+ inserted = this.root;
1597
+ } else {
1598
+ let cur = this.root;
1599
+ let traversing = true;
1600
+ while (traversing) {
1601
+ if (cur) {
1602
+ if (newNode) {
1603
+ if (this._compare(cur.id, newNode.id) === CP.eq) {
1604
+ cur.val = newNode.val;
1605
+ cur.count += newNode.count;
1606
+ this._setCount(this.count + newNode.count);
1607
+ traversing = false;
1608
+ inserted = cur;
1609
+ } else if (this._compare(cur.id, newNode.id) === CP.gt) {
1610
+ // Traverse left of the node
1611
+ if (cur.left === undefined) {
1612
+ //Add to the left of the current node
1613
+ cur.left = newNode;
1614
+ this._setSize(this.size + 1);
1615
+ this._setCount(this.count + newNode.count);
1616
+ &nbsp;
1617
+ traversing = false;
1618
+ inserted = cur.left;
1619
+ } else {
1620
+ //Traverse the left of the current node
1621
+ if (cur.left) cur = cur.left;
1622
+ }
1623
+ } else if (this._compare(cur.id, newNode.id) === CP.lt) {
1624
+ // Traverse right of the node
1625
+ if (cur.right === undefined) {
1626
+ //Add to the right of the current node
1627
+ cur.right = newNode;
1628
+ this._setSize(this.size + 1);
1629
+ this._setCount(this.count + newNode.count);
1630
+ &nbsp;
1631
+ traversing = false;
1632
+ inserted = cur.right;
1633
+ } else {
1634
+ //Traverse the left of the current node
1635
+ if (cur.right) cur = cur.right;
1636
+ }
1637
+ }
1638
+ } else <span class="missing-if-branch" title="else path not taken" >E</span>{
1639
+ // TODO may need to support null inserted
1640
+ }
1641
+ } else <span class="missing-if-branch" title="else path not taken" >E</span>{
1642
+ <span class="cstat-no" title="statement not covered" > traversing = false;</span>
1643
+ }
1644
+ }
1645
+ }
1646
+ if (inserted) this._balancePath(inserted);
1647
+ return inserted;
1648
+ }
1649
+ &nbsp;
1650
+ /**
1651
+ * The function adds a new node to a binary tree if there is an available slot on the left or right side of the parent
1652
+ * node.
1653
+ * @param {N | null} newNode - The `newNode` parameter represents the node that needs to be added to the tree. It can
1654
+ * be either a node object (`N`) or `null`.
1655
+ * @param {N} parent - The `parent` parameter represents the parent node to which the new node will be added as a
1656
+ * child.
1657
+ * @returns The method returns either the `parent.left`, `parent.right`, or `undefined`.
1658
+ */
1659
+ override <span class="fstat-no" title="function not covered" >_addTo(</span>newNode: N | null, parent: N): N | null | undefined {
1660
+ <span class="cstat-no" title="statement not covered" > if (parent) {</span>
1661
+ <span class="cstat-no" title="statement not covered" > if (parent.left === undefined) {</span>
1662
+ <span class="cstat-no" title="statement not covered" > parent.left = newNode;</span>
1663
+ <span class="cstat-no" title="statement not covered" > <span class="missing-if-branch" title="if path not taken" >I</span>if (newNode !== null) {</span>
1664
+ <span class="cstat-no" title="statement not covered" > this._setSize(this.size + 1);</span>
1665
+ <span class="cstat-no" title="statement not covered" > this._setCount(this.count + newNode.count);</span>
1666
+ }
1667
+ &nbsp;
1668
+ <span class="cstat-no" title="statement not covered" > return parent.left;</span>
1669
+ } else <span class="cstat-no" title="statement not covered" >if (parent.right === undefined) {</span>
1670
+ <span class="cstat-no" title="statement not covered" > parent.right = newNode;</span>
1671
+ <span class="cstat-no" title="statement not covered" > <span class="missing-if-branch" title="if path not taken" >I</span>if (newNode !== null) {</span>
1672
+ <span class="cstat-no" title="statement not covered" > this._setSize(this.size + 1);</span>
1673
+ <span class="cstat-no" title="statement not covered" > this._setCount(this.count + newNode.count);</span>
1674
+ }
1675
+ <span class="cstat-no" title="statement not covered" > return parent.right;</span>
1676
+ } else {
1677
+ <span class="cstat-no" title="statement not covered" > return;</span>
1678
+ }
1679
+ } else {
1680
+ <span class="cstat-no" title="statement not covered" > return;</span>
1681
+ }
1682
+ }
1683
+ &nbsp;
1684
+ /**
1685
+ * The `addMany` function takes an array of node IDs or nodes and adds them to the tree multiset, returning an array of
1686
+ * the inserted nodes.
1687
+ * @param {(BinaryTreeNodeId | null)[] | (N | null)[]} idsOrNodes - An array of BinaryTreeNodeId or BinaryTreeNode
1688
+ * objects, or null values.
1689
+ * @param {N['val'][]} [data] - The `data` parameter is an optional array of values (`N['val'][]`) that corresponds to
1690
+ * the nodes being added. It is used when adding nodes using the `idOrNode` and `data` arguments in the `this.add()`
1691
+ * method. If provided, the `data` array should
1692
+ * @returns The function `addMany` returns an array of `N`, `null`, or `undefined` values.
1693
+ */
1694
+ override addMany(
1695
+ idsOrNodes: (BinaryTreeNodeId | null)[] | (N | null)[],
1696
+ data?: N['val'][]
1697
+ ): (N | null | undefined)[] {
1698
+ const inserted: (N | null | undefined)[] = [];
1699
+ &nbsp;
1700
+ for (let i = 0; i &lt; idsOrNodes.length; i++) {
1701
+ const idOrNode = idsOrNodes[i];
1702
+ &nbsp;
1703
+ <span class="missing-if-branch" title="if path not taken" >I</span>if (idOrNode instanceof TreeMultisetNode) {
1704
+ <span class="cstat-no" title="statement not covered" > inserted.push(this.add(idOrNode.id, idOrNode.val, idOrNode.count));</span>
1705
+ <span class="cstat-no" title="statement not covered" > continue;</span>
1706
+ }
1707
+ &nbsp;
1708
+ <span class="missing-if-branch" title="if path not taken" >I</span>if (idOrNode === null) {
1709
+ <span class="cstat-no" title="statement not covered" > inserted.push(this.add(NaN, null, 0));</span>
1710
+ <span class="cstat-no" title="statement not covered" > continue;</span>
1711
+ }
1712
+ &nbsp;
1713
+ inserted.push(this.add(idOrNode, data<span class="branch-0 cbranch-no" title="branch not covered" >?.[i</span>], 1));
1714
+ }
1715
+ return inserted;
1716
+ }
1717
+ &nbsp;
1718
+ /**
1719
+ * The `perfectlyBalance` function takes a binary tree, performs a depth-first search to sort the nodes, and then
1720
+ * constructs a balanced binary search tree using either a recursive or iterative approach.
1721
+ * @returns The function `perfectlyBalance()` returns a boolean value.
1722
+ */
1723
+ override perfectlyBalance(): boolean {
1724
+ const sorted = this.DFS('in', 'node'),
1725
+ n = sorted.length;
1726
+ <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>
1727
+ &nbsp;
1728
+ this.clear();
1729
+ &nbsp;
1730
+ <span class="missing-if-branch" title="if path not taken" >I</span>if (this.loopType === LoopType.RECURSIVE) {
1731
+ 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>
1732
+ <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>
1733
+ const m = <span class="cstat-no" title="statement not covered" >l + Math.floor((r - l) / 2);</span>
1734
+ const midNode = <span class="cstat-no" title="statement not covered" >sorted[m];</span>
1735
+ <span class="cstat-no" title="statement not covered" > this.add(midNode.id, midNode.val, midNode.count);</span>
1736
+ <span class="cstat-no" title="statement not covered" > buildBalanceBST(l, m - 1);</span>
1737
+ <span class="cstat-no" title="statement not covered" > buildBalanceBST(m + 1, r);</span>
1738
+ };
1739
+ &nbsp;
1740
+ <span class="cstat-no" title="statement not covered" > buildBalanceBST(0, n - 1);</span>
1741
+ <span class="cstat-no" title="statement not covered" > return true;</span>
1742
+ } else {
1743
+ const stack: [[number, number]] = [[0, n - 1]];
1744
+ while (stack.length &gt; 0) {
1745
+ const popped = stack.pop();
1746
+ if (popped) {
1747
+ const [l, r] = popped;
1748
+ if (l &lt;= r) {
1749
+ const m = l + Math.floor((r - l) / 2);
1750
+ const midNode = sorted[m];
1751
+ this.add(midNode.id, midNode.val, midNode.count);
1752
+ stack.push([m + 1, r]);
1753
+ stack.push([l, m - 1]);
1754
+ }
1755
+ }
1756
+ }
1757
+ return true;
1758
+ }
1759
+ }
1760
+ &nbsp;
1761
+ /**
1762
+ * The `remove` function removes a node from a binary search tree and returns the deleted node along with the parent
1763
+ * node that needs to be balanced.
1764
+ * @param {N | BinaryTreeNodeId | null} nodeOrId - The `nodeOrId` parameter can be one of the following:
1765
+ * @param {boolean} [ignoreCount] - The `ignoreCount` parameter is an optional boolean parameter that determines
1766
+ * whether to ignore the count of the node being removed. If `ignoreCount` is set to `true`, the count of the node will
1767
+ * not be taken into account when removing it. If `ignoreCount` is set to `false
1768
+ * @returns The function `remove` returns an array of `BinaryTreeDeletedResult&lt;N&gt;` objects.
1769
+ */
1770
+ override remove(nodeOrId: N | BinaryTreeNodeId, ignoreCount?: boolean): BinaryTreeDeletedResult&lt;N&gt;[] {
1771
+ const bstDeletedResult: BinaryTreeDeletedResult&lt;N&gt;[] = [];
1772
+ <span class="missing-if-branch" title="if path not taken" >I</span>if (!this.root) <span class="cstat-no" title="statement not covered" >return bstDeletedResult;</span>
1773
+ &nbsp;
1774
+ const curr: N | null = this.get(nodeOrId);
1775
+ if (!curr) return bstDeletedResult;
1776
+ &nbsp;
1777
+ const parent: N | null = curr<span class="branch-0 cbranch-no" title="branch not covered" >?.p</span>arent ? curr.parent : null;
1778
+ let needBalanced: N | null = null,
1779
+ orgCurrent = curr;
1780
+ &nbsp;
1781
+ <span class="missing-if-branch" title="if path not taken" >I</span>if (curr.count &gt; 1 &amp;&amp; !ignoreCount) {
1782
+ <span class="cstat-no" title="statement not covered" > curr.count--;</span>
1783
+ <span class="cstat-no" title="statement not covered" > this._setCount(this.count - 1);</span>
1784
+ } else {
1785
+ if (!curr.left) {
1786
+ <span class="missing-if-branch" title="if path not taken" >I</span>if (!parent) {
1787
+ <span class="cstat-no" title="statement not covered" > <span class="missing-if-branch" title="if path not taken" >I</span>if (curr.right !== undefined) <span class="cstat-no" title="statement not covered" >this._setRoot(curr.right);</span></span>
1788
+ } else {
1789
+ const {familyPosition: fp} = curr;
1790
+ if (fp === FamilyPosition.LEFT || fp === FamilyPosition.ROOT_LEFT) {
1791
+ parent.left = curr.right;
1792
+ } else if (fp === FamilyPosition.RIGHT || fp === FamilyPosition.ROOT_RIGHT) {
1793
+ parent.right = curr.right;
1794
+ }
1795
+ needBalanced = parent;
1796
+ }
1797
+ } else {
1798
+ const leftSubTreeRightMost = curr.left ? this.getRightMost(curr.left) : <span class="branch-1 cbranch-no" title="branch not covered" >null;</span>
1799
+ if (leftSubTreeRightMost) {
1800
+ const parentOfLeftSubTreeMax = leftSubTreeRightMost.parent;
1801
+ orgCurrent = this.swapLocation(curr, leftSubTreeRightMost);
1802
+ if (parentOfLeftSubTreeMax) {
1803
+ if (parentOfLeftSubTreeMax.right === leftSubTreeRightMost) {
1804
+ parentOfLeftSubTreeMax.right = leftSubTreeRightMost.left;
1805
+ } else {
1806
+ parentOfLeftSubTreeMax.left = leftSubTreeRightMost.left;
1807
+ }
1808
+ needBalanced = parentOfLeftSubTreeMax;
1809
+ }
1810
+ }
1811
+ }
1812
+ this._setSize(this.size - 1);
1813
+ // TODO How to handle when the count of target node is lesser than current node's count
1814
+ this._setCount(this.count - orgCurrent.count);
1815
+ }
1816
+ &nbsp;
1817
+ bstDeletedResult.push({deleted: orgCurrent, needBalanced});
1818
+ &nbsp;
1819
+ if (needBalanced) {
1820
+ this._balancePath(needBalanced);
1821
+ }
1822
+ &nbsp;
1823
+ return bstDeletedResult;
1824
+ }
1825
+ &nbsp;
1826
+ /**
1827
+ * The function `getSubTreeCount` calculates the number of nodes and the sum of their counts in a subtree, using either
1828
+ * recursive or iterative traversal.
1829
+ * @param {N | null | undefined} subTreeRoot - The `subTreeRoot` parameter represents the root node of a subtree in a
1830
+ * binary tree.
1831
+ * @returns The function `getSubTreeCount` returns an array `[number, number]`.
1832
+ */
1833
+ <span class="fstat-no" title="function not covered" > getSubTreeCount(</span>subTreeRoot: N | null | undefined) {
1834
+ const res: [number, number] = <span class="cstat-no" title="statement not covered" >[0, 0];</span>
1835
+ <span class="cstat-no" title="statement not covered" > <span class="missing-if-branch" title="if path not taken" >I</span>if (!subTreeRoot) <span class="cstat-no" title="statement not covered" >return res;</span></span>
1836
+ &nbsp;
1837
+ <span class="cstat-no" title="statement not covered" > if (this.loopType === LoopType.RECURSIVE) {</span>
1838
+ const _traverse = <span class="cstat-no" title="statement not covered" ><span class="fstat-no" title="function not covered" >(c</span>ur: N) =&gt; {</span>
1839
+ <span class="cstat-no" title="statement not covered" > res[0]++;</span>
1840
+ <span class="cstat-no" title="statement not covered" > res[1] += cur.count;</span>
1841
+ <span class="cstat-no" title="statement not covered" > cur.left &amp;&amp; _traverse(cur.left);</span>
1842
+ <span class="cstat-no" title="statement not covered" > cur.right &amp;&amp; _traverse(cur.right);</span>
1843
+ };
1844
+ &nbsp;
1845
+ <span class="cstat-no" title="statement not covered" > _traverse(subTreeRoot);</span>
1846
+ <span class="cstat-no" title="statement not covered" > return res;</span>
1847
+ } else {
1848
+ const stack: N[] = <span class="cstat-no" title="statement not covered" >[subTreeRoot];</span>
1849
+ &nbsp;
1850
+ <span class="cstat-no" title="statement not covered" > while (stack.length &gt; 0) {</span>
1851
+ const cur = <span class="cstat-no" title="statement not covered" >stack.pop()!;</span>
1852
+ <span class="cstat-no" title="statement not covered" > res[0]++;</span>
1853
+ <span class="cstat-no" title="statement not covered" > res[1] += cur.count;</span>
1854
+ <span class="cstat-no" title="statement not covered" > cur.right &amp;&amp; stack.push(cur.right);</span>
1855
+ <span class="cstat-no" title="statement not covered" > cur.left &amp;&amp; stack.push(cur.left);</span>
1856
+ }
1857
+ &nbsp;
1858
+ <span class="cstat-no" title="statement not covered" > return res;</span>
1859
+ }
1860
+ }
1861
+ &nbsp;
1862
+ /**
1863
+ * The function `subTreeSumCount` calculates the sum of the `count` property of each node in a subtree, either
1864
+ * recursively or iteratively.
1865
+ * @param {N | BinaryTreeNodeId | null} subTreeRoot - The `subTreeRoot` parameter represents the root node of a subtree
1866
+ * in a binary tree. It can be either a `BinaryTreeNodeId` (a unique identifier for a node in the binary tree) or
1867
+ * `null` if the subtree is empty.
1868
+ * @returns the sum of the count values of all nodes in the subtree rooted at `subTreeRoot`.
1869
+ */
1870
+ <span class="fstat-no" title="function not covered" > subTreeSumCount(</span>subTreeRoot: N | BinaryTreeNodeId | null): number {
1871
+ <span class="cstat-no" title="statement not covered" > <span class="missing-if-branch" title="if path not taken" >I</span>if (typeof subTreeRoot === 'number') <span class="cstat-no" title="statement not covered" >subTreeRoot = this.get(subTreeRoot, 'id');</span></span>
1872
+ &nbsp;
1873
+ <span class="cstat-no" title="statement not covered" > <span class="missing-if-branch" title="if path not taken" >I</span>if (!subTreeRoot) <span class="cstat-no" title="statement not covered" >return 0;</span></span>
1874
+ &nbsp;
1875
+ let sum = <span class="cstat-no" title="statement not covered" >0;</span>
1876
+ &nbsp;
1877
+ <span class="cstat-no" title="statement not covered" > if (this.loopType === LoopType.RECURSIVE) {</span>
1878
+ 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>
1879
+ <span class="cstat-no" title="statement not covered" > sum += cur.count;</span>
1880
+ <span class="cstat-no" title="statement not covered" > cur.left &amp;&amp; _traverse(cur.left);</span>
1881
+ <span class="cstat-no" title="statement not covered" > cur.right &amp;&amp; _traverse(cur.right);</span>
1882
+ };
1883
+ &nbsp;
1884
+ <span class="cstat-no" title="statement not covered" > _traverse(subTreeRoot);</span>
1885
+ } else {
1886
+ const stack: N[] = <span class="cstat-no" title="statement not covered" >[subTreeRoot];</span>
1887
+ &nbsp;
1888
+ <span class="cstat-no" title="statement not covered" > while (stack.length &gt; 0) {</span>
1889
+ const cur = <span class="cstat-no" title="statement not covered" >stack.pop()!;</span>
1890
+ <span class="cstat-no" title="statement not covered" > sum += cur.count;</span>
1891
+ <span class="cstat-no" title="statement not covered" > cur.right &amp;&amp; stack.push(cur.right);</span>
1892
+ <span class="cstat-no" title="statement not covered" > cur.left &amp;&amp; stack.push(cur.left);</span>
1893
+ }
1894
+ }
1895
+ &nbsp;
1896
+ <span class="cstat-no" title="statement not covered" > return sum;</span>
1897
+ }
1898
+ &nbsp;
1899
+ /**
1900
+ * The function `subTreeAddCount` recursively or iteratively traverses a binary tree and adds a given delta value to
1901
+ * the `count` property of each node.
1902
+ * @param {N | BinaryTreeNodeId | null} subTreeRoot - The `subTreeRoot` parameter represents the root node of a subtree
1903
+ * in a binary tree. It can be either a `BinaryTreeNodeId` (a unique identifier for a node in the binary tree), a
1904
+ * `BinaryTreeNode` object, or `null` if the subtree is empty.
1905
+ * @param {number} delta - The delta parameter is a number that represents the amount by which the count of each node
1906
+ * in the subtree should be increased or decreased.
1907
+ * @returns a boolean value.
1908
+ */
1909
+ subTreeAddCount(subTreeRoot: N | BinaryTreeNodeId | null, delta: number): boolean {
1910
+ if (typeof subTreeRoot === 'number') subTreeRoot = this.get(subTreeRoot, 'id');
1911
+ &nbsp;
1912
+ <span class="missing-if-branch" title="if path not taken" >I</span>if (!subTreeRoot) <span class="cstat-no" title="statement not covered" >return false;</span>
1913
+ &nbsp;
1914
+ const _addByProperty = (cur: N) =&gt; {
1915
+ cur.count += delta;
1916
+ this._setCount(this.count + delta);
1917
+ };
1918
+ &nbsp;
1919
+ <span class="missing-if-branch" title="if path not taken" >I</span>if (this.loopType === LoopType.RECURSIVE) {
1920
+ const _traverse = <span class="cstat-no" title="statement not covered" ><span class="fstat-no" title="function not covered" >(c</span>ur: N) =&gt; {</span>
1921
+ <span class="cstat-no" title="statement not covered" > _addByProperty(cur);</span>
1922
+ <span class="cstat-no" title="statement not covered" > cur.left &amp;&amp; _traverse(cur.left);</span>
1923
+ <span class="cstat-no" title="statement not covered" > cur.right &amp;&amp; _traverse(cur.right);</span>
1924
+ };
1925
+ &nbsp;
1926
+ <span class="cstat-no" title="statement not covered" > _traverse(subTreeRoot);</span>
1927
+ } else {
1928
+ const stack: N[] = [subTreeRoot];
1929
+ &nbsp;
1930
+ while (stack.length &gt; 0) {
1931
+ const cur = stack.pop()!;
1932
+ &nbsp;
1933
+ _addByProperty(cur);
1934
+ cur.right &amp;&amp; stack.push(cur.right);
1935
+ cur.left &amp;&amp; stack.push(cur.left);
1936
+ }
1937
+ }
1938
+ return true;
1939
+ }
1940
+ &nbsp;
1941
+ /**
1942
+ * The function `getNodesByCount` returns an array of nodes that have a specific count property, either recursively or
1943
+ * using a queue.
1944
+ * @param {BinaryTreeNodeId | N} nodeProperty - The `nodeProperty` parameter can be either a `BinaryTreeNodeId` or a
1945
+ * `N`. It represents the property of the nodes that you want to search for.
1946
+ * @param {boolean} [onlyOne] - The `onlyOne` parameter is an optional boolean parameter that determines whether to
1947
+ * return only one node that matches the `nodeProperty` or all nodes that match the `nodeProperty`. If `onlyOne` is set
1948
+ * to `true`, the function will return only one node. If `onlyOne`
1949
+ * @returns an array of nodes that match the given nodeProperty.
1950
+ */
1951
+ getNodesByCount(nodeProperty: BinaryTreeNodeId | N, onlyOne?: boolean): N[] {
1952
+ <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>
1953
+ const result: N[] = [];
1954
+ &nbsp;
1955
+ <span class="missing-if-branch" title="if path not taken" >I</span>if (this.loopType === LoopType.RECURSIVE) {
1956
+ const _traverse = <span class="cstat-no" title="statement not covered" ><span class="fstat-no" title="function not covered" >(c</span>ur: N) =&gt; {</span>
1957
+ <span class="cstat-no" title="statement not covered" > <span class="missing-if-branch" title="if path not taken" >I</span>if (cur.count === nodeProperty) {</span>
1958
+ <span class="cstat-no" title="statement not covered" > result.push(cur);</span>
1959
+ <span class="cstat-no" title="statement not covered" > <span class="missing-if-branch" title="if path not taken" >I</span>if (onlyOne) <span class="cstat-no" title="statement not covered" >return;</span></span>
1960
+ }
1961
+ &nbsp;
1962
+ <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>
1963
+ <span class="cstat-no" title="statement not covered" > cur.left &amp;&amp; _traverse(cur.left);</span>
1964
+ <span class="cstat-no" title="statement not covered" > cur.right &amp;&amp; _traverse(cur.right);</span>
1965
+ };
1966
+ &nbsp;
1967
+ <span class="cstat-no" title="statement not covered" > _traverse(this.root);</span>
1968
+ } else {
1969
+ const queue: N[] = [this.root];
1970
+ while (queue.length &gt; 0) {
1971
+ const cur = queue.shift();
1972
+ if (cur) {
1973
+ if (cur.count === nodeProperty) {
1974
+ result.push(cur);
1975
+ <span class="missing-if-branch" title="if path not taken" >I</span>if (onlyOne) <span class="cstat-no" title="statement not covered" >return result;</span>
1976
+ }
1977
+ &nbsp;
1978
+ cur.left &amp;&amp; queue.push(cur.left);
1979
+ cur.right &amp;&amp; queue.push(cur.right);
1980
+ }
1981
+ }
1982
+ }
1983
+ &nbsp;
1984
+ return result;
1985
+ }
1986
+ &nbsp;
1987
+ /**
1988
+ * The BFSCount function returns an array of counts from a breadth-first search of nodes.
1989
+ * @returns The BFSCount() function returns an array of numbers, specifically the count property of each node in the
1990
+ * BFS traversal.
1991
+ */
1992
+ <span class="fstat-no" title="function not covered" > BFSCount(</span>): number[] {
1993
+ const nodes = <span class="cstat-no" title="statement not covered" >super.BFS('node');</span>
1994
+ <span class="cstat-no" title="statement not covered" > return nodes.map(<span class="fstat-no" title="function not covered" >node </span>=&gt; <span class="cstat-no" title="statement not covered" >node.count)</span>;</span>
1995
+ }
1996
+ &nbsp;
1997
+ /**
1998
+ * The function "listLevelsCount" takes a node and returns an array of arrays, where each inner array contains the
1999
+ * count property of each node at that level.
2000
+ * @param {N | null} node - The parameter `node` is of type `N | null`. This means that it can either be an instance of
2001
+ * the class `N` or `null`.
2002
+ * @returns a 2D array of numbers. Each inner array represents a level in the binary tree, and each number in the inner
2003
+ * array represents the count property of a node in that level.
2004
+ */
2005
+ <span class="fstat-no" title="function not covered" > listLevelsCount(</span>node: N | null): number[][] {
2006
+ const levels = <span class="cstat-no" title="statement not covered" >super.listLevels(node, 'node');</span>
2007
+ <span class="cstat-no" title="statement not covered" > return levels.map(<span class="fstat-no" title="function not covered" >level </span>=&gt; <span class="cstat-no" title="statement not covered" >level.map(<span class="fstat-no" title="function not covered" >node </span>=&gt; <span class="cstat-no" title="statement not covered" >node.count)</span>)</span>;</span>
2008
+ }
2009
+ &nbsp;
2010
+ /**
2011
+ * The `morrisCount` function returns an array of counts for each node in a binary tree, based on a specified traversal
2012
+ * pattern.
2013
+ * @param {'in' | 'pre' | 'post'} [pattern] - The `pattern` parameter is an optional parameter that specifies the
2014
+ * traversal pattern for the Morris traversal algorithm. It can have one of three values: 'in', 'pre', or 'post'.
2015
+ * @returns The function `morrisCount` returns an array of numbers.
2016
+ */
2017
+ <span class="fstat-no" title="function not covered" > morrisCount(</span>pattern?: 'in' | 'pre' | 'post'): number[] {
2018
+ <span class="cstat-no" title="statement not covered" > pattern = pattern || 'in';</span>
2019
+ const nodes = <span class="cstat-no" title="statement not covered" >super.morris(pattern, 'node');</span>
2020
+ <span class="cstat-no" title="statement not covered" > return nodes.map(<span class="fstat-no" title="function not covered" >node </span>=&gt; <span class="cstat-no" title="statement not covered" >node.count)</span>;</span>
2021
+ }
2022
+ &nbsp;
2023
+ /**
2024
+ * The function DFSIterativeCount performs an iterative depth-first search and returns an array of node counts based on
2025
+ * the specified traversal pattern.
2026
+ * @param {'in' | 'pre' | 'post'} [pattern] - The pattern parameter is a string that specifies the traversal order for
2027
+ * the Depth-First Search (DFS) algorithm. It can have three possible values: 'in', 'pre', or 'post'.
2028
+ * @returns The DFSIterativeCount function returns an array of numbers, which represents the count property of each node
2029
+ * in the DFS traversal.
2030
+ */
2031
+ <span class="fstat-no" title="function not covered" > DFSIterativeCount(</span>pattern?: 'in' | 'pre' | 'post'): number[] {
2032
+ <span class="cstat-no" title="statement not covered" > pattern = pattern ?? 'in';</span>
2033
+ const nodes = <span class="cstat-no" title="statement not covered" >super.DFSIterative(pattern, 'node');</span>
2034
+ <span class="cstat-no" title="statement not covered" > return nodes.map(<span class="fstat-no" title="function not covered" >node </span>=&gt; <span class="cstat-no" title="statement not covered" >node.count)</span>;</span>
2035
+ }
2036
+ &nbsp;
2037
+ /**
2038
+ * The DFSCount function returns an array of counts for each node in a depth-first search traversal.
2039
+ * @param {DFSOrderPattern} [pattern] - The pattern parameter is an optional parameter that specifies the order in which
2040
+ * the Depth-First Search (DFS) algorithm should traverse the nodes. It can have one of the following values:
2041
+ * @returns The DFSCount function returns an array of numbers, specifically the count property of each node in the DFS
2042
+ * traversal.
2043
+ */
2044
+ <span class="fstat-no" title="function not covered" > DFSCount(</span>pattern?: DFSOrderPattern): number[] {
2045
+ <span class="cstat-no" title="statement not covered" > pattern = pattern ?? 'in';</span>
2046
+ const nodes = <span class="cstat-no" title="statement not covered" >super.DFS(pattern, 'node');</span>
2047
+ <span class="cstat-no" title="statement not covered" > return nodes.map(<span class="fstat-no" title="function not covered" >node </span>=&gt; <span class="cstat-no" title="statement not covered" >node.count)</span>;</span>
2048
+ }
2049
+ &nbsp;
2050
+ /**
2051
+ * The `lesserSumCount` function calculates the sum of the counts of all nodes in a binary tree that have a lesser
2052
+ * value than a given node.
2053
+ * @param {N | BinaryTreeNodeId | null} beginNode - The `beginNode` parameter can be one of the following:
2054
+ * @returns the sum of the counts of nodes in the binary tree that have a lesser value than the given beginNode.
2055
+ */
2056
+ <span class="fstat-no" title="function not covered" > lesserSumCount(</span>beginNode: N | BinaryTreeNodeId | null): number {
2057
+ <span class="cstat-no" title="statement not covered" > <span class="missing-if-branch" title="if path not taken" >I</span>if (typeof beginNode === 'number') <span class="cstat-no" title="statement not covered" >beginNode = this.get(beginNode, 'id');</span></span>
2058
+ <span class="cstat-no" title="statement not covered" > <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>
2059
+ <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 0;</span></span>
2060
+ const id = <span class="cstat-no" title="statement not covered" >beginNode.id;</span>
2061
+ &nbsp;
2062
+ let sum = <span class="cstat-no" title="statement not covered" >0;</span>
2063
+ &nbsp;
2064
+ <span class="cstat-no" title="statement not covered" > if (this.loopType === LoopType.RECURSIVE) {</span>
2065
+ 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>
2066
+ const compared = <span class="cstat-no" title="statement not covered" >this._compare(cur.id, id);</span>
2067
+ <span class="cstat-no" title="statement not covered" > if (compared === CP.eq) {</span>
2068
+ <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.subTreeSumCount(cur.right);</span></span>
2069
+ <span class="cstat-no" title="statement not covered" > return;</span>
2070
+ } else <span class="cstat-no" title="statement not covered" >if (compared === CP.lt) {</span>
2071
+ <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.subTreeSumCount(cur.left);</span></span>
2072
+ <span class="cstat-no" title="statement not covered" > sum += cur.count;</span>
2073
+ <span class="cstat-no" title="statement not covered" > if (cur.right) <span class="cstat-no" title="statement not covered" >_traverse(cur.right);</span></span>
2074
+ else <span class="cstat-no" title="statement not covered" >return;</span>
2075
+ } else {
2076
+ <span class="cstat-no" title="statement not covered" > if (cur.left) <span class="cstat-no" title="statement not covered" >_traverse(cur.left);</span></span>
2077
+ else <span class="cstat-no" title="statement not covered" >return;</span>
2078
+ }
2079
+ };
2080
+ &nbsp;
2081
+ <span class="cstat-no" title="statement not covered" > _traverse(this.root);</span>
2082
+ } else {
2083
+ const queue: N[] = <span class="cstat-no" title="statement not covered" >[this.root];</span>
2084
+ <span class="cstat-no" title="statement not covered" > while (queue.length &gt; 0) {</span>
2085
+ const cur = <span class="cstat-no" title="statement not covered" >queue.shift();</span>
2086
+ <span class="cstat-no" title="statement not covered" > <span class="missing-if-branch" title="if path not taken" >I</span>if (cur) {</span>
2087
+ const compared = <span class="cstat-no" title="statement not covered" >this._compare(cur.id, id);</span>
2088
+ <span class="cstat-no" title="statement not covered" > if (compared === CP.eq) {</span>
2089
+ <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.subTreeSumCount(cur.right);</span></span>
2090
+ <span class="cstat-no" title="statement not covered" > return sum;</span>
2091
+ } else <span class="cstat-no" title="statement not covered" >if (compared === CP.lt) {</span>
2092
+ // todo maybe a bug
2093
+ <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.subTreeSumCount(cur.left);</span></span>
2094
+ <span class="cstat-no" title="statement not covered" > sum += cur.count;</span>
2095
+ <span class="cstat-no" title="statement not covered" > if (cur.right) <span class="cstat-no" title="statement not covered" >queue.push(cur.right);</span></span>
2096
+ else <span class="cstat-no" title="statement not covered" >return sum;</span>
2097
+ } else {
2098
+ <span class="cstat-no" title="statement not covered" > if (cur.left) <span class="cstat-no" title="statement not covered" >queue.push(cur.left);</span></span>
2099
+ else <span class="cstat-no" title="statement not covered" >return sum;</span>
2100
+ }
2101
+ }
2102
+ }
2103
+ }
2104
+ &nbsp;
2105
+ <span class="cstat-no" title="statement not covered" > return sum;</span>
2106
+ }
2107
+ &nbsp;
2108
+ /**
2109
+ * The function `allGreaterNodesAddCount` updates the count property of all nodes in a binary tree that have an ID
2110
+ * greater than a given ID by a specified delta value.
2111
+ * @param {N | BinaryTreeNodeId | null} node - The `node` parameter can be one of the following:
2112
+ * @param {number} delta - The `delta` parameter is a number that represents the amount by which the `count` property
2113
+ * of each node should be increased.
2114
+ * @returns a boolean value.
2115
+ */
2116
+ allGreaterNodesAddCount(node: N | BinaryTreeNodeId | null, delta: number): boolean {
2117
+ if (typeof node === 'number') node = this.get(node, 'id');
2118
+ <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>
2119
+ const id = node.id;
2120
+ <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>
2121
+ &nbsp;
2122
+ <span class="missing-if-branch" title="if path not taken" >I</span>if (this.loopType === LoopType.RECURSIVE) {
2123
+ const _traverse = <span class="cstat-no" title="statement not covered" ><span class="fstat-no" title="function not covered" >(c</span>ur: N) =&gt; {</span>
2124
+ const compared = <span class="cstat-no" title="statement not covered" >this._compare(cur.id, id);</span>
2125
+ <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" >cur.count += delta;</span></span>
2126
+ &nbsp;
2127
+ <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>
2128
+ <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>
2129
+ <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>
2130
+ };
2131
+ &nbsp;
2132
+ <span class="cstat-no" title="statement not covered" > _traverse(this.root);</span>
2133
+ <span class="cstat-no" title="statement not covered" > return true;</span>
2134
+ } else {
2135
+ const queue: N[] = [this.root];
2136
+ while (queue.length &gt; 0) {
2137
+ const cur = queue.shift();
2138
+ if (cur) {
2139
+ const compared = this._compare(cur.id, id);
2140
+ if (compared === CP.gt) cur.count += delta;
2141
+ &nbsp;
2142
+ if (cur.left &amp;&amp; this._compare(cur.left.id, id) === CP.gt) queue.push(cur.left);
2143
+ if (cur.right &amp;&amp; this._compare(cur.right.id, id) === CP.gt) queue.push(cur.right);
2144
+ }
2145
+ }
2146
+ return true;
2147
+ }
2148
+ }
2149
+ &nbsp;
2150
+ /**
2151
+ * The clear() function clears the data and sets the count to 0.
2152
+ */
2153
+ clear() {
2154
+ super.clear();
2155
+ this._setCount(0);
2156
+ }
2157
+ &nbsp;
2158
+ /**
2159
+ * The function "_setCount" is used to set the value of the "_count" property.
2160
+ * @param {number} v - number
2161
+ */
2162
+ protected _setCount(v: number) {
2163
+ this._count = v;
2164
+ }
2165
+ }
2166
+ &nbsp;</pre></td></tr></table></pre>
2167
+
2168
+ <div class='push'></div><!-- for sticky footer -->
2169
+ </div><!-- /wrapper -->
2170
+ <div class='footer quiet pad2 space-top1 center small'>
2171
+ Code coverage generated by
2172
+ <a href="https://istanbul.js.org/" target="_blank" rel="noopener noreferrer">istanbul</a>
2173
+ at 2023-09-22T02:56:27.987Z
2174
+ </div>
2175
+ <script src="../../../prettify.js"></script>
2176
+ <script>
2177
+ window.onload = function () {
2178
+ prettyPrint();
2179
+ };
2180
+ </script>
2181
+ <script src="../../../sorter.js"></script>
2182
+ <script src="../../../block-navigation.js"></script>
2183
+ </body>
2184
+ </html>
2185
+