@iress-oss/ids-components 6.0.0-alpha.3 → 6.0.0-alpha.30

package/dist/fuzzysort-DKAolWVP.js

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

package/dist/helpers/dom/domUtils.js

@@ -1,12 +0,0 @@
-const o = (s, t) => {
-  if (!s || !("closest" in s) || typeof s.closest != "function")
-    return null;
-  try {
-    return s.closest(t);
-  } catch {
-    return null;
-  }
-};
-export {
-  o as safeClosest
-};

package/dist/helpers/dom/hasShadowDom.js

@@ -1,4 +0,0 @@
-const a = (o) => !!o && !!o.shadowRoot && !!o.attachShadow;
-export {
-  a as hasShadowDom
-};

package/dist/helpers/form/isValidFormInputElement.js

@@ -1,4 +0,0 @@
-const a = (t) => t.tagName === "SELECT" && !t.disabled || !!t.name && !t.disabled && t.type !== "file" && t.type !== "reset" && t.type !== "submit" && t.type !== "button";
-export {
-  a as isValidFormInputElement
-};

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

@@ -1,14 +0,0 @@
-import { f as u } from "../../fuzzysort-DKAolWVP.js";
-const o = (r, e) => {
-  const t = u.single(r, e);
-  if (!t)
-    return;
-  const n = t.indexes;
-  return n[0] !== 0 ? [0, e.length] : [
-    Math.max(...n.map((s) => s.valueOf())) + 1,
-    e.length
-  ];
-};
-export {
-  o as getQueryRangeExclusive
-};

package/dist/helpers/responsive/getResponsiveLayoutModifiers.js

@@ -1,11 +0,0 @@
-const o = (n, t, r) => {
-  if (!t && typeof r == "string")
-    return r ? [`${n}--${r}`] : [];
-  if (typeof t == "string" || typeof t == "number")
-    return [`${n}--${t}`];
-  const $ = t ? Object.keys(t).map((e) => `${n}-${e}--${t[e]}`) : [];
-  return typeof r == "string" && !t?.xs ? [`${n}-xs--${r}`, ...$] : $;
-};
-export {
-  o as getResponsiveLayoutModifiers
-};

package/dist/helpers/responsive/getResponsivePaddingClasses.js

@@ -1,11 +0,0 @@
-const f = (r) => {
-  const s = "iress-p";
-  return r ? typeof r == "string" ? [`${s}--${r}`] : Object.keys(r).some(
-    (e) => e === "x" || e === "y" || e === "b" || e === "l"
-  ) ? Object.entries(r).map(([e, t]) => `${s}${e}--${t}`) : Object.entries(r).flatMap(([e, t]) => typeof t == "string" ? `${s}-${e}--${t}` : Object.entries(t).map(
-    ([$, i]) => `${s}${$}-${e}--${i}`
-  )) : [];
-};
-export {
-  f as getResponsivePaddingClasses
-};

package/dist/helpers/styling/getVariablePadding.js

@@ -1,38 +0,0 @@
-const s = ["xs", "sm", "md", "lg", "xl", "xxl"], b = (t, e, n) => {
-  if (typeof t == "string")
-    return t;
-  if (!i(t))
-    return;
-  const r = f(e);
-  if (r === -1)
-    return;
-  if (!l(t))
-    return c(t, n);
-  const o = v(t, r);
-  if (o !== void 0)
-    return x(o, n);
-}, f = (t) => s.indexOf(t), l = (t) => s.some((e) => i(t) && e in t), i = (t) => typeof t == "object" && t != null, c = (t, e) => e && i(t) && e in t ? t[e] ?? void 0 : t, v = (t, e) => {
-  let n;
-  for (let r = 0; r <= e; r++) {
-    const o = s[r];
-    if (i(t) && o in t) {
-      const u = t[o];
-      u !== null && (n = u);
-    }
-  }
-  return n;
-}, x = (t, e) => {
-  if (typeof t == "string")
-    return t;
-  if (i(t)) {
-    if (e === void 0)
-      return;
-    if (e in t) {
-      const n = t[e];
-      return typeof n == "string" ? n : void 0;
-    }
-  }
-};
-export {
-  b as getVariablePaddingValue
-};

package/dist/helpers/styling/mapGutterToGap.js

@@ -1,23 +0,0 @@
-const i = {
-  none: "spacing.0",
-  xs: "spacing.1",
-  sm: "spacing.2",
-  md: "spacing.4",
-  lg: "spacing.7",
-  xl: "spacing.10"
-}, o = (n) => {
-  if (typeof n == "string")
-    return i[n];
-  if (typeof n == "object") {
-    const p = {};
-    for (const c in n) {
-      const s = n[c];
-      typeof s == "string" && s in i && (p[c] = i[s]);
-    }
-    return p;
-  }
-  return "spacing.0";
-};
-export {
-  o as mapGutterToGap
-};