@iress-oss/ids-components 5.13.1 → 5.14.1

package/dist/fuzzysort-eoXOpoo6.js

@@ -0,0 +1,395 @@
+import { g as Ie } from "./_commonjsHelpers-C6fGbg64.js";
+var X = { exports: {} }, ye = X.exports, _e;
+function me() {
+  return _e || (_e = 1, function(ae) {
+    ((ne, Y) => {
+      ae.exports ? ae.exports = Y() : ne.fuzzysort = Y();
+    })(ye, (ne) => {
+      var Y = (r, e) => {
+        if (!r || !e) return b;
+        var a = le(r);
+        P(e) || (e = E(e));
+        var i = a.bitflags;
+        return (i & e._bitflags) !== i ? b : D(a, e);
+      }, ge = (r, e, a) => {
+        if (!r) return a != null && a.all ? xe(e, a) : ee;
+        var i = le(r), v = i.bitflags, f = i.containsSpace, n = K((a == null ? void 0 : a.threshold) || 0), s = (a == null ? void 0 : a.limit) || j, t = 0, _ = 0, u = e.length;
+        function m(q) {
+          t < s ? (Q.add(q), ++t) : (++_, q._score > Q.peek()._score && Q.replaceTop(q));
+        }
+        if (a != null && a.key)
+          for (var L = a.key, g = 0; g < u; ++g) {
+            var y = e[g], o = J(y, L);
+            if (o && (P(o) || (o = E(o)), (v & o._bitflags) === v)) {
+              var x = D(i, o);
+              x !== b && (x._score < n || (x.obj = y, m(x)));
+            }
+          }
+        else if (a != null && a.keys) {
+          var A = a.keys, z = A.length;
+          e: for (var g = 0; g < u; ++g) {
+            var y = e[g];
+            {
+              for (var I = 0, c = 0; c < z; ++c) {
+                var L = A[c], o = J(y, L);
+                if (!o) {
+                  p[c] = V;
+                  continue;
+                }
+                P(o) || (o = E(o)), p[c] = o, I |= o._bitflags;
+              }
+              if ((v & I) !== v) continue;
+            }
+            if (f) for (let h = 0; h < i.spaceSearches.length; h++) N[h] = B;
+            for (var c = 0; c < z; ++c) {
+              if (o = p[c], o === V) {
+                G[c] = V;
+                continue;
+              }
+              if (G[c] = D(
+                i,
+                o,
+                /*allowSpaces=*/
+                !1,
+                /*allowPartialMatch=*/
+                f
+              ), G[c] === b) {
+                G[c] = V;
+                continue;
+              }
+              if (f) for (let d = 0; d < i.spaceSearches.length; d++) {
+                if (M[d] > -1e3 && N[d] > B) {
+                  var S = (N[d] + M[d]) / 4;
+                  S > N[d] && (N[d] = S);
+                }
+                M[d] > N[d] && (N[d] = M[d]);
+              }
+            }
+            if (f) {
+              for (let h = 0; h < i.spaceSearches.length; h++)
+                if (N[h] === B) continue e;
+            } else {
+              var l = !1;
+              for (let h = 0; h < z; h++)
+                if (G[h]._score !== B) {
+                  l = !0;
+                  break;
+                }
+              if (!l) continue;
+            }
+            var C = new ie(z);
+            for (let h = 0; h < z; h++)
+              C[h] = G[h];
+            if (f) {
+              var w = 0;
+              for (let h = 0; h < i.spaceSearches.length; h++) w += N[h];
+            } else {
+              var w = B;
+              for (let d = 0; d < z; d++) {
+                var x = C[d];
+                if (x._score > -1e3 && w > B) {
+                  var S = (w + x._score) / 4;
+                  S > w && (w = S);
+                }
+                x._score > w && (w = x._score);
+              }
+            }
+            if (C.obj = y, C._score = w, a != null && a.scoreFn) {
+              if (w = a.scoreFn(C), !w) continue;
+              w = K(w), C._score = w;
+            }
+            w < n || m(C);
+          }
+        } else
+          for (var g = 0; g < u; ++g) {
+            var o = e[g];
+            if (o && (P(o) || (o = E(o)), (v & o._bitflags) === v)) {
+              var x = D(i, o);
+              x !== b && (x._score < n || m(x));
+            }
+          }
+        if (t === 0) return ee;
+        for (var T = new Array(t), g = t - 1; g >= 0; --g) T[g] = Q.poll();
+        return T.total = t + _, T;
+      }, oe = (r, e = "<b>", a = "</b>") => {
+        for (var i = typeof e == "function" ? e : void 0, v = r.target, f = v.length, n = r.indexes, s = "", t = 0, _ = 0, u = !1, m = [], L = 0; L < f; ++L) {
+          var g = v[L];
+          if (n[_] === L) {
+            if (++_, u || (u = !0, i ? (m.push(s), s = "") : s += e), _ === n.length) {
+              i ? (s += g, m.push(i(s, t++)), s = "", m.push(v.substr(L + 1))) : s += g + a + v.substr(L + 1);
+              break;
+            }
+          } else
+            u && (u = !1, i ? (m.push(i(s, t++)), s = "") : s += a);
+          s += g;
+        }
+        return i ? m : s;
+      }, $ = (r) => {
+        typeof r == "number" ? r = "" + r : typeof r != "string" && (r = "");
+        var e = Z(r);
+        return ve(r, { _targetLower: e._lower, _targetLowerCodes: e.lowerCodes, _bitflags: e.bitflags });
+      }, he = () => {
+        U.clear(), R.clear();
+      };
+      class fe {
+        get indexes() {
+          return this._indexes.slice(0, this._indexes.len).sort((e, a) => e - a);
+        }
+        set indexes(e) {
+          return this._indexes = e;
+        }
+        highlight(e, a) {
+          return oe(this, e, a);
+        }
+        get score() {
+          return te(this._score);
+        }
+        set score(e) {
+          this._score = K(e);
+        }
+      }
+      class ie extends Array {
+        get score() {
+          return te(this._score);
+        }
+        set score(e) {
+          this._score = K(e);
+        }
+      }
+      var ve = (r, e) => {
+        const a = new fe();
+        return a.target = r, a.obj = e.obj ?? b, a._score = e._score ?? B, a._indexes = e._indexes ?? [], a._targetLower = e._targetLower ?? "", a._targetLowerCodes = e._targetLowerCodes ?? b, a._nextBeginningIndexes = e._nextBeginningIndexes ?? b, a._bitflags = e._bitflags ?? 0, a;
+      }, te = (r) => r === B ? 0 : r > 1 ? r : Math.E ** (((-r + 1) ** 0.04307 - 1) * -2), K = (r) => r === 0 ? B : r > 1 ? r : 1 - Math.pow(Math.log(r) / -2 + 1, 1 / 0.04307), se = (r) => {
+        typeof r == "number" ? r = "" + r : typeof r != "string" && (r = ""), r = r.trim();
+        var e = Z(r), a = [];
+        if (e.containsSpace) {
+          var i = r.split(/\s+/);
+          i = [...new Set(i)];
+          for (var v = 0; v < i.length; v++)
+            if (i[v] !== "") {
+              var f = Z(i[v]);
+              a.push({ lowerCodes: f.lowerCodes, _lower: i[v].toLowerCase(), containsSpace: !1 });
+            }
+        }
+        return { lowerCodes: e.lowerCodes, _lower: e._lower, containsSpace: e.containsSpace, bitflags: e.bitflags, spaceSearches: a };
+      }, E = (r) => {
+        if (r.length > 999) return $(r);
+        var e = U.get(r);
+        return e !== void 0 || (e = $(r), U.set(r, e)), e;
+      }, le = (r) => {
+        if (r.length > 999) return se(r);
+        var e = R.get(r);
+        return e !== void 0 || (e = se(r), R.set(r, e)), e;
+      }, xe = (r, e) => {
+        var a = [];
+        a.total = r.length;
+        var i = (e == null ? void 0 : e.limit) || j;
+        if (e != null && e.key)
+          for (var v = 0; v < r.length; v++) {
+            var f = r[v], n = J(f, e.key);
+            if (n != b) {
+              P(n) || (n = E(n));
+              var s = ve(n.target, { _score: n._score, obj: f });
+              if (a.push(s), a.length >= i) return a;
+            }
+          }
+        else if (e != null && e.keys)
+          for (var v = 0; v < r.length; v++) {
+            for (var f = r[v], t = new ie(e.keys.length), _ = e.keys.length - 1; _ >= 0; --_) {
+              var n = J(f, e.keys[_]);
+              if (!n) {
+                t[_] = V;
+                continue;
+              }
+              P(n) || (n = E(n)), n._score = B, n._indexes.len = 0, t[_] = n;
+            }
+            if (t.obj = f, t._score = B, a.push(t), a.length >= i) return a;
+          }
+        else
+          for (var v = 0; v < r.length; v++) {
+            var n = r[v];
+            if (n != b && (P(n) || (n = E(n)), n._score = B, n._indexes.len = 0, a.push(n), a.length >= i))
+              return a;
+          }
+        return a;
+      }, D = (r, e, a = !1, i = !1) => {
+        if (a === !1 && r.containsSpace) return de(r, e, i);
+        for (var v = r._lower, f = r.lowerCodes, n = f[0], s = e._targetLowerCodes, t = f.length, _ = s.length, g = 0, u = 0, m = 0; ; ) {
+          var L = n === s[u];
+          if (L) {
+            if (k[m++] = u, ++g, g === t) break;
+            n = f[g];
+          }
+          if (++u, u >= _) return b;
+        }
+        var g = 0, y = !1, o = 0, x = e._nextBeginningIndexes;
+        x === b && (x = e._nextBeginningIndexes = be(e.target)), u = k[0] === 0 ? 0 : x[k[0] - 1];
+        var A = 0;
+        if (u !== _) for (; ; )
+          if (u >= _) {
+            if (g <= 0 || (++A, A > 200)) break;
+            --g;
+            var z = O[--o];
+            u = x[z];
+          } else {
+            var L = f[g] === s[u];
+            if (L) {
+              if (O[o++] = u, ++g, g === t) {
+                y = !0;
+                break;
+              }
+              ++u;
+            } else
+              u = x[u];
+          }
+        var I = t <= 1 ? -1 : e._targetLower.indexOf(v, k[0]), c = !!~I, S = c ? I === 0 || e._nextBeginningIndexes[I - 1] === I : !1;
+        if (c && !S) {
+          for (var l = 0; l < x.length; l = x[l])
+            if (!(l <= I)) {
+              for (var C = 0; C < t && f[C] === e._targetLowerCodes[l + C]; C++) ;
+              if (C === t) {
+                I = l, S = !0;
+                break;
+              }
+            }
+        }
+        var w = (h) => {
+          for (var d = 0, ce = 0, F = 1; F < t; ++F)
+            h[F] - h[F - 1] !== 1 && (d -= h[F], ++ce);
+          var Le = h[t - 1] - h[0] - (t - 1);
+          if (d -= (12 + Le) * ce, h[0] !== 0 && (d -= h[0] * h[0] * 0.2), !y)
+            d *= 1e3;
+          else {
+            for (var re = 1, F = x[0]; F < _; F = x[F]) ++re;
+            re > 24 && (d *= (re - 24) * 10);
+          }
+          return d -= (_ - t) / 2, c && (d /= 1 + t * t * 1), S && (d /= 1 + t * t * 1), d -= (_ - t) / 2, d;
+        };
+        if (y)
+          if (S) {
+            for (var l = 0; l < t; ++l) k[l] = I + l;
+            var T = k, q = w(k);
+          } else
+            var T = O, q = w(O);
+        else {
+          if (c) for (var l = 0; l < t; ++l) k[l] = I + l;
+          var T = k, q = w(T);
+        }
+        e._score = q;
+        for (var l = 0; l < t; ++l) e._indexes[l] = T[l];
+        e._indexes.len = t;
+        const W = new fe();
+        return W.target = e.target, W._score = e._score, W._indexes = e._indexes, W;
+      }, de = (r, e, a) => {
+        for (var i = /* @__PURE__ */ new Set(), v = 0, f = b, n = 0, s = r.spaceSearches, t = s.length, _ = 0, u = () => {
+          for (let S = _ - 1; S >= 0; S--) e._nextBeginningIndexes[H[S * 2 + 0]] = H[S * 2 + 1];
+        }, m = !1, c = 0; c < t; ++c) {
+          M[c] = B;
+          var L = s[c];
+          if (f = D(L, e), a) {
+            if (f === b) continue;
+            m = !0;
+          } else if (f === b)
+            return u(), b;
+          var g = c === t - 1;
+          if (!g) {
+            var y = f._indexes, o = !0;
+            for (let l = 0; l < y.len - 1; l++)
+              if (y[l + 1] - y[l] !== 1) {
+                o = !1;
+                break;
+              }
+            if (o) {
+              var x = y[y.len - 1] + 1, A = e._nextBeginningIndexes[x - 1];
+              for (let l = x - 1; l >= 0 && A === e._nextBeginningIndexes[l]; l--)
+                e._nextBeginningIndexes[l] = x, H[_ * 2 + 0] = l, H[_ * 2 + 1] = A, _++;
+            }
+          }
+          v += f._score / t, M[c] = f._score / t, f._indexes[0] < n && (v -= (n - f._indexes[0]) * 2), n = f._indexes[0];
+          for (var z = 0; z < f._indexes.len; ++z) i.add(f._indexes[z]);
+        }
+        if (a && !m) return b;
+        u();
+        var I = D(
+          r,
+          e,
+          /*allowSpaces=*/
+          !0
+        );
+        if (I !== b && I._score > v) {
+          if (a)
+            for (var c = 0; c < t; ++c)
+              M[c] = I._score / t;
+          return I;
+        }
+        a && (f = e), f._score = v;
+        var c = 0;
+        for (let S of i) f._indexes[c++] = S;
+        return f._indexes.len = c, f;
+      }, ue = (r) => r.replace(new RegExp("\\p{Script=Latin}+", "gu"), (e) => e.normalize("NFD")).replace(/[\u0300-\u036f]/g, ""), Z = (r) => {
+        r = ue(r);
+        for (var e = r.length, a = r.toLowerCase(), i = [], v = 0, f = !1, n = 0; n < e; ++n) {
+          var s = i[n] = a.charCodeAt(n);
+          if (s === 32) {
+            f = !0;
+            continue;
+          }
+          var t = s >= 97 && s <= 122 ? s - 97 : s >= 48 && s <= 57 ? 26 : s <= 127 ? 30 : 31;
+          v |= 1 << t;
+        }
+        return { lowerCodes: i, bitflags: v, containsSpace: f, _lower: a };
+      }, we = (r) => {
+        for (var e = r.length, a = [], i = 0, v = !1, f = !1, n = 0; n < e; ++n) {
+          var s = r.charCodeAt(n), t = s >= 65 && s <= 90, _ = t || s >= 97 && s <= 122 || s >= 48 && s <= 57, u = t && !v || !f || !_;
+          v = t, f = _, u && (a[i++] = n);
+        }
+        return a;
+      }, be = (r) => {
+        r = ue(r);
+        for (var e = r.length, a = we(r), i = [], v = a[0], f = 0, n = 0; n < e; ++n)
+          v > n ? i[n] = v : (v = a[++f], i[n] = v === void 0 ? e : v);
+        return i;
+      }, U = /* @__PURE__ */ new Map(), R = /* @__PURE__ */ new Map(), k = [], O = [], H = [], N = [], M = [], p = [], G = [], J = (r, e) => {
+        var a = r[e];
+        if (a !== void 0) return a;
+        if (typeof e == "function") return e(r);
+        var i = e;
+        Array.isArray(e) || (i = e.split("."));
+        for (var v = i.length, f = -1; r && ++f < v; ) r = r[i[f]];
+        return r;
+      }, P = (r) => typeof r == "object" && typeof r._bitflags == "number", j = 1 / 0, B = -j, ee = [];
+      ee.total = 0;
+      var b = null, V = $(""), Se = (r) => {
+        var e = [], a = 0, i = {}, v = (f) => {
+          for (var n = 0, s = e[n], t = 1; t < a; ) {
+            var _ = t + 1;
+            n = t, _ < a && e[_]._score < e[t]._score && (n = _), e[n - 1 >> 1] = e[n], t = 1 + (n << 1);
+          }
+          for (var u = n - 1 >> 1; n > 0 && s._score < e[u]._score; u = (n = u) - 1 >> 1) e[n] = e[u];
+          e[n] = s;
+        };
+        return i.add = (f) => {
+          var n = a;
+          e[a++] = f;
+          for (var s = n - 1 >> 1; n > 0 && f._score < e[s]._score; s = (n = s) - 1 >> 1) e[n] = e[s];
+          e[n] = f;
+        }, i.poll = (f) => {
+          if (a !== 0) {
+            var n = e[0];
+            return e[0] = e[--a], v(), n;
+          }
+        }, i.peek = (f) => {
+          if (a !== 0) return e[0];
+        }, i.replaceTop = (f) => {
+          e[0] = f, v();
+        }, i;
+      }, Q = Se();
+      return { single: Y, go: ge, prepare: $, cleanup: he };
+    });
+  }(X)), X.exports;
+}
+var Be = me();
+const ze = /* @__PURE__ */ Ie(Be);
+export {
+  ze as f
+};

