@byloth/core 2.2.1 → 2.2.3

package/dist/core.esm.js

@@ -1,5 +1,5 @@
-const T = typeof window < "u" && typeof window.document < "u", D = typeof process < "u" && !!process.versions?.node, B = typeof self == "object" && self.constructor?.name === "DedicatedWorkerGlobalScope";
-class c extends Error {
+const E = typeof window < "u" && typeof window.document < "u", B = typeof process < "u" && !!process.versions?.node, Y = typeof self == "object" && self.constructor?.name === "DedicatedWorkerGlobalScope";
+class h extends Error {
   /**
    * A static method to convert a generic caught error, ensuring it's an instance of the {@link Exception} class.
    *
@@ -23,13 +23,13 @@ class c extends Error {
    * @returns An instance of the {@link Exception} class.
    */
   static FromUnknown(e) {
-    if (e instanceof c)
+    if (e instanceof h)
       return e;
     if (e instanceof Error) {
-      const t = new c(e.message);
-      return t.stack = e.stack, t.name = e.name, t;
+      const t = new h(e.message);
+      return t.stack = e.stack, t.cause = e.cause, t.name = e.name, t;
     }
-    return new c(`${e}`);
+    return new h(`${e}`);
   }
   /**
    * Initializes a new instance of the {@link Exception} class.
@@ -48,15 +48,11 @@ class c extends Error {
    * @param name The name of the exception. Default is `"Exception"`.
    */
   constructor(e, t, n = "Exception") {
-    super(e), this.cause = t, this.name = n, t && (t instanceof Error ? this.stack += `
-
-Caused by ${t.stack}` : this.stack += `
-
-Caused by ${t}`);
+    super(e), this.cause = t, this.name = n;
   }
   [Symbol.toStringTag] = "Exception";
 }
-class x extends c {
+class g extends h {
   /**
    * Initializes a new instance of the {@link FatalErrorException} class.
    *
@@ -78,7 +74,7 @@ class x extends c {
   }
   [Symbol.toStringTag] = "FatalErrorException";
 }
-class P extends x {
+class j extends g {
   /**
    * Initializes a new instance of the {@link NotImplementedException} class.
    *
@@ -100,7 +96,7 @@ class P extends x {
   }
   [Symbol.toStringTag] = "NotImplementedException";
 }
-class E extends c {
+class M extends h {
   /**
    * Initializes a new instance of the {@link FileException} class.
    *
@@ -122,7 +118,7 @@ class E extends c {
   }
   [Symbol.toStringTag] = "FileException";
 }
-class J extends E {
+class J extends M {
   /**
    * Initializes a new instance of the {@link FileExistsException} class.
    *
@@ -144,7 +140,7 @@ class J extends E {
   }
   [Symbol.toStringTag] = "FileExistsException";
 }
-class Y extends E {
+class L extends M {
   /**
    * Initializes a new instance of the {@link FileNotFoundException} class.
    *
@@ -166,7 +162,7 @@ class Y extends E {
   }
   [Symbol.toStringTag] = "FileNotFoundException";
 }
-class p extends c {
+class b extends h {
   /**
    * Initializes a new instance of the {@link KeyException} class.
    *
@@ -188,7 +184,7 @@ class p extends c {
   }
   [Symbol.toStringTag] = "KeyException";
 }
-class L extends c {
+class V extends h {
   /**
    * Initializes a new instance of the {@link NetworkException} class.
    *
@@ -210,7 +206,7 @@ class L extends c {
   }
   [Symbol.toStringTag] = "NetworkException";
 }
-class V extends c {
+class G extends h {
   /**
    * Initializes a new instance of the {@link PermissionException} class.
    *
@@ -232,7 +228,7 @@ class V extends c {
   }
   [Symbol.toStringTag] = "PermissionException";
 }
-class k extends c {
+class k extends h {
   /**
    * Initializes a new instance of the {@link ReferenceException} class.
    *
@@ -254,7 +250,7 @@ class k extends c {
   }
   [Symbol.toStringTag] = "ReferenceException";
 }
-class _ extends c {
+class y extends h {
   /**
    * Initializes a new instance of the {@link RuntimeException} class.
    *
@@ -276,7 +272,7 @@ class _ extends c {
   }
   [Symbol.toStringTag] = "RuntimeException";
 }
-class j extends _ {
+class O extends y {
   /**
    * Initializes a new instance of the {@link EnvironmentException} class.
    *
@@ -298,7 +294,7 @@ class j extends _ {
   }
   [Symbol.toStringTag] = "EnvironmentException";
 }
-class O extends c {
+class N extends h {
   /**
    * Initializes a new instance of the {@link TimeoutException} class.
    *
@@ -320,7 +316,7 @@ class O extends c {
   }
   [Symbol.toStringTag] = "TimeoutException";
 }
-class G extends c {
+class K extends h {
   /**
    * Initializes a new instance of the {@link TypeException} class.
    *
@@ -342,7 +338,7 @@ class G extends c {
   }
   [Symbol.toStringTag] = "TypeException";
 }
-class f extends c {
+class u extends h {
   /**
    * Initializes a new instance of the {@link ValueException} class.
    *
@@ -364,7 +360,7 @@ class f extends c {
   }
   [Symbol.toStringTag] = "ValueException";
 }
-class b extends f {
+class x extends u {
   /**
    * Initializes a new instance of the {@link RangeException} class.
    *
@@ -534,7 +530,7 @@ class l {
     if (s === void 0) {
       const r = this._iterator.next();
       if (r.done)
-        throw new f("Cannot reduce an empty iterator without an initial value.");
+        throw new u("Cannot reduce an empty iterator without an initial value.");
       s = r.value, n += 1;
     }
     for (; ; ) {
@@ -914,7 +910,7 @@ class l {
    * {
    *     try
    *     {
-   *         if (value > 5) { throw new Error("The index is too high."); }
+   *         if (value > 5) { throw new Exception("The index is too high."); }
    *
    *         console.log(value); // 1, 2, 3, 4, 5
    *     }
@@ -964,7 +960,7 @@ class l {
    * @returns A new instance of the {@link AggregatedIterator} class containing the grouped elements.
    */
   groupBy(e) {
-    return new h(this.map((t, n) => [e(t, n), t]));
+    return new d(this.map((t, n) => [e(t, n), t]));
   }
   /**
    * Materializes the iterator into an array.  
@@ -997,7 +993,7 @@ class l {
     return this;
   }
 }
-class u {
+class c {
   /**
    * The internal {@link SmartIterator} object that holds the reduced elements.
    */
@@ -1081,7 +1077,7 @@ class u {
   }
   filter(e) {
     const t = this._elements.enumerate();
-    return new u(function* () {
+    return new c(function* () {
       for (const [n, [s, r]] of t)
         e(s, r, n) && (yield [s, r]);
     });
@@ -1121,7 +1117,7 @@ class u {
    */
   map(e) {
     const t = this._elements.enumerate();
-    return new u(function* () {
+    return new c(function* () {
       for (const [n, [s, r]] of t)
         yield [s, e(s, r, n)];
     });
@@ -1131,7 +1127,7 @@ class u {
     if (s === void 0) {
       const r = this._elements.next();
       if (r.done)
-        throw new f("Cannot reduce an empty iterator without an initial value.");
+        throw new u("Cannot reduce an empty iterator without an initial value.");
       s = r.value[1], n += 1;
     }
     for (const [r, o] of this._elements)
@@ -1173,7 +1169,7 @@ class u {
    */
   flatMap(e) {
     const t = this._elements.enumerate();
-    return new h(function* () {
+    return new d(function* () {
       for (const [n, [s, r]] of t) {
         const o = e(s, r, n);
         if (o instanceof Array)
@@ -1219,7 +1215,7 @@ class u {
    */
   drop(e) {
     const t = this._elements.enumerate();
-    return new u(function* () {
+    return new c(function* () {
       for (const [n, [s, r]] of t)
         n >= e && (yield [s, r]);
     });
@@ -1261,7 +1257,7 @@ class u {
    */
   take(e) {
     const t = this._elements.enumerate();
-    return new u(function* () {
+    return new c(function* () {
       for (const [n, [s, r]] of t) {
         if (n >= e)
           break;
@@ -1331,7 +1327,7 @@ class u {
    */
   unique() {
     const e = this._elements;
-    return new u(function* () {
+    return new c(function* () {
       const t = /* @__PURE__ */ new Set();
       for (const [n, s] of e)
         t.has(s) || (t.add(s), yield [n, s]);
@@ -1427,7 +1423,7 @@ class u {
    */
   reorganizeBy(e) {
     const t = this._elements.enumerate();
-    return new h(function* () {
+    return new d(function* () {
       for (const [n, [s, r]] of t)
         yield [e(s, r, n), r];
     });
@@ -1605,13 +1601,13 @@ class u {
   }
   [Symbol.toStringTag] = "ReducedIterator";
 }
-class w {
+class p {
   /**
    * The internal {@link SmartAsyncIterator} object that holds the elements to aggregate.
    */
   _elements;
   constructor(e) {
-    this._elements = new d(e);
+    this._elements = new w(e);
   }
   /**
    * Determines whether all elements of each group of the iterator satisfy a given condition.
@@ -1650,7 +1646,7 @@ class w {
       const [r, o] = t.get(n) ?? [0, !0];
       o && t.set(n, [r + 1, await e(n, s, r)]);
     }
-    return new u(function* () {
+    return new c(function* () {
       for (const [n, [s, r]] of t)
         yield [n, r];
     });
@@ -1692,14 +1688,14 @@ class w {
       const [r, o] = t.get(n) ?? [0, !1];
       o || t.set(n, [r + 1, await e(n, s, r)]);
     }
-    return new u(function* () {
+    return new c(function* () {
       for (const [n, [s, r]] of t)
         yield [n, r];
     });
   }
   filter(e) {
     const t = this._elements;
-    return new w(async function* () {
+    return new p(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -1741,7 +1737,7 @@ class w {
    */
   map(e) {
     const t = this._elements;
-    return new w(async function* () {
+    return new p(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -1763,7 +1759,7 @@ class w {
       }
       n.set(s, [o + 1, await e(s, a, r, o)]);
     }
-    return new u(function* () {
+    return new c(function* () {
       for (const [s, [r, o]] of n)
         yield [s, o];
     });
@@ -1806,13 +1802,13 @@ class w {
    */
   flatMap(e) {
     const t = this._elements;
-    return new w(async function* () {
+    return new p(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of t) {
         const o = n.get(s) ?? 0, a = await e(s, r, o);
         if (a instanceof Array)
-          for (const y of a)
-            yield [s, y];
+          for (const f of a)
+            yield [s, f];
         else
           yield [s, a];
         n.set(s, o + 1);
@@ -1850,7 +1846,7 @@ class w {
    */
   drop(e) {
     const t = this._elements;
-    return new w(async function* () {
+    return new p(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -1893,7 +1889,7 @@ class w {
    */
   take(e) {
     const t = this._elements;
-    return new w(async function* () {
+    return new p(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -1907,7 +1903,7 @@ class w {
       let [r, o] = t.get(n) ?? [0, void 0];
       o === void 0 && (await e(n, s, r) && (o = s), t.set(n, [r + 1, o]));
     }
-    return new u(function* () {
+    return new c(function* () {
       for (const [n, [s, r]] of t)
         yield [n, r];
     });
@@ -1969,7 +1965,7 @@ class w {
    */
   unique() {
     const e = this._elements;
-    return new w(async function* () {
+    return new p(async function* () {
       const t = /* @__PURE__ */ new Map();
       for await (const [n, s] of e) {
         const r = t.get(n) ?? /* @__PURE__ */ new Set();
@@ -2005,7 +2001,7 @@ class w {
       const n = e.get(t) ?? 0;
       e.set(t, n + 1);
     }
-    return new u(function* () {
+    return new c(function* () {
       for (const [t, n] of e)
         yield [t, n];
     });
@@ -2076,7 +2072,7 @@ class w {
    */
   reorganizeBy(e) {
     const t = this._elements;
-    return new w(async function* () {
+    return new p(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -2112,7 +2108,7 @@ class w {
    */
   keys() {
     const e = this._elements;
-    return new d(async function* () {
+    return new w(async function* () {
       const t = /* @__PURE__ */ new Set();
       for await (const [n] of e)
         t.has(n) || (t.add(n), yield n);
@@ -2176,7 +2172,7 @@ class w {
    */
   values() {
     const e = this._elements;
-    return new d(async function* () {
+    return new w(async function* () {
       for await (const [t, n] of e)
         yield n;
     });
@@ -2263,7 +2259,7 @@ class w {
   }
   [Symbol.toStringTag] = "AggregatedAsyncIterator";
 }
-class d {
+class w {
   /**
    * The native {@link AsyncIterator} object that is being wrapped by this instance.
    */
@@ -2387,7 +2383,7 @@ class d {
   }
   filter(e) {
     const t = this._iterator;
-    return new d(async function* () {
+    return new w(async function* () {
       let n = 0;
       for (; ; ) {
         const s = await t.next();
@@ -2430,7 +2426,7 @@ class d {
    */
   map(e) {
     const t = this._iterator;
-    return new d(async function* () {
+    return new w(async function* () {
       let n = 0;
       for (; ; ) {
         const s = await t.next();
@@ -2445,7 +2441,7 @@ class d {
     if (s === void 0) {
       const r = await this._iterator.next();
       if (r.done)
-        throw new f("Cannot reduce an empty iterator without an initial value.");
+        throw new u("Cannot reduce an empty iterator without an initial value.");
       s = r.value, n += 1;
     }
     for (; ; ) {
@@ -2488,7 +2484,7 @@ class d {
    */
   flatMap(e) {
     const t = this._iterator;
-    return new d(async function* () {
+    return new w(async function* () {
       let n = 0;
       for (; ; ) {
         const s = await t.next();
@@ -2537,7 +2533,7 @@ class d {
    */
   drop(e) {
     const t = this._iterator;
-    return new d(async function* () {
+    return new w(async function* () {
       let n = 0;
       for (; n < e; ) {
         if ((await t.next()).done)
@@ -2586,7 +2582,7 @@ class d {
    */
   take(e) {
     const t = this._iterator;
-    return new d(async function* () {
+    return new w(async function* () {
       let n = 0;
       for (; n < e; ) {
         const s = await t.next();
@@ -2665,7 +2661,7 @@ class d {
    */
   unique() {
     const e = this._iterator;
-    return new d(async function* () {
+    return new w(async function* () {
       const t = /* @__PURE__ */ new Set();
       for (; ; ) {
         const n = await e.next();
@@ -2832,7 +2828,7 @@ class d {
    * {
    *     try
    *     {
-   *         if (value > 5) { throw new Error("The index is too high."); }
+   *         if (value > 5) { throw new Exception("The index is too high."); }
    *
    *         console.log(value); // 1, 2, 3, 4, 5
    *     }
@@ -2882,7 +2878,7 @@ class d {
    * @returns A new instance of the {@link AggregatedAsyncIterator} class containing the grouped elements.
    */
   groupBy(e) {
-    return new w(this.map(async (t, n) => [await e(t, n), t]));
+    return new p(this.map(async (t, n) => [await e(t, n), t]));
   }
   /**
    * Materializes the iterator into an array.  
@@ -2915,7 +2911,7 @@ class d {
     return this;
   }
 }
-class h {
+class d {
   /**
    * The internal {@link SmartIterator} object that holds the elements to aggregate.
    */
@@ -2959,7 +2955,7 @@ class h {
       const [r, o] = t.get(n) ?? [0, !0];
       o && t.set(n, [r + 1, e(n, s, r)]);
     }
-    return new u(function* () {
+    return new c(function* () {
       for (const [n, [s, r]] of t)
         yield [n, r];
     });
@@ -3000,14 +2996,14 @@ class h {
       const [r, o] = t.get(n) ?? [0, !1];
       o || t.set(n, [r + 1, e(n, s, r)]);
     }
-    return new u(function* () {
+    return new c(function* () {
       for (const [n, [s, r]] of t)
         yield [n, r];
     });
   }
   filter(e) {
     const t = this._elements;
-    return new h(function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -3049,7 +3045,7 @@ class h {
    */
   map(e) {
     const t = this._elements;
-    return new h(function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -3071,7 +3067,7 @@ class h {
       }
       n.set(s, [o + 1, e(s, a, r, o)]);
     }
-    return new u(function* () {
+    return new c(function* () {
       for (const [s, [r, o]] of n)
         yield [s, o];
     });
@@ -3114,13 +3110,13 @@ class h {
    */
   flatMap(e) {
     const t = this._elements;
-    return new h(function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of t) {
         const o = n.get(s) ?? 0, a = e(s, r, o);
         if (a instanceof Array)
-          for (const y of a)
-            yield [s, y];
+          for (const f of a)
+            yield [s, f];
         else
           yield [s, a];
         n.set(s, o + 1);
@@ -3158,7 +3154,7 @@ class h {
    */
   drop(e) {
     const t = this._elements;
-    return new h(function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -3201,7 +3197,7 @@ class h {
    */
   take(e) {
     const t = this._elements;
-    return new h(function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -3215,7 +3211,7 @@ class h {
       let [r, o] = t.get(n) ?? [0, void 0];
       o === void 0 && (e(n, s, r) && (o = s), t.set(n, [r + 1, o]));
     }
-    return new u(function* () {
+    return new c(function* () {
       for (const [n, [s, r]] of t)
         yield [n, r];
     });
@@ -3277,7 +3273,7 @@ class h {
    */
   unique() {
     const e = this._elements;
-    return new h(function* () {
+    return new d(function* () {
       const t = /* @__PURE__ */ new Map();
       for (const [n, s] of e) {
         const r = t.get(n) ?? /* @__PURE__ */ new Set();
@@ -3312,7 +3308,7 @@ class h {
       const n = e.get(t) ?? 0;
       e.set(t, n + 1);
     }
-    return new u(function* () {
+    return new c(function* () {
       for (const [t, n] of e)
         yield [t, n];
     });
@@ -3381,7 +3377,7 @@ class h {
    */
   reorganizeBy(e) {
     const t = this._elements;
-    return new h(function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
@@ -3568,8 +3564,8 @@ class h {
   }
   [Symbol.toStringTag] = "AggregatedIterator";
 }
-const N = Function;
-class M extends N {
+const z = Function;
+class R extends z {
   /**
    * Initializes a new instance of the {@link CallableObject} class.
    */
@@ -3580,7 +3576,7 @@ class M extends N {
   }
   [Symbol.toStringTag] = "CallableObject";
 }
-class K extends M {
+class Q extends R {
   /**
    * The array containing all the functions in the chain.
    */
@@ -3618,7 +3614,10 @@ class K extends M {
    * @returns An array containing the return values of all functions.
    */
   _invoke(...e) {
-    return this._callbacks.map((t) => t(...e));
+    const t = this._callbacks.length, n = new Array(t);
+    for (let s = 0; s < t; s += 1)
+      n[s] = this._callbacks[s](...e);
+    return n;
   }
   /**
    * Adds a function to the chain.
@@ -3687,7 +3686,7 @@ class K extends M {
   }
   [Symbol.toStringTag] = "CallbackChain";
 }
-class g {
+class v {
   /**
    * A map containing all the subscribers for each event.
    *
@@ -3743,14 +3742,21 @@ class g {
    */
   // eslint-disable-next-line @typescript-eslint/no-empty-object-type
   createScope() {
-    const e = new g();
+    const e = new v();
     return this.subscribe("__internals__:clear", () => e.clear()), this.subscribe("*", (t, ...n) => {
       e.publish(t, ...n);
     }), e;
   }
   publish(e, ...t) {
     let n, s = this._subscribers.get(e);
-    return s ? n = s.slice().map((r) => r(...t)) : n = [], e.startsWith("__") || (s = this._subscribers.get("*"), s && s.slice().forEach((r) => r(e, ...t))), n;
+    if (s) {
+      const r = s.slice(), o = r.length;
+      n = new Array(o);
+      for (let a = 0; a < o; a += 1)
+        n[a] = r[a](...t);
+    } else
+      n = [];
+    return e.startsWith("__") || (s = this._subscribers.get("*"), s && s.slice().forEach((r) => r(e, ...t))), n;
   }
   subscribe(e, t) {
     const n = this._subscribers.get(e) ?? [];
@@ -3798,9 +3804,9 @@ class g {
   }
   [Symbol.toStringTag] = "Publisher";
 }
-const q = () => {
+const A = () => {
 };
-class Q extends M {
+class H extends R {
   /**
    * The currently selected implementation of the callback.
    */
@@ -3848,7 +3854,7 @@ class Q extends M {
   _invoke;
   constructor(e, t = "default") {
     super(), this._callbacks = /* @__PURE__ */ new Map(), this._isEnabled = !0, e ? this._callbacks.set(t, e) : (t = "", e = (() => {
-      throw new P(
+      throw new j(
         "The `SwitchableCallback` has no callback defined yet. Did you forget to call the `register` method?"
       );
     })), this._key = t, this._callback = e, this._invoke = (...n) => this._callback(...n);
@@ -3878,16 +3884,16 @@ class Q extends M {
   enable(e) {
     if (e === void 0) {
       if (!this._key)
-        throw new p(
+        throw new b(
           "The `SwitchableCallback` has no callback defined yet. Did you forget to call the `register` method?"
         );
       e = this._key;
     } else if (e) {
       if (!this._callbacks.has(e))
-        throw new p(`The key '${e}' doesn't yet have any associated callback.`);
-    } else throw new p("The key must be a non-empty string.");
+        throw new b(`The key '${e}' doesn't yet have any associated callback.`);
+    } else throw new b("The key must be a non-empty string.");
     if (this._isEnabled)
-      throw new _("The `SwitchableCallback` is already enabled.");
+      throw new y("The `SwitchableCallback` is already enabled.");
     this._callback = this._callbacks.get(e), this._isEnabled = !0;
   }
   /**
@@ -3905,8 +3911,8 @@ class Q extends M {
    */
   disable() {
     if (!this._isEnabled)
-      throw new _("The `SwitchableCallback` is already disabled.");
-    this._callback = q, this._isEnabled = !1;
+      throw new y("The `SwitchableCallback` is already disabled.");
+    this._callback = A, this._isEnabled = !1;
   }
   /**
    * Registers a new implementation for the callback.
@@ -3932,7 +3938,7 @@ class Q extends M {
     if (this._callbacks.size === 0)
       this._key = e, this._callback = t;
     else if (this._callbacks.has(e))
-      throw new p(`The key '${e}' has already been used for another callback.`);
+      throw new b(`The key '${e}' has already been used for another callback.`);
     this._callbacks.set(e, t);
   }
   /**
@@ -3955,9 +3961,9 @@ class Q extends M {
    */
   unregister(e) {
     if (this._key === e)
-      throw new p("Unable to unregister the currently selected callback.");
+      throw new b("Unable to unregister the currently selected callback.");
     if (!this._callbacks.has(e))
-      throw new p(`The key '${e}' doesn't yet have any associated callback.`);
+      throw new b(`The key '${e}' doesn't yet have any associated callback.`);
     this._callbacks.delete(e);
   }
   /**
@@ -3980,12 +3986,12 @@ class Q extends M {
    */
   switch(e) {
     if (!this._callbacks.has(e))
-      throw new p(`The key '${e}' doesn't yet have any associated callback.`);
+      throw new b(`The key '${e}' doesn't yet have any associated callback.`);
     this._key !== e && (this._key = e, this._isEnabled && (this._callback = this._callbacks.get(e)));
   }
   [Symbol.toStringTag] = "SwitchableCallback";
 }
-class H extends Map {
+class X extends Map {
   /**
    * The internal {@link Publisher} instance used to publish events.
    */
@@ -4005,7 +4011,7 @@ class H extends Map {
    * @param iterable An optional iterable of key-value pairs to initialize the {@link Map} with.
    */
   constructor(e) {
-    if (super(), this._publisher = new g(), e)
+    if (super(), this._publisher = new v(), e)
       for (const [t, n] of e)
         this.set(t, n);
   }
@@ -4142,7 +4148,7 @@ class H extends Map {
   }
   [Symbol.toStringTag] = "MapView";
 }
-class X extends Set {
+class Z extends Set {
   /**
    * The internal {@link Publisher} instance used to publish events.
    */
@@ -4162,7 +4168,7 @@ class X extends Set {
    * @param iterable An optional iterable of values to initialize the {@link Set} with.
    */
   constructor(e) {
-    if (super(), this._publisher = new g(), e)
+    if (super(), this._publisher = new v(), e)
       for (const t of e)
         this.add(t);
   }
@@ -4298,7 +4304,7 @@ class X extends Set {
   }
   [Symbol.toStringTag] = "SetView";
 }
-class Z {
+class W {
   /**
    * Whether to prefer the {@link localStorage} over the {@link sessionStorage} when calling an ambivalent method.
    *
@@ -4332,8 +4338,8 @@ class Z {
    * If omitted, it defaults to `true` to prefer the persistent storage.
    */
   constructor(e = !0) {
-    if (!T)
-      throw new j(
+    if (!E)
+      throw new O(
         "The `JSONStorage` class can only be instantiated within a browser environment."
       );
     this._preferPersistence = e, this._volatile = window.sessionStorage, this._persistent = window.localStorage;
@@ -4739,7 +4745,7 @@ class m {
   }
   [Symbol.toStringTag] = "SmartPromise";
 }
-class R extends m {
+class F extends m {
   /**
    * The exposed function that allows to resolve the promise.
    *
@@ -4812,7 +4818,7 @@ class R extends m {
   }
   [Symbol.toStringTag] = "DeferredPromise";
 }
-class z extends m {
+class q extends m {
   /**
    * Initializes a new instance of the {@link TimedPromise} class.
    *
@@ -4837,17 +4843,17 @@ class z extends m {
    */
   constructor(e, t) {
     super((n, s) => {
-      const r = (v) => {
-        clearTimeout(y), n(v);
-      }, o = (v) => {
-        clearTimeout(y), s(v);
-      }, y = setTimeout(() => o(new O("The operation has timed out.")), t);
+      const r = (_) => {
+        clearTimeout(f), n(_);
+      }, o = (_) => {
+        clearTimeout(f), s(_);
+      }, f = setTimeout(() => o(new N("The operation has timed out.")), t);
       e(r, o);
     });
   }
   [Symbol.toStringTag] = "TimedPromise";
 }
-class W extends m {
+class U extends m {
   /**
    * The number of promises currently in the queue.
    */
@@ -4871,7 +4877,7 @@ class W extends m {
    * Accessing this property will always result in a {@link ValueException}.
    */
   get isRejected() {
-    throw new f("`PromiseQueue` doesn't support rejection states.");
+    throw new u("`PromiseQueue` doesn't support rejection states.");
   }
   /**
    * Initializes a new instance of the {@link PromiseQueue} class.
@@ -4880,7 +4886,7 @@ class W extends m {
     super((e) => e()), this._count = 0, this._isPending = !1, this._isFulfilled = !1, this._isRejected = !1;
   }
   enqueue(e, t) {
-    if (this._count += 1, e instanceof R) {
+    if (this._count += 1, e instanceof F) {
       const s = e;
       e = () => (s.resolve(), s);
     }
@@ -4891,18 +4897,18 @@ class W extends m {
         this._count -= 1, r(o);
       });
     };
-    return t ? new z(n, t) : new m(n);
+    return t ? new q(n, t) : new m(n);
   }
   [Symbol.toStringTag] = "PromiseQueue";
 }
-var S = /* @__PURE__ */ ((i) => (i[i.Millisecond = 1] = "Millisecond", i[i.Second = 1e3] = "Second", i[i.Minute = 6e4] = "Minute", i[i.Hour = 36e5] = "Hour", i[i.Day = 864e5] = "Day", i[i.Week = 6048e5] = "Week", i[i.Month = 2592e6] = "Month", i[i.Year = 31536e6] = "Year", i))(S || {}), $ = /* @__PURE__ */ ((i) => (i[i.Sunday = 0] = "Sunday", i[i.Monday = 1] = "Monday", i[i.Tuesday = 2] = "Tuesday", i[i.Wednesday = 3] = "Wednesday", i[i.Thursday = 4] = "Thursday", i[i.Friday = 5] = "Friday", i[i.Saturday = 6] = "Saturday", i))($ || {});
-function U(i, e, t = 864e5) {
+var S = /* @__PURE__ */ ((i) => (i[i.Millisecond = 1] = "Millisecond", i[i.Second = 1e3] = "Second", i[i.Minute = 6e4] = "Minute", i[i.Hour = 36e5] = "Hour", i[i.Day = 864e5] = "Day", i[i.Week = 6048e5] = "Week", i[i.Month = 2592e6] = "Month", i[i.Year = 31536e6] = "Year", i))(S || {}), I = /* @__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))(I || {});
+function ee(i, e, t = 864e5) {
   let n;
   return i = new Date(i), e = new Date(e), i < e ? n = Math.floor : n = Math.ceil, n((e.getTime() - i.getTime()) / t);
 }
-function ee(i, e, t = 864e5) {
+function te(i, e, t = 864e5) {
   if (i = new Date(i), e = new Date(e), i >= e)
-    throw new b("The end date must be greater than the start date.");
+    throw new x("The end date must be greater than the start date.");
   return new l(function* () {
     const n = e.getTime();
     let s = i.getTime();
@@ -4910,23 +4916,23 @@ function ee(i, e, t = 864e5) {
       yield new Date(s), s += t;
   });
 }
-function I(i, e = 864e5) {
+function $(i, e = 864e5) {
   if (e <= 1)
-    throw new b(
+    throw new x(
       "Rounding a timestamp by milliseconds or less makes no sense.Use the timestamp value directly instead."
     );
   if (e > 864e5)
-    throw new b(
+    throw new x(
       "Rounding by more than a day leads to unexpected results. Consider using other methods to round dates by weeks, months or years."
     );
   return i = new Date(i), new Date(Math.floor(i.getTime() / e) * e);
 }
-function te(i, e = 0) {
+function ne(i, e = 0) {
   i = new Date(i);
   const t = 7 - e, n = (i.getUTCDay() + t) % 7, s = i.getTime() - 864e5 * n;
-  return I(new Date(s));
+  return $(new Date(s));
 }
-class F {
+class C {
   /**
    * The handle of the interval or the animation frame, depending on the environment.  
    * It's used to stop the game loop when the {@link GameLoop._stop} method is called.
@@ -5004,13 +5010,13 @@ class F {
    * The interval in milliseconds that will be used if the current environment isn't a browser. Default is `40`.
    */
   constructor(e, t = 40) {
-    this._startTime = 0, this._isRunning = !1, T ? (this._start = () => {
+    this._startTime = 0, this._isRunning = !1, E ? (this._start = () => {
       e(this.elapsedTime), this._handle = window.requestAnimationFrame(this._start);
     }, this._stop = () => window.cancelAnimationFrame(this._handle)) : (console.warn(
       `Not a browser environment detected. Using setInterval@${t}ms instead of requestAnimationFrame...`
     ), this._start = () => {
       this._handle = setInterval(() => e(this.elapsedTime), t);
-    }, this._stop = () => clearInterval(this._handle)), this._publisher = new g();
+    }, this._stop = () => clearInterval(this._handle)), this._publisher = new v();
   }
   /**
    * Starts the execution of the game loop.
@@ -5031,7 +5037,7 @@ class F {
    */
   start(e = 0) {
     if (this._isRunning)
-      throw new _("The game loop has already been started.");
+      throw new y("The game loop has already been started.");
     this._startTime = performance.now() - e, this._start(), this._isRunning = !0, this._publisher.publish("start");
   }
   /**
@@ -5049,9 +5055,9 @@ class F {
    */
   stop() {
     if (!this._isRunning)
-      throw new _("The game loop had already stopped or hadn't yet started.");
+      throw new y("The game loop had already stopped or hadn't yet started.");
     if (!this._handle)
-      throw new x();
+      throw new g();
     this._stop(), this._handle = void 0, this._isRunning = !1, this._publisher.publish("stop");
   }
   /**
@@ -5094,7 +5100,7 @@ class F {
   }
   [Symbol.toStringTag] = "GameLoop";
 }
-class ne extends F {
+class se extends C {
   /**
    * Initializes a new instance of the {@link Clock} class.
    *
@@ -5133,7 +5139,7 @@ class ne extends F {
    */
   start(e = 0) {
     if (this._isRunning)
-      throw new _("The clock has already been started.");
+      throw new y("The clock has already been started.");
     this._startTime = performance.now() - e, this._start(), this._isRunning = !0, this._publisher.publish("start");
   }
   /**
@@ -5151,9 +5157,9 @@ class ne extends F {
    */
   stop() {
     if (!this._isRunning)
-      throw new _("The clock had already stopped or hadn't yet started.");
+      throw new y("The clock had already stopped or hadn't yet started.");
     if (!this._handle)
-      throw new x();
+      throw new g();
     this._stop(), this._handle = void 0, this._isRunning = !1, this._publisher.publish("stop");
   }
   /**
@@ -5182,7 +5188,7 @@ class ne extends F {
    */
   onTick(e, t = 0) {
     if (t < 0)
-      throw new b("The tick step must be a non-negative number.");
+      throw new x("The tick step must be a non-negative number.");
     if (t === 0)
       return this._publisher.subscribe("tick", e);
     let n = 0;
@@ -5192,7 +5198,7 @@ class ne extends F {
   }
   [Symbol.toStringTag] = "Clock";
 }
-class se extends F {
+class re extends C {
   /**
    * The total duration of the countdown in milliseconds.
    *
@@ -5257,9 +5263,9 @@ class se extends F {
    */
   _deferrerStop(e) {
     if (!this._isRunning)
-      throw new _("The countdown hadn't yet started.");
+      throw new y("The countdown hadn't yet started.");
     if (!this._deferrer)
-      throw new x();
+      throw new g();
     this._stop(), this._handle = void 0, this._isRunning = !1, e !== void 0 ? this._deferrer.reject(e) : this._deferrer.resolve(), this._deferrer = void 0;
   }
   /**
@@ -5285,10 +5291,10 @@ class se extends F {
    */
   start(e = this.duration) {
     if (this._isRunning)
-      throw new _("The countdown had already stopped or hadn't yet started.");
+      throw new y("The countdown had already stopped or hadn't yet started.");
     if (this._deferrer)
-      throw new x();
-    return this._deferrer = new R(), super.start(this.duration - e), this._publisher.publish("start"), this._deferrer;
+      throw new g();
+    return this._deferrer = new F(), super.start(this.duration - e), this._publisher.publish("start"), this._deferrer;
   }
   /**
    * Stops the execution of the countdown.
@@ -5340,7 +5346,7 @@ class se extends F {
    */
   onTick(e, t = 0) {
     if (t < 0)
-      throw new b("The tick step must be a non-negative number.");
+      throw new x("The tick step must be a non-negative number.");
     if (t === 0)
       return this._publisher.subscribe("tick", e);
     let n = this.remainingTime;
@@ -5370,7 +5376,7 @@ class se extends F {
   }
   [Symbol.toStringTag] = "Countdown";
 }
-class re {
+class ie {
   /**
    * Generates a given number of values following a linear curve.  
    * The values are equally spaced and normalized between 0 and 1.
@@ -5428,7 +5434,7 @@ class re {
    */
   static Exponential(e, t = 2) {
     if (t < 0)
-      throw new f("The base of the exponential curve cannot be negative.");
+      throw new u("The base of the exponential curve cannot be negative.");
     const n = e - 1;
     return new l(function* () {
       for (let s = 0; s < e; s += 1)
@@ -5439,7 +5445,7 @@ class re {
   }
   [Symbol.toStringTag] = "Curve";
 }
-class C {
+class P {
   /**
    * Generates a random boolean value.
    *
@@ -5487,7 +5493,7 @@ class C {
    */
   static Index(e) {
     if (e.length === 0)
-      throw new f("You must provide at least one element.");
+      throw new u("You must provide at least one element.");
     return this.Integer(e.length);
   }
   /**
@@ -5505,35 +5511,67 @@ class C {
    * @returns A random element from the given array.
    */
   static Choice(e) {
-    return e[C.Index(e)];
+    return e[P.Index(e)];
+  }
+  static Sample(e, t, n) {
+    const s = e.length;
+    if (s === 0)
+      throw new u("You must provide at least one element.");
+    if (t < 0)
+      throw new u("Count must be non-negative.");
+    if (t > s)
+      throw new u("Count cannot exceed the number of elements.");
+    if (t === 0)
+      return [];
+    if (n === void 0) {
+      const a = [...e], f = new Array(t);
+      for (let _ = 0; _ < t; _ += 1) {
+        const T = this.Integer(_, s);
+        f[_] = a[T], a[T] = a[_];
+      }
+      return f;
+    }
+    if (n.length !== s)
+      throw new u("Weights array must have the same length as elements array.");
+    const r = new Array(s);
+    for (let a = 0; a < s; a += 1) {
+      if (n[a] <= 0)
+        throw new u(`Weight for element #${a} must be greater than zero.`);
+      r[a] = { index: a, key: Math.pow(Math.random(), 1 / n[a]) };
+    }
+    r.sort((a, f) => f.key - a.key);
+    const o = new Array(t);
+    for (let a = 0; a < t; a += 1)
+      o[a] = e[r[a].index];
+    return o;
   }
   constructor() {
   }
   [Symbol.toStringTag] = "Random";
 }
-function ie(i) {
+function oe(i) {
   return new m((e) => setTimeout(e, i));
 }
-function oe() {
+function ae() {
   return new m((i) => requestAnimationFrame(() => i()));
 }
-function ae() {
+function le() {
   return new m((i) => setTimeout(i));
 }
-function le(i, e = "text/javascript") {
+function ue(i, e = "text/javascript") {
   return new m((t, n) => {
     const s = document.createElement("script");
     s.async = !0, s.defer = !0, s.src = i, s.type = e, s.onload = (r) => t(), s.onerror = (r) => n(r), document.body.appendChild(s);
   });
 }
-function ue(...i) {
+function ce(...i) {
   return new l(function* () {
     for (const e of i)
       for (const t of e)
         yield t;
   });
 }
-function ce(i) {
+function he(i) {
   if (i instanceof Array)
     return i.length;
   let e = 0;
@@ -5541,16 +5579,16 @@ function ce(i) {
     e += 1;
   return e;
 }
-function he(i) {
+function fe(i) {
   return new l(function* () {
     let e = 0;
     for (const t of i)
       yield [e, t], e += 1;
   });
 }
-function fe(i, e, t = 1) {
+function de(i, e, t = 1) {
   if (t <= 0)
-    throw new b(
+    throw new x(
       "Step must be always a positive number, even when generating numbers in reverse order."
     );
   return e === void 0 && (e = i, i = 0), i > e ? new l(function* () {
@@ -5561,7 +5599,7 @@ function fe(i, e, t = 1) {
       yield n;
   });
 }
-function de(i) {
+function we(i) {
   const e = Array.from(i);
   for (let t = e.length - 1; t > 0; t -= 1) {
     const n = Math.floor(Math.random() * (t + 1));
@@ -5576,7 +5614,7 @@ function me(i) {
       e.has(t) || (e.add(t), yield t);
   });
 }
-function A(i, e) {
+function D(i, e) {
   const t = i[Symbol.iterator](), n = e[Symbol.iterator]();
   return new l(function* () {
     for (; ; ) {
@@ -5587,28 +5625,28 @@ function A(i, e) {
     }
   });
 }
-function we(i, e) {
+function _e(i, e) {
   if (e === void 0) {
     let r = 0, o = 0;
     for (const a of i)
       r += a, o += 1;
     if (o === 0)
-      throw new f("You must provide at least one value.");
+      throw new u("You must provide at least one value.");
     return r / o;
   }
   let t = 0, n = 0, s = 0;
-  for (const [r, o] of A(i, e)) {
+  for (const [r, o] of D(i, e)) {
     if (o <= 0)
-      throw new f(`The weight for the value #${s} must be greater than zero.`);
+      throw new u(`The weight for the value #${s} must be greater than zero.`);
     t += r * o, n += o, s += 1;
   }
   if (s === 0)
-    throw new f("You must provide at least one value and weight.");
+    throw new u("You must provide at least one value and weight.");
   if (n <= 0)
-    throw new f("The sum of weights must be greater than zero.");
+    throw new u("The sum of weights must be greater than zero.");
   return t / n;
 }
-function _e(i) {
+function pe(i) {
   let e = 0;
   for (let t = 0; t < i.length; t += 1) {
     const n = i.charCodeAt(t);
@@ -5616,78 +5654,78 @@ function _e(i) {
   }
   return e;
 }
-function pe(i) {
+function ye(i) {
   let e = 0;
   for (const t of i)
     e += t;
   return e;
 }
-function ye(i) {
+function be(i) {
   return `${i.charAt(0).toUpperCase()}${i.slice(1)}`;
 }
-const be = "2.2.1";
+const xe = "2.2.3";
 export {
-  w as AggregatedAsyncIterator,
-  h as AggregatedIterator,
-  M as CallableObject,
-  K as CallbackChain,
-  ne as Clock,
-  se as Countdown,
-  re as Curve,
-  R as DeferredPromise,
-  j as EnvironmentException,
-  c as Exception,
-  x as FatalErrorException,
-  E as FileException,
+  p as AggregatedAsyncIterator,
+  d as AggregatedIterator,
+  R as CallableObject,
+  Q as CallbackChain,
+  se as Clock,
+  re as Countdown,
+  ie as Curve,
+  F as DeferredPromise,
+  O as EnvironmentException,
+  h as Exception,
+  g as FatalErrorException,
+  M as FileException,
   J as FileExistsException,
-  Y as FileNotFoundException,
-  F as GameLoop,
-  Z as JSONStorage,
-  p as KeyException,
-  H as MapView,
-  L as NetworkException,
-  P as NotImplementedException,
-  V as PermissionException,
-  W as PromiseQueue,
-  g as Publisher,
-  C as Random,
-  b as RangeException,
-  u as ReducedIterator,
+  L as FileNotFoundException,
+  C as GameLoop,
+  W as JSONStorage,
+  b as KeyException,
+  X as MapView,
+  V as NetworkException,
+  j as NotImplementedException,
+  G as PermissionException,
+  U as PromiseQueue,
+  v as Publisher,
+  P as Random,
+  x as RangeException,
+  c as ReducedIterator,
   k as ReferenceException,
-  _ as RuntimeException,
-  X as SetView,
-  d as SmartAsyncIterator,
+  y as RuntimeException,
+  Z as SetView,
+  w as SmartAsyncIterator,
   l as SmartIterator,
   m as SmartPromise,
-  Q as SwitchableCallback,
+  H as SwitchableCallback,
   S as TimeUnit,
-  z as TimedPromise,
-  O as TimeoutException,
-  G as TypeException,
-  be as VERSION,
-  f as ValueException,
-  $ as WeekDay,
-  we as average,
-  ye as capitalize,
-  ue as chain,
-  ce as count,
-  U as dateDifference,
-  ee as dateRange,
-  I as dateRound,
-  ie as delay,
-  he as enumerate,
-  te as getWeek,
-  _e as hash,
-  T as isBrowser,
-  D as isNode,
-  B as isWorker,
-  le as loadScript,
-  oe as nextAnimationFrame,
-  fe as range,
-  de as shuffle,
-  pe as sum,
+  q as TimedPromise,
+  N as TimeoutException,
+  K as TypeException,
+  xe as VERSION,
+  u as ValueException,
+  I as WeekDay,
+  _e as average,
+  be as capitalize,
+  ce as chain,
+  he as count,
+  ee as dateDifference,
+  te as dateRange,
+  $ as dateRound,
+  oe as delay,
+  fe as enumerate,
+  ne as getWeek,
+  pe as hash,
+  E as isBrowser,
+  B as isNode,
+  Y as isWorker,
+  ue as loadScript,
+  ae as nextAnimationFrame,
+  de as range,
+  we as shuffle,
+  ye as sum,
   me as unique,
-  ae as yieldToEventLoop,
-  A as zip
+  le as yieldToEventLoop,
+  D as zip
 };
 //# sourceMappingURL=core.esm.js.map