queue-typed 2.5.1 → 2.5.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 (73) hide show
  1. package/dist/cjs/index.cjs +184 -51
  2. package/dist/cjs/index.cjs.map +1 -1
  3. package/dist/cjs-legacy/index.cjs +183 -50
  4. package/dist/cjs-legacy/index.cjs.map +1 -1
  5. package/dist/esm/index.mjs +184 -52
  6. package/dist/esm/index.mjs.map +1 -1
  7. package/dist/esm-legacy/index.mjs +183 -51
  8. package/dist/esm-legacy/index.mjs.map +1 -1
  9. package/dist/types/common/error.d.ts +9 -0
  10. package/dist/types/common/index.d.ts +1 -1
  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 +77 -2
  14. package/dist/types/data-structures/binary-tree/bst.d.ts +171 -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 +409 -0
  18. package/dist/types/data-structures/binary-tree/tree-multi-map.d.ts +411 -6
  19. package/dist/types/data-structures/binary-tree/tree-multi-set.d.ts +339 -6
  20. package/dist/types/data-structures/binary-tree/tree-set.d.ts +391 -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 +51 -0
  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 +45 -0
  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/types/types/data-structures/binary-tree/bst.d.ts +1 -0
  34. package/dist/types/types/data-structures/binary-tree/tree-map.d.ts +5 -0
  35. package/dist/types/types/data-structures/binary-tree/tree-multi-set.d.ts +4 -0
  36. package/dist/types/types/data-structures/binary-tree/tree-set.d.ts +4 -0
  37. package/dist/umd/queue-typed.js +181 -49
  38. package/dist/umd/queue-typed.js.map +1 -1
  39. package/dist/umd/queue-typed.min.js +1 -1
  40. package/dist/umd/queue-typed.min.js.map +1 -1
  41. package/package.json +2 -2
  42. package/src/common/error.ts +19 -1
  43. package/src/common/index.ts +1 -1
  44. package/src/data-structures/base/iterable-element-base.ts +3 -2
  45. package/src/data-structures/binary-tree/avl-tree.ts +47 -0
  46. package/src/data-structures/binary-tree/binary-indexed-tree.ts +46 -4
  47. package/src/data-structures/binary-tree/binary-tree.ts +79 -4
  48. package/src/data-structures/binary-tree/bst.ts +441 -6
  49. package/src/data-structures/binary-tree/red-black-tree.ts +73 -0
  50. package/src/data-structures/binary-tree/segment-tree.ts +18 -0
  51. package/src/data-structures/binary-tree/tree-map.ts +434 -9
  52. package/src/data-structures/binary-tree/tree-multi-map.ts +426 -5
  53. package/src/data-structures/binary-tree/tree-multi-set.ts +350 -6
  54. package/src/data-structures/binary-tree/tree-set.ts +410 -8
  55. package/src/data-structures/graph/abstract-graph.ts +2 -2
  56. package/src/data-structures/graph/directed-graph.ts +30 -0
  57. package/src/data-structures/graph/undirected-graph.ts +27 -0
  58. package/src/data-structures/hash/hash-map.ts +35 -4
  59. package/src/data-structures/heap/heap.ts +46 -4
  60. package/src/data-structures/heap/max-heap.ts +2 -2
  61. package/src/data-structures/linked-list/doubly-linked-list.ts +51 -0
  62. package/src/data-structures/linked-list/singly-linked-list.ts +45 -0
  63. package/src/data-structures/linked-list/skip-linked-list.ts +59 -5
  64. package/src/data-structures/matrix/matrix.ts +33 -9
  65. package/src/data-structures/priority-queue/max-priority-queue.ts +2 -2
  66. package/src/data-structures/queue/deque.ts +45 -0
  67. package/src/data-structures/queue/queue.ts +36 -0
  68. package/src/data-structures/stack/stack.ts +30 -0
  69. package/src/data-structures/trie/trie.ts +38 -2
  70. package/src/types/data-structures/binary-tree/bst.ts +1 -0
  71. package/src/types/data-structures/binary-tree/tree-map.ts +6 -0
  72. package/src/types/data-structures/binary-tree/tree-multi-set.ts +5 -0
  73. package/src/types/data-structures/binary-tree/tree-set.ts +5 -0
@@ -3,6 +3,61 @@
3
3
  var __defProp = Object.defineProperty;
4
4
  var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
5
5
 
