@himanshu-sorathiya/react-kit 1.0.32 → 1.0.34

package/dist/state2.js

@@ -1,596 +1,1267 @@
 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 = {
+import { useCallback as t, useDeferredValue as n, useMemo as r, useRef as i, useState as a } from "react";
+import { format as o, getDate as s, getMonth as c, getYear as l, isAfter as u, isBefore as d, isDate as f, isEqual as p, isSameDay as m, isValid as h, isWithinRange as g, startOfDay as _, toDate as v } from "@himanshu-sorathiya/datetime";
+//#region src/shared/stateShared/coercion.ts
+function y(e) {
+	return f(e) || typeof e == "string" || typeof e == "number";
+}
+function b(e) {
+	return typeof e == "number" && Number.isInteger(e);
+}
+function x(e) {
+	return typeof e == "object" && !!e && !Array.isArray(e) && "min" in e && "max" in e;
+}
+function S(e) {
+	return e == null;
+}
+function C(e) {
+	return typeof e == "number" && Number.isInteger(e) && e >= 1;
+}
+function w(e) {
+	return typeof e == "string" || typeof e == "number";
+}
+function T(e) {
+	return typeof e == "string" || typeof e == "number" || typeof e == "boolean";
+}
+function E(e) {
+	if (S(e)) return null;
+	if (typeof e == "boolean") return e;
+	if (typeof e == "number") return e === 1 || e !== 0 && null;
+	if (typeof e == "string") {
+		let t = e.trim().toLowerCase();
+		return t === "true" || t === "1" ? !0 : t === "false" || t === "0" ? !1 : null;
+	}
+	return null;
+}
+function D(e) {
+	if (S(e)) return null;
+	let t = v(e);
+	return h(t) ? t : null;
+}
+function O(e) {
+	return S(e) || typeof e == "object" ? null : String(e);
+}
+function k(e) {
+	if (S(e) || typeof e == "boolean" || typeof e != "number" && typeof e != "string" || typeof e == "string" && e.trim() === "") return null;
+	let t = Number(e);
+	return Number.isNaN(t) ? null : t;
+}
+//#endregion
+//#region src/state/useExpansion/validation.ts
+var A = globalThis.process?.env?.NODE_ENV !== "production";
+function j(e, t, n) {
+	if (w(e)) return !0;
+	if (!t) {
+		if (A) throw console.warn(`[useExpansion] ${n}: received an object item but no "field" option is configured to resolve its id. Every such item would collapse onto the same expanded id.`), Error(`[useExpansion] ${n}: received an object item but no "field" option is configured to resolve its id.`);
+		return !1;
+	}
+	return !0;
+}
+function M(t, n, r) {
+	if (w(t)) return t;
+	if (!n) return;
+	let i = e(t, n);
+	return i === void 0 && A && console.warn(`[useExpansion] ${r}: could not resolve an id from the given item using field "${n}".`), i;
+}
+function N(e, t) {
+	A && console.warn(`[useExpansion] ${e}: ${t} expanded ids were given but "multiple" is false; keeping only the first.`);
+}
+function P(e) {
+	A && console.warn(`[useExpansion] ${e}: the only expanded item can't be collapsed because "collapsible" is false.`);
+}
+function ee() {
+	A && console.warn("[useExpansion] expandAll: has no effect because \"multiple\" is false.");
+}
+//#endregion
+//#region src/state/useExpansion/useExpansion.ts
+function te(e = {}) {
+	let n = e, o = n.field, s = !!n.multiple, c = n.collapsible ?? !0, l = r(() => Array.isArray(n.items) ? n.items : [], [n.items]), u = r(() => Array.isArray(n.initialExpandedIds) ? n.initialExpandedIds : [], [n.initialExpandedIds]), d = i(u), [f, p] = a(() => {
+		let e = [...new Set(u)];
+		return !s && e.length > 1 ? (N("useExpansion", e.length), new Set(e.slice(0, 1))) : new Set(e);
+	}), m = t((e) => {
+		if (!j(e, o, "isExpanded")) return !1;
+		let t = M(e, o, "isExpanded");
+		return t !== void 0 && f.has(t);
+	}, [f, o]), h = t((e) => {
+		j(e, o, "expand") && p((t) => {
+			let n = M(e, o, "expand");
+			if (n === void 0 || t.has(n)) return t;
+			let r = s ? new Set(t) : /* @__PURE__ */ new Set();
+			return r.add(n), r;
+		});
+	}, [o, s]), g = t((e) => {
+		j(e, o, "collapse") && p((t) => {
+			let n = M(e, o, "collapse");
+			if (n === void 0 || !t.has(n)) return t;
+			if (!s && !c) return P("collapse"), t;
+			let r = new Set(t);
+			return r.delete(n), r;
+		});
+	}, [
+		o,
+		s,
+		c
+	]), _ = t((e) => {
+		j(e, o, "toggleExpansion") && p((t) => {
+			let n = M(e, o, "toggleExpansion");
+			if (n === void 0) return t;
+			if (t.has(n)) {
+				if (!s && !c) return P("toggleExpansion"), t;
+				let e = s ? new Set(t) : /* @__PURE__ */ new Set();
+				return e.delete(n), e;
+			}
+			let r = s ? new Set(t) : /* @__PURE__ */ new Set();
+			return r.add(n), r;
+		});
+	}, [
+		o,
+		s,
+		c
+	]), v = t((e) => {
+		if (!s) {
+			ee();
+			return;
+		}
+		let t = Array.isArray(e) ? e : l, n = [];
+		for (let e of t) {
+			let t = M(e, o, "expandAll");
+			t !== void 0 && n.push(t);
+		}
+		p(new Set(n));
+	}, [
+		l,
+		o,
+		s
+	]), y = t((e) => {
+		if (e === void 0) {
+			p((e) => e.size === 0 ? e : /* @__PURE__ */ new Set());
+			return;
+		}
+		let t = Array.isArray(e) ? e : [];
+		p((e) => {
+			let n = new Set(e);
+			for (let e of t) {
+				if (!j(e, o, "collapseAll")) continue;
+				let t = M(e, o, "collapseAll");
+				t !== void 0 && n.delete(t);
+			}
+			return n;
+		});
+	}, [o]), b = t(() => {
+		let e = d.current;
+		if (!s && e.length > 1) {
+			N("resetExpansion", e.length), p(new Set(e.slice(0, 1)));
+			return;
+		}
+		p(new Set(e));
+	}, [s]), x = t((e) => {
+		let t = Array.isArray(e) ? e : [], n = [];
+		for (let e of t) {
+			if (!j(e, o, "replaceExpansion")) continue;
+			let t = M(e, o, "replaceExpansion");
+			t !== void 0 && n.push(t);
+		}
+		let r = [...new Set(n)];
+		if (!s && r.length > 1) {
+			N("replaceExpansion", r.length), p(new Set(r.slice(0, 1)));
+			return;
+		}
+		p(new Set(r));
+	}, [o, s]), S = r(() => [...f], [f]), { expandedItems: C, collapsedItems: w } = r(() => {
+		let e = [], t = [];
+		for (let n of l) {
+			let r = M(n, o, "expandedItems");
+			r !== void 0 && f.has(r) ? e.push(n) : t.push(n);
+		}
+		return {
+			expandedItems: e,
+			collapsedItems: t
+		};
+	}, [
+		l,
+		o,
+		f
+	]);
+	return {
+		expandedIds: S,
+		expandedItems: C,
+		collapsedItems: w,
+		expandedCount: f.size,
+		hasExpanded: f.size > 0,
+		isExpanded: m,
+		expand: h,
+		collapse: g,
+		toggleExpansion: _,
+		expandAll: v,
+		collapseAll: y,
+		resetExpansion: b,
+		replaceExpansion: x
+	};
+}
+//#endregion
+//#region src/state/useFilter/strategies.ts
+function ne(e, t) {
+	return re[e]?.[t];
+}
+var re = {
 	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())
+		contains: (e, t, n) => {
+			if (!T(e) || !T(t)) return !1;
+			let r = String(e), i = String(t);
+			return n?.caseSensitive ? r.includes(i) : r.toLowerCase().includes(i.toLowerCase());
+		},
+		equals: (e, t, n) => {
+			if (!T(e) || !T(t)) return !1;
+			let r = String(e), i = String(t);
+			return n?.caseSensitive ? r === i : r.toLowerCase() === i.toLowerCase();
+		},
+		startsWith: (e, t, n) => {
+			if (!T(e) || !T(t)) return !1;
+			let r = String(e), i = String(t);
+			return n?.caseSensitive ? r.startsWith(i) : r.toLowerCase().startsWith(i.toLowerCase());
+		},
+		endsWith: (e, t, n) => {
+			if (!T(e) || !T(t)) return !1;
+			let r = String(e), i = String(t);
+			return n?.caseSensitive ? r.endsWith(i) : r.toLowerCase().endsWith(i.toLowerCase());
+		},
+		notContains: (e, t, n) => {
+			if (!T(e) || !T(t)) return !1;
+			let r = String(e), i = String(t);
+			return n?.caseSensitive ? !r.includes(i) : !r.toLowerCase().includes(i.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),
+		equals: (e, t) => {
+			let n = k(e), r = k(t);
+			return n === null || r === null ? !1 : n === r;
+		},
+		greaterThan: (e, t) => {
+			let n = k(e), r = k(t);
+			return n === null || r === null ? !1 : n > r;
+		},
+		lessThan: (e, t) => {
+			let n = k(e), r = k(t);
+			return n === null || r === null ? !1 : n < r;
+		},
+		greaterThanOrEqual: (e, t) => {
+			let n = k(e), r = k(t);
+			return n === null || r === null ? !1 : n >= r;
+		},
+		lessThanOrEqual: (e, t) => {
+			let n = k(e), r = k(t);
+			return n === null || r === null ? !1 : n <= r;
+		},
 		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);
+			let n = k(e);
+			if (n === null || !x(t)) return !1;
+			let r = k(t.min), i = k(t.max);
+			return r === null || i === null ? !1 : n >= Math.min(r, i) && n <= Math.max(r, i);
 		}
 	},
