@midas-ds/components 14.0.0 → 15.0.0

package/{FocusScope-8ILtcq9W.js → SelectionIndicator-C2E23-zO.js}

@@ -1,14 +1,16 @@
-import { i as j, e as D, c as T, b as $, j as B, k as G, d as S } from "./utils-CrT5PVBA.js";
-import { $ as m } from "./mergeProps-Ct8m5-xW.js";
-import { d as V, e as Q, f as X } from "./useHover-zCCNtF6g.js";
-import { b as Y } from "./useFocusable-CCh54GIw.js";
-import R, { useRef as _, useContext as Z, useMemo as L, useEffect as q } from "react";
-class O {
+import { i as ie, e as H, c as x, b as $, d as L, j as le, k as ae } from "./utils-Dxh86KaB.js";
+import { $ as g } from "./mergeProps-Ct8m5-xW.js";
+import { f as ce, e as ue, g as de } from "./useHover-DkC5FyNd.js";
+import { b as se } from "./useFocusable-BJj-Bkig.js";
+import y, { useRef as R, useContext as V, useMemo as K, useEffect as Y, createContext as Q, forwardRef as Z, useState as fe } from "react";
+import { b as be, a as ve, $ as he } from "./utils-D2iKpxcZ.js";
+import { flushSync as j } from "react-dom";
+class Ne {
   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.");
+    if (!H(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) {
@@ -27,7 +29,7 @@ class O {
   }
   firstChild() {
     let e = this.currentNode, t = this.nextNode();
-    return D(e, t) ? (t && (this.currentNode = t), t) : (this.currentNode = e, null);
+    return H(e, t) ? (t && (this.currentNode = t), t) : (this.currentNode = e, null);
   }
   lastChild() {
     let t = this._walkerStack[0].lastChild();
@@ -100,12 +102,12 @@ class O {
   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, {
+        const b = a.shadowRoot;
+        if (b) {
+          const c = this._doc.createTreeWalker(b, this.whatToShow, {
             acceptNode: this._acceptNode
           });
-          return this._walkerStack.unshift(u), NodeFilter.FILTER_ACCEPT;
+          return this._walkerStack.unshift(c), NodeFilter.FILTER_ACCEPT;
         } else {
           var i;
           if (typeof this.filter == "function") return this.filter(a);
@@ -124,103 +126,107 @@ class O {
     }
   }
 }
-function ee(r, e, t, n) {
-  return j() ? new O(r, e, t, n) : r.createTreeWalker(e, t, n);
+function pe(r, e, t, n) {
+  return ie() ? new Ne(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 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({
+const W = /* @__PURE__ */ y.createContext(null), q = "react-aria-focus-scope-restore";
+let h = null;
+function Ae(r) {
+  let { children: e, contain: t, restoreFocus: n, autoFocus: o } = r, l = R(null), a = R(null), i = R([]), { parentNode: b } = V(W) || {}, c = K(() => new U({
     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);
+  g(() => {
+    let f = b || N.root;
+    if (N.getTreeNode(f.scopeRef) && h && !I(h, f.scopeRef)) {
+      let s = N.getTreeNode(h);
+      s && (f = s);
     }
-    s.addChild(u), N.addNode(u);
+    f.addChild(c), N.addNode(c);
   }, [
-    u,
-    f
-  ]), m(() => {
-    let s = N.getTreeNode(i);
-    s && (s.contain = !!t);
+    c,
+    b
+  ]), g(() => {
+    let f = N.getTreeNode(i);
+    f && (f.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);
+  ]), g(() => {
+    var f;
+    let s = (f = l.current) === null || f === void 0 ? void 0 : f.nextSibling, v = [], T = (S) => S.stopPropagation();
+    for (; s && s !== a.current; )
+      v.push(s), s.addEventListener(q, T), s = s.nextSibling;
+    return i.current = v, () => {
+      for (let S of v) S.removeEventListener(q, T);
     };
   }, [
     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);
+  ]), Te(i, n, t), Ee(i, t), ge(i, n, t), we(i, o), Y(() => {
+    const f = x($(i.current ? i.current[0] : void 0));
+    let s = null;
+    if (w(f, i.current)) {
+      for (let v of N.traverse()) v.scopeRef && w(f, v.scopeRef.current) && (s = v);
+      s === N.getTreeNode(i) && (h = s.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);
+  ]), g(() => () => {
+    var f, s, v;
+    let T = (v = (s = N.getTreeNode(i)) === null || s === void 0 || (f = s.parent) === null || f === void 0 ? void 0 : f.scopeRef) !== null && v !== void 0 ? v : null;
+    (i === h || I(i, h)) && (!T || N.getTreeNode(T)) && (h = T), N.removeTreeNode(i);
   }, [
     i
   ]);
-  let d = L(() => te(i), []), c = L(() => ({
+  let d = K(() => $e(i), []), u = K(() => ({
     focusManager: d,
-    parentNode: u
+    parentNode: c
   }), [
-    u,
+    c,
     d
   ]);
-  return /* @__PURE__ */ R.createElement(W.Provider, {
-    value: c
-  }, /* @__PURE__ */ R.createElement("span", {
+  return /* @__PURE__ */ y.createElement(W.Provider, {
+    value: u
+  }, /* @__PURE__ */ y.createElement("span", {
     "data-focus-scope-start": !0,
     hidden: !0,
     ref: l
-  }), e, /* @__PURE__ */ R.createElement("span", {
+  }), e, /* @__PURE__ */ y.createElement("span", {
     "data-focus-scope-end": !0,
     hidden: !0,
     ref: a
   }));
 }
-function te(r) {
+function Ie() {
+  var r;
+  return (r = V(W)) === null || r === void 0 ? void 0 : r.focusManager;
+}
+function $e(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, {
+      let b = n || x($((i = t[0]) !== null && i !== void 0 ? i : void 0)), c = t[0].previousElementSibling, d = _(t), u = 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;
+      u.currentNode = w(b, t) ? b : c;
+      let f = u.nextNode();
+      return !f && l && (u.currentNode = c, f = u.nextNode()), f && p(f, !0), f;
     },
     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, {
+      let b = n || x($((i = t[0]) !== null && i !== void 0 ? i : void 0)), c = t[t.length - 1].nextElementSibling, d = _(t), u = 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;
+      u.currentNode = w(b, t) ? b : c;
+      let f = u.previousNode();
+      return !f && l && (u.currentNode = c, f = u.previousNode()), f && p(f, !0), f;
     },
     focusFirst(e = {}) {
-      let t = r.current, { tabbable: n, accept: o } = e, l = g(t), a = E(l, {
+      let t = r.current, { tabbable: n, accept: o } = e, l = _(t), a = E(l, {
         tabbable: n,
         accept: o
       }, t);
@@ -229,7 +235,7 @@ function te(r) {
       return i && p(i, !0), i;
     },
     focusLast(e = {}) {
-      let t = r.current, { tabbable: n, accept: o } = e, l = g(t), a = E(l, {
+      let t = r.current, { tabbable: n, accept: o } = e, l = _(t), a = E(l, {
         tabbable: n,
         accept: o
       }, t);
@@ -239,18 +245,18 @@ function te(r) {
     }
   };
 }
-function g(r) {
+function _(r) {
   return r[0].parentElement;
 }
-function F(r) {
-  let e = N.getTreeNode(v);
+function A(r) {
+  let e = N.getTreeNode(h);
   for (; e && e.scopeRef !== r; ) {
     if (e.contain) return !1;
     e = e.parent;
   }
   return !0;
 }
-function re(r) {
+function me(r) {
   if (r.checked) return !0;
   let e = [];
   if (!r.form) e = [
@@ -265,54 +271,54 @@ function re(r) {
   }
   return e ? !e.some((l) => l.checked) : !1;
 }
-function ne(r, e) {
-  let t = _(void 0), n = _(void 0);
-  m(() => {
+function Ee(r, e) {
+  let t = R(void 0), n = R(void 0);
+  g(() => {
     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, {
+    let a = (c) => {
+      if (c.key !== "Tab" || c.altKey || c.ctrlKey || c.metaKey || !A(r) || c.isComposing) return;
+      let d = x(l), u = r.current;
+      if (!u || !w(d, u)) return;
+      let f = _(u), s = E(f, {
         tabbable: !0
-      }, c);
+      }, u);
       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) => {
+      s.currentNode = d;
+      let v = c.shiftKey ? s.previousNode() : s.nextNode();
+      v || (s.currentNode = c.shiftKey ? u[u.length - 1].nextElementSibling : u[0].previousElementSibling, v = c.shiftKey ? s.previousNode() : s.nextNode()), c.preventDefault(), v && p(v, !0);
+    }, i = (c) => {
+      (!h || I(h, r)) && w(L(c), r.current) ? (h = r, t.current = L(c)) : A(r) && !k(L(c), r) ? t.current ? t.current.focus() : h && h.current && z(h.current) : A(r) && (t.current = L(c));
+    }, b = (c) => {
       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);
+        let d = de(), u = (d === "virtual" || d === null) && ce() && ue(), f = x(l);
+        if (!u && f && A(r) && !k(f, r)) {
+          h = r;
+          let v = L(c);
+          if (v && v.isConnected) {
+            var s;
+            t.current = v, (s = t.current) === null || s === void 0 || s.focus();
+          } else h.current && z(h.current);
         }
       });
     };
-    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));
+    return l.addEventListener("keydown", a, !1), l.addEventListener("focusin", i, !1), o == null || o.forEach((c) => c.addEventListener("focusin", i, !1)), o == null || o.forEach((c) => c.addEventListener("focusout", b, !1)), () => {
+      l.removeEventListener("keydown", a, !1), l.removeEventListener("focusin", i, !1), o == null || o.forEach((c) => c.removeEventListener("focusin", i, !1)), o == null || o.forEach((c) => c.removeEventListener("focusout", b, !1));
     };
   }, [
     r,
     e
-  ]), m(() => () => {
+  ]), g(() => () => {
     n.current && cancelAnimationFrame(n.current);
   }, [
     n
   ]);
 }
-function J(r) {
+function O(r) {
   return k(r);
 }
 function w(r, e) {
@@ -324,10 +330,10 @@ function k(r, e = null) {
     if (t && w(r, t.current)) return !0;
   return !1;
 }
-function be(r) {
-  return k(r, v);
+function Pe(r) {
+  return k(r, h);
 }
-function y(r, e) {
+function I(r, e) {
   var t;
   let n = (t = N.getTreeNode(e)) === null || t === void 0 ? void 0 : t.parent;
   for (; n; ) {
@@ -338,7 +344,7 @@ function y(r, e) {
 }
 function p(r, e = !1) {
   if (r != null && !e) try {
-    Y(r);
+    se(r);
   } catch {
   }
   else if (r != null) try {
@@ -346,40 +352,40 @@ function p(r, e = !1) {
   } catch {
   }
 }
-function H(r, e = !0) {
-  let t = r[0].previousElementSibling, n = g(r), o = E(n, {
+function ee(r, e = !0) {
+  let t = r[0].previousElementSibling, n = _(r), o = E(n, {
     tabbable: e
   }, r);
   o.currentNode = t;
   let l = o.nextNode();
-  return e && !l && (n = g(r), o = E(n, {
+  return e && !l && (n = _(r), o = E(n, {
     tabbable: !1
   }, r), o.currentNode = t, l = o.nextNode()), l;
 }
-function A(r, e = !0) {
-  p(H(r, e));
+function z(r, e = !0) {
+  p(ee(r, e));
 }
-function oe(r, e) {
-  const t = R.useRef(e);
-  q(() => {
+function we(r, e) {
+  const t = y.useRef(e);
+  Y(() => {
     if (t.current) {
-      v = r;
+      h = r;
       const n = $(r.current ? r.current[0] : void 0);
-      !w(T(n), v.current) && r.current && A(r.current);
+      !w(x(n), h.current) && r.current && z(r.current);
     }
     t.current = !1;
   }, [
     r
   ]);
 }
-function ie(r, e, t) {
-  m(() => {
+function Te(r, e, t) {
+  g(() => {
     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);
+      let i = L(a);
+      w(i, r.current) ? h = r : O(i) || (h = null);
     };
     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));
@@ -390,22 +396,22 @@ function ie(r, e, t) {
     t
   ]);
 }
-function z(r) {
-  let e = N.getTreeNode(v);
+function G(r) {
+  let e = N.getTreeNode(h);
   for (; e && e.scopeRef !== r; ) {
     if (e.nodeToRestore) return !1;
     e = e.parent;
   }
   return (e == null ? void 0 : e.scopeRef) === r;
 }
-function le(r, e, t) {
-  const n = _(typeof document < "u" ? T($(r.current ? r.current[0] : void 0)) : null);
-  m(() => {
+function ge(r, e, t) {
+  const n = R(typeof document < "u" ? x($(r.current ? r.current[0] : void 0)) : null);
+  g(() => {
     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);
+      (!h || I(h, r)) && w(x(l), r.current) && (h = r);
     };
     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));
@@ -413,26 +419,26 @@ function le(r, e, t) {
   }, [
     r,
     t
-  ]), m(() => {
+  ]), g(() => {
     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;
+      if (a.key !== "Tab" || a.altKey || a.ctrlKey || a.metaKey || !A(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, {
+      if (!k(i, r) || !G(r)) return;
+      let b = N.getTreeNode(r);
+      if (!b) return;
+      let c = b.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;
+      let u = a.shiftKey ? d.previousNode() : d.nextNode();
+      if ((!c || !c.isConnected || c === o.body) && (c = void 0, b.nodeToRestore = void 0), (!u || !k(u, r)) && c) {
+        d.currentNode = c;
         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();
+          u = a.shiftKey ? d.previousNode() : d.nextNode();
+        while (k(u, r));
+        a.preventDefault(), a.stopPropagation(), u ? p(u, !0) : O(c) ? p(c, !0) : i.blur();
       }
     };
     return t || o.addEventListener("keydown", l, !0), () => {
@@ -442,7 +448,7 @@ function le(r, e, t) {
     r,
     e,
     t
-  ]), m(() => {
+  ]), g(() => {
     const o = $(r.current ? r.current[0] : void 0);
     if (!e) return;
     let l = N.getTreeNode(r);
@@ -451,26 +457,26 @@ function le(r, e, t) {
       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 b = i.nodeToRestore, c = x(o);
+        if (e && b && (c && k(c, r) || c === o.body && G(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);
+              let u = d.getTreeNode(r);
+              for (; u; ) {
+                if (u.nodeToRestore && u.nodeToRestore.isConnected) {
+                  X(u.nodeToRestore);
                   return;
                 }
-                c = c.parent;
+                u = u.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);
+              for (u = d.getTreeNode(r); u; ) {
+                if (u.scopeRef && u.scopeRef.current && N.getTreeNode(u.scopeRef)) {
+                  let f = ee(u.scopeRef.current, !0);
+                  X(f);
                   return;
                 }
-                c = c.parent;
+                u = u.parent;
               }
             }
           });
@@ -482,53 +488,53 @@ function le(r, e, t) {
     e
   ]);
 }
-function U(r) {
-  r.dispatchEvent(new CustomEvent(M, {
+function X(r) {
+  r.dispatchEvent(new CustomEvent(q, {
     bubbles: !0,
     cancelable: !0
   })) && p(r);
 }
 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, {
+  let n = e != null && e.tabbable ? le : ae, o = (r == null ? void 0 : r.nodeType) === Node.ELEMENT_NODE ? r : null, l = $(o), a = pe(l, r || l, NodeFilter.SHOW_ELEMENT, {
     acceptNode(i) {
-      var f;
-      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;
+      var b;
+      return !(e == null || (b = e.from) === null || b === void 0) && b.contains(i) || e != null && e.tabbable && i.tagName === "INPUT" && i.getAttribute("type") === "radio" && (!me(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 && (a.currentNode = e.from), a;
 }
-function ve(r, e = {}) {
+function Me(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, {
+      let { from: o, tabbable: l = e.tabbable, wrap: a = e.wrap, accept: i = e.accept } = t, b = o || x($(n)), c = 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;
+      n.contains(b) && (c.currentNode = b);
+      let d = c.nextNode();
+      return !d && a && (c.currentNode = n, d = c.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, {
+      let { from: o, tabbable: l = e.tabbable, wrap: a = e.wrap, accept: i = e.accept } = t, b = o || x($(n)), c = E(n, {
         tabbable: l,
         accept: i
       });
-      if (n.contains(f)) u.currentNode = f;
+      if (n.contains(b)) c.currentNode = b;
       else {
-        let c = I(u);
-        return c && p(c, !0), c ?? null;
+        let u = D(c);
+        return u && p(u, !0), u ?? null;
       }
-      let d = u.previousNode();
+      let d = c.previousNode();
       if (!d && a) {
-        u.currentNode = n;
-        let c = I(u);
-        if (!c)
+        c.currentNode = n;
+        let u = D(c);
+        if (!u)
           return null;
-        d = c;
+        d = u;
       }
       return d && p(d, !0), d ?? null;
     },
@@ -547,19 +553,19 @@ function ve(r, e = {}) {
       let { tabbable: o = e.tabbable, accept: l = e.accept } = t, a = E(n, {
         tabbable: o,
         accept: l
-      }), i = I(a);
+      }), i = D(a);
       return i && p(i, !0), i ?? null;
     }
   };
 }
-function I(r) {
+function D(r) {
   let e, t;
   do
     t = r.lastChild(), t && (e = t);
   while (t);
   return e;
 }
-class P {
+class B {
   get size() {
     return this.fastMap.size;
   }
@@ -569,7 +575,7 @@ class P {
   addTreeNode(e, t, n) {
     let o = this.fastMap.get(t ?? null);
     if (!o) return;
-    let l = new K({
+    let l = new U({
       scopeRef: e
     });
     o.addChild(l), l.parent = o, this.fastMap.set(e, l), n && (l.nodeToRestore = n);
@@ -592,18 +598,18 @@ class P {
   }
   clone() {
     var e;
-    let t = new P();
+    let t = new B();
     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({
+    this.fastMap = /* @__PURE__ */ new Map(), this.root = new U({
       scopeRef: null
     }), this.fastMap.set(null, this.root);
   }
 }
-class K {
+class U {
   addChild(e) {
     this.children.add(e), e.parent = this;
   }
@@ -614,10 +620,100 @@ class K {
     this.children = /* @__PURE__ */ new Set(), this.contain = !1, this.scopeRef = e.scopeRef;
   }
 }
-let N = new P();
+let N = new B();
+const te = /* @__PURE__ */ Q(null);
+function Ke(r) {
+  let e = R({});
+  return /* @__PURE__ */ y.createElement(te.Provider, {
+    value: e
+  }, r.children);
+}
+const xe = /* @__PURE__ */ Z(function(e, t) {
+  let { name: n, isVisible: o = !0, children: l, className: a, style: i, ...b } = e, [c, d] = fe(o ? "visible" : "hidden"), u = V(te);
+  if (!u) throw new Error("<SharedElement> must be rendered inside a <SharedElementTransition>");
+  o && c === "hidden" && d("visible"), t = be(t), g(() => {
+    let s = t.current, v = u.current, T = v[n], S = null;
+    if (s && o && T) {
+      d("visible");
+      let F = s.getAnimations(), P = T.style.map(([m, M]) => {
+        let re = s.style[m];
+        if (m === "translate") {
+          let J = T.rect, C = s.getBoundingClientRect(), ne = J.left - (C == null ? void 0 : C.left), oe = J.top - (C == null ? void 0 : C.top);
+          s.style.translate = `${ne}px ${oe}px`;
+        } else s.style[m] = M;
+        return [
+          m,
+          re
+        ];
+      });
+      for (let m of s.getAnimations()) F.includes(m) || m.cancel();
+      S = requestAnimationFrame(() => {
+        S = null;
+        for (let [m, M] of P) s.style[m] = M;
+      }), delete v[n];
+    } else s && o && !T ? (queueMicrotask(() => j(() => d("entering"))), S = requestAnimationFrame(() => {
+      S = null, d("visible");
+    })) : s && !o && queueMicrotask(() => {
+      v[n] ? (delete v[n], j(() => d("exiting")), Promise.all(s.getAnimations().map((F) => F.finished)).then(() => d("hidden")).catch(() => {
+      })) : d("hidden");
+    });
+    return () => {
+      if (S != null && cancelAnimationFrame(S), s && s.isConnected && !s.hasAttribute("data-exiting")) {
+        let F = window.getComputedStyle(s);
+        if (F.transitionProperty !== "none") {
+          let P = F.transitionProperty.split(/\s*,\s*/);
+          v[n] = {
+            rect: s.getBoundingClientRect(),
+            style: P.map((m) => [
+              m,
+              F[m]
+            ])
+          };
+        }
+      }
+    };
+  }, [
+    t,
+    u,
+    n,
+    o
+  ]);
+  let f = ve({
+    children: l,
+    className: a,
+    style: i,
+    values: {
+      isEntering: c === "entering",
+      isExiting: c === "exiting"
+    }
+  });
+  return c === "hidden" ? null : /* @__PURE__ */ y.createElement("div", {
+    ...b,
+    ...f,
+    ref: t,
+    "data-entering": c === "entering" || void 0,
+    "data-exiting": c === "exiting" || void 0
+  });
+}), Se = /* @__PURE__ */ Q({
+  isSelected: !1
+}), De = /* @__PURE__ */ Z(function(e, t) {
+  [e, t] = he(e, t, Se);
+  let { isSelected: n, ...o } = e;
+  return /* @__PURE__ */ y.createElement(xe, {
+    ...o,
+    ref: t,
+    className: e.className || "react-aria-SelectionIndicator",
+    name: "SelectionIndicator",
+    isVisible: n
+  });
+});
 export {
   E as $,
-  fe as a,
-  ve as b,
-  be as c
+  Se as a,
+  Ae as b,
+  Ke as c,
+  Me as d,
+  De as e,
+  Ie as f,
+  Pe as g
 };