@byloth/core 2.1.6 → 2.1.8

package/dist/core.esm.js

@@ -1,38 +1,5 @@
-var Ke = Object.defineProperty;
-var Qe = (i, n, e) => n in i ? Ke(i, n, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[n] = e;
-var a = (i, n, e) => Qe(i, typeof n != "symbol" ? n + "" : n, e);
-const Ye = typeof window < "u" && typeof window.document < "u";
-var A;
-const ot = typeof process < "u" && !!((A = process.versions) != null && A.node);
-var N;
-const at = typeof self == "object" && ((N = self.constructor) == null ? void 0 : N.name) === "DedicatedWorkerGlobalScope";
-var O, q;
-class c extends (q = Error, O = Symbol.toStringTag, q) {
-  /**
-   * Initializes a new instance of the {@link Exception} class.
-   *
-   * ---
-   *
-   * @example
-   * ```ts
-   * throw new Exception("An error occurred while processing the request.");
-   * ```
-   *
-   * ---
-   *
-   * @param message The message that describes the error.
-   * @param cause The previous caught error that caused this one, if any.
-   * @param name The name of the exception. Default is `"Exception"`.
-   */
-  constructor(e, t, s = "Exception") {
-    super(e);
-    a(this, O, "Exception");
-    this.cause = t, this.name = s, t && (t instanceof Error ? this.stack += `
-
-Caused by ${t.stack}` : this.stack += `
-
-Caused by ${t}`);
-  }
+const T = typeof window < "u" && typeof window.document < "u", A = 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.
    *
@@ -64,9 +31,32 @@ Caused by ${t}`);
     }
     return new c(`${e}`);
   }
+  /**
+   * Initializes a new instance of the {@link Exception} class.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * throw new Exception("An error occurred while processing the request.");
+   * ```
+   *
+   * ---
+   *
+   * @param message The message that describes the error.
+   * @param cause The previous caught error that caused this one, if any.
+   * @param name The name of the exception. Default is `"Exception"`.
+   */
+  constructor(e, t, n = "Exception") {
+    super(e), this.cause = t, this.name = n, t && (t instanceof Error ? this.stack += `
+
+Caused by ${t.stack}` : this.stack += `
+
+Caused by ${t}`);
+  }
+  [Symbol.toStringTag] = "Exception";
 }
-var $, z;
-class g extends (z = c, $ = Symbol.toStringTag, z) {
+class x extends c {
   /**
    * Initializes a new instance of the {@link FatalErrorException} class.
    *
@@ -83,14 +73,12 @@ class g extends (z = c, $ = Symbol.toStringTag, z) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"FatalErrorException"`.
    */
-  constructor(e, t, s = "FatalErrorException") {
-    e === void 0 && (e = "The program has encountered an unrecoverable error and cannot continue as expected. Please, try again later. If the problem persists, contact the support team.");
-    super(e, t, s);
-    a(this, $, "FatalErrorException");
+  constructor(e, t, n = "FatalErrorException") {
+    e === void 0 && (e = "The program has encountered an unrecoverable error and cannot continue as expected. Please, try again later. If the problem persists, contact the support team."), super(e, t, n);
   }
+  [Symbol.toStringTag] = "FatalErrorException";
 }
-var D, B;
-class He extends (B = g, D = Symbol.toStringTag, B) {
+class P extends x {
   /**
    * Initializes a new instance of the {@link NotImplementedException} class.
    *
@@ -107,14 +95,12 @@ class He extends (B = g, D = Symbol.toStringTag, B) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"NotImplementedException"`.
    */
-  constructor(e, t, s = "NotImplementedException") {
-    e === void 0 && (e = "This feature isn't implemented yet. Please, try again later.");
-    super(e, t, s);
-    a(this, D, "NotImplementedException");
+  constructor(e, t, n = "NotImplementedException") {
+    e === void 0 && (e = "This feature isn't implemented yet. Please, try again later."), super(e, t, n);
   }
+  [Symbol.toStringTag] = "NotImplementedException";
 }
-var J, Y;
-class Le extends (Y = c, J = Symbol.toStringTag, Y) {
+class E extends c {
   /**
    * Initializes a new instance of the {@link FileException} class.
    *
@@ -131,13 +117,12 @@ class Le extends (Y = c, J = Symbol.toStringTag, Y) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"FileException"`.
    */
-  constructor(e, t, s = "FileException") {
-    super(e, t, s);
-    a(this, J, "FileException");
+  constructor(e, t, n = "FileException") {
+    super(e, t, n);
   }
+  [Symbol.toStringTag] = "FileException";
 }
-var L, V;
-class lt extends (V = Le, L = Symbol.toStringTag, V) {
+class J extends E {
   /**
    * Initializes a new instance of the {@link FileExistsException} class.
    *
@@ -154,13 +139,12 @@ class lt extends (V = Le, L = Symbol.toStringTag, V) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"FileExistsException"`.
    */
-  constructor(e, t, s = "FileExistsException") {
-    super(e, t, s);
-    a(this, L, "FileExistsException");
+  constructor(e, t, n = "FileExistsException") {
+    super(e, t, n);
   }
+  [Symbol.toStringTag] = "FileExistsException";
 }
-var G, K;
-class ut extends (K = Le, G = Symbol.toStringTag, K) {
+class Y extends E {
   /**
    * Initializes a new instance of the {@link FileNotFoundException} class.
    *
@@ -177,13 +161,12 @@ class ut extends (K = Le, G = Symbol.toStringTag, K) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"FileNotFoundException"`.
    */
-  constructor(e, t, s = "FileNotFoundException") {
-    super(e, t, s);
-    a(this, G, "FileNotFoundException");
+  constructor(e, t, n = "FileNotFoundException") {
+    super(e, t, n);
   }
+  [Symbol.toStringTag] = "FileNotFoundException";
 }
-var Q, H;
-class _ extends (H = c, Q = Symbol.toStringTag, H) {
+class _ extends c {
   /**
    * Initializes a new instance of the {@link KeyException} class.
    *
@@ -200,13 +183,12 @@ class _ extends (H = c, Q = Symbol.toStringTag, H) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"KeyException"`.
    */
-  constructor(e, t, s = "KeyException") {
-    super(e, t, s);
-    a(this, Q, "KeyException");
+  constructor(e, t, n = "KeyException") {
+    super(e, t, n);
   }
+  [Symbol.toStringTag] = "KeyException";
 }
-var X, Z;
-class ct extends (Z = c, X = Symbol.toStringTag, Z) {
+class L extends c {
   /**
    * Initializes a new instance of the {@link NetworkException} class.
    *
@@ -223,13 +205,12 @@ class ct extends (Z = c, X = Symbol.toStringTag, Z) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"NetworkException"`.
    */
-  constructor(e, t, s = "NetworkException") {
-    super(e, t, s);
-    a(this, X, "NetworkException");
+  constructor(e, t, n = "NetworkException") {
+    super(e, t, n);
   }
+  [Symbol.toStringTag] = "NetworkException";
 }
-var W, U;
-class ht extends (U = c, W = Symbol.toStringTag, U) {
+class V extends c {
   /**
    * Initializes a new instance of the {@link PermissionException} class.
    *
@@ -246,13 +227,12 @@ class ht extends (U = c, W = Symbol.toStringTag, U) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"PermissionException"`.
    */
-  constructor(e, t, s = "PermissionException") {
-    super(e, t, s);
-    a(this, W, "PermissionException");
+  constructor(e, t, n = "PermissionException") {
+    super(e, t, n);
   }
+  [Symbol.toStringTag] = "PermissionException";
 }
-var ee, te;
-class E extends (te = c, ee = Symbol.toStringTag, te) {
+class S extends c {
   /**
    * Initializes a new instance of the {@link ReferenceException} class.
    *
@@ -269,13 +249,12 @@ class E extends (te = c, ee = Symbol.toStringTag, te) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"ReferenceException"`.
    */
-  constructor(e, t, s = "ReferenceException") {
-    super(e, t, s);
-    a(this, ee, "ReferenceException");
+  constructor(e, t, n = "ReferenceException") {
+    super(e, t, n);
   }
+  [Symbol.toStringTag] = "ReferenceException";
 }
-var ne, se;
-class p extends (se = c, ne = Symbol.toStringTag, se) {
+class p extends c {
   /**
    * Initializes a new instance of the {@link RuntimeException} class.
    *
@@ -292,13 +271,12 @@ class p extends (se = c, ne = Symbol.toStringTag, se) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"RuntimeException"`.
    */
-  constructor(e, t, s = "RuntimeException") {
-    super(e, t, s);
-    a(this, ne, "RuntimeException");
+  constructor(e, t, n = "RuntimeException") {
+    super(e, t, n);
   }
+  [Symbol.toStringTag] = "RuntimeException";
 }
-var re, ie;
-class Xe extends (ie = p, re = Symbol.toStringTag, ie) {
+class j extends p {
   /**
    * Initializes a new instance of the {@link EnvironmentException} class.
    *
@@ -315,13 +293,12 @@ class Xe extends (ie = p, re = Symbol.toStringTag, ie) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"EnvironmentException"`.
    */
-  constructor(e, t, s = "EnvironmentException") {
-    super(e, t, s);
-    a(this, re, "EnvironmentException");
+  constructor(e, t, n = "EnvironmentException") {
+    super(e, t, n);
   }
+  [Symbol.toStringTag] = "EnvironmentException";
 }
-var oe, ae;
-class Ze extends (ae = c, oe = Symbol.toStringTag, ae) {
+class C extends c {
   /**
    * Initializes a new instance of the {@link TimeoutException} class.
    *
@@ -338,13 +315,12 @@ class Ze extends (ae = c, oe = Symbol.toStringTag, ae) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"TimeoutException"`.
    */
-  constructor(e, t, s = "TimeoutException") {
-    super(e, t, s);
-    a(this, oe, "TimeoutException");
+  constructor(e, t, n = "TimeoutException") {
+    super(e, t, n);
   }
+  [Symbol.toStringTag] = "TimeoutException";
 }
-var le, ue;
-class ft extends (ue = c, le = Symbol.toStringTag, ue) {
+class G extends c {
   /**
    * Initializes a new instance of the {@link TypeException} class.
    *
@@ -361,13 +337,12 @@ class ft extends (ue = c, le = Symbol.toStringTag, ue) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"TypeException"`.
    */
-  constructor(e, t, s = "TypeException") {
-    super(e, t, s);
-    a(this, le, "TypeException");
+  constructor(e, t, n = "TypeException") {
+    super(e, t, n);
   }
+  [Symbol.toStringTag] = "TypeException";
 }
-var ce, he;
-class f extends (he = c, ce = Symbol.toStringTag, he) {
+class f extends c {
   /**
    * Initializes a new instance of the {@link ValueException} class.
    *
@@ -384,13 +359,12 @@ class f extends (he = c, ce = Symbol.toStringTag, he) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"ValueException"`.
    */
-  constructor(e, t, s = "ValueException") {
-    super(e, t, s);
-    a(this, ce, "ValueException");
+  constructor(e, t, n = "ValueException") {
+    super(e, t, n);
   }
+  [Symbol.toStringTag] = "ValueException";
 }
-var fe, de;
-class b extends (de = f, fe = Symbol.toStringTag, de) {
+class b extends f {
   /**
    * Initializes a new instance of the {@link RangeException} class.
    *
@@ -407,20 +381,18 @@ class b extends (de = f, fe = Symbol.toStringTag, de) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"RangeException"`.
    */
-  constructor(e, t, s = "RangeException") {
-    super(e, t, s);
-    a(this, fe, "RangeException");
+  constructor(e, t, n = "RangeException") {
+    super(e, t, n);
   }
+  [Symbol.toStringTag] = "RangeException";
 }
-var we;
-class u {
-  constructor(n) {
-    /**
-     * The native {@link Iterator} object that is being wrapped by this instance.
-     */
-    a(this, "_iterator");
-    a(this, we, "SmartIterator");
-    n instanceof Function ? this._iterator = n() : Symbol.iterator in n ? this._iterator = n[Symbol.iterator]() : this._iterator = n;
+class l {
+  /**
+   * The native {@link Iterator} object that is being wrapped by this instance.
+   */
+  _iterator;
+  constructor(e) {
+    e instanceof Function ? this._iterator = e() : Symbol.iterator in e ? this._iterator = e[Symbol.iterator]() : this._iterator = e;
   }
   /**
    * Determines whether all elements of the iterator satisfy a given condition.
@@ -451,15 +423,15 @@ class u {
    *
    * @returns `true` if all elements satisfy the condition, `false` otherwise.
    */
-  every(n) {
-    let e = 0;
+  every(e) {
+    let t = 0;
     for (; ; ) {
-      const t = this._iterator.next();
-      if (t.done)
+      const n = this._iterator.next();
+      if (n.done)
         return !0;
-      if (!n(t.value, e))
+      if (!e(n.value, t))
         return !1;
-      e += 1;
+      t += 1;
     }
   }
   /**
@@ -491,26 +463,26 @@ class u {
    *
    * @returns `true` if any element satisfies the condition, `false` otherwise.
    */
-  some(n) {
-    let e = 0;
+  some(e) {
+    let t = 0;
     for (; ; ) {
-      const t = this._iterator.next();
-      if (t.done)
+      const n = this._iterator.next();
+      if (n.done)
         return !1;
-      if (n(t.value, e))
+      if (e(n.value, t))
         return !0;
-      e += 1;
+      t += 1;
     }
   }
-  filter(n) {
-    const e = this._iterator;
-    return new u(function* () {
-      let t = 0;
+  filter(e) {
+    const t = this._iterator;
+    return new l(function* () {
+      let n = 0;
       for (; ; ) {
-        const s = e.next();
+        const s = t.next();
         if (s.done)
           return s.value;
-        n(s.value, t) && (yield s.value), t += 1;
+        e(s.value, n) && (yield s.value), n += 1;
       }
     });
   }
@@ -545,31 +517,31 @@ class u {
    *
    * @returns A new {@link SmartIterator} containing the transformed elements.
    */
-  map(n) {
-    const e = this._iterator;
-    return new u(function* () {
-      let t = 0;
+  map(e) {
+    const t = this._iterator;
+    return new l(function* () {
+      let n = 0;
       for (; ; ) {
-        const s = e.next();
+        const s = t.next();
         if (s.done)
           return s.value;
-        yield n(s.value, t), t += 1;
+        yield e(s.value, n), n += 1;
       }
     });
   }
-  reduce(n, e) {
-    let t = 0, s = e;
+  reduce(e, t) {
+    let n = 0, s = t;
     if (s === void 0) {
-      const r = this._iterator.next();
-      if (r.done)
+      const i = this._iterator.next();
+      if (i.done)
         throw new f("Cannot reduce an empty iterator without an initial value.");
-      s = r.value, t += 1;
+      s = i.value, n += 1;
     }
     for (; ; ) {
-      const r = this._iterator.next();
-      if (r.done)
+      const i = this._iterator.next();
+      if (i.done)
         return s;
-      s = n(s, r.value, t), t += 1;
+      s = e(s, i.value, n), n += 1;
     }
   }
   /**
@@ -603,21 +575,21 @@ class u {
    *
    * @returns A new {@link SmartIterator} containing the flattened elements.
    */
-  flatMap(n) {
-    const e = this._iterator;
-    return new u(function* () {
-      let t = 0;
+  flatMap(e) {
+    const t = this._iterator;
+    return new l(function* () {
+      let n = 0;
       for (; ; ) {
-        const s = e.next();
+        const s = t.next();
         if (s.done)
           return s.value;
-        const r = n(s.value, t);
-        if (r instanceof Array)
-          for (const o of r)
+        const i = e(s.value, n);
+        if (i instanceof Array)
+          for (const o of i)
             yield o;
         else
-          yield r;
-        t += 1;
+          yield i;
+        n += 1;
       }
     });
   }
@@ -652,17 +624,17 @@ class u {
    *
    * @returns A new {@link SmartIterator} containing the remaining elements.
    */
-  drop(n) {
-    const e = this._iterator;
-    return new u(function* () {
-      let t = 0;
-      for (; t < n; ) {
-        if (e.next().done)
+  drop(e) {
+    const t = this._iterator;
+    return new l(function* () {
+      let n = 0;
+      for (; n < e; ) {
+        if (t.next().done)
           return;
-        t += 1;
+        n += 1;
       }
       for (; ; ) {
-        const s = e.next();
+        const s = t.next();
         if (s.done)
           return s.value;
         yield s.value;
@@ -701,27 +673,27 @@ class u {
    *
    * @returns A new {@link SmartIterator} containing the taken elements.
    */
-  take(n) {
-    const e = this._iterator;
-    return new u(function* () {
-      let t = 0;
-      for (; t < n; ) {
-        const s = e.next();
+  take(e) {
+    const t = this._iterator;
+    return new l(function* () {
+      let n = 0;
+      for (; n < e; ) {
+        const s = t.next();
         if (s.done)
           return s.value;
-        yield s.value, t += 1;
+        yield s.value, n += 1;
       }
     });
   }
-  find(n) {
-    let e = 0;
+  find(e) {
+    let t = 0;
     for (; ; ) {
-      const t = this._iterator.next();
-      if (t.done)
+      const n = this._iterator.next();
+      if (n.done)
         return;
-      if (n(t.value, e))
-        return t.value;
-      e += 1;
+      if (e(n.value, t))
+        return n.value;
+      t += 1;
     }
   }
   /**
@@ -750,7 +722,7 @@ class u {
    * @returns A new {@link SmartIterator} containing the enumerated elements.
    */
   enumerate() {
-    return this.map((n, e) => [e, n]);
+    return this.map((e, t) => [t, e]);
   }
   /**
    * Removes all duplicate elements from the iterator.  
@@ -778,14 +750,14 @@ class u {
    * @returns A new {@link SmartIterator} containing only the unique elements.
    */
   unique() {
-    const n = this._iterator;
-    return new u(function* () {
-      const e = /* @__PURE__ */ new Set();
+    const e = this._iterator;
+    return new l(function* () {
+      const t = /* @__PURE__ */ new Set();
       for (; ; ) {
-        const t = n.next();
-        if (t.done)
-          return t.value;
-        e.has(t.value) || (e.add(t.value), yield t.value);
+        const n = e.next();
+        if (n.done)
+          return n.value;
+        t.has(n.value) || (t.add(n.value), yield n.value);
       }
     });
   }
@@ -810,11 +782,11 @@ class u {
    * @returns The number of elements in the iterator.
    */
   count() {
-    let n = 0;
+    let e = 0;
     for (; ; ) {
       if (this._iterator.next().done)
-        return n;
-      n += 1;
+        return e;
+      e += 1;
     }
   }
   /**
@@ -839,13 +811,13 @@ class u {
    *
    * @param iteratee The function to apply to each element of the iterator.
    */
-  forEach(n) {
-    let e = 0;
+  forEach(e) {
+    let t = 0;
     for (; ; ) {
-      const t = this._iterator.next();
-      if (t.done)
+      const n = this._iterator.next();
+      if (n.done)
         return;
-      n(t.value, e), e += 1;
+      e(n.value, t), t += 1;
     }
   }
   /**
@@ -877,8 +849,8 @@ class u {
    *
    * @returns The result of the iteration, containing the value of the operation.
    */
-  next(...n) {
-    return this._iterator.next(...n);
+  next(...e) {
+    return this._iterator.next(...e);
   }
   /**
    * An utility method that may be used to close the iterator gracefully,
@@ -912,8 +884,8 @@ class u {
    *
    * @returns The result of the iterator.
    */
-  return(n) {
-    return this._iterator.return ? this._iterator.return(n) : { done: !0, value: n };
+  return(e) {
+    return this._iterator.return ? this._iterator.return(e) : { done: !0, value: e };
   }
   /**
    * An utility method that may be used to close the iterator due to an error,
@@ -956,10 +928,10 @@ class u {
    *
    * @returns The final result of the iterator.
    */
-  throw(n) {
+  throw(e) {
     if (this._iterator.throw)
-      return this._iterator.throw(n);
-    throw n;
+      return this._iterator.throw(e);
+    throw e;
   }
   /**
    * An utility method that aggregates the elements of the iterator using a given key function.  
@@ -991,8 +963,8 @@ class u {
    *
    * @returns A new instance of the {@link AggregatedIterator} class containing the grouped elements.
    */
-  groupBy(n) {
-    return new x(this.map((e, t) => [n(e, t), e]));
+  groupBy(e) {
+    return new h(this.map((t, n) => [e(t, n), t]));
   }
   /**
    * Materializes the iterator into an array.  
@@ -1020,20 +992,18 @@ class u {
   toArray() {
     return Array.from(this);
   }
-  [(we = Symbol.toStringTag, Symbol.iterator)]() {
+  [Symbol.toStringTag] = "SmartIterator";
+  [Symbol.iterator]() {
     return this;
   }
 }
-var me;
-me = Symbol.toStringTag;
-const y = class y {
-  constructor(n) {
-    /**
-     * The internal {@link SmartIterator} object that holds the reduced elements.
-     */
-    a(this, "_elements");
-    a(this, me, "ReducedIterator");
-    this._elements = new u(n);
+class u {
+  /**
+   * The internal {@link SmartIterator} object that holds the reduced elements.
+   */
+  _elements;
+  constructor(e) {
+    this._elements = new l(e);
   }
   /**
    * Determines whether all elements of the reduced iterator satisfy the given condition.
@@ -1066,9 +1036,9 @@ const y = class y {
    *
    * @returns `true` if all elements satisfy the condition, `false` otherwise.
    */
-  every(n) {
-    for (const [e, [t, s]] of this._elements.enumerate())
-      if (!n(t, s, e))
+  every(e) {
+    for (const [t, [n, s]] of this._elements.enumerate())
+      if (!e(n, s, t))
         return !1;
     return !0;
   }
@@ -1103,17 +1073,17 @@ const y = class y {
    *
    * @returns `true` if any element satisfies the condition, `false` otherwise.
    */
-  some(n) {
-    for (const [e, [t, s]] of this._elements.enumerate())
-      if (n(t, s, e))
+  some(e) {
+    for (const [t, [n, s]] of this._elements.enumerate())
+      if (e(n, s, t))
         return !0;
     return !1;
   }
-  filter(n) {
-    const e = this._elements.enumerate();
-    return new y(function* () {
-      for (const [t, [s, r]] of e)
-        n(s, r, t) && (yield [s, r]);
+  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]);
     });
   }
   /**
@@ -1149,23 +1119,23 @@ const y = class y {
    *
    * @returns A new {@link ReducedIterator} containing the transformed elements.
    */
-  map(n) {
-    const e = this._elements.enumerate();
-    return new y(function* () {
-      for (const [t, [s, r]] of e)
-        yield [s, n(s, r, t)];
+  map(e) {
+    const t = this._elements.enumerate();
+    return new u(function* () {
+      for (const [n, [s, i]] of t)
+        yield [s, e(s, i, n)];
     });
   }
-  reduce(n, e) {
-    let t = 0, s = e;
+  reduce(e, t) {
+    let n = 0, s = t;
     if (s === void 0) {
-      const r = this._elements.next();
-      if (r.done)
+      const i = this._elements.next();
+      if (i.done)
         throw new f("Cannot reduce an empty iterator without an initial value.");
-      s = r.value[1], t += 1;
+      s = i.value[1], n += 1;
     }
-    for (const [r, o] of this._elements)
-      s = n(r, s, o, t), t += 1;
+    for (const [i, o] of this._elements)
+      s = e(i, s, o, n), n += 1;
     return s;
   }
   /**
@@ -1201,14 +1171,14 @@ const y = class y {
    *
    * @returns A new {@link AggregatedIterator} containing the flattened elements.
    */
-  flatMap(n) {
-    const e = this._elements.enumerate();
-    return new x(function* () {
-      for (const [t, [s, r]] of e) {
-        const o = n(s, r, t);
+  flatMap(e) {
+    const t = this._elements.enumerate();
+    return new h(function* () {
+      for (const [n, [s, i]] of t) {
+        const o = e(s, i, n);
         if (o instanceof Array)
-          for (const l of o)
-            yield [s, l];
+          for (const a of o)
+            yield [s, a];
         else
           yield [s, o];
       }
@@ -1247,11 +1217,11 @@ const y = class y {
    *
    * @returns A new {@link ReducedIterator} containing the remaining elements.
    */
-  drop(n) {
-    const e = this._elements.enumerate();
-    return new y(function* () {
-      for (const [t, [s, r]] of e)
-        t >= n && (yield [s, r]);
+  drop(e) {
+    const t = this._elements.enumerate();
+    return new u(function* () {
+      for (const [n, [s, i]] of t)
+        n >= e && (yield [s, i]);
     });
   }
   /**
@@ -1289,19 +1259,19 @@ const y = class y {
    *
    * @returns A new {@link ReducedIterator} containing the taken elements.
    */
-  take(n) {
-    const e = this._elements.enumerate();
-    return new y(function* () {
-      for (const [t, [s, r]] of e) {
-        if (t >= n)
+  take(e) {
+    const t = this._elements.enumerate();
+    return new u(function* () {
+      for (const [n, [s, i]] of t) {
+        if (n >= e)
           break;
-        yield [s, r];
+        yield [s, i];
       }
     });
   }
-  find(n) {
-    for (const [e, [t, s]] of this._elements.enumerate())
-      if (n(t, s, e))
+  find(e) {
+    for (const [t, [n, s]] of this._elements.enumerate())
+      if (e(n, s, t))
         return s;
   }
   /**
@@ -1332,7 +1302,7 @@ const y = class y {
    * @returns A new {@link ReducedIterator} object containing the enumerated elements.
    */
   enumerate() {
-    return this.map((n, e, t) => [t, e]);
+    return this.map((e, t, n) => [n, t]);
   }
   /**
    * Removes all duplicate elements from the reduced iterator.  
@@ -1360,11 +1330,11 @@ const y = class y {
    * @returns A new {@link ReducedIterator} containing only the unique elements.
    */
   unique() {
-    const n = this._elements;
-    return new y(function* () {
-      const e = /* @__PURE__ */ new Set();
-      for (const [t, s] of n)
-        e.has(s) || (e.add(s), yield [t, s]);
+    const e = this._elements;
+    return new u(function* () {
+      const t = /* @__PURE__ */ new Set();
+      for (const [n, s] of e)
+        t.has(s) || (t.add(s), yield [n, s]);
     });
   }
   /**
@@ -1390,10 +1360,10 @@ const y = class y {
    * @returns The number of elements in the iterator.
    */
   count() {
-    let n = 0;
-    for (const e of this._elements)
-      n += 1;
-    return n;
+    let e = 0;
+    for (const t of this._elements)
+      e += 1;
+    return e;
   }
   /**
    * Iterates over all elements of the reduced iterator.  
@@ -1420,9 +1390,9 @@ const y = class y {
    *
    * @param iteratee The function to apply to each element of the reduced iterator.
    */
-  forEach(n) {
-    for (const [e, [t, s]] of this._elements.enumerate())
-      n(t, s, e);
+  forEach(e) {
+    for (const [t, [n, s]] of this._elements.enumerate())
+      e(n, s, t);
   }
   /**
    * Reaggregates the elements of the reduced iterator.  
@@ -1455,11 +1425,11 @@ const y = class y {
    *
    * @returns A new {@link AggregatedIterator} containing the elements reorganized by the new keys.
    */
-  reorganizeBy(n) {
-    const e = this._elements.enumerate();
-    return new x(function* () {
-      for (const [t, [s, r]] of e)
-        yield [n(s, r, t), r];
+  reorganizeBy(e) {
+    const t = this._elements.enumerate();
+    return new h(function* () {
+      for (const [n, [s, i]] of t)
+        yield [e(s, i, n), i];
     });
   }
   /**
@@ -1490,10 +1460,10 @@ const y = class y {
    * @returns A new {@link SmartIterator} containing all the keys of the iterator.
    */
   keys() {
-    const n = this._elements;
-    return new u(function* () {
-      for (const [e] of n)
-        yield e;
+    const e = this._elements;
+    return new l(function* () {
+      for (const [t] of e)
+        yield t;
     });
   }
   /**
@@ -1555,10 +1525,10 @@ const y = class y {
    * @returns A new {@link SmartIterator} containing all the values of the iterator.
    */
   values() {
-    const n = this._elements;
-    return new u(function* () {
-      for (const [e, t] of n)
-        yield t;
+    const e = this._elements;
+    return new l(function* () {
+      for (const [t, n] of e)
+        yield n;
     });
   }
   /**
@@ -1633,18 +1603,15 @@ const y = class y {
   toObject() {
     return Object.fromEntries(this.entries());
   }
-};
-let h = y;
-var pe;
-pe = Symbol.toStringTag;
-const w = class w {
-  constructor(n) {
-    /**
-     * The internal {@link SmartAsyncIterator} object that holds the elements to aggregate.
-     */
-    a(this, "_elements");
-    a(this, pe, "AggregatedAsyncIterator");
-    this._elements = new d(n);
+  [Symbol.toStringTag] = "ReducedIterator";
+}
+class m {
+  /**
+   * The internal {@link SmartAsyncIterator} object that holds the elements to aggregate.
+   */
+  _elements;
+  constructor(e) {
+    this._elements = new d(e);
   }
   /**
    * Determines whether all elements of each group of the iterator satisfy a given condition.
@@ -1677,15 +1644,15 @@ const w = class w {
    * @returns
    * A {@link Promise} resolving to a new {@link ReducedIterator} containing the boolean results for each group.
    */
-  async every(n) {
-    const e = /* @__PURE__ */ new Map();
-    for await (const [t, s] of this._elements) {
-      const [r, o] = e.get(t) ?? [0, !0];
-      o && e.set(t, [r + 1, await n(t, s, r)]);
+  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)]);
     }
-    return new h(function* () {
-      for (const [t, [s, r]] of e)
-        yield [t, r];
+    return new u(function* () {
+      for (const [n, [s, i]] of t)
+        yield [n, i];
     });
   }
   /**
@@ -1719,24 +1686,24 @@ const w = class w {
    * @returns
    * A {@link Promise} resolving to a new {@link ReducedIterator} containing the boolean results for each group.
    */
-  async some(n) {
-    const e = /* @__PURE__ */ new Map();
-    for await (const [t, s] of this._elements) {
-      const [r, o] = e.get(t) ?? [0, !1];
-      o || e.set(t, [r + 1, await n(t, s, r)]);
+  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)]);
     }
-    return new h(function* () {
-      for (const [t, [s, r]] of e)
-        yield [t, r];
+    return new u(function* () {
+      for (const [n, [s, i]] of t)
+        yield [n, i];
     });
   }
-  filter(n) {
-    const e = this._elements;
-    return new w(async function* () {
-      const t = /* @__PURE__ */ new Map();
-      for await (const [s, r] of e) {
-        const o = t.get(s) ?? 0;
-        await n(s, r, o) && (yield [s, r]), t.set(s, o + 1);
+  filter(e) {
+    const t = this._elements;
+    return new m(async function* () {
+      const n = /* @__PURE__ */ new Map();
+      for await (const [s, i] of t) {
+        const o = n.get(s) ?? 0;
+        await e(s, i, o) && (yield [s, i]), n.set(s, o + 1);
       }
     });
   }
@@ -1772,32 +1739,32 @@ const w = class w {
    *
    * @returns A new {@link AggregatedAsyncIterator} containing the transformed elements.
    */
-  map(n) {
-    const e = this._elements;
-    return new w(async function* () {
-      const t = /* @__PURE__ */ new Map();
-      for await (const [s, r] of e) {
-        const o = t.get(s) ?? 0;
-        yield [s, await n(s, r, o)], t.set(s, o + 1);
+  map(e) {
+    const t = this._elements;
+    return new m(async function* () {
+      const n = /* @__PURE__ */ new Map();
+      for await (const [s, i] of t) {
+        const o = n.get(s) ?? 0;
+        yield [s, await e(s, i, o)], n.set(s, o + 1);
       }
     });
   }
-  async reduce(n, e) {
-    const t = /* @__PURE__ */ new Map();
-    for await (const [s, r] of this._elements) {
-      let o, l;
-      if (t.has(s))
-        [o, l] = t.get(s);
-      else if (e !== void 0)
-        o = 0, e instanceof Function ? l = await e(s) : l = await e;
+  async reduce(e, t) {
+    const n = /* @__PURE__ */ new Map();
+    for await (const [s, i] 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 {
-        t.set(s, [0, r]);
+        n.set(s, [0, i]);
         continue;
       }
-      t.set(s, [o + 1, await n(s, l, r, o)]);
+      n.set(s, [o + 1, await e(s, a, i, o)]);
     }
-    return new h(function* () {
-      for (const [s, [r, o]] of t)
+    return new u(function* () {
+      for (const [s, [i, o]] of n)
         yield [s, o];
     });
   }
@@ -1837,18 +1804,18 @@ const w = class w {
    *
    * @returns A new {@link AggregatedAsyncIterator} containing the transformed elements.
    */
-  flatMap(n) {
-    const e = this._elements;
-    return new w(async function* () {
-      const t = /* @__PURE__ */ new Map();
-      for await (const [s, r] of e) {
-        const o = t.get(s) ?? 0, l = await n(s, r, o);
-        if (l instanceof Array)
-          for (const k of l)
-            yield [s, k];
+  flatMap(e) {
+    const t = this._elements;
+    return new m(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);
+        if (a instanceof Array)
+          for (const y of a)
+            yield [s, y];
         else
-          yield [s, l];
-        t.set(s, o + 1);
+          yield [s, a];
+        n.set(s, o + 1);
       }
     });
   }
@@ -1881,17 +1848,17 @@ const w = class w {
    *
    * @returns A new {@link AggregatedAsyncIterator} containing the remaining elements.
    */
-  drop(n) {
-    const e = this._elements;
-    return new w(async function* () {
-      const t = /* @__PURE__ */ new Map();
-      for await (const [s, r] of e) {
-        const o = t.get(s) ?? 0;
-        if (o < n) {
-          t.set(s, o + 1);
+  drop(e) {
+    const t = this._elements;
+    return new m(async function* () {
+      const n = /* @__PURE__ */ new Map();
+      for await (const [s, i] of t) {
+        const o = n.get(s) ?? 0;
+        if (o < e) {
+          n.set(s, o + 1);
           continue;
         }
-        yield [s, r];
+        yield [s, i];
       }
     });
   }
@@ -1924,25 +1891,25 @@ const w = class w {
    *
    * @returns A new {@link AggregatedAsyncIterator} containing the taken elements.
    */
-  take(n) {
-    const e = this._elements;
-    return new w(async function* () {
-      const t = /* @__PURE__ */ new Map();
-      for await (const [s, r] of e) {
-        const o = t.get(s) ?? 0;
-        o >= n || (yield [s, r], t.set(s, o + 1));
+  take(e) {
+    const t = this._elements;
+    return new m(async function* () {
+      const n = /* @__PURE__ */ new Map();
+      for await (const [s, i] of t) {
+        const o = n.get(s) ?? 0;
+        o >= e || (yield [s, i], n.set(s, o + 1));
       }
     });
   }
-  async find(n) {
-    const e = /* @__PURE__ */ new Map();
-    for await (const [t, s] of this._elements) {
-      let [r, o] = e.get(t) ?? [0, void 0];
-      o === void 0 && (await n(t, s, r) && (o = s), e.set(t, [r + 1, o]));
+  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]));
     }
-    return new h(function* () {
-      for (const [t, [s, r]] of e)
-        yield [t, r];
+    return new u(function* () {
+      for (const [n, [s, i]] of t)
+        yield [n, i];
     });
   }
   /**
@@ -1972,7 +1939,7 @@ const w = class w {
    * @returns A new {@link AggregatedAsyncIterator} containing the enumerated elements.
    */
   enumerate() {
-    return this.map((n, e, t) => [t, e]);
+    return this.map((e, t, n) => [n, t]);
   }
   /**
    * Removes all duplicate elements from within each group of the iterator.  
@@ -2001,12 +1968,12 @@ const w = class w {
    * @returns A new {@link AggregatedAsyncIterator} containing only the unique elements.
    */
   unique() {
-    const n = this._elements;
-    return new w(async function* () {
-      const e = /* @__PURE__ */ new Map();
-      for await (const [t, s] of n) {
-        const r = e.get(t) ?? /* @__PURE__ */ new Set();
-        r.has(s) || (r.add(s), e.set(t, r), yield [t, s]);
+    const e = this._elements;
+    return new m(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]);
       }
     });
   }
@@ -2033,14 +2000,14 @@ const w = class w {
    * A {@link Promise} resolving to a new {@link ReducedIterator} containing the number of elements for each group.
    */
   async count() {
-    const n = /* @__PURE__ */ new Map();
-    for await (const [e] of this._elements) {
-      const t = n.get(e) ?? 0;
-      n.set(e, t + 1);
+    const e = /* @__PURE__ */ new Map();
+    for await (const [t] of this._elements) {
+      const n = e.get(t) ?? 0;
+      e.set(t, n + 1);
     }
-    return new h(function* () {
-      for (const [e, t] of n)
-        yield [e, t];
+    return new u(function* () {
+      for (const [t, n] of e)
+        yield [t, n];
     });
   }
   /**
@@ -2069,11 +2036,11 @@ const w = class w {
    *
    * @returns A {@link Promise} that will resolve once the iteration is complete.
    */
-  async forEach(n) {
-    const e = /* @__PURE__ */ new Map();
-    for await (const [t, s] of this._elements) {
-      const r = e.get(t) ?? 0;
-      await n(t, s, r), e.set(t, r + 1);
+  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);
     }
   }
   /**
@@ -2107,13 +2074,13 @@ const w = class w {
    *
    * @returns A new {@link AggregatedAsyncIterator} containing the elements reorganized by the new keys.
    */
-  reorganizeBy(n) {
-    const e = this._elements;
-    return new w(async function* () {
-      const t = /* @__PURE__ */ new Map();
-      for await (const [s, r] of e) {
-        const o = t.get(s) ?? 0;
-        yield [await n(s, r, o), r], t.set(s, o + 1);
+  reorganizeBy(e) {
+    const t = this._elements;
+    return new m(async function* () {
+      const n = /* @__PURE__ */ new Map();
+      for await (const [s, i] of t) {
+        const o = n.get(s) ?? 0;
+        yield [await e(s, i, o), i], n.set(s, o + 1);
       }
     });
   }
@@ -2144,11 +2111,11 @@ const w = class w {
    * @returns A new {@link SmartAsyncIterator} containing all the keys of the iterator.
    */
   keys() {
-    const n = this._elements;
+    const e = this._elements;
     return new d(async function* () {
-      const e = /* @__PURE__ */ new Set();
-      for await (const [t] of n)
-        e.has(t) || (e.add(t), yield t);
+      const t = /* @__PURE__ */ new Set();
+      for await (const [n] of e)
+        t.has(n) || (t.add(n), yield n);
     });
   }
   /**
@@ -2208,10 +2175,10 @@ const w = class w {
    * @returns A new {@link SmartAsyncIterator} containing all the values of the iterator.
    */
   values() {
-    const n = this._elements;
+    const e = this._elements;
     return new d(async function* () {
-      for await (const [e, t] of n)
-        yield t;
+      for await (const [t, n] of e)
+        yield n;
     });
   }
   /**
@@ -2235,8 +2202,8 @@ const w = class w {
    * @returns A {@link Promise} resolving to an {@link Array} containing all the values of the iterator.
    */
   async toArray() {
-    const n = await this.toMap();
-    return Array.from(n.values());
+    const e = await this.toMap();
+    return Array.from(e.values());
   }
   /**
    * Materializes the iterator into a map.  
@@ -2259,12 +2226,12 @@ const w = class w {
    * @returns A {@link Promise} resolving to a {@link Map} containing all the entries of the iterator.
    */
   async toMap() {
-    const n = /* @__PURE__ */ new Map();
-    for await (const [e, t] of this._elements) {
-      const s = n.get(e) ?? [];
-      s.push(t), n.set(e, s);
+    const e = /* @__PURE__ */ new Map();
+    for await (const [t, n] of this._elements) {
+      const s = e.get(t) ?? [];
+      s.push(n), e.set(t, s);
     }
-    return n;
+    return e;
   }
   /**
    * Materializes the iterator into an object.  
@@ -2287,56 +2254,54 @@ const w = class w {
    * @returns A {@link Promise} resolving to an object containing all the entries of the iterator.
    */
   async toObject() {
-    const n = {};
-    for await (const [e, t] of this._elements) {
-      const s = n[e] ?? [];
-      s.push(t), n[e] = s;
+    const e = {};
+    for await (const [t, n] of this._elements) {
+      const s = e[t] ?? [];
+      s.push(n), e[t] = s;
     }
-    return n;
+    return e;
   }
-};
-let M = w;
-var _e;
+  [Symbol.toStringTag] = "AggregatedAsyncIterator";
+}
 class d {
-  constructor(n) {
-    /**
-     * The native {@link AsyncIterator} object that is being wrapped by this instance.
-     */
-    a(this, "_iterator");
-    a(this, _e, "SmartAsyncIterator");
-    if (n instanceof Function) {
-      const e = n();
-      Symbol.asyncIterator in e ? this._iterator = e : this._iterator = async function* () {
-        let t = [];
+  /**
+   * The native {@link AsyncIterator} object that is being wrapped by this instance.
+   */
+  _iterator;
+  constructor(e) {
+    if (e instanceof Function) {
+      const t = e();
+      Symbol.asyncIterator in t ? this._iterator = t : this._iterator = (async function* () {
+        let n = [];
         for (; ; ) {
-          const s = e.next(...t);
+          const s = t.next(...n);
           if (s.done)
             return s.value;
-          t = [yield s.value];
+          n = [yield s.value];
         }
-      }();
-    } else if (Symbol.asyncIterator in n)
-      this._iterator = n[Symbol.asyncIterator]();
-    else if (Symbol.iterator in n) {
-      const e = n[Symbol.iterator]();
-      this._iterator = async function* () {
+      })();
+    } else if (Symbol.asyncIterator in e)
+      this._iterator = e[Symbol.asyncIterator]();
+    else if (Symbol.iterator in e) {
+      const t = e[Symbol.iterator]();
+      this._iterator = (async function* () {
         for (; ; ) {
-          const t = e.next();
-          if (t.done)
-            return t.value;
-          yield t.value;
+          const n = t.next();
+          if (n.done)
+            return n.value;
+          yield n.value;
         }
-      }();
+      })();
     } else
-      this._iterator = async function* () {
-        let e = [];
+      this._iterator = (async function* () {
+        let t = [];
         for (; ; ) {
-          const t = await n.next(...e);
-          if (t.done)
-            return t.value;
-          e = [yield t.value];
+          const n = await e.next(...t);
+          if (n.done)
+            return n.value;
+          t = [yield n.value];
         }
-      }();
+      })();
   }
   /**
    * Determines whether all elements of the iterator satisfy a given condition.
@@ -2368,15 +2333,15 @@ class d {
    * @returns
    * A {@link Promise} that will resolve to `true` if all elements satisfy the condition, `false` otherwise.
    */
-  async every(n) {
-    let e = 0;
+  async every(e) {
+    let t = 0;
     for (; ; ) {
-      const t = await this._iterator.next();
-      if (t.done)
+      const n = await this._iterator.next();
+      if (n.done)
         return !0;
-      if (!await n(t.value, e))
+      if (!await e(n.value, t))
         return !1;
-      e += 1;
+      t += 1;
     }
   }
   /**
@@ -2409,26 +2374,26 @@ class d {
    * @returns
    * A {@link Promise} that will resolve to `true` if any element satisfies the condition, `false` otherwise.
    */
-  async some(n) {
-    let e = 0;
+  async some(e) {
+    let t = 0;
     for (; ; ) {
-      const t = await this._iterator.next();
-      if (t.done)
+      const n = await this._iterator.next();
+      if (n.done)
         return !1;
-      if (await n(t.value, e))
+      if (await e(n.value, t))
         return !0;
-      e += 1;
+      t += 1;
     }
   }
-  filter(n) {
-    const e = this._iterator;
+  filter(e) {
+    const t = this._iterator;
     return new d(async function* () {
-      let t = 0;
+      let n = 0;
       for (; ; ) {
-        const s = await e.next();
+        const s = await t.next();
         if (s.done)
           return s.value;
-        await n(s.value, t) && (yield s.value), t += 1;
+        await e(s.value, n) && (yield s.value), n += 1;
       }
     });
   }
@@ -2463,31 +2428,31 @@ class d {
    *
    * @returns A new {@link SmartAsyncIterator} containing the transformed elements.
    */
-  map(n) {
-    const e = this._iterator;
+  map(e) {
+    const t = this._iterator;
     return new d(async function* () {
-      let t = 0;
+      let n = 0;
       for (; ; ) {
-        const s = await e.next();
+        const s = await t.next();
         if (s.done)
           return s.value;
-        yield await n(s.value, t), t += 1;
+        yield await e(s.value, n), n += 1;
       }
     });
   }
-  async reduce(n, e) {
-    let t = 0, s = e;
+  async reduce(e, t) {
+    let n = 0, s = t;
     if (s === void 0) {
-      const r = await this._iterator.next();
-      if (r.done)
+      const i = await this._iterator.next();
+      if (i.done)
         throw new f("Cannot reduce an empty iterator without an initial value.");
-      s = r.value, t += 1;
+      s = i.value, n += 1;
     }
     for (; ; ) {
-      const r = await this._iterator.next();
-      if (r.done)
+      const i = await this._iterator.next();
+      if (i.done)
         return s;
-      s = await n(s, r.value, t), t += 1;
+      s = await e(s, i.value, n), n += 1;
     }
   }
   /**
@@ -2521,21 +2486,21 @@ class d {
    *
    * @returns A new {@link SmartAsyncIterator} containing the flattened elements.
    */
-  flatMap(n) {
-    const e = this._iterator;
+  flatMap(e) {
+    const t = this._iterator;
     return new d(async function* () {
-      let t = 0;
+      let n = 0;
       for (; ; ) {
-        const s = await e.next();
+        const s = await t.next();
         if (s.done)
           return s.value;
-        const r = await n(s.value, t);
-        if (r instanceof Array)
-          for (const o of r)
+        const i = await e(s.value, n);
+        if (i instanceof Array)
+          for (const o of i)
             yield o;
         else
-          yield r;
-        t += 1;
+          yield i;
+        n += 1;
       }
     });
   }
@@ -2570,17 +2535,17 @@ class d {
    *
    * @returns A new {@link SmartAsyncIterator} containing the remaining elements.
    */
-  drop(n) {
-    const e = this._iterator;
+  drop(e) {
+    const t = this._iterator;
     return new d(async function* () {
-      let t = 0;
-      for (; t < n; ) {
-        if ((await e.next()).done)
+      let n = 0;
+      for (; n < e; ) {
+        if ((await t.next()).done)
           return;
-        t += 1;
+        n += 1;
       }
       for (; ; ) {
-        const s = await e.next();
+        const s = await t.next();
         if (s.done)
           return s.value;
         yield s.value;
@@ -2619,27 +2584,27 @@ class d {
    *
    * @returns A new {@link SmartAsyncIterator} containing the taken elements.
    */
-  take(n) {
-    const e = this._iterator;
+  take(e) {
+    const t = this._iterator;
     return new d(async function* () {
-      let t = 0;
-      for (; t < n; ) {
-        const s = await e.next();
+      let n = 0;
+      for (; n < e; ) {
+        const s = await t.next();
         if (s.done)
           return s.value;
-        yield s.value, t += 1;
+        yield s.value, n += 1;
       }
     });
   }
-  async find(n) {
-    let e = 0;
+  async find(e) {
+    let t = 0;
     for (; ; ) {
-      const t = await this._iterator.next();
-      if (t.done)
+      const n = await this._iterator.next();
+      if (n.done)
         return;
-      if (await n(t.value, e))
-        return t.value;
-      e += 1;
+      if (await e(n.value, t))
+        return n.value;
+      t += 1;
     }
   }
   /**
@@ -2671,7 +2636,7 @@ class d {
    * @returns A new {@link SmartAsyncIterator} containing the enumerated elements.
    */
   enumerate() {
-    return this.map((n, e) => [e, n]);
+    return this.map((e, t) => [t, e]);
   }
   /**
    * Removes all duplicate elements from the iterator.  
@@ -2699,14 +2664,14 @@ class d {
    * @returns A new {@link SmartAsyncIterator} containing only the unique elements.
    */
   unique() {
-    const n = this._iterator;
+    const e = this._iterator;
     return new d(async function* () {
-      const e = /* @__PURE__ */ new Set();
+      const t = /* @__PURE__ */ new Set();
       for (; ; ) {
-        const t = await n.next();
-        if (t.done)
-          return t.value;
-        e.has(t.value) || (e.add(t.value), yield t.value);
+        const n = await e.next();
+        if (n.done)
+          return n.value;
+        t.has(n.value) || (t.add(n.value), yield n.value);
       }
     });
   }
@@ -2731,11 +2696,11 @@ class d {
    * @returns A {@link Promise} that will resolve to the number of elements in the iterator.
    */
   async count() {
-    let n = 0;
+    let e = 0;
     for (; ; ) {
       if ((await this._iterator.next()).done)
-        return n;
-      n += 1;
+        return e;
+      e += 1;
     }
   }
   /**
@@ -2762,13 +2727,13 @@ class d {
    *
    * @returns A {@link Promise} that will resolve once the iteration is complete.
    */
-  async forEach(n) {
-    let e = 0;
+  async forEach(e) {
+    let t = 0;
     for (; ; ) {
-      const t = await this._iterator.next();
-      if (t.done)
+      const n = await this._iterator.next();
+      if (n.done)
         return;
-      await n(t.value, e), e += 1;
+      await e(n.value, t), t += 1;
     }
   }
   /**
@@ -2801,8 +2766,8 @@ class d {
    * @returns
    * A {@link Promise} that will resolve to the result of the iteration, containing the value of the operation.
    */
-  next(...n) {
-    return this._iterator.next(...n);
+  next(...e) {
+    return this._iterator.next(...e);
   }
   /**
    * An utility method that may be used to close the iterator gracefully,
@@ -2836,9 +2801,9 @@ class d {
    *
    * @returns A {@link Promise} that will resolve to the final result of the iterator.
    */
-  async return(n) {
-    const e = await n;
-    return this._iterator.return ? await this._iterator.return(e) : { done: !0, value: e };
+  async return(e) {
+    const t = await e;
+    return this._iterator.return ? await this._iterator.return(t) : { done: !0, value: t };
   }
   /**
    * An utility method that may be used to close the iterator due to an error,
@@ -2881,10 +2846,10 @@ class d {
    *
    * @returns A {@link Promise} that will resolve to the final result of the iterator.
    */
-  throw(n) {
+  throw(e) {
     if (this._iterator.throw)
-      return this._iterator.throw(n);
-    throw n;
+      return this._iterator.throw(e);
+    throw e;
   }
   /**
    * An utility method that aggregates the elements of the iterator using a given key function.  
@@ -2916,8 +2881,8 @@ class d {
    *
    * @returns A new instance of the {@link AggregatedAsyncIterator} class containing the grouped elements.
    */
-  groupBy(n) {
-    return new M(this.map(async (e, t) => [await n(e, t), e]));
+  groupBy(e) {
+    return new m(this.map(async (t, n) => [await e(t, n), t]));
   }
   /**
    * Materializes the iterator into an array.  
@@ -2945,20 +2910,18 @@ class d {
   toArray() {
     return Array.fromAsync(this);
   }
-  [(_e = Symbol.toStringTag, Symbol.asyncIterator)]() {
+  [Symbol.toStringTag] = "SmartAsyncIterator";
+  [Symbol.asyncIterator]() {
     return this;
   }
 }
-var ye;
-ye = Symbol.toStringTag;
-const m = class m {
-  constructor(n) {
-    /**
-     * The internal {@link SmartIterator} object that holds the elements to aggregate.
-     */
-    a(this, "_elements");
-    a(this, ye, "AggregatedIterator");
-    this._elements = new u(n);
+class h {
+  /**
+   * The internal {@link SmartIterator} object that holds the elements to aggregate.
+   */
+  _elements;
+  constructor(e) {
+    this._elements = new l(e);
   }
   /**
    * Determines whether all elements of each group of the iterator satisfy a given condition.
@@ -2990,15 +2953,15 @@ const m = class m {
    *
    * @returns A new {@link ReducedIterator} containing the boolean results for each group.
    */
-  every(n) {
-    const e = /* @__PURE__ */ new Map();
-    for (const [t, s] of this._elements) {
-      const [r, o] = e.get(t) ?? [0, !0];
-      o && e.set(t, [r + 1, n(t, s, r)]);
+  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)]);
     }
-    return new h(function* () {
-      for (const [t, [s, r]] of e)
-        yield [t, r];
+    return new u(function* () {
+      for (const [n, [s, i]] of t)
+        yield [n, i];
     });
   }
   /**
@@ -3031,24 +2994,24 @@ const m = class m {
    *
    * @returns A {@link ReducedIterator} containing the boolean results for each group.
    */
-  some(n) {
-    const e = /* @__PURE__ */ new Map();
-    for (const [t, s] of this._elements) {
-      const [r, o] = e.get(t) ?? [0, !1];
-      o || e.set(t, [r + 1, n(t, s, r)]);
+  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)]);
     }
-    return new h(function* () {
-      for (const [t, [s, r]] of e)
-        yield [t, r];
+    return new u(function* () {
+      for (const [n, [s, i]] of t)
+        yield [n, i];
     });
   }
-  filter(n) {
-    const e = this._elements;
-    return new m(function* () {
-      const t = /* @__PURE__ */ new Map();
-      for (const [s, r] of e) {
-        const o = t.get(s) ?? 0;
-        n(s, r, o) && (yield [s, r]), t.set(s, o + 1);
+  filter(e) {
+    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;
+        e(s, i, o) && (yield [s, i]), n.set(s, o + 1);
       }
     });
   }
@@ -3084,32 +3047,32 @@ const m = class m {
    *
    * @returns A new {@link AggregatedIterator} containing the transformed elements.
    */
-  map(n) {
-    const e = this._elements;
-    return new m(function* () {
-      const t = /* @__PURE__ */ new Map();
-      for (const [s, r] of e) {
-        const o = t.get(s) ?? 0;
-        yield [s, n(s, r, o)], t.set(s, o + 1);
+  map(e) {
+    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;
+        yield [s, e(s, i, o)], n.set(s, o + 1);
       }
     });
   }
-  reduce(n, e) {
-    const t = /* @__PURE__ */ new Map();
-    for (const [s, r] of this._elements) {
-      let o, l;
-      if (t.has(s))
-        [o, l] = t.get(s);
-      else if (e !== void 0)
-        o = 0, e instanceof Function ? l = e(s) : l = e;
+  reduce(e, t) {
+    const n = /* @__PURE__ */ new Map();
+    for (const [s, i] 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 {
-        t.set(s, [0, r]);
+        n.set(s, [0, i]);
         continue;
       }
-      t.set(s, [o + 1, n(s, l, r, o)]);
+      n.set(s, [o + 1, e(s, a, i, o)]);
     }
-    return new h(function* () {
-      for (const [s, [r, o]] of t)
+    return new u(function* () {
+      for (const [s, [i, o]] of n)
         yield [s, o];
     });
   }
@@ -3149,18 +3112,18 @@ const m = class m {
    *
    * @returns A new {@link AggregatedIterator} containing the transformed elements.
    */
-  flatMap(n) {
-    const e = this._elements;
-    return new m(function* () {
-      const t = /* @__PURE__ */ new Map();
-      for (const [s, r] of e) {
-        const o = t.get(s) ?? 0, l = n(s, r, o);
-        if (l instanceof Array)
-          for (const k of l)
-            yield [s, k];
+  flatMap(e) {
+    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);
+        if (a instanceof Array)
+          for (const y of a)
+            yield [s, y];
         else
-          yield [s, l];
-        t.set(s, o + 1);
+          yield [s, a];
+        n.set(s, o + 1);
       }
     });
   }
@@ -3193,17 +3156,17 @@ const m = class m {
    *
    * @returns A new {@link AggregatedIterator} containing the remaining elements.
    */
-  drop(n) {
-    const e = this._elements;
-    return new m(function* () {
-      const t = /* @__PURE__ */ new Map();
-      for (const [s, r] of e) {
-        const o = t.get(s) ?? 0;
-        if (o < n) {
-          t.set(s, o + 1);
+  drop(e) {
+    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;
+        if (o < e) {
+          n.set(s, o + 1);
           continue;
         }
-        yield [s, r];
+        yield [s, i];
       }
     });
   }
@@ -3236,25 +3199,25 @@ const m = class m {
    *
    * @returns A new {@link AggregatedIterator} containing the taken elements.
    */
-  take(n) {
-    const e = this._elements;
-    return new m(function* () {
-      const t = /* @__PURE__ */ new Map();
-      for (const [s, r] of e) {
-        const o = t.get(s) ?? 0;
-        o >= n || (yield [s, r], t.set(s, o + 1));
+  take(e) {
+    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;
+        o >= e || (yield [s, i], n.set(s, o + 1));
       }
     });
   }
-  find(n) {
-    const e = /* @__PURE__ */ new Map();
-    for (const [t, s] of this._elements) {
-      let [r, o] = e.get(t) ?? [0, void 0];
-      o === void 0 && (n(t, s, r) && (o = s), e.set(t, [r + 1, o]));
+  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]));
     }
-    return new h(function* () {
-      for (const [t, [s, r]] of e)
-        yield [t, r];
+    return new u(function* () {
+      for (const [n, [s, i]] of t)
+        yield [n, i];
     });
   }
   /**
@@ -3284,7 +3247,7 @@ const m = class m {
    * @returns A new {@link AggregatedIterator} containing the enumerated elements.
    */
   enumerate() {
-    return this.map((n, e, t) => [t, e]);
+    return this.map((e, t, n) => [n, t]);
   }
   /**
    * Removes all duplicate elements from within each group of the iterator.  
@@ -3313,12 +3276,12 @@ const m = class m {
    * @returns A new {@link AggregatedIterator} containing only the unique elements.
    */
   unique() {
-    const n = this._elements;
-    return new m(function* () {
-      const e = /* @__PURE__ */ new Map();
-      for (const [t, s] of n) {
-        const r = e.get(t) ?? /* @__PURE__ */ new Set();
-        r.has(s) || (r.add(s), e.set(t, r), yield [t, s]);
+    const e = this._elements;
+    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]);
       }
     });
   }
@@ -3344,14 +3307,14 @@ const m = class m {
    * @returns A new {@link ReducedIterator} containing the number of elements for each group.
    */
   count() {
-    const n = /* @__PURE__ */ new Map();
-    for (const [e] of this._elements) {
-      const t = n.get(e) ?? 0;
-      n.set(e, t + 1);
+    const e = /* @__PURE__ */ new Map();
+    for (const [t] of this._elements) {
+      const n = e.get(t) ?? 0;
+      e.set(t, n + 1);
     }
-    return new h(function* () {
-      for (const [e, t] of n)
-        yield [e, t];
+    return new u(function* () {
+      for (const [t, n] of e)
+        yield [t, n];
     });
   }
   /**
@@ -3378,11 +3341,11 @@ const m = class m {
    *
    * @param iteratee The function to execute for each element of the iterator.
    */
-  forEach(n) {
-    const e = /* @__PURE__ */ new Map();
-    for (const [t, s] of this._elements) {
-      const r = e.get(t) ?? 0;
-      n(t, s, r), e.set(t, r + 1);
+  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);
     }
   }
   /**
@@ -3416,13 +3379,13 @@ const m = class m {
    *
    * @returns A new {@link AggregatedIterator} containing the elements reorganized by the new keys.
    */
-  reorganizeBy(n) {
-    const e = this._elements;
-    return new m(function* () {
-      const t = /* @__PURE__ */ new Map();
-      for (const [s, r] of e) {
-        const o = t.get(s) ?? 0;
-        yield [n(s, r, o), r], t.set(s, o + 1);
+  reorganizeBy(e) {
+    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;
+        yield [e(s, i, o), i], n.set(s, o + 1);
       }
     });
   }
@@ -3453,11 +3416,11 @@ const m = class m {
    * @returns A new {@link SmartIterator} containing all the keys of the iterator.
    */
   keys() {
-    const n = this._elements;
-    return new u(function* () {
-      const e = /* @__PURE__ */ new Set();
-      for (const [t] of n)
-        e.has(t) || (e.add(t), yield t);
+    const e = this._elements;
+    return new l(function* () {
+      const t = /* @__PURE__ */ new Set();
+      for (const [n] of e)
+        t.has(n) || (t.add(n), yield n);
     });
   }
   /**
@@ -3517,10 +3480,10 @@ const m = class m {
    * @returns A new {@link SmartIterator} containing all the values of the iterator.
    */
   values() {
-    const n = this._elements;
-    return new u(function* () {
-      for (const [e, t] of n)
-        yield t;
+    const e = this._elements;
+    return new l(function* () {
+      for (const [t, n] of e)
+        yield n;
     });
   }
   /**
@@ -3544,8 +3507,8 @@ const m = class m {
    * @returns An {@link Array} of arrays containing the elements of the iterator.
    */
   toArray() {
-    const n = this.toMap();
-    return Array.from(n.values());
+    const e = this.toMap();
+    return Array.from(e.values());
   }
   /**
    * Materializes the iterator into a map.  
@@ -3568,12 +3531,12 @@ const m = class m {
    * @returns A {@link Map} containing the elements of the iterator.
    */
   toMap() {
-    const n = /* @__PURE__ */ new Map();
-    for (const [e, t] of this._elements) {
-      const s = n.get(e) ?? [];
-      s.push(t), n.set(e, s);
+    const e = /* @__PURE__ */ new Map();
+    for (const [t, n] of this._elements) {
+      const s = e.get(t) ?? [];
+      s.push(n), e.set(t, s);
     }
-    return n;
+    return e;
   }
   /**
    * Materializes the iterator into an object.  
@@ -3596,31 +3559,35 @@ const m = class m {
    * @returns An {@link Object} containing the elements of the iterator.
    */
   toObject() {
-    const n = {};
-    for (const [e, t] of this._elements) {
-      const s = n[e] ?? [];
-      s.push(t), n[e] = s;
+    const e = {};
+    for (const [t, n] of this._elements) {
+      const s = e[t] ?? [];
+      s.push(n), e[t] = s;
     }
-    return n;
+    return e;
   }
-};
-let x = m;
-const We = Function;
-var be, ge;
-class Ue extends (ge = We, be = Symbol.toStringTag, ge) {
+  [Symbol.toStringTag] = "AggregatedIterator";
+}
+const N = Function;
+class O extends N {
   /**
    * Initializes a new instance of the {@link CallableObject} class.
    */
   constructor() {
     super("return this._invoke(...arguments);");
-    a(this, be, "CallableObject");
     const e = this.bind(this);
     return Object.setPrototypeOf(this, e), e;
   }
+  [Symbol.toStringTag] = "CallableObject";
 }
-var xe;
-xe = Symbol.toStringTag;
-const F = class F {
+class g {
+  /**
+   * A map containing all the subscribers for each event.
+   *
+   * The keys are the names of the events they are subscribed to.  
+   * The values are the arrays of the subscribers themselves.
+   */
+  _subscribers;
   /**
    * Initializes a new instance of the {@link Publisher} class.
    *
@@ -3632,39 +3599,8 @@ const F = class F {
    * ```
    */
   constructor() {
-    /**
-     * A map containing all the subscribers for each event.
-     *
-     * The keys are the names of the events they are subscribed to.  
-     * The values are the arrays of the subscribers themselves.
-     */
-    a(this, "_subscribers");
-    a(this, xe, "Publisher");
     this._subscribers = /* @__PURE__ */ new Map();
   }
-  /**
-   * Unsubscribes all the subscribers from all the events.
-   *
-   * ---
-   *
-   * @example
-   * ```ts
-   * publisher.subscribe("player:spawn", (evt) => { [...] });
-   * publisher.subscribe("player:move", (coords) => { [...] });
-   * publisher.subscribe("player:move", () => { [...] });
-   * publisher.subscribe("player:move", ({ x, y }) => { [...] });
-   * publisher.subscribe("player:death", () => { [...] });
-   *
-   * // All these subscribers are working fine...
-   *
-   * publisher.clear();
-   *
-   * // ... but now they're all gone!
-   * ```
-   */
-  clear() {
-    this.publish("__internals__:clear"), this._subscribers.clear();
-  }
   /**
    * Creates a new scoped instance of the {@link Publisher} class,
    * which can be used to publish and subscribe events within a specific context.
@@ -3680,8 +3616,8 @@ const F = class F {
    * const publisher = new Publisher();
    * const context = publisher.createScope();
    *
-   * publisher.subscribe("player:death", () => console.log(`Player has died.`));
-   * context.subscribe("player:spawn", () => console.log(`Player has spawned.`));
+   * publisher.subscribe("player:death", () => console.log("Player has died."));
+   * context.subscribe("player:spawn", () => console.log("Player has spawned."));
    *
    * publisher.publish("player:spawn"); // "Player has spawned."
    * context.publish("player:death"); // * no output *
@@ -3690,102 +3626,126 @@ const F = class F {
    * ---
    *
    * @template U
-   * A map containing the names of the emittable events and the
-   * related callback signatures that can be subscribed to them.
-   * Default is `T`.
+   * A map containing the additional names of the emittable events and
+   * the related callback signatures that can be subscribed to them.
+   * Default is `{ }`.
    *
    * @return
    * A new instance of the {@link Publisher} class that can be
    * used to publish and subscribe events within a specific context.
    */
+  // eslint-disable-next-line @typescript-eslint/no-empty-object-type
   createScope() {
-    const n = new F();
-    return this.subscribe("__internals__:clear", () => n.clear()), this.subscribe("*", (e, ...t) => {
-      n.publish(e, ...t);
-    }), n;
-  }
-  publish(n, ...e) {
-    let t, s = this._subscribers.get(n);
-    return s ? t = s.slice().map((r) => r(...e)) : t = [], n.startsWith("__") || (s = this._subscribers.get("*"), s && s.slice().forEach((r) => r(n, ...e))), t;
-  }
-  subscribe(n, e) {
-    const t = this._subscribers.get(n) ?? [];
-    return t.push(e), this._subscribers.set(n, t), () => {
-      const s = t.indexOf(e);
+    const e = new g();
+    return this.subscribe("__internals__:clear", () => e.clear()), this.subscribe("*", (t, ...n) => {
+      e.publish(t, ...n);
+    }), e;
+  }
+  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;
+  }
+  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 E("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed.");
-      t.splice(s, 1);
+        throw new S("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed.");
+      n.splice(s, 1);
     };
   }
-  unsubscribe(n, e) {
-    const t = this._subscribers.get(n);
-    if (!t)
-      throw new E("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed or was never subscribed.");
-    const s = t.indexOf(e);
+  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.");
+    const s = n.indexOf(t);
     if (s < 0)
-      throw new E("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed or was never subscribed.");
-    t.splice(s, 1), t.length === 0 && this._subscribers.delete(n);
+      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);
   }
-};
-let v = F;
-const et = () => {
-};
-var ve, Se;
-class dt extends (Se = Ue, ve = Symbol.toStringTag, Se) {
-  constructor(e, t = "default") {
-    super();
-    /**
-     * The currently selected implementation of the callback.
-     */
-    a(this, "_callback");
-    /**
-     * All the implementations that have been registered for the callback.
-     *
-     * The keys are the names of the implementations they were registered with.  
-     * The values are the implementations themselves.
-     */
-    a(this, "_callbacks");
-    /**
-     * A flag indicating whether the callback is enabled or not.
-     *
-     * This protected property is the only one that can be modified directly by the derived classes.  
-     * If you're looking for the public and readonly property, use
-     * the {@link SwitchableCallback.isEnabled} getter instead.
-     */
-    a(this, "_isEnabled");
-    /**
-     * The key that is associated with the currently selected implementation.
-     *
-     * This protected property is the only one that can be modified directly by the derived classes.  
-     * If you're looking for the public and readonly property, use the {@link SwitchableCallback.key} getter instead.
-     */
-    a(this, "_key");
-    /**
-     * The function that will be called by the extended class when the object is invoked as a function.
-     */
-    a(this, "_invoke");
-    a(this, ve, "SwitchableCallback");
-    this._callbacks = /* @__PURE__ */ new Map(), this._isEnabled = !0, e ? this._callbacks.set(t, e) : (t = "", e = () => {
-      throw new He(
-        "The `SwitchableCallback` has no callback defined yet. Did you forget to call the `register` method?"
-      );
-    }), this._key = t, this._callback = e, this._invoke = (...s) => this._callback(...s);
+  unsubscribeAll(e) {
+    this._subscribers.delete(e);
   }
   /**
-   * A flag indicating whether the callback is enabled or not.
+   * Unsubscribes all the subscribers from all the events.
    *
-   * It indicates whether the callback is currently able to execute the currently selected implementation.  
-   * If it's disabled, the callback will be invoked without executing anything.
+   * ---
+   *
+   * @example
+   * ```ts
+   * publisher.subscribe("player:spawn", (evt) => { [...] });
+   * publisher.subscribe("player:move", (coords) => { [...] });
+   * publisher.subscribe("*", () => { [...] });
+   * publisher.subscribe("player:move", ({ x, y }) => { [...] });
+   * publisher.subscribe("player:death", () => { [...] });
+   *
+   * // All these subscribers are working fine...
+   *
+   * publisher.clear();
+   *
+   * // ... but now they're all gone!
+   * ```
+   */
+  clear() {
+    this.publish("__internals__:clear"), this._subscribers.clear();
+  }
+  [Symbol.toStringTag] = "Publisher";
+}
+const q = () => {
+};
+class K extends O {
+  /**
+   * The currently selected implementation of the callback.
+   */
+  _callback;
+  /**
+   * All the implementations that have been registered for the callback.
+   *
+   * The keys are the names of the implementations they were registered with.  
+   * The values are the implementations themselves.
+   */
+  _callbacks;
+  /**
+   * A flag indicating whether the callback is enabled or not.
+   *
+   * This protected property is the only one that can be modified directly by the derived classes.  
+   * If you're looking for the public and readonly property, use
+   * the {@link SwitchableCallback.isEnabled} getter instead.
+   */
+  _isEnabled;
+  /**
+   * A flag indicating whether the callback is enabled or not.
+   *
+   * It indicates whether the callback is currently able to execute the currently selected implementation.  
+   * If it's disabled, the callback will be invoked without executing anything.
    */
   get isEnabled() {
     return this._isEnabled;
   }
+  /**
+   * The key that is associated with the currently selected implementation.
+   *
+   * This protected property is the only one that can be modified directly by the derived classes.  
+   * If you're looking for the public and readonly property, use the {@link SwitchableCallback.key} getter instead.
+   */
+  _key;
   /**
    * The key that is associated with the currently selected implementation.
    */
   get key() {
     return this._key;
   }
+  /**
+   * The function that will be called by the extended class when the object is invoked as a function.
+   */
+  _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(
+        "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);
+  }
   /**
    * Enables the callback, allowing it to execute the currently selected implementation.
    *
@@ -3839,7 +3799,7 @@ class dt extends (Se = Ue, ve = Symbol.toStringTag, Se) {
   disable() {
     if (!this._isEnabled)
       throw new p("The `SwitchableCallback` is already disabled.");
-    this._callback = et, this._isEnabled = !1;
+    this._callback = q, this._isEnabled = !1;
   }
   /**
    * Registers a new implementation for the callback.
@@ -3916,9 +3876,13 @@ class dt extends (Se = Ue, ve = Symbol.toStringTag, Se) {
       throw new _(`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";
 }
-var ke, Te;
-class wt extends (Te = Map, ke = Symbol.toStringTag, Te) {
+class Q extends Map {
+  /**
+   * The internal {@link Publisher} instance used to publish events.
+   */
+  _publisher;
   /**
    * Initializes a new instance of the {@link MapView} class.
    *
@@ -3934,15 +3898,9 @@ class wt extends (Te = Map, ke = Symbol.toStringTag, Te) {
    * @param iterable An optional iterable of key-value pairs to initialize the {@link Map} with.
    */
   constructor(e) {
-    super();
-    /**
-     * The internal {@link Publisher} instance used to publish events.
-     */
-    a(this, "_publisher");
-    a(this, ke, "MapView");
-    if (this._publisher = new v(), e)
-      for (const [t, s] of e)
-        this.set(t, s);
+    if (super(), this._publisher = new g(), e)
+      for (const [t, n] of e)
+        this.set(t, n);
   }
   /**
    * Adds a new entry with a specified key and value to the {@link Map}.  
@@ -4070,9 +4028,13 @@ class wt extends (Te = Map, ke = Symbol.toStringTag, Te) {
   unsubscribe(e, t) {
     this._publisher.unsubscribe(e, t);
   }
+  [Symbol.toStringTag] = "MapView";
 }
-var Ee, Me;
-class mt extends (Me = Set, Ee = Symbol.toStringTag, Me) {
+class H extends Set {
+  /**
+   * The internal {@link Publisher} instance used to publish events.
+   */
+  _publisher;
   /**
    * Initializes a new instance of the {@link SetView} class.
    *
@@ -4088,13 +4050,7 @@ class mt extends (Me = Set, Ee = Symbol.toStringTag, Me) {
    * @param iterable An optional iterable of values to initialize the {@link Set} with.
    */
   constructor(e) {
-    super();
-    /**
-     * The internal {@link Publisher} instance used to publish events.
-     */
-    a(this, "_publisher");
-    a(this, Ee, "SetView");
-    if (this._publisher = new v(), e)
+    if (super(), this._publisher = new g(), e)
       for (const t of e)
         this.add(t);
   }
@@ -4223,10 +4179,24 @@ class mt extends (Me = Set, Ee = Symbol.toStringTag, Me) {
   unsubscribe(e, t) {
     this._publisher.unsubscribe(e, t);
   }
+  [Symbol.toStringTag] = "SetView";
 }
-var Re;
-Re = Symbol.toStringTag;
-class pt {
+class X {
+  /**
+   * Whether to prefer the {@link localStorage} over the {@link sessionStorage} when calling an ambivalent method.
+   *
+   * If `true`, the persistent storage is preferred. If `false`, the volatile storage is preferred.  
+   * Default is `true`.
+   */
+  _preferPersistence;
+  /**
+   * A reference to the volatile {@link sessionStorage} storage.
+   */
+  _volatile;
+  /**
+   * A reference to the persistent {@link localStorage} storage.
+   */
+  _persistent;
   /**
    * Initializes a new instance of the {@link JSONStorage} class.  
    * It cannot be instantiated outside of a browser environment or an {@link EnvironmentException} is thrown.
@@ -4244,57 +4214,41 @@ class pt {
    * Whether to prefer the {@link localStorage} over the {@link sessionStorage} when calling an ambivalent method.  
    * If omitted, it defaults to `true` to prefer the persistent storage.
    */
-  constructor(n = !0) {
-    /**
-     * Whether to prefer the {@link localStorage} over the {@link sessionStorage} when calling an ambivalent method.
-     *
-     * If `true`, the persistent storage is preferred. If `false`, the volatile storage is preferred.  
-     * Default is `true`.
-     */
-    a(this, "_preferPersistence");
-    /**
-     * A reference to the volatile {@link sessionStorage} storage.
-     */
-    a(this, "_volatile");
-    /**
-     * A reference to the persistent {@link localStorage} storage.
-     */
-    a(this, "_persistent");
-    a(this, Re, "JSONStorage");
-    if (!Ye)
-      throw new Xe(
+  constructor(e = !0) {
+    if (!T)
+      throw new j(
         "The `JSONStorage` class can only be instantiated within a browser environment."
       );
-    this._preferPersistence = n, this._volatile = window.sessionStorage, this._persistent = window.localStorage;
+    this._preferPersistence = e, this._volatile = window.sessionStorage, this._persistent = window.localStorage;
   }
-  _get(n, e, t) {
-    const s = n.getItem(e);
+  _get(e, t, n) {
+    const s = e.getItem(t);
     if (s)
       try {
         return JSON.parse(s);
       } catch {
         console.warn(
-          `The "${s}" value for "${e}" property cannot be parsed. Clearing the storage...`
-        ), n.removeItem(e);
+          `The "${s}" value for "${t}" property cannot be parsed. Clearing the storage...`
+        ), e.removeItem(t);
       }
-    return t;
+    return n;
   }
-  _set(n, e, t) {
-    const s = JSON.stringify(t);
-    s ? n.setItem(e, s) : n.removeItem(e);
+  _set(e, t, n) {
+    const s = JSON.stringify(n);
+    s ? e.setItem(t, s) : e.removeItem(t);
   }
-  get(n, e, t = this._preferPersistence) {
-    const s = t ? this._persistent : this._volatile;
-    return this._get(s, n, e);
+  get(e, t, n = this._preferPersistence) {
+    const s = n ? this._persistent : this._volatile;
+    return this._get(s, e, t);
   }
-  recall(n, e) {
-    return this._get(this._volatile, n, e);
+  recall(e, t) {
+    return this._get(this._volatile, e, t);
   }
-  retrieve(n, e) {
-    return this.recall(n) ?? this.read(n, e);
+  retrieve(e, t) {
+    return this.recall(e) ?? this.read(e, t);
   }
-  read(n, e) {
-    return this._get(this._persistent, n, e);
+  read(e, t) {
+    return this._get(this._persistent, e, t);
   }
   /**
    * Checks whether the value with the specified key exists within the default storage.
@@ -4318,8 +4272,8 @@ class pt {
    *
    * @returns `true` if the key exists, `false` otherwise.
    */
-  has(n, e) {
-    return (e ? this._persistent : this._volatile).getItem(n) !== null;
+  has(e, t) {
+    return (t ? this._persistent : this._volatile).getItem(e) !== null;
   }
   /**
    * Checks whether the value with the specified key exists within the volatile {@link sessionStorage}.
@@ -4340,8 +4294,8 @@ class pt {
    *
    * @returns `true` if the key exists, `false` otherwise.
    */
-  knows(n) {
-    return this._volatile.getItem(n) !== null;
+  knows(e) {
+    return this._volatile.getItem(e) !== null;
   }
   /**
    * Checks whether the value with the specified key exists looking first in the
@@ -4363,8 +4317,8 @@ class pt {
    *
    * @returns `true` if the key exists, `false` otherwise.
    */
-  find(n) {
-    return this.knows(n) ?? this.exists(n);
+  find(e) {
+    return this.knows(e) ?? this.exists(e);
   }
   /**
    * Checks whether the value with the specified key exists within the persistent {@link localStorage}.
@@ -4385,8 +4339,8 @@ class pt {
    *
    * @returns `true` if the key exists, `false` otherwise.
    */
-  exists(n) {
-    return this._persistent.getItem(n) !== null;
+  exists(e) {
+    return this._persistent.getItem(e) !== null;
   }
   /**
    * Sets the value with the specified key in the default storage.  
@@ -4411,9 +4365,9 @@ class pt {
    * Whether to prefer the persistent {@link localStorage} over the volatile {@link sessionStorage}.  
    * If omitted, it defaults to the `preferPersistence` value set in the constructor.
    */
-  set(n, e, t = this._preferPersistence) {
-    const s = t ? this._persistent : this._volatile;
-    this._set(s, n, e);
+  set(e, t, n = this._preferPersistence) {
+    const s = n ? this._persistent : this._volatile;
+    this._set(s, e, t);
   }
   /**
    * Sets the value with the specified key in the volatile {@link sessionStorage}.  
@@ -4435,8 +4389,8 @@ class pt {
    * @param key The key of the value to set.
    * @param newValue The new value to set. If it's `undefined` or omitted, the key is removed instead.
    */
-  remember(n, e) {
-    this._set(this._volatile, n, e);
+  remember(e, t) {
+    this._set(this._volatile, e, t);
   }
   /**
    * Sets the value with the specified key in the persistent {@link localStorage}.  
@@ -4458,8 +4412,8 @@ class pt {
    * @param key The key of the value to set.
    * @param newValue The new value to set. If it's `undefined` or omitted, the key is removed instead.
    */
-  write(n, e) {
-    this._set(this._persistent, n, e);
+  write(e, t) {
+    this._set(this._persistent, e, t);
   }
   /**
    * Removes the value with the specified key from the default storage.
@@ -4478,8 +4432,8 @@ class pt {
    * Whether to prefer the persistent {@link localStorage} over the volatile {@link sessionStorage}.  
    * If omitted, it defaults to the `preferPersistence` value set in the constructor.
    */
-  delete(n, e) {
-    (e ? this._persistent : this._volatile).removeItem(n);
+  delete(e, t) {
+    (t ? this._persistent : this._volatile).removeItem(e);
   }
   /**
    * Removes the value with the specified key from the volatile {@link sessionStorage}.
@@ -4495,8 +4449,8 @@ class pt {
    *
    * @param key The key of the value to remove.
    */
-  forget(n) {
-    this._volatile.removeItem(n);
+  forget(e) {
+    this._volatile.removeItem(e);
   }
   /**
    * Removes the value with the specified key from the persistent {@link localStorage}.
@@ -4512,8 +4466,8 @@ class pt {
    *
    * @param key The key of the value to remove.
    */
-  erase(n) {
-    this._persistent.removeItem(n);
+  erase(e) {
+    this._persistent.removeItem(e);
   }
   /**
    * Removes the value with the specified key from both the
@@ -4530,65 +4484,12 @@ class pt {
    *
    * @param key The key of the value to remove.
    */
-  clear(n) {
-    this._volatile.removeItem(n), this._persistent.removeItem(n);
+  clear(e) {
+    this._volatile.removeItem(e), this._persistent.removeItem(e);
   }
+  [Symbol.toStringTag] = "JSONStorage";
 }
-var Fe;
-Fe = Symbol.toStringTag;
-const P = class P {
-  /**
-   * Initializes a new instance of the {@link SmartPromise} class.
-   *
-   * ---
-   *
-   * @example
-   * ```ts
-   * const promise = new SmartPromise<string>((resolve, reject) =>
-   * {
-   *     setTimeout(() => resolve("Hello, World!"), 1_000);
-   * });
-   * ```
-   *
-   * ---
-   *
-   * @param executor
-   * The function responsible for eventually resolving or rejecting the promise.  
-   * Similarly to the native {@link Promise} object, it's immediately executed after the promise is created.
-   */
-  constructor(n) {
-    /**
-     * A flag indicating whether the promise is still pending or not.
-     *
-     * The protected property is the only one that can be modified directly by the derived classes.  
-     * If you're looking for the public and readonly property, use the {@link SmartPromise.isPending} getter instead.
-     */
-    a(this, "_isPending");
-    /**
-     * A flag indicating whether the promise has been fulfilled or not.
-     *
-     * The protected property is the only one that can be modified directly by the derived classes.  
-     * If you're looking for the public and readonly property, use the {@link SmartPromise.isFulfilled} getter instead.
-     */
-    a(this, "_isFulfilled");
-    /**
-     * A flag indicating whether the promise has been rejected or not.
-     *
-     * The protected property is the only one that can be modified directly by the derived classes.  
-     * If you're looking for the public and readonly property, use the {@link SmartPromise.isRejected} getter instead.
-     */
-    a(this, "_isRejected");
-    /**
-     * The native {@link Promise} object wrapped by this instance.
-     */
-    a(this, "_promise");
-    a(this, Fe, "SmartPromise");
-    this._isPending = !0, this._isFulfilled = !1, this._isRejected = !1;
-    const e = (s) => (this._isPending = !1, this._isFulfilled = !0, s), t = (s) => {
-      throw this._isPending = !1, this._isRejected = !0, s;
-    };
-    this._promise = new Promise(n).then(e, t);
-  }
+class w {
   /**
    * Wraps a new {@link SmartPromise} object around an existing native {@link Promise} object.
    *
@@ -4612,32 +4513,83 @@ const P = class P {
    *
    * @returns A new {@link SmartPromise} object that wraps the provided promise.
    */
-  static FromPromise(n) {
-    return new P((e, t) => n.then(e, t));
+  static FromPromise(e) {
+    return new w((t, n) => e.then(t, n));
   }
+  /**
+   * A flag indicating whether the promise is still pending or not.
+   *
+   * The protected property is the only one that can be modified directly by the derived classes.  
+   * If you're looking for the public and readonly property, use the {@link SmartPromise.isPending} getter instead.
+   */
+  _isPending;
   /**
    * A flag indicating whether the promise is still pending or not.
    */
   get isPending() {
     return this._isPending;
   }
+  /**
+   * A flag indicating whether the promise has been fulfilled or not.
+   *
+   * The protected property is the only one that can be modified directly by the derived classes.  
+   * If you're looking for the public and readonly property, use the {@link SmartPromise.isFulfilled} getter instead.
+   */
+  _isFulfilled;
   /**
    * A flag indicating whether the promise has been fulfilled or not.
    */
   get isFulfilled() {
     return this._isFulfilled;
   }
+  /**
+   * A flag indicating whether the promise has been rejected or not.
+   *
+   * The protected property is the only one that can be modified directly by the derived classes.  
+   * If you're looking for the public and readonly property, use the {@link SmartPromise.isRejected} getter instead.
+   */
+  _isRejected;
   /**
    * A flag indicating whether the promise has been rejected or not.
    */
   get isRejected() {
     return this._isRejected;
   }
-  then(n, e) {
-    return this._promise.then(n, e);
+  /**
+   * The native {@link Promise} object wrapped by this instance.
+   */
+  _promise;
+  /**
+   * Initializes a new instance of the {@link SmartPromise} class.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const promise = new SmartPromise<string>((resolve, reject) =>
+   * {
+   *     setTimeout(() => resolve("Hello, World!"), 1_000);
+   * });
+   * ```
+   *
+   * ---
+   *
+   * @param executor
+   * The function responsible for eventually resolving or rejecting the promise.  
+   * Similarly to the native {@link Promise} object, it's immediately executed after the promise is created.
+   */
+  constructor(e) {
+    this._isPending = !0, this._isFulfilled = !1, this._isRejected = !1;
+    const t = (s) => (this._isPending = !1, this._isFulfilled = !0, s), n = (s) => {
+      throw this._isPending = !1, this._isRejected = !0, s;
+    };
+    this._promise = new Promise(e).then(t, n);
+  }
+  then(e, t) {
+    return this._promise.then(e, t);
   }
-  catch(n) {
-    return this._promise.catch(n);
+  catch(e) {
+    return this._promise.catch(e);
   }
   /**
    * Attaches a callback that executes right after the promise is settled, regardless of the outcome.
@@ -4665,13 +4617,38 @@ const P = class P {
    *
    * @returns A new {@link Promise} that executes the callback once the promise is settled.
    */
-  finally(n) {
-    return this._promise.finally(n);
+  finally(e) {
+    return this._promise.finally(e);
+  }
+  [Symbol.toStringTag] = "SmartPromise";
+}
+class M extends w {
+  /**
+   * The exposed function that allows to resolve the promise.
+   *
+   * This protected property is the only one that can be modified directly by the derived classes.  
+   * If you're looking for the public and readonly property, use the {@link DeferredPromise.resolve} getter instead.
+   */
+  _resolve;
+  /**
+   * The exposed function that allows to reject the promise.
+   */
+  get resolve() {
+    return this._resolve;
+  }
+  /**
+   * The exposed function that allows to reject the promise.
+   *
+   * This protected property is the only one that can be modified directly by the derived classes.  
+   * If you're looking for the public and readonly property, use the {@link DeferredPromise.reject} getter instead.
+   */
+  _reject;
+  /**
+   * The exposed function that allows to reject the promise.
+   */
+  get reject() {
+    return this._reject;
   }
-};
-let S = P;
-var Pe, je;
-class Ve extends (je = S, Pe = Symbol.toStringTag, je) {
   /**
    * Initializes a new instance of the {@link DeferredPromise} class.
    *
@@ -4688,38 +4665,10 @@ class Ve extends (je = S, Pe = Symbol.toStringTag, je) {
    * @param onRejected The callback to execute once the promise is rejected.
    */
   constructor(e, t) {
-    let s, r;
-    super((o, l) => {
-      s = o, r = l;
-    });
-    /**
-     * The exposed function that allows to resolve the promise.
-     *
-     * This protected property is the only one that can be modified directly by the derived classes.  
-     * If you're looking for the public and readonly property, use the {@link DeferredPromise.resolve} getter instead.
-     */
-    a(this, "_resolve");
-    /**
-     * The exposed function that allows to reject the promise.
-     *
-     * This protected property is the only one that can be modified directly by the derived classes.  
-     * If you're looking for the public and readonly property, use the {@link DeferredPromise.reject} getter instead.
-     */
-    a(this, "_reject");
-    a(this, Pe, "DeferredPromise");
-    this._promise = this._promise.then(e, t), this._resolve = s, this._reject = r;
-  }
-  /**
-   * The exposed function that allows to reject the promise.
-   */
-  get resolve() {
-    return this._resolve;
-  }
-  /**
-   * The exposed function that allows to reject the promise.
-   */
-  get reject() {
-    return this._reject;
+    let n, s;
+    super((i, o) => {
+      n = i, s = o;
+    }), this._promise = this._promise.then(e, t), this._resolve = n, this._reject = s;
   }
   /**
    * Watches another promise and resolves or rejects this promise when the other one is settled.
@@ -4744,9 +4693,9 @@ class Ve extends (je = S, Pe = Symbol.toStringTag, je) {
   watch(e) {
     return e.then(this.resolve, this.reject), this;
   }
+  [Symbol.toStringTag] = "DeferredPromise";
 }
-var Ce, Ie;
-class tt extends (Ie = S, Ce = Symbol.toStringTag, Ie) {
+class $ extends w {
   /**
    * Initializes a new instance of the {@link TimedPromise} class.
    *
@@ -4770,31 +4719,22 @@ class tt extends (Ie = S, Ce = Symbol.toStringTag, Ie) {
    * @param timeout The maximum time in milliseconds that the operation can take before timing out.
    */
   constructor(e, t) {
-    super((s, r) => {
-      const o = (T) => {
-        clearTimeout(C), s(T);
-      }, l = (T) => {
-        clearTimeout(C), r(T);
-      }, C = setTimeout(() => l(new Ze("The operation has timed out.")), t);
-      e(o, l);
+    super((n, s) => {
+      const i = (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);
     });
-    a(this, Ce, "TimedPromise");
   }
+  [Symbol.toStringTag] = "TimedPromise";
 }
-var Ae, Ne;
-class _t extends (Ne = S, Ae = Symbol.toStringTag, Ne) {
+class Z extends w {
   /**
-   * Initializes a new instance of the {@link PromiseQueue} class.
+   * The number of promises currently in the queue.
    */
-  constructor() {
-    super((e) => e());
-    /**
-     * The number of promises currently in the queue.
-     */
-    a(this, "_count");
-    a(this, Ae, "PromiseQueue");
-    this._count = 0, this._isPending = !1, this._isFulfilled = !1, this._isRejected = !1;
-  }
+  _count;
   /**
    * A flag indicating whether the promise is still pending or not.
    */
@@ -4816,120 +4756,74 @@ class _t extends (Ne = S, Ae = Symbol.toStringTag, Ne) {
   get isRejected() {
     throw new f("`PromiseQueue` doesn't support rejection states.");
   }
+  /**
+   * Initializes a new instance of the {@link PromiseQueue} class.
+   */
+  constructor() {
+    super((e) => e()), this._count = 0, this._isPending = !1, this._isFulfilled = !1, this._isRejected = !1;
+  }
   enqueue(e, t) {
-    if (this._count += 1, e instanceof Ve) {
-      const r = e;
-      e = () => (r.resolve(), r);
+    if (this._count += 1, e instanceof M) {
+      const s = e;
+      e = () => (s.resolve(), s);
     }
-    const s = (r, o) => {
-      this._promise = this._promise.then(e).then((l) => {
-        this._count -= 1, r(l);
-      }).catch((l) => {
-        this._count -= 1, o(l);
+    const n = (s, i) => {
+      this._promise = this._promise.then(e).then((o) => {
+        this._count -= 1, s(o);
+      }).catch((o) => {
+        this._count -= 1, i(o);
       });
     };
-    return t ? new tt(s, t) : new Promise(s);
+    return t ? new $(n, t) : new w(n);
   }
+  [Symbol.toStringTag] = "PromiseQueue";
 }
-var R = /* @__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))(R || {}), nt = /* @__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))(nt || {});
-function yt(i, n, e = 864e5) {
-  let t;
-  return i = new Date(i), n = new Date(n), i < n ? t = Math.floor : t = Math.ceil, t((n.getTime() - i.getTime()) / e);
+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) {
+  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);
 }
-function bt(i, n, e = 864e5) {
-  if (i = new Date(i), n = new Date(n), i >= n)
+function U(r, e, t = 864e5) {
+  if (r = new Date(r), e = new Date(e), r >= e)
     throw new b("The end date must be greater than the start date.");
-  return new u(function* () {
-    const t = n.getTime();
-    let s = i.getTime();
-    for (; s < t; )
-      yield new Date(s), s += e;
+  return new l(function* () {
+    const n = e.getTime();
+    let s = r.getTime();
+    for (; s < n; )
+      yield new Date(s), s += t;
   });
 }
-function st(i, n = 864e5) {
-  if (n <= 1)
+function I(r, e = 864e5) {
+  if (e <= 1)
     throw new b(
       "Rounding a timestamp by milliseconds or less makes no sense.Use the timestamp value directly instead."
     );
-  if (n > 864e5)
+  if (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 i = new Date(i), new Date(Math.floor(i.getTime() / n) * n);
+  return r = new Date(r), new Date(Math.floor(r.getTime() / e) * e);
 }
-function gt(i, n = 0) {
-  i = new Date(i);
-  const e = 7 - n, t = (i.getUTCDay() + e) % 7, s = i.getTime() - 864e5 * t;
-  return st(new Date(s));
+function ee(r, e = 0) {
+  r = new Date(r);
+  const t = 7 - e, n = (r.getUTCDay() + t) % 7, s = r.getTime() - 864e5 * n;
+  return I(new Date(s));
 }
-var Oe;
-Oe = Symbol.toStringTag;
-class Ge {
+class F {
   /**
-   * Initializes a new instance of the {@link GameLoop} class.
-   *
-   * ---
-   *
-   * @example
-   * ```ts
-   * const loop = new GameLoop((elapsedTime: number) => { [...] });
-   * ```
-   *
-   * ---
+   * 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.
+   */
+  _handle;
+  /**
+   * The time when the game loop has started.  
+   * In addition to indicating the {@link https://en.wikipedia.org/wiki/Unix_time|Unix timestamp}
+   * of the start of the game loop, it's also used to calculate the elapsed time.
    *
-   * @param callback The function that will be executed at each iteration of the game loop.
-   * @param msIfNotBrowser
-   * The interval in milliseconds that will be used if the current environment isn't a browser. Default is `40`.
+   * This protected property is the only one that can be modified directly by the derived classes.  
+   * If you're looking for the public and readonly property, use the {@link GameLoop.startTime} getter instead.
    */
-  constructor(n, e = 40) {
-    /**
-     * 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.
-     */
-    a(this, "_handle");
-    /**
-     * The time when the game loop has started.  
-     * In addition to indicating the {@link https://en.wikipedia.org/wiki/Unix_time|Unix timestamp}
-     * of the start of the game loop, it's also used to calculate the elapsed time.
-     *
-     * This protected property is the only one that can be modified directly by the derived classes.  
-     * If you're looking for the public and readonly property, use the {@link GameLoop.startTime} getter instead.
-     */
-    a(this, "_startTime");
-    /**
-     * A flag indicating whether the game loop is currently running or not.
-     *
-     * This protected property is the only one that can be modified directly by the derived classes.  
-     * If you're looking for the public and readonly property, use the {@link GameLoop.isRunning} getter instead.
-     */
-    a(this, "_isRunning");
-    /**
-     * The {@link Publisher} object that will be used to publish the events of the game loop.
-     */
-    a(this, "_publisher");
-    /**
-     * The internal method actually responsible for starting the game loop.
-     *
-     * Depending on the current environment, it could use the
-     * {@link requestAnimationFrame} or the {@link setInterval} function.
-     */
-    a(this, "_start");
-    /**
-     * The internal method actually responsible for stopping the game loop.
-     *
-     * Depending on the current environment, it could use the
-     * {@link cancelAnimationFrame} or the {@link clearInterval} function.
-     */
-    a(this, "_stop");
-    a(this, Oe, "GameLoop");
-    this._startTime = 0, this._isRunning = !1, Ye ? (this._start = () => {
-      n(this.elapsedTime), this._handle = window.requestAnimationFrame(this._start);
-    }, this._stop = () => window.cancelAnimationFrame(this._handle)) : (console.warn(
-      `Not a browser environment detected. Using setInterval@${e}ms instead of requestAnimationFrame...`
-    ), this._start = () => {
-      this._handle = setInterval(() => n(this.elapsedTime), e);
-    }, this._stop = () => clearInterval(this._handle)), this._publisher = new v();
-  }
+  _startTime;
   /**
    * The time when the game loop has started.  
    * In addition to indicating the {@link https://en.wikipedia.org/wiki/Unix_time|Unix timestamp}
@@ -4938,6 +4832,13 @@ class Ge {
   get startTime() {
     return this._startTime;
   }
+  /**
+   * A flag indicating whether the game loop is currently running or not.
+   *
+   * This protected property is the only one that can be modified directly by the derived classes.  
+   * If you're looking for the public and readonly property, use the {@link GameLoop.isRunning} getter instead.
+   */
+  _isRunning;
   /**
    * A flag indicating whether the game loop is currently running or not.
    */
@@ -4951,6 +4852,49 @@ class Ge {
   get elapsedTime() {
     return performance.now() - this._startTime;
   }
+  /**
+   * The {@link Publisher} object that will be used to publish the events of the game loop.
+   */
+  _publisher;
+  /**
+   * The internal method actually responsible for starting the game loop.
+   *
+   * Depending on the current environment, it could use the
+   * {@link requestAnimationFrame} or the {@link setInterval} function.
+   */
+  _start;
+  /**
+   * The internal method actually responsible for stopping the game loop.
+   *
+   * Depending on the current environment, it could use the
+   * {@link cancelAnimationFrame} or the {@link clearInterval} function.
+   */
+  _stop;
+  /**
+   * Initializes a new instance of the {@link GameLoop} class.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const loop = new GameLoop((elapsedTime: number) => { [...] });
+   * ```
+   *
+   * ---
+   *
+   * @param callback The function that will be executed at each iteration of the game loop.
+   * @param msIfNotBrowser
+   * 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 = () => {
+      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...`
+    ), this._start = () => {
+      this._handle = setInterval(() => e(this.elapsedTime), t);
+    }, this._stop = () => clearInterval(this._handle)), this._publisher = new g();
+  }
   /**
    * Starts the execution of the game loop.
    *
@@ -4968,10 +4912,10 @@ class Ge {
    *
    * @param elapsedTime The elapsed time to set as default when the game loop starts. Default is `0`.
    */
-  start(n = 0) {
+  start(e = 0) {
     if (this._isRunning)
       throw new p("The game loop has already been started.");
-    this._startTime = performance.now() - n, this._start(), this._isRunning = !0, this._publisher.publish("start");
+    this._startTime = performance.now() - e, this._start(), this._isRunning = !0, this._publisher.publish("start");
   }
   /**
    * Stops the execution of the game loop.
@@ -4990,7 +4934,7 @@ class Ge {
     if (!this._isRunning)
       throw new p("The game loop had already stopped or hadn't yet started.");
     if (!this._handle)
-      throw new g();
+      throw new x();
     this._stop(), this._handle = void 0, this._isRunning = !1, this._publisher.publish("stop");
   }
   /**
@@ -5009,8 +4953,8 @@ class Ge {
    *
    * @returns A function that can be used to unsubscribe from the event.
    */
-  onStart(n) {
-    return this._publisher.subscribe("start", n);
+  onStart(e) {
+    return this._publisher.subscribe("start", e);
   }
   /**
    * Subscribes to the `stop` event of the game loop.
@@ -5028,12 +4972,12 @@ class Ge {
    *
    * @returns A function that can be used to unsubscribe from the event.
    */
-  onStop(n) {
-    return this._publisher.subscribe("stop", n);
+  onStop(e) {
+    return this._publisher.subscribe("stop", e);
   }
+  [Symbol.toStringTag] = "GameLoop";
 }
-var qe, $e;
-class xt extends ($e = Ge, qe = Symbol.toStringTag, $e) {
+class te extends F {
   /**
    * Initializes a new instance of the {@link Clock} class.
    *
@@ -5050,9 +4994,8 @@ class xt extends ($e = Ge, qe = Symbol.toStringTag, $e) {
    * The interval in milliseconds at which the clock will tick if the environment is not a browser.  
    * `TimeUnit.Second` by default.
    */
-  constructor(e = R.Second) {
+  constructor(e = k.Second) {
     super((t) => this._publisher.publish("tick", t), e);
-    a(this, qe, "Clock");
   }
   /**
    * Starts the execution of the clock.
@@ -5093,7 +5036,7 @@ class xt extends ($e = Ge, qe = Symbol.toStringTag, $e) {
     if (!this._isRunning)
       throw new p("The clock had already stopped or hadn't yet started.");
     if (!this._handle)
-      throw new g();
+      throw new x();
     this._stop(), this._handle = void 0, this._isRunning = !1, this._publisher.publish("stop");
   }
   /**
@@ -5125,14 +5068,38 @@ class xt extends ($e = Ge, qe = Symbol.toStringTag, $e) {
       throw new b("The tick step must be a non-negative number.");
     if (t === 0)
       return this._publisher.subscribe("tick", e);
-    let s = 0;
-    return this._publisher.subscribe("tick", (r) => {
-      r - s < t || (e(r), s = r);
+    let n = 0;
+    return this._publisher.subscribe("tick", (s) => {
+      s - n < t || (e(s), n = s);
     });
   }
+  [Symbol.toStringTag] = "Clock";
 }
-var ze, De;
-class vt extends (De = Ge, ze = Symbol.toStringTag, De) {
+class ne extends F {
+  /**
+   * The total duration of the countdown in milliseconds.
+   *
+   * This protected property is the only one that can be modified directly by the derived classes.  
+   * If you're looking for the public and readonly property, use the {@link Countdown.duration} getter instead.
+   */
+  _duration;
+  /**
+   * The total duration of the countdown in milliseconds.
+   */
+  get duration() {
+    return this._duration;
+  }
+  /**
+   * The remaining time of the countdown in milliseconds.  
+   * It's calculated as the difference between the total duration and the elapsed time.
+   */
+  get remainingTime() {
+    return this._duration - this.elapsedTime;
+  }
+  /**
+   * The {@link DeferredPromise} that will be resolved or rejected when the countdown expires or stops.
+   */
+  _deferrer;
   /**
    * Initializes a new instance of the {@link Countdown} class.
    *
@@ -5152,37 +5119,12 @@ class vt extends (De = Ge, ze = Symbol.toStringTag, De) {
    * The interval in milliseconds at which the countdown will tick if the environment is not a browser.  
    * `TimeUnit.Second` by default.
    */
-  constructor(e, t = R.Second) {
-    super(() => {
-      const r = this.remainingTime;
-      r <= 0 ? (this._deferrerStop(), this._publisher.publish("tick", 0), this._publisher.publish("expire")) : this._publisher.publish("tick", r);
-    }, t);
-    /**
-     * The total duration of the countdown in milliseconds.
-     *
-     * This protected property is the only one that can be modified directly by the derived classes.  
-     * If you're looking for the public and readonly property, use the {@link Countdown.duration} getter instead.
-     */
-    a(this, "_duration");
-    /**
-     * The {@link DeferredPromise} that will be resolved or rejected when the countdown expires or stops.
-     */
-    a(this, "_deferrer");
-    a(this, ze, "Countdown");
-    this._duration = e;
-  }
-  /**
-   * The total duration of the countdown in milliseconds.
-   */
-  get duration() {
-    return this._duration;
-  }
-  /**
-   * The remaining time of the countdown in milliseconds.  
-   * It's calculated as the difference between the total duration and the elapsed time.
-   */
-  get remainingTime() {
-    return this._duration - this.elapsedTime;
+  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);
+    };
+    super(n, t), this._duration = e;
   }
   /**
    * The internal method actually responsible for stopping the
@@ -5200,7 +5142,7 @@ class vt extends (De = Ge, ze = Symbol.toStringTag, De) {
     if (!this._isRunning)
       throw new p("The countdown hadn't yet started.");
     if (!this._deferrer)
-      throw new g();
+      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;
   }
   /**
@@ -5228,8 +5170,8 @@ class vt extends (De = Ge, ze = Symbol.toStringTag, De) {
     if (this._isRunning)
       throw new p("The countdown had already stopped or hadn't yet started.");
     if (this._deferrer)
-      throw new g();
-    return this._deferrer = new Ve(), super.start(this.duration - e), this._publisher.publish("start"), this._deferrer;
+      throw new x();
+    return this._deferrer = new M(), super.start(this.duration - e), this._publisher.publish("start"), this._deferrer;
   }
   /**
    * Stops the execution of the countdown.
@@ -5304,18 +5246,14 @@ class vt extends (De = Ge, ze = Symbol.toStringTag, De) {
       throw new b("The tick step must be a non-negative number.");
     if (t === 0)
       return this._publisher.subscribe("tick", e);
-    let s = this.remainingTime;
-    return this._publisher.subscribe("tick", (r) => {
-      s - r < t || (e(r), s = r);
+    let n = this.remainingTime;
+    return this._publisher.subscribe("tick", (s) => {
+      n - s < t || (e(s), n = s);
     });
   }
+  [Symbol.toStringTag] = "Countdown";
 }
-var Be;
-Be = Symbol.toStringTag;
-class St {
-  constructor() {
-    a(this, Be, "Curve");
-  }
+class se {
   /**
    * Generates a given number of values following a linear curve.  
    * The values are equally spaced and normalized between 0 and 1.
@@ -5336,11 +5274,11 @@ class St {
    *
    * @returns A {@link SmartIterator} object that generates the values following a linear curve.
    */
-  static Linear(n) {
-    const e = n - 1;
-    return new u(function* () {
-      for (let t = 0; t < n; t += 1)
-        yield t / e;
+  static Linear(e) {
+    const t = e - 1;
+    return new l(function* () {
+      for (let n = 0; n < e; n += 1)
+        yield n / t;
     });
   }
   /**
@@ -5371,22 +5309,20 @@ class St {
    *
    * @returns A {@link SmartIterator} object that generates the values following an exponential curve.
    */
-  static Exponential(n, e = 2) {
-    if (e < 0)
+  static Exponential(e, t = 2) {
+    if (t < 0)
       throw new f("The base of the exponential curve cannot be negative.");
-    const t = n - 1;
-    return new u(function* () {
-      for (let s = 0; s < n; s += 1)
-        yield Math.pow(s / t, e);
+    const n = e - 1;
+    return new l(function* () {
+      for (let s = 0; s < e; s += 1)
+        yield Math.pow(s / n, t);
     });
   }
-}
-var Je;
-Je = Symbol.toStringTag;
-const j = class j {
   constructor() {
-    a(this, Je, "Random");
   }
+  [Symbol.toStringTag] = "Curve";
+}
+class R {
   /**
    * Generates a random boolean value.
    *
@@ -5409,14 +5345,14 @@ const j = class j {
    *
    * @returns A random boolean value.
    */
-  static Boolean(n = 0.5) {
-    return Math.random() < n;
+  static Boolean(e = 0.5) {
+    return Math.random() < e;
   }
-  static Integer(n, e) {
-    return Math.floor(e === void 0 ? Math.random() * n : Math.random() * (e - n) + n);
+  static Integer(e, t) {
+    return Math.floor(t === void 0 ? Math.random() * e : Math.random() * (t - e) + e);
   }
-  static Decimal(n, e) {
-    return n === void 0 ? Math.random() : e === void 0 ? Math.random() * n : Math.random() * (e - n) + n;
+  static Decimal(e, t) {
+    return e === void 0 ? Math.random() : t === void 0 ? Math.random() * e : Math.random() * (t - e) + e;
   }
   /**
    * Picks a random valid index from a given array of elements.
@@ -5432,10 +5368,10 @@ const j = class j {
    *
    * @returns A valid random index from the given array.
    */
-  static Index(n) {
-    if (n.length === 0)
+  static Index(e) {
+    if (e.length === 0)
       throw new f("You must provide at least one element.");
-    return this.Integer(n.length);
+    return this.Integer(e.length);
   }
   /**
    * Picks a random element from a given array of elements.
@@ -5451,187 +5387,189 @@ const j = class j {
    *
    * @returns A random element from the given array.
    */
-  static Choice(n) {
-    return n[j.Index(n)];
+  static Choice(e) {
+    return e[R.Index(e)];
   }
-};
-let I = j;
-function kt(i) {
-  return new Promise((n) => setTimeout(n, i));
+  constructor() {
+  }
+  [Symbol.toStringTag] = "Random";
+}
+function ie(r) {
+  return new w((e) => setTimeout(e, r));
 }
-function Tt() {
-  return new Promise((i) => requestAnimationFrame(() => i()));
+function re() {
+  return new w((r) => requestAnimationFrame(() => r()));
 }
-function Et() {
-  return new Promise((i) => setTimeout(i));
+function oe() {
+  return new w((r) => setTimeout(r));
 }
-function Mt(i, n = "text/javascript") {
-  return new Promise((e, t) => {
+function ae(r, e = "text/javascript") {
+  return new w((t, n) => {
     const s = document.createElement("script");
-    s.async = !0, s.defer = !0, s.src = i, s.type = n, s.onload = (r) => e(), s.onerror = (r) => t(r), document.body.appendChild(s);
+    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);
   });
 }
-function Rt(...i) {
-  return new u(function* () {
-    for (const n of i)
-      for (const e of n)
-        yield e;
+function le(...r) {
+  return new l(function* () {
+    for (const e of r)
+      for (const t of e)
+        yield t;
   });
 }
-function Ft(i) {
-  if (i instanceof Array)
-    return i.length;
-  let n = 0;
-  for (const e of i)
-    n += 1;
-  return n;
+function ue(r) {
+  if (r instanceof Array)
+    return r.length;
+  let e = 0;
+  for (const t of r)
+    e += 1;
+  return e;
 }
-function Pt(i) {
-  return new u(function* () {
-    let n = 0;
-    for (const e of i)
-      yield [n, e], n += 1;
+function ce(r) {
+  return new l(function* () {
+    let e = 0;
+    for (const t of r)
+      yield [e, t], e += 1;
   });
 }
-function jt(i, n, e = 1) {
-  if (e <= 0)
+function he(r, e, t = 1) {
+  if (t <= 0)
     throw new b(
       "Step must be always a positive number, even when generating numbers in reverse order."
     );
-  return n === void 0 && (n = i, i = 0), i > n ? new u(function* () {
-    for (let t = i; t > n; t -= e)
-      yield t;
-  }) : new u(function* () {
-    for (let t = i; t < n; t += e)
-      yield t;
+  return e === void 0 && (e = r, r = 0), r > e ? new l(function* () {
+    for (let n = r; n > e; n -= t)
+      yield n;
+  }) : new l(function* () {
+    for (let n = r; n < e; n += t)
+      yield n;
   });
 }
-function Ct(i) {
-  const n = Array.from(i);
-  for (let e = n.length - 1; e > 0; e -= 1) {
-    const t = Math.floor(Math.random() * (e + 1));
-    [n[e], n[t]] = [n[t], n[e]];
+function fe(r) {
+  const e = Array.from(r);
+  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 n;
+  return e;
 }
-function It(i) {
-  return new u(function* () {
-    const n = /* @__PURE__ */ new Set();
-    for (const e of i)
-      n.has(e) || (n.add(e), yield e);
+function de(r) {
+  return new l(function* () {
+    const e = /* @__PURE__ */ new Set();
+    for (const t of r)
+      e.has(t) || (e.add(t), yield t);
   });
 }
-function rt(i, n) {
-  const e = i[Symbol.iterator](), t = n[Symbol.iterator]();
-  return new u(function* () {
+function D(r, e) {
+  const t = r[Symbol.iterator](), n = e[Symbol.iterator]();
+  return new l(function* () {
     for (; ; ) {
-      const s = e.next(), r = t.next();
-      if (s.done || r.done)
+      const s = t.next(), i = n.next();
+      if (s.done || i.done)
         break;
-      yield [s.value, r.value];
+      yield [s.value, i.value];
     }
   });
 }
-function At(i, n) {
-  if (n === void 0) {
-    let r = 0, o = 0;
-    for (const l of i)
-      r += l, o += 1;
+function we(r, e) {
+  if (e === void 0) {
+    let i = 0, o = 0;
+    for (const a of r)
+      i += a, o += 1;
     if (o === 0)
       throw new f("You must provide at least one value.");
-    return r / o;
+    return i / o;
   }
-  let e = 0, t = 0, s = 0;
-  for (const [r, o] of rt(i, n)) {
+  let t = 0, n = 0, s = 0;
+  for (const [i, o] of D(r, e)) {
     if (o <= 0)
       throw new f(`The weight for the value #${s} must be greater than zero.`);
-    e += r * o, t += o, s += 1;
+    t += i * o, n += o, s += 1;
   }
   if (s === 0)
     throw new f("You must provide at least one value and weight.");
-  if (t <= 0)
+  if (n <= 0)
     throw new f("The sum of weights must be greater than zero.");
-  return e / t;
+  return t / n;
 }
-function Nt(i) {
-  let n = 0;
-  for (let e = 0; e < i.length; e += 1) {
-    const t = i.charCodeAt(e);
-    n = (n << 5) - n + t, n |= 0;
+function me(r) {
+  let e = 0;
+  for (let t = 0; t < r.length; t += 1) {
+    const n = r.charCodeAt(t);
+    e = (e << 5) - e + n, e |= 0;
   }
-  return n;
+  return e;
 }
-function Ot(i) {
-  let n = 0;
-  for (const e of i)
-    n += e;
-  return n;
+function pe(r) {
+  let e = 0;
+  for (const t of r)
+    e += t;
+  return e;
 }
-function qt(i) {
-  return `${i.charAt(0).toUpperCase()}${i.slice(1)}`;
+function _e(r) {
+  return `${r.charAt(0).toUpperCase()}${r.slice(1)}`;
 }
-const $t = "2.1.6";
+const ye = "2.1.8";
 export {
-  M as AggregatedAsyncIterator,
-  x as AggregatedIterator,
-  Ue as CallableObject,
-  xt as Clock,
-  vt as Countdown,
-  St as Curve,
-  Ve as DeferredPromise,
-  Xe as EnvironmentException,
+  m as AggregatedAsyncIterator,
+  h as AggregatedIterator,
+  O as CallableObject,
+  te as Clock,
+  ne as Countdown,
+  se as Curve,
+  M as DeferredPromise,
+  j as EnvironmentException,
   c as Exception,
-  g as FatalErrorException,
-  Le as FileException,
-  lt as FileExistsException,
-  ut as FileNotFoundException,
-  Ge as GameLoop,
-  pt as JSONStorage,
+  x as FatalErrorException,
+  E as FileException,
+  J as FileExistsException,
+  Y as FileNotFoundException,
+  F as GameLoop,
+  X as JSONStorage,
   _ as KeyException,
-  wt as MapView,
-  ct as NetworkException,
-  He as NotImplementedException,
-  ht as PermissionException,
-  _t as PromiseQueue,
-  v as Publisher,
-  I as Random,
+  Q as MapView,
+  L as NetworkException,
+  P as NotImplementedException,
+  V as PermissionException,
+  Z as PromiseQueue,
+  g as Publisher,
+  R as Random,
   b as RangeException,
-  h as ReducedIterator,
-  E as ReferenceException,
+  u as ReducedIterator,
+  S as ReferenceException,
   p as RuntimeException,
-  mt as SetView,
+  H as SetView,
   d as SmartAsyncIterator,
-  u as SmartIterator,
-  S as SmartPromise,
-  dt as SwitchableCallback,
-  R as TimeUnit,
-  tt as TimedPromise,
-  Ze as TimeoutException,
-  ft as TypeException,
-  $t as VERSION,
+  l as SmartIterator,
+  w as SmartPromise,
+  K as SwitchableCallback,
+  k as TimeUnit,
+  $ as TimedPromise,
+  C as TimeoutException,
+  G as TypeException,
+  ye as VERSION,
   f as ValueException,
-  nt as WeekDay,
-  At as average,
-  qt as capitalize,
-  Rt as chain,
-  Ft as count,
-  yt as dateDifference,
-  bt as dateRange,
-  st as dateRound,
-  kt as delay,
-  Pt as enumerate,
-  gt as getWeek,
-  Nt as hash,
-  Ye as isBrowser,
-  ot as isNode,
-  at as isWorker,
-  Mt as loadScript,
-  Tt as nextAnimationFrame,
-  jt as range,
-  Ct as shuffle,
-  Ot as sum,
-  It as unique,
-  Et as yieldToEventLoop,
-  rt as zip
+  z as WeekDay,
+  we as average,
+  _e as capitalize,
+  le as chain,
+  ue as count,
+  W as dateDifference,
+  U as dateRange,
+  I as dateRound,
+  ie as delay,
+  ce as enumerate,
+  ee as getWeek,
+  me as hash,
+  T as isBrowser,
+  A as isNode,
+  B as isWorker,
+  ae as loadScript,
+  re as nextAnimationFrame,
+  he as range,
+  fe as shuffle,
+  pe as sum,
+  de as unique,
+  oe as yieldToEventLoop,
+  D as zip
 };
 //# sourceMappingURL=core.esm.js.map