@boxcustodia/library 1.7.3 → 1.7.4

package/dist/index.es392.js

@@ -1,202 +1,50 @@
-import { __module as x } from "./index.es393.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 y[o][r];
-      }
-      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;
-                }
-                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++);
-          }
-        }
-      };
-      return d;
-    }();
-    S != null ? S.exports = m : typeof angular < "u" && angular != null && angular.module("LZString", []).factory("LZString", function() {
-      return m;
-    });
-  }(x), x.exports);
+import a, { useState as f, useContext as d, useRef as l } from "react";
+const c = {
+  prefix: String(Math.round(Math.random() * 1e10)),
+  current: 0
+}, $ = /* @__PURE__ */ a.createContext(c), p = /* @__PURE__ */ a.createContext(!1);
+let v = !!(typeof window < "u" && window.document && window.document.createElement), s = /* @__PURE__ */ new WeakMap();
+function S(t = !1) {
+  let e = d($), r = l(null);
+  if (r.current === null && !t) {
+    var n, u;
+    let o = (u = a.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED) === null || u === void 0 || (n = u.ReactCurrentOwner) === null || n === void 0 ? void 0 : n.current;
+    if (o) {
+      let i = s.get(o);
+      i == null ? s.set(o, {
+        id: e.current,
+        state: o.memoizedState
+      }) : o.memoizedState !== i.state && (e.current = i.id, s.delete(o));
+    }
+    r.current = ++e.current;
+  }
+  return r.current;
+}
+function b(t) {
+  let e = d($);
+  e === c && !v && process.env.NODE_ENV !== "production" && console.warn("When server rendering, you must wrap your application in an <SSRProvider> to ensure consistent ids are generated between the client and server.");
+  let r = S(!!t), n = e === c && process.env.NODE_ENV === "test" ? "react-aria" : `react-aria${e.prefix}`;
+  return t || `${n}-${r}`;
+}
+function x(t) {
+  let e = a.useId(), [r] = f(y()), n = r || process.env.NODE_ENV === "test" ? "react-aria" : `react-aria${c.prefix}`;
+  return t || `${n}-${e}`;
+}
+const C = typeof a.useId == "function" ? x : b;
+function m() {
+  return !1;
+}
+function w() {
+  return !0;
+}
+function g(t) {
+  return () => {
+  };
+}
+function y() {
+  return typeof a.useSyncExternalStore == "function" ? a.useSyncExternalStore(g, m, w) : d(p);
 }
 export {
-  k as __require
+  y as useIsSSR,
+  C as useSSRSafeId
 };

package/dist/index.es393.js

@@ -1,4 +1,6 @@
-var r = { exports: {} };
+import e from "react";
+const f = typeof document < "u" ? e.useLayoutEffect : () => {
+};
 export {
-  r as __module
+  f as useLayoutEffect
 };

package/dist/index.es394.js

