@byloth/core 2.1.8 → 2.2.1

package/dist/core.esm.js

@@ -1,4 +1,4 @@
-const T = typeof window < "u" && typeof window.document < "u", A = typeof process < "u" && !!process.versions?.node, B = typeof self == "object" && self.constructor?.name === "DedicatedWorkerGlobalScope";
+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 {
   /**
    * A static method to convert a generic caught error, ensuring it's an instance of the {@link Exception} class.
@@ -166,7 +166,7 @@ class Y extends E {
   }
   [Symbol.toStringTag] = "FileNotFoundException";
 }
-class _ extends c {
+class p extends c {
   /**
    * Initializes a new instance of the {@link KeyException} class.
    *
@@ -232,7 +232,7 @@ class V extends c {
   }
   [Symbol.toStringTag] = "PermissionException";
 }
-class S extends c {
+class k extends c {
   /**
    * Initializes a new instance of the {@link ReferenceException} class.
    *
@@ -254,7 +254,7 @@ class S extends c {
   }
   [Symbol.toStringTag] = "ReferenceException";
 }
-class p extends c {
+class _ extends c {
   /**
    * Initializes a new instance of the {@link RuntimeException} class.
    *
@@ -276,7 +276,7 @@ class p extends c {
   }
   [Symbol.toStringTag] = "RuntimeException";
 }
-class j extends p {
+class j extends _ {
   /**
    * Initializes a new instance of the {@link EnvironmentException} class.
    *
@@ -298,7 +298,7 @@ class j extends p {
   }
   [Symbol.toStringTag] = "EnvironmentException";
 }
-class C extends c {
+class O extends c {
   /**
    * Initializes a new instance of the {@link TimeoutException} class.
    *
@@ -532,16 +532,16 @@ class l {
   reduce(e, t) {
     let n = 0, s = t;
     if (s === void 0) {
-      const i = this._iterator.next();
-      if (i.done)
+      const r = this._iterator.next();
+      if (r.done)
         throw new f("Cannot reduce an empty iterator without an initial value.");
-      s = i.value, n += 1;
+      s = r.value, n += 1;
     }
     for (; ; ) {
-      const i = this._iterator.next();
-      if (i.done)
+      const r = this._iterator.next();
+      if (r.done)
         return s;
-      s = e(s, i.value, n), n += 1;
+      s = e(s, r.value, n), n += 1;
     }
   }
   /**
@@ -583,12 +583,12 @@ class l {
         const s = t.next();
         if (s.done)
           return s.value;
-        const i = e(s.value, n);
-        if (i instanceof Array)
-          for (const o of i)
+        const r = e(s.value, n);
+        if (r instanceof Array)
+          for (const o of r)
             yield o;
         else
-          yield i;
+          yield r;
         n += 1;
       }
     });
@@ -1082,8 +1082,8 @@ class u {
   filter(e) {
     const t = this._elements.enumerate();
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        e(s, i, n) && (yield [s, i]);
+      for (const [n, [s, r]] of t)
+        e(s, r, n) && (yield [s, r]);
     });
   }
   /**
@@ -1122,20 +1122,20 @@ class u {
   map(e) {
     const t = this._elements.enumerate();
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        yield [s, e(s, i, n)];
+      for (const [n, [s, r]] of t)
+        yield [s, e(s, r, n)];
     });
   }
   reduce(e, t) {
     let n = 0, s = t;
     if (s === void 0) {
-      const i = this._elements.next();
-      if (i.done)
+      const r = this._elements.next();
+      if (r.done)
         throw new f("Cannot reduce an empty iterator without an initial value.");
-      s = i.value[1], n += 1;
+      s = r.value[1], n += 1;
     }
-    for (const [i, o] of this._elements)
-      s = e(i, s, o, n), n += 1;
+    for (const [r, o] of this._elements)
+      s = e(r, s, o, n), n += 1;
     return s;
   }
   /**
@@ -1174,8 +1174,8 @@ class u {
   flatMap(e) {
     const t = this._elements.enumerate();
     return new h(function* () {
-      for (const [n, [s, i]] of t) {
-        const o = e(s, i, n);
+      for (const [n, [s, r]] of t) {
+        const o = e(s, r, n);
         if (o instanceof Array)
           for (const a of o)
             yield [s, a];
@@ -1220,8 +1220,8 @@ class u {
   drop(e) {
     const t = this._elements.enumerate();
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        n >= e && (yield [s, i]);
+      for (const [n, [s, r]] of t)
+        n >= e && (yield [s, r]);
     });
   }
   /**
@@ -1262,10 +1262,10 @@ class u {
   take(e) {
     const t = this._elements.enumerate();
     return new u(function* () {
-      for (const [n, [s, i]] of t) {
+      for (const [n, [s, r]] of t) {
         if (n >= e)
           break;
-        yield [s, i];
+        yield [s, r];
       }
     });
   }
@@ -1428,8 +1428,8 @@ class u {
   reorganizeBy(e) {
     const t = this._elements.enumerate();
     return new h(function* () {
-      for (const [n, [s, i]] of t)
-        yield [e(s, i, n), i];
+      for (const [n, [s, r]] of t)
+        yield [e(s, r, n), r];
     });
   }
   /**
@@ -1605,7 +1605,7 @@ class u {
   }
   [Symbol.toStringTag] = "ReducedIterator";
 }
-class m {
+class w {
   /**
    * The internal {@link SmartAsyncIterator} object that holds the elements to aggregate.
    */
@@ -1647,12 +1647,12 @@ class m {
   async every(e) {
     const t = /* @__PURE__ */ new Map();
     for await (const [n, s] of this._elements) {
-      const [i, o] = t.get(n) ?? [0, !0];
-      o && t.set(n, [i + 1, await e(n, s, i)]);
+      const [r, o] = t.get(n) ?? [0, !0];
+      o && t.set(n, [r + 1, await e(n, s, r)]);
     }
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        yield [n, i];
+      for (const [n, [s, r]] of t)
+        yield [n, r];
     });
   }
   /**
@@ -1689,21 +1689,21 @@ class m {
   async some(e) {
     const t = /* @__PURE__ */ new Map();
     for await (const [n, s] of this._elements) {
-      const [i, o] = t.get(n) ?? [0, !1];
-      o || t.set(n, [i + 1, await e(n, s, i)]);
+      const [r, o] = t.get(n) ?? [0, !1];
+      o || t.set(n, [r + 1, await e(n, s, r)]);
     }
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        yield [n, i];
+      for (const [n, [s, r]] of t)
+        yield [n, r];
     });
   }
   filter(e) {
     const t = this._elements;
-    return new m(async function* () {
+    return new w(async function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [s, i] of t) {
+      for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        await e(s, i, o) && (yield [s, i]), n.set(s, o + 1);
+        await e(s, r, o) && (yield [s, r]), n.set(s, o + 1);
       }
     });
   }
