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
@@ -6,7 +6,7 @@
6
6
 
7
7
  # Class: Stack\<E, R\>
8
8
 
9
- Defined in: [data-structures/stack/stack.ts:135](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L135)
9
+ Defined in: [data-structures/stack/stack.ts:134](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L134)
10
10
 
11
11
  LIFO stack with array storage and optional record→element conversion.
12
12
 
@@ -170,7 +170,7 @@ Time O(1), Space O(1)
170
170
  new Stack<E, R>(elements?, options?): Stack<E, R>;
171
171
  ```
172
172
 
173
- Defined in: [data-structures/stack/stack.ts:146](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L146)
173
+ Defined in: [data-structures/stack/stack.ts:142](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L142)
174
174
 
175
175
  Create a Stack and optionally bulk-push elements.
176
176
 
@@ -212,7 +212,7 @@ Time O(N), Space O(N)
212
212
  get elements(): E[];
213
213
  ```
214
214
 
215
- Defined in: [data-structures/stack/stack.ts:159](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L159)
215
+ Defined in: [data-structures/stack/stack.ts:154](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L154)
216
216
 
217
217
  Get the backing array of elements.
218
218
 
@@ -236,7 +236,7 @@ Internal elements array.
236
236
  get size(): number;
237
237
  ```
238
238
 
239
- Defined in: [data-structures/stack/stack.ts:213](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L213)
239
+ Defined in: [data-structures/stack/stack.ts:167](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L167)
240
240
 
241
241
  Get the number of stored elements.
242
242
 
@@ -258,8 +258,6 @@ Time O(1), Space O(1)
258
258
 
259
259
  Current size.
260
260
 
261
- *
262
-
263
261
  ***
264
262
 
265
263
  ### toElementFn
@@ -330,7 +328,7 @@ Producing the iterator is O(1); consuming the entire iterator is Time O(n) with
330
328
  clear(): void;
331
329
  ```
332
330
 
333
- Defined in: [data-structures/stack/stack.ts:642](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L642)
331
+ Defined in: [data-structures/stack/stack.ts:339](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L339)
334
332
 
335
333
  Remove all elements and reset storage.
336
334
 
@@ -340,8 +338,6 @@ Remove all elements and reset storage.
340
338
 
341
339
  void
342
340
 
343
- *
344
-
345
341
  #### Remarks
346
342
 
347
343
  Time O(1), Space O(1)
@@ -367,7 +363,7 @@ Time O(1), Space O(1)
367
363
  clone(): this;
368
364
  ```
369
365
 
370
- Defined in: [data-structures/stack/stack.ts:699](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L699)
366
+ Defined in: [data-structures/stack/stack.ts:355](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L355)
371
367
 
372
368
  Deep clone this stack.
373
369
 
@@ -377,8 +373,6 @@ Deep clone this stack.
377
373
 
378
374
  A new stack with the same content.
379
375
 
380
- *
381
-
382
376
  #### Remarks
383
377
 
384
378
  Time O(N), Space O(N)
@@ -406,7 +400,7 @@ Time O(N), Space O(N)
406
400
  delete(element): boolean;
407
401
  ```
408
402
 
409
- Defined in: [data-structures/stack/stack.ts:556](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L556)
403
+ Defined in: [data-structures/stack/stack.ts:296](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L296)
410
404
 
411
405
  Delete the first occurrence of a specific element.
412
406
 
@@ -424,8 +418,6 @@ Element to remove (using the configured equality).
424
418
 
425
419
  True if an element was removed.
426
420
 
427
- *
428
-
429
421
  #### Remarks
430
422
 
431
423
  Time O(N), Space O(1)
@@ -447,7 +439,7 @@ Time O(N), Space O(1)
447
439
  deleteAt(index): E | undefined;
448
440
  ```
449
441
 
450
- Defined in: [data-structures/stack/stack.ts:568](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L568)
442
+ Defined in: [data-structures/stack/stack.ts:307](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L307)
451
443
 
452
444
  Delete the element at an index.
453
445
 
@@ -477,7 +469,7 @@ Time O(N), Space O(1)
477
469
  deleteWhere(predicate): boolean;
478
470
  ```
