iconfont-preview-cli 1.0.0 → 1.0.1

package/components/index.mjs

@@ -1,55 +1,54 @@
-import { defineComponent as J, createVNode as k, computed as pe, ref as N, onMounted as Ae, createElementBlock as Ce, openBlock as me, renderSlot as Ee, unref as ye } from "vue";
-import { ElMessage as Me } from "element-plus";
-function I(t) {
-  return Array.isArray ? Array.isArray(t) : oe(t) === "[object Array]";
+import { defineComponent as X, createVNode as L, computed as vt, ref as O, onMounted as Mt, createElementBlock as bt, openBlock as Ft, renderSlot as xt, unref as Bt } from "vue";
+function F(s) {
+  return Array.isArray ? Array.isArray(s) : pt(s) === "[object Array]";
 }
-function Fe(t) {
-  if (typeof t == "string")
-    return t;
-  let e = t + "";
-  return e == "0" && 1 / t == -1 / 0 ? "-0" : e;
+function Dt(s) {
+  if (typeof s == "string")
+    return s;
+  let t = s + "";
+  return t == "0" && 1 / s == -1 / 0 ? "-0" : t;
 }
-function Be(t) {
-  return t == null ? "" : Fe(t);
+function It(s) {
+  return s == null ? "" : Dt(s);
 }
-function D(t) {
-  return typeof t == "string";
+function b(s) {
+  return typeof s == "string";
 }
-function ce(t) {
-  return typeof t == "number";
+function ft(s) {
+  return typeof s == "number";
 }
-function De(t) {
-  return t === !0 || t === !1 || Ie(t) && oe(t) == "[object Boolean]";
+function kt(s) {
+  return s === !0 || s === !1 || _t(s) && pt(s) == "[object Boolean]";
 }
-function ue(t) {
-  return typeof t == "object";
+function dt(s) {
+  return typeof s == "object";
 }
-function Ie(t) {
-  return ue(t) && t !== null;
+function _t(s) {
+  return dt(s) && s !== null;
 }
-function E(t) {
-  return t != null;
+function y(s) {
+  return s != null;
 }
-function W(t) {
-  return !t.trim().length;
+function H(s) {
+  return !s.trim().length;
 }
-function oe(t) {
-  return t == null ? t === void 0 ? "[object Undefined]" : "[object Null]" : Object.prototype.toString.call(t);
+function pt(s) {
+  return s == null ? s === void 0 ? "[object Undefined]" : "[object Null]" : Object.prototype.toString.call(s);
 }
-const _e = "Incorrect 'index' type", xe = (t) => `Invalid value for key ${t}`, we = (t) => `Pattern length exceeds max of ${t}.`, Se = (t) => `Missing ${t} property in key`, be = (t) => `Property 'weight' in key '${t}' must be a positive integer`, ee = Object.prototype.hasOwnProperty;
-class ve {
-  constructor(e) {
+const St = "Incorrect 'index' type", Lt = (s) => `Invalid value for key ${s}`, Nt = (s) => `Pattern length exceeds max of ${s}.`, Ot = (s) => `Missing ${s} property in key`, Rt = (s) => `Property 'weight' in key '${s}' must be a positive integer`, et = Object.prototype.hasOwnProperty;
+class Tt {
+  constructor(t) {
     this._keys = [], this._keyMap = {};
-    let s = 0;
-    e.forEach((n) => {
-      let r = ae(n);
-      this._keys.push(r), this._keyMap[r.id] = r, s += r.weight;
-    }), this._keys.forEach((n) => {
-      n.weight /= s;
+    let e = 0;
+    t.forEach((i) => {
+      let o = gt(i);
+      this._keys.push(o), this._keyMap[o.id] = o, e += o.weight;
+    }), this._keys.forEach((i) => {
+      i.weight /= e;
     });
   }
-  get(e) {
-    return this._keyMap[e];
+  get(t) {
+    return this._keyMap[t];
   }
   keys() {
     return this._keys;
@@ -58,49 +57,49 @@ class ve {
     return JSON.stringify(this._keys);
   }
 }
-function ae(t) {
-  let e = null, s = null, n = null, r = 1, i = null;
-  if (D(t) || I(t))
-    n = t, e = te(t), s = H(t);
+function gt(s) {
+  let t = null, e = null, i = null, o = 1, r = null;
+  if (b(s) || F(s))
+    i = s, t = st(s), e = V(s);
   else {
-    if (!ee.call(t, "name"))
-      throw new Error(Se("name"));
-    const c = t.name;
-    if (n = c, ee.call(t, "weight") && (r = t.weight, r <= 0))
-      throw new Error(be(c));
-    e = te(c), s = H(c), i = t.getFn;
-  }
-  return { path: e, id: s, weight: r, src: n, getFn: i };
+    if (!et.call(s, "name"))
+      throw new Error(Ot("name"));
+    const n = s.name;
+    if (i = n, et.call(s, "weight") && (o = s.weight, o <= 0))
+      throw new Error(Rt(n));
+    t = st(n), e = V(n), r = s.getFn;
+  }
+  return { path: t, id: e, weight: o, src: i, getFn: r };
 }
-function te(t) {
-  return I(t) ? t : t.split(".");
+function st(s) {
+  return F(s) ? s : s.split(".");
 }
-function H(t) {
-  return I(t) ? t.join(".") : t;
+function V(s) {
+  return F(s) ? s.join(".") : s;
 }
-function Re(t, e) {
-  let s = [], n = !1;
-  const r = (i, c, u) => {
-    if (E(i))
-      if (!c[u])
-        s.push(i);
+function $t(s, t) {
+  let e = [], i = !1;
+  const o = (r, n, c) => {
+    if (y(r))
+      if (!n[c])
+        e.push(r);
       else {
-        let o = c[u];
-        const h = i[o];
-        if (!E(h))
+        let a = n[c];
+        const l = r[a];
+        if (!y(l))
           return;
-        if (u === c.length - 1 && (D(h) || ce(h) || De(h)))
-          s.push(Be(h));
-        else if (I(h)) {
-          n = !0;
-          for (let a = 0, l = h.length; a < l; a += 1)
-            r(h[a], c, u + 1);
-        } else c.length && r(h, c, u + 1);
+        if (c === n.length - 1 && (b(l) || ft(l) || kt(l)))
+          e.push(It(l));
+        else if (F(l)) {
+          i = !0;
+          for (let u = 0, h = l.length; u < h; u += 1)
+            o(l[u], n, c + 1);
+        } else n.length && o(l, n, c + 1);
       }
   };
-  return r(t, D(e) ? e.split(".") : e, 0), n ? s : s[0];
+  return o(s, b(t) ? t.split(".") : t, 0), i ? e : e[0];
 }
-const ke = {
+const Pt = {
   // Whether the matches should be included in the result set. When `true`, each record in the result
   // set will include the indices of the matched characters.
   // These can consequently be used for highlighting purposes.
@@ -110,7 +109,7 @@ const ke = {
   findAllMatches: !1,
   // Minimum number of characters that must be matched before a result is considered a match
   minMatchCharLength: 1
-}, Le = {
+}, jt = {
   // When `true`, the algorithm continues searching to the end of the input even if a perfect
   // match is found before the end of the same input.
   isCaseSensitive: !1,
@@ -123,8 +122,8 @@ const ke = {
   // Whether to sort the result list, by score
   shouldSort: !0,
   // Default sort function: sort by ascending score, ascending index
-  sortFn: (t, e) => t.score === e.score ? t.idx < e.idx ? -1 : 1 : t.score < e.score ? -1 : 1
-}, Ne = {
+  sortFn: (s, t) => s.score === t.score ? s.idx < t.idx ? -1 : 1 : s.score < t.score ? -1 : 1
+}, Wt = {
   // Approximately where in the text is the pattern expected to be found?
   location: 0,
   // At what point does the match algorithm give up. A threshold of '0.0' requires a perfect match
@@ -136,12 +135,12 @@ const ke = {
   // the exact location specified, a threshold of '1000' would require a perfect match
   // to be within 800 characters of the fuzzy location to be found using a 0.8 threshold.
   distance: 100
-}, $e = {
+}, zt = {
   // When `true`, it enables the use of unix-like search commands
   useExtendedSearch: !1,
   // The get function to use when fetching an object's properties.
   // The default will search nested paths *ie foo.bar.baz*
-  getFn: Re,
+  getFn: $t,
   // When `true`, search will ignore `location` and `distance`, so it won't matter
   // where in the string the pattern appears.
   // More info: https://fusejs.io/concepts/scoring-theory.html#fuzziness-score
@@ -154,114 +153,114 @@ const ke = {
   fieldNormWeight: 1
 };
 var f = {
-  ...Le,
-  ...ke,
-  ...Ne,
-  ...$e
+  ...jt,
+  ...Pt,
+  ...Wt,
+  ...zt
 };
-const Oe = /[^ ]+/g;
-function Pe(t = 1, e = 3) {
-  const s = /* @__PURE__ */ new Map(), n = Math.pow(10, e);
+const Ht = /[^ ]+/g;
+function Kt(s = 1, t = 3) {
+  const e = /* @__PURE__ */ new Map(), i = Math.pow(10, t);
   return {
-    get(r) {
-      const i = r.match(Oe).length;
-      if (s.has(i))
-        return s.get(i);
-      const c = 1 / Math.pow(i, 0.5 * t), u = parseFloat(Math.round(c * n) / n);
-      return s.set(i, u), u;
+    get(o) {
+      const r = o.match(Ht).length;
+      if (e.has(r))
+        return e.get(r);
+      const n = 1 / Math.pow(r, 0.5 * s), c = parseFloat(Math.round(n * i) / i);
+      return e.set(r, c), c;
     },
     clear() {
-      s.clear();
+      e.clear();
     }
   };
 }
-class X {
+class q {
   constructor({
-    getFn: e = f.getFn,
-    fieldNormWeight: s = f.fieldNormWeight
+    getFn: t = f.getFn,
+    fieldNormWeight: e = f.fieldNormWeight
   } = {}) {
-    this.norm = Pe(s, 3), this.getFn = e, this.isCreated = !1, this.setIndexRecords();
+    this.norm = Kt(e, 3), this.getFn = t, this.isCreated = !1, this.setIndexRecords();
   }
-  setSources(e = []) {
-    this.docs = e;
+  setSources(t = []) {
+    this.docs = t;
   }
-  setIndexRecords(e = []) {
-    this.records = e;
+  setIndexRecords(t = []) {
+    this.records = t;
   }
-  setKeys(e = []) {
-    this.keys = e, this._keysMap = {}, e.forEach((s, n) => {
-      this._keysMap[s.id] = n;
+  setKeys(t = []) {
+    this.keys = t, this._keysMap = {}, t.forEach((e, i) => {
+      this._keysMap[e.id] = i;
     });
   }
   create() {
-    this.isCreated || !this.docs.length || (this.isCreated = !0, D(this.docs[0]) ? this.docs.forEach((e, s) => {
-      this._addString(e, s);
-    }) : this.docs.forEach((e, s) => {
-      this._addObject(e, s);
+    this.isCreated || !this.docs.length || (this.isCreated = !0, b(this.docs[0]) ? this.docs.forEach((t, e) => {
+      this._addString(t, e);
+    }) : this.docs.forEach((t, e) => {
+      this._addObject(t, e);
     }), this.norm.clear());
   }
   // Adds a doc to the end of the index
-  add(e) {
-    const s = this.size();
-    D(e) ? this._addString(e, s) : this._addObject(e, s);
+  add(t) {
+    const e = this.size();
+    b(t) ? this._addString(t, e) : this._addObject(t, e);
   }
   // Removes the doc at the specified index of the index
-  removeAt(e) {
-    this.records.splice(e, 1);
-    for (let s = e, n = this.size(); s < n; s += 1)
-      this.records[s].i -= 1;
+  removeAt(t) {
+    this.records.splice(t, 1);
+    for (let e = t, i = this.size(); e < i; e += 1)
+      this.records[e].i -= 1;
   }
-  getValueForItemAtKeyId(e, s) {
-    return e[this._keysMap[s]];
+  getValueForItemAtKeyId(t, e) {
+    return t[this._keysMap[e]];
   }
   size() {
     return this.records.length;
   }
-  _addString(e, s) {
-    if (!E(e) || W(e))
+  _addString(t, e) {
+    if (!y(t) || H(t))
       return;
-    let n = {
-      v: e,
-      i: s,
-      n: this.norm.get(e)
+    let i = {
+      v: t,
+      i: e,
+      n: this.norm.get(t)
     };
-    this.records.push(n);
-  }
-  _addObject(e, s) {
-    let n = { i: s, $: {} };
-    this.keys.forEach((r, i) => {
-      let c = r.getFn ? r.getFn(e) : this.getFn(e, r.path);
-      if (E(c)) {
-        if (I(c)) {
-          let u = [];
-          const o = [{ nestedArrIndex: -1, value: c }];
-          for (; o.length; ) {
-            const { nestedArrIndex: h, value: a } = o.pop();
-            if (E(a))
-              if (D(a) && !W(a)) {
-                let l = {
-                  v: a,
-                  i: h,
-                  n: this.norm.get(a)
+    this.records.push(i);
+  }
+  _addObject(t, e) {
+    let i = { i: e, $: {} };
+    this.keys.forEach((o, r) => {
+      let n = o.getFn ? o.getFn(t) : this.getFn(t, o.path);
+      if (y(n)) {
+        if (F(n)) {
+          let c = [];
+          const a = [{ nestedArrIndex: -1, value: n }];
+          for (; a.length; ) {
+            const { nestedArrIndex: l, value: u } = a.pop();
+            if (y(u))
+              if (b(u) && !H(u)) {
+                let h = {
+                  v: u,
+                  i: l,
+                  n: this.norm.get(u)
                 };
-                u.push(l);
-              } else I(a) && a.forEach((l, d) => {
-                o.push({
+                c.push(h);
+              } else F(u) && u.forEach((h, d) => {
+                a.push({
                   nestedArrIndex: d,
-                  value: l
+                  value: h
                 });
               });
           }
-          n.$[i] = u;
-        } else if (D(c) && !W(c)) {
-          let u = {
-            v: c,
-            n: this.norm.get(c)
+          i.$[r] = c;
+        } else if (b(n) && !H(n)) {
+          let c = {
+            v: n,
+            n: this.norm.get(n)
           };
-          n.$[i] = u;
+          i.$[r] = c;
         }
       }
-    }), this.records.push(n);
+    }), this.records.push(i);
   }
   toJSON() {
     return {
@@ -270,224 +269,224 @@ class X {
     };
   }
 }
-function he(t, e, { getFn: s = f.getFn, fieldNormWeight: n = f.fieldNormWeight } = {}) {
-  const r = new X({ getFn: s, fieldNormWeight: n });
-  return r.setKeys(t.map(ae)), r.setSources(e), r.create(), r;
+function mt(s, t, { getFn: e = f.getFn, fieldNormWeight: i = f.fieldNormWeight } = {}) {
+  const o = new q({ getFn: e, fieldNormWeight: i });
+  return o.setKeys(s.map(gt)), o.setSources(t), o.create(), o;
 }
-function Te(t, { getFn: e = f.getFn, fieldNormWeight: s = f.fieldNormWeight } = {}) {
-  const { keys: n, records: r } = t, i = new X({ getFn: e, fieldNormWeight: s });
-  return i.setKeys(n), i.setIndexRecords(r), i;
+function Vt(s, { getFn: t = f.getFn, fieldNormWeight: e = f.fieldNormWeight } = {}) {
+  const { keys: i, records: o } = s, r = new q({ getFn: t, fieldNormWeight: e });
+  return r.setKeys(i), r.setIndexRecords(o), r;
 }
-function $(t, {
-  errors: e = 0,
-  currentLocation: s = 0,
-  expectedLocation: n = 0,
-  distance: r = f.distance,
-  ignoreLocation: i = f.ignoreLocation
+function R(s, {
+  errors: t = 0,
+  currentLocation: e = 0,
+  expectedLocation: i = 0,
+  distance: o = f.distance,
+  ignoreLocation: r = f.ignoreLocation
 } = {}) {
-  const c = e / t.length;
-  if (i)
-    return c;
-  const u = Math.abs(n - s);
-  return r ? c + u / r : u ? 1 : c;
+  const n = t / s.length;
+  if (r)
+    return n;
+  const c = Math.abs(i - e);
+  return o ? n + c / o : c ? 1 : n;
 }
-function je(t = [], e = f.minMatchCharLength) {
-  let s = [], n = -1, r = -1, i = 0;
-  for (let c = t.length; i < c; i += 1) {
-    let u = t[i];
-    u && n === -1 ? n = i : !u && n !== -1 && (r = i - 1, r - n + 1 >= e && s.push([n, r]), n = -1);
+function Gt(s = [], t = f.minMatchCharLength) {
+  let e = [], i = -1, o = -1, r = 0;
+  for (let n = s.length; r < n; r += 1) {
+    let c = s[r];
+    c && i === -1 ? i = r : !c && i !== -1 && (o = r - 1, o - i + 1 >= t && e.push([i, o]), i = -1);
   }
-  return t[i - 1] && i - n >= e && s.push([n, i - 1]), s;
+  return s[r - 1] && r - i >= t && e.push([i, r - 1]), e;
 }
-const b = 32;
-function Ke(t, e, s, {
-  location: n = f.location,
-  distance: r = f.distance,
-  threshold: i = f.threshold,
-  findAllMatches: c = f.findAllMatches,
-  minMatchCharLength: u = f.minMatchCharLength,
-  includeMatches: o = f.includeMatches,
-  ignoreLocation: h = f.ignoreLocation
+const k = 32;
+function Yt(s, t, e, {
+  location: i = f.location,
+  distance: o = f.distance,
+  threshold: r = f.threshold,
+  findAllMatches: n = f.findAllMatches,
+  minMatchCharLength: c = f.minMatchCharLength,
+  includeMatches: a = f.includeMatches,
+  ignoreLocation: l = f.ignoreLocation
 } = {}) {
-  if (e.length > b)
-    throw new Error(we(b));
-  const a = e.length, l = t.length, d = Math.max(0, Math.min(n, l));
-  let g = i, p = d;
-  const A = u > 1 || o, C = A ? Array(l) : [];
-  let M;
-  for (; (M = t.indexOf(e, p)) > -1; ) {
-    let y = $(e, {
-      currentLocation: M,
+  if (t.length > k)
+    throw new Error(Nt(k));
+  const u = t.length, h = s.length, d = Math.max(0, Math.min(i, h));
+  let p = r, g = d;
+  const m = c > 1 || a, A = m ? Array(h) : [];
+  let w;
+  for (; (w = s.indexOf(t, g)) > -1; ) {
+    let E = R(t, {
+      currentLocation: w,
       expectedLocation: d,
-      distance: r,
-      ignoreLocation: h
+      distance: o,
+      ignoreLocation: l
     });
-    if (g = Math.min(y, g), p = M + a, A) {
-      let x = 0;
-      for (; x < a; )
-        C[M + x] = 1, x += 1;
+    if (p = Math.min(E, p), g = w + u, m) {
+      let B = 0;
+      for (; B < u; )
+        A[w + B] = 1, B += 1;
     }
   }
-  p = -1;
-  let m = [], _ = 1, B = a + l;
-  const T = 1 << a - 1;
-  for (let y = 0; y < a; y += 1) {
-    let x = 0, w = B;
-    for (; x < w; )
-      $(e, {
-        errors: y,
-        currentLocation: d + w,
+  g = -1;
+  let C = [], x = 1, M = u + h;
+  const j = 1 << u - 1;
+  for (let E = 0; E < u; E += 1) {
+    let B = 0, D = M;
+    for (; B < D; )
+      R(t, {
+        errors: E,
+        currentLocation: d + D,
         expectedLocation: d,
-        distance: r,
-        ignoreLocation: h
-      }) <= g ? x = w : B = w, w = Math.floor((B - x) / 2 + x);
-    B = w;
-    let Z = Math.max(1, d - w + 1), K = c ? l : Math.min(d + w, l) + a, v = Array(K + 2);
-    v[K + 1] = (1 << y) - 1;
-    for (let F = K; F >= Z; F -= 1) {
-      let L = F - 1, q = s[t.charAt(L)];
-      if (A && (C[L] = +!!q), v[F] = (v[F + 1] << 1 | 1) & q, y && (v[F] |= (m[F + 1] | m[F]) << 1 | 1 | m[F + 1]), v[F] & T && (_ = $(e, {
-        errors: y,
-        currentLocation: L,
+        distance: o,
+        ignoreLocation: l
+      }) <= p ? B = D : M = D, D = Math.floor((M - B) / 2 + B);
+    M = D;
+    let Z = Math.max(1, d - D + 1), z = n ? h : Math.min(d + D, h) + u, _ = Array(z + 2);
+    _[z + 1] = (1 << E) - 1;
+    for (let v = z; v >= Z; v -= 1) {
+      let N = v - 1, tt = e[s.charAt(N)];
+      if (m && (A[N] = +!!tt), _[v] = (_[v + 1] << 1 | 1) & tt, E && (_[v] |= (C[v + 1] | C[v]) << 1 | 1 | C[v + 1]), _[v] & j && (x = R(t, {
+        errors: E,
+        currentLocation: N,
         expectedLocation: d,
-        distance: r,
-        ignoreLocation: h
-      }), _ <= g)) {
-        if (g = _, p = L, p <= d)
+        distance: o,
+        ignoreLocation: l
+      }), x <= p)) {
+        if (p = x, g = N, g <= d)
           break;
-        Z = Math.max(1, 2 * d - p);
+        Z = Math.max(1, 2 * d - g);
       }
     }
-    if ($(e, {
-      errors: y + 1,
+    if (R(t, {
+      errors: E + 1,
       currentLocation: d,
       expectedLocation: d,
-      distance: r,
-      ignoreLocation: h
-    }) > g)
+      distance: o,
+      ignoreLocation: l
+    }) > p)
       break;
-    m = v;
+    C = _;
   }
-  const j = {
-    isMatch: p >= 0,
+  const W = {
+    isMatch: g >= 0,
     // Count exact matches (those with a score of 0) to be "almost" exact
-    score: Math.max(1e-3, _)
+    score: Math.max(1e-3, x)
   };
-  if (A) {
-    const y = je(C, u);
-    y.length ? o && (j.indices = y) : j.isMatch = !1;
+  if (m) {
+    const E = Gt(A, c);
+    E.length ? a && (W.indices = E) : W.isMatch = !1;
   }
-  return j;
+  return W;
 }
-function We(t) {
-  let e = {};
-  for (let s = 0, n = t.length; s < n; s += 1) {
-    const r = t.charAt(s);
-    e[r] = (e[r] || 0) | 1 << n - s - 1;
+function Ut(s) {
+  let t = {};
+  for (let e = 0, i = s.length; e < i; e += 1) {
+    const o = s.charAt(e);
+    t[o] = (t[o] || 0) | 1 << i - e - 1;
   }
-  return e;
+  return t;
 }
-const O = String.prototype.normalize ? ((t) => t.normalize("NFD").replace(/[\u0300-\u036F\u0483-\u0489\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u0610-\u061A\u064B-\u065F\u0670\u06D6-\u06DC\u06DF-\u06E4\u06E7\u06E8\u06EA-\u06ED\u0711\u0730-\u074A\u07A6-\u07B0\u07EB-\u07F3\u07FD\u0816-\u0819\u081B-\u0823\u0825-\u0827\u0829-\u082D\u0859-\u085B\u08D3-\u08E1\u08E3-\u0903\u093A-\u093C\u093E-\u094F\u0951-\u0957\u0962\u0963\u0981-\u0983\u09BC\u09BE-\u09C4\u09C7\u09C8\u09CB-\u09CD\u09D7\u09E2\u09E3\u09FE\u0A01-\u0A03\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A70\u0A71\u0A75\u0A81-\u0A83\u0ABC\u0ABE-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AE2\u0AE3\u0AFA-\u0AFF\u0B01-\u0B03\u0B3C\u0B3E-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B62\u0B63\u0B82\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD7\u0C00-\u0C04\u0C3E-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C62\u0C63\u0C81-\u0C83\u0CBC\u0CBE-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CE2\u0CE3\u0D00-\u0D03\u0D3B\u0D3C\u0D3E-\u0D44\u0D46-\u0D48\u0D4A-\u0D4D\u0D57\u0D62\u0D63\u0D82\u0D83\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DF2\u0DF3\u0E31\u0E34-\u0E3A\u0E47-\u0E4E\u0EB1\u0EB4-\u0EB9\u0EBB\u0EBC\u0EC8-\u0ECD\u0F18\u0F19\u0F35\u0F37\u0F39\u0F3E\u0F3F\u0F71-\u0F84\u0F86\u0F87\u0F8D-\u0F97\u0F99-\u0FBC\u0FC6\u102B-\u103E\u1056-\u1059\u105E-\u1060\u1062-\u1064\u1067-\u106D\u1071-\u1074\u1082-\u108D\u108F\u109A-\u109D\u135D-\u135F\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17B4-\u17D3\u17DD\u180B-\u180D\u1885\u1886\u18A9\u1920-\u192B\u1930-\u193B\u1A17-\u1A1B\u1A55-\u1A5E\u1A60-\u1A7C\u1A7F\u1AB0-\u1ABE\u1B00-\u1B04\u1B34-\u1B44\u1B6B-\u1B73\u1B80-\u1B82\u1BA1-\u1BAD\u1BE6-\u1BF3\u1C24-\u1C37\u1CD0-\u1CD2\u1CD4-\u1CE8\u1CED\u1CF2-\u1CF4\u1CF7-\u1CF9\u1DC0-\u1DF9\u1DFB-\u1DFF\u20D0-\u20F0\u2CEF-\u2CF1\u2D7F\u2DE0-\u2DFF\u302A-\u302F\u3099\u309A\uA66F-\uA672\uA674-\uA67D\uA69E\uA69F\uA6F0\uA6F1\uA802\uA806\uA80B\uA823-\uA827\uA880\uA881\uA8B4-\uA8C5\uA8E0-\uA8F1\uA8FF\uA926-\uA92D\uA947-\uA953\uA980-\uA983\uA9B3-\uA9C0\uA9E5\uAA29-\uAA36\uAA43\uAA4C\uAA4D\uAA7B-\uAA7D\uAAB0\uAAB2-\uAAB4\uAAB7\uAAB8\uAABE\uAABF\uAAC1\uAAEB-\uAAEF\uAAF5\uAAF6\uABE3-\uABEA\uABEC\uABED\uFB1E\uFE00-\uFE0F\uFE20-\uFE2F]/g, "")) : ((t) => t);
-class le {
-  constructor(e, {
-    location: s = f.location,
-    threshold: n = f.threshold,
-    distance: r = f.distance,
-    includeMatches: i = f.includeMatches,
-    findAllMatches: c = f.findAllMatches,
-    minMatchCharLength: u = f.minMatchCharLength,
-    isCaseSensitive: o = f.isCaseSensitive,
-    ignoreDiacritics: h = f.ignoreDiacritics,
-    ignoreLocation: a = f.ignoreLocation
+const $ = String.prototype.normalize ? ((s) => s.normalize("NFD").replace(/[\u0300-\u036F\u0483-\u0489\u0591-\u05BD\u05BF\u05C1\u05C2\u05C4\u05C5\u05C7\u0610-\u061A\u064B-\u065F\u0670\u06D6-\u06DC\u06DF-\u06E4\u06E7\u06E8\u06EA-\u06ED\u0711\u0730-\u074A\u07A6-\u07B0\u07EB-\u07F3\u07FD\u0816-\u0819\u081B-\u0823\u0825-\u0827\u0829-\u082D\u0859-\u085B\u08D3-\u08E1\u08E3-\u0903\u093A-\u093C\u093E-\u094F\u0951-\u0957\u0962\u0963\u0981-\u0983\u09BC\u09BE-\u09C4\u09C7\u09C8\u09CB-\u09CD\u09D7\u09E2\u09E3\u09FE\u0A01-\u0A03\u0A3C\u0A3E-\u0A42\u0A47\u0A48\u0A4B-\u0A4D\u0A51\u0A70\u0A71\u0A75\u0A81-\u0A83\u0ABC\u0ABE-\u0AC5\u0AC7-\u0AC9\u0ACB-\u0ACD\u0AE2\u0AE3\u0AFA-\u0AFF\u0B01-\u0B03\u0B3C\u0B3E-\u0B44\u0B47\u0B48\u0B4B-\u0B4D\u0B56\u0B57\u0B62\u0B63\u0B82\u0BBE-\u0BC2\u0BC6-\u0BC8\u0BCA-\u0BCD\u0BD7\u0C00-\u0C04\u0C3E-\u0C44\u0C46-\u0C48\u0C4A-\u0C4D\u0C55\u0C56\u0C62\u0C63\u0C81-\u0C83\u0CBC\u0CBE-\u0CC4\u0CC6-\u0CC8\u0CCA-\u0CCD\u0CD5\u0CD6\u0CE2\u0CE3\u0D00-\u0D03\u0D3B\u0D3C\u0D3E-\u0D44\u0D46-\u0D48\u0D4A-\u0D4D\u0D57\u0D62\u0D63\u0D82\u0D83\u0DCA\u0DCF-\u0DD4\u0DD6\u0DD8-\u0DDF\u0DF2\u0DF3\u0E31\u0E34-\u0E3A\u0E47-\u0E4E\u0EB1\u0EB4-\u0EB9\u0EBB\u0EBC\u0EC8-\u0ECD\u0F18\u0F19\u0F35\u0F37\u0F39\u0F3E\u0F3F\u0F71-\u0F84\u0F86\u0F87\u0F8D-\u0F97\u0F99-\u0FBC\u0FC6\u102B-\u103E\u1056-\u1059\u105E-\u1060\u1062-\u1064\u1067-\u106D\u1071-\u1074\u1082-\u108D\u108F\u109A-\u109D\u135D-\u135F\u1712-\u1714\u1732-\u1734\u1752\u1753\u1772\u1773\u17B4-\u17D3\u17DD\u180B-\u180D\u1885\u1886\u18A9\u1920-\u192B\u1930-\u193B\u1A17-\u1A1B\u1A55-\u1A5E\u1A60-\u1A7C\u1A7F\u1AB0-\u1ABE\u1B00-\u1B04\u1B34-\u1B44\u1B6B-\u1B73\u1B80-\u1B82\u1BA1-\u1BAD\u1BE6-\u1BF3\u1C24-\u1C37\u1CD0-\u1CD2\u1CD4-\u1CE8\u1CED\u1CF2-\u1CF4\u1CF7-\u1CF9\u1DC0-\u1DF9\u1DFB-\u1DFF\u20D0-\u20F0\u2CEF-\u2CF1\u2D7F\u2DE0-\u2DFF\u302A-\u302F\u3099\u309A\uA66F-\uA672\uA674-\uA67D\uA69E\uA69F\uA6F0\uA6F1\uA802\uA806\uA80B\uA823-\uA827\uA880\uA881\uA8B4-\uA8C5\uA8E0-\uA8F1\uA8FF\uA926-\uA92D\uA947-\uA953\uA980-\uA983\uA9B3-\uA9C0\uA9E5\uAA29-\uAA36\uAA43\uAA4C\uAA4D\uAA7B-\uAA7D\uAAB0\uAAB2-\uAAB4\uAAB7\uAAB8\uAABE\uAABF\uAAC1\uAAEB-\uAAEF\uAAF5\uAAF6\uABE3-\uABEA\uABEC\uABED\uFB1E\uFE00-\uFE0F\uFE20-\uFE2F]/g, "")) : ((s) => s);
+class At {
+  constructor(t, {
+    location: e = f.location,
+    threshold: i = f.threshold,
+    distance: o = f.distance,
+    includeMatches: r = f.includeMatches,
+    findAllMatches: n = f.findAllMatches,
+    minMatchCharLength: c = f.minMatchCharLength,
+    isCaseSensitive: a = f.isCaseSensitive,
+    ignoreDiacritics: l = f.ignoreDiacritics,
+    ignoreLocation: u = f.ignoreLocation
   } = {}) {
     if (this.options = {
-      location: s,
-      threshold: n,
-      distance: r,
-      includeMatches: i,
-      findAllMatches: c,
-      minMatchCharLength: u,
-      isCaseSensitive: o,
-      ignoreDiacritics: h,
-      ignoreLocation: a
-    }, e = o ? e : e.toLowerCase(), e = h ? O(e) : e, this.pattern = e, this.chunks = [], !this.pattern.length)
+      location: e,
+      threshold: i,
+      distance: o,
+      includeMatches: r,
+      findAllMatches: n,
+      minMatchCharLength: c,
+      isCaseSensitive: a,
+      ignoreDiacritics: l,
+      ignoreLocation: u
+    }, t = a ? t : t.toLowerCase(), t = l ? $(t) : t, this.pattern = t, this.chunks = [], !this.pattern.length)
       return;
-    const l = (g, p) => {
+    const h = (p, g) => {
       this.chunks.push({
-        pattern: g,
-        alphabet: We(g),
-        startIndex: p
+        pattern: p,
+        alphabet: Ut(p),
+        startIndex: g
       });
     }, d = this.pattern.length;
-    if (d > b) {
-      let g = 0;
-      const p = d % b, A = d - p;
-      for (; g < A; )
-        l(this.pattern.substr(g, b), g), g += b;
-      if (p) {
-        const C = d - b;
-        l(this.pattern.substr(C), C);
+    if (d > k) {
+      let p = 0;
+      const g = d % k, m = d - g;
+      for (; p < m; )
+        h(this.pattern.substr(p, k), p), p += k;
+      if (g) {
+        const A = d - k;
+        h(this.pattern.substr(A), A);
       }
     } else
-      l(this.pattern, 0);
+      h(this.pattern, 0);
   }
-  searchIn(e) {
-    const { isCaseSensitive: s, ignoreDiacritics: n, includeMatches: r } = this.options;
-    if (e = s ? e : e.toLowerCase(), e = n ? O(e) : e, this.pattern === e) {
-      let A = {
+  searchIn(t) {
+    const { isCaseSensitive: e, ignoreDiacritics: i, includeMatches: o } = this.options;
+    if (t = e ? t : t.toLowerCase(), t = i ? $(t) : t, this.pattern === t) {
+      let m = {
         isMatch: !0,
         score: 0
       };
-      return r && (A.indices = [[0, e.length - 1]]), A;
+      return o && (m.indices = [[0, t.length - 1]]), m;
     }
     const {
-      location: i,
-      distance: c,
-      threshold: u,
-      findAllMatches: o,
-      minMatchCharLength: h,
-      ignoreLocation: a
+      location: r,
+      distance: n,
+      threshold: c,
+      findAllMatches: a,
+      minMatchCharLength: l,
+      ignoreLocation: u
     } = this.options;
-    let l = [], d = 0, g = !1;
-    this.chunks.forEach(({ pattern: A, alphabet: C, startIndex: M }) => {
-      const { isMatch: m, score: _, indices: B } = Ke(e, A, C, {
-        location: i + M,
-        distance: c,
-        threshold: u,
-        findAllMatches: o,
-        minMatchCharLength: h,
-        includeMatches: r,
-        ignoreLocation: a
+    let h = [], d = 0, p = !1;
+    this.chunks.forEach(({ pattern: m, alphabet: A, startIndex: w }) => {
+      const { isMatch: C, score: x, indices: M } = Yt(t, m, A, {
+        location: r + w,
+        distance: n,
+        threshold: c,
+        findAllMatches: a,
+        minMatchCharLength: l,
+        includeMatches: o,
+        ignoreLocation: u
       });
-      m && (g = !0), d += _, m && B && (l = [...l, ...B]);
+      C && (p = !0), d += x, C && M && (h = [...h, ...M]);
     });
-    let p = {
-      isMatch: g,
-      score: g ? d / this.chunks.length : 1
+    let g = {
+      isMatch: p,
+      score: p ? d / this.chunks.length : 1
     };
-    return g && r && (p.indices = l), p;
+    return p && o && (g.indices = h), g;
   }
 }
-class S {
-  constructor(e) {
-    this.pattern = e;
+class I {
+  constructor(t) {
+    this.pattern = t;
   }
-  static isMultiMatch(e) {
-    return se(e, this.multiRegex);
+  static isMultiMatch(t) {
+    return nt(t, this.multiRegex);
   }
-  static isSingleMatch(e) {
-    return se(e, this.singleRegex);
+  static isSingleMatch(t) {
+    return nt(t, this.singleRegex);
   }
   search() {
   }
 }
-function se(t, e) {
-  const s = t.match(e);
-  return s ? s[1] : null;
+function nt(s, t) {
+  const e = s.match(t);
+  return e ? e[1] : null;
 }
-class ze extends S {
-  constructor(e) {
-    super(e);
+class Qt extends I {
+  constructor(t) {
+    super(t);
   }
   static get type() {
     return "exact";
@@ -498,18 +497,18 @@ class ze extends S {
   static get singleRegex() {
     return /^=(.*)$/;
   }
-  search(e) {
-    const s = e === this.pattern;
+  search(t) {
+    const e = t === this.pattern;
     return {
-      isMatch: s,
-      score: s ? 0 : 1,
+      isMatch: e,
+      score: e ? 0 : 1,
       indices: [0, this.pattern.length - 1]
     };
   }
 }
-class He extends S {
-  constructor(e) {
-    super(e);
+class Jt extends I {
+  constructor(t) {
+    super(t);
   }
   static get type() {
     return "inverse-exact";
@@ -520,18 +519,18 @@ class He extends S {
   static get singleRegex() {
     return /^!(.*)$/;
   }
-  search(e) {
-    const n = e.indexOf(this.pattern) === -1;
+  search(t) {
+    const i = t.indexOf(this.pattern) === -1;
     return {
-      isMatch: n,
-      score: n ? 0 : 1,
-      indices: [0, e.length - 1]
+      isMatch: i,
+      score: i ? 0 : 1,
+      indices: [0, t.length - 1]
     };
   }
 }
-class Ge extends S {
-  constructor(e) {
-    super(e);
+class Xt extends I {
+  constructor(t) {
+    super(t);
   }
   static get type() {
     return "prefix-exact";
@@ -542,18 +541,18 @@ class Ge extends S {
   static get singleRegex() {
     return /^\^(.*)$/;
   }
-  search(e) {
-    const s = e.startsWith(this.pattern);
+  search(t) {
+    const e = t.startsWith(this.pattern);
     return {
-      isMatch: s,
-      score: s ? 0 : 1,
+      isMatch: e,
+      score: e ? 0 : 1,
       indices: [0, this.pattern.length - 1]
     };
   }
 }
-class Ve extends S {
-  constructor(e) {
-    super(e);
+class qt extends I {
+  constructor(t) {
+    super(t);
   }
   static get type() {
     return "inverse-prefix-exact";
@@ -564,18 +563,18 @@ class Ve extends S {
   static get singleRegex() {
     return /^!\^(.*)$/;
   }
-  search(e) {
-    const s = !e.startsWith(this.pattern);
+  search(t) {
+    const e = !t.startsWith(this.pattern);
     return {
-      isMatch: s,
-      score: s ? 0 : 1,
-      indices: [0, e.length - 1]
+      isMatch: e,
+      score: e ? 0 : 1,
+      indices: [0, t.length - 1]
     };
   }
 }
-class Ye extends S {
-  constructor(e) {
-    super(e);
+class Zt extends I {
+  constructor(t) {
+    super(t);
   }
   static get type() {
     return "suffix-exact";
@@ -586,18 +585,18 @@ class Ye extends S {
   static get singleRegex() {
     return /^(.*)\$$/;
   }
-  search(e) {
-    const s = e.endsWith(this.pattern);
+  search(t) {
+    const e = t.endsWith(this.pattern);
     return {
-      isMatch: s,
-      score: s ? 0 : 1,
-      indices: [e.length - this.pattern.length, e.length - 1]
+      isMatch: e,
+      score: e ? 0 : 1,
+      indices: [t.length - this.pattern.length, t.length - 1]
     };
   }
 }
-class Qe extends S {
-  constructor(e) {
-    super(e);
+class te extends I {
+  constructor(t) {
+    super(t);
   }
   static get type() {
     return "inverse-suffix-exact";
@@ -608,37 +607,37 @@ class Qe extends S {
   static get singleRegex() {
     return /^!(.*)\$$/;
   }
-  search(e) {
-    const s = !e.endsWith(this.pattern);
+  search(t) {
+    const e = !t.endsWith(this.pattern);
     return {
-      isMatch: s,
-      score: s ? 0 : 1,
-      indices: [0, e.length - 1]
+      isMatch: e,
+      score: e ? 0 : 1,
+      indices: [0, t.length - 1]
     };
   }
 }
-class fe extends S {
-  constructor(e, {
-    location: s = f.location,
-    threshold: n = f.threshold,
-    distance: r = f.distance,
-    includeMatches: i = f.includeMatches,
-    findAllMatches: c = f.findAllMatches,
-    minMatchCharLength: u = f.minMatchCharLength,
-    isCaseSensitive: o = f.isCaseSensitive,
-    ignoreDiacritics: h = f.ignoreDiacritics,
-    ignoreLocation: a = f.ignoreLocation
+class Ct extends I {
+  constructor(t, {
+    location: e = f.location,
+    threshold: i = f.threshold,
+    distance: o = f.distance,
+    includeMatches: r = f.includeMatches,
+    findAllMatches: n = f.findAllMatches,
+    minMatchCharLength: c = f.minMatchCharLength,
+    isCaseSensitive: a = f.isCaseSensitive,
+    ignoreDiacritics: l = f.ignoreDiacritics,
+    ignoreLocation: u = f.ignoreLocation
   } = {}) {
-    super(e), this._bitapSearch = new le(e, {
-      location: s,
-      threshold: n,
-      distance: r,
-      includeMatches: i,
-      findAllMatches: c,
-      minMatchCharLength: u,
-      isCaseSensitive: o,
-      ignoreDiacritics: h,
-      ignoreLocation: a
+    super(t), this._bitapSearch = new At(t, {
+      location: e,
+      threshold: i,
+      distance: o,
+      includeMatches: r,
+      findAllMatches: n,
+      minMatchCharLength: c,
+      isCaseSensitive: a,
+      ignoreDiacritics: l,
+      ignoreLocation: u
     });
   }
   static get type() {
@@ -650,13 +649,13 @@ class fe extends S {
   static get singleRegex() {
     return /^(.*)$/;
   }
-  search(e) {
-    return this._bitapSearch.searchIn(e);
+  search(t) {
+    return this._bitapSearch.searchIn(t);
   }
 }
-class de extends S {
-  constructor(e) {
-    super(e);
+class yt extends I {
+  constructor(t) {
+    super(t);
   }
   static get type() {
     return "include";
@@ -667,112 +666,112 @@ class de extends S {
   static get singleRegex() {
     return /^'(.*)$/;
   }
-  search(e) {
-    let s = 0, n;
-    const r = [], i = this.pattern.length;
-    for (; (n = e.indexOf(this.pattern, s)) > -1; )
-      s = n + i, r.push([n, s - 1]);
-    const c = !!r.length;
+  search(t) {
+    let e = 0, i;
+    const o = [], r = this.pattern.length;
+    for (; (i = t.indexOf(this.pattern, e)) > -1; )
+      e = i + r, o.push([i, e - 1]);
+    const n = !!o.length;
     return {
-      isMatch: c,
-      score: c ? 0 : 1,
-      indices: r
+      isMatch: n,
+      score: n ? 0 : 1,
+      indices: o
     };
   }
 }
 const G = [
-  ze,
-  de,
-  Ge,
-  Ve,
-  Qe,
-  Ye,
-  He,
-  fe
-], ne = G.length, Ue = / +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/, Je = "|";
-function Xe(t, e = {}) {
-  return t.split(Je).map((s) => {
-    let n = s.trim().split(Ue).filter((i) => i && !!i.trim()), r = [];
-    for (let i = 0, c = n.length; i < c; i += 1) {
-      const u = n[i];
-      let o = !1, h = -1;
-      for (; !o && ++h < ne; ) {
-        const a = G[h];
-        let l = a.isMultiMatch(u);
-        l && (r.push(new a(l, e)), o = !0);
+  Qt,
+  yt,
+  Xt,
+  qt,
+  te,
+  Zt,
+  Jt,
+  Ct
+], it = G.length, ee = / +(?=(?:[^\"]*\"[^\"]*\")*[^\"]*$)/, se = "|";
+function ne(s, t = {}) {
+  return s.split(se).map((e) => {
+    let i = e.trim().split(ee).filter((r) => r && !!r.trim()), o = [];
+    for (let r = 0, n = i.length; r < n; r += 1) {
+      const c = i[r];
+      let a = !1, l = -1;
+      for (; !a && ++l < it; ) {
+        const u = G[l];
+        let h = u.isMultiMatch(c);
+        h && (o.push(new u(h, t)), a = !0);
       }
-      if (!o)
-        for (h = -1; ++h < ne; ) {
-          const a = G[h];
-          let l = a.isSingleMatch(u);
-          if (l) {
-            r.push(new a(l, e));
+      if (!a)
+        for (l = -1; ++l < it; ) {
+          const u = G[l];
+          let h = u.isSingleMatch(c);
+          if (h) {
+            o.push(new u(h, t));
             break;
           }
         }
     }
-    return r;
+    return o;
   });
 }
-const Ze = /* @__PURE__ */ new Set([fe.type, de.type]);
-class qe {
-  constructor(e, {
-    isCaseSensitive: s = f.isCaseSensitive,
-    ignoreDiacritics: n = f.ignoreDiacritics,
-    includeMatches: r = f.includeMatches,
-    minMatchCharLength: i = f.minMatchCharLength,
-    ignoreLocation: c = f.ignoreLocation,
-    findAllMatches: u = f.findAllMatches,
-    location: o = f.location,
-    threshold: h = f.threshold,
-    distance: a = f.distance
+const ie = /* @__PURE__ */ new Set([Ct.type, yt.type]);
+class oe {
+  constructor(t, {
+    isCaseSensitive: e = f.isCaseSensitive,
+    ignoreDiacritics: i = f.ignoreDiacritics,
+    includeMatches: o = f.includeMatches,
+    minMatchCharLength: r = f.minMatchCharLength,
+    ignoreLocation: n = f.ignoreLocation,
+    findAllMatches: c = f.findAllMatches,
+    location: a = f.location,
+    threshold: l = f.threshold,
+    distance: u = f.distance
   } = {}) {
     this.query = null, this.options = {
-      isCaseSensitive: s,
-      ignoreDiacritics: n,
-      includeMatches: r,
-      minMatchCharLength: i,
-      findAllMatches: u,
-      ignoreLocation: c,
-      location: o,
-      threshold: h,
-      distance: a
-    }, e = s ? e : e.toLowerCase(), e = n ? O(e) : e, this.pattern = e, this.query = Xe(this.pattern, this.options);
-  }
-  static condition(e, s) {
-    return s.useExtendedSearch;
-  }
-  searchIn(e) {
-    const s = this.query;
-    if (!s)
+      isCaseSensitive: e,
+      ignoreDiacritics: i,
+      includeMatches: o,
+      minMatchCharLength: r,
+      findAllMatches: c,
+      ignoreLocation: n,
+      location: a,
+      threshold: l,
+      distance: u
+    }, t = e ? t : t.toLowerCase(), t = i ? $(t) : t, this.pattern = t, this.query = ne(this.pattern, this.options);
+  }
+  static condition(t, e) {
+    return e.useExtendedSearch;
+  }
+  searchIn(t) {
+    const e = this.query;
+    if (!e)
       return {
         isMatch: !1,
         score: 1
       };
-    const { includeMatches: n, isCaseSensitive: r, ignoreDiacritics: i } = this.options;
-    e = r ? e : e.toLowerCase(), e = i ? O(e) : e;
-    let c = 0, u = [], o = 0;
-    for (let h = 0, a = s.length; h < a; h += 1) {
-      const l = s[h];
-      u.length = 0, c = 0;
-      for (let d = 0, g = l.length; d < g; d += 1) {
-        const p = l[d], { isMatch: A, indices: C, score: M } = p.search(e);
-        if (A) {
-          if (c += 1, o += M, n) {
-            const m = p.constructor.type;
-            Ze.has(m) ? u = [...u, ...C] : u.push(C);
+    const { includeMatches: i, isCaseSensitive: o, ignoreDiacritics: r } = this.options;
+    t = o ? t : t.toLowerCase(), t = r ? $(t) : t;
+    let n = 0, c = [], a = 0;
+    for (let l = 0, u = e.length; l < u; l += 1) {
+      const h = e[l];
+      c.length = 0, n = 0;
+      for (let d = 0, p = h.length; d < p; d += 1) {
+        const g = h[d], { isMatch: m, indices: A, score: w } = g.search(t);
+        if (m) {
+          if (n += 1, a += w, i) {
+            const C = g.constructor.type;
+            ie.has(C) ? c = [...c, ...A] : c.push(A);
           }
         } else {
-          o = 0, c = 0, u.length = 0;
+          a = 0, n = 0, c.length = 0;
           break;
         }
       }
-      if (c) {
+      if (n) {
         let d = {
           isMatch: !0,
-          score: o / c
+          score: a / n
         };
-        return n && (d.indices = u), d;
+        return i && (d.indices = c), d;
       }
     }
     return {
@@ -781,17 +780,17 @@ class qe {
     };
   }
 }
-const V = [];
-function et(...t) {
-  V.push(...t);
+const Y = [];
+function re(...s) {
+  Y.push(...s);
 }
-function Y(t, e) {
-  for (let s = 0, n = V.length; s < n; s += 1) {
-    let r = V[s];
-    if (r.condition(t, e))
-      return new r(t, e);
+function U(s, t) {
+  for (let e = 0, i = Y.length; e < i; e += 1) {
+    let o = Y[e];
+    if (o.condition(s, t))
+      return new o(s, t);
   }
-  return new le(t, e);
+  return new At(s, t);
 }
 const P = {
   AND: "$and",
@@ -799,227 +798,227 @@ const P = {
 }, Q = {
   PATH: "$path",
   PATTERN: "$val"
-}, U = (t) => !!(t[P.AND] || t[P.OR]), tt = (t) => !!t[Q.PATH], st = (t) => !I(t) && ue(t) && !U(t), re = (t) => ({
-  [P.AND]: Object.keys(t).map((e) => ({
-    [e]: t[e]
+}, J = (s) => !!(s[P.AND] || s[P.OR]), ce = (s) => !!s[Q.PATH], ue = (s) => !F(s) && dt(s) && !J(s), ot = (s) => ({
+  [P.AND]: Object.keys(s).map((t) => ({
+    [t]: s[t]
   }))
 });
-function ge(t, e, { auto: s = !0 } = {}) {
-  const n = (r) => {
-    let i = Object.keys(r);
-    const c = tt(r);
-    if (!c && i.length > 1 && !U(r))
-      return n(re(r));
-    if (st(r)) {
-      const o = c ? r[Q.PATH] : i[0], h = c ? r[Q.PATTERN] : r[o];
-      if (!D(h))
-        throw new Error(xe(o));
-      const a = {
-        keyId: H(o),
-        pattern: h
+function Et(s, t, { auto: e = !0 } = {}) {
+  const i = (o) => {
+    let r = Object.keys(o);
+    const n = ce(o);
+    if (!n && r.length > 1 && !J(o))
+      return i(ot(o));
+    if (ue(o)) {
+      const a = n ? o[Q.PATH] : r[0], l = n ? o[Q.PATTERN] : o[a];
+      if (!b(l))
+        throw new Error(Lt(a));
+      const u = {
+        keyId: V(a),
+        pattern: l
       };
-      return s && (a.searcher = Y(h, e)), a;
+      return e && (u.searcher = U(l, t)), u;
     }
-    let u = {
+    let c = {
       children: [],
-      operator: i[0]
+      operator: r[0]
     };
-    return i.forEach((o) => {
-      const h = r[o];
-      I(h) && h.forEach((a) => {
-        u.children.push(n(a));
+    return r.forEach((a) => {
+      const l = o[a];
+      F(l) && l.forEach((u) => {
+        c.children.push(i(u));
       });
-    }), u;
+    }), c;
   };
-  return U(t) || (t = re(t)), n(t);
+  return J(s) || (s = ot(s)), i(s);
 }
-function nt(t, { ignoreFieldNorm: e = f.ignoreFieldNorm }) {
-  t.forEach((s) => {
-    let n = 1;
-    s.matches.forEach(({ key: r, norm: i, score: c }) => {
-      const u = r ? r.weight : null;
-      n *= Math.pow(
-        c === 0 && u ? Number.EPSILON : c,
-        (u || 1) * (e ? 1 : i)
+function ae(s, { ignoreFieldNorm: t = f.ignoreFieldNorm }) {
+  s.forEach((e) => {
+    let i = 1;
+    e.matches.forEach(({ key: o, norm: r, score: n }) => {
+      const c = o ? o.weight : null;
+      i *= Math.pow(
+        n === 0 && c ? Number.EPSILON : n,
+        (c || 1) * (t ? 1 : r)
       );
-    }), s.score = n;
+    }), e.score = i;
   });
 }
-function rt(t, e) {
-  const s = t.matches;
-  e.matches = [], E(s) && s.forEach((n) => {
-    if (!E(n.indices) || !n.indices.length)
+function le(s, t) {
+  const e = s.matches;
+  t.matches = [], y(e) && e.forEach((i) => {
+    if (!y(i.indices) || !i.indices.length)
       return;
-    const { indices: r, value: i } = n;
-    let c = {
-      indices: r,
-      value: i
+    const { indices: o, value: r } = i;
+    let n = {
+      indices: o,
+      value: r
     };
-    n.key && (c.key = n.key.src), n.idx > -1 && (c.refIndex = n.idx), e.matches.push(c);
+    i.key && (n.key = i.key.src), i.idx > -1 && (n.refIndex = i.idx), t.matches.push(n);
   });
 }
-function it(t, e) {
-  e.score = t.score;
+function he(s, t) {
+  t.score = s.score;
 }
-function ct(t, e, {
-  includeMatches: s = f.includeMatches,
-  includeScore: n = f.includeScore
+function fe(s, t, {
+  includeMatches: e = f.includeMatches,
+  includeScore: i = f.includeScore
 } = {}) {
-  const r = [];
-  return s && r.push(rt), n && r.push(it), t.map((i) => {
-    const { idx: c } = i, u = {
-      item: e[c],
-      refIndex: c
+  const o = [];
+  return e && o.push(le), i && o.push(he), s.map((r) => {
+    const { idx: n } = r, c = {
+      item: t[n],
+      refIndex: n
     };
-    return r.length && r.forEach((o) => {
-      o(i, u);
-    }), u;
+    return o.length && o.forEach((a) => {
+      a(r, c);
+    }), c;
   });
 }
-class R {
-  constructor(e, s = {}, n) {
-    this.options = { ...f, ...s }, this.options.useExtendedSearch, this._keyStore = new ve(this.options.keys), this.setCollection(e, n);
-  }
-  setCollection(e, s) {
-    if (this._docs = e, s && !(s instanceof X))
-      throw new Error(_e);
-    this._myIndex = s || he(this.options.keys, this._docs, {
+class S {
+  constructor(t, e = {}, i) {
+    this.options = { ...f, ...e }, this.options.useExtendedSearch, this._keyStore = new Tt(this.options.keys), this.setCollection(t, i);
+  }
+  setCollection(t, e) {
+    if (this._docs = t, e && !(e instanceof q))
+      throw new Error(St);
+    this._myIndex = e || mt(this.options.keys, this._docs, {
       getFn: this.options.getFn,
       fieldNormWeight: this.options.fieldNormWeight
     });
   }
-  add(e) {
-    E(e) && (this._docs.push(e), this._myIndex.add(e));
+  add(t) {
+    y(t) && (this._docs.push(t), this._myIndex.add(t));
   }
-  remove(e = () => !1) {
-    const s = [];
-    for (let n = 0, r = this._docs.length; n < r; n += 1) {
-      const i = this._docs[n];
-      e(i, n) && (this.removeAt(n), n -= 1, r -= 1, s.push(i));
+  remove(t = () => !1) {
+    const e = [];
+    for (let i = 0, o = this._docs.length; i < o; i += 1) {
+      const r = this._docs[i];
+      t(r, i) && (this.removeAt(i), i -= 1, o -= 1, e.push(r));
     }
-    return s;
+    return e;
   }
-  removeAt(e) {
-    this._docs.splice(e, 1), this._myIndex.removeAt(e);
+  removeAt(t) {
+    this._docs.splice(t, 1), this._myIndex.removeAt(t);
   }
   getIndex() {
     return this._myIndex;
   }
-  search(e, { limit: s = -1 } = {}) {
+  search(t, { limit: e = -1 } = {}) {
     const {
-      includeMatches: n,
-      includeScore: r,
-      shouldSort: i,
-      sortFn: c,
-      ignoreFieldNorm: u
+      includeMatches: i,
+      includeScore: o,
+      shouldSort: r,
+      sortFn: n,
+      ignoreFieldNorm: c
     } = this.options;
-    let o = D(e) ? D(this._docs[0]) ? this._searchStringList(e) : this._searchObjectList(e) : this._searchLogical(e);
-    return nt(o, { ignoreFieldNorm: u }), i && o.sort(c), ce(s) && s > -1 && (o = o.slice(0, s)), ct(o, this._docs, {
-      includeMatches: n,
-      includeScore: r
+    let a = b(t) ? b(this._docs[0]) ? this._searchStringList(t) : this._searchObjectList(t) : this._searchLogical(t);
+    return ae(a, { ignoreFieldNorm: c }), r && a.sort(n), ft(e) && e > -1 && (a = a.slice(0, e)), fe(a, this._docs, {
+      includeMatches: i,
+      includeScore: o
     });
   }
-  _searchStringList(e) {
-    const s = Y(e, this.options), { records: n } = this._myIndex, r = [];
-    return n.forEach(({ v: i, i: c, n: u }) => {
-      if (!E(i))
+  _searchStringList(t) {
+    const e = U(t, this.options), { records: i } = this._myIndex, o = [];
+    return i.forEach(({ v: r, i: n, n: c }) => {
+      if (!y(r))
         return;
-      const { isMatch: o, score: h, indices: a } = s.searchIn(i);
-      o && r.push({
-        item: i,
-        idx: c,
-        matches: [{ score: h, value: i, norm: u, indices: a }]
+      const { isMatch: a, score: l, indices: u } = e.searchIn(r);
+      a && o.push({
+        item: r,
+        idx: n,
+        matches: [{ score: l, value: r, norm: c, indices: u }]
       });
-    }), r;
-  }
-  _searchLogical(e) {
-    const s = ge(e, this.options), n = (u, o, h) => {
-      if (!u.children) {
-        const { keyId: l, searcher: d } = u, g = this._findMatches({
-          key: this._keyStore.get(l),
-          value: this._myIndex.getValueForItemAtKeyId(o, l),
+    }), o;
+  }
+  _searchLogical(t) {
+    const e = Et(t, this.options), i = (c, a, l) => {
+      if (!c.children) {
+        const { keyId: h, searcher: d } = c, p = this._findMatches({
+          key: this._keyStore.get(h),
+          value: this._myIndex.getValueForItemAtKeyId(a, h),
           searcher: d
         });
-        return g && g.length ? [
+        return p && p.length ? [
           {
-            idx: h,
-            item: o,
-            matches: g
+            idx: l,
+            item: a,
+            matches: p
           }
         ] : [];
       }
-      const a = [];
-      for (let l = 0, d = u.children.length; l < d; l += 1) {
-        const g = u.children[l], p = n(g, o, h);
-        if (p.length)
-          a.push(...p);
-        else if (u.operator === P.AND)
+      const u = [];
+      for (let h = 0, d = c.children.length; h < d; h += 1) {
+        const p = c.children[h], g = i(p, a, l);
+        if (g.length)
+          u.push(...g);
+        else if (c.operator === P.AND)
           return [];
       }
-      return a;
-    }, r = this._myIndex.records, i = {}, c = [];
-    return r.forEach(({ $: u, i: o }) => {
-      if (E(u)) {
-        let h = n(s, u, o);
-        h.length && (i[o] || (i[o] = { idx: o, item: u, matches: [] }, c.push(i[o])), h.forEach(({ matches: a }) => {
-          i[o].matches.push(...a);
+      return u;
+    }, o = this._myIndex.records, r = {}, n = [];
+    return o.forEach(({ $: c, i: a }) => {
+      if (y(c)) {
+        let l = i(e, c, a);
+        l.length && (r[a] || (r[a] = { idx: a, item: c, matches: [] }, n.push(r[a])), l.forEach(({ matches: u }) => {
+          r[a].matches.push(...u);
         }));
       }
-    }), c;
+    }), n;
   }
-  _searchObjectList(e) {
-    const s = Y(e, this.options), { keys: n, records: r } = this._myIndex, i = [];
-    return r.forEach(({ $: c, i: u }) => {
-      if (!E(c))
+  _searchObjectList(t) {
+    const e = U(t, this.options), { keys: i, records: o } = this._myIndex, r = [];
+    return o.forEach(({ $: n, i: c }) => {
+      if (!y(n))
         return;
-      let o = [];
-      n.forEach((h, a) => {
-        o.push(
+      let a = [];
+      i.forEach((l, u) => {
+        a.push(
           ...this._findMatches({
-            key: h,
-            value: c[a],
-            searcher: s
+            key: l,
+            value: n[u],
+            searcher: e
           })
         );
-      }), o.length && i.push({
-        idx: u,
-        item: c,
-        matches: o
+      }), a.length && r.push({
+        idx: c,
+        item: n,
+        matches: a
       });
-    }), i;
+    }), r;
   }
-  _findMatches({ key: e, value: s, searcher: n }) {
-    if (!E(s))
+  _findMatches({ key: t, value: e, searcher: i }) {
+    if (!y(e))
       return [];
-    let r = [];
-    if (I(s))
-      s.forEach(({ v: i, i: c, n: u }) => {
-        if (!E(i))
+    let o = [];
+    if (F(e))
+      e.forEach(({ v: r, i: n, n: c }) => {
+        if (!y(r))
           return;
-        const { isMatch: o, score: h, indices: a } = n.searchIn(i);
-        o && r.push({
-          score: h,
-          key: e,
-          value: i,
-          idx: c,
-          norm: u,
-          indices: a
+        const { isMatch: a, score: l, indices: u } = i.searchIn(r);
+        a && o.push({
+          score: l,
+          key: t,
+          value: r,
+          idx: n,
+          norm: c,
+          indices: u
         });
       });
     else {
-      const { v: i, n: c } = s, { isMatch: u, score: o, indices: h } = n.searchIn(i);
-      u && r.push({ score: o, key: e, value: i, norm: c, indices: h });
+      const { v: r, n } = e, { isMatch: c, score: a, indices: l } = i.searchIn(r);
+      c && o.push({ score: a, key: t, value: r, norm: n, indices: l });
     }
-    return r;
+    return o;
   }
 }
-R.version = "7.1.0";
-R.createIndex = he;
-R.parseIndex = Te;
-R.config = f;
-R.parseQuery = ge;
-et(qe);
-const ut = /* @__PURE__ */ J({
+S.version = "7.1.0";
+S.createIndex = mt;
+S.parseIndex = Vt;
+S.config = f;
+S.parseQuery = Et;
+re(oe);
+const de = /* @__PURE__ */ X({
   name: "RenderIconClass",
   props: {
     iconClass: {
@@ -1031,71 +1030,268 @@ const ut = /* @__PURE__ */ J({
       default: () => []
     }
   },
-  setup(t) {
-    const e = () => {
+  setup(s) {
+    const t = () => {
       const {
-        iconClass: s,
-        highlightChunks: n
-      } = t;
-      if (!s || n.length === 0)
-        return s;
-      const r = [];
-      let i = 0;
-      for (const [c, u] of n)
-        c > i && r.push(s.slice(i, c)), r.push(k("span", {
+        iconClass: e,
+        highlightChunks: i
+      } = s;
+      if (!e || i.length === 0)
+        return e;
+      const o = [];
+      let r = 0;
+      for (const [n, c] of i)
+        n > r && o.push(e.slice(r, n)), o.push(L("span", {
           class: "highlight"
-        }, [s.slice(c, u + 1)])), i = u + 1;
-      return i < s.length && r.push(s.slice(i)), r;
+        }, [e.slice(n, c + 1)])), r = c + 1;
+      return r < e.length && o.push(e.slice(r)), o;
     };
-    return () => k("span", {
+    return () => L("span", {
       class: "render-icon-class"
-    }, [e()]);
+    }, [t()]);
   }
 });
-function ot(t) {
-  return t && t.__esModule && Object.prototype.hasOwnProperty.call(t, "default") ? t.default : t;
+function wt(s) {
+  return s && s.__esModule && Object.prototype.hasOwnProperty.call(s, "default") ? s.default : s;
 }
 /*! clipboard-copy. MIT License. Feross Aboukhadijeh <https://feross.org/opensource> */
-var z, ie;
-function at() {
-  if (ie) return z;
-  ie = 1, z = n;
-  function t() {
+var K, rt;
+function pe() {
+  if (rt) return K;
+  rt = 1, K = i;
+  function s() {
     return new DOMException("The request is not allowed", "NotAllowedError");
   }
-  async function e(r) {
+  async function t(o) {
     if (!navigator.clipboard)
-      throw t();
-    return navigator.clipboard.writeText(r);
-  }
-  async function s(r) {
-    const i = document.createElement("span");
-    i.textContent = r, i.style.whiteSpace = "pre", i.style.webkitUserSelect = "auto", i.style.userSelect = "all", document.body.appendChild(i);
-    const c = window.getSelection(), u = window.document.createRange();
-    c.removeAllRanges(), u.selectNode(i), c.addRange(u);
-    let o = !1;
+      throw s();
+    return navigator.clipboard.writeText(o);
+  }
+  async function e(o) {
+    const r = document.createElement("span");
+    r.textContent = o, r.style.whiteSpace = "pre", r.style.webkitUserSelect = "auto", r.style.userSelect = "all", document.body.appendChild(r);
+    const n = window.getSelection(), c = window.document.createRange();
+    n.removeAllRanges(), c.selectNode(r), n.addRange(c);
+    let a = !1;
     try {
-      o = window.document.execCommand("copy");
+      a = window.document.execCommand("copy");
     } finally {
-      c.removeAllRanges(), window.document.body.removeChild(i);
+      n.removeAllRanges(), window.document.body.removeChild(r);
     }
-    if (!o) throw t();
+    if (!a) throw s();
   }
-  async function n(r) {
+  async function i(o) {
     try {
-      await e(r);
-    } catch (i) {
+      await t(o);
+    } catch (r) {
       try {
-        await s(r);
-      } catch (c) {
-        throw c || i || t();
+        await e(o);
+      } catch (n) {
+        throw n || r || s();
       }
     }
   }
-  return z;
+  return K;
 }
-var ht = at();
-const lt = /* @__PURE__ */ ot(ht), ft = /* @__PURE__ */ J({
+var ge = pe();
+const me = /* @__PURE__ */ wt(ge);
+var T = { exports: {} };
+/*!
+ * Toastify js 1.12.0
+ * https://github.com/apvarun/toastify-js
+ * @license MIT licensed
+ *
+ * Copyright (C) 2018 Varun A P
+ */
+var Ae = T.exports, ct;
+function Ce() {
+  return ct || (ct = 1, (function(s) {
+    (function(t, e) {
+      s.exports ? s.exports = e() : t.Toastify = e();
+    })(Ae, function(t) {
+      var e = function(n) {
+        return new e.lib.init(n);
+      }, i = "1.12.0";
+      e.defaults = {
+        oldestFirst: !0,
+        text: "Toastify is awesome!",
+        node: void 0,
+        duration: 3e3,
+        selector: void 0,
+        callback: function() {
+        },
+        destination: void 0,
+        newWindow: !1,
+        close: !1,
+        gravity: "toastify-top",
+        positionLeft: !1,
+        position: "",
+        backgroundColor: "",
+        avatar: "",
+        className: "",
+        stopOnFocus: !0,
+        onClick: function() {
+        },
+        offset: { x: 0, y: 0 },
+        escapeMarkup: !0,
+        ariaLive: "polite",
+        style: { background: "" }
+      }, e.lib = e.prototype = {
+        toastify: i,
+        constructor: e,
+        // Initializing the object with required parameters
+        init: function(n) {
+          return n || (n = {}), this.options = {}, this.toastElement = null, this.options.text = n.text || e.defaults.text, this.options.node = n.node || e.defaults.node, this.options.duration = n.duration === 0 ? 0 : n.duration || e.defaults.duration, this.options.selector = n.selector || e.defaults.selector, this.options.callback = n.callback || e.defaults.callback, this.options.destination = n.destination || e.defaults.destination, this.options.newWindow = n.newWindow || e.defaults.newWindow, this.options.close = n.close || e.defaults.close, this.options.gravity = n.gravity === "bottom" ? "toastify-bottom" : e.defaults.gravity, this.options.positionLeft = n.positionLeft || e.defaults.positionLeft, this.options.position = n.position || e.defaults.position, this.options.backgroundColor = n.backgroundColor || e.defaults.backgroundColor, this.options.avatar = n.avatar || e.defaults.avatar, this.options.className = n.className || e.defaults.className, this.options.stopOnFocus = n.stopOnFocus === void 0 ? e.defaults.stopOnFocus : n.stopOnFocus, this.options.onClick = n.onClick || e.defaults.onClick, this.options.offset = n.offset || e.defaults.offset, this.options.escapeMarkup = n.escapeMarkup !== void 0 ? n.escapeMarkup : e.defaults.escapeMarkup, this.options.ariaLive = n.ariaLive || e.defaults.ariaLive, this.options.style = n.style || e.defaults.style, n.backgroundColor && (this.options.style.background = n.backgroundColor), this;
+        },
+        // Building the DOM element
+        buildToast: function() {
+          if (!this.options)
+            throw "Toastify is not initialized";
+          var n = document.createElement("div");
+          n.className = "toastify on " + this.options.className, this.options.position ? n.className += " toastify-" + this.options.position : this.options.positionLeft === !0 ? (n.className += " toastify-left", console.warn("Property `positionLeft` will be depreciated in further versions. Please use `position` instead.")) : n.className += " toastify-right", n.className += " " + this.options.gravity, this.options.backgroundColor && console.warn('DEPRECATION NOTICE: "backgroundColor" is being deprecated. Please use the "style.background" property.');
+          for (var c in this.options.style)
+            n.style[c] = this.options.style[c];
+          if (this.options.ariaLive && n.setAttribute("aria-live", this.options.ariaLive), this.options.node && this.options.node.nodeType === Node.ELEMENT_NODE)
+            n.appendChild(this.options.node);
+          else if (this.options.escapeMarkup ? n.innerText = this.options.text : n.innerHTML = this.options.text, this.options.avatar !== "") {
+            var a = document.createElement("img");
+            a.src = this.options.avatar, a.className = "toastify-avatar", this.options.position == "left" || this.options.positionLeft === !0 ? n.appendChild(a) : n.insertAdjacentElement("afterbegin", a);
+          }
+          if (this.options.close === !0) {
+            var l = document.createElement("button");
+            l.type = "button", l.setAttribute("aria-label", "Close"), l.className = "toast-close", l.innerHTML = "&#10006;", l.addEventListener(
+              "click",
+              (function(A) {
+                A.stopPropagation(), this.removeElement(this.toastElement), window.clearTimeout(this.toastElement.timeOutValue);
+              }).bind(this)
+            );
+            var u = window.innerWidth > 0 ? window.innerWidth : screen.width;
+            (this.options.position == "left" || this.options.positionLeft === !0) && u > 360 ? n.insertAdjacentElement("afterbegin", l) : n.appendChild(l);
+          }
+          if (this.options.stopOnFocus && this.options.duration > 0) {
+            var h = this;
+            n.addEventListener(
+              "mouseover",
+              function(A) {
+                window.clearTimeout(n.timeOutValue);
+              }
+            ), n.addEventListener(
+              "mouseleave",
+              function() {
+                n.timeOutValue = window.setTimeout(
+                  function() {
+                    h.removeElement(n);
+                  },
+                  h.options.duration
+                );
+              }
+            );
+          }
+          if (typeof this.options.destination < "u" && n.addEventListener(
+            "click",
+            (function(A) {
+              A.stopPropagation(), this.options.newWindow === !0 ? window.open(this.options.destination, "_blank") : window.location = this.options.destination;
+            }).bind(this)
+          ), typeof this.options.onClick == "function" && typeof this.options.destination > "u" && n.addEventListener(
+            "click",
+            (function(A) {
+              A.stopPropagation(), this.options.onClick();
+            }).bind(this)
+          ), typeof this.options.offset == "object") {
+            var d = o("x", this.options), p = o("y", this.options), g = this.options.position == "left" ? d : "-" + d, m = this.options.gravity == "toastify-top" ? p : "-" + p;
+            n.style.transform = "translate(" + g + "," + m + ")";
+          }
+          return n;
+        },
+        // Displaying the toast
+        showToast: function() {
+          this.toastElement = this.buildToast();
+          var n;
+          if (typeof this.options.selector == "string" ? n = document.getElementById(this.options.selector) : this.options.selector instanceof HTMLElement || typeof ShadowRoot < "u" && this.options.selector instanceof ShadowRoot ? n = this.options.selector : n = document.body, !n)
+            throw "Root element is not defined";
+          var c = e.defaults.oldestFirst ? n.firstChild : n.lastChild;
+          return n.insertBefore(this.toastElement, c), e.reposition(), this.options.duration > 0 && (this.toastElement.timeOutValue = window.setTimeout(
+            (function() {
+              this.removeElement(this.toastElement);
+            }).bind(this),
+            this.options.duration
+          )), this;
+        },
+        hideToast: function() {
+          this.toastElement.timeOutValue && clearTimeout(this.toastElement.timeOutValue), this.removeElement(this.toastElement);
+        },
+        // Removing the element from the DOM
+        removeElement: function(n) {
+          n.className = n.className.replace(" on", ""), window.setTimeout(
+            (function() {
+              this.options.node && this.options.node.parentNode && this.options.node.parentNode.removeChild(this.options.node), n.parentNode && n.parentNode.removeChild(n), this.options.callback.call(n), e.reposition();
+            }).bind(this),
+            400
+          );
+        }
+      }, e.reposition = function() {
+        for (var n = {
+          top: 15,
+          bottom: 15
+        }, c = {
+          top: 15,
+          bottom: 15
+        }, a = {
+          top: 15,
+          bottom: 15
+        }, l = document.getElementsByClassName("toastify"), u, h = 0; h < l.length; h++) {
+          r(l[h], "toastify-top") === !0 ? u = "toastify-top" : u = "toastify-bottom";
+          var d = l[h].offsetHeight;
+          u = u.substr(9, u.length - 1);
+          var p = 15, g = window.innerWidth > 0 ? window.innerWidth : screen.width;
+          g <= 360 ? (l[h].style[u] = a[u] + "px", a[u] += d + p) : r(l[h], "toastify-left") === !0 ? (l[h].style[u] = n[u] + "px", n[u] += d + p) : (l[h].style[u] = c[u] + "px", c[u] += d + p);
+        }
+        return this;
+      };
+      function o(n, c) {
+        return c.offset[n] ? isNaN(c.offset[n]) ? c.offset[n] : c.offset[n] + "px" : "0px";
+      }
+      function r(n, c) {
+        return !n || typeof c != "string" ? !1 : !!(n.className && n.className.trim().split(/\s+/gi).indexOf(c) > -1);
+      }
+      return e.lib.init.prototype = e.lib, e;
+    });
+  })(T)), T.exports;
+}
+var ye = Ce();
+const ut = /* @__PURE__ */ wt(ye), at = {
+  duration: 3e3,
+  gravity: "top",
+  position: "center",
+  stopOnFocus: !0
+}, lt = {
+  padding: "11px 15px",
+  "box-shadow": "unset",
+  "border-radius": "4px",
+  "font-size": "14px"
+}, Ee = () => ({ success: (e) => {
+  ut({
+    ...at,
+    text: e,
+    style: {
+      ...lt,
+      background: "#f0f9eb",
+      color: "#67c23a",
+      border: "1px solid #e1f3d8"
+    }
+  }).showToast();
+}, error: (e) => {
+  ut({
+    ...at,
+    text: e,
+    style: {
+      ...lt,
+      background: "#fef0f0",
+      color: "#f56c6c",
+      border: "1px solid #fde2e2"
+    }
+  }).showToast();
+} }), ht = Ee(), we = /* @__PURE__ */ X({
   name: "RenderIcon",
   props: {
     iconInfo: {
@@ -1108,53 +1304,51 @@ const lt = /* @__PURE__ */ ot(ht), ft = /* @__PURE__ */ J({
     },
     copyHandler: Function
   },
-  setup(t) {
-    const e = async (n) => {
-      if (t.copyHandler) {
-        t.copyHandler(n);
+  setup(s) {
+    const t = async (i) => {
+      if (s.copyHandler) {
+        s.copyHandler(i);
         return;
       }
-      let r = "";
+      let o = "";
       try {
-        await lt(n), r = "success";
+        await me(i), o = "success";
       } catch {
-        r = "error";
+        o = "error";
       }
-      Me({
-        message: `copy ${r} [${n}]`,
-        type: r
-      });
-    }, s = pe(() => t.iconInfo.baseClassName ? `${t.iconInfo.baseClassName} ${t.iconClass}` : t.iconClass);
+      const r = `copy ${o} [${i}]`;
+      o === "success" ? ht.success(r) : ht.error(r);
+    }, e = vt(() => s.iconInfo.baseClassName ? `${s.iconInfo.baseClassName} ${s.iconClass}` : s.iconClass);
     return () => {
-      var n;
-      return k("span", {
+      var i;
+      return L("span", {
         class: "render-icon",
-        onClick: () => e(s.value)
-      }, [t.iconInfo.renderIcon ? t.iconInfo.renderIcon(s.value) : k("i", {
-        class: [t.iconInfo.baseClassName, t.iconClass]
-      }, null), k(ut, {
-        iconClass: t.iconClass,
-        "highlight-chunks": (n = t.iconInfo.matchesMap) == null ? void 0 : n.get(t.iconClass)
+        onClick: () => t(e.value)
+      }, [s.iconInfo.renderIcon ? s.iconInfo.renderIcon(e.value) : L("i", {
+        class: [s.iconInfo.baseClassName, s.iconClass]
+      }, null), L(de, {
+        iconClass: s.iconClass,
+        "highlight-chunks": (i = s.iconInfo.matchesMap) == null ? void 0 : i.get(s.iconClass)
       }, null)]);
     };
   }
-}), dt = {
+}), ve = {
   getIconsInfo: {
     type: Function,
     required: !0
   },
   cssLinkFormat: {
     type: Function,
-    default: (t) => t
+    default: (s) => s
   }
-}, gt = { class: "render-icon-list" }, mt = /* @__PURE__ */ J({
+}, Me = { class: "render-icon-list" }, xe = /* @__PURE__ */ X({
   __name: "render-icon-list",
-  props: dt,
-  setup(t, { expose: e }) {
-    const s = t, n = N(), r = N(), i = N([]), c = N([]), u = (a) => {
-      n.value = a, r.value = a, i.value = a.map((l) => l.filePath), c.value = a.map((l) => ({
-        iconInfo: l,
-        fuse: new R(l.classNames, {
+  props: ve,
+  setup(s, { expose: t }) {
+    const e = s, i = O(), o = O(), r = O([]), n = O([]), c = (u) => {
+      i.value = u, o.value = u, r.value = u.map((h) => h.filePath), n.value = u.map((h) => ({
+        iconInfo: h,
+        fuse: new S(h.classNames, {
           /**
            * 搜索结果是否包含匹配的相关性分数，开启后会额外包含一个 score 字段，表示匹配的相似度分数
            * 0 表示完全匹配
@@ -1173,61 +1367,61 @@ const lt = /* @__PURE__ */ ot(ht), ft = /* @__PURE__ */ J({
           // 是否按分数对结果列表进行排序
         })
       }));
-    }, o = (a) => {
-      const l = document.querySelector("head");
-      if (!l) {
+    }, a = (u) => {
+      const h = document.querySelector("head");
+      if (!h) {
         console.error("Head element not found");
         return;
       }
       const d = document.createDocumentFragment();
-      a.forEach((g) => {
-        if (!g.filePath) return;
-        const p = s.cssLinkFormat(g.filePath);
-        if (document.querySelector(`link[rel='stylesheet'][href='${p}']`))
+      u.forEach((p) => {
+        if (!p.filePath) return;
+        const g = e.cssLinkFormat(p.filePath);
+        if (document.querySelector(`link[rel='stylesheet'][href='${g}']`))
           return;
-        const A = document.createElement("link");
-        A.rel = "stylesheet", A.href = p, d.appendChild(A);
-      }), l.appendChild(d);
+        const m = document.createElement("link");
+        m.rel = "stylesheet", m.href = g, d.appendChild(m);
+      }), h.appendChild(d);
     };
-    return Ae(async () => {
-      var l;
-      const a = await ((l = s.getIconsInfo) == null ? void 0 : l.call(s)) || [];
-      o(a), u(a);
-    }), e({
-      onSearch: (a) => {
-        const l = a.trim();
-        if (!n.value) return;
-        if (!l) {
-          i.value = n.value.map((g) => g.filePath), r.value = n.value;
+    return Mt(async () => {
+      var h;
+      const u = await ((h = e.getIconsInfo) == null ? void 0 : h.call(e)) || [];
+      a(u), c(u);
+    }), t({
+      onSearch: (u) => {
+        const h = u.trim();
+        if (!i.value) return;
+        if (!h) {
+          r.value = i.value.map((p) => p.filePath), o.value = i.value;
           return;
         }
         const d = [];
-        c.value.forEach(({ iconInfo: g, fuse: p }) => {
-          const A = p.search(l);
-          if (A.length) {
-            const C = /* @__PURE__ */ new Map(), M = [];
-            A.forEach((m) => {
-              const _ = m.matches || [], B = [];
-              _.forEach((T) => {
-                B.push(...T.indices);
-              }), C.set(m.item, B), M.push(m.item);
+        n.value.forEach(({ iconInfo: p, fuse: g }) => {
+          const m = g.search(h);
+          if (m.length) {
+            const A = /* @__PURE__ */ new Map(), w = [];
+            m.forEach((C) => {
+              const x = C.matches || [], M = [];
+              x.forEach((j) => {
+                M.push(...j.indices);
+              }), A.set(C.item, M), w.push(C.item);
             }), d.push({
-              ...g,
-              matchesMap: C,
-              classNames: M
+              ...p,
+              matchesMap: A,
+              classNames: w
             });
           }
-        }), r.value = d, i.value = d.map((g) => g.filePath);
+        }), o.value = d, r.value = d.map((p) => p.filePath);
       }
-    }), (a, l) => (me(), Ce("div", gt, [
-      Ee(a.$slots, "default", {
-        iconsInfo: r.value,
-        renderIcon: ye(ft)
+    }), (u, h) => (Ft(), bt("div", Me, [
+      xt(u.$slots, "default", {
+        iconsInfo: o.value,
+        renderIcon: Bt(we)
       })
     ]));
   }
 });
 export {
-  mt as RenderIconList,
-  dt as renderIconListProps
+  xe as RenderIconList,
+  ve as renderIconListProps
 };