@byloth/core 2.2.2 → 2.2.4

package/dist/core.esm.js

@@ -1,5 +1,5 @@
-const T = typeof window < "u" && typeof window.document < "u", D = typeof process < "u" && !!process.versions?.node, B = typeof self == "object" && self.constructor?.name === "DedicatedWorkerGlobalScope";
-class c extends Error {
+const E = typeof window < "u" && typeof window.document < "u", B = typeof process < "u" && !!process.versions?.node, V = typeof self == "object" && self.constructor?.name === "DedicatedWorkerGlobalScope";
+class f extends Error {
   /**
    * A static method to convert a generic caught error, ensuring it's an instance of the {@link Exception} class.
    *
@@ -23,13 +23,13 @@ class c extends Error {
    * @returns An instance of the {@link Exception} class.
    */
   static FromUnknown(e) {
-    if (e instanceof c)
+    if (e instanceof f)
       return e;
     if (e instanceof Error) {
-      const t = new c(e.message);
+      const t = new f(e.message);
       return t.stack = e.stack, t.cause = e.cause, t.name = e.name, t;
     }
-    return new c(`${e}`);
+    return new f(`${e}`);
   }
   /**
    * Initializes a new instance of the {@link Exception} class.
@@ -52,7 +52,7 @@ class c extends Error {
   }
   [Symbol.toStringTag] = "Exception";
 }
-class x extends c {
+class v extends f {
   /**
    * Initializes a new instance of the {@link FatalErrorException} class.
    *
@@ -74,7 +74,7 @@ class x extends c {
   }
   [Symbol.toStringTag] = "FatalErrorException";
 }
-class P extends x {
+class j extends v {
   /**
    * Initializes a new instance of the {@link NotImplementedException} class.
    *
@@ -96,7 +96,7 @@ class P extends x {
   }
   [Symbol.toStringTag] = "NotImplementedException";
 }
-class E extends c {
+class M extends f {
   /**
    * Initializes a new instance of the {@link FileException} class.
    *
@@ -118,7 +118,7 @@ class E extends c {
   }
   [Symbol.toStringTag] = "FileException";
 }
-class J extends E {
+class J extends M {
   /**
    * Initializes a new instance of the {@link FileExistsException} class.
    *
@@ -140,7 +140,7 @@ class J extends E {
   }
   [Symbol.toStringTag] = "FileExistsException";
 }
-class Y extends E {
+class L extends M {
   /**
    * Initializes a new instance of the {@link FileNotFoundException} class.
    *
@@ -162,7 +162,7 @@ class Y extends E {
   }
   [Symbol.toStringTag] = "FileNotFoundException";
 }
-class p extends c {
+class y extends f {
   /**
    * Initializes a new instance of the {@link KeyException} class.
    *
@@ -184,7 +184,7 @@ class p extends c {
   }
   [Symbol.toStringTag] = "KeyException";
 }
-class L extends c {
+class A extends f {
   /**
    * Initializes a new instance of the {@link NetworkException} class.
    *
@@ -206,7 +206,30 @@ class L extends c {
   }
   [Symbol.toStringTag] = "NetworkException";
 }
-class V extends c {
+class G extends A {
+  response;
+  /**
+   * Initializes a new instance of the {@link ResponseException} class.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * throw new ResponseException(response);
+   * ```
+   *
+   * ---
+   *
+   * @param response The response that caused the error.
+   * @param cause The previous caught error that caused this one, if any.
+   * @param name The name of the exception. Default is `"ResponseException"`.
+   */
+  constructor(e, t, n = "ResponseException") {
+    super(`The request failed with the status code ${e.status} (${e.statusText}).`, t, n), this.response = e;
+  }
+  [Symbol.toStringTag] = "ResponseException";
+}
+class K extends f {
   /**
    * Initializes a new instance of the {@link PermissionException} class.
    *
@@ -228,7 +251,7 @@ class V extends c {
   }
   [Symbol.toStringTag] = "PermissionException";
 }
-class k extends c {
+class S extends f {
   /**
    * Initializes a new instance of the {@link ReferenceException} class.
    *
@@ -250,7 +273,7 @@ class k extends c {
   }
   [Symbol.toStringTag] = "ReferenceException";
 }
-class _ extends c {
+class b extends f {
   /**
    * Initializes a new instance of the {@link RuntimeException} class.
    *
@@ -272,7 +295,7 @@ class _ extends c {
   }
   [Symbol.toStringTag] = "RuntimeException";
 }
-class j extends _ {
+class z extends b {
   /**
    * Initializes a new instance of the {@link EnvironmentException} class.
    *
@@ -294,7 +317,7 @@ class j extends _ {
   }
   [Symbol.toStringTag] = "EnvironmentException";
 }
-class O extends c {
+class N extends f {
   /**
    * Initializes a new instance of the {@link TimeoutException} class.
    *
@@ -316,7 +339,7 @@ class O extends c {
   }
   [Symbol.toStringTag] = "TimeoutException";
 }
-class G extends c {
+class Q extends f {
   /**
    * Initializes a new instance of the {@link TypeException} class.
    *
@@ -338,7 +361,7 @@ class G extends c {
   }
   [Symbol.toStringTag] = "TypeException";
 }
-class f extends c {
+class c extends f {
   /**
    * Initializes a new instance of the {@link ValueException} class.
    *
@@ -360,7 +383,7 @@ class f extends c {
   }
   [Symbol.toStringTag] = "ValueException";
 }
-class b extends f {
+class x extends c {
   /**
    * Initializes a new instance of the {@link RangeException} class.
    *
@@ -530,7 +553,7 @@ class l {
     if (s === void 0) {
       const r = this._iterator.next();
       if (r.done)
-        throw new f("Cannot reduce an empty iterator without an initial value.");
+        throw new c("Cannot reduce an empty iterator without an initial value.");
       s = r.value, n += 1;
     }
     for (; ; ) {
@@ -960,7 +983,7 @@ class l {
    * @returns A new instance of the {@link AggregatedIterator} class containing the grouped elements.
    */
   groupBy(e) {
-    return new h(this.map((t, n) => [e(t, n), t]));
+    return new d(this.map((t, n) => [e(t, n), t]));
   }
   /**
    * Materializes the iterator into an array.  
@@ -993,7 +1016,7 @@ class l {
     return this;
   }
 }
-class u {
+class h {
   /**
    * The internal {@link SmartIterator} object that holds the reduced elements.
    */
@@ -1077,7 +1100,7 @@ class u {
   }
   filter(e) {
     const t = this._elements.enumerate();
-    return new u(function* () {
+    return new h(function* () {
       for (const [n, [s, r]] of t)
         e(s, r, n) && (yield [s, r]);
     });
@@ -1117,7 +1140,7 @@ class u {
    */
   map(e) {
     const t = this._elements.enumerate();
-    return new u(function* () {
+    return new h(function* () {
       for (const [n, [s, r]] of t)
         yield [s, e(s, r, n)];
     });
@@ -1127,7 +1150,7 @@ class u {
     if (s === void 0) {
       const r = this._elements.next();
       if (r.done)
-        throw new f("Cannot reduce an empty iterator without an initial value.");
+        throw new c("Cannot reduce an empty iterator without an initial value.");
       s = r.value[1], n += 1;
     }
     for (const [r, o] of this._elements)
@@ -1169,7 +1192,7 @@ class u {
    */
   flatMap(e) {
     const t = this._elements.enumerate();
-    return new h(function* () {
+    return new d(function* () {
       for (const [n, [s, r]] of t) {
         const o = e(s, r, n);
         if (o instanceof Array)
@@ -1215,7 +1238,7 @@ class u {
    */
   drop(e) {
     const t = this._elements.enumerate();
-    return new u(function* () {
+    return new h(function* () {
       for (const [n, [s, r]] of t)
         n >= e && (yield [s, r]);
     });
@@ -1257,7 +1280,7 @@ class u {
    */
   take(e) {
     const t = this._elements.enumerate();
-    return new u(function* () {
+    return new h(function* () {
       for (const [n, [s, r]] of t) {
         if (n >= e)
           break;
@@ -1327,7 +1350,7 @@ class u {
    */
   unique() {
     const e = this._elements;
-    return new u(function* () {
+    return new h(function* () {
       const t = /* @__PURE__ */ new Set();
       for (const [n, s] of e)
         t.has(s) || (t.add(s), yield [n, s]);
@@ -1423,7 +1446,7 @@ class u {
    */
   reorganizeBy(e) {
     const t = this._elements.enumerate();
-    return new h(function* () {
+    return new d(function* () {
       for (const [n, [s, r]] of t)
         yield [e(s, r, n), r];
     });
@@ -1601,13 +1624,13 @@ class u {
   }
   [Symbol.toStringTag] = "ReducedIterator";
 }
-class w {
+class _ {
   /**
    * The internal {@link SmartAsyncIterator} object that holds the elements to aggregate.
    */
   _elements;
   constructor(e) {
-    this._elements = new d(e);
+    this._elements = new m(e);
   }
   /**
    * Determines whether all elements of each group of the iterator satisfy a given condition.
@@ -1646,7 +1669,7 @@ class w {
       const [r, o] = t.get(n) ?? [0, !0];
       o && t.set(n, [r + 1, await e(n, s, r)]);
     }
-    return new u(function* () {
+    return new h(function* () {
       for (const [n, [s, r]] of t)
         yield [n, r];
     });
@@ -1688,14 +1711,14 @@ class w {
       const [r, o] = t.get(n) ?? [0, !1];
       o || t.set(n, [r + 1, await e(n, s, r)]);
     }
-    return new u(function* () {
+    return new h(function* () {
       for (const [n, [s, r]] of t)
         yield [n, r];
     });
   }
   filter(e) {
     const t = this._elements;
-    return new w(async function* () {
+    return new _(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -1737,7 +1760,7 @@ class w {
    */
   map(e) {
     const t = this._elements;
-    return new w(async function* () {
+    return new _(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -1759,7 +1782,7 @@ class w {
       }
       n.set(s, [o + 1, await e(s, a, r, o)]);
     }
-    return new u(function* () {
+    return new h(function* () {
       for (const [s, [r, o]] of n)
         yield [s, o];
     });
@@ -1802,13 +1825,13 @@ class w {
    */
   flatMap(e) {
     const t = this._elements;
-    return new w(async function* () {
+    return new _(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of t) {
         const o = n.get(s) ?? 0, a = await e(s, r, o);
         if (a instanceof Array)
-          for (const y of a)
-            yield [s, y];
+          for (const u of a)
+            yield [s, u];
         else
           yield [s, a];
         n.set(s, o + 1);
@@ -1846,7 +1869,7 @@ class w {
    */
   drop(e) {
     const t = this._elements;
-    return new w(async function* () {
+    return new _(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -1889,7 +1912,7 @@ class w {
    */
   take(e) {
     const t = this._elements;
-    return new w(async function* () {
+    return new _(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -1903,7 +1926,7 @@ class w {
       let [r, o] = t.get(n) ?? [0, void 0];
       o === void 0 && (await e(n, s, r) && (o = s), t.set(n, [r + 1, o]));
     }
-    return new u(function* () {
+    return new h(function* () {
       for (const [n, [s, r]] of t)
         yield [n, r];
     });
@@ -1965,7 +1988,7 @@ class w {
    */
   unique() {
     const e = this._elements;
-    return new w(async function* () {
+    return new _(async function* () {
       const t = /* @__PURE__ */ new Map();
       for await (const [n, s] of e) {
         const r = t.get(n) ?? /* @__PURE__ */ new Set();
@@ -2001,7 +2024,7 @@ class w {
       const n = e.get(t) ?? 0;
       e.set(t, n + 1);
     }
-    return new u(function* () {
+    return new h(function* () {
       for (const [t, n] of e)
         yield [t, n];
     });
@@ -2072,7 +2095,7 @@ class w {
    */
   reorganizeBy(e) {
     const t = this._elements;
-    return new w(async function* () {
+    return new _(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -2108,7 +2131,7 @@ class w {
    */
   keys() {
     const e = this._elements;
-    return new d(async function* () {
+    return new m(async function* () {
       const t = /* @__PURE__ */ new Set();
       for await (const [n] of e)
         t.has(n) || (t.add(n), yield n);
@@ -2172,7 +2195,7 @@ class w {
    */
   values() {
     const e = this._elements;
-    return new d(async function* () {
+    return new m(async function* () {
       for await (const [t, n] of e)
         yield n;
     });
@@ -2259,7 +2282,7 @@ class w {
   }
   [Symbol.toStringTag] = "AggregatedAsyncIterator";
 }
-class d {
+class m {
   /**
    * The native {@link AsyncIterator} object that is being wrapped by this instance.
    */
@@ -2383,7 +2406,7 @@ class d {
   }
   filter(e) {
     const t = this._iterator;
-    return new d(async function* () {
+    return new m(async function* () {
       let n = 0;
       for (; ; ) {
         const s = await t.next();
@@ -2426,7 +2449,7 @@ class d {
    */
   map(e) {
     const t = this._iterator;
-    return new d(async function* () {
+    return new m(async function* () {
       let n = 0;
       for (; ; ) {
         const s = await t.next();
@@ -2441,7 +2464,7 @@ class d {
     if (s === void 0) {
       const r = await this._iterator.next();
       if (r.done)
-        throw new f("Cannot reduce an empty iterator without an initial value.");
+        throw new c("Cannot reduce an empty iterator without an initial value.");
       s = r.value, n += 1;
     }
     for (; ; ) {
@@ -2484,7 +2507,7 @@ class d {
    */
   flatMap(e) {
     const t = this._iterator;
-    return new d(async function* () {
+    return new m(async function* () {
       let n = 0;
       for (; ; ) {
         const s = await t.next();
@@ -2533,7 +2556,7 @@ class d {
    */
   drop(e) {
     const t = this._iterator;
-    return new d(async function* () {
+    return new m(async function* () {
       let n = 0;
       for (; n < e; ) {
         if ((await t.next()).done)
@@ -2582,7 +2605,7 @@ class d {
    */
   take(e) {
     const t = this._iterator;
-    return new d(async function* () {
+    return new m(async function* () {
       let n = 0;
       for (; n < e; ) {
         const s = await t.next();
@@ -2661,7 +2684,7 @@ class d {
    */
   unique() {
     const e = this._iterator;
-    return new d(async function* () {
+    return new m(async function* () {
       const t = /* @__PURE__ */ new Set();
       for (; ; ) {
         const n = await e.next();
@@ -2878,7 +2901,7 @@ class d {
    * @returns A new instance of the {@link AggregatedAsyncIterator} class containing the grouped elements.
    */
   groupBy(e) {
-    return new w(this.map(async (t, n) => [await e(t, n), t]));
+    return new _(this.map(async (t, n) => [await e(t, n), t]));
   }
   /**
    * Materializes the iterator into an array.  
@@ -2911,7 +2934,7 @@ class d {
     return this;
   }
 }
-class h {
+class d {
   /**
    * The internal {@link SmartIterator} object that holds the elements to aggregate.
    */
@@ -2955,7 +2978,7 @@ class h {
       const [r, o] = t.get(n) ?? [0, !0];
       o && t.set(n, [r + 1, e(n, s, r)]);
     }
-    return new u(function* () {
+    return new h(function* () {
       for (const [n, [s, r]] of t)
         yield [n, r];
     });
@@ -2996,14 +3019,14 @@ class h {
       const [r, o] = t.get(n) ?? [0, !1];
       o || t.set(n, [r + 1, e(n, s, r)]);
     }
-    return new u(function* () {
+    return new h(function* () {
       for (const [n, [s, r]] of t)
         yield [n, r];
     });
   }
   filter(e) {
     const t = this._elements;
-    return new h(function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -3045,7 +3068,7 @@ class h {
    */
   map(e) {
     const t = this._elements;
-    return new h(function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -3067,7 +3090,7 @@ class h {
       }
       n.set(s, [o + 1, e(s, a, r, o)]);
     }
-    return new u(function* () {
+    return new h(function* () {
       for (const [s, [r, o]] of n)
         yield [s, o];
     });
@@ -3110,13 +3133,13 @@ class h {
    */
   flatMap(e) {
     const t = this._elements;
-    return new h(function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of t) {
         const o = n.get(s) ?? 0, a = e(s, r, o);
         if (a instanceof Array)
-          for (const y of a)
-            yield [s, y];
+          for (const u of a)
+            yield [s, u];
         else
           yield [s, a];
         n.set(s, o + 1);
@@ -3154,7 +3177,7 @@ class h {
    */
   drop(e) {
     const t = this._elements;
-    return new h(function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -3197,7 +3220,7 @@ class h {
    */
   take(e) {
     const t = this._elements;
-    return new h(function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -3211,7 +3234,7 @@ class h {
       let [r, o] = t.get(n) ?? [0, void 0];
       o === void 0 && (e(n, s, r) && (o = s), t.set(n, [r + 1, o]));
     }
-    return new u(function* () {
+    return new h(function* () {
       for (const [n, [s, r]] of t)
         yield [n, r];
     });
@@ -3273,7 +3296,7 @@ class h {
    */
   unique() {
     const e = this._elements;
-    return new h(function* () {
+    return new d(function* () {
       const t = /* @__PURE__ */ new Map();
       for (const [n, s] of e) {
         const r = t.get(n) ?? /* @__PURE__ */ new Set();
@@ -3308,7 +3331,7 @@ class h {
       const n = e.get(t) ?? 0;
       e.set(t, n + 1);
     }
-    return new u(function* () {
+    return new h(function* () {
       for (const [t, n] of e)
         yield [t, n];
     });
@@ -3377,7 +3400,7 @@ class h {
    */
   reorganizeBy(e) {
     const t = this._elements;
-    return new h(function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -3564,8 +3587,8 @@ class h {
   }
   [Symbol.toStringTag] = "AggregatedIterator";
 }
-const N = Function;
-class M extends N {
+const q = Function;
+class R extends q {
   /**
    * Initializes a new instance of the {@link CallableObject} class.
    */
@@ -3576,7 +3599,7 @@ class M extends N {
   }
   [Symbol.toStringTag] = "CallableObject";
 }
-class K extends M {
+class H extends R {
   /**
    * The array containing all the functions in the chain.
    */
@@ -3614,7 +3637,10 @@ class K extends M {
    * @returns An array containing the return values of all functions.
    */
   _invoke(...e) {
-    return this._callbacks.map((t) => t(...e));
+    const t = this._callbacks.length, n = new Array(t);
+    for (let s = 0; s < t; s += 1)
+      n[s] = this._callbacks[s](...e);
+    return n;
   }
   /**
    * Adds a function to the chain.
@@ -3746,24 +3772,31 @@ class g {
   }
   publish(e, ...t) {
     let n, s = this._subscribers.get(e);
-    return s ? n = s.slice().map((r) => r(...t)) : n = [], e.startsWith("__") || (s = this._subscribers.get("*"), s && s.slice().forEach((r) => r(e, ...t))), n;
+    if (s) {
+      const r = s.slice(), o = r.length;
+      n = new Array(o);
+      for (let a = 0; a < o; a += 1)
+        n[a] = r[a](...t);
+    } else
+      n = [];
+    return e.startsWith("__") || (s = this._subscribers.get("*"), s && s.slice().forEach((r) => r(e, ...t))), n;
   }
   subscribe(e, t) {
     const n = this._subscribers.get(e) ?? [];
     return n.push(t), this._subscribers.set(e, n), () => {
       const s = n.indexOf(t);
       if (s < 0)
-        throw new k("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed.");
+        throw new S("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed.");
       n.splice(s, 1);
     };
   }
   unsubscribe(e, t) {
     const n = this._subscribers.get(e);
     if (!n)
-      throw new k("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed or was never subscribed.");
+      throw new S("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed or was never subscribed.");
     const s = n.indexOf(t);
     if (s < 0)
-      throw new k("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed or was never subscribed.");
+      throw new S("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed or was never subscribed.");
     n.splice(s, 1), n.length === 0 && this._subscribers.delete(e);
   }
   unsubscribeAll(e) {
@@ -3794,9 +3827,9 @@ class g {
   }
   [Symbol.toStringTag] = "Publisher";
 }
-const q = () => {
+const I = () => {
 };
-class Q extends M {
+class X extends R {
   /**
    * The currently selected implementation of the callback.
    */
@@ -3844,7 +3877,7 @@ class Q extends M {
   _invoke;
   constructor(e, t = "default") {
     super(), this._callbacks = /* @__PURE__ */ new Map(), this._isEnabled = !0, e ? this._callbacks.set(t, e) : (t = "", e = (() => {
-      throw new P(
+      throw new j(
         "The `SwitchableCallback` has no callback defined yet. Did you forget to call the `register` method?"
       );
     })), this._key = t, this._callback = e, this._invoke = (...n) => this._callback(...n);
@@ -3874,16 +3907,16 @@ class Q extends M {
   enable(e) {
     if (e === void 0) {
       if (!this._key)
-        throw new p(
+        throw new y(
           "The `SwitchableCallback` has no callback defined yet. Did you forget to call the `register` method?"
         );
       e = this._key;
     } else if (e) {
       if (!this._callbacks.has(e))
-        throw new p(`The key '${e}' doesn't yet have any associated callback.`);
-    } else throw new p("The key must be a non-empty string.");
+        throw new y(`The key '${e}' doesn't yet have any associated callback.`);
+    } else throw new y("The key must be a non-empty string.");
     if (this._isEnabled)
-      throw new _("The `SwitchableCallback` is already enabled.");
+      throw new b("The `SwitchableCallback` is already enabled.");
     this._callback = this._callbacks.get(e), this._isEnabled = !0;
   }
   /**
@@ -3901,8 +3934,8 @@ class Q extends M {
    */
   disable() {
     if (!this._isEnabled)
-      throw new _("The `SwitchableCallback` is already disabled.");
-    this._callback = q, this._isEnabled = !1;
+      throw new b("The `SwitchableCallback` is already disabled.");
+    this._callback = I, this._isEnabled = !1;
   }
   /**
    * Registers a new implementation for the callback.
@@ -3928,7 +3961,7 @@ class Q extends M {
     if (this._callbacks.size === 0)
       this._key = e, this._callback = t;
     else if (this._callbacks.has(e))
-      throw new p(`The key '${e}' has already been used for another callback.`);
+      throw new y(`The key '${e}' has already been used for another callback.`);
     this._callbacks.set(e, t);
   }
   /**
@@ -3951,9 +3984,9 @@ class Q extends M {
    */
   unregister(e) {
     if (this._key === e)
-      throw new p("Unable to unregister the currently selected callback.");
+      throw new y("Unable to unregister the currently selected callback.");
     if (!this._callbacks.has(e))
-      throw new p(`The key '${e}' doesn't yet have any associated callback.`);
+      throw new y(`The key '${e}' doesn't yet have any associated callback.`);
     this._callbacks.delete(e);
   }
   /**
@@ -3976,12 +4009,231 @@ class Q extends M {
    */
   switch(e) {
     if (!this._callbacks.has(e))
-      throw new p(`The key '${e}' doesn't yet have any associated callback.`);
+      throw new y(`The key '${e}' doesn't yet have any associated callback.`);
     this._key !== e && (this._key = e, this._isEnabled && (this._callback = this._callbacks.get(e)));
   }
   [Symbol.toStringTag] = "SwitchableCallback";
 }
-class H extends Map {
+class Z extends Array {
+  /**
+   * The internal {@link Publisher} instance used to publish events.
+   */
+  _publisher;
+  constructor(...e) {
+    super(...e), this._publisher = new g();
+  }
+  /**
+   * Appends new elements to the end of the {@link Array} and returns the new length of the array.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const array = new ArrayView<number>();
+   * array.push(2, 4, 8);
+   *
+   * console.log(array); // ArrayView(3) [2, 4, 8]
+   * ```
+   *
+   * ---
+   *
+   * @param items New elements to add to the array.
+   *
+   * @returns The new length of the array.
+   */
+  push(...e) {
+    const t = this.length, n = super.push(...e);
+    for (let s = 0; s < e.length; s += 1)
+      this._publisher.publish("add", e[s], t + s);
+    return n;
+  }
+  /**
+   * Removes the last element from the {@link Array} and returns it.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const array = new ArrayView<number>(2, 4, 8);
+   * array.pop(); // 8
+   *
+   * console.log(array); // ArrayView(2) [2, 4]
+   * ```
+   *
+   * ---
+   *
+   * @returns The removed element, or `undefined` if the array is empty.
+   */
+  pop() {
+    const e = this.length - 1;
+    if (e < 0)
+      return;
+    const t = super.pop();
+    return this._publisher.publish("remove", t, e), t;
+  }
+  /**
+   * Removes the first element from the {@link Array} and returns it.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const array = new ArrayView<number>(2, 4, 8);
+   * array.shift(); // 2
+   *
+   * console.log(array); // ArrayView(2) [4, 8]
+   * ```
+   *
+   * ---
+   *
+   * @returns The removed element, or `undefined` if the array is empty.
+   */
+  shift() {
+    if (this.length === 0)
+      return;
+    const e = super.shift();
+    return this._publisher.publish("remove", e, 0), e;
+  }
+  /**
+   * Inserts new elements at the start of the {@link Array} and returns the new length of the array.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const array = new ArrayView<number>(4, 8);
+   * array.unshift(2);
+   *
+   * console.log(array); // ArrayView(3) [2, 4, 8]
+   * ```
+   *
+   * ---
+   *
+   * @param items Elements to insert at the start of the array.
+   *
+   * @returns The new length of the array.
+   */
+  unshift(...e) {
+    const t = super.unshift(...e);
+    for (let n = 0; n < e.length; n += 1)
+      this._publisher.publish("add", e[n], n);
+    return t;
+  }
+  /**
+   * Removes elements from the {@link Array} and, if necessary, inserts new elements in their place,
+   * returning the deleted elements.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const array = new ArrayView<number>(2, 4, 8, 16);
+   * array.splice(1, 2, 32, 64); // [4, 8]
+   *
+   * console.log(array); // ArrayView(4) [2, 32, 64, 16]
+   * ```
+   *
+   * ---
+   *
+   * @param start The zero-based location in the array from which to start removing elements.
+   * @param deleteCount The number of elements to remove.
+   * @param items Elements to insert into the array in place of the deleted elements.
+   *
+   * @returns An array containing the elements that were deleted.
+   */
+  splice(e, t, ...n) {
+    const s = e < 0 ? Math.max(this.length + e, 0) : Math.min(e, this.length), r = t === void 0 ? this.length - s : Math.min(Math.max(t, 0), this.length - s), o = super.splice(e, r, ...n);
+    for (let a = 0; a < o.length; a += 1)
+      this._publisher.publish("remove", o[a], s + a);
+    for (let a = 0; a < n.length; a += 1)
+      this._publisher.publish("add", n[a], s + a);
+    return o;
+  }
+  /**
+   * Removes all elements from the {@link Array}.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const array = new ArrayView<number>(2, 4, 8);
+   * array.clear();
+   *
+   * console.log(array); // ArrayView(0) []
+   * ```
+   */
+  clear() {
+    const e = this.length;
+    this.length = 0, e > 0 && this._publisher.publish("clear");
+  }
+  /**
+   * Subscribes to the `add` event of the array with a callback that will be executed when an element is added.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * array.onAdd((value, index) => console.log(`Added ${value} at index ${index}`));
+   *
+   * array.push(2); // "Added 2 at index 0"
+   * array.push(42); // "Added 42 at index 1"
+   * ```
+   *
+   * ---
+   *
+   * @param callback The callback that will be executed when an element is added to the array.
+   *
+   * @returns A function that can be used to unsubscribe from the event.
+   */
+  onAdd(e) {
+    return this._publisher.subscribe("add", e);
+  }
+  /**
+   * Subscribes to the `remove` event of the array with a callback that will be executed when an element is removed.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * array.onRemove((value, index) => console.log(`Removed ${value} at index ${index}`));
+   *
+   * array.pop(); // "Removed 8 at index 2"
+   * array.shift(); // "Removed 2 at index 0"
+   * ```
+   *
+   * ---
+   *
+   * @param callback The callback that will be executed when an element is removed from the array.
+   *
+   * @returns A function that can be used to unsubscribe from the event.
+   */
+  onRemove(e) {
+    return this._publisher.subscribe("remove", e);
+  }
+  /**
+   * Subscribes to the `clear` event of the array with a callback that will be executed when the array is cleared.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * array.onClear(() => console.log("The array has been cleared."));
+   * array.clear(); // "The array has been cleared."
+   * ```
+   *
+   * ---
+   *
+   * @param callback The callback that will be executed when the array is cleared.
+   *
+   * @returns A function that can be used to unsubscribe from the event.
+   */
+  onClear(e) {
+    return this._publisher.subscribe("clear", e);
+  }
+  [Symbol.toStringTag] = "ArrayView";
+  static [Symbol.species] = Array;
+}
+class W extends Map {
   /**
    * The internal {@link Publisher} instance used to publish events.
    */
@@ -4003,7 +4255,7 @@ class H extends Map {
   constructor(e) {
     if (super(), this._publisher = new g(), e)
       for (const [t, n] of e)
-        this.set(t, n);
+        super.set(t, n);
   }
   /**
    * Adds a new entry with a specified key and value to the {@link Map}.  
@@ -4138,7 +4390,7 @@ class H extends Map {
   }
   [Symbol.toStringTag] = "MapView";
 }
-class X extends Set {
+class U extends Set {
   /**
    * The internal {@link Publisher} instance used to publish events.
    */
@@ -4160,7 +4412,7 @@ class X extends Set {
   constructor(e) {
     if (super(), this._publisher = new g(), e)
       for (const t of e)
-        this.add(t);
+        super.add(t);
   }
   /**
    * Appends a new element with a specified value to the end of the {@link Set}.  
@@ -4175,7 +4427,7 @@ class X extends Set {
    *     .add(4)
    *     .add(8);
    *
-   * console.log(set); // SetView(4) { 2, 4, 8 }
+   * console.log(set); // SetView(3) { 2, 4, 8 }
    * ```
    *
    * ---
@@ -4294,7 +4546,7 @@ class X extends Set {
   }
   [Symbol.toStringTag] = "SetView";
 }
-class Z {
+class ee {
   /**
    * Whether to prefer the {@link localStorage} over the {@link sessionStorage} when calling an ambivalent method.
    *
@@ -4328,8 +4580,8 @@ class Z {
    * If omitted, it defaults to `true` to prefer the persistent storage.
    */
   constructor(e = !0) {
-    if (!T)
-      throw new j(
+    if (!E)
+      throw new z(
         "The `JSONStorage` class can only be instantiated within a browser environment."
       );
     this._preferPersistence = e, this._volatile = window.sessionStorage, this._persistent = window.localStorage;
@@ -4602,7 +4854,7 @@ class Z {
   }
   [Symbol.toStringTag] = "JSONStorage";
 }
-class m {
+class w {
   /**
    * Wraps a new {@link SmartPromise} object around an existing native {@link Promise} object.
    *
@@ -4627,7 +4879,7 @@ class m {
    * @returns A new {@link SmartPromise} object that wraps the provided promise.
    */
   static FromPromise(e) {
-    return new m((t, n) => e.then(t, n));
+    return new w((t, n) => e.then(t, n));
   }
   /**
    * A flag indicating whether the promise is still pending or not.
@@ -4735,7 +4987,7 @@ class m {
   }
   [Symbol.toStringTag] = "SmartPromise";
 }
-class R extends m {
+class F extends w {
   /**
    * The exposed function that allows to resolve the promise.
    *
@@ -4808,7 +5060,7 @@ class R extends m {
   }
   [Symbol.toStringTag] = "DeferredPromise";
 }
-class z extends m {
+class O extends w {
   /**
    * Initializes a new instance of the {@link TimedPromise} class.
    *
@@ -4833,17 +5085,17 @@ class z extends m {
    */
   constructor(e, t) {
     super((n, s) => {
-      const r = (v) => {
-        clearTimeout(y), n(v);
-      }, o = (v) => {
-        clearTimeout(y), s(v);
-      }, y = setTimeout(() => o(new O("The operation has timed out.")), t);
+      const r = (p) => {
+        clearTimeout(u), n(p);
+      }, o = (p) => {
+        clearTimeout(u), s(p);
+      }, u = setTimeout(() => o(new N("The operation has timed out.")), t);
       e(r, o);
     });
   }
   [Symbol.toStringTag] = "TimedPromise";
 }
-class W extends m {
+class te extends w {
   /**
    * The number of promises currently in the queue.
    */
@@ -4867,7 +5119,7 @@ class W extends m {
    * Accessing this property will always result in a {@link ValueException}.
    */
   get isRejected() {
-    throw new f("`PromiseQueue` doesn't support rejection states.");
+    throw new c("`PromiseQueue` doesn't support rejection states.");
   }
   /**
    * Initializes a new instance of the {@link PromiseQueue} class.
@@ -4876,7 +5128,7 @@ class W extends m {
     super((e) => e()), this._count = 0, this._isPending = !1, this._isFulfilled = !1, this._isRejected = !1;
   }
   enqueue(e, t) {
-    if (this._count += 1, e instanceof R) {
+    if (this._count += 1, e instanceof F) {
       const s = e;
       e = () => (s.resolve(), s);
     }
@@ -4887,18 +5139,18 @@ class W extends m {
         this._count -= 1, r(o);
       });
     };
-    return t ? new z(n, t) : new m(n);
+    return t ? new O(n, t) : new w(n);
   }
   [Symbol.toStringTag] = "PromiseQueue";
 }
-var S = /* @__PURE__ */ ((i) => (i[i.Millisecond = 1] = "Millisecond", i[i.Second = 1e3] = "Second", i[i.Minute = 6e4] = "Minute", i[i.Hour = 36e5] = "Hour", i[i.Day = 864e5] = "Day", i[i.Week = 6048e5] = "Week", i[i.Month = 2592e6] = "Month", i[i.Year = 31536e6] = "Year", i))(S || {}), $ = /* @__PURE__ */ ((i) => (i[i.Sunday = 0] = "Sunday", i[i.Monday = 1] = "Monday", i[i.Tuesday = 2] = "Tuesday", i[i.Wednesday = 3] = "Wednesday", i[i.Thursday = 4] = "Thursday", i[i.Friday = 5] = "Friday", i[i.Saturday = 6] = "Saturday", i))($ || {});
-function U(i, e, t = 864e5) {
+var k = /* @__PURE__ */ ((i) => (i[i.Millisecond = 1] = "Millisecond", i[i.Second = 1e3] = "Second", i[i.Minute = 6e4] = "Minute", i[i.Hour = 36e5] = "Hour", i[i.Day = 864e5] = "Day", i[i.Week = 6048e5] = "Week", i[i.Month = 2592e6] = "Month", i[i.Year = 31536e6] = "Year", i))(k || {}), $ = /* @__PURE__ */ ((i) => (i[i.Sunday = 0] = "Sunday", i[i.Monday = 1] = "Monday", i[i.Tuesday = 2] = "Tuesday", i[i.Wednesday = 3] = "Wednesday", i[i.Thursday = 4] = "Thursday", i[i.Friday = 5] = "Friday", i[i.Saturday = 6] = "Saturday", i))($ || {});
+function ne(i, e, t = 864e5) {
   let n;
   return i = new Date(i), e = new Date(e), i < e ? n = Math.floor : n = Math.ceil, n((e.getTime() - i.getTime()) / t);
 }
-function ee(i, e, t = 864e5) {
+function se(i, e, t = 864e5) {
   if (i = new Date(i), e = new Date(e), i >= e)
-    throw new b("The end date must be greater than the start date.");
+    throw new x("The end date must be greater than the start date.");
   return new l(function* () {
     const n = e.getTime();
     let s = i.getTime();
@@ -4906,23 +5158,23 @@ function ee(i, e, t = 864e5) {
       yield new Date(s), s += t;
   });
 }
-function I(i, e = 864e5) {
+function D(i, e = 864e5) {
   if (e <= 1)
-    throw new b(
+    throw new x(
       "Rounding a timestamp by milliseconds or less makes no sense.Use the timestamp value directly instead."
     );
   if (e > 864e5)
-    throw new b(
+    throw new x(
       "Rounding by more than a day leads to unexpected results. Consider using other methods to round dates by weeks, months or years."
     );
   return i = new Date(i), new Date(Math.floor(i.getTime() / e) * e);
 }
-function te(i, e = 0) {
+function re(i, e = 0) {
   i = new Date(i);
   const t = 7 - e, n = (i.getUTCDay() + t) % 7, s = i.getTime() - 864e5 * n;
-  return I(new Date(s));
+  return D(new Date(s));
 }
-class F {
+class C {
   /**
    * The handle of the interval or the animation frame, depending on the environment.  
    * It's used to stop the game loop when the {@link GameLoop._stop} method is called.
@@ -5000,7 +5252,7 @@ class F {
    * The interval in milliseconds that will be used if the current environment isn't a browser. Default is `40`.
    */
   constructor(e, t = 40) {
-    this._startTime = 0, this._isRunning = !1, T ? (this._start = () => {
+    this._startTime = 0, this._isRunning = !1, E ? (this._start = () => {
       e(this.elapsedTime), this._handle = window.requestAnimationFrame(this._start);
     }, this._stop = () => window.cancelAnimationFrame(this._handle)) : (console.warn(
       `Not a browser environment detected. Using setInterval@${t}ms instead of requestAnimationFrame...`
@@ -5027,7 +5279,7 @@ class F {
    */
   start(e = 0) {
     if (this._isRunning)
-      throw new _("The game loop has already been started.");
+      throw new b("The game loop has already been started.");
     this._startTime = performance.now() - e, this._start(), this._isRunning = !0, this._publisher.publish("start");
   }
   /**
@@ -5045,9 +5297,9 @@ class F {
    */
   stop() {
     if (!this._isRunning)
-      throw new _("The game loop had already stopped or hadn't yet started.");
+      throw new b("The game loop had already stopped or hadn't yet started.");
     if (!this._handle)
-      throw new x();
+      throw new v();
     this._stop(), this._handle = void 0, this._isRunning = !1, this._publisher.publish("stop");
   }
   /**
@@ -5090,7 +5342,7 @@ class F {
   }
   [Symbol.toStringTag] = "GameLoop";
 }
-class ne extends F {
+class ie extends C {
   /**
    * Initializes a new instance of the {@link Clock} class.
    *
@@ -5107,7 +5359,7 @@ class ne extends F {
    * The interval in milliseconds at which the clock will tick if the environment is not a browser.  
    * `TimeUnit.Second` by default.
    */
-  constructor(e = S.Second) {
+  constructor(e = k.Second) {
     super((t) => this._publisher.publish("tick", t), e);
   }
   /**
@@ -5129,7 +5381,7 @@ class ne extends F {
    */
   start(e = 0) {
     if (this._isRunning)
-      throw new _("The clock has already been started.");
+      throw new b("The clock has already been started.");
     this._startTime = performance.now() - e, this._start(), this._isRunning = !0, this._publisher.publish("start");
   }
   /**
@@ -5147,9 +5399,9 @@ class ne extends F {
    */
   stop() {
     if (!this._isRunning)
-      throw new _("The clock had already stopped or hadn't yet started.");
+      throw new b("The clock had already stopped or hadn't yet started.");
     if (!this._handle)
-      throw new x();
+      throw new v();
     this._stop(), this._handle = void 0, this._isRunning = !1, this._publisher.publish("stop");
   }
   /**
@@ -5178,7 +5430,7 @@ class ne extends F {
    */
   onTick(e, t = 0) {
     if (t < 0)
-      throw new b("The tick step must be a non-negative number.");
+      throw new x("The tick step must be a non-negative number.");
     if (t === 0)
       return this._publisher.subscribe("tick", e);
     let n = 0;
@@ -5188,7 +5440,7 @@ class ne extends F {
   }
   [Symbol.toStringTag] = "Clock";
 }
-class se extends F {
+class oe extends C {
   /**
    * The total duration of the countdown in milliseconds.
    *
@@ -5232,7 +5484,7 @@ class se extends F {
    * The interval in milliseconds at which the countdown will tick if the environment is not a browser.  
    * `TimeUnit.Second` by default.
    */
-  constructor(e, t = S.Second) {
+  constructor(e, t = k.Second) {
     const n = () => {
       const s = this.remainingTime;
       s <= 0 ? (this._deferrerStop(), this._publisher.publish("tick", 0), this._publisher.publish("expire")) : this._publisher.publish("tick", s);
@@ -5253,9 +5505,9 @@ class se extends F {
    */
   _deferrerStop(e) {
     if (!this._isRunning)
-      throw new _("The countdown hadn't yet started.");
+      throw new b("The countdown hadn't yet started.");
     if (!this._deferrer)
-      throw new x();
+      throw new v();
     this._stop(), this._handle = void 0, this._isRunning = !1, e !== void 0 ? this._deferrer.reject(e) : this._deferrer.resolve(), this._deferrer = void 0;
   }
   /**
@@ -5281,10 +5533,10 @@ class se extends F {
    */
   start(e = this.duration) {
     if (this._isRunning)
-      throw new _("The countdown had already stopped or hadn't yet started.");
+      throw new b("The countdown had already stopped or hadn't yet started.");
     if (this._deferrer)
-      throw new x();
-    return this._deferrer = new R(), super.start(this.duration - e), this._publisher.publish("start"), this._deferrer;
+      throw new v();
+    return this._deferrer = new F(), super.start(this.duration - e), this._publisher.publish("start"), this._deferrer;
   }
   /**
    * Stops the execution of the countdown.
@@ -5336,7 +5588,7 @@ class se extends F {
    */
   onTick(e, t = 0) {
     if (t < 0)
-      throw new b("The tick step must be a non-negative number.");
+      throw new x("The tick step must be a non-negative number.");
     if (t === 0)
       return this._publisher.subscribe("tick", e);
     let n = this.remainingTime;
@@ -5366,7 +5618,7 @@ class se extends F {
   }
   [Symbol.toStringTag] = "Countdown";
 }
-class re {
+class ae {
   /**
    * Generates a given number of values following a linear curve.  
    * The values are equally spaced and normalized between 0 and 1.
@@ -5424,7 +5676,7 @@ class re {
    */
   static Exponential(e, t = 2) {
     if (t < 0)
-      throw new f("The base of the exponential curve cannot be negative.");
+      throw new c("The base of the exponential curve cannot be negative.");
     const n = e - 1;
     return new l(function* () {
       for (let s = 0; s < e; s += 1)
@@ -5435,7 +5687,7 @@ class re {
   }
   [Symbol.toStringTag] = "Curve";
 }
-class C {
+class P {
   /**
    * Generates a random boolean value.
    *
@@ -5483,7 +5735,7 @@ class C {
    */
   static Index(e) {
     if (e.length === 0)
-      throw new f("You must provide at least one element.");
+      throw new c("You must provide at least one element.");
     return this.Integer(e.length);
   }
   /**
@@ -5501,35 +5753,99 @@ class C {
    * @returns A random element from the given array.
    */
   static Choice(e) {
-    return e[C.Index(e)];
+    return e[P.Index(e)];
+  }
+  static Sample(e, t, n) {
+    const s = e.length;
+    if (s === 0)
+      throw new c("You must provide at least one element.");
+    if (t < 0)
+      throw new c("Count must be non-negative.");
+    if (t > s)
+      throw new c("Count cannot exceed the number of elements.");
+    if (t === 0)
+      return [];
+    if (n === void 0) {
+      const a = Array.from(e), u = new Array(t);
+      for (let p = 0; p < t; p += 1) {
+        const T = this.Integer(p, s);
+        u[p] = a[T], a[T] = a[p];
+      }
+      return u;
+    }
+    if (n.length !== s)
+      throw new c("Weights array must have the same length as elements array.");
+    const r = new Array(s);
+    for (let a = 0; a < s; a += 1) {
+      if (n[a] <= 0)
+        throw new c(`Weight for element #${a} must be greater than zero.`);
+      r[a] = { index: a, key: Math.pow(Math.random(), 1 / n[a]) };
+    }
+    r.sort((a, u) => u.key - a.key);
+    const o = new Array(t);
+    for (let a = 0; a < t; a += 1)
+      o[a] = e[r[a].index];
+    return o;
+  }
+  static #e(e, t) {
+    const n = new Array(t - 1);
+    for (let a = 0; a < n.length; a += 1)
+      n[a] = Math.random() * e;
+    n.sort((a, u) => a - u);
+    const s = [0, ...n, e], r = new Array(t);
+    for (let a = 0; a < t; a += 1)
+      r[a] = Math.floor(s[a + 1] - s[a]);
+    let o = e - r.reduce((a, u) => a + u, 0);
+    for (; o > 0; )
+      r[this.Integer(t)] += 1, o -= 1;
+    return r;
+  }
+  static Split(e, t) {
+    if (t < 1)
+      throw new c("The number of splits must be greater than zero.");
+    if (typeof e == "number") {
+      if (e < 0)
+        throw new c("The total must be a non-negative number.");
+      return this.#e(e, t);
+    }
+    const n = Array.from(e), s = n.length;
+    if (s === 0)
+      throw new c("You must provide at least one element.");
+    if (t > s)
+      throw new c("The number of splits cannot exceed the number of elements.");
+    const r = this.#e(s, t), o = new Array(t);
+    let a = 0;
+    for (let u = 0; u < t; u += 1)
+      o[u] = n.slice(a, a + r[u]), a += r[u];
+    return o;
   }
   constructor() {
   }
   [Symbol.toStringTag] = "Random";
 }
-function ie(i) {
-  return new m((e) => setTimeout(e, i));
+function le(i) {
+  return new w((e) => setTimeout(e, i));
 }
-function oe() {
-  return new m((i) => requestAnimationFrame(() => i()));
+function ue() {
+  return new w((i) => requestAnimationFrame(() => i()));
 }
-function ae() {
-  return new m((i) => setTimeout(i));
+function ce() {
+  return new w((i) => setTimeout(i));
 }
-function le(i, e = "text/javascript") {
-  return new m((t, n) => {
+function he(i, e = "text/javascript") {
+  return new w((t, n) => {
     const s = document.createElement("script");
     s.async = !0, s.defer = !0, s.src = i, s.type = e, s.onload = (r) => t(), s.onerror = (r) => n(r), document.body.appendChild(s);
   });
 }
-function ue(...i) {
+function fe(...i) {
   return new l(function* () {
     for (const e of i)
       for (const t of e)
         yield t;
   });
 }
-function ce(i) {
+function de(i) {
   if (i instanceof Array)
     return i.length;
   let e = 0;
@@ -5537,16 +5853,16 @@ function ce(i) {
     e += 1;
   return e;
 }
-function he(i) {
+function me(i) {
   return new l(function* () {
     let e = 0;
     for (const t of i)
       yield [e, t], e += 1;
   });
 }
-function fe(i, e, t = 1) {
+function we(i, e, t = 1) {
   if (t <= 0)
-    throw new b(
+    throw new x(
       "Step must be always a positive number, even when generating numbers in reverse order."
     );
   return e === void 0 && (e = i, i = 0), i > e ? new l(function* () {
@@ -5557,7 +5873,7 @@ function fe(i, e, t = 1) {
       yield n;
   });
 }
-function de(i) {
+function pe(i) {
   const e = Array.from(i);
   for (let t = e.length - 1; t > 0; t -= 1) {
     const n = Math.floor(Math.random() * (t + 1));
@@ -5565,14 +5881,14 @@ function de(i) {
   }
   return e;
 }
-function me(i) {
+function _e(i) {
   return new l(function* () {
     const e = /* @__PURE__ */ new Set();
     for (const t of i)
       e.has(t) || (e.add(t), yield t);
   });
 }
-function A(i, e) {
+function Y(i, e) {
   const t = i[Symbol.iterator](), n = e[Symbol.iterator]();
   return new l(function* () {
     for (; ; ) {
@@ -5583,28 +5899,28 @@ function A(i, e) {
     }
   });
 }
-function we(i, e) {
+function be(i, e) {
   if (e === void 0) {
     let r = 0, o = 0;
     for (const a of i)
       r += a, o += 1;
     if (o === 0)
-      throw new f("You must provide at least one value.");
+      throw new c("You must provide at least one value.");
     return r / o;
   }
   let t = 0, n = 0, s = 0;
-  for (const [r, o] of A(i, e)) {
+  for (const [r, o] of Y(i, e)) {
     if (o <= 0)
-      throw new f(`The weight for the value #${s} must be greater than zero.`);
+      throw new c(`The weight for the value #${s} must be greater than zero.`);
     t += r * o, n += o, s += 1;
   }
   if (s === 0)
-    throw new f("You must provide at least one value and weight.");
+    throw new c("You must provide at least one value and weight.");
   if (n <= 0)
-    throw new f("The sum of weights must be greater than zero.");
+    throw new c("The sum of weights must be greater than zero.");
   return t / n;
 }
-function _e(i) {
+function ye(i) {
   let e = 0;
   for (let t = 0; t < i.length; t += 1) {
     const n = i.charCodeAt(t);
@@ -5612,78 +5928,80 @@ function _e(i) {
   }
   return e;
 }
-function pe(i) {
+function xe(i) {
   let e = 0;
   for (const t of i)
     e += t;
   return e;
 }
-function ye(i) {
+function ge(i) {
   return `${i.charAt(0).toUpperCase()}${i.slice(1)}`;
 }
-const be = "2.2.2";
+const ve = "2.2.4";
 export {
-  w as AggregatedAsyncIterator,
-  h as AggregatedIterator,
-  M as CallableObject,
-  K as CallbackChain,
-  ne as Clock,
-  se as Countdown,
-  re as Curve,
-  R as DeferredPromise,
-  j as EnvironmentException,
-  c as Exception,
-  x as FatalErrorException,
-  E as FileException,
+  _ as AggregatedAsyncIterator,
+  d as AggregatedIterator,
+  Z as ArrayView,
+  R as CallableObject,
+  H as CallbackChain,
+  ie as Clock,
+  oe as Countdown,
+  ae as Curve,
+  F as DeferredPromise,
+  z as EnvironmentException,
+  f as Exception,
+  v as FatalErrorException,
+  M as FileException,
   J as FileExistsException,
-  Y as FileNotFoundException,
-  F as GameLoop,
-  Z as JSONStorage,
-  p as KeyException,
-  H as MapView,
-  L as NetworkException,
-  P as NotImplementedException,
-  V as PermissionException,
-  W as PromiseQueue,
+  L as FileNotFoundException,
+  C as GameLoop,
+  ee as JSONStorage,
+  y as KeyException,
+  W as MapView,
+  A as NetworkException,
+  j as NotImplementedException,
+  K as PermissionException,
+  te as PromiseQueue,
   g as Publisher,
-  C as Random,
-  b as RangeException,
-  u as ReducedIterator,
-  k as ReferenceException,
-  _ as RuntimeException,
-  X as SetView,
-  d as SmartAsyncIterator,
+  P as Random,
+  x as RangeException,
+  h as ReducedIterator,
+  S as ReferenceException,
+  G as ResponseException,
+  b as RuntimeException,
+  U as SetView,
+  m as SmartAsyncIterator,
   l as SmartIterator,
-  m as SmartPromise,
-  Q as SwitchableCallback,
-  S as TimeUnit,
-  z as TimedPromise,
-  O as TimeoutException,
-  G as TypeException,
-  be as VERSION,
-  f as ValueException,
+  w as SmartPromise,
+  X as SwitchableCallback,
+  k as TimeUnit,
+  O as TimedPromise,
+  N as TimeoutException,
+  Q as TypeException,
+  ve as VERSION,
+  c as ValueException,
   $ as WeekDay,
-  we as average,
-  ye as capitalize,
-  ue as chain,
-  ce as count,
-  U as dateDifference,
-  ee as dateRange,
-  I as dateRound,
-  ie as delay,
-  he as enumerate,
-  te as getWeek,
-  _e as hash,
-  T as isBrowser,
-  D as isNode,
-  B as isWorker,
-  le as loadScript,
-  oe as nextAnimationFrame,
-  fe as range,
-  de as shuffle,
-  pe as sum,
-  me as unique,
-  ae as yieldToEventLoop,
-  A as zip
+  be as average,
+  ge as capitalize,
+  fe as chain,
+  de as count,
+  ne as dateDifference,
+  se as dateRange,
+  D as dateRound,
+  le as delay,
+  me as enumerate,
+  re as getWeek,
+  ye as hash,
+  E as isBrowser,
+  B as isNode,
+  V as isWorker,
+  he as loadScript,
+  ue as nextAnimationFrame,
+  we as range,
+  pe as shuffle,
+  xe as sum,
+  _e as unique,
+  ce as yieldToEventLoop,
+  Y as zip
 };
 //# sourceMappingURL=core.esm.js.map