esexts 2.1.0 → 2.2.0

package/dist/esexts.js

@@ -1,824 +1,811 @@
-function h(t, e) {
-  return Object.defineProperties(t, Object.fromEntries(Object.keys(e).map((n) => [n, { value: e[n], enumerable: !1, configurable: !0, writable: !0 }])));
+//#region lib/util.js
+function e(e, t) {
+	return Object.defineProperties(e, Object.fromEntries(Object.keys(t).map((e) => [e, {
+		value: t[e],
+		enumerable: !1,
+		configurable: !0,
+		writable: !0
+	}])));
 }
-function g() {
-  return {
-    new: function(...t) {
-      return new this(...t);
-    }
-  };
+function t() {
+	return { new: function(...e) {
+		return new this(...e);
+	} };
 }
-function m(...t) {
-  const e = {};
-  for (const n of t) {
-    const [r, i] = Array.isArray(n) ? n : [n, "$" + n];
-    e[i] = function() {
-      return this[r];
-    };
-  }
-  return e;
+function n(...e) {
+	let t = {};
+	for (let n of e) {
+		let [e, r] = Array.isArray(n) ? n : [n, "$" + n];
+		t[r] = function() {
+			return this[e];
+		};
+	}
+	return t;
 }
-function f(t, e, n, ...r) {
-  const i = {}, s = (o, u, c) => (u !== null && o.splice(u >= 0 ? u : o.length + u + 1, 0, c), o);
-  for (const o of r) {
-    const [u, c] = Array.isArray(o) ? o : [o, "$" + o + n.toString().replaceAll("-", "_")];
-    if (n === "")
-      i[c] = function(...a) {
-        return t[u].apply(this, s(a, e, this));
-      };
-    else if (n === "t")
-      i[c] = function(...a) {
-        return t[u].apply(this, s(a, e, this)), this;
-      };
-    else if (n === "a")
-      i[c] = function(...a) {
-        return t[u].apply(this, s(a, e, this)), a;
-      };
-    else if (n >= 0)
-      i[c] = function(...a) {
-        return t[u].apply(this, s(a, e, this)), a[n];
-      };
-    else if (n < 0)
-      i[c] = function(...a) {
-        return t[u].apply(this, s(a, e, this)), a[a.length + n];
-      };
-    else
-      throw Error("unreachable");
-  }
-  return i;
+function r(e, t, n, ...r) {
+	let i = {}, a = (e, t, n) => (t !== null && e.splice(t >= 0 ? t : e.length + t + 1, 0, n), e);
+	for (let o of r) {
+		let [r, s] = Array.isArray(o) ? o : [o, "$" + o + n.toString().replaceAll("-", "_")];
+		if (n === "") i[s] = function(...n) {
+			return e[r].apply(this, a(n, t, this));
+		};
+		else if (n === "t") i[s] = function(...n) {
+			return e[r].apply(this, a(n, t, this)), this;
+		};
+		else if (n === "a") i[s] = function(...n) {
+			return e[r].apply(this, a(n, t, this)), n;
+		};
+		else if (n >= 0) i[s] = function(...i) {
+			return e[r].apply(this, a(i, t, this)), i[n];
+		};
+		else if (n < 0) i[s] = function(...i) {
+			return e[r].apply(this, a(i, t, this)), i[i.length + n];
+		};
+		else throw Error("unreachable");
+	}
+	return i;
 }
-function $(t, ...e) {
-  const n = {};
-  for (const r of e) {
-    const [i, s] = Array.isArray(r) ? r : [r, "$" + r];
-    n[s] = function(...o) {
-      return [...t[i].apply(this, o)];
-    };
-  }
-  return n;
+function i(e, ...t) {
+	let n = {};
+	for (let r of t) {
+		let [t, i] = Array.isArray(r) ? r : [r, "$" + r];
+		n[i] = function(...n) {
+			return [...e[t].apply(this, n)];
+		};
+	}
+	return n;
 }
-function b(t = { array: !1 }) {
-  return function(e = {}, ...n) {
-    const r = (i, s) => {
-      const o = Object.prototype.toString.call(i), u = Object.prototype.toString.call(s);
-      if (o !== u)
-        return s;
-      if (o === "[object Array]")
-        return t.array ? i.concat(...s) : s;
-      if (o === "[object Object]") {
-        for (const c in s)
-          i[c] = r(i[c], s[c]);
-        return i;
-      } else
-        return s;
-    };
-    for (const i of n)
-      e = r(e, i);
-    return e;
-  };
+//#endregion
+//#region lib/Object.js
+function a(e = { array: !1 }) {
+	return function(t = {}, ...n) {
+		let r = (t, n) => {
+			let i = Object.prototype.toString.call(t);
+			if (i !== Object.prototype.toString.call(n)) return n;
+			if (i === "[object Array]") return e.array ? t.concat(...n) : n;
+			if (i === "[object Object]") {
+				for (let e in n) t[e] = r(t[e], n[e]);
+				return t;
+			} else return n;
+		};
+		for (let e of n) t = r(t, e);
+		return t;
+	};
 }
-const S = b({ array: !1 }), x = b({ array: !0 });
-h(Object, {
-  ...g(),
-  isObject: function(t) {
-    return Object.prototype.toString.call(t) === "[object Object]";
-  },
-  merge: function(...t) {
-    return S(this, ...t);
-  },
-  concat: function(...t) {
-    return x(this, ...t);
-  }
+var o = a({ array: !1 }), s = a({ array: !0 });
+e(Object, {
+	...t(),
+	isObject: function(e) {
+		return Object.prototype.toString.call(e) === "[object Object]";
+	},
+	merge: function(...e) {
+		return o(this, ...e);
+	},
+	concat: function(...e) {
+		return s(this, ...e);
+	}
+}), e(Object.prototype, {
+	$clone: function() {
+		return JSON.parse(JSON.stringify(this));
+	},
+	$length: function() {
+		return Object.keys(this).length;
+	},
+	...r(Object, 0, "", "entries", "keys", "values", "assign"),
+	...r(JSON, 0, "", "stringify"),
+	$merge: function(...e) {
+		return o(this, ...e);
+	},
+	$concat: function(...e) {
+		return s(this, ...e);
+	},
+	$empty: function() {
+		return Object.keys(this).length == 0;
+	},
+	$has: function(e) {
+		return e in this;
+	},
+	$pick: function(...e) {
+		let t = {};
+		for (let n of e) t[n] = this[n];
+		return t;
+	},
+	$omit: function(...e) {
+		let t = {}, n = new Set(e);
+		for (let e in this) n.has(e) || (t[e] = this[e]);
+		return t;
+	},
+	$attr: function(...e) {
+		if (typeof this != "object") return this;
+		let [t, n, { defval: r, exists: i, define: a, add: o, sub: s, mul: c, div: l }] = e;
+		return e.length == 1 ? this[t] : e.length == 2 ? (this[t] = n, this) : r === void 0 ? typeof i == "boolean" ? (t in this === i && (this[t] = n), this) : a === void 0 ? o === void 0 ? s === void 0 ? c === void 0 ? (l === void 0 || (this[t] = (t in this ? this[t] : r) / l), this) : (this[t] = (t in this ? this[t] : r) * c, this) : (this[t] = (t in this ? this[t] : r) - s, this) : (this[t] = (t in this ? this[t] : r) + o, this) : Object.defineProperty(this, t, {
+			value: n,
+			enumerable: !1,
+			configurable: !0,
+			writable: !0,
+			...a
+		}) : t in this ? this[t] : r;
+	},
+	$pipe: function(e, ...t) {
+		return e(this, ...t);
+	},
+	$tee: function(e, ...t) {
+		return e(this, ...t), this;
+	},
+	$toArray: function() {
+		return Array.isArray(this) ? this : [this];
+	},
+	...r(console, -1, "t", ["debug", "$debug"], ["log", "$log"], ["info", "$info"], ["warn", "$warn"], ["error", "$error"], ["dir", "$dir"]),
+	$debugger: function(...e) {
+		return console.debug(this, ...e), this;
+	},
+	$getParents: function(e = !1, t = -1, n = "parent") {
+		let r = e ? [this] : [], i = this[n];
+		for (; i && t-- != 0;) r.push(i), i = i[n];
+		return r;
+	},
+	$getChildrens: function(e = !1, t = -1, n = "children") {
+		let r = [], i = (e, t, a) => {
+			if (t && r.push(e), !(a == 0 || !e[n] || e[n].length == 0)) for (let t of e[n]) i(t, !0, a - 1);
+		};
+		return i(this, e, t), r;
+	},
+	$tree$find: function(e, t = !0, n = -1, r = "children") {
+		if (t && e(this)) return this;
+		if (n == 0 || !this[r] || this[r].length == 0) return null;
+		for (let t of this[r]) {
+			let i = t.$tree$find(e, !0, n - 1, r);
+			if (i !== null) return i;
+		}
+		return null;
+	},
+	$tree$each: function(e, t = !0, n = -1, r = "children") {
+		if (t && e(this), !(n == 0 || !this[r] || this[r].length == 0)) {
+			for (let t of this[r]) t.$tree$each(e, !0, n - 1, r);
+			return this;
+		}
+	},
+	$tree$map: function(e, t = !0, n = -1, r = "children", i = null) {
+		let a = t ? e(this) : this, o = [];
+		if (n == 0 || !this[r] || this[r].length == 0) return a;
+		for (let t of this[r]) o.push(t.$tree$map(e, !0, n - 1, r, i));
+		return a[r] = o, a;
+	}
+}), e(Number.prototype, {
+	...r(Math, 0, "", ["ceil", "ceil"], ["floor", "floor"], ["trunc", "trunc"], ["abs", "abs"], ["max", "max"], ["min", "min"]),
+	fixed: function(e = 0) {
+		return +this.toFixed(e);
+	},
+	round: function(e = 0) {
+		return Math.round(this * 10 ** e) / 10 ** e;
+	},
+	add: function(e, ...t) {
+		return typeof e == "function" ? e(this, ...t) : this + e;
+	},
+	sub: function(e, ...t) {
+		return typeof e == "function" ? e(this, ...t) : this - e;
+	},
+	mul: function(e, ...t) {
+		return typeof e == "function" ? e(this, ...t) : this * e;
+	},
+	div: function(e, ...t) {
+		return typeof e == "function" ? e(this, ...t) : this / e;
+	},
+	baseConvert: function(e = 64) {
+		let t = "", n = this;
+		for (; n > 0;) t = "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_-".at(n % e) + t, n = Math.floor(n / e);
+		return t || "0";
+	},
+	unit: function(e, t = 0) {
+		let n = this, r = "";
+		for (let [t, i] of Object.entries(e)) {
+			if (r = t, i === 0 || n < i) break;
+			n /= i;
+		}
+		return t < 0 ? +n.toFixed(0 - t) + r : n.toFixed(t) + r;
+	},
+	units: function(e, t = !1) {
+		let n = this, r = [];
+		for (let [t, i] of Object.entries(e)) if (i == 0 || n < i) {
+			r.push([n, t]);
+			break;
+		} else r.push([n % i, t]), n = Math.floor(n / i);
+		return t ? r : r.reverse().map(([e, t]) => e + t).join("");
+	},
+	toDate: function() {
+		return Date.new(this);
+	}
+}), e(BigInt.prototype, { toJSON: function() {
+	return this >= BigInt(-(2 ** 53 - 1)) && this <= BigInt(2 ** 53 - 1) ? Number(this) : this.toString();
+} }), e(String, { ...t() }), e(String.prototype, {
+	...n(["length", "length$"]),
+	$substring: function(e = 0, t = this.length) {
+		return e = e >= 0 ? e : this.length + e, t = t >= 0 ? t : this.length + t, this.substring(e, t);
+	},
+	$substr: function(e = 0, t = this.length) {
+		return e = e >= 0 ? e : this.length + e, t = e + t, this.substring(e, t);
+	},
+	$split: function(e = ",", t = -1) {
+		let n = this ? this.split(e) : [];
+		return t === -1 ? n : n.$push(n.splice(t - 1).join(e));
+	},
+	$split$number: function(e = ",") {
+		return this.$split(e).map((e) => +e);
+	},
+	$split$segment: function(e = 1) {
+		let t = [];
+		for (let n = 0; n < this.length; n += e) t.push(this.substring(n, n + e));
+		return t;
+	},
+	sprintf: function(...e) {
+		let [t, ...n] = this.split(/%[sd]/);
+		for (let r = 0; r < n.length; r++) t += e[r] + n[r];
+		return t;
+	},
+	subOf: function(e, t, n = 0, r = 0) {
+		for (let t = 0; t < n && r != -1; t++, r++) r = this.indexOf(e, r);
+		let i = this.indexOf(e, r), a = this.indexOf(t, i);
+		return i == -1 || a == -1 ? "" : (i += e.length, this.substring(i, a));
+	},
+	lastSubOf: function(e, t, n = 0, r = Infinity) {
+		for (let t = 0; t < n && r != -1; t++, r--) r = this.lastIndexOf(e, r);
+		let i = this.lastIndexOf(e, r), a = this.indexOf(t, i);
+		return i == -1 || a == -1 ? "" : (i += e.length, this.substring(i, a));
+	},
+	camel2under: function() {
+		return this.substr(0, 1) + this.substr(1).replace(/([A-Z])/g, (e, t) => "_" + t.toLowerCase());
+	},
+	under2camel: function() {
+		return this.replace(/_([a-z])/g, (e, t) => t.toUpperCase());
+	},
+	camel2pascal: function() {
+		return this.substr(0, 1).toUpperCase() + this.substr(1);
+	},
+	pascal2camel: function() {
+		return this.substr(0, 1).toLowerCase() + this.substr(1);
+	},
+	under2kebab: function() {
+		return this.replace(/_/g, "-");
+	},
+	kebab2under: function() {
+		return this.replace(/-/g, "_");
+	},
+	baseConvert: function(e = 64) {
+		let t = 0;
+		for (let n = 0; n < this.length; n++) t = t * e + "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_-".indexOf(this.at(n));
+		return t;
+	},
+	fixed: function(...e) {
+		return +(+this).toFixed(...e);
+	},
+	toDate: function() {
+		return Date.new(this);
+	},
+	toUint8Array: function() {
+		return new TextEncoder().encode(this);
+	},
+	hexencode: function() {
+		return new TextEncoder().encode(this).toHex();
+	},
+	hexdecode: function() {
+		return new TextDecoder().decode(Uint8Array.fromHex(this));
+	},
+	base64encode: function() {
+		return new TextEncoder().encode(this).toBase64();
+	},
+	base64decode: function() {
+		return new TextDecoder().decode(Uint8Array.fromBase64(this));
+	}
+}), e(Array, {
+	...t(),
+	range: function(...e) {
+		let t = [], n = 0, r = 0, i = 1, a = typeof e[e.length - 1] == "boolean" ? e.pop() : !0, o = typeof e[e.length - 1] == "function" ? e.pop() : (e, t, n) => e;
+		switch (e.length) {
+			case 1:
+				[r] = e;
+				break;
+			case 2:
+				[n, r] = e;
+				break;
+			case 3:
+				[n, r, i] = e;
+				break;
+			default: throw Error("the number of parameters is incorrect!");
+		}
+		if (i == 0) throw Error("step cannot be 0!");
+		for (let e = 0, s = 0, c = Math.abs(r - n), l = Math.abs(i), u = n <= r ? 1 : -1; s < c; s += l) t.push(a ? o(n + s * u, e++, t) : o());
+		return t;
+	}
+}), e(Array.prototype, {
+	...n("length"),
+	...i(Array.prototype, "entries", "keys", "values"),
+	...r(Array.prototype, null, "", "map"),
+	...r(Array.prototype, null, "t", ["push", "$push"], ["pop", "$pop"], ["shift", "$shift"], ["unshift", "$unshift"], ["splice", "$splice"]),
+	...r(Array.prototype, null, "a", "push", "unshift"),
+	...r(Array.prototype, null, 0, "push", "unshift"),
+	$empty: function() {
+		return this.length == 0;
+	},
+	first: function(e = null) {
+		return this.length ? this[0] : e;
+	},
+	last: function(e = null) {
+		return this.length ? this[this.length - 1] : e;
+	},
+	$find: function(e, t = null) {
+		return this.find(e) ?? t;
+	},
+	equals: function(e) {
+		return this.length === e.length && (this === e || this.length === 0 || this.every((t, n) => t === e[n]));
+	},
+	unique: function(e = (e) => e) {
+		let t = /* @__PURE__ */ new Set();
+		return this.filter((n) => t.has(e(n)) ? !1 : !!t.add(e(n)));
+	},
+	...r(Array.prototype, null, "t", ["forEach", "each"]),
+	each$async: async function(e) {
+		for (let t = 0; t < this.length; t++) await e(this[t], t, this);
+		return this;
+	},
+	map$async: async function(e) {
+		let t = [];
+		for (let n = 0; n < this.length; n++) t.push(await e(this[n], n, this));
+		return t;
+	},
+	shuffle: function(e = !1) {
+		let t = this.length;
+		for (; t;) {
+			let e = Math.random() * t-- | 0;
+			[this[e], this[t]] = [this[t], this[e]];
+		}
+		return this;
+	},
+	union: function(e) {
+		return Set.new(this).union(Set.new(e)).toArray();
+	},
+	intersection: function(e) {
+		return Set.new(this).intersection(Set.new(e)).toArray();
+	},
+	difference: function(e) {
+		return Set.new(this).difference(Set.new(e)).toArray();
+	},
+	symmetricDifference: function(e) {
+		return Set.new(this).symmetricDifference(Set.new(e)).toArray();
+	},
+	toMap: function(e = (e, t) => [t, e]) {
+		return new Map(this.map(e));
+	},
+	toSet: function(e = (e) => e) {
+		return new Set(this.map(e));
+	},
+	toUint8Array: function() {
+		return new Uint8Array(this);
+	},
+	toBase64: function() {
+		return this.toUint8Array().toBase64();
+	},
+	toHex: function() {
+		return this.toUint8Array().toHex();
+	},
+	decode: function() {
+		return this.toUint8Array().toString();
+	},
+	assoc: function(e, t, n = {}) {
+		let r = this.unique$((t) => t[e]), i = r.length == 0 ? {} : typeof n == "function" ? n(r) : n;
+		return this.each$((n) => n[t] = i[n[e]] ?? null);
+	},
+	toTree: function(t = {}) {
+		let { id: n = "id", pid: r = "pid", level: i = "level", root: a = "root", parent: o = "parent", children: s = "children", empty: c = null, hasRoot: l = !0 } = t, u = this.reduce((e, t) => e.$attr(t[n], t), {}), d = this.reduce((e, t) => (e.$attr(t[r], [], !1).$attr(t[r]).$push(t), e), {}), f = this.length && l ? this.find((e) => e[r] === 0) : {
+			[n]: 0,
+			[r]: -1,
+			[a]: null,
+			[o]: null,
+			[s]: d[0]
+		};
+		e(f, { [a]: f });
+		for (let t of this) e(t, {
+			[a]: f,
+			[o]: u[t[r]]
+		}), t[s] = d[t[n]] || c;
+		return f.$tree$each((e) => e[i] = e[o] ? e[o][i] + 1 : 0, -1, s), f;
+	},
+	$tree2tree: function(t = {}, n = null, r = null) {
+		let { id: i = "id", pid: a = "pid", level: o = "level", root: s = "root", parent: c = "parent", children: l = "children", empty: u = null } = t;
+		n ||= {
+			[i]: 0,
+			[a]: -1,
+			[o]: 0,
+			[s]: null,
+			[c]: null,
+			[l]: this
+		}, r ||= n;
+		for (let d of this) e(d, {
+			[s]: n,
+			[c]: r
+		}), d[a] = r[i], d[o] = r[o] + 1, d[l] = d[l] && d[l].length ? d[l] : u, d[l]?.$tree2tree(t, n, d);
+		return n;
+	},
+	$tree$find: function(e, t = !0, n = -1, r = "children") {
+		for (let i of this) {
+			let a = i.$tree$find(e, t, n, r);
+			if (a !== null) return a;
+		}
+		return null;
+	},
+	$tree$each: function(e, t = !0, n = -1, r = "children") {
+		for (let i of this) i.$tree$each(e, t, n, r);
+		return this;
+	},
+	$tree$map: function(e, t = !0, n = -1, r = "children", i = null) {
+		return this.map((a) => a.$tree$map(e, t, n, r, i));
+	}
+}), e(Map, { ...t() }), e(Map.prototype, {
+	...n(["size", "$length"]),
+	...i(Map.prototype, "entries", "keys", "values"),
+	...r(Map.prototype, null, "t", ["set", "$set"], ["delete", "$delete"]),
+	...r(Map.prototype, null, "a", "set", "delete"),
+	...r(Map.prototype, null, 0, "set", "delete"),
+	...r(Map.prototype, null, 1, "set", "delete"),
+	$getOrInsert: function(e, t = null) {
+		return this.has(e) ? this.get(e) : this.$set1(e, t);
+	},
+	$getOrInsertComputed: function(e, t) {
+		return this.has(e) ? this.get(e) : this.$set1(e, t(e));
+	},
+	$get: function(e, t = null) {
+		return this.has(e) ? this.get(e) : this.$set1(e, typeof t == "function" ? t(e) : t);
+	},
+	$get$async: async function(e, t = null) {
+		return this.has(e) ? this.get(e) : this.$set1(e, typeof t == "function" ? await t(e) : t);
+	},
+	toObject: function() {
+		return Object.fromEntries(this);
+	},
+	toArray: function() {
+		return [...this];
+	},
+	toJSON: function() {
+		return [...this];
+	}
+}), Map.prototype.getOrInsert === void 0 && (Map.prototype.getOrInsert = Map.prototype.$getOrInsert, Map.prototype.getOrInsertComputed = Map.prototype.$getOrInsertComputed), e(Set, { ...t() }), e(Set.prototype, {
+	...n(["size", "$length"]),
+	...i(Set.prototype, "entries", "keys", "values"),
+	...r(Set.prototype, null, "t", ["add", "$add"], ["delete", "$delete"]),
+	...r(Set.prototype, null, "a", "add", "delete"),
+	...r(Set.prototype, null, 0, "add", "delete"),
+	$union: function(e) {
+		return new Set([...this, ...e]);
+	},
+	$intersection: function(e) {
+		return new Set([...this].filter((t) => e.has(t)));
+	},
+	$difference: function(e) {
+		return new Set([...this].filter((t) => !e.has(t)));
+	},
+	$symmetricDifference: function(e) {
+		return new Set([...[...this].filter((t) => !e.has(t)), ...[...e].filter((e) => !this.has(e))]);
+	},
+	toArray: function() {
+		return [...this];
+	},
+	toJSON: function() {
+		return [...this];
+	}
+}), Set.prototype.union === void 0 && (Set.prototype.union = Set.prototype.$union, Set.prototype.intersection = Set.prototype.$intersection, Set.prototype.difference = Set.prototype.$difference, Set.prototype.symmetricDifference = Set.prototype.$symmetricDifference), e(Date, {
+	new: function(...e) {
+		return e.length == 1 ? Number.isNaN(+e[0]) ? new Date(e[0].includes("T") ? e[0] : e[0].replace(/-/g, "/")) : new Date(e[0] > 25e8 ? e[0] : e[0] * 1e3) : new Date(...e);
+	},
+	format: function(e = "y-m-d h:i:s") {
+		return (/* @__PURE__ */ new Date()).format(e);
+	},
+	unix: function() {
+		return this.now() / 1e3 | 0;
+	},
+	fromUnix: function(e) {
+		return /* @__PURE__ */ new Date((e ?? 0) * 1e3);
+	},
+	expr: function(e = {}) {
+		return (/* @__PURE__ */ new Date()).expr(e);
+	},
+	toDayRange: function() {
+		let e = /* @__PURE__ */ new Date(), t = e.getFullYear(), n = e.getMonth(), r = e.getDate(), i = new Date(t, n, r).getTime() / 1e3 | 0;
+		return [i, i + 86400 - 1];
+	},
+	toWeekRange: function() {
+		let e = /* @__PURE__ */ new Date();
+		for (; e.getDay() != 1;) e = /* @__PURE__ */ new Date(e.getTime() - 86400);
+		let t = e.getFullYear(), n = e.getMonth(), r = e.getDate(), i = new Date(t, n, r).getTime() / 1e3 | 0;
+		return [i, i + 86400 * 7 - 1];
+	},
+	toMonthRange: function() {
+		let e = /* @__PURE__ */ new Date(), t = e.getFullYear(), n = e.getMonth();
+		return [new Date(t, n, 1).getTime() / 1e3 | 0, new Date(t, n + 1, 0, 23, 59, 59).getTime() / 1e3 | 0];
+	},
+	toYearRange: function() {
+		let e = (/* @__PURE__ */ new Date()).getFullYear();
+		return [new Date(e, 1, 1).getTime() / 1e3 | 0, new Date(e + 1, 1, 0, 23, 59, 59).getTime() / 1e3 | 0];
+	}
+}), e(Date.prototype, {
+	format: function(e = "y-m-d h:i:s") {
+		if (this.getTime() === 0) return "-";
+		let t = {
+			y: this.getFullYear(),
+			m: this.getMonth() + 1,
+			d: this.getDate(),
+			h: this.getHours(),
+			i: this.getMinutes(),
+			s: this.getSeconds(),
+			l: this.getMilliseconds(),
+			e: this.getMonthDay()
+		};
+		return e.replace(/([ymdhisle])/gi, (e, n) => n >= "A" && n <= "Z" ? t[n.toLowerCase()] : t[n].toString().padStart(n === "l" ? 3 : 2, "0"));
+	},
+	unix: function() {
+		return this.getTime() / 1e3 | 0;
+	},
+	isLeapYear: function() {
+		return this.getFullYear() % 4 == 0 && this.getFullYear() % 400 != 0;
+	},
+	getMonthDay: function() {
+		return [
+			31,
+			0,
+			31,
+			30,
+			31,
+			30,
+			31,
+			31,
+			30,
+			31,
+			30,
+			31
+		][this.getMonth()] || (this.isLeapYear() ? 29 : 28);
+	},
+	expr: function({ y: e = 0, m: t = 0, d: n = 0, h: r = 0, i = 0, s: a = 0 }) {
+		let o = new Date(this.getFullYear() + e, this.getMonth() + t + 1, 0);
+		return new Date(this.getFullYear() + e, this.getMonth() + t, Math.min(o.getDate(), this.getDate()) + n, this.getHours() + r, this.getMinutes() + i, this.getSeconds() + a);
+	},
+	begin: function(e = 3) {
+		return new Date(...[
+			this.getFullYear(),
+			this.getMonth(),
+			this.getDate(),
+			this.getHours(),
+			this.getMinutes(),
+			this.getSeconds()
+		].slice(0, e), ...[
+			this.getFullYear(),
+			0,
+			1,
+			0,
+			0,
+			0
+		].slice(e));
+	},
+	end: function(e = 3) {
+		return new Date(...[
+			this.getFullYear(),
+			this.getMonth(),
+			this.getDate(),
+			this.getHours(),
+			this.getMinutes(),
+			this.getSeconds()
+		].slice(0, e), ...[
+			this.getFullYear(),
+			11,
+			e < 2 ? 31 : this.getMonthDay(),
+			23,
+			59,
+			59
+		].slice(e));
+	},
+	week: function(e, t = 1) {
+		let n = new Date(this.getTime());
+		for (; n.getDay() !== e;) n = new Date(n.getTime() + 864e5 * t);
+		return n;
+	},
+	toJSON: function() {
+		return this.getTime();
+	}
+}), e(RegExp, { ...t() }), e(RegExp.prototype, { toJSON: function() {
+	return this.toString();
+} }), e(Promise, {
+	...t(),
+	$channel: function() {
+		let e = null, t = null;
+		return [
+			new this((n, r) => {
+				e = n, t = r;
+			}),
+			e,
+			t
+		];
+	},
+	$withResolvers: function() {
+		let e = null, t = null;
+		return {
+			promise: new this((n, r) => {
+				e = n, t = r;
+			}),
+			resolve: e,
+			reject: t
+		};
+	}
+}), e(Promise.prototype, { tryCatch: function() {
+	return new Promise((e) => this.then((t) => e([t, null])).catch((t) => e([null, t])));
+} }), Promise.withResolvers === void 0 && (Promise.withResolvers = Promise.$withResolvers), e(JSON, { $parse: function(e, t = null) {
+	try {
+		if (typeof e != "string") throw Error("not string");
+		return JSON.parse(e);
+	} catch {
+		return t;
+	}
+} }), typeof Iterator < "u" && e(Iterator.prototype, { toArray: function() {
+	return [...this];
+} }), e(ArrayBuffer.prototype, { toUint8Array: function() {
+	return new Uint8Array(this);
+} }), e(Uint8Array, {
+	...t(),
+	fromString: function(e) {
+		return new TextEncoder().encode(e);
+	},
+	$fromHex: function(e) {
+		let t = [];
+		for (let n = 0; n < e.length; n += 2) t.push(Number.parseInt(e.substring(n, n + 2), 16));
+		return new Uint8Array(t);
+	},
+	$fromBase64: function(e) {
+		let t = [], n = {};
+		for (let e = 0; e < 64; e++) n["ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/".charAt(e)] = e;
+		let r = e.charAt(e.length - 1) == "=" ? e.charAt(e.length - 2) == "=" ? e.length - 2 : e.length - 1 : e.length;
+		for (let i = 3; i < r; i += 4) {
+			let r = (n[e.charAt(i - 3)] << 18) + (n[e.charAt(i - 2)] << 12) + (n[e.charAt(i - 1)] << 6) + n[e.charAt(i)];
+			t.push((r & 16711680) >> 16, (r & 65280) >> 8, r & 255);
+		}
+		if (r % 4 == 3) {
+			let i = (n[e.charAt(r - 3)] << 18) + (n[e.charAt(r - 2)] << 12) + (n[e.charAt(r - 1)] << 6);
+			t.push((i & 16711680) >> 16, (i & 65280) >> 8);
+		} else if (r % 4 == 2) {
+			let i = (n[e.charAt(r - 2)] << 18) + (n[e.charAt(r - 1)] << 12);
+			t.push((i & 16711680) >> 16);
+		}
+		return new Uint8Array(t);
+	}
+}), e(Uint8Array.prototype, {
+	setFromString(e, t = 0) {
+		let n = Uint8Array.fromString(e);
+		return this.set(n, t), {
+			read: n.length,
+			written: n.length
+		};
+	},
+	$setFromHex(e, t = 0) {
+		let n = Uint8Array.fromHex(e);
+		return this.set(n, t), {
+			read: n.length,
+			written: n.length
+		};
+	},
+	$setFromBase64(e, t = 0) {
+		let n = Uint8Array.fromBase64(e);
+		return this.set(n, t), {
+			read: n.length,
+			written: n.length
+		};
+	},
+	toString: function() {
+		return new TextDecoder().decode(this);
+	},
+	$toHex: function() {
+		let e = "";
+		for (let t = 0; t < this.length; t++) e += (this[t] < 16 ? "0" : "") + this[t].toString(16);
+		return e;
+	},
+	$toBase64: function() {
+		let e = "", t = {}, n = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
+		for (let e = 0; e < 64; e++) t[n.charAt(e)] = e;
+		for (let t = 2; t < this.length; t += 3) {
+			let r = (this[t - 2] << 16) + (this[t - 1] << 8) + this[t];
+			e += n.charAt((r & 16515072) >> 18) + n.charAt((r & 258048) >> 12) + n.charAt((r & 4032) >> 6) + n.charAt(r & 63);
+		}
+		if (this.length % 3 == 2) {
+			let t = (this[this.length - 2] << 16) + (this[this.length - 1] << 8);
+			e += n.charAt((t & 16515072) >> 18) + n.charAt((t & 258048) >> 12) + n.charAt((t & 4032) >> 6) + "=";
+		} else if (this.length % 3 == 1) {
+			let t = this[this.length - 1] << 16;
+			e += n.charAt((t & 16515072) >> 18) + n.charAt((t & 258048) >> 12) + "==";
+		}
+		return e;
+	},
+	toArray: function() {
+		return new Array(...this);
+	}
+}), Uint8Array.fromBase64 === void 0 && (Uint8Array.fromHex = Uint8Array.$fromHex, Uint8Array.fromBase64 = Uint8Array.$fromBase64), Uint8Array.prototype.setFromHex === void 0 && (Uint8Array.prototype.setFromHex = Uint8Array.prototype.$setFromHex, Uint8Array.prototype.setFromBase64 = Uint8Array.prototype.$setFromBase64, Uint8Array.prototype.toHex = Uint8Array.prototype.$toHex, Uint8Array.prototype.toBase64 = Uint8Array.prototype.$toBase64);
+//#endregion
+//#region lib/Math.js
+var c = 0, l = 0, u = 0;
+e(Math, {
+	randstr: function(e = 16, t = 0, n = "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ", r = "~!@#$%^&*()_+`{}|[]\\:\";'<>,.?/") {
+		if (e < t) throw Error("randstr: len < slen");
+		let i = [];
+		for (let t = 0; t < e; t++) i.push(n.charAt(Math.random() * n.length | 0));
+		for (let n = /* @__PURE__ */ new Set(), a = 0, o = 0; o < t; o++) {
+			do
+				a = Math.random() * e | 0;
+			while (n.has(a));
+			n.set(a, !0), i[a] = r.charAt(Math.random() * r.length | 0);
+		}
+		return i.join("");
+	},
+	randint: function(e = 0, t = 2 ** 53 - 1) {
+		return Math.floor(Math.random() * (t - e) + e);
+	},
+	incrid: function() {
+		return ++c;
+	},
+	incrstr: function() {
+		return "" + Math.incrid();
+	},
+	uniqid: function(e = Date.now()) {
+		return e === u ? e * 2048 + ++l % 2048 : (u = e) * 2048 + (l = 0) % 2048;
+	},
+	uniqstr: function() {
+		return "" + Math.uniqid();
+	},
+	sleep: function(e) {
+		return new Promise((t) => setTimeout(t, e));
+	},
+	useTemplate: function(e) {
+		let t = null, n = {
+			setup(e, { slots: n }) {
+				return t = n.default, () => {};
+			},
+			name: e + "Template"
+		}, r = {
+			setup(e, { attrs: n }) {
+				return () => t?.(n);
+			},
+			name: e
+		};
+		return {
+			[n.name]: n,
+			[r.name]: r
+		};
+	}
 });
-h(Object.prototype, {
-  $clone: function() {
-    return JSON.parse(JSON.stringify(this));
-  },
-  $length: function() {
-    return Object.keys(this).length;
-  },
-  ...f(Object, 0, "", "entries", "keys", "values", "assign"),
-  ...f(JSON, 0, "", "stringify"),
-  $merge: function(...t) {
-    return S(this, ...t);
-  },
-  $concat: function(...t) {
-    return x(this, ...t);
-  },
-  $empty: function() {
-    return Object.keys(this).length == 0;
-  },
-  $has: function(t) {
-    return t in this;
-  },
-  $pick: function(...t) {
-    const e = {};
-    for (const n of t)
-      e[n] = this[n];
-    return e;
-  },
-  $omit: function(...t) {
-    const e = {}, n = new Set(t);
-    for (const r in this)
-      n.has(r) || (e[r] = this[r]);
-    return e;
-  },
-  $attr: function(...t) {
-    if (typeof this != "object")
-      return this;
-    const [e, n, r, i] = t;
-    return t.length == 1 ? this[e] : t.length == 2 ? (this[e] = n, this) : typeof r == "boolean" ? (e in this === r && (this[e] = n), this) : r == "define" || r === null ? Object.defineProperty(this, e, { value: n, enumerable: !1, configurable: !0, writable: !0, ...i }) : r === "+" ? (this[e] = (this[e] ?? i ?? 0) + n, this) : r === "-" ? (this[e] = (this[e] ?? i ?? 0) - n, this) : r === "*" ? (this[e] = (this[e] ?? i ?? 0) * n, this) : r === "/" ? (this[e] = (this[e] ?? i ?? 0) / n, this) : this;
-  },
-  $pipe: function(t, ...e) {
-    return t(this, ...e);
-  },
-  $tee: function(t, ...e) {
-    return t(this, ...e), this;
-  },
-  $toArray: function() {
-    return Array.isArray(this) ? this : [this];
-  },
-  ...f(console, -1, "t", ["debug", "$debug"], ["log", "$log"], ["info", "$info"], ["warn", "$warn"], ["error", "$error"], ["dir", "$dir"]),
-  $debugger: function(...t) {
-    console.debug(this, ...t);
-    debugger;
-    return this;
-  },
-  // ====== Tree ======
-  $getParents: function(t = !1, e = -1, n = "parent") {
-    const r = t ? [this] : [];
-    let i = this[n];
-    for (; i && e-- != 0; )
-      r.push(i), i = i[n];
-    return r;
-  },
-  $getChildrens: function(t = !1, e = -1, n = "children") {
-    const r = [], i = (s, o, u) => {
-      if (o && r.push(s), !(u == 0 || !s[n] || s[n].length == 0))
-        for (const c of s[n])
-          i(c, !0, u - 1);
-    };
-    return i(this, t, e), r;
-  },
-  $tree$find: function(t, e = !0, n = -1, r = "children") {
-    if (e && t(this))
-      return this;
-    if (n == 0 || !this[r] || this[r].length == 0)
-      return null;
-    for (const i of this[r]) {
-      const s = i.$tree$find(t, !0, n - 1, r);
-      if (s !== null)
-        return s;
-    }
-    return null;
-  },
-  $tree$each: function(t, e = !0, n = -1, r = "children") {
-    if (e && t(this), !(n == 0 || !this[r] || this[r].length == 0)) {
-      for (const i of this[r])
-        i.$tree$each(t, !0, n - 1, r);
-      return this;
-    }
-  },
-  $tree$map: function(t, e = !0, n = -1, r = "children", i = null) {
-    const s = e ? t(this) : this, o = [];
-    if (n == 0 || !this[r] || this[r].length == 0)
-      return s;
-    for (const u of this[r])
-      o.push(u.$tree$map(t, !0, n - 1, r, i));
-    return s[r] = o, s;
-  }
-});
-h(Number.prototype, {
-  ...f(Math, 0, "", ["ceil", "ceil"], ["floor", "floor"], ["trunc", "trunc"], ["abs", "abs"], ["max", "max"], ["min", "min"]),
-  fixed: function(t = 0) {
-    return +this.toFixed(t);
-  },
-  round: function(t = 0) {
-    return Math.round(this * 10 ** t) / 10 ** t;
-  },
-  add: function(t, ...e) {
-    return typeof t == "function" ? t(this, ...e) : this + t;
-  },
-  sub: function(t, ...e) {
-    return typeof t == "function" ? t(this, ...e) : this - t;
-  },
-  mul: function(t, ...e) {
-    return typeof t == "function" ? t(this, ...e) : this * t;
-  },
-  div: function(t, ...e) {
-    return typeof t == "function" ? t(this, ...e) : this / t;
-  },
-  baseConvert: function(t = 64) {
-    let e = "", n = this, r = "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_-";
-    for (; n > 0; )
-      e = r.at(n % t) + e, n = Math.floor(n / t);
-    return e || "0";
-  },
-  unit: function(t, e = 0) {
-    let n = this, r = "";
-    for (const [i, s] of Object.entries(t)) {
-      if (r = i, s === 0 || n < s)
-        break;
-      n = n / s;
-    }
-    return e < 0 ? +n.toFixed(0 - e) + r : n.toFixed(e) + r;
-  },
-  units: function(t, e = !1) {
-    let n = this, r = [];
-    for ([unit, size] of Object.entries(t))
-      if (size == 0 || n < size) {
-        r.push([n, unit]);
-        break;
-      } else
-        r.push([n % size, unit]), n = Math.floor(n / size);
-    return e ? r : r.reverse().map(([i, s]) => i + s).join("");
-  },
-  toDate: function() {
-    return Date.new(this);
-  }
-});
-h(BigInt.prototype, {
-  toJSON: function() {
-    return this >= BigInt(Number.MIN_SAFE_INTEGER) && this <= BigInt(Number.MAX_SAFE_INTEGER) ? Number(this) : this.toString();
-  }
-});
-h(String, {
-  ...g()
-});
-h(String.prototype, {
-  ...m(["length", "length$"]),
-  $substring: function(t = 0, e = this.length) {
-    return t = t >= 0 ? t : this.length + t, e = e >= 0 ? e : this.length + e, this.substring(t, e);
-  },
-  $substr: function(t = 0, e = this.length) {
-    return t = t >= 0 ? t : this.length + t, e = t + e, this.substring(t, e);
-  },
-  $split: function(t = ",", e = -1) {
-    const n = this ? this.split(t) : [];
-    return e === -1 ? n : n.$push(n.splice(e - 1).join(t));
-  },
-  $split$number: function(t = ",") {
-    return this.$split(t).map((e) => +e);
-  },
-  $split$segment: function(t = 1) {
-    const e = [];
-    for (let n = 0; n < this.length; n += t)
-      e.push(this.substring(n, n + t));
-    return e;
-  },
-  sprintf: function(...t) {
-    let [e, ...n] = this.split(/%[sd]/);
-    for (let r = 0; r < n.length; r++)
-      e += t[r] + n[r];
-    return e;
-  },
-  subOf: function(t, e, n = 0, r = 0) {
-    for (let o = 0; o < n && r != -1; o++, r++)
-      r = this.indexOf(t, r);
-    let i = this.indexOf(t, r), s = this.indexOf(e, i);
-    return i == -1 || s == -1 ? "" : (i += t.length, this.substring(i, s));
-  },
-  lastSubOf: function(t, e, n = 0, r = 1 / 0) {
-    for (let o = 0; o < n && r != -1; o++, r--)
-      r = this.lastIndexOf(t, r);
-    let i = this.lastIndexOf(t, r), s = this.indexOf(e, i);
-    return i == -1 || s == -1 ? "" : (i += t.length, this.substring(i, s));
-  },
-  camel2under: function() {
-    return this.substr(0, 1) + this.substr(1).replace(/([A-Z])/g, (t, e) => "_" + e.toLowerCase());
-  },
-  under2camel: function() {
-    return this.replace(/_([a-z])/g, (t, e) => e.toUpperCase());
-  },
-  camel2pascal: function() {
-    return this.substr(0, 1).toUpperCase() + this.substr(1);
-  },
-  pascal2camel: function() {
-    return this.substr(0, 1).toLowerCase() + this.substr(1);
-  },
-  under2kebab: function() {
-    return this.replace(/_/g, "-");
-  },
-  kebab2under: function() {
-    return this.replace(/-/g, "_");
-  },
-  baseConvert: function(t = 64) {
-    let e = 0, n = "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ_-";
-    for (let r = 0; r < this.length; r++)
-      e = e * t + n.indexOf(this.at(r));
-    return e;
-  },
-  fixed: function(...t) {
-    return +(+this).toFixed(...t);
-  },
-  toDate: function() {
-    return Date.new(this);
-  },
-  // ====== Uint8Array ======
-  toUint8Array: function() {
-    return new TextEncoder().encode(this);
-  },
-  // ====== hex ======
-  hexencode: function() {
-    return new TextEncoder().encode(this).toHex();
-  },
-  hexdecode: function() {
-    return new TextDecoder().decode(Uint8Array.fromHex(this));
-  },
-  // ====== base64 ======
-  base64encode: function() {
-    return new TextEncoder().encode(this).toBase64();
-  },
-  base64decode: function() {
-    return new TextDecoder().decode(Uint8Array.fromBase64(this));
-  }
-});
-h(Array, {
-  ...g(),
-  // ====== from pinojs ======
-  range: function(...t) {
-    let e = [], n = 0, r = 0, i = 1, s = typeof t[t.length - 1] == "boolean" ? t.pop() : !0, o = typeof t[t.length - 1] == "function" ? t.pop() : (u, c, a) => u;
-    switch (t.length) {
-      case 1:
-        [r] = t;
-        break;
-      case 2:
-        [n, r] = t;
-        break;
-      case 3:
-        [n, r, i] = t;
-        break;
-      default:
-        throw new Error("the number of parameters is incorrect!");
-    }
-    if (i == 0)
-      throw new Error("step cannot be 0!");
-    for (let u = 0, c = 0, a = Math.abs(r - n), p = Math.abs(i), d = n <= r ? 1 : -1; c < a; c += p)
-      e.push(s ? o(n + c * d, u++, e) : o());
-    return e;
-  }
-});
-h(Array.prototype, {
-  ...m("length"),
-  ...$(Array.prototype, "entries", "keys", "values"),
-  ...f(Array.prototype, null, "", "map"),
-  ...f(Array.prototype, null, "t", ["push", "$push"], ["pop", "$pop"], ["shift", "$shift"], ["unshift", "$unshift"], ["splice", "$splice"]),
-  ...f(Array.prototype, null, "a", "push", "unshift"),
-  ...f(Array.prototype, null, 0, "push", "unshift"),
-  $empty: function() {
-    return this.length == 0;
-  },
-  first: function(t = null) {
-    return this.length ? this[0] : t;
-  },
-  last: function(t = null) {
-    return this.length ? this[this.length - 1] : t;
-  },
-  $find: function(t, e = null) {
-    return this.find(t) ?? e;
-  },
-  equals: function(t) {
-    return this.length === t.length && (this === t || this.length === 0 || this.every((e, n) => e === t[n]));
-  },
-  unique: function(t = (e) => e) {
-    const e = /* @__PURE__ */ new Set();
-    return this.filter((n) => e.has(t(n)) ? !1 : !!e.add(t(n)));
-  },
-  ...f(Array.prototype, null, "t", ["forEach", "each"]),
-  each$async: async function(t) {
-    for (let e = 0; e < this.length; e++)
-      await t(this[e], e, this);
-    return this;
-  },
-  map$async: async function(t) {
-    const e = [];
-    for (let n = 0; n < this.length; n++)
-      e.push(await t(this[n], n, this));
-    return e;
-  },
-  shuffle: function(t = !1) {
-    let e = this.length;
-    for (; e; ) {
-      const n = Math.random() * e-- | 0;
-      [this[n], this[e]] = [this[e], this[n]];
-    }
-    return this;
-  },
-  // ====== collection ======
-  union: function(t) {
-    return Set.new(this).union(Set.new(t)).toArray();
-  },
-  intersection: function(t) {
-    return Set.new(this).intersection(Set.new(t)).toArray();
-  },
-  difference: function(t) {
-    return Set.new(this).difference(Set.new(t)).toArray();
-  },
-  symmetricDifference: function(t) {
-    return Set.new(this).symmetricDifference(Set.new(t)).toArray();
-  },
-  // ====== convert ======
-  toMap: function(t = (e, n) => [n, e]) {
-    return new Map(this.map(t));
-  },
-  toSet: function(t = (e) => e) {
-    return new Set(this.map(t));
-  },
-  // ====== Uint8Array ======
-  toUint8Array: function() {
-    return new Uint8Array(this);
-  },
-  toBase64: function() {
-    return this.toUint8Array().toBase64();
-  },
-  toHex: function() {
-    return this.toUint8Array().toHex();
-  },
-  // ====== TextDecoder ======
-  decode: function() {
-    return this.toUint8Array().toString();
-  },
-  // ====== Relational ======
-  assoc: function(t, e, n = {}) {
-    const r = this.unique$((s) => s[t]), i = r.length == 0 ? {} : typeof n == "function" ? n(r) : n;
-    return this.each$((s) => s[e] = i[s[t]] ?? null);
-  },
-  // ====== Tree ======
-  toTree: function(t = {}) {
-    const { id: e = "id", pid: n = "pid", level: r = "level", root: i = "root", parent: s = "parent", children: o = "children", empty: u = null, hasRoot: c = !0 } = t, a = this.reduce((l, y) => l.$attr(y[e], y), {}), p = this.reduce((l, y) => (l.$attr(y[n], [], !1).$attr(y[n]).$push(y), l), {}), d = this.length && c ? this.find((l) => l[n] === 0) : { [e]: 0, [n]: -1, [i]: null, [s]: null, [o]: p[0] };
-    h(d, { [i]: d });
-    for (const l of this)
-      h(l, { [i]: d, [s]: a[l[n]] }), l[o] = p[l[e]] || u;
-    return d.$tree$each((l) => l[r] = l[s] ? l[s][r] + 1 : 0, -1, o), d;
-  },
-  $tree2tree: function(t = {}, e = null, n = null) {
-    const { id: r = "id", pid: i = "pid", level: s = "level", root: o = "root", parent: u = "parent", children: c = "children", empty: a = null } = t;
-    e = e || { [r]: 0, [i]: -1, [s]: 0, [o]: null, [u]: null, [c]: this }, n = n || e;
-    for (const p of this)
-      h(p, { [o]: e, [u]: n }), p[i] = n[r], p[s] = n[s] + 1, p[c] = p[c] && p[c].length ? p[c] : a, p[c]?.$tree2tree(t, e, p);
-    return e;
-  },
-  $tree$find: function(t, e = !0, n = -1, r = "children") {
-    for (const i of this) {
-      const s = i.$tree$find(t, e, n, r);
-      if (s !== null)
-        return s;
-    }
-    return null;
-  },
-  $tree$each: function(t, e = !0, n = -1, r = "children") {
-    for (const i of this)
-      i.$tree$each(t, e, n, r);
-    return this;
-  },
-  $tree$map: function(t, e = !0, n = -1, r = "children", i = null) {
-    return this.map((s) => s.$tree$map(t, e, n, r, i));
-  }
-});
-h(Map, {
-  ...g()
-});
-h(Map.prototype, {
-  ...m(["size", "$length"]),
-  ...$(Map.prototype, "entries", "keys", "values"),
-  ...f(Map.prototype, null, "t", ["set", "$set"], ["delete", "$delete"]),
-  ...f(Map.prototype, null, "a", "set", "delete"),
-  ...f(Map.prototype, null, 0, "set", "delete"),
-  ...f(Map.prototype, null, 1, "set", "delete"),
-  $getOrInsert: function(t, e = null) {
-    return this.has(t) ? this.get(t) : this.$set1(t, e);
-  },
-  $getOrInsertComputed: function(t, e) {
-    return this.has(t) ? this.get(t) : this.$set1(t, e(t));
-  },
-  $get: function(t, e = null) {
-    return this.has(t) ? this.get(t) : this.$set1(t, typeof e == "function" ? e(t) : e);
-  },
-  $get$async: async function(t, e = null) {
-    return this.has(t) ? this.get(t) : this.$set1(t, typeof e == "function" ? await e(t) : e);
-  },
-  toObject: function() {
-    return Object.fromEntries(this);
-  },
-  toArray: function() {
-    return [...this];
-  },
-  toJSON: function() {
-    return [...this];
-  }
-});
-typeof Map.prototype.getOrInsert > "u" && (Map.prototype.getOrInsert = Map.prototype.$getOrInsert, Map.prototype.getOrInsertComputed = Map.prototype.$getOrInsertComputed);
-h(Set, {
-  ...g()
-});
-h(Set.prototype, {
-  ...m(["size", "$length"]),
-  ...$(Set.prototype, "entries", "keys", "values"),
-  ...f(Set.prototype, null, "t", ["add", "$add"], ["delete", "$delete"]),
-  ...f(Set.prototype, null, "a", "add", "delete"),
-  ...f(Set.prototype, null, 0, "add", "delete"),
-  $union: function(t) {
-    return /* @__PURE__ */ new Set([...this, ...t]);
-  },
-  $intersection: function(t) {
-    return new Set([...this].filter((e) => t.has(e)));
-  },
-  $difference: function(t) {
-    return new Set([...this].filter((e) => !t.has(e)));
-  },
-  $symmetricDifference: function(t) {
-    return /* @__PURE__ */ new Set([...[...this].filter((e) => !t.has(e)), ...[...t].filter((e) => !this.has(e))]);
-  },
-  toArray: function() {
-    return [...this];
-  },
-  toJSON: function() {
-    return [...this];
-  }
-});
-typeof Set.prototype.union > "u" && (Set.prototype.union = Set.prototype.$union, Set.prototype.intersection = Set.prototype.$intersection, Set.prototype.difference = Set.prototype.$difference, Set.prototype.symmetricDifference = Set.prototype.$symmetricDifference);
-h(Date, {
-  new: function(...t) {
-    return t.length != 1 ? new Date(...t) : Number.isNaN(+t[0]) ? new Date(t[0].includes("T") ? t[0] : t[0].replace(/-/g, "/")) : new Date(t[0] > 25e8 ? t[0] : t[0] * 1e3);
-  },
-  format: function(t = "y-m-d h:i:s") {
-    return (/* @__PURE__ */ new Date()).format(t);
-  },
-  unix: function() {
-    return this.now() / 1e3 | 0;
-  },
-  fromUnix: function(t) {
-    return new Date((t ?? 0) * 1e3);
-  },
-  expr: function(t = {}) {
-    return (/* @__PURE__ */ new Date()).expr(t);
-  },
-  toDayRange: function() {
-    const t = /* @__PURE__ */ new Date(), e = t.getFullYear(), n = t.getMonth(), r = t.getDate(), i = new Date(e, n, r).getTime() / 1e3 | 0;
-    return [i, i + 86400 - 1];
-  },
-  toWeekRange: function() {
-    let t = /* @__PURE__ */ new Date();
-    for (; t.getDay() != 1; )
-      t = new Date(t.getTime() - 86400);
-    const e = t.getFullYear(), n = t.getMonth(), r = t.getDate(), i = new Date(e, n, r).getTime() / 1e3 | 0;
-    return [i, i + 86400 * 7 - 1];
-  },
-  toMonthRange: function() {
-    const t = /* @__PURE__ */ new Date(), e = t.getFullYear(), n = t.getMonth(), r = new Date(e, n, 1).getTime() / 1e3 | 0, i = new Date(e, n + 1, 0, 23, 59, 59).getTime() / 1e3 | 0;
-    return [r, i];
-  },
-  toYearRange: function() {
-    const e = (/* @__PURE__ */ new Date()).getFullYear(), n = new Date(e, 1, 1).getTime() / 1e3 | 0, r = new Date(e + 1, 1, 0, 23, 59, 59).getTime() / 1e3 | 0;
-    return [n, r];
-  }
-});
-h(Date.prototype, {
-  format: function(t = "y-m-d h:i:s") {
-    if (this.getTime() === 0)
-      return "-";
-    const e = {
-      y: this.getFullYear(),
-      m: this.getMonth() + 1,
-      d: this.getDate(),
-      h: this.getHours(),
-      i: this.getMinutes(),
-      s: this.getSeconds(),
-      l: this.getMilliseconds(),
-      e: this.getMonthDay()
-    };
-    return t.replace(/([ymdhisle])/ig, (n, r) => r >= "A" && r <= "Z" ? e[r.toLowerCase()] : e[r].toString().padStart(r === "l" ? 3 : 2, "0"));
-  },
-  unix: function() {
-    return this.getTime() / 1e3 | 0;
-  },
-  isLeapYear: function() {
-    return this.getFullYear() % 4 === 0 && this.getFullYear() % 400 !== 0;
-  },
-  getMonthDay: function() {
-    return [31, 0, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31][this.getMonth()] || (this.isLeapYear() ? 29 : 28);
-  },
-  expr: function({ y: t = 0, m: e = 0, d: n = 0, h: r = 0, i = 0, s = 0 }) {
-    const o = new Date(this.getFullYear() + t, this.getMonth() + e + 1, 0);
-    return new Date(this.getFullYear() + t, this.getMonth() + e, Math.min(o.getDate(), this.getDate()) + n, this.getHours() + r, this.getMinutes() + i, this.getSeconds() + s);
-  },
-  begin: function(t = 3) {
-    return new Date(...[this.getFullYear(), this.getMonth(), this.getDate(), this.getHours(), this.getMinutes(), this.getSeconds()].slice(0, t), ...[this.getFullYear(), 0, 1, 0, 0, 0].slice(t));
-  },
-  end: function(t = 3) {
-    return new Date(...[this.getFullYear(), this.getMonth(), this.getDate(), this.getHours(), this.getMinutes(), this.getSeconds()].slice(0, t), ...[this.getFullYear(), 11, t < 2 ? 31 : this.getMonthDay(), 23, 59, 59].slice(t));
-  },
-  week: function(t, e = 1) {
-    let n = new Date(this.getTime());
-    for (; n.getDay() !== t; )
-      n = new Date(n.getTime() + 864e5 * e);
-    return n;
-  },
-  toJSON: function() {
-    return this.getTime();
-  }
-});
-h(RegExp, {
-  ...g()
-});
-h(RegExp.prototype, {
-  toJSON: function() {
-    return this.toString();
-  }
-});
-h(Promise, {
-  ...g(),
-  $channel: function() {
-    let t = null, e = null;
-    return [new this((r, i) => {
-      t = r, e = i;
-    }), t, e];
-  },
-  $withResolvers: function() {
-    let t = null, e = null;
-    return { promise: new this((r, i) => {
-      t = r, e = i;
-    }), resolve: t, reject: e };
-  }
-});
-h(Promise.prototype, {
-  tryCatch: function() {
-    return new Promise((t) => this.then((e) => t([e, null])).catch((e) => t([null, e])));
-  }
-});
-typeof Promise.withResolvers > "u" && (Promise.withResolvers = Promise.$withResolvers);
-h(JSON, {
-  $parse: function(t, e = null) {
-    try {
-      if (typeof t != "string")
-        throw new Error("not string");
-      return JSON.parse(t);
-    } catch {
-      return e;
-    }
-  }
-});
-typeof Iterator < "u" && h(Iterator.prototype, {
-  toArray: function() {
-    return [...this];
-  }
-});
-h(ArrayBuffer.prototype, {
-  toUint8Array: function() {
-    return new Uint8Array(this);
-  }
-});
-h(Uint8Array, {
-  ...g(),
-  fromString: function(t) {
-    return new TextEncoder().encode(t);
-  },
-  $fromHex: function(t) {
-    const e = [];
-    for (let n = 0; n < t.length; n += 2)
-      e.push(Number.parseInt(t.substring(n, n + 2), 16));
-    return new Uint8Array(e);
-  },
-  $fromBase64: function(t) {
-    const e = [], n = {}, r = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
-    for (let s = 0; s < r.length; s++)
-      n[r.charAt(s)] = s;
-    const i = t.charAt(t.length - 1) != "=" ? t.length : t.charAt(t.length - 2) != "=" ? t.length - 1 : t.length - 2;
-    for (let s = 3; s < i; s += 4) {
-      const o = (n[t.charAt(s - 3)] << 18) + (n[t.charAt(s - 2)] << 12) + (n[t.charAt(s - 1)] << 6) + n[t.charAt(s)];
-      e.push((o & 16711680) >> 16, (o & 65280) >> 8, o & 255);
-    }
-    if (i % 4 == 3) {
-      const s = (n[t.charAt(i - 3)] << 18) + (n[t.charAt(i - 2)] << 12) + (n[t.charAt(i - 1)] << 6);
-      e.push((s & 16711680) >> 16, (s & 65280) >> 8);
-    } else if (i % 4 == 2) {
-      const s = (n[t.charAt(i - 2)] << 18) + (n[t.charAt(i - 1)] << 12);
-      e.push((s & 16711680) >> 16);
-    }
-    return new Uint8Array(e);
-  }
-});
-h(Uint8Array.prototype, {
-  setFromString(t, e = 0) {
-    const n = Uint8Array.fromString(t);
-    return this.set(n, e), { read: n.length, written: n.length };
-  },
-  $setFromHex(t, e = 0) {
-    const n = Uint8Array.fromHex(t);
-    return this.set(n, e), { read: n.length, written: n.length };
-  },
-  $setFromBase64(t, e = 0) {
-    const n = Uint8Array.fromBase64(t);
-    return this.set(n, e), { read: n.length, written: n.length };
-  },
-  toString: function() {
-    return new TextDecoder().decode(this);
-  },
-  $toHex: function() {
-    let t = "";
-    for (let e = 0; e < this.length; e++)
-      t += (this[e] < 16 ? "0" : "") + this[e].toString(16);
-    return t;
-  },
-  $toBase64: function() {
-    let t = "", e = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
-    for (let n = 2; n < this.length; n += 3) {
-      const r = (this[n - 2] << 16) + (this[n - 1] << 8) + this[n];
-      t += e.charAt((r & 16515072) >> 18) + e.charAt((r & 258048) >> 12) + e.charAt((r & 4032) >> 6) + e.charAt(r & 63);
-    }
-    if (this.length % 3 == 2) {
-      const n = (this[this.length - 2] << 16) + (this[this.length - 1] << 8);
-      t += e.charAt((n & 16515072) >> 18) + e.charAt((n & 258048) >> 12) + e.charAt((n & 4032) >> 6) + "=";
-    } else if (this.length % 3 == 1) {
-      const n = this[this.length - 1] << 16;
-      t += e.charAt((n & 16515072) >> 18) + e.charAt((n & 258048) >> 12) + "==";
-    }
-    return t;
-  },
-  toArray: function() {
-    return new Array(...this);
-  }
-});
-typeof Uint8Array.fromBase64 > "u" && (Uint8Array.fromHex = Uint8Array.$fromHex, Uint8Array.fromBase64 = Uint8Array.$fromBase64);
-typeof Uint8Array.prototype.setFromHex > "u" && (Uint8Array.prototype.setFromHex = Uint8Array.prototype.$setFromHex, Uint8Array.prototype.setFromBase64 = Uint8Array.prototype.$setFromBase64, Uint8Array.prototype.toHex = Uint8Array.prototype.$toHex, Uint8Array.prototype.toBase64 = Uint8Array.prototype.$toBase64);
-let D = 0, w = 0, A = 0;
-h(Math, {
-  randstr: function(t = 16, e = 0, n = "0123456789abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ", r = "~!@#$%^&*()_+`{}|[]\\:\";'<>,.?/") {
-    if (t < e)
-      throw new Error("randstr: len < slen");
-    const i = [];
-    for (let s = 0; s < t; s++)
-      i.push(n.charAt(Math.random() * n.length | 0));
-    for (let s = /* @__PURE__ */ new Set(), o = 0, u = 0; u < e; u++) {
-      do
-        o = Math.random() * t | 0;
-      while (s.has(o));
-      s.set(o, !0), i[o] = r.charAt(Math.random() * r.length | 0);
-    }
-    return i.join("");
-  },
-  randint: function(t = 0, e = Number.MAX_SAFE_INTEGER) {
-    return Math.floor(Math.random() * (e - t) + t);
-  },
-  incrid: function() {
-    return ++D;
-  },
-  incrstr: function() {
-    return "" + Math.incrid();
-  },
-  uniqid: function(t = Date.now()) {
-    return t === A ? t * 2048 + ++w % 2048 : (A = t) * 2048 + (w = 0) % 2048;
-  },
-  uniqstr: function() {
-    return "" + Math.uniqid();
-  },
-  sleep: function(t) {
-    return new Promise((e) => setTimeout(e, t));
-  },
-  useTemplate: function(t) {
-    let e = null;
-    const n = { setup(i, { slots: s }) {
-      return e = s.default, () => {
-      };
-    }, name: t + "Template" }, r = { setup(i, { attrs: s }) {
-      return () => e?.(s);
-    }, name: t };
-    return { [n.name]: n, [r.name]: r };
-  }
-});
-class M extends Map {
-  constructor(e) {
-    super(), this.capacity = e;
-  }
-  get(e) {
-    if (!super.has(e))
-      return null;
-    const n = super.get(e);
-    return super.delete(e), super.set(e, n), n;
-  }
-  getOrInsert(e, n) {
-    super.has(e) || super.set(e, n);
-    const r = super.get(e);
-    return super.delete(e), super.set(e, r), r;
-  }
-  getOrInsertComputed(e, n) {
-    super.has(e) || super.set(e, n(e));
-    const r = super.get(e);
-    return super.delete(e), super.set(e, r), r;
-  }
-  async getOrInsertComputedAsync(e, n) {
-    super.has(e) || super.set(e, await n(e));
-    const r = super.get(e);
-    return super.delete(e), super.set(e, r), r;
-  }
-  set(e, n) {
-    super.has(e) && super.delete(e), super.set(e, n), super.size > this.capacity && super.delete(super.keys().next().value);
-  }
-  put(e, n) {
-    return this.set(e, n);
-  }
-}
-h(M, {
-  ...g()
-});
-typeof globalThis.LRU > "u" && (globalThis.LRU = M);
+//#endregion
+//#region lib/LRU.js
+var d = class extends Map {
+	constructor(e) {
+		super(), this.capacity = e;
+	}
+	get(e) {
+		if (!super.has(e)) return null;
+		let t = super.get(e);
+		return super.delete(e), super.set(e, t), t;
+	}
+	getOrInsert(e, t) {
+		super.has(e) || super.set(e, t);
+		let n = super.get(e);
+		return super.delete(e), super.set(e, n), n;
+	}
+	getOrInsertComputed(e, t) {
+		super.has(e) || super.set(e, t(e));
+		let n = super.get(e);
+		return super.delete(e), super.set(e, n), n;
+	}
+	async getOrInsertComputedAsync(e, t) {
+		super.has(e) || super.set(e, await t(e));
+		let n = super.get(e);
+		return super.delete(e), super.set(e, n), n;
+	}
+	set(e, t) {
+		super.has(e) && super.delete(e), super.set(e, t), super.size > this.capacity && super.delete(super.keys().next().value);
+	}
+	put(e, t) {
+		return this.set(e, t);
+	}
+};
+e(d, { ...t() }), globalThis.LRU === void 0 && (globalThis.LRU = d);
+//#endregion