max-priority-queue-typed 2.5.3 → 2.6.0

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 (61) hide show
  1. package/dist/cjs/index.cjs +71 -0
  2. package/dist/cjs/index.cjs.map +1 -1
  3. package/dist/cjs-legacy/index.cjs +71 -0
  4. package/dist/cjs-legacy/index.cjs.map +1 -1
  5. package/dist/esm/index.mjs +71 -0
  6. package/dist/esm/index.mjs.map +1 -1
  7. package/dist/esm-legacy/index.mjs +71 -0
  8. package/dist/esm-legacy/index.mjs.map +1 -1
  9. package/dist/types/data-structures/base/iterable-element-base.d.ts +17 -0
  10. package/dist/types/data-structures/base/linear-base.d.ts +6 -0
  11. package/dist/types/data-structures/binary-tree/avl-tree.d.ts +36 -0
  12. package/dist/types/data-structures/binary-tree/binary-indexed-tree.d.ts +42 -0
  13. package/dist/types/data-structures/binary-tree/binary-tree.d.ts +75 -0
  14. package/dist/types/data-structures/binary-tree/bst.d.ts +72 -0
  15. package/dist/types/data-structures/binary-tree/red-black-tree.d.ts +57 -0
  16. package/dist/types/data-structures/binary-tree/segment-tree.d.ts +18 -0
  17. package/dist/types/data-structures/binary-tree/tree-map.d.ts +375 -0
  18. package/dist/types/data-structures/binary-tree/tree-multi-map.d.ts +389 -0
  19. package/dist/types/data-structures/binary-tree/tree-multi-set.d.ts +330 -0
  20. package/dist/types/data-structures/binary-tree/tree-set.d.ts +438 -0
  21. package/dist/types/data-structures/graph/directed-graph.d.ts +30 -0
  22. package/dist/types/data-structures/graph/undirected-graph.d.ts +27 -0
  23. package/dist/types/data-structures/hash/hash-map.d.ts +33 -0
  24. package/dist/types/data-structures/heap/heap.d.ts +42 -0
  25. package/dist/types/data-structures/linked-list/doubly-linked-list.d.ts +75 -2
  26. package/dist/types/data-structures/linked-list/singly-linked-list.d.ts +45 -0
  27. package/dist/types/data-structures/linked-list/skip-linked-list.d.ts +54 -0
  28. package/dist/types/data-structures/matrix/matrix.d.ts +24 -0
  29. package/dist/types/data-structures/queue/deque.d.ts +90 -1
  30. package/dist/types/data-structures/queue/queue.d.ts +36 -0
  31. package/dist/types/data-structures/stack/stack.d.ts +30 -0
  32. package/dist/types/data-structures/trie/trie.d.ts +36 -0
  33. package/dist/umd/max-priority-queue-typed.js +71 -0
  34. package/dist/umd/max-priority-queue-typed.js.map +1 -1
  35. package/dist/umd/max-priority-queue-typed.min.js +1 -1
  36. package/dist/umd/max-priority-queue-typed.min.js.map +1 -1
  37. package/package.json +2 -2
  38. package/src/data-structures/base/iterable-element-base.ts +32 -0
  39. package/src/data-structures/base/linear-base.ts +11 -0
  40. package/src/data-structures/binary-tree/avl-tree.ts +36 -0
  41. package/src/data-structures/binary-tree/binary-indexed-tree.ts +42 -0
  42. package/src/data-structures/binary-tree/binary-tree.ts +75 -0
  43. package/src/data-structures/binary-tree/bst.ts +72 -0
  44. package/src/data-structures/binary-tree/red-black-tree.ts +57 -0
  45. package/src/data-structures/binary-tree/segment-tree.ts +18 -0
  46. package/src/data-structures/binary-tree/tree-map.ts +375 -0
  47. package/src/data-structures/binary-tree/tree-multi-map.ts +392 -0
  48. package/src/data-structures/binary-tree/tree-multi-set.ts +336 -0
  49. package/src/data-structures/binary-tree/tree-set.ts +492 -0
  50. package/src/data-structures/graph/directed-graph.ts +30 -0
  51. package/src/data-structures/graph/undirected-graph.ts +27 -0
  52. package/src/data-structures/hash/hash-map.ts +33 -0
  53. package/src/data-structures/heap/heap.ts +42 -0
  54. package/src/data-structures/linked-list/doubly-linked-list.ts +90 -2
  55. package/src/data-structures/linked-list/singly-linked-list.ts +45 -0
  56. package/src/data-structures/linked-list/skip-linked-list.ts +54 -0
  57. package/src/data-structures/matrix/matrix.ts +24 -0
  58. package/src/data-structures/queue/deque.ts +103 -1
  59. package/src/data-structures/queue/queue.ts +36 -0
  60. package/src/data-structures/stack/stack.ts +30 -0
  61. package/src/data-structures/trie/trie.ts +36 -0
