@byloth/core 2.1.8 → 2.2.0

package/dist/core.esm.js

@@ -1,4 +1,4 @@
-const T = typeof window < "u" && typeof window.document < "u", A = typeof process < "u" && !!process.versions?.node, B = typeof self == "object" && self.constructor?.name === "DedicatedWorkerGlobalScope";
+const T = typeof window < "u" && typeof window.document < "u", D = typeof process < "u" && !!process.versions?.node, B = typeof self == "object" && self.constructor?.name === "DedicatedWorkerGlobalScope";
 class c extends Error {
   /**
    * A static method to convert a generic caught error, ensuring it's an instance of the {@link Exception} class.
@@ -78,7 +78,7 @@ class x extends c {
   }
   [Symbol.toStringTag] = "FatalErrorException";
 }
-class P extends x {
+class C extends x {
   /**
    * Initializes a new instance of the {@link NotImplementedException} class.
    *
@@ -276,7 +276,7 @@ class p extends c {
   }
   [Symbol.toStringTag] = "RuntimeException";
 }
-class j extends p {
+class P extends p {
   /**
    * Initializes a new instance of the {@link EnvironmentException} class.
    *
@@ -298,7 +298,7 @@ class j extends p {
   }
   [Symbol.toStringTag] = "EnvironmentException";
 }
-class C extends c {
+class j extends c {
   /**
    * Initializes a new instance of the {@link TimeoutException} class.
    *
@@ -532,16 +532,16 @@ class l {
   reduce(e, t) {
     let n = 0, s = t;
     if (s === void 0) {
-      const i = this._iterator.next();
-      if (i.done)
+      const r = this._iterator.next();
+      if (r.done)
         throw new f("Cannot reduce an empty iterator without an initial value.");
-      s = i.value, n += 1;
+      s = r.value, n += 1;
     }
     for (; ; ) {
-      const i = this._iterator.next();
-      if (i.done)
+      const r = this._iterator.next();
+      if (r.done)
         return s;
-      s = e(s, i.value, n), n += 1;
+      s = e(s, r.value, n), n += 1;
     }
   }
   /**
@@ -583,12 +583,12 @@ class l {
         const s = t.next();
         if (s.done)
           return s.value;
-        const i = e(s.value, n);
-        if (i instanceof Array)
-          for (const o of i)
+        const r = e(s.value, n);
+        if (r instanceof Array)
+          for (const o of r)
             yield o;
         else
-          yield i;
+          yield r;
         n += 1;
       }
     });
@@ -1082,8 +1082,8 @@ class u {
   filter(e) {
     const t = this._elements.enumerate();
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        e(s, i, n) && (yield [s, i]);
+      for (const [n, [s, r]] of t)
+        e(s, r, n) && (yield [s, r]);
     });
   }
   /**
@@ -1122,20 +1122,20 @@ class u {
   map(e) {
     const t = this._elements.enumerate();
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        yield [s, e(s, i, n)];
+      for (const [n, [s, r]] of t)
+        yield [s, e(s, r, n)];
     });
   }
   reduce(e, t) {
     let n = 0, s = t;
     if (s === void 0) {
-      const i = this._elements.next();
-      if (i.done)
+      const r = this._elements.next();
+      if (r.done)
         throw new f("Cannot reduce an empty iterator without an initial value.");
-      s = i.value[1], n += 1;
+      s = r.value[1], n += 1;
     }
-    for (const [i, o] of this._elements)
-      s = e(i, s, o, n), n += 1;
+    for (const [r, o] of this._elements)
+      s = e(r, s, o, n), n += 1;
     return s;
   }
   /**
@@ -1174,8 +1174,8 @@ class u {
   flatMap(e) {
     const t = this._elements.enumerate();
     return new h(function* () {
-      for (const [n, [s, i]] of t) {
-        const o = e(s, i, n);
+      for (const [n, [s, r]] of t) {
+        const o = e(s, r, n);
         if (o instanceof Array)
           for (const a of o)
             yield [s, a];
@@ -1220,8 +1220,8 @@ class u {
   drop(e) {
     const t = this._elements.enumerate();
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        n >= e && (yield [s, i]);
+      for (const [n, [s, r]] of t)
+        n >= e && (yield [s, r]);
     });
   }
   /**
@@ -1262,10 +1262,10 @@ class u {
   take(e) {
     const t = this._elements.enumerate();
     return new u(function* () {
-      for (const [n, [s, i]] of t) {
+      for (const [n, [s, r]] of t) {
         if (n >= e)
           break;
-        yield [s, i];
+        yield [s, r];
       }
     });
   }
@@ -1428,8 +1428,8 @@ class u {
   reorganizeBy(e) {
     const t = this._elements.enumerate();
     return new h(function* () {
-      for (const [n, [s, i]] of t)
-        yield [e(s, i, n), i];
+      for (const [n, [s, r]] of t)
+        yield [e(s, r, n), r];
     });
   }
   /**
@@ -1647,12 +1647,12 @@ class m {
   async every(e) {
     const t = /* @__PURE__ */ new Map();
     for await (const [n, s] of this._elements) {
-      const [i, o] = t.get(n) ?? [0, !0];
-      o && t.set(n, [i + 1, await e(n, s, i)]);
+      const [r, o] = t.get(n) ?? [0, !0];
+      o && t.set(n, [r + 1, await e(n, s, r)]);
     }
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        yield [n, i];
+      for (const [n, [s, r]] of t)
+        yield [n, r];
     });
   }
   /**
@@ -1689,21 +1689,21 @@ class m {
   async some(e) {
     const t = /* @__PURE__ */ new Map();
     for await (const [n, s] of this._elements) {
-      const [i, o] = t.get(n) ?? [0, !1];
-      o || t.set(n, [i + 1, await e(n, s, i)]);
+      const [r, o] = t.get(n) ?? [0, !1];
+      o || t.set(n, [r + 1, await e(n, s, r)]);
     }
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        yield [n, i];
+      for (const [n, [s, r]] of t)
+        yield [n, r];
     });
   }
   filter(e) {
     const t = this._elements;
     return new m(async function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [s, i] of t) {
+      for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        await e(s, i, o) && (yield [s, i]), n.set(s, o + 1);
+        await e(s, r, o) && (yield [s, r]), n.set(s, o + 1);
       }
     });
   }