479
471
 
480
- Defined in: [data-structures/stack/stack.ts:581](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L581)
472
+ Defined in: [data-structures/stack/stack.ts:319](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L319)
481
473
 
482
474
  Delete the first element that satisfies a predicate.
483
475
 
@@ -507,7 +499,7 @@ Time O(N), Space O(1)
507
499
  entries(): IterableIterator<[number, E]>;
508
500
  ```
509
501
 
510
- Defined in: [data-structures/base/iterable-element-base.ts:208](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L208)
502
+ Defined in: [data-structures/base/iterable-element-base.ts:207](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L207)
511
503
 
512
504
  Return an iterator of `[index, value]` pairs (Array-compatible).
513
505
 
@@ -571,7 +563,7 @@ Time O(n) in the worst case; may exit early when the first failure is found. Spa
571
563
  filter(predicate, thisArg?): this;
572
564
  ```
573
565
 
574
- Defined in: [data-structures/stack/stack.ts:758](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L758)
566
+ Defined in: [data-structures/stack/stack.ts:373](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L373)
575
567
 
576
568
  Filter elements into a new stack of the same class.
577
569
 
@@ -595,8 +587,6 @@ Value for `this` inside the predicate.
595
587
 
596
588
  A new stack with kept values.
597
589
 
598
- *
599
-
600
590
  #### Remarks
601
591
 
602
592
  Time O(N), Space O(N)
@@ -752,7 +742,7 @@ Time O(n), Space O(1).
752
742
  has(element): boolean;
753
743
  ```
754
744
 
755
- Defined in: [data-structures/base/iterable-element-base.ts:189](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L189)
745
+ Defined in: [data-structures/base/iterable-element-base.ts:188](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L188)
756
746
 
757
747
  Checks whether a strictly-equal element exists in the structure.
758
748
 
@@ -786,7 +776,7 @@ Time O(n) in the worst case. Space O(1).
786
776
  includes(element): boolean;
787
777
  ```
788
778
 
789
- Defined in: [data-structures/base/iterable-element-base.ts:200](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L200)
779
+ Defined in: [data-structures/base/iterable-element-base.ts:199](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L199)
790
780
 
791
781
  Check whether a value exists (Array-compatible alias for `has`).
792
782
 
@@ -820,7 +810,7 @@ Provided for familiarity when migrating from Array. Time O(n), Space O(1).
820
810
  isEmpty(): boolean;
821
811
  ```
822
812
 
823
- Defined in: [data-structures/stack/stack.ts:290](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L290)
813
+ Defined in: [data-structures/stack/stack.ts:200](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L200)
824
814
 
825
815
  Check whether the stack is empty.
826
816
 
@@ -830,8 +820,6 @@ Check whether the stack is empty.
830
820
 
831
821
  True if size is 0.
832
822
 
833
- *
834
-
835
823
  #### Remarks
836
824
 
837
825
  Time O(1), Space O(1)
@@ -858,7 +846,7 @@ Time O(1), Space O(1)
858
846
  keys(): IterableIterator<number>;
859
847
  ```
860
848
 
861
- Defined in: [data-structures/base/iterable-element-base.ts:219](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L219)
849
+ Defined in: [data-structures/base/iterable-element-base.ts:218](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L218)
862
850
 
863
851
  Return an iterator of numeric indices (Array-compatible).
864
852
 
@@ -885,7 +873,7 @@ map<EM, RM>(
885
873
  thisArg?): Stack<EM, RM>;
886
874
  ```
887
875
 
888
- Defined in: [data-structures/stack/stack.ts:841](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L841)
876
+ Defined in: [data-structures/stack/stack.ts:415](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L415)
889
877
 
890
878
  Map values into a new stack (possibly different element type).
891
879
 
@@ -925,8 +913,6 @@ Value for `this` inside the callback.
925
913
 
926
914
  A new Stack with mapped elements.
927
915
 
928
- *
929
-
930
916
  #### Remarks
931
917
 
932
918
  Time O(N), Space O(N)
@@ -952,7 +938,7 @@ Time O(N), Space O(N)
952
938
  mapSame(callback, thisArg?): this;
953
939
  ```
954
940
 
