@boxcustodia/library 1.6.2 → 1.7.0

package/dist/index.es337.js

@@ -1,423 +1,202 @@
-import { isElementVisible as V } from "./index.es503.js";
-import { createShadowTreeWalker as B } from "./index.es465.js";
-import { getActiveElement as T, getEventTarget as S } from "./index.es466.js";
-import { getOwnerDocument as N } from "./index.es468.js";
-import { useLayoutEffect as E } from "./index.es408.js";
-import { isAndroid as H, isChrome as J } from "./index.es471.js";
-import { isTabbable as U, isFocusable as j } from "./index.es488.js";
-import { getInteractionModality as G } from "./index.es491.js";
-import { focusSafely as Q } from "./index.es502.js";
-import L, { useRef as F, useContext as X, useMemo as k, useEffect as z } from "react";
-const I = /* @__PURE__ */ L.createContext(null), M = "react-aria-focus-scope-restore";
-let s = null;
-function ve(e) {
-  let { children: t, contain: r, restoreFocus: a, autoFocus: n } = e, i = F(null), u = F(null), o = F([]), { parentNode: b } = X(I) || {}, l = k(() => new A({
-    scopeRef: o
-  }), [
-    o
-  ]);
-  E(() => {
-    let c = b || $.root;
-    if ($.getTreeNode(c.scopeRef) && s && !R(s, c.scopeRef)) {
-      let f = $.getTreeNode(s);
-      f && (c = f);
-    }
-    c.addChild(l), $.addNode(l);
-  }, [
-    l,
-    b
-  ]), E(() => {
-    let c = $.getTreeNode(o);
-    c && (c.contain = !!r);
-  }, [
-    r
-  ]), E(() => {
-    var c;
-    let f = (c = i.current) === null || c === void 0 ? void 0 : c.nextSibling, p = [], y = (C) => C.stopPropagation();
-    for (; f && f !== u.current; )
-      p.push(f), f.addEventListener(M, y), f = f.nextSibling;
-    return o.current = p, () => {
-      for (let C of p) C.removeEventListener(M, y);
-    };
-  }, [
-    t
-  ]), te(o, a, r), Z(o, r), re(o, a, r), ee(o, n), z(() => {
-    const c = T(N(o.current ? o.current[0] : void 0));
-    let f = null;
-    if (m(c, o.current)) {
-      for (let p of $.traverse()) p.scopeRef && m(c, p.scopeRef.current) && (f = p);
-      f === $.getTreeNode(o) && (s = f.scopeRef);
-    }
-  }, [
-    o
-  ]), E(() => () => {
-    var c, f, p;
-    let y = (p = (f = $.getTreeNode(o)) === null || f === void 0 || (c = f.parent) === null || c === void 0 ? void 0 : c.scopeRef) !== null && p !== void 0 ? p : null;
-    (o === s || R(o, s)) && (!y || $.getTreeNode(y)) && (s = y), $.removeTreeNode(o);
-  }, [
-    o
-  ]);
-  let v = k(() => Y(o), []), d = k(() => ({
-    focusManager: v,
-    parentNode: l
-  }), [
-    l,
-    v
-  ]);
-  return /* @__PURE__ */ L.createElement(I.Provider, {
-    value: d
-  }, /* @__PURE__ */ L.createElement("span", {
-    "data-focus-scope-start": !0,
-    hidden: !0,
-    ref: i
-  }), t, /* @__PURE__ */ L.createElement("span", {
-    "data-focus-scope-end": !0,
-    hidden: !0,
-    ref: u
-  }));
-}
-function Y(e) {
-  return {
-    focusNext(t = {}) {
-      let r = e.current, { from: a, tabbable: n, wrap: i, accept: u } = t;
-      var o;
-      let b = a || T(N((o = r[0]) !== null && o !== void 0 ? o : void 0)), l = r[0].previousElementSibling, v = w(r), d = g(v, {
-        tabbable: n,
-        accept: u
-      }, r);
-      d.currentNode = m(b, r) ? b : l;
-      let c = d.nextNode();
-      return !c && i && (d.currentNode = l, c = d.nextNode()), c && h(c, !0), c;
-    },
-    focusPrevious(t = {}) {
-      let r = e.current, { from: a, tabbable: n, wrap: i, accept: u } = t;
-      var o;
-      let b = a || T(N((o = r[0]) !== null && o !== void 0 ? o : void 0)), l = r[r.length - 1].nextElementSibling, v = w(r), d = g(v, {
-        tabbable: n,
-        accept: u
-      }, r);
-      d.currentNode = m(b, r) ? b : l;
-      let c = d.previousNode();
-      return !c && i && (d.currentNode = l, c = d.previousNode()), c && h(c, !0), c;
-    },
-    focusFirst(t = {}) {
-      let r = e.current, { tabbable: a, accept: n } = t, i = w(r), u = g(i, {
-        tabbable: a,
-        accept: n
-      }, r);
-      u.currentNode = r[0].previousElementSibling;
-      let o = u.nextNode();
-      return o && h(o, !0), o;
-    },
-    focusLast(t = {}) {
-      let r = e.current, { tabbable: a, accept: n } = t, i = w(r), u = g(i, {
-        tabbable: a,
-        accept: n
-      }, r);
-      u.currentNode = r[r.length - 1].nextElementSibling;
-      let o = u.previousNode();
-      return o && h(o, !0), o;
-    }
-  };
-}
-function w(e) {
-  return e[0].parentElement;
-}
-function _(e) {
-  let t = $.getTreeNode(s);
-  for (; t && t.scopeRef !== e; ) {
-    if (t.contain) return !1;
-    t = t.parent;
-  }
-  return !0;
-}
-function Z(e, t) {
-  let r = F(void 0), a = F(void 0);
-  E(() => {
-    let n = e.current;
-    if (!t) {
-      a.current && (cancelAnimationFrame(a.current), a.current = void 0);
-      return;
-    }
-    const i = N(n ? n[0] : void 0);
-    let u = (l) => {
-      if (l.key !== "Tab" || l.altKey || l.ctrlKey || l.metaKey || !_(e) || l.isComposing) return;
-      let v = T(i), d = e.current;
-      if (!d || !m(v, d)) return;
-      let c = w(d), f = g(c, {
-        tabbable: !0
-      }, d);
-      if (!v) return;
-      f.currentNode = v;
-      let p = l.shiftKey ? f.previousNode() : f.nextNode();
-      p || (f.currentNode = l.shiftKey ? d[d.length - 1].nextElementSibling : d[0].previousElementSibling, p = l.shiftKey ? f.previousNode() : f.nextNode()), l.preventDefault(), p && h(p, !0);
-    }, o = (l) => {
-      (!s || R(s, e)) && m(S(l), e.current) ? (s = e, r.current = S(l)) : _(e) && !x(S(l), e) ? r.current ? r.current.focus() : s && s.current && K(s.current) : _(e) && (r.current = S(l));
-    }, b = (l) => {
-      a.current && cancelAnimationFrame(a.current), a.current = requestAnimationFrame(() => {
-        let v = G(), d = (v === "virtual" || v === null) && H() && J(), c = T(i);
-        if (!d && c && _(e) && !x(c, e)) {
-          s = e;
-          let p = S(l);
-          if (p && p.isConnected) {
-            var f;
-            r.current = p, (f = r.current) === null || f === void 0 || f.focus();
-          } else s.current && K(s.current);
+import { __module as x } from "./index.es338.js";
+var U;
+function k() {
+  return U ? x.exports : (U = 1, function(S) {
+    var m = function() {
+      var A = String.fromCharCode, M = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=", g = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+-$", y = {};
+      function O(o, r) {
+        if (!y[o]) {
+          y[o] = {};
+          for (var s = 0; s < o.length; s++)
+            y[o][o.charAt(s)] = s;
         }
-      });
-    };
-    return i.addEventListener("keydown", u, !1), i.addEventListener("focusin", o, !1), n == null || n.forEach((l) => l.addEventListener("focusin", o, !1)), n == null || n.forEach((l) => l.addEventListener("focusout", b, !1)), () => {
-      i.removeEventListener("keydown", u, !1), i.removeEventListener("focusin", o, !1), n == null || n.forEach((l) => l.removeEventListener("focusin", o, !1)), n == null || n.forEach((l) => l.removeEventListener("focusout", b, !1));
-    };
-  }, [
-    e,
-    t
-  ]), E(() => () => {
-    a.current && cancelAnimationFrame(a.current);
-  }, [
-    a
-  ]);
-}
-function W(e) {
-  return x(e);
-}
-function m(e, t) {
-  return !e || !t ? !1 : t.some((r) => r.contains(e));
-}
-function x(e, t = null) {
-  if (e instanceof Element && e.closest("[data-react-aria-top-layer]")) return !0;
-  for (let { scopeRef: r } of $.traverse($.getTreeNode(t)))
-    if (r && m(e, r.current)) return !0;
-  return !1;
-}
-function R(e, t) {
-  var r;
-  let a = (r = $.getTreeNode(t)) === null || r === void 0 ? void 0 : r.parent;
-  for (; a; ) {
-    if (a.scopeRef === e) return !0;
-    a = a.parent;
-  }
-  return !1;
-}
-function h(e, t = !1) {
-  if (e != null && !t) try {
-    Q(e);
-  } catch {
-  }
-  else if (e != null) try {
-    e.focus();
-  } catch {
-  }
-}
-function q(e, t = !0) {
-  let r = e[0].previousElementSibling, a = w(e), n = g(a, {
-    tabbable: t
-  }, e);
-  n.currentNode = r;
-  let i = n.nextNode();
-  return t && !i && (a = w(e), n = g(a, {
-    tabbable: !1
-  }, e), n.currentNode = r, i = n.nextNode()), i;
-}
-function K(e, t = !0) {
-  h(q(e, t));
-}
-function ee(e, t) {
-  const r = L.useRef(t);
-  z(() => {
-    if (r.current) {
-      s = e;
-      const a = N(e.current ? e.current[0] : void 0);
-      !m(T(a), s.current) && e.current && K(e.current);
-    }
-    r.current = !1;
-  }, [
-    e
-  ]);
-}
-function te(e, t, r) {
-  E(() => {
-    if (t || r) return;
-    let a = e.current;
-    const n = N(a ? a[0] : void 0);
-    let i = (u) => {
-      let o = S(u);
-      m(o, e.current) ? s = e : W(o) || (s = null);
-    };
-    return n.addEventListener("focusin", i, !1), a == null || a.forEach((u) => u.addEventListener("focusin", i, !1)), () => {
-      n.removeEventListener("focusin", i, !1), a == null || a.forEach((u) => u.removeEventListener("focusin", i, !1));
-    };
-  }, [
-    e,
-    t,
-    r
-  ]);
-}
-function P(e) {
-  let t = $.getTreeNode(s);
-  for (; t && t.scopeRef !== e; ) {
-    if (t.nodeToRestore) return !1;
-    t = t.parent;
-  }
-  return (t == null ? void 0 : t.scopeRef) === e;
-}
-function re(e, t, r) {
-  const a = F(typeof document < "u" ? T(N(e.current ? e.current[0] : void 0)) : null);
-  E(() => {
-    let n = e.current;
-    const i = N(n ? n[0] : void 0);
-    if (!t || r) return;
-    let u = () => {
-      (!s || R(s, e)) && m(T(i), e.current) && (s = e);
-    };
-    return i.addEventListener("focusin", u, !1), n == null || n.forEach((o) => o.addEventListener("focusin", u, !1)), () => {
-      i.removeEventListener("focusin", u, !1), n == null || n.forEach((o) => o.removeEventListener("focusin", u, !1));
-    };
-  }, [
-    e,
-    r
-  ]), E(() => {
-    const n = N(e.current ? e.current[0] : void 0);
-    if (!t) return;
-    let i = (u) => {
-      if (u.key !== "Tab" || u.altKey || u.ctrlKey || u.metaKey || !_(e) || u.isComposing) return;
-      let o = n.activeElement;
-      if (!x(o, e) || !P(e)) return;
-      let b = $.getTreeNode(e);
-      if (!b) return;
-      let l = b.nodeToRestore, v = g(n.body, {
-        tabbable: !0
-      });
-      v.currentNode = o;
-      let d = u.shiftKey ? v.previousNode() : v.nextNode();
-      if ((!l || !l.isConnected || l === n.body) && (l = void 0, b.nodeToRestore = void 0), (!d || !x(d, e)) && l) {
-        v.currentNode = l;
-        do
-          d = u.shiftKey ? v.previousNode() : v.nextNode();
-        while (x(d, e));
-        u.preventDefault(), u.stopPropagation(), d ? h(d, !0) : W(l) ? h(l, !0) : o.blur();
+        return y[o][r];
       }
-    };
-    return r || n.addEventListener("keydown", i, !0), () => {
-      r || n.removeEventListener("keydown", i, !0);
-    };
-  }, [
-    e,
-    t,
-    r
-  ]), E(() => {
-    const n = N(e.current ? e.current[0] : void 0);
-    if (!t) return;
-    let i = $.getTreeNode(e);
-    if (i) {
-      var u;
-      return i.nodeToRestore = (u = a.current) !== null && u !== void 0 ? u : void 0, () => {
-        let o = $.getTreeNode(e);
-        if (!o) return;
-        let b = o.nodeToRestore, l = T(n);
-        if (t && b && (l && x(l, e) || l === n.body && P(e))) {
-          let v = $.clone();
-          requestAnimationFrame(() => {
-            if (n.activeElement === n.body) {
-              let d = v.getTreeNode(e);
-              for (; d; ) {
-                if (d.nodeToRestore && d.nodeToRestore.isConnected) {
-                  O(d.nodeToRestore);
-                  return;
-                }
-                d = d.parent;
-              }
-              for (d = v.getTreeNode(e); d; ) {
-                if (d.scopeRef && d.scopeRef.current && $.getTreeNode(d.scopeRef)) {
-                  let c = q(d.scopeRef.current, !0);
-                  O(c);
-                  return;
+      var d = {
+        compressToBase64: function(o) {
+          if (o == null) return "";
+          var r = d._compress(o, 6, function(s) {
+            return M.charAt(s);
+          });
+          switch (r.length % 4) {
+            // To produce valid Base64
+            default:
+            // When could this happen ?
+            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 O(M, 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, t = r.length; e < t; 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 t = [];
+          return r.forEach(function(p) {
+            t.push(A(p));
+          }), d.decompress(t.join(""));
+        },
+        //compress into a string that is already URI encoded
+        compressToEncodedURIComponent: function(o) {
+          return o == null ? "" : d._compress(o, 6, function(r) {
+            return g.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 O(g, 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, t, p = {}, v = {}, w = "", _ = "", l = "", h = 2, a = 3, c = 2, u = [], n = 0, f = 0, i;
+          for (i = 0; i < o.length; i += 1)
+            if (w = o.charAt(i), Object.prototype.hasOwnProperty.call(p, w) || (p[w] = a++, v[w] = !0), _ = l + w, Object.prototype.hasOwnProperty.call(p, _))
+              l = _;
+            else {
+              if (Object.prototype.hasOwnProperty.call(v, l)) {
+                if (l.charCodeAt(0) < 256) {
+                  for (e = 0; e < c; e++)
+                    n = n << 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++;
+                  for (t = l.charCodeAt(0), e = 0; e < 8; e++)
+                    n = n << 1 | t & 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = t >> 1;
+                } else {
+                  for (t = 1, e = 0; e < c; e++)
+                    n = n << 1 | t, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = 0;
+                  for (t = l.charCodeAt(0), e = 0; e < 16; e++)
+                    n = n << 1 | t & 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = t >> 1;
                 }
-                d = d.parent;
-              }
+                h--, h == 0 && (h = Math.pow(2, c), c++), delete v[l];
+              } else
+                for (t = p[l], e = 0; e < c; e++)
+                  n = n << 1 | t & 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = t >> 1;
+              h--, h == 0 && (h = Math.pow(2, c), c++), p[_] = a++, l = String(w);
             }
+          if (l !== "") {
+            if (Object.prototype.hasOwnProperty.call(v, l)) {
+              if (l.charCodeAt(0) < 256) {
+                for (e = 0; e < c; e++)
+                  n = n << 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++;
+                for (t = l.charCodeAt(0), e = 0; e < 8; e++)
+                  n = n << 1 | t & 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = t >> 1;
+              } else {
+                for (t = 1, e = 0; e < c; e++)
+                  n = n << 1 | t, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = 0;
+                for (t = l.charCodeAt(0), e = 0; e < 16; e++)
+                  n = n << 1 | t & 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = t >> 1;
+              }
+              h--, h == 0 && (h = Math.pow(2, c), c++), delete v[l];
+            } else
+              for (t = p[l], e = 0; e < c; e++)
+                n = n << 1 | t & 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = t >> 1;
+            h--, h == 0 && (h = Math.pow(2, c), c++);
+          }
+          for (t = 2, e = 0; e < c; e++)
+            n = n << 1 | t & 1, f == r - 1 ? (f = 0, u.push(s(n)), n = 0) : f++, t = t >> 1;
+          for (; ; )
+            if (n = n << 1, f == r - 1) {
+              u.push(s(n));
+              break;
+            } else f++;
+          return u.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 = [], t = 4, p = 4, v = 3, w = "", _ = [], l, h, a, c, u, n, f, i = { val: s(0), position: r, index: 1 };
+          for (l = 0; l < 3; l += 1)
+            e[l] = l;
+          for (a = 0, u = Math.pow(2, 2), n = 1; n != u; )
+            c = i.val & i.position, i.position >>= 1, i.position == 0 && (i.position = r, i.val = s(i.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+          switch (a) {
+            case 0:
+              for (a = 0, u = Math.pow(2, 8), n = 1; n != u; )
+                c = i.val & i.position, i.position >>= 1, i.position == 0 && (i.position = r, i.val = s(i.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+              f = A(a);
+              break;
+            case 1:
+              for (a = 0, u = Math.pow(2, 16), n = 1; n != u; )
+                c = i.val & i.position, i.position >>= 1, i.position == 0 && (i.position = r, i.val = s(i.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 (i.index > o)
+              return "";
+            for (a = 0, u = Math.pow(2, v), n = 1; n != u; )
+              c = i.val & i.position, i.position >>= 1, i.position == 0 && (i.position = r, i.val = s(i.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+            switch (f = a) {
+              case 0:
+                for (a = 0, u = Math.pow(2, 8), n = 1; n != u; )
+                  c = i.val & i.position, i.position >>= 1, i.position == 0 && (i.position = r, i.val = s(i.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+                e[p++] = A(a), f = p - 1, t--;
+                break;
+              case 1:
+                for (a = 0, u = Math.pow(2, 16), n = 1; n != u; )
+                  c = i.val & i.position, i.position >>= 1, i.position == 0 && (i.position = r, i.val = s(i.index++)), a |= (c > 0 ? 1 : 0) * n, n <<= 1;
+                e[p++] = A(a), f = p - 1, t--;
+                break;
+              case 2:
+                return _.join("");
+            }
+            if (t == 0 && (t = 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), t--, h = w, t == 0 && (t = Math.pow(2, v), v++);
+          }
         }
       };
-    }
-  }, [
-    e,
-    t
-  ]);
-}
-function O(e) {
-  e.dispatchEvent(new CustomEvent(M, {
-    bubbles: !0,
-    cancelable: !0
-  })) && h(e);
-}
-function g(e, t, r) {
-  let a = t != null && t.tabbable ? U : j, n = (e == null ? void 0 : e.nodeType) === Node.ELEMENT_NODE ? e : null, i = N(n), u = B(i, e || i, NodeFilter.SHOW_ELEMENT, {
-    acceptNode(o) {
-      var b;
-      return !(t == null || (b = t.from) === null || b === void 0) && b.contains(o) ? NodeFilter.FILTER_REJECT : a(o) && V(o) && (!r || m(o, r)) && (!(t != null && t.accept) || t.accept(o)) ? NodeFilter.FILTER_ACCEPT : NodeFilter.FILTER_SKIP;
-    }
-  });
-  return t != null && t.from && (u.currentNode = t.from), u;
-}
-class D {
-  get size() {
-    return this.fastMap.size;
-  }
-  getTreeNode(t) {
-    return this.fastMap.get(t);
-  }
-  addTreeNode(t, r, a) {
-    let n = this.fastMap.get(r ?? null);
-    if (!n) return;
-    let i = new A({
-      scopeRef: t
+      return d;
+    }();
+    S != null ? S.exports = m : typeof angular < "u" && angular != null && angular.module("LZString", []).factory("LZString", function() {
+      return m;
     });
-    n.addChild(i), i.parent = n, this.fastMap.set(t, i), a && (i.nodeToRestore = a);
-  }
-  addNode(t) {
-    this.fastMap.set(t.scopeRef, t);
-  }
-  removeTreeNode(t) {
-    if (t === null) return;
-    let r = this.fastMap.get(t);
-    if (!r) return;
-    let a = r.parent;
-    for (let i of this.traverse()) i !== r && r.nodeToRestore && i.nodeToRestore && r.scopeRef && r.scopeRef.current && m(i.nodeToRestore, r.scopeRef.current) && (i.nodeToRestore = r.nodeToRestore);
-    let n = r.children;
-    a && (a.removeChild(r), n.size > 0 && n.forEach((i) => a && a.addChild(i))), this.fastMap.delete(r.scopeRef);
-  }
-  // Pre Order Depth First
-  *traverse(t = this.root) {
-    if (t.scopeRef != null && (yield t), t.children.size > 0) for (let r of t.children) yield* this.traverse(r);
-  }
-  clone() {
-    var t;
-    let r = new D();
-    var a;
-    for (let n of this.traverse()) r.addTreeNode(n.scopeRef, (a = (t = n.parent) === null || t === void 0 ? void 0 : t.scopeRef) !== null && a !== void 0 ? a : null, n.nodeToRestore);
-    return r;
-  }
-  constructor() {
-    this.fastMap = /* @__PURE__ */ new Map(), this.root = new A({
-      scopeRef: null
-    }), this.fastMap.set(null, this.root);
-  }
-}
-class A {
-  addChild(t) {
-    this.children.add(t), t.parent = this;
-  }
-  removeChild(t) {
-    this.children.delete(t), t.parent = void 0;
-  }
-  constructor(t) {
-    this.children = /* @__PURE__ */ new Set(), this.contain = !1, this.scopeRef = t.scopeRef;
-  }
+  }(x), x.exports);
 }
-let $ = new D();
 export {
-  ve as FocusScope,
-  $ as focusScopeTree,
-  g as getFocusableTreeWalker
+  k as __require
 };

package/dist/index.es338.js

@@ -1,15 +1,4 @@
-import { getRowId as r } from "./index.es516.js";
-import { useGridSelectionCheckbox as a } from "./index.es522.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 r = { exports: {} };
 export {
-  $ as useGridListSelectionCheckbox
+  r as __module
 };

package/dist/index.es339.js

@@ -1,37 +1,14 @@
-import { TreeCollection as c } from "./index.es531.js";
-import { useMultipleSelectionState as f } from "./index.es459.js";
-import { SelectionManager as i } from "./index.es461.js";
-import { useMemo as r, useCallback as u, useEffect as $ } from "react";
-import { useCollection as K } from "./index.es529.js";
-import { useControlledState as x } from "./index.es334.js";
-function C(e) {
-  let { onExpandedChange: a } = e, [t, o] = x(e.expandedKeys ? new Set(e.expandedKeys) : void 0, e.defaultExpandedKeys ? new Set(e.defaultExpandedKeys) : /* @__PURE__ */ new Set(), a), d = f(e), s = r(() => e.disabledKeys ? new Set(e.disabledKeys) : /* @__PURE__ */ new Set(), [
-    e.disabledKeys
-  ]), n = K(e, u((l) => new c(l, {
-    expandedKeys: t
-  }), [
-    t
-  ]), null);
-  return $(() => {
-    d.focusedKey != null && !n.getItem(d.focusedKey) && d.setFocusedKey(null);
-  }, [
-    n,
-    d.focusedKey
-  ]), {
-    collection: n,
-    expandedKeys: t,
-    disabledKeys: s,
-    toggleKey: (l) => {
-      o(y(t, l));
-    },
-    setExpandedKeys: o,
-    selectionManager: new i(n, d)
-  };
-}
-function y(e, a) {
-  let t = new Set(e);
-  return t.has(a) ? t.delete(a) : t.add(a), t;
-}
+const S = (s) => {
+  let t;
+  const o = /* @__PURE__ */ new Set(), c = (e, r) => {
+    const n = typeof e == "function" ? e(t) : e;
+    if (!Object.is(n, t)) {
+      const b = t;
+      t = r ?? (typeof n != "object" || n === null) ? n : Object.assign({}, t, n), o.forEach((l) => l(t, b));
+    }
+  }, i = () => t, a = { setState: c, getState: i, getInitialState: () => u, subscribe: (e) => (o.add(e), () => o.delete(e)) }, u = t = s(c, i, a);
+  return a;
+}, d = (s) => s ? S(s) : S;
 export {
-  C as useTreeState
+  d as createStore
 };