6
+ // src/common/error.ts
7
+ function raise(ErrorClass, message) {
8
+ throw new ErrorClass(message);
9
+ }
10
+ __name(raise, "raise");
11
+ var ERR = {
12
+ // Range / index
13
+ indexOutOfRange: /* @__PURE__ */ __name((index, min, max, ctx) => `${ctx ? ctx + ": " : ""}Index ${index} is out of range [${min}, ${max}].`, "indexOutOfRange"),
14
+ invalidIndex: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Index must be an integer.`, "invalidIndex"),
15
+ // Type / argument
16
+ invalidArgument: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidArgument"),
17
+ comparatorRequired: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Comparator is required for non-number/non-string/non-Date keys.`, "comparatorRequired"),
18
+ invalidKey: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidKey"),
19
+ notAFunction: /* @__PURE__ */ __name((name, ctx) => `${ctx ? ctx + ": " : ""}${name} must be a function.`, "notAFunction"),
20
+ invalidEntry: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Each entry must be a [key, value] tuple.`, "invalidEntry"),
21
+ invalidNaN: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}NaN is not a valid key.`, "invalidNaN"),
22
+ invalidDate: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Invalid Date key.`, "invalidDate"),
23
+ reduceEmpty: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Reduce of empty structure with no initial value.`, "reduceEmpty"),
24
+ callbackReturnType: /* @__PURE__ */ __name((expected, got, ctx) => `${ctx ? ctx + ": " : ""}Callback must return ${expected}; got ${got}.`, "callbackReturnType"),
25
+ // State / operation
26
+ invalidOperation: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidOperation"),
27
+ // Matrix
28
+ matrixDimensionMismatch: /* @__PURE__ */ __name((op) => `Matrix: Dimensions must be compatible for ${op}.`, "matrixDimensionMismatch"),
29
+ matrixSingular: /* @__PURE__ */ __name(() => "Matrix: Singular matrix, inverse does not exist.", "matrixSingular"),
30
+ matrixNotSquare: /* @__PURE__ */ __name(() => "Matrix: Must be square for inversion.", "matrixNotSquare"),
31
+ matrixNotRectangular: /* @__PURE__ */ __name(() => "Matrix: Must be rectangular for transposition.", "matrixNotRectangular"),
32
+ matrixRowMismatch: /* @__PURE__ */ __name((expected, got) => `Matrix: Expected row length ${expected}, but got ${got}.`, "matrixRowMismatch"),
33
+ // Order statistic
34
+ orderStatisticNotEnabled: /* @__PURE__ */ __name((method, ctx) => `${ctx ? ctx + ": " : ""}${method}() requires enableOrderStatistic: true.`, "orderStatisticNotEnabled")
35
+ };
36
+
37
+ // src/common/index.ts
38
+ var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
39
+ DFSOperation2[DFSOperation2["VISIT"] = 0] = "VISIT";
40
+ DFSOperation2[DFSOperation2["PROCESS"] = 1] = "PROCESS";
41
+ return DFSOperation2;
42
+ })(DFSOperation || {});
43
+ var Range = class {
44
+ constructor(low, high, includeLow = true, includeHigh = true) {
45
+ this.low = low;
46
+ this.high = high;
47
+ this.includeLow = includeLow;
48
+ this.includeHigh = includeHigh;
49
+ }
50
+ static {
51
+ __name(this, "Range");
52
+ }
53
+ // Determine whether a key is within the range
54
+ isInRange(key, comparator) {
55
+ const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;
56
+ const highCheck = this.includeHigh ? comparator(key, this.high) <= 0 : comparator(key, this.high) < 0;
57
+ return lowCheck && highCheck;
58
+ }
59
+ };
60
+
6
61
  // src/data-structures/base/iterable-element-base.ts
