@delta-comic/plugin 0.2.3 → 0.3.0

package/dist/index.js

@@ -1,16 +1,16 @@
-import { DBUtils, PluginArchiveDB, SubscribeDB, db, useNativeStore } from "@delta-comic/db";
-import { useGlobalVar } from "@delta-comic/utils";
-import { Fragment, computed, createBlock, createCommentVNode, createElementBlock, createVNode, defineComponent, getCurrentInstance, getCurrentScope, h, hasInjectionContext, inject, isRef, markRaw, mergeProps, onMounted, openBlock, reactive, ref, renderList, resolveDynamicComponent, shallowReactive, shallowRef, toValue, unref, watch, watchEffect, withCtx } from "vue";
-import { defineStore } from "pinia";
-import { PromiseContent, SourcedKeyMap, uni } from "@delta-comic/model";
-import { SharedFunction } from "@delta-comic/core";
-import { DcAwait, DcPopup, createDialog, createDownloadMessage, createForm } from "@delta-comic/ui";
-import axios from "axios";
-var __commonJSMin = (e, t) => () => (t || e((t = { exports: {} }).exports, t), t.exports), __require = /* @__PURE__ */ ((e) => typeof require < "u" ? require : typeof Proxy < "u" ? new Proxy(e, { get: (e, t) => (typeof require < "u" ? require : e)[t] }) : e)(function(e) {
+import { DBUtils as e, PluginArchiveDB as t, SubscribeDB as n, db as r, useNativeStore as i } from "@delta-comic/db";
+import { useGlobalVar as a } from "@delta-comic/utils";
+import { Fragment as o, computed as s, createBlock as c, createCommentVNode as l, createElementBlock as u, createVNode as d, defineComponent as f, getCurrentInstance as p, getCurrentScope as m, h, hasInjectionContext as g, inject as _, isRef as v, markRaw as y, mergeProps as b, onMounted as x, openBlock as S, reactive as C, ref as w, renderList as T, resolveDynamicComponent as E, shallowReactive as D, shallowRef as O, toValue as k, unref as A, watch as j, watchEffect as M, withCtx as N } from "vue";
+import { defineStore as P } from "pinia";
+import { PromiseContent as F, SourcedKeyMap as I, uni as L } from "@delta-comic/model";
+import { SharedFunction as R } from "@delta-comic/core";
+import { DcAwait as z, DcPopup as B, createDialog as V, createDownloadMessage as H, createForm as U } from "@delta-comic/ui";
+import W from "axios";
+var G = (e, t) => () => (t || e((t = { exports: {} }).exports, t), t.exports), K = /* @__PURE__ */ ((e) => typeof require < "u" ? require : typeof Proxy < "u" ? new Proxy(e, { get: (e, t) => (typeof require < "u" ? require : e)[t] }) : e)(function(e) {
 	if (typeof require < "u") return require.apply(this, arguments);
 	throw Error("Calling `require` for \"" + e + "\" in an environment that doesn't expose the `require` function. See https://rolldown.rs/in-depth/bundling-cjs#require-external-modules for more details.");
 });
-function flatten(e, t = 1) {
+function q(e, t = 1) {
 	let n = [], r = Math.floor(t), i = (e, t) => {
 		for (let a = 0; a < e.length; a++) {
 			let o = e[a];
@@ -19,7 +19,7 @@ function flatten(e, t = 1) {
 	};
 	return i(e, 0), n;
 }
-function remove$1(e, t) {
+function ee(e, t) {
 	let n = e.slice(), r = [], i = 0;
 	for (let a = 0; a < e.length; a++) {
 		if (t(e[a], a, n)) {
@@ -34,28 +34,28 @@ function remove$1(e, t) {
 	}
 	return e.length = i, r;
 }
-function isSymbol(e) {
+function te(e) {
 	return typeof e == "symbol" || e instanceof Symbol;
 }
-function isTypedArray$1(e) {
+function ne(e) {
 	return ArrayBuffer.isView(e) && !(e instanceof DataView);
 }
-function getTag(e) {
+function re(e) {
 	return e == null ? e === void 0 ? "[object Undefined]" : "[object Null]" : Object.prototype.toString.call(e);
 }
-function eq(e, t) {
+function ie(e, t) {
 	return e === t || Number.isNaN(e) && Number.isNaN(t);
 }
-function isLength(e) {
+function ae(e) {
 	return Number.isSafeInteger(e) && e >= 0;
 }
-function isString(e) {
+function oe(e) {
 	return typeof e == "string";
 }
-function isUndefined(e) {
+function se(e) {
 	return e === void 0;
 }
-var Semaphore = class {
+var ce = class {
 	capacity;
 	available;
 	deferredTasks = [];
@@ -79,8 +79,8 @@ var Semaphore = class {
 		}
 		this.available < this.capacity && this.available++;
 	}
-}, Mutex = class {
-	semaphore = new Semaphore(1);
+}, le = class {
+	semaphore = new ce(1);
 	get isLocked() {
 		return this.semaphore.available === 0;
 	}
@@ -91,23 +91,23 @@ var Semaphore = class {
 		this.semaphore.release();
 	}
 };
-function isArrayLike(e) {
-	return e != null && typeof e != "function" && isLength(e.length);
+function ue(e) {
+	return e != null && typeof e != "function" && ae(e.length);
 }
-function toKey(e) {
+function de(e) {
 	return typeof e == "string" || typeof e == "symbol" ? e : Object.is(e?.valueOf?.(), -0) ? "-0" : String(e);
 }
-function toString$1(e) {
+function fe(e) {
 	if (e == null) return "";
 	if (typeof e == "string") return e;
-	if (Array.isArray(e)) return e.map(toString$1).join(",");
+	if (Array.isArray(e)) return e.map(fe).join(",");
 	let t = String(e);
 	return t === "0" && Object.is(Number(e), -0) ? "-0" : t;
 }
-function toPath(e) {
-	if (Array.isArray(e)) return e.map(toKey);
+function pe(e) {
+	if (Array.isArray(e)) return e.map(de);
 	if (typeof e == "symbol") return [e];
-	e = toString$1(e);
+	e = fe(e);
 	let t = [], n = e.length;
 	if (n === 0) return t;
 	let r = 0, i = "", a = "", o = !1;
@@ -117,29 +117,29 @@ function toPath(e) {
 	}
 	return i && t.push(i), t;
 }
-function isObject$1(e) {
+function me(e) {
 	return e !== null && (typeof e == "object" || typeof e == "function");
 }
-var IS_UNSIGNED_INTEGER = /^(?:0|[1-9]\d*)$/;
-function isIndex(e, t = 2 ** 53 - 1) {
+var he = /^(?:0|[1-9]\d*)$/;
+function ge(e, t = 2 ** 53 - 1) {
 	switch (typeof e) {
 		case "number": return Number.isInteger(e) && e >= 0 && e < t;
 		case "symbol": return !1;
-		case "string": return IS_UNSIGNED_INTEGER.test(e);
+		case "string": return he.test(e);
 	}
 }
-function isArguments(e) {
-	return typeof e == "object" && !!e && getTag(e) === "[object Arguments]";
+function _e(e) {
+	return typeof e == "object" && !!e && re(e) === "[object Arguments]";
 }
-function isIterateeCall(e, t, n) {
-	return isObject$1(n) && (typeof t == "number" && isArrayLike(n) && isIndex(t) && t < n.length || typeof t == "string" && t in n) ? eq(n[t], e) : !1;
+function ve(e, t, n) {
+	return me(n) && (typeof t == "number" && ue(n) && ge(t) && t < n.length || typeof t == "string" && t in n) ? ie(n[t], e) : !1;
 }
-function getPriority(e) {
+function ye(e) {
 	return typeof e == "symbol" ? 1 : e === null ? 2 : e === void 0 ? 3 : e === e ? 0 : 4;
 }
-var compareValues = (e, t, n) => {
+var be = (e, t, n) => {
 	if (e !== t) {
-		let r = getPriority(e), i = getPriority(t);
+		let r = ye(e), i = ye(t);
 		if (r === i && r === 0) {
 			if (e < t) return n === "desc" ? 1 : -1;
 			if (e > t) return n === "desc" ? -1 : 1;
@@ -147,45 +147,45 @@ var compareValues = (e, t, n) => {
 		return n === "desc" ? i - r : r - i;
 	}
 	return 0;
-}, regexIsDeepProp = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, regexIsPlainProp = /^\w*$/;
-function isKey(e, t) {
-	return Array.isArray(e) ? !1 : typeof e == "number" || typeof e == "boolean" || e == null || isSymbol(e) ? !0 : typeof e == "string" && (regexIsPlainProp.test(e) || !regexIsDeepProp.test(e)) || t != null && Object.hasOwn(t, e);
+}, xe = /\.|\[(?:[^[\]]*|(["'])(?:(?!\1)[^\\]|\\.)*?\1)\]/, Se = /^\w*$/;
+function Ce(e, t) {
+	return Array.isArray(e) ? !1 : typeof e == "number" || typeof e == "boolean" || e == null || te(e) ? !0 : typeof e == "string" && (Se.test(e) || !xe.test(e)) || t != null && Object.hasOwn(t, e);
 }
-function orderBy(e, t, n, r) {
+function we(e, t, n, r) {
 	if (e == null) return [];
 	n = r ? void 0 : n, Array.isArray(e) || (e = Object.values(e)), Array.isArray(t) || (t = t == null ? [null] : [t]), t.length === 0 && (t = [null]), Array.isArray(n) || (n = n == null ? [] : [n]), n = n.map((e) => String(e));
 	let i = (e, t) => {
 		let n = e;
 		for (let e = 0; e < t.length && n != null; ++e) n = n[t[e]];
 		return n;
-	}, a = (e, t) => t == null || e == null ? t : typeof e == "object" && "key" in e ? Object.hasOwn(t, e.key) ? t[e.key] : i(t, e.path) : typeof e == "function" ? e(t) : Array.isArray(e) ? i(t, e) : typeof t == "object" ? t[e] : t, o = t.map((e) => (Array.isArray(e) && e.length === 1 && (e = e[0]), e == null || typeof e == "function" || Array.isArray(e) || isKey(e) ? e : {
+	}, a = (e, t) => t == null || e == null ? t : typeof e == "object" && "key" in e ? Object.hasOwn(t, e.key) ? t[e.key] : i(t, e.path) : typeof e == "function" ? e(t) : Array.isArray(e) ? i(t, e) : typeof t == "object" ? t[e] : t, o = t.map((e) => (Array.isArray(e) && e.length === 1 && (e = e[0]), e == null || typeof e == "function" || Array.isArray(e) || Ce(e) ? e : {
 		key: e,
-		path: toPath(e)
+		path: pe(e)
 	}));
 	return e.map((e) => ({
 		original: e,
 		criteria: o.map((t) => a(t, e))
 	})).slice().sort((e, t) => {
 		for (let r = 0; r < o.length; r++) {
-			let i = compareValues(e.criteria[r], t.criteria[r], n[r]);
+			let i = be(e.criteria[r], t.criteria[r], n[r]);
 			if (i !== 0) return i;
 		}
 		return 0;
 	}).map((e) => e.original);
 }
-function sortBy(e, ...t) {
+function Te(e, ...t) {
 	let n = t.length;
-	return n > 1 && isIterateeCall(e, t[0], t[1]) ? t = [] : n > 2 && isIterateeCall(t[0], t[1], t[2]) && (t = [t[0]]), orderBy(e, flatten(t), ["asc"]);
+	return n > 1 && ve(e, t[0], t[1]) ? t = [] : n > 2 && ve(t[0], t[1], t[2]) && (t = [t[0]]), we(e, q(t), ["asc"]);
 }
-function isPrototype(e) {
+function Ee(e) {
 	let t = e?.constructor;
 	return e === (typeof t == "function" ? t.prototype : Object.prototype);
 }
-function isTypedArray(e) {
-	return isTypedArray$1(e);
+function De(e) {
+	return ne(e);
 }
-function fromPairs(e) {
-	if (!isArrayLike(e)) return {};
+function Oe(e) {
+	if (!ue(e)) return {};
 	let t = {};
 	for (let n = 0; n < e.length; n++) {
 		let [r, i] = e[n];
@@ -193,20 +193,20 @@ function fromPairs(e) {
 	}
 	return t;
 }
-function isFunction(e) {
+function ke(e) {
 	return typeof e == "function";
 }
-function isEmpty(e) {
+function Ae(e) {
 	if (e == null) return !0;
-	if (isArrayLike(e)) return typeof e.splice != "function" && typeof e != "string" && (typeof Buffer > "u" || !Buffer.isBuffer(e)) && !isTypedArray(e) && !isArguments(e) ? !1 : e.length === 0;
+	if (ue(e)) return typeof e.splice != "function" && typeof e != "string" && (typeof Buffer > "u" || !Buffer.isBuffer(e)) && !De(e) && !_e(e) ? !1 : e.length === 0;
 	if (typeof e == "object") {
 		if (e instanceof Map || e instanceof Set) return e.size === 0;
 		let t = Object.keys(e);
-		return isPrototype(e) ? t.filter((e) => e !== "constructor").length === 0 : t.length === 0;
+		return Ee(e) ? t.filter((e) => e !== "constructor").length === 0 : t.length === 0;
 	}
 	return !0;
 }
-function mitt_default(e) {
+function je(e) {
 	return {
 		all: e ||= /* @__PURE__ */ new Map(),
 		on: function(t, n) {
@@ -227,24 +227,24 @@ function mitt_default(e) {
 		}
 	};
 }
-const pluginEmitter = mitt_default(), definePlugin = async (e) => {
-	if (isFunction(e)) var t = e(window.$$safe$$);
+const Me = je(), Ne = async (e) => {
+	if (ke(e)) var t = e(window.$$safe$$);
 	else var t = e;
-	return console.log("[definePlugin] new plugin defining...", t), await pluginEmitter.emit("definedPlugin", t), t;
-}, decodePluginMeta = (e) => ({
+	return console.log("[definePlugin] new plugin defining...", t), await Me.emit("definedPlugin", t), t;
+}, Pe = (e) => ({
 	name: {
 		display: e["name:display"],
 		id: e["name:id"]
 	},
 	author: e.author ?? "",
 	description: e.description,
-	require: (e.require ? isString(e.require) ? [e.require] : e.require : []).map((e) => {
+	require: (e.require ? oe(e.require) ? [e.require] : e.require : []).map((e) => {
 		let [t, ...n] = e.split(":");
 		if (t.startsWith("dc|")) return {
 			id: t.replace(/^dc\|/, ""),
 			download: n.join(":")
 		};
-	}).filter((e) => !isUndefined(e)),
+	}).filter((e) => !se(e)),
 	version: {
 		plugin: e.version.split("/")[0],
 		supportCore: (() => {
@@ -253,30 +253,38 @@ const pluginEmitter = mitt_default(), definePlugin = async (e) => {
 		})()
 	}
 });
-var localProvidedStateMap = /* @__PURE__ */ new WeakMap(), injectLocal = (...e) => {
-	let t = e[0], n = getCurrentInstance()?.proxy ?? getCurrentScope();
-	if (n == null && !hasInjectionContext()) throw Error("injectLocal must be called in setup");
-	return n && localProvidedStateMap.has(n) && t in localProvidedStateMap.get(n) ? localProvidedStateMap.get(n)[t] : inject(...e);
-}, isClient = typeof window < "u" && typeof document < "u";
+var Fe = /* @__PURE__ */ new WeakMap(), Ie = (...e) => {
+	let t = e[0], n = p()?.proxy ?? m();
+	if (n == null && !g()) throw Error("injectLocal must be called in setup");
+	return n && Fe.has(n) && t in Fe.get(n) ? Fe.get(n)[t] : _(...e);
+}, Le = typeof window < "u" && typeof document < "u";
 typeof WorkerGlobalScope < "u" && globalThis instanceof WorkerGlobalScope;
-var toString = Object.prototype.toString, isObject = (e) => toString.call(e) === "[object Object]", noop$2 = () => {};
-function pxValue(e) {
+var Re = Object.prototype.toString, ze = (e) => Re.call(e) === "[object Object]", Be = () => {};
+/**
+* Get a px value for SSR use, do not rely on this method outside of SSR as REM unit is assumed at 16px, which might not be the case on the client
+*/
+function Ve(e) {
 	return e.endsWith("rem") ? Number.parseFloat(e) * 16 : Number.parseFloat(e);
 }
-function toArray(e) {
+function He(e) {
 	return Array.isArray(e) ? e : [e];
 }
-function watchImmediate(e, t, n) {
-	return watch(e, t, {
+/**
+* Shorthand for watching value with {immediate: true}
+*
+* @see https://vueuse.org/watchImmediate
+*/
+function Ue(e, t, n) {
+	return j(e, t, {
 		...n,
 		immediate: !0
 	});
 }
-function computedAsync(e, t, n) {
+function We(e, t, n) {
 	let r;
-	r = isRef(n) ? { evaluating: n } : n || {};
-	let { lazy: i = !1, flush: a = "sync", evaluating: o = void 0, shallow: c = !0, onError: l = globalThis.reportError ?? noop$2 } = r, u = shallowRef(!i), d = c ? shallowRef(t) : ref(t), f = 0;
-	return watchEffect(async (t) => {
+	r = v(n) ? { evaluating: n } : n || {};
+	let { lazy: i = !1, flush: a = "sync", evaluating: o = void 0, shallow: c = !0, onError: l = globalThis.reportError ?? Be } = r, u = O(!i), d = c ? O(t) : w(t), f = 0;
+	return M(async (t) => {
 		if (!u.value) return;
 		f++;
 		let n = f, r = !1;
@@ -295,74 +303,101 @@ function computedAsync(e, t, n) {
 		} finally {
 			o && n === f && (o.value = !1), r = !0;
 		}
-	}, { flush: a }), i ? computed(() => (u.value = !0, d.value)) : d;
+	}, { flush: a }), i ? s(() => (u.value = !0, d.value)) : d;
 }
-var defaultWindow = isClient ? window : void 0;
-isClient && window.document, isClient && window.navigator, isClient && window.location;
-function unrefElement(e) {
-	let t = toValue(e);
+var Ge = Le ? window : void 0;
+Le && window.document, Le && window.navigator, Le && window.location;
+/**
+* Get the dom element of a ref of element or Vue component instance
+*
+* @param elRef
+*/
+function Ke(e) {
+	let t = k(e);
 	return t?.$el ?? t;
 }
-function useEventListener(...e) {
-	let t = (e, t, n, r) => (e.addEventListener(t, n, r), () => e.removeEventListener(t, n, r)), n = computed(() => {
-		let t = toArray(toValue(e[0])).filter((e) => e != null);
+function qe(...e) {
+	let t = (e, t, n, r) => (e.addEventListener(t, n, r), () => e.removeEventListener(t, n, r)), n = s(() => {
+		let t = He(k(e[0])).filter((e) => e != null);
 		return t.every((e) => typeof e != "string") ? t : void 0;
 	});
-	return watchImmediate(() => [
-		n.value?.map((e) => unrefElement(e)) ?? [defaultWindow].filter((e) => e != null),
-		toArray(toValue(n.value ? e[1] : e[0])),
-		toArray(unref(n.value ? e[2] : e[1])),
-		toValue(n.value ? e[3] : e[2])
+	return Ue(() => [
+		n.value?.map((e) => Ke(e)) ?? [Ge].filter((e) => e != null),
+		He(k(n.value ? e[1] : e[0])),
+		He(A(n.value ? e[2] : e[1])),
+		k(n.value ? e[3] : e[2])
 	], ([e, n, r, i], a, o) => {
 		if (!e?.length || !n?.length || !r?.length) return;
-		let s = isObject(i) ? { ...i } : i, c = e.flatMap((e) => n.flatMap((n) => r.map((r) => t(e, n, r, s))));
+		let s = ze(i) ? { ...i } : i, c = e.flatMap((e) => n.flatMap((n) => r.map((r) => t(e, n, r, s))));
 		o(() => {
 			c.forEach((e) => e());
 		});
 	}, { flush: "post" });
 }
-function useMounted() {
-	let e = shallowRef(!1), t = getCurrentInstance();
-	return t && onMounted(() => {
+/**
+* Mounted state in ref.
+*
+* @see https://vueuse.org/useMounted
+*
+* @__NO_SIDE_EFFECTS__
+*/
+function Je() {
+	let e = O(!1), t = p();
+	return t && x(() => {
 		e.value = !0;
 	}, t), e;
 }
 /* @__NO_SIDE_EFFECTS__ */
-function useSupported(e) {
-	let t = useMounted();
-	return computed(() => (t.value, !!e()));
+function Ye(e) {
+	let t = Je();
+	return s(() => (t.value, !!e()));
 }
-var ssrWidthSymbol = Symbol("vueuse-ssr-width");
+var Xe = Symbol("vueuse-ssr-width");
 /* @__NO_SIDE_EFFECTS__ */
-function useSSRWidth() {
-	let e = hasInjectionContext() ? injectLocal(ssrWidthSymbol, null) : null;
+function Ze() {
+	let e = g() ? Ie(Xe, null) : null;
 	return typeof e == "number" ? e : void 0;
 }
-function useMediaQuery(e, t = {}) {
-	let { window: n = defaultWindow, ssrWidth: r = /* @__PURE__ */ useSSRWidth() } = t, i = /* @__PURE__ */ useSupported(() => n && "matchMedia" in n && typeof n.matchMedia == "function"), a = shallowRef(typeof r == "number"), o = shallowRef(), c = shallowRef(!1);
-	return watchEffect(() => {
+/**
+* Reactive Media Query.
+*
+* @see https://vueuse.org/useMediaQuery
+* @param query
+* @param options
+*/
+function Qe(e, t = {}) {
+	let { window: n = Ge, ssrWidth: r = /* @__PURE__ */ Ze() } = t, i = /* @__PURE__ */ Ye(() => n && "matchMedia" in n && typeof n.matchMedia == "function"), a = O(typeof r == "number"), o = O(), c = O(!1);
+	return M(() => {
 		if (a.value) {
-			a.value = !i.value, c.value = toValue(e).split(",").some((e) => {
+			a.value = !i.value, c.value = k(e).split(",").some((e) => {
 				let t = e.includes("not all"), n = e.match(/\(\s*min-width:\s*(-?\d+(?:\.\d*)?[a-z]+\s*)\)/), i = e.match(/\(\s*max-width:\s*(-?\d+(?:\.\d*)?[a-z]+\s*)\)/), a = !!(n || i);
-				return n && a && (a = r >= pxValue(n[1])), i && a && (a = r <= pxValue(i[1])), t ? !a : a;
+				return n && a && (a = r >= Ve(n[1])), i && a && (a = r <= Ve(i[1])), t ? !a : a;
 			});
 			return;
 		}
-		i.value && (o.value = n.matchMedia(toValue(e)), c.value = o.value.matches);
-	}), useEventListener(o, "change", (e) => {
+		i.value && (o.value = n.matchMedia(k(e)), c.value = o.value.matches);
+	}), qe(o, "change", (e) => {
 		c.value = e.matches;
-	}, { passive: !0 }), computed(() => c.value);
+	}, { passive: !0 }), s(() => c.value);
 }
-function usePreferredDark(e) {
-	return useMediaQuery("(prefers-color-scheme: dark)", e);
+/**
+* Reactive dark theme preference.
+*
+* @see https://vueuse.org/usePreferredDark
+* @param [options]
+*
+* @__NO_SIDE_EFFECTS__
+*/
+function $e(e) {
+	return Qe("(prefers-color-scheme: dark)", e);
 }
-var ConfigPointer = class {
+var et = class {
 	constructor(e, t, n) {
 		this.pluginName = e, this.config = t, this.configName = n, this.key = Symbol.for(`config:${e}`);
 	}
 	key;
 };
-const appConfig = useGlobalVar(new ConfigPointer("core", {
+const tt = a(new et("core", {
 	recordHistory: {
 		type: "switch",
 		defaultValue: !0,
@@ -404,14 +439,14 @@ const appConfig = useGlobalVar(new ConfigPointer("core", {
 		info: "github的token",
 		placeholder: "仅用于解除api访问限制"
 	}
-}, "核心"), "core/plugin/config"), useConfig = defineStore("config", (e) => {
-	let t = shallowReactive(/* @__PURE__ */ new Map()), n = e.action((e) => {
+}, "核心"), "core/plugin/config"), nt = P("config", (e) => {
+	let t = D(/* @__PURE__ */ new Map()), n = e.action((e) => {
 		let n = t.get(e.key);
 		if (!n) throw Error(`not found config by plugin "${e.pluginName}"`);
 		return n.value;
-	}, "load"), r = usePreferredDark(), a = computed(() => {
-		if (!o(appConfig)) return r.value;
-		switch (n(appConfig).value.darkMode) {
+	}, "load"), r = $e(), a = s(() => {
+		if (!o(tt)) return r.value;
+		switch (n(tt).value.darkMode) {
 			case "light": return !1;
 			case "dark": return !0;
 			case "system": return r.value;
@@ -424,52 +459,52 @@ const appConfig = useGlobalVar(new ConfigPointer("core", {
 		$load: n,
 		$isExistConfig: o,
 		$resignerConfig: e.action((e) => {
-			let t = useConfig(), n = useNativeStore(e.pluginName, "config", fromPairs(Object.entries(e.config).map(([e, t]) => [e, t.defaultValue])));
+			let t = nt(), n = i(e.pluginName, "config", Oe(Object.entries(e.config).map(([e, t]) => [e, t.defaultValue])));
 			t.form.set(e.key, {
 				form: e.config,
 				value: n
 			});
 		}, "resignerConfig")
 	};
-}), declareDepType = (e) => Symbol.for(`expose:${e}`), require$1 = (e) => pluginExposes.get(e), pluginExposes = /* @__PURE__ */ new Map(), Global = useGlobalVar(new class {
-	share = shallowReactive(SourcedKeyMap.create());
-	shareToken = shallowReactive(SourcedKeyMap.create());
-	userActions = shallowReactive(SourcedKeyMap.create());
-	subscribes = shallowReactive(SourcedKeyMap.create());
-	globalNodes = shallowReactive([]);
-	tabbar = shallowReactive(/* @__PURE__ */ new Map());
+}), rt = (e) => Symbol.for(`expose:${e}`), it = (e) => at.get(e), at = /* @__PURE__ */ new Map(), J = a(new class {
+	share = D(I.create());
+	shareToken = D(I.create());
+	userActions = D(I.create());
+	subscribes = D(I.create());
+	globalNodes = D([]);
+	tabbar = D(/* @__PURE__ */ new Map());
 	addTabbar(e, ...t) {
 		let n = this.tabbar.get(e) ?? [];
 		this.tabbar.set(e, n.concat(t));
 	}
-	categories = shallowReactive(/* @__PURE__ */ new Map());
+	categories = D(/* @__PURE__ */ new Map());
 	addCategories(e, ...t) {
 		let n = this.categories.get(e) ?? [];
 		this.categories.set(e, n.concat(t));
 	}
-	barcode = shallowReactive(/* @__PURE__ */ new Map());
+	barcode = D(/* @__PURE__ */ new Map());
 	addBarcode(e, ...t) {
 		let n = this.barcode.get(e) ?? [];
 		this.barcode.set(e, n.concat(t));
 	}
-	levelboard = shallowReactive(/* @__PURE__ */ new Map());
+	levelboard = D(/* @__PURE__ */ new Map());
 	addLevelboard(e, ...t) {
 		let n = this.levelboard.get(e) ?? [];
 		this.levelboard.set(e, n.concat(t));
 	}
-	topButton = shallowReactive(/* @__PURE__ */ new Map());
+	topButton = D(/* @__PURE__ */ new Map());
 	addTopButton(e, ...t) {
 		let n = this.topButton.get(e) ?? [];
 		this.topButton.set(e, n.concat(t));
 	}
-	mainLists = shallowReactive(/* @__PURE__ */ new Map());
+	mainLists = D(/* @__PURE__ */ new Map());
 	addMainList(e, ...t) {
 		let n = this.mainLists.get(e) ?? [];
 		this.mainLists.set(e, n.concat(t));
 	}
-	envExtends = shallowReactive(/* @__PURE__ */ new Set());
+	envExtends = D(/* @__PURE__ */ new Set());
 }(), "core/global");
-var import_lz_string = (/* @__PURE__ */ __commonJSMin(((e, t) => {
+var ot = (/* @__PURE__ */ G(((e, t) => {
 	var n = (function() {
 		var e = String.fromCharCode, t = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=", n = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+-$", r = {};
 		function i(e, t) {
@@ -540,39 +575,39 @@ var import_lz_string = (/* @__PURE__ */ __commonJSMin(((e, t) => {
 			},
 			_compress: function(e, t, n) {
 				if (e == null) return "";
-				var r, i, a = {}, o = {}, s = "", c = "", l = "", u = 2, d = 3, f = 2, p = [], m = 0, g = 0, _;
-				for (_ = 0; _ < e.length; _ += 1) if (s = e.charAt(_), Object.prototype.hasOwnProperty.call(a, s) || (a[s] = d++, o[s] = !0), c = l + s, Object.prototype.hasOwnProperty.call(a, c)) l = c;
+				var r, i, a = {}, o = {}, s = "", c = "", l = "", u = 2, d = 3, f = 2, p = [], m = 0, h = 0, g;
+				for (g = 0; g < e.length; g += 1) if (s = e.charAt(g), Object.prototype.hasOwnProperty.call(a, s) || (a[s] = d++, o[s] = !0), c = l + s, Object.prototype.hasOwnProperty.call(a, c)) l = c;
 				else {
 					if (Object.prototype.hasOwnProperty.call(o, l)) {
 						if (l.charCodeAt(0) < 256) {
-							for (r = 0; r < f; r++) m <<= 1, g == t - 1 ? (g = 0, p.push(n(m)), m = 0) : g++;
-							for (i = l.charCodeAt(0), r = 0; r < 8; r++) m = m << 1 | i & 1, g == t - 1 ? (g = 0, p.push(n(m)), m = 0) : g++, i >>= 1;
+							for (r = 0; r < f; r++) m <<= 1, h == t - 1 ? (h = 0, p.push(n(m)), m = 0) : h++;
+							for (i = l.charCodeAt(0), r = 0; r < 8; r++) m = m << 1 | i & 1, h == t - 1 ? (h = 0, p.push(n(m)), m = 0) : h++, i >>= 1;
 						} else {
-							for (i = 1, r = 0; r < f; r++) m = m << 1 | i, g == t - 1 ? (g = 0, p.push(n(m)), m = 0) : g++, i = 0;
-							for (i = l.charCodeAt(0), r = 0; r < 16; r++) m = m << 1 | i & 1, g == t - 1 ? (g = 0, p.push(n(m)), m = 0) : g++, i >>= 1;
+							for (i = 1, r = 0; r < f; r++) m = m << 1 | i, h == t - 1 ? (h = 0, p.push(n(m)), m = 0) : h++, i = 0;
+							for (i = l.charCodeAt(0), r = 0; r < 16; r++) m = m << 1 | i & 1, h == t - 1 ? (h = 0, p.push(n(m)), m = 0) : h++, i >>= 1;
 						}
 						u--, u == 0 && (u = 2 ** f, f++), delete o[l];
-					} else for (i = a[l], r = 0; r < f; r++) m = m << 1 | i & 1, g == t - 1 ? (g = 0, p.push(n(m)), m = 0) : g++, i >>= 1;
+					} else for (i = a[l], r = 0; r < f; r++) m = m << 1 | i & 1, h == t - 1 ? (h = 0, p.push(n(m)), m = 0) : h++, i >>= 1;
 					u--, u == 0 && (u = 2 ** f, f++), a[c] = d++, l = String(s);
 				}
 				if (l !== "") {
 					if (Object.prototype.hasOwnProperty.call(o, l)) {
 						if (l.charCodeAt(0) < 256) {
-							for (r = 0; r < f; r++) m <<= 1, g == t - 1 ? (g = 0, p.push(n(m)), m = 0) : g++;
-							for (i = l.charCodeAt(0), r = 0; r < 8; r++) m = m << 1 | i & 1, g == t - 1 ? (g = 0, p.push(n(m)), m = 0) : g++, i >>= 1;
+							for (r = 0; r < f; r++) m <<= 1, h == t - 1 ? (h = 0, p.push(n(m)), m = 0) : h++;
+							for (i = l.charCodeAt(0), r = 0; r < 8; r++) m = m << 1 | i & 1, h == t - 1 ? (h = 0, p.push(n(m)), m = 0) : h++, i >>= 1;
 						} else {
-							for (i = 1, r = 0; r < f; r++) m = m << 1 | i, g == t - 1 ? (g = 0, p.push(n(m)), m = 0) : g++, i = 0;
-							for (i = l.charCodeAt(0), r = 0; r < 16; r++) m = m << 1 | i & 1, g == t - 1 ? (g = 0, p.push(n(m)), m = 0) : g++, i >>= 1;
+							for (i = 1, r = 0; r < f; r++) m = m << 1 | i, h == t - 1 ? (h = 0, p.push(n(m)), m = 0) : h++, i = 0;
+							for (i = l.charCodeAt(0), r = 0; r < 16; r++) m = m << 1 | i & 1, h == t - 1 ? (h = 0, p.push(n(m)), m = 0) : h++, i >>= 1;
 						}
 						u--, u == 0 && (u = 2 ** f, f++), delete o[l];
-					} else for (i = a[l], r = 0; r < f; r++) m = m << 1 | i & 1, g == t - 1 ? (g = 0, p.push(n(m)), m = 0) : g++, i >>= 1;
+					} else for (i = a[l], r = 0; r < f; r++) m = m << 1 | i & 1, h == t - 1 ? (h = 0, p.push(n(m)), m = 0) : h++, i >>= 1;
 					u--, u == 0 && (u = 2 ** f, f++);
 				}
-				for (i = 2, r = 0; r < f; r++) m = m << 1 | i & 1, g == t - 1 ? (g = 0, p.push(n(m)), m = 0) : g++, i >>= 1;
-				for (;;) if (m <<= 1, g == t - 1) {
+				for (i = 2, r = 0; r < f; r++) m = m << 1 | i & 1, h == t - 1 ? (h = 0, p.push(n(m)), m = 0) : h++, i >>= 1;
+				for (;;) if (m <<= 1, h == t - 1) {
 					p.push(n(m));
 					break;
-				} else g++;
+				} else h++;
 				return p.join("");
 			},
 			decompress: function(e) {
@@ -581,40 +616,40 @@ var import_lz_string = (/* @__PURE__ */ __commonJSMin(((e, t) => {
 				});
 			},
 			_decompress: function(t, n, r) {
-				var i = [], a = 4, o = 4, s = 3, c = "", l = [], u, d, f, p, m, g, _, v = {
+				var i = [], a = 4, o = 4, s = 3, c = "", l = [], u, d, f, p, m, h, g, _ = {
 					val: r(0),
 					position: n,
 					index: 1
 				};
 				for (u = 0; u < 3; u += 1) i[u] = u;
-				for (f = 0, m = 2 ** 2, g = 1; g != m;) p = v.val & v.position, v.position >>= 1, v.position == 0 && (v.position = n, v.val = r(v.index++)), f |= (p > 0 ? 1 : 0) * g, g <<= 1;
+				for (f = 0, m = 2 ** 2, h = 1; h != m;) p = _.val & _.position, _.position >>= 1, _.position == 0 && (_.position = n, _.val = r(_.index++)), f |= (p > 0 ? 1 : 0) * h, h <<= 1;
 				switch (f) {
 					case 0:
-						for (f = 0, m = 2 ** 8, g = 1; g != m;) p = v.val & v.position, v.position >>= 1, v.position == 0 && (v.position = n, v.val = r(v.index++)), f |= (p > 0 ? 1 : 0) * g, g <<= 1;
-						_ = e(f);
+						for (f = 0, m = 2 ** 8, h = 1; h != m;) p = _.val & _.position, _.position >>= 1, _.position == 0 && (_.position = n, _.val = r(_.index++)), f |= (p > 0 ? 1 : 0) * h, h <<= 1;
+						g = e(f);
 						break;
 					case 1:
-						for (f = 0, m = 2 ** 16, g = 1; g != m;) p = v.val & v.position, v.position >>= 1, v.position == 0 && (v.position = n, v.val = r(v.index++)), f |= (p > 0 ? 1 : 0) * g, g <<= 1;
-						_ = e(f);
+						for (f = 0, m = 2 ** 16, h = 1; h != m;) p = _.val & _.position, _.position >>= 1, _.position == 0 && (_.position = n, _.val = r(_.index++)), f |= (p > 0 ? 1 : 0) * h, h <<= 1;
+						g = e(f);
 						break;
 					case 2: return "";
 				}
-				for (i[3] = _, d = _, l.push(_);;) {
-					if (v.index > t) return "";
-					for (f = 0, m = 2 ** s, g = 1; g != m;) p = v.val & v.position, v.position >>= 1, v.position == 0 && (v.position = n, v.val = r(v.index++)), f |= (p > 0 ? 1 : 0) * g, g <<= 1;
-					switch (_ = f) {
+				for (i[3] = g, d = g, l.push(g);;) {
+					if (_.index > t) return "";
+					for (f = 0, m = 2 ** s, h = 1; h != m;) p = _.val & _.position, _.position >>= 1, _.position == 0 && (_.position = n, _.val = r(_.index++)), f |= (p > 0 ? 1 : 0) * h, h <<= 1;
+					switch (g = f) {
 						case 0:
-							for (f = 0, m = 2 ** 8, g = 1; g != m;) p = v.val & v.position, v.position >>= 1, v.position == 0 && (v.position = n, v.val = r(v.index++)), f |= (p > 0 ? 1 : 0) * g, g <<= 1;
-							i[o++] = e(f), _ = o - 1, a--;
+							for (f = 0, m = 2 ** 8, h = 1; h != m;) p = _.val & _.position, _.position >>= 1, _.position == 0 && (_.position = n, _.val = r(_.index++)), f |= (p > 0 ? 1 : 0) * h, h <<= 1;
+							i[o++] = e(f), g = o - 1, a--;
 							break;
 						case 1:
-							for (f = 0, m = 2 ** 16, g = 1; g != m;) p = v.val & v.position, v.position >>= 1, v.position == 0 && (v.position = n, v.val = r(v.index++)), f |= (p > 0 ? 1 : 0) * g, g <<= 1;
-							i[o++] = e(f), _ = o - 1, a--;
+							for (f = 0, m = 2 ** 16, h = 1; h != m;) p = _.val & _.position, _.position >>= 1, _.position == 0 && (_.position = n, _.val = r(_.index++)), f |= (p > 0 ? 1 : 0) * h, h <<= 1;
+							i[o++] = e(f), g = o - 1, a--;
 							break;
 						case 2: return l.join("");
 					}
-					if (a == 0 && (a = 2 ** s, s++), i[_]) c = i[_];
-					else if (_ === o) c = d + d.charAt(0);
+					if (a == 0 && (a = 2 ** s, s++), i[g]) c = i[g];
+					else if (g === o) c = d + d.charAt(0);
 					else return null;
 					l.push(c), i[o++] = d + c.charAt(0), a--, d = c, a == 0 && (a = 2 ** s, s++);
 				}
@@ -628,81 +663,81 @@ var import_lz_string = (/* @__PURE__ */ __commonJSMin(((e, t) => {
 		return n;
 	});
 })))();
-const OfflineShareRound = () => createVNode("svg", {
+const st = () => d("svg", {
 	xmlns: "http://www.w3.org/2000/svg",
 	xmlnsXlink: "http://www.w3.org/1999/xlink",
 	viewBox: "0 0 24 24"
 }, [
-	createVNode("path", {
+	d("path", {
 		d: "M5 5c-.55 0-1 .45-1 1v15c0 1.1.9 2 2 2h9c.55 0 1-.45 1-1s-.45-1-1-1H6V6c0-.55-.45-1-1-1z",
 		fill: "currentColor"
 	}, null),
-	createVNode("path", {
+	d("path", {
 		d: "M18 1h-8c-1.1 0-2 .9-2 2v14c0 1.1.9 2 2 2h8c1.1 0 2-.9 2-2V3c0-1.1-.9-2-2-2zm0 14h-8V5h8v10z",
 		fill: "currentColor"
 	}, null),
-	createVNode("path", {
+	d("path", {
 		d: "M12.5 10.25h2v.54c0 .45.54.67.85.35l1.29-1.29c.2-.2.2-.51 0-.71l-1.29-1.29a.5.5 0 0 0-.85.35v.54H12c-.55 0-1 .45-1 1v1.5c0 .41.34.75.75.75s.75-.34.75-.75v-.99z",
 		fill: "currentColor"
 	}, null)
-]), TagOutlined = () => createVNode("svg", {
+]), ct = () => d("svg", {
 	xmlns: "http://www.w3.org/2000/svg",
 	xmlnsXlink: "http://www.w3.org/1999/xlink",
 	viewBox: "0 0 1024 1024"
-}, [createVNode("path", {
+}, [d("path", {
 	d: "M938 458.8l-29.6-312.6c-1.5-16.2-14.4-29-30.6-30.6L565.2 86h-.4c-3.2 0-5.7 1-7.6 2.9L88.9 557.2a9.96 9.96 0 0 0 0 14.1l363.8 363.8c1.9 1.9 4.4 2.9 7.1 2.9s5.2-1 7.1-2.9l468.3-468.3c2-2.1 3-5 2.8-8zM459.7 834.7L189.3 564.3L589 164.6L836 188l23.4 247l-399.7 399.7zM680 256c-48.5 0-88 39.5-88 88s39.5 88 88 88s88-39.5 88-88s-39.5-88-88-88zm0 120c-17.7 0-32-14.3-32-32s14.3-32 32-32s32 14.3 32 32s-14.3 32-32 32z",
 	fill: "currentColor"
-}, null)]), usePluginStore = useGlobalVar(defineStore("plugin", (e) => {
-	let t = shallowReactive(/* @__PURE__ */ new Map()), n = reactive({}), i = computedAsync(async () => Object.fromEntries((await db.value.selectFrom("plugin").select(["pluginName", "displayName"]).execute()).map((e) => [e.pluginName, e.displayName])), {}), a = computed(() => Array.from(t.values()).filter((e) => e.search?.methods).map((e) => [e.name, Object.entries(e.search?.methods ?? {})]));
+}, null)]), lt = a(P("plugin", (e) => {
+	let t = D(/* @__PURE__ */ new Map()), n = C({}), i = We(async () => Object.fromEntries((await r.value.selectFrom("plugin").select(["pluginName", "displayName"]).execute()).map((e) => [e.pluginName, e.displayName])), {}), a = s(() => Array.from(t.values()).filter((e) => e.search?.methods).map((e) => [e.name, Object.entries(e.search?.methods ?? {})]));
 	return {
 		$getPluginDisplayName: e.action((e) => i.value[e] || e, "getPluginDisplayName"),
 		plugins: t,
 		allSearchSource: a,
 		pluginSteps: n
 	};
-}), "core/plugin/store"), $initCore = () => definePlugin({
-	name: coreName,
-	config: [appConfig],
+}), "core/plugin/store"), ut = () => Ne({
+	name: Y,
+	config: [tt],
 	onBooted: () => {
-		SharedFunction.define(async (t) => await DBUtils.countDb(db.value.selectFrom("subscribe").where("key", "=", SubscribeDB.key.toString([t.$$plugin, t.label]))) > 0, coreName, "getIsAuthorSubscribe"), SharedFunction.define(async (e) => {
-			await SubscribeDB.upsert({
-				key: SubscribeDB.key.toString([e.$$plugin, e.label]),
+		R.define(async (t) => await e.countDb(r.value.selectFrom("subscribe").where("key", "=", n.key.toString([t.$$plugin, t.label]))) > 0, Y, "getIsAuthorSubscribe"), R.define(async (e) => {
+			await n.upsert({
+				key: n.key.toString([e.$$plugin, e.label]),
 				author: e,
 				plugin: e.$$plugin,
 				type: "author",
 				itemKey: null
 			});
-		}, coreName, "addAuthorSubscribe"), SharedFunction.define(async (e) => {
-			await db.value.deleteFrom("subscribe").where("key", "=", SubscribeDB.key.toString([e.$$plugin, e.label])).execute();
-		}, coreName, "removeAuthorSubscribe");
+		}, Y, "addAuthorSubscribe"), R.define(async (e) => {
+			await r.value.deleteFrom("subscribe").where("key", "=", n.key.toString([e.$$plugin, e.label])).execute();
+		}, Y, "removeAuthorSubscribe");
 	},
 	share: {
 		initiative: [{
 			filter: () => !0,
-			icon: TagOutlined,
+			icon: ct,
 			key: "token",
 			name: "复制口令",
 			async call(e) {
-				let t = e.union.value.toJSON(), n = (0, import_lz_string.compressToEncodedURIComponent)(JSON.stringify({
+				let t = e.union.value.toJSON(), n = (0, ot.compressToEncodedURIComponent)(JSON.stringify({
 					item: {
-						contentType: uni.content.ContentPage.contentPage.toString(t.contentType),
+						contentType: L.content.ContentPage.contentPage.toString(t.contentType),
 						ep: t.thisEp.index,
 						name: t.title
 					},
 					plugin: e.plugin,
 					id: e.id
 				}));
-				await SharedFunction.call("pushShareToken", `[${e.union.value?.title}](复制这条口令，打开Delta Comic)${n}`);
+				await R.call("pushShareToken", `[${e.union.value?.title}](复制这条口令，打开Delta Comic)${n}`);
 			}
 		}, {
 			filter: () => !0,
-			icon: OfflineShareRound,
+			icon: st,
 			key: "native",
 			name: "原生分享",
 			async call(e) {
-				let t = e.union.value.toJSON(), n = (0, import_lz_string.compressToEncodedURIComponent)(JSON.stringify({
+				let t = e.union.value.toJSON(), n = (0, ot.compressToEncodedURIComponent)(JSON.stringify({
 					item: {
-						contentType: uni.content.ContentPage.contentPage.toString(t.contentType),
+						contentType: L.content.ContentPage.contentPage.toString(t.contentType),
 						ep: t.thisEp.index,
 						name: t.title
 					},
@@ -722,100 +757,221 @@ const OfflineShareRound = () => createVNode("svg", {
 				return /^\[.+\]\(复制这条口令，打开Delta Comic\).+/.test(e);
 			},
 			show(e) {
-				let t = usePluginStore(), n = JSON.parse((0, import_lz_string.decompressFromEncodedURIComponent)(e.replace(/^\[.+\]/, "").replaceAll("(复制这条口令，打开Delta Comic)", "")));
+				let t = lt(), n = JSON.parse((0, ot.decompressFromEncodedURIComponent)(e.replace(/^\[.+\]/, "").replaceAll("(复制这条口令，打开Delta Comic)", "")));
 				return {
 					title: "口令",
 					detail: `发现分享的内容: ${n.item.name}，需要的插件: ${t.$getPluginDisplayName(n.plugin)}`,
 					onNegative() {},
 					onPositive() {
-						return SharedFunction.call("routeToContent", n.item.contentType, n.id, n.item.ep);
+						return R.call("routeToContent", n.item.contentType, n.id, n.item.ep);
 					}
 				};
 			}
 		}]
 	}
-}), coreName = "core";
-useGlobalVar(declareDepType(coreName), "core/plugin/coreFlag");
-function __classPrivateFieldGet(e, t, n, r) {
+}), Y = "core";
+a(rt(Y), "core/plugin/coreFlag");
+/******************************************************************************
+Copyright (c) Microsoft Corporation.
+
+Permission to use, copy, modify, and/or distribute this software for any
+purpose with or without fee is hereby granted.
+
+THE SOFTWARE IS PROVIDED "AS IS" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH
+REGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY
+AND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,
+INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM
+LOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR
+OTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR
+PERFORMANCE OF THIS SOFTWARE.
+***************************************************************************** */
+function dt(e, t, n, r) {
 	if (n === "a" && !r) throw TypeError("Private accessor was defined without a getter");
 	if (typeof t == "function" ? e !== t || !r : !t.has(e)) throw TypeError("Cannot read private member from an object whose class did not declare it");
 	return n === "m" ? r : n === "a" ? r.call(e) : r ? r.value : t.get(e);
 }
-function __classPrivateFieldSet(e, t, n, r, i) {
+function ft(e, t, n, r, i) {
 	if (r === "m") throw TypeError("Private method is not writable");
 	if (r === "a" && !i) throw TypeError("Private accessor was defined without a setter");
 	if (typeof t == "function" ? e !== t || !i : !t.has(e)) throw TypeError("Cannot write private member to an object whose class did not declare it");
 	return r === "a" ? i.call(e, n) : i ? i.value = n : t.set(e, n), n;
 }
-var _Resource_rid;
-async function invoke(e, t = {}, n) {
+var pt;
+/**
+* Sends a message to the backend.
+* @example
+* ```typescript
+* import { invoke } from '@tauri-apps/api/core';
+* await invoke('login', { user: 'tauri', password: 'poiwe3h4r5ip3yrhtew9ty' });
+* ```
+*
+* @param cmd The command name.
+* @param args The optional arguments to pass to the command.
+* @param options The request options.
+* @return A promise resolving or rejecting to the backend response.
+*
+* @since 1.0.0
+*/
+async function X(e, t = {}, n) {
 	return window.__TAURI_INTERNALS__.invoke(e, t, n);
 }
-function convertFileSrc(e, t = "asset") {
+/**
+* Convert a device file path to an URL that can be loaded by the webview.
+* Note that `asset:` and `http://asset.localhost` must be added to [`app.security.csp`](https://v2.tauri.app/reference/config/#csp-1) in `tauri.conf.json`.
+* Example CSP value: `"csp": "default-src 'self' ipc: http://ipc.localhost; img-src 'self' asset: http://asset.localhost"` to use the asset protocol on image sources.
+*
+* Additionally, `"enable" : "true"` must be added to [`app.security.assetProtocol`](https://v2.tauri.app/reference/config/#assetprotocolconfig)
+* in `tauri.conf.json` and its access scope must be defined on the `scope` array on the same `assetProtocol` object.
+*
+* @param  filePath The file path.
+* @param  protocol The protocol to use. Defaults to `asset`. You only need to set this when using a custom protocol.
+* @example
+* ```typescript
+* import { appDataDir, join } from '@tauri-apps/api/path';
+* import { convertFileSrc } from '@tauri-apps/api/core';
+* const appDataDirPath = await appDataDir();
+* const filePath = await join(appDataDirPath, 'assets/video.mp4');
+* const assetUrl = convertFileSrc(filePath);
+*
+* const video = document.getElementById('my-video');
+* const source = document.createElement('source');
+* source.type = 'video/mp4';
+* source.src = assetUrl;
+* video.appendChild(source);
+* video.load();
+* ```
+*
+* @return the URL that can be used as source on the webview.
+*
+* @since 1.0.0
+*/
+function mt(e, t = "asset") {
 	return window.__TAURI_INTERNALS__.convertFileSrc(e, t);
 }
-var Resource = class {
+/**
+* A rust-backed resource stored through `tauri::Manager::resources_table` API.
+*
+* The resource lives in the main process and does not exist
+* in the Javascript world, and thus will not be cleaned up automatically
+* except on application exit. If you want to clean it up early, call {@linkcode Resource.close}
+*
+* @example
+* ```typescript
+* import { Resource, invoke } from '@tauri-apps/api/core';
+* export class DatabaseHandle extends Resource {
+*   static async open(path: string): Promise<DatabaseHandle> {
+*     const rid: number = await invoke('open_db', { path });
+*     return new DatabaseHandle(rid);
+*   }
+*
+*   async execute(sql: string): Promise<void> {
+*     await invoke('execute_sql', { rid: this.rid, sql });
+*   }
+* }
+* ```
+*/
+var ht = class {
 	get rid() {
-		return __classPrivateFieldGet(this, _Resource_rid, "f");
+		return dt(this, pt, "f");
 	}
 	constructor(e) {
-		_Resource_rid.set(this, void 0), __classPrivateFieldSet(this, _Resource_rid, e, "f");
+		pt.set(this, void 0), ft(this, pt, e, "f");
 	}
+	/**
+	* Destroys and cleans up this resource from memory.
+	* **You should not call any method on this object anymore and should drop any reference to it.**
+	*/
 	async close() {
-		return invoke("plugin:resources|close", { rid: this.rid });
+		return X("plugin:resources|close", { rid: this.rid });
 	}
 };
-_Resource_rid = /* @__PURE__ */ new WeakMap();
-var BaseDirectory;
+pt = /* @__PURE__ */ new WeakMap();
+/**
+* The path module provides utilities for working with file and directory paths.
+*
+* This package is also accessible with `window.__TAURI__.path` when [`app.withGlobalTauri`](https://v2.tauri.app/reference/config/#withglobaltauri) in `tauri.conf.json` is set to `true`.
+*
+* It is recommended to allowlist only the APIs you use for optimal bundle size and security.
+* @module
+*/
+/**
+* @since 2.0.0
+*/
+var gt;
 (function(e) {
+	/**
+	* @see {@link templateDir} for more information.
+	*/
 	e[e.Audio = 1] = "Audio", e[e.Cache = 2] = "Cache", e[e.Config = 3] = "Config", e[e.Data = 4] = "Data", e[e.LocalData = 5] = "LocalData", e[e.Document = 6] = "Document", e[e.Download = 7] = "Download", e[e.Picture = 8] = "Picture", e[e.Public = 9] = "Public", e[e.Video = 10] = "Video", e[e.Resource = 11] = "Resource", e[e.Temp = 12] = "Temp", e[e.AppConfig = 13] = "AppConfig", e[e.AppData = 14] = "AppData", e[e.AppLocalData = 15] = "AppLocalData", e[e.AppCache = 16] = "AppCache", e[e.AppLog = 17] = "AppLog", e[e.Desktop = 18] = "Desktop", e[e.Executable = 19] = "Executable", e[e.Font = 20] = "Font", e[e.Home = 21] = "Home", e[e.Runtime = 22] = "Runtime", e[e.Template = 23] = "Template";
-})(BaseDirectory ||= {});
-async function appLocalDataDir() {
-	return invoke("plugin:path|resolve_directory", { directory: BaseDirectory.AppLocalData });
+})(gt ||= {});
+/**
+* Returns the path to the suggested directory for your app's local data files.
+* Resolves to `${localDataDir}/${bundleIdentifier}`, where `bundleIdentifier` is the [`identifier`](https://v2.tauri.app/reference/config/#identifier) value configured in `tauri.conf.json`.
+* @example
+* ```typescript
+* import { appLocalDataDir } from '@tauri-apps/api/path';
+* const appLocalDataDirPath = await appLocalDataDir();
+* ```
+*
+* @since 1.2.0
+*/
+async function _t() {
+	return X("plugin:path|resolve_directory", { directory: gt.AppLocalData });
 }
-async function join(...e) {
-	return invoke("plugin:path|join", { paths: e });
+/**
+*  Joins all given `path` segments together using the platform-specific separator as a delimiter, then normalizes the resulting path.
+* @example
+* ```typescript
+* import { join, appDataDir } from '@tauri-apps/api/path';
+* const appDataDirPath = await appDataDir();
+* const path = await join(appDataDirPath, 'users', 'tauri', 'avatar.png');
+* ```
+*
+* @since 1.0.0
+*/
+async function Z(...e) {
+	return X("plugin:path|join", { paths: e });
 }
-var appLocalDataDirPath = await appLocalDataDir();
-const getPluginFsPath = async (e) => await join(appLocalDataDirPath, "plugin", e);
-var PluginInstaller = class {}, PluginLoader = class {}, PluginBooter = class {}, _0_configSetter_default = new class extends PluginBooter {
+var vt = await _t();
+const yt = async (e) => await Z(vt, "plugin", e);
+var bt = class {}, xt = class {}, Q = class {}, St = new class extends Q {
 	name = "预设值";
 	async call(e, t) {
 		console.log("[PluginBooter->_ConfigSetter] new plugin defining...", e), t("预设值设定中");
 		let { name: n, content: r, resource: i, search: a, user: o, subscribe: s, share: c } = e;
-		if (r) for (let [e, { commentRow: t, contentPage: n, itemCard: i, layout: a, itemTranslator: o }] of Object.entries(r)) a && uni.content.ContentPage.viewLayout.set(e, a), i && uni.item.Item.itemCard.set(e, i), n && uni.content.ContentPage.contentPage.set(e, n), t && uni.comment.Comment.commentRow.set(e, t), o && uni.item.Item.itemTranslator.set(e, o);
+		if (r) for (let [e, { commentRow: t, contentPage: n, itemCard: i, layout: a, itemTranslator: o }] of Object.entries(r)) a && L.content.ContentPage.viewLayout.set(e, a), i && L.item.Item.itemCard.set(e, i), n && L.content.ContentPage.contentPage.set(e, n), t && L.comment.Comment.commentRow.set(e, t), o && L.item.Item.itemTranslator.set(e, o);
 		if (i) {
-			if (i.types) for (let e of i.types) uni.resource.Resource.fork.set([n, e.type], e);
-			if (i.process) for (let [e, t] of Object.entries(i.process)) uni.resource.Resource.processInstances.set([n, e], t);
+			if (i.types) for (let e of i.types) L.resource.Resource.fork.set([n, e.type], e);
+			if (i.process) for (let [e, t] of Object.entries(i.process)) L.resource.Resource.processInstances.set([n, e], t);
 		}
 		if (a) {
-			if (a.categories) for (let e of a.categories) Global.addCategories(n, e);
-			if (a.tabbar) for (let e of a.tabbar) Global.addTabbar(n, e);
+			if (a.categories) for (let e of a.categories) J.addCategories(n, e);
+			if (a.tabbar) for (let e of a.tabbar) J.addTabbar(n, e);
 			if (a.hotPage) {
-				for (let e of a.hotPage.mainListCard ?? []) Global.addMainList(n, e);
-				for (let e of a.hotPage.levelBoard ?? []) Global.addLevelboard(n, e);
-				for (let e of a.hotPage.topButton ?? []) Global.addTopButton(n, e);
+				for (let e of a.hotPage.mainListCard ?? []) J.addMainList(n, e);
+				for (let e of a.hotPage.levelBoard ?? []) J.addLevelboard(n, e);
+				for (let e of a.hotPage.topButton ?? []) J.addTopButton(n, e);
 			}
-			if (a.barcode) for (let e of a.barcode ?? []) Global.addBarcode(n, e);
+			if (a.barcode) for (let e of a.barcode ?? []) J.addBarcode(n, e);
 		}
 		if (o) {
-			if (o.edit && uni.user.User.userEditorBase.set(n, o.edit), o.userActions) for (let [e, t] of Object.entries(o.userActions)) Global.userActions.set([n, e], t);
-			if (o.authorIcon) for (let [e, t] of Object.entries(o.authorIcon)) uni.item.Item.authorIcon.set([n, e], t);
+			if (o.edit && L.user.User.userEditorBase.set(n, o.edit), o.userActions) for (let [e, t] of Object.entries(o.userActions)) J.userActions.set([n, e], t);
+			if (o.authorIcon) for (let [e, t] of Object.entries(o.authorIcon)) L.item.Item.authorIcon.set([n, e], t);
 		}
-		if (s) for (let [e, t] of Object.entries(s)) Global.subscribes.set([n, e], t);
-		if (e.config) for (let t of e.config) useConfig().$resignerConfig(t);
+		if (s) for (let [e, t] of Object.entries(s)) J.subscribes.set([n, e], t);
+		if (e.config) for (let t of e.config) nt().$resignerConfig(t);
 		if (c) {
-			for (let e of c.initiative ?? []) Global.share.set([n, e.key], e);
-			for (let e of c.tokenListen ?? []) Global.shareToken.set([n, e.key], e);
+			for (let e of c.initiative ?? []) J.share.set([n, e.key], e);
+			for (let e of c.tokenListen ?? []) J.shareToken.set([n, e.key], e);
 		}
 	}
 }();
-const testApi = async (e) => await test(await e.forks(), e.test), testResourceApi = (e) => {
+const Ct = async (e) => await Tt(await e.forks(), e.test), wt = (e) => {
 	let t = e.urls;
-	return test(t, e.test);
+	return Tt(t, e.test);
 };
-var test = async (e, t) => {
-	if (isEmpty(e)) throw Error("[plugin test] no fork found");
+var Tt = async (e, t) => {
+	if (Ae(e)) throw Error("[plugin test] no fork found");
 	let n = [], r = new AbortController();
 	try {
 		await Promise.all(e.map(async (e) => {
@@ -833,20 +989,20 @@ var test = async (e, t) => {
 	} catch (e) {
 		console.log("[plugin test] fetch test aborted", e);
 	}
-	let i = sortBy(n.filter((e) => e[1] != 0), (e) => e[1])[0];
+	let i = Te(n.filter((e) => e[1] != 0), (e) => e[1])[0];
 	return console.log("[plugin test] fetch test done", i), i || ["", !1];
-}, _10_apiTest_default = new class extends PluginBooter {
+}, Et = new class extends Q {
 	name = "接口测试";
 	async call(e, t, n) {
 		if (!e.api) return;
 		t("开始并发测试");
-		let r = Object.keys(e.api), i = await Promise.all(r.map((t) => testApi(e.api[t]))), a = [], o = {};
+		let r = Object.keys(e.api), i = await Promise.all(r.map((t) => Ct(e.api[t]))), a = [], o = {};
 		if (r.forEach((e, t) => {
 			o[e] = i[t][0], a.push([e, i[t][1]]);
 		}), n.api = o, Object.values(o).some((e) => e == 0)) throw t("测试完成, 无法连接至服务器"), Error("can not connect to server");
 		t(`测试完成, \n${a.map((e) => `${e[0]}->${e[1]}ms`).join("\n")}`);
 	}
-}(), _20_resourceTest_default = new class extends PluginBooter {
+}(), Dt = new class extends Q {
 	name = "资源链接测试";
 	async call(e, t) {
 		if (!e.resource?.types?.length) return;
@@ -854,29 +1010,29 @@ var test = async (e, t) => {
 		let n = e.resource.types.map((e) => ({
 			type: e.type,
 			val: e
-		})), r = await Promise.all(n.map((e) => testResourceApi(e.val))), i = [];
+		})), r = await Promise.all(n.map((e) => wt(e.val))), i = [];
 		if (n.forEach((t, n) => {
-			r[n][1] && uni.resource.Resource.precedenceFork.set([e.name, t.type], r[n][0]), i.push([t, r[n][1]]);
+			r[n][1] && L.resource.Resource.precedenceFork.set([e.name, t.type], r[n][0]), i.push([t, r[n][1]]);
 		}), r.some((e) => e[1] == 0)) throw t("测试完成, 无法连接至服务器"), Error("[plugin test] can not connect to server");
 		t(`测试完成, \n${i.map((e) => `${e[0].type}->${e[1]}ms`).join("\n")}`);
 	}
-}(), _30_boot_default = new class extends PluginBooter {
+}(), Ot = new class extends Q {
 	name = "自定义初始化";
 	async call(e, t, n) {
 		if (!e.onBooted) return;
 		let r = await e.onBooted({ api: n.api });
-		r && pluginExposes.set(Symbol.for(`expose:${e.name}`), r);
+		r && at.set(Symbol.for(`expose:${e.name}`), r);
 	}
-}(), authPopupMutex = new Mutex(), _40_auth_default = new class extends PluginBooter {
+}(), kt = new le(), At = new class extends Q {
 	name = "登录";
 	async call(e, t) {
 		if (!e.auth) return;
-		let n = usePluginStore();
+		let n = lt();
 		try {
 			let r = n.$getPluginDisplayName(e.name);
 			t("判定鉴权状态中...");
 			let i = await e.auth.passSelect(), a = Promise.withResolvers();
-			console.log(`[plugin auth] ${r}, isPass: ${i}`), await authPopupMutex.acquire(), t("等待其他插件鉴权结束..."), i ? (t("跳过鉴权方式选择"), a.resolve(i)) : (t("选择鉴权方式"), createDialog({
+			console.log(`[plugin auth] ${r}, isPass: ${i}`), await kt.acquire(), t("等待其他插件鉴权结束..."), i ? (t("跳过鉴权方式选择"), a.resolve(i)) : (t("选择鉴权方式"), V({
 				type: "default",
 				positiveText: "登录",
 				negativeText: "注册",
@@ -895,28 +1051,28 @@ var test = async (e, t) => {
 			t("鉴权中...");
 			let s = {
 				async form(e) {
-					let t = createForm(e);
-					return Global.globalNodes.push(markRaw(defineComponent(() => {
-						let e = ref(!0);
-						return t.data.then(() => e.value = !1), () => h(DcPopup, {
+					let t = U(e);
+					return J.globalNodes.push(y(f(() => {
+						let e = w(!0);
+						return t.data.then(() => e.value = !1), () => h(B, {
 							show: e.value,
 							position: "center",
 							round: !0,
-							class: "p-6 pt-3 !w-[95vw]",
+							class: "auth-popup",
 							transitionAppear: !0
-						}, [h("div", { class: "pl-1 py-1 text-lg w-full" }, [r]), t.comp]);
+						}, [h("div", [r]), t.comp]);
 					}))), await t.data;
 				},
 				website(e) {
 					return window;
 				}
 			};
-			o == "logIn" ? await e.auth.logIn(s) : o == "signUp" && await e.auth.signUp(s), authPopupMutex.release(), t("鉴权成功");
+			o == "logIn" ? await e.auth.logIn(s) : o == "signUp" && await e.auth.signUp(s), kt.release(), t("鉴权成功");
 		} catch (e) {
 			throw t(`登录失败: ${e}`), e;
 		}
 	}
-}(), _50_otherProcess_default = new class extends PluginBooter {
+}(), jt = new class extends Q {
 	name = "其他步骤";
 	async call(e, t) {
 		if (e.otherProgress?.length) for (let n of e.otherProgress) t({
@@ -929,14 +1085,14 @@ var test = async (e, t) => {
 			});
 		});
 	}
-}(), _10_normalUrl_default = new class extends PluginInstaller {
+}(), Mt = new class extends bt {
 	description = {
 		title: "通过任意URL安装插件",
 		description: "从任何你给定的url获取内容，无论内容是什么"
 	};
 	name = "fallbackUrl";
 	async installer(e) {
-		let t = await axios.request({
+		let t = await W.request({
 			url: e,
 			responseType: "blob"
 		}), n = e.split("/").at(-1) ?? "us.js";
@@ -951,11 +1107,11 @@ var test = async (e, t) => {
 	isMatched(e) {
 		return URL.canParse(e);
 	}
-}(), SeekMode;
+}(), Nt;
 (function(e) {
 	e[e.Start = 0] = "Start", e[e.Current = 1] = "Current", e[e.End = 2] = "End";
-})(SeekMode ||= {});
-function parseFileInfo(e) {
+})(Nt ||= {});
+function Pt(e) {
 	return {
 		isFile: e.isFile,
 		isDirectory: e.isDirectory,
@@ -977,7 +1133,8 @@ function parseFileInfo(e) {
 		blocks: e.blocks
 	};
 }
-function fromBytes(e) {
+/** Converts a big-endian eight byte array to number  */
+function Ft(e) {
 	let t = new Uint8ClampedArray(e), n = t.byteLength, r = 0;
 	for (let e = 0; e < n; e++) {
 		let n = t[e];
@@ -985,86 +1142,306 @@ function fromBytes(e) {
 	}
 	return r;
 }
-var FileHandle = class extends Resource {
+/**
+*  The Tauri abstraction for reading and writing files.
+*
+* @since 2.0.0
+*/
+var It = class extends ht {
+	/**
+	* Reads up to `p.byteLength` bytes into `p`. It resolves to the number of
+	* bytes read (`0` < `n` <= `p.byteLength`) and rejects if any error
+	* encountered. Even if `read()` resolves to `n` < `p.byteLength`, it may
+	* use all of `p` as scratch space during the call. If some data is
+	* available but not `p.byteLength` bytes, `read()` conventionally resolves
+	* to what is available instead of waiting for more.
+	*
+	* When `read()` encounters end-of-file condition, it resolves to EOF
+	* (`null`).
+	*
+	* When `read()` encounters an error, it rejects with an error.
+	*
+	* Callers should always process the `n` > `0` bytes returned before
+	* considering the EOF (`null`). Doing so correctly handles I/O errors that
+	* happen after reading some bytes and also both of the allowed EOF
+	* behaviors.
+	*
+	* @example
+	* ```typescript
+	* import { open, BaseDirectory } from "@tauri-apps/plugin-fs"
+	* // if "$APPCONFIG/foo/bar.txt" contains the text "hello world":
+	* const file = await open("foo/bar.txt", { baseDir: BaseDirectory.AppConfig });
+	* const buf = new Uint8Array(100);
+	* const numberOfBytesRead = await file.read(buf); // 11 bytes
+	* const text = new TextDecoder().decode(buf);  // "hello world"
+	* await file.close();
+	* ```
+	*
+	* @since 2.0.0
+	*/
 	async read(e) {
 		if (e.byteLength === 0) return 0;
-		let t = await invoke("plugin:fs|read", {
+		let t = await X("plugin:fs|read", {
 			rid: this.rid,
 			len: e.byteLength
-		}), n = fromBytes(t.slice(-8)), r = t instanceof ArrayBuffer ? new Uint8Array(t) : t;
+		}), n = Ft(t.slice(-8)), r = t instanceof ArrayBuffer ? new Uint8Array(t) : t;
 		return e.set(r.slice(0, r.length - 8)), n === 0 ? null : n;
 	}
+	/**
+	* Seek sets the offset for the next `read()` or `write()` to offset,
+	* interpreted according to `whence`: `Start` means relative to the
+	* start of the file, `Current` means relative to the current offset,
+	* and `End` means relative to the end. Seek resolves to the new offset
+	* relative to the start of the file.
+	*
+	* Seeking to an offset before the start of the file is an error. Seeking to
+	* any positive offset is legal, but the behavior of subsequent I/O
+	* operations on the underlying object is implementation-dependent.
+	* It returns the number of cursor position.
+	*
+	* @example
+	* ```typescript
+	* import { open, SeekMode, BaseDirectory } from '@tauri-apps/plugin-fs';
+	*
+	* // Given hello.txt pointing to file with "Hello world", which is 11 bytes long:
+	* const file = await open('hello.txt', { read: true, write: true, truncate: true, create: true, baseDir: BaseDirectory.AppLocalData });
+	* await file.write(new TextEncoder().encode("Hello world"));
+	*
+	* // Seek 6 bytes from the start of the file
+	* console.log(await file.seek(6, SeekMode.Start)); // "6"
+	* // Seek 2 more bytes from the current position
+	* console.log(await file.seek(2, SeekMode.Current)); // "8"
+	* // Seek backwards 2 bytes from the end of the file
+	* console.log(await file.seek(-2, SeekMode.End)); // "9" (e.g. 11-2)
+	*
+	* await file.close();
+	* ```
+	*
+	* @since 2.0.0
+	*/
 	async seek(e, t) {
-		return await invoke("plugin:fs|seek", {
+		return await X("plugin:fs|seek", {
 			rid: this.rid,
 			offset: e,
 			whence: t
 		});
 	}
+	/**
+	* Returns a {@linkcode FileInfo } for this file.
+	*
+	* @example
+	* ```typescript
+	* import { open, BaseDirectory } from '@tauri-apps/plugin-fs';
+	* const file = await open("file.txt", { read: true, baseDir: BaseDirectory.AppLocalData });
+	* const fileInfo = await file.stat();
+	* console.log(fileInfo.isFile); // true
+	* await file.close();
+	* ```
+	*
+	* @since 2.0.0
+	*/
 	async stat() {
-		return parseFileInfo(await invoke("plugin:fs|fstat", { rid: this.rid }));
+		return Pt(await X("plugin:fs|fstat", { rid: this.rid }));
 	}
+	/**
+	* Truncates or extends this file, to reach the specified `len`.
+	* If `len` is not specified then the entire file contents are truncated.
+	*
+	* @example
+	* ```typescript
+	* import { open, BaseDirectory } from '@tauri-apps/plugin-fs';
+	*
+	* // truncate the entire file
+	* const file = await open("my_file.txt", { read: true, write: true, create: true, baseDir: BaseDirectory.AppLocalData });
+	* await file.truncate();
+	*
+	* // truncate part of the file
+	* const file = await open("my_file.txt", { read: true, write: true, create: true, baseDir: BaseDirectory.AppLocalData });
+	* await file.write(new TextEncoder().encode("Hello World"));
+	* await file.truncate(7);
+	* const data = new Uint8Array(32);
+	* await file.read(data);
+	* console.log(new TextDecoder().decode(data)); // Hello W
+	* await file.close();
+	* ```
+	*
+	* @since 2.0.0
+	*/
 	async truncate(e) {
-		await invoke("plugin:fs|ftruncate", {
+		await X("plugin:fs|ftruncate", {
 			rid: this.rid,
 			len: e
 		});
 	}
+	/**
+	* Writes `data.byteLength` bytes from `data` to the underlying data stream. It
+	* resolves to the number of bytes written from `data` (`0` <= `n` <=
+	* `data.byteLength`) or reject with the error encountered that caused the
+	* write to stop early. `write()` must reject with a non-null error if
+	* would resolve to `n` < `data.byteLength`. `write()` must not modify the
+	* slice data, even temporarily.
+	*
+	* @example
+	* ```typescript
+	* import { open, write, BaseDirectory } from '@tauri-apps/plugin-fs';
+	* const encoder = new TextEncoder();
+	* const data = encoder.encode("Hello world");
+	* const file = await open("bar.txt", { write: true, baseDir: BaseDirectory.AppLocalData });
+	* const bytesWritten = await file.write(data); // 11
+	* await file.close();
+	* ```
+	*
+	* @since 2.0.0
+	*/
 	async write(e) {
-		return await invoke("plugin:fs|write", {
+		return await X("plugin:fs|write", {
 			rid: this.rid,
 			data: e
 		});
 	}
 };
-async function open(e, t) {
+/**
+* Open a file and resolve to an instance of {@linkcode FileHandle}. The
+* file does not need to previously exist if using the `create` or `createNew`
+* open options. It is the callers responsibility to close the file when finished
+* with it.
+*
+* @example
+* ```typescript
+* import { open, BaseDirectory } from "@tauri-apps/plugin-fs"
+* const file = await open("foo/bar.txt", { read: true, write: true, baseDir: BaseDirectory.AppLocalData });
+* // Do work with file
+* await file.close();
+* ```
+*
+* @since 2.0.0
+*/
+async function Lt(e, t) {
 	if (e instanceof URL && e.protocol !== "file:") throw TypeError("Must be a file URL.");
-	return new FileHandle(await invoke("plugin:fs|open", {
+	return new It(await X("plugin:fs|open", {
 		path: e instanceof URL ? e.toString() : e,
 		options: t
 	}));
 }
-async function mkdir(e, t) {
+/**
+* Creates a new directory with the specified path.
+* @example
+* ```typescript
+* import { mkdir, BaseDirectory } from '@tauri-apps/plugin-fs';
+* await mkdir('users', { baseDir: BaseDirectory.AppLocalData });
+* ```
+*
+* @since 2.0.0
+*/
+async function Rt(e, t) {
 	if (e instanceof URL && e.protocol !== "file:") throw TypeError("Must be a file URL.");
-	await invoke("plugin:fs|mkdir", {
+	await X("plugin:fs|mkdir", {
 		path: e instanceof URL ? e.toString() : e,
 		options: t
 	});
 }
-async function readDir(e, t) {
+/**
+* Reads the directory given by path and returns an array of `DirEntry`.
+* @example
+* ```typescript
+* import { readDir, BaseDirectory } from '@tauri-apps/plugin-fs';
+* import { join } from '@tauri-apps/api/path';
+* const dir = "users"
+* const entries = await readDir('users', { baseDir: BaseDirectory.AppLocalData });
+* processEntriesRecursively(dir, entries);
+* async function processEntriesRecursively(parent, entries) {
+*   for (const entry of entries) {
+*     console.log(`Entry: ${entry.name}`);
+*     if (entry.isDirectory) {
+*        const dir = await join(parent, entry.name);
+*       processEntriesRecursively(dir, await readDir(dir, { baseDir: BaseDirectory.AppLocalData }))
+*     }
+*   }
+* }
+* ```
+*
+* @since 2.0.0
+*/
+async function zt(e, t) {
 	if (e instanceof URL && e.protocol !== "file:") throw TypeError("Must be a file URL.");
-	return await invoke("plugin:fs|read_dir", {
+	return await X("plugin:fs|read_dir", {
 		path: e instanceof URL ? e.toString() : e,
 		options: t
 	});
 }
-async function readFile(e, t) {
+/**
+* Reads and resolves to the entire contents of a file as an array of bytes.
+* TextDecoder can be used to transform the bytes to string if required.
+* @example
+* ```typescript
+* import { readFile, BaseDirectory } from '@tauri-apps/plugin-fs';
+* const contents = await readFile('avatar.png', { baseDir: BaseDirectory.Resource });
+* ```
+*
+* @since 2.0.0
+*/
+async function Bt(e, t) {
 	if (e instanceof URL && e.protocol !== "file:") throw TypeError("Must be a file URL.");
-	let n = await invoke("plugin:fs|read_file", {
+	let n = await X("plugin:fs|read_file", {
 		path: e instanceof URL ? e.toString() : e,
 		options: t
 	});
 	return n instanceof ArrayBuffer ? new Uint8Array(n) : Uint8Array.from(n);
 }
-async function readTextFile(e, t) {
+/**
+* Reads and returns the entire contents of a file as UTF-8 string.
+* @example
+* ```typescript
+* import { readTextFile, BaseDirectory } from '@tauri-apps/plugin-fs';
+* const contents = await readTextFile('app.conf', { baseDir: BaseDirectory.AppConfig });
+* ```
+*
+* @since 2.0.0
+*/
+async function Vt(e, t) {
 	if (e instanceof URL && e.protocol !== "file:") throw TypeError("Must be a file URL.");
-	let n = await invoke("plugin:fs|read_text_file", {
+	let n = await X("plugin:fs|read_text_file", {
 		path: e instanceof URL ? e.toString() : e,
 		options: t
 	}), r = n instanceof ArrayBuffer ? n : Uint8Array.from(n);
 	return new TextDecoder().decode(r);
 }
-async function remove(e, t) {
+/**
+* Removes the named file or directory.
+* If the directory is not empty and the `recursive` option isn't set to true, the promise will be rejected.
+* @example
+* ```typescript
+* import { remove, BaseDirectory } from '@tauri-apps/plugin-fs';
+* await remove('users/file.txt', { baseDir: BaseDirectory.AppLocalData });
+* await remove('users', { baseDir: BaseDirectory.AppLocalData });
+* ```
+*
+* @since 2.0.0
+*/
+async function Ht(e, t) {
 	if (e instanceof URL && e.protocol !== "file:") throw TypeError("Must be a file URL.");
-	await invoke("plugin:fs|remove", {
+	await X("plugin:fs|remove", {
 		path: e instanceof URL ? e.toString() : e,
 		options: t
 	});
 }
-async function writeFile(e, t, n) {
+/**
+* Write `data` to the given `path`, by default creating a new file if needed, else overwriting.
+* @example
+* ```typescript
+* import { writeFile, BaseDirectory } from '@tauri-apps/plugin-fs';
+*
+* let encoder = new TextEncoder();
+* let data = encoder.encode("Hello World");
+* await writeFile('file.txt', data, { baseDir: BaseDirectory.AppLocalData });
+* ```
+*
+* @since 2.0.0
+*/
+async function Ut(e, t, n) {
 	if (e instanceof URL && e.protocol !== "file:") throw TypeError("Must be a file URL.");
 	if (t instanceof ReadableStream) {
-		let r = await open(e, {
+		let r = await Lt(e, {
 			read: !1,
 			create: !0,
 			write: !0,
@@ -1079,26 +1456,37 @@ async function writeFile(e, t, n) {
 		} finally {
 			i.releaseLock(), await r.close();
 		}
-	} else await invoke("plugin:fs|write_file", t, { headers: {
+	} else await X("plugin:fs|write_file", t, { headers: {
 		path: encodeURIComponent(e instanceof URL ? e.toString() : e),
 		options: JSON.stringify(n)
 	} });
 }
-async function writeTextFile(e, t, n) {
+/**
+* Writes UTF-8 string `data` to the given `path`, by default creating a new file if needed, else overwriting.
+@example
+* ```typescript
+* import { writeTextFile, BaseDirectory } from '@tauri-apps/plugin-fs';
+*
+* await writeTextFile('file.txt', "Hello world", { baseDir: BaseDirectory.AppLocalData });
+* ```
+*
+* @since 2.0.0
+*/
+async function Wt(e, t, n) {
 	if (e instanceof URL && e.protocol !== "file:") throw TypeError("Must be a file URL.");
-	await invoke("plugin:fs|write_text_file", new TextEncoder().encode(t), { headers: {
+	await X("plugin:fs|write_text_file", new TextEncoder().encode(t), { headers: {
 		path: encodeURIComponent(e instanceof URL ? e.toString() : e),
 		options: JSON.stringify(n)
 	} });
 }
-var _20_local_default = new class extends PluginInstaller {
+var Gt = new class extends bt {
 	description = {
 		title: "安装本地插件",
 		description: "输入以: \"local:\"开头，后接全路径的文本"
 	};
 	name = "local";
 	async installer(e) {
-		let t = decodeURIComponent(convertFileSrc(e.replace(/^local:/, ""), "local")), n = t.split(/\\|\//).at(-1) ?? "us.js", r = await readFile(t);
+		let t = decodeURIComponent(mt(e.replace(/^local:/, ""), "local")), n = t.split(/\\|\//).at(-1) ?? "us.js", r = await Bt(t);
 		return new File([r], n);
 	}
 	async install(e) {
@@ -1110,14 +1498,14 @@ var _20_local_default = new class extends PluginInstaller {
 	isMatched(e) {
 		return e.startsWith("local:");
 	}
-}(), _30_dev_default = new class extends PluginInstaller {
+}(), Kt = new class extends bt {
 	description = {
 		title: "安装Develop Userscript插件",
 		description: "输入形如: \"localhost\"或者一个可以不含port的ip"
 	};
 	name = "devUrl";
 	async installer(e) {
-		let t = await axios.request({
+		let t = await W.request({
 			url: `http://${/:\d+$/.test(e) ? e : e + ":6173"}/__vite-plugin-monkey.install.user.js?origin=http%3A%2F%2F${e}%3A6173`,
 			responseType: "text"
 		}), n = e.replace(/:\d+$/, ""), r = t.data.replaceAll("localhost", n).replaceAll("127.0.0.1", n);
@@ -1133,14 +1521,14 @@ var _20_local_default = new class extends PluginInstaller {
 		return /^(((\d+\.?)+)|(localhost))(:\d+)?$/.test(e);
 	}
 }();
-function getUserAgent() {
+function qt() {
 	return typeof navigator == "object" && "userAgent" in navigator ? navigator.userAgent : typeof process == "object" && process.version !== void 0 ? `Node.js/${process.version.substr(1)} (${process.platform}; ${process.arch})` : "<environment undetectable>";
 }
-function register(e, t, n, r) {
+function Jt(e, t, n, r) {
 	if (typeof n != "function") throw Error("method for before hook must be a function");
-	return r ||= {}, Array.isArray(t) ? t.reverse().reduce((t, n) => register.bind(null, e, n, t, r), n)() : Promise.resolve().then(() => e.registry[t] ? e.registry[t].reduce((e, t) => t.hook.bind(null, e, r), n)() : n(r));
+	return r ||= {}, Array.isArray(t) ? t.reverse().reduce((t, n) => Jt.bind(null, e, n, t, r), n)() : Promise.resolve().then(() => e.registry[t] ? e.registry[t].reduce((e, t) => t.hook.bind(null, e, r), n)() : n(r));
 }
-function addHook(e, t, n, r) {
+function Yt(e, t, n, r) {
 	let i = r;
 	e.registry[n] || (e.registry[n] = []), t === "before" && (r = (e, t) => Promise.resolve().then(i.bind(null, t)).then(e.bind(null, t))), t === "after" && (r = (e, t) => {
 		let n;
@@ -1150,14 +1538,14 @@ function addHook(e, t, n, r) {
 		orig: i
 	});
 }
-function removeHook(e, t, n) {
+function Xt(e, t, n) {
 	if (!e.registry[t]) return;
 	let r = e.registry[t].map((e) => e.orig).indexOf(n);
 	r !== -1 && e.registry[t].splice(r, 1);
 }
-var bind = Function.bind, bindable = bind.bind(bind);
-function bindApi(e, t, n) {
-	let r = bindable(removeHook, null).apply(null, n ? [t, n] : [t]);
+var Zt = Function.bind, Qt = Zt.bind(Zt);
+function $t(e, t, n) {
+	let r = Qt(Xt, null).apply(null, n ? [t, n] : [t]);
 	e.api = { remove: r }, e.remove = r, [
 		"before",
 		"error",
@@ -1169,50 +1557,50 @@ function bindApi(e, t, n) {
 			r,
 			n
 		] : [t, r];
-		e[r] = e.api[r] = bindable(addHook, null).apply(null, i);
+		e[r] = e.api[r] = Qt(Yt, null).apply(null, i);
 	});
 }
-function Singular() {
-	let e = Symbol("Singular"), t = { registry: {} }, n = register.bind(null, t, e);
-	return bindApi(n, t, e), n;
+function en() {
+	let e = Symbol("Singular"), t = { registry: {} }, n = Jt.bind(null, t, e);
+	return $t(n, t, e), n;
 }
-function Collection() {
-	let e = { registry: {} }, t = register.bind(null, e);
-	return bindApi(t, e), t;
+function tn() {
+	let e = { registry: {} }, t = Jt.bind(null, e);
+	return $t(t, e), t;
 }
-var before_after_hook_default = {
-	Singular,
-	Collection
-}, userAgent = `octokit-endpoint.js/0.0.0-development ${getUserAgent()}`, DEFAULTS = {
+var nn = {
+	Singular: en,
+	Collection: tn
+}, rn = `octokit-endpoint.js/0.0.0-development ${qt()}`, an = {
 	method: "GET",
 	baseUrl: "https://api.github.com",
 	headers: {
 		accept: "application/vnd.github.v3+json",
-		"user-agent": userAgent
+		"user-agent": rn
 	},
 	mediaType: { format: "" }
 };
-function lowercaseKeys(e) {
+function on(e) {
 	return e ? Object.keys(e).reduce((t, n) => (t[n.toLowerCase()] = e[n], t), {}) : {};
 }
-function isPlainObject$1(e) {
+function sn(e) {
 	if (typeof e != "object" || !e || Object.prototype.toString.call(e) !== "[object Object]") return !1;
 	let t = Object.getPrototypeOf(e);
 	if (t === null) return !0;
 	let n = Object.prototype.hasOwnProperty.call(t, "constructor") && t.constructor;
 	return typeof n == "function" && n instanceof n && Function.prototype.call(n) === Function.prototype.call(e);
 }
-function mergeDeep(e, t) {
+function cn(e, t) {
 	let n = Object.assign({}, e);
 	return Object.keys(t).forEach((r) => {
-		isPlainObject$1(t[r]) && r in e ? n[r] = mergeDeep(e[r], t[r]) : Object.assign(n, { [r]: t[r] });
+		sn(t[r]) && r in e ? n[r] = cn(e[r], t[r]) : Object.assign(n, { [r]: t[r] });
 	}), n;
 }
-function removeUndefinedProperties(e) {
+function ln(e) {
 	for (let t in e) e[t] === void 0 && delete e[t];
 	return e;
 }
-function merge(e, t, n) {
+function un(e, t, n) {
 	if (typeof t == "string") {
 		let [e, r] = t.split(" ");
 		n = Object.assign(r ? {
@@ -1220,69 +1608,69 @@ function merge(e, t, n) {
 			url: r
 		} : { url: e }, n);
 	} else n = Object.assign({}, t);
-	n.headers = lowercaseKeys(n.headers), removeUndefinedProperties(n), removeUndefinedProperties(n.headers);
-	let r = mergeDeep(e || {}, n);
+	n.headers = on(n.headers), ln(n), ln(n.headers);
+	let r = cn(e || {}, n);
 	return n.url === "/graphql" && (e && e.mediaType.previews?.length && (r.mediaType.previews = e.mediaType.previews.filter((e) => !r.mediaType.previews.includes(e)).concat(r.mediaType.previews)), r.mediaType.previews = (r.mediaType.previews || []).map((e) => e.replace(/-preview/, ""))), r;
 }
-function addQueryParameters(e, t) {
+function dn(e, t) {
 	let n = /\?/.test(e) ? "&" : "?", r = Object.keys(t);
 	return r.length === 0 ? e : e + n + r.map((e) => e === "q" ? "q=" + t.q.split("+").map(encodeURIComponent).join("+") : `${e}=${encodeURIComponent(t[e])}`).join("&");
 }
-var urlVariableRegex = /\{[^{}}]+\}/g;
-function removeNonChars(e) {
+var fn = /\{[^{}}]+\}/g;
+function pn(e) {
 	return e.replace(/(?:^\W+)|(?:(?<!\W)\W+$)/g, "").split(/,/);
 }
-function extractUrlVariableNames(e) {
-	let t = e.match(urlVariableRegex);
-	return t ? t.map(removeNonChars).reduce((e, t) => e.concat(t), []) : [];
+function mn(e) {
+	let t = e.match(fn);
+	return t ? t.map(pn).reduce((e, t) => e.concat(t), []) : [];
 }
-function omit(e, t) {
+function hn(e, t) {
 	let n = { __proto__: null };
 	for (let r of Object.keys(e)) t.indexOf(r) === -1 && (n[r] = e[r]);
 	return n;
 }
-function encodeReserved(e) {
+function gn(e) {
 	return e.split(/(%[0-9A-Fa-f]{2})/g).map(function(e) {
 		return /%[0-9A-Fa-f]/.test(e) || (e = encodeURI(e).replace(/%5B/g, "[").replace(/%5D/g, "]")), e;
 	}).join("");
 }
-function encodeUnreserved(e) {
+function _n(e) {
 	return encodeURIComponent(e).replace(/[!'()*]/g, function(e) {
 		return "%" + e.charCodeAt(0).toString(16).toUpperCase();
 	});
 }
-function encodeValue(e, t, n) {
-	return t = e === "+" || e === "#" ? encodeReserved(t) : encodeUnreserved(t), n ? encodeUnreserved(n) + "=" + t : t;
+function vn(e, t, n) {
+	return t = e === "+" || e === "#" ? gn(t) : _n(t), n ? _n(n) + "=" + t : t;
 }
-function isDefined(e) {
+function yn(e) {
 	return e != null;
 }
-function isKeyOperator(e) {
+function bn(e) {
 	return e === ";" || e === "&" || e === "?";
 }
-function getValues(e, t, n, r) {
+function xn(e, t, n, r) {
 	var i = e[n], a = [];
-	if (isDefined(i) && i !== "") if (typeof i == "string" || typeof i == "number" || typeof i == "boolean") i = i.toString(), r && r !== "*" && (i = i.substring(0, parseInt(r, 10))), a.push(encodeValue(t, i, isKeyOperator(t) ? n : ""));
-	else if (r === "*") Array.isArray(i) ? i.filter(isDefined).forEach(function(e) {
-		a.push(encodeValue(t, e, isKeyOperator(t) ? n : ""));
+	if (yn(i) && i !== "") if (typeof i == "string" || typeof i == "number" || typeof i == "boolean") i = i.toString(), r && r !== "*" && (i = i.substring(0, parseInt(r, 10))), a.push(vn(t, i, bn(t) ? n : ""));
+	else if (r === "*") Array.isArray(i) ? i.filter(yn).forEach(function(e) {
+		a.push(vn(t, e, bn(t) ? n : ""));
 	}) : Object.keys(i).forEach(function(e) {
-		isDefined(i[e]) && a.push(encodeValue(t, i[e], e));
+		yn(i[e]) && a.push(vn(t, i[e], e));
 	});
 	else {
 		let e = [];
-		Array.isArray(i) ? i.filter(isDefined).forEach(function(n) {
-			e.push(encodeValue(t, n));
+		Array.isArray(i) ? i.filter(yn).forEach(function(n) {
+			e.push(vn(t, n));
 		}) : Object.keys(i).forEach(function(n) {
-			isDefined(i[n]) && (e.push(encodeUnreserved(n)), e.push(encodeValue(t, i[n].toString())));
-		}), isKeyOperator(t) ? a.push(encodeUnreserved(n) + "=" + e.join(",")) : e.length !== 0 && a.push(e.join(","));
+			yn(i[n]) && (e.push(_n(n)), e.push(vn(t, i[n].toString())));
+		}), bn(t) ? a.push(_n(n) + "=" + e.join(",")) : e.length !== 0 && a.push(e.join(","));
 	}
-	else t === ";" ? isDefined(i) && a.push(encodeUnreserved(n)) : i === "" && (t === "&" || t === "?") ? a.push(encodeUnreserved(n) + "=") : i === "" && a.push("");
+	else t === ";" ? yn(i) && a.push(_n(n)) : i === "" && (t === "&" || t === "?") ? a.push(_n(n) + "=") : i === "" && a.push("");
 	return a;
 }
-function parseUrl(e) {
-	return { expand: expand.bind(null, e) };
+function Sn(e) {
+	return { expand: Cn.bind(null, e) };
 }
-function expand(e, t) {
+function Cn(e, t) {
 	var n = [
 		"+",
 		"#",
@@ -1297,51 +1685,72 @@ function expand(e, t) {
 			let e = "", i = [];
 			if (n.indexOf(r.charAt(0)) !== -1 && (e = r.charAt(0), r = r.substr(1)), r.split(/,/g).forEach(function(n) {
 				var r = /([^:\*]*)(?::(\d+)|(\*))?/.exec(n);
-				i.push(getValues(t, e, r[1], r[2] || r[3]));
+				i.push(xn(t, e, r[1], r[2] || r[3]));
 			}), e && e !== "+") {
 				var a = ",";
 				return e === "?" ? a = "&" : e !== "#" && (a = e), (i.length === 0 ? "" : e) + i.join(a);
 			} else return i.join(",");
-		} else return encodeReserved(i);
+		} else return gn(i);
 	}), e === "/" ? e : e.replace(/\/$/, "");
 }
-function parse$1(e) {
-	let t = e.method.toUpperCase(), n = (e.url || "/").replace(/:([a-z]\w+)/g, "{$1}"), r = Object.assign({}, e.headers), i, a = omit(e, [
+function wn(e) {
+	let t = e.method.toUpperCase(), n = (e.url || "/").replace(/:([a-z]\w+)/g, "{$1}"), r = Object.assign({}, e.headers), i, a = hn(e, [
 		"method",
 		"baseUrl",
 		"url",
 		"headers",
 		"request",
 		"mediaType"
-	]), o = extractUrlVariableNames(n);
-	n = parseUrl(n).expand(a), /^http/.test(n) || (n = e.baseUrl + n);
-	let s = omit(a, Object.keys(e).filter((e) => o.includes(e)).concat("baseUrl"));
-	return /application\/octet-stream/i.test(r.accept) || (e.mediaType.format && (r.accept = r.accept.split(/,/).map((t) => t.replace(/application\/vnd(\.\w+)(\.v3)?(\.\w+)?(\+json)?$/, `application/vnd$1$2.${e.mediaType.format}`)).join(",")), n.endsWith("/graphql") && e.mediaType.previews?.length && (r.accept = (r.accept.match(/(?<![\w-])[\w-]+(?=-preview)/g) || []).concat(e.mediaType.previews).map((t) => `application/vnd.github.${t}-preview${e.mediaType.format ? `.${e.mediaType.format}` : "+json"}`).join(","))), ["GET", "HEAD"].includes(t) ? n = addQueryParameters(n, s) : "data" in s ? i = s.data : Object.keys(s).length && (i = s), !r["content-type"] && i !== void 0 && (r["content-type"] = "application/json; charset=utf-8"), ["PATCH", "PUT"].includes(t) && i === void 0 && (i = ""), Object.assign({
+	]), o = mn(n);
+	n = Sn(n).expand(a), /^http/.test(n) || (n = e.baseUrl + n);
+	let s = hn(a, Object.keys(e).filter((e) => o.includes(e)).concat("baseUrl"));
+	return /application\/octet-stream/i.test(r.accept) || (e.mediaType.format && (r.accept = r.accept.split(/,/).map((t) => t.replace(/application\/vnd(\.\w+)(\.v3)?(\.\w+)?(\+json)?$/, `application/vnd$1$2.${e.mediaType.format}`)).join(",")), n.endsWith("/graphql") && e.mediaType.previews?.length && (r.accept = (r.accept.match(/(?<![\w-])[\w-]+(?=-preview)/g) || []).concat(e.mediaType.previews).map((t) => `application/vnd.github.${t}-preview${e.mediaType.format ? `.${e.mediaType.format}` : "+json"}`).join(","))), ["GET", "HEAD"].includes(t) ? n = dn(n, s) : "data" in s ? i = s.data : Object.keys(s).length && (i = s), !r["content-type"] && i !== void 0 && (r["content-type"] = "application/json; charset=utf-8"), ["PATCH", "PUT"].includes(t) && i === void 0 && (i = ""), Object.assign({
 		method: t,
 		url: n,
 		headers: r
 	}, i === void 0 ? null : { body: i }, e.request ? { request: e.request } : null);
 }
-function endpointWithDefaults(e, t, n) {
-	return parse$1(merge(e, t, n));
+function Tn(e, t, n) {
+	return wn(un(e, t, n));
 }
-function withDefaults$2(e, t) {
-	let n = merge(e, t), r = endpointWithDefaults.bind(null, n);
+function En(e, t) {
+	let n = un(e, t), r = Tn.bind(null, n);
 	return Object.assign(r, {
 		DEFAULTS: n,
-		defaults: withDefaults$2.bind(null, n),
-		merge: merge.bind(null, n),
-		parse: parse$1
+		defaults: En.bind(null, n),
+		merge: un.bind(null, n),
+		parse: wn
 	});
 }
-var endpoint = withDefaults$2(null, DEFAULTS), import_fast_content_type_parse = (/* @__PURE__ */ __commonJSMin(((e, t) => {
+var Dn = En(null, an), On = (/* @__PURE__ */ G(((e, t) => {
 	var n = function() {};
 	n.prototype = Object.create(null);
+	/**
+	* RegExp to match *( ";" parameter ) in RFC 7231 sec 3.1.1.1
+	*
+	* parameter     = token "=" ( token / quoted-string )
+	* token         = 1*tchar
+	* tchar         = "!" / "#" / "$" / "%" / "&" / "'" / "*"
+	*               / "+" / "-" / "." / "^" / "_" / "`" / "|" / "~"
+	*               / DIGIT / ALPHA
+	*               ; any VCHAR, except delimiters
+	* quoted-string = DQUOTE *( qdtext / quoted-pair ) DQUOTE
+	* qdtext        = HTAB / SP / %x21 / %x23-5B / %x5D-7E / obs-text
+	* obs-text      = %x80-FF
+	* quoted-pair   = "\" ( HTAB / SP / VCHAR / obs-text )
+	*/
 	var r = /; *([!#$%&'*+.^\w`|~-]+)=("(?:[\v\u0020\u0021\u0023-\u005b\u005d-\u007e\u0080-\u00ff]|\\[\v\u0020-\u00ff])*"|[!#$%&'*+.^\w`|~-]+) */gu, i = /\\([\v\u0020-\u00ff])/gu, a = /^[!#$%&'*+.^\w|~-]+\/[!#$%&'*+.^\w|~-]+$/u, o = {
 		type: "",
 		parameters: new n()
 	};
 	Object.freeze(o.parameters), Object.freeze(o);
+	/**
+	* Parse media type to object.
+	*
+	* @param {string|object} header
+	* @return {Object}
+	* @public
+	*/
 	function s(e) {
 		if (typeof e != "string") throw TypeError("argument header is required and must be a string");
 		let t = e.indexOf(";"), o = t === -1 ? e.trim() : e.slice(0, t).trim();
@@ -1379,10 +1788,19 @@ var endpoint = withDefaults$2(null, DEFAULTS), import_fast_content_type_parse =
 		parse: s,
 		safeParse: c
 	}, t.exports.parse = s, t.exports.safeParse = c, t.exports.defaultContentType = o;
-})))(), RequestError = class extends Error {
+})))(), kn = class extends Error {
 	name;
+	/**
+	* http status code
+	*/
 	status;
+	/**
+	* Request options that lead to the error.
+	*/
 	request;
+	/**
+	* Response object if a response was received
+	*/
 	response;
 	constructor(e, t, n) {
 		/* v8 ignore else -- @preserve -- Bug with vitest coverage where it sees an else branch that doesn't exist */
@@ -1390,19 +1808,19 @@ var endpoint = withDefaults$2(null, DEFAULTS), import_fast_content_type_parse =
 		let r = Object.assign({}, n.request);
 		n.request.headers.authorization && (r.headers = Object.assign({}, n.request.headers, { authorization: n.request.headers.authorization.replace(/(?<! ) .*$/, " [REDACTED]") })), r.url = r.url.replace(/\bclient_secret=\w+/g, "client_secret=[REDACTED]").replace(/\baccess_token=\w+/g, "access_token=[REDACTED]"), this.request = r;
 	}
-}, VERSION$6 = "10.0.7", defaults_default = { headers: { "user-agent": `octokit-request.js/${VERSION$6} ${getUserAgent()}` } };
-function isPlainObject(e) {
+}, An = "10.0.7", jn = { headers: { "user-agent": `octokit-request.js/${An} ${qt()}` } };
+function Mn(e) {
 	if (typeof e != "object" || !e || Object.prototype.toString.call(e) !== "[object Object]") return !1;
 	let t = Object.getPrototypeOf(e);
 	if (t === null) return !0;
 	let n = Object.prototype.hasOwnProperty.call(t, "constructor") && t.constructor;
 	return typeof n == "function" && n instanceof n && Function.prototype.call(n) === Function.prototype.call(e);
 }
-var noop$1 = () => "";
-async function fetchWrapper(e) {
+var Nn = () => "";
+async function Pn(e) {
 	let t = e.request?.fetch || globalThis.fetch;
 	if (!t) throw Error("fetch is not set. Please pass a fetch implementation as new Octokit({ request: { fetch }}). Learn more at https://github.com/octokit/octokit.js/#fetch-missing");
-	let n = e.request?.log || console, r = e.request?.parseSuccessResponseBody !== !1, i = isPlainObject(e.body) || Array.isArray(e.body) ? JSON.stringify(e.body) : e.body, a = Object.fromEntries(Object.entries(e.headers).map(([e, t]) => [e, String(t)])), o;
+	let n = e.request?.log || console, r = e.request?.parseSuccessResponseBody !== !1, i = Mn(e.body) || Array.isArray(e.body) ? JSON.stringify(e.body) : e.body, a = Object.fromEntries(Object.entries(e.headers).map(([e, t]) => [e, String(t)])), o;
 	try {
 		o = await t(e.url, {
 			method: e.method,
@@ -1418,7 +1836,7 @@ async function fetchWrapper(e) {
 			if (t.name === "AbortError") throw t.status = 500, t;
 			n = t.message, t.name === "TypeError" && "cause" in t && (t.cause instanceof Error ? n = t.cause.message : typeof t.cause == "string" && (n = t.cause));
 		}
-		let r = new RequestError(n, 500, { request: e });
+		let r = new kn(n, 500, { request: e });
 		throw r.cause = t, r;
 	}
 	let s = o.status, c = o.url, l = {};
@@ -1436,42 +1854,42 @@ async function fetchWrapper(e) {
 	if (s === 204 || s === 205) return u;
 	if (e.method === "HEAD") {
 		if (s < 400) return u;
-		throw new RequestError(o.statusText, s, {
+		throw new kn(o.statusText, s, {
 			response: u,
 			request: e
 		});
 	}
-	if (s === 304) throw u.data = await getResponseData(o), new RequestError("Not modified", s, {
+	if (s === 304) throw u.data = await Fn(o), new kn("Not modified", s, {
 		response: u,
 		request: e
 	});
-	if (s >= 400) throw u.data = await getResponseData(o), new RequestError(toErrorMessage(u.data), s, {
+	if (s >= 400) throw u.data = await Fn(o), new kn(Ln(u.data), s, {
 		response: u,
 		request: e
 	});
-	return u.data = r ? await getResponseData(o) : o.body, u;
+	return u.data = r ? await Fn(o) : o.body, u;
 }
-async function getResponseData(e) {
+async function Fn(e) {
 	let t = e.headers.get("content-type");
-	if (!t) return e.text().catch(noop$1);
-	let n = (0, import_fast_content_type_parse.safeParse)(t);
-	if (isJSONResponse(n)) {
+	if (!t) return e.text().catch(Nn);
+	let n = (0, On.safeParse)(t);
+	if (In(n)) {
 		let t = "";
 		try {
 			return t = await e.text(), JSON.parse(t);
 		} catch {
 			return t;
 		}
-	} else if (n.type.startsWith("text/") || n.parameters.charset?.toLowerCase() === "utf-8") return e.text().catch(noop$1);
+	} else if (n.type.startsWith("text/") || n.parameters.charset?.toLowerCase() === "utf-8") return e.text().catch(Nn);
 	else return e.arrayBuffer().catch(
 		/* v8 ignore next -- @preserve */
 		() => /* @__PURE__ */ new ArrayBuffer(0)
 	);
 }
-function isJSONResponse(e) {
+function In(e) {
 	return e.type === "application/json" || e.type === "application/scim+json";
 }
-function toErrorMessage(e) {
+function Ln(e) {
 	if (typeof e == "string") return e;
 	if (e instanceof ArrayBuffer) return "Unknown error";
 	if ("message" in e) {
@@ -1480,33 +1898,33 @@ function toErrorMessage(e) {
 	}
 	return `Unknown error: ${JSON.stringify(e)}`;
 }
-function withDefaults$1(e, t) {
+function Rn(e, t) {
 	let n = e.defaults(t);
 	return Object.assign(function(e, t) {
 		let r = n.merge(e, t);
-		if (!r.request || !r.request.hook) return fetchWrapper(n.parse(r));
-		let i = (e, t) => fetchWrapper(n.parse(n.merge(e, t)));
+		if (!r.request || !r.request.hook) return Pn(n.parse(r));
+		let i = (e, t) => Pn(n.parse(n.merge(e, t)));
 		return Object.assign(i, {
 			endpoint: n,
-			defaults: withDefaults$1.bind(null, n)
+			defaults: Rn.bind(null, n)
 		}), r.request.hook(i, r);
 	}, {
 		endpoint: n,
-		defaults: withDefaults$1.bind(null, n)
+		defaults: Rn.bind(null, n)
 	});
 }
-var request = withDefaults$1(endpoint, defaults_default), VERSION$5 = "0.0.0-development";
-function _buildMessageForResponseErrors(e) {
+var zn = Rn(Dn, jn), Bn = "0.0.0-development";
+function Vn(e) {
 	return "Request failed due to following response errors:\n" + e.errors.map((e) => ` - ${e.message}`).join("\n");
 }
-var GraphqlResponseError = class extends Error {
+var Hn = class extends Error {
 	constructor(e, t, n) {
-		super(_buildMessageForResponseErrors(n)), this.request = e, this.headers = t, this.response = n, this.errors = n.errors, this.data = n.data, Error.captureStackTrace && Error.captureStackTrace(this, this.constructor);
+		super(Vn(n)), this.request = e, this.headers = t, this.response = n, this.errors = n.errors, this.data = n.data, Error.captureStackTrace && Error.captureStackTrace(this, this.constructor);
 	}
 	name = "GraphqlResponseError";
 	errors;
 	data;
-}, NON_VARIABLE_OPTIONS = [
+}, Un = [
 	"method",
 	"baseUrl",
 	"url",
@@ -1515,70 +1933,70 @@ var GraphqlResponseError = class extends Error {
 	"query",
 	"mediaType",
 	"operationName"
-], FORBIDDEN_VARIABLE_OPTIONS = [
+], Wn = [
 	"query",
 	"method",
 	"url"
-], GHES_V3_SUFFIX_REGEX = /\/api\/v3\/?$/;
-function graphql(e, t, n) {
+], Gn = /\/api\/v3\/?$/;
+function Kn(e, t, n) {
 	if (n) {
 		if (typeof t == "string" && "query" in n) return Promise.reject(/* @__PURE__ */ Error("[@octokit/graphql] \"query\" cannot be used as variable name"));
-		for (let e in n) if (FORBIDDEN_VARIABLE_OPTIONS.includes(e)) return Promise.reject(/* @__PURE__ */ Error(`[@octokit/graphql] "${e}" cannot be used as variable name`));
+		for (let e in n) if (Wn.includes(e)) return Promise.reject(/* @__PURE__ */ Error(`[@octokit/graphql] "${e}" cannot be used as variable name`));
 	}
-	let r = typeof t == "string" ? Object.assign({ query: t }, n) : t, i = Object.keys(r).reduce((e, t) => NON_VARIABLE_OPTIONS.includes(t) ? (e[t] = r[t], e) : (e.variables ||= {}, e.variables[t] = r[t], e), {}), a = r.baseUrl || e.endpoint.DEFAULTS.baseUrl;
-	return GHES_V3_SUFFIX_REGEX.test(a) && (i.url = a.replace(GHES_V3_SUFFIX_REGEX, "/api/graphql")), e(i).then((e) => {
+	let r = typeof t == "string" ? Object.assign({ query: t }, n) : t, i = Object.keys(r).reduce((e, t) => Un.includes(t) ? (e[t] = r[t], e) : (e.variables ||= {}, e.variables[t] = r[t], e), {}), a = r.baseUrl || e.endpoint.DEFAULTS.baseUrl;
+	return Gn.test(a) && (i.url = a.replace(Gn, "/api/graphql")), e(i).then((e) => {
 		if (e.data.errors) {
 			let t = {};
 			for (let n of Object.keys(e.headers)) t[n] = e.headers[n];
-			throw new GraphqlResponseError(i, t, e.data);
+			throw new Hn(i, t, e.data);
 		}
 		return e.data.data;
 	});
 }
-function withDefaults(e, t) {
+function qn(e, t) {
 	let n = e.defaults(t);
-	return Object.assign((e, t) => graphql(n, e, t), {
-		defaults: withDefaults.bind(null, n),
+	return Object.assign((e, t) => Kn(n, e, t), {
+		defaults: qn.bind(null, n),
 		endpoint: n.endpoint
 	});
 }
-withDefaults(request, {
-	headers: { "user-agent": `octokit-graphql.js/${VERSION$5} ${getUserAgent()}` },
+qn(zn, {
+	headers: { "user-agent": `octokit-graphql.js/${Bn} ${qt()}` },
 	method: "POST",
 	url: "/graphql"
 });
-function withCustomRequest(e) {
-	return withDefaults(e, {
+function Jn(e) {
+	return qn(e, {
 		method: "POST",
 		url: "/graphql"
 	});
 }
-var b64url = "(?:[a-zA-Z0-9_-]+)", sep = "\\.", jwtRE = RegExp(`^${b64url}${sep}${b64url}${sep}${b64url}$`), isJWT = jwtRE.test.bind(jwtRE);
-async function auth(e) {
-	let t = isJWT(e), n = e.startsWith("v1.") || e.startsWith("ghs_"), r = e.startsWith("ghu_");
+var Yn = "(?:[a-zA-Z0-9_-]+)", Xn = "\\.", Zn = RegExp(`^${Yn}${Xn}${Yn}${Xn}${Yn}$`), Qn = Zn.test.bind(Zn);
+async function $n(e) {
+	let t = Qn(e), n = e.startsWith("v1.") || e.startsWith("ghs_"), r = e.startsWith("ghu_");
 	return {
 		type: "token",
 		token: e,
 		tokenType: t ? "app" : n ? "installation" : r ? "user-to-server" : "oauth"
 	};
 }
-function withAuthorizationPrefix(e) {
+function er(e) {
 	return e.split(/\./).length === 3 ? `bearer ${e}` : `token ${e}`;
 }
-async function hook(e, t, n, r) {
+async function tr(e, t, n, r) {
 	let i = t.endpoint.merge(n, r);
-	return i.headers.authorization = withAuthorizationPrefix(e), t(i);
+	return i.headers.authorization = er(e), t(i);
 }
-var createTokenAuth = function(e) {
+var nr = function(e) {
 	if (!e) throw Error("[@octokit/auth-token] No token passed to createTokenAuth");
 	if (typeof e != "string") throw Error("[@octokit/auth-token] Token passed to createTokenAuth is not a string");
-	return e = e.replace(/^(token|bearer) +/i, ""), Object.assign(auth.bind(null, e), { hook: hook.bind(null, e) });
-}, VERSION$4 = "7.0.6", noop = () => {}, consoleWarn = console.warn.bind(console), consoleError = console.error.bind(console);
-function createLogger(e = {}) {
-	return typeof e.debug != "function" && (e.debug = noop), typeof e.info != "function" && (e.info = noop), typeof e.warn != "function" && (e.warn = consoleWarn), typeof e.error != "function" && (e.error = consoleError), e;
+	return e = e.replace(/^(token|bearer) +/i, ""), Object.assign($n.bind(null, e), { hook: tr.bind(null, e) });
+}, rr = "7.0.6", ir = () => {}, ar = console.warn.bind(console), or = console.error.bind(console);
+function sr(e = {}) {
+	return typeof e.debug != "function" && (e.debug = ir), typeof e.info != "function" && (e.info = ir), typeof e.warn != "function" && (e.warn = ar), typeof e.error != "function" && (e.error = or), e;
 }
-var userAgentTrail = `octokit-core.js/${VERSION$4} ${getUserAgent()}`, Octokit$1 = class {
-	static VERSION = VERSION$4;
+var cr = `octokit-core.js/${rr} ${qt()}`, lr = class {
+	static VERSION = rr;
 	static defaults(e) {
 		return class extends this {
 			constructor(...t) {
@@ -1592,6 +2010,12 @@ var userAgentTrail = `octokit-core.js/${VERSION$4} ${getUserAgent()}`, Octokit$1
 		};
 	}
 	static plugins = [];
+	/**
+	* Attach a plugin (or many) to your Octokit instance.
+	*
+	* @example
+	* const API = Octokit.plugin(plugin1, plugin2, plugin3, ...)
+	*/
 	static plugin(...e) {
 		let t = this.plugins;
 		return class extends this {
@@ -1599,8 +2023,8 @@ var userAgentTrail = `octokit-core.js/${VERSION$4} ${getUserAgent()}`, Octokit$1
 		};
 	}
 	constructor(e = {}) {
-		let t = new before_after_hook_default.Collection(), n = {
-			baseUrl: request.endpoint.DEFAULTS.baseUrl,
+		let t = new nn.Collection(), n = {
+			baseUrl: zn.endpoint.DEFAULTS.baseUrl,
 			headers: {},
 			request: Object.assign({}, e.request, { hook: t.bind(null, "request") }),
 			mediaType: {
@@ -1608,7 +2032,7 @@ var userAgentTrail = `octokit-core.js/${VERSION$4} ${getUserAgent()}`, Octokit$1
 				format: ""
 			}
 		};
-		if (n.headers["user-agent"] = e.userAgent ? `${e.userAgent} ${userAgentTrail}` : userAgentTrail, e.baseUrl && (n.baseUrl = e.baseUrl), e.previews && (n.mediaType.previews = e.previews), e.timeZone && (n.headers["time-zone"] = e.timeZone), this.request = request.defaults(n), this.graphql = withCustomRequest(this.request).defaults(n), this.log = createLogger(e.log), this.hook = t, e.authStrategy) {
+		if (n.headers["user-agent"] = e.userAgent ? `${e.userAgent} ${cr}` : cr, e.baseUrl && (n.baseUrl = e.baseUrl), e.previews && (n.mediaType.previews = e.previews), e.timeZone && (n.headers["time-zone"] = e.timeZone), this.request = zn.defaults(n), this.graphql = Jn(this.request).defaults(n), this.log = sr(e.log), this.hook = t, e.authStrategy) {
 			let { authStrategy: n, ...r } = e, i = n(Object.assign({
 				request: this.request,
 				log: this.log,
@@ -1618,7 +2042,7 @@ var userAgentTrail = `octokit-core.js/${VERSION$4} ${getUserAgent()}`, Octokit$1
 			t.wrap("request", i.hook), this.auth = i;
 		} else if (!e.auth) this.auth = async () => ({ type: "unauthenticated" });
 		else {
-			let n = createTokenAuth(e.auth);
+			let n = nr(e.auth);
 			t.wrap("request", n.hook), this.auth = n;
 		}
 		let r = this.constructor;
@@ -1629,8 +2053,8 @@ var userAgentTrail = `octokit-core.js/${VERSION$4} ${getUserAgent()}`, Octokit$1
 	log;
 	hook;
 	auth;
-}, VERSION$3 = "6.0.0";
-function requestLog(e) {
+}, ur = "6.0.0";
+function dr(e) {
 	e.hook.wrap("request", (t, n) => {
 		e.log.debug("request", n);
 		let r = Date.now(), i = e.request.endpoint.parse(n), a = i.url.replace(n.baseUrl, "");
@@ -1643,9 +2067,9 @@ function requestLog(e) {
 		});
 	});
 }
-requestLog.VERSION = VERSION$3;
-var VERSION$2 = "0.0.0-development";
-function normalizePaginatedListResponse(e) {
+dr.VERSION = ur;
+var fr = "0.0.0-development";
+function pr(e) {
 	if (!e.data) return {
 		...e,
 		data: []
@@ -1656,12 +2080,12 @@ function normalizePaginatedListResponse(e) {
 	let a = Object.keys(e.data)[0];
 	return e.data = e.data[a], t !== void 0 && (e.data.incomplete_results = t), n !== void 0 && (e.data.repository_selection = n), e.data.total_count = r, e.data.total_commits = i, e;
 }
-function iterator(e, t, n) {
+function mr(e, t, n) {
 	let r = typeof t == "function" ? t.endpoint(n) : e.request.endpoint(t, n), i = typeof t == "function" ? t : e.request, a = r.method, o = r.headers, s = r.url;
 	return { [Symbol.asyncIterator]: () => ({ async next() {
 		if (!s) return { done: !0 };
 		try {
-			let e = normalizePaginatedListResponse(await i({
+			let e = pr(await i({
 				method: a,
 				url: s,
 				headers: o
@@ -1681,25 +2105,25 @@ function iterator(e, t, n) {
 		}
 	} }) };
 }
-function paginate(e, t, n, r) {
-	return typeof n == "function" && (r = n, n = void 0), gather(e, [], iterator(e, t, n)[Symbol.asyncIterator](), r);
+function hr(e, t, n, r) {
+	return typeof n == "function" && (r = n, n = void 0), gr(e, [], mr(e, t, n)[Symbol.asyncIterator](), r);
 }
-function gather(e, t, n, r) {
+function gr(e, t, n, r) {
 	return n.next().then((i) => {
 		if (i.done) return t;
 		let a = !1;
 		function o() {
 			a = !0;
 		}
-		return t = t.concat(r ? r(i.value, o) : i.value.data), a ? t : gather(e, t, n, r);
+		return t = t.concat(r ? r(i.value, o) : i.value.data), a ? t : gr(e, t, n, r);
 	});
 }
-Object.assign(paginate, { iterator });
-function paginateRest(e) {
-	return { paginate: Object.assign(paginate.bind(null, e), { iterator: iterator.bind(null, e) }) };
+Object.assign(hr, { iterator: mr });
+function _r(e) {
+	return { paginate: Object.assign(hr.bind(null, e), { iterator: mr.bind(null, e) }) };
 }
-paginateRest.VERSION = VERSION$2;
-var VERSION$1 = "17.0.0", endpoints_default = {
+_r.VERSION = fr;
+var vr = "17.0.0", yr = {
 	actions: {
 		addCustomLabelsToSelfHostedRunnerForOrg: ["POST /orgs/{org}/actions/runners/{runner_id}/labels"],
 		addCustomLabelsToSelfHostedRunnerForRepo: ["POST /repos/{owner}/{repo}/actions/runners/{runner_id}/labels"],
@@ -2990,22 +3414,22 @@ var VERSION$1 = "17.0.0", endpoints_default = {
 		unfollow: ["DELETE /user/following/{username}"],
 		updateAuthenticated: ["PATCH /user"]
 	}
-}, endpointMethodsMap = /* @__PURE__ */ new Map();
-for (let [e, t] of Object.entries(endpoints_default)) for (let [n, r] of Object.entries(t)) {
+}, $ = /* @__PURE__ */ new Map();
+for (let [e, t] of Object.entries(yr)) for (let [n, r] of Object.entries(t)) {
 	let [t, i, a] = r, [o, s] = t.split(/ /), c = Object.assign({
 		method: o,
 		url: s
 	}, i);
-	endpointMethodsMap.has(e) || endpointMethodsMap.set(e, /* @__PURE__ */ new Map()), endpointMethodsMap.get(e).set(n, {
+	$.has(e) || $.set(e, /* @__PURE__ */ new Map()), $.get(e).set(n, {
 		scope: e,
 		methodName: n,
 		endpointDefaults: c,
 		decorations: a
 	});
 }
-var handler = {
+var br = {
 	has({ scope: e }, t) {
-		return endpointMethodsMap.get(e).has(t);
+		return $.get(e).has(t);
 	},
 	getOwnPropertyDescriptor(e, t) {
 		return {
@@ -3022,29 +3446,29 @@ var handler = {
 		return delete e.cache[t], !0;
 	},
 	ownKeys({ scope: e }) {
-		return [...endpointMethodsMap.get(e).keys()];
+		return [...$.get(e).keys()];
 	},
 	set(e, t, n) {
 		return e.cache[t] = n;
 	},
 	get({ octokit: e, scope: t, cache: n }, r) {
 		if (n[r]) return n[r];
-		let i = endpointMethodsMap.get(t).get(r);
+		let i = $.get(t).get(r);
 		if (!i) return;
 		let { endpointDefaults: a, decorations: o } = i;
-		return o ? n[r] = decorate(e, t, r, a, o) : n[r] = e.request.defaults(a), n[r];
+		return o ? n[r] = Sr(e, t, r, a, o) : n[r] = e.request.defaults(a), n[r];
 	}
 };
-function endpointsToMethods(e) {
+function xr(e) {
 	let t = {};
-	for (let n of endpointMethodsMap.keys()) t[n] = new Proxy({
+	for (let n of $.keys()) t[n] = new Proxy({
 		octokit: e,
 		scope: n,
 		cache: {}
-	}, handler);
+	}, br);
 	return t;
 }
-function decorate(e, t, n, r, i) {
+function Sr(e, t, n, r, i) {
 	let a = e.request.defaults(r);
 	function o(...r) {
 		let o = a.endpoint.merge(...r);
@@ -3065,19 +3489,19 @@ function decorate(e, t, n, r, i) {
 	}
 	return Object.assign(o, a);
 }
-function restEndpointMethods(e) {
-	return { rest: endpointsToMethods(e) };
+function Cr(e) {
+	return { rest: xr(e) };
 }
-restEndpointMethods.VERSION = VERSION$1;
-function legacyRestEndpointMethods(e) {
-	let t = endpointsToMethods(e);
+Cr.VERSION = vr;
+function wr(e) {
+	let t = xr(e);
 	return {
 		...t,
 		rest: t
 	};
 }
-legacyRestEndpointMethods.VERSION = VERSION$1;
-var Octokit = Octokit$1.plugin(requestLog, legacyRestEndpointMethods, paginateRest).defaults({ userAgent: "octokit-rest.js/22.0.1" }), _40_github_default = new class extends PluginInstaller {
+wr.VERSION = vr;
+var Tr = lr.plugin(dr, wr, _r).defaults({ userAgent: "octokit-rest.js/22.0.1" }), Er = new class extends bt {
 	description = {
 		title: "通过Github安装插件",
 		description: "输入形如: \"gh:owner/repo\"的内容"
@@ -3085,17 +3509,17 @@ var Octokit = Octokit$1.plugin(requestLog, legacyRestEndpointMethods, paginateRe
 	name = "github";
 	async installer(e) {
 		try {
-			var t = useConfig().$load(appConfig).value.githubToken;
+			var t = nt().$load(tt).value.githubToken;
 		} catch (e) {
 			console.error("fail to get github token", e);
 			var t = "";
 		}
-		let n = new Octokit({ auth: isEmpty(t) ? void 0 : t }), [r, i] = e.replace(/^gh:/, "").split("/"), { data: a } = await n.rest.repos.getLatestRelease({
+		let n = new Tr({ auth: Ae(t) ? void 0 : t }), [r, i] = e.replace(/^gh:/, "").split("/"), { data: a } = await n.rest.repos.getLatestRelease({
 			owner: r,
 			repo: i
 		}), o = a.assets[0];
 		if (!o) throw Error("未找到资源");
-		let { data: s } = await axios.request({
+		let { data: s } = await W.request({
 			url: o.browser_download_url,
 			responseType: "blob"
 		});
@@ -3110,7 +3534,29 @@ var Octokit = Octokit$1.plugin(requestLog, legacyRestEndpointMethods, paginateRe
 	isMatched(e) {
 		return e.startsWith("gh:") && e.split("/").length === 2;
 	}
-}(), import_userscript_meta = (/* @__PURE__ */ __commonJSMin(((e) => {
+}(), Dr = "https://raw.githubusercontent.com/delta-comic/awesome-plugins/refs/heads/main/pages/", Or = new class extends bt {
+	description = {
+		title: "快速安装插件",
+		description: "输入形如: \"ap:jmcomic\"的内容"
+	};
+	name = "awesome";
+	async installer(e) {
+		let t = e.replace(/^ap:/, ""), { data: n } = await W.get(`${t}.json`, {
+			baseURL: Dr,
+			responseType: "json"
+		});
+		return n.download;
+	}
+	async install(e) {
+		return await this.installer(e);
+	}
+	async update(e) {
+		return await this.installer(e.installInput);
+	}
+	isMatched(e) {
+		return /^ap:[A-Za-z0-9\-\_]+$/.test(e);
+	}
+}(), kr = (/* @__PURE__ */ G(((e) => {
 	function t(e) {
 		return e === void 0;
 	}
@@ -3124,24 +3570,24 @@ var Octokit = Octokit$1.plugin(requestLog, legacyRestEndpointMethods, paginateRe
 		}, {});
 	}
 	e.parse = n;
-})))(), _1_userscript_default = new class extends PluginLoader {
+})))(), Ar = new class extends xt {
 	name = "userscript";
 	async installDownload(e) {
-		let t = await e.text(), n = decodePluginMeta((0, import_userscript_meta.parse)(t)), r = await getPluginFsPath(n.name.id);
-		return await mkdir(r, { recursive: !0 }), await writeTextFile(await join(r, "us.js"), t, { create: !0 }), n;
+		let t = await e.text(), n = Pe((0, kr.parse)(t)), r = await yt(n.name.id);
+		return await Rt(r, { recursive: !0 }), await Wt(await Z(r, "us.js"), t, { create: !0 }), n;
 	}
 	canInstall(e) {
 		return e.name.endsWith(".js");
 	}
 	async load(e) {
-		let t = await readTextFile(await join(await getPluginFsPath(e.pluginName), "us.js")), n = t.lastIndexOf(";") + 1, r = new Blob([t.slice(0, n)], { type: "text/javascript" }), i = URL.createObjectURL(r), a = document.createElement("script");
+		let t = await Vt(await Z(await yt(e.pluginName), "us.js")), n = t.lastIndexOf(";") + 1, r = new Blob([t.slice(0, n)], { type: "text/javascript" }), i = URL.createObjectURL(r), a = document.createElement("script");
 		a.addEventListener("load", () => {
 			URL.revokeObjectURL(i);
 		}), a.addEventListener("error", (e) => {
 			throw URL.revokeObjectURL(i), e;
 		}), a.async = !0, a.src = i, document.body.appendChild(a);
 	}
-}(), import_jszip_min = (/* @__PURE__ */ __commonJSMin(((e, t) => {
+}(), jr = (/* @__PURE__ */ G(((e, t) => {
 	(function(n) {
 		typeof e == "object" && t !== void 0 ? t.exports = n() : typeof define == "function" && define.amd ? define([], n) : (typeof window < "u" ? window : typeof global < "u" ? global : typeof self < "u" ? self : this).JSZip = n();
 	})(function() {
@@ -3149,7 +3595,7 @@ var Octokit = Octokit$1.plugin(requestLog, legacyRestEndpointMethods, paginateRe
 			function i(o, s) {
 				if (!n[o]) {
 					if (!t[o]) {
-						var c = typeof __require == "function" && __require;
+						var c = typeof K == "function" && K;
 						if (!s && c) return c(o, !0);
 						if (a) return a(o, !0);
 						var l = /* @__PURE__ */ Error("Cannot find module '" + o + "'");
@@ -3163,7 +3609,7 @@ var Octokit = Octokit$1.plugin(requestLog, legacyRestEndpointMethods, paginateRe
 				}
 				return n[o].exports;
 			}
-			for (var a = typeof __require == "function" && __require, o = 0; o < r.length; o++) i(r[o]);
+			for (var a = typeof K == "function" && K, o = 0; o < r.length; o++) i(r[o]);
 			return i;
 		}({
 			1: [function(e, t, n) {
@@ -3292,25 +3738,25 @@ var Octokit = Octokit$1.plugin(requestLog, legacyRestEndpointMethods, paginateRe
 					return r;
 				}
 				function i(e, t, n, i, o, u) {
-					var d, f, p = e.file, m = e.compression, g = u !== s.utf8encode, _ = a.transformTo("string", u(p.name)), v = a.transformTo("string", s.utf8encode(p.name)), y = p.comment, b = a.transformTo("string", u(y)), x = a.transformTo("string", s.utf8encode(y)), S = v.length !== p.name.length, C = x.length !== y.length, w = "", T = "", E = "", D = p.dir, O = p.date, k = {
+					var d, f, p = e.file, m = e.compression, h = u !== s.utf8encode, g = a.transformTo("string", u(p.name)), _ = a.transformTo("string", s.utf8encode(p.name)), v = p.comment, y = a.transformTo("string", u(v)), b = a.transformTo("string", s.utf8encode(v)), x = _.length !== p.name.length, S = b.length !== v.length, C = "", w = "", T = "", E = p.dir, D = p.date, O = {
 						crc32: 0,
 						compressedSize: 0,
 						uncompressedSize: 0
 					};
-					t && !n || (k.crc32 = e.crc32, k.compressedSize = e.compressedSize, k.uncompressedSize = e.uncompressedSize);
-					var A = 0;
-					t && (A |= 8), g || !S && !C || (A |= 2048);
-					var j = 0, M = 0;
-					D && (j |= 16), o === "UNIX" ? (M = 798, j |= function(e, t) {
+					t && !n || (O.crc32 = e.crc32, O.compressedSize = e.compressedSize, O.uncompressedSize = e.uncompressedSize);
+					var k = 0;
+					t && (k |= 8), h || !x && !S || (k |= 2048);
+					var A = 0, j = 0;
+					E && (A |= 16), o === "UNIX" ? (j = 798, A |= function(e, t) {
 						var n = e;
 						return e || (n = t ? 16893 : 33204), (65535 & n) << 16;
-					}(p.unixPermissions, D)) : (M = 20, j |= function(e) {
+					}(p.unixPermissions, E)) : (j = 20, A |= function(e) {
 						return 63 & (e || 0);
-					}(p.dosPermissions)), d = O.getUTCHours(), d <<= 6, d |= O.getUTCMinutes(), d <<= 5, d |= O.getUTCSeconds() / 2, f = O.getUTCFullYear() - 1980, f <<= 4, f |= O.getUTCMonth() + 1, f <<= 5, f |= O.getUTCDate(), S && (T = r(1, 1) + r(c(_), 4) + v, w += "up" + r(T.length, 2) + T), C && (E = r(1, 1) + r(c(b), 4) + x, w += "uc" + r(E.length, 2) + E);
-					var N = "";
-					return N += "\n\0", N += r(A, 2), N += m.magic, N += r(d, 2), N += r(f, 2), N += r(k.crc32, 4), N += r(k.compressedSize, 4), N += r(k.uncompressedSize, 4), N += r(_.length, 2), N += r(w.length, 2), {
-						fileRecord: l.LOCAL_FILE_HEADER + N + _ + w,
-						dirRecord: l.CENTRAL_FILE_HEADER + r(M, 2) + N + r(b.length, 2) + "\0\0\0\0" + r(j, 4) + r(i, 4) + _ + w + b
+					}(p.dosPermissions)), d = D.getUTCHours(), d <<= 6, d |= D.getUTCMinutes(), d <<= 5, d |= D.getUTCSeconds() / 2, f = D.getUTCFullYear() - 1980, f <<= 4, f |= D.getUTCMonth() + 1, f <<= 5, f |= D.getUTCDate(), x && (w = r(1, 1) + r(c(g), 4) + _, C += "up" + r(w.length, 2) + w), S && (T = r(1, 1) + r(c(y), 4) + b, C += "uc" + r(T.length, 2) + T);
+					var M = "";
+					return M += "\n\0", M += r(k, 2), M += m.magic, M += r(d, 2), M += r(f, 2), M += r(O.crc32, 4), M += r(O.compressedSize, 4), M += r(O.uncompressedSize, 4), M += r(g.length, 2), M += r(C.length, 2), {
+						fileRecord: l.LOCAL_FILE_HEADER + M + g + C,
+						dirRecord: l.CENTRAL_FILE_HEADER + r(j, 2) + M + r(y.length, 2) + "\0\0\0\0" + r(A, 4) + r(i, 4) + g + C + y
 					};
 				}
 				var a = e("../utils"), o = e("../stream/GenericWorker"), s = e("../utf8"), c = e("../crc32"), l = e("../signature");
@@ -3567,27 +4013,27 @@ var Octokit = Octokit$1.plugin(requestLog, legacyRestEndpointMethods, paginateRe
 			15: [function(e, t, n) {
 				function r(e, t, n) {
 					var r, i = a.getTypeOf(t), s = a.extend(n || {}, c);
-					s.date = s.date || /* @__PURE__ */ new Date(), s.compression !== null && (s.compression = s.compression.toUpperCase()), typeof s.unixPermissions == "string" && (s.unixPermissions = parseInt(s.unixPermissions, 8)), s.unixPermissions && 16384 & s.unixPermissions && (s.dir = !0), s.dosPermissions && 16 & s.dosPermissions && (s.dir = !0), s.dir && (e = g(e)), s.createFolders && (r = m(e)) && _.call(this, r, !0);
+					s.date = s.date || /* @__PURE__ */ new Date(), s.compression !== null && (s.compression = s.compression.toUpperCase()), typeof s.unixPermissions == "string" && (s.unixPermissions = parseInt(s.unixPermissions, 8)), s.unixPermissions && 16384 & s.unixPermissions && (s.dir = !0), s.dosPermissions && 16 & s.dosPermissions && (s.dir = !0), s.dir && (e = h(e)), s.createFolders && (r = m(e)) && g.call(this, r, !0);
 					var d = i === "string" && !1 === s.binary && !1 === s.base64;
 					n && n.binary !== void 0 || (s.binary = !d), (t instanceof l && t.uncompressedSize === 0 || s.dir || !t || t.length === 0) && (s.base64 = !1, s.binary = !0, t = "", s.compression = "STORE", i = "string");
-					var v = null;
-					v = t instanceof l || t instanceof o ? t : f.isNode && f.isStream(t) ? new p(e, t) : a.prepareContent(e, t, s.binary, s.optimizedBinaryString, s.base64);
-					var y = new u(e, v, s);
-					this.files[e] = y;
+					var _ = null;
+					_ = t instanceof l || t instanceof o ? t : f.isNode && f.isStream(t) ? new p(e, t) : a.prepareContent(e, t, s.binary, s.optimizedBinaryString, s.base64);
+					var v = new u(e, _, s);
+					this.files[e] = v;
 				}
 				var i = e("./utf8"), a = e("./utils"), o = e("./stream/GenericWorker"), s = e("./stream/StreamHelper"), c = e("./defaults"), l = e("./compressedObject"), u = e("./zipObject"), d = e("./generate"), f = e("./nodejsUtils"), p = e("./nodejs/NodejsStreamInputAdapter"), m = function(e) {
 					e.slice(-1) === "/" && (e = e.substring(0, e.length - 1));
 					var t = e.lastIndexOf("/");
 					return 0 < t ? e.substring(0, t) : "";
-				}, g = function(e) {
+				}, h = function(e) {
 					return e.slice(-1) !== "/" && (e += "/"), e;
-				}, _ = function(e, t) {
-					return t = t === void 0 ? c.createFolders : t, e = g(e), this.files[e] || r.call(this, e, null, {
+				}, g = function(e, t) {
+					return t = t === void 0 ? c.createFolders : t, e = h(e), this.files[e] || r.call(this, e, null, {
 						dir: !0,
 						createFolders: t
 					}), this.files[e];
 				};
-				function v(e) {
+				function _(e) {
 					return Object.prototype.toString.call(e) === "[object RegExp]";
 				}
 				t.exports = {
@@ -3606,7 +4052,7 @@ var Octokit = Octokit$1.plugin(requestLog, legacyRestEndpointMethods, paginateRe
 					},
 					file: function(e, t, n) {
 						if (arguments.length !== 1) return e = this.root + e, r.call(this, e, t, n), this;
-						if (v(e)) {
+						if (_(e)) {
 							var i = e;
 							return this.filter(function(e, t) {
 								return !t.dir && i.test(e);
@@ -3617,10 +4063,10 @@ var Octokit = Octokit$1.plugin(requestLog, legacyRestEndpointMethods, paginateRe
 					},
 					folder: function(e) {
 						if (!e) return this;
-						if (v(e)) return this.filter(function(t, n) {
+						if (_(e)) return this.filter(function(t, n) {
 							return n.dir && e.test(t);
 						});
-						var t = this.root + e, n = _.call(this, t), r = this.clone();
+						var t = this.root + e, n = g.call(this, t), r = this.clone();
 						return r.root = n.name, r;
 					},
 					remove: function(e) {
@@ -4775,12 +5221,12 @@ var Octokit = Octokit$1.plugin(requestLog, legacyRestEndpointMethods, paginateRe
 					return n.result;
 				}
 				d.prototype.push = function(e, t) {
-					var n, s, c, l, d, f, p = this.strm, m = this.options.chunkSize, g = this.options.dictionary, _ = !1;
+					var n, s, c, l, d, f, p = this.strm, m = this.options.chunkSize, h = this.options.dictionary, g = !1;
 					if (this.ended) return !1;
 					s = t === ~~t ? t : !0 === t ? o.Z_FINISH : o.Z_NO_FLUSH, typeof e == "string" ? p.input = a.binstring2buf(e) : u.call(e) === "[object ArrayBuffer]" ? p.input = new Uint8Array(e) : p.input = e, p.next_in = 0, p.avail_in = p.input.length;
 					do {
-						if (p.avail_out === 0 && (p.output = new i.Buf8(m), p.next_out = 0, p.avail_out = m), (n = r.inflate(p, o.Z_NO_FLUSH)) === o.Z_NEED_DICT && g && (f = typeof g == "string" ? a.string2buf(g) : u.call(g) === "[object ArrayBuffer]" ? new Uint8Array(g) : g, n = r.inflateSetDictionary(this.strm, f)), n === o.Z_BUF_ERROR && !0 === _ && (n = o.Z_OK, _ = !1), n !== o.Z_STREAM_END && n !== o.Z_OK) return this.onEnd(n), !(this.ended = !0);
-						p.next_out && (p.avail_out !== 0 && n !== o.Z_STREAM_END && (p.avail_in !== 0 || s !== o.Z_FINISH && s !== o.Z_SYNC_FLUSH) || (this.options.to === "string" ? (c = a.utf8border(p.output, p.next_out), l = p.next_out - c, d = a.buf2string(p.output, c), p.next_out = l, p.avail_out = m - l, l && i.arraySet(p.output, p.output, c, l, 0), this.onData(d)) : this.onData(i.shrinkBuf(p.output, p.next_out)))), p.avail_in === 0 && p.avail_out === 0 && (_ = !0);
+						if (p.avail_out === 0 && (p.output = new i.Buf8(m), p.next_out = 0, p.avail_out = m), (n = r.inflate(p, o.Z_NO_FLUSH)) === o.Z_NEED_DICT && h && (f = typeof h == "string" ? a.string2buf(h) : u.call(h) === "[object ArrayBuffer]" ? new Uint8Array(h) : h, n = r.inflateSetDictionary(this.strm, f)), n === o.Z_BUF_ERROR && !0 === g && (n = o.Z_OK, g = !1), n !== o.Z_STREAM_END && n !== o.Z_OK) return this.onEnd(n), !(this.ended = !0);
+						p.next_out && (p.avail_out !== 0 && n !== o.Z_STREAM_END && (p.avail_in !== 0 || s !== o.Z_FINISH && s !== o.Z_SYNC_FLUSH) || (this.options.to === "string" ? (c = a.utf8border(p.output, p.next_out), l = p.next_out - c, d = a.buf2string(p.output, c), p.next_out = l, p.avail_out = m - l, l && i.arraySet(p.output, p.output, c, l, 0), this.onData(d)) : this.onData(i.shrinkBuf(p.output, p.next_out)))), p.avail_in === 0 && p.avail_out === 0 && (g = !0);
 					} while ((0 < p.avail_in || p.avail_out === 0) && n !== o.Z_STREAM_END);
 					return n === o.Z_STREAM_END && (s = o.Z_FINISH), s === o.Z_FINISH ? (n = r.inflateEnd(this.strm), this.onEnd(n), this.ended = !0, n === o.Z_OK) : s !== o.Z_SYNC_FLUSH || (this.onEnd(o.Z_OK), !(p.avail_out = 0));
 				}, d.prototype.onData = function(e) {
@@ -4936,38 +5382,38 @@ var Octokit = Octokit$1.plugin(requestLog, legacyRestEndpointMethods, paginateRe
 				};
 			}, {}],
 			46: [function(e, t, n) {
-				var r, i = e("../utils/common"), a = e("./trees"), o = e("./adler32"), s = e("./crc32"), c = e("./messages"), l = 0, u = 4, d = 0, f = -2, p = -1, m = 4, g = 2, _ = 8, v = 9, y = 286, b = 30, x = 19, S = 2 * y + 1, C = 15, w = 3, T = 258, E = T + w + 1, D = 42, O = 113, k = 1, A = 2, j = 3, M = 4;
-				function N(e, t) {
+				var r, i = e("../utils/common"), a = e("./trees"), o = e("./adler32"), s = e("./crc32"), c = e("./messages"), l = 0, u = 4, d = 0, f = -2, p = -1, m = 4, h = 2, g = 8, _ = 9, v = 286, y = 30, b = 19, x = 2 * v + 1, S = 15, C = 3, w = 258, T = w + C + 1, E = 42, D = 113, O = 1, k = 2, A = 3, j = 4;
+				function M(e, t) {
 					return e.msg = c[t], t;
 				}
-				function P(e) {
+				function N(e) {
 					return (e << 1) - (4 < e ? 9 : 0);
 				}
-				function F(e) {
+				function P(e) {
 					for (var t = e.length; 0 <= --t;) e[t] = 0;
 				}
-				function I(e) {
+				function F(e) {
 					var t = e.state, n = t.pending;
 					n > e.avail_out && (n = e.avail_out), n !== 0 && (i.arraySet(e.output, t.pending_buf, t.pending_out, n, e.next_out), e.next_out += n, t.pending_out += n, e.total_out += n, e.avail_out -= n, t.pending -= n, t.pending === 0 && (t.pending_out = 0));
 				}
-				function L(e, t) {
-					a._tr_flush_block(e, 0 <= e.block_start ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, I(e.strm);
+				function I(e, t) {
+					a._tr_flush_block(e, 0 <= e.block_start ? e.block_start : -1, e.strstart - e.block_start, t), e.block_start = e.strstart, F(e.strm);
 				}
-				function R(e, t) {
+				function L(e, t) {
 					e.pending_buf[e.pending++] = t;
 				}
-				function z(e, t) {
+				function R(e, t) {
 					e.pending_buf[e.pending++] = t >>> 8 & 255, e.pending_buf[e.pending++] = 255 & t;
 				}
-				function B(e, t) {
-					var n, r, i = e.max_chain_length, a = e.strstart, o = e.prev_length, s = e.nice_match, c = e.strstart > e.w_size - E ? e.strstart - (e.w_size - E) : 0, l = e.window, u = e.w_mask, d = e.prev, f = e.strstart + T, p = l[a + o - 1], m = l[a + o];
+				function z(e, t) {
+					var n, r, i = e.max_chain_length, a = e.strstart, o = e.prev_length, s = e.nice_match, c = e.strstart > e.w_size - T ? e.strstart - (e.w_size - T) : 0, l = e.window, u = e.w_mask, d = e.prev, f = e.strstart + w, p = l[a + o - 1], m = l[a + o];
 					e.prev_length >= e.good_match && (i >>= 2), s > e.lookahead && (s = e.lookahead);
 					do
 						if (l[(n = t) + o] === m && l[n + o - 1] === p && l[n] === l[a] && l[++n] === l[a + 1]) {
 							a += 2, n++;
 							do							;
 while (l[++a] === l[++n] && l[++a] === l[++n] && l[++a] === l[++n] && l[++a] === l[++n] && l[++a] === l[++n] && l[++a] === l[++n] && l[++a] === l[++n] && l[++a] === l[++n] && a < f);
-							if (r = T - (f - a), a = f - T, o < r) {
+							if (r = w - (f - a), a = f - w, o < r) {
 								if (e.match_start = t, s <= (o = r)) break;
 								p = l[a + o - 1], m = l[a + o];
 							}
@@ -4975,179 +5421,179 @@ while (l[++a] === l[++n] && l[++a] === l[++n] && l[++a] === l[++n] && l[++a] ===
 					while ((t = d[t & u]) > c && --i != 0);
 					return o <= e.lookahead ? o : e.lookahead;
 				}
-				function V(e) {
+				function B(e) {
 					var t, n, r, a, c, l, u, d, f, p, m = e.w_size;
 					do {
-						if (a = e.window_size - e.lookahead - e.strstart, e.strstart >= m + (m - E)) {
+						if (a = e.window_size - e.lookahead - e.strstart, e.strstart >= m + (m - T)) {
 							for (i.arraySet(e.window, e.window, m, m, 0), e.match_start -= m, e.strstart -= m, e.block_start -= m, t = n = e.hash_size; r = e.head[--t], e.head[t] = m <= r ? r - m : 0, --n;);
 							for (t = n = m; r = e.prev[--t], e.prev[t] = m <= r ? r - m : 0, --n;);
 							a += m;
 						}
 						if (e.strm.avail_in === 0) break;
-						if (l = e.strm, u = e.window, d = e.strstart + e.lookahead, f = a, p = void 0, p = l.avail_in, f < p && (p = f), n = p === 0 ? 0 : (l.avail_in -= p, i.arraySet(u, l.input, l.next_in, p, d), l.state.wrap === 1 ? l.adler = o(l.adler, u, p, d) : l.state.wrap === 2 && (l.adler = s(l.adler, u, p, d)), l.next_in += p, l.total_in += p, p), e.lookahead += n, e.lookahead + e.insert >= w) for (c = e.strstart - e.insert, e.ins_h = e.window[c], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[c + 1]) & e.hash_mask; e.insert && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[c + w - 1]) & e.hash_mask, e.prev[c & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = c, c++, e.insert--, !(e.lookahead + e.insert < w)););
-					} while (e.lookahead < E && e.strm.avail_in !== 0);
+						if (l = e.strm, u = e.window, d = e.strstart + e.lookahead, f = a, p = void 0, p = l.avail_in, f < p && (p = f), n = p === 0 ? 0 : (l.avail_in -= p, i.arraySet(u, l.input, l.next_in, p, d), l.state.wrap === 1 ? l.adler = o(l.adler, u, p, d) : l.state.wrap === 2 && (l.adler = s(l.adler, u, p, d)), l.next_in += p, l.total_in += p, p), e.lookahead += n, e.lookahead + e.insert >= C) for (c = e.strstart - e.insert, e.ins_h = e.window[c], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[c + 1]) & e.hash_mask; e.insert && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[c + C - 1]) & e.hash_mask, e.prev[c & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = c, c++, e.insert--, !(e.lookahead + e.insert < C)););
+					} while (e.lookahead < T && e.strm.avail_in !== 0);
 				}
-				function H(e, t) {
+				function V(e, t) {
 					for (var n, r;;) {
-						if (e.lookahead < E) {
-							if (V(e), e.lookahead < E && t === l) return k;
+						if (e.lookahead < T) {
+							if (B(e), e.lookahead < T && t === l) return O;
 							if (e.lookahead === 0) break;
 						}
-						if (n = 0, e.lookahead >= w && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + w - 1]) & e.hash_mask, n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), n !== 0 && e.strstart - n <= e.w_size - E && (e.match_length = B(e, n)), e.match_length >= w) if (r = a._tr_tally(e, e.strstart - e.match_start, e.match_length - w), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= w) {
-							for (e.match_length--; e.strstart++, e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + w - 1]) & e.hash_mask, n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart, --e.match_length != 0;);
+						if (n = 0, e.lookahead >= C && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + C - 1]) & e.hash_mask, n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), n !== 0 && e.strstart - n <= e.w_size - T && (e.match_length = z(e, n)), e.match_length >= C) if (r = a._tr_tally(e, e.strstart - e.match_start, e.match_length - C), e.lookahead -= e.match_length, e.match_length <= e.max_lazy_match && e.lookahead >= C) {
+							for (e.match_length--; e.strstart++, e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + C - 1]) & e.hash_mask, n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart, --e.match_length != 0;);
 							e.strstart++;
 						} else e.strstart += e.match_length, e.match_length = 0, e.ins_h = e.window[e.strstart], e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + 1]) & e.hash_mask;
 						else r = a._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++;
-						if (r && (L(e, !1), e.strm.avail_out === 0)) return k;
+						if (r && (I(e, !1), e.strm.avail_out === 0)) return O;
 					}
-					return e.insert = e.strstart < w - 1 ? e.strstart : w - 1, t === u ? (L(e, !0), e.strm.avail_out === 0 ? j : M) : e.last_lit && (L(e, !1), e.strm.avail_out === 0) ? k : A;
+					return e.insert = e.strstart < C - 1 ? e.strstart : C - 1, t === u ? (I(e, !0), e.strm.avail_out === 0 ? A : j) : e.last_lit && (I(e, !1), e.strm.avail_out === 0) ? O : k;
 				}
-				function U(e, t) {
+				function H(e, t) {
 					for (var n, r, i;;) {
-						if (e.lookahead < E) {
-							if (V(e), e.lookahead < E && t === l) return k;
+						if (e.lookahead < T) {
+							if (B(e), e.lookahead < T && t === l) return O;
 							if (e.lookahead === 0) break;
 						}
-						if (n = 0, e.lookahead >= w && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + w - 1]) & e.hash_mask, n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = w - 1, n !== 0 && e.prev_length < e.max_lazy_match && e.strstart - n <= e.w_size - E && (e.match_length = B(e, n), e.match_length <= 5 && (e.strategy === 1 || e.match_length === w && 4096 < e.strstart - e.match_start) && (e.match_length = w - 1)), e.prev_length >= w && e.match_length <= e.prev_length) {
-							for (i = e.strstart + e.lookahead - w, r = a._tr_tally(e, e.strstart - 1 - e.prev_match, e.prev_length - w), e.lookahead -= e.prev_length - 1, e.prev_length -= 2; ++e.strstart <= i && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + w - 1]) & e.hash_mask, n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), --e.prev_length != 0;);
-							if (e.match_available = 0, e.match_length = w - 1, e.strstart++, r && (L(e, !1), e.strm.avail_out === 0)) return k;
+						if (n = 0, e.lookahead >= C && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + C - 1]) & e.hash_mask, n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), e.prev_length = e.match_length, e.prev_match = e.match_start, e.match_length = C - 1, n !== 0 && e.prev_length < e.max_lazy_match && e.strstart - n <= e.w_size - T && (e.match_length = z(e, n), e.match_length <= 5 && (e.strategy === 1 || e.match_length === C && 4096 < e.strstart - e.match_start) && (e.match_length = C - 1)), e.prev_length >= C && e.match_length <= e.prev_length) {
+							for (i = e.strstart + e.lookahead - C, r = a._tr_tally(e, e.strstart - 1 - e.prev_match, e.prev_length - C), e.lookahead -= e.prev_length - 1, e.prev_length -= 2; ++e.strstart <= i && (e.ins_h = (e.ins_h << e.hash_shift ^ e.window[e.strstart + C - 1]) & e.hash_mask, n = e.prev[e.strstart & e.w_mask] = e.head[e.ins_h], e.head[e.ins_h] = e.strstart), --e.prev_length != 0;);
+							if (e.match_available = 0, e.match_length = C - 1, e.strstart++, r && (I(e, !1), e.strm.avail_out === 0)) return O;
 						} else if (e.match_available) {
-							if ((r = a._tr_tally(e, 0, e.window[e.strstart - 1])) && L(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0) return k;
+							if ((r = a._tr_tally(e, 0, e.window[e.strstart - 1])) && I(e, !1), e.strstart++, e.lookahead--, e.strm.avail_out === 0) return O;
 						} else e.match_available = 1, e.strstart++, e.lookahead--;
 					}
-					return e.match_available &&= (r = a._tr_tally(e, 0, e.window[e.strstart - 1]), 0), e.insert = e.strstart < w - 1 ? e.strstart : w - 1, t === u ? (L(e, !0), e.strm.avail_out === 0 ? j : M) : e.last_lit && (L(e, !1), e.strm.avail_out === 0) ? k : A;
+					return e.match_available &&= (r = a._tr_tally(e, 0, e.window[e.strstart - 1]), 0), e.insert = e.strstart < C - 1 ? e.strstart : C - 1, t === u ? (I(e, !0), e.strm.avail_out === 0 ? A : j) : e.last_lit && (I(e, !1), e.strm.avail_out === 0) ? O : k;
 				}
-				function W(e, t, n, r, i) {
+				function U(e, t, n, r, i) {
 					this.good_length = e, this.max_lazy = t, this.nice_length = n, this.max_chain = r, this.func = i;
 				}
-				function G() {
-					this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = _, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new i.Buf16(2 * S), this.dyn_dtree = new i.Buf16(2 * (2 * b + 1)), this.bl_tree = new i.Buf16(2 * (2 * x + 1)), F(this.dyn_ltree), F(this.dyn_dtree), F(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new i.Buf16(C + 1), this.heap = new i.Buf16(2 * y + 1), F(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new i.Buf16(2 * y + 1), F(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
+				function W() {
+					this.strm = null, this.status = 0, this.pending_buf = null, this.pending_buf_size = 0, this.pending_out = 0, this.pending = 0, this.wrap = 0, this.gzhead = null, this.gzindex = 0, this.method = g, this.last_flush = -1, this.w_size = 0, this.w_bits = 0, this.w_mask = 0, this.window = null, this.window_size = 0, this.prev = null, this.head = null, this.ins_h = 0, this.hash_size = 0, this.hash_bits = 0, this.hash_mask = 0, this.hash_shift = 0, this.block_start = 0, this.match_length = 0, this.prev_match = 0, this.match_available = 0, this.strstart = 0, this.match_start = 0, this.lookahead = 0, this.prev_length = 0, this.max_chain_length = 0, this.max_lazy_match = 0, this.level = 0, this.strategy = 0, this.good_match = 0, this.nice_match = 0, this.dyn_ltree = new i.Buf16(2 * x), this.dyn_dtree = new i.Buf16(2 * (2 * y + 1)), this.bl_tree = new i.Buf16(2 * (2 * b + 1)), P(this.dyn_ltree), P(this.dyn_dtree), P(this.bl_tree), this.l_desc = null, this.d_desc = null, this.bl_desc = null, this.bl_count = new i.Buf16(S + 1), this.heap = new i.Buf16(2 * v + 1), P(this.heap), this.heap_len = 0, this.heap_max = 0, this.depth = new i.Buf16(2 * v + 1), P(this.depth), this.l_buf = 0, this.lit_bufsize = 0, this.last_lit = 0, this.d_buf = 0, this.opt_len = 0, this.static_len = 0, this.matches = 0, this.insert = 0, this.bi_buf = 0, this.bi_valid = 0;
 				}
-				function K(e) {
+				function G(e) {
 					var t;
-					return e && e.state ? (e.total_in = e.total_out = 0, e.data_type = g, (t = e.state).pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = t.wrap ? D : O, e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = l, a._tr_init(t), d) : N(e, f);
+					return e && e.state ? (e.total_in = e.total_out = 0, e.data_type = h, (t = e.state).pending = 0, t.pending_out = 0, t.wrap < 0 && (t.wrap = -t.wrap), t.status = t.wrap ? E : D, e.adler = t.wrap === 2 ? 0 : 1, t.last_flush = l, a._tr_init(t), d) : M(e, f);
 				}
-				function q(e) {
-					var t = K(e);
+				function K(e) {
+					var t = G(e);
 					return t === d && function(e) {
-						e.window_size = 2 * e.w_size, F(e.head), e.max_lazy_match = r[e.level].max_lazy, e.good_match = r[e.level].good_length, e.nice_match = r[e.level].nice_length, e.max_chain_length = r[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = w - 1, e.match_available = 0, e.ins_h = 0;
+						e.window_size = 2 * e.w_size, P(e.head), e.max_lazy_match = r[e.level].max_lazy, e.good_match = r[e.level].good_length, e.nice_match = r[e.level].nice_length, e.max_chain_length = r[e.level].max_chain, e.strstart = 0, e.block_start = 0, e.lookahead = 0, e.insert = 0, e.match_length = e.prev_length = C - 1, e.match_available = 0, e.ins_h = 0;
 					}(e.state), t;
 				}
-				function J(e, t, n, r, a, o) {
+				function q(e, t, n, r, a, o) {
 					if (!e) return f;
 					var s = 1;
-					if (t === p && (t = 6), r < 0 ? (s = 0, r = -r) : 15 < r && (s = 2, r -= 16), a < 1 || v < a || n !== _ || r < 8 || 15 < r || t < 0 || 9 < t || o < 0 || m < o) return N(e, f);
+					if (t === p && (t = 6), r < 0 ? (s = 0, r = -r) : 15 < r && (s = 2, r -= 16), a < 1 || _ < a || n !== g || r < 8 || 15 < r || t < 0 || 9 < t || o < 0 || m < o) return M(e, f);
 					r === 8 && (r = 9);
-					var c = new G();
-					return (e.state = c).strm = e, c.wrap = s, c.gzhead = null, c.w_bits = r, c.w_size = 1 << c.w_bits, c.w_mask = c.w_size - 1, c.hash_bits = a + 7, c.hash_size = 1 << c.hash_bits, c.hash_mask = c.hash_size - 1, c.hash_shift = ~~((c.hash_bits + w - 1) / w), c.window = new i.Buf8(2 * c.w_size), c.head = new i.Buf16(c.hash_size), c.prev = new i.Buf16(c.w_size), c.lit_bufsize = 1 << a + 6, c.pending_buf_size = 4 * c.lit_bufsize, c.pending_buf = new i.Buf8(c.pending_buf_size), c.d_buf = 1 * c.lit_bufsize, c.l_buf = 3 * c.lit_bufsize, c.level = t, c.strategy = o, c.method = n, q(e);
+					var c = new W();
+					return (e.state = c).strm = e, c.wrap = s, c.gzhead = null, c.w_bits = r, c.w_size = 1 << c.w_bits, c.w_mask = c.w_size - 1, c.hash_bits = a + 7, c.hash_size = 1 << c.hash_bits, c.hash_mask = c.hash_size - 1, c.hash_shift = ~~((c.hash_bits + C - 1) / C), c.window = new i.Buf8(2 * c.w_size), c.head = new i.Buf16(c.hash_size), c.prev = new i.Buf16(c.w_size), c.lit_bufsize = 1 << a + 6, c.pending_buf_size = 4 * c.lit_bufsize, c.pending_buf = new i.Buf8(c.pending_buf_size), c.d_buf = 1 * c.lit_bufsize, c.l_buf = 3 * c.lit_bufsize, c.level = t, c.strategy = o, c.method = n, K(e);
 				}
 				r = [
-					new W(0, 0, 0, 0, function(e, t) {
+					new U(0, 0, 0, 0, function(e, t) {
 						var n = 65535;
 						for (n > e.pending_buf_size - 5 && (n = e.pending_buf_size - 5);;) {
 							if (e.lookahead <= 1) {
-								if (V(e), e.lookahead === 0 && t === l) return k;
+								if (B(e), e.lookahead === 0 && t === l) return O;
 								if (e.lookahead === 0) break;
 							}
 							e.strstart += e.lookahead, e.lookahead = 0;
 							var r = e.block_start + n;
-							if ((e.strstart === 0 || e.strstart >= r) && (e.lookahead = e.strstart - r, e.strstart = r, L(e, !1), e.strm.avail_out === 0) || e.strstart - e.block_start >= e.w_size - E && (L(e, !1), e.strm.avail_out === 0)) return k;
+							if ((e.strstart === 0 || e.strstart >= r) && (e.lookahead = e.strstart - r, e.strstart = r, I(e, !1), e.strm.avail_out === 0) || e.strstart - e.block_start >= e.w_size - T && (I(e, !1), e.strm.avail_out === 0)) return O;
 						}
-						return e.insert = 0, t === u ? (L(e, !0), e.strm.avail_out === 0 ? j : M) : (e.strstart > e.block_start && (L(e, !1), e.strm.avail_out), k);
+						return e.insert = 0, t === u ? (I(e, !0), e.strm.avail_out === 0 ? A : j) : (e.strstart > e.block_start && (I(e, !1), e.strm.avail_out), O);
 					}),
-					new W(4, 4, 8, 4, H),
-					new W(4, 5, 16, 8, H),
-					new W(4, 6, 32, 32, H),
-					new W(4, 4, 16, 16, U),
-					new W(8, 16, 32, 32, U),
-					new W(8, 16, 128, 128, U),
-					new W(8, 32, 128, 256, U),
-					new W(32, 128, 258, 1024, U),
-					new W(32, 258, 258, 4096, U)
+					new U(4, 4, 8, 4, V),
+					new U(4, 5, 16, 8, V),
+					new U(4, 6, 32, 32, V),
+					new U(4, 4, 16, 16, H),
+					new U(8, 16, 32, 32, H),
+					new U(8, 16, 128, 128, H),
+					new U(8, 32, 128, 256, H),
+					new U(32, 128, 258, 1024, H),
+					new U(32, 258, 258, 4096, H)
 				], n.deflateInit = function(e, t) {
-					return J(e, t, _, 15, 8, 0);
-				}, n.deflateInit2 = J, n.deflateReset = q, n.deflateResetKeep = K, n.deflateSetHeader = function(e, t) {
+					return q(e, t, g, 15, 8, 0);
+				}, n.deflateInit2 = q, n.deflateReset = K, n.deflateResetKeep = G, n.deflateSetHeader = function(e, t) {
 					return e && e.state && e.state.wrap === 2 ? (e.state.gzhead = t, d) : f;
 				}, n.deflate = function(e, t) {
 					var n, i, o, c;
-					if (!e || !e.state || 5 < t || t < 0) return e ? N(e, f) : f;
-					if (i = e.state, !e.output || !e.input && e.avail_in !== 0 || i.status === 666 && t !== u) return N(e, e.avail_out === 0 ? -5 : f);
-					if (i.strm = e, n = i.last_flush, i.last_flush = t, i.status === D) if (i.wrap === 2) e.adler = 0, R(i, 31), R(i, 139), R(i, 8), i.gzhead ? (R(i, (i.gzhead.text ? 1 : 0) + (i.gzhead.hcrc ? 2 : 0) + (i.gzhead.extra ? 4 : 0) + (i.gzhead.name ? 8 : 0) + (i.gzhead.comment ? 16 : 0)), R(i, 255 & i.gzhead.time), R(i, i.gzhead.time >> 8 & 255), R(i, i.gzhead.time >> 16 & 255), R(i, i.gzhead.time >> 24 & 255), R(i, i.level === 9 ? 2 : 2 <= i.strategy || i.level < 2 ? 4 : 0), R(i, 255 & i.gzhead.os), i.gzhead.extra && i.gzhead.extra.length && (R(i, 255 & i.gzhead.extra.length), R(i, i.gzhead.extra.length >> 8 & 255)), i.gzhead.hcrc && (e.adler = s(e.adler, i.pending_buf, i.pending, 0)), i.gzindex = 0, i.status = 69) : (R(i, 0), R(i, 0), R(i, 0), R(i, 0), R(i, 0), R(i, i.level === 9 ? 2 : 2 <= i.strategy || i.level < 2 ? 4 : 0), R(i, 3), i.status = O);
+					if (!e || !e.state || 5 < t || t < 0) return e ? M(e, f) : f;
+					if (i = e.state, !e.output || !e.input && e.avail_in !== 0 || i.status === 666 && t !== u) return M(e, e.avail_out === 0 ? -5 : f);
+					if (i.strm = e, n = i.last_flush, i.last_flush = t, i.status === E) if (i.wrap === 2) e.adler = 0, L(i, 31), L(i, 139), L(i, 8), i.gzhead ? (L(i, (i.gzhead.text ? 1 : 0) + (i.gzhead.hcrc ? 2 : 0) + (i.gzhead.extra ? 4 : 0) + (i.gzhead.name ? 8 : 0) + (i.gzhead.comment ? 16 : 0)), L(i, 255 & i.gzhead.time), L(i, i.gzhead.time >> 8 & 255), L(i, i.gzhead.time >> 16 & 255), L(i, i.gzhead.time >> 24 & 255), L(i, i.level === 9 ? 2 : 2 <= i.strategy || i.level < 2 ? 4 : 0), L(i, 255 & i.gzhead.os), i.gzhead.extra && i.gzhead.extra.length && (L(i, 255 & i.gzhead.extra.length), L(i, i.gzhead.extra.length >> 8 & 255)), i.gzhead.hcrc && (e.adler = s(e.adler, i.pending_buf, i.pending, 0)), i.gzindex = 0, i.status = 69) : (L(i, 0), L(i, 0), L(i, 0), L(i, 0), L(i, 0), L(i, i.level === 9 ? 2 : 2 <= i.strategy || i.level < 2 ? 4 : 0), L(i, 3), i.status = D);
 					else {
-						var p = _ + (i.w_bits - 8 << 4) << 8;
-						p |= (2 <= i.strategy || i.level < 2 ? 0 : i.level < 6 ? 1 : i.level === 6 ? 2 : 3) << 6, i.strstart !== 0 && (p |= 32), p += 31 - p % 31, i.status = O, z(i, p), i.strstart !== 0 && (z(i, e.adler >>> 16), z(i, 65535 & e.adler)), e.adler = 1;
+						var p = g + (i.w_bits - 8 << 4) << 8;
+						p |= (2 <= i.strategy || i.level < 2 ? 0 : i.level < 6 ? 1 : i.level === 6 ? 2 : 3) << 6, i.strstart !== 0 && (p |= 32), p += 31 - p % 31, i.status = D, R(i, p), i.strstart !== 0 && (R(i, e.adler >>> 16), R(i, 65535 & e.adler)), e.adler = 1;
 					}
 					if (i.status === 69) if (i.gzhead.extra) {
-						for (o = i.pending; i.gzindex < (65535 & i.gzhead.extra.length) && (i.pending !== i.pending_buf_size || (i.gzhead.hcrc && i.pending > o && (e.adler = s(e.adler, i.pending_buf, i.pending - o, o)), I(e), o = i.pending, i.pending !== i.pending_buf_size));) R(i, 255 & i.gzhead.extra[i.gzindex]), i.gzindex++;
+						for (o = i.pending; i.gzindex < (65535 & i.gzhead.extra.length) && (i.pending !== i.pending_buf_size || (i.gzhead.hcrc && i.pending > o && (e.adler = s(e.adler, i.pending_buf, i.pending - o, o)), F(e), o = i.pending, i.pending !== i.pending_buf_size));) L(i, 255 & i.gzhead.extra[i.gzindex]), i.gzindex++;
 						i.gzhead.hcrc && i.pending > o && (e.adler = s(e.adler, i.pending_buf, i.pending - o, o)), i.gzindex === i.gzhead.extra.length && (i.gzindex = 0, i.status = 73);
 					} else i.status = 73;
 					if (i.status === 73) if (i.gzhead.name) {
 						o = i.pending;
 						do {
-							if (i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > o && (e.adler = s(e.adler, i.pending_buf, i.pending - o, o)), I(e), o = i.pending, i.pending === i.pending_buf_size)) {
+							if (i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > o && (e.adler = s(e.adler, i.pending_buf, i.pending - o, o)), F(e), o = i.pending, i.pending === i.pending_buf_size)) {
 								c = 1;
 								break;
 							}
-							c = i.gzindex < i.gzhead.name.length ? 255 & i.gzhead.name.charCodeAt(i.gzindex++) : 0, R(i, c);
+							c = i.gzindex < i.gzhead.name.length ? 255 & i.gzhead.name.charCodeAt(i.gzindex++) : 0, L(i, c);
 						} while (c !== 0);
 						i.gzhead.hcrc && i.pending > o && (e.adler = s(e.adler, i.pending_buf, i.pending - o, o)), c === 0 && (i.gzindex = 0, i.status = 91);
 					} else i.status = 91;
 					if (i.status === 91) if (i.gzhead.comment) {
 						o = i.pending;
 						do {
-							if (i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > o && (e.adler = s(e.adler, i.pending_buf, i.pending - o, o)), I(e), o = i.pending, i.pending === i.pending_buf_size)) {
+							if (i.pending === i.pending_buf_size && (i.gzhead.hcrc && i.pending > o && (e.adler = s(e.adler, i.pending_buf, i.pending - o, o)), F(e), o = i.pending, i.pending === i.pending_buf_size)) {
 								c = 1;
 								break;
 							}
-							c = i.gzindex < i.gzhead.comment.length ? 255 & i.gzhead.comment.charCodeAt(i.gzindex++) : 0, R(i, c);
+							c = i.gzindex < i.gzhead.comment.length ? 255 & i.gzhead.comment.charCodeAt(i.gzindex++) : 0, L(i, c);
 						} while (c !== 0);
 						i.gzhead.hcrc && i.pending > o && (e.adler = s(e.adler, i.pending_buf, i.pending - o, o)), c === 0 && (i.status = 103);
 					} else i.status = 103;
-					if (i.status === 103 && (i.gzhead.hcrc ? (i.pending + 2 > i.pending_buf_size && I(e), i.pending + 2 <= i.pending_buf_size && (R(i, 255 & e.adler), R(i, e.adler >> 8 & 255), e.adler = 0, i.status = O)) : i.status = O), i.pending !== 0) {
-						if (I(e), e.avail_out === 0) return i.last_flush = -1, d;
-					} else if (e.avail_in === 0 && P(t) <= P(n) && t !== u) return N(e, -5);
-					if (i.status === 666 && e.avail_in !== 0) return N(e, -5);
+					if (i.status === 103 && (i.gzhead.hcrc ? (i.pending + 2 > i.pending_buf_size && F(e), i.pending + 2 <= i.pending_buf_size && (L(i, 255 & e.adler), L(i, e.adler >> 8 & 255), e.adler = 0, i.status = D)) : i.status = D), i.pending !== 0) {
+						if (F(e), e.avail_out === 0) return i.last_flush = -1, d;
+					} else if (e.avail_in === 0 && N(t) <= N(n) && t !== u) return M(e, -5);
+					if (i.status === 666 && e.avail_in !== 0) return M(e, -5);
 					if (e.avail_in !== 0 || i.lookahead !== 0 || t !== l && i.status !== 666) {
 						var m = i.strategy === 2 ? function(e, t) {
 							for (var n;;) {
-								if (e.lookahead === 0 && (V(e), e.lookahead === 0)) {
-									if (t === l) return k;
+								if (e.lookahead === 0 && (B(e), e.lookahead === 0)) {
+									if (t === l) return O;
 									break;
 								}
-								if (e.match_length = 0, n = a._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, n && (L(e, !1), e.strm.avail_out === 0)) return k;
+								if (e.match_length = 0, n = a._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++, n && (I(e, !1), e.strm.avail_out === 0)) return O;
 							}
-							return e.insert = 0, t === u ? (L(e, !0), e.strm.avail_out === 0 ? j : M) : e.last_lit && (L(e, !1), e.strm.avail_out === 0) ? k : A;
+							return e.insert = 0, t === u ? (I(e, !0), e.strm.avail_out === 0 ? A : j) : e.last_lit && (I(e, !1), e.strm.avail_out === 0) ? O : k;
 						}(i, t) : i.strategy === 3 ? function(e, t) {
 							for (var n, r, i, o, s = e.window;;) {
-								if (e.lookahead <= T) {
-									if (V(e), e.lookahead <= T && t === l) return k;
+								if (e.lookahead <= w) {
+									if (B(e), e.lookahead <= w && t === l) return O;
 									if (e.lookahead === 0) break;
 								}
-								if (e.match_length = 0, e.lookahead >= w && 0 < e.strstart && (r = s[i = e.strstart - 1]) === s[++i] && r === s[++i] && r === s[++i]) {
-									o = e.strstart + T;
+								if (e.match_length = 0, e.lookahead >= C && 0 < e.strstart && (r = s[i = e.strstart - 1]) === s[++i] && r === s[++i] && r === s[++i]) {
+									o = e.strstart + w;
 									do									;
 while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && i < o);
-									e.match_length = T - (o - i), e.match_length > e.lookahead && (e.match_length = e.lookahead);
+									e.match_length = w - (o - i), e.match_length > e.lookahead && (e.match_length = e.lookahead);
 								}
-								if (e.match_length >= w ? (n = a._tr_tally(e, 1, e.match_length - w), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (n = a._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), n && (L(e, !1), e.strm.avail_out === 0)) return k;
+								if (e.match_length >= C ? (n = a._tr_tally(e, 1, e.match_length - C), e.lookahead -= e.match_length, e.strstart += e.match_length, e.match_length = 0) : (n = a._tr_tally(e, 0, e.window[e.strstart]), e.lookahead--, e.strstart++), n && (I(e, !1), e.strm.avail_out === 0)) return O;
 							}
-							return e.insert = 0, t === u ? (L(e, !0), e.strm.avail_out === 0 ? j : M) : e.last_lit && (L(e, !1), e.strm.avail_out === 0) ? k : A;
+							return e.insert = 0, t === u ? (I(e, !0), e.strm.avail_out === 0 ? A : j) : e.last_lit && (I(e, !1), e.strm.avail_out === 0) ? O : k;
 						}(i, t) : r[i.level].func(i, t);
-						if (m !== j && m !== M || (i.status = 666), m === k || m === j) return e.avail_out === 0 && (i.last_flush = -1), d;
-						if (m === A && (t === 1 ? a._tr_align(i) : t !== 5 && (a._tr_stored_block(i, 0, 0, !1), t === 3 && (F(i.head), i.lookahead === 0 && (i.strstart = 0, i.block_start = 0, i.insert = 0))), I(e), e.avail_out === 0)) return i.last_flush = -1, d;
+						if (m !== A && m !== j || (i.status = 666), m === O || m === A) return e.avail_out === 0 && (i.last_flush = -1), d;
+						if (m === k && (t === 1 ? a._tr_align(i) : t !== 5 && (a._tr_stored_block(i, 0, 0, !1), t === 3 && (P(i.head), i.lookahead === 0 && (i.strstart = 0, i.block_start = 0, i.insert = 0))), F(e), e.avail_out === 0)) return i.last_flush = -1, d;
 					}
-					return t === u ? i.wrap <= 0 ? 1 : (i.wrap === 2 ? (R(i, 255 & e.adler), R(i, e.adler >> 8 & 255), R(i, e.adler >> 16 & 255), R(i, e.adler >> 24 & 255), R(i, 255 & e.total_in), R(i, e.total_in >> 8 & 255), R(i, e.total_in >> 16 & 255), R(i, e.total_in >> 24 & 255)) : (z(i, e.adler >>> 16), z(i, 65535 & e.adler)), I(e), 0 < i.wrap && (i.wrap = -i.wrap), i.pending === 0 ? 1 : d) : d;
+					return t === u ? i.wrap <= 0 ? 1 : (i.wrap === 2 ? (L(i, 255 & e.adler), L(i, e.adler >> 8 & 255), L(i, e.adler >> 16 & 255), L(i, e.adler >> 24 & 255), L(i, 255 & e.total_in), L(i, e.total_in >> 8 & 255), L(i, e.total_in >> 16 & 255), L(i, e.total_in >> 24 & 255)) : (R(i, e.adler >>> 16), R(i, 65535 & e.adler)), F(e), 0 < i.wrap && (i.wrap = -i.wrap), i.pending === 0 ? 1 : d) : d;
 				}, n.deflateEnd = function(e) {
 					var t;
-					return e && e.state ? (t = e.state.status) !== D && t !== 69 && t !== 73 && t !== 91 && t !== 103 && t !== O && t !== 666 ? N(e, f) : (e.state = null, t === O ? N(e, -3) : d) : f;
+					return e && e.state ? (t = e.state.status) !== E && t !== 69 && t !== 73 && t !== 91 && t !== 103 && t !== D && t !== 666 ? M(e, f) : (e.state = null, t === D ? M(e, -3) : d) : f;
 				}, n.deflateSetDictionary = function(e, t) {
 					var n, r, a, s, c, l, u, p, m = t.length;
-					if (!e || !e.state || (s = (n = e.state).wrap) === 2 || s === 1 && n.status !== D || n.lookahead) return f;
-					for (s === 1 && (e.adler = o(e.adler, t, m, 0)), n.wrap = 0, m >= n.w_size && (s === 0 && (F(n.head), n.strstart = 0, n.block_start = 0, n.insert = 0), p = new i.Buf8(n.w_size), i.arraySet(p, t, m - n.w_size, n.w_size, 0), t = p, m = n.w_size), c = e.avail_in, l = e.next_in, u = e.input, e.avail_in = m, e.next_in = 0, e.input = t, V(n); n.lookahead >= w;) {
-						for (r = n.strstart, a = n.lookahead - (w - 1); n.ins_h = (n.ins_h << n.hash_shift ^ n.window[r + w - 1]) & n.hash_mask, n.prev[r & n.w_mask] = n.head[n.ins_h], n.head[n.ins_h] = r, r++, --a;);
-						n.strstart = r, n.lookahead = w - 1, V(n);
+					if (!e || !e.state || (s = (n = e.state).wrap) === 2 || s === 1 && n.status !== E || n.lookahead) return f;
+					for (s === 1 && (e.adler = o(e.adler, t, m, 0)), n.wrap = 0, m >= n.w_size && (s === 0 && (P(n.head), n.strstart = 0, n.block_start = 0, n.insert = 0), p = new i.Buf8(n.w_size), i.arraySet(p, t, m - n.w_size, n.w_size, 0), t = p, m = n.w_size), c = e.avail_in, l = e.next_in, u = e.input, e.avail_in = m, e.next_in = 0, e.input = t, B(n); n.lookahead >= C;) {
+						for (r = n.strstart, a = n.lookahead - (C - 1); n.ins_h = (n.ins_h << n.hash_shift ^ n.window[r + C - 1]) & n.hash_mask, n.prev[r & n.w_mask] = n.head[n.ins_h], n.head[n.ins_h] = r, r++, --a;);
+						n.strstart = r, n.lookahead = C - 1, B(n);
 					}
-					return n.strstart += n.lookahead, n.block_start = n.strstart, n.insert = n.lookahead, n.lookahead = 0, n.match_length = n.prev_length = w - 1, n.match_available = 0, e.next_in = l, e.input = u, e.avail_in = c, n.wrap = s, d;
+					return n.strstart += n.lookahead, n.block_start = n.strstart, n.insert = n.lookahead, n.lookahead = 0, n.match_length = n.prev_length = C - 1, n.match_available = 0, e.next_in = l, e.input = u, e.avail_in = c, n.wrap = s, d;
 				}, n.deflateInfo = "pako deflate (from Nodeca project)";
 			}, {
 				"../utils/common": 41,
@@ -5163,66 +5609,66 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 			}, {}],
 			48: [function(e, t, n) {
 				t.exports = function(e, t) {
-					var n = e.state, r = e.next_in, i, a, o, s, c, l, u, d, f, p, m, g, _, v, y, b, x, S, C, w, T, E = e.input, D;
-					i = r + (e.avail_in - 5), a = e.next_out, D = e.output, o = a - (t - e.avail_out), s = a + (e.avail_out - 257), c = n.dmax, l = n.wsize, u = n.whave, d = n.wnext, f = n.window, p = n.hold, m = n.bits, g = n.lencode, _ = n.distcode, v = (1 << n.lenbits) - 1, y = (1 << n.distbits) - 1;
+					var n = e.state, r = e.next_in, i, a, o, s, c, l, u, d, f, p, m, h, g, _, v, y, b, x, S, C, w, T = e.input, E;
+					i = r + (e.avail_in - 5), a = e.next_out, E = e.output, o = a - (t - e.avail_out), s = a + (e.avail_out - 257), c = n.dmax, l = n.wsize, u = n.whave, d = n.wnext, f = n.window, p = n.hold, m = n.bits, h = n.lencode, g = n.distcode, _ = (1 << n.lenbits) - 1, v = (1 << n.distbits) - 1;
 					e: do {
-						m < 15 && (p += E[r++] << m, m += 8, p += E[r++] << m, m += 8), b = g[p & v];
+						m < 15 && (p += T[r++] << m, m += 8, p += T[r++] << m, m += 8), y = h[p & _];
 						t: for (;;) {
-							if (p >>>= x = b >>> 24, m -= x, (x = b >>> 16 & 255) == 0) D[a++] = 65535 & b;
+							if (p >>>= b = y >>> 24, m -= b, (b = y >>> 16 & 255) == 0) E[a++] = 65535 & y;
 							else {
-								if (!(16 & x)) {
-									if (!(64 & x)) {
-										b = g[(65535 & b) + (p & (1 << x) - 1)];
+								if (!(16 & b)) {
+									if (!(64 & b)) {
+										y = h[(65535 & y) + (p & (1 << b) - 1)];
 										continue t;
 									}
-									if (32 & x) {
+									if (32 & b) {
 										n.mode = 12;
 										break e;
 									}
 									e.msg = "invalid literal/length code", n.mode = 30;
 									break e;
 								}
-								S = 65535 & b, (x &= 15) && (m < x && (p += E[r++] << m, m += 8), S += p & (1 << x) - 1, p >>>= x, m -= x), m < 15 && (p += E[r++] << m, m += 8, p += E[r++] << m, m += 8), b = _[p & y];
+								x = 65535 & y, (b &= 15) && (m < b && (p += T[r++] << m, m += 8), x += p & (1 << b) - 1, p >>>= b, m -= b), m < 15 && (p += T[r++] << m, m += 8, p += T[r++] << m, m += 8), y = g[p & v];
 								r: for (;;) {
-									if (p >>>= x = b >>> 24, m -= x, !(16 & (x = b >>> 16 & 255))) {
-										if (!(64 & x)) {
-											b = _[(65535 & b) + (p & (1 << x) - 1)];
+									if (p >>>= b = y >>> 24, m -= b, !(16 & (b = y >>> 16 & 255))) {
+										if (!(64 & b)) {
+											y = g[(65535 & y) + (p & (1 << b) - 1)];
 											continue r;
 										}
 										e.msg = "invalid distance code", n.mode = 30;
 										break e;
 									}
-									if (C = 65535 & b, m < (x &= 15) && (p += E[r++] << m, (m += 8) < x && (p += E[r++] << m, m += 8)), c < (C += p & (1 << x) - 1)) {
+									if (S = 65535 & y, m < (b &= 15) && (p += T[r++] << m, (m += 8) < b && (p += T[r++] << m, m += 8)), c < (S += p & (1 << b) - 1)) {
 										e.msg = "invalid distance too far back", n.mode = 30;
 										break e;
 									}
-									if (p >>>= x, m -= x, (x = a - o) < C) {
-										if (u < (x = C - x) && n.sane) {
+									if (p >>>= b, m -= b, (b = a - o) < S) {
+										if (u < (b = S - b) && n.sane) {
 											e.msg = "invalid distance too far back", n.mode = 30;
 											break e;
 										}
-										if (T = f, (w = 0) === d) {
-											if (w += l - x, x < S) {
-												for (S -= x; D[a++] = f[w++], --x;);
-												w = a - C, T = D;
+										if (w = f, (C = 0) === d) {
+											if (C += l - b, b < x) {
+												for (x -= b; E[a++] = f[C++], --b;);
+												C = a - S, w = E;
 											}
-										} else if (d < x) {
-											if (w += l + d - x, (x -= d) < S) {
-												for (S -= x; D[a++] = f[w++], --x;);
-												if (w = 0, d < S) {
-													for (S -= x = d; D[a++] = f[w++], --x;);
-													w = a - C, T = D;
+										} else if (d < b) {
+											if (C += l + d - b, (b -= d) < x) {
+												for (x -= b; E[a++] = f[C++], --b;);
+												if (C = 0, d < x) {
+													for (x -= b = d; E[a++] = f[C++], --b;);
+													C = a - S, w = E;
 												}
 											}
-										} else if (w += d - x, x < S) {
-											for (S -= x; D[a++] = f[w++], --x;);
-											w = a - C, T = D;
+										} else if (C += d - b, b < x) {
+											for (x -= b; E[a++] = f[C++], --b;);
+											C = a - S, w = E;
 										}
-										for (; 2 < S;) D[a++] = T[w++], D[a++] = T[w++], D[a++] = T[w++], S -= 3;
-										S && (D[a++] = T[w++], 1 < S && (D[a++] = T[w++]));
+										for (; 2 < x;) E[a++] = w[C++], E[a++] = w[C++], E[a++] = w[C++], x -= 3;
+										x && (E[a++] = w[C++], 1 < x && (E[a++] = w[C++]));
 									} else {
-										for (w = a - C; D[a++] = D[w++], D[a++] = D[w++], D[a++] = D[w++], 2 < (S -= 3););
-										S && (D[a++] = D[w++], 1 < S && (D[a++] = D[w++]));
+										for (C = a - S; E[a++] = E[C++], E[a++] = E[C++], E[a++] = E[C++], 2 < (x -= 3););
+										x && (E[a++] = E[C++], 1 < x && (E[a++] = E[C++]));
 									}
 									break;
 								}
@@ -5230,54 +5676,54 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 							break;
 						}
 					} while (r < i && a < s);
-					r -= S = m >> 3, p &= (1 << (m -= S << 3)) - 1, e.next_in = r, e.next_out = a, e.avail_in = r < i ? i - r + 5 : 5 - (r - i), e.avail_out = a < s ? s - a + 257 : 257 - (a - s), n.hold = p, n.bits = m;
+					r -= x = m >> 3, p &= (1 << (m -= x << 3)) - 1, e.next_in = r, e.next_out = a, e.avail_in = r < i ? i - r + 5 : 5 - (r - i), e.avail_out = a < s ? s - a + 257 : 257 - (a - s), n.hold = p, n.bits = m;
 				};
 			}, {}],
 			49: [function(e, t, n) {
 				var r = e("../utils/common"), i = e("./adler32"), a = e("./crc32"), o = e("./inffast"), s = e("./inftrees"), c = 1, l = 2, u = 0, d = -2, f = 1, p = 852, m = 592;
-				function g(e) {
+				function h(e) {
 					return (e >>> 24 & 255) + (e >>> 8 & 65280) + ((65280 & e) << 8) + ((255 & e) << 24);
 				}
-				function _() {
+				function g() {
 					this.mode = 0, this.last = !1, this.wrap = 0, this.havedict = !1, this.flags = 0, this.dmax = 0, this.check = 0, this.total = 0, this.head = null, this.wbits = 0, this.wsize = 0, this.whave = 0, this.wnext = 0, this.window = null, this.hold = 0, this.bits = 0, this.length = 0, this.offset = 0, this.extra = 0, this.lencode = null, this.distcode = null, this.lenbits = 0, this.distbits = 0, this.ncode = 0, this.nlen = 0, this.ndist = 0, this.have = 0, this.next = null, this.lens = new r.Buf16(320), this.work = new r.Buf16(288), this.lendyn = null, this.distdyn = null, this.sane = 0, this.back = 0, this.was = 0;
 				}
-				function v(e) {
+				function _(e) {
 					var t;
 					return e && e.state ? (t = e.state, e.total_in = e.total_out = t.total = 0, e.msg = "", t.wrap && (e.adler = 1 & t.wrap), t.mode = f, t.last = 0, t.havedict = 0, t.dmax = 32768, t.head = null, t.hold = 0, t.bits = 0, t.lencode = t.lendyn = new r.Buf32(p), t.distcode = t.distdyn = new r.Buf32(m), t.sane = 1, t.back = -1, u) : d;
 				}
-				function y(e) {
+				function v(e) {
 					var t;
-					return e && e.state ? ((t = e.state).wsize = 0, t.whave = 0, t.wnext = 0, v(e)) : d;
+					return e && e.state ? ((t = e.state).wsize = 0, t.whave = 0, t.wnext = 0, _(e)) : d;
 				}
-				function b(e, t) {
+				function y(e, t) {
 					var n, r;
-					return e && e.state ? (r = e.state, t < 0 ? (n = 0, t = -t) : (n = 1 + (t >> 4), t < 48 && (t &= 15)), t && (t < 8 || 15 < t) ? d : (r.window !== null && r.wbits !== t && (r.window = null), r.wrap = n, r.wbits = t, y(e))) : d;
+					return e && e.state ? (r = e.state, t < 0 ? (n = 0, t = -t) : (n = 1 + (t >> 4), t < 48 && (t &= 15)), t && (t < 8 || 15 < t) ? d : (r.window !== null && r.wbits !== t && (r.window = null), r.wrap = n, r.wbits = t, v(e))) : d;
 				}
-				function x(e, t) {
+				function b(e, t) {
 					var n, r;
-					return e ? (r = new _(), (e.state = r).window = null, (n = b(e, t)) !== u && (e.state = null), n) : d;
+					return e ? (r = new g(), (e.state = r).window = null, (n = y(e, t)) !== u && (e.state = null), n) : d;
 				}
-				var S, C, w = !0;
-				function T(e) {
-					if (w) {
+				var x, S, C = !0;
+				function w(e) {
+					if (C) {
 						var t;
-						for (S = new r.Buf32(512), C = new r.Buf32(32), t = 0; t < 144;) e.lens[t++] = 8;
+						for (x = new r.Buf32(512), S = new r.Buf32(32), t = 0; t < 144;) e.lens[t++] = 8;
 						for (; t < 256;) e.lens[t++] = 9;
 						for (; t < 280;) e.lens[t++] = 7;
 						for (; t < 288;) e.lens[t++] = 8;
-						for (s(c, e.lens, 0, 288, S, 0, e.work, { bits: 9 }), t = 0; t < 32;) e.lens[t++] = 5;
-						s(l, e.lens, 0, 32, C, 0, e.work, { bits: 5 }), w = !1;
+						for (s(c, e.lens, 0, 288, x, 0, e.work, { bits: 9 }), t = 0; t < 32;) e.lens[t++] = 5;
+						s(l, e.lens, 0, 32, S, 0, e.work, { bits: 5 }), C = !1;
 					}
-					e.lencode = S, e.lenbits = 9, e.distcode = C, e.distbits = 5;
+					e.lencode = x, e.lenbits = 9, e.distcode = S, e.distbits = 5;
 				}
-				function E(e, t, n, i) {
+				function T(e, t, n, i) {
 					var a, o = e.state;
 					return o.window === null && (o.wsize = 1 << o.wbits, o.wnext = 0, o.whave = 0, o.window = new r.Buf8(o.wsize)), i >= o.wsize ? (r.arraySet(o.window, t, n - o.wsize, o.wsize, 0), o.wnext = 0, o.whave = o.wsize) : (i < (a = o.wsize - o.wnext) && (a = i), r.arraySet(o.window, t, n - i, a, o.wnext), (i -= a) ? (r.arraySet(o.window, t, n - i, i, 0), o.wnext = i, o.whave = o.wsize) : (o.wnext += a, o.wnext === o.wsize && (o.wnext = 0), o.whave < o.wsize && (o.whave += a))), 0;
 				}
-				n.inflateReset = y, n.inflateReset2 = b, n.inflateResetKeep = v, n.inflateInit = function(e) {
-					return x(e, 15);
-				}, n.inflateInit2 = x, n.inflate = function(e, t) {
-					var n, p, m, _, v, y, b, x, S, C, w, D, O, k, A, j, M, N, P, F, I, L, R, z, B = 0, V = new r.Buf8(4), H = [
+				n.inflateReset = v, n.inflateReset2 = y, n.inflateResetKeep = _, n.inflateInit = function(e) {
+					return b(e, 15);
+				}, n.inflateInit2 = b, n.inflate = function(e, t) {
+					var n, p, m, g, _, v, y, b, x, S, C, E, D, O, k, A, j, M, N, P, F, I, L, R, z = 0, B = new r.Buf8(4), V = [
 						16,
 						17,
 						18,
@@ -5299,42 +5745,42 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 						15
 					];
 					if (!e || !e.state || !e.output || !e.input && e.avail_in !== 0) return d;
-					(n = e.state).mode === 12 && (n.mode = 13), v = e.next_out, m = e.output, b = e.avail_out, _ = e.next_in, p = e.input, y = e.avail_in, x = n.hold, S = n.bits, C = y, w = b, L = u;
+					(n = e.state).mode === 12 && (n.mode = 13), _ = e.next_out, m = e.output, y = e.avail_out, g = e.next_in, p = e.input, v = e.avail_in, b = n.hold, x = n.bits, S = v, C = y, I = u;
 					e: for (;;) switch (n.mode) {
 						case f:
 							if (n.wrap === 0) {
 								n.mode = 13;
 								break;
 							}
-							for (; S < 16;) {
-								if (y === 0) break e;
-								y--, x += p[_++] << S, S += 8;
+							for (; x < 16;) {
+								if (v === 0) break e;
+								v--, b += p[g++] << x, x += 8;
 							}
-							if (2 & n.wrap && x === 35615) {
-								V[n.check = 0] = 255 & x, V[1] = x >>> 8 & 255, n.check = a(n.check, V, 2, 0), S = x = 0, n.mode = 2;
+							if (2 & n.wrap && b === 35615) {
+								B[n.check = 0] = 255 & b, B[1] = b >>> 8 & 255, n.check = a(n.check, B, 2, 0), x = b = 0, n.mode = 2;
 								break;
 							}
-							if (n.flags = 0, n.head && (n.head.done = !1), !(1 & n.wrap) || (((255 & x) << 8) + (x >> 8)) % 31) {
+							if (n.flags = 0, n.head && (n.head.done = !1), !(1 & n.wrap) || (((255 & b) << 8) + (b >> 8)) % 31) {
 								e.msg = "incorrect header check", n.mode = 30;
 								break;
 							}
-							if ((15 & x) != 8) {
+							if ((15 & b) != 8) {
 								e.msg = "unknown compression method", n.mode = 30;
 								break;
 							}
-							if (S -= 4, I = 8 + (15 & (x >>>= 4)), n.wbits === 0) n.wbits = I;
-							else if (I > n.wbits) {
+							if (x -= 4, F = 8 + (15 & (b >>>= 4)), n.wbits === 0) n.wbits = F;
+							else if (F > n.wbits) {
 								e.msg = "invalid window size", n.mode = 30;
 								break;
 							}
-							n.dmax = 1 << I, e.adler = n.check = 1, n.mode = 512 & x ? 10 : 12, S = x = 0;
+							n.dmax = 1 << F, e.adler = n.check = 1, n.mode = 512 & b ? 10 : 12, x = b = 0;
 							break;
 						case 2:
-							for (; S < 16;) {
-								if (y === 0) break e;
-								y--, x += p[_++] << S, S += 8;
+							for (; x < 16;) {
+								if (v === 0) break e;
+								v--, b += p[g++] << x, x += 8;
 							}
-							if (n.flags = x, (255 & n.flags) != 8) {
+							if (n.flags = b, (255 & n.flags) != 8) {
 								e.msg = "unknown compression method", n.mode = 30;
 								break;
 							}
@@ -5342,172 +5788,172 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 								e.msg = "unknown header flags set", n.mode = 30;
 								break;
 							}
-							n.head && (n.head.text = x >> 8 & 1), 512 & n.flags && (V[0] = 255 & x, V[1] = x >>> 8 & 255, n.check = a(n.check, V, 2, 0)), S = x = 0, n.mode = 3;
+							n.head && (n.head.text = b >> 8 & 1), 512 & n.flags && (B[0] = 255 & b, B[1] = b >>> 8 & 255, n.check = a(n.check, B, 2, 0)), x = b = 0, n.mode = 3;
 						case 3:
-							for (; S < 32;) {
-								if (y === 0) break e;
-								y--, x += p[_++] << S, S += 8;
+							for (; x < 32;) {
+								if (v === 0) break e;
+								v--, b += p[g++] << x, x += 8;
 							}
-							n.head && (n.head.time = x), 512 & n.flags && (V[0] = 255 & x, V[1] = x >>> 8 & 255, V[2] = x >>> 16 & 255, V[3] = x >>> 24 & 255, n.check = a(n.check, V, 4, 0)), S = x = 0, n.mode = 4;
+							n.head && (n.head.time = b), 512 & n.flags && (B[0] = 255 & b, B[1] = b >>> 8 & 255, B[2] = b >>> 16 & 255, B[3] = b >>> 24 & 255, n.check = a(n.check, B, 4, 0)), x = b = 0, n.mode = 4;
 						case 4:
-							for (; S < 16;) {
-								if (y === 0) break e;
-								y--, x += p[_++] << S, S += 8;
+							for (; x < 16;) {
+								if (v === 0) break e;
+								v--, b += p[g++] << x, x += 8;
 							}
-							n.head && (n.head.xflags = 255 & x, n.head.os = x >> 8), 512 & n.flags && (V[0] = 255 & x, V[1] = x >>> 8 & 255, n.check = a(n.check, V, 2, 0)), S = x = 0, n.mode = 5;
+							n.head && (n.head.xflags = 255 & b, n.head.os = b >> 8), 512 & n.flags && (B[0] = 255 & b, B[1] = b >>> 8 & 255, n.check = a(n.check, B, 2, 0)), x = b = 0, n.mode = 5;
 						case 5:
 							if (1024 & n.flags) {
-								for (; S < 16;) {
-									if (y === 0) break e;
-									y--, x += p[_++] << S, S += 8;
+								for (; x < 16;) {
+									if (v === 0) break e;
+									v--, b += p[g++] << x, x += 8;
 								}
-								n.length = x, n.head && (n.head.extra_len = x), 512 & n.flags && (V[0] = 255 & x, V[1] = x >>> 8 & 255, n.check = a(n.check, V, 2, 0)), S = x = 0;
+								n.length = b, n.head && (n.head.extra_len = b), 512 & n.flags && (B[0] = 255 & b, B[1] = b >>> 8 & 255, n.check = a(n.check, B, 2, 0)), x = b = 0;
 							} else n.head && (n.head.extra = null);
 							n.mode = 6;
 						case 6:
-							if (1024 & n.flags && (y < (D = n.length) && (D = y), D && (n.head && (I = n.head.extra_len - n.length, n.head.extra || (n.head.extra = Array(n.head.extra_len)), r.arraySet(n.head.extra, p, _, D, I)), 512 & n.flags && (n.check = a(n.check, p, D, _)), y -= D, _ += D, n.length -= D), n.length)) break e;
+							if (1024 & n.flags && (v < (E = n.length) && (E = v), E && (n.head && (F = n.head.extra_len - n.length, n.head.extra || (n.head.extra = Array(n.head.extra_len)), r.arraySet(n.head.extra, p, g, E, F)), 512 & n.flags && (n.check = a(n.check, p, E, g)), v -= E, g += E, n.length -= E), n.length)) break e;
 							n.length = 0, n.mode = 7;
 						case 7:
 							if (2048 & n.flags) {
-								if (y === 0) break e;
-								for (D = 0; I = p[_ + D++], n.head && I && n.length < 65536 && (n.head.name += String.fromCharCode(I)), I && D < y;);
-								if (512 & n.flags && (n.check = a(n.check, p, D, _)), y -= D, _ += D, I) break e;
+								if (v === 0) break e;
+								for (E = 0; F = p[g + E++], n.head && F && n.length < 65536 && (n.head.name += String.fromCharCode(F)), F && E < v;);
+								if (512 & n.flags && (n.check = a(n.check, p, E, g)), v -= E, g += E, F) break e;
 							} else n.head && (n.head.name = null);
 							n.length = 0, n.mode = 8;
 						case 8:
 							if (4096 & n.flags) {
-								if (y === 0) break e;
-								for (D = 0; I = p[_ + D++], n.head && I && n.length < 65536 && (n.head.comment += String.fromCharCode(I)), I && D < y;);
-								if (512 & n.flags && (n.check = a(n.check, p, D, _)), y -= D, _ += D, I) break e;
+								if (v === 0) break e;
+								for (E = 0; F = p[g + E++], n.head && F && n.length < 65536 && (n.head.comment += String.fromCharCode(F)), F && E < v;);
+								if (512 & n.flags && (n.check = a(n.check, p, E, g)), v -= E, g += E, F) break e;
 							} else n.head && (n.head.comment = null);
 							n.mode = 9;
 						case 9:
 							if (512 & n.flags) {
-								for (; S < 16;) {
-									if (y === 0) break e;
-									y--, x += p[_++] << S, S += 8;
+								for (; x < 16;) {
+									if (v === 0) break e;
+									v--, b += p[g++] << x, x += 8;
 								}
-								if (x !== (65535 & n.check)) {
+								if (b !== (65535 & n.check)) {
 									e.msg = "header crc mismatch", n.mode = 30;
 									break;
 								}
-								S = x = 0;
+								x = b = 0;
 							}
 							n.head && (n.head.hcrc = n.flags >> 9 & 1, n.head.done = !0), e.adler = n.check = 0, n.mode = 12;
 							break;
 						case 10:
-							for (; S < 32;) {
-								if (y === 0) break e;
-								y--, x += p[_++] << S, S += 8;
+							for (; x < 32;) {
+								if (v === 0) break e;
+								v--, b += p[g++] << x, x += 8;
 							}
-							e.adler = n.check = g(x), S = x = 0, n.mode = 11;
+							e.adler = n.check = h(b), x = b = 0, n.mode = 11;
 						case 11:
-							if (n.havedict === 0) return e.next_out = v, e.avail_out = b, e.next_in = _, e.avail_in = y, n.hold = x, n.bits = S, 2;
+							if (n.havedict === 0) return e.next_out = _, e.avail_out = y, e.next_in = g, e.avail_in = v, n.hold = b, n.bits = x, 2;
 							e.adler = n.check = 1, n.mode = 12;
 						case 12: if (t === 5 || t === 6) break e;
 						case 13:
 							if (n.last) {
-								x >>>= 7 & S, S -= 7 & S, n.mode = 27;
+								b >>>= 7 & x, x -= 7 & x, n.mode = 27;
 								break;
 							}
-							for (; S < 3;) {
-								if (y === 0) break e;
-								y--, x += p[_++] << S, S += 8;
+							for (; x < 3;) {
+								if (v === 0) break e;
+								v--, b += p[g++] << x, x += 8;
 							}
-							switch (n.last = 1 & x, --S, 3 & (x >>>= 1)) {
+							switch (n.last = 1 & b, --x, 3 & (b >>>= 1)) {
 								case 0:
 									n.mode = 14;
 									break;
 								case 1:
-									if (T(n), n.mode = 20, t !== 6) break;
-									x >>>= 2, S -= 2;
+									if (w(n), n.mode = 20, t !== 6) break;
+									b >>>= 2, x -= 2;
 									break e;
 								case 2:
 									n.mode = 17;
 									break;
 								case 3: e.msg = "invalid block type", n.mode = 30;
 							}
-							x >>>= 2, S -= 2;
+							b >>>= 2, x -= 2;
 							break;
 						case 14:
-							for (x >>>= 7 & S, S -= 7 & S; S < 32;) {
-								if (y === 0) break e;
-								y--, x += p[_++] << S, S += 8;
+							for (b >>>= 7 & x, x -= 7 & x; x < 32;) {
+								if (v === 0) break e;
+								v--, b += p[g++] << x, x += 8;
 							}
-							if ((65535 & x) != (x >>> 16 ^ 65535)) {
+							if ((65535 & b) != (b >>> 16 ^ 65535)) {
 								e.msg = "invalid stored block lengths", n.mode = 30;
 								break;
 							}
-							if (n.length = 65535 & x, S = x = 0, n.mode = 15, t === 6) break e;
+							if (n.length = 65535 & b, x = b = 0, n.mode = 15, t === 6) break e;
 						case 15: n.mode = 16;
 						case 16:
-							if (D = n.length) {
-								if (y < D && (D = y), b < D && (D = b), D === 0) break e;
-								r.arraySet(m, p, _, D, v), y -= D, _ += D, b -= D, v += D, n.length -= D;
+							if (E = n.length) {
+								if (v < E && (E = v), y < E && (E = y), E === 0) break e;
+								r.arraySet(m, p, g, E, _), v -= E, g += E, y -= E, _ += E, n.length -= E;
 								break;
 							}
 							n.mode = 12;
 							break;
 						case 17:
-							for (; S < 14;) {
-								if (y === 0) break e;
-								y--, x += p[_++] << S, S += 8;
+							for (; x < 14;) {
+								if (v === 0) break e;
+								v--, b += p[g++] << x, x += 8;
 							}
-							if (n.nlen = 257 + (31 & x), x >>>= 5, S -= 5, n.ndist = 1 + (31 & x), x >>>= 5, S -= 5, n.ncode = 4 + (15 & x), x >>>= 4, S -= 4, 286 < n.nlen || 30 < n.ndist) {
+							if (n.nlen = 257 + (31 & b), b >>>= 5, x -= 5, n.ndist = 1 + (31 & b), b >>>= 5, x -= 5, n.ncode = 4 + (15 & b), b >>>= 4, x -= 4, 286 < n.nlen || 30 < n.ndist) {
 								e.msg = "too many length or distance symbols", n.mode = 30;
 								break;
 							}
 							n.have = 0, n.mode = 18;
 						case 18:
 							for (; n.have < n.ncode;) {
-								for (; S < 3;) {
-									if (y === 0) break e;
-									y--, x += p[_++] << S, S += 8;
+								for (; x < 3;) {
+									if (v === 0) break e;
+									v--, b += p[g++] << x, x += 8;
 								}
-								n.lens[H[n.have++]] = 7 & x, x >>>= 3, S -= 3;
+								n.lens[V[n.have++]] = 7 & b, b >>>= 3, x -= 3;
 							}
-							for (; n.have < 19;) n.lens[H[n.have++]] = 0;
-							if (n.lencode = n.lendyn, n.lenbits = 7, R = { bits: n.lenbits }, L = s(0, n.lens, 0, 19, n.lencode, 0, n.work, R), n.lenbits = R.bits, L) {
+							for (; n.have < 19;) n.lens[V[n.have++]] = 0;
+							if (n.lencode = n.lendyn, n.lenbits = 7, L = { bits: n.lenbits }, I = s(0, n.lens, 0, 19, n.lencode, 0, n.work, L), n.lenbits = L.bits, I) {
 								e.msg = "invalid code lengths set", n.mode = 30;
 								break;
 							}
 							n.have = 0, n.mode = 19;
 						case 19:
 							for (; n.have < n.nlen + n.ndist;) {
-								for (; j = (B = n.lencode[x & (1 << n.lenbits) - 1]) >>> 16 & 255, M = 65535 & B, !((A = B >>> 24) <= S);) {
-									if (y === 0) break e;
-									y--, x += p[_++] << S, S += 8;
+								for (; A = (z = n.lencode[b & (1 << n.lenbits) - 1]) >>> 16 & 255, j = 65535 & z, !((k = z >>> 24) <= x);) {
+									if (v === 0) break e;
+									v--, b += p[g++] << x, x += 8;
 								}
-								if (M < 16) x >>>= A, S -= A, n.lens[n.have++] = M;
+								if (j < 16) b >>>= k, x -= k, n.lens[n.have++] = j;
 								else {
-									if (M === 16) {
-										for (z = A + 2; S < z;) {
-											if (y === 0) break e;
-											y--, x += p[_++] << S, S += 8;
+									if (j === 16) {
+										for (R = k + 2; x < R;) {
+											if (v === 0) break e;
+											v--, b += p[g++] << x, x += 8;
 										}
-										if (x >>>= A, S -= A, n.have === 0) {
+										if (b >>>= k, x -= k, n.have === 0) {
 											e.msg = "invalid bit length repeat", n.mode = 30;
 											break;
 										}
-										I = n.lens[n.have - 1], D = 3 + (3 & x), x >>>= 2, S -= 2;
-									} else if (M === 17) {
-										for (z = A + 3; S < z;) {
-											if (y === 0) break e;
-											y--, x += p[_++] << S, S += 8;
+										F = n.lens[n.have - 1], E = 3 + (3 & b), b >>>= 2, x -= 2;
+									} else if (j === 17) {
+										for (R = k + 3; x < R;) {
+											if (v === 0) break e;
+											v--, b += p[g++] << x, x += 8;
 										}
-										S -= A, I = 0, D = 3 + (7 & (x >>>= A)), x >>>= 3, S -= 3;
+										x -= k, F = 0, E = 3 + (7 & (b >>>= k)), b >>>= 3, x -= 3;
 									} else {
-										for (z = A + 7; S < z;) {
-											if (y === 0) break e;
-											y--, x += p[_++] << S, S += 8;
+										for (R = k + 7; x < R;) {
+											if (v === 0) break e;
+											v--, b += p[g++] << x, x += 8;
 										}
-										S -= A, I = 0, D = 11 + (127 & (x >>>= A)), x >>>= 7, S -= 7;
+										x -= k, F = 0, E = 11 + (127 & (b >>>= k)), b >>>= 7, x -= 7;
 									}
-									if (n.have + D > n.nlen + n.ndist) {
+									if (n.have + E > n.nlen + n.ndist) {
 										e.msg = "invalid bit length repeat", n.mode = 30;
 										break;
 									}
-									for (; D--;) n.lens[n.have++] = I;
+									for (; E--;) n.lens[n.have++] = F;
 								}
 							}
 							if (n.mode === 30) break;
@@ -5515,78 +5961,78 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 								e.msg = "invalid code -- missing end-of-block", n.mode = 30;
 								break;
 							}
-							if (n.lenbits = 9, R = { bits: n.lenbits }, L = s(c, n.lens, 0, n.nlen, n.lencode, 0, n.work, R), n.lenbits = R.bits, L) {
+							if (n.lenbits = 9, L = { bits: n.lenbits }, I = s(c, n.lens, 0, n.nlen, n.lencode, 0, n.work, L), n.lenbits = L.bits, I) {
 								e.msg = "invalid literal/lengths set", n.mode = 30;
 								break;
 							}
-							if (n.distbits = 6, n.distcode = n.distdyn, R = { bits: n.distbits }, L = s(l, n.lens, n.nlen, n.ndist, n.distcode, 0, n.work, R), n.distbits = R.bits, L) {
+							if (n.distbits = 6, n.distcode = n.distdyn, L = { bits: n.distbits }, I = s(l, n.lens, n.nlen, n.ndist, n.distcode, 0, n.work, L), n.distbits = L.bits, I) {
 								e.msg = "invalid distances set", n.mode = 30;
 								break;
 							}
 							if (n.mode = 20, t === 6) break e;
 						case 20: n.mode = 21;
 						case 21:
-							if (6 <= y && 258 <= b) {
-								e.next_out = v, e.avail_out = b, e.next_in = _, e.avail_in = y, n.hold = x, n.bits = S, o(e, w), v = e.next_out, m = e.output, b = e.avail_out, _ = e.next_in, p = e.input, y = e.avail_in, x = n.hold, S = n.bits, n.mode === 12 && (n.back = -1);
+							if (6 <= v && 258 <= y) {
+								e.next_out = _, e.avail_out = y, e.next_in = g, e.avail_in = v, n.hold = b, n.bits = x, o(e, C), _ = e.next_out, m = e.output, y = e.avail_out, g = e.next_in, p = e.input, v = e.avail_in, b = n.hold, x = n.bits, n.mode === 12 && (n.back = -1);
 								break;
 							}
-							for (n.back = 0; j = (B = n.lencode[x & (1 << n.lenbits) - 1]) >>> 16 & 255, M = 65535 & B, !((A = B >>> 24) <= S);) {
-								if (y === 0) break e;
-								y--, x += p[_++] << S, S += 8;
+							for (n.back = 0; A = (z = n.lencode[b & (1 << n.lenbits) - 1]) >>> 16 & 255, j = 65535 & z, !((k = z >>> 24) <= x);) {
+								if (v === 0) break e;
+								v--, b += p[g++] << x, x += 8;
 							}
-							if (j && !(240 & j)) {
-								for (N = A, P = j, F = M; j = (B = n.lencode[F + ((x & (1 << N + P) - 1) >> N)]) >>> 16 & 255, M = 65535 & B, !(N + (A = B >>> 24) <= S);) {
-									if (y === 0) break e;
-									y--, x += p[_++] << S, S += 8;
+							if (A && !(240 & A)) {
+								for (M = k, N = A, P = j; A = (z = n.lencode[P + ((b & (1 << M + N) - 1) >> M)]) >>> 16 & 255, j = 65535 & z, !(M + (k = z >>> 24) <= x);) {
+									if (v === 0) break e;
+									v--, b += p[g++] << x, x += 8;
 								}
-								x >>>= N, S -= N, n.back += N;
+								b >>>= M, x -= M, n.back += M;
 							}
-							if (x >>>= A, S -= A, n.back += A, n.length = M, j === 0) {
+							if (b >>>= k, x -= k, n.back += k, n.length = j, A === 0) {
 								n.mode = 26;
 								break;
 							}
-							if (32 & j) {
+							if (32 & A) {
 								n.back = -1, n.mode = 12;
 								break;
 							}
-							if (64 & j) {
+							if (64 & A) {
 								e.msg = "invalid literal/length code", n.mode = 30;
 								break;
 							}
-							n.extra = 15 & j, n.mode = 22;
+							n.extra = 15 & A, n.mode = 22;
 						case 22:
 							if (n.extra) {
-								for (z = n.extra; S < z;) {
-									if (y === 0) break e;
-									y--, x += p[_++] << S, S += 8;
+								for (R = n.extra; x < R;) {
+									if (v === 0) break e;
+									v--, b += p[g++] << x, x += 8;
 								}
-								n.length += x & (1 << n.extra) - 1, x >>>= n.extra, S -= n.extra, n.back += n.extra;
+								n.length += b & (1 << n.extra) - 1, b >>>= n.extra, x -= n.extra, n.back += n.extra;
 							}
 							n.was = n.length, n.mode = 23;
 						case 23:
-							for (; j = (B = n.distcode[x & (1 << n.distbits) - 1]) >>> 16 & 255, M = 65535 & B, !((A = B >>> 24) <= S);) {
-								if (y === 0) break e;
-								y--, x += p[_++] << S, S += 8;
+							for (; A = (z = n.distcode[b & (1 << n.distbits) - 1]) >>> 16 & 255, j = 65535 & z, !((k = z >>> 24) <= x);) {
+								if (v === 0) break e;
+								v--, b += p[g++] << x, x += 8;
 							}
-							if (!(240 & j)) {
-								for (N = A, P = j, F = M; j = (B = n.distcode[F + ((x & (1 << N + P) - 1) >> N)]) >>> 16 & 255, M = 65535 & B, !(N + (A = B >>> 24) <= S);) {
-									if (y === 0) break e;
-									y--, x += p[_++] << S, S += 8;
+							if (!(240 & A)) {
+								for (M = k, N = A, P = j; A = (z = n.distcode[P + ((b & (1 << M + N) - 1) >> M)]) >>> 16 & 255, j = 65535 & z, !(M + (k = z >>> 24) <= x);) {
+									if (v === 0) break e;
+									v--, b += p[g++] << x, x += 8;
 								}
-								x >>>= N, S -= N, n.back += N;
+								b >>>= M, x -= M, n.back += M;
 							}
-							if (x >>>= A, S -= A, n.back += A, 64 & j) {
+							if (b >>>= k, x -= k, n.back += k, 64 & A) {
 								e.msg = "invalid distance code", n.mode = 30;
 								break;
 							}
-							n.offset = M, n.extra = 15 & j, n.mode = 24;
+							n.offset = j, n.extra = 15 & A, n.mode = 24;
 						case 24:
 							if (n.extra) {
-								for (z = n.extra; S < z;) {
-									if (y === 0) break e;
-									y--, x += p[_++] << S, S += 8;
+								for (R = n.extra; x < R;) {
+									if (v === 0) break e;
+									v--, b += p[g++] << x, x += 8;
 								}
-								n.offset += x & (1 << n.extra) - 1, x >>>= n.extra, S -= n.extra, n.back += n.extra;
+								n.offset += b & (1 << n.extra) - 1, b >>>= n.extra, x -= n.extra, n.back += n.extra;
 							}
 							if (n.offset > n.dmax) {
 								e.msg = "invalid distance too far back", n.mode = 30;
@@ -5594,58 +6040,58 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 							}
 							n.mode = 25;
 						case 25:
-							if (b === 0) break e;
-							if (D = w - b, n.offset > D) {
-								if ((D = n.offset - D) > n.whave && n.sane) {
+							if (y === 0) break e;
+							if (E = C - y, n.offset > E) {
+								if ((E = n.offset - E) > n.whave && n.sane) {
 									e.msg = "invalid distance too far back", n.mode = 30;
 									break;
 								}
-								O = D > n.wnext ? (D -= n.wnext, n.wsize - D) : n.wnext - D, D > n.length && (D = n.length), k = n.window;
-							} else k = m, O = v - n.offset, D = n.length;
-							for (b < D && (D = b), b -= D, n.length -= D; m[v++] = k[O++], --D;);
+								D = E > n.wnext ? (E -= n.wnext, n.wsize - E) : n.wnext - E, E > n.length && (E = n.length), O = n.window;
+							} else O = m, D = _ - n.offset, E = n.length;
+							for (y < E && (E = y), y -= E, n.length -= E; m[_++] = O[D++], --E;);
 							n.length === 0 && (n.mode = 21);
 							break;
 						case 26:
-							if (b === 0) break e;
-							m[v++] = n.length, b--, n.mode = 21;
+							if (y === 0) break e;
+							m[_++] = n.length, y--, n.mode = 21;
 							break;
 						case 27:
 							if (n.wrap) {
-								for (; S < 32;) {
-									if (y === 0) break e;
-									y--, x |= p[_++] << S, S += 8;
+								for (; x < 32;) {
+									if (v === 0) break e;
+									v--, b |= p[g++] << x, x += 8;
 								}
-								if (w -= b, e.total_out += w, n.total += w, w && (e.adler = n.check = n.flags ? a(n.check, m, w, v - w) : i(n.check, m, w, v - w)), w = b, (n.flags ? x : g(x)) !== n.check) {
+								if (C -= y, e.total_out += C, n.total += C, C && (e.adler = n.check = n.flags ? a(n.check, m, C, _ - C) : i(n.check, m, C, _ - C)), C = y, (n.flags ? b : h(b)) !== n.check) {
 									e.msg = "incorrect data check", n.mode = 30;
 									break;
 								}
-								S = x = 0;
+								x = b = 0;
 							}
 							n.mode = 28;
 						case 28:
 							if (n.wrap && n.flags) {
-								for (; S < 32;) {
-									if (y === 0) break e;
-									y--, x += p[_++] << S, S += 8;
+								for (; x < 32;) {
+									if (v === 0) break e;
+									v--, b += p[g++] << x, x += 8;
 								}
-								if (x !== (4294967295 & n.total)) {
+								if (b !== (4294967295 & n.total)) {
 									e.msg = "incorrect length check", n.mode = 30;
 									break;
 								}
-								S = x = 0;
+								x = b = 0;
 							}
 							n.mode = 29;
 						case 29:
-							L = 1;
+							I = 1;
 							break e;
 						case 30:
-							L = -3;
+							I = -3;
 							break e;
 						case 31: return -4;
 						case 32:
 						default: return d;
 					}
-					return e.next_out = v, e.avail_out = b, e.next_in = _, e.avail_in = y, n.hold = x, n.bits = S, (n.wsize || w !== e.avail_out && n.mode < 30 && (n.mode < 27 || t !== 4)) && E(e, e.output, e.next_out, w - e.avail_out) ? (n.mode = 31, -4) : (C -= e.avail_in, w -= e.avail_out, e.total_in += C, e.total_out += w, n.total += w, n.wrap && w && (e.adler = n.check = n.flags ? a(n.check, m, w, e.next_out - w) : i(n.check, m, w, e.next_out - w)), e.data_type = n.bits + (n.last ? 64 : 0) + (n.mode === 12 ? 128 : 0) + (n.mode === 20 || n.mode === 15 ? 256 : 0), (C == 0 && w === 0 || t === 4) && L === u && (L = -5), L);
+					return e.next_out = _, e.avail_out = y, e.next_in = g, e.avail_in = v, n.hold = b, n.bits = x, (n.wsize || C !== e.avail_out && n.mode < 30 && (n.mode < 27 || t !== 4)) && T(e, e.output, e.next_out, C - e.avail_out) ? (n.mode = 31, -4) : (S -= e.avail_in, C -= e.avail_out, e.total_in += S, e.total_out += C, n.total += C, n.wrap && C && (e.adler = n.check = n.flags ? a(n.check, m, C, e.next_out - C) : i(n.check, m, C, e.next_out - C)), e.data_type = n.bits + (n.last ? 64 : 0) + (n.mode === 12 ? 128 : 0) + (n.mode === 20 || n.mode === 15 ? 256 : 0), (S == 0 && C === 0 || t === 4) && I === u && (I = -5), I);
 				}, n.inflateEnd = function(e) {
 					if (!e || !e.state) return d;
 					var t = e.state;
@@ -5655,7 +6101,7 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 					return e && e.state && 2 & (n = e.state).wrap ? ((n.head = t).done = !1, u) : d;
 				}, n.inflateSetDictionary = function(e, t) {
 					var n, r = t.length;
-					return e && e.state ? (n = e.state).wrap !== 0 && n.mode !== 11 ? d : n.mode === 11 && i(1, t, r, 0) !== n.check ? -3 : E(e, t, r, r) ? (n.mode = 31, -4) : (n.havedict = 1, u) : d;
+					return e && e.state ? (n = e.state).wrap !== 0 && n.mode !== 11 ? d : n.mode === 11 && i(1, t, r, 0) !== n.check ? -3 : T(e, t, r, r) ? (n.mode = 31, -4) : (n.havedict = 1, u) : d;
 				}, n.inflateInfo = "pako inflate (from Nodeca project)";
 			}, {
 				"../utils/common": 41,
@@ -5797,31 +6243,31 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 					64
 				];
 				t.exports = function(e, t, n, c, l, u, d, f) {
-					var p, m, g, _, v, y, b, x, S, C = f.bits, w = 0, T = 0, E = 0, D = 0, O = 0, k = 0, A = 0, j = 0, M = 0, N = 0, P = null, F = 0, I = new r.Buf16(16), L = new r.Buf16(16), R = null, z = 0;
-					for (w = 0; w <= 15; w++) I[w] = 0;
-					for (T = 0; T < c; T++) I[t[n + T]]++;
-					for (O = C, D = 15; 1 <= D && I[D] === 0; D--);
-					if (D < O && (O = D), D === 0) return l[u++] = 20971520, l[u++] = 20971520, f.bits = 1, 0;
-					for (E = 1; E < D && I[E] === 0; E++);
-					for (O < E && (O = E), w = j = 1; w <= 15; w++) if (j <<= 1, (j -= I[w]) < 0) return -1;
-					if (0 < j && (e === 0 || D !== 1)) return -1;
-					for (L[1] = 0, w = 1; w < 15; w++) L[w + 1] = L[w] + I[w];
-					for (T = 0; T < c; T++) t[n + T] !== 0 && (d[L[t[n + T]]++] = T);
-					if (y = e === 0 ? (P = R = d, 19) : e === 1 ? (P = i, F -= 257, R = a, z -= 257, 256) : (P = o, R = s, -1), w = E, v = u, A = T = N = 0, g = -1, _ = (M = 1 << (k = O)) - 1, e === 1 && 852 < M || e === 2 && 592 < M) return 1;
+					var p, m, h, g, _, v, y, b, x, S = f.bits, C = 0, w = 0, T = 0, E = 0, D = 0, O = 0, k = 0, A = 0, j = 0, M = 0, N = null, P = 0, F = new r.Buf16(16), I = new r.Buf16(16), L = null, R = 0;
+					for (C = 0; C <= 15; C++) F[C] = 0;
+					for (w = 0; w < c; w++) F[t[n + w]]++;
+					for (D = S, E = 15; 1 <= E && F[E] === 0; E--);
+					if (E < D && (D = E), E === 0) return l[u++] = 20971520, l[u++] = 20971520, f.bits = 1, 0;
+					for (T = 1; T < E && F[T] === 0; T++);
+					for (D < T && (D = T), C = A = 1; C <= 15; C++) if (A <<= 1, (A -= F[C]) < 0) return -1;
+					if (0 < A && (e === 0 || E !== 1)) return -1;
+					for (I[1] = 0, C = 1; C < 15; C++) I[C + 1] = I[C] + F[C];
+					for (w = 0; w < c; w++) t[n + w] !== 0 && (d[I[t[n + w]]++] = w);
+					if (v = e === 0 ? (N = L = d, 19) : e === 1 ? (N = i, P -= 257, L = a, R -= 257, 256) : (N = o, L = s, -1), C = T, _ = u, k = w = M = 0, h = -1, g = (j = 1 << (O = D)) - 1, e === 1 && 852 < j || e === 2 && 592 < j) return 1;
 					for (;;) {
-						for (b = w - A, S = d[T] < y ? (x = 0, d[T]) : d[T] > y ? (x = R[z + d[T]], P[F + d[T]]) : (x = 96, 0), p = 1 << w - A, E = m = 1 << k; l[v + (N >> A) + (m -= p)] = b << 24 | x << 16 | S | 0, m !== 0;);
-						for (p = 1 << w - 1; N & p;) p >>= 1;
-						if (p === 0 ? N = 0 : (N &= p - 1, N += p), T++, --I[w] == 0) {
-							if (w === D) break;
-							w = t[n + d[T]];
+						for (y = C - k, x = d[w] < v ? (b = 0, d[w]) : d[w] > v ? (b = L[R + d[w]], N[P + d[w]]) : (b = 96, 0), p = 1 << C - k, T = m = 1 << O; l[_ + (M >> k) + (m -= p)] = y << 24 | b << 16 | x | 0, m !== 0;);
+						for (p = 1 << C - 1; M & p;) p >>= 1;
+						if (p === 0 ? M = 0 : (M &= p - 1, M += p), w++, --F[C] == 0) {
+							if (C === E) break;
+							C = t[n + d[w]];
 						}
-						if (O < w && (N & _) !== g) {
-							for (A === 0 && (A = O), v += E, j = 1 << (k = w - A); k + A < D && !((j -= I[k + A]) <= 0);) k++, j <<= 1;
-							if (M += 1 << k, e === 1 && 852 < M || e === 2 && 592 < M) return 1;
-							l[g = N & _] = O << 24 | k << 16 | v - u | 0;
+						if (D < C && (M & g) !== h) {
+							for (k === 0 && (k = D), _ += T, A = 1 << (O = C - k); O + k < E && !((A -= F[O + k]) <= 0);) O++, A <<= 1;
+							if (j += 1 << O, e === 1 && 852 < j || e === 2 && 592 < j) return 1;
+							l[h = M & g] = D << 24 | O << 16 | _ - u | 0;
 						}
 					}
-					return N !== 0 && (l[v + N] = w - A << 24 | 4194304), f.bits = O, 0;
+					return M !== 0 && (l[_ + M] = C - k << 24 | 4194304), f.bits = D, 0;
 				};
 			}, { "../utils/common": 41 }],
 			51: [function(e, t, n) {
@@ -5842,7 +6288,7 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 				function o(e) {
 					for (var t = e.length; 0 <= --t;) e[t] = 0;
 				}
-				var s = 0, c = 29, l = 256, u = l + 1 + c, d = 30, f = 19, p = 2 * u + 1, m = 15, g = 16, _ = 7, v = 256, y = 16, b = 17, x = 18, S = [
+				var s = 0, c = 29, l = 256, u = l + 1 + c, d = 30, f = 19, p = 2 * u + 1, m = 15, h = 16, g = 7, _ = 256, v = 16, y = 17, b = 18, x = [
 					0,
 					0,
 					0,
@@ -5872,7 +6318,7 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 					5,
 					5,
 					0
-				], C = [
+				], S = [
 					0,
 					0,
 					0,
@@ -5903,7 +6349,7 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 					12,
 					13,
 					13
-				], w = [
+				], C = [
 					0,
 					0,
 					0,
@@ -5923,7 +6369,7 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 					2,
 					3,
 					7
-				], T = [
+				], w = [
 					16,
 					17,
 					18,
@@ -5943,123 +6389,123 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 					14,
 					1,
 					15
-				], E = Array(2 * (u + 2));
+				], T = Array(2 * (u + 2));
+				o(T);
+				var E = Array(2 * d);
 				o(E);
-				var D = Array(2 * d);
+				var D = Array(512);
 				o(D);
-				var O = Array(512);
+				var O = Array(256);
 				o(O);
-				var k = Array(256);
+				var k = Array(c);
 				o(k);
-				var A = Array(c);
-				o(A);
-				var j, M, N, P = Array(d);
-				function F(e, t, n, r, i) {
+				var A, j, M, N = Array(d);
+				function P(e, t, n, r, i) {
 					this.static_tree = e, this.extra_bits = t, this.extra_base = n, this.elems = r, this.max_length = i, this.has_stree = e && e.length;
 				}
-				function I(e, t) {
+				function F(e, t) {
 					this.dyn_tree = e, this.max_code = 0, this.stat_desc = t;
 				}
-				function L(e) {
-					return e < 256 ? O[e] : O[256 + (e >>> 7)];
+				function I(e) {
+					return e < 256 ? D[e] : D[256 + (e >>> 7)];
 				}
-				function R(e, t) {
+				function L(e, t) {
 					e.pending_buf[e.pending++] = 255 & t, e.pending_buf[e.pending++] = t >>> 8 & 255;
 				}
-				function z(e, t, n) {
-					e.bi_valid > g - n ? (e.bi_buf |= t << e.bi_valid & 65535, R(e, e.bi_buf), e.bi_buf = t >> g - e.bi_valid, e.bi_valid += n - g) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += n);
+				function R(e, t, n) {
+					e.bi_valid > h - n ? (e.bi_buf |= t << e.bi_valid & 65535, L(e, e.bi_buf), e.bi_buf = t >> h - e.bi_valid, e.bi_valid += n - h) : (e.bi_buf |= t << e.bi_valid & 65535, e.bi_valid += n);
 				}
-				function B(e, t, n) {
-					z(e, n[2 * t], n[2 * t + 1]);
+				function z(e, t, n) {
+					R(e, n[2 * t], n[2 * t + 1]);
 				}
-				function V(e, t) {
+				function B(e, t) {
 					for (var n = 0; n |= 1 & e, e >>>= 1, n <<= 1, 0 < --t;);
 					return n >>> 1;
 				}
-				function H(e, t, n) {
+				function V(e, t, n) {
 					var r, i, a = Array(m + 1), o = 0;
 					for (r = 1; r <= m; r++) a[r] = o = o + n[r - 1] << 1;
 					for (i = 0; i <= t; i++) {
 						var s = e[2 * i + 1];
-						s !== 0 && (e[2 * i] = V(a[s]++, s));
+						s !== 0 && (e[2 * i] = B(a[s]++, s));
 					}
 				}
-				function U(e) {
+				function H(e) {
 					var t;
 					for (t = 0; t < u; t++) e.dyn_ltree[2 * t] = 0;
 					for (t = 0; t < d; t++) e.dyn_dtree[2 * t] = 0;
 					for (t = 0; t < f; t++) e.bl_tree[2 * t] = 0;
-					e.dyn_ltree[2 * v] = 1, e.opt_len = e.static_len = 0, e.last_lit = e.matches = 0;
+					e.dyn_ltree[2 * _] = 1, e.opt_len = e.static_len = 0, e.last_lit = e.matches = 0;
 				}
-				function W(e) {
-					8 < e.bi_valid ? R(e, e.bi_buf) : 0 < e.bi_valid && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
+				function U(e) {
+					8 < e.bi_valid ? L(e, e.bi_buf) : 0 < e.bi_valid && (e.pending_buf[e.pending++] = e.bi_buf), e.bi_buf = 0, e.bi_valid = 0;
 				}
-				function G(e, t, n, r) {
+				function W(e, t, n, r) {
 					var i = 2 * t, a = 2 * n;
 					return e[i] < e[a] || e[i] === e[a] && r[t] <= r[n];
 				}
-				function K(e, t, n) {
-					for (var r = e.heap[n], i = n << 1; i <= e.heap_len && (i < e.heap_len && G(t, e.heap[i + 1], e.heap[i], e.depth) && i++, !G(t, r, e.heap[i], e.depth));) e.heap[n] = e.heap[i], n = i, i <<= 1;
+				function G(e, t, n) {
+					for (var r = e.heap[n], i = n << 1; i <= e.heap_len && (i < e.heap_len && W(t, e.heap[i + 1], e.heap[i], e.depth) && i++, !W(t, r, e.heap[i], e.depth));) e.heap[n] = e.heap[i], n = i, i <<= 1;
 					e.heap[n] = r;
 				}
-				function q(e, t, n) {
+				function K(e, t, n) {
 					var r, i, a, o, s = 0;
-					if (e.last_lit !== 0) for (; r = e.pending_buf[e.d_buf + 2 * s] << 8 | e.pending_buf[e.d_buf + 2 * s + 1], i = e.pending_buf[e.l_buf + s], s++, r === 0 ? B(e, i, t) : (B(e, (a = k[i]) + l + 1, t), (o = S[a]) !== 0 && z(e, i -= A[a], o), B(e, a = L(--r), n), (o = C[a]) !== 0 && z(e, r -= P[a], o)), s < e.last_lit;);
-					B(e, v, t);
+					if (e.last_lit !== 0) for (; r = e.pending_buf[e.d_buf + 2 * s] << 8 | e.pending_buf[e.d_buf + 2 * s + 1], i = e.pending_buf[e.l_buf + s], s++, r === 0 ? z(e, i, t) : (z(e, (a = O[i]) + l + 1, t), (o = x[a]) !== 0 && R(e, i -= k[a], o), z(e, a = I(--r), n), (o = S[a]) !== 0 && R(e, r -= N[a], o)), s < e.last_lit;);
+					z(e, _, t);
 				}
-				function J(e, t) {
+				function q(e, t) {
 					var n, r, i, a = t.dyn_tree, o = t.stat_desc.static_tree, s = t.stat_desc.has_stree, c = t.stat_desc.elems, l = -1;
 					for (e.heap_len = 0, e.heap_max = p, n = 0; n < c; n++) a[2 * n] === 0 ? a[2 * n + 1] = 0 : (e.heap[++e.heap_len] = l = n, e.depth[n] = 0);
 					for (; e.heap_len < 2;) a[2 * (i = e.heap[++e.heap_len] = l < 2 ? ++l : 0)] = 1, e.depth[i] = 0, e.opt_len--, s && (e.static_len -= o[2 * i + 1]);
-					for (t.max_code = l, n = e.heap_len >> 1; 1 <= n; n--) K(e, a, n);
-					for (i = c; n = e.heap[1], e.heap[1] = e.heap[e.heap_len--], K(e, a, 1), r = e.heap[1], e.heap[--e.heap_max] = n, e.heap[--e.heap_max] = r, a[2 * i] = a[2 * n] + a[2 * r], e.depth[i] = (e.depth[n] >= e.depth[r] ? e.depth[n] : e.depth[r]) + 1, a[2 * n + 1] = a[2 * r + 1] = i, e.heap[1] = i++, K(e, a, 1), 2 <= e.heap_len;);
+					for (t.max_code = l, n = e.heap_len >> 1; 1 <= n; n--) G(e, a, n);
+					for (i = c; n = e.heap[1], e.heap[1] = e.heap[e.heap_len--], G(e, a, 1), r = e.heap[1], e.heap[--e.heap_max] = n, e.heap[--e.heap_max] = r, a[2 * i] = a[2 * n] + a[2 * r], e.depth[i] = (e.depth[n] >= e.depth[r] ? e.depth[n] : e.depth[r]) + 1, a[2 * n + 1] = a[2 * r + 1] = i, e.heap[1] = i++, G(e, a, 1), 2 <= e.heap_len;);
 					e.heap[--e.heap_max] = e.heap[1], function(e, t) {
-						var n, r, i, a, o, s, c = t.dyn_tree, l = t.max_code, u = t.stat_desc.static_tree, d = t.stat_desc.has_stree, f = t.stat_desc.extra_bits, g = t.stat_desc.extra_base, _ = t.stat_desc.max_length, v = 0;
+						var n, r, i, a, o, s, c = t.dyn_tree, l = t.max_code, u = t.stat_desc.static_tree, d = t.stat_desc.has_stree, f = t.stat_desc.extra_bits, h = t.stat_desc.extra_base, g = t.stat_desc.max_length, _ = 0;
 						for (a = 0; a <= m; a++) e.bl_count[a] = 0;
-						for (c[2 * e.heap[e.heap_max] + 1] = 0, n = e.heap_max + 1; n < p; n++) _ < (a = c[2 * c[2 * (r = e.heap[n]) + 1] + 1] + 1) && (a = _, v++), c[2 * r + 1] = a, l < r || (e.bl_count[a]++, o = 0, g <= r && (o = f[r - g]), s = c[2 * r], e.opt_len += s * (a + o), d && (e.static_len += s * (u[2 * r + 1] + o)));
-						if (v !== 0) {
+						for (c[2 * e.heap[e.heap_max] + 1] = 0, n = e.heap_max + 1; n < p; n++) g < (a = c[2 * c[2 * (r = e.heap[n]) + 1] + 1] + 1) && (a = g, _++), c[2 * r + 1] = a, l < r || (e.bl_count[a]++, o = 0, h <= r && (o = f[r - h]), s = c[2 * r], e.opt_len += s * (a + o), d && (e.static_len += s * (u[2 * r + 1] + o)));
+						if (_ !== 0) {
 							do {
-								for (a = _ - 1; e.bl_count[a] === 0;) a--;
-								e.bl_count[a]--, e.bl_count[a + 1] += 2, e.bl_count[_]--, v -= 2;
-							} while (0 < v);
-							for (a = _; a !== 0; a--) for (r = e.bl_count[a]; r !== 0;) l < (i = e.heap[--n]) || (c[2 * i + 1] !== a && (e.opt_len += (a - c[2 * i + 1]) * c[2 * i], c[2 * i + 1] = a), r--);
+								for (a = g - 1; e.bl_count[a] === 0;) a--;
+								e.bl_count[a]--, e.bl_count[a + 1] += 2, e.bl_count[g]--, _ -= 2;
+							} while (0 < _);
+							for (a = g; a !== 0; a--) for (r = e.bl_count[a]; r !== 0;) l < (i = e.heap[--n]) || (c[2 * i + 1] !== a && (e.opt_len += (a - c[2 * i + 1]) * c[2 * i], c[2 * i + 1] = a), r--);
 						}
-					}(e, t), H(a, l, e.bl_count);
+					}(e, t), V(a, l, e.bl_count);
 				}
-				function Y(e, t, n) {
+				function ee(e, t, n) {
 					var r, i, a = -1, o = t[1], s = 0, c = 7, l = 4;
-					for (o === 0 && (c = 138, l = 3), t[2 * (n + 1) + 1] = 65535, r = 0; r <= n; r++) i = o, o = t[2 * (r + 1) + 1], ++s < c && i === o || (s < l ? e.bl_tree[2 * i] += s : i === 0 ? s <= 10 ? e.bl_tree[2 * b]++ : e.bl_tree[2 * x]++ : (i !== a && e.bl_tree[2 * i]++, e.bl_tree[2 * y]++), a = i, l = (s = 0) === o ? (c = 138, 3) : i === o ? (c = 6, 3) : (c = 7, 4));
+					for (o === 0 && (c = 138, l = 3), t[2 * (n + 1) + 1] = 65535, r = 0; r <= n; r++) i = o, o = t[2 * (r + 1) + 1], ++s < c && i === o || (s < l ? e.bl_tree[2 * i] += s : i === 0 ? s <= 10 ? e.bl_tree[2 * y]++ : e.bl_tree[2 * b]++ : (i !== a && e.bl_tree[2 * i]++, e.bl_tree[2 * v]++), a = i, l = (s = 0) === o ? (c = 138, 3) : i === o ? (c = 6, 3) : (c = 7, 4));
 				}
-				function X(e, t, n) {
+				function te(e, t, n) {
 					var r, i, a = -1, o = t[1], s = 0, c = 7, l = 4;
 					for (o === 0 && (c = 138, l = 3), r = 0; r <= n; r++) if (i = o, o = t[2 * (r + 1) + 1], !(++s < c && i === o)) {
-						if (s < l) for (; B(e, i, e.bl_tree), --s != 0;);
-						else i === 0 ? s <= 10 ? (B(e, b, e.bl_tree), z(e, s - 3, 3)) : (B(e, x, e.bl_tree), z(e, s - 11, 7)) : (i !== a && (B(e, i, e.bl_tree), s--), B(e, y, e.bl_tree), z(e, s - 3, 2));
+						if (s < l) for (; z(e, i, e.bl_tree), --s != 0;);
+						else i === 0 ? s <= 10 ? (z(e, y, e.bl_tree), R(e, s - 3, 3)) : (z(e, b, e.bl_tree), R(e, s - 11, 7)) : (i !== a && (z(e, i, e.bl_tree), s--), z(e, v, e.bl_tree), R(e, s - 3, 2));
 						a = i, l = (s = 0) === o ? (c = 138, 3) : i === o ? (c = 6, 3) : (c = 7, 4);
 					}
 				}
-				o(P);
-				var Z = !1;
-				function Q(e, t, n, i) {
-					z(e, (s << 1) + (i ? 1 : 0), 3), function(e, t, n, i) {
-						W(e), i && (R(e, n), R(e, ~n)), r.arraySet(e.pending_buf, e.window, t, n, e.pending), e.pending += n;
+				o(N);
+				var ne = !1;
+				function re(e, t, n, i) {
+					R(e, (s << 1) + (i ? 1 : 0), 3), function(e, t, n, i) {
+						U(e), i && (L(e, n), L(e, ~n)), r.arraySet(e.pending_buf, e.window, t, n, e.pending), e.pending += n;
 					}(e, t, n, !0);
 				}
 				n._tr_init = function(e) {
-					Z ||= (function() {
+					ne ||= (function() {
 						var e, t, n, r, i, a = Array(m + 1);
-						for (r = n = 0; r < c - 1; r++) for (A[r] = n, e = 0; e < 1 << S[r]; e++) k[n++] = r;
-						for (k[n - 1] = r, r = i = 0; r < 16; r++) for (P[r] = i, e = 0; e < 1 << C[r]; e++) O[i++] = r;
-						for (i >>= 7; r < d; r++) for (P[r] = i << 7, e = 0; e < 1 << C[r] - 7; e++) O[256 + i++] = r;
+						for (r = n = 0; r < c - 1; r++) for (k[r] = n, e = 0; e < 1 << x[r]; e++) O[n++] = r;
+						for (O[n - 1] = r, r = i = 0; r < 16; r++) for (N[r] = i, e = 0; e < 1 << S[r]; e++) D[i++] = r;
+						for (i >>= 7; r < d; r++) for (N[r] = i << 7, e = 0; e < 1 << S[r] - 7; e++) D[256 + i++] = r;
 						for (t = 0; t <= m; t++) a[t] = 0;
-						for (e = 0; e <= 143;) E[2 * e + 1] = 8, e++, a[8]++;
-						for (; e <= 255;) E[2 * e + 1] = 9, e++, a[9]++;
-						for (; e <= 279;) E[2 * e + 1] = 7, e++, a[7]++;
-						for (; e <= 287;) E[2 * e + 1] = 8, e++, a[8]++;
-						for (H(E, u + 1, a), e = 0; e < d; e++) D[2 * e + 1] = 5, D[2 * e] = V(e, 5);
-						j = new F(E, S, l + 1, u, m), M = new F(D, C, 0, d, m), N = new F([], w, 0, f, _);
-					}(), !0), e.l_desc = new I(e.dyn_ltree, j), e.d_desc = new I(e.dyn_dtree, M), e.bl_desc = new I(e.bl_tree, N), e.bi_buf = 0, e.bi_valid = 0, U(e);
-				}, n._tr_stored_block = Q, n._tr_flush_block = function(e, t, n, r) {
+						for (e = 0; e <= 143;) T[2 * e + 1] = 8, e++, a[8]++;
+						for (; e <= 255;) T[2 * e + 1] = 9, e++, a[9]++;
+						for (; e <= 279;) T[2 * e + 1] = 7, e++, a[7]++;
+						for (; e <= 287;) T[2 * e + 1] = 8, e++, a[8]++;
+						for (V(T, u + 1, a), e = 0; e < d; e++) E[2 * e + 1] = 5, E[2 * e] = B(e, 5);
+						A = new P(T, x, l + 1, u, m), j = new P(E, S, 0, d, m), M = new P([], C, 0, f, g);
+					}(), !0), e.l_desc = new F(e.dyn_ltree, A), e.d_desc = new F(e.dyn_dtree, j), e.bl_desc = new F(e.bl_tree, M), e.bi_buf = 0, e.bi_valid = 0, H(e);
+				}, n._tr_stored_block = re, n._tr_flush_block = function(e, t, n, r) {
 					var o, s, c = 0;
 					0 < e.level ? (e.strm.data_type === 2 && (e.strm.data_type = function(e) {
 						var t, n = 4093624447;
@@ -6067,20 +6513,20 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 						if (e.dyn_ltree[18] !== 0 || e.dyn_ltree[20] !== 0 || e.dyn_ltree[26] !== 0) return a;
 						for (t = 32; t < l; t++) if (e.dyn_ltree[2 * t] !== 0) return a;
 						return i;
-					}(e)), J(e, e.l_desc), J(e, e.d_desc), c = function(e) {
+					}(e)), q(e, e.l_desc), q(e, e.d_desc), c = function(e) {
 						var t;
-						for (Y(e, e.dyn_ltree, e.l_desc.max_code), Y(e, e.dyn_dtree, e.d_desc.max_code), J(e, e.bl_desc), t = f - 1; 3 <= t && e.bl_tree[2 * T[t] + 1] === 0; t--);
+						for (ee(e, e.dyn_ltree, e.l_desc.max_code), ee(e, e.dyn_dtree, e.d_desc.max_code), q(e, e.bl_desc), t = f - 1; 3 <= t && e.bl_tree[2 * w[t] + 1] === 0; t--);
 						return e.opt_len += 3 * (t + 1) + 5 + 5 + 4, t;
-					}(e), o = e.opt_len + 3 + 7 >>> 3, (s = e.static_len + 3 + 7 >>> 3) <= o && (o = s)) : o = s = n + 5, n + 4 <= o && t !== -1 ? Q(e, t, n, r) : e.strategy === 4 || s === o ? (z(e, 2 + (r ? 1 : 0), 3), q(e, E, D)) : (z(e, 4 + (r ? 1 : 0), 3), function(e, t, n, r) {
+					}(e), o = e.opt_len + 3 + 7 >>> 3, (s = e.static_len + 3 + 7 >>> 3) <= o && (o = s)) : o = s = n + 5, n + 4 <= o && t !== -1 ? re(e, t, n, r) : e.strategy === 4 || s === o ? (R(e, 2 + (r ? 1 : 0), 3), K(e, T, E)) : (R(e, 4 + (r ? 1 : 0), 3), function(e, t, n, r) {
 						var i;
-						for (z(e, t - 257, 5), z(e, n - 1, 5), z(e, r - 4, 4), i = 0; i < r; i++) z(e, e.bl_tree[2 * T[i] + 1], 3);
-						X(e, e.dyn_ltree, t - 1), X(e, e.dyn_dtree, n - 1);
-					}(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, c + 1), q(e, e.dyn_ltree, e.dyn_dtree)), U(e), r && W(e);
+						for (R(e, t - 257, 5), R(e, n - 1, 5), R(e, r - 4, 4), i = 0; i < r; i++) R(e, e.bl_tree[2 * w[i] + 1], 3);
+						te(e, e.dyn_ltree, t - 1), te(e, e.dyn_dtree, n - 1);
+					}(e, e.l_desc.max_code + 1, e.d_desc.max_code + 1, c + 1), K(e, e.dyn_ltree, e.dyn_dtree)), H(e), r && U(e);
 				}, n._tr_tally = function(e, t, n) {
-					return e.pending_buf[e.d_buf + 2 * e.last_lit] = t >>> 8 & 255, e.pending_buf[e.d_buf + 2 * e.last_lit + 1] = 255 & t, e.pending_buf[e.l_buf + e.last_lit] = 255 & n, e.last_lit++, t === 0 ? e.dyn_ltree[2 * n]++ : (e.matches++, t--, e.dyn_ltree[2 * (k[n] + l + 1)]++, e.dyn_dtree[2 * L(t)]++), e.last_lit === e.lit_bufsize - 1;
+					return e.pending_buf[e.d_buf + 2 * e.last_lit] = t >>> 8 & 255, e.pending_buf[e.d_buf + 2 * e.last_lit + 1] = 255 & t, e.pending_buf[e.l_buf + e.last_lit] = 255 & n, e.last_lit++, t === 0 ? e.dyn_ltree[2 * n]++ : (e.matches++, t--, e.dyn_ltree[2 * (O[n] + l + 1)]++, e.dyn_dtree[2 * I(t)]++), e.last_lit === e.lit_bufsize - 1;
 				}, n._tr_align = function(e) {
-					z(e, 2, 3), B(e, v, E), function(e) {
-						e.bi_valid === 16 ? (R(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : 8 <= e.bi_valid && (e.pending_buf[e.pending++] = 255 & e.bi_buf, e.bi_buf >>= 8, e.bi_valid -= 8);
+					R(e, 2, 3), z(e, _, T), function(e) {
+						e.bi_valid === 16 ? (L(e, e.bi_buf), e.bi_buf = 0, e.bi_valid = 0) : 8 <= e.bi_valid && (e.pending_buf[e.pending++] = 255 & e.bi_buf, e.bi_buf >>= 8, e.bi_valid -= 8);
 					}(e);
 				};
 			}, { "../utils/common": 41 }],
@@ -6169,19 +6615,19 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 			}, {}]
 		}, {}, [10])(10);
 	});
-})))(), _2_zip_default = new class extends PluginLoader {
+})))(), Mr = new class extends xt {
 	name = "zip";
 	async installDownload(e) {
 		console.log("[loader zip] begin:", e);
-		let t = await getPluginFsPath("__temp__");
-		await mkdir(t, { recursive: !0 }), await writeFile(await join(t, "temp.zip"), new Uint8Array(await e.arrayBuffer())), console.log("[loader zip] temp:", t);
-		let n = await (0, import_jszip_min.loadAsync)(e);
+		let t = await yt("__temp__");
+		await Rt(t, { recursive: !0 }), await Ut(await Z(t, "temp.zip"), new Uint8Array(await e.arrayBuffer())), console.log("[loader zip] temp:", t);
+		let n = await (0, jr.loadAsync)(e);
 		console.log(n.files);
-		let r = JSON.parse(await n.file("manifest.json")?.async("string") ?? "{}"), i = await getPluginFsPath(r.name.id);
+		let r = JSON.parse(await n.file("manifest.json")?.async("string") ?? "{}"), i = await yt(r.name.id);
 		try {
-			await remove(i, { recursive: !0 });
+			await Ht(i, { recursive: !0 });
 		} catch {}
-		await mkdir(i, { recursive: !0 });
+		await Rt(i, { recursive: !0 });
 		let a = [];
 		n.forEach((e, t) => {
 			a.push({
@@ -6189,7 +6635,7 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 				file: t
 			});
 		});
-		for (let { file: e, path: t } of a) e.dir ? await mkdir(await join(i, t), { recursive: !0 }) : await writeFile(await join(i, t), await e.async("uint8array"), { create: !0 });
+		for (let { file: e, path: t } of a) e.dir ? await Rt(await Z(i, t), { recursive: !0 }) : await Ut(await Z(i, t), await e.async("uint8array"), { create: !0 });
 		return r;
 	}
 	canInstall(e) {
@@ -6197,16 +6643,16 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 	}
 	async load(e) {
 		if (!e.meta.entry) throw Error("not found entry");
-		let t = await getPluginFsPath(e.pluginName);
+		let t = await yt(e.pluginName);
 		console.log("[loader zip] baseDir:", t, e.meta.entry);
 		let n = document.createElement("script");
 		if (n.addEventListener("error", (e) => {
 			throw e;
-		}), n.type = "module", n.async = !0, n.src = decodeURIComponent(convertFileSrc(await join(t, e.meta.entry.jsPath), "local")), document.body.appendChild(n), !e.meta.entry?.cssPath) return;
+		}), n.type = "module", n.async = !0, n.src = decodeURIComponent(mt(await Z(t, e.meta.entry.jsPath), "local")), document.body.appendChild(n), !e.meta.entry?.cssPath) return;
 		let r = e.meta.entry.cssPath;
 		if (r == "auto") {
 			var i = "";
-			let e = await readDir(t);
+			let e = await zt(t);
 			for (let t of e) if (t.name.endsWith(".css")) {
 				var i = t.name;
 				break;
@@ -6215,19 +6661,19 @@ while (r === s[++i] && r === s[++i] && r === s[++i] && r === s[++i] && r === s[+
 		let a = document.createElement("link");
 		a.addEventListener("error", (e) => {
 			throw e;
-		}), a.rel = "stylesheet", a.href = decodeURIComponent(convertFileSrc(await join(t, i), "local")), document.head.appendChild(a);
+		}), a.rel = "stylesheet", a.href = decodeURIComponent(mt(await Z(t, i), "local")), document.head.appendChild(a);
 	}
-}(), rawBooters = /* @__PURE__ */ Object.assign({
-	"./booter/0_configSetter.ts": _0_configSetter_default,
-	"./booter/10_apiTest.ts": _10_apiTest_default,
-	"./booter/20_resourceTest.ts": _20_resourceTest_default,
-	"./booter/30_boot.ts": _30_boot_default,
-	"./booter/40_auth.ts": _40_auth_default,
-	"./booter/50_otherProcess.ts": _50_otherProcess_default
-}), booters = sortBy(Object.entries(rawBooters), ([e]) => Number(e.match(/[\d\.]+(?=_)/)?.[0])).map((e) => e[1]);
-const bootPlugin = async (e) => {
-	let { plugins: t, pluginSteps: n } = usePluginStore();
-	t.set(e.name, markRaw(e)), n[e.name] = {
+}(), Nr = /* @__PURE__ */ Object.assign({
+	"./booter/0_configSetter.ts": St,
+	"./booter/10_apiTest.ts": Et,
+	"./booter/20_resourceTest.ts": Dt,
+	"./booter/30_boot.ts": Ot,
+	"./booter/40_auth.ts": At,
+	"./booter/50_otherProcess.ts": jt
+}), Pr = Te(Object.entries(Nr), ([e]) => Number(e.match(/[\d\.]+(?=_)/)?.[0])).map((e) => e[1]);
+const Fr = async (e) => {
+	let { plugins: t, pluginSteps: n } = lt();
+	t.set(e.name, y(e)), n[e.name] = {
 		steps: [],
 		now: {
 			stepsIndex: 0,
@@ -6236,13 +6682,13 @@ const bootPlugin = async (e) => {
 	};
 	try {
 		let t = {};
-		for (let r of booters) {
+		for (let r of Pr) {
 			let i = n[e.name].steps.length;
 			n[e.name].steps[i] = {
 				name: r.name,
 				description: ""
 			}, n[e.name].now.stepsIndex = i, n[e.name].now.status = "process", await r.call(e, (t) => {
-				isString(t) ? n[e.name].steps[i].description = t : (t.description && (n[e.name].steps[i].description = t.description), t.name && (n[e.name].steps[i].name = t.name));
+				oe(t) ? n[e.name].steps[i].description = t : (t.description && (n[e.name].steps[i].description = t.description), t.name && (n[e.name].steps[i].name = t.name));
 			}, t);
 		}
 		n[e.name].now.stepsIndex++;
@@ -6251,30 +6697,37 @@ const bootPlugin = async (e) => {
 	}
 	console.log(`[plugin usePluginStore.$loadPlugin] plugin "${e.name}" load done`);
 };
-var rawInstallers = /* @__PURE__ */ Object.assign({
-	"./installer/10_normalUrl.ts": _10_normalUrl_default,
-	"./installer/20_local.ts": _20_local_default,
-	"./installer/30_dev.ts": _30_dev_default,
-	"./installer/40_github.ts": _40_github_default
-}), installers = sortBy(Object.entries(rawInstallers), ([e]) => Number(e.match(/[\d\.]+(?=_)/)?.[0])).map((e) => e[1]).reverse();
-const usePluginConfig = () => useNativeStore(coreName, "pluginInstallSourceOverrides", []), installDepends = (e, t, n) => e.createLoading("依赖安装/检查", async (e) => {
+var Ir = /* @__PURE__ */ Object.assign({
+	"./installer/10_normalUrl.ts": Mt,
+	"./installer/20_local.ts": Gt,
+	"./installer/30_dev.ts": Kt,
+	"./installer/40_github.ts": Er,
+	"./installer/9999_awesome.ts": Or
+}), Lr = Te(Object.entries(Ir), ([e]) => Number(e.match(/[\d\.]+(?=_)/)?.[0])).map((e) => e[1]).reverse();
+const Rr = () => i(Y, "pluginInstallSourceOverrides", []), zr = (e, t, n) => e.createLoading("依赖安装/检查", async (e) => {
 	e.retryable = !0;
-	let i = 0, a = n ?? new Set((await db.value.selectFrom("plugin").select("pluginName").execute()).map((e) => e.pluginName)), o = usePluginConfig();
-	for (let { id: n, download: r } of t.require) a.has(n) || !r || (console.log(`从 ${t.name.id} 发现未安装依赖: ${n} ->`, r), e.description = `安装: ${n}`, await installPlugin(o.value.find((e) => e.id == n && e.enabled)?.install ?? r), i++);
+	let i = 0, a = n ?? new Set((await r.value.selectFrom("plugin").select("pluginName").execute()).map((e) => e.pluginName)), o = Rr();
+	for (let { id: n, download: r } of t.require) a.has(n) || !r || (console.log(`从 ${t.name.id} 发现未安装依赖: ${n} ->`, r), e.description = `安装: ${n}`, await Br(o.value.find((e) => e.id == n && e.enabled)?.install ?? r), i++);
 	e.description = `安装完成，共${i}个`;
-}), installPlugin = (e, t) => createDownloadMessage(`下载插件-${e}`, async (n) => {
+}), Br = (e, t) => H(`下载插件-${e}`, async (n) => {
 	let [i, a] = await n.createLoading("下载", async (t) => {
 		t.retryable = !0;
-		let n = installers.filter((t) => t.isMatched(e)).at(0);
+		let n = Lr.filter((t) => t.isMatched(e)).at(0);
 		if (!n) throw Error("没有符合的下载器:" + e);
-		return t.description = n.name, [await n.install(e), n];
+		t.description = n.name;
+		let r = e;
+		for (;;) {
+			let e = await n.install(r);
+			if (oe(e)) r = e;
+			else return [e, n];
+		}
 	}), o = await n.createLoading("安装插件", async (t) => {
 		t.retryable = !0;
-		let n = loaders.filter((e) => e.canInstall(i)).at(-1);
+		let n = Wr.filter((e) => e.canInstall(i)).at(-1);
 		if (!n) throw Error("没有符合的安装器:" + e);
 		t.description = n.name;
 		let o = await n.installDownload(i);
-		return t.description = "写入数据库", await db.value.replaceInto("plugin").values({
+		return t.description = "写入数据库", await r.value.replaceInto("plugin").values({
 			displayName: o.name.display,
 			enable: !0,
 			installerName: a.name,
@@ -6284,15 +6737,15 @@ const usePluginConfig = () => useNativeStore(coreName, "pluginInstallSourceOverr
 			pluginName: o.name.id
 		}).execute(), o;
 	});
-	console.log(`安装插件成功: ${o.name.id} ->`, o), await installDepends(n, o, t);
-}), installFilePlugin = (e, t) => createDownloadMessage(`安装插件-${e.name}`, async (n) => {
+	console.log(`安装插件成功: ${o.name.id} ->`, o), await zr(n, o, t);
+}), Vr = (e, t) => H(`安装插件-${e.name}`, async (n) => {
 	let i = await n.createLoading("安装插件", async (t) => {
 		t.retryable = !0;
-		let n = loaders.filter((t) => t.canInstall(e)).at(-1);
+		let n = Wr.filter((t) => t.canInstall(e)).at(-1);
 		if (!n) throw Error("没有符合的安装器");
 		t.description = n.name;
 		let i = await n.installDownload(e);
-		return t.description = "写入数据库", await db.value.replaceInto("plugin").values({
+		return t.description = "写入数据库", await r.value.replaceInto("plugin").values({
 			displayName: i.name.display,
 			enable: !0,
 			installerName: "",
@@ -6302,31 +6755,37 @@ const usePluginConfig = () => useNativeStore(coreName, "pluginInstallSourceOverr
 			pluginName: i.name.id
 		}).execute(), i;
 	});
-	console.log(`安装插件成功: ${i.name.id} ->`, i), await installDepends(n, i, t);
-}), updatePlugin = async (e, t) => createDownloadMessage(`更新插件-${e.pluginName}`, async (n) => {
+	console.log(`安装插件成功: ${i.name.id} ->`, i), await zr(n, i, t);
+}), Hr = async (e, t) => H(`更新插件-${e.pluginName}`, async (n) => {
 	let i = await n.createLoading("更新", async (t) => {
 		t.retryable = !0;
-		let n = installers.find((t) => t.name == e.installerName);
-		if (!n) throw Error("没有符合的下载器");
-		return t.description = n.name, await n.update(e);
+		let n = e.installerName;
+		for (;;) {
+			let r = Lr.find((e) => e.name == n);
+			if (!r) throw Error("没有符合的下载器");
+			t.description = r.name;
+			let i = await r.update(e);
+			if (oe(i)) n = i;
+			else return i;
+		}
 	}), a = await n.createLoading("安装插件", async (t) => {
 		t.retryable = !0;
-		let n = loaders.find((t) => t.name == e.loaderName);
+		let n = Wr.find((t) => t.name == e.loaderName);
 		if (!n) throw Error("没有符合的安装器");
 		return await n.installDownload(i);
 	});
-	await db.value.replaceInto("plugin").values({
+	await r.value.replaceInto("plugin").values({
 		...e,
 		meta: JSON.stringify(a)
-	}).execute(), await installDepends(n, a, t);
+	}).execute(), await zr(n, a, t);
 });
-var rawLoaders = /* @__PURE__ */ Object.assign({
-	"./loader/1_userscript.ts": _1_userscript_default,
-	"./loader/2_zip.ts": _2_zip_default
-}), loaders = sortBy(Object.entries(rawLoaders), ([e]) => Number(e.match(/[\d\.]+(?=_)/)?.[0])).map((e) => e[1]), loadLocks = {}, getLoadLock = (e) => loadLocks[e] ??= new Mutex();
-const loadPlugin = async (e) => {
+var Ur = /* @__PURE__ */ Object.assign({
+	"./loader/1_userscript.ts": Ar,
+	"./loader/2_zip.ts": Mr
+}), Wr = Te(Object.entries(Ur), ([e]) => Number(e.match(/[\d\.]+(?=_)/)?.[0])).map((e) => e[1]), Gr = {}, Kr = (e) => Gr[e] ??= new le();
+const qr = async (e) => {
 	console.log(`[plugin bootPlugin] booting name "${e.pluginName}"`);
-	let t = getLoadLock(e.pluginName), n = usePluginStore();
+	let t = Kr(e.pluginName), n = lt();
 	n.pluginSteps[e.pluginName] = {
 		now: {
 			status: "wait",
@@ -6338,39 +6797,39 @@ const loadPlugin = async (e) => {
 		}]
 	};
 	try {
-		await t.acquire(), await loaders.find((t) => t.name == e.loaderName).load(e), await t.acquire();
+		await t.acquire(), await Wr.find((t) => t.name == e.loaderName).load(e), await t.acquire();
 	} catch (t) {
 		throw n.pluginSteps[e.pluginName].now.status = "error", n.pluginSteps[e.pluginName].now.error = t, t;
 	}
 	console.log(`[plugin bootPlugin] boot name done "${e.pluginName}"`);
 };
-pluginEmitter.on("definedPlugin", async (e) => {
+Me.on("definedPlugin", async (e) => {
 	console.log("[plugin addPlugin] new plugin defined", e.name, e);
-	let t = getLoadLock(e.name);
-	await bootPlugin(e), console.log("[plugin addPlugin] done", e.name), t.release();
-}), window.$api.loaders = loaders, window.$api.installers = installers;
-const loadAllPlugins = PromiseContent.fromAsyncFunction(async () => {
-	await $initCore();
-	let e = new Set([coreName]), n = await PluginArchiveDB.getByEnabled(!0), r = [];
+	let t = Kr(e.name);
+	await Fr(e), console.log("[plugin addPlugin] done", e.name), t.release();
+}), window.$api.loaders = Wr, window.$api.installers = Lr;
+const Jr = F.fromAsyncFunction(async () => {
+	await ut();
+	let e = new Set([Y]), n = await t.getByEnabled(!0), r = [];
 	for (;;) {
 		let t = n.filter((t) => t.meta.require.every((t) => e.has(t.id)));
-		r.push(t), remove$1(n, (e) => t.includes(e));
+		r.push(t), ee(n, (e) => t.includes(e));
 		for (let { pluginName: n } of t) e.add(n);
-		if (isEmpty(t)) break;
+		if (Ae(t)) break;
 	}
-	if (!isEmpty(n)) throw Error(`插件循环引用: ${n.map((e) => e.pluginName).join(", ")}`);
-	for (let e of r) await Promise.all(e.map((e) => loadPlugin(e)));
+	if (!Ae(n)) throw Error(`插件循环引用: ${n.map((e) => e.pluginName).join(", ")}`);
+	for (let e of r) await Promise.all(e.map((e) => qr(e)));
 	console.log("[plugin bootPlugin] all load done");
 });
-var Inject_default = /* @__PURE__ */ defineComponent({
+var Yr = /* @__PURE__ */ f({
 	__name: "Inject",
 	props: {
 		key: {},
 		args: {}
 	},
 	setup(e) {
-		let t = e, n = computed(() => Array.from(Global.envExtends.values()).filter((e) => e.key == t.key));
-		return (t, r) => (openBlock(!0), createElementBlock(Fragment, null, renderList(n.value, (t) => (openBlock(), createBlock(unref(DcAwait), {
+		let t = e, n = s(() => Array.from(J.envExtends.values()).filter((e) => e.key == t.key));
+		return (t, r) => (S(!0), u(o, null, T(n.value, (t) => (S(), c(A(z), {
 			promise: async () => {
 				try {
 					return await t.condition(e.args);
@@ -6380,21 +6839,21 @@ var Inject_default = /* @__PURE__ */ defineComponent({
 			},
 			"auto-load": ""
 		}, {
-			default: withCtx(({ result: n }) => [n ? (openBlock(), createBlock(resolveDynamicComponent(t.component), mergeProps({
+			default: N(({ result: n }) => [n ? (S(), c(E(t.component), b({
 				key: 0,
 				ref_for: !0
-			}, e.args), null, 16)) : createCommentVNode("", !0)]),
+			}, e.args), null, 16)) : l("", !0)]),
 			_: 2
 		}, 1032, ["promise"]))), 256));
 	}
 });
-const addInjection = (e, t, n) => {
-	Global.envExtends.add({
+const Xr = (e, t, n) => {
+	J.envExtends.add({
 		key: e,
 		component: t,
 		condition: n ?? (() => !0)
 	});
 };
-export { ConfigPointer, Global, Inject_default as Inject, addInjection, appConfig, bootPlugin, declareDepType, decodePluginMeta, definePlugin, installDepends, installFilePlugin, installPlugin, loadAllPlugins, loadPlugin, pluginEmitter, pluginExposes, installers as pluginInstallers, loaders as pluginLoaders, require$1 as require, updatePlugin, useConfig, usePluginConfig, usePluginStore };
+export { et as ConfigPointer, J as Global, Yr as Inject, Xr as addInjection, tt as appConfig, Fr as bootPlugin, rt as declareDepType, Pe as decodePluginMeta, Ne as definePlugin, zr as installDepends, Vr as installFilePlugin, Br as installPlugin, Jr as loadAllPlugins, qr as loadPlugin, Me as pluginEmitter, at as pluginExposes, Lr as pluginInstallers, Wr as pluginLoaders, it as require, Hr as updatePlugin, nt as useConfig, Rr as usePluginConfig, lt as usePluginStore };
 
 //# sourceMappingURL=index.js.map