@@ -1,133 +1,5 @@
-class a {
-  get childNodes() {
-    throw new Error("childNodes is not supported");
-  }
-  clone() {
-    let t = new a(this.type, this.key);
-    return t.value = this.value, t.level = this.level, t.hasChildNodes = this.hasChildNodes, t.rendered = this.rendered, t.textValue = this.textValue, t["aria-label"] = this["aria-label"], t.index = this.index, t.parentKey = this.parentKey, t.prevKey = this.prevKey, t.nextKey = this.nextKey, t.firstChildKey = this.firstChildKey, t.lastChildKey = this.lastChildKey, t.props = this.props, t.render = this.render, t.colSpan = this.colSpan, t.colIndex = this.colIndex, t;
-  }
-  constructor(t, e) {
-    this.value = null, this.level = 0, this.hasChildNodes = !1, this.rendered = null, this.textValue = "", this["aria-label"] = void 0, this.index = 0, this.parentKey = null, this.prevKey = null, this.nextKey = null, this.firstChildKey = null, this.lastChildKey = null, this.props = {}, this.colSpan = null, this.colIndex = null, this.type = t, this.key = e;
-  }
-}
-class d {
-  get size() {
-    return this.keyMap.size;
-  }
-  getKeys() {
-    return this.keyMap.keys();
-  }
-  *[Symbol.iterator]() {
-    let t = this.firstKey != null ? this.keyMap.get(this.firstKey) : void 0;
-    for (; t; )
-      yield t, t = t.nextKey != null ? this.keyMap.get(t.nextKey) : void 0;
-  }
-  getChildren(t) {
-    let e = this.keyMap;
-    return {
-      *[Symbol.iterator]() {
-        let l = e.get(t), n = (l == null ? void 0 : l.firstChildKey) != null ? e.get(l.firstChildKey) : null;
-        for (; n; )
-          yield n, n = n.nextKey != null ? e.get(n.nextKey) : void 0;
-      }
-    };
-  }
-  getKeyBefore(t) {
-    let e = this.keyMap.get(t);
-    if (!e) return null;
-    if (e.prevKey != null) {
-      for (e = this.keyMap.get(e.prevKey); e && e.type !== "item" && e.lastChildKey != null; ) e = this.keyMap.get(e.lastChildKey);
-      var l;
-      return (l = e == null ? void 0 : e.key) !== null && l !== void 0 ? l : null;
-    }
-    return e.parentKey;
-  }
-  getKeyAfter(t) {
-    let e = this.keyMap.get(t);
-    if (!e) return null;
-    if (e.type !== "item" && e.firstChildKey != null) return e.firstChildKey;
-    for (; e; ) {
-      if (e.nextKey != null) return e.nextKey;
-      if (e.parentKey != null) e = this.keyMap.get(e.parentKey);
-      else return null;
-    }
-    return null;
-  }
-  getFirstKey() {
-    return this.firstKey;
-  }
-  getLastKey() {
-    let t = this.lastKey != null ? this.keyMap.get(this.lastKey) : null;
-    for (; (t == null ? void 0 : t.lastChildKey) != null; ) t = this.keyMap.get(t.lastChildKey);
-    var e;
-    return (e = t == null ? void 0 : t.key) !== null && e !== void 0 ? e : null;
-  }
-  getItem(t) {
-    var e;
-    return (e = this.keyMap.get(t)) !== null && e !== void 0 ? e : null;
-  }
-  at() {
-    throw new Error("Not implemented");
-  }
-  clone() {
-    let t = this.constructor, e = new t();
-    return e.keyMap = new Map(this.keyMap), e.firstKey = this.firstKey, e.lastKey = this.lastKey, e;
-  }
-  addNode(t) {
-    if (this.frozen) throw new Error("Cannot add a node to a frozen collection");
-    this.keyMap.set(t.key, t);
-  }
-  removeNode(t) {
-    if (this.frozen) throw new Error("Cannot remove a node to a frozen collection");
-    this.keyMap.delete(t);
-  }
-  commit(t, e, l = !1) {
-    if (this.frozen) throw new Error("Cannot commit a frozen collection");
-    this.firstKey = t, this.lastKey = e, this.frozen = !l;
-  }
-  // TODO: this is pretty specific to menu, will need to check if it is generic enough
-  // Will need to handle varying levels I assume but will revisit after I get searchable menu working for base menu
-  // TODO: an alternative is to simply walk the collection and add all item nodes that match the filter and any sections/separators we encounter
-  // to an array, then walk that new array and fix all the next/Prev keys while adding them to the new collection
-  UNSTABLE_filter(t) {
-    let e = new d(), l = null;
-    for (let n of this)
-      if (n.type === "section" && n.hasChildNodes) {
-        let i = n.clone(), r = null;
-        for (let o of this.getChildren(n.key)) if (h(o, t, this, e)) {
-          let s = o.clone();
-          r == null && (i.firstChildKey = s.key), e.firstKey == null && (e.firstKey = i.key), r && r.parentKey === s.parentKey ? (r.nextKey = s.key, s.prevKey = r.key) : s.prevKey = null, s.nextKey = null, e.addNode(s), r = s;
-        }
-        r && (r.type !== "header" ? (i.lastChildKey = r.key, l == null ? i.prevKey = null : (l.type === "section" || l.type === "separator") && (l.nextKey = i.key, i.prevKey = l.key), i.nextKey = null, l = i, e.addNode(i)) : (e.firstKey === i.key && (e.firstKey = null), e.removeNode(r.key)));
-      } else if (n.type === "separator") {
-        let i = n.clone();
-        i.nextKey = null, (l == null ? void 0 : l.type) === "section" && (l.nextKey = i.key, i.prevKey = l.key, l = i, e.addNode(i));
-      } else {
-        let i = n.clone();
-        h(i, t, this, e) && (e.firstKey == null && (e.firstKey = i.key), l != null && l.type !== "section" && l.type !== "separator" && l.parentKey === i.parentKey ? (l.nextKey = i.key, i.prevKey = l.key) : i.prevKey = null, i.nextKey = null, e.addNode(i), l = i);
-      }
-    if ((l == null ? void 0 : l.type) === "separator" && l.nextKey === null) {
-      let n;
-      l.prevKey != null && (n = e.getItem(l.prevKey), n.nextKey = null), e.removeNode(l.key), l = n;
-    }
-    return e.lastKey = (l == null ? void 0 : l.key) || null, e;
-  }
-  constructor() {
-    this.keyMap = /* @__PURE__ */ new Map(), this.firstKey = null, this.lastKey = null, this.frozen = !1;
-  }
-}
-function h(y, t, e, l) {
-  if (y.type === "subdialogtrigger" || y.type === "submenutrigger") {
-    let n = [
-      ...e.getChildren(y.key)
-    ][0];
-    if (n && t(n.textValue)) {
-      let i = n.clone();
-      return l.addNode(i), !0;
-    } else return !1;
-  } else return y.type === "header" ? !0 : t(y.textValue);
-}
+import { __require as r } from "./index.es519.js";
+var i = r();
 export {
-  d as BaseCollection,
-  a as CollectionNode
+  i as s
 };