955
- Defined in: [data-structures/stack/stack.ts:776](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L776)
941
+ Defined in: [data-structures/stack/stack.ts:390](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L390)
956
942
 
957
943
  Map values into a new stack of the same element type.
958
944
 
@@ -992,7 +978,7 @@ Time O(N), Space O(N)
992
978
  peek(): E | undefined;
993
979
  ```
994
980
 
995
- Defined in: [data-structures/stack/stack.ts:347](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L347)
981
+ Defined in: [data-structures/stack/stack.ts:214](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L214)
996
982
 
997
983
  Get the top element without removing it.
998
984
 
@@ -1002,8 +988,6 @@ Get the top element without removing it.
1002
988
 
1003
989
  Top element or undefined.
1004
990
 
1005
- *
1006
-
1007
991
  #### Remarks
1008
992
 
1009
993
  Time O(1), Space O(1)
@@ -1025,7 +1009,7 @@ Time O(1), Space O(1)
1025
1009
  pop(): E | undefined;
1026
1010
  ```
1027
1011
 
1028
- Defined in: [data-structures/stack/stack.ts:485](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L485)
1012
+ Defined in: [data-structures/stack/stack.ts:266](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L266)
1029
1013
 
1030
1014
  Pop and return the top element.
1031
1015
 
@@ -1035,8 +1019,6 @@ Pop and return the top element.
1035
1019
 
1036
1020
  Removed element or undefined.
1037
1021
 
1038
- *
1039
-
1040
1022
  #### Remarks
1041
1023
 
1042
1024
  Time O(1), Space O(1)
@@ -1071,7 +1053,7 @@ Time O(1), Space O(1)
1071
1053
  print(): void;
1072
1054
  ```
1073
1055
 
1074
- Defined in: [data-structures/base/iterable-element-base.ts:301](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L301)
1056
+ Defined in: [data-structures/base/iterable-element-base.ts:298](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L298)
1075
1057
 
1076
1058
  Prints `toVisual()` to the console. Intended for quick debugging.
1077
1059
 
@@ -1097,7 +1079,7 @@ Time O(n) due to materialization, Space O(n) for the intermediate representation
1097
1079
  push(element): boolean;
1098
1080
  ```
1099
1081
 
1100
- Defined in: [data-structures/stack/stack.ts:414](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L414)
1082
+ Defined in: [data-structures/stack/stack.ts:238](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L238)
1101
1083
 
1102
1084
  Push one element onto the top.
1103
1085
 
@@ -1115,8 +1097,6 @@ Element to push.
1115
1097
 
1116
1098
  True when pushed.
1117
1099
 
1118
- *
1119
-
1120
1100
  #### Remarks
1121
1101
 
1122
1102
  Time O(1), Space O(1)
@@ -1147,7 +1127,7 @@ Time O(1), Space O(1)
1147
1127
  pushMany(elements): boolean[];
1148
1128
  ```
1149
1129
 
1150
- Defined in: [data-structures/stack/stack.ts:496](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L496)
1130
+ Defined in: [data-structures/stack/stack.ts:276](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L276)
1151
1131
 
1152
1132
  Push many elements from an iterable.
1153
1133
 
@@ -1209,7 +1189,7 @@ Time O(n), Space O(1). Throws if called on an empty structure without `initialVa
1209
1189
  reduce(callbackfn): E;
1210
1190
  ```
1211
1191
 
1212
- Defined in: [data-structures/base/iterable-element-base.ts:226](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L226)
1192
+ Defined in: [data-structures/base/iterable-element-base.ts:225](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L225)
1213
1193
 
1214
1194
  ##### Parameters
1215
1195
 
@@ -1231,7 +1211,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:226](https://github.c
1231
1211
  reduce(callbackfn, initialValue): E;
1232
1212
  ```
1233
1213
 
1234
- Defined in: [data-structures/base/iterable-element-base.ts:227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L227)
1214
+ Defined in: [data-structures/base/iterable-element-base.ts:226](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L226)
1235
1215
 
1236
1216
  ##### Parameters
1237
1217
 
