@commercetools/nimbus 0.0.0-canary-20250828113610 → 0.0.0-canary-20250901063242

package/dist/chunks/FocusScope-C1Aw7j9H.es.js

@@ -1,625 +0,0 @@
-import { i as j, b as D, d as T, a as $, j as B, k as G, e as S } from "./utils-Gg3iiYhl.es.js";
-import { c as m } from "./mergeProps-B_9syxhT.es.js";
-import { d as V, e as Q } from "./platform-Z5fvtFmM.es.js";
-import { b as X } from "./useFocusVisible-C5ivHvqm.es.js";
-import { $ as Y } from "./focusSafely-Di2ArC9L.es.js";
-import R, { useRef as _, useContext as Z, useMemo as L, useEffect as q } from "react";
-class O {
-  get currentNode() {
-    return this._currentNode;
-  }
-  set currentNode(e) {
-    if (!D(this.root, e)) throw new Error("Cannot set currentNode to a node that is not contained by the root node.");
-    const t = [];
-    let n = e, o = e;
-    for (this._currentNode = e; n && n !== this.root; ) if (n.nodeType === Node.DOCUMENT_FRAGMENT_NODE) {
-      const a = n, i = this._doc.createTreeWalker(a, this.whatToShow, {
-        acceptNode: this._acceptNode
-      });
-      t.push(i), i.currentNode = o, this._currentSetFor.add(i), n = o = a.host;
-    } else n = n.parentNode;
-    const l = this._doc.createTreeWalker(this.root, this.whatToShow, {
-      acceptNode: this._acceptNode
-    });
-    t.push(l), l.currentNode = o, this._currentSetFor.add(l), this._walkerStack = t;
-  }
-  get doc() {
-    return this._doc;
-  }
-  firstChild() {
-    let e = this.currentNode, t = this.nextNode();
-    return D(e, t) ? (t && (this.currentNode = t), t) : (this.currentNode = e, null);
-  }
-  lastChild() {
-    let t = this._walkerStack[0].lastChild();
-    return t && (this.currentNode = t), t;
-  }
-  nextNode() {
-    const e = this._walkerStack[0].nextNode();
-    if (e) {
-      if (e.shadowRoot) {
-        var t;
-        let o;
-        if (typeof this.filter == "function" ? o = this.filter(e) : !((t = this.filter) === null || t === void 0) && t.acceptNode && (o = this.filter.acceptNode(e)), o === NodeFilter.FILTER_ACCEPT)
-          return this.currentNode = e, e;
-        let l = this.nextNode();
-        return l && (this.currentNode = l), l;
-      }
-      return e && (this.currentNode = e), e;
-    } else if (this._walkerStack.length > 1) {
-      this._walkerStack.shift();
-      let n = this.nextNode();
-      return n && (this.currentNode = n), n;
-    } else return null;
-  }
-  previousNode() {
-    const e = this._walkerStack[0];
-    if (e.currentNode === e.root) {
-      if (this._currentSetFor.has(e))
-        if (this._currentSetFor.delete(e), this._walkerStack.length > 1) {
-          this._walkerStack.shift();
-          let o = this.previousNode();
-          return o && (this.currentNode = o), o;
-        } else return null;
-      return null;
-    }
-    const t = e.previousNode();
-    if (t) {
-      if (t.shadowRoot) {
-        var n;
-        let l;
-        if (typeof this.filter == "function" ? l = this.filter(t) : !((n = this.filter) === null || n === void 0) && n.acceptNode && (l = this.filter.acceptNode(t)), l === NodeFilter.FILTER_ACCEPT)
-          return t && (this.currentNode = t), t;
-        let a = this.lastChild();
-        return a && (this.currentNode = a), a;
-      }
-      return t && (this.currentNode = t), t;
-    } 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(e, t, n, o) {
-    this._walkerStack = [], this._currentSetFor = /* @__PURE__ */ new Set(), this._acceptNode = (a) => {
-      if (a.nodeType === Node.ELEMENT_NODE) {
-        const f = a.shadowRoot;
-        if (f) {
-          const u = this._doc.createTreeWalker(f, this.whatToShow, {
-            acceptNode: this._acceptNode
-          });
-          return this._walkerStack.unshift(u), NodeFilter.FILTER_ACCEPT;
-        } else {
-          var i;
-          if (typeof this.filter == "function") return this.filter(a);
-          if (!((i = this.filter) === null || i === void 0) && i.acceptNode) return this.filter.acceptNode(a);
-          if (this.filter === null) return NodeFilter.FILTER_ACCEPT;
-        }
-      }
-      return NodeFilter.FILTER_SKIP;
-    }, this._doc = e, this.root = t, this.filter = o ?? null, this.whatToShow = n ?? NodeFilter.SHOW_ALL, this._currentNode = t, this._walkerStack.unshift(e.createTreeWalker(t, n, this._acceptNode));
-    const l = t.shadowRoot;
-    if (l) {
-      const a = this._doc.createTreeWalker(l, this.whatToShow, {
-        acceptNode: this._acceptNode
-      });
-      this._walkerStack.unshift(a);
-    }
-  }
-}
-function ee(r, e, t, n) {
-  return j() ? new O(r, e, t, n) : r.createTreeWalker(e, t, n);
-}
-const W = /* @__PURE__ */ R.createContext(null), M = "react-aria-focus-scope-restore";
-let v = null;
-function be(r) {
-  let { children: e, contain: t, restoreFocus: n, autoFocus: o } = r, l = _(null), a = _(null), i = _([]), { parentNode: f } = Z(W) || {}, u = L(() => new K({
-    scopeRef: i
-  }), [
-    i
-  ]);
-  m(() => {
-    let s = f || N.root;
-    if (N.getTreeNode(s.scopeRef) && v && !y(v, s.scopeRef)) {
-      let b = N.getTreeNode(v);
-      b && (s = b);
-    }
-    s.addChild(u), N.addNode(u);
-  }, [
-    u,
-    f
-  ]), m(() => {
-    let s = N.getTreeNode(i);
-    s && (s.contain = !!t);
-  }, [
-    t
-  ]), m(() => {
-    var s;
-    let b = (s = l.current) === null || s === void 0 ? void 0 : s.nextSibling, h = [], x = (C) => C.stopPropagation();
-    for (; b && b !== a.current; )
-      h.push(b), b.addEventListener(M, x), b = b.nextSibling;
-    return i.current = h, () => {
-      for (let C of h) C.removeEventListener(M, x);
-    };
-  }, [
-    e
-  ]), ie(i, n, t), ne(i, t), le(i, n, t), oe(i, o), q(() => {
-    const s = T($(i.current ? i.current[0] : void 0));
-    let b = null;
-    if (w(s, i.current)) {
-      for (let h of N.traverse()) h.scopeRef && w(s, h.scopeRef.current) && (b = h);
-      b === N.getTreeNode(i) && (v = b.scopeRef);
-    }
-  }, [
-    i
-  ]), m(() => () => {
-    var s, b, h;
-    let x = (h = (b = N.getTreeNode(i)) === null || b === void 0 || (s = b.parent) === null || s === void 0 ? void 0 : s.scopeRef) !== null && h !== void 0 ? h : null;
-    (i === v || y(i, v)) && (!x || N.getTreeNode(x)) && (v = x), N.removeTreeNode(i);
-  }, [
-    i
-  ]);
-  let d = L(() => te(i), []), c = L(() => ({
-    focusManager: d,
-    parentNode: u
-  }), [
-    u,
-    d
-  ]);
-  return /* @__PURE__ */ R.createElement(W.Provider, {
-    value: c
-  }, /* @__PURE__ */ R.createElement("span", {
-    "data-focus-scope-start": !0,
-    hidden: !0,
-    ref: l
-  }), e, /* @__PURE__ */ R.createElement("span", {
-    "data-focus-scope-end": !0,
-    hidden: !0,
-    ref: a
-  }));
-}
-function te(r) {
-  return {
-    focusNext(e = {}) {
-      let t = r.current, { from: n, tabbable: o, wrap: l, accept: a } = e;
-      var i;
-      let f = n || T($((i = t[0]) !== null && i !== void 0 ? i : void 0)), u = t[0].previousElementSibling, d = g(t), c = E(d, {
-        tabbable: o,
-        accept: a
-      }, t);
-      c.currentNode = w(f, t) ? f : u;
-      let s = c.nextNode();
-      return !s && l && (c.currentNode = u, s = c.nextNode()), s && p(s, !0), s;
-    },
-    focusPrevious(e = {}) {
-      let t = r.current, { from: n, tabbable: o, wrap: l, accept: a } = e;
-      var i;
-      let f = n || T($((i = t[0]) !== null && i !== void 0 ? i : void 0)), u = t[t.length - 1].nextElementSibling, d = g(t), c = E(d, {
-        tabbable: o,
-        accept: a
-      }, t);
-      c.currentNode = w(f, t) ? f : u;
-      let s = c.previousNode();
-      return !s && l && (c.currentNode = u, s = c.previousNode()), s && p(s, !0), s;
-    },
-    focusFirst(e = {}) {
-      let t = r.current, { tabbable: n, accept: o } = e, l = g(t), a = E(l, {
-        tabbable: n,
-        accept: o
-      }, t);
-      a.currentNode = t[0].previousElementSibling;
-      let i = a.nextNode();
-      return i && p(i, !0), i;
-    },
-    focusLast(e = {}) {
-      let t = r.current, { tabbable: n, accept: o } = e, l = g(t), a = E(l, {
-        tabbable: n,
-        accept: o
-      }, t);
-      a.currentNode = t[t.length - 1].nextElementSibling;
-      let i = a.previousNode();
-      return i && p(i, !0), i;
-    }
-  };
-}
-function g(r) {
-  return r[0].parentElement;
-}
-function F(r) {
-  let e = N.getTreeNode(v);
-  for (; e && e.scopeRef !== r; ) {
-    if (e.contain) return !1;
-    e = e.parent;
-  }
-  return !0;
-}
-function re(r) {
-  if (r.checked) return !0;
-  let e = [];
-  if (!r.form) e = [
-    ...$(r).querySelectorAll(`input[type="radio"][name="${CSS.escape(r.name)}"]`)
-  ].filter((l) => !l.form);
-  else {
-    var t, n;
-    let l = (n = r.form) === null || n === void 0 || (t = n.elements) === null || t === void 0 ? void 0 : t.namedItem(r.name);
-    e = [
-      ...l ?? []
-    ];
-  }
-  return e ? !e.some((l) => l.checked) : !1;
-}
-function ne(r, e) {
-  let t = _(void 0), n = _(void 0);
-  m(() => {
-    let o = r.current;
-    if (!e) {
-      n.current && (cancelAnimationFrame(n.current), n.current = void 0);
-      return;
-    }
-    const l = $(o ? o[0] : void 0);
-    let a = (u) => {
-      if (u.key !== "Tab" || u.altKey || u.ctrlKey || u.metaKey || !F(r) || u.isComposing) return;
-      let d = T(l), c = r.current;
-      if (!c || !w(d, c)) return;
-      let s = g(c), b = E(s, {
-        tabbable: !0
-      }, c);
-      if (!d) return;
-      b.currentNode = d;
-      let h = u.shiftKey ? b.previousNode() : b.nextNode();
-      h || (b.currentNode = u.shiftKey ? c[c.length - 1].nextElementSibling : c[0].previousElementSibling, h = u.shiftKey ? b.previousNode() : b.nextNode()), u.preventDefault(), h && p(h, !0);
-    }, i = (u) => {
-      (!v || y(v, r)) && w(S(u), r.current) ? (v = r, t.current = S(u)) : F(r) && !k(S(u), r) ? t.current ? t.current.focus() : v && v.current && A(v.current) : F(r) && (t.current = S(u));
-    }, f = (u) => {
-      n.current && cancelAnimationFrame(n.current), n.current = requestAnimationFrame(() => {
-        let d = X(), c = (d === "virtual" || d === null) && V() && Q(), s = T(l);
-        if (!c && s && F(r) && !k(s, r)) {
-          v = r;
-          let h = S(u);
-          if (h && h.isConnected) {
-            var b;
-            t.current = h, (b = t.current) === null || b === void 0 || b.focus();
-          } else v.current && A(v.current);
-        }
-      });
-    };
-    return l.addEventListener("keydown", a, !1), l.addEventListener("focusin", i, !1), o?.forEach((u) => u.addEventListener("focusin", i, !1)), o?.forEach((u) => u.addEventListener("focusout", f, !1)), () => {
-      l.removeEventListener("keydown", a, !1), l.removeEventListener("focusin", i, !1), o?.forEach((u) => u.removeEventListener("focusin", i, !1)), o?.forEach((u) => u.removeEventListener("focusout", f, !1));
-    };
-  }, [
-    r,
-    e
-  ]), m(() => () => {
-    n.current && cancelAnimationFrame(n.current);
-  }, [
-    n
-  ]);
-}
-function J(r) {
-  return k(r);
-}
-function w(r, e) {
-  return !r || !e ? !1 : e.some((t) => t.contains(r));
-}
-function k(r, e = null) {
-  if (r instanceof Element && r.closest("[data-react-aria-top-layer]")) return !0;
-  for (let { scopeRef: t } of N.traverse(N.getTreeNode(e)))
-    if (t && w(r, t.current)) return !0;
-  return !1;
-}
-function ve(r) {
-  return k(r, v);
-}
-function y(r, e) {
-  var t;
-  let n = (t = N.getTreeNode(e)) === null || t === void 0 ? void 0 : t.parent;
-  for (; n; ) {
-    if (n.scopeRef === r) return !0;
-    n = n.parent;
-  }
-  return !1;
-}
-function p(r, e = !1) {
-  if (r != null && !e) try {
-    Y(r);
-  } catch {
-  }
-  else if (r != null) try {
-    r.focus();
-  } catch {
-  }
-}
-function H(r, e = !0) {
-  let t = r[0].previousElementSibling, n = g(r), o = E(n, {
-    tabbable: e
-  }, r);
-  o.currentNode = t;
-  let l = o.nextNode();
-  return e && !l && (n = g(r), o = E(n, {
-    tabbable: !1
-  }, r), o.currentNode = t, l = o.nextNode()), l;
-}
-function A(r, e = !0) {
-  p(H(r, e));
-}
-function oe(r, e) {
-  const t = R.useRef(e);
-  q(() => {
-    if (t.current) {
-      v = r;
-      const n = $(r.current ? r.current[0] : void 0);
-      !w(T(n), v.current) && r.current && A(r.current);
-    }
-    t.current = !1;
-  }, [
-    r
-  ]);
-}
-function ie(r, e, t) {
-  m(() => {
-    if (e || t) return;
-    let n = r.current;
-    const o = $(n ? n[0] : void 0);
-    let l = (a) => {
-      let i = S(a);
-      w(i, r.current) ? v = r : J(i) || (v = null);
-    };
-    return o.addEventListener("focusin", l, !1), n?.forEach((a) => a.addEventListener("focusin", l, !1)), () => {
-      o.removeEventListener("focusin", l, !1), n?.forEach((a) => a.removeEventListener("focusin", l, !1));
-    };
-  }, [
-    r,
-    e,
-    t
-  ]);
-}
-function z(r) {
-  let e = N.getTreeNode(v);
-  for (; e && e.scopeRef !== r; ) {
-    if (e.nodeToRestore) return !1;
-    e = e.parent;
-  }
-  return e?.scopeRef === r;
-}
-function le(r, e, t) {
-  const n = _(typeof document < "u" ? T($(r.current ? r.current[0] : void 0)) : null);
-  m(() => {
-    let o = r.current;
-    const l = $(o ? o[0] : void 0);
-    if (!e || t) return;
-    let a = () => {
-      (!v || y(v, r)) && w(T(l), r.current) && (v = r);
-    };
-    return l.addEventListener("focusin", a, !1), o?.forEach((i) => i.addEventListener("focusin", a, !1)), () => {
-      l.removeEventListener("focusin", a, !1), o?.forEach((i) => i.removeEventListener("focusin", a, !1));
-    };
-  }, [
-    r,
-    t
-  ]), m(() => {
-    const o = $(r.current ? r.current[0] : void 0);
-    if (!e) return;
-    let l = (a) => {
-      if (a.key !== "Tab" || a.altKey || a.ctrlKey || a.metaKey || !F(r) || a.isComposing) return;
-      let i = o.activeElement;
-      if (!k(i, r) || !z(r)) return;
-      let f = N.getTreeNode(r);
-      if (!f) return;
-      let u = f.nodeToRestore, d = E(o.body, {
-        tabbable: !0
-      });
-      d.currentNode = i;
-      let c = a.shiftKey ? d.previousNode() : d.nextNode();
-      if ((!u || !u.isConnected || u === o.body) && (u = void 0, f.nodeToRestore = void 0), (!c || !k(c, r)) && u) {
-        d.currentNode = u;
-        do
-          c = a.shiftKey ? d.previousNode() : d.nextNode();
-        while (k(c, r));
-        a.preventDefault(), a.stopPropagation(), c ? p(c, !0) : J(u) ? p(u, !0) : i.blur();
-      }
-    };
-    return t || o.addEventListener("keydown", l, !0), () => {
-      t || o.removeEventListener("keydown", l, !0);
-    };
-  }, [
-    r,
-    e,
-    t
-  ]), m(() => {
-    const o = $(r.current ? r.current[0] : void 0);
-    if (!e) return;
-    let l = N.getTreeNode(r);
-    if (l) {
-      var a;
-      return l.nodeToRestore = (a = n.current) !== null && a !== void 0 ? a : void 0, () => {
-        let i = N.getTreeNode(r);
-        if (!i) return;
-        let f = i.nodeToRestore, u = T(o);
-        if (e && f && (u && k(u, r) || u === o.body && z(r))) {
-          let d = N.clone();
-          requestAnimationFrame(() => {
-            if (o.activeElement === o.body) {
-              let c = d.getTreeNode(r);
-              for (; c; ) {
-                if (c.nodeToRestore && c.nodeToRestore.isConnected) {
-                  U(c.nodeToRestore);
-                  return;
-                }
-                c = c.parent;
-              }
-              for (c = d.getTreeNode(r); c; ) {
-                if (c.scopeRef && c.scopeRef.current && N.getTreeNode(c.scopeRef)) {
-                  let s = H(c.scopeRef.current, !0);
-                  U(s);
-                  return;
-                }
-                c = c.parent;
-              }
-            }
-          });
-        }
-      };
-    }
-  }, [
-    r,
-    e
-  ]);
-}
-function U(r) {
-  r.dispatchEvent(new CustomEvent(M, {
-    bubbles: !0,
-    cancelable: !0
-  })) && p(r);
-}
-function E(r, e, t) {
-  let n = e?.tabbable ? B : G, o = r?.nodeType === Node.ELEMENT_NODE ? r : null, l = $(o), a = ee(l, r || l, NodeFilter.SHOW_ELEMENT, {
-    acceptNode(i) {
-      var f;
-      return !(e == null || (f = e.from) === null || f === void 0) && f.contains(i) || e?.tabbable && i.tagName === "INPUT" && i.getAttribute("type") === "radio" && (!re(i) || a.currentNode.tagName === "INPUT" && a.currentNode.type === "radio" && a.currentNode.name === i.name) ? NodeFilter.FILTER_REJECT : n(i) && (!t || w(i, t)) && (!e?.accept || e.accept(i)) ? NodeFilter.FILTER_ACCEPT : NodeFilter.FILTER_SKIP;
-    }
-  });
-  return e?.from && (a.currentNode = e.from), a;
-}
-function he(r, e = {}) {
-  return {
-    focusNext(t = {}) {
-      let n = r.current;
-      if (!n) return null;
-      let { from: o, tabbable: l = e.tabbable, wrap: a = e.wrap, accept: i = e.accept } = t, f = o || T($(n)), u = E(n, {
-        tabbable: l,
-        accept: i
-      });
-      n.contains(f) && (u.currentNode = f);
-      let d = u.nextNode();
-      return !d && a && (u.currentNode = n, d = u.nextNode()), d && p(d, !0), d;
-    },
-    focusPrevious(t = e) {
-      let n = r.current;
-      if (!n) return null;
-      let { from: o, tabbable: l = e.tabbable, wrap: a = e.wrap, accept: i = e.accept } = t, f = o || T($(n)), u = E(n, {
-        tabbable: l,
-        accept: i
-      });
-      if (n.contains(f)) u.currentNode = f;
-      else {
-        let c = I(u);
-        return c && p(c, !0), c ?? null;
-      }
-      let d = u.previousNode();
-      if (!d && a) {
-        u.currentNode = n;
-        let c = I(u);
-        if (!c)
-          return null;
-        d = c;
-      }
-      return d && p(d, !0), d ?? null;
-    },
-    focusFirst(t = e) {
-      let n = r.current;
-      if (!n) return null;
-      let { tabbable: o = e.tabbable, accept: l = e.accept } = t, i = E(n, {
-        tabbable: o,
-        accept: l
-      }).nextNode();
-      return i && p(i, !0), i;
-    },
-    focusLast(t = e) {
-      let n = r.current;
-      if (!n) return null;
-      let { tabbable: o = e.tabbable, accept: l = e.accept } = t, a = E(n, {
-        tabbable: o,
-        accept: l
-      }), i = I(a);
-      return i && p(i, !0), i ?? null;
-    }
-  };
-}
-function I(r) {
-  let e, t;
-  do
-    t = r.lastChild(), t && (e = t);
-  while (t);
-  return e;
-}
-class P {
-  get size() {
-    return this.fastMap.size;
-  }
-  getTreeNode(e) {
-    return this.fastMap.get(e);
-  }
-  addTreeNode(e, t, n) {
-    let o = this.fastMap.get(t ?? null);
-    if (!o) return;
-    let l = new K({
-      scopeRef: e
-    });
-    o.addChild(l), l.parent = o, this.fastMap.set(e, l), n && (l.nodeToRestore = n);
-  }
-  addNode(e) {
-    this.fastMap.set(e.scopeRef, e);
-  }
-  removeTreeNode(e) {
-    if (e === null) return;
-    let t = this.fastMap.get(e);
-    if (!t) return;
-    let n = t.parent;
-    for (let l of this.traverse()) l !== t && t.nodeToRestore && l.nodeToRestore && t.scopeRef && t.scopeRef.current && w(l.nodeToRestore, t.scopeRef.current) && (l.nodeToRestore = t.nodeToRestore);
-    let o = t.children;
-    n && (n.removeChild(t), o.size > 0 && o.forEach((l) => n && n.addChild(l))), this.fastMap.delete(t.scopeRef);
-  }
-  // Pre Order Depth First
-  *traverse(e = this.root) {
-    if (e.scopeRef != null && (yield e), e.children.size > 0) for (let t of e.children) yield* this.traverse(t);
-  }
-  clone() {
-    var e;
-    let t = new P();
-    var n;
-    for (let o of this.traverse()) t.addTreeNode(o.scopeRef, (n = (e = o.parent) === null || e === void 0 ? void 0 : e.scopeRef) !== null && n !== void 0 ? n : null, o.nodeToRestore);
-    return t;
-  }
-  constructor() {
-    this.fastMap = /* @__PURE__ */ new Map(), this.root = new K({
-      scopeRef: null
-    }), this.fastMap.set(null, this.root);
-  }
-}
-class K {
-  addChild(e) {
-    this.children.add(e), e.parent = this;
-  }
-  removeChild(e) {
-    this.children.delete(e), e.parent = void 0;
-  }
-  constructor(e) {
-    this.children = /* @__PURE__ */ new Set(), this.contain = !1, this.scopeRef = e.scopeRef;
-  }
-}
-let N = /* @__PURE__ */ new P();
-export {
-  he as $,
-  be as a,
-  E as b,
-  ve as c
-};
-//# sourceMappingURL=FocusScope-C1Aw7j9H.es.js.map