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
@@ -1,6 +1,61 @@
1
1
  var __defProp = Object.defineProperty;
2
2
  var __name = (target, value) => __defProp(target, "name", { value, configurable: true });
3
3
 
4
+ // src/common/error.ts
5
+ function raise(ErrorClass, message) {
6
+ throw new ErrorClass(message);
7
+ }
8
+ __name(raise, "raise");
9
+ var ERR = {
10
+ // Range / index
11
+ indexOutOfRange: /* @__PURE__ */ __name((index, min, max, ctx) => `${ctx ? ctx + ": " : ""}Index ${index} is out of range [${min}, ${max}].`, "indexOutOfRange"),
12
+ invalidIndex: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Index must be an integer.`, "invalidIndex"),
13
+ // Type / argument
14
+ invalidArgument: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidArgument"),
15
+ comparatorRequired: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Comparator is required for non-number/non-string/non-Date keys.`, "comparatorRequired"),
16
+ invalidKey: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidKey"),
17
+ notAFunction: /* @__PURE__ */ __name((name, ctx) => `${ctx ? ctx + ": " : ""}${name} must be a function.`, "notAFunction"),
18
+ invalidEntry: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Each entry must be a [key, value] tuple.`, "invalidEntry"),
19
+ invalidNaN: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}NaN is not a valid key.`, "invalidNaN"),
20
+ invalidDate: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Invalid Date key.`, "invalidDate"),
21
+ reduceEmpty: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Reduce of empty structure with no initial value.`, "reduceEmpty"),
22
+ callbackReturnType: /* @__PURE__ */ __name((expected, got, ctx) => `${ctx ? ctx + ": " : ""}Callback must return ${expected}; got ${got}.`, "callbackReturnType"),
23
+ // State / operation
24
+ invalidOperation: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidOperation"),
25
+ // Matrix
26
+ matrixDimensionMismatch: /* @__PURE__ */ __name((op) => `Matrix: Dimensions must be compatible for ${op}.`, "matrixDimensionMismatch"),
27
+ matrixSingular: /* @__PURE__ */ __name(() => "Matrix: Singular matrix, inverse does not exist.", "matrixSingular"),
28
+ matrixNotSquare: /* @__PURE__ */ __name(() => "Matrix: Must be square for inversion.", "matrixNotSquare"),
29
+ matrixNotRectangular: /* @__PURE__ */ __name(() => "Matrix: Must be rectangular for transposition.", "matrixNotRectangular"),
30
+ matrixRowMismatch: /* @__PURE__ */ __name((expected, got) => `Matrix: Expected row length ${expected}, but got ${got}.`, "matrixRowMismatch"),
31
+ // Order statistic
32
+ orderStatisticNotEnabled: /* @__PURE__ */ __name((method, ctx) => `${ctx ? ctx + ": " : ""}${method}() requires enableOrderStatistic: true.`, "orderStatisticNotEnabled")
33
+ };
34
+
35
+ // src/common/index.ts
36
+ var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
37
+ DFSOperation2[DFSOperation2["VISIT"] = 0] = "VISIT";
38
+ DFSOperation2[DFSOperation2["PROCESS"] = 1] = "PROCESS";
39
+ return DFSOperation2;
40
+ })(DFSOperation || {});
41
+ var Range = class {
42
+ constructor(low, high, includeLow = true, includeHigh = true) {
43
+ this.low = low;
44
+ this.high = high;
45
+ this.includeLow = includeLow;
46
+ this.includeHigh = includeHigh;
47
+ }
48
+ static {
49
+ __name(this, "Range");
50
+ }
51
+ // Determine whether a key is within the range
52
+ isInRange(key, comparator) {
53
+ const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;
54
+ const highCheck = this.includeHigh ? comparator(key, this.high) <= 0 : comparator(key, this.high) < 0;
55
+ return lowCheck && highCheck;
56
+ }
57
+ };
58
+
4
59
  // src/data-structures/base/iterable-element-base.ts