@@ -1741,30 +1741,30 @@ class m {
    */
   map(e) {
     const t = this._elements;
-    return new m(async function* () {
+    return new w(async function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [s, i] of t) {
+      for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        yield [s, await e(s, i, o)], n.set(s, o + 1);
+        yield [s, await e(s, r, o)], n.set(s, o + 1);
       }
     });
   }
   async reduce(e, t) {
     const n = /* @__PURE__ */ new Map();
-    for await (const [s, i] of this._elements) {
+    for await (const [s, r] of this._elements) {
       let o, a;
       if (n.has(s))
         [o, a] = n.get(s);
       else if (t !== void 0)
         o = 0, t instanceof Function ? a = await t(s) : a = await t;
       else {
-        n.set(s, [0, i]);
+        n.set(s, [0, r]);
         continue;
       }
-      n.set(s, [o + 1, await e(s, a, i, o)]);
+      n.set(s, [o + 1, await e(s, a, r, o)]);
     }
     return new u(function* () {
-      for (const [s, [i, o]] of n)
+      for (const [s, [r, o]] of n)
         yield [s, o];
     });
   }
@@ -1806,10 +1806,10 @@ class m {
    */
   flatMap(e) {
     const t = this._elements;
-    return new m(async function* () {
+    return new w(async function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [s, i] of t) {
-        const o = n.get(s) ?? 0, a = await e(s, i, o);
+      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];
@@ -1850,15 +1850,15 @@ class m {
    */
   drop(e) {
     const t = this._elements;
-    return new m(async function* () {
+    return new w(async function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [s, i] of t) {
+      for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
         if (o < e) {
           n.set(s, o + 1);
           continue;
         }
-        yield [s, i];
+        yield [s, r];
       }
     });
   }
@@ -1893,23 +1893,23 @@ class m {
    */
   take(e) {
     const t = this._elements;
-    return new m(async function* () {
+    return new w(async function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [s, i] of t) {
+      for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        o >= e || (yield [s, i], n.set(s, o + 1));
+        o >= e || (yield [s, r], n.set(s, o + 1));
       }
     });
   }
   async find(e) {
     const t = /* @__PURE__ */ new Map();
     for await (const [n, s] of this._elements) {
-      let [i, o] = t.get(n) ?? [0, void 0];
-      o === void 0 && (await e(n, s, i) && (o = s), t.set(n, [i + 1, o]));
+      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* () {
-      for (const [n, [s, i]] of t)
-        yield [n, i];
+      for (const [n, [s, r]] of t)
+        yield [n, r];
     });
   }
   /**
@@ -1969,11 +1969,11 @@ class m {
    */
   unique() {
     const e = this._elements;
-    return new m(async function* () {
+    return new w(async function* () {
       const t = /* @__PURE__ */ new Map();
       for await (const [n, s] of e) {
-        const i = t.get(n) ?? /* @__PURE__ */ new Set();
-        i.has(s) || (i.add(s), t.set(n, i), yield [n, s]);
+        const r = t.get(n) ?? /* @__PURE__ */ new Set();
+        r.has(s) || (r.add(s), t.set(n, r), yield [n, s]);
       }
     });
   }
@@ -2039,8 +2039,8 @@ class m {
   async forEach(e) {
     const t = /* @__PURE__ */ new Map();
     for await (const [n, s] of this._elements) {
-      const i = t.get(n) ?? 0;
-      await e(n, s, i), t.set(n, i + 1);
+      const r = t.get(n) ?? 0;
+      await e(n, s, r), t.set(n, r + 1);
     }
   }
   /**
@@ -2076,11 +2076,11 @@ class m {
    */
   reorganizeBy(e) {
     const t = this._elements;
-    return new m(async function* () {
+    return new w(async function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [s, i] of t) {
+      for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        yield [await e(s, i, o), i], n.set(s, o + 1);
+        yield [await e(s, r, o), r], n.set(s, o + 1);
       }
     });
   }
@@ -2443,16 +2443,16 @@ class d {
   async reduce(e, t) {
     let n = 0, s = t;
     if (s === void 0) {
-      const i = await this._iterator.next();
-      if (i.done)
+      const r = await this._iterator.next();
+      if (r.done)
         throw new f("Cannot reduce an empty iterator without an initial value.");
-      s = i.value, n += 1;
+      s = r.value, n += 1;
     }
     for (; ; ) {
-      const i = await this._iterator.next();
-      if (i.done)
+      const r = await this._iterator.next();
+      if (r.done)
         return s;
-      s = await e(s, i.value, n), n += 1;
+      s = await e(s, r.value, n), n += 1;
     }
   }
   /**
@@ -2494,12 +2494,12 @@ class d {
         const s = await t.next();
         if (s.done)
           return s.value;
-        const i = await e(s.value, n);
-        if (i instanceof Array)
-          for (const o of i)
+        const r = await e(s.value, n);
+        if (r instanceof Array)
+          for (const o of r)
             yield o;
         else
-          yield i;
+          yield r;
         n += 1;
       }
     });
@@ -2882,7 +2882,7 @@ class d {
    * @returns A new instance of the {@link AggregatedAsyncIterator} class containing the grouped elements.
    */
   groupBy(e) {
-    return new m(this.map(async (t, n) => [await e(t, n), t]));
+    return new w(this.map(async (t, n) => [await e(t, n), t]));
   }
   /**
    * Materializes the iterator into an array.  
@@ -2956,12 +2956,12 @@ class h {
   every(e) {
     const t = /* @__PURE__ */ new Map();
     for (const [n, s] of this._elements) {
-      const [i, o] = t.get(n) ?? [0, !0];
-      o && t.set(n, [i + 1, e(n, s, i)]);
+      const [r, o] = t.get(n) ?? [0, !0];
+      o && t.set(n, [r + 1, e(n, s, r)]);
     }
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        yield [n, i];
+      for (const [n, [s, r]] of t)
+        yield [n, r];
     });
   }
   /**
@@ -2997,21 +2997,21 @@ class h {
   some(e) {
     const t = /* @__PURE__ */ new Map();
     for (const [n, s] of this._elements) {
-      const [i, o] = t.get(n) ?? [0, !1];
-      o || t.set(n, [i + 1, e(n, s, i)]);
+      const [r, o] = t.get(n) ?? [0, !1];
+      o || t.set(n, [r + 1, e(n, s, r)]);
     }
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        yield [n, i];
+      for (const [n, [s, r]] of t)
+        yield [n, r];
     });
   }
   filter(e) {
     const t = this._elements;
     return new h(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [s, i] of t) {
+      for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        e(s, i, o) && (yield [s, i]), n.set(s, o + 1);
+        e(s, r, o) && (yield [s, r]), n.set(s, o + 1);
       }
     });
   }
@@ -3051,28 +3051,28 @@ class h {
     const t = this._elements;
     return new h(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [s, i] of t) {
+      for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        yield [s, e(s, i, o)], n.set(s, o + 1);
+        yield [s, e(s, r, o)], n.set(s, o + 1);
       }
     });
   }
   reduce(e, t) {
     const n = /* @__PURE__ */ new Map();
-    for (const [s, i] of this._elements) {
+    for (const [s, r] of this._elements) {
       let o, a;
       if (n.has(s))
         [o, a] = n.get(s);
       else if (t !== void 0)
         o = 0, t instanceof Function ? a = t(s) : a = t;
       else {
-        n.set(s, [0, i]);
+        n.set(s, [0, r]);
         continue;
       }
-      n.set(s, [o + 1, e(s, a, i, o)]);
+      n.set(s, [o + 1, e(s, a, r, o)]);
     }
     return new u(function* () {
-      for (const [s, [i, o]] of n)
+      for (const [s, [r, o]] of n)
         yield [s, o];
     });
   }
@@ -3116,8 +3116,8 @@ class h {
     const t = this._elements;
     return new h(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [s, i] of t) {
-        const o = n.get(s) ?? 0, a = e(s, i, o);
+      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];
@@ -3160,13 +3160,13 @@ class h {
     const t = this._elements;
     return new h(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [s, i] of t) {
+      for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
         if (o < e) {
           n.set(s, o + 1);
           continue;
         }
-        yield [s, i];
+        yield [s, r];
       }
     });
   }
@@ -3203,21 +3203,21 @@ class h {
     const t = this._elements;
     return new h(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [s, i] of t) {
+      for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        o >= e || (yield [s, i], n.set(s, o + 1));
+        o >= e || (yield [s, r], n.set(s, o + 1));
       }
     });
   }
   find(e) {
     const t = /* @__PURE__ */ new Map();
     for (const [n, s] of this._elements) {
-      let [i, o] = t.get(n) ?? [0, void 0];
-      o === void 0 && (e(n, s, i) && (o = s), t.set(n, [i + 1, o]));
+      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* () {
-      for (const [n, [s, i]] of t)
-        yield [n, i];
+      for (const [n, [s, r]] of t)
+        yield [n, r];
     });
   }
   /**
@@ -3280,8 +3280,8 @@ class h {
     return new h(function* () {
       const t = /* @__PURE__ */ new Map();
       for (const [n, s] of e) {
-        const i = t.get(n) ?? /* @__PURE__ */ new Set();
-        i.has(s) || (i.add(s), t.set(n, i), yield [n, s]);
+        const r = t.get(n) ?? /* @__PURE__ */ new Set();
+        r.has(s) || (r.add(s), t.set(n, r), yield [n, s]);
       }
     });
   }
