@midas-ds/components 1.0.2 → 1.1.0

package/FocusScope-B7CkxXNC.js

@@ -0,0 +1,513 @@
+import { s as H, l as T, t as N, u as W, v as G, w as J, x as Y } from "./useFocusRing-9PXyKy2A.js";
+import L, { useRef as y, useContext as Q, useMemo as R, useEffect as B } from "react";
+function X(e) {
+  const t = H(e);
+  if (!(e instanceof t.HTMLElement) && !(e instanceof t.SVGElement)) return !1;
+  let { display: n, visibility: a } = e.style, r = n !== "none" && a !== "hidden" && a !== "collapse";
+  if (r) {
+    const { getComputedStyle: u } = e.ownerDocument.defaultView;
+    let { display: d, visibility: o } = u(e);
+    r = d !== "none" && o !== "hidden" && o !== "collapse";
+  }
+  return r;
+}
+function Z(e, t) {
+  return !e.hasAttribute("hidden") && // Ignore HiddenSelect when tree walking.
+  !e.hasAttribute("data-react-aria-prevent-focus") && (e.nodeName === "DETAILS" && t && t.nodeName !== "SUMMARY" ? e.hasAttribute("open") : !0);
+}
+function j(e, t) {
+  return e.nodeName !== "#comment" && X(e) && Z(e, t) && (!e.parentElement || j(e.parentElement, e));
+}
+const I = /* @__PURE__ */ L.createContext(null), k = "react-aria-focus-scope-restore";
+let f = null;
+function le(e) {
+  let { children: t, contain: n, restoreFocus: a, autoFocus: r } = e, u = y(null), d = y(null), o = y([]), { parentNode: p } = Q(I) || {}, l = R(() => new A({
+    scopeRef: o
+  }), [
+    o
+  ]);
+  T(() => {
+    let s = p || v.root;
+    if (v.getTreeNode(s.scopeRef) && f && !F(f, s.scopeRef)) {
+      let b = v.getTreeNode(f);
+      b && (s = b);
+    }
+    s.addChild(l), v.addNode(l);
+  }, [
+    l,
+    p
+  ]), T(() => {
+    let s = v.getTreeNode(o);
+    s && (s.contain = !!n);
+  }, [
+    n
+  ]), T(() => {
+    var s;
+    let b = (s = u.current) === null || s === void 0 ? void 0 : s.nextSibling, $ = [], x = (_) => _.stopPropagation();
+    for (; b && b !== d.current; )
+      $.push(b), b.addEventListener(k, x), b = b.nextSibling;
+    return o.current = $, () => {
+      for (let _ of $) _.removeEventListener(k, x);
+    };
+  }, [
+    t
+  ]), re(o, a, n), te(o, n), ae(o, a, n), ne(o, r), B(() => {
+    const s = N(o.current ? o.current[0] : void 0).activeElement;
+    let b = null;
+    if (h(s, o.current)) {
+      for (let $ of v.traverse()) $.scopeRef && h(s, $.scopeRef.current) && (b = $);
+      b === v.getTreeNode(o) && (f = b.scopeRef);
+    }
+  }, [
+    o
+  ]), T(() => () => {
+    var s, b, $;
+    let x = ($ = (b = v.getTreeNode(o)) === null || b === void 0 || (s = b.parent) === null || s === void 0 ? void 0 : s.scopeRef) !== null && $ !== void 0 ? $ : null;
+    (o === f || F(o, f)) && (!x || v.getTreeNode(x)) && (f = x), v.removeTreeNode(o);
+  }, [
+    o
+  ]);
+  let i = R(() => O(o), []), c = R(() => ({
+    focusManager: i,
+    parentNode: l
+  }), [
+    l,
+    i
+  ]);
+  return /* @__PURE__ */ L.createElement(I.Provider, {
+    value: c
+  }, /* @__PURE__ */ L.createElement("span", {
+    "data-focus-scope-start": !0,
+    hidden: !0,
+    ref: u
+  }), t, /* @__PURE__ */ L.createElement("span", {
+    "data-focus-scope-end": !0,
+    hidden: !0,
+    ref: d
+  }));
+}
+function O(e) {
+  return {
+    focusNext(t = {}) {
+      let n = e.current, { from: a, tabbable: r, wrap: u, accept: d } = t, o = a || N(n[0]).activeElement, p = n[0].previousElementSibling, l = w(n), i = m(l, {
+        tabbable: r,
+        accept: d
+      }, n);
+      i.currentNode = h(o, n) ? o : p;
+      let c = i.nextNode();
+      return !c && u && (i.currentNode = p, c = i.nextNode()), c && E(c, !0), c;
+    },
+    focusPrevious(t = {}) {
+      let n = e.current, { from: a, tabbable: r, wrap: u, accept: d } = t, o = a || N(n[0]).activeElement, p = n[n.length - 1].nextElementSibling, l = w(n), i = m(l, {
+        tabbable: r,
+        accept: d
+      }, n);
+      i.currentNode = h(o, n) ? o : p;
+      let c = i.previousNode();
+      return !c && u && (i.currentNode = p, c = i.previousNode()), c && E(c, !0), c;
+    },
+    focusFirst(t = {}) {
+      let n = e.current, { tabbable: a, accept: r } = t, u = w(n), d = m(u, {
+        tabbable: a,
+        accept: r
+      }, n);
+      d.currentNode = n[0].previousElementSibling;
+      let o = d.nextNode();
+      return o && E(o, !0), o;
+    },
+    focusLast(t = {}) {
+      let n = e.current, { tabbable: a, accept: r } = t, u = w(n), d = m(u, {
+        tabbable: a,
+        accept: r
+      }, n);
+      d.currentNode = n[n.length - 1].nextElementSibling;
+      let o = d.previousNode();
+      return o && E(o, !0), o;
+    }
+  };
+}
+const K = [
+  "input:not([disabled]):not([type=hidden])",
+  "select:not([disabled])",
+  "textarea:not([disabled])",
+  "button:not([disabled])",
+  "a[href]",
+  "area[href]",
+  "summary",
+  "iframe",
+  "object",
+  "embed",
+  "audio[controls]",
+  "video[controls]",
+  '[contenteditable]:not([contenteditable^="false"])'
+], z = K.join(":not([hidden]),") + ",[tabindex]:not([disabled]):not([hidden])";
+K.push('[tabindex]:not([tabindex="-1"]):not([disabled])');
+const ee = K.join(':not([hidden]):not([tabindex="-1"]),');
+function ie(e) {
+  return e.matches(z);
+}
+function w(e) {
+  return e[0].parentElement;
+}
+function S(e) {
+  let t = v.getTreeNode(f);
+  for (; t && t.scopeRef !== e; ) {
+    if (t.contain) return !1;
+    t = t.parent;
+  }
+  return !0;
+}
+function te(e, t) {
+  let n = y(void 0), a = y(void 0);
+  T(() => {
+    let r = e.current;
+    if (!t) {
+      a.current && (cancelAnimationFrame(a.current), a.current = void 0);
+      return;
+    }
+    const u = N(r ? r[0] : void 0);
+    let d = (l) => {
+      if (l.key !== "Tab" || l.altKey || l.ctrlKey || l.metaKey || !S(e) || l.isComposing) return;
+      let i = u.activeElement, c = e.current;
+      if (!c || !h(i, c)) return;
+      let s = w(c), b = m(s, {
+        tabbable: !0
+      }, c);
+      if (!i) return;
+      b.currentNode = i;
+      let $ = l.shiftKey ? b.previousNode() : b.nextNode();
+      $ || (b.currentNode = l.shiftKey ? c[c.length - 1].nextElementSibling : c[0].previousElementSibling, $ = l.shiftKey ? b.previousNode() : b.nextNode()), l.preventDefault(), $ && E($, !0);
+    }, o = (l) => {
+      (!f || F(f, e)) && h(l.target, e.current) ? (f = e, n.current = l.target) : S(e) && !g(l.target, e) ? n.current ? n.current.focus() : f && f.current && M(f.current) : S(e) && (n.current = l.target);
+    }, p = (l) => {
+      a.current && cancelAnimationFrame(a.current), a.current = requestAnimationFrame(() => {
+        let i = Y();
+        if (!((i === "virtual" || i === null) && G() && J()) && u.activeElement && S(e) && !g(u.activeElement, e))
+          if (f = e, u.body.contains(l.target)) {
+            var s;
+            n.current = l.target, (s = n.current) === null || s === void 0 || s.focus();
+          } else f.current && M(f.current);
+      });
+    };
+    return u.addEventListener("keydown", d, !1), u.addEventListener("focusin", o, !1), r == null || r.forEach((l) => l.addEventListener("focusin", o, !1)), r == null || r.forEach((l) => l.addEventListener("focusout", p, !1)), () => {
+      u.removeEventListener("keydown", d, !1), u.removeEventListener("focusin", o, !1), r == null || r.forEach((l) => l.removeEventListener("focusin", o, !1)), r == null || r.forEach((l) => l.removeEventListener("focusout", p, !1));
+    };
+  }, [
+    e,
+    t
+  ]), T(() => () => {
+    a.current && cancelAnimationFrame(a.current);
+  }, [
+    a
+  ]);
+}
+function U(e) {
+  return g(e);
+}
+function h(e, t) {
+  return !e || !t ? !1 : t.some((n) => n.contains(e));
+}
+function g(e, t = null) {
+  if (e instanceof Element && e.closest("[data-react-aria-top-layer]")) return !0;
+  for (let { scopeRef: n } of v.traverse(v.getTreeNode(t)))
+    if (n && h(e, n.current)) return !0;
+  return !1;
+}
+function de(e) {
+  return g(e, f);
+}
+function F(e, t) {
+  var n;
+  let a = (n = v.getTreeNode(t)) === null || n === void 0 ? void 0 : n.parent;
+  for (; a; ) {
+    if (a.scopeRef === e) return !0;
+    a = a.parent;
+  }
+  return !1;
+}
+function E(e, t = !1) {
+  if (e != null && !t) try {
+    W(e);
+  } catch {
+  }
+  else if (e != null) try {
+    e.focus();
+  } catch {
+  }
+}
+function q(e, t = !0) {
+  let n = e[0].previousElementSibling, a = w(e), r = m(a, {
+    tabbable: t
+  }, e);
+  r.currentNode = n;
+  let u = r.nextNode();
+  return t && !u && (a = w(e), r = m(a, {
+    tabbable: !1
+  }, e), r.currentNode = n, u = r.nextNode()), u;
+}
+function M(e, t = !0) {
+  E(q(e, t));
+}
+function ne(e, t) {
+  const n = L.useRef(t);
+  B(() => {
+    if (n.current) {
+      f = e;
+      const a = N(e.current ? e.current[0] : void 0);
+      !h(a.activeElement, f.current) && e.current && M(e.current);
+    }
+    n.current = !1;
+  }, [
+    e
+  ]);
+}
+function re(e, t, n) {
+  T(() => {
+    if (t || n) return;
+    let a = e.current;
+    const r = N(a ? a[0] : void 0);
+    let u = (d) => {
+      let o = d.target;
+      h(o, e.current) ? f = e : U(o) || (f = null);
+    };
+    return r.addEventListener("focusin", u, !1), a == null || a.forEach((d) => d.addEventListener("focusin", u, !1)), () => {
+      r.removeEventListener("focusin", u, !1), a == null || a.forEach((d) => d.removeEventListener("focusin", u, !1));
+    };
+  }, [
+    e,
+    t,
+    n
+  ]);
+}
+function P(e) {
+  let t = v.getTreeNode(f);
+  for (; t && t.scopeRef !== e; ) {
+    if (t.nodeToRestore) return !1;
+    t = t.parent;
+  }
+  return (t == null ? void 0 : t.scopeRef) === e;
+}
+function ae(e, t, n) {
+  const a = y(typeof document < "u" ? N(e.current ? e.current[0] : void 0).activeElement : null);
+  T(() => {
+    let r = e.current;
+    const u = N(r ? r[0] : void 0);
+    if (!t || n) return;
+    let d = () => {
+      (!f || F(f, e)) && h(u.activeElement, e.current) && (f = e);
+    };
+    return u.addEventListener("focusin", d, !1), r == null || r.forEach((o) => o.addEventListener("focusin", d, !1)), () => {
+      u.removeEventListener("focusin", d, !1), r == null || r.forEach((o) => o.removeEventListener("focusin", d, !1));
+    };
+  }, [
+    e,
+    n
+  ]), T(() => {
+    const r = N(e.current ? e.current[0] : void 0);
+    if (!t) return;
+    let u = (d) => {
+      if (d.key !== "Tab" || d.altKey || d.ctrlKey || d.metaKey || !S(e) || d.isComposing) return;
+      let o = r.activeElement;
+      if (!g(o, e) || !P(e)) return;
+      let p = v.getTreeNode(e);
+      if (!p) return;
+      let l = p.nodeToRestore, i = m(r.body, {
+        tabbable: !0
+      });
+      i.currentNode = o;
+      let c = d.shiftKey ? i.previousNode() : i.nextNode();
+      if ((!l || !r.body.contains(l) || l === r.body) && (l = void 0, p.nodeToRestore = void 0), (!c || !g(c, e)) && l) {
+        i.currentNode = l;
+        do
+          c = d.shiftKey ? i.previousNode() : i.nextNode();
+        while (g(c, e));
+        d.preventDefault(), d.stopPropagation(), c ? E(c, !0) : U(l) ? E(l, !0) : o.blur();
+      }
+    };
+    return n || r.addEventListener("keydown", u, !0), () => {
+      n || r.removeEventListener("keydown", u, !0);
+    };
+  }, [
+    e,
+    t,
+    n
+  ]), T(() => {
+    const r = N(e.current ? e.current[0] : void 0);
+    if (!t) return;
+    let u = v.getTreeNode(e);
+    if (u) {
+      var d;
+      return u.nodeToRestore = (d = a.current) !== null && d !== void 0 ? d : void 0, () => {
+        let o = v.getTreeNode(e);
+        if (!o) return;
+        let p = o.nodeToRestore;
+        if (t && p && (r.activeElement && g(r.activeElement, e) || r.activeElement === r.body && P(e))) {
+          let l = v.clone();
+          requestAnimationFrame(() => {
+            if (r.activeElement === r.body) {
+              let i = l.getTreeNode(e);
+              for (; i; ) {
+                if (i.nodeToRestore && i.nodeToRestore.isConnected) {
+                  V(i.nodeToRestore);
+                  return;
+                }
+                i = i.parent;
+              }
+              for (i = l.getTreeNode(e); i; ) {
+                if (i.scopeRef && i.scopeRef.current && v.getTreeNode(i.scopeRef)) {
+                  let c = q(i.scopeRef.current, !0);
+                  V(c);
+                  return;
+                }
+                i = i.parent;
+              }
+            }
+          });
+        }
+      };
+    }
+  }, [
+    e,
+    t
+  ]);
+}
+function V(e) {
+  e.dispatchEvent(new CustomEvent(k, {
+    bubbles: !0,
+    cancelable: !0
+  })) && E(e);
+}
+function m(e, t, n) {
+  let a = t != null && t.tabbable ? ee : z, r = N(e).createTreeWalker(e, NodeFilter.SHOW_ELEMENT, {
+    acceptNode(u) {
+      var d;
+      return !(t == null || (d = t.from) === null || d === void 0) && d.contains(u) ? NodeFilter.FILTER_REJECT : u.matches(a) && j(u) && (!n || h(u, n)) && (!(t != null && t.accept) || t.accept(u)) ? NodeFilter.FILTER_ACCEPT : NodeFilter.FILTER_SKIP;
+    }
+  });
+  return t != null && t.from && (r.currentNode = t.from), r;
+}
+function ce(e, t = {}) {
+  return {
+    focusNext(n = {}) {
+      let a = e.current;
+      if (!a) return null;
+      let { from: r, tabbable: u = t.tabbable, wrap: d = t.wrap, accept: o = t.accept } = n, p = r || N(a).activeElement, l = m(a, {
+        tabbable: u,
+        accept: o
+      });
+      a.contains(p) && (l.currentNode = p);
+      let i = l.nextNode();
+      return !i && d && (l.currentNode = a, i = l.nextNode()), i && E(i, !0), i;
+    },
+    focusPrevious(n = t) {
+      let a = e.current;
+      if (!a) return null;
+      let { from: r, tabbable: u = t.tabbable, wrap: d = t.wrap, accept: o = t.accept } = n, p = r || N(a).activeElement, l = m(a, {
+        tabbable: u,
+        accept: o
+      });
+      if (a.contains(p)) l.currentNode = p;
+      else {
+        let c = C(l);
+        return c && E(c, !0), c ?? null;
+      }
+      let i = l.previousNode();
+      if (!i && d) {
+        l.currentNode = a;
+        let c = C(l);
+        if (!c)
+          return null;
+        i = c;
+      }
+      return i && E(i, !0), i ?? null;
+    },
+    focusFirst(n = t) {
+      let a = e.current;
+      if (!a) return null;
+      let { tabbable: r = t.tabbable, accept: u = t.accept } = n, o = m(a, {
+        tabbable: r,
+        accept: u
+      }).nextNode();
+      return o && E(o, !0), o;
+    },
+    focusLast(n = t) {
+      let a = e.current;
+      if (!a) return null;
+      let { tabbable: r = t.tabbable, accept: u = t.accept } = n, d = m(a, {
+        tabbable: r,
+        accept: u
+      }), o = C(d);
+      return o && E(o, !0), o ?? null;
+    }
+  };
+}
+function C(e) {
+  let t, n;
+  do
+    n = e.lastChild(), n && (t = n);
+  while (n);
+  return t;
+}
+class D {
+  get size() {
+    return this.fastMap.size;
+  }
+  getTreeNode(t) {
+    return this.fastMap.get(t);
+  }
+  addTreeNode(t, n, a) {
+    let r = this.fastMap.get(n ?? null);
+    if (!r) return;
+    let u = new A({
+      scopeRef: t
+    });
+    r.addChild(u), u.parent = r, this.fastMap.set(t, u), a && (u.nodeToRestore = a);
+  }
+  addNode(t) {
+    this.fastMap.set(t.scopeRef, t);
+  }
+  removeTreeNode(t) {
+    if (t === null) return;
+    let n = this.fastMap.get(t);
+    if (!n) return;
+    let a = n.parent;
+    for (let u of this.traverse()) u !== n && n.nodeToRestore && u.nodeToRestore && n.scopeRef && n.scopeRef.current && h(u.nodeToRestore, n.scopeRef.current) && (u.nodeToRestore = n.nodeToRestore);
+    let r = n.children;
+    a && (a.removeChild(n), r.size > 0 && r.forEach((u) => a && a.addChild(u))), this.fastMap.delete(n.scopeRef);
+  }
+  // Pre Order Depth First
+  *traverse(t = this.root) {
+    if (t.scopeRef != null && (yield t), t.children.size > 0) for (let n of t.children) yield* this.traverse(n);
+  }
+  clone() {
+    var t;
+    let n = new D();
+    var a;
+    for (let r of this.traverse()) n.addTreeNode(r.scopeRef, (a = (t = r.parent) === null || t === void 0 ? void 0 : t.scopeRef) !== null && a !== void 0 ? a : null, r.nodeToRestore);
+    return n;
+  }
+  constructor() {
+    this.fastMap = /* @__PURE__ */ new Map(), this.root = new A({
+      scopeRef: null
+    }), this.fastMap.set(null, this.root);
+  }
+}
+class A {
+  addChild(t) {
+    this.children.add(t), t.parent = this;
+  }
+  removeChild(t) {
+    this.children.delete(t), t.parent = void 0;
+  }
+  constructor(t) {
+    this.children = /* @__PURE__ */ new Set(), this.contain = !1, this.scopeRef = t.scopeRef;
+  }
+}
+let v = new D();
+export {
+  m as $,
+  le as a,
+  ie as b,
+  de as c,
+  ce as d
+};