@byloth/core 2.0.0 → 2.0.2

package/dist/core.js

@@ -1,20 +1,25 @@
-var ze = Object.defineProperty;
-var De = (i, t, e) => t in i ? ze(i, t, { enumerable: !0, configurable: !0, writable: !0, value: e }) : i[t] = e;
-var a = (i, t, e) => De(i, typeof t != "symbol" ? t + "" : t, e);
+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 I;
-const Ze = typeof process < "u" && !!((I = process.versions) != null && I.node);
+const We = typeof process < "u" && !!((I = process.versions) != null && I.node);
 var A;
-const We = typeof self == "object" && ((A = self.constructor) == null ? void 0 : A.name) === "DedicatedWorkerGlobalScope";
+const Ue = typeof self == "object" && ((A = self.constructor) == null ? void 0 : A.name) === "DedicatedWorkerGlobalScope";
 var N, O;
-class c extends (O = Error, N = Symbol.toStringTag, O) {
+class u extends (O = Error, N = Symbol.toStringTag, O) {
   /**
    * Initializes a new instance of the {@link Exception} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new Exception("An error occurred while processing the request.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"Exception"`.
@@ -31,6 +36,9 @@ Caused by ${n}`);
   /**
    * A static method to convert a generic caught error, ensuring it's an instance of the {@link Exception} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * try { [...] }
    * catch (error)
@@ -41,29 +49,36 @@ Caused by ${n}`);
    * }
    * ```
    *
+   * ---
+   *
    * @param error The caught error to convert.
    *
    * @returns An instance of the {@link Exception} class.
    */
   static FromUnknown(e) {
-    if (e instanceof c)
+    if (e instanceof u)
       return e;
     if (e instanceof Error) {
-      const n = new c(e.message);
+      const n = new u(e.message);
       return n.stack = e.stack, n.name = e.name, n;
     }
-    return new c(`${e}`);
+    return new u(`${e}`);
   }
 }
 var $, q;
-class x extends (q = c, $ = Symbol.toStringTag, q) {
+class x extends (q = u, $ = Symbol.toStringTag, q) {
   /**
    * Initializes a new instance of the {@link FatalErrorException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new FatalErrorException("This error should never happen. Please, contact the support team.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"FatalErrorException"`.
@@ -74,15 +89,20 @@ class x extends (q = c, $ = Symbol.toStringTag, q) {
     a(this, $, "FatalErrorException");
   }
 }
-var z, D;
-class Be extends (D = x, z = Symbol.toStringTag, D) {
+var D, z;
+class Be extends (z = x, D = Symbol.toStringTag, z) {
   /**
    * Initializes a new instance of the {@link NotImplementedException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new NotImplementedException("This method hasn't been implemented yet. Check back later.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"NotImplementedException"`.
@@ -90,18 +110,23 @@ class Be extends (D = x, z = Symbol.toStringTag, D) {
   constructor(e, n, s = "NotImplementedException") {
     e === void 0 && (e = "This feature isn't implemented yet. Please, try again later.");
     super(e, n, s);
-    a(this, z, "NotImplementedException");
+    a(this, D, "NotImplementedException");
   }
 }
 var B, J;
-class $e extends (J = c, B = Symbol.toStringTag, J) {
+class $e extends (J = u, B = Symbol.toStringTag, J) {
   /**
    * Initializes a new instance of the {@link FileException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new FileException("An error occurred while trying to read the file.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"FileException"`.
@@ -112,14 +137,19 @@ class $e extends (J = c, B = Symbol.toStringTag, J) {
   }
 }
 var Y, L;
-class Ue extends (L = $e, Y = Symbol.toStringTag, L) {
+class et extends (L = $e, Y = Symbol.toStringTag, L) {
   /**
    * Initializes a new instance of the {@link FileExistsException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new FileExistsException("The file named 'data.json' already exists on the server.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"FileExistsException"`.
@@ -130,14 +160,19 @@ class Ue extends (L = $e, Y = Symbol.toStringTag, L) {
   }
 }
 var G, K;
-class et extends (K = $e, G = Symbol.toStringTag, K) {
+class tt extends (K = $e, G = Symbol.toStringTag, K) {
   /**
    * Initializes a new instance of the {@link FileNotFoundException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new FileNotFoundException("The file named 'data.json' wasn't found on the server.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"FileNotFoundException"`.
@@ -148,14 +183,19 @@ class et extends (K = $e, G = Symbol.toStringTag, K) {
   }
 }
 var H, Q;
-class b extends (Q = c, H = Symbol.toStringTag, Q) {
+class _ extends (Q = u, H = Symbol.toStringTag, Q) {
   /**
    * Initializes a new instance of the {@link KeyException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new KeyException("The 'id' key wasn't found in the dictionary.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"KeyException"`.
@@ -166,14 +206,19 @@ class b extends (Q = c, H = Symbol.toStringTag, Q) {
   }
 }
 var V, X;
-class tt extends (X = c, V = Symbol.toStringTag, X) {
+class nt extends (X = u, V = Symbol.toStringTag, X) {
   /**
    * Initializes a new instance of the {@link NetworkException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new NetworkException("Couldn't connect to the server. Please, try again later.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"NetworkException"`.
@@ -184,14 +229,19 @@ class tt extends (X = c, V = Symbol.toStringTag, X) {
   }
 }
 var Z, W;
-class nt extends (W = c, Z = Symbol.toStringTag, W) {
+class st extends (W = u, Z = Symbol.toStringTag, W) {
   /**
    * Initializes a new instance of the {@link PermissionException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new PermissionException("You don't have permission to access this resource.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"PermissionException"`.
@@ -202,14 +252,19 @@ class nt extends (W = c, Z = Symbol.toStringTag, W) {
   }
 }
 var U, ee;
-class C extends (ee = c, U = Symbol.toStringTag, ee) {
+class C extends (ee = u, U = Symbol.toStringTag, ee) {
   /**
    * Initializes a new instance of the {@link ReferenceException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new ReferenceException("The 'canvas' element wasn't found in the document.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"ReferenceException"`.
@@ -220,14 +275,19 @@ class C extends (ee = c, U = Symbol.toStringTag, ee) {
   }
 }
 var te, ne;
-class y extends (ne = c, te = Symbol.toStringTag, ne) {
+class y extends (ne = u, te = Symbol.toStringTag, ne) {
   /**
    * Initializes a new instance of the {@link RuntimeException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new RuntimeException("The received input seems to be malformed or corrupted.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"RuntimeException"`.
@@ -242,10 +302,15 @@ class Je extends (re = y, se = Symbol.toStringTag, re) {
   /**
    * Initializes a new instance of the {@link EnvironmentException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new EnvironmentException("The required environment variable 'API_KEY' isn't set.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"EnvironmentException"`.
@@ -256,14 +321,19 @@ class Je extends (re = y, se = Symbol.toStringTag, re) {
   }
 }
 var ie, oe;
-class Ye extends (oe = c, ie = Symbol.toStringTag, oe) {
+class Ye extends (oe = u, ie = Symbol.toStringTag, oe) {
   /**
    * Initializes a new instance of the {@link TimeoutException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new TimeoutException("The task took too long to complete.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"TimeoutException"`.
@@ -274,14 +344,19 @@ class Ye extends (oe = c, ie = Symbol.toStringTag, oe) {
   }
 }
 var ae, le;
-class st extends (le = c, ae = Symbol.toStringTag, le) {
+class rt extends (le = u, ae = Symbol.toStringTag, le) {
   /**
    * Initializes a new instance of the {@link TypeException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new TypeException("The 'username' argument must be a valid string.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"TypeException"`.
@@ -291,33 +366,43 @@ class st extends (le = c, ae = Symbol.toStringTag, le) {
     a(this, ae, "TypeException");
   }
 }
-var ue, ce;
-class d extends (ce = c, ue = Symbol.toStringTag, ce) {
+var ce, ue;
+class d extends (ue = u, ce = Symbol.toStringTag, ue) {
   /**
    * Initializes a new instance of the {@link ValueException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new ValueException("The 'grade' argument cannot be negative.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"ValueException"`.
    */
   constructor(e, n, s = "ValueException") {
     super(e, n, s);
-    a(this, ue, "ValueException");
+    a(this, ce, "ValueException");
   }
 }
 var he, fe;
-class p extends (fe = d, he = Symbol.toStringTag, fe) {
+class b extends (fe = d, he = Symbol.toStringTag, fe) {
   /**
    * Initializes a new instance of the {@link RangeException} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * throw new RangeException("The 'percentage' argument must be between 0 and 100.");
    * ```
    *
+   * ---
+   *
    * @param message The message that describes the error.
    * @param cause The previous caught error that caused this one, if any.
    * @param name The name of the exception. Default is `"RangeException"`.
@@ -328,7 +413,7 @@ class p extends (fe = d, he = Symbol.toStringTag, fe) {
   }
 }
 var de;
-class u {
+class c {
   constructor(t) {
     /**
      * The native {@link Iterator} object that is being wrapped by this instance.
@@ -350,6 +435,9 @@ class u {
    *
    * If the iterator is infinite and every element satisfies the condition, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator<number>([-2, -1, 0, 1, 2]);
    * const result = iterator.every((value) => value < 0);
@@ -357,6 +445,8 @@ class u {
    * console.log(result); // false
    * ```
    *
+   * ---
+   *
    * @param predicate The condition to check for each element of the iterator.
    *
    * @returns `true` if all elements satisfy the condition, `false` otherwise.
@@ -385,6 +475,9 @@ class u {
    *
    * If the iterator is infinite and no element satisfies the condition, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator<number>([-2, -1, 0, 1, 2]);
    * const result = iterator.some((value) => value < 0);
@@ -392,6 +485,8 @@ class u {
    * console.log(result); // true
    * ```
    *
+   * ---
+   *
    * @param predicate The condition to check for each element of the iterator.
    *
    * @returns `true` if any element satisfies the condition, `false` otherwise.
@@ -409,7 +504,7 @@ class u {
   }
   filter(t) {
     const e = this._iterator;
-    return new u(function* () {
+    return new c(function* () {
       let n = 0;
       for (; ; ) {
         const s = e.next();
@@ -432,6 +527,9 @@ class u {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator<number>([-2, -1, 0, 1, 2]);
    * const result = iterator.map((value) => Math.abs(value));
@@ -439,6 +537,8 @@ class u {
    * console.log(result.toArray()); // [2, 1, 0, 1, 2]
    * ```
    *
+   * ---
+   *
    * @template V The type of the elements after the transformation.
    *
    * @param iteratee The transformation function to apply to each element of the iterator.
@@ -447,7 +547,7 @@ class u {
    */
   map(t) {
     const e = this._iterator;
-    return new u(function* () {
+    return new c(function* () {
       let n = 0;
       for (; ; ) {
         const s = e.next();
@@ -485,6 +585,9 @@ class u {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator<number[]>([[-2, -1], 0, 1, 2, [3, 4, 5]]);
    * const result = iterator.flatMap((value) => value);
@@ -492,6 +595,8 @@ class u {
    * console.log(result.toArray()); // [-2, -1, 0, 1, 2, 3, 4, 5]
    * ```
    *
+   * ---
+   *
    * @template V The type of the elements after the transformation.
    *
    * @param iteratee The transformation function to apply to each element of the iterator.
@@ -500,7 +605,7 @@ class u {
    */
   flatMap(t) {
     const e = this._iterator;
-    return new u(function* () {
+    return new c(function* () {
       let n = 0;
       for (; ; ) {
         const s = e.next();
@@ -531,6 +636,9 @@ class u {
    * Only the dropped elements will be consumed in the process.  
    * The rest of the iterator will be consumed only once the new one is.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator<number>([-2, -1, 0, 1, 2]);
    * const result = iterator.drop(3);
@@ -538,13 +646,15 @@ class u {
    * console.log(result.toArray()); // [1, 2]
    * ```
    *
+   * ---
+   *
    * @param count The number of elements to drop.
    *
    * @returns A new {@link SmartIterator} containing the remaining elements.
    */
   drop(t) {
     const e = this._iterator;
-    return new u(function* () {
+    return new c(function* () {
       let n = 0;
       for (; n < t; ) {
         if (e.next().done)
@@ -574,6 +684,9 @@ class u {
    * Only the taken elements will be consumed from the original iterator.  
    * The rest of the original iterator will be available for further consumption.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator<number>([-2, -1, 0, 1, 2]);
    * const result = iterator.take(3);
@@ -582,13 +695,15 @@ class u {
    * console.log(iterator.toArray()); // [1, 2]
    * ```
    *
+   * ---
+   *
    * @param limit The number of elements to take.
    *
    * @returns A new {@link SmartIterator} containing the taken elements.
    */
   take(t) {
     const e = this._iterator;
-    return new u(function* () {
+    return new c(function* () {
       let n = 0;
       for (; n < t; ) {
         const s = e.next();
@@ -620,6 +735,9 @@ class u {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator<string>(["A", "M", "N", "Z"]);
    * const result = iterator.enumerate();
@@ -627,6 +745,8 @@ class u {
    * console.log(result.toArray()); // [[0, "A"], [1, "M"], [2, "N"], [3, "Z"]]
    * ```
    *
+   * ---
+   *
    * @returns A new {@link SmartIterator} containing the enumerated elements.
    */
   enumerate() {
@@ -643,6 +763,9 @@ class u {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator<number>([1, 1, 2, 3, 2, 3, 4, 5, 5, 4]);
    * const result = iterator.unique();
@@ -650,11 +773,13 @@ class u {
    * console.log(result.toArray()); // [1, 2, 3, 4, 5]
    * ```
    *
+   * ---
+   *
    * @returns A new {@link SmartIterator} containing only the unique elements.
    */
   unique() {
     const t = this._iterator;
-    return new u(function* () {
+    return new c(function* () {
       const e = /* @__PURE__ */ new Set();
       for (; ; ) {
         const n = t.next();
@@ -670,6 +795,9 @@ class u {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator<number>([1, 2, 3, 4, 5]);
    * const result = iterator.count();
@@ -677,6 +805,8 @@ class u {
    * console.log(result); // 5
    * ```
    *
+   * ---
+   *
    * @returns The number of elements in the iterator.
    */
   count() {
@@ -694,6 +824,9 @@ class u {
    * This method will consume the entire iterator in the process.  
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator<number>(["A", "M", "N", "Z"]);
    * iterator.forEach((value, index) =>
@@ -702,6 +835,8 @@ class u {
    * }
    * ```
    *
+   * ---
+   *
    * @param iteratee The function to apply to each element of the iterator.
    */
   forEach(t) {
@@ -719,6 +854,9 @@ class u {
    *
    * Once the iterator is done, the method will return an object with the `done` property set to `true`.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator<number>([1, 2, 3, 4, 5]);
    *
@@ -733,6 +871,8 @@ class u {
    * console.log(result); // { done: true, value: undefined }
    * ```
    *
+   * ---
+   *
    * @param values The value to pass to the next element, if required.
    *
    * @returns The result of the iteration, containing the value of the operation.
@@ -745,6 +885,9 @@ class u {
    * free the resources and perform any cleanup operation.  
    * It may also be used to signal the end or to compute a specific final result of the iteration process.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator<number>({
    *     _index: 0,
@@ -763,6 +906,8 @@ class u {
    * }
    * ```
    *
+   * ---
+   *
    * @param value The final value of the iterator.
    *
    * @returns The result of the iterator.
@@ -775,6 +920,9 @@ class u {
    * free the resources and perform any cleanup operation.  
    * It may also be used to signal that an error occurred during the iteration process or to handle it.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator<number>({
    *     _index: 0,
@@ -802,6 +950,8 @@ class u {
    * }
    * ```
    *
+   * ---
+   *
    * @param error The error to throw into the iterator.
    *
    * @returns The final result of the iterator.
@@ -823,6 +973,9 @@ class u {
    * This means that the original iterator won't be consumed until the
    * the new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator<number>([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
    * const result = iterator.groupBy<string>((value) => value % 2 === 0 ? "even" : "odd");
@@ -830,6 +983,8 @@ class u {
    * console.log(result.toObject()); // { odd: [1, 3, 5, 7, 9], even: [2, 4, 6, 8, 10] }
    * ```
    *
+   * ---
+   *
    * @template K The type of the keys used to group the elements.
    *
    * @param iteratee The key function to apply to each element of the iterator.
@@ -845,6 +1000,9 @@ class u {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartIterator(function* ()
    * {
@@ -855,6 +1013,8 @@ class u {
    * console.log(result); // [0, 1, 2, 3, 4]
    * ```
    *
+   * ---
+   *
    * @returns The {@link Array} containing all elements of the iterator.
    */
   toArray() {
@@ -864,16 +1024,16 @@ class u {
     return this;
   }
 }
-var me;
-me = Symbol.toStringTag;
-const _ = class _ {
+var we;
+we = Symbol.toStringTag;
+const p = class p {
   constructor(t) {
     /**
      * The internal {@link SmartIterator} object that holds the reduced elements.
      */
     a(this, "_elements");
-    a(this, me, "ReducedIterator");
-    this._elements = new u(t);
+    a(this, we, "ReducedIterator");
+    this._elements = new c(t);
   }
   /**
    * Determines whether all elements of the reduced iterator satisfy the given condition.
@@ -888,6 +1048,9 @@ const _ = class _ {
    *
    * If the iterator is infinite and every element satisfies the condition, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -897,6 +1060,8 @@ const _ = class _ {
    * console.log(results); // true
    * ```
    *
+   * ---
+   *
    * @param predicate The condition to check for each element of the iterator.
    *
    * @returns `true` if all elements satisfy the condition, `false` otherwise.
@@ -920,6 +1085,9 @@ const _ = class _ {
    *
    * If the iterator is infinite and no element satisfies the condition, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -929,6 +1097,8 @@ const _ = class _ {
    * console.log(results); // true
    * ```
    *
+   * ---
+   *
    * @param predicate The condition to check for each element of the iterator.
    *
    * @returns `true` if any element satisfies the condition, `false` otherwise.
@@ -941,7 +1111,7 @@ const _ = class _ {
   }
   filter(t) {
     const e = this._elements.enumerate();
-    return new _(function* () {
+    return new p(function* () {
       for (const [n, [s, r]] of e)
         t(s, r, n) && (yield [s, r]);
     });
@@ -959,6 +1129,9 @@ const _ = class _ {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -968,6 +1141,8 @@ const _ = class _ {
    * console.log(results.toObject()); // { odd: 8, even: 32 }
    * ```
    *
+   * ---
+   *
    * @template V The type of the elements after the transformation.
    *
    * @param iteratee The transformation function to apply to each element of the iterator.
@@ -976,7 +1151,7 @@ const _ = class _ {
    */
   map(t) {
     const e = this._elements.enumerate();
-    return new _(function* () {
+    return new p(function* () {
       for (const [n, [s, r]] of e)
         yield [s, t(s, r, n)];
     });
@@ -1006,6 +1181,9 @@ const _ = class _ {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -1015,6 +1193,8 @@ const _ = class _ {
    * console.log(results.toObject()); // { odd: [-3, -1, 3, 5], even: [0, 2, 6, 8] }
    * ```
    *
+   * ---
+   *
    * @template V The type of the elements after the transformation.
    *
    * @param iteratee The transformation function to apply to each element of the iterator.
@@ -1049,6 +1229,9 @@ const _ = class _ {
    * Only the dropped elements will be consumed in the process.  
    * The rest of the iterator will be consumed once the new iterator is.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -1057,14 +1240,16 @@ const _ = class _ {
    *
    * 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) {
     const e = this._elements.enumerate();
-    return new _(function* () {
+    return new p(function* () {
       for (const [n, [s, r]] of e)
         n >= t && (yield [s, r]);
     });
@@ -1084,6 +1269,9 @@ const _ = class _ {
    * Only the taken elements will be consumed from the original reduced iterator.  
    * The rest of the original reduced iterator will be available for further consumption.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const reduced = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -1095,13 +1283,15 @@ const _ = class _ {
    * console.log(reduced.toObject()); // { even: [0, 2, 6, 8] }
    * ```
    *
-   * @param count The number of elements to take.
+   * ---
+   *
+   * @param limit The number of elements to take.
    *
    * @returns A new {@link ReducedIterator} containing the taken elements.
    */
   take(t) {
     const e = this._elements.enumerate();
-    return new _(function* () {
+    return new p(function* () {
       for (const [n, [s, r]] of e) {
         if (n >= t)
           break;
@@ -1125,6 +1315,9 @@ const _ = class _ {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new ReducedIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -1134,6 +1327,8 @@ const _ = class _ {
    * console.log(results.toObject()); // [[0, 4], [1, 16]]
    * ```
    *
+   * ---
+   *
    * @returns A new {@link ReducedIterator} object containing the enumerated elements.
    */
   enumerate() {
@@ -1150,6 +1345,9 @@ const _ = class _ {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new ReducedIterator<number>([-3, -1, 0, 2, 3, 6, -3, -1, 1, 5, 6, 8, 7, 2])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -1163,7 +1361,7 @@ const _ = class _ {
    */
   unique() {
     const t = this._elements;
-    return new _(function* () {
+    return new p(function* () {
       const e = /* @__PURE__ */ new Set();
       for (const [n, s] of t)
         e.has(s) || (e.add(s), yield [n, s]);
@@ -1175,6 +1373,9 @@ const _ = class _ {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -1184,6 +1385,8 @@ const _ = class _ {
    * console.log(results); // 2
    * ```
    *
+   * ---
+   *
    * @returns The number of elements in the iterator.
    */
   count() {
@@ -1199,17 +1402,22 @@ const _ = class _ {
    * This method will consume the entire iterator in the process.  
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * 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"
    * });
    * ```
    *
+   * ---
+   *
    * @param iteratee The function to apply to each element of the reduced iterator.
    */
   forEach(t) {
@@ -1227,6 +1435,9 @@ const _ = class _ {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, -6, -8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -1236,6 +1447,8 @@ const _ = class _ {
    * console.log(results.toObject()); // { positive: 4, negative: -12 }
    * ```
    *
+   * ---
+   *
    * @template J The type of the new keys used to group the elements.
    *
    * @param iteratee The function to determine the new key of each element of the iterator.
@@ -1260,6 +1473,9 @@ const _ = class _ {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const keys = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -1269,11 +1485,13 @@ const _ = class _ {
    * console.log(keys.toArray()); // ["odd", "even"]
    * ```
    *
+   * ---
+   *
    * @returns A new {@link SmartIterator} containing all the keys of the iterator.
    */
   keys() {
     const t = this._elements;
-    return new u(function* () {
+    return new c(function* () {
       for (const [e] of t)
         yield e;
     });
@@ -1290,6 +1508,9 @@ const _ = class _ {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const entries = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -1299,6 +1520,8 @@ const _ = class _ {
    * console.log(entries.toArray()); // [["odd", 4], ["even", 16]]
    * ```
    *
+   * ---
+   *
    * @returns A new {@link SmartIterator} containing all the entries of the iterator.
    */
   entries() {
@@ -1315,6 +1538,9 @@ const _ = class _ {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const values = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -1324,11 +1550,13 @@ const _ = class _ {
    * console.log(values.toArray()); // [4, 16]
    * ```
    *
+   * ---
+   *
    * @returns A new {@link SmartIterator} containing all the values of the iterator.
    */
   values() {
     const t = this._elements;
-    return new u(function* () {
+    return new c(function* () {
       for (const [e, n] of t)
         yield n;
     });
@@ -1339,6 +1567,9 @@ const _ = class _ {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const reduced = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -1347,6 +1578,8 @@ const _ = class _ {
    * console.log(reduced.toArray()); // [4, 16]
    * ```
    *
+   * ---
+   *
    * @returns The {@link Array} containing all elements of the iterator.
    */
   toArray() {
@@ -1358,6 +1591,9 @@ const _ = class _ {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const reduced = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -1366,6 +1602,8 @@ const _ = class _ {
    * console.log(reduced.toMap()); // Map(2) { "odd" => 4, "even" => 16 }
    * ```
    *
+   * ---
+   *
    * @returns The {@link Map} containing all elements of the iterator.
    */
   toMap() {
@@ -1377,6 +1615,9 @@ const _ = class _ {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const reduced = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -1385,22 +1626,24 @@ const _ = class _ {
    * console.log(reduced.toObject()); // { odd: 4, even: 16 }
    * ```
    *
+   * ---
+   *
    * @returns The {@link Object} containing all elements of the iterator.
    */
   toObject() {
     return Object.fromEntries(this.entries());
   }
 };
-let h = _;
-var we;
-we = Symbol.toStringTag;
-const m = class m {
+let h = p;
+var me;
+me = Symbol.toStringTag;
+const w = class w {
   constructor(t) {
     /**
      * The internal {@link SmartAsyncIterator} object that holds the elements to aggregate.
      */
     a(this, "_elements");
-    a(this, we, "AggregatedAsyncIterator");
+    a(this, me, "AggregatedAsyncIterator");
     this._elements = new f(t);
   }
   /**
@@ -1416,6 +1659,9 @@ const m = class m {
    * object that will contain all the boolean results for each group.  
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartAsyncIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd")
@@ -1424,6 +1670,8 @@ const m = class m {
    * console.log(await results.toObject()); // { odd: false, even: true }
    * ```
    *
+   * ---
+   *
    * @param predicate The condition to check for each element of the iterator.
    *
    * @returns
@@ -1453,6 +1701,9 @@ const m = class m {
    * object that will contain all the boolean results for each group.  
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartAsyncIterator<number>([-5, -4, -3, -2, -1, 0])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd")
@@ -1461,6 +1712,8 @@ const m = class m {
    * console.log(await results.toObject()); // { odd: false, even: true }
    * ```
    *
+   * ---
+   *
    * @param predicate The condition to check for each element of the iterator.
    *
    * @returns
@@ -1479,7 +1732,7 @@ const m = class m {
   }
   filter(t) {
     const e = this._elements;
-    return new m(async function* () {
+    return new w(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of e) {
         const o = n.get(s) ?? 0;
@@ -1500,6 +1753,9 @@ const m = class m {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartAsyncIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd")
@@ -1508,6 +1764,8 @@ const m = class m {
    * console.log(await results.toObject()); // { odd: [3, 1, 3, 5], even: [0, 2, 6, 8] }
    * ```
    *
+   * ---
+   *
    * @template V The type of the elements after the transformation.
    *
    * @param iteratee The transformation function to apply to each element of the iterator.
@@ -1516,7 +1774,7 @@ const m = class m {
    */
   map(t) {
     const e = this._elements;
-    return new m(async function* () {
+    return new w(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of e) {
         const o = n.get(s) ?? 0;
@@ -1556,6 +1814,9 @@ const m = class m {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartAsyncIterator<number>([[-3, -1], 0, 2, 3, 5, [6, 8]])
    *      .groupBy(async (values) =>
@@ -1568,6 +1829,8 @@ const m = class m {
    * console.log(await results.toObject()); // { odd: [-3, -1, 3, 5], even: [0, 2, 6, 8] }
    * ```
    *
+   * ---
+   *
    * @template V The type of the elements after the transformation.
    *
    * @param iteratee The transformation function to apply to each element of the iterator.
@@ -1576,7 +1839,7 @@ const m = class m {
    */
   flatMap(t) {
     const e = this._elements;
-    return new m(async function* () {
+    return new w(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of e) {
         const o = n.get(s) ?? 0, l = await t(s, r, o);
@@ -1601,6 +1864,9 @@ const m = class m {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartAsyncIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd")
@@ -1609,13 +1875,15 @@ const m = class m {
    * console.log(await results.toObject()); // { odd: [3, 5], even: [6, 8] }
    * ```
    *
+   * ---
+   *
    * @param count The number of elements to drop from the beginning of each group.
    *
    * @returns A new {@link AggregatedAsyncIterator} containing the remaining elements.
    */
   drop(t) {
     const e = this._elements;
-    return new m(async function* () {
+    return new w(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of e) {
         const o = n.get(s) ?? 0;
@@ -1639,6 +1907,9 @@ const m = class m {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartAsyncIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd")
@@ -1647,13 +1918,15 @@ const m = class m {
    * console.log(await results.toObject()); // { odd: [-3, -1], even: [0, 2] }
    * ```
    *
-   * @param count The number of elements to take from the beginning of each group.
+   * ---
+   *
+   * @param limit The number of elements to take from the beginning of each group.
    *
    * @returns A new {@link AggregatedAsyncIterator} containing the taken elements.
    */
   take(t) {
     const e = this._elements;
-    return new m(async function* () {
+    return new w(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of e) {
         const o = n.get(s) ?? 0;
@@ -1683,6 +1956,9 @@ const m = class m {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartAsyncIterator<number>([-3, 0, 2, -1, 3])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd")
@@ -1691,6 +1967,8 @@ const m = class m {
    * console.log(results.toObject()); // { odd: [[0, -3], [1, -1], [2, 3]], even: [[0, 0], [1, 2]] }
    * ```
    *
+   * ---
+   *
    * @returns A new {@link AggregatedAsyncIterator} containing the enumerated elements.
    */
   enumerate() {
@@ -1707,6 +1985,9 @@ const m = class m {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartAsyncIterator<number>([-3, -1, 0, 2, 3, 6, -3, -1, 0, 5, 6, 8, 0, 2])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd")
@@ -1715,11 +1996,13 @@ const m = class m {
    * console.log(await results.toObject()); // { odd: [-3, -1, 3, 5], even: [0, 2, 6, 8] }
    * ```
    *
+   * ---
+   *
    * @returns A new {@link AggregatedAsyncIterator} containing only the unique elements.
    */
   unique() {
     const t = this._elements;
-    return new m(async function* () {
+    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();
@@ -1733,6 +2016,9 @@ const m = class m {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartAsyncIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd")
@@ -1741,6 +2027,8 @@ const m = class m {
    * console.log(await results.toObject()); // { odd: 4, even: 4 }
    * ```
    *
+   * ---
+   *
    * @returns
    * A {@link Promise} resolving to a new {@link ReducedIterator} containing the number of elements for each group.
    */
@@ -1762,6 +2050,9 @@ const m = class m {
    * This method will consume the entire iterator in the process.  
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const aggregator = new SmartAsyncIterator<number>([-3, 0, 2, -1, 3])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd");
@@ -1772,6 +2063,8 @@ const m = class m {
    * };
    * ```
    *
+   * ---
+   *
    * @param iteratee The function to execute for each element of the iterator.
    *
    * @returns A {@link Promise} that will resolve once the iteration is complete.
@@ -1794,6 +2087,9 @@ const m = class m {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartAsyncIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd")
@@ -1803,6 +2099,8 @@ const m = class m {
    * console.log(await results.toObject()); // { "+": [1, 0, 3, 6], "-": [-3, -2, -5, -8] }
    * ```
    *
+   * ---
+   *
    * @template J The type of the new key.
    *
    * @param iteratee The function to determine the new key for each element of the iterator.
@@ -1811,7 +2109,7 @@ const m = class m {
    */
   reorganizeBy(t) {
     const e = this._elements;
-    return new m(async function* () {
+    return new w(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of e) {
         const o = n.get(s) ?? 0;
@@ -1830,6 +2128,9 @@ const m = class m {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const keys = new SmartAsyncIterator([-3, Symbol(), "A", { }, null, [1 , 2, 3], false])
    *     .groupBy(async (value) => typeof value)
@@ -1838,6 +2139,8 @@ const m = class m {
    * console.log(await keys.toArray()); // ["number", "symbol", "string", "object", "boolean"]
    * ```
    *
+   * ---
+   *
    * @returns A new {@link SmartAsyncIterator} containing all the keys of the iterator.
    */
   keys() {
@@ -1860,6 +2163,9 @@ const m = class m {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const entries = new SmartAsyncIterator<number>([-3, 0, 2, -1, 3])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd")
@@ -1868,6 +2174,8 @@ const m = class m {
    * console.log(await entries.toArray()); // [["odd", -3], ["even", 0], ["even", 2], ["odd", -1], ["odd", 3]]
    * ```
    *
+   * ---
+   *
    * @returns A new {@link SmartAsyncIterator} containing all the entries of the iterator.
    */
   entries() {
@@ -1884,6 +2192,9 @@ const m = class m {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const values = new SmartAsyncIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd")
@@ -1892,6 +2203,8 @@ const m = class m {
    * console.log(await values.toArray()); // [-3, -1, 0, 2, 3, 5, 6, 8]
    * ```
    *
+   * ---
+   *
    * @returns A new {@link SmartAsyncIterator} containing all the values of the iterator.
    */
   values() {
@@ -1907,6 +2220,9 @@ const m = class m {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const aggregator = new SmartAsyncIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd");
@@ -1914,6 +2230,8 @@ const m = class m {
    * console.log(await aggregator.toArray()); // [[-3, -1, 3, 5], [0, 2, 6, 8]]
    * ```
    *
+   * ---
+   *
    * @returns A {@link Promise} resolving to an {@link Array} containing all the values of the iterator.
    */
   async toArray() {
@@ -1926,6 +2244,9 @@ const m = class m {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const aggregator = new SmartAsyncIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd");
@@ -1933,6 +2254,8 @@ const m = class m {
    * console.log(await aggregator.toMap()); // Map(2) { "odd" => [-3, -1, 3, 5], "even" => [0, 2, 6, 8] }
    * ```
    *
+   * ---
+   *
    * @returns A {@link Promise} resolving to a {@link Map} containing all the entries of the iterator.
    */
   async toMap() {
@@ -1949,6 +2272,9 @@ const m = class m {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const aggregator = new SmartAsyncIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy(async (value) => value % 2 === 0 ? "even" : "odd");
@@ -1956,6 +2282,8 @@ const m = class m {
    * console.log(await aggregator.toObject()); // { odd: [-3, -1, 3, 5], even: [0, 2, 6, 8] }
    * ```
    *
+   * ---
+   *
    * @returns A {@link Promise} resolving to an object containing all the entries of the iterator.
    */
   async toObject() {
@@ -1967,7 +2295,7 @@ const m = class m {
     return t;
   }
 };
-let T = m;
+let T = w;
 var ye;
 class f {
   constructor(t) {
@@ -2023,6 +2351,9 @@ class f {
    *
    * If the iterator is infinite and every element satisfies the condition, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator<number>([-2, -1, 0, 1, 2]);
    * const result = await iterator.every(async (value) => value < 0);
@@ -2030,6 +2361,8 @@ class f {
    * console.log(result); // false
    * ```
    *
+   * ---
+   *
    * @param predicate The condition to check for each element of the iterator.
    *
    * @returns
@@ -2059,6 +2392,9 @@ class f {
    *
    * If the iterator is infinite and no element satisfies the condition, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator<number>([-2, -1, 0, 1, 2]);
    * const result = await iterator.some(async (value) => value > 0);
@@ -2066,6 +2402,8 @@ class f {
    * console.log(result); // true
    * ```
    *
+   * ---
+   *
    * @param predicate The condition to check for each element of the iterator.
    *
    * @returns
@@ -2107,6 +2445,9 @@ class f {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator<number>([-2, -1, 0, 1, 2]);
    * const result = iterator.map(async (value) => Math.abs(value));
@@ -2114,6 +2455,8 @@ class f {
    * console.log(await result.toArray()); // [2, 1, 0, 1, 2]
    * ```
    *
+   * ---
+   *
    * @template V The type of the elements after the transformation.
    *
    * @param iteratee The transformation function to apply to each element of the iterator.
@@ -2160,6 +2503,9 @@ class f {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator<number[]>([[-2, -1], 0, 1, 2, [3, 4, 5]]);
    * const result = iterator.flatMap(async (value) => value);
@@ -2167,6 +2513,8 @@ class f {
    * console.log(await result.toArray()); // [-2, -1, 0, 1, 2, 3, 4, 5]
    * ```
    *
+   * ---
+   *
    * @template V The type of the elements after the transformation.
    *
    * @param iteratee The transformation function to apply to each element of the iterator.
@@ -2206,6 +2554,9 @@ class f {
    * Only the dropped elements will be consumed in the process.  
    * The rest of the iterator will be consumed only once the new one is.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator<number>([-2, -1, 0, 1, 2]);
    * const result = iterator.drop(3);
@@ -2213,6 +2564,8 @@ class f {
    * console.log(await result.toArray()); // [1, 2]
    * ```
    *
+   * ---
+   *
    * @param count The number of elements to drop.
    *
    * @returns A new {@link SmartAsyncIterator} containing the remaining elements.
@@ -2249,6 +2602,9 @@ class f {
    * Only the taken elements will be consumed from the original iterator.  
    * The rest of the original iterator will be available for further consumption.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator<number>([-2, -1, 0, 1, 2]);
    * const result = iterator.take(3);
@@ -2257,6 +2613,8 @@ class f {
    * console.log(await iterator.toArray()); // [1, 2]
    * ```
    *
+   * ---
+   *
    * @param limit The number of elements to take.
    *
    * @returns A new {@link SmartAsyncIterator} containing the taken elements.
@@ -2295,6 +2653,9 @@ class f {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator<string>(["A", "M", "N", "Z"]);
    * const result = iterator.enumerate();
@@ -2305,6 +2666,8 @@ class f {
    * }
    * ```
    *
+   * ---
+   *
    * @returns A new {@link SmartAsyncIterator} containing the enumerated elements.
    */
   enumerate() {
@@ -2321,6 +2684,9 @@ class f {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator<number>([1, 1, 2, 3, 2, 3, 4, 5, 5, 4]);
    * const result = iterator.unique();
@@ -2328,6 +2694,8 @@ class f {
    * console.log(await result.toArray()); // [1, 2, 3, 4, 5]
    * ```
    *
+   * ---
+   *
    * @returns A new {@link SmartAsyncIterator} containing only the unique elements.
    */
   unique() {
@@ -2348,6 +2716,9 @@ class f {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator<number>([1, 2, 3, 4, 5]);
    * const result = await iterator.count();
@@ -2355,6 +2726,8 @@ class f {
    * console.log(result); // 5
    * ```
    *
+   * ---
+   *
    * @returns A {@link Promise} that will resolve to the number of elements in the iterator.
    */
   async count() {
@@ -2372,6 +2745,9 @@ class f {
    * This method will consume the entire iterator in the process.  
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator<number>(["A", "M", "N", "Z"]);
    * await iterator.forEach(async (value, index) =>
@@ -2380,6 +2756,8 @@ class f {
    * }
    * ```
    *
+   * ---
+   *
    * @param iteratee The function to apply to each element of the iterator.
    *
    * @returns A {@link Promise} that will resolve once the iteration is complete.
@@ -2399,6 +2777,9 @@ class f {
    *
    * Once the iterator is done, the method will return an object with the `done` property set to `true`.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator<number>([1, 2, 3, 4, 5]);
    *
@@ -2413,6 +2794,8 @@ class f {
    * console.log(result); // { done: true, value: undefined }
    * ```
    *
+   * ---
+   *
    * @param values The value to pass to the next element, if required.
    *
    * @returns
@@ -2426,6 +2809,9 @@ class f {
    * free the resources and perform any cleanup operation.  
    * It may also be used to signal the end or to compute a specific final result of the iteration process.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator<number>({
    *     _index: 0,
@@ -2444,6 +2830,8 @@ class f {
    * }
    * ```
    *
+   * ---
+   *
    * @param value The final value of the iterator.
    *
    * @returns A {@link Promise} that will resolve to the final result of the iterator.
@@ -2457,6 +2845,9 @@ class f {
    * free the resources and perform any cleanup operation.  
    * It may also be used to signal that an error occurred during the iteration process or to handle it.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator<number>({
    *     _index: 0,
@@ -2484,6 +2875,8 @@ class f {
    * }
    * ```
    *
+   * ---
+   *
    * @param error The error to throw into the iterator.
    *
    * @returns A {@link Promise} that will resolve to the final result of the iterator.
@@ -2505,6 +2898,9 @@ class f {
    * This means that the original iterator won't be consumed until the
    * the new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator<number>([1, 2, 3, 4, 5, 6, 7, 8, 9, 10]);
    * const result = iterator.groupBy<string>(async (value) => value % 2 === 0 ? "even" : "odd");
@@ -2512,6 +2908,8 @@ class f {
    * console.log(await result.toObject()); // { odd: [1, 3, 5, 7, 9], even: [2, 4, 6, 8, 10] }
    * ```
    *
+   * ---
+   *
    * @template K The type of the keys used to group the elements.
    *
    * @param iteratee The key function to apply to each element of the iterator.
@@ -2527,6 +2925,9 @@ class f {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const iterator = new SmartAsyncIterator(async function* ()
    * {
@@ -2537,6 +2938,8 @@ class f {
    * console.log(result); // [0, 1, 2, 3, 4]
    * ```
    *
+   * ---
+   *
    * @returns A {@link Promise} that will resolve to an array containing all elements of the iterator.
    */
   toArray() {
@@ -2548,14 +2951,14 @@ class f {
 }
 var _e;
 _e = Symbol.toStringTag;
-const w = class w {
+const m = class m {
   constructor(t) {
     /**
      * The internal {@link SmartIterator} object that holds the elements to aggregate.
      */
     a(this, "_elements");
     a(this, _e, "AggregatedIterator");
-    this._elements = new u(t);
+    this._elements = new c(t);
   }
   /**
    * Determines whether all elements of each group of the iterator satisfy a given condition.
@@ -2570,6 +2973,9 @@ const w = class w {
    * object that will contain all the boolean results for each group.  
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -2578,6 +2984,8 @@ const w = class w {
    * console.log(results.toObject()); // { odd: false, even: true }
    * ```
    *
+   * ---
+   *
    * @param predicate The condition to check for each element of the iterator.
    *
    * @returns A new {@link ReducedIterator} containing the boolean results for each group.
@@ -2606,6 +3014,9 @@ const w = class w {
    * object that will contain all the boolean results for each group.  
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-5, -4, -3, -2, -1, 0])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -2614,6 +3025,8 @@ const w = class w {
    * console.log(results.toObject()); // { odd: false, even: true }
    * ```
    *
+   * ---
+   *
    * @param predicate The condition to check for each element of the iterator.
    *
    * @returns A {@link ReducedIterator} containing the boolean results for each group.
@@ -2631,7 +3044,7 @@ const w = class w {
   }
   filter(t) {
     const e = this._elements;
-    return new w(function* () {
+    return new m(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of e) {
         const o = n.get(s) ?? 0;
@@ -2652,6 +3065,9 @@ const w = class w {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -2660,6 +3076,8 @@ const w = class w {
    * console.log(results.toObject()); // { odd: [3, 1, 3, 5], even: [0, 2, 6, 8] }
    * ```
    *
+   * ---
+   *
    * @template V The type of the elements after the transformation.
    *
    * @param iteratee The transformation function to apply to each element of the iterator.
@@ -2668,7 +3086,7 @@ const w = class w {
    */
   map(t) {
     const e = this._elements;
-    return new w(function* () {
+    return new m(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of e) {
         const o = n.get(s) ?? 0;
@@ -2708,6 +3126,9 @@ const w = class w {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number[]>([[-3, -1], 0, 2, 3, 5, [6, 8]])
    *      .groupBy((values) =>
@@ -2720,6 +3141,8 @@ const w = class w {
    * console.log(results.toObject()); // { odd: [-3, -1, 3, 5], even: [0, 2, 6, 8] }
    * ```
    *
+   * ---
+   *
    * @template V The type of the elements after the transformation.
    *
    * @param iteratee The transformation function to apply to each element of the iterator.
@@ -2728,7 +3151,7 @@ const w = class w {
    */
   flatMap(t) {
     const e = this._elements;
-    return new w(function* () {
+    return new m(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of e) {
         const o = n.get(s) ?? 0, l = t(s, r, o);
@@ -2753,6 +3176,9 @@ const w = class w {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -2761,13 +3187,15 @@ const w = class w {
    * console.log(results.toObject()); // { odd: [3, 5], even: [6, 8] }
    * ```
    *
+   * ---
+   *
    * @param count The number of elements to drop from the beginning of each group.
    *
    * @returns A new {@link AggregatedIterator} containing the remaining elements.
    */
   drop(t) {
     const e = this._elements;
-    return new w(function* () {
+    return new m(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of e) {
         const o = n.get(s) ?? 0;
@@ -2791,6 +3219,9 @@ const w = class w {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -2799,13 +3230,15 @@ const w = class w {
    * console.log(results.toObject()); // { odd: [-3, -1], even: [0, 2] }
    * ```
    *
-   * @param count The number of elements to take from the beginning of each group.
+   * ---
+   *
+   * @param limit The number of elements to take from the beginning of each group.
    *
    * @returns A new {@link AggregatedIterator} containing the taken elements.
    */
   take(t) {
     const e = this._elements;
-    return new w(function* () {
+    return new m(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of e) {
         const o = n.get(s) ?? 0;
@@ -2835,6 +3268,9 @@ const w = class w {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, 0, 2, -1, 3])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -2843,6 +3279,8 @@ const w = class w {
    * console.log(results.toObject()); // { odd: [[0, -3], [1, -1], [2, 3]], even: [[0, 0], [1, 2]] }
    * ```
    *
+   * ---
+   *
    * @returns A new {@link AggregatedIterator} containing the enumerated elements.
    */
   enumerate() {
@@ -2859,6 +3297,9 @@ const w = class w {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, -1, 0, 2, 3, 6, -3, -1, 0, 5, 6, 8, 0, 2])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -2867,11 +3308,13 @@ const w = class w {
    * console.log(results.toObject()); // { odd: [-3, -1, 3, 5], even: [0, 2, 6, 8] }
    * ```
    *
+   * ---
+   *
    * @returns A new {@link AggregatedIterator} containing only the unique elements.
    */
   unique() {
     const t = this._elements;
-    return new w(function* () {
+    return new m(function* () {
       const e = /* @__PURE__ */ new Map();
       for (const [n, s] of t) {
         const r = e.get(n) ?? /* @__PURE__ */ new Set();
@@ -2885,6 +3328,9 @@ const w = class w {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -2893,6 +3339,8 @@ const w = class w {
    * console.log(results.toObject()); // { odd: 4, even: 4 }
    * ```
    *
+   * ---
+   *
    * @returns A new {@link ReducedIterator} containing the number of elements for each group.
    */
   count() {
@@ -2913,6 +3361,9 @@ const w = class w {
    * This method will consume the entire iterator in the process.  
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const aggregator = new SmartIterator<number>([-3, 0, 2, -1, 3])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd");
@@ -2923,6 +3374,8 @@ const w = class w {
    * };
    * ```
    *
+   * ---
+   *
    * @param iteratee The function to execute for each element of the iterator.
    */
   forEach(t) {
@@ -2943,6 +3396,9 @@ const w = class w {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const results = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -2952,6 +3408,8 @@ const w = class w {
    * console.log(results.toObject()); // { "+": [1, 0, 3, 6], "-": [-3, -2, -5, -8] }
    * ```
    *
+   * ---
+   *
    * @template J The type of the new key.
    *
    * @param iteratee The function to determine the new key for each element of the iterator.
@@ -2960,7 +3418,7 @@ const w = class w {
    */
   reorganizeBy(t) {
     const e = this._elements;
-    return new w(function* () {
+    return new m(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of e) {
         const o = n.get(s) ?? 0;
@@ -2979,6 +3437,9 @@ const w = class w {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const keys = new SmartIterator([-3, Symbol(), "A", { }, null, [1 , 2, 3], false])
    *     .groupBy((value) => typeof value)
@@ -2987,11 +3448,13 @@ const w = class w {
    * console.log(keys.toArray()); // ["number", "symbol", "string", "object", "boolean"]
    * ```
    *
+   * ---
+   *
    * @returns A new {@link SmartIterator} containing all the keys of the iterator.
    */
   keys() {
     const t = this._elements;
-    return new u(function* () {
+    return new c(function* () {
       const e = /* @__PURE__ */ new Set();
       for (const [n] of t)
         e.has(n) || (e.add(n), yield n);
@@ -3009,6 +3472,9 @@ const w = class w {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const entries = new SmartIterator<number>([-3, 0, 2, -1, 3])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -3017,6 +3483,8 @@ const w = class w {
    * console.log(entries.toArray()); // [["odd", -3], ["even", 0], ["even", 2], ["odd", -1], ["odd", 3]]
    * ```
    *
+   * ---
+   *
    * @returns A new {@link SmartIterator} containing all the entries of the iterator.
    */
   entries() {
@@ -3033,6 +3501,9 @@ const w = class w {
    * This means that the original iterator won't be consumed until the
    * new one is and that consuming one of them will consume the other as well.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const values = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd")
@@ -3041,11 +3512,13 @@ const w = class w {
    * console.log(values.toArray()); // [-3, -1, 0, 2, 3, 5, 6, 8]
    * ```
    *
+   * ---
+   *
    * @returns A new {@link SmartIterator} containing all the values of the iterator.
    */
   values() {
     const t = this._elements;
-    return new u(function* () {
+    return new c(function* () {
       for (const [e, n] of t)
         yield n;
     });
@@ -3056,6 +3529,9 @@ const w = class w {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const aggregator = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd");
@@ -3063,6 +3539,8 @@ const w = class w {
    * console.log(aggregator.toArray()); // [[-3, -1, 3, 5], [0, 2, 6, 8]]
    * ```
    *
+   * ---
+   *
    * @returns An {@link Array} of arrays containing the elements of the iterator.
    */
   toArray() {
@@ -3075,6 +3553,9 @@ const w = class w {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const aggregator = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd");
@@ -3082,6 +3563,8 @@ const w = class w {
    * console.log(aggregator.toMap()); // Map(2) { "odd" => [-3, -1, 3, 5], "even" => [0, 2, 6, 8] }
    * ```
    *
+   * ---
+   *
    * @returns A {@link Map} containing the elements of the iterator.
    */
   toMap() {
@@ -3098,6 +3581,9 @@ const w = class w {
    *
    * If the iterator is infinite, the method will never return.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const aggregator = new SmartIterator<number>([-3, -1, 0, 2, 3, 5, 6, 8])
    *     .groupBy((value) => value % 2 === 0 ? "even" : "odd");
@@ -3105,6 +3591,8 @@ const w = class w {
    * console.log(aggregator.toObject()); // { odd: [-3, -1, 3, 5], even: [0, 2, 6, 8] }
    * ```
    *
+   * ---
+   *
    * @returns An {@link Object} containing the elements of the iterator.
    */
   toObject() {
@@ -3116,7 +3604,7 @@ const w = class w {
     return t;
   }
 };
-let g = w;
+let g = m;
 const Le = Function;
 var pe, be;
 class Ge extends (be = Le, pe = Symbol.toStringTag, be) {
@@ -3136,6 +3624,9 @@ class E {
   /**
    * Initializes a new instance of the {@link Publisher} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const publisher = new Publisher();
    * ```
@@ -3154,6 +3645,9 @@ class E {
   /**
    * Unsubscribes all the subscribers from all the events.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * publisher.subscribe("player:spawn", (evt) => { [...] });
    * publisher.subscribe("player:move", (coords) => { [...] });
@@ -3174,6 +3668,9 @@ class E {
   /**
    * Publishes an event to all the subscribers.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * publisher.subscribe("player:move", (coords) => { [...] });
    * publisher.subscribe("player:move", ({ x, y }) => { [...] });
@@ -3182,6 +3679,8 @@ class E {
    * publisher.publish("player:move", { x: 10, y: 20 });
    * ```
    *
+   * ---
+   *
    * @template K The key of the map containing the callback signature to publish.
    *
    * @param event The name of the event to publish.
@@ -3196,6 +3695,9 @@ class E {
   /**
    * Subscribes a new subscriber to an event.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * let unsubscribe: () => void;
    * publisher.subscribe("player:death", unsubscribe);
@@ -3205,6 +3707,8 @@ 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.
@@ -3225,6 +3729,9 @@ class E {
   /**
    * Unsubscribes a subscriber from an event.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const onPlayerMove = ({ x, y }: Point) => { [...] };
    *
@@ -3232,6 +3739,8 @@ class E {
    * publisher.subscribe("player:death", () => publisher.unsubscribe("player:move", onPlayerMove));
    * ```
    *
+   * ---
+   *
    * @template K The key of the map containing the callback signature to unsubscribe.
    *
    * @param event The name of the event to unsubscribe from.
@@ -3247,21 +3756,11 @@ class E {
     n.splice(s, 1);
   }
 }
+const Ke = () => {
+};
 var ge, ve;
-class rt extends (ve = Ge, ge = Symbol.toStringTag, ve) {
-  /**
-   * Initializes a new instance of the {@link SwitchableCallback} class.
-   *
-   * ```ts
-   * const onPointerMove = new SwitchableCallback<(evt: PointerEvent) => void>();
-   * ```
-   */
-  constructor() {
-    const e = () => {
-      throw new Be(
-        "The `SwitchableCallback` has no callback defined yet. Did you forget to call the `register` method?"
-      );
-    };
+class it extends (ve = Ge, ge = Symbol.toStringTag, ve) {
+  constructor(e, n = "default") {
     super();
     /**
      * The currently selected implementation of the callback.
@@ -3294,7 +3793,11 @@ class rt extends (ve = Ge, ge = Symbol.toStringTag, ve) {
      */
     a(this, "_invoke");
     a(this, ge, "SwitchableCallback");
-    this._callback = e, this._callbacks = /* @__PURE__ */ new Map(), this._isEnabled = !0, this._key = "", this._invoke = (...n) => this._callback(...n);
+    this._callbacks = /* @__PURE__ */ new Map(), this._isEnabled = !0, e ? this._callbacks.set(n, e) : (n = "", e = () => {
+      throw new Be(
+        "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);
   }
   /**
    * A flag indicating whether the callback is enabled or not.
@@ -3316,27 +3819,46 @@ class rt extends (ve = Ge, ge = Symbol.toStringTag, ve) {
    *
    * Also note that:
    * - If any implementation has been registered yet, a {@link KeyException} will be thrown.  
+   * - If any key is given and it doesn't have any associated
+   * implementation yet, a {@link KeyException} will be thrown.
    * - If the callback is already enabled, a {@link RuntimeException} will be thrown.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * 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() {
-    if (!this._key)
-      throw new b(
-        "The `SwitchableCallback` has no callback defined yet. Did you forget to call the `register` method?"
-      );
+  enable(e) {
+    if (e === void 0) {
+      if (!this._key)
+        throw new _(
+          "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.");
     if (this._isEnabled)
       throw new y("The `SwitchableCallback` is already enabled.");
-    this._callback = this._callbacks.get(this._key), this._isEnabled = !0;
+    this._callback = this._callbacks.get(e), this._isEnabled = !0;
   }
   /**
    * Disables the callback, allowing it to be invoked without executing any implementation.
    *
    * If the callback is already disabled, a {@link RuntimeException} will be thrown.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * window.addEventListener("pointermove", onPointerMove);
    * window.addEventListener("pointerup", () => { onPointerMove.disable(); });
@@ -3345,8 +3867,7 @@ class rt extends (ve = Ge, ge = Symbol.toStringTag, ve) {
   disable() {
     if (!this._isEnabled)
       throw new y("The `SwitchableCallback` is already disabled.");
-    this._callback = () => {
-    }, this._isEnabled = !1;
+    this._callback = Ke, this._isEnabled = !1;
   }
   /**
    * Registers a new implementation for the callback.
@@ -3355,11 +3876,16 @@ class rt extends (ve = Ge, ge = Symbol.toStringTag, ve) {
    * - If the callback has no other implementation registered yet, this one will be selected as default.
    * - If the key has already been used for another implementation, a {@link KeyException} will be thrown.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * onPointerMove.register("pressed", () => { [...] });
    * onPointerMove.register("released", () => { [...] });
    * ```
    *
+   * ---
+   *
    * @param key The key that will be associated with the implementation.
    * @param callback The implementation to register.
    */
@@ -3367,7 +3893,7 @@ class rt extends (ve = Ge, ge = Symbol.toStringTag, ve) {
     if (this._callbacks.size === 0)
       this._key = e, this._callback = n;
     else if (this._callbacks.has(e))
-      throw new b(`The key '${e}' has already been used for another callback.`);
+      throw new _(`The key '${e}' has already been used for another callback.`);
     this._callbacks.set(e, n);
   }
   /**
@@ -3377,17 +3903,22 @@ class rt extends (ve = Ge, ge = Symbol.toStringTag, ve) {
    * - If the key is the currently selected implementation, a {@link KeyException} will be thrown.
    * - If the key has no associated implementation yet, a {@link KeyException} will be thrown.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * onPointerMove.unregister("released");
    * ```
    *
+   * ---
+   *
    * @param key The key that is associated with the implementation to unregister.
    */
   unregister(e) {
     if (this._key === e)
-      throw new b("Unable to unregister the currently selected callback.");
+      throw new _("Unable to unregister the currently selected callback.");
     if (!this._callbacks.has(e))
-      throw new b(`The key '${e}' doesn't yet have any associated callback.`);
+      throw new _(`The key '${e}' doesn't yet have any associated callback.`);
     this._callbacks.delete(e);
   }
   /**
@@ -3395,31 +3926,41 @@ class rt extends (ve = Ge, ge = Symbol.toStringTag, ve) {
    *
    * If the key has no associated implementation yet, a {@link KeyException} will be thrown.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * window.addEventListener("pointerdown", () => { onPointerMove.switch("pressed"); });
    * window.addEventListener("pointermove", onPointerMove);
    * window.addEventListener("pointerup", () => { onPointerMove.switch("released"); });
    * ```
    *
+   * ---
+   *
    * @param key The key that is associated with the implementation to switch to.
    */
   switch(e) {
     if (!this._callbacks.has(e))
-      throw new b(`The key '${e}' doesn't yet have any associated callback.`);
-    this._key = e, this._isEnabled && (this._callback = this._callbacks.get(e));
+      throw new _(`The key '${e}' doesn't yet have any associated callback.`);
+    this._key !== e && (this._key = e, this._isEnabled && (this._callback = this._callbacks.get(e)));
   }
 }
 var ke;
 ke = Symbol.toStringTag;
-class it {
+class ot {
   /**
    * Initializes a new instance of the {@link JSONStorage} class.  
    * It cannot be instantiated outside of a browser environment or an {@link EnvironmentException} is thrown.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const jsonStorage = new JSONStorage();
    * ```
    *
+   * ---
+   *
    * @param preferPersistence
    * 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.
@@ -3479,6 +4020,9 @@ class it {
   /**
    * Checks whether the value with the specified key exists within the default storage.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * if (jsonStorage.has("key"))
    * {
@@ -3486,6 +4030,8 @@ class it {
    * }
    * ```
    *
+   * ---
+   *
    * @param key The key of the value to check.
    * @param persistent
    * Whether to prefer the persistent {@link localStorage} over the volatile {@link sessionStorage}.  
@@ -3499,6 +4045,9 @@ class it {
   /**
    * Checks whether the value with the specified key exists within the volatile {@link sessionStorage}.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * if (jsonStorage.knows("key"))
    * {
@@ -3506,6 +4055,8 @@ class it {
    * }
    * ```
    *
+   * ---
+   *
    * @param key The key of the value to check.
    *
    * @returns `true` if the key exists, `false` otherwise.
@@ -3517,6 +4068,9 @@ class it {
    * Checks whether the value with the specified key exists looking first in the
    * volatile {@link sessionStorage} and then, if not found, in the persistent {@link localStorage}.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * if (jsonStorage.find("key"))
    * {
@@ -3524,6 +4078,8 @@ class it {
    * }
    * ```
    *
+   * ---
+   *
    * @param key The key of the value to check.
    *
    * @returns `true` if the key exists, `false` otherwise.
@@ -3534,6 +4090,9 @@ class it {
   /**
    * Checks whether the value with the specified key exists within the persistent {@link localStorage}.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * if (jsonStorage.exists("key"))
    * {
@@ -3541,6 +4100,8 @@ class it {
    * }
    * ```
    *
+   * ---
+   *
    * @param key The key of the value to check.
    *
    * @returns `true` if the key exists, `false` otherwise.
@@ -3552,12 +4113,17 @@ class it {
    * Sets the value with the specified key in the default storage.  
    * If the value is `undefined` or omitted, the key is removed from the storage.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * jsonStorage.set("key");
    * jsonStorage.set("key", value);
    * jsonStorage.set("key", obj?.value);
    * ```
    *
+   * ---
+   *
    * @template T The type of the value to set.
    *
    * @param key The key of the value to set.
@@ -3574,12 +4140,17 @@ class it {
    * Sets the value with the specified key in the volatile {@link sessionStorage}.  
    * If the value is `undefined` or omitted, the key is removed from the storage.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * jsonStorage.remember("key");
    * jsonStorage.remember("key", value);
    * jsonStorage.remember("key", obj?.value);
    * ```
    *
+   * ---
+   *
    * @template T The type of the value to set.
    *
    * @param key The key of the value to set.
@@ -3592,12 +4163,17 @@ class it {
    * Sets the value with the specified key in the persistent {@link localStorage}.  
    * If the value is `undefined` or omitted, the key is removed from the storage.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * jsonStorage.write("key");
    * jsonStorage.write("key", value);
    * jsonStorage.write("key", obj?.value);
    * ```
    *
+   * ---
+   *
    * @template T The type of the value to set.
    *
    * @param key The key of the value to set.
@@ -3609,10 +4185,15 @@ class it {
   /**
    * Removes the value with the specified key from the default storage.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * jsonStorage.delete("key");
    * ```
    *
+   * ---
+   *
    * @param key The key of the value to remove.
    * @param persistent
    * Whether to prefer the persistent {@link localStorage} over the volatile {@link sessionStorage}.  
@@ -3624,10 +4205,15 @@ class it {
   /**
    * Removes the value with the specified key from the volatile {@link sessionStorage}.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * jsonStorage.forget("key");
    * ```
    *
+   * ---
+   *
    * @param key The key of the value to remove.
    */
   forget(t) {
@@ -3636,10 +4222,15 @@ class it {
   /**
    * Removes the value with the specified key from the persistent {@link localStorage}.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * jsonStorage.erase("key");
    * ```
    *
+   * ---
+   *
    * @param key The key of the value to remove.
    */
   erase(t) {
@@ -3649,10 +4240,15 @@ class it {
    * Removes the value with the specified key from both the
    * volatile {@link sessionStorage} and the persistent {@link localStorage}.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * jsonStorage.clear("key");
    * ```
    *
+   * ---
+   *
    * @param key The key of the value to remove.
    */
   clear(t) {
@@ -3665,6 +4261,9 @@ const R = class R {
   /**
    * Initializes a new instance of the {@link SmartPromise} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const promise = new SmartPromise<string>((resolve, reject) =>
    * {
@@ -3672,6 +4271,8 @@ const R = class R {
    * });
    * ```
    *
+   * ---
+   *
    * @param executor
    * The function responsible for eventually resolving or rejecting the promise.  
    * Similarly to the native {@link Promise} object, it's immediately executed after the promise is created.
@@ -3712,6 +4313,9 @@ const R = class R {
   /**
    * Wraps a new {@link SmartPromise} object around an existing native {@link Promise} object.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const request = fetch("https://api.example.com/data");
    * const smartRequest = SmartPromise.FromPromise(request);
@@ -3723,6 +4327,8 @@ const R = class R {
    * console.log(smartRequest.isFulfilled); // true
    * ```
    *
+   * ---
+   *
    * @param promise The promise to wrap.
    *
    * @returns A new {@link SmartPromise} object that wraps the provided promise.
@@ -3757,6 +4363,9 @@ const R = class R {
   /**
    * Attaches a callback that executes right after the promise is settled, regardless of the outcome.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const promise = new SmartPromise((resolve, reject) =>
    * {
@@ -3771,6 +4380,8 @@ const R = class R {
    *     .finally(() => console.log("Done!")); // Always logs "Done!".
    * ```
    *
+   * ---
+   *
    * @param onFinally The callback to execute when once promise is settled.
    *
    * @returns A new {@link Promise} that executes the callback once the promise is settled.
@@ -3781,14 +4392,19 @@ const R = class R {
 };
 let k = R;
 var Te, Ee;
-class Ke extends (Ee = k, Te = Symbol.toStringTag, Ee) {
+class He extends (Ee = k, Te = Symbol.toStringTag, Ee) {
   /**
    * Initializes a new instance of the {@link DeferredPromise} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const promise = new DeferredPromise<string, string[]>((value: string) => value.split(" "));
    * ```
    *
+   * ---
+   *
    * @param onFulfilled The callback to execute once the promise is fulfilled.
    * @param onRejected The callback to execute once the promise is rejected.
    */
@@ -3829,6 +4445,9 @@ class Ke extends (Ee = k, Te = Symbol.toStringTag, Ee) {
   /**
    * Watches another promise and resolves or rejects this promise when the other one is settled.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const promise = new Promise<string>((resolve) => setTimeout(() => resolve("Hello, World!"), 1_000));
    * const deferred = new DeferredPromise<string, string[]>((value: string) => value.split(" "));
@@ -3837,6 +4456,8 @@ class Ke extends (Ee = k, Te = Symbol.toStringTag, Ee) {
    * deferred.watch(promise);
    * ```
    *
+   * ---
+   *
    * @param otherPromise The promise to watch.
    *
    * @returns The current instance of the {@link DeferredPromise} class.
@@ -3846,10 +4467,13 @@ class Ke extends (Ee = k, Te = Symbol.toStringTag, Ee) {
   }
 }
 var Me, Re;
-class ot extends (Re = k, Me = Symbol.toStringTag, Re) {
+class at extends (Re = k, Me = Symbol.toStringTag, Re) {
   /**
    * Initializes a new instance of the {@link TimedPromise} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const promise = new TimedPromise<string>((resolve, reject) =>
    * {
@@ -3858,6 +4482,8 @@ class ot extends (Re = k, Me = Symbol.toStringTag, Re) {
    * }, 5_000);
    * ```
    *
+   * ---
+   *
    * @param executor
    * The function responsible for eventually resolving or rejecting the promise.  
    * Similarly to the native {@link Promise} object, it's immediately executed after the promise is created.
@@ -3876,28 +4502,28 @@ class ot extends (Re = k, Me = Symbol.toStringTag, Re) {
     a(this, Me, "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 || {}), He = /* @__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))(He || {});
-function at(i, t, e = 864e5) {
+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);
 }
-function lt(i, t, e = 864e5) {
-  if (i >= t)
-    throw new p("The end date must be greater than the start date.");
-  return new u(function* () {
-    const n = new Date(t).getTime();
-    let s = new Date(i).getTime();
+function ct(i, t, e = 864e5) {
+  if (i = new Date(i), t = new Date(t), i >= t)
+    throw new b("The end date must be greater than the start date.");
+  return new c(function* () {
+    const n = t.getTime();
+    let s = i.getTime();
     for (; s < n; )
       yield new Date(s), s += e;
   });
 }
-function Qe(i, t = 864e5) {
+function Ve(i, t = 864e5) {
   if (t <= 1)
-    throw new p(
+    throw new b(
       "Rounding a timestamp by milliseconds or less makes no sense.Use the timestamp value directly instead."
     );
   if (t > 864e5)
-    throw new p(
+    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);
@@ -3905,7 +4531,7 @@ function Qe(i, t = 864e5) {
 function ut(i, t = 0) {
   i = new Date(i);
   const e = 7 - t, n = (i.getUTCDay() + e) % 7, s = i.getTime() - 864e5 * n;
-  return Qe(new Date(s));
+  return Ve(new Date(s));
 }
 var Fe;
 Fe = Symbol.toStringTag;
@@ -3913,10 +4539,15 @@ class qe {
   /**
    * Initializes a new instance of the {@link GameLoop} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const loop = new GameLoop((elapsedTime: number) => { [...] });
    * ```
    *
+   * ---
+   *
    * @param callback The function that will be executed at each iteration of the game loop.
    * @param msIfNotBrowser
    * The interval in milliseconds that will be used if the current environment isn't a browser. Default is `40`.
@@ -3996,11 +4627,16 @@ class qe {
    *
    * If the game loop is already running, a {@link RuntimeException} will be thrown.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * loop.onStart(() => { [...] }); // This callback will be executed.
    * loop.start();
    * ```
    *
+   * ---
+   *
    * @param elapsedTime The elapsed time to set as default when the game loop starts. Default is `0`.
    */
   start(t = 0) {
@@ -4013,6 +4649,9 @@ class qe {
    *
    * If the game loop hasn't yet started, a {@link RuntimeException} will be thrown.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * loop.onStop(() => { [...] }); // This callback will be executed.
    * loop.stop();
@@ -4028,10 +4667,15 @@ class qe {
   /**
    * Subscribes to the `start` event of the game loop.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * loop.onStart(() => { console.log("The game loop has started."); });
    * ```
    *
+   * ---
+   *
    * @param callback The function that will be executed when the game loop starts.
    *
    * @returns A function that can be used to unsubscribe from the event.
@@ -4042,10 +4686,15 @@ class qe {
   /**
    * Subscribes to the `stop` event of the game loop.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * loop.onStop(() => { console.log("The game loop has stopped."); });
    * ```
    *
+   * ---
+   *
    * @param callback The function that will be executed when the game loop stops.
    *
    * @returns A function that can be used to unsubscribe from the event.
@@ -4055,14 +4704,19 @@ class qe {
   }
 }
 var Pe, Ce;
-class ct extends (Ce = qe, Pe = Symbol.toStringTag, Ce) {
+class ht extends (Ce = qe, Pe = Symbol.toStringTag, Ce) {
   /**
    * Initializes a new instance of the {@link Clock} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const clock = new Clock();
    * ```
    *
+   * ---
+   *
    * @param msIfNotBrowser
    * The interval in milliseconds at which the clock will tick if the environment is not a browser.  
    * `TimeUnit.Second` by default.
@@ -4081,11 +4735,16 @@ class ct extends (Ce = qe, Pe = Symbol.toStringTag, Ce) {
    *
    * If the clock is already running, a {@link RuntimeException} will be thrown.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * clock.onStart(() => { [...] }); // This callback will be executed.
    * clock.start();
    * ```
    *
+   * ---
+   *
    * @param elapsedTime The elapsed time to set as default when the clock starts. Default is `0`.
    */
   start(e = 0) {
@@ -4098,6 +4757,9 @@ class ct extends (Ce = qe, Pe = Symbol.toStringTag, Ce) {
    *
    * If the clock hasn't yet started, a {@link RuntimeException} will be thrown.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * clock.onStop(() => { [...] }); // This callback will be executed.
    * clock.stop();
@@ -4113,11 +4775,16 @@ class ct extends (Ce = qe, Pe = Symbol.toStringTag, Ce) {
   /**
    * Subscribes to the `tick` event of the clock.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * clock.onTick((elapsedTime) => { [...] }); // This callback will be executed.
    * clock.start();
    * ```
    *
+   * ---
+   *
    * @param callback The callback that will be executed when the clock ticks.
    * @param tickStep
    * The minimum time in milliseconds that must pass from the previous execution of the callback to the next one.
@@ -4131,7 +4798,7 @@ class ct extends (Ce = qe, Pe = Symbol.toStringTag, Ce) {
    */
   onTick(e, n = 0) {
     if (n < 0)
-      throw new p("The tick step must be a non-negative number.");
+      throw new b("The tick step must be a non-negative number.");
     if (n === 0)
       return this._publisher.subscribe("tick", e);
     let s = 0;
@@ -4141,14 +4808,19 @@ class ct extends (Ce = qe, Pe = Symbol.toStringTag, Ce) {
   }
 }
 var je, Ie;
-class ht extends (Ie = qe, je = Symbol.toStringTag, Ie) {
+class ft extends (Ie = qe, je = Symbol.toStringTag, Ie) {
   /**
    * Initializes a new instance of the {@link Countdown} class.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * const countdown = new Countdown(10_000);
    * ```
    *
+   * ---
+   *
    * @param duration
    * The total duration of the countdown in milliseconds.
    *
@@ -4196,6 +4868,8 @@ class ht 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.
    *
@@ -4214,11 +4888,16 @@ class ht extends (Ie = qe, je = Symbol.toStringTag, Ie) {
    *
    * If the countdown is already running, a {@link RuntimeException} will be thrown.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * countdown.onStart(() => { [...] }); // This callback will be executed.
    * countdown.start();
    * ```
    *
+   * ---
+   *
    * @param remainingTime
    * The remaining time to set as default when the countdown starts.  
    * Default is the {@link Countdown.duration} itself.
@@ -4230,18 +4909,23 @@ class ht extends (Ie = qe, je = Symbol.toStringTag, Ie) {
       throw new y("The countdown had already stopped or hadn't yet started.");
     if (this._deferrer)
       throw new x();
-    return this._deferrer = new Ke(), super.start(this.duration - e), this._publisher.publish("start"), this._deferrer;
+    return this._deferrer = new He(), super.start(this.duration - e), this._publisher.publish("start"), this._deferrer;
   }
   /**
    * Stops the execution of the countdown.
    *
    * If the countdown hasn't yet started, a {@link RuntimeException} will be thrown.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * countdown.onStop(() => { [...] }); // This callback will be executed.
    * countdown.stop();
    * ```
    *
+   * ---
+   *
    * @param reason
    * The reason why the countdown has stopped.
    *
@@ -4254,11 +4938,16 @@ class ht extends (Ie = qe, je = Symbol.toStringTag, Ie) {
   /**
    * Subscribes to the `expire` event of the countdown.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * countdown.onExpire(() => { [...] }); // This callback will be executed once the countdown has expired.
    * countdown.start();
    * ```
    *
+   * ---
+   *
    * @param callback The callback that will be executed when the countdown expires.
    *
    * @returns A function that can be used to unsubscribe from the event.
@@ -4269,11 +4958,16 @@ class ht extends (Ie = qe, je = Symbol.toStringTag, Ie) {
   /**
    * Subscribes to the `tick` event of the countdown.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * countdown.onTick((remainingTime) => { [...] }); // This callback will be executed.
    * countdown.start();
    * ```
    *
+   * ---
+   *
    * @param callback The callback that will be executed when the countdown ticks.
    * @param tickStep
    * The minimum time in milliseconds that must pass from the previous execution of the callback to the next one.
@@ -4287,7 +4981,7 @@ class ht extends (Ie = qe, je = Symbol.toStringTag, Ie) {
    */
   onTick(e, n = 0) {
     if (n < 0)
-      throw new p("The tick step must be a non-negative number.");
+      throw new b("The tick step must be a non-negative number.");
     if (n === 0)
       return this._publisher.subscribe("tick", e);
     let s = this.remainingTime;
@@ -4298,7 +4992,7 @@ class ht extends (Ie = qe, je = Symbol.toStringTag, Ie) {
 }
 var Ae;
 Ae = Symbol.toStringTag;
-class ft {
+class dt {
   constructor() {
     a(this, Ae, "Curve");
   }
@@ -4306,6 +5000,9 @@ class ft {
    * Generates a given number of values following a linear curve.  
    * The values are equally spaced and normalized between 0 and 1.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * for (const value of Curve.Linear(5))
    * {
@@ -4313,13 +5010,15 @@ class ft {
    * }
    * ```
    *
+   * ---
+   *
    * @param values The number of values to generate.
    *
    * @returns A {@link SmartIterator} object that generates the values following a linear curve.
    */
   static Linear(t) {
     const e = t - 1;
-    return new u(function* () {
+    return new c(function* () {
       for (let n = 0; n < t; n += 1)
         yield n / e;
     });
@@ -4328,6 +5027,9 @@ class ft {
    * Generates a given number of values following an exponential curve.  
    * The values are equally spaced and normalized between 0 and 1.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * for (const value of Curve.Exponential(6))
    * {
@@ -4335,6 +5037,8 @@ class ft {
    * }
    * ```
    *
+   * ---
+   *
    * @param values The number of values to generate.
    * @param base
    * The base of the exponential curve. Default is `2`.
@@ -4351,7 +5055,7 @@ class ft {
     if (e < 0)
       throw new d("The base of the exponential curve cannot be negative.");
     const n = t - 1;
-    return new u(function* () {
+    return new c(function* () {
       for (let s = 0; s < t; s += 1)
         yield Math.pow(s / n, e);
     });
@@ -4366,6 +5070,9 @@ const F = class F {
   /**
    * Generates a random boolean value.
    *
+   * ---
+   *
+   * @example
    * ```ts
    * if (Random.Boolean())
    * {
@@ -4373,6 +5080,8 @@ const F = class F {
    * }
    * ```
    *
+   * ---
+   *
    * @param ratio
    * The probability of generating `true`.
    *
@@ -4392,6 +5101,8 @@ const F = class F {
   /**
    * Picks a random valid index from a given array of elements.
    *
+   * ---
+   *
    * @template T The type of the elements in the array.
    *
    * @param elements
@@ -4409,6 +5120,8 @@ const F = class F {
   /**
    * Picks a random element from a given array of elements.
    *
+   * ---
+   *
    * @template T The type of the elements in the array.
    *
    * @param elements
@@ -4423,29 +5136,29 @@ const F = class F {
   }
 };
 let j = F;
-function dt(i) {
+function wt(i) {
   return new Promise((t) => setTimeout(t, i));
 }
 function mt() {
   return new Promise((i) => requestAnimationFrame(() => i()));
 }
-function wt() {
+function yt() {
   return new Promise((i) => setTimeout(i));
 }
-function yt(i, t = "text/javascript") {
+function _t(i, t = "text/javascript") {
   return new Promise((e, n) => {
     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);
   });
 }
-function _t(...i) {
-  return new u(function* () {
+function pt(...i) {
+  return new c(function* () {
     for (const t of i)
       for (const e of t)
         yield e;
   });
 }
-function pt(i) {
+function bt(i) {
   if (i instanceof Array)
     return i.length;
   let t = 0;
@@ -4453,27 +5166,27 @@ function pt(i) {
     t += 1;
   return t;
 }
-function bt(i) {
-  return new u(function* () {
+function xt(i) {
+  return new c(function* () {
     let t = 0;
     for (const e of i)
       yield [t, e], t += 1;
   });
 }
-function xt(i, t, e = 1) {
+function gt(i, t, e = 1) {
   if (e <= 0)
-    throw new p(
+    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 u(function* () {
+  return t === void 0 && (t = i, i = 0), i > t ? new c(function* () {
     for (let n = i; n > t; n -= e)
       yield n;
-  }) : new u(function* () {
+  }) : new c(function* () {
     for (let n = i; n < t; n += e)
       yield n;
   });
 }
-function gt(i) {
+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));
@@ -4481,16 +5194,16 @@ function gt(i) {
   }
   return t;
 }
-function vt(i) {
-  return new u(function* () {
+function kt(i) {
+  return new c(function* () {
     const t = /* @__PURE__ */ new Set();
     for (const e of i)
       t.has(e) || (t.add(e), yield e);
   });
 }
-function Ve(i, t) {
+function Xe(i, t) {
   const e = i[Symbol.iterator](), n = t[Symbol.iterator]();
-  return new u(function* () {
+  return new c(function* () {
     for (; ; ) {
       const s = e.next(), r = n.next();
       if (s.done || r.done)
@@ -4499,7 +5212,7 @@ function Ve(i, t) {
     }
   });
 }
-function kt(i, t) {
+function St(i, t) {
   if (t === void 0) {
     let r = 0, o = 0;
     for (const l of i)
@@ -4509,7 +5222,7 @@ function kt(i, t) {
     return r / o;
   }
   let e = 0, n = 0, s = 0;
-  for (const [r, o] of Ve(i, t)) {
+  for (const [r, o] of Xe(i, t)) {
     if (o <= 0)
       throw new d(`The weight for the value #${s} must be greater than zero.`);
     e += r * o, n += o, s += 1;
@@ -4520,7 +5233,7 @@ function kt(i, t) {
     throw new d("The sum of weights must be greater than zero.");
   return e / n;
 }
-function St(i) {
+function Tt(i) {
   let t = 0;
   for (let e = 0; e < i.length; e += 1) {
     const n = i.charCodeAt(e);
@@ -4528,74 +5241,74 @@ function St(i) {
   }
   return t;
 }
-function Tt(i) {
+function Et(i) {
   let t = 0;
   for (const e of i)
     t += e;
   return t;
 }
-function Et(i) {
+function Mt(i) {
   return `${i.charAt(0).toUpperCase()}${i.slice(1)}`;
 }
-const Mt = "2.0.0";
+const Rt = "2.0.2";
 export {
   T as AggregatedAsyncIterator,
   g as AggregatedIterator,
   Ge as CallableObject,
-  ct as Clock,
-  ht as Countdown,
-  ft as Curve,
-  Ke as DeferredPromise,
+  ht as Clock,
+  ft as Countdown,
+  dt as Curve,
+  He as DeferredPromise,
   Je as EnvironmentException,
-  c as Exception,
+  u as Exception,
   x as FatalErrorException,
   $e as FileException,
-  Ue as FileExistsException,
-  et as FileNotFoundException,
+  et as FileExistsException,
+  tt as FileNotFoundException,
   qe as GameLoop,
-  it as JSONStorage,
-  b as KeyException,
-  tt as NetworkException,
+  ot as JSONStorage,
+  _ as KeyException,
+  nt as NetworkException,
   Be as NotImplementedException,
-  nt as PermissionException,
+  st as PermissionException,
   E as Publisher,
   j as Random,
-  p as RangeException,
+  b as RangeException,
   h as ReducedIterator,
   C as ReferenceException,
   y as RuntimeException,
   f as SmartAsyncIterator,
-  u as SmartIterator,
+  c as SmartIterator,
   k as SmartPromise,
-  rt as SwitchableCallback,
+  it as SwitchableCallback,
   M as TimeUnit,
-  ot as TimedPromise,
+  at as TimedPromise,
   Ye as TimeoutException,
-  st as TypeException,
-  Mt as VERSION,
+  rt as TypeException,
+  Rt as VERSION,
   d as ValueException,
-  He as WeekDay,
-  kt as average,
-  Et as capitalize,
-  _t as chain,
-  pt as count,
-  at as dateDifference,
-  lt as dateRange,
-  Qe as dateRound,
-  dt as delay,
-  bt as enumerate,
+  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,
-  St as hash,
+  Tt as hash,
   Oe as isBrowser,
-  Ze as isNode,
-  We as isWorker,
-  yt as loadScript,
+  We as isNode,
+  Ue as isWorker,
+  _t as loadScript,
   mt as nextAnimationFrame,
-  xt as range,
-  gt as shuffle,
-  Tt as sum,
-  vt as unique,
-  wt as yieldToEventLoop,
-  Ve as zip
+  gt as range,
+  vt as shuffle,
+  Et as sum,
+  kt as unique,
+  yt as yieldToEventLoop,
+  Xe as zip
 };
 //# sourceMappingURL=core.js.map