@boxcustodia/library 1.0.0 → 1.2.0

package/dist/index.es308.js

@@ -1,31 +1,430 @@
-import { __exports as e } from "./index.es405.js";
-import "./index.es406.js";
-import "./index.es407.js";
-import "./index.es408.js";
-import "./index.es409.js";
-import "./index.es410.js";
-import { __exports as a } from "./index.es411.js";
-import { __exports as l } from "./index.es412.js";
-import { __exports as t } from "./index.es413.js";
-import { __exports as s } from "./index.es414.js";
-import { __exports as m } from "./index.es415.js";
-Object.defineProperty(e, "__esModule", {
-  value: !0
-});
-var p = e.roles = P = e.roleElements = x = e.elementRoles = e.dom = e.aria = void 0, _ = r(a), i = r(l), n = r(t), d = r(s), f = r(m);
-function r(o) {
-  return o && o.__esModule ? o : { default: o };
-}
-var u = _.default;
-e.aria = u;
-var v = i.default;
-e.dom = v;
-var M = n.default;
-p = e.roles = M;
-var R = d.default, x = e.elementRoles = R, E = f.default, P = e.roleElements = E;
+import { focusSafely as j } from "./index.es479.js";
+import { isElementVisible as W } from "./index.es480.js";
+import { getInteractionModality as q } from "./index.es481.js";
+import { getOwnerDocument as E } from "./index.es460.js";
+import { useLayoutEffect as h } from "./index.es405.js";
+import { isAndroid as U, isChrome as V } from "./index.es463.js";
+import F, { useRef as y, useContext as H, useMemo as R, useEffect as P } from "react";
+const D = /* @__PURE__ */ F.createContext(null), C = "react-aria-focus-scope-restore";
+let s = null;
+function ue(t) {
+  let { children: e, contain: r, restoreFocus: o, autoFocus: n } = t, a = y(null), u = y(null), i = y([]), { parentNode: p } = H(D) || {}, l = R(() => new M({
+    scopeRef: i
+  }), [
+    i
+  ]);
+  h(() => {
+    let f = p || b.root;
+    if (b.getTreeNode(f.scopeRef) && s && !L(s, f.scopeRef)) {
+      let v = b.getTreeNode(s);
+      v && (f = v);
+    }
+    f.addChild(l), b.addNode(l);
+  }, [
+    l,
+    p
+  ]), h(() => {
+    let f = b.getTreeNode(i);
+    f && (f.contain = !!r);
+  }, [
+    r
+  ]), h(() => {
+    var f;
+    let v = (f = a.current) === null || f === void 0 ? void 0 : f.nextSibling, m = [], x = (_) => _.stopPropagation();
+    for (; v && v !== u.current; )
+      m.push(v), v.addEventListener(C, x), v = v.nextSibling;
+    return i.current = m, () => {
+      for (let _ of m) _.removeEventListener(C, x);
+    };
+  }, [
+    e
+  ]), Z(i, o, r), X(i, r), ee(i, o, r), Y(i, n), P(() => {
+    const f = E(i.current ? i.current[0] : void 0).activeElement;
+    let v = null;
+    if ($(f, i.current)) {
+      for (let m of b.traverse()) m.scopeRef && $(f, m.scopeRef.current) && (v = m);
+      v === b.getTreeNode(i) && (s = v.scopeRef);
+    }
+  }, [
+    i
+  ]), h(() => () => {
+    var f, v, m;
+    let x = (m = (v = b.getTreeNode(i)) === null || v === void 0 || (f = v.parent) === null || f === void 0 ? void 0 : f.scopeRef) !== null && m !== void 0 ? m : null;
+    (i === s || L(i, s)) && (!x || b.getTreeNode(x)) && (s = x), b.removeTreeNode(i);
+  }, [
+    i
+  ]);
+  let c = R(() => J(i), []), d = R(() => ({
+    focusManager: c,
+    parentNode: l
+  }), [
+    l,
+    c
+  ]);
+  return /* @__PURE__ */ F.createElement(D.Provider, {
+    value: d
+  }, /* @__PURE__ */ F.createElement("span", {
+    "data-focus-scope-start": !0,
+    hidden: !0,
+    ref: a
+  }), e, /* @__PURE__ */ F.createElement("span", {
+    "data-focus-scope-end": !0,
+    hidden: !0,
+    ref: u
+  }));
+}
+function J(t) {
+  return {
+    focusNext(e = {}) {
+      let r = t.current, { from: o, tabbable: n, wrap: a, accept: u } = e, i = o || E(r[0]).activeElement, p = r[0].previousElementSibling, l = g(r), c = T(l, {
+        tabbable: n,
+        accept: u
+      }, r);
+      c.currentNode = $(i, r) ? i : p;
+      let d = c.nextNode();
+      return !d && a && (c.currentNode = p, d = c.nextNode()), d && N(d, !0), d;
+    },
+    focusPrevious(e = {}) {
+      let r = t.current, { from: o, tabbable: n, wrap: a, accept: u } = e, i = o || E(r[0]).activeElement, p = r[r.length - 1].nextElementSibling, l = g(r), c = T(l, {
+        tabbable: n,
+        accept: u
+      }, r);
+      c.currentNode = $(i, r) ? i : p;
+      let d = c.previousNode();
+      return !d && a && (c.currentNode = p, d = c.previousNode()), d && N(d, !0), d;
+    },
+    focusFirst(e = {}) {
+      let r = t.current, { tabbable: o, accept: n } = e, a = g(r), u = T(a, {
+        tabbable: o,
+        accept: n
+      }, r);
+      u.currentNode = r[0].previousElementSibling;
+      let i = u.nextNode();
+      return i && N(i, !0), i;
+    },
+    focusLast(e = {}) {
+      let r = t.current, { tabbable: o, accept: n } = e, a = g(r), u = T(a, {
+        tabbable: o,
+        accept: n
+      }, r);
+      u.currentNode = r[r.length - 1].nextElementSibling;
+      let i = u.previousNode();
+      return i && N(i, !0), i;
+    }
+  };
+}
+const A = [
+  "input:not([disabled]):not([type=hidden])",
+  "select:not([disabled])",
+  "textarea:not([disabled])",
+  "button:not([disabled])",
+  "a[href]",
+  "area[href]",
+  "summary",
+  "iframe",
+  "object",
+  "embed",
+  "audio[controls]",
+  "video[controls]",
+  '[contenteditable]:not([contenteditable^="false"])'
+], G = A.join(":not([hidden]),") + ",[tabindex]:not([disabled]):not([hidden])";
+A.push('[tabindex]:not([tabindex="-1"]):not([disabled])');
+const Q = A.join(':not([hidden]):not([tabindex="-1"]),');
+function g(t) {
+  return t[0].parentElement;
+}
+function S(t) {
+  let e = b.getTreeNode(s);
+  for (; e && e.scopeRef !== t; ) {
+    if (e.contain) return !1;
+    e = e.parent;
+  }
+  return !0;
+}
+function X(t, e) {
+  let r = y(void 0), o = y(void 0);
+  h(() => {
+    let n = t.current;
+    if (!e) {
+      o.current && (cancelAnimationFrame(o.current), o.current = void 0);
+      return;
+    }
+    const a = E(n ? n[0] : void 0);
+    let u = (l) => {
+      if (l.key !== "Tab" || l.altKey || l.ctrlKey || l.metaKey || !S(t) || l.isComposing) return;
+      let c = a.activeElement, d = t.current;
+      if (!d || !$(c, d)) return;
+      let f = g(d), v = T(f, {
+        tabbable: !0
+      }, d);
+      if (!c) return;
+      v.currentNode = c;
+      let m = l.shiftKey ? v.previousNode() : v.nextNode();
+      m || (v.currentNode = l.shiftKey ? d[d.length - 1].nextElementSibling : d[0].previousElementSibling, m = l.shiftKey ? v.previousNode() : v.nextNode()), l.preventDefault(), m && N(m, !0);
+    }, i = (l) => {
+      (!s || L(s, t)) && $(l.target, t.current) ? (s = t, r.current = l.target) : S(t) && !w(l.target, t) ? r.current ? r.current.focus() : s && s.current && k(s.current) : S(t) && (r.current = l.target);
+    }, p = (l) => {
+      o.current && cancelAnimationFrame(o.current), o.current = requestAnimationFrame(() => {
+        let c = q();
+        if (!((c === "virtual" || c === null) && U() && V()) && a.activeElement && S(t) && !w(a.activeElement, t))
+          if (s = t, a.body.contains(l.target)) {
+            var f;
+            r.current = l.target, (f = r.current) === null || f === void 0 || f.focus();
+          } else s.current && k(s.current);
+      });
+    };
+    return a.addEventListener("keydown", u, !1), a.addEventListener("focusin", i, !1), n == null || n.forEach((l) => l.addEventListener("focusin", i, !1)), n == null || n.forEach((l) => l.addEventListener("focusout", p, !1)), () => {
+      a.removeEventListener("keydown", u, !1), a.removeEventListener("focusin", i, !1), n == null || n.forEach((l) => l.removeEventListener("focusin", i, !1)), n == null || n.forEach((l) => l.removeEventListener("focusout", p, !1));
+    };
+  }, [
+    t,
+    e
+  ]), h(() => () => {
+    o.current && cancelAnimationFrame(o.current);
+  }, [
+    o
+  ]);
+}
+function B(t) {
+  return w(t);
+}
+function $(t, e) {
+  return !t || !e ? !1 : e.some((r) => r.contains(t));
+}
+function w(t, e = null) {
+  if (t instanceof Element && t.closest("[data-react-aria-top-layer]")) return !0;
+  for (let { scopeRef: r } of b.traverse(b.getTreeNode(e)))
+    if (r && $(t, r.current)) return !0;
+  return !1;
+}
+function L(t, e) {
+  var r;
+  let o = (r = b.getTreeNode(e)) === null || r === void 0 ? void 0 : r.parent;
+  for (; o; ) {
+    if (o.scopeRef === t) return !0;
+    o = o.parent;
+  }
+  return !1;
+}
+function N(t, e = !1) {
+  if (t != null && !e) try {
+    j(t);
+  } catch {
+  }
+  else if (t != null) try {
+    t.focus();
+  } catch {
+  }
+}
+function z(t, e = !0) {
+  let r = t[0].previousElementSibling, o = g(t), n = T(o, {
+    tabbable: e
+  }, t);
+  n.currentNode = r;
+  let a = n.nextNode();
+  return e && !a && (o = g(t), n = T(o, {
+    tabbable: !1
+  }, t), n.currentNode = r, a = n.nextNode()), a;
+}
+function k(t, e = !0) {
+  N(z(t, e));
+}
+function Y(t, e) {
+  const r = F.useRef(e);
+  P(() => {
+    if (r.current) {
+      s = t;
+      const o = E(t.current ? t.current[0] : void 0);
+      !$(o.activeElement, s.current) && t.current && k(t.current);
+    }
+    r.current = !1;
+  }, [
+    t
+  ]);
+}
+function Z(t, e, r) {
+  h(() => {
+    if (e || r) return;
+    let o = t.current;
+    const n = E(o ? o[0] : void 0);
+    let a = (u) => {
+      let i = u.target;
+      $(i, t.current) ? s = t : B(i) || (s = null);
+    };
+    return n.addEventListener("focusin", a, !1), o == null || o.forEach((u) => u.addEventListener("focusin", a, !1)), () => {
+      n.removeEventListener("focusin", a, !1), o == null || o.forEach((u) => u.removeEventListener("focusin", a, !1));
+    };
+  }, [
+    t,
+    e,
+    r
+  ]);
+}
+function I(t) {
+  let e = b.getTreeNode(s);
+  for (; e && e.scopeRef !== t; ) {
+    if (e.nodeToRestore) return !1;
+    e = e.parent;
+  }
+  return (e == null ? void 0 : e.scopeRef) === t;
+}
+function ee(t, e, r) {
+  const o = y(typeof document < "u" ? E(t.current ? t.current[0] : void 0).activeElement : null);
+  h(() => {
+    let n = t.current;
+    const a = E(n ? n[0] : void 0);
+    if (!e || r) return;
+    let u = () => {
+      (!s || L(s, t)) && $(a.activeElement, t.current) && (s = t);
+    };
+    return a.addEventListener("focusin", u, !1), n == null || n.forEach((i) => i.addEventListener("focusin", u, !1)), () => {
+      a.removeEventListener("focusin", u, !1), n == null || n.forEach((i) => i.removeEventListener("focusin", u, !1));
+    };
+  }, [
+    t,
+    r
+  ]), h(() => {
+    const n = E(t.current ? t.current[0] : void 0);
+    if (!e) return;
+    let a = (u) => {
+      if (u.key !== "Tab" || u.altKey || u.ctrlKey || u.metaKey || !S(t) || u.isComposing) return;
+      let i = n.activeElement;
+      if (!w(i, t) || !I(t)) return;
+      let p = b.getTreeNode(t);
+      if (!p) return;
+      let l = p.nodeToRestore, c = T(n.body, {
+        tabbable: !0
+      });
+      c.currentNode = i;
+      let d = u.shiftKey ? c.previousNode() : c.nextNode();
+      if ((!l || !n.body.contains(l) || l === n.body) && (l = void 0, p.nodeToRestore = void 0), (!d || !w(d, t)) && l) {
+        c.currentNode = l;
+        do
+          d = u.shiftKey ? c.previousNode() : c.nextNode();
+        while (w(d, t));
+        u.preventDefault(), u.stopPropagation(), d ? N(d, !0) : B(l) ? N(l, !0) : i.blur();
+      }
+    };
+    return r || n.addEventListener("keydown", a, !0), () => {
+      r || n.removeEventListener("keydown", a, !0);
+    };
+  }, [
+    t,
+    e,
+    r
+  ]), h(() => {
+    const n = E(t.current ? t.current[0] : void 0);
+    if (!e) return;
+    let a = b.getTreeNode(t);
+    if (a) {
+      var u;
+      return a.nodeToRestore = (u = o.current) !== null && u !== void 0 ? u : void 0, () => {
+        let i = b.getTreeNode(t);
+        if (!i) return;
+        let p = i.nodeToRestore;
+        if (e && p && (n.activeElement && w(n.activeElement, t) || n.activeElement === n.body && I(t))) {
+          let l = b.clone();
+          requestAnimationFrame(() => {
+            if (n.activeElement === n.body) {
+              let c = l.getTreeNode(t);
+              for (; c; ) {
+                if (c.nodeToRestore && c.nodeToRestore.isConnected) {
+                  O(c.nodeToRestore);
+                  return;
+                }
+                c = c.parent;
+              }
+              for (c = l.getTreeNode(t); c; ) {
+                if (c.scopeRef && c.scopeRef.current && b.getTreeNode(c.scopeRef)) {
+                  let d = z(c.scopeRef.current, !0);
+                  O(d);
+                  return;
+                }
+                c = c.parent;
+              }
+            }
+          });
+        }
+      };
+    }
+  }, [
+    t,
+    e
+  ]);
+}
+function O(t) {
+  t.dispatchEvent(new CustomEvent(C, {
+    bubbles: !0,
+    cancelable: !0
+  })) && N(t);
+}
+function T(t, e, r) {
+  let o = e != null && e.tabbable ? Q : G, n = E(t).createTreeWalker(t, NodeFilter.SHOW_ELEMENT, {
+    acceptNode(a) {
+      var u;
+      return !(e == null || (u = e.from) === null || u === void 0) && u.contains(a) ? NodeFilter.FILTER_REJECT : a.matches(o) && W(a) && (!r || $(a, r)) && (!(e != null && e.accept) || e.accept(a)) ? NodeFilter.FILTER_ACCEPT : NodeFilter.FILTER_SKIP;
+    }
+  });
+  return e != null && e.from && (n.currentNode = e.from), n;
+}
+class K {
+  get size() {
+    return this.fastMap.size;
+  }
+  getTreeNode(e) {
+    return this.fastMap.get(e);
+  }
+  addTreeNode(e, r, o) {
+    let n = this.fastMap.get(r ?? null);
+    if (!n) return;
+    let a = new M({
+      scopeRef: e
+    });
+    n.addChild(a), a.parent = n, this.fastMap.set(e, a), o && (a.nodeToRestore = o);
+  }
+  addNode(e) {
+    this.fastMap.set(e.scopeRef, e);
+  }
+  removeTreeNode(e) {
+    if (e === null) return;
+    let r = this.fastMap.get(e);
+    if (!r) return;
+    let o = r.parent;
+    for (let a of this.traverse()) a !== r && r.nodeToRestore && a.nodeToRestore && r.scopeRef && r.scopeRef.current && $(a.nodeToRestore, r.scopeRef.current) && (a.nodeToRestore = r.nodeToRestore);
+    let n = r.children;
+    o && (o.removeChild(r), n.size > 0 && n.forEach((a) => o && o.addChild(a))), this.fastMap.delete(r.scopeRef);
+  }
+  // Pre Order Depth First
+  *traverse(e = this.root) {
+    if (e.scopeRef != null && (yield e), e.children.size > 0) for (let r of e.children) yield* this.traverse(r);
+  }
+  clone() {
+    var e;
+    let r = new K();
+    var o;
+    for (let n of this.traverse()) r.addTreeNode(n.scopeRef, (o = (e = n.parent) === null || e === void 0 ? void 0 : e.scopeRef) !== null && o !== void 0 ? o : null, n.nodeToRestore);
+    return r;
+  }
+  constructor() {
+    this.fastMap = /* @__PURE__ */ new Map(), this.root = new M({
+      scopeRef: null
+    }), this.fastMap.set(null, this.root);
+  }
+}
+class M {
+  addChild(e) {
+    this.children.add(e), e.parent = this;
+  }
+  removeChild(e) {
+    this.children.delete(e), e.parent = void 0;
+  }
+  constructor(e) {
+    this.children = /* @__PURE__ */ new Set(), this.contain = !1, this.scopeRef = e.scopeRef;
+  }
+}
+let b = new K();
 export {
-  e as default,
-  x as elementRoles,
-  P as roleElements,
-  p as roles
+  ue as FocusScope,
+  b as focusScopeTree,
+  T as getFocusableTreeWalker
 };