package/dist/index.es395.js

@@ -1,219 +1,7 @@
-import { CollectionNode as S } from "./index.es394.js";
-class b {
-  *[Symbol.iterator]() {
-    let i = this.firstChild;
-    for (; i; )
-      yield i, i = i.nextSibling;
-  }
-  get firstChild() {
-    return this._firstChild;
-  }
-  set firstChild(i) {
-    this._firstChild = i, this.ownerDocument.markDirty(this);
-  }
-  get lastChild() {
-    return this._lastChild;
-  }
-  set lastChild(i) {
-    this._lastChild = i, this.ownerDocument.markDirty(this);
-  }
-  get previousSibling() {
-    return this._previousSibling;
-  }
-  set previousSibling(i) {
-    this._previousSibling = i, this.ownerDocument.markDirty(this);
-  }
-  get nextSibling() {
-    return this._nextSibling;
-  }
-  set nextSibling(i) {
-    this._nextSibling = i, this.ownerDocument.markDirty(this);
-  }
-  get parentNode() {
-    return this._parentNode;
-  }
-  set parentNode(i) {
-    this._parentNode = i, this.ownerDocument.markDirty(this);
-  }
-  get isConnected() {
-    var i;
-    return ((i = this.parentNode) === null || i === void 0 ? void 0 : i.isConnected) || !1;
-  }
-  invalidateChildIndices(i) {
-    (this._minInvalidChildIndex == null || i.index < this._minInvalidChildIndex.index) && (this._minInvalidChildIndex = i);
-  }
-  updateChildIndices() {
-    let i = this._minInvalidChildIndex;
-    for (; i; )
-      i.index = i.previousSibling ? i.previousSibling.index + 1 : 0, i = i.nextSibling;
-    this._minInvalidChildIndex = null;
-  }
-  appendChild(i) {
-    i.parentNode && i.parentNode.removeChild(i), this.firstChild == null && (this.firstChild = i), this.lastChild ? (this.lastChild.nextSibling = i, i.index = this.lastChild.index + 1, i.previousSibling = this.lastChild) : (i.previousSibling = null, i.index = 0), i.parentNode = this, i.nextSibling = null, this.lastChild = i, this.ownerDocument.markDirty(this), this.ownerDocument.queueUpdate();
-  }
-  insertBefore(i, t) {
-    if (t == null) return this.appendChild(i);
-    i.parentNode && i.parentNode.removeChild(i), i.nextSibling = t, i.previousSibling = t.previousSibling, i.index = t.index, this.firstChild === t ? this.firstChild = i : t.previousSibling && (t.previousSibling.nextSibling = i), t.previousSibling = i, i.parentNode = t.parentNode, this.invalidateChildIndices(t), this.ownerDocument.queueUpdate();
-  }
-  removeChild(i) {
-    i.parentNode !== this || !this.ownerDocument.isMounted || (i.nextSibling && (this.invalidateChildIndices(i.nextSibling), i.nextSibling.previousSibling = i.previousSibling), i.previousSibling && (i.previousSibling.nextSibling = i.nextSibling), this.firstChild === i && (this.firstChild = i.nextSibling), this.lastChild === i && (this.lastChild = i.previousSibling), i.parentNode = null, i.nextSibling = null, i.previousSibling = null, i.index = 0, this.ownerDocument.markDirty(i), this.ownerDocument.queueUpdate());
-  }
-  addEventListener() {
-  }
-  removeEventListener() {
-  }
-  get previousVisibleSibling() {
-    let i = this.previousSibling;
-    for (; i && i.isHidden; ) i = i.previousSibling;
-    return i;
-  }
-  get nextVisibleSibling() {
-    let i = this.nextSibling;
-    for (; i && i.isHidden; ) i = i.nextSibling;
-    return i;
-  }
-  get firstVisibleChild() {
-    let i = this.firstChild;
-    for (; i && i.isHidden; ) i = i.nextSibling;
-    return i;
-  }
-  get lastVisibleChild() {
-    let i = this.lastChild;
-    for (; i && i.isHidden; ) i = i.previousSibling;
-    return i;
-  }
-  constructor(i) {
-    this._firstChild = null, this._lastChild = null, this._previousSibling = null, this._nextSibling = null, this._parentNode = null, this._minInvalidChildIndex = null, this.ownerDocument = i;
-  }
-}
-class h extends b {
-  get index() {
-    return this._index;
-  }
-  set index(i) {
-    this._index = i, this.ownerDocument.markDirty(this);
-  }
-  get level() {
-    return this.parentNode instanceof h ? this.parentNode.level + (this.node.type === "item" ? 1 : 0) : 0;
-  }
-  /**
-  * Lazily gets a mutable instance of a Node. If the node has already
-  * been cloned during this update cycle, it just returns the existing one.
-  */
-  getMutableNode() {
-    return this.isMutated || (this.node = this.node.clone(), this.isMutated = !0), this.ownerDocument.markDirty(this), this.node;
-  }
-  updateNode() {
-    var i, t, n;
-    let s = this.nextVisibleSibling, e = this.getMutableNode();
-    e.index = this.index, e.level = this.level, e.parentKey = this.parentNode instanceof h ? this.parentNode.node.key : null;
-    var o;
-    e.prevKey = (o = (i = this.previousVisibleSibling) === null || i === void 0 ? void 0 : i.node.key) !== null && o !== void 0 ? o : null;
-    var r;
-    e.nextKey = (r = s == null ? void 0 : s.node.key) !== null && r !== void 0 ? r : null, e.hasChildNodes = !!this.firstChild;
-    var d;
-    e.firstChildKey = (d = (t = this.firstVisibleChild) === null || t === void 0 ? void 0 : t.node.key) !== null && d !== void 0 ? d : null;
-    var l;
-    if (e.lastChildKey = (l = (n = this.lastVisibleChild) === null || n === void 0 ? void 0 : n.node.key) !== null && l !== void 0 ? l : null, (e.colSpan != null || e.colIndex != null) && s) {
-      var u, a;
-      let p = ((u = e.colIndex) !== null && u !== void 0 ? u : e.index) + ((a = e.colSpan) !== null && a !== void 0 ? a : 1);
-      if (p !== s.node.colIndex) {
-        let g = s.getMutableNode();
-        g.colIndex = p;
-      }
-    }
-  }
-  setProps(i, t, n, s) {
-    let e = this.getMutableNode(), { value: o, textValue: r, id: d, ...l } = i;
-    if (l.ref = t, e.props = l, e.rendered = n, e.render = s, e.value = o, e.textValue = r || (typeof l.children == "string" ? l.children : "") || i["aria-label"] || "", d != null && d !== e.key) {
-      if (this.hasSetProps) throw new Error("Cannot change the id of an item");
-      e.key = d;
-    }
-    l.colSpan != null && (e.colSpan = l.colSpan), this.hasSetProps = !0, this.ownerDocument.queueUpdate();
-  }
-  get style() {
-    let i = this;
-    return {
-      get display() {
-        return i.isHidden ? "none" : "";
-      },
-      set display(t) {
-        let n = t === "none";
-        if (i.isHidden !== n) {
-          var s, e;
-          (((s = i.parentNode) === null || s === void 0 ? void 0 : s.firstVisibleChild) === i || ((e = i.parentNode) === null || e === void 0 ? void 0 : e.lastVisibleChild) === i) && i.ownerDocument.markDirty(i.parentNode);
-          let o = i.previousVisibleSibling, r = i.nextVisibleSibling;
-          o && i.ownerDocument.markDirty(o), r && i.ownerDocument.markDirty(r), i.isHidden = n, i.ownerDocument.markDirty(i);
-        }
-      }
-    };
-  }
-  hasAttribute() {
-  }
-  setAttribute() {
-  }
-  setAttributeNS() {
-  }
-  removeAttribute() {
-  }
-  constructor(i, t) {
-    super(t), this.nodeType = 8, this.isMutated = !0, this._index = 0, this.hasSetProps = !1, this.isHidden = !1, this.node = new S(i, `react-aria-${++t.nodeId}`);
-  }
-}
-class C extends b {
-  get isConnected() {
-    return this.isMounted;
-  }
-  createElement(i) {
-    return new h(i, this);
-  }
-  getMutableCollection() {
-    return this.nextCollection || (this.nextCollection = this.collection.clone()), this.nextCollection;
-  }
-  markDirty(i) {
-    this.dirtyNodes.add(i);
-  }
-  addNode(i) {
-    if (i.isHidden) return;
-    let t = this.getMutableCollection();
-    if (!t.getItem(i.node.key)) for (let n of i) this.addNode(n);
-    t.addNode(i.node);
-  }
-  removeNode(i) {
-    for (let n of i) this.removeNode(n);
-    this.getMutableCollection().removeNode(i.node.key);
-  }
-  /** Finalizes the collection update, updating all nodes and freezing the collection. */
-  getCollection() {
-    return this.inSubscription ? this.collection.clone() : (this.queuedRender = !1, this.updateCollection(), this.collection);
-  }
-  updateCollection() {
-    for (let e of this.dirtyNodes) e instanceof h && (!e.isConnected || e.isHidden) ? this.removeNode(e) : e.updateChildIndices();
-    for (let e of this.dirtyNodes) e instanceof h && (e.isConnected && !e.isHidden && (e.updateNode(), this.addNode(e)), e.isMutated = !1);
-    if (this.dirtyNodes.clear(), this.nextCollection) {
-      var i, t, n, s;
-      this.nextCollection.commit((n = (i = this.firstVisibleChild) === null || i === void 0 ? void 0 : i.node.key) !== null && n !== void 0 ? n : null, (s = (t = this.lastVisibleChild) === null || t === void 0 ? void 0 : t.node.key) !== null && s !== void 0 ? s : null, this.isSSR), this.isSSR || (this.collection = this.nextCollection, this.nextCollection = null);
-    }
-  }
-  queueUpdate() {
-    if (!(this.dirtyNodes.size === 0 || this.queuedRender)) {
-      this.queuedRender = !0, this.inSubscription = !0;
-      for (let i of this.subscriptions) i();
-      this.inSubscription = !1;
-    }
-  }
-  subscribe(i) {
-    return this.subscriptions.add(i), () => this.subscriptions.delete(i);
-  }
-  resetAfterSSR() {
-    this.isSSR && (this.isSSR = !1, this.firstChild = null, this.lastChild = null, this.nodeId = 0);
-  }
-  constructor(i) {
-    super(null), this.nodeType = 11, this.ownerDocument = this, this.dirtyNodes = /* @__PURE__ */ new Set(), this.isSSR = !1, this.nodeId = 0, this.nodesByProps = /* @__PURE__ */ new WeakMap(), this.isMounted = !0, this.nextCollection = null, this.subscriptions = /* @__PURE__ */ new Set(), this.queuedRender = !1, this.inSubscription = !1, this.collection = i, this.nextCollection = i;
-  }
-}
+var r = "right-scroll-bar-position", a = "width-before-scroll-bar", l = "with-scroll-bars-hidden", e = "--removed-body-scroll-bar-size";
 export {
-  b as BaseNode,
-  C as Document,
-  h as ElementNode
+  a as fullWidthClassName,
+  l as noScrollbarsClassName,
+  e as removedBarSizeVariable,
+  r as zeroRightClassName
 };