7
62
  var IterableElementBase = class {
8
63
  static {
@@ -21,7 +76,7 @@ var IterableElementBase = class {
21
76
  if (options) {
22
77
  const { toElementFn } = options;
23
78
  if (typeof toElementFn === "function") this._toElementFn = toElementFn;
24
- else if (toElementFn) throw new TypeError("toElementFn must be a function type");
79
+ else if (toElementFn) raise(TypeError, "toElementFn must be a function type");
25
80
  }
26
81
  }
27
82
  /**
@@ -184,7 +239,7 @@ var IterableElementBase = class {
184
239
  acc = initialValue;
185
240
  } else {
186
241
  const first = iter.next();
187
- if (first.done) throw new TypeError("Reduce of empty structure with no initial value");
242
+ if (first.done) raise(TypeError, "Reduce of empty structure with no initial value");
188
243
  acc = first.value;
189
244
  index = 1;
190
245
  }
@@ -757,6 +812,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
757
812
 
758
813
 
759
814
 
815
+
816
+
817
+
760
818
 
761
819
 
762
820
 
@@ -821,6 +879,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
821
879
 
822
880
 
823
881
 
882
+
883
+
884
+
824
885
 
825
886
 
826
887
 
@@ -890,6 +951,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
890
951
 
891
952
 
892
953
 
954
+
955
+
956
+
893
957
 
894
958
 
895
959
 
@@ -941,6 +1005,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
941
1005
 
942
1006
 
943
1007
 
1008
+
1009
+
1010
+
944
1011
 
945
1012
 
946
1013
 
@@ -1053,6 +1120,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1053
1120
 
1054
1121
 
1055
1122
 
1123
+
1124
+
1125
+
1056
1126
 
1057
1127
 
1058
1128
 
@@ -1109,6 +1179,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1109
1179
 
1110
1180
 
1111
1181
 
1182
+
1183
+
1184
+
1112
1185
 
1113
1186
 
1114
1187
 
@@ -1154,6 +1227,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1154
1227
 
1155
1228
 
1156
1229
 
1230
+
1231
+
1232
+
1157
1233
 
1158
1234
 
1159
1235
 
@@ -1205,6 +1281,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1205
1281
 
1206
1282
 
1207
1283
 
1284
+
1285
+
1286
+
1208
1287
 
1209
1288
 
1210
1289
 
@@ -1261,6 +1340,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1261
1340
 
1262
1341
 
1263
1342
 
1343
+
1344
+
1345
+
1264
1346
 
1265
1347
 
1266
1348
 
@@ -1325,6 +1407,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1325
1407
 
1326
1408
 
1327
1409
 
1410
+
1411
+
1412
+
1328
1413
 
1329
1414
 
1330
1415
 
@@ -1366,6 +1451,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1366
1451
 
1367
1452
 
1368
1453
 
1454
+
1455
+
1456
+
1369
1457
 
1370
1458
 
1371
1459
 
@@ -1413,6 +1501,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1413
1501
 
1414
1502
 
1415
1503
 
1504
+
1505
+
1506
+
1416
1507
 
1417
1508
 
1418
1509
 
@@ -1626,6 +1717,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1626
1717
 
1627
1718
 
1628
1719
 
1720
+
1721
+
1722
+
1629
1723
 
1630
1724
 
1631
1725
 
@@ -1677,6 +1771,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1677
1771
 
1678
1772
 
1679
1773
 
1774
+
1775
+
1776
+
1680
1777
 
1681
1778
 
1682
1779
 
@@ -1756,6 +1853,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1756
1853
 
1757
1854
 
1758
1855
 
1856
+
1857
+
1858
+
1759
1859
 
1760
1860
 
1761
1861
 
@@ -1900,55 +2000,6 @@ function elementOrPredicate(input, equals) {
1900
2000
  }
1901
2001
  __name(elementOrPredicate, "elementOrPredicate");
1902
2002
 
1903
- // src/common/error.ts
1904
- var ERR = {
1905
- // Range / index
1906
- indexOutOfRange: /* @__PURE__ */ __name((index, min, max, ctx) => `${ctx ? ctx + ": " : ""}Index ${index} is out of range [${min}, ${max}].`, "indexOutOfRange"),
1907
- invalidIndex: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Index must be an integer.`, "invalidIndex"),
1908
- // Type / argument
1909
- invalidArgument: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidArgument"),
1910
- comparatorRequired: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Comparator is required for non-number/non-string/non-Date keys.`, "comparatorRequired"),
1911
- invalidKey: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidKey"),
1912
- notAFunction: /* @__PURE__ */ __name((name, ctx) => `${ctx ? ctx + ": " : ""}${name} must be a function.`, "notAFunction"),
1913
- invalidEntry: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Each entry must be a [key, value] tuple.`, "invalidEntry"),
1914
- invalidNaN: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}NaN is not a valid key.`, "invalidNaN"),
1915
- invalidDate: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Invalid Date key.`, "invalidDate"),
1916
- reduceEmpty: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Reduce of empty structure with no initial value.`, "reduceEmpty"),
1917
- callbackReturnType: /* @__PURE__ */ __name((expected, got, ctx) => `${ctx ? ctx + ": " : ""}Callback must return ${expected}; got ${got}.`, "callbackReturnType"),
1918
- // State / operation
1919
- invalidOperation: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidOperation"),
1920
- // Matrix
1921
- matrixDimensionMismatch: /* @__PURE__ */ __name((op) => `Matrix: Dimensions must be compatible for ${op}.`, "matrixDimensionMismatch"),
1922
- matrixSingular: /* @__PURE__ */ __name(() => "Matrix: Singular matrix, inverse does not exist.", "matrixSingular"),
1923
- matrixNotSquare: /* @__PURE__ */ __name(() => "Matrix: Must be square for inversion.", "matrixNotSquare"),
1924
- matrixNotRectangular: /* @__PURE__ */ __name(() => "Matrix: Must be rectangular for transposition.", "matrixNotRectangular"),
1925
- matrixRowMismatch: /* @__PURE__ */ __name((expected, got) => `Matrix: Expected row length ${expected}, but got ${got}.`, "matrixRowMismatch")
1926
- };
1927
-
1928
- // src/common/index.ts
1929
- var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
1930
- DFSOperation2[DFSOperation2["VISIT"] = 0] = "VISIT";
1931
- DFSOperation2[DFSOperation2["PROCESS"] = 1] = "PROCESS";
1932
- return DFSOperation2;
1933
- })(DFSOperation || {});
1934
- var Range = class {
1935
- constructor(low, high, includeLow = true, includeHigh = true) {
1936
- this.low = low;
1937
- this.high = high;
1938
- this.includeLow = includeLow;
1939
- this.includeHigh = includeHigh;
1940
- }
1941
- static {
1942
- __name(this, "Range");
1943
- }
1944
- // Determine whether a key is within the range
1945
- isInRange(key, comparator) {
1946
- const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;
1947
- const highCheck = this.includeHigh ? comparator(key, this.high) <= 0 : comparator(key, this.high) < 0;
1948
- return lowCheck && highCheck;
1949
- }
1950
- };
1951
-
1952
2003
  // src/data-structures/queue/queue.ts
