data-structure-typed 2.6.1 → 2.6.2

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (116) hide show
  1. package/CHANGELOG.md +9 -1
  2. package/dist/cjs/binary-tree.cjs +2927 -23688
  3. package/dist/cjs/graph.cjs +845 -2634
  4. package/dist/cjs/hash.cjs +185 -616
  5. package/dist/cjs/heap.cjs +266 -818
  6. package/dist/cjs/index.cjs +5116 -31358
  7. package/dist/cjs/linked-list.cjs +644 -2615
  8. package/dist/cjs/matrix.cjs +220 -535
  9. package/dist/cjs/priority-queue.cjs +266 -818
  10. package/dist/cjs/queue.cjs +637 -2343
  11. package/dist/cjs/stack.cjs +124 -530
  12. package/dist/cjs/trie.cjs +145 -592
  13. package/dist/cjs-legacy/binary-tree.cjs +4352 -25113
  14. package/dist/cjs-legacy/graph.cjs +847 -2636
  15. package/dist/cjs-legacy/hash.cjs +181 -612
  16. package/dist/cjs-legacy/heap.cjs +266 -818
  17. package/dist/cjs-legacy/index.cjs +6657 -32899
  18. package/dist/cjs-legacy/linked-list.cjs +640 -2611
  19. package/dist/cjs-legacy/matrix.cjs +220 -535
  20. package/dist/cjs-legacy/priority-queue.cjs +266 -818
  21. package/dist/cjs-legacy/queue.cjs +634 -2340
  22. package/dist/cjs-legacy/stack.cjs +124 -530
  23. package/dist/cjs-legacy/trie.cjs +145 -592
  24. package/dist/esm/binary-tree.mjs +2927 -23688
  25. package/dist/esm/graph.mjs +845 -2634
  26. package/dist/esm/hash.mjs +185 -616
  27. package/dist/esm/heap.mjs +266 -818
  28. package/dist/esm/index.mjs +5116 -31358
  29. package/dist/esm/linked-list.mjs +644 -2615
  30. package/dist/esm/matrix.mjs +220 -535
  31. package/dist/esm/priority-queue.mjs +266 -818
  32. package/dist/esm/queue.mjs +637 -2343
  33. package/dist/esm/stack.mjs +124 -530
  34. package/dist/esm/trie.mjs +145 -592
  35. package/dist/esm-legacy/binary-tree.mjs +4352 -25113
  36. package/dist/esm-legacy/graph.mjs +847 -2636
  37. package/dist/esm-legacy/hash.mjs +181 -612
  38. package/dist/esm-legacy/heap.mjs +266 -818
  39. package/dist/esm-legacy/index.mjs +6657 -32899
  40. package/dist/esm-legacy/linked-list.mjs +640 -2611
  41. package/dist/esm-legacy/matrix.mjs +220 -535
  42. package/dist/esm-legacy/priority-queue.mjs +266 -818
  43. package/dist/esm-legacy/queue.mjs +634 -2340
  44. package/dist/esm-legacy/stack.mjs +124 -530
  45. package/dist/esm-legacy/trie.mjs +145 -592
  46. package/dist/types/data-structures/binary-tree/avl-tree.d.ts +29 -500
  47. package/dist/types/data-structures/binary-tree/binary-indexed-tree.d.ts +38 -563
  48. package/dist/types/data-structures/binary-tree/binary-tree.d.ts +230 -1212
  49. package/dist/types/data-structures/binary-tree/bst.d.ts +124 -1063
  50. package/dist/types/data-structures/binary-tree/red-black-tree.d.ts +99 -854
  51. package/dist/types/data-structures/binary-tree/segment-tree.d.ts +62 -314
  52. package/dist/types/data-structures/binary-tree/tree-map.d.ts +366 -5057
  53. package/dist/types/data-structures/binary-tree/tree-multi-map.d.ts +277 -4885
  54. package/dist/types/data-structures/binary-tree/tree-multi-set.d.ts +253 -3929
  55. package/dist/types/data-structures/binary-tree/tree-set.d.ts +261 -4782
  56. package/dist/types/data-structures/graph/abstract-graph.d.ts +44 -44
  57. package/dist/types/data-structures/graph/directed-graph.d.ts +130 -527
  58. package/dist/types/data-structures/graph/undirected-graph.d.ts +125 -482
  59. package/dist/types/data-structures/hash/hash-map.d.ts +132 -562
  60. package/dist/types/data-structures/heap/heap.d.ts +194 -746
  61. package/dist/types/data-structures/linked-list/doubly-linked-list.d.ts +120 -809
  62. package/dist/types/data-structures/linked-list/singly-linked-list.d.ts +121 -733
  63. package/dist/types/data-structures/linked-list/skip-linked-list.d.ts +193 -863
  64. package/dist/types/data-structures/matrix/matrix.d.ts +159 -474
  65. package/dist/types/data-structures/priority-queue/max-priority-queue.d.ts +1 -6
  66. package/dist/types/data-structures/priority-queue/min-priority-queue.d.ts +6 -11
  67. package/dist/types/data-structures/priority-queue/priority-queue.d.ts +1 -1
  68. package/dist/types/data-structures/queue/deque.d.ts +196 -804
  69. package/dist/types/data-structures/queue/queue.d.ts +99 -585
  70. package/dist/types/data-structures/stack/stack.d.ts +75 -481
  71. package/dist/types/data-structures/trie/trie.d.ts +98 -584
  72. package/dist/umd/data-structure-typed.js +6580 -32822
  73. package/dist/umd/data-structure-typed.min.js +3 -3
  74. package/docs-site-docusaurus/docs/api/classes/AVLTree.md +162 -215
  75. package/docs-site-docusaurus/docs/api/classes/AVLTreeNode.md +9 -9
  76. package/docs-site-docusaurus/docs/api/classes/AbstractGraph.md +47 -47
  77. package/docs-site-docusaurus/docs/api/classes/BST.md +155 -208
  78. package/docs-site-docusaurus/docs/api/classes/BSTNode.md +7 -7
  79. package/docs-site-docusaurus/docs/api/classes/BinaryIndexedTree.md +13 -29
  80. package/docs-site-docusaurus/docs/api/classes/BinaryTree.md +104 -158
  81. package/docs-site-docusaurus/docs/api/classes/BinaryTreeNode.md +13 -13
  82. package/docs-site-docusaurus/docs/api/classes/Deque.md +72 -104
  83. package/docs-site-docusaurus/docs/api/classes/DirectedGraph.md +60 -80
  84. package/docs-site-docusaurus/docs/api/classes/DoublyLinkedList.md +67 -101
  85. package/docs-site-docusaurus/docs/api/classes/DoublyLinkedListNode.md +6 -6
  86. package/docs-site-docusaurus/docs/api/classes/FibonacciHeap.md +9 -9
  87. package/docs-site-docusaurus/docs/api/classes/FibonacciHeapNode.md +1 -1
  88. package/docs-site-docusaurus/docs/api/classes/HashMap.md +52 -48
  89. package/docs-site-docusaurus/docs/api/classes/Heap.md +40 -68
  90. package/docs-site-docusaurus/docs/api/classes/IterableElementBase.md +17 -17
  91. package/docs-site-docusaurus/docs/api/classes/LinearBase.md +38 -38
  92. package/docs-site-docusaurus/docs/api/classes/LinearLinkedBase.md +45 -45
  93. package/docs-site-docusaurus/docs/api/classes/LinkedHashMap.md +23 -23
  94. package/docs-site-docusaurus/docs/api/classes/LinkedListQueue.md +68 -96
  95. package/docs-site-docusaurus/docs/api/classes/MapGraph.md +60 -80
  96. package/docs-site-docusaurus/docs/api/classes/Matrix.md +57 -52
  97. package/docs-site-docusaurus/docs/api/classes/MaxHeap.md +38 -66
  98. package/docs-site-docusaurus/docs/api/classes/MaxPriorityQueue.md +41 -74
  99. package/docs-site-docusaurus/docs/api/classes/MinHeap.md +38 -66
  100. package/docs-site-docusaurus/docs/api/classes/MinPriorityQueue.md +46 -79
  101. package/docs-site-docusaurus/docs/api/classes/PriorityQueue.md +40 -68
  102. package/docs-site-docusaurus/docs/api/classes/Queue.md +54 -78
  103. package/docs-site-docusaurus/docs/api/classes/RedBlackTree.md +171 -225
  104. package/docs-site-docusaurus/docs/api/classes/SegmentTree.md +10 -22
  105. package/docs-site-docusaurus/docs/api/classes/SinglyLinkedList.md +68 -98
  106. package/docs-site-docusaurus/docs/api/classes/SinglyLinkedListNode.md +4 -4
  107. package/docs-site-docusaurus/docs/api/classes/SkipList.md +98 -75
  108. package/docs-site-docusaurus/docs/api/classes/Stack.md +33 -53
  109. package/docs-site-docusaurus/docs/api/classes/TreeMap.md +104 -129
  110. package/docs-site-docusaurus/docs/api/classes/TreeMultiMap.md +57 -124
  111. package/docs-site-docusaurus/docs/api/classes/TreeSet.md +45 -116
  112. package/docs-site-docusaurus/docs/api/classes/Trie.md +37 -61
  113. package/docs-site-docusaurus/docs/api/classes/TrieNode.md +8 -8
  114. package/docs-site-docusaurus/docs/api/classes/UndirectedGraph.md +59 -77
  115. package/package.json +1 -1
  116. package/src/data-structures/binary-tree/tree-multi-set.ts +15 -11