@@ -217,6 +217,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
217
217
 
218
218
 
219
219
 
220
+
221
+
222
+
223
+
224
+
225
+
226
+
227
+
228
+
229
+
230
+
231
+
232
+
233
+
234
+
220
235
 
221
236
 
222
237
 
@@ -412,6 +427,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
412
427
 
413
428
 
414
429
 
430
+
431
+
432
+
433
+
434
+
435
+
436
+
437
+
438
+
439
+
440
+
441
+
442
+
443
+
444
+
415
445
 
416
446
 
417
447
 
@@ -462,6 +492,18 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
462
492
 
463
493
 
464
494
 
495
+
496
+
497
+
498
+
499
+
500
+
501
+
502
+
503
+
504
+
505
+
506
+
465
507
 
466
508
 
467
509
 
@@ -654,6 +696,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
654
696
 
655
697
 
656
698
 
699
+
700
+
701
+
702
+
703
+
704
+
705
+
706
+
707
+
708
+
709
+
710
+
711
+
712
+
713
+
657
714
 
658
715
 
659
716
 
@@ -859,6 +916,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
859
916
 
860
917
 
861
918
 
919
+
920
+
921
+
922
+
923
+
924
+
925
+
926
+
927
+
928
+
929
+
930
+
931
+
932
+
933
+
862
934
 
863
935
 
864
936
 
@@ -1064,6 +1136,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
1064
1136
 
1065
1137
 
1066
1138
 
1139
+
1140
+
1141
+
1142
+
1143
+
1144
+
1145
+
1146
+
1147
+
1148
+
1149
+
1150
+
1151
+
1152
+
1153
+
1067
1154
 
1068
1155
 
1069
1156
 
@@ -1265,6 +1352,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
1265
1352
 
1266
1353
 
1267
1354
 
1355
+
1356
+
1357
+
1358
+
1359
+
1360
+
1361
+
1362
+
1363
+
1364
+
1365
+
1366
+
1367
+
1368
+
1369
+
1268
1370
 
1269
1371
 
1270
1372
 
@@ -1452,6 +1554,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
1452
1554
 
1453
1555
 
1454
1556
 
1557
+
1558
+
1559
+
1560
+
1561
+
1562
+
1563
+
1564
+
1565
+
1566
+
1567
+
1568
+
1569
+
1570
+
1571
+
1455
1572
 
1456
1573
 
1457
1574
 
@@ -1641,6 +1758,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
1641
1758
 
1642
1759
 
1643
1760
 
1761
+
1762
+
1763
+
1764
+
1765
+
1766
+
1767
+
1768
+
1769
+
1770
+
1771
+
1772
+
1773
+
1774
+
1775
+
1644
1776
 
1645
1777
 
1646
1778
 
@@ -1829,6 +1961,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
1829
1961
 
1830
1962
 
1831
1963
 
1964
+
1965
+
1966
+
1967
+
1968
+
1969
+
1970
+
1971
+
1972
+
1973
+
1974
+
1975
+
1976
+
1977
+
1978
+
1832
1979
 
1833
1980
 
1834
1981
 
@@ -2018,6 +2165,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
2018
2165
 
2019
2166
 
2020
2167
 
2168
+
2169
+
2170
+
2171
+
2172
+
2173
+
2174
+
2175
+
2176
+
2177
+
2178
+
2179
+
2180
+
2181
+
2182
+
2021
2183
 
2022
2184
 
2023
2185
 
@@ -2209,6 +2371,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
2209
2371
 
2210
2372
 
2211
2373
 
2374
+
2375
+
2376
+
2377
+
2378
+
2379
+
2380
+
2381
+
2382
+
2383
+
2384
+
2385
+
2386
+
2387
+
2388
+
2212
2389
 
2213
2390
 
2214
2391
 
@@ -2399,6 +2576,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
2399
2576
 
2400
2577
 
2401
2578
 
2579
+
2580
+
2581
+
2582
+
2583
+
2584
+
2585
+
2586
+
2587
+
2588
+
2589
+
2590
+
2591
+
2592
+
2593
+
2402
2594
 
2403
2595
 
2404
2596
 
@@ -2587,6 +2779,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
2587
2779
 
2588
2780
 
2589
2781
 
2782
+
2783
+
2784
+
2785
+
2786
+
2787
+
2788
+
2789
+
2790
+
2791
+
2792
+
2793
+
2794
+
2795
+
2796
+
2590
2797
 
2591
2798
 
2592
2799
 
@@ -2772,6 +2979,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
2772
2979
 
2773
2980
 
2774
2981
 
