@byloth/core 2.0.1 → 2.1.0

package/dist/{core.js → core.esm.js}

@@ -1,13 +1,13 @@
-var De = Object.defineProperty;
-var ze = (i, t, e) => t in i ? De(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e;
-var a = (i, t, e) => ze(i, typeof t != "symbol" ? t + "" : t, e);
-const Oe = typeof window < "u" && typeof window.document < "u";
+var Ye = Object.defineProperty;
+var Le = (i, n, e) => n in i ? Ye(i, n, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[n] = e;
+var a = (i, n, e) => Le(i, typeof n != "symbol" ? n + "" : n, e);
+const De = typeof window < "u" && typeof window.document < "u";
 var I;
-const We = typeof process < "u" && !!((I = process.versions) != null && I.node);
+const nt = typeof process < "u" && !!((I = process.versions) != null && I.node);
 var A;
-const Ue = typeof self == "object" && ((A = self.constructor) == null ? void 0 : A.name) === "DedicatedWorkerGlobalScope";
+const st = typeof self == "object" && ((A = self.constructor) == null ? void 0 : A.name) === "DedicatedWorkerGlobalScope";
 var N, O;
-class u extends (O = Error, N = Symbol.toStringTag, O) {
+class c extends (O = Error, N = Symbol.toStringTag, O) {
   /**
    * Initializes a new instance of the {@link Exception} class.
    *
@@ -24,14 +24,14 @@ class u extends (O = Error, N = Symbol.toStringTag, O) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"Exception"`.
    */
-  constructor(e, n, s = "Exception") {
+  constructor(e, t, s = "Exception") {
     super(e);
     a(this, N, "Exception");
-    this.cause = n, this.name = s, n && (n instanceof Error ? this.stack += `
+    this.cause = t, this.name = s, t && (t instanceof Error ? this.stack += `
 
-Caused by ${n.stack}` : this.stack += `
+Caused by ${t.stack}` : this.stack += `
 
-Caused by ${n}`);
+Caused by ${t}`);
   }
   /**
    * A static method to convert a generic caught error, ensuring it's an instance of the {@link Exception} class.
@@ -56,17 +56,17 @@ Caused by ${n}`);
    * @returns An instance of the {@link Exception} class.
    */
   static FromUnknown(e) {
-    if (e instanceof u)
+    if (e instanceof c)
       return e;
     if (e instanceof Error) {
-      const n = new u(e.message);
-      return n.stack = e.stack, n.name = e.name, n;
+      const t = new c(e.message);
+      return t.stack = e.stack, t.name = e.name, t;
     }
-    return new u(`${e}`);
+    return new c(`${e}`);
   }
 }
-var $, q;
-class x extends (q = u, $ = Symbol.toStringTag, q) {
+var $, z;
+class g extends (z = c, $ = Symbol.toStringTag, z) {
   /**
    * Initializes a new instance of the {@link FatalErrorException} class.
    *
@@ -83,14 +83,14 @@ class x extends (q = u, $ = Symbol.toStringTag, q) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"FatalErrorException"`.
    */
-  constructor(e, n, s = "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, n, s);
+    super(e, t, s);
     a(this, $, "FatalErrorException");
   }
 }
-var D, z;
-class Be extends (z = x, D = Symbol.toStringTag, z) {
+var q, D;
+class Ve extends (D = g, q = Symbol.toStringTag, D) {
   /**
    * Initializes a new instance of the {@link NotImplementedException} class.
    *
@@ -107,14 +107,14 @@ class Be extends (z = x, D = Symbol.toStringTag, z) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"NotImplementedException"`.
    */
-  constructor(e, n, s = "NotImplementedException") {
+  constructor(e, t, s = "NotImplementedException") {
     e === void 0 && (e = "This feature isn't implemented yet. Please, try again later.");
-    super(e, n, s);
-    a(this, D, "NotImplementedException");
+    super(e, t, s);
+    a(this, q, "NotImplementedException");
   }
 }
 var B, J;
-class $e extends (J = u, B = Symbol.toStringTag, J) {
+class Be extends (J = c, B = Symbol.toStringTag, J) {
   /**
    * Initializes a new instance of the {@link FileException} class.
    *
@@ -131,13 +131,13 @@ class $e extends (J = u, B = Symbol.toStringTag, J) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"FileException"`.
    */
-  constructor(e, n, s = "FileException") {
-    super(e, n, s);
+  constructor(e, t, s = "FileException") {
+    super(e, t, s);
     a(this, B, "FileException");
   }
 }
 var Y, L;
-class et extends (L = $e, Y = Symbol.toStringTag, L) {
+class rt extends (L = Be, Y = Symbol.toStringTag, L) {
   /**
    * Initializes a new instance of the {@link FileExistsException} class.
    *
@@ -154,13 +154,13 @@ class et extends (L = $e, Y = Symbol.toStringTag, L) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"FileExistsException"`.
    */
-  constructor(e, n, s = "FileExistsException") {
-    super(e, n, s);
+  constructor(e, t, s = "FileExistsException") {
+    super(e, t, s);
     a(this, Y, "FileExistsException");
   }
 }
-var G, K;
-class tt extends (K = $e, G = Symbol.toStringTag, K) {
+var V, G;
+class it extends (G = Be, V = Symbol.toStringTag, G) {
   /**
    * Initializes a new instance of the {@link FileNotFoundException} class.
    *
@@ -177,13 +177,13 @@ class tt extends (K = $e, 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, n, s = "FileNotFoundException") {
-    super(e, n, s);
-    a(this, G, "FileNotFoundException");
+  constructor(e, t, s = "FileNotFoundException") {
+    super(e, t, s);
+    a(this, V, "FileNotFoundException");
   }
 }
-var H, Q;
-class _ extends (Q = u, H = Symbol.toStringTag, Q) {
+var K, H;
+class y extends (H = c, K = Symbol.toStringTag, H) {
   /**
    * Initializes a new instance of the {@link KeyException} class.
    *
@@ -200,13 +200,13 @@ class _ extends (Q = u, H = Symbol.toStringTag, Q) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"KeyException"`.
    */
-  constructor(e, n, s = "KeyException") {
-    super(e, n, s);
-    a(this, H, "KeyException");
+  constructor(e, t, s = "KeyException") {
+    super(e, t, s);
+    a(this, K, "KeyException");
   }
 }
-var V, X;
-class nt extends (X = u, V = Symbol.toStringTag, X) {
+var Q, X;
+class ot extends (X = c, Q = Symbol.toStringTag, X) {
   /**
    * Initializes a new instance of the {@link NetworkException} class.
    *
@@ -223,13 +223,13 @@ class nt extends (X = u, V = Symbol.toStringTag, X) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"NetworkException"`.
    */
-  constructor(e, n, s = "NetworkException") {
-    super(e, n, s);
-    a(this, V, "NetworkException");
+  constructor(e, t, s = "NetworkException") {
+    super(e, t, s);
+    a(this, Q, "NetworkException");
   }
 }
 var Z, W;
-class st extends (W = u, Z = Symbol.toStringTag, W) {
+class at extends (W = c, Z = Symbol.toStringTag, W) {
   /**
    * Initializes a new instance of the {@link PermissionException} class.
    *
@@ -246,13 +246,13 @@ class st extends (W = u, Z = Symbol.toStringTag, W) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"PermissionException"`.
    */
-  constructor(e, n, s = "PermissionException") {
-    super(e, n, s);
+  constructor(e, t, s = "PermissionException") {
+    super(e, t, s);
     a(this, Z, "PermissionException");
   }
 }
 var U, ee;
-class C extends (ee = u, U = Symbol.toStringTag, ee) {
+class C extends (ee = c, U = Symbol.toStringTag, ee) {
   /**
    * Initializes a new instance of the {@link ReferenceException} class.
    *
@@ -269,13 +269,13 @@ class C extends (ee = u, U = Symbol.toStringTag, ee) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"ReferenceException"`.
    */
-  constructor(e, n, s = "ReferenceException") {
-    super(e, n, s);
+  constructor(e, t, s = "ReferenceException") {
+    super(e, t, s);
     a(this, U, "ReferenceException");
   }
 }
 var te, ne;
-class y extends (ne = u, te = Symbol.toStringTag, ne) {
+class p extends (ne = c, te = Symbol.toStringTag, ne) {
   /**
    * Initializes a new instance of the {@link RuntimeException} class.
    *
@@ -292,13 +292,13 @@ class y extends (ne = u, te = Symbol.toStringTag, ne) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"RuntimeException"`.
    */
-  constructor(e, n, s = "RuntimeException") {
-    super(e, n, s);
+  constructor(e, t, s = "RuntimeException") {
+    super(e, t, s);
     a(this, te, "RuntimeException");
   }
 }
 var se, re;
-class Je extends (re = y, se = Symbol.toStringTag, re) {
+class Ge extends (re = p, se = Symbol.toStringTag, re) {
   /**
    * Initializes a new instance of the {@link EnvironmentException} class.
    *
@@ -315,13 +315,13 @@ class Je extends (re = y, se = Symbol.toStringTag, re) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"EnvironmentException"`.
    */
-  constructor(e, n, s = "EnvironmentException") {
-    super(e, n, s);
+  constructor(e, t, s = "EnvironmentException") {
+    super(e, t, s);
     a(this, se, "EnvironmentException");
   }
 }
 var ie, oe;
-class Ye extends (oe = u, ie = Symbol.toStringTag, oe) {
+class Ke extends (oe = c, ie = Symbol.toStringTag, oe) {
   /**
    * Initializes a new instance of the {@link TimeoutException} class.
    *
@@ -338,13 +338,13 @@ class Ye extends (oe = u, ie = Symbol.toStringTag, oe) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"TimeoutException"`.
    */
-  constructor(e, n, s = "TimeoutException") {
-    super(e, n, s);
+  constructor(e, t, s = "TimeoutException") {
+    super(e, t, s);
     a(this, ie, "TimeoutException");
   }
 }
 var ae, le;
-class rt extends (le = u, ae = Symbol.toStringTag, le) {
+class lt extends (le = c, ae = Symbol.toStringTag, le) {
   /**
    * Initializes a new instance of the {@link TypeException} class.
    *
@@ -361,13 +361,13 @@ class rt extends (le = u, ae = Symbol.toStringTag, le) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"TypeException"`.
    */
-  constructor(e, n, s = "TypeException") {
-    super(e, n, s);
+  constructor(e, t, s = "TypeException") {
+    super(e, t, s);
     a(this, ae, "TypeException");
   }
 }
-var ce, ue;
-class d extends (ue = u, ce = Symbol.toStringTag, ue) {
+var ue, ce;
+class d extends (ce = c, ue = Symbol.toStringTag, ce) {
   /**
    * Initializes a new instance of the {@link ValueException} class.
    *
@@ -384,9 +384,9 @@ class d extends (ue = u, ce = Symbol.toStringTag, ue) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"ValueException"`.
    */
-  constructor(e, n, s = "ValueException") {
-    super(e, n, s);
-    a(this, ce, "ValueException");
+  constructor(e, t, s = "ValueException") {
+    super(e, t, s);
+    a(this, ue, "ValueException");
   }
 }
 var he, fe;
@@ -407,20 +407,20 @@ class b extends (fe = d, he = Symbol.toStringTag, fe) {
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"RangeException"`.
    */
-  constructor(e, n, s = "RangeException") {
-    super(e, n, s);
+  constructor(e, t, s = "RangeException") {
+    super(e, t, s);
     a(this, he, "RangeException");
   }
 }
 var de;
-class c {
-  constructor(t) {
+class u {
+  constructor(n) {
     /**
      * The native {@link Iterator} object that is being wrapped by this instance.
      */
     a(this, "_iterator");
     a(this, de, "SmartIterator");
-    t instanceof Function ? this._iterator = t() : Symbol.iterator in t ? this._iterator = t[Symbol.iterator]() : this._iterator = t;
+    n instanceof Function ? this._iterator = n() : Symbol.iterator in n ? this._iterator = n[Symbol.iterator]() : this._iterator = n;
   }
   /**
    * Determines whether all elements of the iterator satisfy a given condition.
@@ -451,13 +451,13 @@ class c {
    *
    * @returns `true` if all elements satisfy the condition, `false` otherwise.
    */
-  every(t) {
+  every(n) {
     let e = 0;
     for (; ; ) {
-      const n = this._iterator.next();
-      if (n.done)
+      const t = this._iterator.next();
+      if (t.done)
         return !0;
-      if (!t(n.value, e))
+      if (!n(t.value, e))
         return !1;
       e += 1;
     }
@@ -491,26 +491,26 @@ class c {
    *
    * @returns `true` if any element satisfies the condition, `false` otherwise.
    */
-  some(t) {
+  some(n) {
     let e = 0;
     for (; ; ) {
-      const n = this._iterator.next();
-      if (n.done)
+      const t = this._iterator.next();
+      if (t.done)
         return !1;
-      if (t(n.value, e))
+      if (n(t.value, e))
         return !0;
       e += 1;
     }
   }
-  filter(t) {
+  filter(n) {
     const e = this._iterator;
-    return new c(function* () {
-      let n = 0;
+    return new u(function* () {
+      let t = 0;
       for (; ; ) {
         const s = e.next();
         if (s.done)
           return s.value;
-        t(s.value, n) && (yield s.value), n += 1;
+        n(s.value, t) && (yield s.value), t += 1;
       }
     });
   }
@@ -545,31 +545,31 @@ class c {
    *
    * @returns A new {@link SmartIterator} containing the transformed elements.
    */
-  map(t) {
+  map(n) {
     const e = this._iterator;
-    return new c(function* () {
-      let n = 0;
+    return new u(function* () {
+      let t = 0;
       for (; ; ) {
         const s = e.next();
         if (s.done)
           return s.value;
-        yield t(s.value, n), n += 1;
+        yield n(s.value, t), t += 1;
       }
     });
   }
-  reduce(t, e) {
-    let n = 0, s = e;
+  reduce(n, e) {
+    let t = 0, s = e;
     if (s === void 0) {
       const r = this._iterator.next();
       if (r.done)
         throw new d("Cannot reduce an empty iterator without an initial value.");
-      s = r.value, n += 1;
+      s = r.value, t += 1;
     }
     for (; ; ) {
       const r = this._iterator.next();
       if (r.done)
         return s;
-      s = t(s, r.value, n), n += 1;
+      s = n(s, r.value, t), t += 1;
     }
   }
   /**
@@ -603,21 +603,21 @@ class c {
    *
    * @returns A new {@link SmartIterator} containing the flattened elements.
    */
-  flatMap(t) {
+  flatMap(n) {
     const e = this._iterator;
-    return new c(function* () {
-      let n = 0;
+    return new u(function* () {
+      let t = 0;
       for (; ; ) {
         const s = e.next();
         if (s.done)
           return s.value;
-        const r = t(s.value, n);
+        const r = n(s.value, t);
         if (r instanceof Array)
           for (const o of r)
             yield o;
         else
           yield r;
-        n += 1;
+        t += 1;
       }
     });
   }
@@ -652,14 +652,14 @@ class c {
    *
    * @returns A new {@link SmartIterator} containing the remaining elements.
    */
-  drop(t) {
+  drop(n) {
     const e = this._iterator;
-    return new c(function* () {
-      let n = 0;
-      for (; n < t; ) {
+    return new u(function* () {
+      let t = 0;
+      for (; t < n; ) {
         if (e.next().done)
           return;
-        n += 1;
+        t += 1;
       }
       for (; ; ) {
         const s = e.next();
@@ -701,26 +701,26 @@ class c {
    *
    * @returns A new {@link SmartIterator} containing the taken elements.
    */
-  take(t) {
+  take(n) {
     const e = this._iterator;
-    return new c(function* () {
-      let n = 0;
-      for (; n < t; ) {
+    return new u(function* () {
+      let t = 0;
+      for (; t < n; ) {
         const s = e.next();
         if (s.done)
           return s.value;
-        yield s.value, n += 1;
+        yield s.value, t += 1;
       }
     });
   }
-  find(t) {
+  find(n) {
     let e = 0;
     for (; ; ) {
-      const n = this._iterator.next();
-      if (n.done)
+      const t = this._iterator.next();
+      if (t.done)
         return;
-      if (t(n.value, e))
-        return n.value;
+      if (n(t.value, e))
+        return t.value;
       e += 1;
     }
   }
@@ -750,7 +750,7 @@ class c {
    * @returns A new {@link SmartIterator} containing the enumerated elements.
    */
   enumerate() {
-    return this.map((t, e) => [e, t]);
+    return this.map((n, e) => [e, n]);
   }
   /**
    * Removes all duplicate elements from the iterator.  
@@ -778,14 +778,14 @@ class c {
    * @returns A new {@link SmartIterator} containing only the unique elements.
    */
   unique() {
-    const t = this._iterator;
-    return new c(function* () {
+    const n = this._iterator;
+    return new u(function* () {
       const e = /* @__PURE__ */ new Set();
       for (; ; ) {
-        const n = t.next();
-        if (n.done)
-          return n.value;
-        e.has(n.value) || (e.add(n.value), yield n.value);
+        const t = n.next();
+        if (t.done)
+          return t.value;
+        e.has(t.value) || (e.add(t.value), yield t.value);
       }
     });
   }
@@ -810,11 +810,11 @@ class c {
    * @returns The number of elements in the iterator.
    */
   count() {
-    let t = 0;
+    let n = 0;
     for (; ; ) {
       if (this._iterator.next().done)
-        return t;
-      t += 1;
+        return n;
+      n += 1;
     }
   }
   /**
@@ -839,13 +839,13 @@ class c {
    *
    * @param iteratee The function to apply to each element of the iterator.
    */
-  forEach(t) {
+  forEach(n) {
     let e = 0;
     for (; ; ) {
-      const n = this._iterator.next();
-      if (n.done)
+      const t = this._iterator.next();
+      if (t.done)
         return;
-      t(n.value, e), e += 1;
+      n(t.value, e), e += 1;
     }
   }
   /**
@@ -877,8 +877,8 @@ class c {
    *
    * @returns The result of the iteration, containing the value of the operation.
    */
-  next(...t) {
-    return this._iterator.next(...t);
+  next(...n) {
+    return this._iterator.next(...n);
   }
   /**
    * An utility method that may be used to close the iterator gracefully,
@@ -912,8 +912,8 @@ class c {
    *
    * @returns The result of the iterator.
    */
-  return(t) {
-    return this._iterator.return ? this._iterator.return(t) : { done: !0, value: t };
+  return(n) {
+    return this._iterator.return ? this._iterator.return(n) : { done: !0, value: n };
   }
   /**
    * An utility method that may be used to close the iterator due to an error,
@@ -956,10 +956,10 @@ class c {
    *
    * @returns The final result of the iterator.
    */
-  throw(t) {
+  throw(n) {
     if (this._iterator.throw)
-      return this._iterator.throw(t);
-    throw t;
+      return this._iterator.throw(n);
+    throw n;
   }
   /**
    * An utility method that aggregates the elements of the iterator using a given key function.  
@@ -991,8 +991,8 @@ class c {
    *
    * @returns A new instance of the {@link AggregatedIterator} class containing the grouped elements.
    */
-  groupBy(t) {
-    return new g(this.map((e, n) => [t(e, n), e]));
+  groupBy(n) {
+    return new x(this.map((e, t) => [n(e, t), e]));
   }
   /**
    * Materializes the iterator into an array.  
@@ -1026,14 +1026,14 @@ class c {
 }
 var we;
 we = Symbol.toStringTag;
-const p = class p {
-  constructor(t) {
+const _ = class _ {
+  constructor(n) {
     /**
      * The internal {@link SmartIterator} object that holds the reduced elements.
      */
     a(this, "_elements");
     a(this, we, "ReducedIterator");
-    this._elements = new c(t);
+    this._elements = new u(n);
   }
   /**
    * Determines whether all elements of the reduced iterator satisfy the given condition.
@@ -1066,9 +1066,9 @@ const p = class p {
    *
    * @returns `true` if all elements satisfy the condition, `false` otherwise.
    */
-  every(t) {
-    for (const [e, [n, s]] of this._elements.enumerate())
-      if (!t(n, s, e))
+  every(n) {
+    for (const [e, [t, s]] of this._elements.enumerate())
+      if (!n(t, s, e))
         return !1;
     return !0;
   }
@@ -1103,17 +1103,17 @@ const p = class p {
    *
    * @returns `true` if any element satisfies the condition, `false` otherwise.
    */
-  some(t) {
-    for (const [e, [n, s]] of this._elements.enumerate())
-      if (t(n, s, e))
+  some(n) {
+    for (const [e, [t, s]] of this._elements.enumerate())
+      if (n(t, s, e))
         return !0;
     return !1;
   }
-  filter(t) {
+  filter(n) {
     const e = this._elements.enumerate();
-    return new p(function* () {
-      for (const [n, [s, r]] of e)
-        t(s, r, n) && (yield [s, r]);
+    return new _(function* () {
+      for (const [t, [s, r]] of e)
+        n(s, r, t) && (yield [s, r]);
     });
   }
   /**
@@ -1149,23 +1149,23 @@ const p = class p {
    *
    * @returns A new {@link ReducedIterator} containing the transformed elements.
    */
-  map(t) {
+  map(n) {
     const e = this._elements.enumerate();
-    return new p(function* () {
-      for (const [n, [s, r]] of e)
-        yield [s, t(s, r, n)];
+    return new _(function* () {
+      for (const [t, [s, r]] of e)
+        yield [s, n(s, r, t)];
     });
   }
-  reduce(t, e) {
-    let n = 0, s = e;
+  reduce(n, e) {
+    let t = 0, s = e;
     if (s === void 0) {
       const r = this._elements.next();
       if (r.done)
         throw new d("Cannot reduce an empty iterator without an initial value.");
-      s = r.value[1], n += 1;
+      s = r.value[1], t += 1;
     }
     for (const [r, o] of this._elements)
-      s = t(r, s, o, n), n += 1;
+      s = n(r, s, o, t), t += 1;
     return s;
   }
   /**
@@ -1201,11 +1201,11 @@ const p = class p {
    *
    * @returns A new {@link AggregatedIterator} containing the flattened elements.
    */
-  flatMap(t) {
+  flatMap(n) {
     const e = this._elements.enumerate();
-    return new g(function* () {
-      for (const [n, [s, r]] of e) {
-        const o = t(s, r, n);
+    return new x(function* () {
+      for (const [t, [s, r]] of e) {
+        const o = n(s, r, t);
         if (o instanceof Array)
           for (const l of o)
             yield [s, l];
@@ -1240,16 +1240,18 @@ const p = class p {
    *
    * console.log(results.toObject()); // { even: [0, 2, 6, 8] }
    * ```
-   * 
+   *
+   * ---
+   *
    * @param count The number of elements to drop.
    *
    * @returns A new {@link ReducedIterator} containing the remaining elements.
    */
-  drop(t) {
+  drop(n) {
     const e = this._elements.enumerate();
-    return new p(function* () {
-      for (const [n, [s, r]] of e)
-        n >= t && (yield [s, r]);
+    return new _(function* () {
+      for (const [t, [s, r]] of e)
+        t >= n && (yield [s, r]);
     });
   }
   /**
@@ -1287,19 +1289,19 @@ const p = class p {
    *
    * @returns A new {@link ReducedIterator} containing the taken elements.
    */
-  take(t) {
+  take(n) {
     const e = this._elements.enumerate();
-    return new p(function* () {
-      for (const [n, [s, r]] of e) {
-        if (n >= t)
+    return new _(function* () {
+      for (const [t, [s, r]] of e) {
+        if (t >= n)
           break;
         yield [s, r];
       }
     });
   }
-  find(t) {
-    for (const [e, [n, s]] of this._elements.enumerate())
-      if (t(n, s, e))
+  find(n) {
+    for (const [e, [t, s]] of this._elements.enumerate())
+      if (n(t, s, e))
         return s;
   }
   /**
@@ -1330,7 +1332,7 @@ const p = class p {
    * @returns A new {@link ReducedIterator} object containing the enumerated elements.
    */
   enumerate() {
-    return this.map((t, e, n) => [n, e]);
+    return this.map((n, e, t) => [t, e]);
   }
   /**
    * Removes all duplicate elements from the reduced iterator.  
@@ -1358,11 +1360,11 @@ const p = class p {
    * @returns A new {@link ReducedIterator} containing only the unique elements.
    */
   unique() {
-    const t = this._elements;
-    return new p(function* () {
+    const n = this._elements;
+    return new _(function* () {
       const e = /* @__PURE__ */ new Set();
-      for (const [n, s] of t)
-        e.has(s) || (e.add(s), yield [n, s]);
+      for (const [t, s] of n)
+        e.has(s) || (e.add(s), yield [t, s]);
     });
   }
   /**
@@ -1388,10 +1390,10 @@ const p = class p {
    * @returns The number of elements in the iterator.
    */
   count() {
-    let t = 0;
+    let n = 0;
     for (const e of this._elements)
-      t += 1;
-    return t;
+      n += 1;
+    return n;
   }
   /**
    * Iterates over all elements of the reduced iterator.  
@@ -1407,7 +1409,7 @@ const p = class p {
    * const reduced = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
    *     .reduce((key, accumulator, value) => accumulator + value);
-   * 
+   *
    * reduced.forEach((key, value, index) =>
    * {
    *     console.log(`#${index} - ${key}: ${value}`); // "#0 - odd: 4", "#1 - even: 16"
@@ -1418,9 +1420,9 @@ const p = class p {
    *
    * @param iteratee The function to apply to each element of the reduced iterator.
    */
-  forEach(t) {
-    for (const [e, [n, s]] of this._elements.enumerate())
-      t(n, s, e);
+  forEach(n) {
+    for (const [e, [t, s]] of this._elements.enumerate())
+      n(t, s, e);
   }
   /**
    * Reaggregates the elements of the reduced iterator.  
@@ -1453,11 +1455,11 @@ const p = class p {
    *
    * @returns A new {@link AggregatedIterator} containing the elements reorganized by the new keys.
    */
-  reorganizeBy(t) {
+  reorganizeBy(n) {
     const e = this._elements.enumerate();
-    return new g(function* () {
-      for (const [n, [s, r]] of e)
-        yield [t(s, r, n), r];
+    return new x(function* () {
+      for (const [t, [s, r]] of e)
+        yield [n(s, r, t), r];
     });
   }
   /**
@@ -1488,9 +1490,9 @@ const p = class p {
    * @returns A new {@link SmartIterator} containing all the keys of the iterator.
    */
   keys() {
-    const t = this._elements;
-    return new c(function* () {
-      for (const [e] of t)
+    const n = this._elements;
+    return new u(function* () {
+      for (const [e] of n)
         yield e;
     });
   }
@@ -1553,10 +1555,10 @@ const p = class p {
    * @returns A new {@link SmartIterator} containing all the values of the iterator.
    */
   values() {
-    const t = this._elements;
-    return new c(function* () {
-      for (const [e, n] of t)
-        yield n;
+    const n = this._elements;
+    return new u(function* () {
+      for (const [e, t] of n)
+        yield t;
     });
   }
   /**
@@ -1632,17 +1634,17 @@ const p = class p {
     return Object.fromEntries(this.entries());
   }
 };
-let h = p;
+let h = _;
 var me;
 me = Symbol.toStringTag;
 const w = class w {
-  constructor(t) {
+  constructor(n) {
     /**
      * The internal {@link SmartAsyncIterator} object that holds the elements to aggregate.
      */
     a(this, "_elements");
     a(this, me, "AggregatedAsyncIterator");
-    this._elements = new f(t);
+    this._elements = new f(n);
   }
   /**
    * Determines whether all elements of each group of the iterator satisfy a given condition.
@@ -1675,15 +1677,15 @@ const w = class w {
    * @returns
    * A {@link Promise} resolving to a new {@link ReducedIterator} containing the boolean results for each group.
    */
-  async every(t) {
+  async every(n) {
     const e = /* @__PURE__ */ new Map();
-    for await (const [n, s] of this._elements) {
-      const [r, o] = e.get(n) ?? [0, !0];
-      o && e.set(n, [r + 1, await t(n, s, r)]);
+    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)]);
     }
     return new h(function* () {
-      for (const [n, [s, r]] of e)
-        yield [n, r];
+      for (const [t, [s, r]] of e)
+        yield [t, r];
     });
   }
   /**
@@ -1717,24 +1719,24 @@ const w = class w {
    * @returns
    * A {@link Promise} resolving to a new {@link ReducedIterator} containing the boolean results for each group.
    */
-  async some(t) {
+  async some(n) {
     const e = /* @__PURE__ */ new Map();
-    for await (const [n, s] of this._elements) {
-      const [r, o] = e.get(n) ?? [0, !1];
-      o || e.set(n, [r + 1, await t(n, s, r)]);
+    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)]);
     }
     return new h(function* () {
-      for (const [n, [s, r]] of e)
-        yield [n, r];
+      for (const [t, [s, r]] of e)
+        yield [t, r];
     });
   }
-  filter(t) {
+  filter(n) {
     const e = this._elements;
     return new w(async function* () {
-      const n = /* @__PURE__ */ new Map();
+      const t = /* @__PURE__ */ new Map();
       for await (const [s, r] of e) {
-        const o = n.get(s) ?? 0;
-        await t(s, r, o) && (yield [s, r]), n.set(s, o + 1);
+        const o = t.get(s) ?? 0;
+        await n(s, r, o) && (yield [s, r]), t.set(s, o + 1);
       }
     });
   }
@@ -1770,32 +1772,32 @@ const w = class w {
    *
    * @returns A new {@link AggregatedAsyncIterator} containing the transformed elements.
    */
-  map(t) {
+  map(n) {
     const e = this._elements;
     return new w(async function* () {
-      const n = /* @__PURE__ */ new Map();
+      const t = /* @__PURE__ */ new Map();
       for await (const [s, r] of e) {
-        const o = n.get(s) ?? 0;
-        yield [s, await t(s, r, o)], n.set(s, o + 1);
+        const o = t.get(s) ?? 0;
+        yield [s, await n(s, r, o)], t.set(s, o + 1);
       }
     });
   }
-  async reduce(t, e) {
-    const n = /* @__PURE__ */ new Map();
+  async reduce(n, e) {
+    const t = /* @__PURE__ */ new Map();
     for await (const [s, r] of this._elements) {
       let o, l;
-      if (n.has(s))
-        [o, l] = n.get(s);
+      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;
       else {
-        n.set(s, [0, r]);
+        t.set(s, [0, r]);
         continue;
       }
-      n.set(s, [o + 1, await t(s, l, r, o)]);
+      t.set(s, [o + 1, await n(s, l, r, o)]);
     }
     return new h(function* () {
-      for (const [s, [r, o]] of n)
+      for (const [s, [r, o]] of t)
         yield [s, o];
     });
   }
@@ -1835,18 +1837,18 @@ const w = class w {
    *
    * @returns A new {@link AggregatedAsyncIterator} containing the transformed elements.
    */
-  flatMap(t) {
+  flatMap(n) {
     const e = this._elements;
     return new w(async function* () {
-      const n = /* @__PURE__ */ new Map();
+      const t = /* @__PURE__ */ new Map();
       for await (const [s, r] of e) {
-        const o = n.get(s) ?? 0, l = await t(s, r, o);
+        const o = t.get(s) ?? 0, l = await n(s, r, o);
         if (l instanceof Array)
-          for (const v of l)
-            yield [s, v];
+          for (const k of l)
+            yield [s, k];
         else
           yield [s, l];
-        n.set(s, o + 1);
+        t.set(s, o + 1);
       }
     });
   }
@@ -1879,14 +1881,14 @@ const w = class w {
    *
    * @returns A new {@link AggregatedAsyncIterator} containing the remaining elements.
    */
-  drop(t) {
+  drop(n) {
     const e = this._elements;
     return new w(async function* () {
-      const n = /* @__PURE__ */ new Map();
+      const t = /* @__PURE__ */ new Map();
       for await (const [s, r] of e) {
-        const o = n.get(s) ?? 0;
-        if (o < t) {
-          n.set(s, o + 1);
+        const o = t.get(s) ?? 0;
+        if (o < n) {
+          t.set(s, o + 1);
           continue;
         }
         yield [s, r];
@@ -1922,25 +1924,25 @@ const w = class w {
    *
    * @returns A new {@link AggregatedAsyncIterator} containing the taken elements.
    */
-  take(t) {
+  take(n) {
     const e = this._elements;
     return new w(async function* () {
-      const n = /* @__PURE__ */ new Map();
+      const t = /* @__PURE__ */ new Map();
       for await (const [s, r] of e) {
-        const o = n.get(s) ?? 0;
-        o >= t || (yield [s, r], n.set(s, o + 1));
+        const o = t.get(s) ?? 0;
+        o >= n || (yield [s, r], t.set(s, o + 1));
       }
     });
   }
-  async find(t) {
+  async find(n) {
     const e = /* @__PURE__ */ new Map();
-    for await (const [n, s] of this._elements) {
-      let [r, o] = e.get(n) ?? [0, void 0];
-      o === void 0 && (await t(n, s, r) && (o = s), e.set(n, [r + 1, o]));
+    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]));
     }
     return new h(function* () {
-      for (const [n, [s, r]] of e)
-        yield [n, r];
+      for (const [t, [s, r]] of e)
+        yield [t, r];
     });
   }
   /**
@@ -1970,7 +1972,7 @@ const w = class w {
    * @returns A new {@link AggregatedAsyncIterator} containing the enumerated elements.
    */
   enumerate() {
-    return this.map((t, e, n) => [n, e]);
+    return this.map((n, e, t) => [t, e]);
   }
   /**
    * Removes all duplicate elements from within each group of the iterator.  
@@ -1999,12 +2001,12 @@ const w = class w {
    * @returns A new {@link AggregatedAsyncIterator} containing only the unique elements.
    */
   unique() {
-    const t = this._elements;
+    const n = this._elements;
     return new w(async function* () {
       const e = /* @__PURE__ */ new Map();
-      for await (const [n, s] of t) {
-        const r = e.get(n) ?? /* @__PURE__ */ new Set();
-        r.has(s) || (r.add(s), e.set(n, r), yield [n, s]);
+      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]);
       }
     });
   }
@@ -2031,14 +2033,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 t = /* @__PURE__ */ new Map();
+    const n = /* @__PURE__ */ new Map();
     for await (const [e] of this._elements) {
-      const n = t.get(e) ?? 0;
-      t.set(e, n + 1);
+      const t = n.get(e) ?? 0;
+      n.set(e, t + 1);
     }
     return new h(function* () {
-      for (const [e, n] of t)
-        yield [e, n];
+      for (const [e, t] of n)
+        yield [e, t];
     });
   }
   /**
@@ -2067,11 +2069,11 @@ const w = class w {
    *
    * @returns A {@link Promise} that will resolve once the iteration is complete.
    */
-  async forEach(t) {
+  async forEach(n) {
     const e = /* @__PURE__ */ new Map();
-    for await (const [n, s] of this._elements) {
-      const r = e.get(n) ?? 0;
-      await t(n, s, r), e.set(n, r + 1);
+    for await (const [t, s] of this._elements) {
+      const r = e.get(t) ?? 0;
+      await n(t, s, r), e.set(t, r + 1);
     }
   }
   /**
@@ -2105,13 +2107,13 @@ const w = class w {
    *
    * @returns A new {@link AggregatedAsyncIterator} containing the elements reorganized by the new keys.
    */
-  reorganizeBy(t) {
+  reorganizeBy(n) {
     const e = this._elements;
     return new w(async function* () {
-      const n = /* @__PURE__ */ new Map();
+      const t = /* @__PURE__ */ new Map();
       for await (const [s, r] of e) {
-        const o = n.get(s) ?? 0;
-        yield [await t(s, r, o), r], n.set(s, o + 1);
+        const o = t.get(s) ?? 0;
+        yield [await n(s, r, o), r], t.set(s, o + 1);
       }
     });
   }
@@ -2142,11 +2144,11 @@ const w = class w {
    * @returns A new {@link SmartAsyncIterator} containing all the keys of the iterator.
    */
   keys() {
-    const t = this._elements;
+    const n = this._elements;
     return new f(async function* () {
       const e = /* @__PURE__ */ new Set();
-      for await (const [n] of t)
-        e.has(n) || (e.add(n), yield n);
+      for await (const [t] of n)
+        e.has(t) || (e.add(t), yield t);
     });
   }
   /**
@@ -2206,10 +2208,10 @@ const w = class w {
    * @returns A new {@link SmartAsyncIterator} containing all the values of the iterator.
    */
   values() {
-    const t = this._elements;
+    const n = this._elements;
     return new f(async function* () {
-      for await (const [e, n] of t)
-        yield n;
+      for await (const [e, t] of n)
+        yield t;
     });
   }
   /**
@@ -2233,8 +2235,8 @@ const w = class w {
    * @returns A {@link Promise} resolving to an {@link Array} containing all the values of the iterator.
    */
   async toArray() {
-    const t = await this.toMap();
-    return Array.from(t.values());
+    const n = await this.toMap();
+    return Array.from(n.values());
   }
   /**
    * Materializes the iterator into a map.  
@@ -2257,12 +2259,12 @@ const w = class w {
    * @returns A {@link Promise} resolving to a {@link Map} containing all the entries of the iterator.
    */
   async toMap() {
-    const t = /* @__PURE__ */ new Map();
-    for await (const [e, n] of this._elements) {
-      const s = t.get(e) ?? [];
-      s.push(n), t.set(e, s);
+    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);
     }
-    return t;
+    return n;
   }
   /**
    * Materializes the iterator into an object.  
@@ -2285,54 +2287,54 @@ const w = class w {
    * @returns A {@link Promise} resolving to an object containing all the entries of the iterator.
    */
   async toObject() {
-    const t = {};
-    for await (const [e, n] of this._elements) {
-      const s = t[e] ?? [];
-      s.push(n), t[e] = s;
+    const n = {};
+    for await (const [e, t] of this._elements) {
+      const s = n[e] ?? [];
+      s.push(t), n[e] = s;
     }
-    return t;
+    return n;
   }
 };
-let T = w;
-var ye;
+let E = w;
+var pe;
 class f {
-  constructor(t) {
+  constructor(n) {
     /**
      * The native {@link AsyncIterator} object that is being wrapped by this instance.
      */
     a(this, "_iterator");
-    a(this, ye, "SmartAsyncIterator");
-    if (t instanceof Function) {
-      const e = t();
+    a(this, pe, "SmartAsyncIterator");
+    if (n instanceof Function) {
+      const e = n();
       Symbol.asyncIterator in e ? this._iterator = e : this._iterator = async function* () {
-        let n = [];
+        let t = [];
         for (; ; ) {
-          const s = e.next(...n);
+          const s = e.next(...t);
           if (s.done)
             return s.value;
-          n = [yield s.value];
+          t = [yield s.value];
         }
       }();
-    } else if (Symbol.asyncIterator in t)
-      this._iterator = t[Symbol.asyncIterator]();
-    else if (Symbol.iterator in t) {
-      const e = t[Symbol.iterator]();
+    } 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* () {
         for (; ; ) {
-          const n = e.next();
-          if (n.done)
-            return n.value;
-          yield n.value;
+          const t = e.next();
+          if (t.done)
+            return t.value;
+          yield t.value;
         }
       }();
     } else
       this._iterator = async function* () {
         let e = [];
         for (; ; ) {
-          const n = await t.next(...e);
-          if (n.done)
-            return n.value;
-          e = [yield n.value];
+          const t = await n.next(...e);
+          if (t.done)
+            return t.value;
+          e = [yield t.value];
         }
       }();
   }
@@ -2366,13 +2368,13 @@ class f {
    * @returns
    * A {@link Promise} that will resolve to `true` if all elements satisfy the condition, `false` otherwise.
    */
-  async every(t) {
+  async every(n) {
     let e = 0;
     for (; ; ) {
-      const n = await this._iterator.next();
-      if (n.done)
+      const t = await this._iterator.next();
+      if (t.done)
         return !0;
-      if (!await t(n.value, e))
+      if (!await n(t.value, e))
         return !1;
       e += 1;
     }
@@ -2407,26 +2409,26 @@ class f {
    * @returns
    * A {@link Promise} that will resolve to `true` if any element satisfies the condition, `false` otherwise.
    */
-  async some(t) {
+  async some(n) {
     let e = 0;
     for (; ; ) {
-      const n = await this._iterator.next();
-      if (n.done)
+      const t = await this._iterator.next();
+      if (t.done)
         return !1;
-      if (await t(n.value, e))
+      if (await n(t.value, e))
         return !0;
       e += 1;
     }
   }
-  filter(t) {
+  filter(n) {
     const e = this._iterator;
     return new f(async function* () {
-      let n = 0;
+      let t = 0;
       for (; ; ) {
         const s = await e.next();
         if (s.done)
           return s.value;
-        await t(s.value, n) && (yield s.value), n += 1;
+        await n(s.value, t) && (yield s.value), t += 1;
       }
     });
   }
@@ -2461,31 +2463,31 @@ class f {
    *
    * @returns A new {@link SmartAsyncIterator} containing the transformed elements.
    */
-  map(t) {
+  map(n) {
     const e = this._iterator;
     return new f(async function* () {
-      let n = 0;
+      let t = 0;
       for (; ; ) {
         const s = await e.next();
         if (s.done)
           return s.value;
-        yield await t(s.value, n), n += 1;
+        yield await n(s.value, t), t += 1;
       }
     });
   }
-  async reduce(t, e) {
-    let n = 0, s = e;
+  async reduce(n, e) {
+    let t = 0, s = e;
     if (s === void 0) {
       const r = await this._iterator.next();
       if (r.done)
         throw new d("Cannot reduce an empty iterator without an initial value.");
-      s = r.value, n += 1;
+      s = r.value, t += 1;
     }
     for (; ; ) {
       const r = await this._iterator.next();
       if (r.done)
         return s;
-      s = await t(s, r.value, n), n += 1;
+      s = await n(s, r.value, t), t += 1;
     }
   }
   /**
@@ -2519,21 +2521,21 @@ class f {
    *
    * @returns A new {@link SmartAsyncIterator} containing the flattened elements.
    */
-  flatMap(t) {
+  flatMap(n) {
     const e = this._iterator;
     return new f(async function* () {
-      let n = 0;
+      let t = 0;
       for (; ; ) {
         const s = await e.next();
         if (s.done)
           return s.value;
-        const r = await t(s.value, n);
+        const r = await n(s.value, t);
         if (r instanceof Array)
           for (const o of r)
             yield o;
         else
           yield r;
-        n += 1;
+        t += 1;
       }
     });
   }
@@ -2568,14 +2570,14 @@ class f {
    *
    * @returns A new {@link SmartAsyncIterator} containing the remaining elements.
    */
-  drop(t) {
+  drop(n) {
     const e = this._iterator;
     return new f(async function* () {
-      let n = 0;
-      for (; n < t; ) {
+      let t = 0;
+      for (; t < n; ) {
         if ((await e.next()).done)
           return;
-        n += 1;
+        t += 1;
       }
       for (; ; ) {
         const s = await e.next();
@@ -2617,26 +2619,26 @@ class f {
    *
    * @returns A new {@link SmartAsyncIterator} containing the taken elements.
    */
-  take(t) {
+  take(n) {
     const e = this._iterator;
     return new f(async function* () {
-      let n = 0;
-      for (; n < t; ) {
+      let t = 0;
+      for (; t < n; ) {
         const s = await e.next();
         if (s.done)
           return s.value;
-        yield s.value, n += 1;
+        yield s.value, t += 1;
       }
     });
   }
-  async find(t) {
+  async find(n) {
     let e = 0;
     for (; ; ) {
-      const n = await this._iterator.next();
-      if (n.done)
+      const t = await this._iterator.next();
+      if (t.done)
         return;
-      if (await t(n.value, e))
-        return n.value;
+      if (await n(t.value, e))
+        return t.value;
       e += 1;
     }
   }
@@ -2669,7 +2671,7 @@ class f {
    * @returns A new {@link SmartAsyncIterator} containing the enumerated elements.
    */
   enumerate() {
-    return this.map((t, e) => [e, t]);
+    return this.map((n, e) => [e, n]);
   }
   /**
    * Removes all duplicate elements from the iterator.  
@@ -2697,14 +2699,14 @@ class f {
    * @returns A new {@link SmartAsyncIterator} containing only the unique elements.
    */
   unique() {
-    const t = this._iterator;
+    const n = this._iterator;
     return new f(async function* () {
       const e = /* @__PURE__ */ new Set();
       for (; ; ) {
-        const n = await t.next();
-        if (n.done)
-          return n.value;
-        e.has(n.value) || (e.add(n.value), yield n.value);
+        const t = await n.next();
+        if (t.done)
+          return t.value;
+        e.has(t.value) || (e.add(t.value), yield t.value);
       }
     });
   }
@@ -2729,11 +2731,11 @@ class f {
    * @returns A {@link Promise} that will resolve to the number of elements in the iterator.
    */
   async count() {
-    let t = 0;
+    let n = 0;
     for (; ; ) {
       if ((await this._iterator.next()).done)
-        return t;
-      t += 1;
+        return n;
+      n += 1;
     }
   }
   /**
@@ -2760,13 +2762,13 @@ class f {
    *
    * @returns A {@link Promise} that will resolve once the iteration is complete.
    */
-  async forEach(t) {
+  async forEach(n) {
     let e = 0;
     for (; ; ) {
-      const n = await this._iterator.next();
-      if (n.done)
+      const t = await this._iterator.next();
+      if (t.done)
         return;
-      await t(n.value, e), e += 1;
+      await n(t.value, e), e += 1;
     }
   }
   /**
@@ -2799,8 +2801,8 @@ class f {
    * @returns
    * A {@link Promise} that will resolve to the result of the iteration, containing the value of the operation.
    */
-  next(...t) {
-    return this._iterator.next(...t);
+  next(...n) {
+    return this._iterator.next(...n);
   }
   /**
    * An utility method that may be used to close the iterator gracefully,
@@ -2834,8 +2836,8 @@ class f {
    *
    * @returns A {@link Promise} that will resolve to the final result of the iterator.
    */
-  async return(t) {
-    const e = await t;
+  async return(n) {
+    const e = await n;
     return this._iterator.return ? await this._iterator.return(e) : { done: !0, value: e };
   }
   /**
@@ -2879,10 +2881,10 @@ class f {
    *
    * @returns A {@link Promise} that will resolve to the final result of the iterator.
    */
-  throw(t) {
+  throw(n) {
     if (this._iterator.throw)
-      return this._iterator.throw(t);
-    throw t;
+      return this._iterator.throw(n);
+    throw n;
   }
   /**
    * An utility method that aggregates the elements of the iterator using a given key function.  
@@ -2914,8 +2916,8 @@ class f {
    *
    * @returns A new instance of the {@link AggregatedAsyncIterator} class containing the grouped elements.
    */
-  groupBy(t) {
-    return new T(this.map(async (e, n) => [await t(e, n), e]));
+  groupBy(n) {
+    return new E(this.map(async (e, t) => [await n(e, t), e]));
   }
   /**
    * Materializes the iterator into an array.  
@@ -2943,20 +2945,20 @@ class f {
   toArray() {
     return Array.fromAsync(this);
   }
-  [(ye = Symbol.toStringTag, Symbol.asyncIterator)]() {
+  [(pe = Symbol.toStringTag, Symbol.asyncIterator)]() {
     return this;
   }
 }
-var _e;
-_e = Symbol.toStringTag;
+var ye;
+ye = Symbol.toStringTag;
 const m = class m {
-  constructor(t) {
+  constructor(n) {
     /**
      * The internal {@link SmartIterator} object that holds the elements to aggregate.
      */
     a(this, "_elements");
-    a(this, _e, "AggregatedIterator");
-    this._elements = new c(t);
+    a(this, ye, "AggregatedIterator");
+    this._elements = new u(n);
   }
   /**
    * Determines whether all elements of each group of the iterator satisfy a given condition.
@@ -2988,15 +2990,15 @@ const m = class m {
    *
    * @returns A new {@link ReducedIterator} containing the boolean results for each group.
    */
-  every(t) {
+  every(n) {
     const e = /* @__PURE__ */ new Map();
-    for (const [n, s] of this._elements) {
-      const [r, o] = e.get(n) ?? [0, !0];
-      o && e.set(n, [r + 1, t(n, s, r)]);
+    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)]);
     }
     return new h(function* () {
-      for (const [n, [s, r]] of e)
-        yield [n, r];
+      for (const [t, [s, r]] of e)
+        yield [t, r];
     });
   }
   /**
@@ -3029,24 +3031,24 @@ const m = class m {
    *
    * @returns A {@link ReducedIterator} containing the boolean results for each group.
    */
-  some(t) {
+  some(n) {
     const e = /* @__PURE__ */ new Map();
-    for (const [n, s] of this._elements) {
-      const [r, o] = e.get(n) ?? [0, !1];
-      o || e.set(n, [r + 1, t(n, s, r)]);
+    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)]);
     }
     return new h(function* () {
-      for (const [n, [s, r]] of e)
-        yield [n, r];
+      for (const [t, [s, r]] of e)
+        yield [t, r];
     });
   }
-  filter(t) {
+  filter(n) {
     const e = this._elements;
     return new m(function* () {
-      const n = /* @__PURE__ */ new Map();
+      const t = /* @__PURE__ */ new Map();
       for (const [s, r] of e) {
-        const o = n.get(s) ?? 0;
-        t(s, r, o) && (yield [s, r]), n.set(s, o + 1);
+        const o = t.get(s) ?? 0;
+        n(s, r, o) && (yield [s, r]), t.set(s, o + 1);
       }
     });
   }
@@ -3082,32 +3084,32 @@ const m = class m {
    *
    * @returns A new {@link AggregatedIterator} containing the transformed elements.
    */
-  map(t) {
+  map(n) {
     const e = this._elements;
     return new m(function* () {
-      const n = /* @__PURE__ */ new Map();
+      const t = /* @__PURE__ */ new Map();
       for (const [s, r] of e) {
-        const o = n.get(s) ?? 0;
-        yield [s, t(s, r, o)], n.set(s, o + 1);
+        const o = t.get(s) ?? 0;
+        yield [s, n(s, r, o)], t.set(s, o + 1);
       }
     });
   }
-  reduce(t, e) {
-    const n = /* @__PURE__ */ new Map();
+  reduce(n, e) {
+    const t = /* @__PURE__ */ new Map();
     for (const [s, r] of this._elements) {
       let o, l;
-      if (n.has(s))
-        [o, l] = n.get(s);
+      if (t.has(s))
+        [o, l] = t.get(s);
       else if (e !== void 0)
         o = 0, e instanceof Function ? l = e(s) : l = e;
       else {
-        n.set(s, [0, r]);
+        t.set(s, [0, r]);
         continue;
       }
-      n.set(s, [o + 1, t(s, l, r, o)]);
+      t.set(s, [o + 1, n(s, l, r, o)]);
     }
     return new h(function* () {
-      for (const [s, [r, o]] of n)
+      for (const [s, [r, o]] of t)
         yield [s, o];
     });
   }
@@ -3147,18 +3149,18 @@ const m = class m {
    *
    * @returns A new {@link AggregatedIterator} containing the transformed elements.
    */
-  flatMap(t) {
+  flatMap(n) {
     const e = this._elements;
     return new m(function* () {
-      const n = /* @__PURE__ */ new Map();
+      const t = /* @__PURE__ */ new Map();
       for (const [s, r] of e) {
-        const o = n.get(s) ?? 0, l = t(s, r, o);
+        const o = t.get(s) ?? 0, l = n(s, r, o);
         if (l instanceof Array)
-          for (const v of l)
-            yield [s, v];
+          for (const k of l)
+            yield [s, k];
         else
           yield [s, l];
-        n.set(s, o + 1);
+        t.set(s, o + 1);
       }
     });
   }
@@ -3191,14 +3193,14 @@ const m = class m {
    *
    * @returns A new {@link AggregatedIterator} containing the remaining elements.
    */
-  drop(t) {
+  drop(n) {
     const e = this._elements;
     return new m(function* () {
-      const n = /* @__PURE__ */ new Map();
+      const t = /* @__PURE__ */ new Map();
       for (const [s, r] of e) {
-        const o = n.get(s) ?? 0;
-        if (o < t) {
-          n.set(s, o + 1);
+        const o = t.get(s) ?? 0;
+        if (o < n) {
+          t.set(s, o + 1);
           continue;
         }
         yield [s, r];
@@ -3234,25 +3236,25 @@ const m = class m {
    *
    * @returns A new {@link AggregatedIterator} containing the taken elements.
    */
-  take(t) {
+  take(n) {
     const e = this._elements;
     return new m(function* () {
-      const n = /* @__PURE__ */ new Map();
+      const t = /* @__PURE__ */ new Map();
       for (const [s, r] of e) {
-        const o = n.get(s) ?? 0;
-        o >= t || (yield [s, r], n.set(s, o + 1));
+        const o = t.get(s) ?? 0;
+        o >= n || (yield [s, r], t.set(s, o + 1));
       }
     });
   }
-  find(t) {
+  find(n) {
     const e = /* @__PURE__ */ new Map();
-    for (const [n, s] of this._elements) {
-      let [r, o] = e.get(n) ?? [0, void 0];
-      o === void 0 && (t(n, s, r) && (o = s), e.set(n, [r + 1, o]));
+    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]));
     }
     return new h(function* () {
-      for (const [n, [s, r]] of e)
-        yield [n, r];
+      for (const [t, [s, r]] of e)
+        yield [t, r];
     });
   }
   /**
@@ -3282,7 +3284,7 @@ const m = class m {
    * @returns A new {@link AggregatedIterator} containing the enumerated elements.
    */
   enumerate() {
-    return this.map((t, e, n) => [n, e]);
+    return this.map((n, e, t) => [t, e]);
   }
   /**
    * Removes all duplicate elements from within each group of the iterator.  
@@ -3311,12 +3313,12 @@ const m = class m {
    * @returns A new {@link AggregatedIterator} containing only the unique elements.
    */
   unique() {
-    const t = this._elements;
+    const n = this._elements;
     return new m(function* () {
       const e = /* @__PURE__ */ new Map();
-      for (const [n, s] of t) {
-        const r = e.get(n) ?? /* @__PURE__ */ new Set();
-        r.has(s) || (r.add(s), e.set(n, r), yield [n, s]);
+      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]);
       }
     });
   }
@@ -3342,14 +3344,14 @@ const m = class m {
    * @returns A new {@link ReducedIterator} containing the number of elements for each group.
    */
   count() {
-    const t = /* @__PURE__ */ new Map();
+    const n = /* @__PURE__ */ new Map();
     for (const [e] of this._elements) {
-      const n = t.get(e) ?? 0;
-      t.set(e, n + 1);
+      const t = n.get(e) ?? 0;
+      n.set(e, t + 1);
     }
     return new h(function* () {
-      for (const [e, n] of t)
-        yield [e, n];
+      for (const [e, t] of n)
+        yield [e, t];
     });
   }
   /**
@@ -3376,11 +3378,11 @@ const m = class m {
    *
    * @param iteratee The function to execute for each element of the iterator.
    */
-  forEach(t) {
+  forEach(n) {
     const e = /* @__PURE__ */ new Map();
-    for (const [n, s] of this._elements) {
-      const r = e.get(n) ?? 0;
-      t(n, s, r), e.set(n, r + 1);
+    for (const [t, s] of this._elements) {
+      const r = e.get(t) ?? 0;
+      n(t, s, r), e.set(t, r + 1);
     }
   }
   /**
@@ -3414,13 +3416,13 @@ const m = class m {
    *
    * @returns A new {@link AggregatedIterator} containing the elements reorganized by the new keys.
    */
-  reorganizeBy(t) {
+  reorganizeBy(n) {
     const e = this._elements;
     return new m(function* () {
-      const n = /* @__PURE__ */ new Map();
+      const t = /* @__PURE__ */ new Map();
       for (const [s, r] of e) {
-        const o = n.get(s) ?? 0;
-        yield [t(s, r, o), r], n.set(s, o + 1);
+        const o = t.get(s) ?? 0;
+        yield [n(s, r, o), r], t.set(s, o + 1);
       }
     });
   }
@@ -3451,11 +3453,11 @@ const m = class m {
    * @returns A new {@link SmartIterator} containing all the keys of the iterator.
    */
   keys() {
-    const t = this._elements;
-    return new c(function* () {
+    const n = this._elements;
+    return new u(function* () {
       const e = /* @__PURE__ */ new Set();
-      for (const [n] of t)
-        e.has(n) || (e.add(n), yield n);
+      for (const [t] of n)
+        e.has(t) || (e.add(t), yield t);
     });
   }
   /**
@@ -3515,10 +3517,10 @@ const m = class m {
    * @returns A new {@link SmartIterator} containing all the values of the iterator.
    */
   values() {
-    const t = this._elements;
-    return new c(function* () {
-      for (const [e, n] of t)
-        yield n;
+    const n = this._elements;
+    return new u(function* () {
+      for (const [e, t] of n)
+        yield t;
     });
   }
   /**
@@ -3542,8 +3544,8 @@ const m = class m {
    * @returns An {@link Array} of arrays containing the elements of the iterator.
    */
   toArray() {
-    const t = this.toMap();
-    return Array.from(t.values());
+    const n = this.toMap();
+    return Array.from(n.values());
   }
   /**
    * Materializes the iterator into a map.  
@@ -3566,12 +3568,12 @@ const m = class m {
    * @returns A {@link Map} containing the elements of the iterator.
    */
   toMap() {
-    const t = /* @__PURE__ */ new Map();
-    for (const [e, n] of this._elements) {
-      const s = t.get(e) ?? [];
-      s.push(n), t.set(e, s);
+    const n = /* @__PURE__ */ new Map();
+    for (const [e, t] of this._elements) {
+      const s = n.get(e) ?? [];
+      s.push(t), n.set(e, s);
     }
-    return t;
+    return n;
   }
   /**
    * Materializes the iterator into an object.  
@@ -3594,31 +3596,31 @@ const m = class m {
    * @returns An {@link Object} containing the elements of the iterator.
    */
   toObject() {
-    const t = {};
-    for (const [e, n] of this._elements) {
-      const s = t[e] ?? [];
-      s.push(n), t[e] = s;
+    const n = {};
+    for (const [e, t] of this._elements) {
+      const s = n[e] ?? [];
+      s.push(t), n[e] = s;
     }
-    return t;
+    return n;
   }
 };
-let g = m;
-const Le = Function;
-var pe, be;
-class Ge extends (be = Le, pe = Symbol.toStringTag, be) {
+let x = m;
+const He = Function;
+var _e, be;
+class Qe extends (be = He, _e = Symbol.toStringTag, be) {
   /**
    * Initializes a new instance of the {@link CallableObject} class.
    */
   constructor() {
     super("return this._invoke(...arguments);");
-    a(this, pe, "CallableObject");
+    a(this, _e, "CallableObject");
     const e = this.bind(this);
     return Object.setPrototypeOf(this, e), e;
   }
 }
-var xe;
-xe = Symbol.toStringTag;
-class E {
+var ge;
+ge = Symbol.toStringTag;
+class v {
   /**
    * Initializes a new instance of the {@link Publisher} class.
    *
@@ -3637,7 +3639,7 @@ class E {
      * The values are the arrays of the subscribers themselves.
      */
     a(this, "_subscribers");
-    a(this, xe, "Publisher");
+    a(this, ge, "Publisher");
     this._subscribers = /* @__PURE__ */ new Map();
   }
   /**
@@ -3686,12 +3688,12 @@ class E {
    *
    * @returns An array containing the return values of all the subscribers.
    */
-  publish(t, ...e) {
-    const n = this._subscribers.get(t);
-    return n ? n.slice().map((s) => s(...e)) : [];
+  publish(n, ...e) {
+    const t = this._subscribers.get(n);
+    return t ? t.slice().map((s) => s(...e)) : [];
   }
   /**
-   * Subscribes a new subscriber to an event.
+   * Subscribes to an event and adds a subscriber to be executed when the event is published.
    *
    * ---
    *
@@ -3710,22 +3712,22 @@ class E {
    * @template K The key of the map containing the callback signature to subscribe.
    *
    * @param event The name of the event to subscribe to.
-   * @param subscriber The subscriber to add to the event.
+   * @param subscriber The subscriber to execute when the event is published.
    *
-   * @returns A function that can be used to unsubscribe the subscriber.
+   * @returns A function that can be used to unsubscribe the subscriber from the event.
    */
-  subscribe(t, e) {
-    this._subscribers.has(t) || this._subscribers.set(t, []);
-    const n = this._subscribers.get(t);
-    return n.push(e), () => {
-      const s = n.indexOf(e);
+  subscribe(n, e) {
+    this._subscribers.has(n) || this._subscribers.set(n, []);
+    const t = this._subscribers.get(n);
+    return t.push(e), () => {
+      const s = t.indexOf(e);
       if (s < 0)
         throw new C("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed.");
-      n.splice(s, 1);
+      t.splice(s, 1);
     };
   }
   /**
-   * Unsubscribes a subscriber from an event.
+   * Unsubscribes from an event and removes a subscriber from being executed when the event is published.
    *
    * ---
    *
@@ -3744,21 +3746,21 @@ class E {
    * @param event The name of the event to unsubscribe from.
    * @param subscriber The subscriber to remove from the event.
    */
-  unsubscribe(t, e) {
-    const n = this._subscribers.get(t);
-    if (!n)
+  unsubscribe(n, e) {
+    const t = this._subscribers.get(n);
+    if (!t)
       return;
-    const s = n.indexOf(e);
+    const s = t.indexOf(e);
     if (s < 0)
       throw new C("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed or was never subscribed.");
-    n.splice(s, 1);
+    t.splice(s, 1);
   }
 }
-const Ke = () => {
+const Xe = () => {
 };
-var ge, ve;
-class it extends (ve = Ge, ge = Symbol.toStringTag, ve) {
-  constructor(e, n = "default") {
+var xe, ve;
+class ut extends (ve = Qe, xe = Symbol.toStringTag, ve) {
+  constructor(e, t = "default") {
     super();
     /**
      * The currently selected implementation of the callback.
@@ -3790,12 +3792,12 @@ class it extends (ve = Ge, ge = Symbol.toStringTag, ve) {
      * The function that will be called by the extended class when the object is invoked as a function.
      */
     a(this, "_invoke");
-    a(this, ge, "SwitchableCallback");
-    this._callbacks = /* @__PURE__ */ new Map(), this._isEnabled = !0, e ? this._callbacks.set(n, e) : (n = "", e = () => {
-      throw new Be(
+    a(this, xe, "SwitchableCallback");
+    this._callbacks = /* @__PURE__ */ new Map(), this._isEnabled = !0, e ? this._callbacks.set(t, e) : (t = "", e = () => {
+      throw new Ve(
         "The `SwitchableCallback` has no callback defined yet. Did you forget to call the `register` method?"
       );
-    }), this._key = n, this._callback = e, this._invoke = (...s) => this._callback(...s);
+    }), this._key = t, this._callback = e, this._invoke = (...s) => this._callback(...s);
   }
   /**
    * A flag indicating whether the callback is enabled or not.
@@ -3828,23 +3830,25 @@ class it extends (ve = Ge, ge = Symbol.toStringTag, ve) {
    * window.addEventListener("pointerdown", () => { onPointerMove.enable(); });
    * window.addEventListener("pointermove", onPointerMove);
    * ```
-   * 
+   *
+   * ---
+   *
    * @param key
    * The key that is associated with the implementation to enable. Default is the currently selected implementation.
    */
   enable(e) {
     if (e === void 0) {
       if (!this._key)
-        throw new _(
+        throw new y(
           "The `SwitchableCallback` has no callback defined yet. Did you forget to call the `register` method?"
         );
       e = this._key;
     } else if (e) {
       if (!this._callbacks.has(e))
-        throw new _(`The key '${e}' doesn't yet have any associated callback.`);
-    } else throw new _("The key must be a non-empty string.");
+        throw new y(`The key '${e}' doesn't yet have any associated callback.`);
+    } else throw new y("The key must be a non-empty string.");
     if (this._isEnabled)
-      throw new y("The `SwitchableCallback` is already enabled.");
+      throw new p("The `SwitchableCallback` is already enabled.");
     this._callback = this._callbacks.get(e), this._isEnabled = !0;
   }
   /**
@@ -3862,8 +3866,8 @@ class it extends (ve = Ge, ge = Symbol.toStringTag, ve) {
    */
   disable() {
     if (!this._isEnabled)
-      throw new y("The `SwitchableCallback` is already disabled.");
-    this._callback = Ke, this._isEnabled = !1;
+      throw new p("The `SwitchableCallback` is already disabled.");
+    this._callback = Xe, this._isEnabled = !1;
   }
   /**
    * Registers a new implementation for the callback.
@@ -3885,12 +3889,12 @@ class it extends (ve = Ge, ge = Symbol.toStringTag, ve) {
    * @param key The key that will be associated with the implementation.
    * @param callback The implementation to register.
    */
-  register(e, n) {
+  register(e, t) {
     if (this._callbacks.size === 0)
-      this._key = e, this._callback = n;
+      this._key = e, this._callback = t;
     else if (this._callbacks.has(e))
-      throw new _(`The key '${e}' has already been used for another callback.`);
-    this._callbacks.set(e, n);
+      throw new y(`The key '${e}' has already been used for another callback.`);
+    this._callbacks.set(e, t);
   }
   /**
    * Unregisters an implementation for the callback.
@@ -3912,9 +3916,9 @@ class it extends (ve = Ge, ge = Symbol.toStringTag, ve) {
    */
   unregister(e) {
     if (this._key === e)
-      throw new _("Unable to unregister the currently selected callback.");
+      throw new y("Unable to unregister the currently selected callback.");
     if (!this._callbacks.has(e))
-      throw new _(`The key '${e}' doesn't yet have any associated callback.`);
+      throw new y(`The key '${e}' doesn't yet have any associated callback.`);
     this._callbacks.delete(e);
   }
   /**
@@ -3937,13 +3941,320 @@ class it extends (ve = Ge, ge = Symbol.toStringTag, ve) {
    */
   switch(e) {
     if (!this._callbacks.has(e))
-      throw new _(`The key '${e}' doesn't yet have any associated callback.`);
-    this._key = e, this._isEnabled && (this._callback = this._callbacks.get(e));
+      throw new y(`The key '${e}' doesn't yet have any associated callback.`);
+    this._key !== e && (this._key = e, this._isEnabled && (this._callback = this._callbacks.get(e)));
   }
 }
-var ke;
-ke = Symbol.toStringTag;
-class ot {
+var ke, Se;
+class ct extends (Se = Map, ke = Symbol.toStringTag, Se) {
+  /**
+   * Initializes a new instance of the {@link MapView} class.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const map = new MapView<string, number>([["key1", 2], ["key2", 4], ["key3", 8]]);
+   * ```
+   *
+   * ---
+   *
+   * @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);
+  }
+  /**
+   * Adds a new entry with a specified key and value to the {@link Map}.  
+   * If an entry with the same key already exists, the entry will be overwritten with the new value.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const map = new MapView<string, number>();
+   * map.set("key1", 2)
+   *     .set("key2", 4)
+   *     .set("key3", 8);
+   *
+   * console.log(map); // MapView { "key1" => 2, "key2" => 4, "key3" => 8 }
+   * ```
+   *
+   * ---
+   *
+   * @param key The key of the entry to add.
+   * @param value The value of the entry to add.
+   *
+   * @returns The current instance of the {@link MapView} class.
+   */
+  set(e, t) {
+    return super.set(e, t), this._publisher.publish("entry:add", e, t), this;
+  }
+  /**
+   * Removes an entry with a specified key from the {@link Map}.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const map = new MapView<string, number>([["key1", 2], ["key2", 4], ["key3", 8]]);
+   * map.delete("key2"); // true
+   * map.delete("key4"); // false
+   *
+   * console.log(map); // MapView { "key1" => 2, "key3" => 8 }
+   * ```
+   *
+   * ---
+   *
+   * @param key The key of the entry to remove.
+   *
+   * @returns `true` if the entry existed and has been removed; otherwise `false` if the entry doesn't exist.
+   */
+  delete(e) {
+    const t = super.delete(e);
+    return t && this._publisher.publish("entry:remove", e), t;
+  }
+  /**
+   * Removes all entries from the {@link Map}.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const map = new MapView<string, number>([["key1", 2], ["key2", 4], ["key3", 8]]);
+   * map.clear();
+   *
+   * console.log(map); // MapView { }
+   * ```
+   */
+  clear() {
+    const e = this.size;
+    super.clear(), e > 0 && this._publisher.publish("collection:clear");
+  }
+  /**
+   * Subscribes to an event and adds a callback to be executed when the event is published.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const map = new MapView<string, number>();
+   * const unsubscribe = map.subscribe("entry:add", (key: string, value: number) =>
+   * {
+   *     if (key === "answer") { unsubscribe(); }
+   *     console.log(`Added ${key}: ${value}`);
+   * });
+   *
+   * map.set("key1", 2); // Added key1: 2
+   * map.set("answer", 42); // Added answer: 42
+   * map.set("key2", 4);
+   * map.set("key3", 8);
+   * ```
+   *
+   * ---
+   *
+   * @template T The key of the map containing the callback signature to subscribe.
+   *
+   * @param event The name of the event to subscribe to.
+   * @param callback The callback to execute when the event is published.
+   *
+   * @returns A function that can be used to unsubscribe the callback from the event.
+   */
+  subscribe(e, t) {
+    return this._publisher.subscribe(e, t);
+  }
+  /**
+   * Unsubscribes from an event and removes a callback from being executed when the event is published.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const callback = (key: string, value: number) => console.log(`Added ${key}: ${value}`);
+   * const map = new MapView<string, number>();
+   *
+   * map.subscribe("entry:add", callback);
+   * map.set("key1", 2); // Added key1: 2
+   *
+   * map.unsubscribe("entry:add", callback);
+   * map.set("key2", 4);
+   * ```
+   *
+   * ---
+   *
+   * @template T The key of the map containing the callback signature to unsubscribe.
+   *
+   * @param event The name of the event to unsubscribe from.
+   * @param callback The callback to remove from the event.
+   */
+  unsubscribe(e, t) {
+    this._publisher.unsubscribe(e, t);
+  }
+}
+var Te, Ee;
+class ht extends (Ee = Set, Te = Symbol.toStringTag, Ee) {
+  /**
+   * Initializes a new instance of the {@link SetView} class.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const set = new SetView<number>([2, 4, 8]);
+   * ```
+   *
+   * ---
+   *
+   * @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, Te, "SetView");
+    if (this._publisher = new v(), e)
+      for (const t of e)
+        this.add(t);
+  }
+  /**
+   * Appends a new element with a specified value to the end of the {@link Set}.  
+   * If the value already exists, it will not be added again.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const set = new SetView<number>();
+   * set.add(2)
+   *     .add(4)
+   *     .add(8);
+   *
+   * console.log(set); // SetView(4) { 2, 4, 8 }
+   * ```
+   *
+   * ---
+   *
+   * @param value The value to add.
+   *
+   * @returns The current instance of the {@link SetView} class.
+   */
+  add(e) {
+    return super.add(e), this._publisher.publish("entry:add", e), this;
+  }
+  /**
+   * Removes the specified value from the {@link Set}.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const set = new SetView<number>([2, 4, 8]);
+   * set.delete(4); // true
+   * set.delete(16); // false
+   *
+   * console.log(set); // SetView(2) { 2, 8 }
+   * ```
+   *
+   * ---
+   *
+   * @param value The value to remove.
+   *
+   * @returns `true` if the entry existed and has been removed; otherwise `false` if the entry doesn't exist.
+   */
+  delete(e) {
+    const t = super.delete(e);
+    return t && this._publisher.publish("entry:remove", e), t;
+  }
+  /**
+   * Removes all entries from the {@link Set}.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const set = new SetView<number>([2, 4, 8]);
+   * set.clear();
+   *
+   * console.log(set); // SetView(0) { }
+   * ```
+   */
+  clear() {
+    const e = this.size;
+    super.clear(), e > 0 && this._publisher.publish("collection:clear");
+  }
+  /**
+   * Subscribes to an event and adds a callback to be executed when the event is published.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const set = new SetView<number>();
+   * const unsubscribe = set.subscribe("entry:add", (value: number) =>
+   * {
+   *     if (value === 42) { unsubscribe(); }
+   *     console.log(`Added ${value}`);
+   * });
+   *
+   * set.add(2); // Added 2
+   * set.add(42); // Added 42
+   * set.add(4);
+   * set.add(8);
+   * ```
+   *
+   * ---
+   *
+   * @template K The key of the map containing the callback signature to subscribe.
+   *
+   * @param event The name of the event to subscribe to.
+   * @param callback The callback to execute when the event is published.
+   *
+   * @returns A function that can be used to unsubscribe the callback from the event.
+   */
+  subscribe(e, t) {
+    return this._publisher.subscribe(e, t);
+  }
+  /**
+   * Unsubscribes from an event and removes a callback from being executed when the event is published.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * const callback = (value: number) => console.log(`Added ${value}`);
+   * const set = new SetView<number>();
+   *
+   * set.subscribe("entry:add", callback);
+   * set.add(2); // Added 2
+   *
+   * set.unsubscribe("entry:add", callback);
+   * set.add(4);
+   * ```
+   *
+   * ---
+   *
+   * @template K The key of the map containing the callback signature to unsubscribe.
+   *
+   * @param event The name of the event to unsubscribe from.
+   * @param callback The callback to remove from the event.
+   */
+  unsubscribe(e, t) {
+    this._publisher.unsubscribe(e, t);
+  }
+}
+var Me;
+Me = Symbol.toStringTag;
+class ft {
   /**
    * Initializes a new instance of the {@link JSONStorage} class.  
    * It cannot be instantiated outside of a browser environment or an {@link EnvironmentException} is thrown.
@@ -3961,7 +4272,7 @@ class ot {
    * 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(t = !0) {
+  constructor(n = !0) {
     /**
      * Whether to prefer the {@link localStorage} over the {@link sessionStorage} when calling an ambivalent method.
      *
@@ -3977,41 +4288,41 @@ class ot {
      * A reference to the persistent {@link localStorage} storage.
      */
     a(this, "_persistent");
-    a(this, ke, "JSONStorage");
-    if (!Oe)
-      throw new Je(
+    a(this, Me, "JSONStorage");
+    if (!De)
+      throw new Ge(
         "The `JSONStorage` class can only be instantiated within a browser environment."
       );
-    this._preferPersistence = t, this._volatile = window.sessionStorage, this._persistent = window.localStorage;
+    this._preferPersistence = n, this._volatile = window.sessionStorage, this._persistent = window.localStorage;
   }
-  _get(t, e, n) {
-    const s = t.getItem(e);
+  _get(n, e, t) {
+    const s = n.getItem(e);
     if (s)
       try {
         return JSON.parse(s);
       } catch {
         console.warn(
           `The "${s}" value for "${e}" property cannot be parsed. Clearing the storage...`
-        ), t.removeItem(e);
+        ), n.removeItem(e);
       }
-    return n;
+    return t;
   }
-  _set(t, e, n) {
-    const s = JSON.stringify(n);
-    s ? t.setItem(e, s) : t.removeItem(e);
+  _set(n, e, t) {
+    const s = JSON.stringify(t);
+    s ? n.setItem(e, s) : n.removeItem(e);
   }
-  get(t, e, n = this._preferPersistence) {
-    const s = n ? this._persistent : this._volatile;
-    return this._get(s, t, e);
+  get(n, e, t = this._preferPersistence) {
+    const s = t ? this._persistent : this._volatile;
+    return this._get(s, n, e);
   }
-  recall(t, e) {
-    return this._get(this._volatile, t, e);
+  recall(n, e) {
+    return this._get(this._volatile, n, e);
   }
-  retrieve(t, e) {
-    return this.recall(t) ?? this.read(t, e);
+  retrieve(n, e) {
+    return this.recall(n) ?? this.read(n, e);
   }
-  read(t, e) {
-    return this._get(this._persistent, t, e);
+  read(n, e) {
+    return this._get(this._persistent, n, e);
   }
   /**
    * Checks whether the value with the specified key exists within the default storage.
@@ -4035,8 +4346,8 @@ class ot {
    *
    * @returns `true` if the key exists, `false` otherwise.
    */
-  has(t, e) {
-    return (e ? this._persistent : this._volatile).getItem(t) !== null;
+  has(n, e) {
+    return (e ? this._persistent : this._volatile).getItem(n) !== null;
   }
   /**
    * Checks whether the value with the specified key exists within the volatile {@link sessionStorage}.
@@ -4057,8 +4368,8 @@ class ot {
    *
    * @returns `true` if the key exists, `false` otherwise.
    */
-  knows(t) {
-    return this._volatile.getItem(t) !== null;
+  knows(n) {
+    return this._volatile.getItem(n) !== null;
   }
   /**
    * Checks whether the value with the specified key exists looking first in the
@@ -4080,8 +4391,8 @@ class ot {
    *
    * @returns `true` if the key exists, `false` otherwise.
    */
-  find(t) {
-    return this.knows(t) ?? this.exists(t);
+  find(n) {
+    return this.knows(n) ?? this.exists(n);
   }
   /**
    * Checks whether the value with the specified key exists within the persistent {@link localStorage}.
@@ -4102,8 +4413,8 @@ class ot {
    *
    * @returns `true` if the key exists, `false` otherwise.
    */
-  exists(t) {
-    return this._persistent.getItem(t) !== null;
+  exists(n) {
+    return this._persistent.getItem(n) !== null;
   }
   /**
    * Sets the value with the specified key in the default storage.  
@@ -4128,9 +4439,9 @@ class ot {
    * 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(t, e, n = this._preferPersistence) {
-    const s = n ? this._persistent : this._volatile;
-    this._set(s, t, e);
+  set(n, e, t = this._preferPersistence) {
+    const s = t ? this._persistent : this._volatile;
+    this._set(s, n, e);
   }
   /**
    * Sets the value with the specified key in the volatile {@link sessionStorage}.  
@@ -4152,8 +4463,8 @@ class ot {
    * @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(t, e) {
-    this._set(this._volatile, t, e);
+  remember(n, e) {
+    this._set(this._volatile, n, e);
   }
   /**
    * Sets the value with the specified key in the persistent {@link localStorage}.  
@@ -4175,8 +4486,8 @@ class ot {
    * @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(t, e) {
-    this._set(this._persistent, t, e);
+  write(n, e) {
+    this._set(this._persistent, n, e);
   }
   /**
    * Removes the value with the specified key from the default storage.
@@ -4195,8 +4506,8 @@ class ot {
    * 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(t, e) {
-    (e ? this._persistent : this._volatile).removeItem(t);
+  delete(n, e) {
+    (e ? this._persistent : this._volatile).removeItem(n);
   }
   /**
    * Removes the value with the specified key from the volatile {@link sessionStorage}.
@@ -4212,8 +4523,8 @@ class ot {
    *
    * @param key The key of the value to remove.
    */
-  forget(t) {
-    this._volatile.removeItem(t);
+  forget(n) {
+    this._volatile.removeItem(n);
   }
   /**
    * Removes the value with the specified key from the persistent {@link localStorage}.
@@ -4229,8 +4540,8 @@ class ot {
    *
    * @param key The key of the value to remove.
    */
-  erase(t) {
-    this._persistent.removeItem(t);
+  erase(n) {
+    this._persistent.removeItem(n);
   }
   /**
    * Removes the value with the specified key from both the
@@ -4247,12 +4558,12 @@ class ot {
    *
    * @param key The key of the value to remove.
    */
-  clear(t) {
-    this._volatile.removeItem(t), this._persistent.removeItem(t);
+  clear(n) {
+    this._volatile.removeItem(n), this._persistent.removeItem(n);
   }
 }
-var Se;
-Se = Symbol.toStringTag;
+var Re;
+Re = Symbol.toStringTag;
 const R = class R {
   /**
    * Initializes a new instance of the {@link SmartPromise} class.
@@ -4273,7 +4584,7 @@ const R = class R {
    * 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(t) {
+  constructor(n) {
     /**
      * A flag indicating whether the promise is still pending or not.
      *
@@ -4299,12 +4610,12 @@ const R = class R {
      * The native {@link Promise} object wrapped by this instance.
      */
     a(this, "_promise");
-    a(this, Se, "SmartPromise");
+    a(this, Re, "SmartPromise");
     this._isPending = !0, this._isFulfilled = !1, this._isRejected = !1;
-    const e = (s) => (this._isPending = !1, this._isFulfilled = !0, s), n = (s) => {
+    const e = (s) => (this._isPending = !1, this._isFulfilled = !0, s), t = (s) => {
       throw this._isPending = !1, this._isRejected = !0, s;
     };
-    this._promise = new Promise(t).then(e, n);
+    this._promise = new Promise(n).then(e, t);
   }
   /**
    * Wraps a new {@link SmartPromise} object around an existing native {@link Promise} object.
@@ -4329,8 +4640,8 @@ const R = class R {
    *
    * @returns A new {@link SmartPromise} object that wraps the provided promise.
    */
-  static FromPromise(t) {
-    return new R((e, n) => t.then(e, n));
+  static FromPromise(n) {
+    return new R((e, t) => n.then(e, t));
   }
   /**
    * A flag indicating whether the promise is still pending or not.
@@ -4350,11 +4661,11 @@ const R = class R {
   get isRejected() {
     return this._isRejected;
   }
-  then(t, e) {
-    return this._promise.then(t, e);
+  then(n, e) {
+    return this._promise.then(n, e);
   }
-  catch(t) {
-    return this._promise.catch(t);
+  catch(n) {
+    return this._promise.catch(n);
   }
   /**
    * Attaches a callback that executes right after the promise is settled, regardless of the outcome.
@@ -4382,13 +4693,13 @@ const R = class R {
    *
    * @returns A new {@link Promise} that executes the callback once the promise is settled.
    */
-  finally(t) {
-    return this._promise.finally(t);
+  finally(n) {
+    return this._promise.finally(n);
   }
 };
-let k = R;
-var Te, Ee;
-class He extends (Ee = k, Te = Symbol.toStringTag, Ee) {
+let S = R;
+var Fe, Pe;
+class Ze extends (Pe = S, Fe = Symbol.toStringTag, Pe) {
   /**
    * Initializes a new instance of the {@link DeferredPromise} class.
    *
@@ -4404,7 +4715,7 @@ class He extends (Ee = k, Te = Symbol.toStringTag, Ee) {
    * @param onFulfilled The callback to execute once the promise is fulfilled.
    * @param onRejected The callback to execute once the promise is rejected.
    */
-  constructor(e, n) {
+  constructor(e, t) {
     let s, r;
     super((o, l) => {
       s = o, r = l;
@@ -4423,8 +4734,8 @@ class He extends (Ee = k, Te = Symbol.toStringTag, Ee) {
      * If you're looking for the public and readonly property, use the {@link DeferredPromise.reject} getter instead.
      */
     a(this, "_reject");
-    a(this, Te, "DeferredPromise");
-    this._promise = this._promise.then(e, n), this._resolve = s, this._reject = r;
+    a(this, Fe, "DeferredPromise");
+    this._promise = this._promise.then(e, t), this._resolve = s, this._reject = r;
   }
   /**
    * The exposed function that allows to reject the promise.
@@ -4462,8 +4773,8 @@ class He extends (Ee = k, Te = Symbol.toStringTag, Ee) {
     return e.then(this.resolve, this.reject), this;
   }
 }
-var Me, Re;
-class at extends (Re = k, Me = Symbol.toStringTag, Re) {
+var Ce, je;
+class dt extends (je = S, Ce = Symbol.toStringTag, je) {
   /**
    * Initializes a new instance of the {@link TimedPromise} class.
    *
@@ -4486,52 +4797,52 @@ class at extends (Re = k, Me = Symbol.toStringTag, Re) {
    *
    * @param timeout The maximum time in milliseconds that the operation can take before timing out.
    */
-  constructor(e, n) {
+  constructor(e, t) {
     super((s, r) => {
-      const o = (S) => {
-        clearTimeout(P), s(S);
-      }, l = (S) => {
-        clearTimeout(P), r(S);
-      }, P = setTimeout(() => l(new Ye("The operation has timed out.")), n);
+      const o = (T) => {
+        clearTimeout(P), s(T);
+      }, l = (T) => {
+        clearTimeout(P), r(T);
+      }, P = setTimeout(() => l(new Ke("The operation has timed out.")), t);
       e(o, l);
     });
-    a(this, Me, "TimedPromise");
+    a(this, Ce, "TimedPromise");
   }
 }
-var M = /* @__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))(M || {}), Qe = /* @__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))(Qe || {});
-function lt(i, t, e = 864e5) {
-  let n;
-  return i = new Date(i), t = new Date(t), i < t ? n = Math.floor : n = Math.ceil, n((t.getTime() - i.getTime()) / e);
+var M = /* @__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))(M || {}), We = /* @__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))(We || {});
+function wt(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);
 }
-function ct(i, t, e = 864e5) {
-  if (i >= t)
+function mt(i, n, e = 864e5) {
+  if (i = new Date(i), n = new Date(n), i >= n)
     throw new b("The end date must be greater than the start date.");
-  return new c(function* () {
-    const n = new Date(t).getTime();
-    let s = new Date(i).getTime();
-    for (; s < n; )
+  return new u(function* () {
+    const t = n.getTime();
+    let s = i.getTime();
+    for (; s < t; )
       yield new Date(s), s += e;
   });
 }
-function Ve(i, t = 864e5) {
-  if (t <= 1)
+function Ue(i, n = 864e5) {
+  if (n <= 1)
     throw new b(
       "Rounding a timestamp by milliseconds or less makes no sense.Use the timestamp value directly instead."
     );
-  if (t > 864e5)
+  if (n > 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() / t) * t);
+  return i = new Date(i), new Date(Math.floor(i.getTime() / n) * n);
 }
-function ut(i, t = 0) {
+function pt(i, n = 0) {
   i = new Date(i);
-  const e = 7 - t, n = (i.getUTCDay() + e) % 7, s = i.getTime() - 864e5 * n;
-  return Ve(new Date(s));
+  const e = 7 - n, t = (i.getUTCDay() + e) % 7, s = i.getTime() - 864e5 * t;
+  return Ue(new Date(s));
 }
-var Fe;
-Fe = Symbol.toStringTag;
-class qe {
+var Ie;
+Ie = Symbol.toStringTag;
+class Je {
   /**
    * Initializes a new instance of the {@link GameLoop} class.
    *
@@ -4548,7 +4859,7 @@ class qe {
    * @param msIfNotBrowser
    * The interval in milliseconds that will be used if the current environment isn't a browser. Default is `40`.
    */
-  constructor(t, e = 40) {
+  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.
@@ -4588,14 +4899,14 @@ class qe {
      * {@link cancelAnimationFrame} or the {@link clearInterval} function.
      */
     a(this, "_stop");
-    a(this, Fe, "GameLoop");
-    this._startTime = 0, this._isRunning = !1, Oe ? (this._start = () => {
-      t(this.elapsedTime), this._handle = window.requestAnimationFrame(this._start);
+    a(this, Ie, "GameLoop");
+    this._startTime = 0, this._isRunning = !1, De ? (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(() => t(this.elapsedTime), e);
-    }, this._stop = () => clearInterval(this._handle)), this._publisher = new E();
+      this._handle = setInterval(() => n(this.elapsedTime), e);
+    }, this._stop = () => clearInterval(this._handle)), this._publisher = new v();
   }
   /**
    * The time when the game loop has started.  
@@ -4635,10 +4946,10 @@ class qe {
    *
    * @param elapsedTime The elapsed time to set as default when the game loop starts. Default is `0`.
    */
-  start(t = 0) {
+  start(n = 0) {
     if (this._isRunning)
-      throw new y("The game loop has already been started.");
-    this._startTime = performance.now() - t, this._start(), this._isRunning = !0, this._publisher.publish("start");
+      throw new p("The game loop has already been started.");
+    this._startTime = performance.now() - n, this._start(), this._isRunning = !0, this._publisher.publish("start");
   }
   /**
    * Stops the execution of the game loop.
@@ -4655,9 +4966,9 @@ class qe {
    */
   stop() {
     if (!this._isRunning)
-      throw new y("The game loop had already stopped or hadn't yet started.");
+      throw new p("The game loop had already stopped or hadn't yet started.");
     if (!this._handle)
-      throw new x();
+      throw new g();
     this._stop(), this._handle = void 0, this._isRunning = !1, this._publisher.publish("stop");
   }
   /**
@@ -4676,8 +4987,8 @@ class qe {
    *
    * @returns A function that can be used to unsubscribe from the event.
    */
-  onStart(t) {
-    return this._publisher.subscribe("start", t);
+  onStart(n) {
+    return this._publisher.subscribe("start", n);
   }
   /**
    * Subscribes to the `stop` event of the game loop.
@@ -4695,12 +5006,12 @@ class qe {
    *
    * @returns A function that can be used to unsubscribe from the event.
    */
-  onStop(t) {
-    return this._publisher.subscribe("stop", t);
+  onStop(n) {
+    return this._publisher.subscribe("stop", n);
   }
 }
-var Pe, Ce;
-class ht extends (Ce = qe, Pe = Symbol.toStringTag, Ce) {
+var Ae, Ne;
+class yt extends (Ne = Je, Ae = Symbol.toStringTag, Ne) {
   /**
    * Initializes a new instance of the {@link Clock} class.
    *
@@ -4718,13 +5029,13 @@ class ht extends (Ce = qe, Pe = Symbol.toStringTag, Ce) {
    * `TimeUnit.Second` by default.
    */
   constructor(e = M.Second) {
-    super((n) => this._publisher.publish("tick", n), e);
+    super((t) => this._publisher.publish("tick", t), e);
     /**
      * The {@link Publisher} object that will be used to publish the events of the clock.
      */
     a(this, "_publisher");
-    a(this, Pe, "Clock");
-    this._publisher = new E();
+    a(this, Ae, "Clock");
+    this._publisher = new v();
   }
   /**
    * Starts the execution of the clock.
@@ -4745,7 +5056,7 @@ class ht extends (Ce = qe, Pe = Symbol.toStringTag, Ce) {
    */
   start(e = 0) {
     if (this._isRunning)
-      throw new y("The clock has already been started.");
+      throw new p("The clock has already been started.");
     this._startTime = performance.now() - e, this._start(), this._isRunning = !0, this._publisher.publish("start");
   }
   /**
@@ -4763,9 +5074,9 @@ class ht extends (Ce = qe, Pe = Symbol.toStringTag, Ce) {
    */
   stop() {
     if (!this._isRunning)
-      throw new y("The clock had already stopped or hadn't yet started.");
+      throw new p("The clock had already stopped or hadn't yet started.");
     if (!this._handle)
-      throw new x();
+      throw new g();
     this._stop(), this._handle = void 0, this._isRunning = !1, this._publisher.publish("stop");
   }
   /**
@@ -4792,19 +5103,19 @@ class ht extends (Ce = qe, Pe = Symbol.toStringTag, Ce) {
    *
    * @returns A function that can be used to unsubscribe from the event.
    */
-  onTick(e, n = 0) {
-    if (n < 0)
+  onTick(e, t = 0) {
+    if (t < 0)
       throw new b("The tick step must be a non-negative number.");
-    if (n === 0)
+    if (t === 0)
       return this._publisher.subscribe("tick", e);
     let s = 0;
     return this._publisher.subscribe("tick", (r) => {
-      r - s < n || (e(r), s = r);
+      r - s < t || (e(r), s = r);
     });
   }
 }
-var je, Ie;
-class ft extends (Ie = qe, je = Symbol.toStringTag, Ie) {
+var Oe, $e;
+class _t extends ($e = Je, Oe = Symbol.toStringTag, $e) {
   /**
    * Initializes a new instance of the {@link Countdown} class.
    *
@@ -4824,11 +5135,11 @@ class ft extends (Ie = qe, je = Symbol.toStringTag, Ie) {
    * The interval in milliseconds at which the countdown will tick if the environment is not a browser.  
    * `TimeUnit.Second` by default.
    */
-  constructor(e, n = M.Second) {
+  constructor(e, t = M.Second) {
     super(() => {
       const r = this.remainingTime;
       r <= 0 ? (this._deferrerStop(), this._publisher.publish("tick", 0), this._publisher.publish("expire")) : this._publisher.publish("tick", r);
-    }, n);
+    }, t);
     /**
      * The {@link Publisher} object that will be used to publish the events of the countdown.
      */
@@ -4844,8 +5155,8 @@ class ft extends (Ie = qe, je = Symbol.toStringTag, Ie) {
      * The {@link DeferredPromise} that will be resolved or rejected when the countdown expires or stops.
      */
     a(this, "_deferrer");
-    a(this, je, "Countdown");
-    this._publisher = new E(), this._duration = e;
+    a(this, Oe, "Countdown");
+    this._publisher = new v(), this._duration = e;
   }
   /**
    * The total duration of the countdown in milliseconds.
@@ -4864,6 +5175,8 @@ class ft extends (Ie = qe, je = Symbol.toStringTag, Ie) {
    * The internal method actually responsible for stopping the
    * countdown and resolving or rejecting the {@link Countdown._deferrer} promise.
    *
+   * ---
+   *
    * @param reason
    * The reason why the countdown has stopped.
    *
@@ -4872,9 +5185,9 @@ class ft extends (Ie = qe, je = Symbol.toStringTag, Ie) {
    */
   _deferrerStop(e) {
     if (!this._isRunning)
-      throw new y("The countdown hadn't yet started.");
+      throw new p("The countdown hadn't yet started.");
     if (!this._deferrer)
-      throw new x();
+      throw new g();
     this._stop(), this._handle = void 0, this._isRunning = !1, e !== void 0 ? this._deferrer.reject(e) : this._deferrer.resolve(), this._deferrer = void 0;
   }
   /**
@@ -4900,10 +5213,10 @@ class ft extends (Ie = qe, je = Symbol.toStringTag, Ie) {
    */
   start(e = this.duration) {
     if (this._isRunning)
-      throw new y("The countdown had already stopped or hadn't yet started.");
+      throw new p("The countdown had already stopped or hadn't yet started.");
     if (this._deferrer)
-      throw new x();
-    return this._deferrer = new He(), super.start(this.duration - e), this._publisher.publish("start"), this._deferrer;
+      throw new g();
+    return this._deferrer = new Ze(), super.start(this.duration - e), this._publisher.publish("start"), this._deferrer;
   }
   /**
    * Stops the execution of the countdown.
@@ -4973,22 +5286,22 @@ class ft extends (Ie = qe, je = Symbol.toStringTag, Ie) {
    *
    * @returns A function that can be used to unsubscribe from the event.
    */
-  onTick(e, n = 0) {
-    if (n < 0)
+  onTick(e, t = 0) {
+    if (t < 0)
       throw new b("The tick step must be a non-negative number.");
-    if (n === 0)
+    if (t === 0)
       return this._publisher.subscribe("tick", e);
     let s = this.remainingTime;
     return this._publisher.subscribe("tick", (r) => {
-      s - r < n || (e(r), s = r);
+      s - r < t || (e(r), s = r);
     });
   }
 }
-var Ae;
-Ae = Symbol.toStringTag;
-class dt {
+var ze;
+ze = Symbol.toStringTag;
+class bt {
   constructor() {
-    a(this, Ae, "Curve");
+    a(this, ze, "Curve");
   }
   /**
    * Generates a given number of values following a linear curve.  
@@ -5010,11 +5323,11 @@ class dt {
    *
    * @returns A {@link SmartIterator} object that generates the values following a linear curve.
    */
-  static Linear(t) {
-    const e = t - 1;
-    return new c(function* () {
-      for (let n = 0; n < t; n += 1)
-        yield n / e;
+  static Linear(n) {
+    const e = n - 1;
+    return new u(function* () {
+      for (let t = 0; t < n; t += 1)
+        yield t / e;
     });
   }
   /**
@@ -5045,21 +5358,21 @@ class dt {
    *
    * @returns A {@link SmartIterator} object that generates the values following an exponential curve.
    */
-  static Exponential(t, e = 2) {
+  static Exponential(n, e = 2) {
     if (e < 0)
       throw new d("The base of the exponential curve cannot be negative.");
-    const n = t - 1;
-    return new c(function* () {
-      for (let s = 0; s < t; s += 1)
-        yield Math.pow(s / n, e);
+    const t = n - 1;
+    return new u(function* () {
+      for (let s = 0; s < n; s += 1)
+        yield Math.pow(s / t, e);
     });
   }
 }
-var Ne;
-Ne = Symbol.toStringTag;
+var qe;
+qe = Symbol.toStringTag;
 const F = class F {
   constructor() {
-    a(this, Ne, "Random");
+    a(this, qe, "Random");
   }
   /**
    * Generates a random boolean value.
@@ -5083,18 +5396,20 @@ const F = class F {
    *
    * @returns A random boolean value.
    */
-  static Boolean(t = 0.5) {
-    return Math.random() < t;
+  static Boolean(n = 0.5) {
+    return Math.random() < n;
   }
-  static Integer(t, e) {
-    return Math.floor(e === void 0 ? Math.random() * t : Math.random() * (e - t) + t);
+  static Integer(n, e) {
+    return Math.floor(e === void 0 ? Math.random() * n : Math.random() * (e - n) + n);
   }
-  static Decimal(t, e) {
-    return t === void 0 ? Math.random() : e === void 0 ? Math.random() * t : Math.random() * (e - t) + t;
+  static Decimal(n, e) {
+    return n === void 0 ? Math.random() : e === void 0 ? Math.random() * n : Math.random() * (e - n) + n;
   }
   /**
    * Picks a random valid index from a given array of elements.
    *
+   * ---
+   *
    * @template T The type of the elements in the array.
    *
    * @param elements
@@ -5104,14 +5419,16 @@ const F = class F {
    *
    * @returns A valid random index from the given array.
    */
-  static Index(t) {
-    if (t.length === 0)
+  static Index(n) {
+    if (n.length === 0)
       throw new d("You must provide at least one element.");
-    return this.Integer(t.length);
+    return this.Integer(n.length);
   }
   /**
    * Picks a random element from a given array of elements.
    *
+   * ---
+   *
    * @template T The type of the elements in the array.
    *
    * @param elements
@@ -5121,89 +5438,89 @@ const F = class F {
    *
    * @returns A random element from the given array.
    */
-  static Choice(t) {
-    return t[F.Index(t)];
+  static Choice(n) {
+    return n[F.Index(n)];
   }
 };
 let j = F;
-function wt(i) {
-  return new Promise((t) => setTimeout(t, i));
+function gt(i) {
+  return new Promise((n) => setTimeout(n, i));
 }
-function mt() {
+function xt() {
   return new Promise((i) => requestAnimationFrame(() => i()));
 }
-function yt() {
+function vt() {
   return new Promise((i) => setTimeout(i));
 }
-function _t(i, t = "text/javascript") {
-  return new Promise((e, n) => {
+function kt(i, n = "text/javascript") {
+  return new Promise((e, t) => {
     const s = document.createElement("script");
-    s.async = !0, s.defer = !0, s.src = i, s.type = t, s.onload = (r) => e(), s.onerror = (r) => n(r), document.body.appendChild(s);
+    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);
   });
 }
-function pt(...i) {
-  return new c(function* () {
-    for (const t of i)
-      for (const e of t)
+function St(...i) {
+  return new u(function* () {
+    for (const n of i)
+      for (const e of n)
         yield e;
   });
 }
-function bt(i) {
+function Tt(i) {
   if (i instanceof Array)
     return i.length;
-  let t = 0;
+  let n = 0;
   for (const e of i)
-    t += 1;
-  return t;
+    n += 1;
+  return n;
 }
-function xt(i) {
-  return new c(function* () {
-    let t = 0;
+function Et(i) {
+  return new u(function* () {
+    let n = 0;
     for (const e of i)
-      yield [t, e], t += 1;
+      yield [n, e], n += 1;
   });
 }
-function gt(i, t, e = 1) {
+function Mt(i, n, e = 1) {
   if (e <= 0)
     throw new b(
       "Step must be always a positive number, even when generating numbers in reverse order."
     );
-  return t === void 0 && (t = i, i = 0), i > t ? new c(function* () {
-    for (let n = i; n > t; n -= e)
-      yield n;
-  }) : new c(function* () {
-    for (let n = i; n < t; n += e)
-      yield n;
+  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;
   });
 }
-function vt(i) {
-  const t = Array.from(i);
-  for (let e = t.length - 1; e > 0; e -= 1) {
-    const n = Math.floor(Math.random() * (e + 1));
-    [t[e], t[n]] = [t[n], t[e]];
+function Rt(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]];
   }
-  return t;
+  return n;
 }
-function kt(i) {
-  return new c(function* () {
-    const t = /* @__PURE__ */ new Set();
+function Ft(i) {
+  return new u(function* () {
+    const n = /* @__PURE__ */ new Set();
     for (const e of i)
-      t.has(e) || (t.add(e), yield e);
+      n.has(e) || (n.add(e), yield e);
   });
 }
-function Xe(i, t) {
-  const e = i[Symbol.iterator](), n = t[Symbol.iterator]();
-  return new c(function* () {
+function et(i, n) {
+  const e = i[Symbol.iterator](), t = n[Symbol.iterator]();
+  return new u(function* () {
     for (; ; ) {
-      const s = e.next(), r = n.next();
+      const s = e.next(), r = t.next();
       if (s.done || r.done)
         break;
       yield [s.value, r.value];
     }
   });
 }
-function St(i, t) {
-  if (t === void 0) {
+function Pt(i, n) {
+  if (n === void 0) {
     let r = 0, o = 0;
     for (const l of i)
       r += l, o += 1;
@@ -5211,94 +5528,96 @@ function St(i, t) {
       throw new d("You must provide at least one value.");
     return r / o;
   }
-  let e = 0, n = 0, s = 0;
-  for (const [r, o] of Xe(i, t)) {
+  let e = 0, t = 0, s = 0;
+  for (const [r, o] of et(i, n)) {
     if (o <= 0)
       throw new d(`The weight for the value #${s} must be greater than zero.`);
-    e += r * o, n += o, s += 1;
+    e += r * o, t += o, s += 1;
   }
   if (s === 0)
     throw new d("You must provide at least one value and weight.");
-  if (n <= 0)
+  if (t <= 0)
     throw new d("The sum of weights must be greater than zero.");
-  return e / n;
+  return e / t;
 }
-function Tt(i) {
-  let t = 0;
+function Ct(i) {
+  let n = 0;
   for (let e = 0; e < i.length; e += 1) {
-    const n = i.charCodeAt(e);
-    t = (t << 5) - t + n, t |= 0;
+    const t = i.charCodeAt(e);
+    n = (n << 5) - n + t, n |= 0;
   }
-  return t;
+  return n;
 }
-function Et(i) {
-  let t = 0;
+function jt(i) {
+  let n = 0;
   for (const e of i)
-    t += e;
-  return t;
+    n += e;
+  return n;
 }
-function Mt(i) {
+function It(i) {
   return `${i.charAt(0).toUpperCase()}${i.slice(1)}`;
 }
-const Rt = "2.0.1";
+const At = "2.1.0";
 export {
-  T as AggregatedAsyncIterator,
-  g as AggregatedIterator,
-  Ge as CallableObject,
-  ht as Clock,
-  ft as Countdown,
-  dt as Curve,
-  He as DeferredPromise,
-  Je as EnvironmentException,
-  u as Exception,
-  x as FatalErrorException,
-  $e as FileException,
-  et as FileExistsException,
-  tt as FileNotFoundException,
-  qe as GameLoop,
-  ot as JSONStorage,
-  _ as KeyException,
-  nt as NetworkException,
-  Be as NotImplementedException,
-  st as PermissionException,
-  E as Publisher,
+  E as AggregatedAsyncIterator,
+  x as AggregatedIterator,
+  Qe as CallableObject,
+  yt as Clock,
+  _t as Countdown,
+  bt as Curve,
+  Ze as DeferredPromise,
+  Ge as EnvironmentException,
+  c as Exception,
+  g as FatalErrorException,
+  Be as FileException,
+  rt as FileExistsException,
+  it as FileNotFoundException,
+  Je as GameLoop,
+  ft as JSONStorage,
+  y as KeyException,
+  ct as MapView,
+  ot as NetworkException,
+  Ve as NotImplementedException,
+  at as PermissionException,
+  v as Publisher,
   j as Random,
   b as RangeException,
   h as ReducedIterator,
   C as ReferenceException,
-  y as RuntimeException,
+  p as RuntimeException,
+  ht as SetView,
   f as SmartAsyncIterator,
-  c as SmartIterator,
-  k as SmartPromise,
-  it as SwitchableCallback,
+  u as SmartIterator,
+  S as SmartPromise,
+  ut as SwitchableCallback,
   M as TimeUnit,
-  at as TimedPromise,
-  Ye as TimeoutException,
-  rt as TypeException,
-  Rt as VERSION,
+  dt as TimedPromise,
+  Ke as TimeoutException,
+  lt as TypeException,
+  At as VERSION,
   d as ValueException,
-  Qe as WeekDay,
-  St as average,
-  Mt as capitalize,
-  pt as chain,
-  bt as count,
-  lt as dateDifference,
-  ct as dateRange,
-  Ve as dateRound,
-  wt as delay,
-  xt as enumerate,
-  ut as getWeek,
-  Tt as hash,
-  Oe as isBrowser,
-  We as isNode,
-  Ue as isWorker,
-  _t as loadScript,
-  mt as nextAnimationFrame,
-  gt as range,
-  vt as shuffle,
-  Et as sum,
-  kt as unique,
-  yt as yieldToEventLoop,
-  Xe as zip
+  We as WeekDay,
+  Pt as average,
+  It as capitalize,
+  St as chain,
+  Tt as count,
+  wt as dateDifference,
+  mt as dateRange,
+  Ue as dateRound,
+  gt as delay,
+  Et as enumerate,
+  pt as getWeek,
+  Ct as hash,
+  De as isBrowser,
+  nt as isNode,
+  st as isWorker,
+  kt as loadScript,
+  xt as nextAnimationFrame,
+  Mt as range,
+  Rt as shuffle,
+  jt as sum,
+  Ft as unique,
+  vt as yieldToEventLoop,
+  et as zip
 };
-//# sourceMappingURL=core.js.map
+//# sourceMappingURL=core.esm.js.map