package/dist/index.es396.js

@@ -1,32 +1,5 @@
-import { focusSafely as d } from "./index.es496.js";
-import { useFocus as n } from "./index.es483.js";
-import { useKeyboard as $ } from "./index.es487.js";
-import { mergeProps as c } from "./index.es301.js";
-import { useSyncRef as l } from "./index.es471.js";
-import i, { useRef as x, useEffect as p, useContext as m } from "react";
-let P = /* @__PURE__ */ i.createContext(null);
-function F(e) {
-  let t = m(P) || {};
-  l(t, e);
-  let { ref: o, ...r } = t;
-  return r;
-}
-function S(e, t) {
-  let { focusProps: o } = n(e), { keyboardProps: r } = $(e), s = c(o, r), u = F(t), b = e.isDisabled ? {} : u, f = x(e.autoFocus);
-  p(() => {
-    f.current && t.current && d(t.current), f.current = !1;
-  }, [
-    t
-  ]);
-  let a = e.excludeFromTabOrder ? -1 : 0;
-  return e.isDisabled && (a = void 0), {
-    focusableProps: c({
-      ...s,
-      tabIndex: a
-    }, b)
-  };
-}
+import { createSidecarMedium as e } from "./index.es526.js";
+var a = e();
 export {
-  P as FocusableContext,
-  S as useFocusable
+  a as effectCar
 };