@@ -1743,28 +1743,28 @@ class m {
     const t = this._elements;
     return new m(async function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [s, i] of t) {
+      for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        yield [s, await e(s, i, o)], n.set(s, o + 1);
+        yield [s, await e(s, r, o)], n.set(s, o + 1);
       }
     });
   }
   async reduce(e, t) {
     const n = /* @__PURE__ */ new Map();
-    for await (const [s, i] of this._elements) {
+    for await (const [s, r] of this._elements) {
       let o, a;
       if (n.has(s))
         [o, a] = n.get(s);
       else if (t !== void 0)
         o = 0, t instanceof Function ? a = await t(s) : a = await t;
       else {
-        n.set(s, [0, i]);
+        n.set(s, [0, r]);
         continue;
       }
-      n.set(s, [o + 1, await e(s, a, i, o)]);
+      n.set(s, [o + 1, await e(s, a, r, o)]);
     }
     return new u(function* () {
-      for (const [s, [i, o]] of n)
+      for (const [s, [r, o]] of n)
         yield [s, o];
     });
   }
@@ -1808,8 +1808,8 @@ class m {
     const t = this._elements;
     return new m(async function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [s, i] of t) {
-        const o = n.get(s) ?? 0, a = await e(s, i, o);
+      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];
@@ -1852,13 +1852,13 @@ class m {
     const t = this._elements;
     return new m(async function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [s, i] of t) {
+      for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
         if (o < e) {
           n.set(s, o + 1);
           continue;
         }
-        yield [s, i];
+        yield [s, r];
       }
     });
   }
@@ -1895,21 +1895,21 @@ class m {
     const t = this._elements;
     return new m(async function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [s, i] of t) {
+      for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        o >= e || (yield [s, i], n.set(s, o + 1));
+        o >= e || (yield [s, r], n.set(s, o + 1));
       }
     });
   }
   async find(e) {
     const t = /* @__PURE__ */ new Map();
     for await (const [n, s] of this._elements) {
-      let [i, o] = t.get(n) ?? [0, void 0];
-      o === void 0 && (await e(n, s, i) && (o = s), t.set(n, [i + 1, o]));
+      let [r, o] = t.get(n) ?? [0, void 0];
+      o === void 0 && (await e(n, s, r) && (o = s), t.set(n, [r + 1, o]));
     }
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        yield [n, i];
+      for (const [n, [s, r]] of t)
+        yield [n, r];
     });
   }
   /**
@@ -1972,8 +1972,8 @@ class m {
     return new m(async function* () {
       const t = /* @__PURE__ */ new Map();
       for await (const [n, s] of e) {
-        const i = t.get(n) ?? /* @__PURE__ */ new Set();
-        i.has(s) || (i.add(s), t.set(n, i), yield [n, s]);
+        const r = t.get(n) ?? /* @__PURE__ */ new Set();
+        r.has(s) || (r.add(s), t.set(n, r), yield [n, s]);
       }
     });
   }