1953
2004
  var Queue = class _Queue extends LinearBase {
1954
2005
  static {
@@ -2037,6 +2088,9 @@ var Queue = class _Queue extends LinearBase {
2037
2088
 
2038
2089
 
2039
2090
 
2091
+
2092
+
2093
+
2040
2094
 
2041
2095
 
2042
2096
 
@@ -2084,6 +2138,9 @@ var Queue = class _Queue extends LinearBase {
2084
2138
 
2085
2139
 
2086
2140
 
2141
+
2142
+
2143
+
2087
2144
 
2088
2145
 
2089
2146
 
@@ -2147,6 +2204,9 @@ var Queue = class _Queue extends LinearBase {
2147
2204
 
2148
2205
 
2149
2206
 
2207
+
2208
+
2209
+
2150
2210
 
2151
2211
 
2152
2212
 
@@ -2206,6 +2266,9 @@ var Queue = class _Queue extends LinearBase {
2206
2266
 
2207
2267
 
2208
2268
 
2269
+
2270
+
2271
+
2209
2272
 
2210
2273
 
2211
2274
 
@@ -2272,6 +2335,9 @@ var Queue = class _Queue extends LinearBase {
2272
2335
 
2273
2336
 
2274
2337
 
2338
+
2339
+
2340
+
2275
2341
 
2276
2342
 
2277
2343
 
@@ -2328,6 +2394,9 @@ var Queue = class _Queue extends LinearBase {
2328
2394
 
2329
2395
 
2330
2396
 
2397
+
2398
+
2399
+
2331
2400
 
2332
2401
 
2333
2402
 
@@ -2377,6 +2446,9 @@ var Queue = class _Queue extends LinearBase {
2377
2446
 
2378
2447
 
2379
2448
 
2449
+
2450
+
2451
+
2380
2452
 
2381
2453
 
2382
2454
 
@@ -2467,6 +2539,9 @@ var Queue = class _Queue extends LinearBase {
2467
2539
 
2468
2540
 
2469
2541
 
2542
+
2543
+
2544
+
2470
2545
 
2471
2546
 
2472
2547
 
@@ -2510,6 +2585,9 @@ var Queue = class _Queue extends LinearBase {
2510
2585
 
2511
2586
 
2512
2587
 
2588
+
2589
+
2590
+
2513
2591
 
2514
2592
 
2515
2593
 
@@ -2576,6 +2654,9 @@ var Queue = class _Queue extends LinearBase {
2576
2654
 
2577
2655
 
2578
2656
 
2657
+
2658
+
2659
+
2579
2660
 
2580
2661
 
2581
2662
 
@@ -2626,6 +2707,9 @@ var Queue = class _Queue extends LinearBase {
2626
2707
 
2627
2708
 
2628
2709
 
2710
+
2711
+
2712
+
2629
2713
 
2630
2714
 
2631
2715
 
@@ -2680,6 +2764,9 @@ var Queue = class _Queue extends LinearBase {
2680
2764
 
2681
2765
 
2682
2766
 
2767
+
2768
+
2769
+
2683
2770
 
2684
2771
 
2685
2772
 
@@ -2955,6 +3042,9 @@ var Deque = class extends LinearBase {
2955
3042
 
2956
3043
 
2957
3044
 
3045
+
3046
+
3047
+
2958
3048
 
2959
3049
 
2960
3050
 
@@ -3010,6 +3100,9 @@ var Deque = class extends LinearBase {
3010
3100
 
3011
3101
 
3012
3102
 
3103
+
3104
+
3105
+
3013
3106
 
3014
3107
 
3015
3108
 
@@ -3070,6 +3163,9 @@ var Deque = class extends LinearBase {
3070
3163
 
3071
3164
 
3072
3165
 
3166
+
3167
+
3168
+
3073
3169
 
3074
3170
 
3075
3171
 
@@ -3143,6 +3239,9 @@ var Deque = class extends LinearBase {
3143
3239
 
3144
3240
 
3145
3241
 
3242
+
3243
+
3244
+
3146
3245
 
3147
3246
 
3148
3247
 
@@ -3203,6 +3302,9 @@ var Deque = class extends LinearBase {
3203
3302
 
3204
3303
 
3205
3304
 
3305
+
3306
+
3307
+
3206
3308
 
3207
3309
 
3208
3310
 
@@ -3264,6 +3366,9 @@ var Deque = class extends LinearBase {
3264
3366
 
3265
3367
 
3266
3368
 
3369
+
3370
+
3371
+
3267
3372
 
3268
3373
 
3269
3374
 
@@ -3366,6 +3471,9 @@ var Deque = class extends LinearBase {
3366
3471
 
3367
3472
 
3368
3473
 
3474
+
3475
+
3476
+
3369
3477
 
3370
3478
 
3371
3479
 
@@ -3408,6 +3516,9 @@ var Deque = class extends LinearBase {
3408
3516
 
3409
3517
 
3410
3518
 
3519
+
3520
+
3521
+
3411
3522
 
3412
3523
 
3413
3524
 
@@ -3454,6 +3565,9 @@ var Deque = class extends LinearBase {
3454
3565
 
3455
3566
 
3456
3567
 
3568
+
3569
+
3570
+
3457
3571
 
3458
3572
 
3459
3573
 
@@ -3651,6 +3765,9 @@ var Deque = class extends LinearBase {
3651
3765
 
3652
3766
 
3653
3767
 
3768
+
3769
+
3770
+
3654
3771
 
3655
3772
 
3656
3773
 
@@ -3735,6 +3852,9 @@ var Deque = class extends LinearBase {
3735
3852
 
3736
3853
 
3737
3854
 
3855
+
3856
+
3857
+
3738
3858
 
3739
3859
 
3740
3860
 
@@ -3844,6 +3964,9 @@ var Deque = class extends LinearBase {
3844
3964
 
3845
3965
 
3846
3966
 
3967
+
3968
+
3969
+
3847
3970
 
3848
3971
 
3849
3972
 
@@ -3912,6 +4035,9 @@ var Deque = class extends LinearBase {
3912
4035
 
3913
4036
 
3914
4037
 
4038
+
4039
+
4040
+
3915
4041
 
3916
4042
 
3917
4043
 
@@ -3963,6 +4089,9 @@ var Deque = class extends LinearBase {
3963
4089
 
3964
4090
 
3965
4091
 
4092
+
4093
+
4094
+
3966
4095
 
3967
4096
 
3968
4097
 
@@ -4034,6 +4163,9 @@ var Deque = class extends LinearBase {
4034
4163
 
4035
4164
 
4036
4165
 
4166
+
4167
+
4168
+
4037
4169
 
4038
4170
 
4039
4171
 
@@ -4180,5 +4312,6 @@ exports.ERR = ERR;
4180
4312
  exports.LinkedListQueue = LinkedListQueue;
4181
4313
  exports.Queue = Queue;
4182
4314
  exports.Range = Range;
4315
+ exports.raise = raise;
4183
4316
  //# sourceMappingURL=index.cjs.map
4184
4317
  //# sourceMappingURL=index.cjs.map