xe-utils-es/dist/index.js

JavaScript 函数库、工具类

function $(n, t, e) {
  if (n)
    if (n.forEach)
      n.forEach(t, e);
    else
      for (let r = 0, u = n.length; r < u; r++)
        t.call(e, n[r], r, n);
}
const ht = Object.prototype.toString;
function Dn(n) {
  return function(t) {
    return `[object ${n}]` === ht.call(t);
  };
}
const g = Array.isArray || Dn("Array");
function T(n, t) {
  return n && n.hasOwnProperty ? n.hasOwnProperty(t) : !1;
}
function xn(n, t, e) {
  if (n)
    for (const r in n)
      T(n, r) && t.call(e, n[r], r, n);
}
function S(n, t, e) {
  return n && (g(n) ? $ : xn)(n, t, e);
}
function Yn(n, t) {
  const e = Object[n];
  return function(r) {
    const u = [];
    if (r) {
      if (e)
        return e(r);
      S(r, t > 1 ? (s) => {
        u.push([`${s}`, r[s]]);
      } : function() {
        u.push(arguments[t]);
      });
    }
    return u;
  };
}
const P = Yn("keys", 1);
function Pn(n, t) {
  const e = n.__proto__.constructor;
  return t ? new e(t) : new e();
}
function dn(n, t) {
  return t ? pt(n, t) : n;
}
function pt(n, t) {
  if (n)
    switch (ht.call(n)) {
      case "[object Object]": {
        const e = Object.create(n.__proto__);
        return xn(n, (r, u) => {
          e[u] = dn(r, t);
        }), e;
      }
      case "[object Date]":
      case "[object RegExp]":
        return Pn(n, n.valueOf());
      case "[object Array]":
      case "[object Arguments]": {
        const e = [];
        return $(n, (r) => {
          e.push(dn(r, t));
        }), e;
      }
      case "[object Set]": {
        const e = Pn(n);
        return e.forEach((r) => {
          e.add(dn(r, t));
        }), e;
      }
      case "[object Map]": {
        const e = Pn(n);
        return e.forEach((r, u) => {
          e.set(u, dn(r, t));
        }), e;
      }
    }
  return n;
}
function gt(n, t) {
  return n && pt(n, t);
}
const Ln = Object.assign;
function Qn(n, t, e) {
  const r = t.length;
  for (var u, s = 1; s < r; s++)
    u = t[s], $(P(t[s]), e ? (c) => {
      n[c] = gt(u[c], e);
    } : (c) => {
      n[c] = u[c];
    });
  return n;
}
const I = function(n) {
  if (n) {
    const t = arguments;
    if (n === !0) {
      if (t.length > 1)
        return n = g(n[1]) ? [] : {}, Qn(n, t, !0);
    } else
      return Ln ? Ln.apply(Object, t) : Qn(n, t);
  }
  return n;
};
function mt(n, t, e) {
  for (let r = n.length - 1; r >= 0; r--)
    t.call(e, n[r], r, n);
}
function bt(n, t, e) {
  mt(P(n), (r) => {
    t.call(e, n[r], r, n);
  });
}
function hn(n) {
  return function(t) {
    return typeof t === n;
  };
}
const k = hn("function");
function q(n) {
  return n === null;
}
function yn(n, t) {
  return function(e) {
    return q(e) ? t : e[n];
  };
}
function lr(n, t, e) {
  const r = {};
  if (n)
    if (t)
      k(t) || (t = yn(t)), S(n, (u, s) => {
        r[s] = t.call(e, u, s, n);
      });
    else
      return n;
  return r;
}
function nn(n) {
  return n ? n.constructor === Object : !1;
}
function Dt(n, t) {
  return nn(n) && nn(t) || g(n) && g(t) ? (S(t, (e, r) => {
    n[r] = Dt(n[r], e);
  }), n) : t;
}
const ar = function(n) {
  n || (n = {});
  const t = arguments, e = t.length;
  for (var r, u = 1; u < e; u++)
    r = t[u], r && Dt(n, r);
  return n;
};
function cn(n, t, e) {
  const r = [];
  if (n && arguments.length > 1) {
    if (n.map)
      return n.map(t, e);
    S(n, function() {
      r.push(t.apply(e, arguments));
    });
  }
  return r;
}
function In(n, t, e, r, u) {
  return function(s, c, i) {
    if (s && c) {
      if (n && s[n])
        return s[n](c, i);
      if (t && g(s)) {
        for (let o = 0, f = s.length; o < f; o++)
          if (!!c.call(i, s[o], o, s) === r)
            return [!0, !1, o, s[o]][e];
      } else
        for (const o in s)
          if (T(s, o) && !!c.call(i, s[o], o, s) === r)
            return [!0, !1, o, s[o]][e];
    }
    return u;
  };
}
const jt = In("some", 1, 0, !0, !1), ne = In("every", 1, 1, !1, !0);
function gn(n, t) {
  if (n) {
    if (n.includes)
      return n.includes(t);
    for (const e in n)
      if (T(n, e) && t === n[e])
        return !0;
  }
  return !1;
}
function te(n, t) {
  let e, r = 0;
  if (g(n) && g(t)) {
    for (e = t.length; r < e; r++)
      if (!gn(n, t[r]))
        return !1;
    return !0;
  }
  return gn(n, t);
}
function ee(n, t, e) {
  const r = [];
  if (t) {
    k(t) || (t = yn(t));
    let u;
    const s = {};
    S(n, (c, i) => {
      u = t.call(e, c, i, n), s[u] || (s[u] = 1, r.push(c));
    });
  } else
    S(n, (u) => {
      gn(r, u) || r.push(u);
    });
  return r;
}
function yt(n) {
  return cn(n, (t) => t);
}
function hr() {
  const n = arguments;
  let t = [], e = 0;
  const r = n.length;
  for (; e < r; e++)
    t = t.concat(yt(n[e]));
  return ee(t);
}
const H = "undefined", K = hn(H);
function Y(n) {
  return q(n) || K(n);
}
const St = /(.+)?\[(\d+)\]$/;
function Gn(n) {
  return n ? n.splice && n.join ? n : `${n}`.replace(/(\[\d+\])\.?/g, "$1.").replace(/\.$/, "").split(".") : [];
}
function Rn(n, t, e) {
  if (Y(n))
    return e;
  const r = ue(n, t);
  return K(r) ? e : r;
}
function re(n, t) {
  const e = t ? t.match(St) : "";
  return e ? e[1] ? n[e[1]] ? n[e[1]][e[2]] : void 0 : n[e[2]] : n[t];
}
function ue(n, t) {
  if (n) {
    let e, r, u, s = 0;
    if (n[t] || T(n, t))
      return n[t];
    if (r = Gn(t), u = r.length, u) {
      for (e = n; s < u; s++)
        if (e = re(e, r[s]), Y(e))
          return s === u - 1 ? e : void 0;
    }
    return e;
  }
}
const se = "asc", ce = "desc";
function Hn(n, t) {
  return K(n) ? 1 : q(n) ? K(t) ? -1 : 1 : n && n.localeCompare ? n.localeCompare(t) : n > t ? 1 : -1;
}
function ie(n, t, e) {
  return function(r, u) {
    const s = r[n], c = u[n];
    return s === c ? e ? e(r, u) : 0 : t.order === ce ? Hn(c, s) : Hn(s, c);
  };
}
function oe(n, t, e, r) {
  const u = [];
  return e = g(e) ? e : [e], $(e, (s, c) => {
    if (s) {
      let i = s, o;
      g(s) ? (i = s[0], o = s[1]) : nn(s) && (i = s.field, o = s.order), u.push({
        field: i,
        order: o || se
      }), $(t, k(i) ? (f, l) => {
        f[c] = i.call(r, f.data, l, n);
      } : (f) => {
        f[c] = i ? Rn(f.data, i) : f.data;
      });
    }
  }), u;
}
function Nt(n, t, e) {
  if (n) {
    if (Y(t))
      return yt(n).sort(Hn);
    let r, u = cn(n, (i) => ({ data: i }));
    const s = oe(n, u, t, e);
    let c = s.length - 1;
    for (; c >= 0; )
      r = ie(c, s[c], r), c--;
    return r && (u = u.sort(r)), cn(u, yn("data"));
  }
  return [];
}
const pr = Nt;
function fe(n, t) {
  return n >= t ? n : (n = n >> 0) + Math.round(Math.random() * ((t || 9) - n));
}
const Sn = Yn("values", 0);
function le(n) {
  let t;
  const e = [], r = Sn(n);
  let u = r.length - 1;
  for (; u >= 0; u--)
    t = u > 0 ? fe(0, u) : 0, e.push(r[t]), r.splice(t, 1);
  return e;
}
function gr(n, t) {
  const e = le(n);
  return arguments.length <= 1 ? e[0] : (t < e.length && (e.length = t || 0), e);
}
function dt(n) {
  return function(t) {
    if (t) {
      const e = n(t && t.replace ? t.replace(/,/g, "") : t);
      if (!isNaN(e))
        return e;
    }
    return 0;
  };
}
const R = dt(Number.parseFloat);
function Q(n, t, e) {
  const r = [], u = arguments.length;
  if (n) {
    if (t = u >= 2 ? R(t) : 0, e = u >= 3 ? R(e) : n.length, n.slice)
      return n.slice(t, e);
    for (; t < e; t++)
      r.push(n[t]);
  }
  return r;
}
function mr(n, t, e) {
  const r = [];
  if (n && t) {
    if (n.filter)
      return n.filter(t, e);
    S(n, (u, s) => {
      t.call(e, u, s, n) && r.push(u);
    });
  }
  return r;
}
const Dr = In("", 0, 2, !0), yr = In("find", 1, 3, !0);
function Sr(n, t, e) {
  if (n) {
    g(n) || (n = Sn(n));
    for (let r = n.length - 1; r >= 0; r--)
      if (t.call(e, n[r], r, n))
        return n[r];
  }
}
function Nr(n, t, e) {
  if (n) {
    let r, u, s = 0;
    const c = null;
    let i = e;
    const o = arguments.length > 2, f = P(n);
    if (n.length && n.reduce)
      return u = function() {
        return t.apply(c, arguments);
      }, o ? n.reduce(u, i) : n.reduce(u);
    for (o && (s = 1, i = n[f[0]]), r = f.length; s < r; s++)
      i = t.call(c, i, n[f[s]], s, n);
    return i;
  }
}
function dr(n, t, e, r) {
  if (g(n) && n.copyWithin)
    return n.copyWithin(t, e, r);
  let u, s, c = t >> 0, i = e >> 0;
  const o = n.length;
  let f = arguments.length > 3 ? r >> 0 : o;
  if (c < o && (c = c >= 0 ? c : o + c, c >= 0 && (i = i >= 0 ? i : o + i, f = f >= 0 ? f : o + f, i < f)))
    for (u = 0, s = n.slice(i, f); c < o && !(s.length <= u); c++)
      n[c] = s[u++];
  return n;
}
function $r(n, t) {
  let e, r = [];
  const u = t >> 0 || 1;
  if (g(n))
    if (u >= 0 && n.length > u)
      for (e = 0; e < n.length; )
        r.push(n.slice(e, e + u)), e += u;
    else
      r = n.length ? [n] : n;
  return r;
}
function ae(n, t) {
  return cn(n, yn(t));
}
function $t(n) {
  return function(t, e) {
    if (t && t.length) {
      var r, u;
      return $(t, (s, c) => {
        e && (s = k(e) ? e(s, c, t) : Rn(s, e)), !Y(s) && (Y(r) || n(r, s)) && (u = c, r = s);
      }), t[u];
    }
    return r;
  };
}
const he = $t((n, t) => n < t);
function pe(n) {
  let t, e, r;
  const u = [];
  if (n && n.length)
    for (t = 0, e = he(n, (s) => s ? s.length : 0), r = e ? e.length : 0; t < r; t++)
      u.push(ae(n, t));
  return u;
}
function Mr() {
  return pe(arguments);
}
function Or(n, t) {
  const e = {};
  return t = t || [], S(Sn(n), (r, u) => {
    e[r] = t[u];
  }), e;
}
function Mt(n, t) {
  let e = [];
  return $(n, (r) => {
    e = e.concat(g(r) ? t ? Mt(r, t) : r : [r]);
  }), e;
}
function wr(n, t) {
  return g(n) ? Mt(n, t) : [];
}
function ge(n, t) {
  let e = 0;
  const r = t.length;
  for (; n && e < r; )
    n = n[t[e++]];
  return r && n ? n : 0;
}
function Tr(n, t) {
  let e;
  const r = arguments, u = [], s = [];
  let c = 2, i = r.length;
  for (; c < i; c++)
    u.push(r[c]);
  if (g(t)) {
    for (i = t.length - 1, c = 0; c < i; c++)
      s.push(t[c]);
    t = t[i];
  }
  return cn(n, (o) => {
    if (s.length && (o = ge(o, s)), e = o[t] || t, e && e.apply)
      return e.apply(o, u);
  });
}
const w = {
  cookies: {
    path: "/"
  },
  treeOptions: {
    parentKey: "parentId",
    key: "id",
    children: "children"
  },
  parseDateFormat: "yyyy-MM-dd HH:mm:ss",
  firstDayOfWeek: 1
};
function Ot(n, t) {
  try {
    delete n[t];
  } catch {
    n[t] = void 0;
  }
}
function me(n, t, e) {
  return n && (g(n) ? mt : bt)(n, t, e);
}
const Tn = hn("object");
function De(n, t, e) {
  if (n) {
    let r;
    const u = arguments.length > 1 && (q(t) || !Tn(t)), s = u ? e : t;
    if (nn(n))
      xn(n, u ? (c, i) => {
        n[i] = t;
      } : (c, i) => {
        Ot(n, i);
      }), s && I(n, s);
    else if (g(n)) {
      if (u)
        for (r = n.length; r > 0; )
          r--, n[r] = t;
      else
        n.length = 0;
      s && n.push.apply(n, s);
    }
  }
  return n;
}
function ye(n) {
  return function(t, e) {
    return e === n;
  };
}
function Se(n, t, e) {
  if (n) {
    if (!Y(t)) {
      const r = [];
      let u = [];
      return k(t) || (t = ye(t)), S(n, (s, c, i) => {
        t.call(e, s, c, i) && r.push(c);
      }), g(n) ? me(r, (s, c) => {
        u.push(n[s]), n.splice(s, 1);
      }) : (u = {}, $(r, (s) => {
        u[s] = n[s], Ot(n, s);
      })), u;
    }
    return De(n);
  }
  return n;
}
function Ne(n, t) {
  S(n, (e) => {
    e[t] && !e[t].length && Se(e, t);
  });
}
function Er(n, t) {
  const e = I({}, w.treeOptions, t), r = e.strict, u = e.key, s = e.parentKey, c = e.children, i = e.mapChildren, o = e.sortKey, f = e.reverse, l = e.data, h = [], a = {}, m = {};
  let y, d, O;
  return o && (n = Nt(gt(n), o), f && (n = n.reverse())), S(n, (x) => {
    y = x[u], m[y] = !0;
  }), S(n, (x) => {
    y = x[u], l ? (d = {}, d[l] = x) : d = x, O = x[s], a[y] = a[y] || [], a[O] = a[O] || [], a[O].push(d), d[u] = y, d[s] = O, d[c] = a[y], i && (d[i] = a[y]), (!r || r && Y(O)) && (m[O] || h.push(d));
  }), r && Ne(n, c), h;
}
function wt(n, t, e) {
  const r = e.children, u = e.data, s = e.clear;
  return S(t, (c) => {
    const i = c[r];
    u && (c = c[u]), n.push(c), i && i.length && wt(n, i, e), s && delete c[r];
  }), n;
}
function Fr(n, t) {
  return wt([], n, I({}, w.treeOptions, t));
}
function Cn(n) {
  return function(t, e, r, u) {
    const s = r || {}, c = s.children || "children";
    return n(null, t, e, u, [], [], c, s);
  };
}
function Tt(n, t, e, r, u, s, c, i) {
  if (t) {
    let o, f, l, h, a, m;
    for (f = 0, l = t.length; f < l; f++) {
      if (o = t[f], h = u.concat([`${f}`]), a = s.concat([o]), e.call(r, o, f, t, h, n, a))
        return { index: f, item: o, path: h, items: t, parent: n, nodes: a };
      if (c && o && (m = Tt(o, o[c], e, r, h.concat([c]), a, c), m))
        return m;
    }
  }
}
const xr = Cn(Tt);
function Et(n, t, e, r, u, s, c, i) {
  let o, f;
  S(t, (l, h) => {
    o = u.concat([`${h}`]), f = s.concat([l]), e.call(r, l, h, t, o, n, f), l && c && (o.push(c), Et(l, l[c], e, r, o, f, c));
  });
}
const de = Cn(Et);
function Ft(n, t, e, r, u, s, c, i) {
  let o, f, l;
  const h = i.mapChildren || c;
  return cn(t, (a, m) => (o = u.concat([`${m}`]), f = s.concat([a]), l = e.call(r, a, m, t, o, n, f), l && a && c && a[c] && (l[h] = Ft(a, a[c], e, r, o, f, c, i)), l));
}
const Ir = Cn(Ft);
function Rr(n, t, e, r) {
  const u = [];
  return n && t && de(n, (s, c, i, o, f, l) => {
    t.call(r, s, c, i, o, f, l) && u.push(s);
  }, e), u;
}
function xt(n, t, e, r, u, s, c, i, o) {
  let f, l, h, a, m;
  const y = [], d = o.original, O = o.data, x = o.mapChildren || i;
  return $(e, (A, p) => {
    f = s.concat([`${p}`]), l = c.concat([A]), a = n || r.call(u, A, p, e, f, t, l), m = i && A[i], a || m ? (d ? h = A : (h = I({}, A), O && (h[O] = A)), h[x] = xt(a, A, A[i], r, u, f, l, i, o), (a || h[x].length) && y.push(h)) : a && y.push(h);
  }), y;
}
const Cr = Cn((n, t, e, r, u, s, c, i) => xt(0, n, t, e, r, u, s, c, i));
function $e(n, t) {
  if (n.indexOf)
    return n.indexOf(t);
  for (let e = 0, r = n.length; e < r; e++)
    if (t === n[e])
      return e;
}
function Me(n, t) {
  if (n.lastIndexOf)
    return n.lastIndexOf(t);
  for (let e = n.length - 1; e >= 0; e--)
    if (t === n[e])
      return e;
  return -1;
}
const W = hn("number");
function Ar(n) {
  return W(n) && isNaN(n);
}
const G = hn("string"), V = Dn("Date"), B = Number.parseInt;
function Xn(n) {
  return Date.UTC(n.y, n.M || 0, n.d || 1, n.H || 0, n.m || 0, n.s || 0, n.S || 0);
}
function N(n) {
  return n.getTime();
}
function Nn(n) {
  return `(\\d{${n}})`;
}
function Oe(n) {
  return n < 10 ? n * 100 : n < 100 ? n * 10 : n;
}
function Vn(n) {
  return isNaN(n) ? n : B(n);
}
const rn = Nn(2), un = Nn("1,2"), It = Nn("1,7"), Rt = Nn("3,4"), Ct = ".{1}", pn = Ct + un, At = "(([zZ])|([-+]\\d{2}:?\\d{2}))", vn = [Rt, pn, pn, pn, pn, pn, Ct + It, At], zn = [];
for (let n = vn.length - 1; n >= 0; n--) {
  let t = "";
  for (var v = 0; v < n + 1; v++)
    t += vn[v];
  zn.push(new RegExp(`^${t}$`));
}
function we(n) {
  let t;
  const e = {};
  for (let r = 0, u = zn.length; r < u; r++)
    if (t = n.match(zn[r]), t) {
      e.y = t[1], e.M = t[2], e.d = t[3], e.H = t[4], e.m = t[5], e.s = t[6], e.S = t[7], e.Z = t[8];
      break;
    }
  return e;
}
const bn = [
  ["yyyy", Rt],
  ["yy", rn],
  ["MM", rn],
  ["M", un],
  ["dd", rn],
  ["d", un],
  ["HH", rn],
  ["H", un],
  ["mm", rn],
  ["m", un],
  ["ss", rn],
  ["s", un],
  ["SSS", Nn(3)],
  ["S", It],
  ["Z", At]
], Pt = {}, Wt = ["\\[([^\\]]+)\\]"];
for (var v = 0; v < bn.length; v++) {
  const t = bn[v];
  Pt[t[0]] = `${t[1]}?`, Wt.push(t[0]);
}
const Te = new RegExp(Wt.join("|"), "g"), jn = {};
function Ee(n, t) {
  let e = jn[t];
  if (!e) {
    const s = [], c = t.replace(/([$(){}*+.?\\^|])/g, "\\$1").replace(Te, (i, o) => {
      const f = i.charAt(0);
      return f === "[" ? o : (s.push(f), Pt[i]);
    });
    e = jn[t] = {
      _i: s,
      _r: new RegExp(c)
    };
  }
  const r = {}, u = n.match(e._r);
  if (u) {
    const s = e._i;
    for (let c = 1, i = u.length; c < i; c++)
      r[s[c - 1]] = u[c];
    return r;
  }
  return r;
}
function Fe(n) {
  if (/^[zZ]/.test(n.Z))
    return new Date(Xn(n));
  {
    const t = n.Z.match(/([-+])(\d{2}):?(\d{2})/);
    if (t)
      return new Date(Xn(n) - (t[1] === "-" ? -1 : 1) * B(t[2]) * 36e5 + B(t[3]) * 6e4);
  }
  return /* @__PURE__ */ new Date("");
}
function E(n, t) {
  if (n) {
    const e = V(n);
    if (e || !t && /^[0-9]{11,15}$/.test(n))
      return new Date(e ? N(n) : B(n));
    if (G(n)) {
      const r = t ? Ee(n, t) : we(n);
      if (r.y)
        return r.M && (r.M = Vn(r.M) - 1), r.S && (r.S = Oe(Vn(r.S.substring(0, 3)))), r.Z ? Fe(r) : new Date(r.y, r.M || 0, r.d || 1, r.H || 0, r.m || 0, r.s || 0, r.S || 0);
    }
  }
  return /* @__PURE__ */ new Date("");
}
function An() {
  return /* @__PURE__ */ new Date();
}
function xe(n) {
  let t;
  const e = n ? E(n) : An();
  return V(e) ? (t = e.getFullYear(), t % 4 === 0 && (t % 100 !== 0 || t % 400 === 0)) : !1;
}
function Pr(n, t, e) {
  if (n) {
    if (g(n))
      for (let r = 0, u = n.length; r < u && t.call(e, n[r], r, n) !== !1; r++)
        ;
    else
      for (const r in n)
        if (T(n, r) && t.call(e, n[r], r, n) === !1)
          break;
  }
}
function Wr(n, t, e) {
  if (n) {
    let r, u;
    if (g(n))
      for (r = n.length - 1; r >= 0 && t.call(e, n[r], r, n) !== !1; r--)
        ;
    else
      for (u = T(n), r = u.length - 1; r >= 0 && t.call(e, n[u[r]], u[r], n) !== !1; r--)
        ;
  }
}
function _t(n, t) {
  return function(e, r) {
    if (e) {
      if (e[n])
        return e[n](r);
      if (G(e) || g(e))
        return t(e, r);
      for (const u in e)
        if (T(e, u) && r === e[u])
          return u;
    }
    return -1;
  };
}
const _r = _t("indexOf", $e), Ie = _t("lastIndexOf", Me);
function Re(n) {
  let t = 0;
  return G(n) || g(n) ? n.length : (S(n, () => {
    t++;
  }), t);
}
function kr(n) {
  return W(n) && isFinite(n);
}
const Ce = function(n) {
  return !q(n) && !isNaN(n) && !g(n) && n % 1 === 0;
};
function Hr(n) {
  return !q(n) && !isNaN(n) && !g(n) && !Ce(n);
}
const Ae = hn("boolean"), kt = Dn("RegExp"), Pe = Dn("Error");
function zr(n) {
  return n ? n.constructor === TypeError : !1;
}
function We(n) {
  for (const t in n)
    return !1;
  return !0;
}
const _e = typeof Symbol !== H;
function ke(n) {
  return _e && Symbol.isSymbol ? Symbol.isSymbol(n) : typeof n == "symbol";
}
const Zr = Dn("Arguments");
function Kr(n) {
  return !!(n && G(n.nodeName) && W(n.nodeType));
}
const b = typeof document === H ? 0 : document;
function Ur(n) {
  return !!(n && b && n.nodeType === 9);
}
const Mn = typeof window === H ? 0 : window;
function Yr(n) {
  return Mn && !!(n && n === n.window);
}
const He = typeof FormData !== H;
function Gr(n) {
  return He && n instanceof FormData;
}
const ze = typeof Map !== H;
function Br(n) {
  return ze && n instanceof Map;
}
const Ze = typeof WeakMap !== H;
function qr(n) {
  return Ze && n instanceof WeakMap;
}
const Ke = typeof Set !== H;
function Jr(n) {
  return Ke && n instanceof Set;
}
const Ue = typeof WeakSet !== H;
function Lr(n) {
  return Ue && n instanceof WeakSet;
}
function Ht(n) {
  return function(t, e, r) {
    if (t && k(e)) {
      if (g(t) || G(t))
        return n(t, e, r);
      for (const u in t)
        if (T(t, u) && e.call(r, t[u], u, t))
          return u;
    }
    return -1;
  };
}
const zt = Ht((n, t, e) => {
  for (let r = 0, u = n.length; r < u; r++)
    if (t.call(e, n[r], r, n))
      return r;
  return -1;
});
function En(n, t, e, r, u, s, c) {
  if (n === t)
    return !0;
  if (n && t && !W(n) && !W(t) && !G(n) && !G(t)) {
    if (kt(n))
      return e(`${n}`, `${t}`, u, s, c);
    if (V(n) || Ae(n))
      return e(+n, +t, u, s, c);
    {
      let i, o, f;
      const l = g(n), h = g(t);
      if (l || h ? l && h : n.constructor === t.constructor)
        return o = P(n), f = P(t), r && (i = r(n, t, u)), o.length === f.length ? K(i) ? ne(o, (a, m) => a === f[m] && En(n[a], t[f[m]], e, r, l || h ? m : a, n, t)) : !!i : !1;
    }
  }
  return e(n, t, u, s, c);
}
function Zn(n, t) {
  return n === t;
}
function nt(n, t) {
  return En(n, t, Zn);
}
function Qr(n, t) {
  const e = P(n), r = P(t);
  if (r.length) {
    if (te(e, r))
      return jt(r, (u) => zt(e, (s) => s === u && nt(n[s], t[u])) > -1);
  } else
    return !0;
  return nt(n, t);
}
function Xr(n, t, e) {
  return k(e) ? En(n, t, (r, u, s, c, i) => {
    const o = e(r, u, s, c, i);
    return K(o) ? Zn(r, u) : !!o;
  }, e) : En(n, t, Zn);
}
function Vr(n) {
  return q(n) ? "null" : ke(n) ? "symbol" : V(n) ? "date" : g(n) ? "array" : kt(n) ? "regexp" : Pe(n) ? "error" : typeof n;
}
let Ye = 0;
function vr(n) {
  return [n, ++Ye].join("");
}
const br = Ht((n, t, e) => {
  for (let r = n.length - 1; r >= 0; r--)
    if (t.call(e, n[r], r, n))
      return r;
  return -1;
});
function jr(n) {
  if (nn(n))
    return n;
  if (G(n))
    try {
      return JSON.parse(n);
    } catch {
    }
  return {};
}
function nu(n) {
  return Y(n) ? "" : JSON.stringify(n);
}
const tu = Yn("entries", 2);
function Zt(n, t) {
  return function(e, r) {
    let u, s;
    const c = {}, i = [], o = this, f = arguments, l = f.length;
    if (!k(r)) {
      for (s = 1; s < l; s++)
        u = f[s], i.push.apply(i, g(u) ? u : [u]);
      r = 0;
    }
    return S(e, (h, a) => {
      ((r ? r.call(o, h, a, e) : zt(i, (m) => m === a) > -1) ? n : t) && (c[a] = h);
    }), c;
  };
}
const eu = Zt(1, 0), ru = Zt(0, 1);
function uu(n) {
  return Sn(n)[0];
}
function su(n) {
  const t = Sn(n);
  return t[t.length - 1];
}
function cu(n, t) {
  if (n) {
    if (T(n, t))
      return !0;
    {
      let e, r, u, s, c, i;
      const o = Gn(t);
      let f = 0;
      const l = o.length;
      for (c = n; f < l && (i = !1, e = o[f], s = e ? e.match(St) : "", s ? (r = s[1], u = s[2], r ? c[r] && T(c[r], u) && (i = !0, c = c[r][u]) : T(c, u) && (i = !0, c = c[u])) : T(c, e) && (i = !0, c = c[e]), i); f++)
        if (f === l - 1)
          return !0;
    }
  }
  return !1;
}
const tt = /(.+)?\[(\d+)\]$/;
function Ge(n, t, e, r, u) {
  if (n[t])
    e && (n[t] = u);
  else {
    let s, c;
    const i = t ? t.match(tt) : null;
    if (e)
      c = u;
    else {
      const o = r ? r.match(tt) : null;
      o && !o[1] ? c = new Array(B(o[2]) + 1) : c = {};
    }
    return i ? i[1] ? (s = B(i[2]), n[i[1]] ? e ? n[i[1]][s] = c : n[i[1]][s] ? c = n[i[1]][s] : n[i[1]][s] = c : (n[i[1]] = new Array(s + 1), n[i[1]][s] = c)) : n[i[2]] = c : n[t] = c, c;
  }
  return n[t];
}
function iu(n, t, e) {
  if (n)
    if ((n[t] || T(n, t)) && !et(t))
      n[t] = e;
    else {
      let r = n;
      const u = Gn(t), s = u.length;
      for (let c = 0; c < s; c++) {
        if (et(u[c]))
          continue;
        const i = c === s - 1;
        r = Ge(r, u[c], i, i ? null : u[c + 1], e);
      }
    }
  return n;
}
function et(n) {
  return n === "__proto__" || n === "constructor" || n === "prototype";
}
function Be(n) {
  return function() {
    return We(n);
  };
}
function qe(n, t, e) {
  let r;
  const u = {};
  return n && (t && Tn(t) ? t = Be(t) : k(t) || (t = yn(t)), S(n, (s, c) => {
    r = t ? t.call(e, s, c, n) : s, u[r] ? u[r].push(s) : u[r] = [s];
  })), u;
}
function ou(n, t, e) {
  const r = qe(n, t, e || this);
  return xn(r, (u, s) => {
    r[s] = u.length;
  }), r;
}
function fu(n, t, e) {
  let r, u;
  const s = [], c = arguments;
  if (c.length < 2 && (t = c[0], n = 0), r = n >> 0, u = t >> 0, r < t)
    for (e = e >> 0 || 1; r < u; r += e)
      s.push(r);
  return s;
}
function lu(n, t) {
  if (n && t) {
    const e = I.apply(this, [{}].concat(Q(arguments, 1))), r = P(e);
    $(P(n), (u) => {
      gn(r, u) && (n[u] = e[u]);
    });
  }
  return n;
}
const au = $t((n, t) => n > t);
function X(n) {
  return (n.split(".")[1] || "").length;
}
function L(n, t) {
  if (n.repeat)
    return n.repeat(t);
  const e = isNaN(t) ? [] : new Array(B(t));
  return e.join(n) + (e.length > 0 ? n : "");
}
function On(n, t) {
  return `${n.substring(0, t)}.${n.substring(t, n.length)}`;
}
function _(n) {
  const t = `${n}`, e = t.match(/^([-+]?)((\d+)|((\d+)?[.](\d+)?))e([-+]{1})([0-9]+)$/);
  if (e) {
    const u = n < 0 ? "-" : "", s = e[3] || "", c = e[5] || "", i = e[6] || "", o = e[7], f = e[8], l = f - i.length, h = f - s.length, a = f - c.length;
    return o === "+" ? s ? u + s + L("0", f) : l > 0 ? u + c + i + L("0", l) : u + c + On(i, f) : s ? h > 0 ? `${u}0.${L("0", Math.abs(h))}${s}` : u + On(s, h) : a > 0 ? `${u}0.${L("0", Math.abs(a))}${c}${i}` : u + On(c, a) + i;
  }
  return t;
}
function Kt(n, t) {
  const e = _(n), r = _(t);
  return Number.parseInt(e.replace(".", "")) * Number.parseInt(r.replace(".", "")) / 10 ** (X(e) + X(r));
}
function Bn(n) {
  return function(t, e) {
    const r = R(t);
    let u = r;
    if (r) {
      e = e >> 0;
      const c = _(r).split("."), i = c[0], o = c[1] || "", f = o.substring(0, e + 1);
      let l = i + (f ? `.${f}` : "");
      if (e >= o.length)
        return R(l);
      if (l = r, e > 0) {
        const h = 10 ** e;
        u = Math[n](Kt(l, h)) / h;
      } else
        u = Math[n](l);
    }
    return u;
  };
}
const Ut = Bn("round"), Je = Bn("ceil"), Le = Bn("floor");
function F(n) {
  return W(n) ? _(n) : `${Y(n) ? "" : n}`;
}
function Yt(n, t) {
  t = t >> 0;
  const r = F(Ut(n, t)).split("."), u = r[0], s = r[1] || "", c = t - s.length;
  return t ? c > 0 ? `${u}.${s}${L("0", c)}` : u + On(s, Math.abs(c)) : u;
}
function hu(n, t) {
  const e = I({}, w.commafyOptions, t), r = e.digits, u = W(n);
  let s, c, i, o, f;
  return u ? (s = (e.ceil ? Je : e.floor ? Le : Ut)(n, r), c = _(r ? Yt(s, r) : s).split("."), o = c[0], f = c[1], i = o && s < 0, i && (o = o.substring(1, o.length))) : (s = F(n).replace(/,/g, ""), c = s ? [s] : [], o = c[0]), c.length ? (i ? "-" : "") + o.replace(new RegExp(`(?=(?!(\\b))(.{${e.spaceNumber || 3}})+$)`, "g"), e.separator || ",") + (f ? `.${f}` : "") : s;
}
const pu = dt(B);
function Kn(n, t) {
  const e = R(n), r = R(t);
  return Kt(e, r);
}
function wn(n, t) {
  const e = _(n), r = _(t), u = 10 ** Math.max(X(e), X(r));
  return (Kn(n, u) + Kn(t, u)) / u;
}
function gu(n, t) {
  return wn(R(n), R(t));
}
function mu(n, t) {
  const e = R(n), r = R(t), u = _(e), s = _(r), c = X(u), i = X(s), o = 10 ** Math.max(c, i), f = c >= i ? c : i;
  return Number.parseFloat(Yt((e * o - r * o) / o, f));
}
function Gt(n, t) {
  const e = _(n), r = _(t), u = X(e), c = X(r) - u, i = c < 0, o = 10 ** (i ? Math.abs(c) : c);
  return Kn(e.replace(".", "") / r.replace(".", ""), i ? 1 / o : o);
}
function Du(n, t) {
  return Gt(R(n), R(t));
}
function Qe(n, t, e) {
  let r = 0;
  return S(n, t ? k(t) ? function() {
    r = wn(r, t.apply(e, arguments));
  } : (u) => {
    r = wn(r, Rn(u, t));
  } : (u) => {
    r = wn(r, u);
  }), r;
}
function yu(n, t, e) {
  return Gt(Qe(n, t, e), Re(n));
}
const tn = "first", mn = "last";
function on(n) {
  return n.getFullYear();
}
const j = 864e5;
function fn(n) {
  return n.getMonth();
}
function C(n) {
  return V(n) && !isNaN(N(n));
}
function ln(n, t, e) {
  const r = t && !isNaN(t) ? t : 0;
  if (n = E(n), C(n)) {
    if (e === tn)
      return new Date(on(n), fn(n) + r, 1);
    if (e === mn)
      return new Date(N(ln(n, r + 1, tn)) - 1);
    if (W(e) && n.setDate(e), r) {
      const u = n.getDate();
      if (n.setMonth(fn(n) + r), u !== n.getDate())
        return n.setDate(1), new Date(N(n) - j);
    }
  }
  return n;
}
function qn(n, t, e) {
  let r;
  if (n = E(n), C(n) && (t && (r = t && !isNaN(t) ? t : 0, n.setFullYear(on(n) + r)), e || !isNaN(e))) {
    if (e === tn)
      return new Date(on(n), 0, 1);
    if (e === mn)
      return n.setMonth(11), ln(n, 0, mn);
    n.setMonth(e);
  }
  return n;
}
function Xe(n) {
  const t = n.getMonth();
  return t < 3 ? 1 : t < 6 ? 2 : t < 9 ? 3 : 4;
}
function Su(n, t, e) {
  let r;
  const u = t && !isNaN(t) ? t * 3 : 0;
  return n = E(n), C(n) ? (r = (Xe(n) - 1) * 3, n.setMonth(r), ln(n, u, e)) : n;
}
function Bt(n, t, e) {
  if (n = E(n), C(n) && !isNaN(t)) {
    if (n.setDate(n.getDate() + B(t)), e === tn)
      return new Date(on(n), fn(n), n.getDate());
    if (e === mn)
      return new Date(N(Bt(n, 1, tn)) - 1);
  }
  return n;
}
function sn(n) {
  return n.toUpperCase();
}
const qt = j * 7;
function Ve(n, t, e, r) {
  if (n = E(n), C(n)) {
    const u = W(e), s = W(r);
    let c = N(n);
    if (u || s) {
      const i = s ? r : w.firstDayOfWeek, o = n.getDay(), f = u ? e : o;
      if (o !== f) {
        let l = 0;
        i > o ? l = -(7 - i + o) : i < o && (l = i - o), f > i ? c += ((f === 0 ? 7 : f) - i + l) * j : f < i ? c += (7 - i + f + l) * j : c += l * j;
      }
    }
    return t && !isNaN(t) && (c += t * qt), new Date(c);
  }
  return n;
}
function Jt(n) {
  return function(t, e) {
    const r = W(e) ? e : w.firstDayOfWeek, u = Ve(t, 0, r, r);
    if (C(u)) {
      const s = new Date(u.getFullYear(), u.getMonth(), u.getDate()), c = n(u), i = c.getDay();
      return i > r && c.setDate(7 - i + r + 1), i < r && c.setDate(r - i + 1), Math.floor((N(s) - N(c)) / qt + 1);
    }
    return Number.NaN;
  };
}
const ve = Jt((n) => new Date(n.getFullYear(), 0, 1));
function be(n) {
  return new Date(on(n), fn(n), n.getDate());
}
function rt(n) {
  return N(be(n));
}
function je(n) {
  return n = E(n), C(n) ? Math.floor((rt(n) - rt(qn(n, 0, tn))) / j) + 1 : Number.NaN;
}
function z(n, t, e) {
  const r = F(n);
  return t = t >> 0, e = K(e) ? " " : `${e}`, r.padStart ? r.padStart(t, e) : t > r.length ? (t -= r.length, t > e.length && (e += L(e, t / e.length)), e.slice(0, t) + r) : r;
}
function J(n, t, e, r) {
  const u = t[e];
  return u ? k(u) ? u(r, e, n) : u[r] : r;
}
const nr = /\[([^\]]+)]|y{2,4}|M{1,2}|d{1,2}|H{1,2}|h{1,2}|m{1,2}|s{1,2}|S{1,3}|Z{1,2}|W{1,2}|D{1,3}|[aAeEq]/g;
function ut(n, t, e) {
  if (n) {
    if (n = E(n), C(n)) {
      const r = t || w.parseDateFormat || w.formatString, u = n.getHours(), s = u < 12 ? "am" : "pm", c = I({}, w.parseDateRules || w.formatStringMatchs, e ? e.formats : null), i = function(p, D) {
        return `${on(n)}`.substr(4 - D);
      }, o = function(p, D) {
        return z(fn(n) + 1, D, "0");
      }, f = function(p, D) {
        return z(n.getDate(), D, "0");
      }, l = function(p, D) {
        return z(u, D, "0");
      }, h = function(p, D) {
        return z(u <= 12 ? u : u - 12, D, "0");
      }, a = function(p, D) {
        return z(n.getMinutes(), D, "0");
      }, m = function(p, D) {
        return z(n.getSeconds(), D, "0");
      }, y = function(p, D) {
        return z(n.getMilliseconds(), D, "0");
      }, d = function(p, D) {
        const Jn = n.getTimezoneOffset() / 60 * -1;
        return J(n, c, p, `${(Jn >= 0 ? "+" : "-") + z(Jn, 2, "0") + (D === 1 ? ":" : "")}00`);
      }, O = function(p, D) {
        return z(J(n, c, p, ve(n, (e ? e.firstDay : null) || w.firstDayOfWeek)), D, "0");
      }, x = function(p, D) {
        return z(J(n, c, p, je(n)), D, "0");
      }, A = {
        yyyy: i,
        yy: i,
        MM: o,
        M: o,
        dd: f,
        d: f,
        HH: l,
        H: l,
        hh: h,
        h,
        mm: a,
        m: a,
        ss: m,
        s: m,
        SSS: y,
        S: y,
        ZZ: d,
        Z: d,
        WW: O,
        W: O,
        DDD: x,
        D: x,
        a(p) {
          return J(n, c, p, s);
        },
        A(p) {
          return J(n, c, p, sn(s));
        },
        e(p) {
          return J(n, c, p, n.getDay());
        },
        E(p) {
          return J(n, c, p, n.getDay());
        },
        q(p) {
          return J(n, c, p, Math.floor((fn(n) + 3) / 3));
        }
      };
      return r.replace(nr, (p, D) => D || (A[p] ? A[p](p, p.length) : p));
    }
    return "Invalid Date";
  }
  return "";
}
const tr = Date.now || function() {
  return N(An());
}, Nu = function(n, t) {
  if (n) {
    const e = E(n, t);
    return V(e) ? N(e) : e;
  }
  return tr();
};
function du(n, t, e) {
  return n && t ? (n = ut(n, e), n !== "Invalid Date" && n === ut(t, e)) : !1;
}
const $u = Jt((n) => new Date(n.getFullYear(), n.getMonth(), 1));
function Mu(n, t) {
  return n = E(n), C(n) ? xe(qn(n, t)) ? 366 : 365 : Number.NaN;
}
function Ou(n, t) {
  return n = E(n), C(n) ? Math.floor((N(ln(n, t, mn)) - N(ln(n, t, tn))) / j) + 1 : Number.NaN;
}
const st = [
  ["yyyy", 31536e6],
  ["MM", 2592e6],
  ["dd", 864e5],
  ["HH", 36e5],
  ["mm", 6e4],
  ["ss", 1e3],
  ["S", 0]
];
function wu(n, t) {
  let e, r, u, s, c, i;
  const o = { done: !1, time: 0 };
  if (n = E(n), t = t ? E(t) : An(), C(n) && C(t) && (e = N(n), r = N(t), e < r))
    for (s = o.time = r - e, o.done = !0, i = 0, c = st.length; i < c; i++)
      u = st[i], s >= u[1] ? i === c - 1 ? o[u[0]] = s || 0 : (o[u[0]] = Math.floor(s / u[1]), s -= o[u[0]] * u[1]) : o[u[0]] = 0;
  return o;
}
function Tu(n, t, e) {
  const r = F(n);
  return t = t >> 0, e = K(e) ? " " : `${e}`, r.padEnd ? r.padEnd(t, e) : t > r.length ? (t -= r.length, t > e.length && (e += L(e, t / e.length)), r + e.slice(0, t)) : r;
}
function Eu(n, t) {
  return L(F(n), t);
}
function er(n) {
  return n && n.trimRight ? n.trimRight() : F(n).replace(/[\s\uFEFF\xA0]+$/g, "");
}
function rr(n) {
  return n && n.trimLeft ? n.trimLeft() : F(n).replace(/^[\s\uFEFF\xA0]+/g, "");
}
function ur(n) {
  return n && n.trim ? n.trim() : er(rr(n));
}
const Un = {
  "&": "&amp;",
  "<": "&lt;",
  ">": "&gt;",
  '"': "&quot;",
  "'": "&#x27;",
  "`": "&#x60;"
};
function Lt(n) {
  const t = new RegExp(`(?:${P(n).join("|")})`, "g");
  return function(e) {
    return F(e).replace(t, (r) => n[r]);
  };
}
const Fu = Lt(Un), Qt = {};
S(Un, (n, t) => {
  Qt[Un[t]] = t;
});
const xu = Lt(Qt);
function M(n, t, e) {
  return n.substring(t, e);
}
function U(n) {
  return n.toLowerCase();
}
const Wn = {};
function Iu(n) {
  if (n = F(n), Wn[n])
    return Wn[n];
  let t = n.length, e = n.replace(/([-]+)/g, (r, u, s) => s && s + u.length < t ? "-" : "");
  return t = e.length, e = e.replace(/([A-Z]+)/g, (r, u, s) => {
    const c = u.length;
    return u = U(u), s ? c > 2 && s + c < t ? sn(M(u, 0, 1)) + M(u, 1, c - 1) + sn(M(u, c - 1, c)) : sn(M(u, 0, 1)) + M(u, 1, c) : c > 1 && s + c < t ? M(u, 0, c - 1) + sn(M(u, c - 1, c)) : u;
  }).replace(/(-[a-zA-Z])/g, (r, u) => sn(M(u, 1, u.length))), Wn[n] = e, e;
}
const _n = {};
function Ru(n) {
  if (n = F(n), _n[n])
    return _n[n];
  if (/^[A-Z]+$/.test(n))
    return U(n);
  let t = n.replace(/^([a-z])([A-Z]+)([a-z]+)$/, (e, r, u, s) => {
    const c = u.length;
    return c > 1 ? `${r}-${U(M(u, 0, c - 1))}-${U(M(u, c - 1, c))}${s}` : U(`${r}-${u}${s}`);
  }).replace(/^([A-Z]+)([a-z]+)?$/, (e, r, u) => {
    const s = r.length;
    return U(`${M(r, 0, s - 1)}-${M(r, s - 1, s)}${u || ""}`);
  }).replace(/([a-z]?)([A-Z]+)([a-z]?)/g, (e, r, u, s, c) => {
    const i = u.length;
    return i > 1 && (r && (r += "-"), s) ? `${(r || "") + U(M(u, 0, i - 1))}-${U(M(u, i - 1, i))}${s}` : (r || "") + (c ? "-" : "") + U(u) + (s || "");
  });
  return t = t.replace(/([-]+)/g, (e, r, u) => u && u + r.length < t.length ? "-" : ""), _n[n] = t, t;
}
function Cu(n, t, e) {
  const r = F(n);
  return (arguments.length === 1 ? r : r.substring(e)).indexOf(t) === 0;
}
function Au(n, t, e) {
  const r = F(n), u = arguments.length;
  return u > 1 && (u > 2 ? r.substring(0, e).indexOf(t) === e - 1 : r.indexOf(t) === r.length - 1);
}
function sr(n, t, e) {
  return F(n).replace((e || w).tmplRE || /\{{2}([.\w[\]\s]+)\}{2}/g, (r, u) => Rn(t, ur(u)));
}
function Pu(n, t) {
  return sr(n, t, { tmplRE: /\{([.\w[\]\s]+)\}/g });
}
function Wu() {
}
function _u(n, t) {
  const e = Q(arguments, 2);
  return function() {
    return n.apply(t, Q(arguments).concat(e));
  };
}
function ku(n, t) {
  let e = !1, r = null;
  const u = Q(arguments, 2);
  return function() {
    return e || (r = n.apply(t, Q(arguments).concat(u)), e = !0), r;
  };
}
function Hu(n, t, e) {
  let r = 0;
  const u = [];
  return function() {
    const s = arguments;
    r++, r <= n && u.push(s[0]), r >= n && t.apply(e, [u].concat(Q(s)));
  };
}
function zu(n, t, e) {
  let r = 0;
  const u = [];
  return e = e || this, function() {
    const s = arguments;
    r++, r < n && (u.push(s[0]), t.apply(e, [u].concat(Q(s))));
  };
}
function Zu(n, t, e) {
  let r, u;
  const s = e || {};
  let c = !1, i = 0;
  const o = "leading" in s ? s.leading : !0, f = "trailing" in s ? s.trailing : !1, l = function() {
    c = !0, n.apply(u, r), i = setTimeout(h, t);
  };
  var h = function() {
    i = 0, !c && f === !0 && l();
  };
  const a = function() {
    const y = i !== 0;
    return clearTimeout(i), r = null, u = null, c = !1, i = 0, y;
  }, m = function() {
    r = arguments, u = this, c = !1, i === 0 && (o === !0 ? l() : f === !0 && (i = setTimeout(h, t)));
  };
  return m.cancel = a, m;
}
function Ku(n, t, e) {
  let r, u;
  const s = e || {};
  let c = !1, i = 0;
  const o = typeof e == "boolean", f = "leading" in s ? s.leading : o, l = "trailing" in s ? s.trailing : !o, h = function() {
    c = !0, i = 0, n.apply(u, r);
  }, a = function() {
    f === !0 && (i = 0), !c && l === !0 && h();
  }, m = function() {
    const d = i !== 0;
    return clearTimeout(i), r = null, u = null, i = 0, d;
  }, y = function() {
    c = !1, r = arguments, u = this, i === 0 ? f === !0 && h() : clearTimeout(i), i = setTimeout(a, t);
  };
  return y.cancel = m, y;
}
function Uu(n, t) {
  const e = Q(arguments, 2), r = this;
  return setTimeout(() => {
    n.apply(r, e);
  }, t);
}
const Fn = decodeURIComponent;
function cr(n) {
  let t;
  const e = {};
  return n && G(n) && $(n.split("&"), (r) => {
    t = r.split("="), e[Fn(t[0])] = Fn(t[1] || "");
  }), e;
}
const an = encodeURIComponent;
function Xt(n, t, e) {
  let r, u = [];
  return S(n, (s, c) => {
    r = g(s), nn(s) || r ? u = u.concat(Xt(s, `${t}[${c}]`, r)) : u.push(`${an(`${t}[${e ? "" : c}]`)}=${an(q(s) ? "" : s)}`);
  }), u;
}
function Yu(n) {
  let t, e = [];
  return S(n, (r, u) => {
    K(r) || (t = g(r), nn(r) || t ? e = e.concat(Xt(r, u, t)) : e.push(`${an(u)}=${an(q(r) ? "" : r)}`));
  }), e.join("&").replace(/%20/g, "+");
}
const Z = typeof location === H ? 0 : location;
function Vt() {
  return Z ? Z.origin || `${Z.protocol}//${Z.host}` : "";
}
function ct(n) {
  return cr(n.split("?")[1] || "");
}
function ir(n) {
  let t, e, r, u, s = `${n}`;
  return s.indexOf("//") === 0 ? s = (Z ? Z.protocol : "") + s : s.indexOf("/") === 0 && (s = Vt() + s), r = s.replace(/#.*/, "").match(/(\?.*)/), u = {
    href: s,
    hash: "",
    host: "",
    hostname: "",
    protocol: "",
    port: "",
    search: r && r[1] && r[1].length > 1 ? r[1] : ""
  }, u.path = s.replace(/^([a-z0-9.+-]*:)\/\//, (c, i) => (u.protocol = i, "")).replace(/^([a-z0-9.+-]*)(:\d+)?\/?/, (c, i, o) => (e = o || "", u.port = e.replace(":", ""), u.hostname = i, u.host = i + e, "/")).replace(/(#.*)/, (c, i) => (u.hash = i.length > 1 ? i : "", "")), t = u.hash.match(/#((.*)\?|(.*))/), u.pathname = u.path.replace(/(\?|#.*).*/, ""), u.origin = `${u.protocol}//${u.host}`, u.hashKey = t && (t[2] || t[1]) || "", u.hashQuery = ct(u.hash), u.searchQuery = ct(u.search), u;
}
function Gu() {
  if (Z) {
    const n = Z.pathname, t = Ie(n, "/") + 1;
    return Vt() + (t === n.length ? n : n.substring(0, t));
  }
  return "";
}
function Bu() {
  return Z ? ir(Z.href) : {};
}
function it(n, t) {
  const e = Number.parseFloat(t), r = An(), u = N(r);
  switch (n) {
    case "y":
      return N(qn(r, e));
    case "M":
      return N(ln(r, e));
    case "d":
      return N(Bt(r, e));
    case "h":
    case "H":
      return u + e * 60 * 60 * 1e3;
    case "m":
      return u + e * 60 * 1e3;
    case "s":
      return u + e * 1e3;
  }
  return u;
}
function kn(n) {
  return (V(n) ? n : new Date(n)).toUTCString();
}
function en(n, t, e) {
  if (b) {
    let r, u, s, c, i, o, f = [];
    const l = arguments;
    return g(n) ? f = n : l.length > 1 ? f = [I({ name: n, value: t }, e)] : Tn(n) && (f = [n]), f.length > 0 ? ($(f, (h) => {
      r = I({}, w.cookies, h), s = [], r.name && (u = r.expires, s.push(`${an(r.name)}=${an(Tn(r.value) ? JSON.stringify(r.value) : r.value)}`), u && (isNaN(u) ? u = u.replace(/^([0-9]+)(y|M|d|H|h|m|s)$/, (a, m, y) => kn(it(y, m))) : /^[0-9]{11,13}$/.test(u) || V(u) ? u = kn(u) : u = kn(it("d", u)), r.expires = u), $(["expires", "path", "domain", "secure"], (a) => {
        K(r[a]) || s.push(r[a] && a === "secure" ? a : `${a}=${r[a]}`);
      })), b.cookie = s.join("; ");
    }), !0) : (c = {}, i = b.cookie, i && $(i.split("; "), (h) => {
      o = h.indexOf("="), c[Fn(h.substring(0, o))] = Fn(h.substring(o + 1) || "");
    }), l.length === 1 ? c[n] : c);
  }
  return !1;
}
function or(n) {
  return gn(vt(), n);
}
function ot(n) {
  return en(n);
}
function ft(n, t, e) {
  return en(n, t, e), en;
}
function lt(n, t) {
  en(n, "", I({ expires: -1 }, w.cookies, t));
}
function vt() {
  return P(en());
}
function fr() {
  return en();
}
I(en, {
  has: or,
  set: ft,
  setItem: ft,
  get: ot,
  getItem: ot,
  remove: lt,
  removeItem: lt,
  keys: vt,
  getJSON: fr
});
function at(n) {
  try {
    const t = "__xe_t";
    return n.setItem(t, 1), n.removeItem(t), !0;
  } catch {
    return !1;
  }
}
function $n(n) {
  return navigator.userAgent.includes(n);
}
function qu() {
  let n, t, e, r = !1, u = !1, s = !1;
  const c = {
    isNode: !1,
    isMobile: r,
    isPC: !1,
    isDoc: !!b
  };
  if (!Mn && typeof process !== H)
    c.isNode = !0;
  else {
    e = $n("Edge"), t = $n("Chrome"), r = /(Android|webOS|iPhone|iPad|iPod|SymbianOS|BlackBerry|Windows Phone)/.test(navigator.userAgent), c.isDoc && (n = b.body || b.documentElement, $(["webkit", "khtml", "moz", "ms", "o"], (i) => {
      c[`-${i}`] = !!n[`${i}MatchesSelector`];
    }));
    try {
      u = at(Mn.localStorage);
    } catch {
    }
    try {
      s = at(Mn.sessionStorage);
    } catch {
    }
    I(c, {
      edge: e,
      firefox: $n("Firefox"),
      msie: !e && c["-ms"],
      safari: !t && !e && $n("Safari"),
      isMobile: r,
      isPC: !r,
      isLocalStorage: u,
      isSessionStorage: s
    });
  }
  return c;
}
export {
  gu as add,
  Hu as after,
  $ as arrayEach,
  $e as arrayIndexOf,
  Me as arrayLastIndexOf,
  I as assign,
  zu as before,
  _u as bind,
  qu as browse,
  Iu as camelCase,
  Je as ceil,
  $r as chunk,
  De as clear,
  gt as clone,
  hu as commafy,
  en as cookie,
  dr as copyWithin,
  ou as countBy,
  Ku as debounce,
  Uu as delay,
  lu as destructuring,
  Du as divide,
  S as each,
  de as eachTree,
  Au as endsWith,
  tu as entries,
  Y as eqNull,
  Fu as escape,
  ne as every,
  mr as filter,
  Rr as filterTree,
  yr as find,
  zt as findIndexOf,
  Dr as findKey,
  Sr as findLast,
  br as findLastIndexOf,
  xr as findTree,
  uu as first,
  wr as flatten,
  Le as floor,
  Pr as forOf,
  Rn as get,
  Gu as getBaseURL,
  wu as getDateDiff,
  Ou as getDayOfMonth,
  Mu as getDayOfYear,
  $u as getMonthWeek,
  Re as getSize,
  Vr as getType,
  Bt as getWhatDay,
  ln as getWhatMonth,
  Su as getWhatQuarter,
  Ve as getWhatWeek,
  qn as getWhatYear,
  je as getYearDay,
  ve as getYearWeek,
  qe as groupBy,
  cu as has,
  T as hasOwnProp,
  te as includeArrays,
  gn as includes,
  _r as indexOf,
  Tr as invoke,
  Zr as isArguments,
  g as isArray,
  Ae as isBoolean,
  V as isDate,
  du as isDateSame,
  Ur as isDocument,
  Kr as isElement,
  We as isEmpty,
  nt as isEqual,
  Xr as isEqualWith,
  Pe as isError,
  kr as isFinite,
  Hr as isFloat,
  Gr as isFormData,
  k as isFunction,
  Ce as isInteger,
  xe as isLeapYear,
  Br as isMap,
  Qr as isMatch,
  Ar as isNaN,
  q as isNull,
  W as isNumber,
  Tn as isObject,
  nn as isPlainObject,
  kt as isRegExp,
  Jr as isSet,
  G as isString,
  ke as isSymbol,
  zr as isTypeError,
  K as isUndefined,
  C as isValidDate,
  qr as isWeakMap,
  Lr as isWeakSet,
  Yr as isWindow,
  Ru as kebabCase,
  P as keys,
  su as last,
  mt as lastArrayEach,
  me as lastEach,
  Wr as lastForOf,
  Ie as lastIndexOf,
  bt as lastObjectEach,
  Bu as locat,
  cn as map,
  Ir as mapTree,
  he as max,
  yu as mean,
  ar as merge,
  au as min,
  Kn as multiply,
  Wu as noop,
  tr as now,
  xn as objectEach,
  lr as objectMap,
  ru as omit,
  ku as once,
  Nt as orderBy,
  Tu as padEnd,
  z as padStart,
  ir as parseUrl,
  eu as pick,
  ae as pluck,
  yn as property,
  fe as random,
  fu as range,
  Nr as reduce,
  Se as remove,
  Eu as repeat,
  Ut as round,
  gr as sample,
  Cr as searchTree,
  Yu as serialize,
  iu as set,
  le as shuffle,
  Q as slice,
  jt as some,
  pr as sortBy,
  Cu as startsWith,
  mu as subtract,
  Qe as sum,
  sr as template,
  Zu as throttle,
  Nu as timestamp,
  yt as toArray,
  Er as toArrayTree,
  ut as toDateString,
  Yt as toFixed,
  Pu as toFormatString,
  pu as toInteger,
  nu as toJSONString,
  R as toNumber,
  _ as toNumberString,
  F as toString,
  E as toStringDate,
  jr as toStringJSON,
  Fr as toTreeArray,
  F as toValueString,
  ur as trim,
  rr as trimLeft,
  er as trimRight,
  xu as unescape,
  hr as union,
  ee as uniq,
  vr as uniqueId,
  cr as unserialize,
  pe as unzip,
  Sn as values,
  Mr as zip,
  Or as zipObject
};