@@ -68,7 +68,7 @@ Time O(1), Space O(1)
68
68
  get color(): RBTNColor;
69
69
  ```
70
70
 
71
- Defined in: [data-structures/binary-tree/bst.ts:132](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L132)
71
+ Defined in: [data-structures/binary-tree/bst.ts:135](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L135)
72
72
 
73
73
  Gets the color of the node (used in Red-Black trees).
74
74
 
@@ -88,7 +88,7 @@ The node's color.
88
88
  set color(value): void;
89
89
  ```
90
90
 
91
- Defined in: [data-structures/binary-tree/bst.ts:143](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L143)
91
+ Defined in: [data-structures/binary-tree/bst.ts:147](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L147)
92
92
 
93
93
  Sets the color of the node.
94
94
 
@@ -118,7 +118,7 @@ The new color.
118
118
  get count(): number;
119
119
  ```
120
120
 
121
- Defined in: [data-structures/binary-tree/bst.ts:156](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L156)
121
+ Defined in: [data-structures/binary-tree/bst.ts:161](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L161)
122
122
 
123
123
  Gets the count of nodes in the subtree rooted at this node (used in order-statistic trees).
124
124
 
@@ -138,7 +138,7 @@ The subtree node count.
138
138
  set count(value): void;
139
139
  ```