-	boolean: { equals: (e, t) => !!e == !!t },
-	date: {
+	boolean: {
 		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();
+			let n = E(e), r = E(t);
+			return n === null || r === null ? !1 : n === r;
 		},
-		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;
+		notEquals: (e, t) => {
+			let n = E(e), r = E(t);
+			return n === null || r === null ? !1 : n !== r;
+		}
+	},
+	date: {
+		equals: (e, t, n) => {
+			let r = D(e), i = D(t);
+			return !r || !i ? !1 : (n?.dateGranularity ?? "day") === "instant" ? p(r, i) : m(r, i);
 		},
-		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;
+		before: (e, t, n) => {
+			let r = D(e), i = D(t);
+			return !r || !i ? !1 : (n?.dateGranularity ?? "day") === "instant" ? d(r, i) : d(_(r), _(i));
 		},
-		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;
+		after: (e, t, n) => {
+			let r = D(e), i = D(t);
+			return !r || !i ? !1 : (n?.dateGranularity ?? "day") === "instant" ? u(r, i) : u(_(r), _(i));
+		},
+		between: (e, t, n) => {
+			let r = D(e);
+			if (!r || !x(t)) return !1;
+			let i = D(t.min), a = D(t.max);
+			return !i || !a ? !1 : (n?.dateGranularity ?? "day") === "instant" ? g(r, i, a) : g(_(r), _(i), _(a));
 		}
 	},
 	select: {
-		equals: (e, t) => e === t,
-		notEquals: (e, t) => e !== t
+		equals: (e, t) => S(e) || S(t) ? !1 : e == t,
+		notEquals: (e, t) => S(e) || S(t) ? !1 : e != t,
+		in: (e, t) => S(e) || !Array.isArray(t) ? !1 : t.some((t) => e == t),
+		notIn: (e, t) => S(e) || !Array.isArray(t) ? !1 : !t.some((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))
+		in: (e, t) => S(e) || !Array.isArray(t) ? !1 : t.includes(e),
+		notIn: (e, t) => S(e) || !Array.isArray(t) ? !1 : !t.includes(e),
+		intersects: (e, t) => S(e) || !Array.isArray(e) || S(t) || !Array.isArray(t) ? !1 : e.some((e) => t.includes(e))
 	}
-};
+}, F = globalThis.process?.env?.NODE_ENV !== "production";
+function I(e, t) {
+	if (!F) return;
+	let n = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set();
+	for (let t of e) n.has(t.id) && r.add(t.id), n.add(t.id);
+	r.size > 0 && console.warn(`[useFilter] ${t} contains duplicate filter ids: ${[...r].join(", ")}. Lookups by id (getFilter, getFilterValue, isFilterActive, updateFilterConfig, updateFilterValue) will only ever affect the first match.`);
+}
+function ie(e, t, n) {
+	switch (e) {
+		case "text": return typeof n == "string";
+		case "number": return t === "between" ? typeof n == "object" && !!n && !Array.isArray(n) && typeof n.min == "number" && typeof n.max == "number" : typeof n == "number";
+		case "boolean": return typeof n == "boolean";
+		case "date": return t === "between" ? typeof n == "object" && !!n && !Array.isArray(n) && y(n.min) && y(n.max) : y(n);
+		case "select": return t === "in" || t === "notIn" ? Array.isArray(n) && n.every((e) => typeof e == "string" || typeof e == "number") : typeof n == "string" || typeof n == "number";
+		case "multiselect": return Array.isArray(n);
+		case "custom": return !0;
+		default: return !1;
+	}
+}
+function ae(e, t, n, r) {
+	let i = e.findIndex((e) => e.id === t), a = e[i];
+	if (i === -1 || !a) {
+		if (F) throw console.warn(`[useFilter] ${r}: no filter found with id "${t}".`), Error(`[useFilter] ${r}: no filter found with id "${t}".`);
+		return e;
+	}
+	let o = {
+		...a,
+		...n
+	};
+	if (!ie(o.type, o.operator, o.value)) {
+		if (F) throw console.warn(`[useFilter] ${r}: update to filter "${t}" would produce a value incompatible with type "${o.type}" and operator "${o.operator}". Update was ignored to avoid corrupting filter state.`, {
+			attempted: n,
+			current: a
+		}), Error(`[useFilter] ${r}: update to filter "${t}" would produce a value incompatible with type "${o.type}" and operator "${o.operator}". Update was ignored to avoid corrupting filter state.`);
+		return e;
+	}
+	let s = [...e];
+	return s[i] = o, s;
+}
 //#endregion
 //#region src/state/useFilter/useFilter.ts
-function o(o = [], s = []) {
-	let c = n(() => Array.isArray(o) ? o : [], [o]), l = n(() => Array.isArray(s) ? s : [], [s]), u = r(l), [d, f] = i(() => l), p = n(() => {
-		let t = d.filter((e) => e.isActive !== !1).map((e) => ({
-			...e,
-			pathArray: (e.field || e.id).split(".")
-		}));
-		return c.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);
-		}));
-	}, [c, d]), m = t((e) => {
-		f((t) => t.some((t) => t.id === e.id) ? t.map((t) => t.id === e.id ? e : t) : [...t, e]);
-	}, []), h = t((e) => {
-		f((t) => Array.isArray(e) ? t.filter((t) => !e.includes(t.id)) : t.filter((t) => t.id !== e));
-	}, []), g = t(() => {
-		f([]);
-	}, []), _ = t(() => {
-		f(u.current);
-	}, []), v = t((e) => {
-		f(Array.isArray(e) ? e : []);
-	}, []);
-	return {
-		filteredItems: p,
-		filters: d,
-		upsertFilter: m,
-		removeFilter: h,
-		clearFilters: g,
-		resetFilters: _,
-		toggleFilter: t((e) => {
-			f((t) => t.some((t) => t.id === e.id) ? t.map((t) => t.id === e.id ? {
-				...t,
-				isActive: t.isActive === !1
-			} : t) : [...t, {
+var oe = globalThis.process?.env?.NODE_ENV !== "production";
+function se(o = [], s = [], c) {
+	let l = r(() => Array.isArray(o) ? o : [], [o]), u = r(() => Array.isArray(s) ? s : [], [s]), d = i(u), [f, p] = a(() => (I(u, "initialFilters"), u)), m = n(f), h = c?.defer ? m : f, g = r(() => {
+		let t = h.filter((e) => e.isActive !== !1).map((e) => {
+			let { id: t, type: n, operator: r, value: i, compare: a, field: o } = e, s = (o ?? t).split(".");
+			if (n === "custom") return a ? {
+				pathArray: s,
+				evaluate: (e, t) => a(e, i, t)
+			} : (oe && console.warn(`[useFilter] filter "${t}" has type "custom" but no "compare" function was provided. Excluding all items for this filter.`), {
+				pathArray: s,
+				evaluate: () => !1
+			});
+			let c = ne(n, r);
+			return c ? {
+				pathArray: s,
+				evaluate: (t) => c(t, i, e)
+			} : (oe && console.warn(`[useFilter] filter "${t}" has an unknown type/operator combination ("${n}"/"${r}"). Excluding all items for this filter.`), {
+				pathArray: s,
+				evaluate: () => !1
+			});
+		});
+		return t.length === 0 ? l : l.filter((n) => t.every(({ pathArray: t, evaluate: r }) => r(e(n, t), n)));
+	}, [l, h]), _ = r(() => f.filter((e) => e.isActive !== !1).length, [f]), v = _ > 0, y = t((e) => {
+		p((t) => t.some((t) => t.id === e.id) ? t.map((t) => t.id === e.id ? e : t) : [...t, e]);
+	}, []), b = t((e) => {
+		p((t) => Array.isArray(e) ? t.filter((t) => !e.includes(t.id)) : t.filter((t) => t.id !== e));
+	}, []), x = t(() => {
+		p([]);
+	}, []), S = t(() => {
+		p(d.current);
+	}, []), C = t((e) => {
+		let t = Array.isArray(e) ? e : [];
+		I(t, "replaceFilters"), p(t);
+	}, []), w = t((e) => {
+		p((t) => {
+			let n = t.findIndex((t) => t.id === e.id), r = t[n];
+			if (n === -1 || !r) return [...t, {
 				...e,
 				isActive: !0
-			}]);
-		}, []),
-		updateFilterConfig: t((e, t) => {
-			f((n) => n.map((n) => n.id === e ? {
-				...n,
-				...t
-			} : n));
-		}, []),
-		replaceFilters: v,
-		getFilterValue: t((e) => d.find((t) => t.id === e)?.value, [d]),
-		updateFilterValue: t((e, t) => {
-			f((n) => n.map((n) => n.id === e ? {
-				...n,
-				value: t
-			} : n));
-		}, []),
+			}];
+			let i = [...t];
+			return i[n] = {
+				...r,
+				isActive: r.isActive === !1
+			}, i;
+		});
+	}, []), T = t((e, t) => {
+		p((n) => ae(n, e, t, "updateFilterConfig"));
+	}, []), E = t((e, t) => {
+		p((n) => ae(n, e, { value: t }, "updateFilterValue"));
+	}, []), D = r(() => {
+		let e = /* @__PURE__ */ new Map();
+		for (let t of f) e.has(t.id) || e.set(t.id, t);
+		return e;
+	}, [f]);
+	return {
+		filteredItems: g,
+		filters: f,
+		activeFilterCount: _,
+		hasActiveFilters: v,
+		upsertFilter: y,
+		removeFilter: b,
+		clearFilters: x,
+		resetFilters: S,
+		replaceFilters: C,
+		toggleFilter: w,
+		updateFilterConfig: T,
+		getFilter: t((e) => D.get(e), [D]),
+		getFilterValue: t((e) => D.get(e)?.value, [D]),
+		updateFilterValue: E,
 		isFilterActive: t((e) => {
-			let t = d.find((t) => t.id === e);
+			let t = D.get(e);
 			return t ? t.isActive !== !1 : !1;
-		}, [d])
+		}, [D])
 	};
 }
 //#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;
