@iamfiro/design 0.1.0 → 0.3.1

package/lib/components/TagInput/TagInput2.js

@@ -0,0 +1,357 @@
+"use client";
+const e = r;
+(function(e, t) {
+	let n = r, i = e();
+	for (;;) try {
+		if (parseInt(n(471)) / 1 * (-parseInt(n(493)) / 2) + -parseInt(n(486)) / 3 + -parseInt(n(420)) / 4 * (-parseInt(n(455)) / 5) + parseInt(n(469)) / 6 * (-parseInt(n(426)) / 7) + -parseInt(n(461)) / 8 + -parseInt(n(423)) / 9 * (parseInt(n(417)) / 10) + parseInt(n(477)) / 11 == t) break;
+		i.push(i.shift());
+	} catch {
+		i.push(i.shift());
+	}
+})(h, 700971);
+import { usePresence as t } from "../../hooks/usePresence.js";
+import { useControllableState as n } from "../../hooks/useControllableState.js";
+function r(e, t) {
+	e -= 409;
+	let n = h(), i = n[e];
+	r.aSwKMj === void 0 && (r.UobRwK = function(e) {
+		let t = "", n = "";
+		for (let n = 0, r, i, a = 0; i = e.charAt(a++); ~i && (r = n % 4 ? r * 64 + i : i, n++ % 4) && (t += String.fromCharCode(255 & r >> (-2 * n & 6)))) i = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789+/=".indexOf(i);
+		for (let e = 0, r = t.length; e < r; e++) n += "%" + ("00" + t.charCodeAt(e).toString(16)).slice(-2);
+		return decodeURIComponent(n);
+	}, r.Njmdrq = {}, r.aSwKMj = !0);
+	let a = n[0];
+	r.OkyHDZ !== a && (r.Njmdrq = {}, r.OkyHDZ = a);
+	let o = r.Njmdrq[e];
+	return o === void 0 ? (i = r.UobRwK(i), r.Njmdrq[e] = i) : i = o, i;
+}
+import { cx as i } from "../../primitives/index.js";
+import { Listbox as a, ListboxPopover as o, nextEnabled as s, optionId as c } from "../Listbox/Listbox2.js";
+/* empty css         */
+import { useEffect as l, useId as ee, useMemo as te, useRef as u, useState as d } from "react";
+import { X as ne } from "lucide-react";
+import { Fragment as re, jsx as f, jsxs as p } from "react/jsx-runtime";
+var ie = 220, m = (t) => t[e(494)]().toLowerCase(), ae = (t) => t[e(499)](/[.*+?^${}()|[\]\\]/g, e(427)), oe = (t) => {
+	let n = e, r = /* @__PURE__ */ new Map();
+	return t[n(492)]((e) => {
+		let t = n, i = r[t(421)](e) ?? 0;
+		return r[t(419)](e, i + 1), e + "\0" + i;
+	});
+};
+function h() {
+	let e = /* @__PURE__ */ "mJGYmtm2nJLRAKDswLi.qxjYB3DeB3DU.zhvWBgLJyxrL.BwvZC2fNzq.Bwv0yuTLEq.Aw52ywXPza.C3rYAw5N.zM9JDxm.DgvZDa.mta5nde2m2rysKvkBq.zMLUzeLUzgv4.C29Tzq.y2XPCgjVyxjKrgf0yq.y3vYCMvUDfrHCMDLDa.AM9PBG.BwfW.mKjwtKTwCq.DhjPBq.Aw5WDxq.Bwf4.Aw5JBhvKzxm.vgfI.CMvWBgfJzq.zhmTDgfNAw5WDxrFx2vKAxrVCG.AgfZ.zhmTDgfNAw5WDxrFx3nSB3q.C3bSAwnL.ioY2LoQWGoUqQa.y3vYCMvUDa.CMvHC29U.zhvW.zgL2.rxnJyxbL.ioYcREYGNoUqQa.DMfSDwu.Dgv4Da.rw5K.nJbUwenSENu.qxjYB3DsAwDODa.C2v0.nev3tLnowq.z2v0.sg9Tzq.mtiXodmWm2HQC0nUAG.zhmTDgfNAw5WDxrFx2LJB24.BwLU.mZCYndD4EwrxyNm.xcqM.DgfYz2v0.C3bHBG.zgfUz2vY.zhmTy29UDhjVBa.zhmTDgfNAw5WDxq.A2v5q29Kzq.BgvHDMLUzW.y3rYBeTLEq.zhmTDgfNAw5WDxrFx2LUChv0.BMf0AxzLrxzLBNq.C2v0vgLTzw91Da.AxndB21WB3nPBMC.qxjYB3DvCa.zhmTC3iTB25SEq.zgf0yq.qxjYB3Dmzwz0.z2v0rgf0yq.C2vSzwn0Aw9Uu3rHCNq.rgvSzxrL.zMLSDgvY.qMfJA3nWywnL.ioY2LoYYNa.Cg9W.zhmTDgfNAw5WDxqTlq.ChjLDMvUDerLzMf1Bhq.C2HPzNrlzxK.Aw5KzxG.otu4nJK1u2Tht2nz.BgvUz3rO.ioYiMoYGLq.C2vSzwn0.y2XLyxjuAw1LB3v0.ChvZAa.ntq4mZiWqK1yDe9r.zhmTDgfNAw5WDxrFx3rHzW.lMrZlxrHz2LUChv0x19ZBg90.yNv0Dg9U.A2v5.C2vSzwn0Aw9Urw5K.7j6f66cLio2BHcbfBNrLCG.rw50zxi.odm0AgHethPL.AgLKzgvU.nZa1nJvmtg95AhG.C3bSAxq.Bw91BNrLza.y29TyM9IB3G.y2XVC2LUzW.C2XPy2u".split(".");
+	return h = function() {
+		return e;
+	}, h();
+}
+function g({ value: r, defaultValue: h = [], onValueChange: g, delimiters: _ = [
+	e(468),
+	e(498),
+	","
+], validate: v, allowInvalid: y, allowDuplicates: se, transform: ce = (e) => e, max: b, suggestions: x, onReject: le, editable: ue = !0, placeholder: de = e(467), size: fe = "md", disabled: S, invalid: pe, leading: me, name: C, id: he, className: ge, maxHeight: _e, "aria-label": w, "aria-labelledby": ve, "aria-describedby": ye }) {
+	let T = e, E = ee() + "-list", [D, O] = n(r, h, g), [k, A] = d(""), [j, M] = d(!1), [N, P] = d(-1), [F, I] = d(null), [be, L] = d([]), [R, xe] = d(null), [Se, Ce] = d(""), [we, Te] = d(!1), [z, B] = d(-1), [Ee, De] = d(!1), Oe = u(null), V = u(null), H = u(null), ke = u(null), U = u(0), W = u(!1), G = oe(D), [Ae] = d(() => new Set(G)), K = _[T(447)]((e) => e[T(456)] === 1), je = b !== void 0 && D.length >= b;
+	l(() => () => window[T(459)](U[T(505)]), []);
+	let Me = F?.[T(454)] ?? -1;
+	l(() => {
+		let e = T;
+		Me < 0 || (H[e(505)]?.focus(), H[e(505)]?.[e(458)]());
+	}, [Me]);
+	let Ne = (e, t) => v ? v(e, t) !== !0 : !1, Pe = (e, t, n = !1) => {
+		let r = T;
+		if (!n && b !== void 0 && t[r(456)] >= b) return {
+			ok: !1,
+			reason: "max"
+		};
+		if (!se) {
+			let n = t[r(487)]((t) => m(t) === m(e));
+			if (n >= 0) return {
+				ok: !1,
+				reason: "duplicate",
+				dup: n
+			};
+		}
+		if (v) {
+			let n = v(e, t);
+			if (n !== !0) return y ? {
+				ok: !0,
+				danger: !0
+			} : {
+				ok: !1,
+				reason: r(482),
+				message: typeof n === r(483) ? n : void 0
+			};
+		}
+		return {
+			ok: !0,
+			danger: !1
+		};
+	}, Fe = (e) => {
+		let t = T;
+		window[t(459)](U.current), xe((t) => ({
+			target: e,
+			n: (t?.n ?? 0) + 1
+		})), U[t(505)] = window[t(438)](() => xe(null), 480);
+	}, Ie = (e) => ce(e[T(494)]())[T(494)](), q = (e) => {
+		let t = T, n = [...D], r = [], i = null, a = !1;
+		for (let o of e) {
+			let e = Ie(o);
+			if (!e) continue;
+			let s = Pe(e, n);
+			s.ok ? n[t(460)](e) : (r[t(460)](o[t(494)]()), le?.(e, s[t(409)], s[t(480)]), s[t(409)] === t(479) ? i = s.dup ?? -1 : (i = -1, s[t(409)] === "invalid" && (a = !0)));
+		}
+		let o = n.slice(D.length);
+		return o[t(456)] && (O(n), Ce(o[t(491)](", ") + t(504))), i !== null && Fe(i), M(a), r;
+	}, J = (e) => {
+		let t = T, n = D[e];
+		if (n === void 0) return;
+		let r = {
+			key: G[e],
+			text: n,
+			index: e,
+			danger: y ? Ne(n, D) : !1
+		};
+		L((e) => [...e[t(447)]((e) => e[t(465)] !== r[t(465)]), r]), window[t(438)](() => L((e) => e[t(447)]((e) => e !== r)), ie), O(D[t(447)]((t, n) => n !== e)), Ce(n + t(413));
+	}, Y = () => requestAnimationFrame(() => V[T(505)]?.[T(484)]()), Le = (e) => {
+		ue && !S && (P(-1), W.current = !1, I({
+			index: e,
+			text: D[e]
+		}));
+	}, Re = (e = !0) => {
+		let t = T;
+		if (!F) return !0;
+		let { index: n } = F, r = Ie(F[t(415)]);
+		if (!r) return I(null), J(n), e && Y(), !0;
+		if (r !== D[n]) {
+			let e = D[t(447)]((e, t) => t !== n), i = Pe(r, e, !0);
+			if (!i.ok) return le?.(r, i.reason, i[t(480)]), Fe(i[t(409)] === t(479) && i[t(410)] !== void 0 ? i[t(410)] >= n ? i[t(410)] + 1 : i[t(410)] : n), !1;
+			let a = [...D];
+			a[n] = r, O(a);
+		}
+		return I(null), e && Y(), !0;
+	}, X = te(() => {
+		let e = T, t = m(k);
+		return !x || !t ? [] : x[e(447)]((n) => m(n).includes(t) && !D[e(488)]((e) => m(e) === m(n))).slice(0, 50);
+	}, [
+		x,
+		k,
+		D
+	]), Z = we && !Ee && !F && !je && X[T(456)] > 0, ze = t(Z), [Q, Be] = d([]);
+	Z && Q[T(491)]("\0") !== X.join("\0") && Be(X);
+	let Ve = Q.map((e) => ({
+		value: e,
+		label: e
+	})), He = (e) => {
+		let t = T;
+		q([e])[t(456)] || A(""), B(-1);
+	}, Ue = () => {
+		q([k]).length || A("");
+	}, We = (e) => {
+		let t = T;
+		if (e[t(437)][t(439)] || e[t(433)] === 229) return;
+		let n = e[t(490)], r = n[t(445)] === 0 && n[t(466)] === 0;
+		if (Z) {
+			if (e[t(465)] === t(478) || e[t(465)] === t(440)) {
+				e[t(452)](), B(s(Ve, z, e[t(465)] === t(478) ? 1 : -1));
+				return;
+			}
+			if (e[t(465)] === t(468) && z >= 0 && Q[z]) {
+				e.preventDefault(), He(Q[z]);
+				return;
+			}
+			if (e.key === t(412)) {
+				e.preventDefault(), De(!0), B(-1);
+				return;
+			}
+		}
+		switch (e[t(465)]) {
+			case t(443):
+				N >= 0 ? (e[t(452)](), P(Math[t(496)](0, N - 1))) : r && D.length && (e.preventDefault(), P(D[t(456)] - 1));
+				break;
+			case t(418):
+				N >= 0 && (e[t(452)](), P(N + 1 >= D[t(456)] ? -1 : N + 1));
+				break;
+			case t(422):
+				(N >= 0 || r && D.length) && (e[t(452)](), P(D[t(456)] ? 0 : -1));
+				break;
+			case t(416):
+				N >= 0 && (e[t(452)](), P(-1));
+				break;
+			case t(448):
+			case t(446):
+				N >= 0 ? (e[t(452)](), J(N), P(-1)) : e[t(465)] === t(448) && !k && D[t(456)] && (e[t(452)](), P(D[t(456)] - 1));
+				break;
+			case "Escape":
+				N >= 0 && (e[t(452)](), P(-1));
+				break;
+			case t(468):
+				N >= 0 ? (e[t(452)](), Le(N)) : _[t(497)](t(468)) && k[t(494)]() && (e[t(452)](), Ue());
+				break;
+			case t(498):
+				_.includes("Tab") && k[t(494)]() && !e[t(453)] && (e[t(452)](), Ue());
+				break;
+			default: N >= 0 && e[t(465)].length === 1 && !e[t(435)] && !e[t(481)] && P(-1);
+		}
+	}, Ge = (e) => {
+		let t = T, n = [...K, ...e];
+		return n.length ? new RegExp(n.map(ae)[t(491)]("|")) : null;
+	}, Ke = (e) => {
+		let t = T, n = e[t(490)].value;
+		P(-1), M(!1), De(!1), B(-1);
+		let r = e[t(437)][t(442)] ?? "", i = Ge([]);
+		if (i && K[t(488)]((e) => r[t(497)](e))) {
+			let e = n.split(i), r = e[t(450)]() ?? "", a = q(e);
+			A([...a, r][t(447)](Boolean)[t(491)](K[0] + " "));
+		} else A(n);
+	}, qe = (e) => {
+		let t = T, n = e[t(489)][t(444)](t(415)), r = [..._.includes(t(468)) ? [
+			"\r\n",
+			"\n",
+			"\r"
+		] : [], ..._.includes("Tab") ? ["	"] : []], i = Ge(r);
+		if (!i || !i[t(485)](n)) return;
+		e.preventDefault();
+		let a = e.currentTarget, o = k[t(476)](0, a[t(445)] ?? k.length), s = k[t(476)](a.selectionEnd ?? k[t(456)]), c = q(("" + o + n + s)[t(472)](i));
+		A(c.join((K[0] ?? ",") + " "));
+	}, $ = D[T(492)]((e, t) => ({
+		key: G[t],
+		text: e,
+		index: t,
+		leaving: !1,
+		danger: y ? Ne(e, D) : !1
+	}));
+	for (let e of [...be].sort((e, t) => e[T(454)] - t.index)) $.some((t) => t[T(465)] === e[T(465)]) || $[T(503)](Math[T(425)](e.index, $.length), 0, {
+		...e,
+		index: -1,
+		leaving: !0
+	});
+	let Je = R?.[T(428)] === -1 ? R.n % 2 ? "a" : "b" : void 0;
+	return p(re, { children: [
+		p(T(411), {
+			ref: Oe,
+			className: i(T(431), T(432), fe !== "md" && T(451) + fe, ge),
+			"data-tags": D[T(456)] > 0 || void 0,
+			"data-invalid": pe || j || void 0,
+			"data-disabled": S || void 0,
+			"data-shake": Je,
+			onPointerDown: (e) => {
+				let t = T;
+				S || e[t(428)] === V.current || e[t(428)].closest(t(463)) || (e[t(452)](), P(-1), V[t(505)]?.[t(484)]());
+			},
+			children: [
+				me && f(T(429), {
+					className: T(424),
+					children: me
+				}),
+				$[T(492)]((e) => {
+					let t = T, n = !e[t(434)] && F?.index === e.index, r = R && R[t(428)] === e[t(454)] && !e[t(434)] ? R.n % 2 ? "a" : "b" : void 0;
+					return f(t(429), {
+						className: t(502),
+						"data-leaving": e.leaving || void 0,
+						"data-new": !Ae[t(501)](e[t(465)]) || void 0,
+						"data-shake": r,
+						children: n && F ? f(t(429), {
+							className: t(500),
+							"data-value": F[t(415)],
+							children: f(t(495), {
+								ref: H,
+								"aria-label": e[t(415)] + t(457),
+								value: F.text,
+								size: 1,
+								onChange: (n) => I({
+									index: e.index,
+									text: n[t(428)][t(414)]
+								}),
+								onKeyDown: (e) => {
+									let n = t;
+									e[n(437)][n(439)] || e.keyCode === 229 || (e[n(465)] === "Enter" ? (e[n(452)](), Re() && (W.current = !0)) : e[n(465)] === "Escape" && (e.preventDefault(), W[n(505)] = !0, I(null), Y()));
+								},
+								onBlur: () => {
+									W[t(505)] || Re(!1) || I(null);
+								}
+							})
+						}) : p(t(429), {
+							className: t(462),
+							"data-active": !e[t(434)] && e[t(454)] === N || void 0,
+							"data-tone": e[t(430)] ? "danger" : void 0,
+							title: e[t(430)] && v && typeof v(e.text, D) === t(483) ? String(v(e[t(415)], D)) : void 0,
+							onPointerDown: (n) => {
+								let r = t;
+								S || e[r(434)] || (n[r(452)](), V[r(505)]?.[r(484)](), P(e[r(454)]));
+							},
+							onDoubleClick: () => !e.leaving && Le(e[t(454)]),
+							children: [f(t(429), {
+								className: "ds-taginput__label",
+								children: e.text
+							}), !S && f(t(464), {
+								type: t(464),
+								tabIndex: -1,
+								"aria-label": e[t(415)] + " 삭제",
+								className: "ds-taginput__remove",
+								onPointerDown: (e) => {
+									e[t(452)](), e.stopPropagation();
+								},
+								onClick: () => {
+									let n = t;
+									e[n(434)] || (J(e[n(454)]), P(-1), V[n(505)]?.focus());
+								},
+								children: f(ne, {})
+							})]
+						})
+					}, e[t(465)]);
+				}),
+				f(T(495), {
+					ref: V,
+					id: he,
+					className: T(436),
+					role: x ? T(474) : void 0,
+					"aria-expanded": x ? Z : void 0,
+					"aria-controls": Z ? E : void 0,
+					"aria-autocomplete": x ? "list" : void 0,
+					"aria-activedescendant": Z && z >= 0 ? c(E, z) : void 0,
+					"aria-invalid": pe || j || void 0,
+					"aria-label": w,
+					"aria-labelledby": ve,
+					"aria-describedby": ye,
+					autoComplete: "off",
+					disabled: S,
+					value: k,
+					placeholder: D.length ? "" : de,
+					"data-error": j || void 0,
+					onChange: Ke,
+					onKeyDown: We,
+					onPaste: qe,
+					onFocus: () => Te(!0),
+					onBlur: () => {
+						Te(!1), P(-1);
+					}
+				}),
+				f(T(429), {
+					className: T(441),
+					"aria-live": "polite",
+					children: Se
+				})
+			]
+		}),
+		C && D[T(492)]((e, t) => f(T(495), {
+			type: T(470),
+			name: C,
+			value: e
+		}, G[t])),
+		x && ze[T(473)] && f(o, {
+			ref: ke,
+			closing: ze[T(475)],
+			anchorRef: Oe,
+			maxHeight: _e,
+			children: f(a, {
+				id: E,
+				options: Ve,
+				activeIndex: z,
+				isSelected: () => !1,
+				onSelect: (e) => He(e[T(414)]),
+				onActiveChange: B,
+				"aria-label": w ? w + T(449) : "추천"
+			})
+		})
+	] });
+}
+export { g as TagInput };