@boxcustodia/library 1.7.12 → 1.7.13

package/dist/index.es425.js

@@ -1,170 +1,219 @@
-import { __exports as p } from "./index.es552.js";
-import { __require as G } from "./index.es553.js";
-import { __require as H } from "./index.es554.js";
-import { __require as F } from "./index.es555.js";
-import { __require as N } from "./index.es556.js";
-import { __require as U } from "./index.es550.js";
-var R;
-function V() {
-  if (R) return p;
-  R = 1, Object.defineProperty(p, "__esModule", {
-    value: !0
-  }), p.default = void 0;
-  var w = c(G()), I = c(H()), O = c(F()), S = c(N()), M = c(U());
-  function c(r) {
-    return r && r.__esModule ? r : { default: r };
-  }
-  function T(r, t, e) {
-    return t in r ? Object.defineProperty(r, t, { value: e, enumerable: !0, configurable: !0, writable: !0 }) : r[t] = e, r;
-  }
-  function y(r, t) {
-    var e = typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
-    if (!e) {
-      if (Array.isArray(r) || (e = h(r)) || t) {
-        e && (r = e);
-        var n = 0, a = function() {
-        };
-        return { s: a, n: function() {
-          return n >= r.length ? { done: !0 } : { done: !1, value: r[n++] };
-        }, e: function(o) {
-          throw o;
-        }, f: a };
-      }
-      throw new TypeError(`Invalid attempt to iterate non-iterable instance.
-In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
-    }
-    var f = !0, u = !1, l;
-    return { s: function() {
-      e = e.call(r);
-    }, n: function() {
-      var o = e.next();
-      return f = o.done, o;
-    }, e: function(o) {
-      u = !0, l = o;
-    }, f: function() {
-      try {
-        !f && e.return != null && e.return();
-      } finally {
-        if (u) throw l;
-      }
-    } };
+import { CollectionNode as S } from "./index.es424.js";
+class b {
+  *[Symbol.iterator]() {
+    let i = this.firstChild;
+    for (; i; )
+      yield i, i = i.nextSibling;
   }
-  function v(r, t) {
-    return x(r) || D(r, t) || h(r, t) || E();
+  get firstChild() {
+    return this._firstChild;
   }
-  function E() {
-    throw new TypeError(`Invalid attempt to destructure non-iterable instance.
-In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
+  set firstChild(i) {
+    this._firstChild = i, this.ownerDocument.markDirty(this);
   }
-  function h(r, t) {
-    if (r) {
-      if (typeof r == "string") return b(r, t);
-      var e = Object.prototype.toString.call(r).slice(8, -1);
-      if (e === "Object" && r.constructor && (e = r.constructor.name), e === "Map" || e === "Set") return Array.from(r);
-      if (e === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(e)) return b(r, t);
-    }
+  get lastChild() {
+    return this._lastChild;
   }
-  function b(r, t) {
-    (t == null || t > r.length) && (t = r.length);
-    for (var e = 0, n = new Array(t); e < t; e++)
-      n[e] = r[e];
-    return n;
-  }
-  function D(r, t) {
-    var e = r == null ? null : typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
-    if (e != null) {
-      var n = [], a = !0, f = !1, u, l;
-      try {
-        for (e = e.call(r); !(a = (u = e.next()).done) && (n.push(u.value), !(t && n.length === t)); a = !0)
-          ;
-      } catch (i) {
-        f = !0, l = i;
-      } finally {
-        try {
-          !a && e.return != null && e.return();
-        } finally {
-          if (f) throw l;
-        }
+  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;
       }
-      return n;
     }
   }
-  function x(r) {
-    if (Array.isArray(r)) return r;
-  }
-  var s = [].concat(w.default, I.default, O.default, S.default);
-  s.forEach(function(r) {
-    var t = v(r, 2), e = t[1], n = y(e.superClass), a;
-    try {
-      for (n.s(); !(a = n.n()).done; ) {
-        var f = a.value, u = y(f), l;
-        try {
-          var i = function() {
-            var P = l.value, A = s.find(function(k) {
-              var L = v(k, 1), j = L[0];
-              return j === P;
-            });
-            if (A)
-              for (var g = A[1], _ = 0, q = Object.keys(g.props); _ < q.length; _++) {
-                var m = q[_];
-                Object.prototype.hasOwnProperty.call(e.props, m) || Object.assign(e.props, T({}, m, g.props[m]));
-              }
-          };
-          for (u.s(); !(l = u.n()).done; )
-            i();
-        } catch (o) {
-          u.e(o);
-        } finally {
-          u.f();
-        }
-      }
-    } catch (o) {
-      n.e(o);
-    } finally {
-      n.f();
+  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;
     }
-  });
-  var d = {
-    entries: function() {
-      return s;
-    },
-    forEach: function(t) {
-      var e = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : null, n = y(s), a;
-      try {
-        for (n.s(); !(a = n.n()).done; ) {
-          var f = v(a.value, 2), u = f[0], l = f[1];
-          t.call(e, l, u, s);
+    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);
         }
-      } catch (i) {
-        n.e(i);
-      } finally {
-        n.f();
       }
-    },
-    get: function(t) {
-      var e = s.find(function(n) {
-        return n[0] === t;
-      });
-      return e && e[1];
-    },
-    has: function(t) {
-      return !!d.get(t);
-    },
-    keys: function() {
-      return s.map(function(t) {
-        var e = v(t, 1), n = e[0];
-        return n;
-      });
-    },
-    values: function() {
-      return s.map(function(t) {
-        var e = v(t, 2), n = e[1];
-        return n;
-      });
+    };
+  }
+  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);
     }
-  }, C = (0, M.default)(d, d.entries());
-  return p.default = C, p;
+  }
+  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;
+  }
 }
 export {
-  V as __require
+  b as BaseNode,
+  C as Document,
+  h as ElementNode
 };

