@midas-ds/components 12.0.0 → 12.1.0

package/{FocusScope-CEgd3xCY.js → FocusScope-Bj40Ir-g.js}

@@ -1,33 +1,33 @@
-import { i as G, e as P, h as B, c as T, b as $, j as J, k as Y, d as _ } from "./utils-CuqJqFqQ.js";
-import { $ as m } from "./mergeProps-BYJQ6N1s.js";
-import { e as Q, f as X, g as Z } from "./useHover-D8fja4GW.js";
-import { b as O } from "./useFocusable-ZjCKo1ed.js";
-import F, { useRef as g, useContext as ee, useMemo as L, useEffect as H } from "react";
-class te {
+import { i as j, e as D, c as T, b as $, j as B, k as G, d as S } from "./utils-DFIwp4PB.js";
+import { $ as m } from "./mergeProps-BSsN7Bgk.js";
+import { d as V, e as Q, f as X } from "./useHover-D6bNIkU0.js";
+import { b as Y } from "./useFocusable-DXlMChFC.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 (!P(this.root, e)) throw new Error("Cannot set currentNode to a node that is not contained by the root node.");
+    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 l = n, i = this._doc.createTreeWalker(l, this.whatToShow, {
+      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 = l.host;
+      t.push(i), i.currentNode = o, this._currentSetFor.add(i), n = o = a.host;
     } else n = n.parentNode;
-    const a = this._doc.createTreeWalker(this.root, this.whatToShow, {
+    const l = this._doc.createTreeWalker(this.root, this.whatToShow, {
       acceptNode: this._acceptNode
     });
-    t.push(a), a.currentNode = o, this._currentSetFor.add(a), this._walkerStack = t;
+    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 P(e, t) ? (t && (this.currentNode = t), t) : (this.currentNode = e, null);
+    return D(e, t) ? (t && (this.currentNode = t), t) : (this.currentNode = e, null);
   }
   lastChild() {
     let t = this._walkerStack[0].lastChild();
@@ -41,8 +41,8 @@ class te {
         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 a = this.nextNode();
-        return a && (this.currentNode = a), a;
+        let l = this.nextNode();
+        return l && (this.currentNode = l), l;
       }
       return e && (this.currentNode = e), e;
     } else if (this._walkerStack.length > 1) {
@@ -66,11 +66,11 @@ class te {
     if (t) {
       if (t.shadowRoot) {
         var n;
-        let a;
-        if (typeof this.filter == "function" ? a = this.filter(t) : !((n = this.filter) === null || n === void 0) && n.acceptNode && (a = this.filter.acceptNode(t)), a === NodeFilter.FILTER_ACCEPT)
+        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 l = this.lastChild();
-        return l && (this.currentNode = l), l;
+        let a = this.lastChild();
+        return a && (this.currentNode = a), a;
       }
       return t && (this.currentNode = t), t;
     } else if (this._walkerStack.length > 1) {
@@ -98,9 +98,9 @@ class te {
     return null;
   }
   constructor(e, t, n, o) {
-    this._walkerStack = [], this._currentSetFor = /* @__PURE__ */ new Set(), this._acceptNode = (l) => {
-      if (l.nodeType === Node.ELEMENT_NODE) {
-        const f = l.shadowRoot;
+    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
@@ -108,55 +108,37 @@ class te {
           return this._walkerStack.unshift(u), NodeFilter.FILTER_ACCEPT;
         } else {
           var i;
-          if (typeof this.filter == "function") return this.filter(l);
-          if (!((i = this.filter) === null || i === void 0) && i.acceptNode) return this.filter.acceptNode(l);
+          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 a = t.shadowRoot;
-    if (a) {
-      const l = this._doc.createTreeWalker(a, this.whatToShow, {
+    const l = t.shadowRoot;
+    if (l) {
+      const a = this._doc.createTreeWalker(l, this.whatToShow, {
         acceptNode: this._acceptNode
       });
-      this._walkerStack.unshift(l);
+      this._walkerStack.unshift(a);
     }
   }
 }
-function re(r, e, t, n) {
-  return G() ? new te(r, e, t, n) : r.createTreeWalker(e, t, n);
-}
-function ne(r) {
-  const e = B(r);
-  if (!(r instanceof e.HTMLElement) && !(r instanceof e.SVGElement)) return !1;
-  let { display: t, visibility: n } = r.style, o = t !== "none" && n !== "hidden" && n !== "collapse";
-  if (o) {
-    const { getComputedStyle: a } = r.ownerDocument.defaultView;
-    let { display: l, visibility: i } = a(r);
-    o = l !== "none" && i !== "hidden" && i !== "collapse";
-  }
-  return o;
-}
-function oe(r, e) {
-  return !r.hasAttribute("hidden") && // Ignore HiddenSelect when tree walking.
-  !r.hasAttribute("data-react-aria-prevent-focus") && (r.nodeName === "DETAILS" && e && e.nodeName !== "SUMMARY" ? r.hasAttribute("open") : !0);
-}
-function U(r, e) {
-  return r.nodeName !== "#comment" && ne(r) && oe(r, e) && (!r.parentElement || U(r.parentElement, r));
+function ee(r, e, t, n) {
+  return j() ? new O(r, e, t, n) : r.createTreeWalker(e, t, n);
 }
-const W = /* @__PURE__ */ F.createContext(null), M = "react-aria-focus-scope-restore";
-let h = null;
-function ve(r) {
-  let { children: e, contain: t, restoreFocus: n, autoFocus: o } = r, a = g(null), l = g(null), i = g([]), { parentNode: f } = ee(W) || {}, u = L(() => new I({
+const W = /* @__PURE__ */ R.createContext(null), M = "react-aria-focus-scope-restore";
+let v = null;
+function fe(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) && h && !R(h, s.scopeRef)) {
-      let b = N.getTreeNode(h);
+    if (N.getTreeNode(s.scopeRef) && v && !y(v, s.scopeRef)) {
+      let b = N.getTreeNode(v);
       b && (s = b);
     }
     s.addChild(u), N.addNode(u);
@@ -170,141 +152,156 @@ function ve(r) {
     t
   ]), m(() => {
     var s;
-    let b = (s = a.current) === null || s === void 0 ? void 0 : s.nextSibling, v = [], x = (C) => C.stopPropagation();
-    for (; b && b !== l.current; )
-      v.push(b), b.addEventListener(M, x), b = b.nextSibling;
-    return i.current = v, () => {
-      for (let C of v) C.removeEventListener(M, x);
+    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
-  ]), ue(i, n, t), ae(i, t), ce(i, n, t), le(i, o), H(() => {
+  ]), 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 (E(s, i.current)) {
-      for (let v of N.traverse()) v.scopeRef && E(s, v.scopeRef.current) && (b = v);
-      b === N.getTreeNode(i) && (h = b.scopeRef);
+    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, v;
-    let x = (v = (b = N.getTreeNode(i)) === null || b === void 0 || (s = b.parent) === null || s === void 0 ? void 0 : s.scopeRef) !== null && v !== void 0 ? v : null;
-    (i === h || R(i, h)) && (!x || N.getTreeNode(x)) && (h = x), N.removeTreeNode(i);
+    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(() => ie(i), []), c = L(() => ({
+  let d = L(() => te(i), []), c = L(() => ({
     focusManager: d,
     parentNode: u
   }), [
     u,
     d
   ]);
-  return /* @__PURE__ */ F.createElement(W.Provider, {
+  return /* @__PURE__ */ R.createElement(W.Provider, {
     value: c
-  }, /* @__PURE__ */ F.createElement("span", {
+  }, /* @__PURE__ */ R.createElement("span", {
     "data-focus-scope-start": !0,
     hidden: !0,
-    ref: a
-  }), e, /* @__PURE__ */ F.createElement("span", {
+    ref: l
+  }), e, /* @__PURE__ */ R.createElement("span", {
     "data-focus-scope-end": !0,
     hidden: !0,
-    ref: l
+    ref: a
   }));
 }
-function ie(r) {
+function te(r) {
   return {
     focusNext(e = {}) {
-      let t = r.current, { from: n, tabbable: o, wrap: a, accept: l } = 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 = S(t), c = w(d, {
+      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: l
+        accept: a
       }, t);
-      c.currentNode = E(f, t) ? f : u;
+      c.currentNode = w(f, t) ? f : u;
       let s = c.nextNode();
-      return !s && a && (c.currentNode = u, s = c.nextNode()), s && p(s, !0), s;
+      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: a, accept: l } = 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 = S(t), c = w(d, {
+      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: l
+        accept: a
       }, t);
-      c.currentNode = E(f, t) ? f : u;
+      c.currentNode = w(f, t) ? f : u;
       let s = c.previousNode();
-      return !s && a && (c.currentNode = u, s = c.previousNode()), s && p(s, !0), s;
+      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, a = S(t), l = w(a, {
+      let t = r.current, { tabbable: n, accept: o } = e, l = g(t), a = E(l, {
         tabbable: n,
         accept: o
       }, t);
-      l.currentNode = t[0].previousElementSibling;
-      let i = l.nextNode();
+      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, a = S(t), l = w(a, {
+      let t = r.current, { tabbable: n, accept: o } = e, l = g(t), a = E(l, {
         tabbable: n,
         accept: o
       }, t);
-      l.currentNode = t[t.length - 1].nextElementSibling;
-      let i = l.previousNode();
+      a.currentNode = t[t.length - 1].nextElementSibling;
+      let i = a.previousNode();
       return i && p(i, !0), i;
     }
   };
 }
-function S(r) {
+function g(r) {
   return r[0].parentElement;
 }
-function y(r) {
-  let e = N.getTreeNode(h);
+function F(r) {
+  let e = N.getTreeNode(v);
   for (; e && e.scopeRef !== r; ) {
     if (e.contain) return !1;
     e = e.parent;
   }
   return !0;
 }
-function ae(r, e) {
-  let t = g(void 0), n = g(void 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 a = $(o ? o[0] : void 0);
-    let l = (u) => {
-      if (u.key !== "Tab" || u.altKey || u.ctrlKey || u.metaKey || !y(r) || u.isComposing) return;
-      let d = T(a), c = r.current;
-      if (!c || !E(d, c)) return;
-      let s = S(c), b = w(s, {
+    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 v = u.shiftKey ? b.previousNode() : b.nextNode();
-      v || (b.currentNode = u.shiftKey ? c[c.length - 1].nextElementSibling : c[0].previousElementSibling, v = u.shiftKey ? b.previousNode() : b.nextNode()), u.preventDefault(), v && p(v, !0);
+      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) => {
-      (!h || R(h, r)) && E(_(u), r.current) ? (h = r, t.current = _(u)) : y(r) && !k(_(u), r) ? t.current ? t.current.focus() : h && h.current && D(h.current) : y(r) && (t.current = _(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 = Z(), c = (d === "virtual" || d === null) && Q() && X(), s = T(a);
-        if (!c && s && y(r) && !k(s, r)) {
-          h = r;
-          let v = _(u);
-          if (v && v.isConnected) {
+        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 = v, (b = t.current) === null || b === void 0 || b.focus();
-          } else h.current && D(h.current);
+            t.current = h, (b = t.current) === null || b === void 0 || b.focus();
+          } else v.current && A(v.current);
         }
       });
     };
-    return a.addEventListener("keydown", l, !1), a.addEventListener("focusin", i, !1), o == null || o.forEach((u) => u.addEventListener("focusin", i, !1)), o == null || o.forEach((u) => u.addEventListener("focusout", f, !1)), () => {
-      a.removeEventListener("keydown", l, !1), a.removeEventListener("focusin", i, !1), o == null || o.forEach((u) => u.removeEventListener("focusin", i, !1)), o == null || o.forEach((u) => u.removeEventListener("focusout", f, !1));
+    return l.addEventListener("keydown", a, !1), l.addEventListener("focusin", i, !1), o == null || o.forEach((u) => u.addEventListener("focusin", i, !1)), o == null || o.forEach((u) => u.addEventListener("focusout", f, !1)), () => {
+      l.removeEventListener("keydown", a, !1), l.removeEventListener("focusin", i, !1), o == null || o.forEach((u) => u.removeEventListener("focusin", i, !1)), o == null || o.forEach((u) => u.removeEventListener("focusout", f, !1));
     };
   }, [
     r,
@@ -315,22 +312,22 @@ function ae(r, e) {
     n
   ]);
 }
-function j(r) {
+function J(r) {
   return k(r);
 }
-function E(r, e) {
+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 && E(r, t.current)) return !0;
+    if (t && w(r, t.current)) return !0;
   return !1;
 }
-function Ne(r) {
-  return k(r, h);
+function be(r) {
+  return k(r, v);
 }
-function R(r, e) {
+function y(r, e) {
   var t;
   let n = (t = N.getTreeNode(e)) === null || t === void 0 ? void 0 : t.parent;
   for (; n; ) {
@@ -341,7 +338,7 @@ function R(r, e) {
 }
 function p(r, e = !1) {
   if (r != null && !e) try {
-    O(r);
+    Y(r);
   } catch {
   }
   else if (r != null) try {
@@ -349,43 +346,43 @@ function p(r, e = !1) {
   } catch {
   }
 }
-function q(r, e = !0) {
-  let t = r[0].previousElementSibling, n = S(r), o = w(n, {
+function H(r, e = !0) {
+  let t = r[0].previousElementSibling, n = g(r), o = E(n, {
     tabbable: e
   }, r);
   o.currentNode = t;
-  let a = o.nextNode();
-  return e && !a && (n = S(r), o = w(n, {
+  let l = o.nextNode();
+  return e && !l && (n = g(r), o = E(n, {
     tabbable: !1
-  }, r), o.currentNode = t, a = o.nextNode()), a;
+  }, r), o.currentNode = t, l = o.nextNode()), l;
 }
-function D(r, e = !0) {
-  p(q(r, e));
+function A(r, e = !0) {
+  p(H(r, e));
 }
-function le(r, e) {
-  const t = F.useRef(e);
-  H(() => {
+function oe(r, e) {
+  const t = R.useRef(e);
+  q(() => {
     if (t.current) {
-      h = r;
+      v = r;
       const n = $(r.current ? r.current[0] : void 0);
-      !E(T(n), h.current) && r.current && D(r.current);
+      !w(T(n), v.current) && r.current && A(r.current);
     }
     t.current = !1;
   }, [
     r
   ]);
 }
-function ue(r, e, t) {
+function ie(r, e, t) {
   m(() => {
     if (e || t) return;
     let n = r.current;
     const o = $(n ? n[0] : void 0);
-    let a = (l) => {
-      let i = _(l);
-      E(i, r.current) ? h = r : j(i) || (h = null);
+    let l = (a) => {
+      let i = S(a);
+      w(i, r.current) ? v = r : J(i) || (v = null);
     };
-    return o.addEventListener("focusin", a, !1), n == null || n.forEach((l) => l.addEventListener("focusin", a, !1)), () => {
-      o.removeEventListener("focusin", a, !1), n == null || n.forEach((l) => l.removeEventListener("focusin", a, !1));
+    return o.addEventListener("focusin", l, !1), n == null || n.forEach((a) => a.addEventListener("focusin", l, !1)), () => {
+      o.removeEventListener("focusin", l, !1), n == null || n.forEach((a) => a.removeEventListener("focusin", l, !1));
     };
   }, [
     r,
@@ -393,25 +390,25 @@ function ue(r, e, t) {
     t
   ]);
 }
-function V(r) {
-  let e = N.getTreeNode(h);
+function z(r) {
+  let e = N.getTreeNode(v);
   for (; e && e.scopeRef !== r; ) {
     if (e.nodeToRestore) return !1;
     e = e.parent;
   }
   return (e == null ? void 0 : e.scopeRef) === r;
 }
-function ce(r, e, t) {
-  const n = g(typeof document < "u" ? T($(r.current ? r.current[0] : void 0)) : null);
+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 a = $(o ? o[0] : void 0);
+    const l = $(o ? o[0] : void 0);
     if (!e || t) return;
-    let l = () => {
-      (!h || R(h, r)) && E(T(a), r.current) && (h = r);
+    let a = () => {
+      (!v || y(v, r)) && w(T(l), r.current) && (v = r);
     };
-    return a.addEventListener("focusin", l, !1), o == null || o.forEach((i) => i.addEventListener("focusin", l, !1)), () => {
-      a.removeEventListener("focusin", l, !1), o == null || o.forEach((i) => i.removeEventListener("focusin", l, !1));
+    return l.addEventListener("focusin", a, !1), o == null || o.forEach((i) => i.addEventListener("focusin", a, !1)), () => {
+      l.removeEventListener("focusin", a, !1), o == null || o.forEach((i) => i.removeEventListener("focusin", a, !1));
     };
   }, [
     r,
@@ -419,27 +416,27 @@ function ce(r, e, t) {
   ]), m(() => {
     const o = $(r.current ? r.current[0] : void 0);
     if (!e) return;
-    let a = (l) => {
-      if (l.key !== "Tab" || l.altKey || l.ctrlKey || l.metaKey || !y(r) || l.isComposing) 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) || !V(r)) return;
+      if (!k(i, r) || !z(r)) return;
       let f = N.getTreeNode(r);
       if (!f) return;
-      let u = f.nodeToRestore, d = w(o.body, {
+      let u = f.nodeToRestore, d = E(o.body, {
         tabbable: !0
       });
       d.currentNode = i;
-      let c = l.shiftKey ? d.previousNode() : d.nextNode();
+      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 = l.shiftKey ? d.previousNode() : d.nextNode();
+          c = a.shiftKey ? d.previousNode() : d.nextNode();
         while (k(c, r));
-        l.preventDefault(), l.stopPropagation(), c ? p(c, !0) : j(u) ? p(u, !0) : i.blur();
+        a.preventDefault(), a.stopPropagation(), c ? p(c, !0) : J(u) ? p(u, !0) : i.blur();
       }
     };
-    return t || o.addEventListener("keydown", a, !0), () => {
-      t || o.removeEventListener("keydown", a, !0);
+    return t || o.addEventListener("keydown", l, !0), () => {
+      t || o.removeEventListener("keydown", l, !0);
     };
   }, [
     r,
@@ -448,29 +445,29 @@ function ce(r, e, t) {
   ]), m(() => {
     const o = $(r.current ? r.current[0] : void 0);
     if (!e) return;
-    let a = N.getTreeNode(r);
-    if (a) {
-      var l;
-      return a.nodeToRestore = (l = n.current) !== null && l !== void 0 ? l : void 0, () => {
+    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 && V(r))) {
+        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) {
-                  z(c.nodeToRestore);
+                  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 = q(c.scopeRef.current, !0);
-                  z(s);
+                  let s = H(c.scopeRef.current, !0);
+                  U(s);
                   return;
                 }
                 c = c.parent;
@@ -485,50 +482,50 @@ function ce(r, e, t) {
     e
   ]);
 }
-function z(r) {
+function U(r) {
   r.dispatchEvent(new CustomEvent(M, {
     bubbles: !0,
     cancelable: !0
   })) && p(r);
 }
-function w(r, e, t) {
-  let n = e != null && e.tabbable ? J : Y, o = (r == null ? void 0 : r.nodeType) === Node.ELEMENT_NODE ? r : null, a = $(o), l = re(a, r || a, NodeFilter.SHOW_ELEMENT, {
+function E(r, e, t) {
+  let n = e != null && e.tabbable ? B : G, o = (r == null ? void 0 : 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) ? NodeFilter.FILTER_REJECT : n(i) && U(i) && (!t || E(i, t)) && (!(e != null && e.accept) || e.accept(i)) ? NodeFilter.FILTER_ACCEPT : NodeFilter.FILTER_SKIP;
+      return !(e == null || (f = e.from) === null || f === void 0) && f.contains(i) || e != null && 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 != null && e.accept) || e.accept(i)) ? NodeFilter.FILTER_ACCEPT : NodeFilter.FILTER_SKIP;
     }
   });
-  return e != null && e.from && (l.currentNode = e.from), l;
+  return e != null && e.from && (a.currentNode = e.from), a;
 }
-function pe(r, e = {}) {
+function ve(r, e = {}) {
   return {
     focusNext(t = {}) {
       let n = r.current;
       if (!n) return null;
-      let { from: o, tabbable: a = e.tabbable, wrap: l = e.wrap, accept: i = e.accept } = t, f = o || T($(n)), u = w(n, {
-        tabbable: a,
+      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 && l && (u.currentNode = n, d = u.nextNode()), d && p(d, !0), d;
+      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: a = e.tabbable, wrap: l = e.wrap, accept: i = e.accept } = t, f = o || T($(n)), u = w(n, {
-        tabbable: a,
+      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 = A(u);
+        let c = I(u);
         return c && p(c, !0), c ?? null;
       }
       let d = u.previousNode();
-      if (!d && l) {
+      if (!d && a) {
         u.currentNode = n;
-        let c = A(u);
+        let c = I(u);
         if (!c)
           return null;
         d = c;
@@ -538,31 +535,31 @@ function pe(r, e = {}) {
     focusFirst(t = e) {
       let n = r.current;
       if (!n) return null;
-      let { tabbable: o = e.tabbable, accept: a = e.accept } = t, i = w(n, {
+      let { tabbable: o = e.tabbable, accept: l = e.accept } = t, i = E(n, {
         tabbable: o,
-        accept: a
+        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: a = e.accept } = t, l = w(n, {
+      let { tabbable: o = e.tabbable, accept: l = e.accept } = t, a = E(n, {
         tabbable: o,
-        accept: a
-      }), i = A(l);
+        accept: l
+      }), i = I(a);
       return i && p(i, !0), i ?? null;
     }
   };
 }
-function A(r) {
+function I(r) {
   let e, t;
   do
     t = r.lastChild(), t && (e = t);
   while (t);
   return e;
 }
-class K {
+class P {
   get size() {
     return this.fastMap.size;
   }
@@ -572,10 +569,10 @@ class K {
   addTreeNode(e, t, n) {
     let o = this.fastMap.get(t ?? null);
     if (!o) return;
-    let a = new I({
+    let l = new K({
       scopeRef: e
     });
-    o.addChild(a), a.parent = o, this.fastMap.set(e, a), n && (a.nodeToRestore = n);
+    o.addChild(l), l.parent = o, this.fastMap.set(e, l), n && (l.nodeToRestore = n);
   }
   addNode(e) {
     this.fastMap.set(e.scopeRef, e);
@@ -585,9 +582,9 @@ class K {
     let t = this.fastMap.get(e);
     if (!t) return;
     let n = t.parent;
-    for (let a of this.traverse()) a !== t && t.nodeToRestore && a.nodeToRestore && t.scopeRef && t.scopeRef.current && E(a.nodeToRestore, t.scopeRef.current) && (a.nodeToRestore = t.nodeToRestore);
+    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((a) => n && n.addChild(a))), this.fastMap.delete(t.scopeRef);
+    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) {
@@ -595,18 +592,18 @@ class K {
   }
   clone() {
     var e;
-    let t = new K();
+    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 I({
+    this.fastMap = /* @__PURE__ */ new Map(), this.root = new K({
       scopeRef: null
     }), this.fastMap.set(null, this.root);
   }
 }
-class I {
+class K {
   addChild(e) {
     this.children.add(e), e.parent = this;
   }
@@ -617,10 +614,10 @@ class I {
     this.children = /* @__PURE__ */ new Set(), this.contain = !1, this.scopeRef = e.scopeRef;
   }
 }
-let N = new K();
+let N = new P();
 export {
-  w as $,
-  ve as a,
-  pe as b,
-  Ne as c
+  E as $,
+  fe as a,
+  ve as b,
+  be as c
 };