2982
+
2983
+
2984
+
2985
+
2986
+
2987
+
2988
+
2989
+
2990
+
2991
+
2992
+
2993
+
2994
+
2995
+
2996
+
2775
2997
 
2776
2998
 
2777
2999
 
@@ -2957,6 +3179,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
2957
3179
 
2958
3180
 
2959
3181
 
3182
+
3183
+
3184
+
3185
+
3186
+
3187
+
3188
+
3189
+
3190
+
3191
+
3192
+
3193
+
3194
+
3195
+
3196
+
2960
3197
 
2961
3198
 
2962
3199
 
@@ -3143,6 +3380,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
3143
3380
 
3144
3381
 
3145
3382
 
3383
+
3384
+
3385
+
3386
+
3387
+
3388
+
3389
+
3390
+
3391
+
3392
+
3393
+
3394
+
3395
+
3396
+
3397
+
3146
3398
 
3147
3399
 
3148
3400
 
@@ -3330,6 +3582,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
3330
3582
 
3331
3583
 
3332
3584
 
3585
+
3586
+
3587
+
3588
+
3589
+
3590
+
3591
+
3592
+
3593
+
3594
+
3595
+
3596
+
3597
+
3598
+
3599
+
3333
3600
 
3334
3601
 
3335
3602
 
@@ -3517,6 +3784,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
3517
3784
 
3518
3785
 
3519
3786
 
3787
+
3788
+
3789
+
3790
+
3791
+
3792
+
3793
+
3794
+
3795
+
3796
+
3797
+
3798
+
3799
+
3800
+
3801
+
3520
3802
 
3521
3803
 
3522
3804
 
@@ -3576,6 +3858,9 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
3576
3858
 
3577
3859
 
3578
3860
 
3861
+
3862
+
3863
+
3579
3864
 
3580
3865
 
3581
3866
 
@@ -3645,6 +3930,9 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
3645
3930
 
3646
3931
 
3647
3932
 
3933
+
3934
+
3935
+
3648
3936
 
3649
3937
 
3650
3938
 
@@ -3698,6 +3986,9 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
3698
3986
 
3699
3987
 
3700
3988
 
3989
+
3990
+
3991
+
3701
3992
 
3702
3993
 
3703
3994
 
@@ -3753,6 +4044,9 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
3753
4044
 
3754
4045
 
3755
4046
 
4047
+
4048
+
4049
+
3756
4050
 
3757
4051
 
3758
4052
 
@@ -3910,6 +4204,18 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
3910
4204
 
3911
4205
 
3912
4206
 
4207
+
4208
+
4209
+
4210
+
4211
+
4212
+
4213
+
4214
+
4215
+
4216
+
4217
+
4218
+
3913
4219
 
3914
4220
 
3915
4221
 
@@ -4095,6 +4401,18 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
4095
4401
 
4096
4402
 
4097
4403
 
4404
+
4405
+
4406
+
4407
+
4408
+
4409
+
4410
+
4411
+
4412
+
4413
+
4414
+
4415
+
4098
4416
 
4099
4417
 
4100
4418
 
@@ -4264,6 +4582,18 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
4264
4582
 
4265
4583
 
4266
4584
 
4585
+
4586
+
4587
+
4588
+
4589
+
4590
+
4591
+
4592
+
4593
+
4594
+
4595
+
4596
+
4267
4597
 
4268
4598
 
4269
4599
 
@@ -4433,6 +4763,18 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
4433
4763
 
4434
4764
 
4435
4765
 
4766
+
4767
+
4768
+
4769
+
4770
+
4771
+
4772
+
4773
+
4774
+
4775
+
4776
+
4777
+
4436
4778
 
4437
4779
 
4438
4780
 
@@ -4603,6 +4945,18 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
4603
4945
 
4604
4946
 
4605
4947
 
4948
+
4949
+
4950
+
4951
+
4952
+
4953
+
4954
+
4955
+
4956
+
4957
+
4958
+
4959
+
4606
4960
 
4607
4961
 
4608
4962
 
@@ -4692,6 +5046,12 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
4692
5046
 
4693
5047
 
4694
5048
 
5049
+
5050
+
5051
+
5052
+
5053
+
5054
+
4695
5055
  * @example
4696
5056
  * // Pagination by position in tree order
4697
5057
  * const tree = new TreeMap<number>(
@@ -4874,6 +5234,21 @@ export declare class TreeMap<K = any, V = any, R = [K, V]> implements Iterable<[
4874
5234
 
4875
5235
 
4876
5236
 
5237
+
5238
+
5239
+
5240
+
5241
+
5242
+
5243
+
5244
+
5245
+
5246
+
5247
+
5248
+
5249
+
5250
+
5251
+
4877
5252
 
4878
5253
 
4879
5254