@@ -1257,7 +1237,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:227](https://github.c
1257
1237
  reduce<U>(callbackfn, initialValue): U;
1258
1238
  ```
1259
1239
 
1260
- Defined in: [data-structures/base/iterable-element-base.ts:228](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L228)
1240
+ Defined in: [data-structures/base/iterable-element-base.ts:227](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L227)
1261
1241
 
1262
1242
  ##### Type Parameters
1263
1243
 
@@ -1291,7 +1271,7 @@ Defined in: [data-structures/base/iterable-element-base.ts:228](https://github.c
1291
1271
  setEquality(equals): this;
1292
1272
  ```
1293
1273
 
1294
- Defined in: [data-structures/stack/stack.ts:862](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L862)
1274
+ Defined in: [data-structures/stack/stack.ts:435](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L435)
1295
1275
 
1296
1276
  Set the equality comparator used by delete/search operations.
1297
1277
 
@@ -1361,7 +1341,7 @@ Time O(n) in the worst case; may exit early on first success. Space O(1).
1361
1341
  toArray(): E[];
1362
1342
  ```
1363
1343
 
1364
- Defined in: [data-structures/base/iterable-element-base.ts:278](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L278)
1344
+ Defined in: [data-structures/base/iterable-element-base.ts:275](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L275)
1365
1345
 
1366
1346
  Materializes the elements into a new array.
1367
1347
 
@@ -1387,7 +1367,7 @@ Time O(n), Space O(n).
1387
1367
  toVisual(): E[];
1388
1368
  ```
1389
1369
 
1390
- Defined in: [data-structures/base/iterable-element-base.ts:290](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L290)
1370
+ Defined in: [data-structures/base/iterable-element-base.ts:287](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/base/iterable-element-base.ts#L287)
1391
1371
 
1392
1372
  Returns a representation of the structure suitable for quick visualization.
1393
1373
  Defaults to an array of elements; subclasses may override to provide richer visuals.
@@ -1443,7 +1423,7 @@ static fromArray<E, R>(
1443
1423
  options?): any;
1444
1424
  ```
1445
1425
 
1446
- Defined in: [data-structures/stack/stack.ts:228](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L228)
1426
+ Defined in: [data-structures/stack/stack.ts:181](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L181)
1447
1427
 
1448
1428
  Create a stack from an array of elements.
1449
1429
 
@@ -1528,7 +1508,7 @@ Time O(1), Space O(1).
1528
1508
  protected _createInstance(options?): this;
1529
1509
  ```
1530
1510
 
1531
- Defined in: [data-structures/stack/stack.ts:886](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L886)
1511
+ Defined in: [data-structures/stack/stack.ts:459](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L459)
1532
1512
 
1533
1513
  (Protected) Create an empty instance of the same concrete class.
1534
1514
 
@@ -1558,7 +1538,7 @@ Time O(1), Space O(1)
1558
1538
  protected _createLike<T, RR>(elements?, options?): Stack<T, RR>;
1559
1539
  ```
1560
1540
 
1561
- Defined in: [data-structures/stack/stack.ts:901](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L901)
1541
+ Defined in: [data-structures/stack/stack.ts:473](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L473)
1562
1542
 
1563
1543
  (Protected) Create a like-kind stack and seed it from an iterable.
1564
1544
 
@@ -1604,7 +1584,7 @@ Time O(N), Space O(N)
1604
1584
  protected _getIterator(): IterableIterator<E>;
1605
1585
  ```
1606
1586
 
1607
- Defined in: [data-structures/stack/stack.ts:918](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L918)
1587
+ Defined in: [data-structures/stack/stack.ts:489](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L489)
1608
1588
 
1609
1589
  (Protected) Iterate elements from bottom to top.
1610
1590
 
@@ -1630,7 +1610,7 @@ Time O(N), Space O(1)
1630
1610
  protected _indexOfByEquals(target): number;
1631
1611
  ```
1632
1612
 
1633
- Defined in: [data-structures/stack/stack.ts:874](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L874)
1613
+ Defined in: [data-structures/stack/stack.ts:448](https://github.com/zrwusa/data-structure-typed/blob/main/src/data-structures/stack/stack.ts#L448)
1634
1614
 
1635
1615
  (Protected) Find the index of a target element using the equality function.
1636
1616