@boxcustodia/library 1.7.12 → 1.7.13

package/dist/index.es461.js

@@ -1,8 +1,233 @@
-function o(...f) {
-  return (...c) => {
-    for (let e of f) typeof e == "function" && e(...c);
-  };
+import { __exports as U } from "./index.es579.js";
+/**
+ * @license React
+ * scheduler.production.js
+ *
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+var A;
+function V() {
+  return A ? U : (A = 1, function(l) {
+    function g(e, a) {
+      var n = e.length;
+      e.push(a);
+      e: for (; 0 < n; ) {
+        var u = n - 1 >>> 1, r = e[u];
+        if (0 < m(r, a))
+          e[u] = a, e[n] = r, n = u;
+        else break e;
+      }
+    }
+    function i(e) {
+      return e.length === 0 ? null : e[0];
+    }
+    function k(e) {
+      if (e.length === 0) return null;
+      var a = e[0], n = e.pop();
+      if (n !== a) {
+        e[0] = n;
+        e: for (var u = 0, r = e.length, P = r >>> 1; u < P; ) {
+          var T = 2 * (u + 1) - 1, I = e[T], o = T + 1, C = e[o];
+          if (0 > m(I, n))
+            o < r && 0 > m(C, I) ? (e[u] = C, e[o] = n, u = o) : (e[u] = I, e[T] = n, u = T);
+          else if (o < r && 0 > m(C, n))
+            e[u] = C, e[o] = n, u = o;
+          else break e;
+        }
+      }
+      return a;
+    }
+    function m(e, a) {
+      var n = e.sortIndex - a.sortIndex;
+      return n !== 0 ? n : e.id - a.id;
+    }
+    if (l.unstable_now = void 0, typeof performance == "object" && typeof performance.now == "function") {
+      var E = performance;
+      l.unstable_now = function() {
+        return E.now();
+      };
+    } else {
+      var j = Date, G = j.now();
+      l.unstable_now = function() {
+        return j.now() - G;
+      };
+    }
+    var s = [], c = [], J = 1, f = null, t = 3, S = !1, d = !1, _ = !1, q = !1, F = typeof setTimeout == "function" ? setTimeout : null, Q = typeof clearTimeout == "function" ? clearTimeout : null, Y = typeof setImmediate < "u" ? setImmediate : null;
+    function w(e) {
+      for (var a = i(c); a !== null; ) {
+        if (a.callback === null) k(c);
+        else if (a.startTime <= e)
+          k(c), a.sortIndex = a.expirationTime, g(s, a);
+        else break;
+        a = i(c);
+      }
+    }
+    function H(e) {
+      if (_ = !1, w(e), !d)
+        if (i(s) !== null)
+          d = !0, b || (b = !0, v());
+        else {
+          var a = i(c);
+          a !== null && D(H, a.startTime - e);
+        }
+    }
+    var b = !1, y = -1, B = 5, M = -1;
+    function N() {
+      return q ? !0 : !(l.unstable_now() - M < B);
+    }
+    function R() {
+      if (q = !1, b) {
+        var e = l.unstable_now();
+        M = e;
+        var a = !0;
+        try {
+          e: {
+            d = !1, _ && (_ = !1, Q(y), y = -1), S = !0;
+            var n = t;
+            try {
+              n: {
+                for (w(e), f = i(s); f !== null && !(f.expirationTime > e && N()); ) {
+                  var u = f.callback;
+                  if (typeof u == "function") {
+                    f.callback = null, t = f.priorityLevel;
+                    var r = u(
+                      f.expirationTime <= e
+                    );
+                    if (e = l.unstable_now(), typeof r == "function") {
+                      f.callback = r, w(e), a = !0;
+                      break n;
+                    }
+                    f === i(s) && k(s), w(e);
+                  } else k(s);
+                  f = i(s);
+                }
+                if (f !== null) a = !0;
+                else {
+                  var P = i(c);
+                  P !== null && D(
+                    H,
+                    P.startTime - e
+                  ), a = !1;
+                }
+              }
+              break e;
+            } finally {
+              f = null, t = n, S = !1;
+            }
+            a = void 0;
+          }
+        } finally {
+          a ? v() : b = !1;
+        }
+      }
+    }
+    var v;
+    if (typeof Y == "function")
+      v = function() {
+        Y(R);
+      };
+    else if (typeof MessageChannel < "u") {
+      var z = new MessageChannel(), K = z.port2;
+      z.port1.onmessage = R, v = function() {
+        K.postMessage(null);
+      };
+    } else
+      v = function() {
+        F(R, 0);
+      };
+    function D(e, a) {
+      y = F(function() {
+        e(l.unstable_now());
+      }, a);
+    }
+    l.unstable_IdlePriority = 5, l.unstable_ImmediatePriority = 1, l.unstable_LowPriority = 4, l.unstable_NormalPriority = 3, l.unstable_Profiling = null, l.unstable_UserBlockingPriority = 2, l.unstable_cancelCallback = function(e) {
+      e.callback = null;
+    }, l.unstable_forceFrameRate = function(e) {
+      0 > e || 125 < e ? console.error(
+        "forceFrameRate takes a positive int between 0 and 125, forcing frame rates higher than 125 fps is not supported"
+      ) : B = 0 < e ? Math.floor(1e3 / e) : 5;
+    }, l.unstable_getCurrentPriorityLevel = function() {
+      return t;
+    }, l.unstable_next = function(e) {
+      switch (t) {
+        case 1:
+        case 2:
+        case 3:
+          var a = 3;
+          break;
+        default:
+          a = t;
+      }
+      var n = t;
+      t = a;
+      try {
+        return e();
+      } finally {
+        t = n;
+      }
+    }, l.unstable_requestPaint = function() {
+      q = !0;
+    }, l.unstable_runWithPriority = function(e, a) {
+      switch (e) {
+        case 1:
+        case 2:
+        case 3:
+        case 4:
+        case 5:
+          break;
+        default:
+          e = 3;
+      }
+      var n = t;
+      t = e;
+      try {
+        return a();
+      } finally {
+        t = n;
+      }
+    }, l.unstable_scheduleCallback = function(e, a, n) {
+      var u = l.unstable_now();
+      switch (typeof n == "object" && n !== null ? (n = n.delay, n = typeof n == "number" && 0 < n ? u + n : u) : n = u, e) {
+        case 1:
+          var r = -1;
+          break;
+        case 2:
+          r = 250;
+          break;
+        case 5:
+          r = 1073741823;
+          break;
+        case 4:
+          r = 1e4;
+          break;
+        default:
+          r = 5e3;
+      }
+      return r = n + r, e = {
+        id: J++,
+        callback: a,
+        priorityLevel: e,
+        startTime: n,
+        expirationTime: r,
+        sortIndex: -1
+      }, n > u ? (e.sortIndex = n, g(c, e), i(s) === null && e === i(c) && (_ ? (Q(y), y = -1) : _ = !0, D(H, n - u))) : (e.sortIndex = r, g(s, e), d || S || (d = !0, b || (b = !0, v()))), e;
+    }, l.unstable_shouldYield = N, l.unstable_wrapCallback = function(e) {
+      var a = t;
+      return function() {
+        var n = t;
+        t = a;
+        try {
+          return e.apply(this, arguments);
+        } finally {
+          t = n;
+        }
+      };
+    };
+  }(U), U);
 }
 export {
-  o as chain
+  V as __require
 };

package/dist/index.es462.js

@@ -1,130 +1,236 @@
-import { nodeContains as l } from "./index.es463.js";
-import { shadowDOM as h } from "./index.es464.js";
-class u {
-  get currentNode() {
-    return this._currentNode;
-  }
-  set currentNode(t) {
-    if (!l(this.root, t)) throw new Error("Cannot set currentNode to a node that is not contained by the root node.");
-    const e = [];
-    let r = t, o = t;
-    for (this._currentNode = t; r && r !== this.root; ) if (r.nodeType === Node.DOCUMENT_FRAGMENT_NODE) {
-      const s = r, n = this._doc.createTreeWalker(s, this.whatToShow, {
-        acceptNode: this._acceptNode
-      });
-      e.push(n), n.currentNode = o, this._currentSetFor.add(n), r = o = s.host;
-    } else r = r.parentNode;
-    const i = this._doc.createTreeWalker(this.root, this.whatToShow, {
-      acceptNode: this._acceptNode
-    });
-    e.push(i), i.currentNode = o, this._currentSetFor.add(i), this._walkerStack = e;
-  }
-  get doc() {
-    return this._doc;
-  }
-  firstChild() {
-    let t = this.currentNode, e = this.nextNode();
-    return l(t, e) ? (e && (this.currentNode = e), e) : (this.currentNode = t, null);
-  }
-  lastChild() {
-    let e = this._walkerStack[0].lastChild();
-    return e && (this.currentNode = e), e;
-  }
-  nextNode() {
-    const t = this._walkerStack[0].nextNode();
-    if (t) {
-      if (t.shadowRoot) {
-        var e;
-        let o;
-        if (typeof this.filter == "function" ? o = this.filter(t) : !((e = this.filter) === null || e === void 0) && e.acceptNode && (o = this.filter.acceptNode(t)), o === NodeFilter.FILTER_ACCEPT)
-          return this.currentNode = t, t;
-        let i = this.nextNode();
-        return i && (this.currentNode = i), i;
+import { __exports as H } from "./index.es580.js";
+/**
+ * @license React
+ * scheduler.development.js
+ *
+ * Copyright (c) Meta Platforms, Inc. and affiliates.
+ *
+ * This source code is licensed under the MIT license found in the
+ * LICENSE file in the root directory of this source tree.
+ */
+var N;
+function z() {
+  return N ? H : (N = 1, function(a) {
+    process.env.NODE_ENV !== "production" && function() {
+      function P() {
+        if (g = !1, _) {
+          var e = a.unstable_now();
+          q = e;
+          var l = !0;
+          try {
+            e: {
+              b = !1, d && (d = !1, V(v), v = -1), A = !0;
+              var n = t;
+              try {
+                n: {
+                  for (k(e), f = i(o); f !== null && !(f.expirationTime > e && R()); ) {
+                    var u = f.callback;
+                    if (typeof u == "function") {
+                      f.callback = null, t = f.priorityLevel;
+                      var r = u(
+                        f.expirationTime <= e
+                      );
+                      if (e = a.unstable_now(), typeof r == "function") {
+                        f.callback = r, k(e), l = !0;
+                        break n;
+                      }
+                      f === i(o) && y(o), k(e);
+                    } else y(o);
+                    f = i(o);
+                  }
+                  if (f !== null) l = !0;
+                  else {
+                    var T = i(s);
+                    T !== null && C(
+                      S,
+                      T.startTime - e
+                    ), l = !1;
+                  }
+                }
+                break e;
+              } finally {
+                f = null, t = n, A = !1;
+              }
+              l = void 0;
+            }
+          } finally {
+            l ? O() : _ = !1;
+          }
+        }
+      }
+      function E(e, l) {
+        var n = e.length;
+        e.push(l);
+        e: for (; 0 < n; ) {
+          var u = n - 1 >>> 1, r = e[u];
+          if (0 < m(r, l))
+            e[u] = l, e[n] = r, n = u;
+          else break e;
+        }
       }
-      return t && (this.currentNode = t), t;
-    } else if (this._walkerStack.length > 1) {
-      this._walkerStack.shift();
-      let r = this.nextNode();
-      return r && (this.currentNode = r), r;
-    } else return null;
-  }
-  previousNode() {
-    const t = this._walkerStack[0];
-    if (t.currentNode === t.root) {
-      if (this._currentSetFor.has(t))
-        if (this._currentSetFor.delete(t), this._walkerStack.length > 1) {
-          this._walkerStack.shift();
-          let o = this.previousNode();
-          return o && (this.currentNode = o), o;
-        } else return null;
-      return null;
-    }
-    const e = t.previousNode();
-    if (e) {
-      if (e.shadowRoot) {
-        var r;
-        let i;
-        if (typeof this.filter == "function" ? i = this.filter(e) : !((r = this.filter) === null || r === void 0) && r.acceptNode && (i = this.filter.acceptNode(e)), i === NodeFilter.FILTER_ACCEPT)
-          return e && (this.currentNode = e), e;
-        let s = this.lastChild();
-        return s && (this.currentNode = s), s;
+      function i(e) {
+        return e.length === 0 ? null : e[0];
       }
-      return e && (this.currentNode = e), e;
-    } else if (this._walkerStack.length > 1) {
-      this._walkerStack.shift();
-      let o = this.previousNode();
-      return o && (this.currentNode = o), o;
-    } else return null;
-  }
-  /**
-   * @deprecated
-   */
-  nextSibling() {
-    return null;
-  }
-  /**
-   * @deprecated
-   */
-  previousSibling() {
-    return null;
-  }
-  /**
-   * @deprecated
-   */
-  parentNode() {
-    return null;
-  }
-  constructor(t, e, r, o) {
-    this._walkerStack = [], this._currentSetFor = /* @__PURE__ */ new Set(), this._acceptNode = (s) => {
-      if (s.nodeType === Node.ELEMENT_NODE) {
-        const d = s.shadowRoot;
-        if (d) {
-          const a = this._doc.createTreeWalker(d, this.whatToShow, {
-            acceptNode: this._acceptNode
-          });
-          return this._walkerStack.unshift(a), NodeFilter.FILTER_ACCEPT;
-        } else {
-          var n;
-          if (typeof this.filter == "function") return this.filter(s);
-          if (!((n = this.filter) === null || n === void 0) && n.acceptNode) return this.filter.acceptNode(s);
-          if (this.filter === null) return NodeFilter.FILTER_ACCEPT;
+      function y(e) {
+        if (e.length === 0) return null;
+        var l = e[0], n = e.pop();
+        if (n !== l) {
+          e[0] = n;
+          e: for (var u = 0, r = e.length, T = r >>> 1; u < T; ) {
+            var w = 2 * (u + 1) - 1, D = e[w], c = w + 1, L = e[c];
+            if (0 > m(D, n))
+              c < r && 0 > m(L, D) ? (e[u] = L, e[c] = n, u = c) : (e[u] = D, e[w] = n, u = w);
+            else if (c < r && 0 > m(L, n))
+              e[u] = L, e[c] = n, u = c;
+            else break e;
+          }
         }
+        return l;
       }
-      return NodeFilter.FILTER_SKIP;
-    }, this._doc = t, this.root = e, this.filter = o ?? null, this.whatToShow = r ?? NodeFilter.SHOW_ALL, this._currentNode = e, this._walkerStack.unshift(t.createTreeWalker(e, r, this._acceptNode));
-    const i = e.shadowRoot;
-    if (i) {
-      const s = this._doc.createTreeWalker(i, this.whatToShow, {
-        acceptNode: this._acceptNode
-      });
-      this._walkerStack.unshift(s);
-    }
-  }
-}
-function w(c, t, e, r) {
-  return h() ? new u(c, t, e, r) : c.createTreeWalker(t, e, r);
+      function m(e, l) {
+        var n = e.sortIndex - l.sortIndex;
+        return n !== 0 ? n : e.id - l.id;
+      }
+      function k(e) {
+        for (var l = i(s); l !== null; ) {
+          if (l.callback === null) y(s);
+          else if (l.startTime <= e)
+            y(s), l.sortIndex = l.expirationTime, E(o, l);
+          else break;
+          l = i(s);
+        }
+      }
+      function S(e) {
+        if (d = !1, k(e), !b)
+          if (i(o) !== null)
+            b = !0, _ || (_ = !0, O());
+          else {
+            var l = i(s);
+            l !== null && C(
+              S,
+              l.startTime - e
+            );
+          }
+      }
+      function R() {
+        return g ? !0 : !(a.unstable_now() - q < K);
+      }
+      function C(e, l) {
+        v = I(function() {
+          e(a.unstable_now());
+        }, l);
+      }
+      if (typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ < "u" && typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart == "function" && __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStart(Error()), a.unstable_now = void 0, typeof performance == "object" && typeof performance.now == "function") {
+        var U = performance;
+        a.unstable_now = function() {
+          return U.now();
+        };
+      } else {
+        var B = Date, j = B.now();
+        a.unstable_now = function() {
+          return B.now() - j;
+        };
+      }
+      var o = [], s = [], F = 1, f = null, t = 3, A = !1, b = !1, d = !1, g = !1, I = typeof setTimeout == "function" ? setTimeout : null, V = typeof clearTimeout == "function" ? clearTimeout : null, G = typeof setImmediate < "u" ? setImmediate : null, _ = !1, v = -1, K = 5, q = -1;
+      if (typeof G == "function")
+        var O = function() {
+          G(P);
+        };
+      else if (typeof MessageChannel < "u") {
+        var M = new MessageChannel(), Q = M.port2;
+        M.port1.onmessage = P, O = function() {
+          Q.postMessage(null);
+        };
+      } else
+        O = function() {
+          I(P, 0);
+        };
+      a.unstable_IdlePriority = 5, a.unstable_ImmediatePriority = 1, a.unstable_LowPriority = 4, a.unstable_NormalPriority = 3, a.unstable_Profiling = null, a.unstable_UserBlockingPriority = 2, a.unstable_cancelCallback = function(e) {
+        e.callback = null;
+      }, a.unstable_forceFrameRate = function(e) {
+        0 > e || 125 < e ? console.error(
+          "forceFrameRate takes a positive int between 0 and 125, forcing frame rates higher than 125 fps is not supported"
+        ) : K = 0 < e ? Math.floor(1e3 / e) : 5;
+      }, a.unstable_getCurrentPriorityLevel = function() {
+        return t;
+      }, a.unstable_next = function(e) {
+        switch (t) {
+          case 1:
+          case 2:
+          case 3:
+            var l = 3;
+            break;
+          default:
+            l = t;
+        }
+        var n = t;
+        t = l;
+        try {
+          return e();
+        } finally {
+          t = n;
+        }
+      }, a.unstable_requestPaint = function() {
+        g = !0;
+      }, a.unstable_runWithPriority = function(e, l) {
+        switch (e) {
+          case 1:
+          case 2:
+          case 3:
+          case 4:
+          case 5:
+            break;
+          default:
+            e = 3;
+        }
+        var n = t;
+        t = e;
+        try {
+          return l();
+        } finally {
+          t = n;
+        }
+      }, a.unstable_scheduleCallback = function(e, l, n) {
+        var u = a.unstable_now();
+        switch (typeof n == "object" && n !== null ? (n = n.delay, n = typeof n == "number" && 0 < n ? u + n : u) : n = u, e) {
+          case 1:
+            var r = -1;
+            break;
+          case 2:
+            r = 250;
+            break;
+          case 5:
+            r = 1073741823;
+            break;
+          case 4:
+            r = 1e4;
+            break;
+          default:
+            r = 5e3;
+        }
+        return r = n + r, e = {
+          id: F++,
+          callback: l,
+          priorityLevel: e,
+          startTime: n,
+          expirationTime: r,
+          sortIndex: -1
+        }, n > u ? (e.sortIndex = n, E(s, e), i(o) === null && e === i(s) && (d ? (V(v), v = -1) : d = !0, C(S, n - u))) : (e.sortIndex = r, E(o, e), b || A || (b = !0, _ || (_ = !0, O()))), e;
+      }, a.unstable_shouldYield = R, a.unstable_wrapCallback = function(e) {
+        var l = t;
+        return function() {
+          var n = t;
+          t = l;
+          try {
+            return e.apply(this, arguments);
+          } finally {
+            t = n;
+          }
+        };
+      }, typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ < "u" && typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop == "function" && __REACT_DEVTOOLS_GLOBAL_HOOK__.registerInternalModuleStop(Error());
+    }();
+  }(H), H);
 }
 export {
-  u as ShadowTreeWalker,
-  w as createShadowTreeWalker
+  z as __require
 };

package/dist/index.es463.js

@@ -1,27 +1,4 @@
-import { isShadowRoot as f } from "./index.es465.js";
-import { shadowDOM as o } from "./index.es464.js";
-function n(t, a) {
-  if (!o()) return a && t ? t.contains(a) : !1;
-  if (!t || !a) return !1;
-  let e = a;
-  for (; e !== null; ) {
-    if (e === t) return !0;
-    e.tagName === "SLOT" && e.assignedSlot ? e = e.assignedSlot.parentNode : f(e) ? e = e.host : e = e.parentNode;
-  }
-  return !1;
-}
-const s = (t = document) => {
-  var a;
-  if (!o()) return t.activeElement;
-  let e = t.activeElement;
-  for (; e && "shadowRoot" in e && (!((a = e.shadowRoot) === null || a === void 0) && a.activeElement); ) e = e.shadowRoot.activeElement;
-  return e;
-};
-function d(t) {
-  return o() && t.target.shadowRoot && t.composedPath ? t.composedPath()[0] : t.target;
-}
+var e = { exports: {} };
 export {
-  s as getActiveElement,
-  d as getEventTarget,
-  n as nodeContains
+  e as __module
 };

package/dist/index.es464.js

@@ -1,7 +1,4 @@
-let e = !1;
-function f() {
-  return e;
-}
+var o = {};
 export {
-  f as shadowDOM
+  o as __exports
 };

package/dist/index.es465.js

@@ -1,15 +1,4 @@
-const t = (o) => {
-  var n;
-  return (n = o == null ? void 0 : o.ownerDocument) !== null && n !== void 0 ? n : document;
-}, e = (o) => o && "window" in o && o.window === o ? o : t(o).defaultView || window;
-function d(o) {
-  return o !== null && typeof o == "object" && "nodeType" in o && typeof o.nodeType == "number";
-}
-function c(o) {
-  return d(o) && o.nodeType === Node.DOCUMENT_FRAGMENT_NODE && "host" in o;
-}
+var r = {};
 export {
-  t as getOwnerDocument,
-  e as getOwnerWindow,
-  c as isShadowRoot
+  r as __exports
 };