@midas-ds/components 1.0.2 → 1.0.3
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/Button-B4vMZbC6.js +182 -0
- package/CHANGELOG.md +10 -0
- package/Checkbox-DnKWanep.js +402 -0
- package/{Collection-B3xUVWPF.js → Collection-COLWgm24.js} +179 -152
- package/Dialog-Cb6toyXO.js +1951 -0
- package/DragAndDrop-B0T3WgjL.js +40 -0
- package/FocusScope-C8i7CH6y.js +513 -0
- package/Form-BQQs3jUk.js +238 -0
- package/Group-CdwXhx8Q.js +42 -0
- package/{Hidden-BQWDvze4.js → Hidden-DngIphiL.js} +1 -1
- package/Link-iAZLB3RI.js +75 -0
- package/ListBox-BKWkIIm6.js +474 -0
- package/ListKeyboardDelegate-BH-K5hyq.js +172 -0
- package/{PressResponder-DP8ZDNGy.js → PressResponder-Cz-TRBHO.js} +10 -10
- package/README.md +21 -3
- package/SelectionManager-8o40f7mx.js +1047 -0
- package/Separator-BlvmQjwz.js +49 -0
- package/Tag--W5TgxmK.js +728 -0
- package/Text-CQPW6xs7.js +15 -0
- package/TextField-DeK_yiK-.js +225 -0
- package/TextField.module-0-u4LVPp.js +143 -0
- package/{VisuallyHidden-B_XzVvlX.js → VisuallyHidden-CFx06Bae.js} +1 -1
- package/{context-ScOIq_Gu.js → context-Bnqknrce.js} +1 -1
- package/index-B-jHjTDC.js +120 -0
- package/{index-CorR1LBD.js → index-BPdc9gJ8.js} +3 -3
- package/index-DK9ZACEc.js +642 -0
- package/{index-Dl1Q-tbj.js → index-KSgQWWiy.js} +5315 -5315
- package/index.js +45 -47
- package/index15.js +1 -1
- package/index16.js +1 -1
- package/index25.js +1 -1
- package/index26.js +1 -1
- package/index3.js +2 -4
- package/index31.js +3 -3
- package/index32.js +2 -2
- package/index33.js +2 -2
- package/index34.js +1 -1
- package/index35.js +1 -1
- package/index36.js +1 -1
- package/index37.js +1 -1
- package/index38.js +1 -1
- package/index39.js +1 -1
- package/index40.js +1 -1
- package/index41.js +1 -1
- package/index42.js +1 -1
- package/index43.js +1 -1
- package/index45.js +3 -3
- package/index5.js +1 -1
- package/index50.js +1 -1
- package/index52.js +3 -3
- package/index53.js +3 -3
- package/index54.js +1 -1
- package/index55.js +4 -4
- package/index56.js +1 -1
- package/index57.js +1 -1
- package/index58.js +1 -1
- package/index59.js +3 -3
- package/index60.js +1 -1
- package/index61.js +1 -1
- package/index62.js +1 -1
- package/index63.js +4 -4
- package/index64.js +3 -3
- package/index65.js +3 -3
- package/index66.js +1 -1
- package/index67.js +3 -3
- package/index68.js +2 -2
- package/index69.js +1 -1
- package/index71.js +1 -1
- package/index76.js +5 -5
- package/index77.js +2 -2
- package/index78.js +2 -2
- package/index79.js +1 -1
- package/index80.js +226 -227
- package/index81.js +197 -199
- package/index82.js +192 -195
- package/index83.js +181 -183
- package/index84.js +52 -54
- package/index85.js +261 -262
- package/index86.js +262 -262
- package/index87.js +209 -211
- package/index88.js +436 -440
- package/index89.js +962 -964
- package/index90.js +2401 -2399
- package/index92.js +5 -5
- package/index93.js +1 -1
- package/index94.js +1 -1
- package/link/Link.d.ts +2 -2
- package/link-button/LinkButton.d.ts +1 -1
- package/package.json +7 -1
- package/{react.esm-D8HpDGKP.js → react.esm-sMU8Z7rL.js} +1872 -1872
- package/textfield/index.d.ts +0 -2
- package/{useControlledState-S_TYcV_c.js → useControlledState-DrAoodI6.js} +1 -1
- package/{useDescription-D4_zk_sA.js → useDescription-BPs7eRff.js} +1 -1
- package/useField-Dz62UHCP.js +67 -0
- package/{useFilter-BnJDBCkt.js → useFilter-ViwzkzZe.js} +1 -1
- package/useFocusRing-BKGhL91C.js +1297 -0
- package/{useFocusable-C-N9wcwm.js → useFocusable-CRSmYEQc.js} +11 -8
- package/{useGridSelectionCheckbox-i1rsjlC-.js → useGridSelectionCheckbox-CVEvUCJL.js} +3 -3
- package/useHasTabbableChild-C8y4fwiY.js +34 -0
- package/{useHighlightSelectionDescription-JVx2MW_e.js → useHighlightSelectionDescription-CD74uzLh.js} +19 -19
- package/useListState-DKnP5TB5.js +119 -0
- package/{useLocalizedStringFormatter-DVCAZqcL.js → useLocalizedStringFormatter-DsZ-ZWSk.js} +29 -29
- package/{useSingleSelectListState-CmX9_L5H.js → useSingleSelectListState-BHTLh8Ob.js} +5 -5
- package/Button-CCevm2s3.js +0 -183
- package/Checkbox-CllWDBxF.js +0 -405
- package/Dialog-CLTyYwkS.js +0 -1889
- package/DragAndDrop-OTN7La7U.js +0 -42
- package/FocusScope-BR0SJ-cZ.js +0 -512
- package/Form-DXLoQL91.js +0 -240
- package/Group-DPMuN3h8.js +0 -44
- package/Label-C18A_4Z5.js +0 -69
- package/Link-BU1h3K2a.js +0 -77
- package/ListBox-D21tdwTs.js +0 -463
- package/ListKeyboardDelegate-DxMjfMsI.js +0 -172
- package/SelectionManager-D4WtKtey.js +0 -988
- package/Separator-DLUHK9vv.js +0 -48
- package/Tag-CEd6WWSc.js +0 -725
- package/Text-DGLaY3HR.js +0 -17
- package/TextField-C_hq9WeT.js +0 -226
- package/TextField.module-Cwq1FAm7.js +0 -141
- package/index-CEg5vZQH.js +0 -132
- package/index-CgfokhRq.js +0 -674
- package/useFocusRing-D97-G3fT.js +0 -1324
- package/useHasTabbableChild-DeuCnGGv.js +0 -34
- package/useListState-DSOTbsL3.js +0 -119
package/DragAndDrop-OTN7La7U.js
DELETED
|
@@ -1,42 +0,0 @@
|
|
|
1
|
-
import a, { createContext as b, useCallback as f, forwardRef as $, useContext as d, useMemo as g } from "react";
|
|
2
|
-
const V = /* @__PURE__ */ b({}), o = /* @__PURE__ */ b(null);
|
|
3
|
-
function s(e, i) {
|
|
4
|
-
let { render: l } = d(o);
|
|
5
|
-
return /* @__PURE__ */ a.createElement(a.Fragment, null, l(e, i));
|
|
6
|
-
}
|
|
7
|
-
const x = /* @__PURE__ */ $(s);
|
|
8
|
-
function y(e, i) {
|
|
9
|
-
var l;
|
|
10
|
-
let t = e == null ? void 0 : e.renderDropIndicator, u = e == null || (l = e.isVirtualDragging) === null || l === void 0 ? void 0 : l.call(e), r = f((n) => {
|
|
11
|
-
if (u || i != null && i.isDropTarget(n)) return t ? t(n) : /* @__PURE__ */ a.createElement(x, {
|
|
12
|
-
target: n
|
|
13
|
-
});
|
|
14
|
-
}, [
|
|
15
|
-
i == null ? void 0 : i.target,
|
|
16
|
-
u,
|
|
17
|
-
t
|
|
18
|
-
]);
|
|
19
|
-
return e != null && e.useDropIndicator ? r : void 0;
|
|
20
|
-
}
|
|
21
|
-
function I(e, i, l) {
|
|
22
|
-
var t, u;
|
|
23
|
-
let r = e.focusedKey, n = null;
|
|
24
|
-
if (!(i == null || (t = i.isVirtualDragging) === null || t === void 0) && t.call(i) && (l == null || (u = l.target) === null || u === void 0 ? void 0 : u.type) === "item") {
|
|
25
|
-
n = l.target.key;
|
|
26
|
-
var c;
|
|
27
|
-
l.target.dropPosition === "after" && (n = (c = l.collection.getKeyAfter(n)) !== null && c !== void 0 ? c : n);
|
|
28
|
-
}
|
|
29
|
-
return g(() => new Set([
|
|
30
|
-
r,
|
|
31
|
-
n
|
|
32
|
-
].filter((v) => v != null)), [
|
|
33
|
-
r,
|
|
34
|
-
n
|
|
35
|
-
]);
|
|
36
|
-
}
|
|
37
|
-
export {
|
|
38
|
-
V as $,
|
|
39
|
-
o as a,
|
|
40
|
-
I as b,
|
|
41
|
-
y as c
|
|
42
|
-
};
|
package/FocusScope-BR0SJ-cZ.js
DELETED
|
@@ -1,512 +0,0 @@
|
|
|
1
|
-
import { r as H, l as T, s as N, t as W } from "./useFocusRing-D97-G3fT.js";
|
|
2
|
-
import L, { useRef as y, useContext as G, useMemo as C, useEffect as B } from "react";
|
|
3
|
-
function J(e) {
|
|
4
|
-
const t = H(e);
|
|
5
|
-
if (!(e instanceof t.HTMLElement) && !(e instanceof t.SVGElement)) return !1;
|
|
6
|
-
let { display: r, visibility: o } = e.style, n = r !== "none" && o !== "hidden" && o !== "collapse";
|
|
7
|
-
if (n) {
|
|
8
|
-
const { getComputedStyle: i } = e.ownerDocument.defaultView;
|
|
9
|
-
let { display: c, visibility: a } = i(e);
|
|
10
|
-
n = c !== "none" && a !== "hidden" && a !== "collapse";
|
|
11
|
-
}
|
|
12
|
-
return n;
|
|
13
|
-
}
|
|
14
|
-
function Y(e, t) {
|
|
15
|
-
return !e.hasAttribute("hidden") && // Ignore HiddenSelect when tree walking.
|
|
16
|
-
!e.hasAttribute("data-react-aria-prevent-focus") && (e.nodeName === "DETAILS" && t && t.nodeName !== "SUMMARY" ? e.hasAttribute("open") : !0);
|
|
17
|
-
}
|
|
18
|
-
function j(e, t) {
|
|
19
|
-
return e.nodeName !== "#comment" && J(e) && Y(e, t) && (!e.parentElement || j(e.parentElement, e));
|
|
20
|
-
}
|
|
21
|
-
const I = /* @__PURE__ */ L.createContext(null), k = "react-aria-focus-scope-restore";
|
|
22
|
-
let f = null;
|
|
23
|
-
function oe(e) {
|
|
24
|
-
let { children: t, contain: r, restoreFocus: o, autoFocus: n } = e, i = y(null), c = y(null), a = y([]), { parentNode: b } = G(I) || {}, l = C(() => new A({
|
|
25
|
-
scopeRef: a
|
|
26
|
-
}), [
|
|
27
|
-
a
|
|
28
|
-
]);
|
|
29
|
-
T(() => {
|
|
30
|
-
let v = b || p.root;
|
|
31
|
-
if (p.getTreeNode(v.scopeRef) && f && !F(f, v.scopeRef)) {
|
|
32
|
-
let s = p.getTreeNode(f);
|
|
33
|
-
s && (v = s);
|
|
34
|
-
}
|
|
35
|
-
v.addChild(l), p.addNode(l);
|
|
36
|
-
}, [
|
|
37
|
-
l,
|
|
38
|
-
b
|
|
39
|
-
]), T(() => {
|
|
40
|
-
let v = p.getTreeNode(a);
|
|
41
|
-
v && (v.contain = !!r);
|
|
42
|
-
}, [
|
|
43
|
-
r
|
|
44
|
-
]), T(() => {
|
|
45
|
-
var v;
|
|
46
|
-
let s = (v = i.current) === null || v === void 0 ? void 0 : v.nextSibling, $ = [], x = (_) => _.stopPropagation();
|
|
47
|
-
for (; s && s !== c.current; )
|
|
48
|
-
$.push(s), s.addEventListener(k, x), s = s.nextSibling;
|
|
49
|
-
return a.current = $, () => {
|
|
50
|
-
for (let _ of $) _.removeEventListener(k, x);
|
|
51
|
-
};
|
|
52
|
-
}, [
|
|
53
|
-
t
|
|
54
|
-
]), ee(a, o, r), Z(a, r), te(a, o, r), O(a, n), B(() => {
|
|
55
|
-
const v = N(a.current ? a.current[0] : void 0).activeElement;
|
|
56
|
-
let s = null;
|
|
57
|
-
if (h(v, a.current)) {
|
|
58
|
-
for (let $ of p.traverse()) $.scopeRef && h(v, $.scopeRef.current) && (s = $);
|
|
59
|
-
s === p.getTreeNode(a) && (f = s.scopeRef);
|
|
60
|
-
}
|
|
61
|
-
}, [
|
|
62
|
-
a
|
|
63
|
-
]), T(() => () => {
|
|
64
|
-
var v, s, $;
|
|
65
|
-
let x = ($ = (s = p.getTreeNode(a)) === null || s === void 0 || (v = s.parent) === null || v === void 0 ? void 0 : v.scopeRef) !== null && $ !== void 0 ? $ : null;
|
|
66
|
-
(a === f || F(a, f)) && (!x || p.getTreeNode(x)) && (f = x), p.removeTreeNode(a);
|
|
67
|
-
}, [
|
|
68
|
-
a
|
|
69
|
-
]);
|
|
70
|
-
let u = C(() => Q(a), []), d = C(() => ({
|
|
71
|
-
focusManager: u,
|
|
72
|
-
parentNode: l
|
|
73
|
-
}), [
|
|
74
|
-
l,
|
|
75
|
-
u
|
|
76
|
-
]);
|
|
77
|
-
return /* @__PURE__ */ L.createElement(I.Provider, {
|
|
78
|
-
value: d
|
|
79
|
-
}, /* @__PURE__ */ L.createElement("span", {
|
|
80
|
-
"data-focus-scope-start": !0,
|
|
81
|
-
hidden: !0,
|
|
82
|
-
ref: i
|
|
83
|
-
}), t, /* @__PURE__ */ L.createElement("span", {
|
|
84
|
-
"data-focus-scope-end": !0,
|
|
85
|
-
hidden: !0,
|
|
86
|
-
ref: c
|
|
87
|
-
}));
|
|
88
|
-
}
|
|
89
|
-
function Q(e) {
|
|
90
|
-
return {
|
|
91
|
-
focusNext(t = {}) {
|
|
92
|
-
let r = e.current, { from: o, tabbable: n, wrap: i, accept: c } = t, a = o || N(r[0]).activeElement, b = r[0].previousElementSibling, l = w(r), u = m(l, {
|
|
93
|
-
tabbable: n,
|
|
94
|
-
accept: c
|
|
95
|
-
}, r);
|
|
96
|
-
u.currentNode = h(a, r) ? a : b;
|
|
97
|
-
let d = u.nextNode();
|
|
98
|
-
return !d && i && (u.currentNode = b, d = u.nextNode()), d && E(d, !0), d;
|
|
99
|
-
},
|
|
100
|
-
focusPrevious(t = {}) {
|
|
101
|
-
let r = e.current, { from: o, tabbable: n, wrap: i, accept: c } = t, a = o || N(r[0]).activeElement, b = r[r.length - 1].nextElementSibling, l = w(r), u = m(l, {
|
|
102
|
-
tabbable: n,
|
|
103
|
-
accept: c
|
|
104
|
-
}, r);
|
|
105
|
-
u.currentNode = h(a, r) ? a : b;
|
|
106
|
-
let d = u.previousNode();
|
|
107
|
-
return !d && i && (u.currentNode = b, d = u.previousNode()), d && E(d, !0), d;
|
|
108
|
-
},
|
|
109
|
-
focusFirst(t = {}) {
|
|
110
|
-
let r = e.current, { tabbable: o, accept: n } = t, i = w(r), c = m(i, {
|
|
111
|
-
tabbable: o,
|
|
112
|
-
accept: n
|
|
113
|
-
}, r);
|
|
114
|
-
c.currentNode = r[0].previousElementSibling;
|
|
115
|
-
let a = c.nextNode();
|
|
116
|
-
return a && E(a, !0), a;
|
|
117
|
-
},
|
|
118
|
-
focusLast(t = {}) {
|
|
119
|
-
let r = e.current, { tabbable: o, accept: n } = t, i = w(r), c = m(i, {
|
|
120
|
-
tabbable: o,
|
|
121
|
-
accept: n
|
|
122
|
-
}, r);
|
|
123
|
-
c.currentNode = r[r.length - 1].nextElementSibling;
|
|
124
|
-
let a = c.previousNode();
|
|
125
|
-
return a && E(a, !0), a;
|
|
126
|
-
}
|
|
127
|
-
};
|
|
128
|
-
}
|
|
129
|
-
const K = [
|
|
130
|
-
"input:not([disabled]):not([type=hidden])",
|
|
131
|
-
"select:not([disabled])",
|
|
132
|
-
"textarea:not([disabled])",
|
|
133
|
-
"button:not([disabled])",
|
|
134
|
-
"a[href]",
|
|
135
|
-
"area[href]",
|
|
136
|
-
"summary",
|
|
137
|
-
"iframe",
|
|
138
|
-
"object",
|
|
139
|
-
"embed",
|
|
140
|
-
"audio[controls]",
|
|
141
|
-
"video[controls]",
|
|
142
|
-
"[contenteditable]"
|
|
143
|
-
], z = K.join(":not([hidden]),") + ",[tabindex]:not([disabled]):not([hidden])";
|
|
144
|
-
K.push('[tabindex]:not([tabindex="-1"]):not([disabled])');
|
|
145
|
-
const X = K.join(':not([hidden]):not([tabindex="-1"]),');
|
|
146
|
-
function ae(e) {
|
|
147
|
-
return e.matches(z);
|
|
148
|
-
}
|
|
149
|
-
function w(e) {
|
|
150
|
-
return e[0].parentElement;
|
|
151
|
-
}
|
|
152
|
-
function S(e) {
|
|
153
|
-
let t = p.getTreeNode(f);
|
|
154
|
-
for (; t && t.scopeRef !== e; ) {
|
|
155
|
-
if (t.contain) return !1;
|
|
156
|
-
t = t.parent;
|
|
157
|
-
}
|
|
158
|
-
return !0;
|
|
159
|
-
}
|
|
160
|
-
function Z(e, t) {
|
|
161
|
-
let r = y(void 0), o = y(void 0);
|
|
162
|
-
T(() => {
|
|
163
|
-
let n = e.current;
|
|
164
|
-
if (!t) {
|
|
165
|
-
o.current && (cancelAnimationFrame(o.current), o.current = void 0);
|
|
166
|
-
return;
|
|
167
|
-
}
|
|
168
|
-
const i = N(n ? n[0] : void 0);
|
|
169
|
-
let c = (l) => {
|
|
170
|
-
if (l.key !== "Tab" || l.altKey || l.ctrlKey || l.metaKey || !S(e) || l.isComposing) return;
|
|
171
|
-
let u = i.activeElement, d = e.current;
|
|
172
|
-
if (!d || !h(u, d)) return;
|
|
173
|
-
let v = w(d), s = m(v, {
|
|
174
|
-
tabbable: !0
|
|
175
|
-
}, d);
|
|
176
|
-
if (!u) return;
|
|
177
|
-
s.currentNode = u;
|
|
178
|
-
let $ = l.shiftKey ? s.previousNode() : s.nextNode();
|
|
179
|
-
$ || (s.currentNode = l.shiftKey ? d[d.length - 1].nextElementSibling : d[0].previousElementSibling, $ = l.shiftKey ? s.previousNode() : s.nextNode()), l.preventDefault(), $ && E($, !0);
|
|
180
|
-
}, a = (l) => {
|
|
181
|
-
(!f || F(f, e)) && h(l.target, e.current) ? (f = e, r.current = l.target) : S(e) && !g(l.target, e) ? r.current ? r.current.focus() : f && f.current && M(f.current) : S(e) && (r.current = l.target);
|
|
182
|
-
}, b = (l) => {
|
|
183
|
-
o.current && cancelAnimationFrame(o.current), o.current = requestAnimationFrame(() => {
|
|
184
|
-
if (i.activeElement && S(e) && !g(i.activeElement, e))
|
|
185
|
-
if (f = e, i.body.contains(l.target)) {
|
|
186
|
-
var u;
|
|
187
|
-
r.current = l.target, (u = r.current) === null || u === void 0 || u.focus();
|
|
188
|
-
} else f.current && M(f.current);
|
|
189
|
-
});
|
|
190
|
-
};
|
|
191
|
-
return i.addEventListener("keydown", c, !1), i.addEventListener("focusin", a, !1), n == null || n.forEach((l) => l.addEventListener("focusin", a, !1)), n == null || n.forEach((l) => l.addEventListener("focusout", b, !1)), () => {
|
|
192
|
-
i.removeEventListener("keydown", c, !1), i.removeEventListener("focusin", a, !1), n == null || n.forEach((l) => l.removeEventListener("focusin", a, !1)), n == null || n.forEach((l) => l.removeEventListener("focusout", b, !1));
|
|
193
|
-
};
|
|
194
|
-
}, [
|
|
195
|
-
e,
|
|
196
|
-
t
|
|
197
|
-
]), T(() => () => {
|
|
198
|
-
o.current && cancelAnimationFrame(o.current);
|
|
199
|
-
}, [
|
|
200
|
-
o
|
|
201
|
-
]);
|
|
202
|
-
}
|
|
203
|
-
function U(e) {
|
|
204
|
-
return g(e);
|
|
205
|
-
}
|
|
206
|
-
function h(e, t) {
|
|
207
|
-
return !e || !t ? !1 : t.some((r) => r.contains(e));
|
|
208
|
-
}
|
|
209
|
-
function g(e, t = null) {
|
|
210
|
-
if (e instanceof Element && e.closest("[data-react-aria-top-layer]")) return !0;
|
|
211
|
-
for (let { scopeRef: r } of p.traverse(p.getTreeNode(t)))
|
|
212
|
-
if (r && h(e, r.current)) return !0;
|
|
213
|
-
return !1;
|
|
214
|
-
}
|
|
215
|
-
function ie(e) {
|
|
216
|
-
return g(e, f);
|
|
217
|
-
}
|
|
218
|
-
function F(e, t) {
|
|
219
|
-
var r;
|
|
220
|
-
let o = (r = p.getTreeNode(t)) === null || r === void 0 ? void 0 : r.parent;
|
|
221
|
-
for (; o; ) {
|
|
222
|
-
if (o.scopeRef === e) return !0;
|
|
223
|
-
o = o.parent;
|
|
224
|
-
}
|
|
225
|
-
return !1;
|
|
226
|
-
}
|
|
227
|
-
function E(e, t = !1) {
|
|
228
|
-
if (e != null && !t) try {
|
|
229
|
-
W(e);
|
|
230
|
-
} catch {
|
|
231
|
-
}
|
|
232
|
-
else if (e != null) try {
|
|
233
|
-
e.focus();
|
|
234
|
-
} catch {
|
|
235
|
-
}
|
|
236
|
-
}
|
|
237
|
-
function q(e, t = !0) {
|
|
238
|
-
let r = e[0].previousElementSibling, o = w(e), n = m(o, {
|
|
239
|
-
tabbable: t
|
|
240
|
-
}, e);
|
|
241
|
-
n.currentNode = r;
|
|
242
|
-
let i = n.nextNode();
|
|
243
|
-
return t && !i && (o = w(e), n = m(o, {
|
|
244
|
-
tabbable: !1
|
|
245
|
-
}, e), n.currentNode = r, i = n.nextNode()), i;
|
|
246
|
-
}
|
|
247
|
-
function M(e, t = !0) {
|
|
248
|
-
E(q(e, t));
|
|
249
|
-
}
|
|
250
|
-
function O(e, t) {
|
|
251
|
-
const r = L.useRef(t);
|
|
252
|
-
B(() => {
|
|
253
|
-
if (r.current) {
|
|
254
|
-
f = e;
|
|
255
|
-
const o = N(e.current ? e.current[0] : void 0);
|
|
256
|
-
!h(o.activeElement, f.current) && e.current && M(e.current);
|
|
257
|
-
}
|
|
258
|
-
r.current = !1;
|
|
259
|
-
}, [
|
|
260
|
-
e
|
|
261
|
-
]);
|
|
262
|
-
}
|
|
263
|
-
function ee(e, t, r) {
|
|
264
|
-
T(() => {
|
|
265
|
-
if (t || r) return;
|
|
266
|
-
let o = e.current;
|
|
267
|
-
const n = N(o ? o[0] : void 0);
|
|
268
|
-
let i = (c) => {
|
|
269
|
-
let a = c.target;
|
|
270
|
-
h(a, e.current) ? f = e : U(a) || (f = null);
|
|
271
|
-
};
|
|
272
|
-
return n.addEventListener("focusin", i, !1), o == null || o.forEach((c) => c.addEventListener("focusin", i, !1)), () => {
|
|
273
|
-
n.removeEventListener("focusin", i, !1), o == null || o.forEach((c) => c.removeEventListener("focusin", i, !1));
|
|
274
|
-
};
|
|
275
|
-
}, [
|
|
276
|
-
e,
|
|
277
|
-
t,
|
|
278
|
-
r
|
|
279
|
-
]);
|
|
280
|
-
}
|
|
281
|
-
function P(e) {
|
|
282
|
-
let t = p.getTreeNode(f);
|
|
283
|
-
for (; t && t.scopeRef !== e; ) {
|
|
284
|
-
if (t.nodeToRestore) return !1;
|
|
285
|
-
t = t.parent;
|
|
286
|
-
}
|
|
287
|
-
return (t == null ? void 0 : t.scopeRef) === e;
|
|
288
|
-
}
|
|
289
|
-
function te(e, t, r) {
|
|
290
|
-
const o = y(typeof document < "u" ? N(e.current ? e.current[0] : void 0).activeElement : null);
|
|
291
|
-
T(() => {
|
|
292
|
-
let n = e.current;
|
|
293
|
-
const i = N(n ? n[0] : void 0);
|
|
294
|
-
if (!t || r) return;
|
|
295
|
-
let c = () => {
|
|
296
|
-
(!f || F(f, e)) && h(i.activeElement, e.current) && (f = e);
|
|
297
|
-
};
|
|
298
|
-
return i.addEventListener("focusin", c, !1), n == null || n.forEach((a) => a.addEventListener("focusin", c, !1)), () => {
|
|
299
|
-
i.removeEventListener("focusin", c, !1), n == null || n.forEach((a) => a.removeEventListener("focusin", c, !1));
|
|
300
|
-
};
|
|
301
|
-
}, [
|
|
302
|
-
e,
|
|
303
|
-
r
|
|
304
|
-
]), T(() => {
|
|
305
|
-
const n = N(e.current ? e.current[0] : void 0);
|
|
306
|
-
if (!t) return;
|
|
307
|
-
let i = (c) => {
|
|
308
|
-
if (c.key !== "Tab" || c.altKey || c.ctrlKey || c.metaKey || !S(e) || c.isComposing) return;
|
|
309
|
-
let a = n.activeElement;
|
|
310
|
-
if (!g(a, e) || !P(e)) return;
|
|
311
|
-
let b = p.getTreeNode(e);
|
|
312
|
-
if (!b) return;
|
|
313
|
-
let l = b.nodeToRestore, u = m(n.body, {
|
|
314
|
-
tabbable: !0
|
|
315
|
-
});
|
|
316
|
-
u.currentNode = a;
|
|
317
|
-
let d = c.shiftKey ? u.previousNode() : u.nextNode();
|
|
318
|
-
if ((!l || !n.body.contains(l) || l === n.body) && (l = void 0, b.nodeToRestore = void 0), (!d || !g(d, e)) && l) {
|
|
319
|
-
u.currentNode = l;
|
|
320
|
-
do
|
|
321
|
-
d = c.shiftKey ? u.previousNode() : u.nextNode();
|
|
322
|
-
while (g(d, e));
|
|
323
|
-
c.preventDefault(), c.stopPropagation(), d ? E(d, !0) : U(l) ? E(l, !0) : a.blur();
|
|
324
|
-
}
|
|
325
|
-
};
|
|
326
|
-
return r || n.addEventListener("keydown", i, !0), () => {
|
|
327
|
-
r || n.removeEventListener("keydown", i, !0);
|
|
328
|
-
};
|
|
329
|
-
}, [
|
|
330
|
-
e,
|
|
331
|
-
t,
|
|
332
|
-
r
|
|
333
|
-
]), T(() => {
|
|
334
|
-
const n = N(e.current ? e.current[0] : void 0);
|
|
335
|
-
if (!t) return;
|
|
336
|
-
let i = p.getTreeNode(e);
|
|
337
|
-
if (i) {
|
|
338
|
-
var c;
|
|
339
|
-
return i.nodeToRestore = (c = o.current) !== null && c !== void 0 ? c : void 0, () => {
|
|
340
|
-
let a = p.getTreeNode(e);
|
|
341
|
-
if (!a) return;
|
|
342
|
-
let b = a.nodeToRestore;
|
|
343
|
-
if (t && b && (n.activeElement && g(n.activeElement, e) || n.activeElement === n.body && P(e))) {
|
|
344
|
-
let l = p.clone();
|
|
345
|
-
requestAnimationFrame(() => {
|
|
346
|
-
if (n.activeElement === n.body) {
|
|
347
|
-
let u = l.getTreeNode(e);
|
|
348
|
-
for (; u; ) {
|
|
349
|
-
if (u.nodeToRestore && u.nodeToRestore.isConnected) {
|
|
350
|
-
V(u.nodeToRestore);
|
|
351
|
-
return;
|
|
352
|
-
}
|
|
353
|
-
u = u.parent;
|
|
354
|
-
}
|
|
355
|
-
for (u = l.getTreeNode(e); u; ) {
|
|
356
|
-
if (u.scopeRef && u.scopeRef.current && p.getTreeNode(u.scopeRef)) {
|
|
357
|
-
let d = q(u.scopeRef.current, !0);
|
|
358
|
-
V(d);
|
|
359
|
-
return;
|
|
360
|
-
}
|
|
361
|
-
u = u.parent;
|
|
362
|
-
}
|
|
363
|
-
}
|
|
364
|
-
});
|
|
365
|
-
}
|
|
366
|
-
};
|
|
367
|
-
}
|
|
368
|
-
}, [
|
|
369
|
-
e,
|
|
370
|
-
t
|
|
371
|
-
]);
|
|
372
|
-
}
|
|
373
|
-
function V(e) {
|
|
374
|
-
e.dispatchEvent(new CustomEvent(k, {
|
|
375
|
-
bubbles: !0,
|
|
376
|
-
cancelable: !0
|
|
377
|
-
})) && E(e);
|
|
378
|
-
}
|
|
379
|
-
function m(e, t, r) {
|
|
380
|
-
let o = t != null && t.tabbable ? X : z, n = N(e).createTreeWalker(e, NodeFilter.SHOW_ELEMENT, {
|
|
381
|
-
acceptNode(i) {
|
|
382
|
-
var c;
|
|
383
|
-
return !(t == null || (c = t.from) === null || c === void 0) && c.contains(i) ? NodeFilter.FILTER_REJECT : i.matches(o) && j(i) && (!r || h(i, r)) && (!(t != null && t.accept) || t.accept(i)) ? NodeFilter.FILTER_ACCEPT : NodeFilter.FILTER_SKIP;
|
|
384
|
-
}
|
|
385
|
-
});
|
|
386
|
-
return t != null && t.from && (n.currentNode = t.from), n;
|
|
387
|
-
}
|
|
388
|
-
function le(e, t = {}) {
|
|
389
|
-
return {
|
|
390
|
-
focusNext(r = {}) {
|
|
391
|
-
let o = e.current;
|
|
392
|
-
if (!o) return null;
|
|
393
|
-
let { from: n, tabbable: i = t.tabbable, wrap: c = t.wrap, accept: a = t.accept } = r, b = n || N(o).activeElement, l = m(o, {
|
|
394
|
-
tabbable: i,
|
|
395
|
-
accept: a
|
|
396
|
-
});
|
|
397
|
-
o.contains(b) && (l.currentNode = b);
|
|
398
|
-
let u = l.nextNode();
|
|
399
|
-
return !u && c && (l.currentNode = o, u = l.nextNode()), u && E(u, !0), u;
|
|
400
|
-
},
|
|
401
|
-
focusPrevious(r = t) {
|
|
402
|
-
let o = e.current;
|
|
403
|
-
if (!o) return null;
|
|
404
|
-
let { from: n, tabbable: i = t.tabbable, wrap: c = t.wrap, accept: a = t.accept } = r, b = n || N(o).activeElement, l = m(o, {
|
|
405
|
-
tabbable: i,
|
|
406
|
-
accept: a
|
|
407
|
-
});
|
|
408
|
-
if (o.contains(b)) l.currentNode = b;
|
|
409
|
-
else {
|
|
410
|
-
let d = R(l);
|
|
411
|
-
return d && E(d, !0), d ?? null;
|
|
412
|
-
}
|
|
413
|
-
let u = l.previousNode();
|
|
414
|
-
if (!u && c) {
|
|
415
|
-
l.currentNode = o;
|
|
416
|
-
let d = R(l);
|
|
417
|
-
if (!d)
|
|
418
|
-
return null;
|
|
419
|
-
u = d;
|
|
420
|
-
}
|
|
421
|
-
return u && E(u, !0), u ?? null;
|
|
422
|
-
},
|
|
423
|
-
focusFirst(r = t) {
|
|
424
|
-
let o = e.current;
|
|
425
|
-
if (!o) return null;
|
|
426
|
-
let { tabbable: n = t.tabbable, accept: i = t.accept } = r, a = m(o, {
|
|
427
|
-
tabbable: n,
|
|
428
|
-
accept: i
|
|
429
|
-
}).nextNode();
|
|
430
|
-
return a && E(a, !0), a;
|
|
431
|
-
},
|
|
432
|
-
focusLast(r = t) {
|
|
433
|
-
let o = e.current;
|
|
434
|
-
if (!o) return null;
|
|
435
|
-
let { tabbable: n = t.tabbable, accept: i = t.accept } = r, c = m(o, {
|
|
436
|
-
tabbable: n,
|
|
437
|
-
accept: i
|
|
438
|
-
}), a = R(c);
|
|
439
|
-
return a && E(a, !0), a ?? null;
|
|
440
|
-
}
|
|
441
|
-
};
|
|
442
|
-
}
|
|
443
|
-
function R(e) {
|
|
444
|
-
let t, r;
|
|
445
|
-
do
|
|
446
|
-
r = e.lastChild(), r && (t = r);
|
|
447
|
-
while (r);
|
|
448
|
-
return t;
|
|
449
|
-
}
|
|
450
|
-
class D {
|
|
451
|
-
get size() {
|
|
452
|
-
return this.fastMap.size;
|
|
453
|
-
}
|
|
454
|
-
getTreeNode(t) {
|
|
455
|
-
return this.fastMap.get(t);
|
|
456
|
-
}
|
|
457
|
-
addTreeNode(t, r, o) {
|
|
458
|
-
let n = this.fastMap.get(r ?? null);
|
|
459
|
-
if (!n) return;
|
|
460
|
-
let i = new A({
|
|
461
|
-
scopeRef: t
|
|
462
|
-
});
|
|
463
|
-
n.addChild(i), i.parent = n, this.fastMap.set(t, i), o && (i.nodeToRestore = o);
|
|
464
|
-
}
|
|
465
|
-
addNode(t) {
|
|
466
|
-
this.fastMap.set(t.scopeRef, t);
|
|
467
|
-
}
|
|
468
|
-
removeTreeNode(t) {
|
|
469
|
-
if (t === null) return;
|
|
470
|
-
let r = this.fastMap.get(t);
|
|
471
|
-
if (!r) return;
|
|
472
|
-
let o = r.parent;
|
|
473
|
-
for (let i of this.traverse()) i !== r && r.nodeToRestore && i.nodeToRestore && r.scopeRef && r.scopeRef.current && h(i.nodeToRestore, r.scopeRef.current) && (i.nodeToRestore = r.nodeToRestore);
|
|
474
|
-
let n = r.children;
|
|
475
|
-
o && (o.removeChild(r), n.size > 0 && n.forEach((i) => o && o.addChild(i))), this.fastMap.delete(r.scopeRef);
|
|
476
|
-
}
|
|
477
|
-
// Pre Order Depth First
|
|
478
|
-
*traverse(t = this.root) {
|
|
479
|
-
if (t.scopeRef != null && (yield t), t.children.size > 0) for (let r of t.children) yield* this.traverse(r);
|
|
480
|
-
}
|
|
481
|
-
clone() {
|
|
482
|
-
var t;
|
|
483
|
-
let r = new D();
|
|
484
|
-
var o;
|
|
485
|
-
for (let n of this.traverse()) r.addTreeNode(n.scopeRef, (o = (t = n.parent) === null || t === void 0 ? void 0 : t.scopeRef) !== null && o !== void 0 ? o : null, n.nodeToRestore);
|
|
486
|
-
return r;
|
|
487
|
-
}
|
|
488
|
-
constructor() {
|
|
489
|
-
this.fastMap = /* @__PURE__ */ new Map(), this.root = new A({
|
|
490
|
-
scopeRef: null
|
|
491
|
-
}), this.fastMap.set(null, this.root);
|
|
492
|
-
}
|
|
493
|
-
}
|
|
494
|
-
class A {
|
|
495
|
-
addChild(t) {
|
|
496
|
-
this.children.add(t), t.parent = this;
|
|
497
|
-
}
|
|
498
|
-
removeChild(t) {
|
|
499
|
-
this.children.delete(t), t.parent = void 0;
|
|
500
|
-
}
|
|
501
|
-
constructor(t) {
|
|
502
|
-
this.children = /* @__PURE__ */ new Set(), this.contain = !1, this.scopeRef = t.scopeRef;
|
|
503
|
-
}
|
|
504
|
-
}
|
|
505
|
-
let p = new D();
|
|
506
|
-
export {
|
|
507
|
-
m as $,
|
|
508
|
-
oe as a,
|
|
509
|
-
ae as b,
|
|
510
|
-
ie as c,
|
|
511
|
-
le as d
|
|
512
|
-
};
|