lakutata 2.0.96 → 2.0.97

package/vendor/Package.internal.9.mjs

@@ -1,2142 +1,26 @@
-/* Build Date: Mon Nov 24 2025 18:02:01 GMT+0800 (China Standard Time) */
-import { g as e, a as t } from "./Package.internal.8.mjs";
+/* Build Date: Mon Nov 24 2025 18:10:51 GMT+0800 (China Standard Time) */
+import { a as e, E as t } from "./Package.internal.51.mjs";
 
-import * as r from "url";
+var r = {};
 
-import * as n from "util";
-
-var o = {};
-
-var s = {
-    exports: {}
-};
-
-var i = class AssertError extends Error {
-    name="AssertError";
-    constructor(e, t) {
-        super(e || "Unknown error");
-        if (typeof Error.captureStackTrace === "function") {
-            Error.captureStackTrace(this, t);
-        }
-    }
-};
-
-var a = function(...e) {
-    try {
-        return JSON.stringify(...e);
-    } catch (e) {
-        return "[Cannot display object: " + e.message + "]";
-    }
-};
-
-s.exports;
-
-const c = i;
-
-const A = a;
-
-const f = s.exports = function(e, ...t) {
-    if (e) {
-        return;
-    }
-    if (t.length === 1 && t[0] instanceof Error) {
-        throw t[0];
-    }
-    const r = t.filter(e => e !== "").map(e => typeof e === "string" ? e : e instanceof Error ? e.message : A(e));
-    throw new c(r.join(" "), f);
-};
-
-var l = s.exports;
-
-const u = e(l);
-
-const E = l;
-
-const N = {};
-
-var O = function(e, t, r) {
-    if (t === false || t === null || t === undefined) {
-        return e;
-    }
-    r = r || {};
-    if (typeof r === "string") {
-        r = {
-            separator: r
-        };
-    }
-    const n = Array.isArray(t);
-    E(!n || !r.separator, "Separator option is not valid for array-based chain");
-    const o = n ? t : t.split(r.separator || ".");
-    let s = e;
-    for (let e = 0; e < o.length; ++e) {
-        let n = o[e];
-        const i = r.iterables && N.iterables(s);
-        if (Array.isArray(s) || i === "set") {
-            const e = Number(n);
-            if (Number.isInteger(e)) {
-                n = e < 0 ? s.length + e : e;
-            }
-        }
-        if (!s || typeof s === "function" && r.functions === false || !i && s[n] === undefined) {
-            E(!r.strict || e + 1 === o.length, "Missing segment", n, "in reach path ", t);
-            E(typeof s === "object" || r.functions === true || typeof s !== "function", "Invalid segment", n, "in reach path ", t);
-            s = r.default;
-            break;
-        }
-        if (!i) {
-            s = s[n];
-        } else if (i === "set") {
-            s = [ ...s ][n];
-        } else {
-            s = s.get(n);
-        }
-    }
-    return s;
-};
-
-N.iterables = function(e) {
-    if (e instanceof Set) {
-        return "set";
-    }
-    if (e instanceof Map) {
-        return "map";
-    }
-};
-
-var S = {
-    exports: {}
-};
-
-S.exports;
-
-(function(e, t) {
-    const r = {};
-    t = e.exports = {
-        array: Array.prototype,
-        buffer: Buffer && Buffer.prototype,
-        date: Date.prototype,
-        error: Error.prototype,
-        generic: Object.prototype,
-        map: Map.prototype,
-        promise: Promise.prototype,
-        regex: RegExp.prototype,
-        set: Set.prototype,
-        url: URL.prototype,
-        weakMap: WeakMap.prototype,
-        weakSet: WeakSet.prototype
-    };
-    r.typeMap = new Map([ [ "[object Error]", t.error ], [ "[object Map]", t.map ], [ "[object Promise]", t.promise ], [ "[object Set]", t.set ], [ "[object URL]", t.url ], [ "[object WeakMap]", t.weakMap ], [ "[object WeakSet]", t.weakSet ] ]);
-    t.getInternalProto = function(e) {
-        if (Array.isArray(e)) {
-            return t.array;
-        }
-        if (Buffer && e instanceof Buffer) {
-            return t.buffer;
-        }
-        if (e instanceof Date) {
-            return t.date;
-        }
-        if (e instanceof RegExp) {
-            return t.regex;
-        }
-        if (e instanceof Error) {
-            return t.error;
-        }
-        const n = Object.prototype.toString.call(e);
-        return r.typeMap.get(n) || t.generic;
-    };
-})(S, S.exports);
-
-var I = S.exports;
-
-var R = {};
-
-R.keys = function(e, t = {}) {
-    return t.symbols !== false ? Reflect.ownKeys(e) : Object.getOwnPropertyNames(e);
-};
-
-const T = O;
-
-const p = I;
-
-const C = R;
-
-const L = {
-    needsProtoHack: new Set([ p.set, p.map, p.weakSet, p.weakMap ]),
-    structuredCloneExists: typeof structuredClone === "function"
-};
-
-var M = L.clone = function(e, t = {}, r = null) {
-    if (typeof e !== "object" || e === null) {
-        return e;
-    }
-    let n = L.clone;
-    let o = r;
-    if (t.shallow) {
-        if (t.shallow !== true) {
-            return L.cloneWithShallow(e, t);
-        }
-        n = e => e;
-    } else if (o) {
-        const t = o.get(e);
-        if (t) {
-            return t;
-        }
-    } else {
-        o = new Map;
-    }
-    const s = p.getInternalProto(e);
-    switch (s) {
-      case p.buffer:
-        return Buffer?.from(e);
-
-      case p.date:
-        return new Date(e.getTime());
-
-      case p.regex:
-      case p.url:
-        return new s.constructor(e);
-    }
-    const i = L.base(e, s, t);
-    if (i === e) {
-        return e;
-    }
-    if (o) {
-        o.set(e, i);
-    }
-    if (s === p.set) {
-        for (const r of e) {
-            i.add(n(r, t, o));
-        }
-    } else if (s === p.map) {
-        for (const [r, s] of e) {
-            i.set(r, n(s, t, o));
-        }
-    }
-    const a = C.keys(e, t);
-    for (const r of a) {
-        if (r === "__proto__") {
-            continue;
-        }
-        if (s === p.array && r === "length") {
-            i.length = e.length;
-            continue;
-        }
-        if (L.structuredCloneExists && s === p.error && r === "stack") {
-            continue;
-        }
-        const a = Object.getOwnPropertyDescriptor(e, r);
-        if (a) {
-            if (a.get || a.set) {
-                Object.defineProperty(i, r, a);
-            } else if (a.enumerable) {
-                i[r] = n(e[r], t, o);
-            } else {
-                Object.defineProperty(i, r, {
-                    enumerable: false,
-                    writable: true,
-                    configurable: true,
-                    value: n(e[r], t, o)
-                });
-            }
-        } else {
-            Object.defineProperty(i, r, {
-                enumerable: true,
-                writable: true,
-                configurable: true,
-                value: n(e[r], t, o)
-            });
-        }
-    }
-    return i;
-};
-
-L.cloneWithShallow = function(e, t) {
-    const r = t.shallow;
-    t = Object.assign({}, t);
-    t.shallow = false;
-    const n = new Map;
-    for (const t of r) {
-        const r = T(e, t);
-        if (typeof r === "object" || typeof r === "function") {
-            n.set(r, r);
-        }
-    }
-    return L.clone(e, t, n);
-};
-
-L.base = function(e, t, r) {
-    if (r.prototype === false) {
-        if (L.needsProtoHack.has(t)) {
-            return new t.constructor;
-        }
-        return t === p.array ? [] : {};
-    }
-    const n = Object.getPrototypeOf(e);
-    if (n && n.isImmutable) {
-        return e;
-    }
-    if (t === p.array) {
-        const e = [];
-        if (n !== t) {
-            Object.setPrototypeOf(e, n);
-        }
-        return e;
-    } else if (t === p.error && L.structuredCloneExists && (n === t || Error.isPrototypeOf(n.constructor))) {
-        const t = structuredClone(e);
-        if (Object.getPrototypeOf(t) !== n) {
-            Object.setPrototypeOf(t, n);
-        }
-        return t;
-    }
-    if (L.needsProtoHack.has(t)) {
-        const e = new n.constructor;
-        if (n !== t) {
-            Object.setPrototypeOf(e, n);
-        }
-        return e;
-    }
-    return Object.create(n);
-};
-
-const d = l;
-
-const D = M;
-
-const B = R;
-
-const h = {};
-
-var G = h.merge = function(e, t, r) {
-    d(e && typeof e === "object", "Invalid target value: must be an object");
-    d(t === null || t === undefined || typeof t === "object", "Invalid source value: must be null, undefined, or an object");
-    if (!t) {
-        return e;
-    }
-    r = Object.assign({
-        nullOverride: true,
-        mergeArrays: true
-    }, r);
-    if (Array.isArray(t)) {
-        d(Array.isArray(e), "Cannot merge array onto an object");
-        if (!r.mergeArrays) {
-            e.length = 0;
-        }
-        for (let n = 0; n < t.length; ++n) {
-            e.push(D(t[n], {
-                symbols: r.symbols
-            }));
-        }
-        return e;
-    }
-    const n = B.keys(t, r);
-    for (let o = 0; o < n.length; ++o) {
-        const s = n[o];
-        if (s === "__proto__" || !Object.prototype.propertyIsEnumerable.call(t, s)) {
-            continue;
-        }
-        const i = t[s];
-        if (i && typeof i === "object") {
-            if (e[s] === i) {
-                continue;
-            }
-            if (!e[s] || typeof e[s] !== "object" || Array.isArray(e[s]) !== Array.isArray(i) || i instanceof Date || Buffer && Buffer.isBuffer(i) || i instanceof RegExp) {
-                e[s] = D(i, {
-                    symbols: r.symbols
-                });
-            } else {
-                h.merge(e[s], i, r);
-            }
-        } else {
-            if (i !== null && i !== undefined) {
-                e[s] = i;
-            } else if (r.nullOverride) {
-                e[s] = i;
-            }
-        }
-    }
-    return e;
-};
-
-const m = l;
-
-const y = M;
-
-const P = G;
-
-const g = O;
-
-const U = {};
-
-var X = function(e, t, r = {}) {
-    m(e && typeof e === "object", "Invalid defaults value: must be an object");
-    m(!t || t === true || typeof t === "object", "Invalid source value: must be true, falsy or an object");
-    m(typeof r === "object", "Invalid options: must be an object");
-    if (!t) {
-        return null;
-    }
-    if (r.shallow) {
-        return U.applyToDefaultsWithShallow(e, t, r);
-    }
-    const n = y(e);
-    if (t === true) {
-        return n;
-    }
-    const o = r.nullOverride !== undefined ? r.nullOverride : false;
-    return P(n, t, {
-        nullOverride: o,
-        mergeArrays: false
-    });
-};
-
-U.applyToDefaultsWithShallow = function(e, t, r) {
-    const n = r.shallow;
-    m(Array.isArray(n), "Invalid keys");
-    const o = new Map;
-    const s = t === true ? null : new Set;
-    for (let r of n) {
-        r = Array.isArray(r) ? r : r.split(".");
-        const n = g(e, r);
-        if (n && typeof n === "object") {
-            o.set(n, s && g(t, r) || n);
-        } else if (s) {
-            s.add(r);
-        }
-    }
-    const i = y(e, {}, o);
-    if (!s) {
-        return i;
-    }
-    for (const e of s) {
-        U.reachCopy(i, t, e);
-    }
-    const a = r.nullOverride !== undefined ? r.nullOverride : false;
-    return P(i, t, {
-        nullOverride: a,
-        mergeArrays: false
-    });
-};
-
-U.reachCopy = function(e, t, r) {
-    for (const e of r) {
-        if (!(e in t)) {
-            return;
-        }
-        const r = t[e];
-        if (typeof r !== "object" || r === null) {
-            return;
-        }
-        t = r;
-    }
-    const n = t;
-    let o = e;
-    for (let e = 0; e < r.length - 1; ++e) {
-        const t = r[e];
-        if (typeof o[t] !== "object") {
-            o[t] = {};
-        }
-        o = o[t];
-    }
-    o[r[r.length - 1]] = n;
-};
-
-const H = {};
-
-var b = H.Bench = class {
-    constructor() {
-        this.ts = 0;
-        this.reset();
-    }
-    reset() {
-        this.ts = H.Bench.now();
-    }
-    elapsed() {
-        return H.Bench.now() - this.ts;
-    }
-    static now() {
-        const e = process.hrtime();
-        return e[0] * 1e3 + e[1] / 1e6;
-    }
-};
-
-var F = function() {};
-
-const v = F;
-
-var w = function() {
-    return new Promise(v);
-};
-
-const K = I;
-
-const Y = {
-    mismatched: null
-};
-
-var _ = function(e, t, r) {
-    r = Object.assign({
-        prototype: true
-    }, r);
-    return !!Y.isDeepEqual(e, t, r, []);
-};
-
-Y.isDeepEqual = function(e, t, r, n) {
-    if (e === t) {
-        return e !== 0 || 1 / e === 1 / t;
-    }
-    const o = typeof e;
-    if (o !== typeof t) {
-        return false;
-    }
-    if (e === null || t === null) {
-        return false;
-    }
-    if (o === "function") {
-        if (!r.deepFunction || e.toString() !== t.toString()) {
-            return false;
-        }
-    } else if (o !== "object") {
-        return e !== e && t !== t;
-    }
-    const s = Y.getSharedType(e, t, !!r.prototype);
-    switch (s) {
-      case K.buffer:
-        return Buffer && Buffer.prototype.equals.call(e, t);
-
-      case K.promise:
-        return e === t;
-
-      case K.regex:
-      case K.url:
-        return e.toString() === t.toString();
-
-      case Y.mismatched:
-        return false;
-    }
-    for (let r = n.length - 1; r >= 0; --r) {
-        if (n[r].isSame(e, t)) {
-            return true;
-        }
-    }
-    n.push(new Y.SeenEntry(e, t));
-    try {
-        return !!Y.isDeepEqualObj(s, e, t, r, n);
-    } finally {
-        n.pop();
-    }
-};
-
-Y.getSharedType = function(e, t, r) {
-    if (r) {
-        if (Object.getPrototypeOf(e) !== Object.getPrototypeOf(t)) {
-            return Y.mismatched;
-        }
-        return K.getInternalProto(e);
-    }
-    const n = K.getInternalProto(e);
-    if (n !== K.getInternalProto(t)) {
-        return Y.mismatched;
-    }
-    return n;
-};
-
-Y.valueOf = function(e) {
-    const t = e.valueOf;
-    if (t === undefined) {
-        return e;
-    }
-    try {
-        return t.call(e);
-    } catch (e) {
-        return e;
-    }
-};
-
-Y.hasOwnEnumerableProperty = function(e, t) {
-    return Object.prototype.propertyIsEnumerable.call(e, t);
-};
-
-Y.isSetSimpleEqual = function(e, t) {
-    for (const r of Set.prototype.values.call(e)) {
-        if (!Set.prototype.has.call(t, r)) {
-            return false;
-        }
-    }
-    return true;
-};
-
-Y.isDeepEqualObj = function(e, t, r, n, o) {
-    const {isDeepEqual: s, valueOf: i, hasOwnEnumerableProperty: a} = Y;
-    const {keys: c, getOwnPropertySymbols: A} = Object;
-    if (e === K.array) {
-        if (n.part) {
-            for (const e of t) {
-                for (const t of r) {
-                    if (s(e, t, n, o)) {
-                        return true;
-                    }
-                }
-            }
-        } else {
-            if (t.length !== r.length) {
-                return false;
-            }
-            for (let e = 0; e < t.length; ++e) {
-                if (!s(t[e], r[e], n, o)) {
-                    return false;
-                }
-            }
-            return true;
-        }
-    } else if (e === K.set) {
-        if (t.size !== r.size) {
-            return false;
-        }
-        if (!Y.isSetSimpleEqual(t, r)) {
-            const e = new Set(Set.prototype.values.call(r));
-            for (const r of Set.prototype.values.call(t)) {
-                if (e.delete(r)) {
-                    continue;
-                }
-                let t = false;
-                for (const i of e) {
-                    if (s(r, i, n, o)) {
-                        e.delete(i);
-                        t = true;
-                        break;
-                    }
-                }
-                if (!t) {
-                    return false;
-                }
-            }
-        }
-    } else if (e === K.map) {
-        if (t.size !== r.size) {
-            return false;
-        }
-        for (const [e, i] of Map.prototype.entries.call(t)) {
-            if (i === undefined && !Map.prototype.has.call(r, e)) {
-                return false;
-            }
-            if (!s(i, Map.prototype.get.call(r, e), n, o)) {
-                return false;
-            }
-        }
-    } else if (e === K.error) {
-        if (t.name !== r.name || t.message !== r.message) {
-            return false;
-        }
-    }
-    const f = i(t);
-    const l = i(r);
-    if ((t !== f || r !== l) && !s(f, l, n, o)) {
-        return false;
-    }
-    const u = c(t);
-    if (!n.part && u.length !== c(r).length && !n.skip) {
-        return false;
-    }
-    let E = 0;
-    for (const e of u) {
-        if (n.skip && n.skip.includes(e)) {
-            if (r[e] === undefined) {
-                ++E;
-            }
-            continue;
-        }
-        if (!a(r, e)) {
-            return false;
-        }
-        if (!s(t[e], r[e], n, o)) {
-            return false;
-        }
-    }
-    if (!n.part && u.length - E !== c(r).length) {
-        return false;
-    }
-    if (n.symbols !== false) {
-        const e = A(t);
-        const i = new Set(A(r));
-        for (const c of e) {
-            if (!n.skip?.includes(c)) {
-                if (a(t, c)) {
-                    if (!a(r, c)) {
-                        return false;
-                    }
-                    if (!s(t[c], r[c], n, o)) {
-                        return false;
-                    }
-                } else if (a(r, c)) {
-                    return false;
-                }
-            }
-            i.delete(c);
-        }
-        for (const e of i) {
-            if (a(r, e)) {
-                return false;
-            }
-        }
-    }
-    return true;
-};
-
-Y.SeenEntry = class {
-    constructor(e, t) {
-        this.obj = e;
-        this.ref = t;
-    }
-    isSame(e, t) {
-        return this.obj === e && this.ref === t;
-    }
-};
-
-var V = function(e) {
-    return e.replace(/[\^\$\.\*\+\-\?\=\!\:\|\\\/\(\)\[\]\{\}\,]/g, "\\$&");
-};
-
-const W = e(V);
-
-const x = l;
-
-const j = _;
-
-const Z = V;
-
-const J = R;
-
-const k = {};
-
-var Q = function(e, t, r = {}) {
-    if (typeof t !== "object") {
-        t = [ t ];
-    }
-    x(!Array.isArray(t) || t.length, "Values array cannot be empty");
-    if (typeof e === "string") {
-        return k.string(e, t, r);
-    }
-    if (Array.isArray(e)) {
-        return k.array(e, t, r);
-    }
-    x(typeof e === "object", "Reference must be string or an object");
-    return k.object(e, t, r);
-};
-
-k.array = function(e, t, r) {
-    if (!Array.isArray(t)) {
-        t = [ t ];
-    }
-    if (!e.length) {
-        return false;
-    }
-    if (r.only && r.once && e.length !== t.length) {
-        return false;
-    }
-    let n;
-    const o = new Map;
-    for (const e of t) {
-        if (!r.deep || !e || typeof e !== "object") {
-            const t = o.get(e);
-            if (t) {
-                ++t.allowed;
-            } else {
-                o.set(e, {
-                    allowed: 1,
-                    hits: 0
-                });
-            }
-        } else {
-            n = n ?? k.compare(r);
-            let t = false;
-            for (const [r, s] of o.entries()) {
-                if (n(r, e)) {
-                    ++s.allowed;
-                    t = true;
-                    break;
-                }
-            }
-            if (!t) {
-                o.set(e, {
-                    allowed: 1,
-                    hits: 0
-                });
-            }
-        }
-    }
-    let s = 0;
-    for (const t of e) {
-        let e;
-        if (!r.deep || !t || typeof t !== "object") {
-            e = o.get(t);
-        } else {
-            n = n ?? k.compare(r);
-            for (const [r, s] of o.entries()) {
-                if (n(r, t)) {
-                    e = s;
-                    break;
-                }
-            }
-        }
-        if (e) {
-            ++e.hits;
-            ++s;
-            if (r.once && e.hits > e.allowed) {
-                return false;
-            }
-        }
-    }
-    if (r.only && s !== e.length) {
-        return false;
-    }
-    for (const e of o.values()) {
-        if (e.hits === e.allowed) {
-            continue;
-        }
-        if (e.hits < e.allowed && !r.part) {
-            return false;
-        }
-    }
-    return !!s;
-};
-
-k.object = function(e, t, r) {
-    x(r.once === undefined, "Cannot use option once with object");
-    const n = J.keys(e, r);
-    if (!n.length) {
-        return false;
-    }
-    if (Array.isArray(t)) {
-        return k.array(n, t, r);
-    }
-    const o = Object.getOwnPropertySymbols(t).filter(e => t.propertyIsEnumerable(e));
-    const s = [ ...Object.keys(t), ...o ];
-    const i = k.compare(r);
-    const a = new Set(s);
-    for (const o of n) {
-        if (!a.has(o)) {
-            if (r.only) {
-                return false;
-            }
-            continue;
-        }
-        if (!i(t[o], e[o])) {
-            return false;
-        }
-        a.delete(o);
-    }
-    if (a.size) {
-        return r.part ? a.size < s.length : false;
-    }
-    return true;
-};
-
-k.string = function(e, t, r) {
-    if (e === "") {
-        return t.length === 1 && t[0] === "" || !r.once && !t.some(e => e !== "");
-    }
-    const n = new Map;
-    const o = [];
-    for (const e of t) {
-        x(typeof e === "string", "Cannot compare string reference to non-string value");
-        if (e) {
-            const t = n.get(e);
-            if (t) {
-                ++t.allowed;
-            } else {
-                n.set(e, {
-                    allowed: 1,
-                    hits: 0
-                });
-                o.push(Z(e));
-            }
-        } else if (r.once || r.only) {
-            return false;
-        }
-    }
-    if (!o.length) {
-        return true;
-    }
-    const s = new RegExp(`(${o.join("|")})`, "g");
-    const i = e.replace(s, (e, t) => {
-        ++n.get(t).hits;
-        return "";
-    });
-    if (r.only && i) {
-        return false;
-    }
-    let a = false;
-    for (const e of n.values()) {
-        if (e.hits) {
-            a = true;
-        }
-        if (e.hits === e.allowed) {
-            continue;
-        }
-        if (e.hits < e.allowed && !r.part) {
-            return false;
-        }
-        if (r.once) {
-            return false;
-        }
-    }
-    return !!a;
-};
-
-k.compare = function(e) {
-    if (!e.deep) {
-        return k.shallow;
-    }
-    const t = e.only !== undefined;
-    const r = e.part !== undefined;
-    const n = {
-        prototype: t ? e.only : r ? !e.part : false,
-        part: t ? !e.only : r ? e.part : false
-    };
-    return (e, t) => j(e, t, n);
-};
-
-k.shallow = function(e, t) {
-    return e === t;
-};
-
-const $ = l;
-
-var q = function(e) {
-    $(/^[ \w\!#\$%&'\(\)\*\+,\-\.\/\:;<\=>\?@\[\]\^`\{\|\}~\"\\]*$/.test(e), "Bad attribute value (" + e + ")");
-    return e.replace(/\\/g, "\\\\").replace(/\"/g, '\\"');
-};
-
-const z = {};
-
-var ee = function(e) {
-    if (!e) {
-        return "";
-    }
-    let t = "";
-    for (let r = 0; r < e.length; ++r) {
-        const n = e.charCodeAt(r);
-        if (z.isSafe(n)) {
-            t += e[r];
-        } else {
-            t += z.escapeHtmlChar(n);
-        }
-    }
-    return t;
-};
-
-z.escapeHtmlChar = function(e) {
-    const t = z.namedHtml.get(e);
-    if (t) {
-        return t;
-    }
-    if (e >= 256) {
-        return "&#" + e + ";";
-    }
-    const r = e.toString(16).padStart(2, "0");
-    return `&#x${r};`;
-};
-
-z.isSafe = function(e) {
-    return z.safeCharCodes.has(e);
-};
-
-z.namedHtml = new Map([ [ 38, "&amp;" ], [ 60, "&lt;" ], [ 62, "&gt;" ], [ 34, "&quot;" ], [ 160, "&nbsp;" ], [ 162, "&cent;" ], [ 163, "&pound;" ], [ 164, "&curren;" ], [ 169, "&copy;" ], [ 174, "&reg;" ] ]);
-
-z.safeCharCodes = function() {
-    const e = new Set;
-    for (let t = 32; t < 123; ++t) {
-        if (t >= 97 || t >= 65 && t <= 90 || t >= 48 && t <= 57 || t === 32 || t === 46 || t === 44 || t === 45 || t === 58 || t === 95) {
-            e.add(t);
-        }
-    }
-    return e;
-}();
-
-const te = {};
-
-var re = function(e) {
-    if (!e) {
-        return "";
-    }
-    return e.replace(/[<>&\u2028\u2029]/g, te.escape);
-};
-
-te.escape = function(e) {
-    return te.replacements.get(e);
-};
-
-te.replacements = new Map([ [ "<", "\\u003c" ], [ ">", "\\u003e" ], [ "&", "\\u0026" ], [ "\u2028", "\\u2028" ], [ "\u2029", "\\u2029" ] ]);
-
-const ne = {};
-
-var oe = ne.flatten = function(e, t) {
-    const r = t || [];
-    for (const t of e) {
-        if (Array.isArray(t)) {
-            ne.flatten(t, r);
-        } else {
-            r.push(t);
-        }
-    }
-    return r;
-};
-
-const se = {};
-
-var ie = function(e, t, r = {}) {
-    if (!e || !t) {
-        return r.first ? null : [];
-    }
-    const n = [];
-    const o = Array.isArray(e) ? new Set(e) : e;
-    const s = new Set;
-    for (const e of t) {
-        if (se.has(o, e) && !s.has(e)) {
-            if (r.first) {
-                return e;
-            }
-            n.push(e);
-            s.add(e);
-        }
-    }
-    return r.first ? null : n;
-};
-
-se.has = function(e, t) {
-    if (typeof e.has === "function") {
-        return e.has(t);
-    }
-    return e[t] !== undefined;
-};
-
-var ae = function(e) {
-    return typeof e?.then === "function";
-};
-
-const ce = {
-    wrapped: Symbol("wrapped")
-};
-
-var Ae = function(e) {
-    if (e[ce.wrapped]) {
-        return e;
-    }
-    let t = false;
-    const r = function(...r) {
-        if (!t) {
-            t = true;
-            e(...r);
-        }
-    };
-    r[ce.wrapped] = true;
-    return r;
-};
-
-const fe = O;
-
-var le = function(e, t, r) {
-    return t.replace(/{([^{}]+)}/g, (t, n) => {
-        const o = fe(e, n, r);
-        return o ?? "";
-    });
-};
-
-const ue = {
-    maxTimer: 2 ** 31 - 1
-};
-
-var Ee = function(e, t, r) {
-    if (typeof e === "bigint") {
-        e = Number(e);
-    }
-    if (e >= Number.MAX_SAFE_INTEGER) {
-        e = Infinity;
-    }
-    if (typeof e !== "number" && e !== undefined) {
-        throw new TypeError("Timeout must be a number or bigint");
-    }
-    return new Promise(n => {
-        const o = r ? r.setTimeout : setTimeout;
-        const s = () => {
-            const r = Math.min(e, ue.maxTimer);
-            e -= r;
-            o(() => e > 0 ? s() : n(t), r);
-        };
-        if (e !== Infinity) {
-            s();
-        }
-    });
-};
-
-o.applyToDefaults = X;
-
-o.assert = l;
-
-o.AssertError = i;
-
-o.Bench = b;
-
-o.block = w;
-
-o.clone = M;
-
-o.contain = Q;
-
-o.deepEqual = _;
-
-o.escapeHeaderAttribute = q;
-
-o.escapeHtml = ee;
-
-o.escapeJson = re;
-
-o.escapeRegex = V;
-
-o.flatten = oe;
-
-o.ignore = F;
-
-o.intersect = ie;
-
-o.isPromise = ae;
-
-o.merge = G;
-
-o.once = Ae;
-
-o.reach = O;
-
-o.reachTemplate = le;
-
-o.stringify = a;
-
-o.wait = Ee;
-
-var Ne = {};
-
-(function(e) {
-    const t = {
-        operators: [ "!", "^", "*", "/", "%", "+", "-", "<", "<=", ">", ">=", "==", "!=", "&&", "||", "??" ],
-        operatorCharacters: [ "!", "^", "*", "/", "%", "+", "-", "<", "=", ">", "&", "|", "?" ],
-        operatorsOrder: [ [ "^" ], [ "*", "/", "%" ], [ "+", "-" ], [ "<", "<=", ">", ">=" ], [ "==", "!=" ], [ "&&" ], [ "||", "??" ] ],
-        operatorsPrefix: [ "!", "n" ],
-        literals: {
-            '"': '"',
-            "`": "`",
-            "'": "'",
-            "[": "]"
-        },
-        numberRx: /^(?:[0-9]*(\.[0-9]*)?){1}$/,
-        tokenRx: /^[\w\$\#\.\@\:\{\}]+$/,
-        symbol: Symbol("formula"),
-        settings: Symbol("settings")
-    };
-    e.Parser = class {
-        constructor(e, r = {}) {
-            if (!r[t.settings] && r.constants) {
-                for (const e in r.constants) {
-                    const t = r.constants[e];
-                    if (t !== null && ![ "boolean", "number", "string" ].includes(typeof t)) {
-                        throw new Error(`Formula constant ${e} contains invalid ${typeof t} value type`);
-                    }
-                }
-            }
-            this.settings = r[t.settings] ? r : Object.assign({
-                [t.settings]: true,
-                constants: {},
-                functions: {}
-            }, r);
-            this.single = null;
-            this._parts = null;
-            this._parse(e);
-        }
-        _parse(r) {
-            let n = [];
-            let o = "";
-            let s = 0;
-            let i = false;
-            const a = r => {
-                if (s) {
-                    throw new Error("Formula missing closing parenthesis");
-                }
-                const a = n.length ? n[n.length - 1] : null;
-                if (!i && !o && !r) {
-                    return;
-                }
-                if (a && a.type === "reference" && r === ")") {
-                    a.type = "function";
-                    a.value = this._subFormula(o, a.value);
-                    o = "";
-                    return;
-                }
-                if (r === ")") {
-                    const t = new e.Parser(o, this.settings);
-                    n.push({
-                        type: "segment",
-                        value: t
-                    });
-                } else if (i) {
-                    if (i === "]") {
-                        n.push({
-                            type: "reference",
-                            value: o
-                        });
-                        o = "";
-                        return;
-                    }
-                    n.push({
-                        type: "literal",
-                        value: o
-                    });
-                } else if (t.operatorCharacters.includes(o)) {
-                    if (a && a.type === "operator" && t.operators.includes(a.value + o)) {
-                        a.value += o;
-                    } else {
-                        n.push({
-                            type: "operator",
-                            value: o
-                        });
-                    }
-                } else if (o.match(t.numberRx)) {
-                    n.push({
-                        type: "constant",
-                        value: parseFloat(o)
-                    });
-                } else if (this.settings.constants[o] !== undefined) {
-                    n.push({
-                        type: "constant",
-                        value: this.settings.constants[o]
-                    });
-                } else {
-                    if (!o.match(t.tokenRx)) {
-                        throw new Error(`Formula contains invalid token: ${o}`);
-                    }
-                    n.push({
-                        type: "reference",
-                        value: o
-                    });
-                }
-                o = "";
-            };
-            for (const e of r) {
-                if (i) {
-                    if (e === i) {
-                        a();
-                        i = false;
-                    } else {
-                        o += e;
-                    }
-                } else if (s) {
-                    if (e === "(") {
-                        o += e;
-                        ++s;
-                    } else if (e === ")") {
-                        --s;
-                        if (!s) {
-                            a(e);
-                        } else {
-                            o += e;
-                        }
-                    } else {
-                        o += e;
-                    }
-                } else if (e in t.literals) {
-                    i = t.literals[e];
-                } else if (e === "(") {
-                    a();
-                    ++s;
-                } else if (t.operatorCharacters.includes(e)) {
-                    a();
-                    o = e;
-                    a();
-                } else if (e !== " ") {
-                    o += e;
-                } else {
-                    a();
-                }
-            }
-            a();
-            n = n.map((e, t) => {
-                if (e.type !== "operator" || e.value !== "-" || t && n[t - 1].type !== "operator") {
-                    return e;
-                }
-                return {
-                    type: "operator",
-                    value: "n"
-                };
-            });
-            let c = false;
-            for (const e of n) {
-                if (e.type === "operator") {
-                    if (t.operatorsPrefix.includes(e.value)) {
-                        continue;
-                    }
-                    if (!c) {
-                        throw new Error("Formula contains an operator in invalid position");
-                    }
-                    if (!t.operators.includes(e.value)) {
-                        throw new Error(`Formula contains an unknown operator ${e.value}`);
-                    }
-                } else if (c) {
-                    throw new Error("Formula missing expected operator");
-                }
-                c = !c;
-            }
-            if (!c) {
-                throw new Error("Formula contains invalid trailing operator");
-            }
-            if (n.length === 1 && [ "reference", "literal", "constant" ].includes(n[0].type)) {
-                this.single = {
-                    type: n[0].type === "reference" ? "reference" : "value",
-                    value: n[0].value
-                };
-            }
-            this._parts = n.map(e => {
-                if (e.type === "operator") {
-                    return t.operatorsPrefix.includes(e.value) ? e : e.value;
-                }
-                if (e.type !== "reference") {
-                    return e.value;
-                }
-                if (this.settings.tokenRx && !this.settings.tokenRx.test(e.value)) {
-                    throw new Error(`Formula contains invalid reference ${e.value}`);
-                }
-                if (this.settings.reference) {
-                    return this.settings.reference(e.value);
-                }
-                return t.reference(e.value);
-            });
-        }
-        _subFormula(r, n) {
-            const o = this.settings.functions[n];
-            if (typeof o !== "function") {
-                throw new Error(`Formula contains unknown function ${n}`);
-            }
-            let s = [];
-            if (r) {
-                let e = "";
-                let o = 0;
-                let i = false;
-                const a = () => {
-                    if (!e) {
-                        throw new Error(`Formula contains function ${n} with invalid arguments ${r}`);
-                    }
-                    s.push(e);
-                    e = "";
-                };
-                for (let n = 0; n < r.length; ++n) {
-                    const s = r[n];
-                    if (i) {
-                        e += s;
-                        if (s === i) {
-                            i = false;
-                        }
-                    } else if (s in t.literals && !o) {
-                        e += s;
-                        i = t.literals[s];
-                    } else if (s === "," && !o) {
-                        a();
-                    } else {
-                        e += s;
-                        if (s === "(") {
-                            ++o;
-                        } else if (s === ")") {
-                            --o;
-                        }
-                    }
-                }
-                a();
-            }
-            s = s.map(t => new e.Parser(t, this.settings));
-            return function(e) {
-                const t = [];
-                for (const r of s) {
-                    t.push(r.evaluate(e));
-                }
-                return o.call(e, ...t);
-            };
-        }
-        evaluate(e) {
-            const r = this._parts.slice();
-            for (let n = r.length - 2; n >= 0; --n) {
-                const o = r[n];
-                if (o && o.type === "operator") {
-                    const s = r[n + 1];
-                    r.splice(n + 1, 1);
-                    const i = t.evaluate(s, e);
-                    r[n] = t.single(o.value, i);
-                }
-            }
-            t.operatorsOrder.forEach(n => {
-                for (let o = 1; o < r.length - 1; ) {
-                    if (n.includes(r[o])) {
-                        const n = r[o];
-                        const s = t.evaluate(r[o - 1], e);
-                        const i = t.evaluate(r[o + 1], e);
-                        r.splice(o, 2);
-                        const a = t.calculate(n, s, i);
-                        r[o - 1] = a === 0 ? 0 : a;
-                    } else {
-                        o += 2;
-                    }
-                }
-            });
-            return t.evaluate(r[0], e);
-        }
-    };
-    e.Parser.prototype[t.symbol] = true;
-    t.reference = function(e) {
-        return function(t) {
-            return t && t[e] !== undefined ? t[e] : null;
-        };
-    };
-    t.evaluate = function(e, r) {
-        if (e === null) {
-            return null;
-        }
-        if (typeof e === "function") {
-            return e(r);
-        }
-        if (e[t.symbol]) {
-            return e.evaluate(r);
-        }
-        return e;
-    };
-    t.single = function(e, t) {
-        if (e === "!") {
-            return t ? false : true;
-        }
-        const r = -t;
-        if (r === 0) {
-            return 0;
-        }
-        return r;
-    };
-    t.calculate = function(e, r, n) {
-        if (e === "??") {
-            return t.exists(r) ? r : n;
-        }
-        if (typeof r === "string" || typeof n === "string") {
-            if (e === "+") {
-                r = t.exists(r) ? r : "";
-                n = t.exists(n) ? n : "";
-                return r + n;
-            }
-        } else {
-            switch (e) {
-              case "^":
-                return Math.pow(r, n);
-
-              case "*":
-                return r * n;
-
-              case "/":
-                return r / n;
-
-              case "%":
-                return r % n;
-
-              case "+":
-                return r + n;
-
-              case "-":
-                return r - n;
-            }
-        }
-        switch (e) {
-          case "<":
-            return r < n;
-
-          case "<=":
-            return r <= n;
-
-          case ">":
-            return r > n;
-
-          case ">=":
-            return r >= n;
-
-          case "==":
-            return r === n;
-
-          case "!=":
-            return r !== n;
-
-          case "&&":
-            return r && n;
-
-          case "||":
-            return r || n;
-        }
-        return null;
-    };
-    t.exists = function(e) {
-        return e !== null && e !== undefined;
-    };
-})(Ne);
-
-var Oe = {};
-
-Oe.location = function(e = 0) {
-    const t = Error.prepareStackTrace;
-    Error.prepareStackTrace = (e, t) => t;
-    const r = {};
-    Error.captureStackTrace(r, this);
-    const n = r.stack[e + 1];
-    Error.prepareStackTrace = t;
-    return {
-        filename: n.getFileName(),
-        line: n.getLineNumber()
-    };
-};
-
-var Se = {};
-
-const {assert: Ie} = o;
-
-const Re = {};
-
-Se.Sorter = class {
-    constructor() {
-        this._items = [];
-        this.nodes = [];
-    }
-    add(e, t) {
-        t = t ?? {};
-        const r = [].concat(t.before ?? []);
-        const n = [].concat(t.after ?? []);
-        const o = t.group ?? "?";
-        const s = t.sort ?? 0;
-        Ie(!r.includes(o), `Item cannot come before itself: ${o}`);
-        Ie(!r.includes("?"), "Item cannot come before unassociated items");
-        Ie(!n.includes(o), `Item cannot come after itself: ${o}`);
-        Ie(!n.includes("?"), "Item cannot come after unassociated items");
-        if (!Array.isArray(e)) {
-            e = [ e ];
-        }
-        for (const t of e) {
-            const e = {
-                seq: this._items.length,
-                sort: s,
-                before: r,
-                after: n,
-                group: o,
-                node: t
-            };
-            this._items.push(e);
-        }
-        if (!t.manual) {
-            const e = this._sort();
-            Ie(e, "item", o !== "?" ? `added into group ${o}` : "", "created a dependencies error");
-        }
-        return this.nodes;
-    }
-    merge(e) {
-        if (!Array.isArray(e)) {
-            e = [ e ];
-        }
-        for (const t of e) {
-            if (t) {
-                for (const e of t._items) {
-                    this._items.push(Object.assign({}, e));
-                }
-            }
-        }
-        this._items.sort(Re.mergeSort);
-        for (let e = 0; e < this._items.length; ++e) {
-            this._items[e].seq = e;
-        }
-        const t = this._sort();
-        Ie(t, "merge created a dependencies error");
-        return this.nodes;
-    }
-    sort() {
-        const e = this._sort();
-        Ie(e, "sort created a dependencies error");
-        return this.nodes;
-    }
-    _sort() {
-        const e = {};
-        const t = Object.create(null);
-        const r = Object.create(null);
-        for (const n of this._items) {
-            const o = n.seq;
-            const s = n.group;
-            r[s] = r[s] ?? [];
-            r[s].push(o);
-            e[o] = n.before;
-            for (const e of n.after) {
-                t[e] = t[e] ?? [];
-                t[e].push(o);
-            }
-        }
-        for (const t in e) {
-            const n = [];
-            for (const o in e[t]) {
-                const s = e[t][o];
-                r[s] = r[s] ?? [];
-                n.push(...r[s]);
-            }
-            e[t] = n;
-        }
-        for (const n in t) {
-            if (r[n]) {
-                for (const o of r[n]) {
-                    e[o].push(...t[n]);
-                }
-            }
-        }
-        const n = {};
-        for (const t in e) {
-            const r = e[t];
-            for (const e of r) {
-                n[e] = n[e] ?? [];
-                n[e].push(t);
-            }
-        }
-        const o = {};
-        const s = [];
-        for (let e = 0; e < this._items.length; ++e) {
-            let t = e;
-            if (n[e]) {
-                t = null;
-                for (let e = 0; e < this._items.length; ++e) {
-                    if (o[e] === true) {
-                        continue;
-                    }
-                    if (!n[e]) {
-                        n[e] = [];
-                    }
-                    const r = n[e].length;
-                    let s = 0;
-                    for (let t = 0; t < r; ++t) {
-                        if (o[n[e][t]]) {
-                            ++s;
-                        }
-                    }
-                    if (s === r) {
-                        t = e;
-                        break;
-                    }
-                }
-            }
-            if (t !== null) {
-                o[t] = true;
-                s.push(t);
-            }
-        }
-        if (s.length !== this._items.length) {
-            return false;
-        }
-        const i = {};
-        for (const e of this._items) {
-            i[e.seq] = e;
-        }
-        this._items = [];
-        this.nodes = [];
-        for (const e of s) {
-            const t = i[e];
-            this.nodes.push(t.node);
-            this._items.push(t);
-        }
-        return true;
-    }
-};
-
-Re.mergeSort = (e, t) => e.sort === t.sort ? 0 : e.sort < t.sort ? -1 : 1;
-
-const Te = {
-    EMPTY_STRING: "Address must be a non-empty string",
-    FORBIDDEN_UNICODE: "Address contains forbidden Unicode characters",
-    MULTIPLE_AT_CHAR: "Address cannot contain more than one @ character",
-    MISSING_AT_CHAR: "Address must contain one @ character",
-    EMPTY_LOCAL: "Address local part cannot be empty",
-    ADDRESS_TOO_LONG: "Address too long",
-    LOCAL_TOO_LONG: "Address local part too long",
-    EMPTY_LOCAL_SEGMENT: "Address local part contains empty dot-separated segment",
-    INVALID_LOCAL_CHARS: "Address local part contains invalid character",
-    DOMAIN_NON_EMPTY_STRING: "Domain must be a non-empty string",
-    DOMAIN_TOO_LONG: "Domain too long",
-    DOMAIN_INVALID_UNICODE_CHARS: "Domain contains forbidden Unicode characters",
-    DOMAIN_INVALID_CHARS: "Domain contains invalid character",
-    DOMAIN_INVALID_TLDS_CHARS: "Domain contains invalid tld character",
-    DOMAIN_SEGMENTS_COUNT: "Domain lacks the minimum required number of segments",
-    DOMAIN_SEGMENTS_COUNT_MAX: "Domain contains too many segments",
-    DOMAIN_FORBIDDEN_TLDS: "Domain uses forbidden TLD",
-    DOMAIN_EMPTY_SEGMENT: "Domain contains empty dot-separated segment",
-    DOMAIN_LONG_SEGMENT: "Domain contains dot-separated segment that is too long"
-};
-
-function pe(e) {
-    return {
-        code: e,
-        error: Te[e]
-    };
-}
-
-const Ce = 2;
-
-const Le = /[^\x00-\x7f]/;
-
-const Me = /[\x00-\x20@\:\/\\#!\$&\'\(\)\*\+,;=\?]/;
-
-const de = /^[a-zA-Z](?:[a-zA-Z0-9\-]*[a-zA-Z0-9])?$/;
-
-const De = /^[a-zA-Z0-9](?:[a-zA-Z0-9\-]*[a-zA-Z0-9])?$/;
-
-const Be = /^[a-zA-Z0-9_](?:[a-zA-Z0-9\-]*[a-zA-Z0-9])?$/;
-
-const he = r.URL || URL;
-
-function Ge(e) {
-    return !!e.allow;
-}
-
-function me(e, t = {}) {
-    if (!e) {
-        return pe("DOMAIN_NON_EMPTY_STRING");
-    }
-    if (typeof e !== "string") {
-        throw new Error("Invalid input: domain must be a string");
-    }
-    if (e.length > 256) {
-        return pe("DOMAIN_TOO_LONG");
-    }
-    const r = !Le.test(e);
-    if (!r) {
-        if (t.allowUnicode === false) {
-            return pe("DOMAIN_INVALID_UNICODE_CHARS");
-        }
-        e = e.normalize("NFC");
-    }
-    if (Me.test(e)) {
-        return pe("DOMAIN_INVALID_CHARS");
-    }
-    e = Pe(e);
-    if (t.allowFullyQualified && e[e.length - 1] === ".") {
-        e = e.slice(0, -1);
-    }
-    const n = t.minDomainSegments || Ce;
-    const o = e.split(".");
-    if (o.length < n) {
-        return pe("DOMAIN_SEGMENTS_COUNT");
-    }
-    if (t.maxDomainSegments) {
-        if (o.length > t.maxDomainSegments) {
-            return pe("DOMAIN_SEGMENTS_COUNT_MAX");
-        }
-    }
-    const s = t.tlds;
-    if (s) {
-        const e = o[o.length - 1].toLowerCase();
-        if (Ge(s)) {
-            if (!s.allow.has(e)) {
-                return pe("DOMAIN_FORBIDDEN_TLDS");
-            }
-        } else if (s.deny.has(e)) {
-            return pe("DOMAIN_FORBIDDEN_TLDS");
-        }
-    }
-    for (let e = 0; e < o.length; ++e) {
-        const r = o[e];
-        if (!r.length) {
-            return pe("DOMAIN_EMPTY_SEGMENT");
-        }
-        if (r.length > 63) {
-            return pe("DOMAIN_LONG_SEGMENT");
-        }
-        if (e < o.length - 1) {
-            if (t.allowUnderscore) {
-                if (!Be.test(r)) {
-                    return pe("DOMAIN_INVALID_CHARS");
-                }
-            } else {
-                if (!De.test(r)) {
-                    return pe("DOMAIN_INVALID_CHARS");
-                }
-            }
-        } else {
-            if (!de.test(r)) {
-                return pe("DOMAIN_INVALID_TLDS_CHARS");
-            }
-        }
-    }
-    return null;
-}
-
-function ye(e, t) {
-    return !me(e, t);
-}
-
-function Pe(e) {
-    if (e.includes("%")) {
-        e = e.replace(/%/g, "%25");
-    }
-    try {
-        return new he(`http://${e}`).host;
-    } catch (t) {
-        return e;
-    }
-}
-
-function ge(e) {
-    if (!e) {
-        return;
-    }
-    if (typeof e.tlds !== "object") {
-        throw new Error("Invalid options: tlds must be a boolean or an object");
-    }
-    if (Ge(e.tlds)) {
-        if (e.tlds.allow instanceof Set === false) {
-            throw new Error("Invalid options: tlds.allow must be a Set object or true");
-        }
-        if (e.tlds.deny) {
-            throw new Error("Invalid options: cannot specify both tlds.allow and tlds.deny lists");
-        }
-    } else {
-        if (e.tlds.deny instanceof Set === false) {
-            throw new Error("Invalid options: tlds.deny must be a Set object");
-        }
-    }
-}
-
-const Ue = /[^\x00-\x7f]/;
-
-const Xe = new (n.TextEncoder || TextEncoder);
-
-function He(e, t) {
-    return Fe(e, t);
-}
-
-function be(e, t) {
-    return !Fe(e, t);
-}
-
-function Fe(e, t = {}) {
-    if (typeof e !== "string") {
-        throw new Error("Invalid input: email must be a string");
-    }
-    if (!e) {
-        return pe("EMPTY_STRING");
-    }
-    const r = !Ue.test(e);
-    if (!r) {
-        if (t.allowUnicode === false) {
-            return pe("FORBIDDEN_UNICODE");
-        }
-        e = e.normalize("NFC");
-    }
-    const n = e.split("@");
-    if (n.length !== 2) {
-        return n.length > 2 ? pe("MULTIPLE_AT_CHAR") : pe("MISSING_AT_CHAR");
-    }
-    const [o, s] = n;
-    if (!o) {
-        return pe("EMPTY_LOCAL");
-    }
-    if (!t.ignoreLength) {
-        if (e.length > 254) {
-            return pe("ADDRESS_TOO_LONG");
-        }
-        if (Xe.encode(o).length > 64) {
-            return pe("LOCAL_TOO_LONG");
-        }
-    }
-    return ve(o, r) || me(s, t);
-}
-
-function ve(e, t) {
-    const r = e.split(".");
-    for (const e of r) {
-        if (!e.length) {
-            return pe("EMPTY_LOCAL_SEGMENT");
-        }
-        if (t) {
-            if (!Ke.test(e)) {
-                return pe("INVALID_LOCAL_CHARS");
-            }
-            continue;
-        }
-        for (const t of e) {
-            if (Ke.test(t)) {
-                continue;
-            }
-            const e = we(t);
-            if (!Ye.test(e)) {
-                return pe("INVALID_LOCAL_CHARS");
-            }
-        }
-    }
-    return null;
-}
-
-function we(e) {
-    return Array.from(Xe.encode(e), e => String.fromCharCode(e)).join("");
-}
-
-const Ke = /^[\w!#\$%&'\*\+\-/=\?\^`\{\|\}~]+$/;
-
-const Ye = new RegExp([ "(?:[\\xc2-\\xdf][\\x80-\\xbf])", "(?:\\xe0[\\xa0-\\xbf][\\x80-\\xbf])|(?:[\\xe1-\\xec][\\x80-\\xbf]{2})|(?:\\xed[\\x80-\\x9f][\\x80-\\xbf])|(?:[\\xee-\\xef][\\x80-\\xbf]{2})", "(?:\\xf0[\\x90-\\xbf][\\x80-\\xbf]{2})|(?:[\\xf1-\\xf3][\\x80-\\xbf]{3})|(?:\\xf4[\\x80-\\x8f][\\x80-\\xbf]{2})" ].join("|"));
-
-function _e() {
-    const e = {};
-    const t = "\\dA-Fa-f";
-    const r = "[" + t + "]";
-    const n = "\\w-\\.~";
-    const o = "!\\$&'\\(\\)\\*\\+,;=";
-    const s = "%" + t;
-    const i = n + s + o + ":@";
-    const a = "[" + i + "]";
-    const c = "(?:0{0,2}\\d|0?[1-9]\\d|1\\d\\d|2[0-4]\\d|25[0-5])";
-    e.ipv4address = "(?:" + c + "\\.){3}" + c;
-    const A = r + "{1,4}";
-    const f = "(?:" + A + ":" + A + "|" + e.ipv4address + ")";
-    const l = "(?:" + A + ":){6}" + f;
-    const u = "::(?:" + A + ":){5}" + f;
-    const E = "(?:" + A + ")?::(?:" + A + ":){4}" + f;
-    const N = "(?:(?:" + A + ":){0,1}" + A + ")?::(?:" + A + ":){3}" + f;
-    const O = "(?:(?:" + A + ":){0,2}" + A + ")?::(?:" + A + ":){2}" + f;
-    const S = "(?:(?:" + A + ":){0,3}" + A + ")?::" + A + ":" + f;
-    const I = "(?:(?:" + A + ":){0,4}" + A + ")?::" + f;
-    const R = "(?:(?:" + A + ":){0,5}" + A + ")?::" + A;
-    const T = "(?:(?:" + A + ":){0,6}" + A + ")?::";
-    e.ipv4Cidr = "(?:\\d|[1-2]\\d|3[0-2])";
-    e.ipv6Cidr = "(?:0{0,2}\\d|0?[1-9]\\d|1[01]\\d|12[0-8])";
-    e.ipv6address = "(?:" + l + "|" + u + "|" + E + "|" + N + "|" + O + "|" + S + "|" + I + "|" + R + "|" + T + ")";
-    e.ipvFuture = "v" + r + "+\\.[" + n + o + ":]+";
-    e.scheme = "[a-zA-Z][a-zA-Z\\d+-\\.]*";
-    e.schemeRegex = new RegExp(e.scheme);
-    const p = "[" + n + s + o + ":]*";
-    const C = "\\[(?:" + e.ipv6address + "|" + e.ipvFuture + ")\\]";
-    const L = "[" + n + s + o + "]{1,255}";
-    const M = "(?:" + C + "|" + e.ipv4address + "|" + L + ")";
-    const d = "\\d*";
-    const D = "(?:" + p + "@)?" + M + "(?::" + d + ")?";
-    const B = "(?:" + p + "@)?(" + M + ")(?::" + d + ")?";
-    const h = a + "*";
-    const G = a + "+";
-    const m = "[" + n + s + o + "@" + "]+";
-    const y = "";
-    const P = "(?:\\/" + h + ")*";
-    const g = "\\/(?:" + G + P + ")?";
-    const U = G + P;
-    const X = m + P;
-    const H = "(?:\\/\\/\\/" + h + P + ")";
-    e.hierPart = "(?:" + "(?:\\/\\/" + D + P + ")" + "|" + g + "|" + U + "|" + H + ")";
-    e.hierPartCapture = "(?:" + "(?:\\/\\/" + B + P + ")" + "|" + g + "|" + U + ")";
-    e.relativeRef = "(?:" + "(?:\\/\\/" + D + P + ")" + "|" + g + "|" + X + "|" + y + ")";
-    e.relativeRefCapture = "(?:" + "(?:\\/\\/" + B + P + ")" + "|" + g + "|" + X + "|" + y + ")";
-    e.query = "[" + i + "\\/\\?]*(?=#|$)";
-    e.queryWithSquareBrackets = "[" + i + "\\[\\]\\/\\?]*(?=#|$)";
-    e.fragment = "[" + i + "\\/\\?]*";
-    return e;
-}
-
-const Ve = _e();
-
-const We = {
-    v4Cidr: Ve.ipv4Cidr,
-    v6Cidr: Ve.ipv6Cidr,
-    ipv4: Ve.ipv4address,
-    ipv6: Ve.ipv6address,
-    ipvfuture: Ve.ipvFuture
-};
-
-function xe(e) {
-    const t = Ve;
-    const r = e.allowQuerySquareBrackets ? t.queryWithSquareBrackets : t.query;
-    const n = "(?:\\?" + r + ")?" + "(?:#" + t.fragment + ")?";
-    const o = e.domain ? t.relativeRefCapture : t.relativeRef;
-    if (e.relativeOnly) {
-        return je(o + n);
-    }
-    let s = "";
-    if (e.scheme) {
-        u(e.scheme instanceof RegExp || typeof e.scheme === "string" || Array.isArray(e.scheme), "scheme must be a RegExp, String, or Array");
-        const r = [].concat(e.scheme);
-        u(r.length >= 1, "scheme must have at least 1 scheme specified");
-        const n = [];
-        for (let e = 0; e < r.length; ++e) {
-            const o = r[e];
-            u(o instanceof RegExp || typeof o === "string", "scheme at position " + e + " must be a RegExp or String");
-            if (o instanceof RegExp) {
-                n.push(o.source.toString());
-            } else {
-                u(t.schemeRegex.test(o), "scheme at position " + e + " must be a valid scheme");
-                n.push(W(o));
-            }
-        }
-        s = n.join("|");
-    }
-    const i = s ? "(?:" + s + ")" : t.scheme;
-    const a = "(?:" + i + ":" + (e.domain ? t.hierPartCapture : t.hierPart) + ")";
-    const c = e.allowRelative ? "(?:" + a + "|" + o + ")" : a;
-    return je(c + n, s);
-}
-
-function je(e, t = null) {
-    e = `(?=.)(?!https?:/(?:$|[^/]))(?!https?:///)(?!https?:[^/])${e}`;
-    return {
-        raw: e,
-        regex: new RegExp(`^${e}$`),
-        scheme: t
-    };
-}
-
-const Ze = xe({});
-
-function Je(e = {}) {
-    if (e.scheme || e.allowRelative || e.relativeOnly || e.allowQuerySquareBrackets || e.domain) {
-        return xe(e);
-    }
-    return Ze;
-}
-
-function ke(e = {}) {
-    const t = e.cidr || "optional";
-    u([ "required", "optional", "forbidden" ].includes(t), "options.cidr must be one of required, optional, forbidden");
-    u(e.version === undefined || typeof e.version === "string" || Array.isArray(e.version), "options.version must be a string or an array of string");
-    let r = e.version || [ "ipv4", "ipv6", "ipvfuture" ];
-    if (!Array.isArray(r)) {
-        r = [ r ];
-    }
-    u(r.length >= 1, "options.version must have at least 1 version specified");
-    for (const e of r) {
-        u(typeof e === "string" && e === e.toLowerCase(), "Invalid options.version value");
-        u([ "ipv4", "ipv6", "ipvfuture" ].includes(e), "options.version contains unknown version " + e + " - must be one of ipv4, ipv6, ipvfuture");
-    }
-    r = Array.from(new Set(r));
-    const n = r.map(e => {
-        if (t === "forbidden") {
-            return We[e];
-        }
-        const r = `\\/${e === "ipv4" ? We.v4Cidr : We.v6Cidr}`;
-        if (t === "required") {
-            return `${We[e]}${r}`;
-        }
-        return `${We[e]}(?:${r})?`;
-    });
-    const o = `(?:${n.join("|")})`;
-    const s = new RegExp(`^${o}$`);
-    return {
-        cidr: t,
-        versions: r,
-        regex: s,
-        raw: o
-    };
-}
-
-const Qe = {
-    0: 0,
-    1: 1,
-    2: 2,
-    3: 3,
-    4: 4,
-    5: 5,
-    6: 6,
-    7: 7,
-    8: 8,
-    9: 9,
-    a: 10,
-    A: 10,
-    b: 11,
-    B: 11,
-    c: 12,
-    C: 12,
-    d: 13,
-    D: 13,
-    e: 14,
-    E: 14,
-    f: 15,
-    F: 15
-};
-
-const $e = {
-    accept: 12,
-    reject: 0,
-    data: [ 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 6, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 8, 7, 7, 10, 9, 9, 9, 11, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 12, 0, 0, 0, 0, 24, 36, 48, 60, 72, 84, 96, 0, 12, 12, 12, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 24, 24, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 24, 24, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 48, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 48, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 127, 63, 63, 63, 0, 31, 15, 15, 15, 7, 7, 7 ]
-};
-
-function qe(e) {
-    let t = e.indexOf("%");
-    if (t === -1) {
-        return e;
-    }
-    let r = "";
-    let n = 0;
-    let o = 0;
-    let s = t;
-    let i = $e.accept;
-    while (t > -1 && t < e.length) {
-        const a = ze(e[t + 1], 4);
-        const c = ze(e[t + 2], 0);
-        const A = a | c;
-        const f = $e.data[A];
-        i = $e.data[256 + i + f];
-        o = o << 6 | A & $e.data[364 + f];
-        if (i === $e.accept) {
-            r += e.slice(n, s);
-            r += o <= 65535 ? String.fromCharCode(o) : String.fromCharCode(55232 + (o >> 10), 56320 + (o & 1023));
-            o = 0;
-            n = t + 3;
-            t = e.indexOf("%", n);
-            s = t;
-            continue;
-        }
-        if (i === $e.reject) {
-            return null;
-        }
-        t += 3;
-        if (t >= e.length || e[t] !== "%") {
-            return null;
-        }
-    }
-    return r + e.slice(n);
-}
-
-function ze(e, t) {
-    const r = Qe[e];
-    return r === undefined ? 255 : r << t;
-}
-
-const et = Object.freeze(Object.defineProperty({
-    __proto__: null,
-    analyzeDomain: me,
-    analyzeEmail: He,
-    errorCodes: Te,
-    ipRegex: ke,
-    isDomainValid: ye,
-    isEmailValid: be,
-    uriDecode: qe,
-    uriRegex: Je,
-    validateDomainOptions: ge
-}, Symbol.toStringTag, {
-    value: "Module"
-}));
-
-const tt = t(et);
-
-var rt = {};
-
-var nt = {};
-
-Object.defineProperty(nt, "__esModule", {
+Object.defineProperty(r, "__esModule", {
     value: true
 });
 
-nt.TLDS = void 0;
+var a = r.AfterRecover = s;
 
-nt.TLDS = [ "AAA", "AARP", "ABB", "ABBOTT", "ABBVIE", "ABC", "ABLE", "ABOGADO", "ABUDHABI", "AC", "ACADEMY", "ACCENTURE", "ACCOUNTANT", "ACCOUNTANTS", "ACO", "ACTOR", "AD", "ADS", "ADULT", "AE", "AEG", "AERO", "AETNA", "AF", "AFL", "AFRICA", "AG", "AGAKHAN", "AGENCY", "AI", "AIG", "AIRBUS", "AIRFORCE", "AIRTEL", "AKDN", "AL", "ALIBABA", "ALIPAY", "ALLFINANZ", "ALLSTATE", "ALLY", "ALSACE", "ALSTOM", "AM", "AMAZON", "AMERICANEXPRESS", "AMERICANFAMILY", "AMEX", "AMFAM", "AMICA", "AMSTERDAM", "ANALYTICS", "ANDROID", "ANQUAN", "ANZ", "AO", "AOL", "APARTMENTS", "APP", "APPLE", "AQ", "AQUARELLE", "AR", "ARAB", "ARAMCO", "ARCHI", "ARMY", "ARPA", "ART", "ARTE", "AS", "ASDA", "ASIA", "ASSOCIATES", "AT", "ATHLETA", "ATTORNEY", "AU", "AUCTION", "AUDI", "AUDIBLE", "AUDIO", "AUSPOST", "AUTHOR", "AUTO", "AUTOS", "AW", "AWS", "AX", "AXA", "AZ", "AZURE", "BA", "BABY", "BAIDU", "BANAMEX", "BAND", "BANK", "BAR", "BARCELONA", "BARCLAYCARD", "BARCLAYS", "BAREFOOT", "BARGAINS", "BASEBALL", "BASKETBALL", "BAUHAUS", "BAYERN", "BB", "BBC", "BBT", "BBVA", "BCG", "BCN", "BD", "BE", "BEATS", "BEAUTY", "BEER", "BERLIN", "BEST", "BESTBUY", "BET", "BF", "BG", "BH", "BHARTI", "BI", "BIBLE", "BID", "BIKE", "BING", "BINGO", "BIO", "BIZ", "BJ", "BLACK", "BLACKFRIDAY", "BLOCKBUSTER", "BLOG", "BLOOMBERG", "BLUE", "BM", "BMS", "BMW", "BN", "BNPPARIBAS", "BO", "BOATS", "BOEHRINGER", "BOFA", "BOM", "BOND", "BOO", "BOOK", "BOOKING", "BOSCH", "BOSTIK", "BOSTON", "BOT", "BOUTIQUE", "BOX", "BR", "BRADESCO", "BRIDGESTONE", "BROADWAY", "BROKER", "BROTHER", "BRUSSELS", "BS", "BT", "BUILD", "BUILDERS", "BUSINESS", "BUY", "BUZZ", "BV", "BW", "BY", "BZ", "BZH", "CA", "CAB", "CAFE", "CAL", "CALL", "CALVINKLEIN", "CAM", "CAMERA", "CAMP", "CANON", "CAPETOWN", "CAPITAL", "CAPITALONE", "CAR", "CARAVAN", "CARDS", "CARE", "CAREER", "CAREERS", "CARS", "CASA", "CASE", "CASH", "CASINO", "CAT", "CATERING", "CATHOLIC", "CBA", "CBN", "CBRE", "CC", "CD", "CENTER", "CEO", "CERN", "CF", "CFA", "CFD", "CG", "CH", "CHANEL", "CHANNEL", "CHARITY", "CHASE", "CHAT", "CHEAP", "CHINTAI", "CHRISTMAS", "CHROME", "CHURCH", "CI", "CIPRIANI", "CIRCLE", "CISCO", "CITADEL", "CITI", "CITIC", "CITY", "CK", "CL", "CLAIMS", "CLEANING", "CLICK", "CLINIC", "CLINIQUE", "CLOTHING", "CLOUD", "CLUB", "CLUBMED", "CM", "CN", "CO", "COACH", "CODES", "COFFEE", "COLLEGE", "COLOGNE", "COM", "COMMBANK", "COMMUNITY", "COMPANY", "COMPARE", "COMPUTER", "COMSEC", "CONDOS", "CONSTRUCTION", "CONSULTING", "CONTACT", "CONTRACTORS", "COOKING", "COOL", "COOP", "CORSICA", "COUNTRY", "COUPON", "COUPONS", "COURSES", "CPA", "CR", "CREDIT", "CREDITCARD", "CREDITUNION", "CRICKET", "CROWN", "CRS", "CRUISE", "CRUISES", "CU", "CUISINELLA", "CV", "CW", "CX", "CY", "CYMRU", "CYOU", "CZ", "DAD", "DANCE", "DATA", "DATE", "DATING", "DATSUN", "DAY", "DCLK", "DDS", "DE", "DEAL", "DEALER", "DEALS", "DEGREE", "DELIVERY", "DELL", "DELOITTE", "DELTA", "DEMOCRAT", "DENTAL", "DENTIST", "DESI", "DESIGN", "DEV", "DHL", "DIAMONDS", "DIET", "DIGITAL", "DIRECT", "DIRECTORY", "DISCOUNT", "DISCOVER", "DISH", "DIY", "DJ", "DK", "DM", "DNP", "DO", "DOCS", "DOCTOR", "DOG", "DOMAINS", "DOT", "DOWNLOAD", "DRIVE", "DTV", "DUBAI", "DUPONT", "DURBAN", "DVAG", "DVR", "DZ", "EARTH", "EAT", "EC", "ECO", "EDEKA", "EDU", "EDUCATION", "EE", "EG", "EMAIL", "EMERCK", "ENERGY", "ENGINEER", "ENGINEERING", "ENTERPRISES", "EPSON", "EQUIPMENT", "ER", "ERICSSON", "ERNI", "ES", "ESQ", "ESTATE", "ET", "EU", "EUROVISION", "EUS", "EVENTS", "EXCHANGE", "EXPERT", "EXPOSED", "EXPRESS", "EXTRASPACE", "FAGE", "FAIL", "FAIRWINDS", "FAITH", "FAMILY", "FAN", "FANS", "FARM", "FARMERS", "FASHION", "FAST", "FEDEX", "FEEDBACK", "FERRARI", "FERRERO", "FI", "FIDELITY", "FIDO", "FILM", "FINAL", "FINANCE", "FINANCIAL", "FIRE", "FIRESTONE", "FIRMDALE", "FISH", "FISHING", "FIT", "FITNESS", "FJ", "FK", "FLICKR", "FLIGHTS", "FLIR", "FLORIST", "FLOWERS", "FLY", "FM", "FO", "FOO", "FOOD", "FOOTBALL", "FORD", "FOREX", "FORSALE", "FORUM", "FOUNDATION", "FOX", "FR", "FREE", "FRESENIUS", "FRL", "FROGANS", "FRONTIER", "FTR", "FUJITSU", "FUN", "FUND", "FURNITURE", "FUTBOL", "FYI", "GA", "GAL", "GALLERY", "GALLO", "GALLUP", "GAME", "GAMES", "GAP", "GARDEN", "GAY", "GB", "GBIZ", "GD", "GDN", "GE", "GEA", "GENT", "GENTING", "GEORGE", "GF", "GG", "GGEE", "GH", "GI", "GIFT", "GIFTS", "GIVES", "GIVING", "GL", "GLASS", "GLE", "GLOBAL", "GLOBO", "GM", "GMAIL", "GMBH", "GMO", "GMX", "GN", "GODADDY", "GOLD", "GOLDPOINT", "GOLF", "GOO", "GOODYEAR", "GOOG", "GOOGLE", "GOP", "GOT", "GOV", "GP", "GQ", "GR", "GRAINGER", "GRAPHICS", "GRATIS", "GREEN", "GRIPE", "GROCERY", "GROUP", "GS", "GT", "GU", "GUCCI", "GUGE", "GUIDE", "GUITARS", "GURU", "GW", "GY", "HAIR", "HAMBURG", "HANGOUT", "HAUS", "HBO", "HDFC", "HDFCBANK", "HEALTH", "HEALTHCARE", "HELP", "HELSINKI", "HERE", "HERMES", "HIPHOP", "HISAMITSU", "HITACHI", "HIV", "HK", "HKT", "HM", "HN", "HOCKEY", "HOLDINGS", "HOLIDAY", "HOMEDEPOT", "HOMEGOODS", "HOMES", "HOMESENSE", "HONDA", "HORSE", "HOSPITAL", "HOST", "HOSTING", "HOT", "HOTELS", "HOTMAIL", "HOUSE", "HOW", "HR", "HSBC", "HT", "HU", "HUGHES", "HYATT", "HYUNDAI", "IBM", "ICBC", "ICE", "ICU", "ID", "IE", "IEEE", "IFM", "IKANO", "IL", "IM", "IMAMAT", "IMDB", "IMMO", "IMMOBILIEN", "IN", "INC", "INDUSTRIES", "INFINITI", "INFO", "ING", "INK", "INSTITUTE", "INSURANCE", "INSURE", "INT", "INTERNATIONAL", "INTUIT", "INVESTMENTS", "IO", "IPIRANGA", "IQ", "IR", "IRISH", "IS", "ISMAILI", "IST", "ISTANBUL", "IT", "ITAU", "ITV", "JAGUAR", "JAVA", "JCB", "JE", "JEEP", "JETZT", "JEWELRY", "JIO", "JLL", "JM", "JMP", "JNJ", "JO", "JOBS", "JOBURG", "JOT", "JOY", "JP", "JPMORGAN", "JPRS", "JUEGOS", "JUNIPER", "KAUFEN", "KDDI", "KE", "KERRYHOTELS", "KERRYPROPERTIES", "KFH", "KG", "KH", "KI", "KIA", "KIDS", "KIM", "KINDLE", "KITCHEN", "KIWI", "KM", "KN", "KOELN", "KOMATSU", "KOSHER", "KP", "KPMG", "KPN", "KR", "KRD", "KRED", "KUOKGROUP", "KW", "KY", "KYOTO", "KZ", "LA", "LACAIXA", "LAMBORGHINI", "LAMER", "LAND", "LANDROVER", "LANXESS", "LASALLE", "LAT", "LATINO", "LATROBE", "LAW", "LAWYER", "LB", "LC", "LDS", "LEASE", "LECLERC", "LEFRAK", "LEGAL", "LEGO", "LEXUS", "LGBT", "LI", "LIDL", "LIFE", "LIFEINSURANCE", "LIFESTYLE", "LIGHTING", "LIKE", "LILLY", "LIMITED", "LIMO", "LINCOLN", "LINK", "LIVE", "LIVING", "LK", "LLC", "LLP", "LOAN", "LOANS", "LOCKER", "LOCUS", "LOL", "LONDON", "LOTTE", "LOTTO", "LOVE", "LPL", "LPLFINANCIAL", "LR", "LS", "LT", "LTD", "LTDA", "LU", "LUNDBECK", "LUXE", "LUXURY", "LV", "LY", "MA", "MADRID", "MAIF", "MAISON", "MAKEUP", "MAN", "MANAGEMENT", "MANGO", "MAP", "MARKET", "MARKETING", "MARKETS", "MARRIOTT", "MARSHALLS", "MATTEL", "MBA", "MC", "MCKINSEY", "MD", "ME", "MED", "MEDIA", "MEET", "MELBOURNE", "MEME", "MEMORIAL", "MEN", "MENU", "MERCKMSD", "MG", "MH", "MIAMI", "MICROSOFT", "MIL", "MINI", "MINT", "MIT", "MITSUBISHI", "MK", "ML", "MLB", "MLS", "MM", "MMA", "MN", "MO", "MOBI", "MOBILE", "MODA", "MOE", "MOI", "MOM", "MONASH", "MONEY", "MONSTER", "MORMON", "MORTGAGE", "MOSCOW", "MOTO", "MOTORCYCLES", "MOV", "MOVIE", "MP", "MQ", "MR", "MS", "MSD", "MT", "MTN", "MTR", "MU", "MUSEUM", "MUSIC", "MV", "MW", "MX", "MY", "MZ", "NA", "NAB", "NAGOYA", "NAME", "NAVY", "NBA", "NC", "NE", "NEC", "NET", "NETBANK", "NETFLIX", "NETWORK", "NEUSTAR", "NEW", "NEWS", "NEXT", "NEXTDIRECT", "NEXUS", "NF", "NFL", "NG", "NGO", "NHK", "NI", "NICO", "NIKE", "NIKON", "NINJA", "NISSAN", "NISSAY", "NL", "NO", "NOKIA", "NORTON", "NOW", "NOWRUZ", "NOWTV", "NP", "NR", "NRA", "NRW", "NTT", "NU", "NYC", "NZ", "OBI", "OBSERVER", "OFFICE", "OKINAWA", "OLAYAN", "OLAYANGROUP", "OLLO", "OM", "OMEGA", "ONE", "ONG", "ONL", "ONLINE", "OOO", "OPEN", "ORACLE", "ORANGE", "ORG", "ORGANIC", "ORIGINS", "OSAKA", "OTSUKA", "OTT", "OVH", "PA", "PAGE", "PANASONIC", "PARIS", "PARS", "PARTNERS", "PARTS", "PARTY", "PAY", "PCCW", "PE", "PET", "PF", "PFIZER", "PG", "PH", "PHARMACY", "PHD", "PHILIPS", "PHONE", "PHOTO", "PHOTOGRAPHY", "PHOTOS", "PHYSIO", "PICS", "PICTET", "PICTURES", "PID", "PIN", "PING", "PINK", "PIONEER", "PIZZA", "PK", "PL", "PLACE", "PLAY", "PLAYSTATION", "PLUMBING", "PLUS", "PM", "PN", "PNC", "POHL", "POKER", "POLITIE", "PORN", "POST", "PR", "PRAXI", "PRESS", "PRIME", "PRO", "PROD", "PRODUCTIONS", "PROF", "PROGRESSIVE", "PROMO", "PROPERTIES", "PROPERTY", "PROTECTION", "PRU", "PRUDENTIAL", "PS", "PT", "PUB", "PW", "PWC", "PY", "QA", "QPON", "QUEBEC", "QUEST", "RACING", "RADIO", "RE", "READ", "REALESTATE", "REALTOR", "REALTY", "RECIPES", "RED", "REDUMBRELLA", "REHAB", "REISE", "REISEN", "REIT", "RELIANCE", "REN", "RENT", "RENTALS", "REPAIR", "REPORT", "REPUBLICAN", "REST", "RESTAURANT", "REVIEW", "REVIEWS", "REXROTH", "RICH", "RICHARDLI", "RICOH", "RIL", "RIO", "RIP", "RO", "ROCKS", "RODEO", "ROGERS", "ROOM", "RS", "RSVP", "RU", "RUGBY", "RUHR", "RUN", "RW", "RWE", "RYUKYU", "SA", "SAARLAND", "SAFE", "SAFETY", "SAKURA", "SALE", "SALON", "SAMSCLUB", "SAMSUNG", "SANDVIK", "SANDVIKCOROMANT", "SANOFI", "SAP", "SARL", "SAS", "SAVE", "SAXO", "SB", "SBI", "SBS", "SC", "SCB", "SCHAEFFLER", "SCHMIDT", "SCHOLARSHIPS", "SCHOOL", "SCHULE", "SCHWARZ", "SCIENCE", "SCOT", "SD", "SE", "SEARCH", "SEAT", "SECURE", "SECURITY", "SEEK", "SELECT", "SENER", "SERVICES", "SEVEN", "SEW", "SEX", "SEXY", "SFR", "SG", "SH", "SHANGRILA", "SHARP", "SHELL", "SHIA", "SHIKSHA", "SHOES", "SHOP", "SHOPPING", "SHOUJI", "SHOW", "SI", "SILK", "SINA", "SINGLES", "SITE", "SJ", "SK", "SKI", "SKIN", "SKY", "SKYPE", "SL", "SLING", "SM", "SMART", "SMILE", "SN", "SNCF", "SO", "SOCCER", "SOCIAL", "SOFTBANK", "SOFTWARE", "SOHU", "SOLAR", "SOLUTIONS", "SONG", "SONY", "SOY", "SPA", "SPACE", "SPORT", "SPOT", "SR", "SRL", "SS", "ST", "STADA", "STAPLES", "STAR", "STATEBANK", "STATEFARM", "STC", "STCGROUP", "STOCKHOLM", "STORAGE", "STORE", "STREAM", "STUDIO", "STUDY", "STYLE", "SU", "SUCKS", "SUPPLIES", "SUPPLY", "SUPPORT", "SURF", "SURGERY", "SUZUKI", "SV", "SWATCH", "SWISS", "SX", "SY", "SYDNEY", "SYSTEMS", "SZ", "TAB", "TAIPEI", "TALK", "TAOBAO", "TARGET", "TATAMOTORS", "TATAR", "TATTOO", "TAX", "TAXI", "TC", "TCI", "TD", "TDK", "TEAM", "TECH", "TECHNOLOGY", "TEL", "TEMASEK", "TENNIS", "TEVA", "TF", "TG", "TH", "THD", "THEATER", "THEATRE", "TIAA", "TICKETS", "TIENDA", "TIPS", "TIRES", "TIROL", "TJ", "TJMAXX", "TJX", "TK", "TKMAXX", "TL", "TM", "TMALL", "TN", "TO", "TODAY", "TOKYO", "TOOLS", "TOP", "TORAY", "TOSHIBA", "TOTAL", "TOURS", "TOWN", "TOYOTA", "TOYS", "TR", "TRADE", "TRADING", "TRAINING", "TRAVEL", "TRAVELERS", "TRAVELERSINSURANCE", "TRUST", "TRV", "TT", "TUBE", "TUI", "TUNES", "TUSHU", "TV", "TVS", "TW", "TZ", "UA", "UBANK", "UBS", "UG", "UK", "UNICOM", "UNIVERSITY", "UNO", "UOL", "UPS", "US", "UY", "UZ", "VA", "VACATIONS", "VANA", "VANGUARD", "VC", "VE", "VEGAS", "VENTURES", "VERISIGN", "VERSICHERUNG", "VET", "VG", "VI", "VIAJES", "VIDEO", "VIG", "VIKING", "VILLAS", "VIN", "VIP", "VIRGIN", "VISA", "VISION", "VIVA", "VIVO", "VLAANDEREN", "VN", "VODKA", "VOLVO", "VOTE", "VOTING", "VOTO", "VOYAGE", "VU", "WALES", "WALMART", "WALTER", "WANG", "WANGGOU", "WATCH", "WATCHES", "WEATHER", "WEATHERCHANNEL", "WEBCAM", "WEBER", "WEBSITE", "WED", "WEDDING", "WEIBO", "WEIR", "WF", "WHOSWHO", "WIEN", "WIKI", "WILLIAMHILL", "WIN", "WINDOWS", "WINE", "WINNERS", "WME", "WOLTERSKLUWER", "WOODSIDE", "WORK", "WORKS", "WORLD", "WOW", "WS", "WTC", "WTF", "XBOX", "XEROX", "XIHUAN", "XIN", "XN--11B4C3D", "XN--1CK2E1B", "XN--1QQW23A", "XN--2SCRJ9C", "XN--30RR7Y", "XN--3BST00M", "XN--3DS443G", "XN--3E0B707E", "XN--3HCRJ9C", "XN--3PXU8K", "XN--42C2D9A", "XN--45BR5CYL", "XN--45BRJ9C", "XN--45Q11C", "XN--4DBRK0CE", "XN--4GBRIM", "XN--54B7FTA0CC", "XN--55QW42G", "XN--55QX5D", "XN--5SU34J936BGSG", "XN--5TZM5G", "XN--6FRZ82G", "XN--6QQ986B3XL", "XN--80ADXHKS", "XN--80AO21A", "XN--80AQECDR1A", "XN--80ASEHDB", "XN--80ASWG", "XN--8Y0A063A", "XN--90A3AC", "XN--90AE", "XN--90AIS", "XN--9DBQ2A", "XN--9ET52U", "XN--9KRT00A", "XN--B4W605FERD", "XN--BCK1B9A5DRE4C", "XN--C1AVG", "XN--C2BR7G", "XN--CCK2B3B", "XN--CCKWCXETD", "XN--CG4BKI", "XN--CLCHC0EA0B2G2A9GCD", "XN--CZR694B", "XN--CZRS0T", "XN--CZRU2D", "XN--D1ACJ3B", "XN--D1ALF", "XN--E1A4C", "XN--ECKVDTC9D", "XN--EFVY88H", "XN--FCT429K", "XN--FHBEI", "XN--FIQ228C5HS", "XN--FIQ64B", "XN--FIQS8S", "XN--FIQZ9S", "XN--FJQ720A", "XN--FLW351E", "XN--FPCRJ9C3D", "XN--FZC2C9E2C", "XN--FZYS8D69UVGM", "XN--G2XX48C", "XN--GCKR3F0F", "XN--GECRJ9C", "XN--GK3AT1E", "XN--H2BREG3EVE", "XN--H2BRJ9C", "XN--H2BRJ9C8C", "XN--HXT814E", "XN--I1B6B1A6A2E", "XN--IMR513N", "XN--IO0A7I", "XN--J1AEF", "XN--J1AMH", "XN--J6W193G", "XN--JLQ480N2RG", "XN--JVR189M", "XN--KCRX77D1X4A", "XN--KPRW13D", "XN--KPRY57D", "XN--KPUT3I", "XN--L1ACC", "XN--LGBBAT1AD8J", "XN--MGB9AWBF", "XN--MGBA3A3EJT", "XN--MGBA3A4F16A", "XN--MGBA7C0BBN0A", "XN--MGBAAM7A8H", "XN--MGBAB2BD", "XN--MGBAH1A3HJKRD", "XN--MGBAI9AZGQP6J", "XN--MGBAYH7GPA", "XN--MGBBH1A", "XN--MGBBH1A71E", "XN--MGBC0A9AZCG", "XN--MGBCA7DZDO", "XN--MGBCPQ6GPA1A", "XN--MGBERP4A5D4AR", "XN--MGBGU82A", "XN--MGBI4ECEXP", "XN--MGBPL2FH", "XN--MGBT3DHD", "XN--MGBTX2B", "XN--MGBX4CD0AB", "XN--MIX891F", "XN--MK1BU44C", "XN--MXTQ1M", "XN--NGBC5AZD", "XN--NGBE9E0A", "XN--NGBRX", "XN--NODE", "XN--NQV7F", "XN--NQV7FS00EMA", "XN--NYQY26A", "XN--O3CW4H", "XN--OGBPF8FL", "XN--OTU796D", "XN--P1ACF", "XN--P1AI", "XN--PGBS0DH", "XN--PSSY2U", "XN--Q7CE6A", "XN--Q9JYB4C", "XN--QCKA1PMC", "XN--QXA6A", "XN--QXAM", "XN--RHQV96G", "XN--ROVU88B", "XN--RVC1E0AM3E", "XN--S9BRJ9C", "XN--SES554G", "XN--T60B56A", "XN--TCKWE", "XN--TIQ49XQYJ", "XN--UNUP4Y", "XN--VERMGENSBERATER-CTB", "XN--VERMGENSBERATUNG-PWB", "XN--VHQUV", "XN--VUQ861B", "XN--W4R85EL8FHU5DNRA", "XN--W4RS40L", "XN--WGBH1C", "XN--WGBL6A", "XN--XHQ521B", "XN--XKC2AL3HYE2A", "XN--XKC2DL3A5EE0H", "XN--Y9A3AQ", "XN--YFRO4I67O", "XN--YGBI2AMMX", "XN--ZFR164B", "XXX", "XYZ", "YACHTS", "YAHOO", "YAMAXUN", "YANDEX", "YE", "YODOBASHI", "YOGA", "YOKOHAMA", "YOU", "YOUTUBE", "YT", "YUN", "ZA", "ZAPPOS", "ZARA", "ZERO", "ZIP", "ZM", "ZONE", "ZUERICH", "ZW" ];
+const n = e();
 
-Object.defineProperty(rt, "__esModule", {
-    value: true
-});
-
-rt.tlds = void 0;
+const o = t;
 
-const ot = nt;
-
-rt.tlds = new Set(ot.TLDS.map(e => e.toLowerCase()));
+function s() {
+    return function(e, t) {
+        (0, n.getMetadataArgsStorage)().entityListeners.push({
+            target: e.constructor,
+            propertyName: t,
+            type: o.EventListenerTypes.AFTER_RECOVER
+        });
+    };
+}
 
-export { Ne as a, Oe as b, Se as c, rt as d, o as l, tt as r };
+export { a as A };