+//#region src/state/useGrouping/utils.ts
+var ce = globalThis.process?.env?.NODE_ENV !== "production";
+function le(e, t = 2) {
+	return String(e).padStart(t, "0");
+}
+function ue(e, t) {
+	return e.trim() === "" ? t : e;
+}
+function de(t, n) {
+	let r = t.split(".");
+	return { resolveKeys: (t) => {
+		let i = e(t, r), a = Array.isArray(i) ? i : [i], o = /* @__PURE__ */ new Set(), s = [];
+		for (let e of a) {
+			if (S(e) || typeof e == "object") continue;
+			let t = ue(String(e), n);
+			t !== n && (o.has(t) || (o.add(t), s.push({
+				key: t,
+				label: t
+			})));
 		}
-	}
-	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);
+		return s.length > 0 ? s : [{
+			key: n,
+			label: n
+		}];
+	} };
+}
+function fe(t, n, r) {
+	let i = t.split(".");
+	return { resolveKeys: (t) => {
+		let a = D(e(t, i));
+		if (!a) return [{
+			key: r,
+			label: r
+		}];
+		let u = l(a);
+		if (n === "year") return [{
+			key: `${u}`,
+			label: o(a, "yyyy")
+		}];
+		let d = c(a);
+		if (n === "month") return [{
+			key: `${u}-${le(d)}`,
+			label: o(a, "MMMM yyyy")
+		}];
+		let f = s(a);
+		return [{
+			key: `${u}-${le(d)}-${le(f)}`,
+			label: o(a, "MMMM dd, yyyy")
+		}];
+	} };
+}
+function pe(e, t, n) {
+	let r = !1;
+	return { resolveKeys: (i) => {
+		let a;
+		try {
+			a = e.getKey(i);
+		} catch (e) {
+			if (ce) throw console.warn(`[useGrouping] custom group level "${n}" threw an error while computing a key.`, e), e;
+			return r ||= (console.warn(`[useGrouping] custom group level "${n}" threw an error for at least one item; affected items were placed in "${t}".`, e), !0), [{
+				key: t,
+				label: t
+			}];
+		}
+		if (S(a)) return [{
+			key: t,
+			label: t
+		}];
+		let o = Array.isArray(a) ? a : [a];
+		if (o.some((e) => typeof e != "string")) {
+			if (ce) throw console.warn(`[useGrouping] custom group level "${n}" returned a non-string key.`, { returned: a }), Error(`[useGrouping] custom group level "${n}" returned a non-string key.`);
+			return r ||= (console.warn(`[useGrouping] custom group level "${n}" returned an invalid key for at least one item; affected items were placed in "${t}".`), !0), [{
+				key: t,
+				label: t
+			}];
+		}
+		let s = /* @__PURE__ */ new Set(), c = [];
+		for (let e of o) {
+			let n = ue(e, t);
+			n !== t && (s.has(n) || (s.add(n), c.push({
+				key: n,
+				label: n
+			})));
 		}
+		return c.length > 0 ? c : [{
+			key: t,
+			label: t
+		}];
+	} };
+}
+function me(e) {
+	throw Error(`[useGrouping] unhandled group level type: ${JSON.stringify(e)}`);
+}
+function he(e, t, n) {
+	switch (e.type) {
+		case "field": return de(e.field, n);
+		case "date": return fe(e.field, e.bucket ?? "day", n);
+		case "custom": return pe(e, n, e.id ?? `level ${t + 1}`);
+		default: return me(e);
 	}
-	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
-				});
-			}
-		}
+function ge(e, t, n) {
+	let r = t[n];
+	if (!r) return [];
+	let i = /* @__PURE__ */ new Map();
+	for (let t of e) for (let { key: e, label: n } of r.resolveKeys(t)) {
+		let r = i.get(e);
+		r ? r.items.push(t) : i.set(e, {
+			label: n,
+			items: [t]
+		});
+	}
+	return Array.from(i.entries()).map(([e, r]) => {
+		let i = ge(r.items, t, n + 1);
 		return {
-			item: t,
-			index: n,
-			tokens: r,
-			combinedFlatText: a.join(" ")
+			key: e,
+			label: r.label,
+			items: r.items,
+			...i.length > 0 ? { subGroups: i } : {}
 		};
-	}), [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
-				});
-			}
+	});
+}
+function _e(e, t, n, r) {
+	return t.length === 0 ? [{
+		key: r,
+		label: r,
+		items: e
+	}] : ge(e, t.map((e, t) => he(e, t, n)), 0);
+}
+//#endregion
+//#region src/state/useGrouping/validation.ts
+var ve = globalThis.process?.env?.NODE_ENV !== "production";
+function ye(e) {
+	return typeof e == "string" ? {
+		type: "field",
+		field: e
+	} : e;
+}
+function be(e) {
+	return e === void 0 ? [] : (Array.isArray(e) ? e : [e]).map((e) => ye(e));
+}
+function xe(e) {
+	return typeof e != "object" || !e ? !1 : e.type === "field" ? typeof e.field == "string" && e.field.length > 0 : e.type === "date" ? typeof e.field == "string" && e.field.length > 0 && (e.bucket === void 0 || e.bucket === "day" || e.bucket === "month" || e.bucket === "year") : e.type === "custom" && typeof e.getKey == "function" && (e.id === void 0 || typeof e.id == "string");
+}
+function Se(e) {
+	if (!ve) return;
+	let t = /* @__PURE__ */ new Set(), n = /* @__PURE__ */ new Set();
+	for (let r of e) r.type !== "custom" || !r.id || (t.has(r.id) && n.add(r.id), t.add(r.id));
+	n.size > 0 && console.warn(`[useGrouping] duplicate custom group level ids: ${[...n].join(", ")}. Dev warnings referencing these ids may be ambiguous about which level they mean.`);
+}
+//#endregion
+//#region src/state/useGrouping/useGrouping.ts
+var Ce = globalThis.process?.env?.NODE_ENV !== "production";
+function we(e = [], o, s) {
+	let c = r(() => Array.isArray(e) ? e : [], [e]), l = s?.unknownGroupLabel ?? "Unknown", u = s?.ungroupedGroupLabel ?? "Ungrouped", d = r(() => be(o), [o]), [f, p] = a(() => {
+		let e = d.find((e) => !xe(e));
+		if (e) {
+			if (Ce) throw console.warn("[useGrouping] initialGroupBy contains an invalid group level.", e), Error("[useGrouping] initialGroupBy contains an invalid group level.");
+			return [];
 		}
-		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,
+		return Se(d), d;
+	}), m = i(f), h = n(f), g = s?.defer ? h : f, _ = r(() => _e(c, g, l, u), [
 		c,
+		g,
 		l,
 		u
-	]);
-}
-//#endregion
-//#region src/state/useGrouping/useGrouping.ts
-function l(r = {}) {
-	let a = r || {}, o = n(() => Array.isArray(a.items) ? a.items : [], [a.items]), s = a.initialGroupBy, [c, l] = i(s), u = n(() => c ? o.reduce((t, n) => {
-		let r = e(n, c), i = r == null ? "Unknown" : String(r);
-		return t[i] || (t[i] = []), t[i].push(n), t;
-	}, {}) : { Ungrouped: o }, [o, c]), d = n(() => Object.keys(u).map((e) => ({
-		key: e,
-		items: u[e]
-	})), [u]), f = n(() => Object.keys(u), [u]), p = t((e) => {
-		l(e);
-	}, []), m = t(() => {
-		l(void 0);
-	}, []), h = t(() => {
-		l(s);
-	}, [s]), g = t((e) => u[e] || [], [u]);
+	]), v = r(() => {
+		let e = /* @__PURE__ */ new Map();
+		for (let t of _) e.has(t.key) || e.set(t.key, t);
+		return e;
+	}, [_]), y = r(() => {
+		let e = {};
+		for (let t of _) e[t.key] = t.items;
+		return e;
+	}, [_]), b = r(() => _.map((e) => e.key), [_]);
 	return {
-		groupedRecord: u,
-		groupedArray: d,
-		groupKeys: f,
-		totalGroups: f.length,
-		activeGroupBy: c,
-		changeGroupBy: p,
-		clearGrouping: m,
-		resetGrouping: h,
-		getGroupItems: g
+		groupedArray: _,
+		groupedRecord: y,
+		groupKeys: b,
+		totalGroups: b.length,
+		activeGroupBy: f,
+		hasActiveGrouping: f.length > 0,
+		unknownGroupKey: l,
+		ungroupedGroupKey: u,
+		changeGroupBy: t((e) => {
+			let t = be(e), n = t.find((e) => !xe(e));
+			if (n) {
+				if (Ce) throw console.warn("[useGrouping] changeGroupBy: received an invalid group level.", n), Error("[useGrouping] changeGroupBy: received an invalid group level.");
+				return;
+			}
+			Se(t), p(t);
+		}, []),
+		clearGrouping: t(() => {
+			p([]);
+		}, []),
+		resetGrouping: t(() => {
+			p(m.current);
+		}, []),
+		getGroup: t((e) => v.get(e), [v]),
+		getGroupItems: t((e) => v.get(e)?.items ?? [], [v])
 	};
 }
 //#endregion
+//#region src/shared/selectionShared/utils.ts
+var Te = globalThis.process?.env?.NODE_ENV !== "production";
+function L(t, n) {
+	let r = e(t, n);
+	if (Te && r == null) throw console.warn("[resolveSelectionId] Resolved id is", r, "— this usually means `field` does not point to a valid property on the item, or the item's runtime shape doesn't match its declared type.", {
+		item: t,
+		field: n
+	}), Error(`[resolveSelectionId] Invalid id resolved: ${String(r)}`);
+	return r;
+}
+//#endregion
 //#region src/state/useMultipleSelection/useMultipleSelection.ts