5
60
  var IterableElementBase = class {
6
61
  static {
@@ -19,7 +74,7 @@ var IterableElementBase = class {
19
74
  if (options) {
20
75
  const { toElementFn } = options;
21
76
  if (typeof toElementFn === "function") this._toElementFn = toElementFn;
22
- else if (toElementFn) throw new TypeError("toElementFn must be a function type");
77
+ else if (toElementFn) raise(TypeError, "toElementFn must be a function type");
23
78
  }
24
79
  }
25
80
  /**
@@ -182,7 +237,7 @@ var IterableElementBase = class {
182
237
  acc = initialValue;
183
238
  } else {
184
239
  const first = iter.next();
185
- if (first.done) throw new TypeError("Reduce of empty structure with no initial value");
240
+ if (first.done) raise(TypeError, "Reduce of empty structure with no initial value");
186
241
  acc = first.value;
187
242
  index = 1;
188
243
  }
@@ -755,6 +810,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
755
810
 
756
811
 
757
812
 
813
+
814
+
815
+
758
816
 
759
817
 
760
818
 
@@ -819,6 +877,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
819
877
 
820
878
 
821
879
 
880
+
881
+
882
+
822
883
 
823
884
 
824
885
 
@@ -888,6 +949,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
888
949
 
889
950
 
890
951
 
952
+
953
+
954
+
891
955
 
892
956
 
893
957
 
@@ -939,6 +1003,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
939
1003
 
940
1004
 
941
1005
 
1006
+
1007
+
1008
+
942
1009
 
943
1010
 
944
1011
 
@@ -1051,6 +1118,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1051
1118
 
1052
1119
 
1053
1120
 
1121
+
1122
+
1123
+
1054
1124
 
1055
1125
 
1056
1126
 
@@ -1107,6 +1177,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1107
1177
 
1108
1178
 
1109
1179
 
1180
+
1181
+
1182
+
1110
1183
 
1111
1184
 
1112
1185
 
@@ -1152,6 +1225,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1152
1225
 
1153
1226
 
1154
1227
 
1228
+
1229
+
1230
+
1155
1231
 
1156
1232
 
1157
1233
 
@@ -1203,6 +1279,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1203
1279
 
1204
1280
 
1205
1281
 
1282
+
1283
+
1284
+
1206
1285
 
1207
1286
 
1208
1287
 
@@ -1259,6 +1338,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1259
1338
 
1260
1339
 
1261
1340
 
1341
+
1342
+
1343
+
1262
1344
 
1263
1345
 
1264
1346
 
@@ -1323,6 +1405,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1323
1405
 
1324
1406
 
1325
1407
 
1408
+
1409
+
1410
+
1326
1411
 
1327
1412
 
1328
1413
 
@@ -1364,6 +1449,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1364
1449
 
1365
1450
 
1366
1451
 
1452
+
1453
+
1454
+
1367
1455
 
1368
1456
 
1369
1457
 
@@ -1411,6 +1499,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1411
1499
 
1412
1500
 
1413
1501
 
1502
+
1503
+
1504
+
1414
1505
 
1415
1506
 
1416
1507
 
@@ -1624,6 +1715,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1624
1715
 
1625
1716
 
1626
1717
 
1718
+
1719
+
1720
+
1627
1721
 
1628
1722
 
1629
1723
 
@@ -1675,6 +1769,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1675
1769
 
1676
1770
 
1677
1771
 
1772
+
1773
+
1774
+
1678
1775
 
1679
1776
 
1680
1777
 
@@ -1754,6 +1851,9 @@ var SinglyLinkedList = class extends LinearLinkedBase {
1754
1851
 
1755
1852
 
1756
1853
 
1854
+
1855
+
1856
+
1757
1857
 
1758
1858
 
1759
1859
 
@@ -1898,55 +1998,6 @@ function elementOrPredicate(input, equals) {
1898
1998
  }
1899
1999
  __name(elementOrPredicate, "elementOrPredicate");
1900
2000
 
1901
- // src/common/error.ts
1902
- var ERR = {
1903
- // Range / index
1904
- indexOutOfRange: /* @__PURE__ */ __name((index, min, max, ctx) => `${ctx ? ctx + ": " : ""}Index ${index} is out of range [${min}, ${max}].`, "indexOutOfRange"),
1905
- invalidIndex: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Index must be an integer.`, "invalidIndex"),
1906
- // Type / argument
1907
- invalidArgument: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidArgument"),
1908
- comparatorRequired: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Comparator is required for non-number/non-string/non-Date keys.`, "comparatorRequired"),
1909
- invalidKey: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidKey"),
1910
- notAFunction: /* @__PURE__ */ __name((name, ctx) => `${ctx ? ctx + ": " : ""}${name} must be a function.`, "notAFunction"),
1911
- invalidEntry: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Each entry must be a [key, value] tuple.`, "invalidEntry"),
1912
- invalidNaN: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}NaN is not a valid key.`, "invalidNaN"),
1913
- invalidDate: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Invalid Date key.`, "invalidDate"),
1914
- reduceEmpty: /* @__PURE__ */ __name((ctx) => `${ctx ? ctx + ": " : ""}Reduce of empty structure with no initial value.`, "reduceEmpty"),
1915
- callbackReturnType: /* @__PURE__ */ __name((expected, got, ctx) => `${ctx ? ctx + ": " : ""}Callback must return ${expected}; got ${got}.`, "callbackReturnType"),
1916
- // State / operation
1917
- invalidOperation: /* @__PURE__ */ __name((reason, ctx) => `${ctx ? ctx + ": " : ""}${reason}`, "invalidOperation"),
1918
- // Matrix
1919
- matrixDimensionMismatch: /* @__PURE__ */ __name((op) => `Matrix: Dimensions must be compatible for ${op}.`, "matrixDimensionMismatch"),
1920
- matrixSingular: /* @__PURE__ */ __name(() => "Matrix: Singular matrix, inverse does not exist.", "matrixSingular"),
1921
- matrixNotSquare: /* @__PURE__ */ __name(() => "Matrix: Must be square for inversion.", "matrixNotSquare"),
1922
- matrixNotRectangular: /* @__PURE__ */ __name(() => "Matrix: Must be rectangular for transposition.", "matrixNotRectangular"),
1923
- matrixRowMismatch: /* @__PURE__ */ __name((expected, got) => `Matrix: Expected row length ${expected}, but got ${got}.`, "matrixRowMismatch")
1924
- };
1925
-
1926
- // src/common/index.ts
1927
- var DFSOperation = /* @__PURE__ */ ((DFSOperation2) => {
1928
- DFSOperation2[DFSOperation2["VISIT"] = 0] = "VISIT";
1929
- DFSOperation2[DFSOperation2["PROCESS"] = 1] = "PROCESS";
1930
- return DFSOperation2;
1931
- })(DFSOperation || {});
1932
- var Range = class {
1933
- constructor(low, high, includeLow = true, includeHigh = true) {
1934
- this.low = low;
1935
- this.high = high;
1936
- this.includeLow = includeLow;
1937
- this.includeHigh = includeHigh;
1938
- }
1939
- static {
1940
- __name(this, "Range");
1941
- }
1942
- // Determine whether a key is within the range
1943
- isInRange(key, comparator) {
1944
- const lowCheck = this.includeLow ? comparator(key, this.low) >= 0 : comparator(key, this.low) > 0;
1945
- const highCheck = this.includeHigh ? comparator(key, this.high) <= 0 : comparator(key, this.high) < 0;
1946
- return lowCheck && highCheck;
1947
- }
1948
- };
1949
-
1950
2001
  // src/data-structures/queue/queue.ts
1951
2002
  var Queue = class _Queue extends LinearBase {
1952
2003
  static {
@@ -2035,6 +2086,9 @@ var Queue = class _Queue extends LinearBase {
2035
2086
 
2036
2087
 
2037
2088
 
2089
+
2090
+
2091
+
2038
2092
 
2039
2093
 
2040
2094
 
@@ -2082,6 +2136,9 @@ var Queue = class _Queue extends LinearBase {
2082
2136
 
2083
2137
 
2084
2138
 
2139
+
2140
+
2141
+
2085
2142
 
2086
2143
 
2087
2144
 
@@ -2145,6 +2202,9 @@ var Queue = class _Queue extends LinearBase {
2145
2202
 
2146
2203
 
2147
2204
 
2205
+
2206
+
2207
+
2148
2208
 
2149
2209
 
2150
2210
 
@@ -2204,6 +2264,9 @@ var Queue = class _Queue extends LinearBase {
2204
2264
 
2205
2265
 
2206
2266
 
2267
+
2268
+
2269
+
2207
2270
 
2208
2271
 
2209
2272
 
@@ -2270,6 +2333,9 @@ var Queue = class _Queue extends LinearBase {
2270
2333
 
2271
2334
 
2272
2335
 
2336
+
2337
+
2338
+
2273
2339
 
2274
2340
 
2275
2341
 
@@ -2326,6 +2392,9 @@ var Queue = class _Queue extends LinearBase {
2326
2392
 
2327
2393
 
2328
2394
 
2395
+
2396
+
2397
+
2329
2398
 
2330
2399
 
2331
2400
 
@@ -2375,6 +2444,9 @@ var Queue = class _Queue extends LinearBase {
2375
2444
 
2376
2445
 
2377
2446
 
2447
+
2448
+
2449
+
2378
2450
 
2379
2451
 
2380
2452
 
@@ -2465,6 +2537,9 @@ var Queue = class _Queue extends LinearBase {
2465
2537
 
2466
2538
 
2467
2539
 
2540
+
2541
+
2542
+
2468
2543
 
2469
2544
 
2470
2545
 
@@ -2508,6 +2583,9 @@ var Queue = class _Queue extends LinearBase {
2508
2583
 
2509
2584
 
2510
2585
 
2586
+
2587
+
2588
+
2511
2589
 
2512
2590
 
2513
2591
 
@@ -2574,6 +2652,9 @@ var Queue = class _Queue extends LinearBase {
2574
2652
 
2575
2653
 
2576
2654
 
2655
+
2656
+
2657
+
2577
2658
 
2578
2659
 
2579
2660
 
@@ -2624,6 +2705,9 @@ var Queue = class _Queue extends LinearBase {
2624
2705
 
2625
2706
 
2626
2707
 
2708
+
2709
+
2710
+
2627
2711
 
2628
2712
 
2629
2713
 
@@ -2678,6 +2762,9 @@ var Queue = class _Queue extends LinearBase {
2678
2762
 
2679
2763
 
2680
2764
 
2765
+
2766
+
2767
+
2681
2768
 
2682
2769
 
2683
2770
 
@@ -2953,6 +3040,9 @@ var Deque = class extends LinearBase {
2953
3040
 
2954
3041
 
2955
3042
 
3043
+
3044
+
3045
+
2956
3046
 
2957
3047
 
2958
3048
 
@@ -3008,6 +3098,9 @@ var Deque = class extends LinearBase {
3008
3098
 
3009
3099
 
3010
3100
 
3101
+
3102
+
3103
+
3011
3104
 
3012
3105
 
3013
3106
 
@@ -3068,6 +3161,9 @@ var Deque = class extends LinearBase {
3068
3161
 
3069
3162
 
3070
3163
 
3164
+
3165
+
3166
+
3071
3167
 
3072
3168
 
3073
3169
 
@@ -3141,6 +3237,9 @@ var Deque = class extends LinearBase {
3141
3237
 
3142
3238
 
3143
3239
 
3240
+
3241
+
3242
+
3144
3243
 
3145
3244
 
3146
3245
 
@@ -3201,6 +3300,9 @@ var Deque = class extends LinearBase {
3201
3300
 
3202
3301
 
3203
3302
 
3303
+
3304
+
3305
+
3204
3306
 
3205
3307
 
3206
3308
 
@@ -3262,6 +3364,9 @@ var Deque = class extends LinearBase {
3262
3364
 
3263
3365
 
3264
3366
 
3367
+
3368
+
3369
+
3265
3370
 
3266
3371
 
3267
3372
 
@@ -3364,6 +3469,9 @@ var Deque = class extends LinearBase {
3364
3469
 
3365
3470
 
3366
3471
 
3472
+
3473
+
3474
+
3367
3475
 
3368
3476
 
3369
3477
 
@@ -3406,6 +3514,9 @@ var Deque = class extends LinearBase {
3406
3514
 
3407
3515
 
3408
3516
 
3517
+
3518
+
3519
+
3409
3520
 
3410
3521
 
3411
3522
 
@@ -3452,6 +3563,9 @@ var Deque = class extends LinearBase {
3452
3563
 
3453
3564
 
3454
3565
 
3566
+
3567
+
3568
+
3455
3569
 
3456
3570
 
3457
3571
 
@@ -3649,6 +3763,9 @@ var Deque = class extends LinearBase {
3649
3763
 
3650
3764
 
3651
3765
 
3766
+
3767
+
3768
+
3652
3769
 
3653
3770
 
3654
3771
 
@@ -3733,6 +3850,9 @@ var Deque = class extends LinearBase {
3733
3850
 
3734
3851
 
3735
3852
 
3853
+
3854
+
3855
+
3736
3856
 
3737
3857
 
3738
3858
 
@@ -3842,6 +3962,9 @@ var Deque = class extends LinearBase {
3842
3962
 
3843
3963
 
3844
3964
 
3965
+
3966
+
3967
+
3845
3968
 
3846
3969
 
3847
3970
 
@@ -3910,6 +4033,9 @@ var Deque = class extends LinearBase {
3910
4033
 
3911
4034
 
3912
4035
 
4036
+
4037
+
4038
+
3913
4039
 
3914
4040
 
3915
4041
 
@@ -3961,6 +4087,9 @@ var Deque = class extends LinearBase {
3961
4087
 
3962
4088
 
3963
4089
 
4090
+
4091
+
4092
+
3964
4093
 
3965
4094
 
3966
4095
 
@@ -4032,6 +4161,9 @@ var Deque = class extends LinearBase {
4032
4161
 
4033
4162
 
4034
4163
 
4164
+
4165
+
4166
+
4035
4167
 
4036
4168
 
4037
4169
 
@@ -4172,6 +4304,6 @@ var Deque = class extends LinearBase {
4172
4304
  * @license MIT License
4173
4305
  */
4174
4306
 
4175
- export { DFSOperation, Deque, ERR, LinkedListQueue, Queue, Range };
4307
+ export { DFSOperation, Deque, ERR, LinkedListQueue, Queue, Range, raise };
4176
4308
  //# sourceMappingURL=index.mjs.map
4177
4309
  //# sourceMappingURL=index.mjs.map