@byloth/core 2.0.0-rc.1 → 2.0.0-rc.3

package/dist/core.js

@@ -1,20 +1,20 @@
-var j = Object.defineProperty;
-var D = (s, e, t) => e in s ? j(s, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : s[e] = t;
-var u = (s, e, t) => D(s, typeof e != "symbol" ? e + "" : e, t);
-const E = typeof window < "u" && typeof window.document < "u";
-var S;
-const J = typeof process < "u" && ((S = process.versions) == null ? void 0 : S.node);
+var P = Object.defineProperty;
+var j = (i, e, t) => e in i ? P(i, e, { enumerable: !0, configurable: !0, writable: !0, value: t }) : i[e] = t;
+var u = (i, e, t) => j(i, typeof e != "symbol" ? e + "" : e, t);
+const S = typeof window < "u" && typeof window.document < "u";
+var b;
+const $ = typeof process < "u" && ((b = process.versions) == null ? void 0 : b.node);
 var k;
-const W = typeof self == "object" && ((k = self.constructor) == null ? void 0 : k.name) === "DedicatedWorkerGlobalScope";
-class h extends Error {
+const A = typeof self == "object" && ((k = self.constructor) == null ? void 0 : k.name) === "DedicatedWorkerGlobalScope";
+class f extends Error {
   static FromUnknown(e) {
-    if (e instanceof h)
+    if (e instanceof f)
       return e;
     if (e instanceof Error) {
-      const t = new h(e.message);
+      const t = new f(e.message);
       return t.stack = e.stack, t.name = e.name, t;
     }
-    return new h(`${e}`);
+    return new f(`${e}`);
   }
   constructor(e, t, n = "Exception") {
     super(e), this.cause = t, this.name = n, t && (t instanceof Error ? this.stack += `
@@ -27,7 +27,7 @@ Caused by ${t}`);
     return "Exception";
   }
 }
-class g extends h {
+class _ extends f {
   constructor(e, t, n = "FatalErrorException") {
     e === void 0 && (e = "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(e, t, n);
   }
@@ -35,7 +35,7 @@ class g extends h {
     return "FatalErrorException";
   }
 }
-class Y extends g {
+class J extends _ {
   constructor(e, t, n = "NotImplementedException") {
     e === void 0 && (e = "This feature is not implemented yet. Please, try again later."), super(e, t, n);
   }
@@ -43,7 +43,7 @@ class Y extends g {
     return "NotImplementedException";
   }
 }
-class T extends h {
+class E extends f {
   constructor(e, t, n = "FileException") {
     super(e, t, n);
   }
@@ -51,7 +51,7 @@ class T extends h {
     return "FileException";
   }
 }
-class z extends T {
+class V extends E {
   constructor(e, t, n = "FileExistsException") {
     super(e, t, n);
   }
@@ -59,7 +59,7 @@ class z extends T {
     return "FileExistsException";
   }
 }
-class V extends T {
+class W extends E {
   constructor(e, t, n = "FileNotFoundException") {
     super(e, t, n);
   }
@@ -67,7 +67,7 @@ class V extends T {
     return "FileNotFoundException";
   }
 }
-class B extends h {
+class Y extends f {
   constructor(e, t, n = "KeyException") {
     super(e, t, n);
   }
@@ -75,7 +75,7 @@ class B extends h {
     return "KeyException";
   }
 }
-class K extends h {
+class z extends f {
   constructor(e, t, n = "NetworkException") {
     super(e, t, n);
   }
@@ -83,7 +83,7 @@ class K extends h {
     return "NetworkException";
   }
 }
-class G extends h {
+class B extends f {
   constructor(e, t, n = "PermissionException") {
     super(e, t, n);
   }
@@ -91,7 +91,7 @@ class G extends h {
     return "PermissionException";
   }
 }
-class q extends h {
+class D extends f {
   constructor(e, t, n = "ReferenceException") {
     super(e, t, n);
   }
@@ -99,7 +99,7 @@ class q extends h {
     return "ReferenceException";
   }
 }
-class m extends h {
+class y extends f {
   constructor(e, t, n = "RuntimeException") {
     super(e, t, n);
   }
@@ -107,7 +107,7 @@ class m extends h {
     return "RuntimeException";
   }
 }
-class A extends m {
+class C extends y {
   constructor(e, t, n = "EnvironmentException") {
     super(e, t, n);
   }
@@ -115,7 +115,7 @@ class A extends m {
     return "EnvironmentException";
   }
 }
-class C extends h {
+class O extends f {
   constructor(e, t, n = "TimeoutException") {
     super(e, t, n);
   }
@@ -123,7 +123,7 @@ class C extends h {
     return "TimeoutException";
   }
 }
-class H extends h {
+class K extends f {
   constructor(e, t, n = "TypeException") {
     super(e, t, n);
   }
@@ -131,7 +131,7 @@ class H extends h {
     return "TypeException";
   }
 }
-class f extends h {
+class m extends f {
   constructor(e, t, n = "ValueException") {
     super(e, t, n);
   }
@@ -139,7 +139,7 @@ class f extends h {
     return "ValueException";
   }
 }
-class M extends f {
+class T extends m {
   constructor(e, t, n = "RangeException") {
     super(e, t, n);
   }
@@ -147,7 +147,7 @@ class M extends f {
     return "RangeException";
   }
 }
-class a {
+class l {
   constructor(e) {
     u(this, "_iterator");
     u(this, "return");
@@ -178,7 +178,7 @@ class a {
   }
   filter(e) {
     const t = this._iterator;
-    return new a(function* () {
+    return new l(function* () {
       let n = 0;
       for (; ; ) {
         const r = t.next();
@@ -190,7 +190,7 @@ class a {
   }
   map(e) {
     const t = this._iterator;
-    return new a(function* () {
+    return new l(function* () {
       let n = 0;
       for (; ; ) {
         const r = t.next();
@@ -203,16 +203,71 @@ class a {
   reduce(e, t) {
     let n = 0, r = t;
     if (r === void 0) {
-      const i = this._iterator.next();
-      if (i.done)
-        throw new f("Cannot reduce an empty iterator without an initial value.");
-      r = i.value, n += 1;
+      const s = this._iterator.next();
+      if (s.done)
+        throw new m("Cannot reduce an empty iterator without an initial value.");
+      r = s.value, n += 1;
     }
     for (; ; ) {
-      const i = this._iterator.next();
-      if (i.done)
+      const s = this._iterator.next();
+      if (s.done)
         return r;
-      r = e(r, i.value, n), n += 1;
+      r = e(r, s.value, n), n += 1;
+    }
+  }
+  flatMap(e) {
+    const t = this._iterator;
+    return new l(function* () {
+      let n = 0;
+      for (; ; ) {
+        const r = t.next();
+        if (r.done)
+          return r.value;
+        const s = e(r.value, n);
+        for (const o of s)
+          yield o;
+        n += 1;
+      }
+    });
+  }
+  drop(e) {
+    const t = this._iterator;
+    return new l(function* () {
+      let n = 0;
+      for (; n < e; ) {
+        if (t.next().done)
+          return;
+        n += 1;
+      }
+      for (; ; ) {
+        const r = t.next();
+        if (r.done)
+          return r.value;
+        yield r.value;
+      }
+    });
+  }
+  take(e) {
+    const t = this._iterator;
+    return new l(function* () {
+      let n = 0;
+      for (; n < e; ) {
+        const r = t.next();
+        if (r.done)
+          return r.value;
+        yield r.value, n += 1;
+      }
+    });
+  }
+  find(e) {
+    let t = 0;
+    for (; ; ) {
+      const n = this._iterator.next();
+      if (n.done)
+        return;
+      if (e(n.value, t))
+        return n.value;
+      t += 1;
     }
   }
   enumerate() {
@@ -220,7 +275,7 @@ class a {
   }
   unique() {
     const e = this._iterator;
-    return new a(function* () {
+    return new l(function* () {
       const t = /* @__PURE__ */ new Set();
       for (; ; ) {
         const n = e.next();
@@ -250,6 +305,9 @@ class a {
   next(...e) {
     return this._iterator.next(...e);
   }
+  groupBy(e) {
+    return new d(this.map((t, n) => [e(t, n), t]));
+  }
   toArray() {
     return Array.from(this);
   }
@@ -260,7 +318,314 @@ class a {
     return this;
   }
 }
-class d {
+class c {
+  constructor(e) {
+    u(this, "_elements");
+    this._elements = new l(e);
+  }
+  every(e) {
+    for (const [t, [n, r]] of this._elements.enumerate())
+      if (!e(n, r, t))
+        return !1;
+    return !0;
+  }
+  some(e) {
+    for (const [t, [n, r]] of this._elements.enumerate())
+      if (e(n, r, t))
+        return !0;
+    return !1;
+  }
+  filter(e) {
+    const t = this._elements.enumerate();
+    return new c(function* () {
+      for (const [n, [r, s]] of t)
+        e(r, s, n) && (yield [r, s]);
+    });
+  }
+  map(e) {
+    const t = this._elements.enumerate();
+    return new c(function* () {
+      for (const [n, [r, s]] of t)
+        yield [r, e(r, s, n)];
+    });
+  }
+  reduce(e, t) {
+    let n = 0, r = t;
+    if (r === void 0) {
+      const s = this._elements.next();
+      if (s.done)
+        throw new m("Cannot reduce an empty iterator without an initial value.");
+      r = s.value[1], n += 1;
+    }
+    for (const [s, o] of this._elements)
+      r = e(s, r, o, n), n += 1;
+    return r;
+  }
+  flatMap(e) {
+    const t = this._elements.enumerate();
+    return new d(function* () {
+      for (const [n, [r, s]] of t)
+        for (const o of e(r, s, n))
+          yield [r, o];
+    });
+  }
+  drop(e) {
+    const t = this._elements.enumerate();
+    return new c(function* () {
+      for (const [n, [r, s]] of t)
+        n >= e && (yield [r, s]);
+    });
+  }
+  take(e) {
+    const t = this._elements.enumerate();
+    return new c(function* () {
+      for (const [n, [r, s]] of t) {
+        if (n >= e)
+          break;
+        yield [r, s];
+      }
+    });
+  }
+  enumerate() {
+    return this.map((e, t, n) => [n, t]);
+  }
+  unique() {
+    const e = this._elements;
+    return new c(function* () {
+      const t = /* @__PURE__ */ new Set();
+      for (const [n, r] of e)
+        t.has(r) || (t.add(r), yield [n, r]);
+    });
+  }
+  count() {
+    let e = 0;
+    for (const t of this._elements)
+      e += 1;
+    return e;
+  }
+  forEach(e) {
+    for (const [t, [n, r]] of this._elements.enumerate())
+      e(n, r, t);
+  }
+  keys() {
+    const e = this._elements;
+    return new l(function* () {
+      for (const [t] of e)
+        yield t;
+    });
+  }
+  items() {
+    return this._elements;
+  }
+  values() {
+    const e = this._elements;
+    return new l(function* () {
+      for (const [t, n] of e)
+        yield n;
+    });
+  }
+  toArray() {
+    return Array.from(this.values());
+  }
+  toMap() {
+    return new Map(this.items());
+  }
+  toObject() {
+    return Object.fromEntries(this.items());
+  }
+  get [Symbol.toStringTag]() {
+    return "ReducedIterator";
+  }
+}
+class w {
+  constructor(e) {
+    u(this, "_elements");
+    this._elements = new h(e);
+  }
+  async every(e) {
+    const t = /* @__PURE__ */ new Map();
+    for await (const [n, r] of this._elements) {
+      const [s, o] = t.get(n) ?? [0, !0];
+      o && t.set(n, [s + 1, await e(n, r, s)]);
+    }
+    return new c(function* () {
+      for (const [n, [r, s]] of t)
+        yield [n, s];
+    });
+  }
+  async some(e) {
+    const t = /* @__PURE__ */ new Map();
+    for await (const [n, r] of this._elements) {
+      const [s, o] = t.get(n) ?? [0, !1];
+      o || t.set(n, [s + 1, await e(n, r, s)]);
+    }
+    return new c(function* () {
+      for (const [n, [r, s]] of t)
+        yield [n, s];
+    });
+  }
+  filter(e) {
+    const t = this._elements;
+    return new w(async function* () {
+      const n = /* @__PURE__ */ new Map();
+      for await (const [r, s] of t) {
+        const o = n.get(r) ?? 0;
+        await e(r, s, o) && (yield [r, s]), n.set(r, o + 1);
+      }
+    });
+  }
+  map(e) {
+    const t = this._elements;
+    return new w(async function* () {
+      const n = /* @__PURE__ */ new Map();
+      for await (const [r, s] of t) {
+        const o = n.get(r) ?? 0;
+        yield [r, await e(r, s, o)], n.set(r, o + 1);
+      }
+    });
+  }
+  async reduce(e, t) {
+    const n = /* @__PURE__ */ new Map();
+    for await (const [r, s] of this._elements) {
+      let o, a;
+      if (n.has(r))
+        [o, a] = n.get(r);
+      else if (t !== void 0)
+        o = 0, a = await t(r);
+      else {
+        n.set(r, [0, s]);
+        continue;
+      }
+      n.set(r, [o + 1, await e(r, a, s, o)]);
+    }
+    return new c(function* () {
+      for (const [r, [s, o]] of n)
+        yield [r, o];
+    });
+  }
+  flatMap(e) {
+    const t = this._elements;
+    return new w(async function* () {
+      const n = /* @__PURE__ */ new Map();
+      for await (const [r, s] of t) {
+        const o = n.get(r) ?? 0, a = await e(r, s, o);
+        for await (const p of a)
+          yield [r, p];
+        n.set(r, o + 1);
+      }
+    });
+  }
+  drop(e) {
+    const t = this._elements;
+    return new w(async function* () {
+      const n = /* @__PURE__ */ new Map();
+      for await (const [r, s] of t) {
+        const o = n.get(r) ?? 0;
+        if (o < e) {
+          n.set(r, o + 1);
+          continue;
+        }
+        yield [r, s];
+      }
+    });
+  }
+  take(e) {
+    const t = this._elements;
+    return new w(async function* () {
+      const n = /* @__PURE__ */ new Map();
+      for await (const [r, s] of t) {
+        const o = n.get(r) ?? 0;
+        if (o >= e) {
+          if (n.values().every((a) => a >= e))
+            break;
+          continue;
+        }
+        yield [r, s], n.set(r, o + 1);
+      }
+    });
+  }
+  async find(e) {
+    const t = /* @__PURE__ */ new Map();
+    for await (const [n, r] of this._elements) {
+      let [s, o] = t.get(n) ?? [0, void 0];
+      o === void 0 && (await e(n, r, s) && (o = r), t.set(n, [s + 1, o]));
+    }
+    return new c(function* () {
+      for (const [n, [r, s]] of t)
+        yield [n, s];
+    });
+  }
+  unique() {
+    const e = this._elements;
+    return new w(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]);
+      }
+    });
+  }
+  async count() {
+    const e = /* @__PURE__ */ new Map();
+    for await (const [t] of this._elements) {
+      const n = e.get(t) ?? 0;
+      e.set(t, n + 1);
+    }
+    return new c(function* () {
+      for (const [t, n] of e)
+        yield [t, n];
+    });
+  }
+  async forEach(e) {
+    const t = /* @__PURE__ */ new Map();
+    for await (const [n, r] of this._elements) {
+      const s = t.get(n) ?? 0;
+      e(n, r, s), t.set(n, s + 1);
+    }
+  }
+  keys() {
+    const e = this._elements;
+    return new h(async function* () {
+      const t = /* @__PURE__ */ new Set();
+      for await (const [n] of e)
+        t.has(n) || (t.add(n), yield n);
+    });
+  }
+  items() {
+    return this._elements;
+  }
+  values() {
+    const e = this._elements;
+    return new h(async function* () {
+      for await (const [t, n] of e)
+        yield n;
+    });
+  }
+  async toArray() {
+    const e = await this.toMap();
+    return Array.from(e.values());
+  }
+  async toMap() {
+    const e = /* @__PURE__ */ new Map();
+    for await (const [t, n] of this._elements) {
+      const r = e.get(t) ?? [];
+      r.push(n), e.set(t, r);
+    }
+    return e;
+  }
+  async toObject() {
+    const e = {};
+    for await (const [t, n] of this._elements) {
+      const r = e[t] ?? [];
+      r.push(n), e[t] = r;
+    }
+    return e;
+  }
+  get [Symbol.toStringTag]() {
+    return "AggregatedAsyncIterator";
+  }
+}
+class h {
   constructor(e) {
     u(this, "_iterator");
     u(this, "return");
@@ -306,7 +671,7 @@ class d {
       const n = await this._iterator.next();
       if (n.done)
         return !0;
-      if (!e(n.value, t))
+      if (!await e(n.value, t))
         return !1;
       t += 1;
     }
@@ -317,48 +682,103 @@ class d {
       const n = await this._iterator.next();
       if (n.done)
         return !1;
-      if (e(n.value, t))
+      if (await e(n.value, t))
         return !0;
       t += 1;
     }
   }
   filter(e) {
     const t = this._iterator;
-    return new d(async function* () {
+    return new h(async function* () {
+      let n = 0;
+      for (; ; ) {
+        const r = await t.next();
+        if (r.done)
+          return r.value;
+        await e(r.value, n) && (yield r.value), n += 1;
+      }
+    });
+  }
+  map(e) {
+    const t = this._iterator;
+    return new h(async function* () {
+      let n = 0;
+      for (; ; ) {
+        const r = await t.next();
+        if (r.done)
+          return r.value;
+        yield await e(r.value, n), n += 1;
+      }
+    });
+  }
+  async reduce(e, t) {
+    let n = 0, r = t;
+    if (r === void 0) {
+      const s = await this._iterator.next();
+      if (s.done)
+        throw new m("Cannot reduce an empty iterator without an initial value.");
+      r = s.value, n += 1;
+    }
+    for (; ; ) {
+      const s = await this._iterator.next();
+      if (s.done)
+        return r;
+      r = await e(r, s.value, n), n += 1;
+    }
+  }
+  flatMap(e) {
+    const t = this._iterator;
+    return new h(async function* () {
       let n = 0;
       for (; ; ) {
         const r = await t.next();
         if (r.done)
           return r.value;
-        e(r.value, n) && (yield r.value), n += 1;
+        const s = await e(r.value, n);
+        for await (const o of s)
+          yield o;
+        n += 1;
       }
     });
   }
-  map(e) {
+  drop(e) {
     const t = this._iterator;
-    return new d(async function* () {
+    return new h(async function* () {
       let n = 0;
+      for (; n < e; ) {
+        if ((await t.next()).done)
+          return;
+        n += 1;
+      }
       for (; ; ) {
         const r = await t.next();
         if (r.done)
           return r.value;
-        yield e(r.value, n), n += 1;
+        yield r.value;
       }
     });
   }
-  async reduce(e, t) {
-    let n = 0, r = t;
-    if (r === void 0) {
-      const i = await this._iterator.next();
-      if (i.done)
-        throw new f("Cannot reduce an empty iterator without an initial value.");
-      r = i.value, n += 1;
-    }
+  take(e) {
+    const t = this._iterator;
+    return new h(async function* () {
+      let n = 0;
+      for (; n < e; ) {
+        const r = await t.next();
+        if (r.done)
+          return r.value;
+        yield r.value, n += 1;
+      }
+    });
+  }
+  async find(e) {
+    let t = 0;
     for (; ; ) {
-      const i = await this._iterator.next();
-      if (i.done)
-        return r;
-      r = await e(r, i.value, n), n += 1;
+      const n = await this._iterator.next();
+      if (n.done)
+        return;
+      if (await e(n.value, t))
+        return n.value;
+      t += 1;
     }
   }
   enumerate() {
@@ -366,7 +786,7 @@ class d {
   }
   unique() {
     const e = this._iterator;
-    return new d(async function* () {
+    return new h(async function* () {
       const t = /* @__PURE__ */ new Set();
       for (; ; ) {
         const n = await e.next();
@@ -396,14 +816,11 @@ class d {
   next(...e) {
     return this._iterator.next(...e);
   }
-  async toArray() {
-    const e = [];
-    for (; ; ) {
-      const t = await this._iterator.next();
-      if (t.done)
-        return e;
-      e.push(t.value);
-    }
+  groupBy(e) {
+    return new w(this.map(async (t, n) => [await e(t, n), t]));
+  }
+  toArray() {
+    return Array.fromAsync(this);
   }
   get [Symbol.toStringTag]() {
     return "SmartAsyncIterator";
@@ -412,346 +829,160 @@ class d {
     return this;
   }
 }
-class l {
-  constructor(e) {
-    u(this, "_elements");
-    this._elements = new a(e);
-  }
-  filter(e) {
-    const t = this._elements;
-    return new l(function* () {
-      for (const [n, [r, i]] of t.enumerate())
-        e(r, i, n) && (yield [r, i]);
-    });
-  }
-  map(e) {
-    const t = this._elements;
-    return new l(function* () {
-      for (const [n, [r, i]] of t.enumerate())
-        yield [r, e(r, i, n)];
-    });
-  }
-  reduce(e, t) {
-    let n = 0, r;
-    if (t !== void 0)
-      r = t;
-    else {
-      const i = this._elements.next();
-      if (i.done)
-        throw new f("Cannot reduce an empty iterator without an initial value.");
-      n += 1, r = i.value[1];
-    }
-    for (const [i, o] of this._elements)
-      r = e(i, r, o, n), n += 1;
-    return r;
-  }
-  keys() {
-    const e = this._elements;
-    return new a(function* () {
-      for (const [t] of e)
-        yield t;
-    });
-  }
-  items() {
-    return this._elements;
-  }
-  values() {
-    const e = this._elements;
-    return new a(function* () {
-      for (const [t, n] of e)
-        yield n;
-    });
-  }
-  toArray() {
-    return Array.from(this.values());
-  }
-  toMap() {
-    return new Map(this.items());
-  }
-  toObject() {
-    return Object.fromEntries(this.items());
-  }
-  get [Symbol.toStringTag]() {
-    return "ReducedIterator";
-  }
-}
-class w {
+class d {
   constructor(e) {
     u(this, "_elements");
-    this._elements = new a(e);
+    this._elements = new l(e);
   }
   every(e) {
     const t = /* @__PURE__ */ new Map();
     for (const [n, r] of this._elements) {
-      const [i, o] = t.get(n) ?? [0, !0];
-      o && t.set(n, [i + 1, e(n, r, i)]);
+      const [s, o] = t.get(n) ?? [0, !0];
+      o && t.set(n, [s + 1, e(n, r, s)]);
     }
-    return new l(function* () {
-      for (const [n, [r, i]] of t)
-        yield [n, i];
+    return new c(function* () {
+      for (const [n, [r, s]] of t)
+        yield [n, s];
     });
   }
   some(e) {
     const t = /* @__PURE__ */ new Map();
     for (const [n, r] of this._elements) {
-      const [i, o] = t.get(n) ?? [0, !1];
-      o || t.set(n, [i + 1, e(n, r, i)]);
+      const [s, o] = t.get(n) ?? [0, !1];
+      o || t.set(n, [s + 1, e(n, r, s)]);
     }
-    return new l(function* () {
-      for (const [n, [r, i]] of t)
-        yield [n, i];
+    return new c(function* () {
+      for (const [n, [r, s]] of t)
+        yield [n, s];
     });
   }
   filter(e) {
     const t = this._elements;
-    return new w(function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [r, i] of t) {
+      for (const [r, s] of t) {
         const o = n.get(r) ?? 0;
-        n.set(r, o + 1), e(r, i, o) && (yield [r, i]);
+        e(r, s, o) && (yield [r, s]), n.set(r, o + 1);
       }
     });
   }
   map(e) {
     const t = this._elements;
-    return new w(function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
-      for (const [r, i] of t) {
+      for (const [r, s] of t) {
         const o = n.get(r) ?? 0;
-        n.set(r, o + 1), yield [r, e(r, i, o)];
+        yield [r, e(r, s, o)], n.set(r, o + 1);
       }
     });
   }
   reduce(e, t) {
     const n = /* @__PURE__ */ new Map();
-    for (const [r, i] of this._elements) {
-      let o, c;
+    for (const [r, s] of this._elements) {
+      let o, a;
       if (n.has(r))
-        [o, c] = n.get(r), o += 1;
+        [o, a] = n.get(r);
       else if (t !== void 0)
-        o = 0, c = t(r);
+        o = 0, a = t(r);
       else {
-        n.set(r, [0, i]);
+        n.set(r, [0, s]);
         continue;
       }
-      c = e(r, c, i, o), n.set(r, [o, c]);
+      n.set(r, [o + 1, e(r, a, s, o)]);
     }
-    return new l(function* () {
-      for (const [r, [i, o]] of n)
+    return new c(function* () {
+      for (const [r, [s, o]] of n)
         yield [r, o];
     });
   }
-  unique() {
-    const e = this._elements;
-    return new w(function* () {
-      const t = /* @__PURE__ */ new Map();
-      for (const [n, r] of e) {
-        const i = t.get(n) ?? /* @__PURE__ */ new Set();
-        i.has(r) || (i.add(r), t.set(n, i), yield [n, r]);
+  flatMap(e) {
+    const t = this._elements;
+    return new d(function* () {
+      const n = /* @__PURE__ */ new Map();
+      for (const [r, s] of t) {
+        const o = n.get(r) ?? 0, a = e(r, s, o);
+        for (const p of a)
+          yield [r, p];
+        n.set(r, o + 1);
       }
     });
   }
-  count() {
-    const e = /* @__PURE__ */ new Map();
-    for (const [t] of this._elements) {
-      const n = e.get(t) ?? 0;
-      e.set(t, n + 1);
-    }
-    return new l(function* () {
-      for (const [t, n] of e)
-        yield [t, n];
-    });
-  }
-  first() {
-    const e = /* @__PURE__ */ new Map();
-    for (const [t, n] of this._elements)
-      e.has(t) || e.set(t, n);
-    return new l(function* () {
-      for (const [t, n] of e)
-        yield [t, n];
-    });
-  }
-  last() {
-    const e = /* @__PURE__ */ new Map();
-    for (const [t, n] of this._elements)
-      e.set(t, n);
-    return new l(function* () {
-      for (const [t, n] of e)
-        yield [t, n];
-    });
-  }
-  keys() {
-    const e = this._elements;
-    return new a(function* () {
-      const t = /* @__PURE__ */ new Set();
-      for (const [n] of e)
-        t.has(n) || (t.add(n), yield n);
-    });
-  }
-  items() {
-    return this._elements;
-  }
-  values() {
-    const e = this._elements;
-    return new a(function* () {
-      for (const [t, n] of e)
-        yield n;
-    });
-  }
-  toArray() {
-    return Array.from(this.toMap().values());
-  }
-  toMap() {
-    const e = /* @__PURE__ */ new Map();
-    for (const [t, n] of this._elements) {
-      const r = e.get(t) ?? [];
-      r.push(n), e.set(t, r);
-    }
-    return e;
-  }
-  toObject() {
-    const e = {};
-    for (const [t, n] of this._elements) {
-      const r = e[t] ?? [];
-      r.push(n), e[t] = r;
-    }
-    return e;
-  }
-  get [Symbol.toStringTag]() {
-    return "AggregatedIterator";
-  }
-}
-class _ {
-  constructor(e) {
-    u(this, "_elements");
-    this._elements = new a(e);
-  }
-  filter(e) {
-    return new _(this._elements.filter(e));
-  }
-  map(e) {
-    return new _(this._elements.map(e));
-  }
-  unique() {
-    return new _(this._elements.unique());
-  }
-  groupBy(e) {
-    return new w(this._elements.map((t, n) => [e(t, n), t]));
-  }
-  get [Symbol.toStringTag]() {
-    return "Aggregator";
-  }
-}
-class y {
-  constructor(e) {
-    u(this, "_elements");
-    this._elements = new d(e);
-  }
-  async every(e) {
-    const t = /* @__PURE__ */ new Map();
-    for await (const [n, r] of this._elements) {
-      const [i, o] = t.get(n) ?? [0, !0];
-      o && t.set(n, [i + 1, await e(n, r, i)]);
-    }
-    return new l(function* () {
-      for (const [n, [r, i]] of t)
-        yield [n, i];
-    });
-  }
-  async some(e) {
-    const t = /* @__PURE__ */ new Map();
-    for await (const [n, r] of this._elements) {
-      const [i, o] = t.get(n) ?? [0, !1];
-      o || t.set(n, [i + 1, await e(n, r, i)]);
-    }
-    return new l(function* () {
-      for (const [n, [r, i]] of t)
-        yield [n, i];
-    });
-  }
-  filter(e) {
+  drop(e) {
     const t = this._elements;
-    return new y(async function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [r, i] of t) {
+      for (const [r, s] of t) {
         const o = n.get(r) ?? 0;
-        n.set(r, o + 1), await e(r, i, o) && (yield [r, i]);
+        if (o < e) {
+          n.set(r, o + 1);
+          continue;
+        }
+        yield [r, s];
       }
     });
   }
-  map(e) {
+  take(e) {
     const t = this._elements;
-    return new y(async function* () {
+    return new d(function* () {
       const n = /* @__PURE__ */ new Map();
-      for await (const [r, i] of t) {
+      for (const [r, s] of t) {
         const o = n.get(r) ?? 0;
-        n.set(r, o + 1), yield [r, await e(r, i, o)];
+        if (o >= e) {
+          if (n.values().every((a) => a >= e))
+            break;
+          continue;
+        }
+        yield [r, s], n.set(r, o + 1);
       }
     });
   }
-  async reduce(e, t) {
-    const n = /* @__PURE__ */ new Map();
-    for await (const [r, i] of this._elements) {
-      let o, c;
-      if (n.has(r))
-        [o, c] = n.get(r), o += 1;
-      else if (t !== void 0)
-        o = 0, c = await t(r);
-      else {
-        n.set(r, [0, i]);
-        continue;
-      }
-      c = await e(r, c, i, o), n.set(r, [o, c]);
+  find(e) {
+    const t = /* @__PURE__ */ new Map();
+    for (const [n, r] of this._elements) {
+      let [s, o] = t.get(n) ?? [0, void 0];
+      o === void 0 && (e(n, r, s) && (o = r), t.set(n, [s + 1, o]));
     }
-    return new l(function* () {
-      for (const [r, [i, o]] of n)
-        yield [r, o];
+    return new c(function* () {
+      for (const [n, [r, s]] of t)
+        yield [n, s];
     });
   }
+  enumerate() {
+    return this.map((e, t, n) => [n, t]);
+  }
   unique() {
     const e = this._elements;
-    return new y(async function* () {
+    return new d(function* () {
       const t = /* @__PURE__ */ new Map();
-      for await (const [n, r] of e) {
-        const i = t.get(n) ?? /* @__PURE__ */ new Set();
-        i.has(r) || (i.add(r), t.set(n, i), yield [n, r]);
+      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]);
       }
     });
   }
-  async count() {
+  count() {
     const e = /* @__PURE__ */ new Map();
-    for await (const [t] of this._elements) {
+    for (const [t] of this._elements) {
       const n = e.get(t) ?? 0;
       e.set(t, n + 1);
     }
-    return new l(function* () {
-      for (const [t, n] of e)
-        yield [t, n];
-    });
-  }
-  async first() {
-    const e = /* @__PURE__ */ new Map();
-    for await (const [t, n] of this._elements)
-      e.has(t) || e.set(t, n);
-    return new l(function* () {
+    return new c(function* () {
       for (const [t, n] of e)
         yield [t, n];
     });
   }
-  async last() {
-    const e = /* @__PURE__ */ new Map();
-    for await (const [t, n] of this._elements)
-      e.set(t, n);
-    return new l(function* () {
-      for (const [t, n] of e)
-        yield [t, n];
-    });
+  forEach(e) {
+    const t = /* @__PURE__ */ new Map();
+    for (const [n, r] of this._elements) {
+      const s = t.get(n) ?? 0;
+      e(n, r, s), t.set(n, s + 1);
+    }
   }
   keys() {
     const e = this._elements;
-    return new d(async function* () {
+    return new l(function* () {
       const t = /* @__PURE__ */ new Set();
-      for await (const [n] of e)
+      for (const [n] of e)
         t.has(n) || (t.add(n), yield n);
     });
   }
@@ -760,79 +991,58 @@ class y {
   }
   values() {
     const e = this._elements;
-    return new d(async function* () {
-      for await (const [t, n] of e)
+    return new l(function* () {
+      for (const [t, n] of e)
         yield n;
     });
   }
-  async toArray() {
-    const e = await this.toMap();
+  toArray() {
+    const e = this.toMap();
     return Array.from(e.values());
   }
-  async toMap() {
+  toMap() {
     const e = /* @__PURE__ */ new Map();
-    for await (const [t, n] of this._elements) {
+    for (const [t, n] of this._elements) {
       const r = e.get(t) ?? [];
       r.push(n), e.set(t, r);
     }
     return e;
   }
-  async toObject() {
+  toObject() {
     const e = {};
-    for await (const [t, n] of this._elements) {
+    for (const [t, n] of this._elements) {
       const r = e[t] ?? [];
       r.push(n), e[t] = r;
     }
     return e;
   }
   get [Symbol.toStringTag]() {
-    return "AggregatedAsyncIterator";
-  }
-}
-class p {
-  constructor(e) {
-    u(this, "_elements");
-    this._elements = new d(e);
-  }
-  filter(e) {
-    return new p(this._elements.filter(e));
-  }
-  map(e) {
-    return new p(this._elements.map(e));
-  }
-  unique() {
-    return new p(this._elements.unique());
-  }
-  groupBy(e) {
-    return new y(this._elements.map(async (t, n) => [await e(t, n), t]));
-  }
-  get [Symbol.toStringTag]() {
-    return "AsyncAggregator";
+    return "AggregatedIterator";
   }
 }
-var x = /* @__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))(x || {});
-function L(s, e, t = 864e5) {
-  return s = new Date(s), e = new Date(e), Math.floor((e.getTime() - s.getTime()) / t);
+var x = /* @__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))(x || {});
+function G(i, e, t = 864e5) {
+  return i = new Date(i), e = new Date(e), Math.floor((e.getTime() - i.getTime()) / t);
 }
-function Q(s, e, t = 864e5) {
-  return s = new Date(s), e = new Date(e), new a(function* () {
+function H(i, e, t = 864e5) {
+  return i = new Date(i), e = new Date(e), new l(function* () {
     const n = e.getTime();
-    let r = s.getTime();
+    let r = i.getTime();
     for (; r < n; )
       yield new Date(r), r += t;
   });
 }
-function X(s, e = 864e5) {
-  return s = new Date(s), new Date(Math.floor(s.getTime() / e) * e);
+function L(i, e = 864e5) {
+  return i = new Date(i), new Date(Math.floor(i.getTime() / e) * e);
 }
-class R {
+class M {
   constructor(e, t = 30) {
     u(this, "_handle");
     u(this, "_startTime");
     u(this, "_isRunning");
     u(this, "_start");
     u(this, "_stop");
-    this._startTime = 0, this._isRunning = !1, E ? (this._start = () => {
+    this._startTime = 0, this._isRunning = !1, S ? (this._start = () => {
       e(this.elapsedTime), this._handle = window.requestAnimationFrame(this._start);
     }, this._stop = () => window.cancelAnimationFrame(this._handle)) : (console.warn(
       `Not a browser environment detected. Using setInterval@${t}fps instead of requestAnimationFrame...`
@@ -852,24 +1062,24 @@ class R {
   }
   start(e = 0) {
     if (this._isRunning)
-      throw new m("The game loop has already been started.");
+      throw new y("The game loop has already been started.");
     this._startTime = performance.now() - e, this._start(), this._isRunning = !0;
   }
   stop() {
     if (!this._isRunning)
-      throw new m("The game loop hadn't yet started.");
+      throw new y("The game loop hadn't yet started.");
     if (!this._handle)
-      throw new g();
+      throw new _();
     this._stop(), this._handle = void 0, this._isRunning = !1;
   }
 }
-class Z {
+class Q {
   constructor(e = !0) {
     u(this, "_preferPersistence");
     u(this, "_volatile");
     u(this, "_persistent");
-    if (this._preferPersistence = e, !E)
-      throw new A(
+    if (this._preferPersistence = e, !S)
+      throw new C(
         "The `JSONStorage` class can only be instantiated within a browser environment."
       );
     this._volatile = window.sessionStorage, this._persistent = window.localStorage;
@@ -1005,7 +1215,7 @@ class Z {
     return "JSONStorage";
   }
 }
-class F {
+class v {
   constructor(e) {
     u(this, "_isPending");
     u(this, "_isFulfilled");
@@ -1017,6 +1227,9 @@ class F {
     };
     this._promise = new Promise(e).then(t, n);
   }
+  static FromPromise(e) {
+    return new v((t, n) => e.then(t, n));
+  }
   get isPending() {
     return this._isPending;
   }
@@ -1039,15 +1252,15 @@ class F {
     return "SmartPromise";
   }
 }
-class O extends F {
+class q extends v {
   constructor(t, n) {
-    let r, i;
-    super((o, c) => {
-      r = o, i = c;
+    let r, s;
+    super((o, a) => {
+      r = o, s = a;
     });
     u(this, "_resolve");
     u(this, "_reject");
-    this._promise.then(t, n), this._resolve = r, this._reject = i;
+    this._promise.then(t, n), this._resolve = r, this._reject = s;
   }
   get resolve() {
     return this._resolve;
@@ -1062,22 +1275,22 @@ class O extends F {
     return "DeferredPromise";
   }
 }
-class U extends F {
+class X extends v {
   constructor(e, t) {
     super((n, r) => {
-      const i = (v) => {
-        clearTimeout(b), n(v);
-      }, o = (v) => {
-        clearTimeout(b), r(v);
-      }, b = setTimeout(() => o(new C("The operation has timed out.")), t);
-      e(i, o);
+      const s = (g) => {
+        clearTimeout(p), n(g);
+      }, o = (g) => {
+        clearTimeout(p), r(g);
+      }, p = setTimeout(() => o(new O("The operation has timed out.")), t);
+      e(s, o);
     });
   }
   get [Symbol.toStringTag]() {
     return "TimedPromise";
   }
 }
-class P {
+class F {
   constructor() {
     u(this, "_subscribers");
     this._subscribers = [];
@@ -1086,7 +1299,7 @@ class P {
     return this._subscribers.push(e), () => {
       const t = this._subscribers.indexOf(e);
       if (t < 0)
-        throw new q("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed.");
+        throw new D("Unable to unsubscribe the required subscriber. The subscription was already unsubscribed.");
       this._subscribers.splice(t, 1);
     };
   }
@@ -1097,44 +1310,43 @@ class P {
     return "Publisher";
   }
 }
-class ee extends R {
+class Z extends M {
   constructor(t = x.Second) {
     super((n) => this._publisher.publish(n), t);
     u(this, "_publisher");
-    this._publisher = new P();
+    this._publisher = new F();
   }
   start(t = 0) {
     if (this._isRunning)
-      throw new m("The clock has already been started.");
+      throw new y("The clock has already been started.");
     super.start(t);
   }
   stop() {
     if (!this._isRunning)
-      throw new m("The clock hadn't yet started.");
+      throw new y("The clock hadn't yet started.");
     super.stop();
   }
   onTick(t, n = 0) {
     if (n < 0)
-      throw new M("The tick step must be a non-negative number.");
+      throw new T("The tick step must be a non-negative number.");
     if (n === 0)
       return this._publisher.subscribe(t);
     let r = 0;
-    return this._publisher.subscribe((i) => {
-      i - r < n || (t(i), r = i);
+    return this._publisher.subscribe((s) => {
+      s - r < n || (t(s), r = s);
     });
   }
 }
-class te extends R {
+class U extends M {
   constructor(t, n = x.Second) {
-    super((i) => {
-      this._duration -= i;
-      const o = this.remainingTime;
-      this._publisher.publish(o), o <= 0 && this.stop();
+    super(() => {
+      const s = this.remainingTime;
+      this._publisher.publish(s), s <= 0 && this.stop();
     }, n);
     u(this, "_deferrer");
     u(this, "_publisher");
     u(this, "_duration");
-    this._publisher = new P(), this._duration = t;
+    this._publisher = new F(), this._duration = t;
   }
   get duration() {
     return this._duration;
@@ -1144,30 +1356,30 @@ class te extends R {
   }
   start(t = this.duration) {
     if (this._isRunning)
-      throw new m("The countdown has already been started.");
+      throw new y("The countdown has already been started.");
     if (this._deferrer)
-      throw new g();
-    return this._deferrer = new O(() => this.stop()), super.start(this.duration - t), this._deferrer;
+      throw new _();
+    return this._deferrer = new q(), super.start(this.duration - t), this._deferrer;
   }
   stop(t) {
     if (!this._isRunning)
-      throw new m("The countdown hadn't yet started.");
+      throw new y("The countdown hadn't yet started.");
     if (!this._deferrer)
-      throw new g();
+      throw new _();
     super.stop(), t !== void 0 ? this._deferrer.reject(t) : this._deferrer.resolve(), this._deferrer = void 0;
   }
   onTick(t, n = 0) {
     if (n < 0)
-      throw new M("The tick step must be a non-negative number.");
+      throw new T("The tick step must be a non-negative number.");
     if (n === 0)
       return this._publisher.subscribe(t);
     let r = 0;
-    return this._publisher.subscribe((i) => {
-      r - i < n || (t(i), r = i);
+    return this._publisher.subscribe((s) => {
+      r - s < n || (t(s), r = s);
     });
   }
 }
-class I {
+class R {
   static Boolean(e = 0.5) {
     return Math.random() < e;
   }
@@ -1179,175 +1391,173 @@ class I {
   }
   static Index(e) {
     if (e.length === 0)
-      throw new f("You must provide at least one element.");
+      throw new m("You must provide at least one element.");
     return this.Integer(e.length);
   }
   static Choice(e) {
-    return e[I.Index(e)];
+    return e[R.Index(e)];
   }
   // eslint-disable-next-line no-useless-constructor
   constructor() {
   }
 }
-async function ne(s) {
-  return new Promise((e, t) => setTimeout(e, s));
+function ee(i) {
+  return new Promise((e) => setTimeout(e, i));
 }
-async function re() {
-  return new Promise((s, e) => requestAnimationFrame(() => s()));
+function te() {
+  return new Promise((i) => requestAnimationFrame(() => i()));
 }
-function se(s, e = "text/javascript") {
+function ne(i, e = "text/javascript") {
   return new Promise((t, n) => {
     const r = document.createElement("script");
-    r.async = !0, r.defer = !0, r.src = s, r.type = e, r.onload = () => t(), r.onerror = () => n(), document.body.appendChild(r);
+    r.async = !0, r.defer = !0, r.src = i, r.type = e, r.onload = () => t(), r.onerror = () => n(), document.body.appendChild(r);
   });
 }
-function ie(...s) {
-  return new a(function* () {
-    for (const e of s)
+function re(...i) {
+  return new l(function* () {
+    for (const e of i)
       for (const t of e)
         yield t;
   });
 }
-function oe(s) {
-  if (Array.isArray(s))
-    return s.length;
+function se(i) {
+  if (Array.isArray(i))
+    return i.length;
   let e = 0;
-  for (const t of s)
+  for (const t of i)
     e += 1;
   return e;
 }
-function ue(s) {
-  return new a(function* () {
+function ie(i) {
+  return new l(function* () {
     let e = 0;
-    for (const t of s)
+    for (const t of i)
       yield [e, t], e += 1;
   });
 }
-function ae(s, e, t = 1) {
-  return new a(function* () {
-    e === void 0 && (e = s, s = 0), s > e && (t = t ?? -1);
-    for (let n = s; n < e; n += t)
+function oe(i, e, t = 1) {
+  return new l(function* () {
+    e === void 0 && (e = i, i = 0), i > e && (t = t ?? -1);
+    for (let n = i; n < e; n += t)
       yield n;
   });
 }
-function ce(s) {
-  const e = Array.from(s);
+function ue(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 le(s) {
-  return new a(function* () {
+function ae(i) {
+  return new l(function* () {
     const e = /* @__PURE__ */ new Set();
-    for (const t of s)
+    for (const t of i)
       e.has(t) || (e.add(t), yield t);
   });
 }
-function N(s, e) {
-  return new a(function* () {
-    const t = s[Symbol.iterator](), n = e[Symbol.iterator]();
+function I(i, e) {
+  return new l(function* () {
+    const t = i[Symbol.iterator](), n = e[Symbol.iterator]();
     for (; ; ) {
-      const r = t.next(), i = n.next();
-      if (r.done || i.done)
+      const r = t.next(), s = n.next();
+      if (r.done || s.done)
         break;
-      yield [r.value, i.value];
+      yield [r.value, s.value];
     }
   });
 }
-function he(s, e) {
+function le(i, e) {
   if (e === void 0) {
-    let i = 0, o = 0;
-    for (const c of s)
-      i += c, o += 1;
+    let s = 0, o = 0;
+    for (const a of i)
+      s += a, o += 1;
     if (o === 0)
-      throw new f("You must provide at least one value.");
-    return i / o;
+      throw new m("You must provide at least one value.");
+    return s / o;
   }
   let t = 0, n = 0, r = 0;
-  for (const [i, o] of N(s, e)) {
+  for (const [s, o] of I(i, e)) {
     if (o <= 0)
-      throw new f(`The weight for the value #${r} must be greater than zero.`);
-    t += i * o, n += o, r += 1;
+      throw new m(`The weight for the value #${r} must be greater than zero.`);
+    t += s * o, n += o, r += 1;
   }
   if (r === 0)
-    throw new f("You must provide at least one value and weight.");
+    throw new m("You must provide at least one value and weight.");
   if (n > 0)
-    throw new f("The sum of weights must be greater than zero.");
+    throw new m("The sum of weights must be greater than zero.");
   return t / n;
 }
-function fe(s) {
+function ce(i) {
   let e = 0;
-  for (let t = 0; t < s.length; t += 1) {
-    const n = s.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 de(s) {
+function fe(i) {
   let e = 0;
-  for (const t of s)
+  for (const t of i)
     e += t;
   return e;
 }
-function me(s) {
-  return `${s.charAt(0).toUpperCase()}${s.slice(1)}`;
+function he(i) {
+  return `${i.charAt(0).toUpperCase()}${i.slice(1)}`;
 }
-const we = "2.0.0-rc.1";
+const de = "2.0.0-rc.3";
 export {
-  y as AggregatedAsyncIterator,
-  w as AggregatedIterator,
-  _ as Aggregator,
-  p as AsyncAggregator,
-  ee as Clock,
-  te as Countdown,
-  O as DeferredPromise,
-  h as Exception,
-  g as FatalErrorException,
-  T as FileException,
-  z as FileExistsException,
-  V as FileNotFoundException,
-  R as GameLoop,
-  Z as JSONStorage,
-  B as KeyException,
-  K as NetworkException,
-  Y as NotImplementedException,
-  G as PermissionException,
-  P as Publisher,
-  I as Random,
-  M as RangeException,
-  l as ReducedIterator,
-  q as ReferenceException,
-  m as RuntimeException,
-  d as SmartAsyncIterator,
-  a as SmartIterator,
-  F as SmartPromise,
+  w as AggregatedAsyncIterator,
+  d as AggregatedIterator,
+  Z as Clock,
+  U as Countdown,
+  q as DeferredPromise,
+  f as Exception,
+  _ as FatalErrorException,
+  E as FileException,
+  V as FileExistsException,
+  W as FileNotFoundException,
+  M as GameLoop,
+  Q as JSONStorage,
+  Y as KeyException,
+  z as NetworkException,
+  J as NotImplementedException,
+  B as PermissionException,
+  F as Publisher,
+  R as Random,
+  T as RangeException,
+  c as ReducedIterator,
+  D as ReferenceException,
+  y as RuntimeException,
+  h as SmartAsyncIterator,
+  l as SmartIterator,
+  v as SmartPromise,
   x as TimeUnit,
-  U as TimedPromise,
-  C as TimeoutException,
-  H as TypeException,
-  we as VERSION,
-  f as ValueException,
-  he as average,
-  me as capitalize,
-  ie as chain,
-  oe as count,
-  L as dateDifference,
-  Q as dateRange,
-  X as dateRound,
-  ne as delay,
-  ue as enumerate,
-  fe as hash,
-  E as isBrowser,
-  J as isNode,
-  W as isWebWorker,
-  se as loadScript,
-  re as nextAnimationFrame,
-  ae as range,
-  ce as shuffle,
-  de as sum,
-  le as unique,
-  N as zip
+  X as TimedPromise,
+  O as TimeoutException,
+  K as TypeException,
+  de as VERSION,
+  m as ValueException,
+  le as average,
+  he as capitalize,
+  re as chain,
+  se as count,
+  G as dateDifference,
+  H as dateRange,
+  L as dateRound,
+  ee as delay,
+  ie as enumerate,
+  ce as hash,
+  S as isBrowser,
+  $ as isNode,
+  A as isWebWorker,
+  ne as loadScript,
+  te as nextAnimationFrame,
+  oe as range,
+  ue as shuffle,
+  fe as sum,
+  ae as unique,
+  I as zip
 };
 //# sourceMappingURL=core.js.map