package/dist/index.es426.js

@@ -1,155 +1,32 @@
-import { __exports as s } from "./index.es557.js";
-import { __require as k } from "./index.es558.js";
-import { __require as D } from "./index.es550.js";
-import { __require as H } from "./index.es425.js";
-var S;
-function W() {
-  if (S) return s;
-  S = 1, Object.defineProperty(s, "__esModule", {
-    value: !0
-  }), s.default = void 0;
-  var h = k(), E = g(D()), b = g(H());
-  function g(r) {
-    return r && r.__esModule ? r : { default: r };
-  }
-  function v(r, t) {
-    return x(r) || T(r, t) || A(r, t) || R();
-  }
-  function R() {
-    throw new TypeError(`Invalid attempt to destructure non-iterable instance.
-In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
-  }
-  function T(r, t) {
-    var e = r == null ? null : typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
-    if (e != null) {
-      var n = [], a = !0, u = !1, f, l;
-      try {
-        for (e = e.call(r); !(a = (f = e.next()).done) && (n.push(f.value), !(t && n.length === t)); a = !0)
-          ;
-      } catch (i) {
-        u = !0, l = i;
-      } finally {
-        try {
-          !a && e.return != null && e.return();
-        } finally {
-          if (u) throw l;
-        }
-      }
-      return n;
-    }
-  }
-  function x(r) {
-    if (Array.isArray(r)) return r;
-  }
-  function C(r, t) {
-    var e = typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
-    if (!e) {
-      if (Array.isArray(r) || (e = A(r)) || t) {
-        e && (r = e);
-        var n = 0, a = function() {
-        };
-        return { s: a, n: function() {
-          return n >= r.length ? { done: !0 } : { done: !1, value: r[n++] };
-        }, e: function(c) {
-          throw c;
-        }, f: a };
-      }
-      throw new TypeError(`Invalid attempt to iterate non-iterable instance.
-In order to be iterable, non-array objects must have a [Symbol.iterator]() method.`);
-    }
-    var u = !0, f = !1, l;
-    return { s: function() {
-      e = e.call(r);
-    }, n: function() {
-      var c = e.next();
-      return u = c.done, c;
-    }, e: function(c) {
-      f = !0, l = c;
-    }, f: function() {
-      try {
-        !u && e.return != null && e.return();
-      } finally {
-        if (f) throw l;
-      }
-    } };
-  }
-  function A(r, t) {
-    if (r) {
-      if (typeof r == "string") return q(r, t);
-      var e = Object.prototype.toString.call(r).slice(8, -1);
-      if (e === "Object" && r.constructor && (e = r.constructor.name), e === "Map" || e === "Set") return Array.from(r);
-      if (e === "Arguments" || /^(?:Ui|I)nt(?:8|16|32)(?:Clamped)?Array$/.test(e)) return q(r, t);
-    }
-  }
-  function q(r, t) {
-    (t == null || t > r.length) && (t = r.length);
-    for (var e = 0, n = new Array(t); e < t; e++)
-      n[e] = r[e];
-    return n;
-  }
-  for (var o = [], M = b.default.keys(), d = 0; d < M.length; d++) {
-    var m = M[d], y = b.default.get(m);
-    if (y)
-      for (var I = [].concat(y.baseConcepts, y.relatedConcepts), p = 0; p < I.length; p++) {
-        var w = I[p];
-        w.module === "HTML" && function() {
-          var r = w.concept;
-          if (r) {
-            var t = o.find(function(u) {
-              return (0, h.dequal)(u, r);
-            }), e;
-            t ? e = t[1] : e = [];
-            for (var n = !0, a = 0; a < e.length; a++)
-              if (e[a] === m) {
-                n = !1;
-                break;
-              }
-            n && e.push(m), o.push([r, e]);
-          }
-        }();
-      }
-  }
-  var _ = {
-    entries: function() {
-      return o;
-    },
-    forEach: function(t) {
-      var e = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : null, n = C(o), a;
-      try {
-        for (n.s(); !(a = n.n()).done; ) {
-          var u = v(a.value, 2), f = u[0], l = u[1];
-          t.call(e, l, f, o);
-        }
-      } catch (i) {
-        n.e(i);
-      } finally {
-        n.f();
-      }
-    },
-    get: function(t) {
-      var e = o.find(function(n) {
-        return t.name === n[0].name && (0, h.dequal)(t.attributes, n[0].attributes);
-      });
-      return e && e[1];
-    },
-    has: function(t) {
-      return !!_.get(t);
-    },
-    keys: function() {
-      return o.map(function(t) {
-        var e = v(t, 1), n = e[0];
-        return n;
-      });
-    },
-    values: function() {
-      return o.map(function(t) {
-        var e = v(t, 2), n = e[1];
-        return n;
-      });
-    }
-  }, O = (0, E.default)(_, _.entries());
-  return s.default = O, s;
+import { focusSafely as d } from "./index.es528.js";
+import { useFocus as n } from "./index.es515.js";
+import { useKeyboard as $ } from "./index.es519.js";
+import { mergeProps as c } from "./index.es326.js";
+import { useSyncRef as l } from "./index.es503.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)
+  };
 }
 export {
-  W as __require
+  P as FocusableContext,
+  S as useFocusable
 };