@byloth/core 2.2.6 → 2.2.8

package/dist/core.esm.js

@@ -1,98 +1,98 @@
-var F = typeof window < "u" && typeof window.document < "u", X = typeof process < "u" && !!process.versions?.node, Z = typeof self == "object" && self.constructor?.name === "DedicatedWorkerGlobalScope", f = class T extends Error {
+var j = typeof window < "u" && typeof window.document < "u", W = typeof process < "u" && !!process.versions?.node, U = typeof self == "object" && self.constructor?.name === "DedicatedWorkerGlobalScope", m = class M extends Error {
   static FromUnknown(e) {
-    if (e instanceof T) return e;
+    if (e instanceof M) return e;
     if (e instanceof Error) {
-      const t = new T(e.message);
+      const t = new M(e.message);
       return t.stack = e.stack, t.cause = e.cause, t.name = e.name, t;
     }
-    return new T(`${e}`);
+    return new M(`${e}`);
   }
   constructor(e, t, n = "Exception") {
     super(e), this.cause = t, this.name = n;
   }
   [Symbol.toStringTag] = "Exception";
-}, k = class extends f {
+}, E = class extends m {
   constructor(r, e, t = "FatalErrorException") {
     r === void 0 && (r = "The program has encountered an unrecoverable error and cannot continue as expected. Please, try again later. If the problem persists, contact the support team."), super(r, e, t);
   }
   [Symbol.toStringTag] = "FatalErrorException";
-}, O = class extends k {
+}, B = class extends E {
   constructor(r, e, t = "NotImplementedException") {
     r === void 0 && (r = "This feature isn't implemented yet. Please, try again later."), super(r, e, t);
   }
   [Symbol.toStringTag] = "NotImplementedException";
-}, C = class extends f {
+}, D = class extends m {
   constructor(r, e, t = "FileException") {
     super(r, e, t);
   }
   [Symbol.toStringTag] = "FileException";
-}, W = class extends C {
+}, ee = class extends D {
   constructor(r, e, t = "FileExistsException") {
     super(r, e, t);
   }
   [Symbol.toStringTag] = "FileExistsException";
-}, U = class extends C {
+}, te = class extends D {
   constructor(r, e, t = "FileNotFoundException") {
     super(r, e, t);
   }
   [Symbol.toStringTag] = "FileNotFoundException";
-}, y = class extends f {
+}, g = class extends m {
   constructor(r, e, t = "KeyException") {
     super(r, e, t);
   }
   [Symbol.toStringTag] = "KeyException";
-}, $ = class extends f {
+}, Y = class extends m {
   constructor(r, e, t = "NetworkException") {
     super(r, e, t);
   }
   [Symbol.toStringTag] = "NetworkException";
-}, ee = class extends $ {
+}, ne = class extends Y {
   response;
   constructor(r, e, t = "ResponseException") {
     super(`The request failed with the status code ${r.status} (${r.statusText}).`, e, t), this.response = r;
   }
   [Symbol.toStringTag] = "ResponseException";
-}, te = class extends f {
+}, re = class extends m {
   constructor(r, e, t = "PermissionException") {
     super(r, e, t);
   }
   [Symbol.toStringTag] = "PermissionException";
-}, M = class extends f {
+}, A = class extends m {
   constructor(r, e, t = "ReferenceException") {
     super(r, e, t);
   }
   [Symbol.toStringTag] = "ReferenceException";
-}, d = class extends f {
+}, w = class extends m {
   constructor(r, e, t = "RuntimeException") {
     super(r, e, t);
   }
   [Symbol.toStringTag] = "RuntimeException";
-}, Y = class extends d {
+}, V = class extends w {
   constructor(r, e, t = "EnvironmentException") {
     super(r, e, t);
   }
   [Symbol.toStringTag] = "EnvironmentException";
-}, B = class extends f {
+}, J = class extends m {
   constructor(r, e, t = "TimeoutException") {
     super(r, e, t);
   }
   [Symbol.toStringTag] = "TimeoutException";
-}, ne = class extends f {
+}, se = class extends m {
   constructor(r, e, t = "TypeException") {
     super(r, e, t);
   }
   [Symbol.toStringTag] = "TypeException";
-}, u = class extends f {
+}, c = class extends m {
   constructor(r, e, t = "ValueException") {
     super(r, e, t);
   }
   [Symbol.toStringTag] = "ValueException";
-}, x = class extends u {
+}, k = class extends c {
   constructor(r, e, t = "RangeException") {
     super(r, e, t);
   }
   [Symbol.toStringTag] = "RangeException";
-}, c = class b {
+}, h = class x {
   _iterator;
   constructor(e) {
     e instanceof Function ? this._iterator = e() : Symbol.iterator in e ? this._iterator = e[Symbol.iterator]() : this._iterator = e;
@@ -117,7 +117,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   filter(e) {
     const t = this._iterator;
-    return new b(function* () {
+    return new x(function* () {
       let n = 0;
       for (; ; ) {
         const s = t.next();
@@ -128,7 +128,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   map(e) {
     const t = this._iterator;
-    return new b(function* () {
+    return new x(function* () {
       let n = 0;
       for (; ; ) {
         const s = t.next();
@@ -141,7 +141,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     let n = 0, s = t;
     if (s === void 0) {
       const i = this._iterator.next();
-      if (i.done) throw new u("Cannot reduce an empty iterator without an initial value.");
+      if (i.done) throw new c("Cannot reduce an empty iterator without an initial value.");
       s = i.value, n += 1;
     }
     for (; ; ) {
@@ -152,7 +152,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   flatMap(e) {
     const t = this._iterator;
-    return new b(function* () {
+    return new x(function* () {
       let n = 0;
       for (; ; ) {
         const s = t.next();
@@ -166,7 +166,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   drop(e) {
     const t = this._iterator;
-    return new b(function* () {
+    return new x(function* () {
       let n = 0;
       for (; n < e; ) {
         if (t.next().done) return;
@@ -181,7 +181,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   take(e) {
     const t = this._iterator;
-    return new b(function* () {
+    return new x(function* () {
       let n = 0;
       for (; n < e; ) {
         const s = t.next();
@@ -204,7 +204,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   unique() {
     const e = this._iterator;
-    return new b(function* () {
+    return new x(function* () {
       const t = /* @__PURE__ */ new Set();
       for (; ; ) {
         const n = e.next();
@@ -242,7 +242,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     throw e;
   }
   groupBy(e) {
-    return new R(this.map((t, n) => [e(t, n), t]));
+    return new F(this.map((t, n) => [e(t, n), t]));
   }
   toArray() {
     return Array.from(this);
@@ -251,10 +251,10 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   [Symbol.iterator]() {
     return this;
   }
-}, h = class v {
+}, d = class S {
   _elements;
   constructor(e) {
-    this._elements = new c(e);
+    this._elements = new h(e);
   }
   every(e) {
     for (const [t, [n, s]] of this._elements.enumerate()) if (!e(n, s, t)) return !1;
@@ -266,13 +266,13 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   filter(e) {
     const t = this._elements.enumerate();
-    return new v(function* () {
+    return new S(function* () {
       for (const [n, [s, i]] of t) e(s, i, n) && (yield [s, i]);
     });
   }
   map(e) {
     const t = this._elements.enumerate();
-    return new v(function* () {
+    return new S(function* () {
       for (const [n, [s, i]] of t) yield [s, e(s, i, n)];
     });
   }
@@ -280,7 +280,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     let n = 0, s = t;
     if (s === void 0) {
       const i = this._elements.next();
-      if (i.done) throw new u("Cannot reduce an empty iterator without an initial value.");
+      if (i.done) throw new c("Cannot reduce an empty iterator without an initial value.");
       s = i.value[1], n += 1;
     }
     for (const [i, o] of this._elements)
@@ -289,23 +289,23 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   flatMap(e) {
     const t = this._elements.enumerate();
-    return new R(function* () {
+    return new F(function* () {
       for (const [n, [s, i]] of t) {
         const o = e(s, i, n);
-        if (o instanceof Array) for (const a of o) yield [s, a];
+        if (o instanceof Array) for (const l of o) yield [s, l];
         else yield [s, o];
       }
     });
   }
   drop(e) {
     const t = this._elements.enumerate();
-    return new v(function* () {
+    return new S(function* () {
       for (const [n, [s, i]] of t) n >= e && (yield [s, i]);
     });
   }
   take(e) {
     const t = this._elements.enumerate();
-    return new v(function* () {
+    return new S(function* () {
       for (const [n, [s, i]] of t) {
         if (n >= e) break;
         yield [s, i];
@@ -320,7 +320,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   unique() {
     const e = this._elements;
-    return new v(function* () {
+    return new S(function* () {
       const t = /* @__PURE__ */ new Set();
       for (const [n, s] of e)
         t.has(s) || (t.add(s), yield [n, s]);
@@ -336,13 +336,13 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   reorganizeBy(e) {
     const t = this._elements.enumerate();
-    return new R(function* () {
+    return new F(function* () {
       for (const [n, [s, i]] of t) yield [e(s, i, n), i];
     });
   }
   keys() {
     const e = this._elements;
-    return new c(function* () {
+    return new h(function* () {
       for (const [t] of e) yield t;
     });
   }
@@ -351,7 +351,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   values() {
     const e = this._elements;
-    return new c(function* () {
+    return new h(function* () {
       for (const [t, n] of e) yield n;
     });
   }
@@ -365,10 +365,10 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     return Object.fromEntries(this.entries());
   }
   [Symbol.toStringTag] = "ReducedIterator";
-}, V = class m {
+}, L = class p {
   _elements;
   constructor(e) {
-    this._elements = new A(e);
+    this._elements = new R(e);
   }
   async every(e) {
     const t = /* @__PURE__ */ new Map();
@@ -376,7 +376,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
       const [i, o] = t.get(n) ?? [0, !0];
       o && t.set(n, [i + 1, await e(n, s, i)]);
     }
-    return new h(function* () {
+    return new d(function* () {
       for (const [n, [s, i]] of t) yield [n, i];
     });
   }
@@ -386,13 +386,13 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
       const [i, o] = t.get(n) ?? [0, !1];
       o || t.set(n, [i + 1, await e(n, s, i)]);
     }
-    return new h(function* () {
+    return new d(function* () {
       for (const [n, [s, i]] of t) yield [n, i];
     });
   }
   filter(e) {
     const t = this._elements;
-    return new m(async function* () {
+    return new p(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, i] of t) {
         const o = n.get(s) ?? 0;
@@ -402,7 +402,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   map(e) {
     const t = this._elements;
-    return new m(async function* () {
+    return new p(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, i] of t) {
         const o = n.get(s) ?? 0;
@@ -413,35 +413,35 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   async reduce(e, t) {
     const n = /* @__PURE__ */ new Map();
     for await (const [s, i] of this._elements) {
-      let o, a;
-      if (n.has(s)) [o, a] = n.get(s);
+      let o, l;
+      if (n.has(s)) [o, l] = n.get(s);
       else if (t !== void 0)
-        o = 0, t instanceof Function ? a = await t(s) : a = await t;
+        o = 0, t instanceof Function ? l = await t(s) : l = await t;
       else {
         n.set(s, [0, i]);
         continue;
       }
-      n.set(s, [o + 1, await e(s, a, i, o)]);
+      n.set(s, [o + 1, await e(s, l, i, o)]);
     }
-    return new h(function* () {
+    return new d(function* () {
       for (const [s, [i, o]] of n) yield [s, o];
     });
   }
   flatMap(e) {
     const t = this._elements;
-    return new m(async function* () {
+    return new p(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, i] of t) {
-        const o = n.get(s) ?? 0, a = await e(s, i, o);
-        if (a instanceof Array) for (const l of a) yield [s, l];
-        else yield [s, a];
+        const o = n.get(s) ?? 0, l = await e(s, i, o);
+        if (l instanceof Array) for (const a of l) yield [s, a];
+        else yield [s, l];
         n.set(s, o + 1);
       }
     });
   }
   drop(e) {
     const t = this._elements;
-    return new m(async function* () {
+    return new p(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, i] of t) {
         const o = n.get(s) ?? 0;
@@ -455,7 +455,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   take(e) {
     const t = this._elements;
-    return new m(async function* () {
+    return new p(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, i] of t) {
         const o = n.get(s) ?? 0;
@@ -469,7 +469,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
       let [i, o] = t.get(n) ?? [0, void 0];
       o === void 0 && (await e(n, s, i) && (o = s), t.set(n, [i + 1, o]));
     }
-    return new h(function* () {
+    return new d(function* () {
       for (const [n, [s, i]] of t) yield [n, i];
     });
   }
@@ -478,7 +478,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   unique() {
     const e = this._elements;
-    return new m(async function* () {
+    return new p(async function* () {
       const t = /* @__PURE__ */ new Map();
       for await (const [n, s] of e) {
         const i = t.get(n) ?? /* @__PURE__ */ new Set();
@@ -492,7 +492,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
       const n = e.get(t) ?? 0;
       e.set(t, n + 1);
     }
-    return new h(function* () {
+    return new d(function* () {
       for (const [t, n] of e) yield [t, n];
     });
   }
@@ -505,7 +505,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   reorganizeBy(e) {
     const t = this._elements;
-    return new m(async function* () {
+    return new p(async function* () {
       const n = /* @__PURE__ */ new Map();
       for await (const [s, i] of t) {
         const o = n.get(s) ?? 0;
@@ -515,7 +515,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   keys() {
     const e = this._elements;
-    return new A(async function* () {
+    return new R(async function* () {
       const t = /* @__PURE__ */ new Set();
       for await (const [n] of e)
         t.has(n) || (t.add(n), yield n);
@@ -526,7 +526,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   values() {
     const e = this._elements;
-    return new A(async function* () {
+    return new R(async function* () {
       for await (const [t, n] of e) yield n;
     });
   }
@@ -551,7 +551,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     return e;
   }
   [Symbol.toStringTag] = "AggregatedAsyncIterator";
-}, A = class g {
+}, R = class v {
   _iterator;
   constructor(e) {
     if (e instanceof Function) {
@@ -603,7 +603,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   filter(e) {
     const t = this._iterator;
-    return new g(async function* () {
+    return new v(async function* () {
       let n = 0;
       for (; ; ) {
         const s = await t.next();
@@ -614,7 +614,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   map(e) {
     const t = this._iterator;
-    return new g(async function* () {
+    return new v(async function* () {
       let n = 0;
       for (; ; ) {
         const s = await t.next();
@@ -627,7 +627,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     let n = 0, s = t;
     if (s === void 0) {
       const i = await this._iterator.next();
-      if (i.done) throw new u("Cannot reduce an empty iterator without an initial value.");
+      if (i.done) throw new c("Cannot reduce an empty iterator without an initial value.");
       s = i.value, n += 1;
     }
     for (; ; ) {
@@ -638,7 +638,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   flatMap(e) {
     const t = this._iterator;
-    return new g(async function* () {
+    return new v(async function* () {
       let n = 0;
       for (; ; ) {
         const s = await t.next();
@@ -652,7 +652,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   drop(e) {
     const t = this._iterator;
-    return new g(async function* () {
+    return new v(async function* () {
       let n = 0;
       for (; n < e; ) {
         if ((await t.next()).done) return;
@@ -667,7 +667,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   take(e) {
     const t = this._iterator;
-    return new g(async function* () {
+    return new v(async function* () {
       let n = 0;
       for (; n < e; ) {
         const s = await t.next();
@@ -690,7 +690,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   unique() {
     const e = this._iterator;
-    return new g(async function* () {
+    return new v(async function* () {
       const t = /* @__PURE__ */ new Set();
       for (; ; ) {
         const n = await e.next();
@@ -729,7 +729,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     throw e;
   }
   groupBy(e) {
-    return new V(this.map(async (t, n) => [await e(t, n), t]));
+    return new L(this.map(async (t, n) => [await e(t, n), t]));
   }
   toArray() {
     return Array.fromAsync(this);
@@ -738,10 +738,10 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   [Symbol.asyncIterator]() {
     return this;
   }
-}, R = class w {
+}, F = class _ {
   _elements;
   constructor(e) {
-    this._elements = new c(e);
+    this._elements = new h(e);
   }
   every(e) {
     const t = /* @__PURE__ */ new Map();
@@ -749,7 +749,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
       const [i, o] = t.get(n) ?? [0, !0];
       o && t.set(n, [i + 1, e(n, s, i)]);
     }
-    return new h(function* () {
+    return new d(function* () {
       for (const [n, [s, i]] of t) yield [n, i];
     });
   }
@@ -759,13 +759,13 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
       const [i, o] = t.get(n) ?? [0, !1];
       o || t.set(n, [i + 1, e(n, s, i)]);
     }
-    return new h(function* () {
+    return new d(function* () {
       for (const [n, [s, i]] of t) yield [n, i];
     });
   }
   filter(e) {
     const t = this._elements;
-    return new w(function* () {
+    return new _(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, i] of t) {
         const o = n.get(s) ?? 0;
@@ -775,7 +775,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   map(e) {
     const t = this._elements;
-    return new w(function* () {
+    return new _(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, i] of t) {
         const o = n.get(s) ?? 0;
@@ -786,35 +786,35 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   reduce(e, t) {
     const n = /* @__PURE__ */ new Map();
     for (const [s, i] of this._elements) {
-      let o, a;
-      if (n.has(s)) [o, a] = n.get(s);
+      let o, l;
+      if (n.has(s)) [o, l] = n.get(s);
       else if (t !== void 0)
-        o = 0, t instanceof Function ? a = t(s) : a = t;
+        o = 0, t instanceof Function ? l = t(s) : l = t;
       else {
         n.set(s, [0, i]);
         continue;
       }
-      n.set(s, [o + 1, e(s, a, i, o)]);
+      n.set(s, [o + 1, e(s, l, i, o)]);
     }
-    return new h(function* () {
+    return new d(function* () {
       for (const [s, [i, o]] of n) yield [s, o];
     });
   }
   flatMap(e) {
     const t = this._elements;
-    return new w(function* () {
+    return new _(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, i] of t) {
-        const o = n.get(s) ?? 0, a = e(s, i, o);
-        if (a instanceof Array) for (const l of a) yield [s, l];
-        else yield [s, a];
+        const o = n.get(s) ?? 0, l = e(s, i, o);
+        if (l instanceof Array) for (const a of l) yield [s, a];
+        else yield [s, l];
         n.set(s, o + 1);
       }
     });
   }
   drop(e) {
     const t = this._elements;
-    return new w(function* () {
+    return new _(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, i] of t) {
         const o = n.get(s) ?? 0;
@@ -828,7 +828,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   take(e) {
     const t = this._elements;
-    return new w(function* () {
+    return new _(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, i] of t) {
         const o = n.get(s) ?? 0;
@@ -842,7 +842,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
       let [i, o] = t.get(n) ?? [0, void 0];
       o === void 0 && (e(n, s, i) && (o = s), t.set(n, [i + 1, o]));
     }
-    return new h(function* () {
+    return new d(function* () {
       for (const [n, [s, i]] of t) yield [n, i];
     });
   }
@@ -851,7 +851,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   unique() {
     const e = this._elements;
-    return new w(function* () {
+    return new _(function* () {
       const t = /* @__PURE__ */ new Map();
       for (const [n, s] of e) {
         const i = t.get(n) ?? /* @__PURE__ */ new Set();
@@ -865,7 +865,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
       const n = e.get(t) ?? 0;
       e.set(t, n + 1);
     }
-    return new h(function* () {
+    return new d(function* () {
       for (const [t, n] of e) yield [t, n];
     });
   }
@@ -878,7 +878,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   reorganizeBy(e) {
     const t = this._elements;
-    return new w(function* () {
+    return new _(function* () {
       const n = /* @__PURE__ */ new Map();
       for (const [s, i] of t) {
         const o = n.get(s) ?? 0;
@@ -888,7 +888,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   keys() {
     const e = this._elements;
-    return new c(function* () {
+    return new h(function* () {
       const t = /* @__PURE__ */ new Set();
       for (const [n] of e)
         t.has(n) || (t.add(n), yield n);
@@ -899,7 +899,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   values() {
     const e = this._elements;
-    return new c(function* () {
+    return new h(function* () {
       for (const [t, n] of e) yield n;
     });
   }
@@ -924,14 +924,14 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     return e;
   }
   [Symbol.toStringTag] = "AggregatedIterator";
-}, J = Function, P = class extends J {
+}, G = Function, z = class extends G {
   constructor() {
     super("return this._invoke(...arguments);");
     const r = this.bind(this);
     return Object.setPrototypeOf(this, r), r;
   }
   [Symbol.toStringTag] = "CallableObject";
-}, re = class extends P {
+}, ie = class extends z {
   _callbacks;
   get size() {
     return this._callbacks.length;
@@ -955,13 +955,13 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     this._callbacks.length = 0;
   }
   [Symbol.toStringTag] = "CallbackChain";
-}, E = class j {
+}, I = class N {
   _subscribers;
   constructor() {
     this._subscribers = /* @__PURE__ */ new Map();
   }
   createScope() {
-    const e = new j();
+    const e = new N();
     return this.subscribe("__internals__:clear", () => e.clear()), this.subscribe("*", (t, ...n) => {
       e.publish(t, ...n);
     }), e;
@@ -971,7 +971,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     if (s) {
       const i = s.slice(), o = i.length;
       n = new Array(o);
-      for (let a = 0; a < o; a += 1) n[a] = i[a](...t);
+      for (let l = 0; l < o; l += 1) n[l] = i[l](...t);
     } else n = [];
     return e.startsWith("__") || (s = this._subscribers.get("*"), s && s.slice().forEach((i) => i(e, ...t))), n;
   }
@@ -979,15 +979,15 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     const n = this._subscribers.get(e) ?? [];
     return n.push(t), this._subscribers.set(e, n), () => {
       const s = n.indexOf(t);
-      if (s < 0) throw new M("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed.");
+      if (s < 0) throw new A("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed.");
       n.splice(s, 1);
     };
   }
   unsubscribe(e, t) {
     const n = this._subscribers.get(e);
-    if (!n) throw new M("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed or was never subscribed.");
+    if (!n) throw new A("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed or was never subscribed.");
     const s = n.indexOf(t);
-    if (s < 0) throw new M("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed or was never subscribed.");
+    if (s < 0) throw new A("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed or was never subscribed.");
     n.splice(s, 1), n.length === 0 && this._subscribers.delete(e);
   }
   unsubscribeAll(e) {
@@ -997,8 +997,10 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     this.publish("__internals__:clear"), this._subscribers.clear();
   }
   [Symbol.toStringTag] = "Publisher";
-}, L = () => {
-}, se = class extends P {
+}, H = () => {
+}, P = () => {
+  throw new B("The `SwitchableCallback` has no callback defined yet. Did you forget to call the `register` method?");
+}, oe = class extends z {
   _callback;
   _callbacks;
   _isEnabled;
@@ -1011,44 +1013,45 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   _invoke;
   constructor(r, e = "default") {
-    super(), this._callbacks = /* @__PURE__ */ new Map(), this._isEnabled = !0, r ? this._callbacks.set(e, r) : (e = "", r = (() => {
-      throw new O("The `SwitchableCallback` has no callback defined yet. Did you forget to call the `register` method?");
-    })), this._key = e, this._callback = r, this._invoke = (...t) => this._callback(...t);
+    super(), this._callbacks = /* @__PURE__ */ new Map(), this._isEnabled = !0, r ? this._callbacks.set(e, r) : (e = "", r = P), this._key = e, this._callback = r, this._invoke = (...t) => this._callback(...t);
   }
   enable(r) {
     if (r === void 0) {
-      if (!this._key) throw new y("The `SwitchableCallback` has no callback defined yet. Did you forget to call the `register` method?");
+      if (!this._key) throw new g("The `SwitchableCallback` has no callback defined yet. Did you forget to call the `register` method?");
       r = this._key;
     } else if (r) {
-      if (!this._callbacks.has(r)) throw new y(`The key '${r}' doesn't yet have any associated callback.`);
-    } else throw new y("The key must be a non-empty string.");
-    if (this._isEnabled) throw new d("The `SwitchableCallback` is already enabled.");
+      if (!this._callbacks.has(r)) throw new g(`The key '${r}' doesn't yet have any associated callback.`);
+    } else throw new g("The key must be a non-empty string.");
+    if (this._isEnabled) throw new w("The `SwitchableCallback` is already enabled.");
     this._callback = this._callbacks.get(r), this._isEnabled = !0;
   }
   disable() {
-    if (!this._isEnabled) throw new d("The `SwitchableCallback` is already disabled.");
-    this._callback = L, this._isEnabled = !1;
+    if (!this._isEnabled) throw new w("The `SwitchableCallback` is already disabled.");
+    this._callback = H, this._isEnabled = !1;
   }
   register(r, e) {
     if (this._callbacks.size === 0)
       this._key = r, this._callback = e;
-    else if (this._callbacks.has(r)) throw new y(`The key '${r}' has already been used for another callback.`);
+    else if (this._callbacks.has(r)) throw new g(`The key '${r}' has already been used for another callback.`);
     this._callbacks.set(r, e);
   }
   unregister(r) {
-    if (this._key === r) throw new y("Unable to unregister the currently selected callback.");
-    if (!this._callbacks.has(r)) throw new y(`The key '${r}' doesn't yet have any associated callback.`);
+    if (this._key === r) throw new g("Unable to unregister the currently selected callback.");
+    if (!this._callbacks.has(r)) throw new g(`The key '${r}' doesn't yet have any associated callback.`);
     this._callbacks.delete(r);
   }
   switch(r) {
-    if (!this._callbacks.has(r)) throw new y(`The key '${r}' doesn't yet have any associated callback.`);
+    if (!this._callbacks.has(r)) throw new g(`The key '${r}' doesn't yet have any associated callback.`);
     this._key !== r && (this._key = r, this._isEnabled && (this._callback = this._callbacks.get(r)));
   }
+  reset(r, e = "default") {
+    this._callbacks.clear(), this._isEnabled = !0, r ? this._callbacks.set(e, r) : (e = "", r = P), this._key = e, this._callback = r;
+  }
   [Symbol.toStringTag] = "SwitchableCallback";
-}, ie = class extends Array {
+}, ae = class extends Array {
   _publisher;
   constructor(...r) {
-    super(...r), this._publisher = new E();
+    super(...r), this._publisher = new I();
   }
   push(...r) {
     const e = this.length, t = super.push(...r);
@@ -1092,10 +1095,10 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
   }
   [Symbol.toStringTag] = "ArrayView";
   static [Symbol.species] = Array;
-}, oe = class extends Map {
+}, le = class extends Map {
   _publisher;
   constructor(r) {
-    if (super(), this._publisher = new E(), r) for (const [e, t] of r) super.set(e, t);
+    if (super(), this._publisher = new I(), r) for (const [e, t] of r) super.set(e, t);
   }
   set(r, e) {
     return super.set(r, e), this._publisher.publish("add", r, e), this;
@@ -1118,10 +1121,10 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     return this._publisher.subscribe("clear", r);
   }
   [Symbol.toStringTag] = "MapView";
-}, ae = class extends Set {
+}, ue = class extends Set {
   _publisher;
   constructor(r) {
-    if (super(), this._publisher = new E(), r) for (const e of r) super.add(e);
+    if (super(), this._publisher = new I(), r) for (const e of r) super.add(e);
   }
   add(r) {
     return super.add(r), this._publisher.publish("add", r), this;
@@ -1144,12 +1147,12 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     return this._publisher.subscribe("clear", r);
   }
   [Symbol.toStringTag] = "SetView";
-}, le = class {
+}, ce = class {
   _preferPersistence;
   _volatile;
   _persistent;
   constructor(r = !0) {
-    if (!F) throw new Y("The `JSONStorage` class can only be instantiated within a browser environment.");
+    if (!j) throw new V("The `JSONStorage` class can only be instantiated within a browser environment.");
     this._preferPersistence = r, this._volatile = window.sessionStorage, this._persistent = window.localStorage;
   }
   _get(r, e, t) {
@@ -1213,9 +1216,9 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     this._volatile.removeItem(r), this._persistent.removeItem(r);
   }
   [Symbol.toStringTag] = "JSONStorage";
-}, _ = class z {
+}, b = class q {
   static FromPromise(e) {
-    return new z((t, n) => e.then(t, n));
+    return new q((t, n) => e.then(t, n));
   }
   _isPending;
   get isPending() {
@@ -1247,7 +1250,7 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     return this._promise.finally(e);
   }
   [Symbol.toStringTag] = "SmartPromise";
-}, N = class extends _ {
+}, O = class extends b {
   _resolve;
   get resolve() {
     return this._resolve;
@@ -1266,19 +1269,19 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     return r.then(this.resolve, this.reject), this;
   }
   [Symbol.toStringTag] = "DeferredPromise";
-}, G = class extends _ {
+}, K = class extends b {
   constructor(r, e) {
     super((t, n) => {
-      const s = (l) => {
-        clearTimeout(a), t(l);
-      }, i = (l) => {
-        clearTimeout(a), n(l);
-      }, a = setTimeout(() => i(new B("The operation has timed out.")), e);
+      const s = (a) => {
+        clearTimeout(l), t(a);
+      }, i = (a) => {
+        clearTimeout(l), n(a);
+      }, l = setTimeout(() => i(new J("The operation has timed out.")), e);
       r(s, i);
     });
   }
   [Symbol.toStringTag] = "TimedPromise";
-}, ue = class extends _ {
+}, he = class extends b {
   _count;
   get isPending() {
     return this._count > 0;
@@ -1287,13 +1290,13 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
     return this._count === 0;
   }
   get isRejected() {
-    throw new u("`PromiseQueue` doesn't support rejection states.");
+    throw new c("`PromiseQueue` doesn't support rejection states.");
   }
   constructor() {
     super((r) => r()), this._count = 0, this._isPending = !1, this._isFulfilled = !1, this._isRejected = !1;
   }
   enqueue(r, e) {
-    if (this._count += 1, r instanceof N) {
+    if (this._count += 1, r instanceof O) {
       const n = r;
       r = () => (n.resolve(), n);
     }
@@ -1304,38 +1307,38 @@ var F = typeof window < "u" && typeof window.document < "u", X = typeof process
         this._count -= 1, s(i);
       });
     };
-    return e ? new G(t, e) : new _(t);
+    return e ? new K(t, e) : new b(t);
   }
   [Symbol.toStringTag] = "PromiseQueue";
-}, p = /* @__PURE__ */ (function(r) {
-  return 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 = /* @__PURE__ */ (function(r) {
+}, y = /* @__PURE__ */ (function(r) {
+  return r[r.Millisecond = 1] = "Millisecond", r[r.Second = 1e3] = "Second", r[r.Minute = 60 * r.Second] = "Minute", r[r.Hour = 60 * r.Minute] = "Hour", r[r.Day = 24 * r.Hour] = "Day", r[r.Week = 7 * r.Day] = "Week", r[r.Month = 30 * r.Day] = "Month", r[r.Year = 365 * r.Day] = "Year", r;
+})({}), Q = /* @__PURE__ */ (function(r) {
   return 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;
 })({});
-function ce(r, e, t = p.Day) {
+function fe(r, e, t = y.Day) {
   let n;
   return r = new Date(r), e = new Date(e), r < e ? n = Math.floor : n = Math.ceil, n((e.getTime() - r.getTime()) / t);
 }
-function he(r, e, t = p.Day) {
-  if (r = new Date(r), e = new Date(e), r >= e) throw new x("The end date must be greater than the start date.");
-  return new c(function* () {
+function de(r, e, t = y.Day) {
+  if (r = new Date(r), e = new Date(e), r >= e) throw new k("The end date must be greater than the start date.");
+  return new h(function* () {
     const n = e.getTime();
     let s = r.getTime();
     for (; s < n; )
       yield new Date(s), s += t;
   });
 }
-function Q(r, e = p.Day) {
-  if (e <= p.Millisecond) throw new x("Rounding a timestamp by milliseconds or less makes no sense.Use the timestamp value directly instead.");
-  if (e > p.Day) 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.");
+function X(r, e = y.Day) {
+  if (e <= y.Millisecond) throw new k("Rounding a timestamp by milliseconds or less makes no sense.Use the timestamp value directly instead.");
+  if (e > y.Day) throw new k("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);
 }
-function fe(r, e = K.Sunday) {
+function me(r, e = Q.Sunday) {
   r = new Date(r);
-  const t = 7 - e, n = (r.getUTCDay() + t) % 7, s = r.getTime() - p.Day * n;
-  return Q(new Date(s));
+  const t = 7 - e, n = (r.getUTCDay() + t) % 7, s = r.getTime() - y.Day * n;
+  return X(new Date(s));
 }
-var q = class {
+var $ = class {
   _handle;
   _startTime;
   get startTime() {
@@ -1352,19 +1355,19 @@ var q = class {
   _start;
   _stop;
   constructor(r, e = 40) {
-    this._startTime = 0, this._isRunning = !1, F ? (this._start = () => {
+    this._startTime = 0, this._isRunning = !1, j ? (this._start = () => {
       r(this.elapsedTime), this._handle = window.requestAnimationFrame(this._start);
     }, this._stop = () => window.cancelAnimationFrame(this._handle)) : (console.warn(`Not a browser environment detected. Using setInterval@${e}ms instead of requestAnimationFrame...`), this._start = () => {
       this._handle = setInterval(() => r(this.elapsedTime), e);
-    }, this._stop = () => clearInterval(this._handle)), this._publisher = new E();
+    }, this._stop = () => clearInterval(this._handle)), this._publisher = new I();
   }
   start(r = 0) {
-    if (this._isRunning) throw new d("The game loop has already been started.");
+    if (this._isRunning) throw new w("The game loop has already been started.");
     this._startTime = performance.now() - r, this._start(), this._isRunning = !0, this._publisher.publish("start");
   }
   stop() {
-    if (!this._isRunning) throw new d("The game loop had already stopped or hadn't yet started.");
-    if (!this._handle) throw new k();
+    if (!this._isRunning) throw new w("The game loop had already stopped or hadn't yet started.");
+    if (!this._handle) throw new E();
     this._stop(), this._handle = void 0, this._isRunning = !1, this._publisher.publish("stop");
   }
   onStart(r) {
@@ -1374,21 +1377,21 @@ var q = class {
     return this._publisher.subscribe("stop", r);
   }
   [Symbol.toStringTag] = "GameLoop";
-}, de = class extends q {
-  constructor(r = p.Second) {
+}, we = class extends $ {
+  constructor(r = y.Second) {
     super((e) => this._publisher.publish("tick", e), r);
   }
   start(r = 0) {
-    if (this._isRunning) throw new d("The clock has already been started.");
+    if (this._isRunning) throw new w("The clock has already been started.");
     this._startTime = performance.now() - r, this._start(), this._isRunning = !0, this._publisher.publish("start");
   }
   stop() {
-    if (!this._isRunning) throw new d("The clock had already stopped or hadn't yet started.");
-    if (!this._handle) throw new k();
+    if (!this._isRunning) throw new w("The clock had already stopped or hadn't yet started.");
+    if (!this._handle) throw new E();
     this._stop(), this._handle = void 0, this._isRunning = !1, this._publisher.publish("stop");
   }
   onTick(r, e = 0) {
-    if (e < 0) throw new x("The tick step must be a non-negative number.");
+    if (e < 0) throw new k("The tick step must be a non-negative number.");
     if (e === 0) return this._publisher.subscribe("tick", r);
     let t = 0;
     return this._publisher.subscribe("tick", (n) => {
@@ -1396,7 +1399,7 @@ var q = class {
     });
   }
   [Symbol.toStringTag] = "Clock";
-}, me = class extends q {
+}, pe = class extends $ {
   _duration;
   get duration() {
     return this._duration;
@@ -1405,7 +1408,7 @@ var q = class {
     return this._duration - this.elapsedTime;
   }
   _deferrer;
-  constructor(r, e = p.Second) {
+  constructor(r, e = y.Second) {
     const t = () => {
       const n = this.remainingTime;
       n <= 0 ? (this._deferrerStop(), this._publisher.publish("tick", 0), this._publisher.publish("expire")) : this._publisher.publish("tick", n);
@@ -1413,20 +1416,20 @@ var q = class {
     super(t, e), this._duration = r;
   }
   _deferrerStop(r) {
-    if (!this._isRunning) throw new d("The countdown hadn't yet started.");
-    if (!this._deferrer) throw new k();
+    if (!this._isRunning) throw new w("The countdown hadn't yet started.");
+    if (!this._deferrer) throw new E();
     this._stop(), this._handle = void 0, this._isRunning = !1, r !== void 0 ? this._deferrer.reject(r) : this._deferrer.resolve(), this._deferrer = void 0;
   }
   start(r = this.duration) {
-    if (this._isRunning) throw new d("The countdown had already stopped or hadn't yet started.");
-    if (this._deferrer) throw new k();
-    return this._deferrer = new N(), super.start(this.duration - r), this._publisher.publish("start"), this._deferrer;
+    if (this._isRunning) throw new w("The countdown had already stopped or hadn't yet started.");
+    if (this._deferrer) throw new E();
+    return this._deferrer = new O(), super.start(this.duration - r), this._publisher.publish("start"), this._deferrer;
   }
   stop(r) {
     this._deferrerStop(r), this._publisher.publish("stop", r);
   }
   onTick(r, e = 0) {
-    if (e < 0) throw new x("The tick step must be a non-negative number.");
+    if (e < 0) throw new k("The tick step must be a non-negative number.");
     if (e === 0) return this._publisher.subscribe("tick", r);
     let t = this.remainingTime;
     return this._publisher.subscribe("tick", (n) => {
@@ -1437,144 +1440,199 @@ var q = class {
     return this._publisher.subscribe("expire", r);
   }
   [Symbol.toStringTag] = "Countdown";
-}, we = class {
+}, _e = class {
   static Linear(r) {
     const e = r - 1;
-    return new c(function* () {
+    return new h(function* () {
       for (let t = 0; t < r; t += 1) yield t / e;
     });
   }
   static Exponential(r, e = 2) {
-    if (e < 0) throw new u("The base of the exponential curve cannot be negative.");
+    if (e < 0) throw new c("The base of the exponential curve cannot be negative.");
     const t = r - 1;
-    return new c(function* () {
+    return new h(function* () {
       for (let n = 0; n < r; n += 1) yield Math.pow(n / t, e);
     });
   }
   constructor() {
   }
   [Symbol.toStringTag] = "Curve";
-}, pe = class D {
-  static Boolean(e = 0.5) {
-    return Math.random() < e;
+}, ye = class u {
+  static #t(e) {
+    let t = e | 0;
+    return () => {
+      t = t + 1831565813 | 0;
+      let n = t;
+      return n = Math.imul(n ^ n >>> 15, n | 1), n ^= n + Math.imul(n ^ n >>> 7, n | 61), ((n ^ n >>> 14) >>> 0) / 4294967296;
+    };
   }
-  static Integer(e, t) {
-    return Math.floor(t === void 0 ? Math.random() * e : Math.random() * (t - e) + e);
+  static _Boolean(e, t) {
+    return e() < t;
   }
-  static Decimal(e, t) {
-    return e === void 0 ? Math.random() : t === void 0 ? Math.random() * e : Math.random() * (t - e) + e;
+  static _Integer(e, t, n) {
+    return Math.floor(n === void 0 ? e() * t : e() * (n - t) + t);
   }
-  static Index(e) {
-    if (e.length === 0) throw new u("You must provide at least one element.");
-    return this.Integer(e.length);
+  static _Decimal(e, t, n) {
+    return t === void 0 ? e() : n === void 0 ? e() * t : e() * (n - t) + t;
   }
-  static Choice(e) {
-    return e[D.Index(e)];
+  static _Index(e, t) {
+    if (t.length === 0) throw new c("You must provide at least one element.");
+    return u._Integer(e, t.length);
   }
-  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 = Array.from(e), l = new Array(t);
-      for (let S = 0; S < t; S += 1) {
-        const I = this.Integer(S, s);
-        l[S] = a[I], a[I] = a[S];
+  static _Choice(e, t) {
+    return t[u._Index(e, t)];
+  }
+  static _Sample(e, t, n, s) {
+    const i = t.length;
+    if (i === 0) throw new c("You must provide at least one element.");
+    if (n < 0) throw new c("Count must be non-negative.");
+    if (n > i) throw new c("Count cannot exceed the number of elements.");
+    if (n === 0) return [];
+    if (s === void 0) {
+      const a = Array.from(t), f = new Array(n);
+      for (let T = 0; T < n; T += 1) {
+        const C = u._Integer(e, T, i);
+        f[T] = a[C], a[C] = a[T];
       }
-      return l;
+      return f;
     }
-    if (n.length !== s) throw new u("Weights array must have the same length as elements array.");
-    const i = 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.`);
-      i[a] = {
+    if (s.length !== i) throw new c("Weights array must have the same length as elements array.");
+    const o = new Array(i);
+    for (let a = 0; a < i; a += 1) {
+      if (s[a] <= 0) throw new c(`Weight for element #${a} must be greater than zero.`);
+      o[a] = {
         index: a,
-        key: Math.pow(Math.random(), 1 / n[a])
+        key: Math.pow(e(), 1 / s[a])
       };
     }
-    i.sort((a, l) => l.key - a.key);
-    const o = new Array(t);
-    for (let a = 0; a < t; a += 1) o[a] = e[i[a].index];
-    return o;
-  }
-  static #e(e, t) {
-    const n = new Array(t - 1);
-    for (let a = 0; a < n.length; a += 1) n[a] = Math.random() * e;
-    n.sort((a, l) => a - l);
-    const s = [
+    o.sort((a, f) => f.key - a.key);
+    const l = new Array(n);
+    for (let a = 0; a < n; a += 1) l[a] = t[o[a].index];
+    return l;
+  }
+  static #e(e, t, n) {
+    const s = new Array(n - 1);
+    for (let a = 0; a < s.length; a += 1) s[a] = e() * t;
+    s.sort((a, f) => a - f);
+    const i = [
       0,
-      ...n,
-      e
-    ], i = new Array(t);
-    for (let a = 0; a < t; a += 1) i[a] = Math.floor(s[a + 1] - s[a]);
-    let o = e - i.reduce((a, l) => a + l, 0);
-    for (; o > 0; )
-      i[this.Integer(t)] += 1, o -= 1;
-    return i;
+      ...s,
+      t
+    ], o = new Array(n);
+    for (let a = 0; a < n; a += 1) o[a] = Math.floor(i[a + 1] - i[a]);
+    let l = t - o.reduce((a, f) => a + f, 0);
+    for (; l > 0; )
+      o[u._Integer(e, n)] += 1, l -= 1;
+    return o;
   }
-  static Split(e, t) {
-    if (t < 1) throw new u("The number of splits must be greater than zero.");
-    if (typeof e == "number") {
-      if (e < 0) throw new u("The total must be a non-negative number.");
-      return this.#e(e, t);
+  static _Split(e, t, n) {
+    if (n < 1) throw new c("The number of splits must be greater than zero.");
+    if (typeof t == "number") {
+      if (t < 0) throw new c("The total must be a non-negative number.");
+      return u.#e(e, t, n);
     }
-    const n = Array.from(e), s = n.length;
-    if (s === 0) throw new u("You must provide at least one element.");
-    if (t > s) throw new u("The number of splits cannot exceed the number of elements.");
-    const i = this.#e(s, t), o = new Array(t);
+    const s = Array.from(t), i = s.length;
+    if (i === 0) throw new c("You must provide at least one element.");
+    if (n > i) throw new c("The number of splits cannot exceed the number of elements.");
+    const o = u.#e(e, i, n), l = new Array(n);
     let a = 0;
-    for (let l = 0; l < t; l += 1)
-      o[l] = n.slice(a, a + i[l]), a += i[l];
-    return o;
+    for (let f = 0; f < n; f += 1)
+      l[f] = s.slice(a, a + o[f]), a += o[f];
+    return l;
   }
-  constructor() {
+  static Boolean(e = 0.5) {
+    return u._Boolean(Math.random, e);
+  }
+  static Integer(e, t) {
+    return u._Integer(Math.random, e, t);
+  }
+  static Decimal(e, t) {
+    return u._Decimal(Math.random, e, t);
+  }
+  static Index(e) {
+    return u._Index(Math.random, e);
+  }
+  static Choice(e) {
+    return u._Choice(Math.random, e);
+  }
+  static Sample(e, t, n) {
+    return u._Sample(Math.random, e, t, n);
+  }
+  static Split(e, t) {
+    return u._Split(Math.random, e, t);
+  }
+  static FromSeed(e) {
+    return new u(e);
+  }
+  _next;
+  constructor(e) {
+    this._next = u.#t(e);
+  }
+  boolean(e = 0.5) {
+    return u._Boolean(this._next, e);
+  }
+  integer(e, t) {
+    return u._Integer(this._next, e, t);
+  }
+  decimal(e, t) {
+    return u._Decimal(this._next, e, t);
+  }
+  index(e) {
+    return u._Index(this._next, e);
+  }
+  choice(e) {
+    return u._Choice(this._next, e);
+  }
+  sample(e, t, n) {
+    return u._Sample(this._next, e, t, n);
+  }
+  split(e, t) {
+    return u._Split(this._next, e, t);
   }
   [Symbol.toStringTag] = "Random";
 };
-function _e(r) {
-  return new _((e) => setTimeout(e, r));
+function be(r) {
+  return new b((e) => setTimeout(e, r));
 }
-function ye() {
-  return new _((r) => requestAnimationFrame(() => r()));
+function ge() {
+  return new b((r) => requestAnimationFrame(() => r()));
 }
-function be() {
-  return new _((r) => setTimeout(r));
+function xe() {
+  return new b((r) => setTimeout(r));
 }
-function ge(r, e = "text/javascript") {
-  return new _((t, n) => {
+function ve(r, e = "text/javascript") {
+  return new b((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);
   });
 }
-function ve(...r) {
-  return new c(function* () {
+function Se(...r) {
+  return new h(function* () {
     for (const e of r) for (const t of e) yield t;
   });
 }
-function xe(r) {
+function ke(r) {
   if (r instanceof Array) return r.length;
   let e = 0;
   for (const t of r) e += 1;
   return e;
 }
-function Se(r) {
-  return new c(function* () {
+function Te(r) {
+  return new h(function* () {
     let e = 0;
     for (const t of r)
       yield [e, t], e += 1;
   });
 }
-function ke(r, e, t = 1) {
-  if (t <= 0) throw new x("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 c(function* () {
+function Ee(r, e, t = 1) {
+  if (t <= 0) throw new k("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 h(function* () {
     for (let n = r; n > e; n -= t) yield n;
-  }) : new c(function* () {
+  }) : new h(function* () {
     for (let n = r; n < e; n += t) yield n;
   });
 }
-function Te(r) {
+function Me(r) {
   const e = Array.from(r);
   for (let t = e.length - 1; t > 0; t -= 1) {
     const n = Math.floor(Math.random() * (t + 1));
@@ -1582,16 +1640,16 @@ function Te(r) {
   }
   return e;
 }
-function Ee(r) {
-  return new c(function* () {
+function Ie(r) {
+  return new h(function* () {
     const e = /* @__PURE__ */ new Set();
     for (const t of r)
       e.has(t) || (e.add(t), yield t);
   });
 }
-function H(r, e) {
+function Z(r, e) {
   const t = r[Symbol.iterator](), n = e[Symbol.iterator]();
-  return new c(function* () {
+  return new h(function* () {
     for (; ; ) {
       const s = t.next(), i = n.next();
       if (s.done || i.done) break;
@@ -1599,28 +1657,28 @@ function H(r, e) {
     }
   });
 }
-function Me(r, e) {
+function Ae(r, e) {
   if (e === void 0) {
     let i = 0, o = 0;
-    for (const a of r)
-      i += a, o += 1;
-    if (o === 0) throw new u("You must provide at least one value.");
+    for (const l of r)
+      i += l, o += 1;
+    if (o === 0) throw new c("You must provide at least one value.");
     return i / o;
   }
   let t = 0, n = 0, s = 0;
-  for (const [i, o] of H(r, e)) {
-    if (o <= 0) throw new u(`The weight for the value #${s} must be greater than zero.`);
+  for (const [i, o] of Z(r, e)) {
+    if (o <= 0) throw new c(`The weight for the value #${s} must be greater than zero.`);
     t += i * o, n += o, s += 1;
   }
-  if (s === 0) throw new u("You must provide at least one value and weight.");
-  if (n <= 0) throw new u("The sum of weights must be greater than zero.");
+  if (s === 0) throw new c("You must provide at least one value and weight.");
+  if (n <= 0) throw new c("The sum of weights must be greater than zero.");
   return t / n;
 }
-function Ae(r, e, t) {
-  if (e > t) throw new u("The minimum bound must be less than or equal to the maximum bound.");
+function Re(r, e, t) {
+  if (e > t) throw new c("The minimum bound must be less than or equal to the maximum bound.");
   return r < e ? e : r > t ? t : r;
 }
-function Re(r) {
+function Fe(r) {
   let e = 0;
   for (let t = 0; t < r.length; t += 1) {
     const n = r.charCodeAt(t);
@@ -1628,81 +1686,81 @@ function Re(r) {
   }
   return e;
 }
-function Ie(r) {
+function Ce(r) {
   let e = 0;
   for (const t of r) e += t;
   return e;
 }
-function Fe(r) {
+function Pe(r) {
   return `${r.charAt(0).toUpperCase()}${r.slice(1)}`;
 }
-var Ce = "2.2.6";
+var je = "2.2.8";
 export {
-  V as AggregatedAsyncIterator,
-  R as AggregatedIterator,
-  ie as ArrayView,
-  P as CallableObject,
-  re as CallbackChain,
-  de as Clock,
-  me as Countdown,
-  we as Curve,
-  N as DeferredPromise,
-  Y as EnvironmentException,
-  f as Exception,
-  k as FatalErrorException,
-  C as FileException,
-  W as FileExistsException,
-  U as FileNotFoundException,
-  q as GameLoop,
-  le as JSONStorage,
-  y as KeyException,
-  oe as MapView,
-  $ as NetworkException,
-  O as NotImplementedException,
-  te as PermissionException,
-  ue as PromiseQueue,
-  E as Publisher,
-  pe as Random,
-  x as RangeException,
-  h as ReducedIterator,
-  M as ReferenceException,
-  ee as ResponseException,
-  d as RuntimeException,
-  ae as SetView,
-  A as SmartAsyncIterator,
-  c as SmartIterator,
-  _ as SmartPromise,
-  se as SwitchableCallback,
-  p as TimeUnit,
-  G as TimedPromise,
-  B as TimeoutException,
-  ne as TypeException,
-  Ce as VERSION,
-  u as ValueException,
-  K as WeekDay,
-  Me as average,
-  Fe as capitalize,
-  ve as chain,
-  Ae as clamp,
-  xe as count,
-  ce as dateDifference,
-  he as dateRange,
-  Q as dateRound,
-  _e as delay,
-  Se as enumerate,
-  fe as getWeek,
-  Re as hash,
-  F as isBrowser,
-  X as isNode,
-  Z as isWorker,
-  ge as loadScript,
-  ye as nextAnimationFrame,
-  ke as range,
-  Te as shuffle,
-  Ie as sum,
-  Ee as unique,
-  be as yieldToEventLoop,
-  H as zip
+  L as AggregatedAsyncIterator,
+  F as AggregatedIterator,
+  ae as ArrayView,
+  z as CallableObject,
+  ie as CallbackChain,
+  we as Clock,
+  pe as Countdown,
+  _e as Curve,
+  O as DeferredPromise,
+  V as EnvironmentException,
+  m as Exception,
+  E as FatalErrorException,
+  D as FileException,
+  ee as FileExistsException,
+  te as FileNotFoundException,
+  $ as GameLoop,
+  ce as JSONStorage,
+  g as KeyException,
+  le as MapView,
+  Y as NetworkException,
+  B as NotImplementedException,
+  re as PermissionException,
+  he as PromiseQueue,
+  I as Publisher,
+  ye as Random,
+  k as RangeException,
+  d as ReducedIterator,
+  A as ReferenceException,
+  ne as ResponseException,
+  w as RuntimeException,
+  ue as SetView,
+  R as SmartAsyncIterator,
+  h as SmartIterator,
+  b as SmartPromise,
+  oe as SwitchableCallback,
+  y as TimeUnit,
+  K as TimedPromise,
+  J as TimeoutException,
+  se as TypeException,
+  je as VERSION,
+  c as ValueException,
+  Q as WeekDay,
+  Ae as average,
+  Pe as capitalize,
+  Se as chain,
+  Re as clamp,
+  ke as count,
+  fe as dateDifference,
+  de as dateRange,
+  X as dateRound,
+  be as delay,
+  Te as enumerate,
+  me as getWeek,
+  Fe as hash,
+  j as isBrowser,
+  W as isNode,
+  U as isWorker,
+  ve as loadScript,
+  ge as nextAnimationFrame,
+  Ee as range,
+  Me as shuffle,
+  Ce as sum,
+  Ie as unique,
+  xe as yieldToEventLoop,
+  Z as zip
 };
 
 //# sourceMappingURL=core.esm.js.map