@@ -2039,8 +2039,8 @@ class m {
   async forEach(e) {
     const t = /* @__PURE__ */ new Map();
     for await (const [n, s] of this._elements) {
-      const i = t.get(n) ?? 0;
-      await e(n, s, i), t.set(n, i + 1);
+      const r = t.get(n) ?? 0;
+      await e(n, s, r), t.set(n, r + 1);
     }
   }
   /**
@@ -2078,9 +2078,9 @@ class m {
     const t = this._elements;
     return new m(async function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [s, i] of t) {
+      for await (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        yield [await e(s, i, o), i], n.set(s, o + 1);
+        yield [await e(s, r, o), r], n.set(s, o + 1);
       }
     });
   }
@@ -2443,16 +2443,16 @@ class d {
   async reduce(e, t) {
     let n = 0, s = t;
     if (s === void 0) {
-      const i = await this._iterator.next();
-      if (i.done)
+      const r = await this._iterator.next();
+      if (r.done)
         throw new f("Cannot reduce an empty iterator without an initial value.");
-      s = i.value, n += 1;
+      s = r.value, n += 1;
     }
     for (; ; ) {
-      const i = await this._iterator.next();
-      if (i.done)
+      const r = await this._iterator.next();
+      if (r.done)
         return s;
-      s = await e(s, i.value, n), n += 1;
+      s = await e(s, r.value, n), n += 1;
     }
   }
   /**
@@ -2494,12 +2494,12 @@ class d {
         const s = await t.next();
         if (s.done)
           return s.value;
-        const i = await e(s.value, n);
-        if (i instanceof Array)
-          for (const o of i)
+        const r = await e(s.value, n);
+        if (r instanceof Array)
+          for (const o of r)
             yield o;
         else
-          yield i;
+          yield r;
         n += 1;
       }
     });
@@ -2956,12 +2956,12 @@ class h {
   every(e) {
     const t = /* @__PURE__ */ new Map();
     for (const [n, s] of this._elements) {
-      const [i, o] = t.get(n) ?? [0, !0];
-      o && t.set(n, [i + 1, e(n, s, i)]);
+      const [r, o] = t.get(n) ?? [0, !0];
+      o && t.set(n, [r + 1, e(n, s, r)]);
     }
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        yield [n, i];
+      for (const [n, [s, r]] of t)
+        yield [n, r];
     });
   }
   /**
@@ -2997,21 +2997,21 @@ class h {
   some(e) {
     const t = /* @__PURE__ */ new Map();
     for (const [n, s] of this._elements) {
-      const [i, o] = t.get(n) ?? [0, !1];
-      o || t.set(n, [i + 1, e(n, s, i)]);
+      const [r, o] = t.get(n) ?? [0, !1];
+      o || t.set(n, [r + 1, e(n, s, r)]);
     }
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        yield [n, i];
+      for (const [n, [s, r]] of t)
+        yield [n, r];
     });
   }
   filter(e) {
     const t = this._elements;
     return new h(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [s, i] of t) {
+      for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        e(s, i, o) && (yield [s, i]), n.set(s, o + 1);
+        e(s, r, o) && (yield [s, r]), n.set(s, o + 1);
       }
     });
   }
@@ -3051,28 +3051,28 @@ class h {
     const t = this._elements;
     return new h(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [s, i] of t) {
+      for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        yield [s, e(s, i, o)], n.set(s, o + 1);
+        yield [s, e(s, r, o)], n.set(s, o + 1);
       }
     });
   }
   reduce(e, t) {
     const n = /* @__PURE__ */ new Map();
-    for (const [s, i] of this._elements) {
+    for (const [s, r] of this._elements) {
       let o, a;
       if (n.has(s))
         [o, a] = n.get(s);
       else if (t !== void 0)
         o = 0, t instanceof Function ? a = t(s) : a = t;
       else {
-        n.set(s, [0, i]);
+        n.set(s, [0, r]);
         continue;
       }
-      n.set(s, [o + 1, e(s, a, i, o)]);
+      n.set(s, [o + 1, e(s, a, r, o)]);
     }
     return new u(function* () {
-      for (const [s, [i, o]] of n)
+      for (const [s, [r, o]] of n)
         yield [s, o];
     });
   }
@@ -3116,8 +3116,8 @@ class h {
     const t = this._elements;
     return new h(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [s, i] of t) {
-        const o = n.get(s) ?? 0, a = e(s, i, o);
+      for (const [s, r] of t) {
+        const o = n.get(s) ?? 0, a = e(s, r, o);
         if (a instanceof Array)
           for (const y of a)
             yield [s, y];
@@ -3160,13 +3160,13 @@ class h {
     const t = this._elements;
     return new h(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [s, i] of t) {
+      for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
         if (o < e) {
           n.set(s, o + 1);
           continue;
         }
-        yield [s, i];
+        yield [s, r];
       }
     });
   }
@@ -3203,21 +3203,21 @@ class h {
     const t = this._elements;
     return new h(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [s, i] of t) {
+      for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        o >= e || (yield [s, i], n.set(s, o + 1));
+        o >= e || (yield [s, r], n.set(s, o + 1));
       }
     });
   }
   find(e) {
     const t = /* @__PURE__ */ new Map();
     for (const [n, s] of this._elements) {
-      let [i, o] = t.get(n) ?? [0, void 0];
-      o === void 0 && (e(n, s, i) && (o = s), t.set(n, [i + 1, o]));
+      let [r, o] = t.get(n) ?? [0, void 0];
+      o === void 0 && (e(n, s, r) && (o = s), t.set(n, [r + 1, o]));
     }
     return new u(function* () {
-      for (const [n, [s, i]] of t)
-        yield [n, i];
+      for (const [n, [s, r]] of t)
+        yield [n, r];
     });
   }
   /**
@@ -3280,8 +3280,8 @@ class h {
     return new h(function* () {
       const t = /* @__PURE__ */ new Map();
       for (const [n, s] of e) {
-        const i = t.get(n) ?? /* @__PURE__ */ new Set();
-        i.has(s) || (i.add(s), t.set(n, i), yield [n, s]);
+        const r = t.get(n) ?? /* @__PURE__ */ new Set();
+        r.has(s) || (r.add(s), t.set(n, r), yield [n, s]);
       }
     });
   }