140
140
 
141
- Defined in: [data-structures/binary-tree/bst.ts:167](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L167)
141
+ Defined in: [data-structures/binary-tree/bst.ts:173](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L173)
142
142
 
143
143
  Sets the count of nodes in the subtree.
144
144
 
@@ -168,7 +168,7 @@ The new count.
168
168
  get familyPosition(): FamilyPosition;
169
169
  ```
170
170
 
171
- Defined in: [data-structures/binary-tree/bst.ts:177](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L177)
171
+ Defined in: [data-structures/binary-tree/bst.ts:183](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L183)
172
172
 
173
173
  Gets the position of the node relative to its parent.
174
174
 
@@ -192,7 +192,7 @@ The family position (e.g., 'ROOT', 'LEFT', 'RIGHT').
192
192
  get height(): number;
193
193
  ```
194
194
 
195
- Defined in: [data-structures/binary-tree/bst.ts:108](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L108)
195
+ Defined in: [data-structures/binary-tree/bst.ts:109](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L109)
196
196
 
197
197
  Gets the height of the node (used in self-balancing trees).
198
198
 
@@ -212,7 +212,7 @@ The height.
212
212
  set height(value): void;
213
213
  ```
214
214
 
215
- Defined in: [data-structures/binary-tree/bst.ts:119](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L119)
215
+ Defined in: [data-structures/binary-tree/bst.ts:121](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/bst.ts#L121)
216
216
 
217
217
  Sets the height of the node.
218
218
 
@@ -64,7 +64,7 @@ number of elements, or an array of initial values
64
64
  iterator: IterableIterator<number>;
65
65
  ```
66
66
 
67
- Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:746](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L746)
67
+ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:221](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L221)
68
68
 
69
69
  Iterate over point values in index order.
70
70
 
@@ -86,13 +86,11 @@ Iterable.[iterator]
86
86
  get(index): number;
87
87
  ```
88
88
 
89
- Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:323](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L323)
89
+ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:98](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L98)
90
90
 
91
91
  Get the point value at index (0-based).
92
92
  Time: O(log n)
93
93
 
94
- *
95
-
96
94
  #### Parameters
97
95
 
98
96
  ##### index
@@ -120,15 +118,13 @@ Time: O(log n)
120
118
  lowerBound(sum): number;
121
119
  ```
