@himanshu-sorathiya/react-kit 1.0.32 → 1.0.33

package/dist/state2.js

@@ -279,88 +279,131 @@ function l(r = {}) {
 	};
 }
 //#endregion
+//#region src/shared/stateShared/utils.ts
+function u(e, t, n) {
+	if (!((typeof e == "object" || typeof e == "function") && e !== null)) return e;
+	let r = typeof t == "string" ? t.split(".") : Array.isArray(t) ? t : [];
+	if (r.length === 0) return n ?? void 0;
+	let i = r.reduce((e, t) => {
+		if ((typeof e == "object" || typeof e == "function") && e !== null) return e[t];
+	}, e);
+	return i === void 0 ? n ?? void 0 : i;
+}
+//#endregion
+//#region src/shared/selectionShared/utils.ts
+var d = globalThis.process?.env?.NODE_ENV !== "production";
+function f(e, t) {
+	let n = u(e, t);
+	if (d && n == null) throw console.warn("[resolveSelectionId] Resolved id is", n, "— 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: e,
+		field: t
+	}), Error(`[resolveSelectionId] Invalid id resolved: ${String(n)}`);
+	return n;
+}
+//#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;
+function p(e = {}) {
+	let { items: r, defaultSelectedIds: a, isDisabled: o, field: s } = e, c = n(() => Array.isArray(r) ? r : [], [r]), l = n(() => Array.isArray(a) ? a : [], [a]), [u, d] = i(() => new Set(l)), p = n(() => c.map((e) => ({
+		item: e,
+		id: f(e, s)
+	})), [c, s]), m = n(() => p.map((e) => e.id), [p]), h = n(() => m.filter((e) => !(o?.(e) ?? !1)), [m, o]), g = n(() => p.filter((e) => u.has(e.id)).map((e) => e.item), [p, u]), _ = n(() => {
+		let e = m.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];
+	}, [m, u]), v = n(() => h.length > 0 && h.every((e) => u.has(e)), [h, u]), y = n(() => !v && h.some((e) => u.has(e)), [
+		v,
+		h,
+		u
+	]), b = t((e) => {
+		let t = f(e, s);
+		o?.(t) || d((e) => {
+			if (e.has(t)) return e;
+			let n = new Set(e);
+			return n.add(t), n;
 		});
-	}, [l]), m = t((t) => {
-		f((n) => {
-			let r = new Set(n), i = e(t, l);
-			return r.delete(i), r;
+	}, [s, o]), x = t((e) => {
+		let t = f(e, s);
+		d((e) => {
+			if (!e.has(t)) return e;
+			let n = new Set(e);
+			return n.delete(t), n;
 		});
-	}, [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;
+	}, [s]), S = t((e) => {
+		let t = f(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;
 		});
-	}, [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;
+	}, [s, o]), C = t((e) => u.has(f(e, s)), [u, s]), w = t(() => d(new Set(l)), [l]), T = t((e) => {
+		let t = (Array.isArray(e) ? e : []).map((e) => f(e, s)).filter((e) => !(o?.(e) ?? !1));
+		d(new Set(t));
+	}, [s, o]), E = t(() => {
+		d(new Set(h));
+	}, [h]), D = t(() => {
+		d((e) => e.size === 0 ? e : /* @__PURE__ */ new Set());
+	}, []), O = t(() => {
+		d((e) => h.length > 0 && h.every((t) => e.has(t)) ? /* @__PURE__ */ new Set() : new Set(h));
+	}, [h]), k = t(() => {
+		d((e) => {
+			let t = h.filter((t) => !e.has(t));
+			return new Set(t);
 		});
-	}, [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;
+	}, [h]), A = t((e) => {
+		let t = Array.isArray(e) ? e : [];
+		d((e) => {
+			let n = new Set(e);
+			for (let e of t) {
+				let t = f(e, s);
+				(o?.(t) ?? !1) || n.add(t);
+			}
+			return n;
 		});
-	}, [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;
+	}, [s, o]), j = t((e) => {
+		let t = Array.isArray(e) ? e : [];
+		d((e) => {
+			let n = new Set(e);
+			for (let e of t) n.delete(f(e, s));
+			return n;
 		});
-	}, [l]), E = n(() => s.filter((t) => {
-		let n = e(t, l);
-		return d.has(n);
-	}), [
-		s,
-		l,
-		d
-	]);
+	}, [s]), M = t((e) => {
+		let t = new Set((Array.isArray(e) ? e : []).map((e) => f(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: _,
+		selectedCount: u.size,
+		selectedItems: g,
+		isEmpty: u.size === 0,
+		isAllSelected: v,
+		isPartiallySelected: y,
+		select: b,
+		deselect: x,
+		toggle: S,
+		isSelected: C,
+		reset: w,
+		replaceSelection: T,
+		selectAll: E,
+		deselectAll: D,
+		toggleAll: O,
+		invertSelection: k,
+		selectMultiple: A,
+		deselectMultiple: j,
+		retainOnly: M
 	};
 }
 //#endregion
 //#region src/state/useOrder/useOrder.ts
-function d(e = []) {
+function m(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;
@@ -418,7 +461,7 @@ function d(e = []) {
 }
 //#endregion
 //#region src/state/usePagination/usePagination.ts
-function f(e = [], r, a = 0) {
+function h(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), [
@@ -474,40 +517,44 @@ function f(e = [], r, a = 0) {
 }
 //#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 g(e = {}) {
+	let { defaultSelectedId: n, isDisabled: r } = e, [a, o] = i(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) => a === e, [a]), d = t(() => o(n), [n]);
 	return {
-		selectedId: n,
-		hasSelection: !!n,
-		select: a,
-		deselect: o,
-		toggle: s,
-		isSelected: c,
-		resetSelection: l
+		selectedId: a,
+		hasSelection: a !== 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);
+function _(e, t, n = {}) {
+	let { sortUndefined: r, desc: i = !1 } = n, a = w(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);
+function v(e, t, n = {}) {
+	let { sortUndefined: r, desc: i = !1 } = n, a = w(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;
+	return c || l ? w(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);
+function y(e, t, n = {}) {
+	let { desc: r = !1, sortUndefined: i, caseSensitive: a = !1 } = n, o = w(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);
+function b(e, t, n = {}) {
+	let { desc: r = !1, sortUndefined: i, caseSensitive: a = !1 } = n, o = w(e, t, i, r);
 	if (o !== null) return o;
 	let s = String(e), c = String(t);
 	return s.localeCompare(c, void 0, {
@@ -515,21 +562,21 @@ function _(e, t, n = {}) {
 		sensitivity: a ? "variant" : "base"
 	});
 }
-function v(e, t, n = {}) {
-	let { desc: r = !1, sortUndefined: i } = n, a = x(e, t, i, r);
+function x(e, t, n = {}) {
+	let { desc: r = !1, sortUndefined: i } = n, a = w(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;
+	return (c || l) && (a = w(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);
+function S(e, t, n = {}) {
+	let { desc: r = !1, sortUndefined: i } = n, a = w(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);
+function C(e, t, n = {}) {
+	let { desc: r = !1, sortUndefined: i, compare: a } = n, o = w(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) {
+function w(e, t, n = "last", r) {
 	let i = e == null || e === "", a = t == null || t === "";
 	if (i && a) return 0;
 	if (!i && !a) return null;
@@ -547,7 +594,7 @@ function x(e, t, n = "last", r) {
 }
 //#endregion
 //#region src/state/useSort/useSort.ts
-function S(a = [], o = []) {
+function T(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,
@@ -558,35 +605,35 @@ function S(a = [], o = []) {
 				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);
+						d = v(l, u, i);
 						break;
 					case "alphabetical":
-						d = g(l, u, i);
+						d = y(l, u, i);
 						break;
 					case "alphanumeric":
-						d = _(l, u, i);
+						d = b(l, u, i);
 						break;
 					case "boolean":
-						d = m(l, u, i);
+						d = _(l, u, i);
 						break;
 					case "date":
-						d = v(l, u, i);
+						d = x(l, u, i);
 						break;
 					case "basic":
-						d = y(l, u, i);
+						d = S(l, u, i);
 						break;
 					case "custom":
-						d = b(l, u, i);
+						d = C(l, u, i);
 						break;
-					default: d = y(l, u, i);
+					default: d = S(l, u, i);
 				}
 				if (d !== 0) return d * (o === s ? 1 : -1);
 			}
 			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) => {
+	}, [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]), []), m = 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) => {
+	}, []), h = t(() => d([]), []), g = t(() => d(l.current), []), w = t((e) => {
 		d(Array.isArray(e) ? e : []);
 	}, []), T = t((e, t, n) => {
 		let { multi: r = !1, ...i } = n || {};
@@ -624,9 +671,9 @@ function S(a = [], o = []) {
 		sortedItems: f,
 		sorts: u,
 		upsertSorts: p,
-		removeSort: x,
-		clearSorts: S,
-		resetSorts: C,
+		removeSort: m,
+		clearSorts: h,
+		resetSorts: g,
 		replaceSorts: w,
 		getSortDirection: t((e) => {
 			let t = u.find((t) => t.id === e);
@@ -644,4 +691,354 @@ function S(a = [], o = []) {
 	};
 }
 //#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 };
+//#region src/state/useTreeSelection/core.ts
+function E(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 D(e, t) {
+	return typeof t == "function" ? t(e) : e[t];
+}
+function O(e, t, n) {
+	let r = [], i = /* @__PURE__ */ new Map(), a = /* @__PURE__ */ new Map();
+	function o(e, s, c, l) {
+		let u = E(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 = D(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 k(e, t) {
+	return !(t?.(e) ?? !1);
+}
+function A(e, t) {
+	return typeof e == "string" || typeof e == "number" ? e : E(e, t);
+}
+function j(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) => k(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 M(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 && !k(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) => k(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 N(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 && !k(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) => k(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 P(e) {
+	let { items: r, field: a, childrenField: o, isDisabled: s, leafOnly: c = !1 } = e, l = n(() => Array.isArray(r) ? r : [], [r]), u = n(() => Array.isArray(e.defaultSelectedIds) ? e.defaultSelectedIds : [], [e.defaultSelectedIds]), d = e.cascade?.down ?? !0, f = e.cascade?.up ?? !0, p = n(() => O(l, a, o), [
+		l,
+		a,
+		o
+	]), [m, h] = i(() => j(p, new Set(u), s, f)), g = t((e) => {
+		let t = p.childIdsByParentId.get(e);
+		return !t || t.length === 0;
+	}, [p]), _ = n(() => {
+		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 = n(() => {
+		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 = n(() => {
+		let e = [];
+		for (let t of p.entries) m.indeterminateIds.has(t.id) && e.push(t.id);
+		return e;
+	}, [p, m.indeterminateIds]), b = n(() => {
+		let e = new Set(_);
+		return p.entries.filter((t) => e.has(t.id)).map((e) => e.item);
+	}, [p, _]), x = n(() => p.childIdsByParentId.get(void 0) ?? [], [p]), S = n(() => {
+		let e = x.filter((e) => k(e, s));
+		return e.length > 0 && e.every((e) => m.selectedIds.has(e));
+	}, [
+		x,
+		s,
+		m.selectedIds
+	]), C = n(() => !S && x.some((e) => m.selectedIds.has(e) || m.indeterminateIds.has(e)), [
+		S,
+		x,
+		m.selectedIds,
+		m.indeterminateIds
+	]), w = t((e) => {
+		let t = A(e, a);
+		return m.selectedIds.has(t) ? "selected" : m.indeterminateIds.has(t) ? "indeterminate" : "unselected";
+	}, [m, a]), T = t((e) => w(e) === "selected", [w]), E = t((e) => w(e) === "indeterminate", [w]), D = t((e) => {
+		let t = A(e, a);
+		s?.(t) || h((e) => M(p, e.selectedIds, e.indeterminateIds, t, !0, s, d, f));
+	}, [
+		a,
+		p,
+		s,
+		d,
+		f
+	]), P = t((e) => {
+		let t = A(e, a);
+		h((e) => M(p, e.selectedIds, e.indeterminateIds, t, !1, s, d, f));
+	}, [
+		a,
+		p,
+		s,
+		d,
+		f
+	]), F = t((e) => {
+		let t = A(e, a);
+		h((e) => {
+			let n = e.selectedIds.has(t);
+			return !n && s?.(t) ? e : M(p, e.selectedIds, e.indeterminateIds, t, !n, s, d, f);
+		});
+	}, [
+		a,
+		p,
+		s,
+		d,
+		f
+	]), I = t(() => {
+		h(j(p, new Set(u), s, f));
+	}, [
+		p,
+		u,
+		s,
+		f
+	]), L = t((e) => {
+		let t = (Array.isArray(e) ? e : []).map((e) => A(e, a));
+		h(j(p, new Set(t), s, f));
+	}, [
+		a,
+		p,
+		s,
+		f
+	]), R = t(() => {
+		let e = p.entries.map((e) => e.id);
+		h(j(p, new Set(e), s, f));
+	}, [
+		p,
+		s,
+		f
+	]), z = t(() => {
+		h((e) => e.selectedIds.size === 0 && e.indeterminateIds.size === 0 ? e : {
+			selectedIds: /* @__PURE__ */ new Set(),
+			indeterminateIds: /* @__PURE__ */ new Set()
+		});
+	}, []), B = t(() => {
+		h((e) => {
+			let t = x.filter((e) => k(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 j(p, new Set(n), s, f);
+		});
+	}, [
+		x,
+		p,
+		s,
+		f
+	]), V = t((e) => {
+		let t = (Array.isArray(e) ? e : []).map((e) => A(e, a));
+		h((e) => N(p, e.selectedIds, e.indeterminateIds, t, !0, s, d, f));
+	}, [
+		a,
+		p,
+		s,
+		d,
+		f
+	]), H = t((e) => {
+		let t = (Array.isArray(e) ? e : []).map((e) => A(e, a));
+		h((e) => N(p, e.selectedIds, e.indeterminateIds, t, !1, s, d, f));
+	}, [
+		a,
+		p,
+		s,
+		d,
+		f
+	]), U = t((e) => {
+		let t = new Set((Array.isArray(e) ? e : []).map((e) => A(e, a)));
+		h((e) => {
+			let n = /* @__PURE__ */ new Set();
+			return e.selectedIds.forEach((e) => {
+				t.has(e) && n.add(e);
+			}), j(p, n, s, f);
+		});
+	}, [
+		a,
+		p,
+		s,
+		f
+	]), W = 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) && k(n.id, s) && (e.selectedIds.has(n.id) || t.add(n.id));
+			}
+			return j(p, t, s, f);
+		});
+	}, [
+		p,
+		s,
+		f
+	]), G = t((e) => {
+		let t = A(e, a);
+		return p.entryById.get(t)?.parentId;
+	}, [p, a]), K = t((e) => {
+		let t = A(e, a), n = [], r = p.entryById.get(t)?.parentId;
+		for (; r !== void 0;) n.push(r), r = p.entryById.get(r)?.parentId;
+		return n;
+	}, [p, a]), q = t((e) => {
+		let t = A(e, a), 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, a]);
+	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: P,
+		toggle: F,
+		reset: I,
+		replaceSelection: L,
+		selectAll: R,
+		deselectAll: z,
+		toggleAll: B,
+		selectMultiple: V,
+		deselectMultiple: H,
+		retainOnly: U,
+		invertSelection: W,
+		getParentId: G,
+		getAncestorIds: K,
+		getDescendantIds: q
+	};
+}
+//#endregion
+export { m as a, c, h as i, o as l, T as n, p as o, g as r, l as s, P as t };