@g4rcez/components 5.0.2 → 5.0.3

package/dist/dist-ChfJ5LO9.js

@@ -0,0 +1,498 @@
+import { o as e, t } from "./proxy-fP2NxmhM.js";
+import { $ as n, Ft as r, K as i, Nt as a, ft as o, it as s, kt as c, pt as l, st as u } from "./MotionConfigContext-BORpSKe8.js";
+import { t as d } from "./use-motion-value-BqPF1j90.js";
+import { createContext as f, forwardRef as p, useContext as m, useEffect as h, useRef as g } from "react";
+import { jsx as _ } from "react/jsx-runtime";
+//#region ../../node_modules/.pnpm/motion-dom@12.40.0/node_modules/motion-dom/dist/es/utils/transform.mjs
+function v(...e) {
+	let t = !Array.isArray(e[0]), n = t ? 0 : -1, r = e[0 + n], i = e[1 + n], a = e[2 + n], o = e[3 + n], c = s(i, a, o);
+	return t ? c(r) : c;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/value/use-combine-values.mjs
+function y(t, n) {
+	let r = d(n()), i = () => r.set(n());
+	return i(), e(() => {
+		let e = () => l.preRender(i, !1, !0), n = t.map((t) => t.on("change", e));
+		return () => {
+			n.forEach((e) => e()), o(i);
+		};
+	}), r;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/value/use-computed.mjs
+function b(e) {
+	n.current = [], e();
+	let t = y(n.current, e);
+	return n.current = void 0, t;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/value/use-transform.mjs
+function x(e, t, n, r) {
+	if (typeof e == "function") return b(e);
+	if (n !== void 0 && !Array.isArray(n) && typeof t != "function") return ee(e, t, n, r);
+	let i = typeof t == "function" ? t : v(t, n, r), a = Array.isArray(e) ? S(e, i) : S([e], ([e]) => i(e)), o = Array.isArray(e) ? void 0 : e.accelerate;
+	return o && !o.isTransformed && typeof t != "function" && Array.isArray(n) && r?.clamp !== !1 && (a.accelerate = {
+		...o,
+		times: t,
+		keyframes: n,
+		isTransformed: !0,
+		...r?.ease ? { ease: r.ease } : {}
+	}), a;
+}
+function S(e, t) {
+	let n = r(() => []);
+	return y(e, () => {
+		n.length = 0;
+		let r = e.length;
+		for (let t = 0; t < r; t++) n[t] = e[t].get();
+		return t(n);
+	});
+}
+function ee(e, t, n, i) {
+	let a = r(() => Object.keys(n)), o = r(() => ({}));
+	for (let r of a) o[r] = x(e, t, n[r], i);
+	return o;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/context/ReorderContext.mjs
+var C = f(null);
+//#endregion
+//#region ../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/components/Reorder/utils/check-reorder.mjs
+function te(e, t, n, r) {
+	if (!r) return e;
+	let i = e.findIndex((e) => e.value === t);
+	if (i === -1) return e;
+	let o = r > 0 ? 1 : -1, s = e[i + o];
+	if (!s) return e;
+	let c = e[i], l = s.layout, d = u(l.min, l.max, .5);
+	return o === 1 && c.layout.max + n > d || o === -1 && c.layout.min + n < d ? a(e, i, i + o) : e;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/components/Reorder/Group.mjs
+function ne({ children: e, as: n = "ul", axis: i = "y", onReorder: a, values: o, ...s }, l) {
+	let u = r(() => t[n]), d = [], f = g(!1), p = g(null);
+	c(!!o, "Reorder.Group must be provided a values prop", "reorder-values");
+	let m = {
+		axis: i,
+		groupRef: p,
+		registerItem: (e, t) => {
+			let n = d.findIndex((t) => e === t.value);
+			n === -1 ? d.push({
+				value: e,
+				layout: t[i]
+			}) : d[n].layout = t[i], d.sort(ie);
+		},
+		updateOrder: (e, t, n) => {
+			if (f.current) return;
+			let r = te(d, e, t, n);
+			if (d !== r) {
+				f.current = !0;
+				let e = [...o];
+				for (let t = 0; t < r.length; t++) if (d[t].value !== r[t].value) {
+					let n = o.indexOf(d[t].value), i = o.indexOf(r[t].value);
+					n !== -1 && i !== -1 && ([e[n], e[i]] = [e[i], e[n]]);
+					break;
+				}
+				a(e);
+			}
+		}
+	};
+	h(() => {
+		f.current = !1;
+	});
+	let v = (e) => {
+		p.current = e, typeof l == "function" ? l(e) : l && (l.current = e);
+	}, y = {
+		overflowAnchor: "none",
+		...s.style
+	};
+	return _(u, {
+		...s,
+		style: y,
+		ref: v,
+		ignoreStrict: !0,
+		children: _(C.Provider, {
+			value: m,
+			children: e
+		})
+	});
+}
+var re = /* @__PURE__ */ p(ne);
+function ie(e, t) {
+	return e.layout.min - t.layout.min;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/components/Reorder/utils/auto-scroll.mjs
+var w = 50, ae = 25, oe = new Set(["auto", "scroll"]), T = /* @__PURE__ */ new WeakMap(), E = /* @__PURE__ */ new WeakMap(), D = null;
+function se() {
+	if (D) {
+		let e = O(D, "y");
+		e && (E.delete(e), T.delete(e));
+		let t = O(D, "x");
+		t && t !== e && (E.delete(t), T.delete(t)), D = null;
+	}
+}
+function ce(e, t) {
+	let n = getComputedStyle(e), r = t === "x" ? n.overflowX : n.overflowY, i = e === document.body || e === document.documentElement;
+	return oe.has(r) || i;
+}
+function O(e, t) {
+	let n = e?.parentElement;
+	for (; n;) {
+		if (ce(n, t)) return n;
+		n = n.parentElement;
+	}
+	return null;
+}
+function le(e, t, n) {
+	let r = t.getBoundingClientRect(), i = n === "x" ? Math.max(0, r.left) : Math.max(0, r.top), a = n === "x" ? Math.min(window.innerWidth, r.right) : Math.min(window.innerHeight, r.bottom), o = e - i, s = a - e;
+	if (o < w) {
+		let e = 1 - o / w;
+		return {
+			amount: -25 * e * e,
+			edge: "start"
+		};
+	} else if (s < w) {
+		let e = 1 - s / w;
+		return {
+			amount: ae * e * e,
+			edge: "end"
+		};
+	}
+	return {
+		amount: 0,
+		edge: null
+	};
+}
+function ue(e, t, n, r) {
+	if (!e) return;
+	D = e;
+	let i = O(e, n);
+	if (!i) return;
+	let { amount: a, edge: o } = le(t - (n === "x" ? window.scrollX : window.scrollY), i, n);
+	if (o === null) {
+		E.delete(i), T.delete(i);
+		return;
+	}
+	let s = E.get(i), c = i === document.body || i === document.documentElement;
+	if (s !== o) {
+		if (!(o === "start" && r < 0 || o === "end" && r > 0)) return;
+		E.set(i, o);
+		let e = n === "x" ? i.scrollWidth - (c ? window.innerWidth : i.clientWidth) : i.scrollHeight - (c ? window.innerHeight : i.clientHeight);
+		T.set(i, e);
+	}
+	if (a > 0) {
+		let e = T.get(i);
+		if ((n === "x" ? c ? window.scrollX : i.scrollLeft : c ? window.scrollY : i.scrollTop) >= e) return;
+	}
+	n === "x" ? c ? window.scrollBy({ left: a }) : i.scrollLeft += a : c ? window.scrollBy({ top: a }) : i.scrollTop += a;
+}
+//#endregion
+//#region ../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/components/Reorder/Item.mjs
+function k(e, t = 0) {
+	return i(e) ? e : d(t);
+}
+function de({ children: e, style: n = {}, value: i, as: a = "li", onDrag: o, onDragEnd: s, layout: l = !0, ...u }, d) {
+	let f = r(() => t[a]), p = m(C), h = {
+		x: k(n.x),
+		y: k(n.y)
+	}, g = x([h.x, h.y], ([e, t]) => e || t ? 1 : "unset");
+	c(!!p, "Reorder.Item must be a child of Reorder.Group", "reorder-item-child");
+	let { axis: v, registerItem: y, updateOrder: b, groupRef: S } = p;
+	return _(f, {
+		drag: v,
+		...u,
+		dragSnapToOrigin: !0,
+		style: {
+			...n,
+			x: h.x,
+			y: h.y,
+			zIndex: g
+		},
+		layout: l,
+		onDrag: (e, t) => {
+			let { velocity: n, point: r } = t;
+			b(i, h[v].get(), n[v]), ue(S.current, r[v], v, n[v]), o && o(e, t);
+		},
+		onDragEnd: (e, t) => {
+			se(), s && s(e, t);
+		},
+		onLayoutMeasure: (e) => {
+			y(i, e);
+		},
+		ref: d,
+		ignoreStrict: !0,
+		children: e
+	});
+}
+var fe = /* @__PURE__ */ p(de), pe = Object.defineProperty, A = Object.getOwnPropertySymbols, me = Object.prototype.hasOwnProperty, he = Object.prototype.propertyIsEnumerable, j = (e, t, n) => t in e ? pe(e, t, {
+	enumerable: !0,
+	configurable: !0,
+	writable: !0,
+	value: n
+}) : e[t] = n, ge = (e, t) => {
+	for (var n in t ||= {}) me.call(t, n) && j(e, n, t[n]);
+	if (A) for (var n of A(t)) he.call(t, n) && j(e, n, t[n]);
+	return e;
+}, M = (e, t) => {
+	let n = e.length;
+	for (let r = 0; r < n; r++) if (t(e[r], r, e)) return !0;
+	return !1;
+}, _e = (e, t, n, r) => H(M, e, t, n, r), N = (e) => typeof e == "object", P = (e, t) => {
+	if (e === t) return !0;
+	if (e instanceof Date && t instanceof Date) return e.getTime() === t.getTime();
+	if (!e || !t || !N(e) && !N(t)) return e === t;
+	if (e.prototype !== t.prototype) return !1;
+	let n = Object.keys(e);
+	return n.length === Object.keys(t).length ? n.every((n) => P(e[n], t[n])) : !1;
+}, F = (e, t) => (N(e) || Array.isArray(e)) && t ? e[t] : e, I = (e) => (t, n) => t[e] === n[e] ? 0 : t[e] > n[e] ? 1 : -1, L = (e) => /[0-9.]+/.test(e), R = (e) => ["string", "number"].includes(typeof e), z = (e) => e == null || e?.length === 0 || e === "", B = {
+	eq: P,
+	is: Object.is,
+	"!=": (e, t) => e != t,
+	"!==": (e, t) => e !== t,
+	"<": (e, t) => e < t,
+	"<=": (e, t) => e <= t,
+	"==": (e, t) => e == t,
+	"===": (e, t) => e === t,
+	">": (e, t) => e > t,
+	">=": (e, t) => e >= t,
+	includes: (e, t) => `${e}`.includes(t),
+	notIncludes: (e, t) => !`${e}`.includes(t),
+	startsWith: (e, t) => `${e}`.startsWith(t),
+	endsWith: (e, t) => `${e}`.endsWith(t),
+	like: (e, t) => RegExp(`.*${t}.*`, "gi").test(`${e}`),
+	alphabetical: (e, t) => e.toString().localeCompare(t.toString()),
+	empty: z,
+	notEmpty: (e) => !z(e),
+	in: (e, t) => M(t, (t) => P(e, t)),
+	notIn: (e, t) => U(t, (t) => !P(e, t))
+}, ve = (e) => {
+	if (e in B) return B[e];
+	throw Error("Linq - Symbol not found");
+}, V = (e, t) => {
+	let n = [], r = e.length;
+	for (let i = 0; i < r; i++) t(e[i], i, e) && n.push(e[i]);
+	return n;
+}, H = (e, t, n, r, i) => {
+	if (typeof n == "function") return e(t, n);
+	let a = ve(r);
+	return n && r && i !== void 0 ? e(t, (e) => a(e[n], i)) : e(t, (e) => a(e, i));
+}, ye = (e, t, n, r) => H(V, e, t, n, r), U = (e, t) => {
+	for (let n = 0; n < e.length; n++) if (!t(e[n], n, e)) return !1;
+	return !0;
+}, be = (e, t, n, r) => H(U, e, t, n, r), W = (e) => {
+	if (e === null) return null;
+	let t = ge({}, e);
+	return Object.keys(t).forEach((n) => t[n] = N(e[n]) ? W(e[n]) : e[n]), Array.isArray(e) && e.length ? (t.length = e.length) && Array.from(t) : Array.isArray(e) ? Array.from(e) : t;
+}, G = (e, t) => {
+	if (N(t)) {
+		for (let n = 0; n < e.length; n++) {
+			let r = e[n];
+			if (P(t, r)) return !0;
+		}
+		return !1;
+	}
+	for (let n = 0; n < e.length; n++) {
+		let r = e[n];
+		if (P(t, r)) return !0;
+	}
+	return !1;
+}, K = (e, t) => {
+	let n = new Map(e.map((e) => [e[t], e]));
+	return Object.fromEntries(n.entries());
+}, xe = (e) => V(e, (e, t, n) => N(e) ? t === n.findIndex((t) => P(t, e)) : t === n.indexOf(e)), Se = (e, t) => {
+	let n = e.length;
+	for (let r = 0; r < n; r++) if (t(e[r], r, e)) return e[r];
+}, q = (e, t) => {
+	let n = /* @__PURE__ */ new Map();
+	return e.forEach((e) => {
+		let r = t(e), i = n.get(r) || [];
+		i.push(e), n.set(r, i);
+	}), Object.fromEntries(n.entries());
+}, Ce = (e, t) => q(e, (e) => e[t]), J = (e, t) => {
+	let n = [], r = 0, i = e.length;
+	for (; r < i; r++) {
+		let i = t(e[r], r, e);
+		n.push(i);
+	}
+	return n;
+}, we = (e, t) => {
+	let n = Number.parseInt(e, 10), r = Number.parseInt(t, 10);
+	return n > r ? [r, n] : [n, r];
+}, Te = (e, t, n = 1) => {
+	let r = [], i = e.charCodeAt(0), a = t.charCodeAt(0);
+	for (; i <= a; i += n) r.push(String.fromCharCode(i));
+	return L(e) && L(t) ? r.map((e) => Number.parseInt(e)) : r;
+}, Y = (e, t, n = 1) => {
+	let r = Math.abs(n);
+	if ((e.length > 1 || t.length > 1) && L(e) && L(t)) {
+		let n = [], [i, a] = we(e, t);
+		for (let e = i; e <= a; e += r) n.push(e);
+		return n;
+	}
+	return Te(e, t, r);
+}, Ee = (e, t, n = 1) => {
+	if (t === void 0) {
+		let [t, n, r] = e.split("..");
+		return r === void 0 ? Y(t, n, 1) : Y(t, r, Number.parseInt(n, 10));
+	}
+	return R(e) && R(t) ? Y(`${e}`, `${t}`, n) : Array.from({ length: e }, (e, n) => n * Math.abs(t));
+}, X = (e, t, n) => {
+	let r = t, i = n.length;
+	for (let t = 0; t < i; t++) {
+		let i = n[t];
+		r = e(r, i, t, n);
+	}
+	return r;
+}, Z = (e) => {
+	let t = Array.from(e.values()), n = null, r = null, i = t.length;
+	for (n = 0; n < i / 2; n += 1) {
+		r = i - 1 - n;
+		let e = t[n];
+		t[n] = t[r], t[r] = e;
+	}
+	return t;
+}, De = (e, t) => {
+	if (typeof t == "number") return e.slice(t);
+	let n = e.length;
+	for (let r = 0; r < n; r++) {
+		let n = e[r];
+		if (t(n, r, e)) return e.slice(r);
+	}
+	return e.slice(0);
+}, Oe = (e, t, n, r) => H(De, e, t, n, r), Q = (e, t) => {
+	let n = [...e];
+	return t === void 0 ? n.sort() : typeof t == "function" ? n.toSorted(t) : n.toSorted(I(t));
+}, $ = /* @__PURE__ */ ((e) => (e.Asc = "asc", e.Desc = "desc", e))($ || {}), ke = (e) => (t, n) => e.reduce((e, r) => {
+	let i = r.type === "desc" ? -1 : 1, a = r.key, o = t[a] > n[a] ? i : t[a] < n[a] ? -i : 0;
+	return e === 0 ? o : e;
+}, 0), Ae = (e, t) => e.sort(ke(t)), je = (e, t) => {
+	if (t === void 0) return [...new Set(e).values()];
+	let n = /* @__PURE__ */ new Set();
+	return Array.isArray(t) ? [...new Set(t)] : V(e, (e) => {
+		let r = t ? n.has(e[t]) : n.has(t);
+		return t && (r || n.add(e[t])), !r;
+	});
+}, Me = class e {
+	constructor(e = []) {
+		this.array = e;
+	}
+	static Range(...e) {
+		return Ee(...e);
+	}
+	static New(t) {
+		return new e(t);
+	}
+	Where(e, t, n) {
+		return this.array = ye(this.array, e, t, n), this;
+	}
+	Some(e, t, n) {
+		return _e(this.array, e, t, n);
+	}
+	All(e, t, n) {
+		return be(this.array, e, t, n);
+	}
+	Reverse() {
+		return this.array = Z(this.array), this;
+	}
+	Add(e) {
+		return this.array = Array.isArray(e) ? this.array.concat(e) : this.array.concat([e]), this;
+	}
+	Prepend(e) {
+		return this.array = Array.isArray(e) ? e.concat(this.array) : [e].concat(this.array), this;
+	}
+	Select(e) {
+		return e === void 0 ? this.array : this.array.map(e);
+	}
+	Take(e, t) {
+		return t === void 0 ? this.array = this.array.slice(e) : this.array = this.array.slice(e, Math.max(0, t)), this;
+	}
+	Head() {
+		return this.array[0];
+	}
+	Tail() {
+		return this.Skip(1);
+	}
+	Skip(e, t, n) {
+		return this.array = Oe(this.array, e, t, n), this;
+	}
+	Distinct() {
+		return this.array = xe(this.array), this;
+	}
+	First(e) {
+		return e === void 0 ? this.array[0] : Se(this.array, e) || null;
+	}
+	Last(e) {
+		let t = this.array.length;
+		if (e === void 0) return this.array[t - 1];
+		for (let n = t; n !== 0; n--) if (e(this.array[n], n, this.array)) return this.array[n];
+	}
+	Sum(e) {
+		return X(e === void 0 ? (e, t) => e + t : (t, n) => t + F(n, e), 0, this.array);
+	}
+	Average(e) {
+		return this.Sum(e) / this.array.length;
+	}
+	GroupBy(e) {
+		return Ce(this.array, e);
+	}
+	GroupWith(e) {
+		return q(this.array, e);
+	}
+	Except(e) {
+		return V(this.array, (t) => !G(e, t));
+	}
+	Intersect(e) {
+		return V(this.array, (t) => G(e, t));
+	}
+	OrderBy(e, t) {
+		let n;
+		return n = e ? Q(this.array, e) : this.array.toSorted(), this.array = t === "desc" ? Z(n) : n, this;
+	}
+	Includes(e) {
+		return M(this.array, (t) => P(t, e));
+	}
+	In(e) {
+		let t = e.length;
+		for (let n = 0; n < t; n++) {
+			let t = e[n];
+			if (this.Includes(t)) return !0;
+		}
+		return !1;
+	}
+	Reduce(e, t) {
+		return X(e, t ?? this.array[0], this.array);
+	}
+	Empty() {
+		return this.array.length === 0;
+	}
+	ToMap(e) {
+		return new Map(J(this.array, (t) => [e, t]));
+	}
+	Zip(e, t) {
+		return J(this.array, (n, r) => t(n, e[r]));
+	}
+	Count(e) {
+		return e === void 0 ? this.array.length : V(this.array, e).length;
+	}
+	Get(e) {
+		return this.array[e];
+	}
+	Clone() {
+		return new e(W(this.array));
+	}
+	ToObject(e) {
+		return K(this.array, e);
+	}
+	Sort(e) {
+		return Array.isArray(e) ? Ae(this.array, e) : Q(this.array, e);
+	}
+	Unique(e) {
+		return je(this.array, e);
+	}
+};
+//#endregion
+export { re as i, Me as n, fe as r, $ as t };
+
+//# sourceMappingURL=dist-ChfJ5LO9.js.map

package/dist/dist-ChfJ5LO9.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dist-ChfJ5LO9.js","names":["outputRange"],"sources":["../../../node_modules/.pnpm/motion-dom@12.40.0/node_modules/motion-dom/dist/es/utils/transform.mjs","../../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/value/use-combine-values.mjs","../../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/value/use-computed.mjs","../../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/value/use-transform.mjs","../../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/context/ReorderContext.mjs","../../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/components/Reorder/utils/check-reorder.mjs","../../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/components/Reorder/Group.mjs","../../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/components/Reorder/utils/auto-scroll.mjs","../../../node_modules/.pnpm/framer-motion@12.40.0_react-dom@19.2.3_react@19.2.3__react@19.2.3/node_modules/framer-motion/dist/es/components/Reorder/Item.mjs","../../../node_modules/.pnpm/linq-arrays@3.2.5/node_modules/linq-arrays/dist/index.mjs"],"sourcesContent":["import { interpolate } from './interpolate.mjs';\n\nfunction transform(...args) {\n    const useImmediate = !Array.isArray(args[0]);\n    const argOffset = useImmediate ? 0 : -1;\n    const inputValue = args[0 + argOffset];\n    const inputRange = args[1 + argOffset];\n    const outputRange = args[2 + argOffset];\n    const options = args[3 + argOffset];\n    const interpolator = interpolate(inputRange, outputRange, options);\n    return useImmediate ? interpolator(inputValue) : interpolator;\n}\n\nexport { transform };\n//# sourceMappingURL=transform.mjs.map\n","\"use client\";\nimport { cancelFrame, frame } from 'motion-dom';\nimport { useIsomorphicLayoutEffect } from '../utils/use-isomorphic-effect.mjs';\nimport { useMotionValue } from './use-motion-value.mjs';\n\nfunction useCombineMotionValues(values, combineValues) {\n    /**\n     * Initialise the returned motion value. This remains the same between renders.\n     */\n    const value = useMotionValue(combineValues());\n    /**\n     * Create a function that will update the template motion value with the latest values.\n     * This is pre-bound so whenever a motion value updates it can schedule its\n     * execution in Framesync. If it's already been scheduled it won't be fired twice\n     * in a single frame.\n     */\n    const updateValue = () => value.set(combineValues());\n    /**\n     * Synchronously update the motion value with the latest values during the render.\n     * This ensures that within a React render, the styles applied to the DOM are up-to-date.\n     */\n    updateValue();\n    /**\n     * Subscribe to all motion values found within the template. Whenever any of them change,\n     * schedule an update.\n     */\n    useIsomorphicLayoutEffect(() => {\n        const scheduleUpdate = () => frame.preRender(updateValue, false, true);\n        const subscriptions = values.map((v) => v.on(\"change\", scheduleUpdate));\n        return () => {\n            subscriptions.forEach((unsubscribe) => unsubscribe());\n            cancelFrame(updateValue);\n        };\n    });\n    return value;\n}\n\nexport { useCombineMotionValues };\n//# sourceMappingURL=use-combine-values.mjs.map\n","\"use client\";\nimport { collectMotionValues } from 'motion-dom';\nimport { useCombineMotionValues } from './use-combine-values.mjs';\n\nfunction useComputed(compute) {\n    /**\n     * Open session of collectMotionValues. Any MotionValue that calls get()\n     * will be saved into this array.\n     */\n    collectMotionValues.current = [];\n    compute();\n    const value = useCombineMotionValues(collectMotionValues.current, compute);\n    /**\n     * Synchronously close session of collectMotionValues.\n     */\n    collectMotionValues.current = undefined;\n    return value;\n}\n\nexport { useComputed };\n//# sourceMappingURL=use-computed.mjs.map\n","\"use client\";\nimport { transform } from 'motion-dom';\nimport { useConstant } from '../utils/use-constant.mjs';\nimport { useCombineMotionValues } from './use-combine-values.mjs';\nimport { useComputed } from './use-computed.mjs';\n\nfunction useTransform(input, inputRangeOrTransformer, outputRangeOrMap, options) {\n    if (typeof input === \"function\") {\n        return useComputed(input);\n    }\n    /**\n     * Detect if outputRangeOrMap is an output map (object with keys)\n     * rather than an output range (array).\n     */\n    const isOutputMap = outputRangeOrMap !== undefined &&\n        !Array.isArray(outputRangeOrMap) &&\n        typeof inputRangeOrTransformer !== \"function\";\n    if (isOutputMap) {\n        return useMapTransform(input, inputRangeOrTransformer, outputRangeOrMap, options);\n    }\n    const outputRange = outputRangeOrMap;\n    const transformer = typeof inputRangeOrTransformer === \"function\"\n        ? inputRangeOrTransformer\n        : transform(inputRangeOrTransformer, outputRange, options);\n    const result = Array.isArray(input)\n        ? useListTransform(input, transformer)\n        : useListTransform([input], ([latest]) => transformer(latest));\n    const inputAccelerate = !Array.isArray(input)\n        ? input.accelerate\n        : undefined;\n    if (inputAccelerate &&\n        !inputAccelerate.isTransformed &&\n        typeof inputRangeOrTransformer !== \"function\" &&\n        Array.isArray(outputRangeOrMap) &&\n        options?.clamp !== false) {\n        result.accelerate = {\n            ...inputAccelerate,\n            times: inputRangeOrTransformer,\n            keyframes: outputRangeOrMap,\n            isTransformed: true,\n            ...(options?.ease ? { ease: options.ease } : {}),\n        };\n    }\n    return result;\n}\nfunction useListTransform(values, transformer) {\n    const latest = useConstant(() => []);\n    return useCombineMotionValues(values, () => {\n        latest.length = 0;\n        const numValues = values.length;\n        for (let i = 0; i < numValues; i++) {\n            latest[i] = values[i].get();\n        }\n        return transformer(latest);\n    });\n}\nfunction useMapTransform(inputValue, inputRange, outputMap, options) {\n    /**\n     * Capture keys once to ensure hooks are called in consistent order.\n     */\n    const keys = useConstant(() => Object.keys(outputMap));\n    const output = useConstant(() => ({}));\n    for (const key of keys) {\n        output[key] = useTransform(inputValue, inputRange, outputMap[key], options);\n    }\n    return output;\n}\n\nexport { useTransform };\n//# sourceMappingURL=use-transform.mjs.map\n","\"use client\";\nimport { createContext } from 'react';\n\nconst ReorderContext = createContext(null);\n\nexport { ReorderContext };\n//# sourceMappingURL=ReorderContext.mjs.map\n","import { mixNumber } from 'motion-dom';\nimport { moveItem } from 'motion-utils';\n\nfunction checkReorder(order, value, offset, velocity) {\n    if (!velocity)\n        return order;\n    const index = order.findIndex((item) => item.value === value);\n    if (index === -1)\n        return order;\n    const nextOffset = velocity > 0 ? 1 : -1;\n    const nextItem = order[index + nextOffset];\n    if (!nextItem)\n        return order;\n    const item = order[index];\n    const nextLayout = nextItem.layout;\n    const nextItemCenter = mixNumber(nextLayout.min, nextLayout.max, 0.5);\n    if ((nextOffset === 1 && item.layout.max + offset > nextItemCenter) ||\n        (nextOffset === -1 && item.layout.min + offset < nextItemCenter)) {\n        return moveItem(order, index, index + nextOffset);\n    }\n    return order;\n}\n\nexport { checkReorder };\n//# sourceMappingURL=check-reorder.mjs.map\n","\"use client\";\nimport { jsx } from 'react/jsx-runtime';\nimport { invariant } from 'motion-utils';\nimport { forwardRef, useRef, useEffect } from 'react';\nimport { ReorderContext } from '../../context/ReorderContext.mjs';\nimport { motion } from '../../render/components/motion/proxy.mjs';\nimport { useConstant } from '../../utils/use-constant.mjs';\nimport { checkReorder } from './utils/check-reorder.mjs';\n\nfunction ReorderGroupComponent({ children, as = \"ul\", axis = \"y\", onReorder, values, ...props }, externalRef) {\n    const Component = useConstant(() => motion[as]);\n    const order = [];\n    const isReordering = useRef(false);\n    const groupRef = useRef(null);\n    invariant(Boolean(values), \"Reorder.Group must be provided a values prop\", \"reorder-values\");\n    const context = {\n        axis,\n        groupRef,\n        registerItem: (value, layout) => {\n            // If the entry was already added, update it rather than adding it again\n            const idx = order.findIndex((entry) => value === entry.value);\n            if (idx !== -1) {\n                order[idx].layout = layout[axis];\n            }\n            else {\n                order.push({ value: value, layout: layout[axis] });\n            }\n            order.sort(compareMin);\n        },\n        updateOrder: (item, offset, velocity) => {\n            if (isReordering.current)\n                return;\n            const newOrder = checkReorder(order, item, offset, velocity);\n            if (order !== newOrder) {\n                isReordering.current = true;\n                // Find which two values swapped and apply that swap\n                // to the full values array. This preserves unmeasured\n                // items (e.g. in virtualized lists).\n                const newValues = [...values];\n                for (let i = 0; i < newOrder.length; i++) {\n                    if (order[i].value !== newOrder[i].value) {\n                        const a = values.indexOf(order[i].value);\n                        const b = values.indexOf(newOrder[i].value);\n                        if (a !== -1 && b !== -1) {\n                            [newValues[a], newValues[b]] = [newValues[b], newValues[a]];\n                        }\n                        break;\n                    }\n                }\n                onReorder(newValues);\n            }\n        },\n    };\n    useEffect(() => {\n        isReordering.current = false;\n    });\n    // Combine refs if external ref is provided\n    const setRef = (element) => {\n        groupRef.current = element;\n        if (typeof externalRef === \"function\") {\n            externalRef(element);\n        }\n        else if (externalRef) {\n            externalRef.current = element;\n        }\n    };\n    /**\n     * Disable browser scroll anchoring on the group container.\n     * When items reorder, scroll anchoring can cause the browser to adjust\n     * the scroll position, which interferes with drag position calculations.\n     */\n    const groupStyle = {\n        overflowAnchor: \"none\",\n        ...props.style,\n    };\n    return (jsx(Component, { ...props, style: groupStyle, ref: setRef, ignoreStrict: true, children: jsx(ReorderContext.Provider, { value: context, children: children }) }));\n}\nconst ReorderGroup = /*@__PURE__*/ forwardRef(ReorderGroupComponent);\nfunction compareMin(a, b) {\n    return a.layout.min - b.layout.min;\n}\n\nexport { ReorderGroup, ReorderGroupComponent };\n//# sourceMappingURL=Group.mjs.map\n","const threshold = 50;\nconst maxSpeed = 25;\nconst overflowStyles = new Set([\"auto\", \"scroll\"]);\n// Track initial scroll limits per scrollable element (Bug 1 fix)\nconst initialScrollLimits = new WeakMap();\nconst activeScrollEdge = new WeakMap();\n// Track which group element is currently dragging to clear state on end\nlet currentGroupElement = null;\nfunction resetAutoScrollState() {\n    if (currentGroupElement) {\n        const scrollableAncestor = findScrollableAncestor(currentGroupElement, \"y\");\n        if (scrollableAncestor) {\n            activeScrollEdge.delete(scrollableAncestor);\n            initialScrollLimits.delete(scrollableAncestor);\n        }\n        // Also try x axis\n        const scrollableAncestorX = findScrollableAncestor(currentGroupElement, \"x\");\n        if (scrollableAncestorX && scrollableAncestorX !== scrollableAncestor) {\n            activeScrollEdge.delete(scrollableAncestorX);\n            initialScrollLimits.delete(scrollableAncestorX);\n        }\n        currentGroupElement = null;\n    }\n}\nfunction isScrollableElement(element, axis) {\n    const style = getComputedStyle(element);\n    const overflow = axis === \"x\" ? style.overflowX : style.overflowY;\n    const isDocumentScroll = element === document.body ||\n        element === document.documentElement;\n    return overflowStyles.has(overflow) || isDocumentScroll;\n}\nfunction findScrollableAncestor(element, axis) {\n    let current = element?.parentElement;\n    while (current) {\n        if (isScrollableElement(current, axis)) {\n            return current;\n        }\n        current = current.parentElement;\n    }\n    return null;\n}\nfunction getScrollAmount(pointerPosition, scrollElement, axis) {\n    const rect = scrollElement.getBoundingClientRect();\n    const start = axis === \"x\" ? Math.max(0, rect.left) : Math.max(0, rect.top);\n    const end = axis === \"x\" ? Math.min(window.innerWidth, rect.right) : Math.min(window.innerHeight, rect.bottom);\n    const distanceFromStart = pointerPosition - start;\n    const distanceFromEnd = end - pointerPosition;\n    if (distanceFromStart < threshold) {\n        const intensity = 1 - distanceFromStart / threshold;\n        return { amount: -maxSpeed * intensity * intensity, edge: \"start\" };\n    }\n    else if (distanceFromEnd < threshold) {\n        const intensity = 1 - distanceFromEnd / threshold;\n        return { amount: maxSpeed * intensity * intensity, edge: \"end\" };\n    }\n    return { amount: 0, edge: null };\n}\nfunction autoScrollIfNeeded(groupElement, pointerPosition, axis, velocity) {\n    if (!groupElement)\n        return;\n    // Track the group element for cleanup\n    currentGroupElement = groupElement;\n    const scrollableAncestor = findScrollableAncestor(groupElement, axis);\n    if (!scrollableAncestor)\n        return;\n    // Convert pointer position from page coordinates to viewport coordinates.\n    // The gesture system uses pageX/pageY but getBoundingClientRect() returns\n    // viewport-relative coordinates, so we need to account for page scroll.\n    const viewportPointerPosition = pointerPosition - (axis === \"x\" ? window.scrollX : window.scrollY);\n    const { amount: scrollAmount, edge } = getScrollAmount(viewportPointerPosition, scrollableAncestor, axis);\n    // If not in any threshold zone, clear all state\n    if (edge === null) {\n        activeScrollEdge.delete(scrollableAncestor);\n        initialScrollLimits.delete(scrollableAncestor);\n        return;\n    }\n    const currentActiveEdge = activeScrollEdge.get(scrollableAncestor);\n    const isDocumentScroll = scrollableAncestor === document.body ||\n        scrollableAncestor === document.documentElement;\n    // If not currently scrolling this edge, check velocity to see if we should start\n    if (currentActiveEdge !== edge) {\n        // Only start scrolling if velocity is towards the edge\n        const shouldStart = (edge === \"start\" && velocity < 0) ||\n            (edge === \"end\" && velocity > 0);\n        if (!shouldStart)\n            return;\n        // Activate this edge\n        activeScrollEdge.set(scrollableAncestor, edge);\n        // Record initial scroll limit (prevents infinite scroll)\n        const maxScroll = axis === \"x\"\n            ? scrollableAncestor.scrollWidth - (isDocumentScroll ? window.innerWidth : scrollableAncestor.clientWidth)\n            : scrollableAncestor.scrollHeight - (isDocumentScroll ? window.innerHeight : scrollableAncestor.clientHeight);\n        initialScrollLimits.set(scrollableAncestor, maxScroll);\n    }\n    // Cap scrolling at initial limit (prevents infinite scroll)\n    if (scrollAmount > 0) {\n        const initialLimit = initialScrollLimits.get(scrollableAncestor);\n        const currentScroll = axis === \"x\"\n            ? (isDocumentScroll ? window.scrollX : scrollableAncestor.scrollLeft)\n            : (isDocumentScroll ? window.scrollY : scrollableAncestor.scrollTop);\n        if (currentScroll >= initialLimit)\n            return;\n    }\n    // Apply scroll\n    if (axis === \"x\") {\n        if (isDocumentScroll) {\n            window.scrollBy({ left: scrollAmount });\n        }\n        else {\n            scrollableAncestor.scrollLeft += scrollAmount;\n        }\n    }\n    else {\n        if (isDocumentScroll) {\n            window.scrollBy({ top: scrollAmount });\n        }\n        else {\n            scrollableAncestor.scrollTop += scrollAmount;\n        }\n    }\n}\n\nexport { autoScrollIfNeeded, resetAutoScrollState };\n//# sourceMappingURL=auto-scroll.mjs.map\n","\"use client\";\nimport { jsx } from 'react/jsx-runtime';\nimport { isMotionValue } from 'motion-dom';\nimport { invariant } from 'motion-utils';\nimport { forwardRef, useContext } from 'react';\nimport { ReorderContext } from '../../context/ReorderContext.mjs';\nimport { motion } from '../../render/components/motion/proxy.mjs';\nimport { useConstant } from '../../utils/use-constant.mjs';\nimport { useMotionValue } from '../../value/use-motion-value.mjs';\nimport { useTransform } from '../../value/use-transform.mjs';\nimport { autoScrollIfNeeded, resetAutoScrollState } from './utils/auto-scroll.mjs';\n\nfunction useDefaultMotionValue(value, defaultValue = 0) {\n    return isMotionValue(value) ? value : useMotionValue(defaultValue);\n}\nfunction ReorderItemComponent({ children, style = {}, value, as = \"li\", onDrag, onDragEnd, layout = true, ...props }, externalRef) {\n    const Component = useConstant(() => motion[as]);\n    const context = useContext(ReorderContext);\n    const point = {\n        x: useDefaultMotionValue(style.x),\n        y: useDefaultMotionValue(style.y),\n    };\n    const zIndex = useTransform([point.x, point.y], ([latestX, latestY]) => latestX || latestY ? 1 : \"unset\");\n    invariant(Boolean(context), \"Reorder.Item must be a child of Reorder.Group\", \"reorder-item-child\");\n    const { axis, registerItem, updateOrder, groupRef } = context;\n    return (jsx(Component, { drag: axis, ...props, dragSnapToOrigin: true, style: { ...style, x: point.x, y: point.y, zIndex }, layout: layout, onDrag: (event, gesturePoint) => {\n            const { velocity, point: pointerPoint } = gesturePoint;\n            const offset = point[axis].get();\n            // Always attempt to update order - checkReorder handles the logic\n            updateOrder(value, offset, velocity[axis]);\n            autoScrollIfNeeded(groupRef.current, pointerPoint[axis], axis, velocity[axis]);\n            onDrag && onDrag(event, gesturePoint);\n        }, onDragEnd: (event, gesturePoint) => {\n            resetAutoScrollState();\n            onDragEnd && onDragEnd(event, gesturePoint);\n        }, onLayoutMeasure: (measured) => {\n            registerItem(value, measured);\n        }, ref: externalRef, ignoreStrict: true, children: children }));\n}\nconst ReorderItem = /*@__PURE__*/ forwardRef(ReorderItemComponent);\n\nexport { ReorderItem, ReorderItemComponent };\n//# sourceMappingURL=Item.mjs.map\n","var __defProp = Object.defineProperty;\nvar __getOwnPropSymbols = Object.getOwnPropertySymbols;\nvar __hasOwnProp = Object.prototype.hasOwnProperty;\nvar __propIsEnum = Object.prototype.propertyIsEnumerable;\nvar __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;\nvar __spreadValues = (a, b) => {\n  for (var prop in b || (b = {}))\n    if (__hasOwnProp.call(b, prop))\n      __defNormalProp(a, prop, b[prop]);\n  if (__getOwnPropSymbols)\n    for (var prop of __getOwnPropSymbols(b)) {\n      if (__propIsEnum.call(b, prop))\n        __defNormalProp(a, prop, b[prop]);\n    }\n  return a;\n};\n\n// src/methods/any.ts\nvar any = (array, callback) => {\n  const len = array.length;\n  for (let index = 0; index < len; index++) {\n    const includes = callback(array[index], index, array);\n    if (includes) {\n      return true;\n    }\n  }\n  return false;\n};\nvar anyLikeWhere = (array, args, symbol, value) => whereSymbol(any, array, args, symbol, value);\n\n// src/methods/utils.ts\nvar isObject = (a) => typeof a === \"object\";\nvar equals = (a, b) => {\n  if (a === b) {\n    return true;\n  }\n  if (a instanceof Date && b instanceof Date) {\n    return a.getTime() === b.getTime();\n  }\n  if (!a || !b || !isObject(a) && !isObject(b)) {\n    return a === b;\n  }\n  if (a.prototype !== b.prototype) {\n    return false;\n  }\n  const keys = Object.keys(a);\n  if (keys.length !== Object.keys(b).length) {\n    return false;\n  }\n  return keys.every((k) => equals(a[k], b[k]));\n};\nvar getKey = (obj, key) => {\n  if ((isObject(obj) || Array.isArray(obj)) && !!key) {\n    return obj[key];\n  }\n  return obj;\n};\nvar sortBy = (key) => (a, b) => {\n  if (a[key] === b[key]) {\n    return 0;\n  }\n  return a[key] > b[key] ? 1 : -1;\n};\nvar isNumber = (a) => /[0-9.]+/.test(a);\nvar isNumberOrString = (o) => [\"string\", \"number\"].includes(typeof o);\n\n// src/symbols.ts\nvar isEmpty = (v) => v === void 0 || v === null || (v == null ? void 0 : v.length) === 0 || v === \"\";\nvar symbolMap = {\n  eq: equals,\n  is: Object.is,\n  \"!=\": (v, c) => v != c,\n  \"!==\": (v, c) => v !== c,\n  \"<\": (v, c) => v < c,\n  \"<=\": (v, c) => v <= c,\n  \"==\": (v, c) => v == c,\n  \"===\": (v, c) => v === c,\n  \">\": (v, c) => v > c,\n  \">=\": (v, c) => v >= c,\n  includes: (v, c) => `${v}`.includes(c),\n  notIncludes: (v, c) => !`${v}`.includes(c),\n  startsWith: (v, c) => `${v}`.startsWith(c),\n  endsWith: (v, c) => `${v}`.endsWith(c),\n  like: (v, c) => new RegExp(`.*${c}.*`, \"gi\").test(`${v}`),\n  alphabetical: (v, c) => v.toString().localeCompare(c.toString()),\n  empty: isEmpty,\n  notEmpty: (x) => !isEmpty(x),\n  in: (v, c) => any(c, (x) => equals(v, x)),\n  notIn: (v, c) => all(c, (x) => !equals(v, x))\n};\nvar GetOperationFromSymbol = (symbol) => {\n  if (symbol in symbolMap)\n    return symbolMap[symbol];\n  throw new Error(\"Linq - Symbol not found\");\n};\n\n// src/methods/filter.ts\nvar filter = (array, callback) => {\n  const mappedArray = [];\n  const len = array.length;\n  for (let index = 0; index < len; index++) {\n    const includes = callback(array[index], index, array);\n    if (includes) {\n      mappedArray.push(array[index]);\n    }\n  }\n  return mappedArray;\n};\n\n// src/methods/where.ts\nvar whereSymbol = (func, array, args, symbol, value) => {\n  if (typeof args === \"function\")\n    return func(array, args);\n  const op = GetOperationFromSymbol(symbol);\n  if (!!args && !!symbol && value !== void 0)\n    return func(array, (x) => op(x[args], value));\n  return func(array, (x) => op(x, value));\n};\nvar where = (array, args, symbol, value) => whereSymbol(filter, array, args, symbol, value);\n\n// src/methods/all.ts\nvar all = (array, callback) => {\n  for (let index = 0; index < array.length; index++) {\n    const includes = callback(array[index], index, array);\n    if (!includes) {\n      return false;\n    }\n  }\n  return true;\n};\nvar allLikeWhere = (array, args, symbol, value) => whereSymbol(all, array, args, symbol, value);\n\n// src/methods/clone.ts\nvar deepClone = (obj) => {\n  if (obj === null) {\n    return null;\n  }\n  const clone = __spreadValues({}, obj);\n  Object.keys(clone).forEach((key) => clone[key] = isObject(obj[key]) ? deepClone(obj[key]) : obj[key]);\n  return Array.isArray(obj) && obj.length ? (clone.length = obj.length) && Array.from(clone) : Array.isArray(obj) ? Array.from(obj) : clone;\n};\n\n// src/methods/contains.ts\nvar contains = (array, element) => {\n  if (isObject(element)) {\n    for (let index = 0; index < array.length; index++) {\n      const current = array[index];\n      if (equals(element, current)) {\n        return true;\n      }\n    }\n    return false;\n  }\n  for (let index = 0; index < array.length; index++) {\n    const current = array[index];\n    if (equals(element, current)) {\n      return true;\n    }\n  }\n  return false;\n};\n\n// src/methods/dict.ts\nvar dict = (array, key) => {\n  const map2 = new Map(array.map((x) => [x[key], x]));\n  return Object.fromEntries(map2.entries());\n};\n\n// src/methods/distinct.ts\nvar distinct = (array) => filter(\n  array,\n  (el, index, array2) => isObject(el) ? index === array2.findIndex((obj) => equals(obj, el)) : index === array2.indexOf(el)\n);\n\n// src/methods/find.ts\nvar find = (array, callback) => {\n  const len = array.length;\n  for (let index = 0; index < len; index++) {\n    const includes = callback(array[index], index, array);\n    if (includes) {\n      return array[index];\n    }\n  }\n  return void 0;\n};\n\n// src/methods/group-by.ts\nvar groupWith = (array, func) => {\n  const map2 = /* @__PURE__ */ new Map();\n  array.forEach((x) => {\n    const k = func(x);\n    const item = map2.get(k) || [];\n    item.push(x);\n    map2.set(k, item);\n  });\n  return Object.fromEntries(map2.entries());\n};\nvar groupBy = (array, key) => groupWith(array, (item) => item[key]);\n\n// src/methods/map.ts\nvar map = (array, callback) => {\n  const mappedArray = [];\n  let index = 0;\n  const len = array.length;\n  for (index; index < len; index++) {\n    const transform = callback(array[index], index, array);\n    mappedArray.push(transform);\n  }\n  return mappedArray;\n};\n\n// src/methods/range.ts\nvar getInSequence = (a, b) => {\n  let x = Number.parseInt(a, 10);\n  let y = Number.parseInt(b, 10);\n  return x > y ? [y, x] : [x, y];\n};\nvar individualChars = (charA, charZ, jumps = 1) => {\n  const a = [];\n  let i = charA.charCodeAt(0);\n  const j = charZ.charCodeAt(0);\n  for (; i <= j; i += jumps) {\n    a.push(String.fromCharCode(i));\n  }\n  if (isNumber(charA) && isNumber(charZ)) {\n    return a.map((x) => Number.parseInt(x));\n  }\n  return a;\n};\nvar createChars = (charA, charZ, jumps = 1) => {\n  let abs = Math.abs(jumps);\n  if (charA.length > 1 || charZ.length > 1) {\n    if (isNumber(charA) && isNumber(charZ)) {\n      const a = [];\n      const [first2, second] = getInSequence(charA, charZ);\n      for (let i = first2; i <= second; i += abs) {\n        a.push(i);\n      }\n      return a;\n    }\n  }\n  return individualChars(charA, charZ, abs);\n};\nvar range = (firstOrLength, secondOrSteps, jumps = 1) => {\n  if (secondOrSteps === void 0) {\n    const [x, y, jp] = firstOrLength.split(\"..\");\n    if (jp === void 0) {\n      return createChars(x, y, 1);\n    }\n    return createChars(x, jp, Number.parseInt(y, 10));\n  }\n  if (isNumberOrString(firstOrLength) && isNumberOrString(secondOrSteps)) {\n    return createChars(`${firstOrLength}`, `${secondOrSteps}`, jumps);\n  }\n  return Array.from({ length: firstOrLength }, (_, i) => i * Math.abs(secondOrSteps));\n};\n\n// src/methods/reduce.ts\nvar reduce = (callback, initial, array) => {\n  let accumulator = initial;\n  const len = array.length;\n  for (let index = 0; index < len; index++) {\n    const element = array[index];\n    accumulator = callback(accumulator, element, index, array);\n  }\n  return accumulator;\n};\n\n// src/methods/reverse.ts\nvar reverse = (a) => {\n  const array = Array.from(a.values());\n  let left = null;\n  let right = null;\n  let length = array.length;\n  for (left = 0; left < length / 2; left += 1) {\n    right = length - 1 - left;\n    let temporary = array[left];\n    array[left] = array[right];\n    array[right] = temporary;\n  }\n  return array;\n};\n\n// src/methods/skip.ts\nvar skip = (array, jumps) => {\n  if (typeof jumps === \"number\") {\n    return array.slice(jumps);\n  }\n  let len = array.length;\n  for (let index = 0; index < len; index++) {\n    const element = array[index];\n    const assertion = jumps(element, index, array);\n    if (assertion) {\n      return array.slice(index);\n    }\n  }\n  return array.slice(0);\n};\nvar skipLikeWhere = (array, args, symbol, value) => whereSymbol(skip, array, args, symbol, value);\n\n// src/methods/sort.ts\nvar selectTuple = (key, a, b) => {\n  const valA = a[key];\n  const valB = b[key];\n  return [valA, valB];\n};\nvar isNil = (key) => key === void 0 || key === null;\nvar sortString = (key, reverse2 = false) => {\n  if (reverse2) {\n    return (a, b) => {\n      if (isNil(key)) {\n        return b.localeCompare(a);\n      }\n      const [valA, valB] = selectTuple(key, a, b);\n      return valA.localeCompare(valB);\n    };\n  }\n  return (a, b) => {\n    if (isNil(key)) {\n      return a.localeCompare(b);\n    }\n    const [valA, valB] = selectTuple(a, b, key);\n    return valA.localeCompare(valB) * -1;\n  };\n};\nvar sortNumber = (key, reverse2 = false) => {\n  if (reverse2) {\n    return (a, b) => {\n      if (isNil(key)) {\n        return b - a;\n      }\n      const [valA, valB] = selectTuple(key, a, b);\n      return valB - valA;\n    };\n  }\n  return (a, b) => {\n    if (isNil(key)) {\n      return a - b;\n    }\n    const [valA, valB] = selectTuple(a, b, key);\n    return valA - valB;\n  };\n};\nvar sortDate = (key, reverse2 = false) => {\n  if (reverse2) {\n    return (a, b) => {\n      if (isNil(key)) {\n        return Date.parse(b) - Date.parse(a);\n      }\n      const [valA, valB] = selectTuple(a, b, key);\n      return Date.parse(valB.toISOString()) - Date.parse(valA.toISOString());\n    };\n  }\n  return (a, b) => {\n    if (isNil(key)) {\n      return Date.parse(a) - Date.parse(b);\n    }\n    const [valA, valB] = selectTuple(a, b, key);\n    return Date.parse(valA.toISOString()) - Date.parse(valB.toISOString());\n  };\n};\nvar sort = (array, sorter) => {\n  const shallowCopy = [...array];\n  if (sorter === void 0)\n    return shallowCopy.sort();\n  if (typeof sorter === \"function\")\n    return shallowCopy.toSorted(sorter);\n  return shallowCopy.toSorted(sortBy(sorter));\n};\nvar Order = /* @__PURE__ */ ((Order2) => {\n  Order2[\"Asc\"] = \"asc\";\n  Order2[\"Desc\"] = \"desc\";\n  return Order2;\n})(Order || {});\nvar createSorter = (fields) => (a, b) => fields.reduce((acc, x) => {\n  const reverse2 = x.type === \"desc\" ? -1 : 1;\n  const property = x.key;\n  const p = a[property] > b[property] ? reverse2 : a[property] < b[property] ? -reverse2 : 0;\n  return acc !== 0 ? acc : p;\n}, 0);\nvar multiSort = (array, fields) => array.sort(createSorter(fields));\n\n// src/methods/unique.ts\nvar unique = (array, key) => {\n  if (key === void 0) {\n    return [...new Set(array).values()];\n  }\n  const seen = /* @__PURE__ */ new Set();\n  if (Array.isArray(key)) {\n    return [...new Set(key)];\n  }\n  return filter(array, (el) => {\n    const duplicate = key ? seen.has(el[key]) : seen.has(key);\n    if (!!key) {\n      if (!duplicate) {\n        seen.add(el[key]);\n      }\n    }\n    return !duplicate;\n  });\n};\n\n// src/linq.ts\nvar Linq = class _Linq {\n  constructor(array = []) {\n    this.array = array;\n  }\n  static Range(...args) {\n    return range(...args);\n  }\n  static New(array) {\n    return new _Linq(array);\n  }\n  Where(args, symbol, value) {\n    this.array = where(this.array, args, symbol, value);\n    return this;\n  }\n  Some(args, symbol, value) {\n    return anyLikeWhere(this.array, args, symbol, value);\n  }\n  All(args, symbol, value) {\n    return allLikeWhere(this.array, args, symbol, value);\n  }\n  Reverse() {\n    this.array = reverse(this.array);\n    return this;\n  }\n  Add(el) {\n    this.array = Array.isArray(el) ? this.array.concat(el) : this.array.concat([el]);\n    return this;\n  }\n  Prepend(el) {\n    this.array = Array.isArray(el) ? el.concat(this.array) : [el].concat(this.array);\n    return this;\n  }\n  Select(transform) {\n    return transform === void 0 ? this.array : this.array.map(transform);\n  }\n  Take(init, end) {\n    if (end !== void 0) {\n      this.array = this.array.slice(init, Math.max(0, end));\n    } else {\n      this.array = this.array.slice(init);\n    }\n    return this;\n  }\n  Head() {\n    return this.array[0];\n  }\n  Tail() {\n    return this.Skip(1);\n  }\n  Skip(args, symbol, value) {\n    this.array = skipLikeWhere(this.array, args, symbol, value);\n    return this;\n  }\n  Distinct() {\n    this.array = distinct(this.array);\n    return this;\n  }\n  First(predicate) {\n    return predicate === void 0 ? this.array[0] : find(this.array, predicate) || null;\n  }\n  Last(predicate) {\n    const len = this.array.length;\n    if (predicate === void 0) {\n      return this.array[len - 1];\n    }\n    for (let index = len; index !== 0; index--) {\n      const includes = predicate(this.array[index], index, this.array);\n      if (includes) {\n        return this.array[index];\n      }\n    }\n    return void 0;\n  }\n  Sum(key) {\n    return key === void 0 ? reduce((acc, el) => acc + el, 0, this.array) : reduce((acc, el) => acc + getKey(el, key), 0, this.array);\n  }\n  Average(key) {\n    return this.Sum(key) / this.array.length;\n  }\n  GroupBy(key) {\n    return groupBy(this.array, key);\n  }\n  GroupWith(func) {\n    return groupWith(this.array, func);\n  }\n  Except(exceptions) {\n    return filter(this.array, (x) => !contains(exceptions, x));\n  }\n  Intersect(commons) {\n    return filter(this.array, (x) => contains(commons, x));\n  }\n  OrderBy(key, order) {\n    let array;\n    array = !!key ? sort(this.array, key) : this.array.toSorted();\n    this.array = order === \"desc\" ? reverse(array) : array;\n    return this;\n  }\n  Includes(object) {\n    return any(this.array, (x) => equals(x, object));\n  }\n  In(array) {\n    const len = array.length;\n    for (let index = 0; index < len; index++) {\n      const element = array[index];\n      const includesElement = this.Includes(element);\n      if (includesElement)\n        return true;\n    }\n    return false;\n  }\n  Reduce(fn, firstValue) {\n    return reduce(fn, firstValue != null ? firstValue : this.array[0], this.array);\n  }\n  Empty() {\n    return this.array.length === 0;\n  }\n  ToMap(key) {\n    return new Map(map(this.array, (item) => [key, item]));\n  }\n  Zip(array, fn) {\n    return map(this.array, (item, index) => fn(item, array[index]));\n  }\n  Count(predicate) {\n    return predicate === void 0 ? this.array.length : filter(this.array, predicate).length;\n  }\n  Get(n) {\n    return this.array[n];\n  }\n  Clone() {\n    return new _Linq(deepClone(this.array));\n  }\n  ToObject(key) {\n    return dict(this.array, key);\n  }\n  Sort(sorter) {\n    return Array.isArray(sorter) ? multiSort(this.array, sorter) : sort(this.array, sorter);\n  }\n  Unique(k) {\n    return unique(this.array, k);\n  }\n};\n\n// src/methods/chunk.ts\nvar chunk = (array, size) => reduce(\n  (arr, item, index) => index % size === 0 ? [...arr, [item]] : [...arr.slice(0, -1), [...arr.slice(-1)[0], item]],\n  [],\n  array\n);\n\n// src/methods/compact.ts\nvar compact = (array) => {\n  const mappedArray = [];\n  const len = array.length;\n  for (let index = 0; index < len; index++) {\n    const element = array[index];\n    if (Boolean(element)) {\n      mappedArray.push(array[index]);\n    }\n  }\n  return mappedArray;\n};\n\n// src/methods/get.ts\nvar first = (array) => array[0];\nvar last = (array) => array[array.length - 1];\nvar tail = (array) => skip(array, 1);\n\n// src/methods/numbers.ts\nvar MathMinMax = (fn, key, array) => Array.isArray(key) ? reduce((acc, el) => fn(acc, el), 0, key) : reduce((acc, el) => fn(acc, el[key]), 0, array);\nvar max = (array, key) => MathMinMax(Math.max, key, array);\nvar min = (array, key) => MathMinMax(Math.min, key, array);\nvar sum = (array, key) => MathMinMax((a, b) => a + b, key, array);\nvar diff = (array, key) => MathMinMax((a, b) => a - b, key, array);\n\n// src/methods/random.ts\nvar random = (array) => {\n  const len = array.length;\n  const i = Math.floor(Math.random() * len);\n  return array[i];\n};\n\n// src/methods/repeat.ts\nvar repeat = (element, repeat2) => {\n  const array = [];\n  for (let index = 0; index < repeat2; index++) {\n    array.push(element);\n  }\n  return array;\n};\n\n// src/methods/to-map.ts\nvar toMap = (array, key) => {\n  const map2 = /* @__PURE__ */ new Map();\n  const len = array.length;\n  for (let index = 0; index < len; index++) {\n    const element = array[index];\n    const elementKey = element[key];\n    map2.set(elementKey, element);\n  }\n  return map2;\n};\n\n// src/index.ts\nvar src_default = Linq;\n\nexport { Linq, Order, all, any, chunk, compact, contains, deepClone, src_default as default, dict, diff, distinct, filter, find, first, groupBy, last, map, max, min, multiSort, random, range, reduce, repeat, reverse, skip, sort, sortDate, sortNumber, sortString, sum, tail, toMap, unique, where };\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9],"mappings":";;;;;;AAEA,SAAS,EAAU,GAAG,GAAM;CACxB,IAAM,IAAe,CAAC,MAAM,QAAQ,EAAK,EAAE,GACrC,IAAY,IAAe,IAAI,IAC/B,IAAa,EAAK,IAAI,IACtB,IAAa,EAAK,IAAI,IACtB,IAAc,EAAK,IAAI,IACvB,IAAU,EAAK,IAAI,IACnB,IAAe,EAAY,GAAY,GAAa,CAAO;CACjE,OAAO,IAAe,EAAa,CAAU,IAAI;AACrD;;;ACNA,SAAS,EAAuB,GAAQ,GAAe;CAInD,IAAM,IAAQ,EAAe,EAAc,CAAC,GAOtC,UAAoB,EAAM,IAAI,EAAc,CAAC;CAkBnD,OAbA,EAAY,GAKZ,QAAgC;EAC5B,IAAM,UAAuB,EAAM,UAAU,GAAa,IAAO,EAAI,GAC/D,IAAgB,EAAO,KAAK,MAAM,EAAE,GAAG,UAAU,CAAc,CAAC;EACtE,aAAa;GAET,AADA,EAAc,SAAS,MAAgB,EAAY,CAAC,GACpD,EAAY,CAAW;EAC3B;CACJ,CAAC,GACM;AACX;;;AC/BA,SAAS,EAAY,GAAS;CAM1B,AADA,EAAoB,UAAU,CAAC,GAC/B,EAAQ;CACR,IAAM,IAAQ,EAAuB,EAAoB,SAAS,CAAO;CAKzE,OADA,EAAoB,UAAU,KAAA,GACvB;AACX;;;ACXA,SAAS,EAAa,GAAO,GAAyB,GAAkB,GAAS;CAC7E,IAAI,OAAO,KAAU,YACjB,OAAO,EAAY,CAAK;CAS5B,IAHoB,MAAqB,KAAA,KACrC,CAAC,MAAM,QAAQ,CAAgB,KAC/B,OAAO,KAA4B,YAEnC,OAAO,GAAgB,GAAO,GAAyB,GAAkB,CAAO;CAGpF,IAAM,IAAc,OAAO,KAA4B,aACjD,IACA,EAAU,GAAyBA,GAAa,CAAO,GACvD,IAAS,MAAM,QAAQ,CAAK,IAC5B,EAAiB,GAAO,CAAW,IACnC,EAAiB,CAAC,CAAK,IAAI,CAAC,OAAY,EAAY,CAAM,CAAC,GAC3D,IAAmB,MAAM,QAAQ,CAAK,IAEtC,KAAA,IADA,EAAM;CAeZ,OAbI,KACA,CAAC,EAAgB,iBACjB,OAAO,KAA4B,cACnC,MAAM,QAAQ,CAAgB,KAC9B,GAAS,UAAU,OACnB,EAAO,aAAa;EAChB,GAAG;EACH,OAAO;EACP,WAAW;EACX,eAAe;EACf,GAAI,GAAS,OAAO,EAAE,MAAM,EAAQ,KAAK,IAAI,CAAC;CAClD,IAEG;AACX;AACA,SAAS,EAAiB,GAAQ,GAAa;CAC3C,IAAM,IAAS,QAAkB,CAAC,CAAC;CACnC,OAAO,EAAuB,SAAc;EACxC,EAAO,SAAS;EAChB,IAAM,IAAY,EAAO;EACzB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAW,KAC3B,EAAO,KAAK,EAAO,GAAG,IAAI;EAE9B,OAAO,EAAY,CAAM;CAC7B,CAAC;AACL;AACA,SAAS,GAAgB,GAAY,GAAY,GAAW,GAAS;CAIjE,IAAM,IAAO,QAAkB,OAAO,KAAK,CAAS,CAAC,GAC/C,IAAS,SAAmB,CAAC,EAAE;CACrC,KAAK,IAAM,KAAO,GACd,EAAO,KAAO,EAAa,GAAY,GAAY,EAAU,IAAM,CAAO;CAE9E,OAAO;AACX;;;AC/DA,IAAM,IAAiB,EAAc,IAAI;;;ACAzC,SAAS,GAAa,GAAO,GAAO,GAAQ,GAAU;CAClD,IAAI,CAAC,GACD,OAAO;CACX,IAAM,IAAQ,EAAM,WAAW,MAAS,EAAK,UAAU,CAAK;CAC5D,IAAI,MAAU,IACV,OAAO;CACX,IAAM,IAAa,IAAW,IAAI,IAAI,IAChC,IAAW,EAAM,IAAQ;CAC/B,IAAI,CAAC,GACD,OAAO;CACX,IAAM,IAAO,EAAM,IACb,IAAa,EAAS,QACtB,IAAiB,EAAU,EAAW,KAAK,EAAW,KAAK,EAAG;CAKpE,OAJK,MAAe,KAAK,EAAK,OAAO,MAAM,IAAS,KAC/C,MAAe,MAAM,EAAK,OAAO,MAAM,IAAS,IAC1C,EAAS,GAAO,GAAO,IAAQ,CAAU,IAE7C;AACX;;;ACZA,SAAS,GAAsB,EAAE,aAAU,QAAK,MAAM,UAAO,KAAK,cAAW,WAAQ,GAAG,KAAS,GAAa;CAC1G,IAAM,IAAY,QAAkB,EAAO,EAAG,GACxC,IAAQ,CAAC,GACT,IAAe,EAAO,EAAK,GAC3B,IAAW,EAAO,IAAI;CAC5B,EAAU,EAAQ,GAAS,gDAAgD,gBAAgB;CAC3F,IAAM,IAAU;EACZ;EACA;EACA,eAAe,GAAO,MAAW;GAE7B,IAAM,IAAM,EAAM,WAAW,MAAU,MAAU,EAAM,KAAK;GAO5D,AANI,MAAQ,KAIR,EAAM,KAAK;IAAS;IAAO,QAAQ,EAAO;GAAM,CAAC,IAHjD,EAAM,GAAK,SAAS,EAAO,IAK/B,EAAM,KAAK,EAAU;EACzB;EACA,cAAc,GAAM,GAAQ,MAAa;GACrC,IAAI,EAAa,SACb;GACJ,IAAM,IAAW,GAAa,GAAO,GAAM,GAAQ,CAAQ;GAC3D,IAAI,MAAU,GAAU;IACpB,EAAa,UAAU;IAIvB,IAAM,IAAY,CAAC,GAAG,CAAM;IAC5B,KAAK,IAAI,IAAI,GAAG,IAAI,EAAS,QAAQ,KACjC,IAAI,EAAM,GAAG,UAAU,EAAS,GAAG,OAAO;KACtC,IAAM,IAAI,EAAO,QAAQ,EAAM,GAAG,KAAK,GACjC,IAAI,EAAO,QAAQ,EAAS,GAAG,KAAK;KAC1C,AAAI,MAAM,MAAM,MAAM,OAClB,CAAC,EAAU,IAAI,EAAU,MAAM,CAAC,EAAU,IAAI,EAAU,EAAE;KAE9D;IACJ;IAEJ,EAAU,CAAS;GACvB;EACJ;CACJ;CACA,QAAgB;EACZ,EAAa,UAAU;CAC3B,CAAC;CAED,IAAM,KAAU,MAAY;EAExB,AADA,EAAS,UAAU,GACf,OAAO,KAAgB,aACvB,EAAY,CAAO,IAEd,MACL,EAAY,UAAU;CAE9B,GAMM,IAAa;EACf,gBAAgB;EAChB,GAAG,EAAM;CACb;CACA,OAAQ,EAAI,GAAW;EAAE,GAAG;EAAO,OAAO;EAAY,KAAK;EAAQ,cAAc;EAAM,UAAU,EAAI,EAAe,UAAU;GAAE,OAAO;GAAmB;EAAS,CAAC;CAAE,CAAC;AAC3K;AACA,IAAM,KAA6B,kBAAW,EAAqB;AACnE,SAAS,GAAW,GAAG,GAAG;CACtB,OAAO,EAAE,OAAO,MAAM,EAAE,OAAO;AACnC;;;AChFA,IAAM,IAAY,IACZ,KAAW,IACX,KAAiB,IAAI,IAAI,CAAC,QAAQ,QAAQ,CAAC,GAE3C,oBAAsB,IAAI,QAAQ,GAClC,oBAAmB,IAAI,QAAQ,GAEjC,IAAsB;AAC1B,SAAS,KAAuB;CAC5B,IAAI,GAAqB;EACrB,IAAM,IAAqB,EAAuB,GAAqB,GAAG;EAC1E,AAAI,MACA,EAAiB,OAAO,CAAkB,GAC1C,EAAoB,OAAO,CAAkB;EAGjD,IAAM,IAAsB,EAAuB,GAAqB,GAAG;EAK3E,AAJI,KAAuB,MAAwB,MAC/C,EAAiB,OAAO,CAAmB,GAC3C,EAAoB,OAAO,CAAmB,IAElD,IAAsB;CAC1B;AACJ;AACA,SAAS,GAAoB,GAAS,GAAM;CACxC,IAAM,IAAQ,iBAAiB,CAAO,GAChC,IAAW,MAAS,MAAM,EAAM,YAAY,EAAM,WAClD,IAAmB,MAAY,SAAS,QAC1C,MAAY,SAAS;CACzB,OAAO,GAAe,IAAI,CAAQ,KAAK;AAC3C;AACA,SAAS,EAAuB,GAAS,GAAM;CAC3C,IAAI,IAAU,GAAS;CACvB,OAAO,IAAS;EACZ,IAAI,GAAoB,GAAS,CAAI,GACjC,OAAO;EAEX,IAAU,EAAQ;CACtB;CACA,OAAO;AACX;AACA,SAAS,GAAgB,GAAiB,GAAe,GAAM;CAC3D,IAAM,IAAO,EAAc,sBAAsB,GAC3C,IAAQ,MAAS,MAAM,KAAK,IAAI,GAAG,EAAK,IAAI,IAAI,KAAK,IAAI,GAAG,EAAK,GAAG,GACpE,IAAM,MAAS,MAAM,KAAK,IAAI,OAAO,YAAY,EAAK,KAAK,IAAI,KAAK,IAAI,OAAO,aAAa,EAAK,MAAM,GACvG,IAAoB,IAAkB,GACtC,IAAkB,IAAM;CAC9B,IAAI,IAAoB,GAAW;EAC/B,IAAM,IAAY,IAAI,IAAoB;EAC1C,OAAO;GAAE,QAAQ,MAAY,IAAY;GAAW,MAAM;EAAQ;CACtE,OACK,IAAI,IAAkB,GAAW;EAClC,IAAM,IAAY,IAAI,IAAkB;EACxC,OAAO;GAAE,QAAQ,KAAW,IAAY;GAAW,MAAM;EAAM;CACnE;CACA,OAAO;EAAE,QAAQ;EAAG,MAAM;CAAK;AACnC;AACA,SAAS,GAAmB,GAAc,GAAiB,GAAM,GAAU;CACvE,IAAI,CAAC,GACD;CAEJ,IAAsB;CACtB,IAAM,IAAqB,EAAuB,GAAc,CAAI;CACpE,IAAI,CAAC,GACD;CAKJ,IAAM,EAAE,QAAQ,GAAc,YAAS,GADP,KAAmB,MAAS,MAAM,OAAO,UAAU,OAAO,UACV,GAAoB,CAAI;CAExG,IAAI,MAAS,MAAM;EAEf,AADA,EAAiB,OAAO,CAAkB,GAC1C,EAAoB,OAAO,CAAkB;EAC7C;CACJ;CACA,IAAM,IAAoB,EAAiB,IAAI,CAAkB,GAC3D,IAAmB,MAAuB,SAAS,QACrD,MAAuB,SAAS;CAEpC,IAAI,MAAsB,GAAM;EAI5B,IAAI,EAFiB,MAAS,WAAW,IAAW,KAC/C,MAAS,SAAS,IAAW,IAE9B;EAEJ,EAAiB,IAAI,GAAoB,CAAI;EAE7C,IAAM,IAAY,MAAS,MACrB,EAAmB,eAAe,IAAmB,OAAO,aAAa,EAAmB,eAC5F,EAAmB,gBAAgB,IAAmB,OAAO,cAAc,EAAmB;EACpG,EAAoB,IAAI,GAAoB,CAAS;CACzD;CAEA,IAAI,IAAe,GAAG;EAClB,IAAM,IAAe,EAAoB,IAAI,CAAkB;EAI/D,KAHsB,MAAS,MACxB,IAAmB,OAAO,UAAU,EAAmB,aACvD,IAAmB,OAAO,UAAU,EAAmB,cACzC,GACjB;CACR;CAEA,AAAI,MAAS,MACL,IACA,OAAO,SAAS,EAAE,MAAM,EAAa,CAAC,IAGtC,EAAmB,cAAc,IAIjC,IACA,OAAO,SAAS,EAAE,KAAK,EAAa,CAAC,IAGrC,EAAmB,aAAa;AAG5C;;;AC5GA,SAAS,EAAsB,GAAO,IAAe,GAAG;CACpD,OAAO,EAAc,CAAK,IAAI,IAAQ,EAAe,CAAY;AACrE;AACA,SAAS,GAAqB,EAAE,aAAU,WAAQ,CAAC,GAAG,UAAO,QAAK,MAAM,WAAQ,cAAW,YAAS,IAAM,GAAG,KAAS,GAAa;CAC/H,IAAM,IAAY,QAAkB,EAAO,EAAG,GACxC,IAAU,EAAW,CAAc,GACnC,IAAQ;EACV,GAAG,EAAsB,EAAM,CAAC;EAChC,GAAG,EAAsB,EAAM,CAAC;CACpC,GACM,IAAS,EAAa,CAAC,EAAM,GAAG,EAAM,CAAC,IAAI,CAAC,GAAS,OAAa,KAAW,IAAU,IAAI,OAAO;CACxG,EAAU,EAAQ,GAAU,iDAAiD,oBAAoB;CACjG,IAAM,EAAE,SAAM,iBAAc,gBAAa,gBAAa;CACtD,OAAQ,EAAI,GAAW;EAAE,MAAM;EAAM,GAAG;EAAO,kBAAkB;EAAM,OAAO;GAAE,GAAG;GAAO,GAAG,EAAM;GAAG,GAAG,EAAM;GAAG;EAAO;EAAW;EAAQ,SAAS,GAAO,MAAiB;GACrK,IAAM,EAAE,aAAU,OAAO,MAAiB;GAK1C,AAFA,EAAY,GAFG,EAAM,GAAM,IAEH,GAAG,EAAS,EAAK,GACzC,GAAmB,EAAS,SAAS,EAAa,IAAO,GAAM,EAAS,EAAK,GAC7E,KAAU,EAAO,GAAO,CAAY;EACxC;EAAG,YAAY,GAAO,MAAiB;GAEnC,AADA,GAAqB,GACrB,KAAa,EAAU,GAAO,CAAY;EAC9C;EAAG,kBAAkB,MAAa;GAC9B,EAAa,GAAO,CAAQ;EAChC;EAAG,KAAK;EAAa,cAAc;EAAgB;CAAS,CAAC;AACrE;AACA,IAAM,KAA4B,kBAAW,EAAoB,GCvC7D,KAAY,OAAO,gBACnB,IAAsB,OAAO,uBAC7B,KAAe,OAAO,UAAU,gBAChC,KAAe,OAAO,UAAU,sBAChC,KAAmB,GAAK,GAAK,MAAU,KAAO,IAAM,GAAU,GAAK,GAAK;CAAE,YAAY;CAAM,cAAc;CAAM,UAAU;CAAM;AAAM,CAAC,IAAI,EAAI,KAAO,GACtJ,MAAkB,GAAG,MAAM;CAC7B,KAAK,IAAI,KAAQ,AAAM,MAAI,CAAC,GAC1B,AAAI,GAAa,KAAK,GAAG,CAAI,KAC3B,EAAgB,GAAG,GAAM,EAAE,EAAK;CACpC,IAAI,QACG,IAAI,KAAQ,EAAoB,CAAC,GACpC,AAAI,GAAa,KAAK,GAAG,CAAI,KAC3B,EAAgB,GAAG,GAAM,EAAE,EAAK;CAEtC,OAAO;AACT,GAGI,KAAO,GAAO,MAAa;CAC7B,IAAM,IAAM,EAAM;CAClB,KAAK,IAAI,IAAQ,GAAG,IAAQ,GAAK,KAE/B,IADiB,EAAS,EAAM,IAAQ,GAAO,CACpC,GACT,OAAO;CAGX,OAAO;AACT,GACI,MAAgB,GAAO,GAAM,GAAQ,MAAU,EAAY,GAAK,GAAO,GAAM,GAAQ,CAAK,GAG1F,KAAY,MAAM,OAAO,KAAM,UAC/B,KAAU,GAAG,MAAM;CACrB,IAAI,MAAM,GACR,OAAO;CAET,IAAI,aAAa,QAAQ,aAAa,MACpC,OAAO,EAAE,QAAQ,MAAM,EAAE,QAAQ;CAEnC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,EAAS,CAAC,KAAK,CAAC,EAAS,CAAC,GACzC,OAAO,MAAM;CAEf,IAAI,EAAE,cAAc,EAAE,WACpB,OAAO;CAET,IAAM,IAAO,OAAO,KAAK,CAAC;CAI1B,OAHI,EAAK,WAAW,OAAO,KAAK,CAAC,EAAE,SAG5B,EAAK,OAAO,MAAM,EAAO,EAAE,IAAI,EAAE,EAAE,CAAC,IAFlC;AAGX,GACI,KAAU,GAAK,OACZ,EAAS,CAAG,KAAK,MAAM,QAAQ,CAAG,MAAQ,IACtC,EAAI,KAEN,GAEL,KAAU,OAAS,GAAG,MACpB,EAAE,OAAS,EAAE,KACR,IAEF,EAAE,KAAO,EAAE,KAAO,IAAI,IAE3B,KAAY,MAAM,UAAU,KAAK,CAAC,GAClC,KAAoB,MAAM,CAAC,UAAU,QAAQ,EAAE,SAAS,OAAO,CAAC,GAGhE,KAAW,MAAM,KAAsB,QAAS,GAAuB,WAAY,KAAK,MAAM,IAC9F,IAAY;CACd,IAAI;CACJ,IAAI,OAAO;CACX,OAAO,GAAG,MAAM,KAAK;CACrB,QAAQ,GAAG,MAAM,MAAM;CACvB,MAAM,GAAG,MAAM,IAAI;CACnB,OAAO,GAAG,MAAM,KAAK;CACrB,OAAO,GAAG,MAAM,KAAK;CACrB,QAAQ,GAAG,MAAM,MAAM;CACvB,MAAM,GAAG,MAAM,IAAI;CACnB,OAAO,GAAG,MAAM,KAAK;CACrB,WAAW,GAAG,MAAM,GAAG,IAAI,SAAS,CAAC;CACrC,cAAc,GAAG,MAAM,CAAC,GAAG,IAAI,SAAS,CAAC;CACzC,aAAa,GAAG,MAAM,GAAG,IAAI,WAAW,CAAC;CACzC,WAAW,GAAG,MAAM,GAAG,IAAI,SAAS,CAAC;CACrC,OAAO,GAAG,MAAU,OAAO,KAAK,EAAE,KAAK,IAAI,EAAE,KAAK,GAAG,GAAG;CACxD,eAAe,GAAG,MAAM,EAAE,SAAS,EAAE,cAAc,EAAE,SAAS,CAAC;CAC/D,OAAO;CACP,WAAW,MAAM,CAAC,EAAQ,CAAC;CAC3B,KAAK,GAAG,MAAM,EAAI,IAAI,MAAM,EAAO,GAAG,CAAC,CAAC;CACxC,QAAQ,GAAG,MAAM,EAAI,IAAI,MAAM,CAAC,EAAO,GAAG,CAAC,CAAC;AAC9C,GACI,MAA0B,MAAW;CACvC,IAAI,KAAU,GACZ,OAAO,EAAU;CACnB,MAAU,MAAM,yBAAyB;AAC3C,GAGI,KAAU,GAAO,MAAa;CAChC,IAAM,IAAc,CAAC,GACf,IAAM,EAAM;CAClB,KAAK,IAAI,IAAQ,GAAG,IAAQ,GAAK,KAE/B,AADiB,EAAS,EAAM,IAAQ,GAAO,CACpC,KACT,EAAY,KAAK,EAAM,EAAM;CAGjC,OAAO;AACT,GAGI,KAAe,GAAM,GAAO,GAAM,GAAQ,MAAU;CACtD,IAAI,OAAO,KAAS,YAClB,OAAO,EAAK,GAAO,CAAI;CACzB,IAAM,IAAK,GAAuB,CAAM;CAGxC,OAFM,KAAU,KAAU,MAAU,KAAK,IAChC,EAAK,IAAQ,MAAM,EAAG,EAAE,IAAO,CAAK,CAAC,IACvC,EAAK,IAAQ,MAAM,EAAG,GAAG,CAAK,CAAC;AACxC,GACI,MAAS,GAAO,GAAM,GAAQ,MAAU,EAAY,GAAQ,GAAO,GAAM,GAAQ,CAAK,GAGtF,KAAO,GAAO,MAAa;CAC7B,KAAK,IAAI,IAAQ,GAAG,IAAQ,EAAM,QAAQ,KAExC,IAAI,CADa,EAAS,EAAM,IAAQ,GAAO,CACnC,GACV,OAAO;CAGX,OAAO;AACT,GACI,MAAgB,GAAO,GAAM,GAAQ,MAAU,EAAY,GAAK,GAAO,GAAM,GAAQ,CAAK,GAG1F,KAAa,MAAQ;CACvB,IAAI,MAAQ,MACV,OAAO;CAET,IAAM,IAAQ,GAAe,CAAC,GAAG,CAAG;CAEpC,OADA,OAAO,KAAK,CAAK,EAAE,SAAS,MAAQ,EAAM,KAAO,EAAS,EAAI,EAAI,IAAI,EAAU,EAAI,EAAI,IAAI,EAAI,EAAI,GAC7F,MAAM,QAAQ,CAAG,KAAK,EAAI,UAAU,EAAM,SAAS,EAAI,WAAW,MAAM,KAAK,CAAK,IAAI,MAAM,QAAQ,CAAG,IAAI,MAAM,KAAK,CAAG,IAAI;AACtI,GAGI,KAAY,GAAO,MAAY;CACjC,IAAI,EAAS,CAAO,GAAG;EACrB,KAAK,IAAI,IAAQ,GAAG,IAAQ,EAAM,QAAQ,KAAS;GACjD,IAAM,IAAU,EAAM;GACtB,IAAI,EAAO,GAAS,CAAO,GACzB,OAAO;EAEX;EACA,OAAO;CACT;CACA,KAAK,IAAI,IAAQ,GAAG,IAAQ,EAAM,QAAQ,KAAS;EACjD,IAAM,IAAU,EAAM;EACtB,IAAI,EAAO,GAAS,CAAO,GACzB,OAAO;CAEX;CACA,OAAO;AACT,GAGI,KAAQ,GAAO,MAAQ;CACzB,IAAM,IAAO,IAAI,IAAI,EAAM,KAAK,MAAM,CAAC,EAAE,IAAM,CAAC,CAAC,CAAC;CAClD,OAAO,OAAO,YAAY,EAAK,QAAQ,CAAC;AAC1C,GAGI,MAAY,MAAU,EACxB,IACC,GAAI,GAAO,MAAW,EAAS,CAAE,IAAI,MAAU,EAAO,WAAW,MAAQ,EAAO,GAAK,CAAE,CAAC,IAAI,MAAU,EAAO,QAAQ,CAAE,CAC1H,GAGI,MAAQ,GAAO,MAAa;CAC9B,IAAM,IAAM,EAAM;CAClB,KAAK,IAAI,IAAQ,GAAG,IAAQ,GAAK,KAE/B,IADiB,EAAS,EAAM,IAAQ,GAAO,CACpC,GACT,OAAO,EAAM;AAInB,GAGI,KAAa,GAAO,MAAS;CAC/B,IAAM,oBAAuB,IAAI,IAAI;CAOrC,OANA,EAAM,SAAS,MAAM;EACnB,IAAM,IAAI,EAAK,CAAC,GACV,IAAO,EAAK,IAAI,CAAC,KAAK,CAAC;EAE7B,AADA,EAAK,KAAK,CAAC,GACX,EAAK,IAAI,GAAG,CAAI;CAClB,CAAC,GACM,OAAO,YAAY,EAAK,QAAQ,CAAC;AAC1C,GACI,MAAW,GAAO,MAAQ,EAAU,IAAQ,MAAS,EAAK,EAAI,GAG9D,KAAO,GAAO,MAAa;CAC7B,IAAM,IAAc,CAAC,GACjB,IAAQ,GACN,IAAM,EAAM;CAClB,OAAY,IAAQ,GAAK,KAAS;EAChC,IAAM,IAAY,EAAS,EAAM,IAAQ,GAAO,CAAK;EACrD,EAAY,KAAK,CAAS;CAC5B;CACA,OAAO;AACT,GAGI,MAAiB,GAAG,MAAM;CAC5B,IAAI,IAAI,OAAO,SAAS,GAAG,EAAE,GACzB,IAAI,OAAO,SAAS,GAAG,EAAE;CAC7B,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC;AAC/B,GACI,MAAmB,GAAO,GAAO,IAAQ,MAAM;CACjD,IAAM,IAAI,CAAC,GACP,IAAI,EAAM,WAAW,CAAC,GACpB,IAAI,EAAM,WAAW,CAAC;CAC5B,OAAO,KAAK,GAAG,KAAK,GAClB,EAAE,KAAK,OAAO,aAAa,CAAC,CAAC;CAK/B,OAHI,EAAS,CAAK,KAAK,EAAS,CAAK,IAC5B,EAAE,KAAK,MAAM,OAAO,SAAS,CAAC,CAAC,IAEjC;AACT,GACI,KAAe,GAAO,GAAO,IAAQ,MAAM;CAC7C,IAAI,IAAM,KAAK,IAAI,CAAK;CACxB,KAAI,EAAM,SAAS,KAAK,EAAM,SAAS,MACjC,EAAS,CAAK,KAAK,EAAS,CAAK,GAAG;EACtC,IAAM,IAAI,CAAC,GACL,CAAC,GAAQ,KAAU,GAAc,GAAO,CAAK;EACnD,KAAK,IAAI,IAAI,GAAQ,KAAK,GAAQ,KAAK,GACrC,EAAE,KAAK,CAAC;EAEV,OAAO;CACT;CAEF,OAAO,GAAgB,GAAO,GAAO,CAAG;AAC1C,GACI,MAAS,GAAe,GAAe,IAAQ,MAAM;CACvD,IAAI,MAAkB,KAAK,GAAG;EAC5B,IAAM,CAAC,GAAG,GAAG,KAAM,EAAc,MAAM,IAAI;EAI3C,OAHI,MAAO,KAAK,IACP,EAAY,GAAG,GAAG,CAAC,IAErB,EAAY,GAAG,GAAI,OAAO,SAAS,GAAG,EAAE,CAAC;CAClD;CAIA,OAHI,EAAiB,CAAa,KAAK,EAAiB,CAAa,IAC5D,EAAY,GAAG,KAAiB,GAAG,KAAiB,CAAK,IAE3D,MAAM,KAAK,EAAE,QAAQ,EAAc,IAAI,GAAG,MAAM,IAAI,KAAK,IAAI,CAAa,CAAC;AACpF,GAGI,KAAU,GAAU,GAAS,MAAU;CACzC,IAAI,IAAc,GACZ,IAAM,EAAM;CAClB,KAAK,IAAI,IAAQ,GAAG,IAAQ,GAAK,KAAS;EACxC,IAAM,IAAU,EAAM;EACtB,IAAc,EAAS,GAAa,GAAS,GAAO,CAAK;CAC3D;CACA,OAAO;AACT,GAGI,KAAW,MAAM;CACnB,IAAM,IAAQ,MAAM,KAAK,EAAE,OAAO,CAAC,GAC/B,IAAO,MACP,IAAQ,MACR,IAAS,EAAM;CACnB,KAAK,IAAO,GAAG,IAAO,IAAS,GAAG,KAAQ,GAAG;EAC3C,IAAQ,IAAS,IAAI;EACrB,IAAI,IAAY,EAAM;EAEtB,AADA,EAAM,KAAQ,EAAM,IACpB,EAAM,KAAS;CACjB;CACA,OAAO;AACT,GAGI,MAAQ,GAAO,MAAU;CAC3B,IAAI,OAAO,KAAU,UACnB,OAAO,EAAM,MAAM,CAAK;CAE1B,IAAI,IAAM,EAAM;CAChB,KAAK,IAAI,IAAQ,GAAG,IAAQ,GAAK,KAAS;EACxC,IAAM,IAAU,EAAM;EAEtB,IADkB,EAAM,GAAS,GAAO,CAC5B,GACV,OAAO,EAAM,MAAM,CAAK;CAE5B;CACA,OAAO,EAAM,MAAM,CAAC;AACtB,GACI,MAAiB,GAAO,GAAM,GAAQ,MAAU,EAAY,IAAM,GAAO,GAAM,GAAQ,CAAK,GA+D5F,KAAQ,GAAO,MAAW;CAC5B,IAAM,IAAc,CAAC,GAAG,CAAK;CAK7B,OAJI,MAAW,KAAK,IACX,EAAY,KAAK,IACtB,OAAO,KAAW,aACb,EAAY,SAAS,CAAM,IAC7B,EAAY,SAAS,EAAO,CAAM,CAAC;AAC5C,GACI,IAAwB,kBAAE,OAC5B,EAAO,MAAS,OAChB,EAAO,OAAU,QACV,IACN,KAAS,CAAC,CAAC,GACV,MAAgB,OAAY,GAAG,MAAM,EAAO,QAAQ,GAAK,MAAM;CACjE,IAAM,IAAW,EAAE,SAAS,SAAS,KAAK,GACpC,IAAW,EAAE,KACb,IAAI,EAAE,KAAY,EAAE,KAAY,IAAW,EAAE,KAAY,EAAE,KAAY,CAAC,IAAW;CACzF,OAAO,MAAQ,IAAU,IAAN;AACrB,GAAG,CAAC,GACA,MAAa,GAAO,MAAW,EAAM,KAAK,GAAa,CAAM,CAAC,GAG9D,MAAU,GAAO,MAAQ;CAC3B,IAAI,MAAQ,KAAK,GACf,OAAO,CAAC,GAAG,IAAI,IAAI,CAAK,EAAE,OAAO,CAAC;CAEpC,IAAM,oBAAuB,IAAI,IAAI;CAIrC,OAHI,MAAM,QAAQ,CAAG,IACZ,CAAC,GAAG,IAAI,IAAI,CAAG,CAAC,IAElB,EAAO,IAAQ,MAAO;EAC3B,IAAM,IAAY,IAAM,EAAK,IAAI,EAAG,EAAI,IAAI,EAAK,IAAI,CAAG;EAMxD,OALM,MACC,KACH,EAAK,IAAI,EAAG,EAAI,IAGb,CAAC;CACV,CAAC;AACH,GA8MI,KAAc,MA3MD,EAAM;CACrB,YAAY,IAAQ,CAAC,GAAG;EACtB,KAAK,QAAQ;CACf;CACA,OAAO,MAAM,GAAG,GAAM;EACpB,OAAO,GAAM,GAAG,CAAI;CACtB;CACA,OAAO,IAAI,GAAO;EAChB,OAAO,IAAI,EAAM,CAAK;CACxB;CACA,MAAM,GAAM,GAAQ,GAAO;EAEzB,OADA,KAAK,QAAQ,GAAM,KAAK,OAAO,GAAM,GAAQ,CAAK,GAC3C;CACT;CACA,KAAK,GAAM,GAAQ,GAAO;EACxB,OAAO,GAAa,KAAK,OAAO,GAAM,GAAQ,CAAK;CACrD;CACA,IAAI,GAAM,GAAQ,GAAO;EACvB,OAAO,GAAa,KAAK,OAAO,GAAM,GAAQ,CAAK;CACrD;CACA,UAAU;EAER,OADA,KAAK,QAAQ,EAAQ,KAAK,KAAK,GACxB;CACT;CACA,IAAI,GAAI;EAEN,OADA,KAAK,QAAQ,MAAM,QAAQ,CAAE,IAAI,KAAK,MAAM,OAAO,CAAE,IAAI,KAAK,MAAM,OAAO,CAAC,CAAE,CAAC,GACxE;CACT;CACA,QAAQ,GAAI;EAEV,OADA,KAAK,QAAQ,MAAM,QAAQ,CAAE,IAAI,EAAG,OAAO,KAAK,KAAK,IAAI,CAAC,CAAE,EAAE,OAAO,KAAK,KAAK,GACxE;CACT;CACA,OAAO,GAAW;EAChB,OAAO,MAAc,KAAK,IAAI,KAAK,QAAQ,KAAK,MAAM,IAAI,CAAS;CACrE;CACA,KAAK,GAAM,GAAK;EAMd,OALI,MAAQ,KAAK,IAGf,KAAK,QAAQ,KAAK,MAAM,MAAM,CAAI,IAFlC,KAAK,QAAQ,KAAK,MAAM,MAAM,GAAM,KAAK,IAAI,GAAG,CAAG,CAAC,GAI/C;CACT;CACA,OAAO;EACL,OAAO,KAAK,MAAM;CACpB;CACA,OAAO;EACL,OAAO,KAAK,KAAK,CAAC;CACpB;CACA,KAAK,GAAM,GAAQ,GAAO;EAExB,OADA,KAAK,QAAQ,GAAc,KAAK,OAAO,GAAM,GAAQ,CAAK,GACnD;CACT;CACA,WAAW;EAET,OADA,KAAK,QAAQ,GAAS,KAAK,KAAK,GACzB;CACT;CACA,MAAM,GAAW;EACf,OAAO,MAAc,KAAK,IAAI,KAAK,MAAM,KAAK,GAAK,KAAK,OAAO,CAAS,KAAK;CAC/E;CACA,KAAK,GAAW;EACd,IAAM,IAAM,KAAK,MAAM;EACvB,IAAI,MAAc,KAAK,GACrB,OAAO,KAAK,MAAM,IAAM;EAE1B,KAAK,IAAI,IAAQ,GAAK,MAAU,GAAG,KAEjC,IADiB,EAAU,KAAK,MAAM,IAAQ,GAAO,KAAK,KAC/C,GACT,OAAO,KAAK,MAAM;CAIxB;CACA,IAAI,GAAK;EACP,OAAwB,EAAjB,MAAQ,KAAK,KAAY,GAAK,MAAO,IAAM,KAA6B,GAAK,MAAO,IAAM,EAAO,GAAI,CAAG,GAAzD,GAAG,KAAK,KAAiE;CACjI;CACA,QAAQ,GAAK;EACX,OAAO,KAAK,IAAI,CAAG,IAAI,KAAK,MAAM;CACpC;CACA,QAAQ,GAAK;EACX,OAAO,GAAQ,KAAK,OAAO,CAAG;CAChC;CACA,UAAU,GAAM;EACd,OAAO,EAAU,KAAK,OAAO,CAAI;CACnC;CACA,OAAO,GAAY;EACjB,OAAO,EAAO,KAAK,QAAQ,MAAM,CAAC,EAAS,GAAY,CAAC,CAAC;CAC3D;CACA,UAAU,GAAS;EACjB,OAAO,EAAO,KAAK,QAAQ,MAAM,EAAS,GAAS,CAAC,CAAC;CACvD;CACA,QAAQ,GAAK,GAAO;EAClB,IAAI;EAGJ,OAFA,IAAU,IAAM,EAAK,KAAK,OAAO,CAAG,IAAI,KAAK,MAAM,SAAS,GAC5D,KAAK,QAAQ,MAAU,SAAS,EAAQ,CAAK,IAAI,GAC1C;CACT;CACA,SAAS,GAAQ;EACf,OAAO,EAAI,KAAK,QAAQ,MAAM,EAAO,GAAG,CAAM,CAAC;CACjD;CACA,GAAG,GAAO;EACR,IAAM,IAAM,EAAM;EAClB,KAAK,IAAI,IAAQ,GAAG,IAAQ,GAAK,KAAS;GACxC,IAAM,IAAU,EAAM;GAEtB,IADwB,KAAK,SAAS,CACpB,GAChB,OAAO;EACX;EACA,OAAO;CACT;CACA,OAAO,GAAI,GAAY;EACrB,OAAO,EAAO,GAAI,KAAkC,KAAK,MAAM,IAAI,KAAK,KAAK;CAC/E;CACA,QAAQ;EACN,OAAO,KAAK,MAAM,WAAW;CAC/B;CACA,MAAM,GAAK;EACT,OAAO,IAAI,IAAI,EAAI,KAAK,QAAQ,MAAS,CAAC,GAAK,CAAI,CAAC,CAAC;CACvD;CACA,IAAI,GAAO,GAAI;EACb,OAAO,EAAI,KAAK,QAAQ,GAAM,MAAU,EAAG,GAAM,EAAM,EAAM,CAAC;CAChE;CACA,MAAM,GAAW;EACf,OAAO,MAAc,KAAK,IAAI,KAAK,MAAM,SAAS,EAAO,KAAK,OAAO,CAAS,EAAE;CAClF;CACA,IAAI,GAAG;EACL,OAAO,KAAK,MAAM;CACpB;CACA,QAAQ;EACN,OAAO,IAAI,EAAM,EAAU,KAAK,KAAK,CAAC;CACxC;CACA,SAAS,GAAK;EACZ,OAAO,EAAK,KAAK,OAAO,CAAG;CAC7B;CACA,KAAK,GAAQ;EACX,OAAO,MAAM,QAAQ,CAAM,IAAI,GAAU,KAAK,OAAO,CAAM,IAAI,EAAK,KAAK,OAAO,CAAM;CACxF;CACA,OAAO,GAAG;EACR,OAAO,GAAO,KAAK,OAAO,CAAC;CAC7B;AACF"}