@@ -3344,8 +3344,8 @@ class h {
   forEach(e) {
     const t = /* @__PURE__ */ new Map();
     for (const [n, s] of this._elements) {
-      const i = t.get(n) ?? 0;
-      e(n, s, i), t.set(n, i + 1);
+      const r = t.get(n) ?? 0;
+      e(n, s, r), t.set(n, r + 1);
     }
   }
   /**
@@ -3383,9 +3383,9 @@ class h {
     const t = this._elements;
     return new h(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [s, i] of t) {
+      for (const [s, r] of t) {
         const o = n.get(s) ?? 0;
-        yield [e(s, i, o), i], n.set(s, o + 1);
+        yield [e(s, r, o), r], n.set(s, o + 1);
       }
     });
   }
@@ -3643,7 +3643,7 @@ class g {
   }
   publish(e, ...t) {
     let n, s = this._subscribers.get(e);
-    return s ? n = s.slice().map((i) => i(...t)) : n = [], e.startsWith("__") || (s = this._subscribers.get("*"), s && s.slice().forEach((i) => i(e, ...t))), n;
+    return s ? n = s.slice().map((r) => r(...t)) : n = [], e.startsWith("__") || (s = this._subscribers.get("*"), s && s.slice().forEach((r) => r(e, ...t))), n;
   }
   subscribe(e, t) {
     const n = this._subscribers.get(e) ?? [];
@@ -3741,7 +3741,7 @@ class K extends O {
   _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 C(
         "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);
@@ -3926,7 +3926,7 @@ class Q extends Map {
    * @returns The current instance of the {@link MapView} class.
    */
   set(e, t) {
-    return super.set(e, t), this._publisher.publish("entry:add", e, t), this;
+    return super.set(e, t), this._publisher.publish("add", e, t), this;
   }
   /**
    * Removes an entry with a specified key from the {@link Map}.
@@ -3950,7 +3950,7 @@ class Q extends Map {
    */
   delete(e) {
     const t = this.get(e);
-    return t === void 0 ? !1 : (super.delete(e), this._publisher.publish("entry:remove", e, t), !0);
+    return t === void 0 ? !1 : (super.delete(e), this._publisher.publish("remove", e, t), !0);
   }
   /**
    * Removes all entries from the {@link Map}.
@@ -3967,66 +3967,71 @@ class Q extends Map {
    */
   clear() {
     const e = this.size;
-    super.clear(), e > 0 && this._publisher.publish("collection:clear");
+    super.clear(), e > 0 && this._publisher.publish("clear");
   }
   /**
-   * Subscribes to an event and adds a callback to be executed when the event is published.
+   * Subscribes to the `add` event of the map with a callback that will be executed when an entry is added.
    *
    * ---
    *
    * @example
    * ```ts
-   * const map = new MapView<string, number>();
-   * const unsubscribe = map.subscribe("entry:add", (key: string, value: number) =>
-   * {
-   *     if (key === "answer") { unsubscribe(); }
-   *     console.log(`Added ${key}: ${value}`);
-   * });
+   * map.onAdd((key, value) => console.log(`Added ${key}: ${value}`));
    *
    * map.set("key1", 2); // "Added key1: 2"
    * map.set("answer", 42); // "Added answer: 42"
-   * map.set("key2", 4);
-   * map.set("key3", 8);
    * ```
    *
    * ---
    *
-   * @template T The key of the map containing the callback signature to subscribe.
-   *
-   * @param event The name of the event to subscribe to.
-   * @param subscriber The callback to execute when the event is published.
+   * @param callback The callback that will be executed when an entry is added to the map.
    *
-   * @returns A function that can be used to unsubscribe the callback from the event.
+   * @returns A function that can be used to unsubscribe from the event.
    */
-  subscribe(e, t) {
-    return this._publisher.subscribe(e, t);
+  onAdd(e) {
+    return this._publisher.subscribe("add", e);
   }
   /**
-   * Unsubscribes from an event and removes a callback from being executed when the event is published.
+   * Subscribes to the `remove` event of the map with a callback that will be executed when an entry is removed.
    *
    * ---
    *
    * @example
    * ```ts
-   * const callback = (key: string, value: number) => console.log(`Added ${key}: ${value}`);
-   * const map = new MapView<string, number>();
+   * map.onRemove((key, value) => console.log(`Removed ${key}: ${value}`));
    *
-   * map.subscribe("entry:add", callback);
-   * map.set("key1", 2); // "Added key1: 2"
+   * map.delete("key1"); // "Removed key1: 2"
+   * map.delete("answer"); // "Removed answer: 42"
+   * ```
+   *
+   * ---
    *
-   * map.unsubscribe("entry:add", callback);
-   * map.set("key2", 4);
+   * @param callback The callback that will be executed when an entry is removed from the map.
+   *
+   * @returns A function that can be used to unsubscribe from the event.
+   */
+  onRemove(e) {
+    return this._publisher.subscribe("remove", e);
+  }
+  /**
+   * Subscribes to the `clear` event of the map with a callback that will be executed when the map is cleared.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * map.onClear(() => console.log("The map has all been cleared."));
+   * map.clear(); // "The map has all been cleared."
    * ```
    *
    * ---
    *
-   * @template T The key of the map containing the callback signature to unsubscribe.
+   * @param callback The callback that will be executed when the map is cleared.
    *
-   * @param event The name of the event to unsubscribe from.
-   * @param subscriber The callback to remove from the event.
+   * @returns A function that can be used to unsubscribe from the event.
    */
-  unsubscribe(e, t) {
-    this._publisher.unsubscribe(e, t);
+  onClear(e) {
+    return this._publisher.subscribe("clear", e);
   }
   [Symbol.toStringTag] = "MapView";
 }
@@ -4077,7 +4082,7 @@ class H extends Set {
    * @returns The current instance of the {@link SetView} class.
    */
   add(e) {
-    return super.add(e), this._publisher.publish("entry:add", e), this;
+    return super.add(e), this._publisher.publish("add", e), this;
   }
   /**
    * Removes the specified value from the {@link Set}.
@@ -4101,7 +4106,7 @@ class H extends Set {
    */
   delete(e) {
     const t = super.delete(e);
-    return t && this._publisher.publish("entry:remove", e), t;
+    return t && this._publisher.publish("remove", e), t;
   }
   /**
    * Removes all entries from the {@link Set}.
@@ -4118,66 +4123,71 @@ class H extends Set {
    */
   clear() {
     const e = this.size;
-    super.clear(), e > 0 && this._publisher.publish("collection:clear");
+    super.clear(), e > 0 && this._publisher.publish("clear");
   }
   /**
-   * Subscribes to an event and adds a callback to be executed when the event is published.
+   * Subscribes to the `add` event of the set with a callback that will be executed when a value is added.
    *
    * ---
    *
    * @example
    * ```ts
-   * const set = new SetView<number>();
-   * const unsubscribe = set.subscribe("entry:add", (value: number) =>
-   * {
-   *     if (value === 42) { unsubscribe(); }
-   *     console.log(`Added ${value}`);
-   * });
+   * set.onAdd((value) => console.log(`Added ${value}`));
    *
    * set.add(2); // "Added 2"
    * set.add(42); // "Added 42"
-   * set.add(4);
-   * set.add(8);
    * ```
    *
    * ---
    *
-   * @template K The key of the map containing the callback signature to subscribe.
-   *
-   * @param event The name of the event to subscribe to.
-   * @param subscriber The callback to execute when the event is published.
+   * @param callback The callback that will be executed when a value is added to the set.
    *
-   * @returns A function that can be used to unsubscribe the callback from the event.
+   * @returns A function that can be used to unsubscribe from the event.
    */
-  subscribe(e, t) {
-    return this._publisher.subscribe(e, t);
+  onAdd(e) {
+    return this._publisher.subscribe("add", e);
   }
   /**
-   * Unsubscribes from an event and removes a callback from being executed when the event is published.
+   * Subscribes to the `remove` event of the set with a callback that will be executed when a value is removed.
    *
    * ---
    *
    * @example
    * ```ts
-   * const callback = (value: number) => console.log(`Added ${value}`);
-   * const set = new SetView<number>();
+   * set.onRemove((value) => console.log(`Removed ${value}`));
    *
-   * set.subscribe("entry:add", callback);
-   * set.add(2); // "Added 2"
+   * set.delete(2); // "Removed 2"
+   * set.delete(42); // "Removed 42"
+   * ```
+   *
+   * ---
    *
-   * set.unsubscribe("entry:add", callback);
-   * set.add(4);
+   * @param callback The callback that will be executed when a value is removed from the set.
+   *
+   * @returns A function that can be used to unsubscribe from the event.
+   */
+  onRemove(e) {
+    return this._publisher.subscribe("remove", e);
+  }
+  /**
+   * Subscribes to the `clear` event of the set with a callback that will be executed when the set is cleared.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * set.onClear(() => console.log("The set has all been cleared."));
+   * set.clear(); // "The set has all been cleared."
    * ```
    *
    * ---
    *
-   * @template K The key of the map containing the callback signature to unsubscribe.
+   * @param callback The callback that will be executed when the set is cleared.
    *
-   * @param event The name of the event to unsubscribe from.
-   * @param subscriber The callback to remove from the event.
+   * @returns A function that can be used to unsubscribe from the event.
    */
-  unsubscribe(e, t) {
-    this._publisher.unsubscribe(e, t);
+  onClear(e) {
+    return this._publisher.subscribe("clear", e);
   }
   [Symbol.toStringTag] = "SetView";
 }
@@ -4216,7 +4226,7 @@ class X {
    */
   constructor(e = !0) {
     if (!T)
-      throw new j(
+      throw new P(
         "The `JSONStorage` class can only be instantiated within a browser environment."
       );
     this._preferPersistence = e, this._volatile = window.sessionStorage, this._persistent = window.localStorage;
@@ -4666,8 +4676,8 @@ class M extends w {
    */
   constructor(e, t) {
     let n, s;
-    super((i, o) => {
-      n = i, s = o;
+    super((r, o) => {
+      n = r, s = o;
     }), this._promise = this._promise.then(e, t), this._resolve = n, this._reject = s;
   }
   /**
@@ -4720,12 +4730,12 @@ class $ extends w {
    */
   constructor(e, t) {
     super((n, s) => {
-      const i = (v) => {
+      const r = (v) => {
         clearTimeout(y), n(v);
       }, o = (v) => {
         clearTimeout(y), s(v);
-      }, y = setTimeout(() => o(new C("The operation has timed out.")), t);
-      e(i, o);
+      }, y = setTimeout(() => o(new j("The operation has timed out.")), t);
+      e(r, o);
     });
   }
   [Symbol.toStringTag] = "TimedPromise";
@@ -4767,33 +4777,33 @@ class Z extends w {
       const s = e;
       e = () => (s.resolve(), s);
     }
-    const n = (s, i) => {
+    const n = (s, r) => {
       this._promise = this._promise.then(e).then((o) => {
         this._count -= 1, s(o);
       }).catch((o) => {
-        this._count -= 1, i(o);
+        this._count -= 1, r(o);
       });
     };
     return t ? new $(n, t) : new w(n);
   }
   [Symbol.toStringTag] = "PromiseQueue";
 }
-var k = /* @__PURE__ */ ((r) => (r[r.Millisecond = 1] = "Millisecond", r[r.Second = 1e3] = "Second", r[r.Minute = 6e4] = "Minute", r[r.Hour = 36e5] = "Hour", r[r.Day = 864e5] = "Day", r[r.Week = 6048e5] = "Week", r[r.Month = 2592e6] = "Month", r[r.Year = 31536e6] = "Year", r))(k || {}), z = /* @__PURE__ */ ((r) => (r[r.Sunday = 0] = "Sunday", r[r.Monday = 1] = "Monday", r[r.Tuesday = 2] = "Tuesday", r[r.Wednesday = 3] = "Wednesday", r[r.Thursday = 4] = "Thursday", r[r.Friday = 5] = "Friday", r[r.Saturday = 6] = "Saturday", r))(z || {});
-function W(r, e, t = 864e5) {
+var k = /* @__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))(k || {}), z = /* @__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))(z || {});
+function W(i, e, t = 864e5) {
   let n;
-  return r = new Date(r), e = new Date(e), r < e ? n = Math.floor : n = Math.ceil, n((e.getTime() - r.getTime()) / t);
+  return i = new Date(i), e = new Date(e), i < e ? n = Math.floor : n = Math.ceil, n((e.getTime() - i.getTime()) / t);
 }
-function U(r, e, t = 864e5) {
-  if (r = new Date(r), e = new Date(e), r >= e)
+function U(i, e, t = 864e5) {
+  if (i = new Date(i), e = new Date(e), i >= e)
     throw new b("The end date must be greater than the start date.");
   return new l(function* () {
     const n = e.getTime();
-    let s = r.getTime();
+    let s = i.getTime();
     for (; s < n; )
       yield new Date(s), s += t;
   });
 }
-function I(r, e = 864e5) {
+function I(i, e = 864e5) {
   if (e <= 1)
     throw new b(
       "Rounding a timestamp by milliseconds or less makes no sense.Use the timestamp value directly instead."
@@ -4802,14 +4812,14 @@ function I(r, e = 864e5) {
     throw new b(
       "Rounding by more than a day leads to unexpected results. Consider using other methods to round dates by weeks, months or years."
     );
-  return r = new Date(r), new Date(Math.floor(r.getTime() / e) * e);
+  return i = new Date(i), new Date(Math.floor(i.getTime() / e) * e);
 }
-function ee(r, e = 0) {
-  r = new Date(r);
-  const t = 7 - e, n = (r.getUTCDay() + t) % 7, s = r.getTime() - 864e5 * n;
+function ee(i, e = 0) {
+  i = new Date(i);
+  const t = 7 - e, n = (i.getUTCDay() + t) % 7, s = i.getTime() - 864e5 * n;
   return I(new Date(s));
 }
-class F {
+class R {
   /**
    * 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.
@@ -4977,7 +4987,7 @@ class F {
   }
   [Symbol.toStringTag] = "GameLoop";
 }
-class te extends F {
+class te extends R {
   /**
    * Initializes a new instance of the {@link Clock} class.
    *
@@ -5075,7 +5085,7 @@ class te extends F {
   }
   [Symbol.toStringTag] = "Clock";
 }
-class ne extends F {
+class ne extends R {
   /**
    * The total duration of the countdown in milliseconds.
    *
@@ -5197,26 +5207,6 @@ class ne extends F {
   stop(e) {
     this._deferrerStop(e), this._publisher.publish("stop", e);
   }
-  /**
-   * Subscribes to the `expire` event of the countdown.
-   *
-   * ---
-   *
-   * @example
-   * ```ts
-   * countdown.onExpire(() => { [...] }); // This callback will be executed once the countdown has expired.
-   * countdown.start();
-   * ```
-   *
-   * ---
-   *
-   * @param callback The callback that will be executed when the countdown expires.
-   *
-   * @returns A function that can be used to unsubscribe from the event.
-   */
-  onExpire(e) {
-    return this._publisher.subscribe("expire", e);
-  }
   /**
    * Subscribes to the `tick` event of the countdown.
    *
@@ -5251,6 +5241,26 @@ class ne extends F {
       n - s < t || (e(s), n = s);
     });
   }
+  /**
+   * Subscribes to the `expire` event of the countdown.
+   *
+   * ---
+   *
+   * @example
+   * ```ts
+   * countdown.onExpire(() => { [...] }); // This callback will be executed once the countdown has expired.
+   * countdown.start();
+   * ```
+   *
+   * ---
+   *
+   * @param callback The callback that will be executed when the countdown expires.
+   *
+   * @returns A function that can be used to unsubscribe from the event.
+   */
+  onExpire(e) {
+    return this._publisher.subscribe("expire", e);
+  }
   [Symbol.toStringTag] = "Countdown";
 }
 class se {
@@ -5322,7 +5332,7 @@ class se {
   }
   [Symbol.toStringTag] = "Curve";
 }
-class R {
+class F {
   /**
    * Generates a random boolean value.
    *
@@ -5388,102 +5398,102 @@ class R {
    * @returns A random element from the given array.
    */
   static Choice(e) {
-    return e[R.Index(e)];
+    return e[F.Index(e)];
   }
   constructor() {
   }
   [Symbol.toStringTag] = "Random";
 }
-function ie(r) {
-  return new w((e) => setTimeout(e, r));
+function re(i) {
+  return new w((e) => setTimeout(e, i));
 }
-function re() {
-  return new w((r) => requestAnimationFrame(() => r()));
+function ie() {
+  return new w((i) => requestAnimationFrame(() => i()));
 }
 function oe() {
-  return new w((r) => setTimeout(r));
+  return new w((i) => setTimeout(i));
 }
-function ae(r, e = "text/javascript") {
+function ae(i, e = "text/javascript") {
   return new w((t, n) => {
     const s = document.createElement("script");
-    s.async = !0, s.defer = !0, s.src = r, s.type = e, s.onload = (i) => t(), s.onerror = (i) => n(i), document.body.appendChild(s);
+    s.async = !0, s.defer = !0, s.src = i, s.type = e, s.onload = (r) => t(), s.onerror = (r) => n(r), document.body.appendChild(s);
   });
 }
-function le(...r) {
+function le(...i) {
   return new l(function* () {
-    for (const e of r)
+    for (const e of i)
       for (const t of e)
         yield t;
   });
 }
-function ue(r) {
-  if (r instanceof Array)
-    return r.length;
+function ue(i) {
+  if (i instanceof Array)
+    return i.length;
   let e = 0;
-  for (const t of r)
+  for (const t of i)
     e += 1;
   return e;
 }
-function ce(r) {
+function ce(i) {
   return new l(function* () {
     let e = 0;
-    for (const t of r)
+    for (const t of i)
       yield [e, t], e += 1;
   });
 }
-function he(r, e, t = 1) {
+function he(i, e, t = 1) {
   if (t <= 0)
     throw new b(
       "Step must be always a positive number, even when generating numbers in reverse order."
     );
-  return e === void 0 && (e = r, r = 0), r > e ? new l(function* () {
-    for (let n = r; n > e; n -= t)
+  return e === void 0 && (e = i, i = 0), i > e ? new l(function* () {
+    for (let n = i; n > e; n -= t)
       yield n;
   }) : new l(function* () {
-    for (let n = r; n < e; n += t)
+    for (let n = i; n < e; n += t)
       yield n;
   });
 }
-function fe(r) {
-  const e = Array.from(r);
+function fe(i) {
+  const e = Array.from(i);
   for (let t = e.length - 1; t > 0; t -= 1) {
     const n = Math.floor(Math.random() * (t + 1));
     [e[t], e[n]] = [e[n], e[t]];
   }
   return e;
 }
-function de(r) {
+function de(i) {
   return new l(function* () {
     const e = /* @__PURE__ */ new Set();
-    for (const t of r)
+    for (const t of i)
       e.has(t) || (e.add(t), yield t);
   });
 }
-function D(r, e) {
-  const t = r[Symbol.iterator](), n = e[Symbol.iterator]();
+function A(i, e) {
+  const t = i[Symbol.iterator](), n = e[Symbol.iterator]();
   return new l(function* () {
     for (; ; ) {
-      const s = t.next(), i = n.next();
-      if (s.done || i.done)
+      const s = t.next(), r = n.next();
+      if (s.done || r.done)
         break;
-      yield [s.value, i.value];
+      yield [s.value, r.value];
     }
   });
 }
-function we(r, e) {
+function we(i, e) {
   if (e === void 0) {
-    let i = 0, o = 0;
-    for (const a of r)
-      i += a, o += 1;
+    let r = 0, o = 0;
+    for (const a of i)
+      r += a, o += 1;
     if (o === 0)
       throw new f("You must provide at least one value.");
-    return i / o;
+    return r / o;
   }
   let t = 0, n = 0, s = 0;
-  for (const [i, o] of D(r, e)) {
+  for (const [r, o] of A(i, e)) {
     if (o <= 0)
       throw new f(`The weight for the value #${s} must be greater than zero.`);
-    t += i * o, n += o, s += 1;
+    t += r * o, n += o, s += 1;
   }
   if (s === 0)
     throw new f("You must provide at least one value and weight.");
@@ -5491,24 +5501,24 @@ function we(r, e) {
     throw new f("The sum of weights must be greater than zero.");
   return t / n;
 }
-function me(r) {
+function me(i) {
   let e = 0;
-  for (let t = 0; t < r.length; t += 1) {
-    const n = r.charCodeAt(t);
+  for (let t = 0; t < i.length; t += 1) {
+    const n = i.charCodeAt(t);
     e = (e << 5) - e + n, e |= 0;
   }
   return e;
 }
-function pe(r) {
+function pe(i) {
   let e = 0;
-  for (const t of r)
+  for (const t of i)
     e += t;
   return e;
 }
-function _e(r) {
-  return `${r.charAt(0).toUpperCase()}${r.slice(1)}`;
+function _e(i) {
+  return `${i.charAt(0).toUpperCase()}${i.slice(1)}`;
 }
-const ye = "2.1.8";
+const ye = "2.2.0";
 export {
   m as AggregatedAsyncIterator,
   h as AggregatedIterator,
@@ -5517,22 +5527,22 @@ export {
   ne as Countdown,
   se as Curve,
   M as DeferredPromise,
-  j as EnvironmentException,
+  P as EnvironmentException,
   c as Exception,
   x as FatalErrorException,
   E as FileException,
   J as FileExistsException,
   Y as FileNotFoundException,
-  F as GameLoop,
+  R as GameLoop,
   X as JSONStorage,
   _ as KeyException,
   Q as MapView,
   L as NetworkException,
-  P as NotImplementedException,
+  C as NotImplementedException,
   V as PermissionException,
   Z as PromiseQueue,
   g as Publisher,
-  R as Random,
+  F as Random,
   b as RangeException,
   u as ReducedIterator,
   S as ReferenceException,
@@ -5544,7 +5554,7 @@ export {
   K as SwitchableCallback,
   k as TimeUnit,
   $ as TimedPromise,
-  C as TimeoutException,
+  j as TimeoutException,
   G as TypeException,
   ye as VERSION,
   f as ValueException,
@@ -5556,20 +5566,20 @@ export {
   W as dateDifference,
   U as dateRange,
   I as dateRound,
-  ie as delay,
+  re as delay,
   ce as enumerate,
   ee as getWeek,
   me as hash,
   T as isBrowser,
-  A as isNode,
+  D as isNode,
   B as isWorker,
   ae as loadScript,
-  re as nextAnimationFrame,
+  ie as nextAnimationFrame,
   he as range,
   fe as shuffle,
   pe as sum,
   de as unique,
   oe as yieldToEventLoop,
-  D as zip
+  A as zip
 };
 //# sourceMappingURL=core.esm.js.map