@boxcustodia/library 1.6.3 → 1.7.0

package/dist/index.es391.js

@@ -1,155 +1,236 @@
-import { __exports as s } from "./index.es517.js";
-import { __require as k } from "./index.es518.js";
-import { __require as D } from "./index.es510.js";
-import { __require as H } from "./index.es390.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;
+import { __exports as H } from "./index.es448.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;
+          }
         }
       }
-      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 };
+      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;
+        }
       }
-      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 i(e) {
+        return e.length === 0 ? null : e[0];
       }
-    } };
-  }
-  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]);
+      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;
       }
-  }
-  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);
+      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);
         }
-      } 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;
+      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 {
-  W as __require
+  z as __require
 };

package/dist/index.es392.js

@@ -1,145 +1,133 @@
-import { __exports as c } from "./index.es519.js";
-import { __require as H } from "./index.es510.js";
-import { __require as j } from "./index.es390.js";
-var S;
-function P() {
-  if (S) return c;
-  S = 1, Object.defineProperty(c, "__esModule", {
-    value: !0
-  }), c.default = void 0;
-  var T = b(H()), h = b(j());
-  function b(r) {
-    return r && r.__esModule ? r : { default: r };
-  }
-  function v(r, t) {
-    return x(r) || k(r, t) || g(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 k(r, t) {
-    var e = r == null ? null : typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
-    if (e != null) {
-      var n = [], u = !0, o = !1, f, l;
-      try {
-        for (e = e.call(r); !(u = (f = e.next()).done) && (n.push(f.value), !(t && n.length === t)); u = !0)
-          ;
-      } catch (a) {
-        o = !0, l = a;
-      } finally {
-        try {
-          !u && e.return != null && e.return();
-        } finally {
-          if (o) throw l;
-        }
-      }
-      return n;
-    }
+class a {
+  get childNodes() {
+    throw new Error("childNodes is not supported");
   }
-  function x(r) {
-    if (Array.isArray(r)) return r;
-  }
-  function O(r, t) {
-    var e = typeof Symbol < "u" && r[Symbol.iterator] || r["@@iterator"];
-    if (!e) {
-      if (Array.isArray(r) || (e = g(r)) || t) {
-        e && (r = e);
-        var n = 0, u = function() {
-        };
-        return { s: u, n: function() {
-          return n >= r.length ? { done: !0 } : { done: !1, value: r[n++] };
-        }, e: function(s) {
-          throw s;
-        }, f: u };
-      }
-      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 o = !0, f = !1, l;
-    return { s: function() {
-      e = e.call(r);
-    }, n: function() {
-      var s = e.next();
-      return o = s.done, s;
-    }, e: function(s) {
-      f = !0, l = s;
-    }, f: function() {
-      try {
-        !o && e.return != null && e.return();
-      } finally {
-        if (f) throw l;
+  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;
       }
-    } };
-  }
-  function g(r, t) {
-    if (r) {
-      if (typeof r == "string") return A(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 A(r, t);
+    };
+  }
+  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;
   }
-  function A(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 i = [], E = h.default.keys(), y = 0; y < E.length; y++) {
-    var M = E[y], d = h.default.get(M), m = [];
-    if (d) {
-      for (var I = [].concat(d.baseConcepts, d.relatedConcepts), p = 0; p < I.length; p++) {
-        var q = I[p];
-        if (q.module === "HTML") {
-          var w = q.concept;
-          w != null && m.push(w);
-        }
-      }
-      m.length > 0 && i.push([M, m]);
+  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;
   }
-  var _ = {
-    entries: function() {
-      return i;
-    },
-    forEach: function(t) {
-      var e = arguments.length > 1 && arguments[1] !== void 0 ? arguments[1] : null, n = O(i), u;
-      try {
-        for (n.s(); !(u = n.n()).done; ) {
-          var o = v(u.value, 2), f = o[0], l = o[1];
-          t.call(e, l, f, i);
+  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;
         }
-      } catch (a) {
-        n.e(a);
-      } finally {
-        n.f();
+        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);
       }
-    },
-    get: function(t) {
-      var e = i.find(function(n) {
-        return n[0] === t;
-      });
-      return e && e[1];
-    },
-    has: function(t) {
-      return !!_.get(t);
-    },
-    keys: function() {
-      return i.map(function(t) {
-        var e = v(t, 1), n = e[0];
-        return n;
-      });
-    },
-    values: function() {
-      return i.map(function(t) {
-        var e = v(t, 2), n = e[1];
-        return n;
-      });
+    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;
     }
-  }, D = (0, T.default)(_, _.entries());
-  return c.default = D, c;
+    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);
 }
 export {
-  P as __require
+  d as BaseCollection,
+  a as CollectionNode
 };