@@ -3344,8 +3344,8 @@ class h {
   forEach(e) {
     const t = /* @__PURE__ */ new Map();
     for (const [n, s] of this._elements) {
-      const i = t.get(n) ?? 0;
-      e(n, s, i), t.set(n, i + 1);
+      const r = t.get(n) ?? 0;
+      e(n, s, r), t.set(n, r + 1);
     }
   }
   /**
@@ -3383,9 +3383,9 @@ class h {
     const t = this._elements;
     return new h(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [s, i] of t) {
+      for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        yield [e(s, i, o), i], n.set(s, o + 1);
+        yield [e(s, r, o), r], n.set(s, o + 1);
       }
     });
   }
@@ -3569,7 +3569,7 @@ class h {
   [Symbol.toStringTag] = "AggregatedIterator";
 }
 const N = Function;
-class O extends N {
+class M extends N {
   /**
    * Initializes a new instance of the {@link CallableObject} class.
    */
@@ -3580,6 +3580,113 @@ class O extends N {
   }
   [Symbol.toStringTag] = "CallableObject";
 }
+class K extends M {
+  /**
+   * The array containing all the functions in the chain.
+   */
+  _callbacks;
+  /**
+   * Gets the number of functions currently in the chain.
+   */
+  get size() {
+    return this._callbacks.length;
+  }
+  /**
+   * Initializes a new instance of the {@link CallbackChain} class.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const chain = new CallbackChain();
+   * ```
+   *
+   * ---
+   *
+   * @param callback Optional initial functions to add to the chain.
+   */
+  constructor(...e) {
+    super(), this._callbacks = e;
+  }
+  /**
+   * Executes all functions in the chain sequentially with the provided arguments.
+   *
+   * ---
+   *
+   * @param args The arguments to pass to each function in the chain.
+   *
+   * @returns An array containing the return values of all functions.
+   */
+  _invoke(...e) {
+    return this._callbacks.map((t) => t(...e));
+  }
+  /**
+   * Adds a function to the chain.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const chain = new CallbackChain();
+   * const cleanup = () => console.log("Cleaning up..."));
+   *
+   * chain.add(cleanup);
+   * ```
+   *
+   * ---
+   *
+   * @param callback The function to add to the chain.
+   *
+   * @returns The current instance for method chaining.
+   */
+  add(e) {
+    return this._callbacks.push(e), this;
+  }
+  /**
+   * Removes a specific function from the chain.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const chain = new CallbackChain();
+   * const cleanup = () => console.log("Cleaning up..."));
+   *
+   * chain.add(cleanup);
+   * chain.remove(cleanup);
+   * ```
+   *
+   * ---
+   *
+   * @param callback The function to remove from the chain.
+   *
+   * @returns `true` if the function was found and removed, `false` otherwise.
+   */
+  remove(e) {
+    const t = this._callbacks.indexOf(e);
+    return t < 0 ? !1 : (this._callbacks.splice(t, 1), !0);
+  }
+  /**
+   * Removes all functions from the chain.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const chain = new CallbackChain();
+   *
+   * chain.add(() => console.log("Doing something..."));
+   * chain.add(() => console.log("Doing something else..."));
+   * chain.add(() => console.log("Doing yet another thing..."));
+   *
+   * chain.clear();
+   * ```
+   */
+  clear() {
+    this._callbacks.length = 0;
+  }
+  [Symbol.toStringTag] = "CallbackChain";
+}
 class g {
   /**
    * A map containing all the subscribers for each event.
@@ -3643,24 +3750,24 @@ class g {
   }
   publish(e, ...t) {
     let n, s = this._subscribers.get(e);
-    return s ? n = s.slice().map((i) => i(...t)) : n = [], e.startsWith("__") || (s = this._subscribers.get("*"), s && s.slice().forEach((i) => i(e, ...t))), n;
+    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;
   }
   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 S("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed.");
+        throw new k("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 S("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed or was never subscribed.");
+      throw new k("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 S("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed or was never subscribed.");
+      throw new k("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) {
@@ -3693,7 +3800,7 @@ class g {
 }
 const q = () => {
 };
-class K extends O {
+class Q extends M {
   /**
    * The currently selected implementation of the callback.
    */
@@ -3771,16 +3878,16 @@ class K extends O {
   enable(e) {
     if (e === void 0) {
       if (!this._key)
-        throw new _(
+        throw new p(
           "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 _(`The key '${e}' doesn't yet have any associated callback.`);
-    } else throw new _("The key must be a non-empty string.");
+        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.");
     if (this._isEnabled)
-      throw new p("The `SwitchableCallback` is already enabled.");
+      throw new _("The `SwitchableCallback` is already enabled.");
     this._callback = this._callbacks.get(e), this._isEnabled = !0;
   }
   /**
@@ -3798,7 +3905,7 @@ class K extends O {
    */
   disable() {
     if (!this._isEnabled)
-      throw new p("The `SwitchableCallback` is already disabled.");
+      throw new _("The `SwitchableCallback` is already disabled.");
     this._callback = q, this._isEnabled = !1;
   }
   /**
@@ -3825,7 +3932,7 @@ class K extends O {
     if (this._callbacks.size === 0)
       this._key = e, this._callback = t;
     else if (this._callbacks.has(e))
-      throw new _(`The key '${e}' has already been used for another callback.`);
+      throw new p(`The key '${e}' has already been used for another callback.`);
     this._callbacks.set(e, t);
   }
   /**
@@ -3848,9 +3955,9 @@ class K extends O {
    */
   unregister(e) {
     if (this._key === e)
-      throw new _("Unable to unregister the currently selected callback.");
+      throw new p("Unable to unregister the currently selected callback.");
     if (!this._callbacks.has(e))
-      throw new _(`The key '${e}' doesn't yet have any associated callback.`);
+      throw new p(`The key '${e}' doesn't yet have any associated callback.`);
     this._callbacks.delete(e);
   }
   /**
@@ -3873,12 +3980,12 @@ class K extends O {
    */
   switch(e) {
     if (!this._callbacks.has(e))
-      throw new _(`The key '${e}' doesn't yet have any associated callback.`);
+      throw new p(`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 Q extends Map {
+class H extends Map {
   /**
    * The internal {@link Publisher} instance used to publish events.
    */
@@ -3926,7 +4033,7 @@ class Q extends Map {
    * @returns The current instance of the {@link MapView} class.
    */
   set(e, t) {
-    return super.set(e, t), this._publisher.publish("entry:add", e, t), this;
+    return super.set(e, t), this._publisher.publish("add", e, t), this;
   }
   /**
    * Removes an entry with a specified key from the {@link Map}.
@@ -3950,7 +4057,7 @@ class Q extends Map {
    */
   delete(e) {
     const t = this.get(e);
-    return t === void 0 ? !1 : (super.delete(e), this._publisher.publish("entry:remove", e, t), !0);
+    return t === void 0 ? !1 : (super.delete(e), this._publisher.publish("remove", e, t), !0);
   }
   /**
    * Removes all entries from the {@link Map}.
@@ -3967,70 +4074,75 @@ class Q extends Map {
    */
   clear() {
     const e = this.size;
-    super.clear(), e > 0 && this._publisher.publish("collection:clear");
+    super.clear(), e > 0 && this._publisher.publish("clear");
   }
   /**
-   * Subscribes to an event and adds a callback to be executed when the event is published.
+   * Subscribes to the `add` event of the map with a callback that will be executed when an entry is added.
    *
    * ---
    *
    * @example
    * ```ts
-   * const map = new MapView<string, number>();
-   * const unsubscribe = map.subscribe("entry:add", (key: string, value: number) =>
-   * {
-   *     if (key === "answer") { unsubscribe(); }
-   *     console.log(`Added ${key}: ${value}`);
-   * });
+   * map.onAdd((key, value) => console.log(`Added ${key}: ${value}`));
    *
    * map.set("key1", 2); // "Added key1: 2"
    * map.set("answer", 42); // "Added answer: 42"
-   * map.set("key2", 4);
-   * map.set("key3", 8);
    * ```
    *
    * ---
    *
-   * @template T The key of the map containing the callback signature to subscribe.
+   * @param callback The callback that will be executed when an entry is added to the map.
    *
-   * @param event The name of the event to subscribe to.
-   * @param subscriber The callback to execute when the event is published.
-   *
-   * @returns A function that can be used to unsubscribe the callback from the event.
+   * @returns A function that can be used to unsubscribe from the event.
    */
-  subscribe(e, t) {
-    return this._publisher.subscribe(e, t);
+  onAdd(e) {
+    return this._publisher.subscribe("add", e);
   }
   /**
-   * Unsubscribes from an event and removes a callback from being executed when the event is published.
+   * Subscribes to the `remove` event of the map with a callback that will be executed when an entry is removed.
    *
    * ---
    *
    * @example
    * ```ts
-   * const callback = (key: string, value: number) => console.log(`Added ${key}: ${value}`);
-   * const map = new MapView<string, number>();
+   * map.onRemove((key, value) => console.log(`Removed ${key}: ${value}`));
    *
-   * map.subscribe("entry:add", callback);
-   * map.set("key1", 2); // "Added key1: 2"
+   * map.delete("key1"); // "Removed key1: 2"
+   * map.delete("answer"); // "Removed answer: 42"
+   * ```
    *
-   * map.unsubscribe("entry:add", callback);
-   * map.set("key2", 4);
+   * ---
+   *
+   * @param callback The callback that will be executed when an entry is removed from the map.
+   *
+   * @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 map with a callback that will be executed when the map is cleared.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * map.onClear(() => console.log("The map has all been cleared."));
+   * map.clear(); // "The map has all been cleared."
    * ```
    *
    * ---
    *
-   * @template T The key of the map containing the callback signature to unsubscribe.
+   * @param callback The callback that will be executed when the map is cleared.
    *
-   * @param event The name of the event to unsubscribe from.
-   * @param subscriber The callback to remove from the event.
+   * @returns A function that can be used to unsubscribe from the event.
    */
-  unsubscribe(e, t) {
-    this._publisher.unsubscribe(e, t);
+  onClear(e) {
+    return this._publisher.subscribe("clear", e);
   }
   [Symbol.toStringTag] = "MapView";
 }
-class H extends Set {
+class X extends Set {
   /**
    * The internal {@link Publisher} instance used to publish events.
    */
@@ -4077,7 +4189,7 @@ class H extends Set {
    * @returns The current instance of the {@link SetView} class.
    */
   add(e) {
-    return super.add(e), this._publisher.publish("entry:add", e), this;
+    return super.add(e), this._publisher.publish("add", e), this;
   }
   /**
    * Removes the specified value from the {@link Set}.
@@ -4101,7 +4213,7 @@ class H extends Set {
    */
   delete(e) {
     const t = super.delete(e);
-    return t && this._publisher.publish("entry:remove", e), t;
+    return t && this._publisher.publish("remove", e), t;
   }
   /**
    * Removes all entries from the {@link Set}.
@@ -4118,70 +4230,75 @@ class H extends Set {
    */
   clear() {
     const e = this.size;
-    super.clear(), e > 0 && this._publisher.publish("collection:clear");
+    super.clear(), e > 0 && this._publisher.publish("clear");
   }
   /**
-   * Subscribes to an event and adds a callback to be executed when the event is published.
+   * Subscribes to the `add` event of the set with a callback that will be executed when a value is added.
    *
    * ---
    *
    * @example
    * ```ts
-   * const set = new SetView<number>();
-   * const unsubscribe = set.subscribe("entry:add", (value: number) =>
-   * {
-   *     if (value === 42) { unsubscribe(); }
-   *     console.log(`Added ${value}`);
-   * });
+   * set.onAdd((value) => console.log(`Added ${value}`));
    *
    * set.add(2); // "Added 2"
    * set.add(42); // "Added 42"
-   * set.add(4);
-   * set.add(8);
    * ```
    *
    * ---
    *
-   * @template K The key of the map containing the callback signature to subscribe.
+   * @param callback The callback that will be executed when a value is added to the set.
    *
-   * @param event The name of the event to subscribe to.
-   * @param subscriber The callback to execute when the event is published.
-   *
-   * @returns A function that can be used to unsubscribe the callback from the event.
+   * @returns A function that can be used to unsubscribe from the event.
    */
-  subscribe(e, t) {
-    return this._publisher.subscribe(e, t);
+  onAdd(e) {
+    return this._publisher.subscribe("add", e);
   }
   /**
-   * Unsubscribes from an event and removes a callback from being executed when the event is published.
+   * Subscribes to the `remove` event of the set with a callback that will be executed when a value is removed.
    *
    * ---
    *
    * @example
    * ```ts
-   * const callback = (value: number) => console.log(`Added ${value}`);
-   * const set = new SetView<number>();
+   * set.onRemove((value) => console.log(`Removed ${value}`));
    *
-   * set.subscribe("entry:add", callback);
-   * set.add(2); // "Added 2"
+   * set.delete(2); // "Removed 2"
+   * set.delete(42); // "Removed 42"
+   * ```
+   *
+   * ---
+   *
+   * @param callback The callback that will be executed when a value is removed from the set.
+   *
+   * @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 set with a callback that will be executed when the set is cleared.
+   *
+   * ---
    *
-   * set.unsubscribe("entry:add", callback);
-   * set.add(4);
+   * @example
+   * ```ts
+   * set.onClear(() => console.log("The set has all been cleared."));
+   * set.clear(); // "The set has all been cleared."
    * ```
    *
    * ---
    *
-   * @template K The key of the map containing the callback signature to unsubscribe.
+   * @param callback The callback that will be executed when the set is cleared.
    *
-   * @param event The name of the event to unsubscribe from.
-   * @param subscriber The callback to remove from the event.
+   * @returns A function that can be used to unsubscribe from the event.
    */
-  unsubscribe(e, t) {
-    this._publisher.unsubscribe(e, t);
+  onClear(e) {
+    return this._publisher.subscribe("clear", e);
   }
   [Symbol.toStringTag] = "SetView";
 }
-class X {
+class Z {
   /**
    * Whether to prefer the {@link localStorage} over the {@link sessionStorage} when calling an ambivalent method.
    *
@@ -4489,7 +4606,7 @@ class X {
   }
   [Symbol.toStringTag] = "JSONStorage";
 }
-class w {
+class m {
   /**
    * Wraps a new {@link SmartPromise} object around an existing native {@link Promise} object.
    *
@@ -4514,7 +4631,7 @@ class w {
    * @returns A new {@link SmartPromise} object that wraps the provided promise.
    */
   static FromPromise(e) {
-    return new w((t, n) => e.then(t, n));
+    return new m((t, n) => e.then(t, n));
   }
   /**
    * A flag indicating whether the promise is still pending or not.
@@ -4622,7 +4739,7 @@ class w {
   }
   [Symbol.toStringTag] = "SmartPromise";
 }
-class M extends w {
+class R extends m {
   /**
    * The exposed function that allows to resolve the promise.
    *
@@ -4666,8 +4783,8 @@ class M extends w {
    */
   constructor(e, t) {
     let n, s;
-    super((i, o) => {
-      n = i, s = o;
+    super((r, o) => {
+      n = r, s = o;
     }), this._promise = this._promise.then(e, t), this._resolve = n, this._reject = s;
   }
   /**
@@ -4695,7 +4812,7 @@ class M extends w {
   }
   [Symbol.toStringTag] = "DeferredPromise";
 }
-class $ extends w {
+class z extends m {
   /**
    * Initializes a new instance of the {@link TimedPromise} class.
    *
@@ -4720,17 +4837,17 @@ class $ extends w {
    */
   constructor(e, t) {
     super((n, s) => {
-      const i = (v) => {
+      const r = (v) => {
         clearTimeout(y), n(v);
       }, o = (v) => {
         clearTimeout(y), s(v);
-      }, y = setTimeout(() => o(new C("The operation has timed out.")), t);
-      e(i, o);
+      }, y = setTimeout(() => o(new O("The operation has timed out.")), t);
+      e(r, o);
     });
   }
   [Symbol.toStringTag] = "TimedPromise";
 }
-class Z extends w {
+class W extends m {
   /**
    * The number of promises currently in the queue.
    */
@@ -4763,37 +4880,37 @@ class Z extends w {
     super((e) => e()), this._count = 0, this._isPending = !1, this._isFulfilled = !1, this._isRejected = !1;
   }
   enqueue(e, t) {
-    if (this._count += 1, e instanceof M) {
+    if (this._count += 1, e instanceof R) {
       const s = e;
       e = () => (s.resolve(), s);
     }
-    const n = (s, i) => {
+    const n = (s, r) => {
       this._promise = this._promise.then(e).then((o) => {
         this._count -= 1, s(o);
       }).catch((o) => {
-        this._count -= 1, i(o);
+        this._count -= 1, r(o);
       });
     };
-    return t ? new $(n, t) : new w(n);
+    return t ? new z(n, t) : new m(n);
   }
   [Symbol.toStringTag] = "PromiseQueue";
 }
-var k = /* @__PURE__ */ ((r) => (r[r.Millisecond = 1] = "Millisecond", r[r.Second = 1e3] = "Second", r[r.Minute = 6e4] = "Minute", r[r.Hour = 36e5] = "Hour", r[r.Day = 864e5] = "Day", r[r.Week = 6048e5] = "Week", r[r.Month = 2592e6] = "Month", r[r.Year = 31536e6] = "Year", r))(k || {}), z = /* @__PURE__ */ ((r) => (r[r.Sunday = 0] = "Sunday", r[r.Monday = 1] = "Monday", r[r.Tuesday = 2] = "Tuesday", r[r.Wednesday = 3] = "Wednesday", r[r.Thursday = 4] = "Thursday", r[r.Friday = 5] = "Friday", r[r.Saturday = 6] = "Saturday", r))(z || {});
-function W(r, e, t = 864e5) {
+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) {
   let n;
-  return r = new Date(r), e = new Date(e), r < e ? n = Math.floor : n = Math.ceil, n((e.getTime() - r.getTime()) / t);
+  return i = new Date(i), e = new Date(e), i < e ? n = Math.floor : n = Math.ceil, n((e.getTime() - i.getTime()) / t);
 }
-function U(r, e, t = 864e5) {
-  if (r = new Date(r), e = new Date(e), r >= e)
+function ee(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.");
   return new l(function* () {
     const n = e.getTime();
-    let s = r.getTime();
+    let s = i.getTime();
     for (; s < n; )
       yield new Date(s), s += t;
   });
 }
-function I(r, e = 864e5) {
+function I(i, e = 864e5) {
   if (e <= 1)
     throw new b(
       "Rounding a timestamp by milliseconds or less makes no sense.Use the timestamp value directly instead."
@@ -4802,11 +4919,11 @@ function I(r, e = 864e5) {
     throw new b(
       "Rounding by more than a day leads to unexpected results. Consider using other methods to round dates by weeks, months or years."
     );
-  return r = new Date(r), new Date(Math.floor(r.getTime() / e) * e);
+  return i = new Date(i), new Date(Math.floor(i.getTime() / e) * e);
 }
-function ee(r, e = 0) {
-  r = new Date(r);
-  const t = 7 - e, n = (r.getUTCDay() + t) % 7, s = r.getTime() - 864e5 * n;
+function te(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));
 }
 class F {
@@ -4914,7 +5031,7 @@ class F {
    */
   start(e = 0) {
     if (this._isRunning)
-      throw new p("The game loop has already been started.");
+      throw new _("The game loop has already been started.");
     this._startTime = performance.now() - e, this._start(), this._isRunning = !0, this._publisher.publish("start");
   }
   /**
@@ -4932,7 +5049,7 @@ class F {
    */
   stop() {
     if (!this._isRunning)
-      throw new p("The game loop had already stopped or hadn't yet started.");
+      throw new _("The game loop had already stopped or hadn't yet started.");
     if (!this._handle)
       throw new x();
     this._stop(), this._handle = void 0, this._isRunning = !1, this._publisher.publish("stop");
@@ -4977,7 +5094,7 @@ class F {
   }
   [Symbol.toStringTag] = "GameLoop";
 }
-class te extends F {
+class ne extends F {
   /**
    * Initializes a new instance of the {@link Clock} class.
    *
@@ -4994,7 +5111,7 @@ class te 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 = k.Second) {
+  constructor(e = S.Second) {
     super((t) => this._publisher.publish("tick", t), e);
   }
   /**
@@ -5016,7 +5133,7 @@ class te extends F {
    */
   start(e = 0) {
     if (this._isRunning)
-      throw new p("The clock has already been started.");
+      throw new _("The clock has already been started.");
     this._startTime = performance.now() - e, this._start(), this._isRunning = !0, this._publisher.publish("start");
   }
   /**
@@ -5034,7 +5151,7 @@ class te extends F {
    */
   stop() {
     if (!this._isRunning)
-      throw new p("The clock had already stopped or hadn't yet started.");
+      throw new _("The clock had already stopped or hadn't yet started.");
     if (!this._handle)
       throw new x();
     this._stop(), this._handle = void 0, this._isRunning = !1, this._publisher.publish("stop");
@@ -5075,7 +5192,7 @@ class te extends F {
   }
   [Symbol.toStringTag] = "Clock";
 }
-class ne extends F {
+class se extends F {
   /**
    * The total duration of the countdown in milliseconds.
    *
@@ -5119,7 +5236,7 @@ class ne 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 = k.Second) {
+  constructor(e, t = S.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);
@@ -5140,7 +5257,7 @@ class ne extends F {
    */
   _deferrerStop(e) {
     if (!this._isRunning)
-      throw new p("The countdown hadn't yet started.");
+      throw new _("The countdown hadn't yet started.");
     if (!this._deferrer)
       throw new x();
     this._stop(), this._handle = void 0, this._isRunning = !1, e !== void 0 ? this._deferrer.reject(e) : this._deferrer.resolve(), this._deferrer = void 0;
@@ -5168,10 +5285,10 @@ class ne extends F {
    */
   start(e = this.duration) {
     if (this._isRunning)
-      throw new p("The countdown had already stopped or hadn't yet started.");
+      throw new _("The countdown had already stopped or hadn't yet started.");
     if (this._deferrer)
       throw new x();
-    return this._deferrer = new M(), super.start(this.duration - e), this._publisher.publish("start"), this._deferrer;
+    return this._deferrer = new R(), super.start(this.duration - e), this._publisher.publish("start"), this._deferrer;
   }
   /**
    * Stops the execution of the countdown.
@@ -5197,26 +5314,6 @@ class ne extends F {
   stop(e) {
     this._deferrerStop(e), this._publisher.publish("stop", e);
   }
-  /**
-   * Subscribes to the `expire` event of the countdown.
-   *
-   * ---
-   *
-   * @example
-   * ```ts
-   * countdown.onExpire(() => { [...] }); // This callback will be executed once the countdown has expired.
-   * countdown.start();
-   * ```
-   *
-   * ---
-   *
-   * @param callback The callback that will be executed when the countdown expires.
-   *
-   * @returns A function that can be used to unsubscribe from the event.
-   */
-  onExpire(e) {
-    return this._publisher.subscribe("expire", e);
-  }
   /**
    * Subscribes to the `tick` event of the countdown.
    *
@@ -5251,9 +5348,29 @@ class ne extends F {
       n - s < t || (e(s), n = s);
     });
   }
+  /**
+   * Subscribes to the `expire` event of the countdown.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * countdown.onExpire(() => { [...] }); // This callback will be executed once the countdown has expired.
+   * countdown.start();
+   * ```
+   *
+   * ---
+   *
+   * @param callback The callback that will be executed when the countdown expires.
+   *
+   * @returns A function that can be used to unsubscribe from the event.
+   */
+  onExpire(e) {
+    return this._publisher.subscribe("expire", e);
+  }
   [Symbol.toStringTag] = "Countdown";
 }
-class se {
+class re {
   /**
    * Generates a given number of values following a linear curve.  
    * The values are equally spaced and normalized between 0 and 1.
@@ -5322,7 +5439,7 @@ class se {
   }
   [Symbol.toStringTag] = "Curve";
 }
-class R {
+class C {
   /**
    * Generates a random boolean value.
    *
@@ -5388,102 +5505,102 @@ class R {
    * @returns A random element from the given array.
    */
   static Choice(e) {
-    return e[R.Index(e)];
+    return e[C.Index(e)];
   }
   constructor() {
   }
   [Symbol.toStringTag] = "Random";
 }
-function ie(r) {
-  return new w((e) => setTimeout(e, r));
-}
-function re() {
-  return new w((r) => requestAnimationFrame(() => r()));
+function ie(i) {
+  return new m((e) => setTimeout(e, i));
 }
 function oe() {
-  return new w((r) => setTimeout(r));
+  return new m((i) => requestAnimationFrame(() => i()));
+}
+function ae() {
+  return new m((i) => setTimeout(i));
 }
-function ae(r, e = "text/javascript") {
-  return new w((t, n) => {
+function le(i, e = "text/javascript") {
+  return new m((t, n) => {
     const s = document.createElement("script");
-    s.async = !0, s.defer = !0, s.src = r, s.type = e, s.onload = (i) => t(), s.onerror = (i) => n(i), document.body.appendChild(s);
+    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 le(...r) {
+function ue(...i) {
   return new l(function* () {
-    for (const e of r)
+    for (const e of i)
       for (const t of e)
         yield t;
   });
 }
-function ue(r) {
-  if (r instanceof Array)
-    return r.length;
+function ce(i) {
+  if (i instanceof Array)
+    return i.length;
   let e = 0;
-  for (const t of r)
+  for (const t of i)
     e += 1;
   return e;
 }
-function ce(r) {
+function he(i) {
   return new l(function* () {
     let e = 0;
-    for (const t of r)
+    for (const t of i)
       yield [e, t], e += 1;
   });
 }
-function he(r, e, t = 1) {
+function fe(i, e, t = 1) {
   if (t <= 0)
     throw new b(
       "Step must be always a positive number, even when generating numbers in reverse order."
     );
-  return e === void 0 && (e = r, r = 0), r > e ? new l(function* () {
-    for (let n = r; n > e; n -= t)
+  return e === void 0 && (e = i, i = 0), i > e ? new l(function* () {
+    for (let n = i; n > e; n -= t)
       yield n;
   }) : new l(function* () {
-    for (let n = r; n < e; n += t)
+    for (let n = i; n < e; n += t)
       yield n;
   });
 }
-function fe(r) {
-  const e = Array.from(r);
+function de(i) {
+  const e = Array.from(i);
   for (let t = e.length - 1; t > 0; t -= 1) {
     const n = Math.floor(Math.random() * (t + 1));
     [e[t], e[n]] = [e[n], e[t]];
   }
   return e;
 }
-function de(r) {
+function me(i) {
   return new l(function* () {
     const e = /* @__PURE__ */ new Set();
-    for (const t of r)
+    for (const t of i)
       e.has(t) || (e.add(t), yield t);
   });
 }
-function D(r, e) {
-  const t = r[Symbol.iterator](), n = e[Symbol.iterator]();
+function A(i, e) {
+  const t = i[Symbol.iterator](), n = e[Symbol.iterator]();
   return new l(function* () {
     for (; ; ) {
-      const s = t.next(), i = n.next();
-      if (s.done || i.done)
+      const s = t.next(), r = n.next();
+      if (s.done || r.done)
         break;
-      yield [s.value, i.value];
+      yield [s.value, r.value];
     }
   });
 }
-function we(r, e) {
+function we(i, e) {
   if (e === void 0) {
-    let i = 0, o = 0;
-    for (const a of r)
-      i += a, o += 1;
+    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.");
-    return i / o;
+    return r / o;
   }
   let t = 0, n = 0, s = 0;
-  for (const [i, o] of D(r, e)) {
+  for (const [r, o] of A(i, e)) {
     if (o <= 0)
       throw new f(`The weight for the value #${s} must be greater than zero.`);
-    t += i * o, n += o, s += 1;
+    t += r * o, n += o, s += 1;
   }
   if (s === 0)
     throw new f("You must provide at least one value and weight.");
@@ -5491,32 +5608,33 @@ function we(r, e) {
     throw new f("The sum of weights must be greater than zero.");
   return t / n;
 }
-function me(r) {
+function _e(i) {
   let e = 0;
-  for (let t = 0; t < r.length; t += 1) {
-    const n = r.charCodeAt(t);
+  for (let t = 0; t < i.length; t += 1) {
+    const n = i.charCodeAt(t);
     e = (e << 5) - e + n, e |= 0;
   }
   return e;
 }
-function pe(r) {
+function pe(i) {
   let e = 0;
-  for (const t of r)
+  for (const t of i)
     e += t;
   return e;
 }
-function _e(r) {
-  return `${r.charAt(0).toUpperCase()}${r.slice(1)}`;
+function ye(i) {
+  return `${i.charAt(0).toUpperCase()}${i.slice(1)}`;
 }
-const ye = "2.1.8";
+const be = "2.2.1";
 export {
-  m as AggregatedAsyncIterator,
+  w as AggregatedAsyncIterator,
   h as AggregatedIterator,
-  O as CallableObject,
-  te as Clock,
-  ne as Countdown,
-  se as Curve,
-  M as DeferredPromise,
+  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,
@@ -5524,52 +5642,52 @@ export {
   J as FileExistsException,
   Y as FileNotFoundException,
   F as GameLoop,
-  X as JSONStorage,
-  _ as KeyException,
-  Q as MapView,
+  Z as JSONStorage,
+  p as KeyException,
+  H as MapView,
   L as NetworkException,
   P as NotImplementedException,
   V as PermissionException,
-  Z as PromiseQueue,
+  W as PromiseQueue,
   g as Publisher,
-  R as Random,
+  C as Random,
   b as RangeException,
   u as ReducedIterator,
-  S as ReferenceException,
-  p as RuntimeException,
-  H as SetView,
+  k as ReferenceException,
+  _ as RuntimeException,
+  X as SetView,
   d as SmartAsyncIterator,
   l as SmartIterator,
-  w as SmartPromise,
-  K as SwitchableCallback,
-  k as TimeUnit,
-  $ as TimedPromise,
-  C as TimeoutException,
+  m as SmartPromise,
+  Q as SwitchableCallback,
+  S as TimeUnit,
+  z as TimedPromise,
+  O as TimeoutException,
   G as TypeException,
-  ye as VERSION,
+  be as VERSION,
   f as ValueException,
-  z as WeekDay,
+  $ as WeekDay,
   we as average,
-  _e as capitalize,
-  le as chain,
-  ue as count,
-  W as dateDifference,
-  U as dateRange,
+  ye as capitalize,
+  ue as chain,
+  ce as count,
+  U as dateDifference,
+  ee as dateRange,
   I as dateRound,
   ie as delay,
-  ce as enumerate,
-  ee as getWeek,
-  me as hash,
+  he as enumerate,
+  te as getWeek,
+  _e as hash,
   T as isBrowser,
-  A as isNode,
+  D as isNode,
   B as isWorker,
-  ae as loadScript,
-  re as nextAnimationFrame,
-  he as range,
-  fe as shuffle,
+  le as loadScript,
+  oe as nextAnimationFrame,
+  fe as range,
+  de as shuffle,
   pe as sum,
-  de as unique,
-  oe as yieldToEventLoop,
-  D as zip
+  me as unique,
+  ae as yieldToEventLoop,
+  A as zip
 };
 //# sourceMappingURL=core.esm.js.map