@byloth/core 1.5.0 → 1.5.2

package/dist/core.js

@@ -1,6 +1,6 @@
 var S = Object.defineProperty;
-var b = (o, e, t) => e in o ? S(o, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : o[e] = t;
-var u = (o, e, t) => b(o, typeof e != "symbol" ? e + "" : e, t);
+var b = (s, e, t) => e in s ? S(s, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : s[e] = t;
+var u = (s, e, t) => b(s, typeof e != "symbol" ? e + "" : e, t);
 class c {
   constructor(e) {
     u(this, "_iterator");
@@ -57,16 +57,16 @@ class c {
   reduce(e, t) {
     let n = 0, r = t;
     if (r === void 0) {
-      const s = this._iterator.next();
-      if (s.done)
+      const o = this._iterator.next();
+      if (o.done)
         throw new TypeError("Reduce of empty iterator with no initial value");
-      r = s.value, n += 1;
+      r = o.value, n += 1;
     }
     for (; ; ) {
-      const s = this._iterator.next();
-      if (s.done)
+      const o = this._iterator.next();
+      if (o.done)
         return r;
-      r = e(r, s.value, n), n += 1;
+      r = e(r, o.value, n), n += 1;
     }
   }
   enumerate() {
@@ -203,16 +203,16 @@ class h {
   async reduce(e, t) {
     let n = 0, r = t;
     if (r === void 0) {
-      const s = await this._iterator.next();
-      if (s.done)
+      const o = await this._iterator.next();
+      if (o.done)
         throw new TypeError("Reduce of empty iterator with no initial value");
-      r = s.value, n += 1;
+      r = o.value, n += 1;
     }
     for (; ; ) {
-      const s = await this._iterator.next();
-      if (s.done)
+      const o = await this._iterator.next();
+      if (o.done)
         return r;
-      r = await e(r, s.value, n), n += 1;
+      r = await e(r, o.value, n), n += 1;
     }
   }
   enumerate() {
@@ -312,6 +312,14 @@ class R extends f {
   }
 }
 class q extends f {
+  constructor(e, t, n = "KeyException") {
+    super(e, t, n);
+  }
+  get [Symbol.toStringTag]() {
+    return "KeyException";
+  }
+}
+class A extends f {
   constructor(e, t, n = "NetworkException") {
     super(e, t, n);
   }
@@ -319,7 +327,7 @@ class q extends f {
     return "NetworkException";
   }
 }
-class A extends f {
+class O extends f {
   constructor(e, t, n = "PermissionException") {
     super(e, t, n);
   }
@@ -335,7 +343,7 @@ class k extends f {
     return "ReferenceException";
   }
 }
-class O extends f {
+class $ extends f {
   constructor(e, t, n = "RuntimeException") {
     super(e, t, n);
   }
@@ -375,15 +383,15 @@ class a {
   filter(e) {
     const t = this._elements;
     return new a(function* () {
-      for (const [n, [r, s]] of t.enumerate())
-        e(r, s, n) && (yield [r, s]);
+      for (const [n, [r, o]] of t.enumerate())
+        e(r, o, n) && (yield [r, o]);
     });
   }
   map(e) {
     const t = this._elements;
     return new a(function* () {
-      for (const [n, [r, s]] of t.enumerate())
-        yield [r, e(r, s, n)];
+      for (const [n, [r, o]] of t.enumerate())
+        yield [r, e(r, o, n)];
     });
   }
   reduce(e, t) {
@@ -391,13 +399,13 @@ class a {
     if (t !== void 0)
       r = t;
     else {
-      const s = this._elements.next();
-      if (s.done)
+      const o = this._elements.next();
+      if (o.done)
         throw new E("Reduce of empty iterator with no initial value");
-      n += 1, r = s.value[1];
+      n += 1, r = o.value[1];
     }
-    for (const [s, i] of this._elements)
-      r = e(s, r, i, n), n += 1;
+    for (const [o, i] of this._elements)
+      r = e(o, r, i, n), n += 1;
     return r;
   }
   keys() {
@@ -438,32 +446,32 @@ class d {
   every(e) {
     const t = /* @__PURE__ */ new Map();
     for (const [n, r] of this._elements) {
-      const [s, i] = t.get(n) ?? [0, !0];
-      i && t.set(n, [s + 1, e(n, r, s)]);
+      const [o, i] = t.get(n) ?? [0, !0];
+      i && t.set(n, [o + 1, e(n, r, o)]);
     }
     return new a(function* () {
-      for (const [n, [r, s]] of t)
-        yield [n, s];
+      for (const [n, [r, o]] of t)
+        yield [n, o];
     });
   }
   some(e) {
     const t = /* @__PURE__ */ new Map();
     for (const [n, r] of this._elements) {
-      const [s, i] = t.get(n) ?? [0, !1];
-      i || t.set(n, [s + 1, e(n, r, s)]);
+      const [o, i] = t.get(n) ?? [0, !1];
+      i || t.set(n, [o + 1, e(n, r, o)]);
     }
     return new a(function* () {
-      for (const [n, [r, s]] of t)
-        yield [n, s];
+      for (const [n, [r, o]] of t)
+        yield [n, o];
     });
   }
   filter(e) {
     const t = this._elements;
     return new d(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [r, s] of t) {
+      for (const [r, o] of t) {
         const i = n.get(r) ?? 0;
-        n.set(r, i + 1), e(r, s, i) && (yield [r, s]);
+        n.set(r, i + 1), e(r, o, i) && (yield [r, o]);
       }
     });
   }
@@ -471,28 +479,28 @@ class d {
     const t = this._elements;
     return new d(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [r, s] of t) {
+      for (const [r, o] of t) {
         const i = n.get(r) ?? 0;
-        n.set(r, i + 1), yield [r, e(r, s, i)];
+        n.set(r, i + 1), yield [r, e(r, o, i)];
       }
     });
   }
   reduce(e, t) {
     const n = /* @__PURE__ */ new Map();
-    for (const [r, s] of this._elements) {
+    for (const [r, o] of this._elements) {
       let i, l;
       if (n.has(r))
         [i, l] = n.get(r), i += 1;
       else if (t !== void 0)
         i = 0, l = t(r);
       else {
-        n.set(r, [0, s]);
+        n.set(r, [0, o]);
         continue;
       }
-      l = e(r, l, s, i), n.set(r, [i, l]);
+      l = e(r, l, o, i), n.set(r, [i, l]);
     }
     return new a(function* () {
-      for (const [r, [s, i]] of n)
+      for (const [r, [o, i]] of n)
         yield [r, i];
     });
   }
@@ -501,8 +509,8 @@ class d {
     return new d(function* () {
       const t = /* @__PURE__ */ new Map();
       for (const [n, r] of e) {
-        const s = t.get(n) ?? /* @__PURE__ */ new Set();
-        s.has(r) || (s.add(r), t.set(n, s), yield [n, r]);
+        const o = t.get(n) ?? /* @__PURE__ */ new Set();
+        o.has(r) || (o.add(r), t.set(n, o), yield [n, r]);
       }
     });
   }
@@ -605,32 +613,32 @@ class y {
   async every(e) {
     const t = /* @__PURE__ */ new Map();
     for await (const [n, r] of this._elements) {
-      const [s, i] = t.get(n) ?? [0, !0];
-      i && t.set(n, [s + 1, await e(n, r, s)]);
+      const [o, i] = t.get(n) ?? [0, !0];
+      i && t.set(n, [o + 1, await e(n, r, o)]);
     }
     return new a(function* () {
-      for (const [n, [r, s]] of t)
-        yield [n, s];
+      for (const [n, [r, o]] of t)
+        yield [n, o];
     });
   }
   async some(e) {
     const t = /* @__PURE__ */ new Map();
     for await (const [n, r] of this._elements) {
-      const [s, i] = t.get(n) ?? [0, !1];
-      i || t.set(n, [s + 1, await e(n, r, s)]);
+      const [o, i] = t.get(n) ?? [0, !1];
+      i || t.set(n, [o + 1, await e(n, r, o)]);
     }
     return new a(function* () {
-      for (const [n, [r, s]] of t)
-        yield [n, s];
+      for (const [n, [r, o]] of t)
+        yield [n, o];
     });
   }
   filter(e) {
     const t = this._elements;
     return new y(async function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [r, s] of t) {
+      for await (const [r, o] of t) {
         const i = n.get(r) ?? 0;
-        n.set(r, i + 1), await e(r, s, i) && (yield [r, s]);
+        n.set(r, i + 1), await e(r, o, i) && (yield [r, o]);
       }
     });
   }
@@ -638,28 +646,28 @@ class y {
     const t = this._elements;
     return new y(async function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [r, s] of t) {
+      for await (const [r, o] of t) {
         const i = n.get(r) ?? 0;
-        n.set(r, i + 1), yield [r, await e(r, s, i)];
+        n.set(r, i + 1), yield [r, await e(r, o, i)];
       }
     });
   }
   async reduce(e, t) {
     const n = /* @__PURE__ */ new Map();
-    for await (const [r, s] of this._elements) {
+    for await (const [r, o] of this._elements) {
       let i, l;
       if (n.has(r))
         [i, l] = n.get(r), i += 1;
       else if (t !== void 0)
         i = 0, l = await t(r);
       else {
-        n.set(r, [0, s]);
+        n.set(r, [0, o]);
         continue;
       }
-      l = await e(r, l, s, i), n.set(r, [i, l]);
+      l = await e(r, l, o, i), n.set(r, [i, l]);
     }
     return new a(function* () {
-      for (const [r, [s, i]] of n)
+      for (const [r, [o, i]] of n)
         yield [r, i];
     });
   }
@@ -668,8 +676,8 @@ class y {
     return new y(async function* () {
       const t = /* @__PURE__ */ new Map();
       for await (const [n, r] of e) {
-        const s = t.get(n) ?? /* @__PURE__ */ new Set();
-        s.has(r) || (s.add(r), t.set(n, s), yield [n, r]);
+        const o = t.get(n) ?? /* @__PURE__ */ new Set();
+        o.has(r) || (o.add(r), t.set(n, o), yield [n, r]);
       }
     });
   }
@@ -765,7 +773,7 @@ class _ {
     return "AsyncAggregator";
   }
 }
-class $ {
+class C {
   constructor(e = !0) {
     u(this, "_preferPersistence");
     u(this, "_volatile");
@@ -903,7 +911,7 @@ class $ {
     return "JsonStorage";
   }
 }
-class C {
+class N {
   constructor() {
     u(this, "_subscribers");
     this._subscribers = [];
@@ -958,15 +966,15 @@ class g {
     return "SmartPromise";
   }
 }
-class N extends g {
+class Y extends g {
   constructor(t, n) {
-    let r, s;
+    let r, o;
     super((i, l) => {
-      r = i, s = l;
+      r = i, o = l;
     });
     u(this, "_resolve");
     u(this, "_reject");
-    this._promise.then(t, n), this._resolve = r, this._reject = s;
+    this._promise.then(t, n), this._resolve = r, this._reject = o;
   }
   get resolve() {
     return this._resolve;
@@ -981,15 +989,15 @@ class N extends g {
     return "DeferredPromise";
   }
 }
-class Y extends g {
+class z extends g {
   constructor(e, t) {
     super((n, r) => {
-      const s = (p) => {
+      const o = (p) => {
         clearTimeout(x), n(p);
       }, i = (p) => {
         clearTimeout(x), r(p);
       }, x = setTimeout(() => i(new T("The operation has timed out.")), t);
-      e(s, i);
+      e(o, i);
     });
   }
   get [Symbol.toStringTag]() {
@@ -1018,102 +1026,102 @@ class v {
   constructor() {
   }
 }
-async function z(o) {
-  return new Promise((e, t) => setTimeout(e, o));
+async function J(s) {
+  return new Promise((e, t) => setTimeout(e, s));
 }
-async function J() {
-  return new Promise((o, e) => requestAnimationFrame(() => o()));
+async function V() {
+  return new Promise((s, e) => requestAnimationFrame(() => s()));
 }
-var M = /* @__PURE__ */ ((o) => (o[o.Second = 1e3] = "Second", o[o.Minute = 6e4] = "Minute", o[o.Hour = 36e5] = "Hour", o[o.Day = 864e5] = "Day", o[o.Week = 6048e5] = "Week", o[o.Month = 2592e6] = "Month", o[o.Year = 31536e6] = "Year", o))(M || {});
-function V(o, e, t = 864e5) {
-  return Math.floor((e.getTime() - o.getTime()) / t);
+var M = /* @__PURE__ */ ((s) => (s[s.Millisecond = 1] = "Millisecond", s[s.Second = 1e3] = "Second", s[s.Minute = 6e4] = "Minute", s[s.Hour = 36e5] = "Hour", s[s.Day = 864e5] = "Day", s[s.Week = 6048e5] = "Week", s[s.Month = 2592e6] = "Month", s[s.Year = 31536e6] = "Year", s))(M || {});
+function B(s, e, t = 864e5) {
+  return Math.floor((e.getTime() - s.getTime()) / t);
 }
-function B(o, e, t = 864e5) {
+function K(s, e, t = 864e5) {
   return new c(function* () {
     const n = e.getTime();
-    let r = o.getTime();
+    let r = s.getTime();
     for (; r < n; )
       yield new Date(r), r += t;
   });
 }
-function H(o, e = 864e5) {
-  return new Date(Math.floor(o.getTime() / e) * e);
+function H(s, e = 864e5) {
+  return new Date(Math.floor(s.getTime() / e) * e);
 }
-function W(o, e = "text/javascript") {
+function W(s, e = "text/javascript") {
   return new Promise((t, n) => {
     const r = document.createElement("script");
-    r.async = !0, r.defer = !0, r.src = o, r.type = e, r.onload = () => t(), r.onerror = () => n(), document.body.appendChild(r);
+    r.async = !0, r.defer = !0, r.src = s, r.type = e, r.onload = () => t(), r.onerror = () => n(), document.body.appendChild(r);
   });
 }
-function G(...o) {
+function G(...s) {
   return new c(function* () {
-    for (const e of o)
+    for (const e of s)
       for (const t of e)
         yield t;
   });
 }
-function K(o) {
-  if (Array.isArray(o))
-    return o.length;
+function L(s) {
+  if (Array.isArray(s))
+    return s.length;
   let e = 0;
-  for (const t of o)
+  for (const t of s)
     e += 1;
   return e;
 }
-function L(o) {
+function Q(s) {
   return new c(function* () {
     let e = 0;
-    for (const t of o)
+    for (const t of s)
       yield [e, t], e += 1;
   });
 }
-function Q(o, e, t = 1) {
+function X(s, e, t = 1) {
   return new c(function* () {
-    e === void 0 && (e = o, o = 0), o > e && (t = t ?? -1);
-    for (let n = o; n < e; n += t)
+    e === void 0 && (e = s, s = 0), s > e && (t = t ?? -1);
+    for (let n = s; n < e; n += t)
       yield n;
   });
 }
-function X(o) {
-  const e = Array.from(o);
+function Z(s) {
+  const e = Array.from(s);
   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 Z(o) {
+function D(s) {
   return new c(function* () {
     const e = /* @__PURE__ */ new Set();
-    for (const t of o)
+    for (const t of s)
       e.has(t) || (e.add(t), yield t);
   });
 }
-function P(o, e) {
+function P(s, e) {
   return new c(function* () {
-    const t = o[Symbol.iterator](), n = e[Symbol.iterator]();
+    const t = s[Symbol.iterator](), n = e[Symbol.iterator]();
     for (; ; ) {
-      const r = t.next(), s = n.next();
-      if (r.done || s.done)
+      const r = t.next(), o = n.next();
+      if (r.done || o.done)
         break;
-      yield [r.value, s.value];
+      yield [r.value, o.value];
     }
   });
 }
-function D(o, e) {
+function U(s, e) {
   if (e === void 0) {
-    let s = 0, i = 0;
-    for (const l of o)
-      s += l, i += 1;
+    let o = 0, i = 0;
+    for (const l of s)
+      o += l, i += 1;
     if (i === 0)
       throw new m("You must provide at least one value.");
-    return s / i;
+    return o / i;
   }
   let t = 0, n = 0, r = 0;
-  for (const [s, i] of P(o, e)) {
+  for (const [o, i] of P(s, e)) {
     if (i <= 0)
       throw new m(`The weight for the value #${r} must be greater than zero.`);
-    t += s * i, n += i, r += 1;
+    t += o * i, n += i, r += 1;
   }
   if (r === 0)
     throw new m("You must provide at least one value and weight.");
@@ -1121,67 +1129,68 @@ function D(o, e) {
     throw new m("The sum of weights must be greater than zero.");
   return t / n;
 }
-function U(o) {
+function ee(s) {
   let e = 0;
-  for (let t = 0; t < o.length; t += 1) {
-    const n = o.charCodeAt(t);
+  for (let t = 0; t < s.length; t += 1) {
+    const n = s.charCodeAt(t);
     e = (e << 5) - e + n, e |= 0;
   }
   return e;
 }
-function ee(o) {
+function te(s) {
   let e = 0;
-  for (const t of o)
+  for (const t of s)
     e += t;
   return e;
 }
-function te(o) {
-  return `${o.charAt(0).toUpperCase()}${o.slice(1)}`;
+function ne(s) {
+  return `${s.charAt(0).toUpperCase()}${s.slice(1)}`;
 }
-const ne = "1.5.0";
+const re = "1.5.2";
 export {
   y as AggregatedAsyncIterator,
   d as AggregatedIterator,
   w as Aggregator,
   _ as AsyncAggregator,
   M as DateUnit,
-  N as DeferredPromise,
+  Y as DeferredPromise,
   f as Exception,
   j as FatalErrorException,
   R as FileNotFoundException,
-  $ as JsonStorage,
-  q as NetworkException,
+  C as JsonStorage,
+  q as KeyException,
+  A as NetworkException,
   F as NotImplementedException,
-  A as PermissionException,
+  O as PermissionException,
   v as Random,
   a as ReducedIterator,
   k as ReferenceException,
-  O as RuntimeException,
+  $ as RuntimeException,
   h as SmartAsyncIterator,
   c as SmartIterator,
   g as SmartPromise,
-  C as Subscribers,
-  Y as TimedPromise,
+  N as Subscribers,
+  z as TimedPromise,
   T as TimeoutException,
   E as TypeException,
-  ne as VERSION,
+  re as VERSION,
   m as ValueException,
-  D as average,
-  te as capitalize,
+  U as average,
+  ne as capitalize,
   G as chain,
-  K as count,
-  V as dateDifference,
-  B as dateRange,
+  L as count,
+  B as dateDifference,
+  K as dateRange,
   H as dateRound,
-  z as delay,
-  L as enumerate,
-  U as hash,
+  J as delay,
+  Q as enumerate,
+  ee as hash,
   W as loadScript,
-  J as nextAnimationFrame,
-  Q as range,
-  X as shuffle,
-  ee as sum,
-  Z as unique,
+  V as nextAnimationFrame,
+  X as range,
+  Z as shuffle,
+  te as sum,
+  D as unique,
   P as zip
 };
 //# sourceMappingURL=core.js.map