122
120
 
123
- Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:600](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L600)
121
+ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:145](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L145)
124
122
 
125
123
  Find the smallest index i such that prefix sum [0..i] >= sum.
126
124
  Requires all values to be non-negative (behavior undefined otherwise).
127
125
  Returns size if no such index exists.
128
126
  Time: O(log n)
129
127
 
130
- *
131
-
132
128
  #### Parameters
133
129
 
134
130
  ##### sum
@@ -156,13 +152,11 @@ Time: O(log n)
156
152
  query(index): number;
157
153
  ```
158
154
 
159
- Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:413](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L413)
155
+ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:111](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L111)
160
156
 
161
157
  Prefix sum query: returns sum of elements [0..index] (inclusive, 0-based).
162
158
  Time: O(log n)
163
159
 
164
- *
165
-
166
160
  #### Parameters
167
161
 
168
162
  ##### index
@@ -189,13 +183,11 @@ Time: O(log n)
189
183
  queryRange(start, end): number;
190
184
  ```
191
185
 
192
- Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:502](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L502)
186
+ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:126](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L126)
193
187
 
194
188
  Range sum query: returns sum of elements [start..end] (inclusive, 0-based).
195
189
  Time: O(log n)
196
190
 
197
- *
198
-
199
191
  #### Parameters
200
192
 
201
193
  ##### start
@@ -226,13 +218,11 @@ Time: O(log n)
226
218
  set(index, value): void;
227
219
  ```
228
220
 
229
- Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:232](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L232)
221
+ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:83](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L83)
230
222
 
231
223
  Point set: set the value at index to an absolute value (0-based).
232
224
  Time: O(log n)
233
225
 
234
- *
235
-
236
226
  #### Parameters
237
227
 
238
228
  ##### index
@@ -264,13 +254,11 @@ Time: O(log n)
264
254
  toArray(): number[];
265
255
  ```
266
256
 
267
- Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:735](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L735)
257
+ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:210](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L210)
268
258
 
269
259
  Returns the point values as a plain array.
270
260
  Time: O(n log n)
271
261
 
272
- *
273
-
274
262
  #### Returns
275
263
 
276
264
  `number`[]
@@ -291,13 +279,11 @@ Time: O(n log n)
291
279
  update(index, delta): void;
292
280
  ```
293
281
 
294
- Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:141](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L141)
282
+ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:69](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L69)
295
283
 
296
284
  Point update: add delta to the value at index (0-based).
297
285
  Time: O(log n)
298
286
 
299
- *
300
-
301
287
  #### Parameters
302
288
 
303
289
  ##### index
@@ -329,15 +315,13 @@ Time: O(log n)
329
315
  upperBound(sum): number;
330
316
  ```
331
317
 
332
- Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:660](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L660)
318
+ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:174](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L174)
333
319
 
334
320
  Find the smallest index i such that prefix sum [0..i] > sum.
335
321
  Requires all values to be non-negative (behavior undefined otherwise).
336
322
  Returns size if no such index exists.
337
323
  Time: O(log n)
338
324
 
339
- *
340
-
341
325
  #### Parameters
342
326
 
343
327
  ##### sum
@@ -368,7 +352,7 @@ Time: O(log n)
368
352
  protected _highBit(n): number;
369
353
  ```
370
354
 
371
- Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:816](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L816)
355
+ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:291](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L291)
372
356
 
373
357
  Returns highest power of 2 <= n.
374
358
 
@@ -390,7 +374,7 @@ Returns highest power of 2 <= n.
390
374
  protected _pointQuery(pos): number;
391
375
  ```
392
376
 
393
- Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:795](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L795)
377
+ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:270](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L270)
394
378
 
395
379
  1-based point query: get exact value at pos.
396
380
 
@@ -412,7 +396,7 @@ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:795](https://git
412
396
  protected _pointUpdate(pos, delta): void;
413
397
  ```
414
398
 
415
- Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:787](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L787)
399
+ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:262](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L262)
416
400
 
417
401
  1-based point update: add delta to position pos.
418
402
 
@@ -438,7 +422,7 @@ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:787](https://git
438
422
  protected _prefixSum(pos): number;
439
423
  ```
440
424
 
441
- Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:777](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L777)
425
+ Defined in: [data-structures/binary-tree/binary-indexed-tree.ts:252](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/binary-tree/binary-indexed-tree.ts#L252)
442
426
 
443
427
  1-based prefix sum up to pos (inclusive).
444
428