@iress-oss/ids-components 5.20.0 → 5.20.3

package/dist/fuzzysort-BNka47rs.js

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

package/dist/helpers/dom/closestCrossShadow.js

@@ -1,26 +1,25 @@
-const h = (t, r) => {
-  var i, n;
-  if (!t)
+const a = (o, n) => {
+  if (!o)
     return null;
-  const a = (i = t.closest) == null ? void 0 : i.call(t, r);
-  if (a)
-    return a;
-  let o = t;
-  for (; o; ) {
-    if ((n = o.matches) != null && n.call(o, r))
-      return o;
-    let s = o.parentElement;
-    if (!s) {
-      const f = o.getRootNode();
-      if (f instanceof ShadowRoot)
-        s = f.host;
+  const r = o.closest?.(n);
+  if (r)
+    return r;
+  let t = o;
+  for (; t; ) {
+    if (t.matches?.(n))
+      return t;
+    let e = t.parentElement;
+    if (!e) {
+      const s = t.getRootNode();
+      if (s instanceof ShadowRoot)
+        e = s.host;
       else
         break;
     }
-    o = s;
+    t = e;
   }
   return null;
 };
 export {
-  h as closestCrossShadow
+  a as closestCrossShadow
 };

package/dist/helpers/dom/focusableElements.js

@@ -1,10 +1,10 @@
-import { FOCUSABLE_QUERY_SELECTOR as t } from "../../constants.js";
-const n = (o) => {
-  const r = o == null ? void 0 : o.querySelectorAll(
-    t
+import { FOCUSABLE_QUERY_SELECTOR as r } from "../../constants.js";
+const l = (e) => {
+  const o = e?.querySelectorAll(
+    r
   );
-  return Array.from(r);
+  return Array.from(o);
 };
 export {
-  n as focusableElements
+  l as focusableElements
 };

package/dist/helpers/dom/getActiveElement.js

@@ -1,9 +1,8 @@
-import { hasShadowDom as e } from "./hasShadowDom.js";
-const m = () => {
-  var o;
-  const t = document.activeElement;
-  return e(t) ? ((o = t == null ? void 0 : t.shadowRoot) == null ? void 0 : o.activeElement) || void 0 : t || void 0;
+import { hasShadowDom as t } from "./hasShadowDom.js";
+const i = () => {
+  const e = document.activeElement;
+  return t(e) ? e?.shadowRoot?.activeElement || void 0 : e || void 0;
 };
 export {
-  m as getActiveElement
+  i as getActiveElement
 };

package/dist/helpers/formatting/formatDateTime.js

@@ -1,6 +1,5 @@
 import { getDateObj as c, formatShortDate as f } from "./formatDate.js";
 const g = (o) => {
-  var r;
   const t = c(o);
   if (!t.getDate()) return "";
   const m = t.toLocaleString("default", {
@@ -17,14 +16,16 @@ const g = (o) => {
     hour12: !1,
     timeZone: "UTC"
   });
-  let e = (r = t.toLocaleDateString("default", {
+  let e = t.toLocaleDateString("default", {
     day: "2-digit",
     timeZoneName: "long",
     timeZone: "UTC"
-  }).substring(4).match(/\b(\w)/g)) == null ? void 0 : r.join("");
+  }).substring(4).match(/\b(\w)/g)?.join("");
   return e === "CUT" && (e = "UTC"), `${m}-${n}-${i} ${a} (${e})`;
 }, y = (o, t = "week") => {
-  const m = c(o).getTime(), n = Math.round((m - Date.now()) / 1e3), i = [
+  const r = c(o);
+  if (!r?.getDate()) return "";
+  const m = r.getTime(), n = Math.round((m - Date.now()) / 1e3), i = [
     60,
     3600,
     86400,
@@ -41,12 +42,12 @@ const g = (o) => {
     "month",
     "year"
   ], e = i.findIndex(
-    (s) => s > Math.abs(n)
+    (d) => d > Math.abs(n)
   );
   if (e > 0 && t && e >= a.indexOf(t))
     return f(o);
-  const r = e ? i[e - 1] : 1;
-  return new Intl.RelativeTimeFormat("default", { numeric: "auto" }).format(Math.floor(n / r), a[e]);
+  const s = e ? i[e - 1] : 1;
+  return new Intl.RelativeTimeFormat("default", { numeric: "auto" }).format(Math.floor(n / s), a[e]);
 };
 export {
   g as formatISODateTime,

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

@@ -1,13 +1,13 @@
-import { toArray as a } from "../formatting/toArray.js";
-const m = (n, l = "{{numOptions}} selected") => {
-  const r = a(n);
-  if (!r.length) return "";
-  const o = l == null ? void 0 : l.replace(
+import { toArray as n } from "../formatting/toArray.js";
+const s = (t, r = "{{numOptions}} selected") => {
+  const e = n(t);
+  if (!e.length) return "";
+  const l = r?.replace(
     "{{numOptions}}",
-    r.length.toString()
+    e.length.toString()
   );
-  return r.length === 1 ? r[0].label : o;
+  return e.length === 1 ? e[0].label : l;
 };
 export {
-  m as composeLabelValueDescriptor
+  s as composeLabelValueDescriptor
 };

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

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

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

@@ -1,9 +1,8 @@
-import { toArray as e } from "../formatting/toArray.js";
-const b = (u, s = !1) => {
-  var l, o;
-  const a = e(u);
-  return s ? a.map((r) => (r == null ? void 0 : r.value) ?? (r == null ? void 0 : r.label)) : ((l = a[0]) == null ? void 0 : l.value) ?? ((o = a[0]) == null ? void 0 : o.label);
+import { toArray as t } from "../formatting/toArray.js";
+const u = (a, l = !1) => {
+  const e = t(a);
+  return l ? e.map((r) => r?.value ?? r?.label) : e[0]?.value ?? e[0]?.label;
 };
 export {
-  b as getValueFromLabelValues
+  u as getValueFromLabelValues
 };

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

@@ -1,9 +1,6 @@
-import { jsx as g } from "react/jsx-runtime";
-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;
-};
+import { jsx as e } from "react/jsx-runtime";
+import { f as g } from "../../fuzzysort-BNka47rs.js";
+const f = (r, i, t = "b") => g.single(i, r)?.highlight((h, o) => /* @__PURE__ */ e(t, { children: h }, o)) ?? r;
 export {
-  m as highlightQueryInLabel
+  f as highlightQueryInLabel
 };

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

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

package/dist/helpers/responsive/getResponsiveLayoutModifiers.js

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

package/dist/helpers/transition/getTransitionDuration.js

@@ -1,10 +1,7 @@
-import { timeStringToNumber as n } from "./timeStringToNumber.js";
-const u = (t, o = 0.8, i = 240) => {
-  var r;
-  return t ? n(
-    ((r = window.getComputedStyle(t, null)) == null ? void 0 : r.getPropertyValue("transition-duration")) || ".3s"
-  ) * o : i;
-};
+import { timeStringToNumber as i } from "./timeStringToNumber.js";
+const e = (t, r = 0.8, o = 240) => t ? i(
+  window.getComputedStyle(t, null)?.getPropertyValue("transition-duration") || ".3s"
+) * r : o;
 export {
-  u as getTransitionDuration
+  e as getTransitionDuration
 };

package/dist/hooks/useAriaRelationship.js

@@ -1,38 +1,36 @@
-import { useRef as f, useCallback as l } from "react";
-const R = (e) => {
-  const r = f(null), u = l((t) => {
-    r.current = t;
-  }, []), o = l(
+import { useRef as p, useCallback as n } from "react";
+const f = (e) => {
+  const o = p(null), l = n((t) => {
+    o.current = t;
+  }, []), s = n(
     (t) => {
-      var n, i;
-      const s = (((n = r.current) == null ? void 0 : n.getAttribute(e)) ?? "").split(" ");
-      s.push(t), (i = r.current) == null || i.setAttribute(
+      const r = (o.current?.getAttribute(e) ?? "").split(" ");
+      r.push(t), o.current?.setAttribute(
         e,
-        s.join(" ").trim()
+        r.join(" ").trim()
       );
     },
     [e]
-  ), c = l(
+  ), i = n(
     (t) => {
-      var n, i;
-      const s = (((n = r.current) == null ? void 0 : n.getAttribute(e)) ?? "").split(" ").filter((a) => a !== t);
-      (i = r.current) == null || i.setAttribute(
+      const r = (o.current?.getAttribute(e) ?? "").split(" ").filter((u) => u !== t);
+      o.current?.setAttribute(
         e,
-        s.join(" ").trim()
+        r.join(" ").trim()
       );
     },
     [e]
-  ), p = l(
-    (t) => (s) => {
-      s ? o == null || o(t) : c == null || c(t);
+  ), c = n(
+    (t) => (r) => {
+      r ? s?.(t) : i?.(t);
     },
-    [o, c]
+    [s, i]
   );
   return {
-    setController: u,
-    setControlViaRef: p
+    setController: l,
+    setControlViaRef: c
   };
 };
 export {
-  R as useAriaRelationship
+  f as useAriaRelationship
 };