package/dist/helpers/label-value/getQueryRangeExclusive.js

@@ -1,4 +1,4 @@
-import { f as u } from "../../fuzzysort-CuIReeYY.js";
+import { f as u } from "../../fuzzysort-eoXOpoo6.js";
 const o = (r, e) => {
   const t = u.single(r, e);
   if (!t)

package/dist/helpers/label-value/highlightQueryInLabel.js

@@ -1,5 +1,5 @@
 import { jsx as g } from "react/jsx-runtime";
-import { f as n } from "../../fuzzysort-CuIReeYY.js";
+import { f as n } from "../../fuzzysort-eoXOpoo6.js";
 const m = (r, t, h = "b") => {
   var i;
   return ((i = n.single(t, r)) == null ? void 0 : i.highlight((o, e) => /* @__PURE__ */ g(h, { children: o }, e))) ?? r;

package/dist/helpers/label-value/searchLabelValues.js

@@ -1,4 +1,4 @@
-import { f as o } from "../../fuzzysort-CuIReeYY.js";
+import { f as o } from "../../fuzzysort-eoXOpoo6.js";
 import { highlightQueryInLabelValue as s } from "./highlightQueryInLabelValue.js";
 const m = (e, r, t) => o.go(e, r, {
   key: "label",

package/dist/index-2QXL0WYc.js

@@ -0,0 +1,45 @@
+import { g as c } from "./_commonjsHelpers-C6fGbg64.js";
+var n = { exports: {} };
+/*!
+	Copyright (c) 2018 Jed Watson.
+	Licensed under the MIT License (MIT), see
+	http://jedwatson.github.io/classnames
+*/
+var a;
+function p() {
+  return a || (a = 1, function(o) {
+    (function() {
+      var f = {}.hasOwnProperty;
+      function e() {
+        for (var t = "", r = 0; r < arguments.length; r++) {
+          var s = arguments[r];
+          s && (t = i(t, u(s)));
+        }
+        return t;
+      }
+      function u(t) {
+        if (typeof t == "string" || typeof t == "number")
+          return t;
+        if (typeof t != "object")
+          return "";
+        if (Array.isArray(t))
+          return e.apply(null, t);
+        if (t.toString !== Object.prototype.toString && !t.toString.toString().includes("[native code]"))
+          return t.toString();
+        var r = "";
+        for (var s in t)
+          f.call(t, s) && t[s] && (r = i(r, s));
+        return r;
+      }
+      function i(t, r) {
+        return r ? t ? t + " " + r : t + r : t;
+      }
+      o.exports ? (e.default = e, o.exports = e) : window.classNames = e;
+    })();
+  }(n)), n.exports;
+}
+var l = p();
+const x = /* @__PURE__ */ c(l);
+export {
+  x as c
+};