@commercetools/nimbus 2.9.1 → 2.10.0

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

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