@himanshu-sorathiya/react-kit 1.0.17 → 1.0.18

package/dist/state2.js

@@ -0,0 +1,645 @@
+import { t as e } from "./utils.js";
+import { useCallback as t, useMemo as n, useRef as r, useState as i } from "react";
+//#region src/state/useFilter/utils.ts
+var a = {
+	text: {
+		contains: (e, t, n) => e == null ? !1 : n?.caseSensitive ? String(e).includes(String(t)) : String(e).toLowerCase().includes(String(t).toLowerCase()),
+		equals: (e, t, n) => e == null ? !1 : n?.caseSensitive ? String(e) === String(t) : String(e).toLowerCase() === String(t).toLowerCase(),
+		startsWith: (e, t, n) => e == null ? !1 : n?.caseSensitive ? String(e).startsWith(String(t)) : String(e).toLowerCase().startsWith(String(t).toLowerCase()),
+		endsWith: (e, t, n) => e == null ? !1 : n?.caseSensitive ? String(e).endsWith(String(t)) : String(e).toLowerCase().endsWith(String(t).toLowerCase()),
+		notContains: (e, t, n) => e == null ? !0 : n?.caseSensitive ? !String(e).includes(String(t)) : !String(e).toLowerCase().includes(String(t).toLowerCase())
+	},
+	number: {
+		equals: (e, t) => Number(e) === Number(t),
+		greaterThan: (e, t) => Number(e) > Number(t),
+		lessThan: (e, t) => Number(e) < Number(t),
+		greaterThanOrEqual: (e, t) => Number(e) >= Number(t),
+		lessThanOrEqual: (e, t) => Number(e) <= Number(t),
+		between: (e, t) => {
+			if (typeof t != "object" || !t) return !1;
+			let { min: n, max: r } = t;
+			return n == null || r == null ? !1 : Number(e) >= Number(n) && Number(e) <= Number(r);
+		}
+	},
+	boolean: { equals: (e, t) => !!e == !!t },
+	date: {
+		equals: (e, t) => {
+			if (!e || !t) return !1;
+			let n = new Date(e), r = new Date(t);
+			return Number.isNaN(n.getTime()) || Number.isNaN(r.getTime()) ? !1 : n.getFullYear() === r.getFullYear() && n.getMonth() === r.getMonth() && n.getDate() === r.getDate();
+		},
+		before: (e, t) => {
+			if (!e || !t) return !1;
+			let n = new Date(e).setHours(0, 0, 0, 0), r = new Date(t).setHours(0, 0, 0, 0);
+			return Number.isNaN(n) || Number.isNaN(r) ? !1 : n < r;
+		},
+		after: (e, t) => {
+			if (!e || !t) return !1;
+			let n = new Date(e).setHours(0, 0, 0, 0), r = new Date(t).setHours(0, 0, 0, 0);
+			return Number.isNaN(n) || Number.isNaN(r) ? !1 : n > r;
+		},
+		between: (e, t) => {
+			if (!e || typeof t != "object" || !t) return !1;
+			let { min: n, max: r } = t;
+			if (n == null || r == null) return !1;
+			let i = new Date(e).setHours(0, 0, 0, 0), a = new Date(n).setHours(0, 0, 0, 0), o = new Date(r).setHours(0, 0, 0, 0);
+			return Number.isNaN(i) || Number.isNaN(a) || Number.isNaN(o) ? !1 : i >= a && i <= o;
+		}
+	},
+	select: {
+		equals: (e, t) => e === t,
+		notEquals: (e, t) => e !== t
+	},
+	multiselect: {
+		in: (e, t) => t.includes(e),
+		notIn: (e, t) => !t.includes(e),
+		intersects: (e, t) => e.some((e) => t.includes(e))
+	}
+};
+//#endregion
+//#region src/state/useFilter/useFilter.ts
+function o(o, s = []) {
+	let c = r(s), [l, u] = i(() => s), d = n(() => {
+		let t = l.filter((e) => e.isActive !== !1).map((e) => ({
+			...e,
+			pathArray: (e.field || e.id).split(".")
+		}));
+		return o.filter((n) => t.every((t) => {
+			let { id: r, type: i, operator: o, value: s, compare: c, pathArray: l } = t, u = e(n, l, r);
+			if (i === "custom") return !c || c(u, s, n);
+			let d = a[i];
+			if (!d) return !0;
+			let f = d[o];
+			return !f || f(u, s, t);
+		}));
+	}, [o, l]), f = t((e) => {
+		u((t) => t.some((t) => t.id === e.id) ? t.map((t) => t.id === e.id ? e : t) : [...t, e]);
+	}, []), p = t((e) => {
+		u((t) => Array.isArray(e) ? t.filter((t) => !e.includes(t.id)) : t.filter((t) => t.id !== e));
+	}, []), m = t(() => {
+		u([]);
+	}, []), h = t(() => {
+		u(c.current);
+	}, []), g = t((e) => {
+		u(e);
+	}, []);
+	return {
+		filteredItems: d,
+		filters: l,
+		upsertFilter: f,
+		removeFilter: p,
+		clearFilters: m,
+		resetFilters: h,
+		toggleFilter: t((e) => {
+			u((t) => t.some((t) => t.id === e.id) ? t.map((t) => t.id === e.id ? {
+				...t,
+				isActive: t.isActive === !1
+			} : t) : [...t, {
+				...e,
+				isActive: !0
+			}]);
+		}, []),
+		updateFilterConfig: t((e, t) => {
+			u((n) => n.map((n) => n.id === e ? {
+				...n,
+				...t
+			} : n));
+		}, []),
+		replaceFilters: g,
+		getFilterValue: t((e) => l.find((t) => t.id === e)?.value, [l]),
+		updateFilterValue: t((e, t) => {
+			u((n) => n.map((n) => n.id === e ? {
+				...n,
+				value: t
+			} : n));
+		}, []),
+		isFilterActive: t((e) => {
+			let t = l.find((t) => t.id === e);
+			return t ? t.isActive !== !1 : !1;
+		}, [l])
+	};
+}
+//#endregion
+//#region src/state/useFuzzySearch/utils.ts
+function s(e, t, n = !1) {
+	let r = e.trim(), i = t.trim(), a = r.length > 1 && r === r.toUpperCase() && /^[A-Z]+$/.test(r);
+	if (n || (r = r.toLowerCase(), i = i.toLowerCase()), r === i) return 1;
+	if (r === "" || i === "") return 0;
+	if (a) {
+		let e = i.split(/[^a-z0-9]+/i).filter((e) => e.length > 0);
+		if (e.length >= r.length) {
+			let t = 0, n = 0;
+			for (let i = 0; i < r.length; i++) {
+				let a = r[i];
+				for (; n < e.length;) {
+					if ((e[n] ?? "")[0] === a) {
+						t++, n++;
+						break;
+					}
+					n++;
+				}
+			}
+			if (t === r.length) return .85;
+		}
+	}
+	let o = !1;
+	for (let e = 0; e < r.length; e++) if (i.includes(r[e] ?? "")) {
+		o = !0;
+		break;
+	}
+	if (!o) return 0;
+	let s = i.indexOf(r);
+	if (s !== -1) {
+		let e = s === 0, t = s / i.length * (e ? .01 : .1), n = (i.length - r.length) / i.length * (e ? .01 : .05);
+		return Math.max(.7, .95 - t - n);
+	}
+	let c = 0, l = -1, u = 0, d = 0, f = 0;
+	for (let e = 0; e < r.length; e++) {
+		let t = r[e];
+		if (!t) continue;
+		let n = i.indexOf(t, f);
+		if (n !== -1) c++, l !== -1 && (n > l ? u += n - l : (d++, u += 1)), l = n, f = n + 1, f >= i.length && (f = 0);
+		else {
+			let e = i.indexOf(t);
+			e !== -1 && (c++, d++, l = e, f = e + 1);
+		}
+	}
+	if (c < r.length / 2) return 0;
+	let p = c / r.length, m = .6 ** d, h = c > 1 ? u / (c - 1) : 1, g = Math.max(.4, 1 - h / i.length), _ = p * m * g;
+	return Math.max(0, _ * .45);
+}
+//#endregion
+//#region src/state/useFuzzySearch/useFuzzySearch.ts
+function c(t, r, i, a = {}) {
+	let o = a.threshold ?? .01, c = a.caseSensitive ?? !1, l = a.matchStrategy ?? "any", u = a.exactPhraseBonus ?? !0, d = n(() => i.length === 0 || t.length === 0 ? [] : t.map((t, n) => {
+		let r = [], a = [];
+		for (let { field: n, weight: o } of i) {
+			let i = e(t, n);
+			if (Array.isArray(i)) {
+				for (let e of i) if (e != null && e !== "" && typeof e != "object") {
+					let t = String(e);
+					a.push(t);
+					let n = t.split(/[^a-z0-9]+/i).filter((e) => e.length > 0);
+					for (let e of n) r.push({
+						text: e,
+						weight: o
+					});
+				}
+			} else if (i != null && i !== "" && typeof i != "object") {
+				let e = String(i);
+				a.push(e);
+				let t = e.split(/[^a-z0-9]+/i).filter((e) => e.length > 0);
+				for (let e of t) r.push({
+					text: e,
+					weight: o
+				});
+			}
+		}
+		return {
+			item: t,
+			index: n,
+			tokens: r,
+			combinedFlatText: a.join(" ")
+		};
+	}), [t, i]);
+	return n(() => {
+		let e = r.trim();
+		if (!e || d.length === 0) return t;
+		let n = e.split(/\s+/).filter((e) => e.length > 0);
+		if (n.length === 0) return t;
+		let i = [], a = .3;
+		for (let e of d) {
+			let t = 0, r = 0, d = !1;
+			for (let i of n) {
+				let n = 0, o = c ? i : i.toLowerCase();
+				for (let t of e.tokens) {
+					let e = (c ? t.text : t.text.toLowerCase()).split(/\s+/).filter((e) => e.length > 0);
+					for (let r of e) {
+						if (!r.includes(o)) {
+							if (r.length < i.length / 2) continue;
+							let e = Math.abs(i.length - r.length), t = Math.max(i.length, r.length);
+							if (t > 0 && (t - e) / t < a) continue;
+						}
+						let e = s(i, r, c) * t.weight;
+						e > n && (n = e);
+					}
+				}
+				n >= a && r++, t += n;
+			}
+			if (l === "all" && r < n.length && (d = !0), !d) {
+				let r = t / n.length;
+				if (u && n.length > 1) {
+					let t = n.map((e) => e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&")).join("\\s+");
+					new RegExp(t, c ? "g" : "gi").test(e.combinedFlatText) && (r += .15);
+				}
+				r >= o && i.push({
+					item: e.item,
+					score: r,
+					index: e.index
+				});
+			}
+		}
+		return i.toSorted((e, t) => t.score === e.score ? e.index - t.index : t.score - e.score).map((e) => e.item);
+	}, [
+		d,
+		t,
+		r,
+		o,
+		c,
+		l,
+		u
+	]);
+}
+//#endregion
+//#region src/state/useGrouping/useGrouping.ts
+function l({ items: r, initialGroupBy: a }) {
+	let [o, s] = i(a), c = n(() => o ? r.reduce((t, n) => {
+		let r = e(n, o), i = r == null ? "Unknown" : String(r);
+		return t[i] || (t[i] = []), t[i].push(n), t;
+	}, {}) : { Ungrouped: r }, [r, o]), l = n(() => Object.keys(c).map((e) => ({
+		key: e,
+		items: c[e]
+	})), [c]), u = n(() => Object.keys(c), [c]), d = t((e) => {
+		s(e);
+	}, []), f = t(() => {
+		s(void 0);
+	}, []), p = t(() => {
+		s(a);
+	}, [a]), m = t((e) => c[e] || [], [c]);
+	return {
+		groupedRecord: c,
+		groupedArray: l,
+		groupKeys: u,
+		totalGroups: u.length,
+		activeGroupBy: o,
+		changeGroupBy: d,
+		clearGrouping: f,
+		resetGrouping: p,
+		getGroupItems: m
+	};
+}
+//#endregion
+//#region src/state/useMultipleSelection/useMultipleSelection.ts
+function u({ items: a, field: o, initialSelectedIds: s = [] }) {
+	let c = r(s), [l, u] = i(() => new Set(s)), d = t((t) => {
+		u((n) => {
+			let r = new Set(n), i = e(t, o);
+			return r.add(i), r;
+		});
+	}, [o]), f = t((t) => {
+		u((n) => {
+			let r = new Set(n), i = e(t, o);
+			return r.delete(i), r;
+		});
+	}, [o]), p = t((t) => {
+		u((n) => {
+			let r = new Set(n), i = e(t, o);
+			return r.has(i) ? r.delete(i) : r.add(i), r;
+		});
+	}, [o]), m = t((t) => {
+		let n = e(t, o);
+		return l.has(n);
+	}, [l, o]), h = t(() => u(new Set(c.current)), []), g = t((t) => {
+		let n = t.map((t) => e(t, o));
+		u(new Set(n));
+	}, [o]), _ = t(() => {
+		let t = a.map((t) => e(t, o));
+		u(new Set(t));
+	}, [a, o]), v = t(() => {
+		u(/* @__PURE__ */ new Set());
+	}, []), y = t(() => u((t) => {
+		if (t.size === a.length) return /* @__PURE__ */ new Set();
+		let n = a.map((t) => e(t, o));
+		return new Set(n);
+	}), [a, o]), b = t(() => u((t) => {
+		if (t.size === a.length) return /* @__PURE__ */ new Set();
+		let n = a.filter((n) => !t.has(e(n, o))).map((t) => e(t, o));
+		return new Set(n);
+	}), [a, o]), x = t((t) => {
+		u((n) => {
+			let r = new Set(n);
+			return t.map((t) => e(t, o)).forEach((e) => r.add(e)), r;
+		});
+	}, [o]), S = t((t) => {
+		u((n) => {
+			let r = new Set(n);
+			return t.map((t) => e(t, o)).forEach((e) => r.delete(e)), r;
+		});
+	}, [o]), C = t((t) => {
+		u((n) => {
+			let r = /* @__PURE__ */ new Set();
+			return t.map((t) => e(t, o)).forEach((e) => n.has(e) && r.add(e)), r;
+		});
+	}, [o]), w = n(() => a.filter((t) => {
+		let n = e(t, o);
+		return l.has(n);
+	}), [
+		a,
+		o,
+		l
+	]);
+	return {
+		selectedIds: [...l],
+		selectedCount: l.size,
+		selectedItems: w,
+		isEmpty: l.size === 0,
+		select: d,
+		deselect: f,
+		toggle: p,
+		isSelected: m,
+		replaceSelection: g,
+		resetSelection: h,
+		selectAll: _,
+		deselectAll: v,
+		toggleAll: y,
+		invertSelection: b,
+		selectMultiple: x,
+		deselectMultiple: S,
+		retainOnly: C
+	};
+}
+//#endregion
+//#region src/state/useOrder/useOrder.ts
+function d(e) {
+	let n = r(e), [a, o] = i(() => e), s = t((e) => {
+		typeof e == "number" && o((t) => {
+			if (e <= 0 || e >= t.length) return t;
+			let n = [...t];
+			return [n[e], n[e - 1]] = [n[e - 1], n[e]], n;
+		});
+	}, []), c = t((e) => {
+		typeof e == "number" && o((t) => {
+			if (e < 0 || e >= t.length - 1) return t;
+			let n = [...t];
+			return [n[e], n[e + 1]] = [n[e + 1], n[e]], n;
+		});
+	}, []), l = t((e) => e > 0, []), u = t((e) => e < a.length - 1, [a.length]), d = t((e) => {
+		typeof e == "number" && o((t) => {
+			if (e <= 0 || e >= t.length) return t;
+			let n = [...t], [r] = n.splice(e, 1);
+			return n.unshift(r), n;
+		});
+	}, []), f = t((e) => {
+		typeof e == "number" && o((t) => {
+			if (e < 0 || e >= t.length - 1) return t;
+			let n = [...t], [r] = n.splice(e, 1);
+			return n.push(r), n;
+		});
+	}, []), p = t((e, t) => {
+		typeof e != "number" || typeof t != "number" || e === t || o((n) => {
+			if (e < 0 || e >= n.length || t < 0 || t >= n.length) return n;
+			let r = [...n], [i] = r.splice(e, 1);
+			return r.splice(t, 0, i), r;
+		});
+	}, []), m = t((e, t) => {
+		typeof e != "number" || typeof t != "number" || e === t || o((n) => {
+			if (e < 0 || e >= n.length || t < 0 || t >= n.length) return n;
+			let r = [...n];
+			return [r[e], r[t]] = [r[t], r[e]], r;
+		});
+	}, []), h = t(() => {
+		o(n.current);
+	}, []);
+	return {
+		orderedItems: a,
+		moveUp: s,
+		moveDown: c,
+		canMoveUp: l,
+		canMoveDown: u,
+		moveToTop: d,
+		moveToBottom: f,
+		move: p,
+		swap: m,
+		replaceOrder: t((e) => {
+			o(e);
+		}, []),
+		resetOrder: h
+	};
+}
+//#endregion
+//#region src/state/usePagination/usePagination.ts
+function f(e, r, a = 0) {
+	let [o, s] = i(r), [c, l] = i(a), u = Math.max(1, Math.ceil(e.length / Math.max(1, o))), d = Math.min(Math.max(0, c), u - 1);
+	return c !== d && l(d), {
+		pageItems: n(() => typeof o != "number" || o < 1 ? [] : e.slice(c * o, (c + 1) * o), [
+			c,
+			o,
+			e
+		]),
+		pageSize: o,
+		pageIndex: c,
+		totalPages: u,
+		canPrevious: c > 0,
+		canNext: c < u - 1,
+		nextPage: t(() => {
+			l((e) => e < u - 1 ? e + 1 : e);
+		}, [u]),
+		previousPage: t(() => {
+			l((e) => e > 0 ? e - 1 : e);
+		}, []),
+		goToFirstPage: t(() => {
+			l(0);
+		}, []),
+		goToLastPage: t(() => {
+			l(u - 1);
+		}, [u]),
+		goToPage: t((e) => {
+			typeof e == "number" && e >= 0 && e <= u - 1 && l(e);
+		}, [u]),
+		changePageSize: t((t) => {
+			if (typeof t == "number" && t > 0) {
+				s(t);
+				let n = Math.max(1, Math.ceil(e.length / Math.max(1, t)));
+				l((e) => Math.min(Math.max(0, e), n - 1));
+			}
+		}, [e.length]),
+		resetPageIndex: t(() => {
+			l(Math.min(Math.max(0, a), u - 1));
+		}, [a, u]),
+		resetPageSize: t(() => {
+			s(Math.max(1, r));
+			let t = Math.max(1, Math.ceil(e.length / Math.max(1, r)));
+			l((e) => Math.min(Math.max(0, e), t - 1));
+		}, [r, e.length]),
+		resetPagination: t(() => {
+			s(Math.max(1, r));
+			let t = Math.max(1, Math.ceil(e.length / Math.max(1, r)));
+			l(Math.min(Math.max(0, a), t - 1));
+		}, [
+			r,
+			a,
+			e.length
+		])
+	};
+}
+//#endregion
+//#region src/state/useSingleSelection/useSingleSelection.ts
+function p(e) {
+	let [n, r] = i(e), a = t((e) => r(e), []), o = t(() => r(void 0), []), s = t((e) => r((t) => t === e ? void 0 : e), []), c = t((e) => n === e, [n]), l = t(() => r(e), [e]);
+	return {
+		selectedId: n,
+		hasSelection: !!n,
+		select: a,
+		deselect: o,
+		toggle: s,
+		isSelected: c,
+		resetSelection: l
+	};
+}
+//#endregion
+//#region src/state/useSort/utils.ts
+function m(e, t, n = {}) {
+	let { sortUndefined: r, desc: i = !1 } = n, a = x(e, t, r, i);
+	if (a !== null) return a;
+	let o = !!e;
+	return o === !!t ? 0 : o ? 1 : -1;
+}
+function h(e, t, n = {}) {
+	let { sortUndefined: r, desc: i = !1 } = n, a = x(e, t, r, i);
+	if (a !== null) return a;
+	let o = Number(e), s = Number(t), c = Number.isNaN(o), l = Number.isNaN(s);
+	return c || l ? x(c ? void 0 : o, l ? void 0 : s, r, i) ?? 0 : o - s;
+}
+function g(e, t, n = {}) {
+	let { desc: r = !1, sortUndefined: i, caseSensitive: a = !1 } = n, o = x(e, t, i, r);
+	if (o !== null) return o;
+	let s = String(e), c = String(t);
+	return s.localeCompare(c, void 0, { sensitivity: a ? "variant" : "base" });
+}
+function _(e, t, n = {}) {
+	let { desc: r = !1, sortUndefined: i, caseSensitive: a = !1 } = n, o = x(e, t, i, r);
+	if (o !== null) return o;
+	let s = String(e), c = String(t);
+	return s.localeCompare(c, void 0, {
+		numeric: !0,
+		sensitivity: a ? "variant" : "base"
+	});
+}
+function v(e, t, n = {}) {
+	let { desc: r = !1, sortUndefined: i } = n, a = x(e, t, i, r);
+	if (a !== null) return a;
+	let o = new Date(e).getTime(), s = new Date(t).getTime(), c = Number.isNaN(o), l = Number.isNaN(s);
+	return (c || l) && (a = x(c ? void 0 : o, l ? void 0 : s, i, r), a !== null) ? a : o - s;
+}
+function y(e, t, n = {}) {
+	let { desc: r = !1, sortUndefined: i } = n, a = x(e, t, i, r);
+	return a === null ? e < t ? -1 : +(e > t) : a;
+}
+function b(e, t, n = {}) {
+	let { desc: r = !1, sortUndefined: i, compare: a } = n, o = x(e, t, i, r);
+	return o === null ? typeof a == "function" ? a(e, t) : e < t ? -1 : +(e > t) : o;
+}
+function x(e, t, n = "last", r) {
+	let i = e == null || e === "", a = t == null || t === "";
+	if (i && a) return 0;
+	if (!i && !a) return null;
+	if (n === "first") return i ? -1 : 1;
+	if (n === "last") return i ? 1 : -1;
+	if (n === -1) {
+		let e = r ? 1 : -1;
+		return i ? e : -e;
+	}
+	if (n === 1) {
+		let e = r ? 1 : -1;
+		return i ? -e : e;
+	}
+	return null;
+}
+//#endregion
+//#region src/state/useSort/useSort.ts
+function S(a, o = []) {
+	let s = r(o), [c, l] = i(() => o), u = n(() => {
+		let t = c.map((e) => ({
+			...e,
+			pathArray: (e.field || e.id).split(".")
+		}));
+		return [...a].sort((n, r) => {
+			for (let i of t) {
+				let { type: t, id: a, desc: o = !1, invertSorting: s = !1, pathArray: c } = i, l = e(n, c, a), u = e(r, c, a), d;
+				switch (t) {
+					case "numeric":
+						d = h(l, u, i);
+						break;
+					case "alphabetical":
+						d = g(l, u, i);
+						break;
+					case "alphanumeric":
+						d = _(l, u, i);
+						break;
+					case "boolean":
+						d = m(l, u, i);
+						break;
+					case "date":
+						d = v(l, u, i);
+						break;
+					case "basic":
+						d = y(l, u, i);
+						break;
+					case "custom":
+						d = b(l, u, i);
+						break;
+					default: d = y(l, u, i);
+				}
+				if (d !== 0) return d * (o === s ? 1 : -1);
+			}
+			return 0;
+		});
+	}, [c, a]), d = t((e) => l((t) => t.some((t) => t.id === e.id) ? t.map((t) => t.id === e.id ? e : t) : [...t, e]), []), f = t((e) => {
+		l((t) => Array.isArray(e) ? t.filter((t) => !e.includes(t.id)) : t.filter((t) => t.id !== e));
+	}, []), p = t(() => l([]), []), x = t(() => l(s.current), []), S = t((e) => l(e), []), C = t((e, t, n) => {
+		let { multi: r = !1, ...i } = n || {};
+		l((n) => {
+			let a = n.find((t) => t.id === e);
+			if (!a) {
+				let a = {
+					id: e,
+					type: t,
+					...i,
+					desc: !1
+				};
+				return r ? [...n, a] : [a];
+			}
+			if (!a.desc) {
+				let t = {
+					...a,
+					...i,
+					desc: !0
+				};
+				return r ? n.map((n) => n.id === e ? t : n) : [t];
+			}
+			if (a.disableSortRemoval || i.disableSortRemoval) {
+				let t = {
+					...a,
+					...i,
+					desc: !1
+				};
+				return r ? n.map((n) => n.id === e ? t : n) : [t];
+			}
+			return r ? n.filter((t) => t.id !== e) : [];
+		});
+	}, []);
+	return {
+		sortedItems: u,
+		sorts: c,
+		upsertSorts: d,
+		removeSort: f,
+		clearSorts: p,
+		resetSorts: x,
+		replaceSorts: S,
+		getSortDirection: t((e) => {
+			let t = c.find((t) => t.id === e);
+			return t ? t.desc ? "desc" : "asc" : void 0;
+		}, [c]),
+		toggleSort: C,
+		getNextSortingOrder: t((e) => {
+			let t = c.find((t) => t.id === e);
+			return t ? t.desc ? t.disableSortRemoval ? "asc" : "none" : "desc" : "asc";
+		}, [c]),
+		getSortIndex: t((e) => {
+			let t = c.findIndex((t) => t.id === e);
+			return t === -1 ? void 0 : t + 1;
+		}, [c])
+	};
+}
+//#endregion
+export { u as a, o as c, d as i, p as n, l as o, f as r, c as s, S as t };