-function u(a = {}) {
-	let o = a || {}, s = n(() => Array.isArray(o.items) ? o.items : [], [o.items]), c = Array.isArray(o.initialSelectedIds) ? o.initialSelectedIds : [], l = o.field, u = r(c), [d, f] = i(() => new Set(c)), p = t((t) => {
-		f((n) => {
-			let r = new Set(n), i = e(t, l);
-			return r.add(i), r;
-		});
-	}, [l]), m = t((t) => {
-		f((n) => {
-			let r = new Set(n), i = e(t, l);
-			return r.delete(i), r;
-		});
-	}, [l]), h = t((t) => {
-		f((n) => {
-			let r = new Set(n), i = e(t, l);
-			return r.has(i) ? r.delete(i) : r.add(i), r;
-		});
-	}, [l]), g = t((t) => {
-		let n = e(t, l);
-		return d.has(n);
-	}, [d, l]), _ = t(() => f(new Set(u.current)), []), v = t((t) => {
-		let n = (Array.isArray(t) ? t : []).map((t) => e(t, l));
-		f(new Set(n));
-	}, [l]), y = t(() => {
-		let t = s.map((t) => e(t, l));
-		f(new Set(t));
-	}, [s, l]), b = t(() => {
-		f(/* @__PURE__ */ new Set());
-	}, []), x = t(() => f((t) => {
-		if (t.size === s.length) return /* @__PURE__ */ new Set();
-		let n = s.map((t) => e(t, l));
-		return new Set(n);
-	}), [s, l]), S = t(() => f((t) => {
-		if (t.size === s.length) return /* @__PURE__ */ new Set();
-		let n = s.filter((n) => !t.has(e(n, l))).map((t) => e(t, l));
-		return new Set(n);
-	}), [s, l]), C = t((t) => {
-		f((n) => {
-			let r = new Set(n);
-			return (Array.isArray(t) ? t : []).map((t) => e(t, l)).forEach((e) => r.add(e)), r;
-		});
-	}, [l]), w = t((t) => {
-		f((n) => {
-			let r = new Set(n);
-			return (Array.isArray(t) ? t : []).map((t) => e(t, l)).forEach((e) => r.delete(e)), r;
-		});
-	}, [l]), T = t((t) => {
-		f((n) => {
-			let r = /* @__PURE__ */ new Set();
-			return (Array.isArray(t) ? t : []).map((t) => e(t, l)).forEach((e) => n.has(e) && r.add(e)), r;
-		});
-	}, [l]), E = n(() => s.filter((t) => {
-		let n = e(t, l);
-		return d.has(n);
-	}), [
-		s,
-		l,
-		d
-	]);
+function Ee(e = {}) {
+	let { items: n, defaultSelectedIds: i, isDisabled: o, field: s } = e, c = r(() => Array.isArray(n) ? n : [], [n]), l = r(() => Array.isArray(i) ? i : [], [i]), [u, d] = a(() => new Set(l)), f = r(() => c.map((e) => ({
+		item: e,
+		id: L(e, s)
+	})), [c, s]), p = r(() => f.map((e) => e.id), [f]), m = r(() => p.filter((e) => !(o?.(e) ?? !1)), [p, o]), h = r(() => f.filter((e) => u.has(e.id)).map((e) => e.item), [f, u]), g = r(() => {
+		let e = p.filter((e) => u.has(e));
+		if (e.length === u.size) return e;
+		let t = new Set(e), n = [];
+		return u.forEach((e) => {
+			t.has(e) || n.push(e);
+		}), [...e, ...n];
+	}, [p, u]), _ = r(() => m.length > 0 && m.every((e) => u.has(e)), [m, u]), v = r(() => !_ && m.some((e) => u.has(e)), [
+		_,
+		m,
+		u
+	]), y = t((e) => {
+		let t = L(e, s);
+		o?.(t) || d((e) => {
+			if (e.has(t)) return e;
+			let n = new Set(e);
+			return n.add(t), n;
+		});
+	}, [s, o]), b = t((e) => {
+		let t = L(e, s);
+		d((e) => {
+			if (!e.has(t)) return e;
+			let n = new Set(e);
+			return n.delete(t), n;
+		});
+	}, [s]), x = t((e) => {
+		let t = L(e, s);
+		d((e) => {
+			let n = e.has(t);
+			if (!n && o?.(t)) return e;
+			let r = new Set(e);
+			return n ? r.delete(t) : r.add(t), r;
+		});
+	}, [s, o]), S = t((e) => u.has(L(e, s)), [u, s]), C = t(() => d(new Set(l)), [l]), w = t((e) => {
+		let t = (Array.isArray(e) ? e : []).map((e) => L(e, s)).filter((e) => !(o?.(e) ?? !1));
+		d(new Set(t));
+	}, [s, o]), T = t(() => {
+		d(new Set(m));
+	}, [m]), E = t(() => {
+		d((e) => e.size === 0 ? e : /* @__PURE__ */ new Set());
+	}, []), D = t(() => {
+		d((e) => m.length > 0 && m.every((t) => e.has(t)) ? /* @__PURE__ */ new Set() : new Set(m));
+	}, [m]), O = t(() => {
+		d((e) => {
+			let t = m.filter((t) => !e.has(t));
+			return new Set(t);
+		});
+	}, [m]), k = t((e) => {
+		let t = Array.isArray(e) ? e : [];
+		d((e) => {
+			let n = new Set(e);
+			for (let e of t) {
+				let t = L(e, s);
+				(o?.(t) ?? !1) || n.add(t);
+			}
+			return n;
+		});
+	}, [s, o]), A = t((e) => {
+		let t = Array.isArray(e) ? e : [];
+		d((e) => {
+			let n = new Set(e);
+			for (let e of t) n.delete(L(e, s));
+			return n;
+		});
+	}, [s]), j = t((e) => {
+		let t = new Set((Array.isArray(e) ? e : []).map((e) => L(e, s)));
+		d((e) => {
+			let n = /* @__PURE__ */ new Set();
+			return e.forEach((e) => {
+				t.has(e) && n.add(e);
+			}), n;
+		});
+	}, [s]);
 	return {
-		selectedIds: [...d],
-		selectedCount: d.size,
-		selectedItems: E,
-		isEmpty: d.size === 0,
-		select: p,
-		deselect: m,
-		toggle: h,
-		isSelected: g,
-		replaceSelection: v,
-		resetSelection: _,
-		selectAll: y,
-		deselectAll: b,
-		toggleAll: x,
-		invertSelection: S,
-		selectMultiple: C,
-		deselectMultiple: w,
-		retainOnly: T
+		selectedIds: g,
+		selectedCount: u.size,
+		selectedItems: h,
+		isEmpty: u.size === 0,
+		isAllSelected: _,
+		isPartiallySelected: v,
+		select: y,
+		deselect: b,
+		toggle: x,
+		isSelected: S,
+		reset: C,
+		replaceSelection: w,
+		selectAll: T,
+		deselectAll: E,
+		toggleAll: D,
+		invertSelection: O,
+		selectMultiple: k,
+		deselectMultiple: A,
+		retainOnly: j
 	};
 }
 //#endregion
+//#region src/state/useOrder/utils.ts
+function De(e, t) {
+	return e < 0 ? t + e : e;
+}
+//#endregion
+//#region src/state/useOrder/validation.ts
+var R = globalThis.process?.env?.NODE_ENV !== "production";
+function z(e, t, n) {
+	if (typeof e == "number") {
+		if (b(e)) return !0;
+		if (R) throw console.warn(`[useOrder] ${n}: index must be an integer, received: ${e}.`), Error(`[useOrder] ${n}: index must be an integer, received: ${e}.`);
+		return !1;
+	}
+	if (!t) {
+		if (R) throw console.warn(`[useOrder] ${n}: received an item instead of a numeric index, but no "field" option is configured to resolve it.`), Error(`[useOrder] ${n}: received an item instead of a numeric index, but no "field" option is configured to resolve it.`);
+		return !1;
+	}
+	return !0;
+}
+function B(t, n, r, i, a, o) {
+	let s = n.length;
+	if (typeof t == "number") {
+		let e = De(t, s);
+		if (e < 0 || e >= s) {
+			R && a && console.warn(`[useOrder] ${i}: index ${t} is out of bounds for an array of length ${s}. Call ignored.`);
+			return;
+		}
+		return e;
+	}
+	let c = e(t, r);
+	if (c === void 0) {
+		R && a && console.warn(`[useOrder] ${i}: could not resolve an id from the given item using field "${r}". Call ignored.`);
+		return;
+	}
+	if (o) {
+		let e = o.get(c);
+		return e === void 0 && R && a && console.warn(`[useOrder] ${i}: no item with a matching id was found in orderedItems. Call ignored.`), e;
+	}
+	let l = n.findIndex((t) => e(t, r) === c);
+	if (l === -1) {
+		R && a && console.warn(`[useOrder] ${i}: no item with a matching id was found in orderedItems. Call ignored.`);
+		return;
+	}
+	return l;
+}
+//#endregion
 //#region src/state/useOrder/useOrder.ts
-function d(e = []) {
-	let a = n(() => Array.isArray(e) ? e : [], [e]), o = r(a), [s, c] = i(() => a), l = t((e) => {
-		typeof e == "number" && c((t) => {
-			if (e <= 0 || e >= t.length) return t;
-			let n = [...t];
-			return [n[e], n[e - 1]] = [n[e - 1], n[e]], n;
-		});
-	}, []), u = t((e) => {
-		typeof e == "number" && c((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;
-		});
-	}, []), d = t((e) => e > 0, []), f = t((e) => e < s.length - 1, [s.length]), p = t((e) => {
-		typeof e == "number" && c((t) => {
-			if (e <= 0 || e >= t.length) return t;
-			let n = [...t], [r] = n.splice(e, 1);
-			return n.unshift(r), n;
-		});
-	}, []), m = t((e) => {
-		typeof e == "number" && c((t) => {
-			if (e < 0 || e >= t.length - 1) return t;
-			let n = [...t], [r] = n.splice(e, 1);
-			return n.push(r), n;
-		});
-	}, []), h = t((e, t) => {
-		typeof e != "number" || typeof t != "number" || e === t || c((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;
-		});
-	}, []), g = t((e, t) => {
-		typeof e != "number" || typeof t != "number" || e === t || c((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;
-		});
-	}, []), _ = t(() => {
-		c(o.current);
-	}, []);
+function Oe(n = [], o) {
+	let { isDisabled: s, field: c } = o ?? {}, l = r(() => Array.isArray(n) ? n : [], [n]), u = i(l), [d, f] = a(() => l), p = r(() => {
+		if (!c) return;
+		let t = /* @__PURE__ */ new Map();
+		return d.forEach((n, r) => {
+			t.set(e(n, c), r);
+		}), t;
+	}, [d, c]);
 	return {
-		orderedItems: s,
-		moveUp: l,
-		moveDown: u,
-		canMoveUp: d,
-		canMoveDown: f,
-		moveToTop: p,
-		moveToBottom: m,
-		move: h,
-		swap: g,
-		replaceOrder: t((e) => {
-			c(Array.isArray(e) ? e : []);
+		orderedItems: d,
+		movePrevious: t((e) => {
+			z(e, c, "movePrevious") && f((t) => {
+				let n = B(e, t, c, "movePrevious", !0);
+				if (n === void 0 || n === 0) return t;
+				let r = n - 1;
+				if (s?.(t[n], n) || s?.(t[r], r)) return t;
+				let i = [...t];
+				return [i[n], i[r]] = [i[r], i[n]], i;
+			});
+		}, [s, c]),
+		moveNext: t((e) => {
+			z(e, c, "moveNext") && f((t) => {
+				let n = B(e, t, c, "moveNext", !0);
+				if (n === void 0 || n === t.length - 1) return t;
+				let r = n + 1;
+				if (s?.(t[n], n) || s?.(t[r], r)) return t;
+				let i = [...t];
+				return [i[n], i[r]] = [i[r], i[n]], i;
+			});
+		}, [s, c]),
+		canMovePrevious: t((e) => {
+			if (!z(e, c, "canMovePrevious")) return !1;
+			let t = B(e, d, c, "canMovePrevious", !1, p);
+			if (t === void 0 || t === 0) return !1;
+			let n = t - 1;
+			return !(s?.(d[t], t) || s?.(d[n], n));
+		}, [
+			d,
+			s,
+			c,
+			p
+		]),
+		canMoveNext: t((e) => {
+			if (!z(e, c, "canMoveNext")) return !1;
+			let t = B(e, d, c, "canMoveNext", !1, p);
+			if (t === void 0 || t === d.length - 1) return !1;
+			let n = t + 1;
+			return !(s?.(d[t], t) || s?.(d[n], n));
+		}, [
+			d,
+			s,
+			c,
+			p
+		]),
+		moveToStart: t((e) => {
+			z(e, c, "moveToStart") && f((t) => {
+				let n = B(e, t, c, "moveToStart", !0);
+				if (n === void 0 || n === 0 || s?.(t[n], n)) return t;
+				let r = [...t], [i] = r.splice(n, 1);
+				return r.unshift(i), r;
+			});
+		}, [s, c]),
+		moveToEnd: t((e) => {
+			z(e, c, "moveToEnd") && f((t) => {
+				let n = B(e, t, c, "moveToEnd", !0);
+				if (n === void 0 || n === t.length - 1 || s?.(t[n], n)) return t;
+				let r = [...t], [i] = r.splice(n, 1);
+				return r.push(i), r;
+			});
+		}, [s, c]),
+		move: t((e, t) => {
+			!z(e, c, "move(from)") || !z(t, c, "move(to)") || f((n) => {
+				let r = B(e, n, c, "move(from)", !0), i = B(t, n, c, "move(to)", !0);
+				if (r === void 0 || i === void 0 || r === i || s?.(n[r], r)) return n;
+				let a = [...n], [o] = a.splice(r, 1);
+				return a.splice(i, 0, o), a;
+			});
+		}, [s, c]),
+		swap: t((e, t) => {
+			!z(e, c, "swap(a)") || !z(t, c, "swap(b)") || f((n) => {
+				let r = B(e, n, c, "swap(a)", !0), i = B(t, n, c, "swap(b)", !0);
+				if (r === void 0 || i === void 0 || r === i || s?.(n[r], r) || s?.(n[i], i)) return n;
+				let a = [...n];
+				return [a[r], a[i]] = [a[i], a[r]], a;
+			});
+		}, [s, c]),
+		resetOrder: t(() => {
+			f(u.current);
 		}, []),
-		resetOrder: _
+		replaceOrder: t((e) => {
+			f(Array.isArray(e) ? e : []);
+		}, [])
 	};
 }
 //#endregion
 //#region src/state/usePagination/usePagination.ts
-function f(e = [], r, a = 0) {
-	let o = n(() => Array.isArray(e) ? e : [], [e]), [s, c] = i(r), [l, u] = i(a), d = Math.max(1, Math.ceil(o.length / Math.max(1, s))), f = Math.min(Math.max(0, l), d - 1);
-	return l !== f && u(f), {
-		pageItems: n(() => typeof s != "number" || s < 1 ? [] : o.slice(l * s, (l + 1) * s), [
-			l,
-			s,
-			o
-		]),
-		pageSize: s,
-		pageIndex: l,
-		totalPages: d,
-		canPrevious: l > 0,
-		canNext: l < d - 1,
-		nextPage: t(() => {
-			u((e) => e < d - 1 ? e + 1 : e);
-		}, [d]),
-		previousPage: t(() => {
-			u((e) => e > 0 ? e - 1 : e);
-		}, []),
-		goToFirstPage: t(() => {
-			u(0);
-		}, []),
-		goToLastPage: t(() => {
-			u(d - 1);
-		}, [d]),
-		goToPage: t((e) => {
-			typeof e == "number" && e >= 0 && e <= d - 1 && u(e);
-		}, [d]),
-		changePageSize: t((e) => {
-			if (typeof e == "number" && e > 0) {
-				c(e);
-				let t = Math.max(1, Math.ceil(o.length / Math.max(1, e)));
-				u((e) => Math.min(Math.max(0, e), t - 1));
+var V = globalThis.process?.env?.NODE_ENV !== "production";
+function ke(e = [], n = 10, o = 1) {
+	let s = r(() => Array.isArray(e) ? e : [], [e]), [c, l] = a(() => {
+		if (C(n)) return n;
+		if (V) throw console.warn(`[usePagination] initialPageSize must be a positive integer, received: ${n}. Falling back to 10.`), Error(`[usePagination] initialPageSize must be a positive integer, received: ${n}.`);
+		return 10;
+	}), [u, d] = a(() => {
+		if (C(o)) return o - 1;
+		if (V) throw console.warn(`[usePagination] initialPageNumber must be a positive integer, received: ${o}. Falling back to 1.`), Error(`[usePagination] initialPageNumber must be a positive integer, received: ${o}.`);
+		return 0;
+	}), f = i(c), p = i(u), m = s.length, h = Math.max(1, Math.ceil(m / Math.max(1, c))), g = Math.min(Math.max(0, u), h - 1), _ = r(() => {
+		if (C(c)) return s.slice(g * c, (g + 1) * c);
+		if (V) throw console.warn(`[usePagination] internal invariant violated: pageSize should always be a valid positive integer here, received: ${c}.`), Error(`[usePagination] internal invariant violated: pageSize should always be a valid positive integer here, received: ${c}.`);
+		return [];
+	}, [
+		g,
+		c,
+		s
+	]), v = g > 0, y = g < h - 1, b = m === 0 ? 0 : g * c + 1, x = m === 0 ? 0 : Math.min((g + 1) * c, m), S = t(() => {
+		d((e) => {
+			let t = Math.min(Math.max(0, e), h - 1);
+			return t < h - 1 ? t + 1 : t;
+		});
+	}, [h]), w = t(() => {
+		d((e) => {
+			let t = Math.min(Math.max(0, e), h - 1);
+			return t > 0 ? t - 1 : t;
+		});
+	}, [h]), T = t(() => {
+		d(0);
+	}, []), E = t(() => {
+		d(h - 1);
+	}, [h]), D = t((e) => {
+		if (!C(e)) {
+			if (V) throw console.warn(`[usePagination] goToPage: newPageNumber must be a positive integer, received: ${e}.`), Error(`[usePagination] goToPage: newPageNumber must be a positive integer, received: ${e}.`);
+			return;
+		}
+		d(Math.min(e - 1, h - 1));
+	}, [h]), O = t((e) => {
+		if (!C(e)) {
+			if (V) throw console.warn(`[usePagination] changePageSize: newPageSize must be a positive integer, received: ${e}.`), Error(`[usePagination] changePageSize: newPageSize must be a positive integer, received: ${e}.`);
+			return;
+		}
+		l(e);
+	}, []), k = t(() => {
+		d(p.current);
+	}, []), A = t(() => {
+		l(f.current);
+	}, []), j = t(() => {
+		l(f.current), d(p.current);
+	}, []);
+	return {
+		pageItems: _,
+		pageNumber: g + 1,
+		pageSize: c,
+		totalPages: h,
+		totalCount: m,
+		startIndex: b,
+		endIndex: x,
+		canPreviousPage: v,
+		canNextPage: y,
+		nextPage: S,
+		previousPage: w,
+		goToFirstPage: T,
+		goToLastPage: E,
+		goToPage: D,
+		changePageSize: O,
+		resetPageNumber: k,
+		resetPageSize: A,
+		resetPagination: j
+	};
+}
+//#endregion
+//#region src/state/usePin/validation.ts
+var H = globalThis.process?.env?.NODE_ENV !== "production";
+function U(e, t, n) {
+	if (w(e)) return !0;
+	if (!t) {
+		if (H) throw console.warn(`[usePin] ${n}: received an object item but no "field" option is configured to resolve its id. Every such item would collapse onto the same pinned id.`), Error(`[usePin] ${n}: received an object item but no "field" option is configured to resolve its id.`);
+		return !1;
+	}
+	return !0;
+}
+function W(t, n, r) {
+	if (w(t)) return t;
+	if (!n) return;
+	let i = e(t, n);
+	return i === void 0 && H && console.warn(`[usePin] ${r}: could not resolve an id from the given item using field "${n}".`), i;
+}
+function Ae(e, t) {
+	if (e === void 0) return 2 ** 53 - 1;
+	if (C(e)) return e;
+	if (H) throw console.warn(`[usePin] ${t}: maxPins must be a positive integer, received: ${e}.`), Error(`[usePin] ${t}: maxPins must be a positive integer, received: ${e}.`);
+	return 2 ** 53 - 1;
+}
+function je(e) {
+	H && console.warn(`[usePin] ${e}: pin limit reached; call ignored. Check "canPin" before calling, or raise "maxPins".`);
+}
+function Me(e, t, n) {
+	H && console.warn(`[usePin] ${e}: ${t} pinned ids exceeds maxPins (${n}); truncating to the first ${n}.`);
+}
+//#endregion
+//#region src/state/usePin/usePin.ts
+function Ne(e = {}) {
+	let n = e, o = n.field, s = r(() => Array.isArray(n.items) ? n.items : [], [n.items]), c = r(() => Array.isArray(n.initialPinnedIds) ? n.initialPinnedIds : [], [n.initialPinnedIds]), l = i(c), [u, d] = a(() => Ae(n.maxPins, "usePin")), f = i(u), [p, m] = a(() => {
+		let e = [...new Set(c)];
+		return e.length > u && Me("usePin", e.length, u), new Set(e.slice(0, u));
+	}), h = t((e) => {
+		U(e, o, "pin") && m((t) => {
+			let n = W(e, o, "pin");
+			if (n === void 0 || t.has(n)) return t;
+			if (t.size >= u) return je("pin"), t;
+			let r = new Set(t);
+			return r.add(n), r;
+		});
+	}, [o, u]), g = t((e) => {
+		U(e, o, "unpin") && m((t) => {
+			let n = W(e, o, "unpin");
+			if (n === void 0 || !t.has(n)) return t;
+			let r = new Set(t);
+			return r.delete(n), r;
+		});
+	}, [o]), _ = t((e) => {
+		U(e, o, "togglePin") && m((t) => {
+			let n = W(e, o, "togglePin");
+			if (n === void 0) return t;
+			if (t.has(n)) {
+				let e = new Set(t);
+				return e.delete(n), e;
 			}
-		}, [o.length]),
-		resetPageIndex: t(() => {
-			u(Math.min(Math.max(0, a), d - 1));
-		}, [a, d]),
-		resetPageSize: t(() => {
-			c(Math.max(1, r));
-			let e = Math.max(1, Math.ceil(o.length / Math.max(1, r)));
-			u((t) => Math.min(Math.max(0, t), e - 1));
-		}, [r, o.length]),
-		resetPagination: t(() => {
-			c(Math.max(1, r));
-			let e = Math.max(1, Math.ceil(o.length / Math.max(1, r)));
-			u(Math.min(Math.max(0, a), e - 1));
-		}, [
-			r,
-			a,
-			o.length
-		])
+			if (t.size >= u) return je("togglePin"), t;
+			let r = new Set(t);
+			return r.add(n), r;
+		});
+	}, [o, u]), v = t((e) => {
+		if (!U(e, o, "isPinned")) return !1;
+		let t = W(e, o, "isPinned");
+		return t !== void 0 && p.has(t);
+	}, [p, o]), y = t((e) => {
+		if (!U(e, o, "canPin")) return !1;
+		let t = W(e, o, "canPin");
+		return t === void 0 ? !1 : p.has(t) || p.size < u;
+	}, [
+		p,
+		o,
+		u
+	]), b = t(() => {
+		m((e) => e.size === 0 ? e : /* @__PURE__ */ new Set());
+	}, []), x = t(() => {
+		m(new Set(l.current));
+	}, []), S = t((e) => {
+		let t = Array.isArray(e) ? e : [], n = [];
+		for (let e of t) {
+			if (!U(e, o, "replacePins")) continue;
+			let t = W(e, o, "replacePins");
+			t !== void 0 && n.push(t);
+		}
+		let r = [...new Set(n)];
+		r.length > u && Me("replacePins", r.length, u), m(new Set(r.slice(0, u)));
+	}, [o, u]), C = t((e) => {
+		let t = Array.isArray(e) ? e : s;
+		m((e) => {
+			let n = new Set(e);
+			for (let e of t) {
+				if (!U(e, o, "pinAll")) continue;
+				let t = W(e, o, "pinAll");
+				if (t !== void 0) {
+					if (n.size >= u && !n.has(t)) {
+						je("pinAll");
+						break;
+					}
+					n.add(t);
+				}
+			}
+			return n;
+		});
+	}, [
+		o,
+		u,
+		s
+	]), w = t((e) => {
+		if (e === void 0) {
+			m((e) => e.size === 0 ? e : /* @__PURE__ */ new Set());
+			return;
+		}
+		let t = Array.isArray(e) ? e : [];
+		m((e) => {
+			let n = new Set(e);
+			for (let e of t) {
+				if (!U(e, o, "unpinAll")) continue;
+				let t = W(e, o, "unpinAll");
+				t !== void 0 && n.delete(t);
+			}
+			return n;
+		});
+	}, [o]), T = t((e) => {
+		d(Ae(e, "changeMaxPins"));
+	}, []), E = t(() => {
+		d(f.current);
+	}, []), D = r(() => [...p], [p]), { pinnedItems: O, unpinnedItems: k } = r(() => {
+		let e = [], t = [];
+		for (let n of s) {
+			let r = W(n, o, "pinnedItems");
+			r !== void 0 && p.has(r) ? e.push(n) : t.push(n);
+		}
+		return {
+			pinnedItems: e,
+			unpinnedItems: t
+		};
+	}, [
+		s,
+		o,
+		p
+	]);
+	return {
+		pinnedIds: D,
+		pinnedItems: O,
+		unpinnedItems: k,
+		pinnedCount: p.size,
+		hasPins: p.size > 0,
+		isAtMaxLimit: p.size >= u,
+		maxPins: u,
+		pin: h,
+		unpin: g,
+		togglePin: _,
+		isPinned: v,
+		canPin: y,
+		clearPins: b,
+		resetPins: x,
+		replacePins: S,
+		pinAll: C,
+		unpinAll: w,
+		changeMaxPins: T,
+		resetMaxPins: E
 	};
 }
 //#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]);
+function Pe(e = {}) {
+	let { defaultSelectedId: n, isDisabled: r } = e, [i, o] = a(n), s = t((e) => {
+		r?.(e) || o(e);
+	}, [r]), c = t(() => o(void 0), []), l = t((e) => {
+		r?.(e) || o((t) => t === e ? void 0 : e);
+	}, [r]), u = t((e) => i === e, [i]), d = t(() => o(n), [n]);
 	return {
-		selectedId: n,
-		hasSelection: !!n,
-		select: a,
-		deselect: o,
-		toggle: s,
-		isSelected: c,
-		resetSelection: l
+		selectedId: i,
+		hasSelection: i !== void 0,
+		select: s,
+		deselect: c,
+		toggle: l,
+		isSelected: u,
+		reset: d
 	};
 }
 //#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, {
+//#region src/state/useSort/comparators.ts
+function Fe(e, t) {
+	return e === t ? 0 : e < t ? -1 : 1;
+}
+function Ie(e, t) {
+	return e === t ? 0 : e ? 1 : -1;
+}
+function Le(e, t, n = "day") {
+	return n === "instant" ? e.getTime() - t.getTime() : _(e).getTime() - _(t).getTime();
+}
+function Re(e, t, n = !1) {
+	return e.localeCompare(t, void 0, { sensitivity: n ? "variant" : "base" });
+}
+function ze(e, t, n = !1) {
+	return e.localeCompare(t, void 0, {
 		numeric: !0,
-		sensitivity: a ? "variant" : "base"
+		sensitivity: n ? "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;
+function Be(e, t) {
+	return e < t ? -1 : +(e > t);
+}
+function Ve(e, t, n) {
+	return n(e, t);
+}
+function He(e, t = "last", n) {
+	if (t === "first") return e ? -1 : 1;
+	if (t === "last") return e ? 1 : -1;
+	let r = t === -1 ? e ? -1 : 1 : e ? 1 : -1;
+	return n ? -r : r;
+}
+function G(e, t, n, r) {
+	return (i, a) => {
+		let o = e(i), s = e(a);
+		if (o === null || s === null) return o === null && s === null ? 0 : He(o === null, n, r);
+		let c = t(o, s);
+		return c === 0 ? 0 : r ? -c : c;
+	};
+}
+function Ue(e, t) {
+	let { type: n, sortUndefined: r } = e;
+	switch (n) {
+		case "numeric": return G(k, Fe, r, t);
+		case "boolean": return G(E, Ie, r, t);
+		case "date": {
+			let n = e.dateGranularity ?? "day";
+			return G(D, (e, t) => Le(e, t, n), r, t);
+		}
+		case "alphabetical": {
+			let n = e.caseSensitive ?? !1;
+			return G(O, (e, t) => Re(e, t, n), r, t);
+		}
+		case "alphanumeric": {
+			let n = e.caseSensitive ?? !1;
+			return G(O, (e, t) => ze(e, t, n), r, t);
+		}
+		case "basic": return G((e) => S(e) ? null : e, Be, r, t);
+		case "custom": {
+			let { compare: n } = e;
+			return typeof n == "function" ? G((e) => S(e) ? null : e, (e, t) => Ve(e, t, n), r, t) : void 0;
+		}
+		default: return;
 	}
-	if (n === 1) {
-		let e = r ? 1 : -1;
-		return i ? -e : e;
+}
+//#endregion
+//#region src/state/useSort/validation.ts
+var K = globalThis.process?.env?.NODE_ENV !== "production";
+function We(e, t) {
+	if (!K) return;
+	let n = /* @__PURE__ */ new Set(), r = /* @__PURE__ */ new Set();
+	for (let t of e) n.has(t.id) && r.add(t.id), n.add(t.id);
+	r.size > 0 && console.warn(`[useSort] ${t} contains duplicate sort ids: ${[...r].join(", ")}. Lookups by id (getSort, getSortDirection, getNextSortingOrder, getSortIndex, updateSortConfig) will only ever affect the first match.`);
+}
+function q(e) {
+	return e.type === "custom" ? typeof e.compare == "function" : e.type === "date" ? e.dateGranularity === void 0 || e.dateGranularity === "day" || e.dateGranularity === "instant" : e.type === "alphabetical" || e.type === "alphanumeric" ? e.caseSensitive === void 0 || typeof e.caseSensitive == "boolean" : !0;
+}
+function Ge(e, t, n, r) {
+	let i = e.findIndex((e) => e.id === t), a = e[i];
+	if (i === -1 || !a) {
+		if (K) throw console.warn(`[useSort] ${r}: no sort found with id "${t}".`), Error(`[useSort] ${r}: no sort found with id "${t}".`);
+		return e;
 	}
-	return null;
+	let o = {
+		...a,
+		...n
+	};
+	if (!q(o)) {
+		if (K) throw console.warn(`[useSort] ${r}: update to sort "${t}" would produce an invalid config for type "${o.type}".`, {
+			attempted: n,
+			current: a
+		}), Error(`[useSort] ${r}: update to sort "${t}" would produce an invalid config for type "${o.type}".`);
+		return e;
+	}
+	let s = [...e];
+	return s[i] = o, s;
 }
 //#endregion
 //#region src/state/useSort/useSort.ts
-function S(a = [], o = []) {
-	let s = n(() => Array.isArray(a) ? a : [], [a]), c = n(() => Array.isArray(o) ? o : [], [o]), l = r(c), [u, d] = i(() => c), f = n(() => {
-		let t = u.map((e) => ({
-			...e,
-			pathArray: (e.field || e.id).split(".")
-		}));
-		return [...s].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);
+var J = globalThis.process?.env?.NODE_ENV !== "production";
+function Ke(o = [], s = [], c) {
+	let l = r(() => Array.isArray(o) ? o : [], [o]), u = r(() => Array.isArray(s) ? s : [], [s]), d = i(u), [f, p] = a(() => (We(u, "initialSorts"), u)), m = n(f), h = c?.defer ? m : f, g = r(() => {
+		if (h.length === 0) return l;
+		let t = [];
+		for (let e of h) {
+			let { id: n, type: r, field: i, desc: a = !1, invertSorting: o = !1 } = e, s = (i ?? n).split("."), c = Ue(e, a !== o);
+			if (!c) {
+				if (J) throw console.warn(`[useSort] sort "${n}" could not be resolved (type "${r}" is unknown, or a "custom" sort is missing its "compare" function). Skipping this sort key.`), Error(`[useSort] sort "${n}" could not be resolved (type "${r}" is unknown, or a "custom" sort is missing its "compare" function).`);
+				continue;
+			}
+			t.push({
+				pathArray: s,
+				compareValues: c
+			});
+		}
+		return t.length === 0 ? l : [...l].sort((n, r) => {
+			for (let { pathArray: i, compareValues: a } of t) {
+				let t = a(e(n, i), e(r, i));
+				if (t !== 0) return t;
 			}
 			return 0;
 		});
-	}, [u, s]), p = t((e) => d((t) => t.some((t) => t.id === e.id) ? t.map((t) => t.id === e.id ? e : t) : [...t, e]), []), x = t((e) => {
-		d((t) => Array.isArray(e) ? t.filter((t) => !e.includes(t.id)) : t.filter((t) => t.id !== e));
-	}, []), S = t(() => d([]), []), C = t(() => d(l.current), []), w = t((e) => {
-		d(Array.isArray(e) ? e : []);
-	}, []), T = t((e, t, n) => {
-		let { multi: r = !1, ...i } = n || {};
-		d((n) => {
+	}, [l, h]), _ = f.length, v = _ > 0, y = t((e) => {
+		p((t) => t.some((t) => t.id === e.id) ? t.map((t) => t.id === e.id ? e : t) : [...t, e]);
+	}, []), b = t((e) => {
+		p((t) => Array.isArray(e) ? t.filter((t) => !e.includes(t.id)) : t.filter((t) => t.id !== e));
+	}, []), x = t(() => p([]), []), S = t(() => p(d.current), []), C = t((e) => {
+		let t = Array.isArray(e) ? e : [];
+		We(t, "replaceSorts"), p(t);
+	}, []), w = t((e, t, n) => {
+		let { multi: r = !1, ...i } = n ?? {};
+		p((n) => {
 			let a = n.find((t) => t.id === e);
 			if (!a) {
 				let a = {
@@ -599,6 +1270,10 @@ function S(a = [], o = []) {
 					...i,
 					desc: !1
 				};
+				if (!q(a)) {
+					if (J) throw console.warn(`[useSort] toggleSort: constructed an invalid sort config for id "${e}" (type "${t}").`), Error(`[useSort] toggleSort: constructed an invalid sort config for id "${e}" (type "${t}").`);
+					return n;
+				}
 				return r ? [...n, a] : [a];
 			}
 			if (!a.desc) {
@@ -607,6 +1282,10 @@ function S(a = [], o = []) {
 					...i,
 					desc: !0
 				};
+				if (!q(t)) {
+					if (J) throw console.warn(`[useSort] toggleSort: update would produce an invalid sort config for id "${e}".`), Error(`[useSort] toggleSort: update would produce an invalid sort config for id "${e}".`);
+					return n;
+				}
 				return r ? n.map((n) => n.id === e ? t : n) : [t];
 			}
 			if (a.disableSortRemoval || i.disableSortRemoval) {
@@ -615,33 +1294,515 @@ function S(a = [], o = []) {
 					...i,
 					desc: !1
 				};
+				if (!q(t)) {
+					if (J) throw console.warn(`[useSort] toggleSort: update would produce an invalid sort config for id "${e}".`), Error(`[useSort] toggleSort: update would produce an invalid sort config for id "${e}".`);
+					return n;
+				}
 				return r ? n.map((n) => n.id === e ? t : n) : [t];
 			}
 			return r ? n.filter((t) => t.id !== e) : [];
 		});
-	}, []);
+	}, []), T = t((e, t) => {
+		p((n) => Ge(n, e, t, "updateSortConfig"));
+	}, []), E = r(() => {
+		let e = /* @__PURE__ */ new Map();
+		for (let t of f) e.has(t.id) || e.set(t.id, t);
+		return e;
+	}, [f]), D = r(() => {
+		let e = /* @__PURE__ */ new Map();
+		return f.forEach((t, n) => {
+			e.has(t.id) || e.set(t.id, n);
+		}), e;
+	}, [f]);
 	return {
-		sortedItems: f,
-		sorts: u,
-		upsertSorts: p,
-		removeSort: x,
-		clearSorts: S,
-		resetSorts: C,
-		replaceSorts: w,
+		sortedItems: g,
+		sorts: f,
+		sortCount: _,
+		hasSorts: v,
+		upsertSorts: y,
+		removeSort: b,
+		clearSorts: x,
+		resetSorts: S,
+		replaceSorts: C,
+		toggleSort: w,
+		updateSortConfig: T,
+		getSort: t((e) => E.get(e), [E]),
 		getSortDirection: t((e) => {
-			let t = u.find((t) => t.id === e);
+			let t = E.get(e);
 			return t ? t.desc ? "desc" : "asc" : void 0;
-		}, [u]),
-		toggleSort: T,
+		}, [E]),
 		getNextSortingOrder: t((e) => {
-			let t = u.find((t) => t.id === e);
+			let t = E.get(e);
 			return t ? t.desc ? t.disableSortRemoval ? "asc" : "none" : "desc" : "asc";
-		}, [u]),
+		}, [E]),
 		getSortIndex: t((e) => {
-			let t = u.findIndex((t) => t.id === e);
-			return t === -1 ? void 0 : t + 1;
-		}, [u])
+			let t = D.get(e);
+			return t === void 0 ? void 0 : t + 1;
+		}, [D])
+	};
+}
+//#endregion
+//#region src/state/useTreeSelection/core.ts
+function qe(e, t) {
+	let n;
+	if (n = typeof t == "function" ? t(e) : e[t], typeof process < "u" && process.env.NODE_ENV !== "production" && n == null) throw console.warn("[resolveTreeItemId] Resolved id is", n, "— this usually means `field` does not point to a valid property on the item."), Error(`[resolveTreeItemId] Invalid id resolved: ${String(n)}`);
+	return n;
+}
+function Je(e, t) {
+	return typeof t == "function" ? t(e) : e[t];
+}
+function Ye(e, t, n) {
+	let r = [], i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map();
+	function o(e, s, c, l) {
+		let u = qe(e, t);
+		if (l.has(u)) {
+			if (typeof process < "u" && process.env.NODE_ENV !== "production") throw console.warn("[useTreeSelection] Cycle detected: node", u, "is its own ancestor. This subtree is being skipped rather than recursed forever."), Error(`[useTreeSelection] Cycle detected: node ${u} is its own ancestor.`);
+			return;
+		}
+		let d = {
+			item: e,
+			id: u,
+			parentId: s,
+			depth: c
+		};
+		r.push(d), i.set(u, d);
+		let f = a.get(s);
+		f ? f.push(u) : a.set(s, [u]);
+		let p = Je(e, n);
+		if (!p || p.length === 0) return;
+		let m = new Set(l);
+		m.add(u);
+		for (let e of p) o(e, u, c + 1, m);
+	}
+	for (let t of e) o(t, void 0, 0, /* @__PURE__ */ new Set());
+	return {
+		entries: r,
+		entryById: i,
+		childIdsByParentId: a
+	};
+}
+function Y(e, t) {
+	return !(t?.(e) ?? !1);
+}
+function X(e, t) {
+	return typeof e == "string" || typeof e == "number" ? e : qe(e, t);
+}
+function Z(e, t, n, r) {
+	let i = /* @__PURE__ */ new Set(), a = /* @__PURE__ */ new Set();
+	function o(s) {
+		let c = e.childIdsByParentId.get(s);
+		if (!c || c.length === 0 || !r) {
+			let e = t.has(s) ? "selected" : "unselected";
+			return e === "selected" && i.add(s), e;
+		}
+		let l = c.filter((e) => Y(e, n));
+		if (l.length === 0) {
+			let e = t.has(s) ? "selected" : "unselected";
+			return e === "selected" && i.add(s), e;
+		}
+		let u = !0, d = !1;
+		for (let e of l) {
+			let t = o(e);
+			t !== "selected" && (u = !1), t !== "unselected" && (d = !0);
+		}
+		return u ? (i.add(s), "selected") : d ? (a.add(s), "indeterminate") : "unselected";
+	}
+	let s = e.childIdsByParentId.get(void 0) ?? [];
+	for (let e of s) o(e);
+	return {
+		selectedIds: i,
+		indeterminateIds: a
+	};
+}
+function Xe(e, t, n, r, i, a, o, s) {
+	let c = new Set(t), l = new Set(n), u = [r];
+	if (o) {
+		let t = [r];
+		for (; t.length > 0;) {
+			let n = t.pop(), r = e.childIdsByParentId.get(n);
+			if (r) for (let e of r) u.push(e), t.push(e);
+		}
+	}
+	for (let e of u) l.delete(e), !(i && !Y(e, a)) && (i ? c.add(e) : c.delete(e));
+	if (s) {
+		let t = e.entryById.get(r)?.parentId;
+		for (; t !== void 0;) {
+			let n = (e.childIdsByParentId.get(t) ?? []).filter((e) => Y(e, a));
+			if (n.length === 0) {
+				t = e.entryById.get(t)?.parentId;
+				continue;
+			}
+			let r = !0, i = !1;
+			for (let e of n) {
+				let t = c.has(e), n = l.has(e);
+				t || (r = !1), (t || n) && (i = !0);
+			}
+			r ? (c.add(t), l.delete(t)) : i ? (l.add(t), c.delete(t)) : (c.delete(t), l.delete(t)), t = e.entryById.get(t)?.parentId;
+		}
+	}
+	return {
+		selectedIds: c,
+		indeterminateIds: l
+	};
+}
+function Ze(e, t, n, r, i, a, o, s) {
+	let c = new Set(t), l = new Set(n), u = /* @__PURE__ */ new Set();
+	for (let t of r) {
+		let n = [t];
+		if (o) {
+			let r = [t];
+			for (; r.length > 0;) {
+				let t = r.pop(), i = e.childIdsByParentId.get(t);
+				if (i) for (let e of i) n.push(e), r.push(e);
+			}
+		}
+		for (let e of n) l.delete(e), !(i && !Y(e, a)) && (i ? c.add(e) : c.delete(e));
+		if (s) {
+			let n = e.entryById.get(t)?.parentId;
+			for (; n !== void 0;) u.add(n), n = e.entryById.get(n)?.parentId;
+		}
+	}
+	if (u.size > 0) {
+		let t = [...u].sort((t, n) => (e.entryById.get(n)?.depth ?? 0) - (e.entryById.get(t)?.depth ?? 0));
+		for (let n of t) {
+			let t = (e.childIdsByParentId.get(n) ?? []).filter((e) => Y(e, a));
+			if (t.length === 0) continue;
+			let r = !0, i = !1;
+			for (let e of t) {
+				let t = c.has(e), n = l.has(e);
+				t || (r = !1), (t || n) && (i = !0);
+			}
+			r ? (c.add(n), l.delete(n)) : i ? (l.add(n), c.delete(n)) : (c.delete(n), l.delete(n));
+		}
+	}
+	return {
+		selectedIds: c,
+		indeterminateIds: l
+	};
+}
+//#endregion
+//#region src/state/useTreeSelection/useTreeSelection.ts
+function Qe(e) {
+	let { items: n, field: i, childrenField: o, isDisabled: s, leafOnly: c = !1 } = e, l = r(() => Array.isArray(n) ? n : [], [n]), u = r(() => Array.isArray(e.defaultSelectedIds) ? e.defaultSelectedIds : [], [e.defaultSelectedIds]), d = e.cascade?.down ?? !0, f = e.cascade?.up ?? !0, p = r(() => Ye(l, i, o), [
+		l,
+		i,
+		o
+	]), [m, h] = a(() => Z(p, new Set(u), s, f)), g = t((e) => {
+		let t = p.childIdsByParentId.get(e);
+		return !t || t.length === 0;
+	}, [p]), _ = r(() => {
+		let e = [];
+		for (let t of p.entries) m.selectedIds.has(t.id) && (c && !g(t.id) || e.push(t.id));
+		return e;
+	}, [
+		p,
+		m.selectedIds,
+		c,
+		g
+	]), v = r(() => {
+		let e = [];
+		for (let t of p.entries) m.selectedIds.has(t.id) && g(t.id) && e.push(t.id);
+		return e;
+	}, [
+		p,
+		m.selectedIds,
+		g
+	]), y = r(() => {
+		let e = [];
+		for (let t of p.entries) m.indeterminateIds.has(t.id) && e.push(t.id);
+		return e;
+	}, [p, m.indeterminateIds]), b = r(() => {
+		let e = new Set(_);
+		return p.entries.filter((t) => e.has(t.id)).map((e) => e.item);
+	}, [p, _]), x = r(() => p.childIdsByParentId.get(void 0) ?? [], [p]), S = r(() => {
+		let e = x.filter((e) => Y(e, s));
+		return e.length > 0 && e.every((e) => m.selectedIds.has(e));
+	}, [
+		x,
+		s,
+		m.selectedIds
+	]), C = r(() => !S && x.some((e) => m.selectedIds.has(e) || m.indeterminateIds.has(e)), [
+		S,
+		x,
+		m.selectedIds,
+		m.indeterminateIds
+	]), w = t((e) => {
+		let t = X(e, i);
+		return m.selectedIds.has(t) ? "selected" : m.indeterminateIds.has(t) ? "indeterminate" : "unselected";
+	}, [m, i]), T = t((e) => w(e) === "selected", [w]), E = t((e) => w(e) === "indeterminate", [w]), D = t((e) => {
+		let t = X(e, i);
+		s?.(t) || h((e) => Xe(p, e.selectedIds, e.indeterminateIds, t, !0, s, d, f));
+	}, [
+		i,
+		p,
+		s,
+		d,
+		f
+	]), O = t((e) => {
+		let t = X(e, i);
+		h((e) => Xe(p, e.selectedIds, e.indeterminateIds, t, !1, s, d, f));
+	}, [
+		i,
+		p,
+		s,
+		d,
+		f
+	]), k = t((e) => {
+		let t = X(e, i);
+		h((e) => {
+			let n = e.selectedIds.has(t);
+			return !n && s?.(t) ? e : Xe(p, e.selectedIds, e.indeterminateIds, t, !n, s, d, f);
+		});
+	}, [
+		i,
+		p,
+		s,
+		d,
+		f
+	]), A = t(() => {
+		h(Z(p, new Set(u), s, f));
+	}, [
+		p,
+		u,
+		s,
+		f
+	]), j = t((e) => {
+		let t = (Array.isArray(e) ? e : []).map((e) => X(e, i));
+		h(Z(p, new Set(t), s, f));
+	}, [
+		i,
+		p,
+		s,
+		f
+	]), M = t(() => {
+		let e = p.entries.map((e) => e.id);
+		h(Z(p, new Set(e), s, f));
+	}, [
+		p,
+		s,
+		f
+	]), N = t(() => {
+		h((e) => e.selectedIds.size === 0 && e.indeterminateIds.size === 0 ? e : {
+			selectedIds: /* @__PURE__ */ new Set(),
+			indeterminateIds: /* @__PURE__ */ new Set()
+		});
+	}, []), P = t(() => {
+		h((e) => {
+			let t = x.filter((e) => Y(e, s));
+			if (t.length > 0 && t.every((t) => e.selectedIds.has(t))) return {
+				selectedIds: /* @__PURE__ */ new Set(),
+				indeterminateIds: /* @__PURE__ */ new Set()
+			};
+			let n = p.entries.map((e) => e.id);
+			return Z(p, new Set(n), s, f);
+		});
+	}, [
+		x,
+		p,
+		s,
+		f
+	]), ee = t((e) => {
+		let t = (Array.isArray(e) ? e : []).map((e) => X(e, i));
+		h((e) => Ze(p, e.selectedIds, e.indeterminateIds, t, !0, s, d, f));
+	}, [
+		i,
+		p,
+		s,
+		d,
+		f
+	]), te = t((e) => {
+		let t = (Array.isArray(e) ? e : []).map((e) => X(e, i));
+		h((e) => Ze(p, e.selectedIds, e.indeterminateIds, t, !1, s, d, f));
+	}, [
+		i,
+		p,
+		s,
+		d,
+		f
+	]), ne = t((e) => {
+		let t = new Set((Array.isArray(e) ? e : []).map((e) => X(e, i)));
+		h((e) => {
+			let n = /* @__PURE__ */ new Set();
+			return e.selectedIds.forEach((e) => {
+				t.has(e) && n.add(e);
+			}), Z(p, n, s, f);
+		});
+	}, [
+		i,
+		p,
+		s,
+		f
+	]), re = t(() => {
+		h((e) => {
+			let t = /* @__PURE__ */ new Set();
+			for (let n of p.entries) {
+				let r = p.childIdsByParentId.get(n.id);
+				(!r || r.length === 0) && Y(n.id, s) && (e.selectedIds.has(n.id) || t.add(n.id));
+			}
+			return Z(p, t, s, f);
+		});
+	}, [
+		p,
+		s,
+		f
+	]), F = t((e) => {
+		let t = X(e, i);
+		return p.entryById.get(t)?.parentId;
+	}, [p, i]), I = t((e) => {
+		let t = X(e, i), n = [], r = p.entryById.get(t)?.parentId;
+		for (; r !== void 0;) n.push(r), r = p.entryById.get(r)?.parentId;
+		return n;
+	}, [p, i]), ie = t((e) => {
+		let t = X(e, i), n = [], r = [...p.childIdsByParentId.get(t) ?? []];
+		for (; r.length > 0;) {
+			let e = r.pop();
+			n.push(e);
+			let t = p.childIdsByParentId.get(e);
+			t && r.push(...t);
+		}
+		return n;
+	}, [p, i]);
+	return {
+		selectedIds: _,
+		selectedLeafIds: v,
+		indeterminateIds: y,
+		selectedItems: b,
+		selectedCount: _.length,
+		isEmpty: m.selectedIds.size === 0 && m.indeterminateIds.size === 0,
+		isAllSelected: S,
+		isPartiallySelected: C,
+		getNodeState: w,
+		isSelected: T,
+		isIndeterminate: E,
+		select: D,
+		deselect: O,
+		toggle: k,
+		reset: A,
+		replaceSelection: j,
+		selectAll: M,
+		deselectAll: N,
+		toggleAll: P,
+		selectMultiple: ee,
+		deselectMultiple: te,
+		retainOnly: ne,
+		invertSelection: re,
+		getParentId: F,
+		getAncestorIds: I,
+		getDescendantIds: ie
+	};
+}
+//#endregion
+//#region src/state/useVisibility/validation.ts
+var $e = globalThis.process?.env?.NODE_ENV !== "production";
+function Q(e, t, n) {
+	if (w(e)) return !0;
+	if (!t) {
+		if ($e) throw console.warn(`[useVisibility] ${n}: received an object item but no "field" option is configured to resolve its id. Every such item would collapse onto the same visibility id.`), Error(`[useVisibility] ${n}: received an object item but no "field" option is configured to resolve its id.`);
+		return !1;
+	}
+	return !0;
+}
+function $(t, n, r) {
+	if (w(t)) return t;
+	if (!n) return;
+	let i = e(t, n);
+	return i === void 0 && $e && console.warn(`[useVisibility] ${r}: could not resolve an id from the given item using field "${n}".`), i;
+}
+//#endregion
+//#region src/state/useVisibility/useVisibility.ts
+function et(e = {}) {
+	let n = e, o = n.field, s = r(() => Array.isArray(n.items) ? n.items : [], [n.items]), c = r(() => Array.isArray(n.initialVisibleIds) ? n.initialVisibleIds : [], [n.initialVisibleIds]), l = i(c), [u, d] = a(() => new Set(c)), f = t((e) => {
+		if (!Q(e, o, "isVisible")) return !1;
+		let t = $(e, o, "isVisible");
+		return t !== void 0 && u.has(t);
+	}, [u, o]), p = t((e) => {
+		Q(e, o, "show") && d((t) => {
+			let n = $(e, o, "show");
+			if (n === void 0 || t.has(n)) return t;
+			let r = new Set(t);
+			return r.add(n), r;
+		});
+	}, [o]), m = t((e) => {
+		Q(e, o, "hide") && d((t) => {
+			let n = $(e, o, "hide");
+			if (n === void 0 || !t.has(n)) return t;
+			let r = new Set(t);
+			return r.delete(n), r;
+		});
+	}, [o]), h = t((e) => {
+		Q(e, o, "toggleVisibility") && d((t) => {
+			let n = $(e, o, "toggleVisibility");
+			if (n === void 0) return t;
+			let r = new Set(t);
+			return r.has(n) ? r.delete(n) : r.add(n), r;
+		});
+	}, [o]), g = t((e) => {
+		let t = Array.isArray(e) ? e : s;
+		d((e) => {
+			let n = new Set(e);
+			for (let e of t) {
+				if (!Q(e, o, "showAll")) continue;
+				let t = $(e, o, "showAll");
+				t !== void 0 && n.add(t);
+			}
+			return n;
+		});
+	}, [s, o]), _ = t((e) => {
+		if (e === void 0) {
+			d((e) => e.size === 0 ? e : /* @__PURE__ */ new Set());
+			return;
+		}
+		let t = Array.isArray(e) ? e : [];
+		d((e) => {
+			let n = new Set(e);
+			for (let e of t) {
+				if (!Q(e, o, "hideAll")) continue;
+				let t = $(e, o, "hideAll");
+				t !== void 0 && n.delete(t);
+			}
+			return n;
+		});
+	}, [o]), v = t(() => {
+		d(new Set(l.current));
+	}, []), y = t((e) => {
+		let t = Array.isArray(e) ? e : [], n = [];
+		for (let e of t) {
+			if (!Q(e, o, "replaceVisibility")) continue;
+			let t = $(e, o, "replaceVisibility");
+			t !== void 0 && n.push(t);
+		}
+		d(new Set(n));
+	}, [o]), b = r(() => [...u], [u]), { visibleItems: x, hiddenItems: S } = r(() => {
+		let e = [], t = [];
+		for (let n of s) {
+			let r = $(n, o, "visibleItems");
+			r !== void 0 && u.has(r) ? e.push(n) : t.push(n);
+		}
+		return {
+			visibleItems: e,
+			hiddenItems: t
+		};
+	}, [
+		s,
+		o,
+		u
+	]);
+	return {
+		visibleIds: b,
+		visibleItems: x,
+		hiddenItems: S,
+		visibleCount: u.size,
+		hiddenCount: S.length,
+		hasVisible: u.size > 0,
+		isVisible: f,
+		show: p,
+		hide: m,
+		toggleVisibility: h,
+		showAll: g,
+		hideAll: _,
+		resetVisibility: v,
+		replaceVisibility: y
 	};
 }
 //#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 };
+export { Ne as a, Ee as c, te as d, Pe as i, we as l, Qe as n, ke as o, Ke as r, Oe as s, et as t, se as u };