package/dist/index.es309.js

@@ -1,200 +1,15 @@
-import { getDefaultExportFromCjs as O } from "./index.es170.js";
-import { __module as j } from "./index.es416.js";
-(function(x) {
-  var m = function() {
-    var A = String.fromCharCode, S = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=", M = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+-$", y = {};
-    function g(o, r) {
-      if (!y[o]) {
-        y[o] = {};
-        for (var s = 0; s < o.length; s++)
-          y[o][o.charAt(s)] = s;
-      }
-      return y[o][r];
+import { getRowId as r } from "./index.es509.js";
+import { useGridSelectionCheckbox as a } from "./index.es514.js";
+function $(e, o) {
+  let { key: c } = e;
+  const { checkboxProps: b } = a(e, o);
+  return {
+    checkboxProps: {
+      ...b,
+      "aria-labelledby": `${b.id} ${r(o, c)}`
     }
-    var d = {
-      compressToBase64: function(o) {
-        if (o == null) return "";
-        var r = d._compress(o, 6, function(s) {
-          return S.charAt(s);
-        });
-        switch (r.length % 4) {
-          default:
-          case 0:
-            return r;
-          case 1:
-            return r + "===";
-          case 2:
-            return r + "==";
-          case 3:
-            return r + "=";
-        }
-      },
-      decompressFromBase64: function(o) {
-        return o == null ? "" : o == "" ? null : d._decompress(o.length, 32, function(r) {
-          return g(S, o.charAt(r));
-        });
-      },
-      compressToUTF16: function(o) {
-        return o == null ? "" : d._compress(o, 15, function(r) {
-          return A(r + 32);
-        }) + " ";
-      },
-      decompressFromUTF16: function(o) {
-        return o == null ? "" : o == "" ? null : d._decompress(o.length, 16384, function(r) {
-          return o.charCodeAt(r) - 32;
-        });
-      },
-      //compress into uint8array (UCS-2 big endian format)
-      compressToUint8Array: function(o) {
-        for (var r = d.compress(o), s = new Uint8Array(r.length * 2), e = 0, i = r.length; e < i; e++) {
-          var p = r.charCodeAt(e);
-          s[e * 2] = p >>> 8, s[e * 2 + 1] = p % 256;
-        }
-        return s;
-      },
-      //decompress from uint8array (UCS-2 big endian format)
-      decompressFromUint8Array: function(o) {
-        if (o == null)
-          return d.decompress(o);
-        for (var r = new Array(o.length / 2), s = 0, e = r.length; s < e; s++)
-          r[s] = o[s * 2] * 256 + o[s * 2 + 1];
-        var i = [];
-        return r.forEach(function(p) {
-          i.push(A(p));
-        }), d.decompress(i.join(""));
-      },
-      //compress into a string that is already URI encoded
-      compressToEncodedURIComponent: function(o) {
-        return o == null ? "" : d._compress(o, 6, function(r) {
-          return M.charAt(r);
-        });
-      },
-      //decompress from an output of compressToEncodedURIComponent
-      decompressFromEncodedURIComponent: function(o) {
-        return o == null ? "" : o == "" ? null : (o = o.replace(/ /g, "+"), d._decompress(o.length, 32, function(r) {
-          return g(M, o.charAt(r));
-        }));
-      },
-      compress: function(o) {
-        return d._compress(o, 16, function(r) {
-          return A(r);
-        });
-      },
-      _compress: function(o, r, s) {
-        if (o == null) return "";
-        var e, i, p = {}, v = {}, w = "", _ = "", u = "", h = 2, a = 3, c = 2, l = [], n = 0, f = 0, t;
-        for (t = 0; t < o.length; t += 1)
-          if (w = o.charAt(t), Object.prototype.hasOwnProperty.call(p, w) || (p[w] = a++, v[w] = !0), _ = u + w, Object.prototype.hasOwnProperty.call(p, _))
-            u = _;
-          else {
-            if (Object.prototype.hasOwnProperty.call(v, u)) {
-              if (u.charCodeAt(0) < 256) {
-                for (e = 0; e < c; e++)
-                  n = n << 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++;
-                for (i = u.charCodeAt(0), e = 0; e < 8; e++)
-                  n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
-              } else {
-                for (i = 1, e = 0; e < c; e++)
-                  n = n << 1 | i, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = 0;
-                for (i = u.charCodeAt(0), e = 0; e < 16; e++)
-                  n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
-              }
-              h--, h == 0 && (h = Math.pow(2, c), c++), delete v[u];
-            } else
-              for (i = p[u], e = 0; e < c; e++)
-                n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
-            h--, h == 0 && (h = Math.pow(2, c), c++), p[_] = a++, u = String(w);
-          }
-        if (u !== "") {
-          if (Object.prototype.hasOwnProperty.call(v, u)) {
-            if (u.charCodeAt(0) < 256) {
-              for (e = 0; e < c; e++)
-                n = n << 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++;
-              for (i = u.charCodeAt(0), e = 0; e < 8; e++)
-                n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
-            } else {
-              for (i = 1, e = 0; e < c; e++)
-                n = n << 1 | i, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = 0;
-              for (i = u.charCodeAt(0), e = 0; e < 16; e++)
-                n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
-            }
-            h--, h == 0 && (h = Math.pow(2, c), c++), delete v[u];
-          } else
-            for (i = p[u], e = 0; e < c; e++)
-              n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
-          h--, h == 0 && (h = Math.pow(2, c), c++);
-        }
-        for (i = 2, e = 0; e < c; e++)
-          n = n << 1 | i & 1, f == r - 1 ? (f = 0, l.push(s(n)), n = 0) : f++, i = i >> 1;
-        for (; ; )
-          if (n = n << 1, f == r - 1) {
-            l.push(s(n));
-            break;
-          } else f++;
-        return l.join("");
-      },
-      decompress: function(o) {
-        return o == null ? "" : o == "" ? null : d._decompress(o.length, 32768, function(r) {
-          return o.charCodeAt(r);
-        });
-      },
-      _decompress: function(o, r, s) {
-        var e = [], i = 4, p = 4, v = 3, w = "", _ = [], u, h, a, c, l, n, f, t = { val: s(0), position: r, index: 1 };
-        for (u = 0; u < 3; u += 1)
-          e[u] = u;
-        for (a = 0, l = Math.pow(2, 2), n = 1; n != l; )
-          c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
-        switch (a) {
-          case 0:
-            for (a = 0, l = Math.pow(2, 8), n = 1; n != l; )
-              c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
-            f = A(a);
-            break;
-          case 1:
-            for (a = 0, l = Math.pow(2, 16), n = 1; n != l; )
-              c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
-            f = A(a);
-            break;
-          case 2:
-            return "";
-        }
-        for (e[3] = f, h = f, _.push(f); ; ) {
-          if (t.index > o)
-            return "";
-          for (a = 0, l = Math.pow(2, v), n = 1; n != l; )
-            c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
-          switch (f = a) {
-            case 0:
-              for (a = 0, l = Math.pow(2, 8), n = 1; n != l; )
-                c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
-              e[p++] = A(a), f = p - 1, i--;
-              break;
-            case 1:
-              for (a = 0, l = Math.pow(2, 16), n = 1; n != l; )
-                c = t.val & t.position, t.position >>= 1, t.position == 0 && (t.position = r, t.val = s(t.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
-              e[p++] = A(a), f = p - 1, i--;
-              break;
-            case 2:
-              return _.join("");
-          }
-          if (i == 0 && (i = Math.pow(2, v), v++), e[f])
-            w = e[f];
-          else if (f === p)
-            w = h + h.charAt(0);
-          else
-            return null;
-          _.push(w), e[p++] = h + w.charAt(0), i--, h = w, i == 0 && (i = Math.pow(2, v), v++);
-        }
-      }
-    };
-    return d;
-  }();
-  x != null ? x.exports = m : typeof angular < "u" && angular != null && angular.module("LZString", []).factory("LZString", function() {
-    return m;
-  });
-})(j);
-var U = j.exports;
-const B = /* @__PURE__ */ O(U);
+  };
+}
 export {
-  B as default
+  $ as useGridListSelectionCheckbox
 };

package/dist/index.es31.js

@@ -1,6 +1,6 @@
-import { j as m } from "./index.es101.js";
+import { j as m } from "./index.es104.js";
 import { forwardRef as o } from "react";
-import { cn as t } from "./index.es90.js";
+import { cn as t } from "./index.es91.js";
 const c = o(
   ({ src: e, ...r }, a) => /* @__PURE__ */ m.jsx(
     "div",