@himanshu-sorathiya/react-kit 1.0.19 → 1.0.21

package/dist/state2.js

@@ -58,13 +58,13 @@ var a = {
 };
 //#endregion
 //#region src/state/useFilter/useFilter.ts
-function o(o, s = []) {
-	let c = r(s), [l, u] = i(() => s), d = n(() => {
-		let t = l.filter((e) => e.isActive !== !1).map((e) => ({
+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 o.filter((n) => t.every((t) => {
+		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];
@@ -72,26 +72,26 @@ function o(o, s = []) {
 			let f = d[o];
 			return !f || f(u, s, t);
 		}));
-	}, [o, l]), f = t((e) => {
-		u((t) => t.some((t) => t.id === e.id) ? t.map((t) => t.id === e.id ? e : t) : [...t, e]);
-	}, []), p = t((e) => {
-		u((t) => Array.isArray(e) ? t.filter((t) => !e.includes(t.id)) : t.filter((t) => t.id !== e));
-	}, []), m = t(() => {
-		u([]);
-	}, []), h = t(() => {
-		u(c.current);
-	}, []), g = t((e) => {
-		u(e);
+	}, [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: d,
-		filters: l,
-		upsertFilter: f,
-		removeFilter: p,
-		clearFilters: m,
-		resetFilters: h,
+		filteredItems: p,
+		filters: d,
+		upsertFilter: m,
+		removeFilter: h,
+		clearFilters: g,
+		resetFilters: _,
 		toggleFilter: t((e) => {
-			u((t) => t.some((t) => t.id === e.id) ? t.map((t) => t.id === e.id ? {
+			f((t) => t.some((t) => t.id === e.id) ? t.map((t) => t.id === e.id ? {
 				...t,
 				isActive: t.isActive === !1
 			} : t) : [...t, {
@@ -100,23 +100,23 @@ function o(o, s = []) {
 			}]);
 		}, []),
 		updateFilterConfig: t((e, t) => {
-			u((n) => n.map((n) => n.id === e ? {
+			f((n) => n.map((n) => n.id === e ? {
 				...n,
 				...t
 			} : n));
 		}, []),
-		replaceFilters: g,
-		getFilterValue: t((e) => l.find((t) => t.id === e)?.value, [l]),
+		replaceFilters: v,
+		getFilterValue: t((e) => d.find((t) => t.id === e)?.value, [d]),
 		updateFilterValue: t((e, t) => {
-			u((n) => n.map((n) => n.id === e ? {
+			f((n) => n.map((n) => n.id === e ? {
 				...n,
 				value: t
 			} : n));
 		}, []),
 		isFilterActive: t((e) => {
-			let t = l.find((t) => t.id === e);
+			let t = d.find((t) => t.id === e);
 			return t ? t.isActive !== !1 : !1;
-		}, [l])
+		}, [d])
 	};
 }
 //#endregion
@@ -252,223 +252,223 @@ function c(t, r, i, a = {}) {
 }
 //#endregion
 //#region src/state/useGrouping/useGrouping.ts
-function l({ items: r, initialGroupBy: a }) {
-	let [o, s] = i(a), c = n(() => o ? r.reduce((t, n) => {
-		let r = e(n, o), i = r == null ? "Unknown" : String(r);
+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: r }, [r, o]), l = n(() => Object.keys(c).map((e) => ({
+	}, {}) : { Ungrouped: o }, [o, c]), d = n(() => Object.keys(u).map((e) => ({
 		key: e,
-		items: c[e]
-	})), [c]), u = n(() => Object.keys(c), [c]), d = t((e) => {
-		s(e);
-	}, []), f = t(() => {
-		s(void 0);
-	}, []), p = t(() => {
-		s(a);
-	}, [a]), m = t((e) => c[e] || [], [c]);
+		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]);
 	return {
-		groupedRecord: c,
-		groupedArray: l,
-		groupKeys: u,
-		totalGroups: u.length,
-		activeGroupBy: o,
-		changeGroupBy: d,
-		clearGrouping: f,
-		resetGrouping: p,
-		getGroupItems: m
+		groupedRecord: u,
+		groupedArray: d,
+		groupKeys: f,
+		totalGroups: f.length,
+		activeGroupBy: c,
+		changeGroupBy: p,
+		clearGrouping: m,
+		resetGrouping: h,
+		getGroupItems: g
 	};
 }
 //#endregion
 //#region src/state/useMultipleSelection/useMultipleSelection.ts
-function u({ items: a, field: o, initialSelectedIds: s = [] }) {
-	let c = r(s), [l, u] = i(() => new Set(s)), d = t((t) => {
-		u((n) => {
-			let r = new Set(n), i = e(t, o);
+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;
 		});
-	}, [o]), f = t((t) => {
-		u((n) => {
-			let r = new Set(n), i = e(t, o);
+	}, [l]), m = t((t) => {
+		f((n) => {
+			let r = new Set(n), i = e(t, l);
 			return r.delete(i), r;
 		});
-	}, [o]), p = t((t) => {
-		u((n) => {
-			let r = new Set(n), i = e(t, o);
+	}, [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;
 		});
-	}, [o]), m = t((t) => {
-		let n = e(t, o);
-		return l.has(n);
-	}, [l, o]), h = t(() => u(new Set(c.current)), []), g = t((t) => {
-		let n = t.map((t) => e(t, o));
-		u(new Set(n));
-	}, [o]), _ = t(() => {
-		let t = a.map((t) => e(t, o));
-		u(new Set(t));
-	}, [a, o]), v = t(() => {
-		u(/* @__PURE__ */ new Set());
-	}, []), y = t(() => u((t) => {
-		if (t.size === a.length) return /* @__PURE__ */ new Set();
-		let n = a.map((t) => e(t, o));
+	}, [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);
-	}), [a, o]), b = t(() => u((t) => {
-		if (t.size === a.length) return /* @__PURE__ */ new Set();
-		let n = a.filter((n) => !t.has(e(n, o))).map((t) => e(t, o));
+	}), [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);
-	}), [a, o]), x = t((t) => {
-		u((n) => {
+	}), [s, l]), C = t((t) => {
+		f((n) => {
 			let r = new Set(n);
-			return t.map((t) => e(t, o)).forEach((e) => r.add(e)), r;
+			return (Array.isArray(t) ? t : []).map((t) => e(t, l)).forEach((e) => r.add(e)), r;
 		});
-	}, [o]), S = t((t) => {
-		u((n) => {
+	}, [l]), w = t((t) => {
+		f((n) => {
 			let r = new Set(n);
-			return t.map((t) => e(t, o)).forEach((e) => r.delete(e)), r;
+			return (Array.isArray(t) ? t : []).map((t) => e(t, l)).forEach((e) => r.delete(e)), r;
 		});
-	}, [o]), C = t((t) => {
-		u((n) => {
+	}, [l]), T = t((t) => {
+		f((n) => {
 			let r = /* @__PURE__ */ new Set();
-			return t.map((t) => e(t, o)).forEach((e) => n.has(e) && r.add(e)), r;
+			return (Array.isArray(t) ? t : []).map((t) => e(t, l)).forEach((e) => n.has(e) && r.add(e)), r;
 		});
-	}, [o]), w = n(() => a.filter((t) => {
-		let n = e(t, o);
-		return l.has(n);
+	}, [l]), E = n(() => s.filter((t) => {
+		let n = e(t, l);
+		return d.has(n);
 	}), [
-		a,
-		o,
-		l
+		s,
+		l,
+		d
 	]);
 	return {
-		selectedIds: [...l],
-		selectedCount: l.size,
-		selectedItems: w,
-		isEmpty: l.size === 0,
-		select: d,
-		deselect: f,
-		toggle: p,
-		isSelected: m,
-		replaceSelection: g,
-		resetSelection: h,
-		selectAll: _,
-		deselectAll: v,
-		toggleAll: y,
-		invertSelection: b,
-		selectMultiple: x,
-		deselectMultiple: S,
-		retainOnly: C
+		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
 	};
 }
 //#endregion
 //#region src/state/useOrder/useOrder.ts
-function d(e) {
-	let n = r(e), [a, o] = i(() => e), s = t((e) => {
-		typeof e == "number" && o((t) => {
+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;
 		});
-	}, []), c = t((e) => {
-		typeof e == "number" && o((t) => {
+	}, []), 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;
 		});
-	}, []), l = t((e) => e > 0, []), u = t((e) => e < a.length - 1, [a.length]), d = t((e) => {
-		typeof e == "number" && o((t) => {
+	}, []), 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;
 		});
-	}, []), f = t((e) => {
-		typeof e == "number" && o((t) => {
+	}, []), 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;
 		});
-	}, []), p = t((e, t) => {
-		typeof e != "number" || typeof t != "number" || e === t || o((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;
 		});
-	}, []), m = t((e, t) => {
-		typeof e != "number" || typeof t != "number" || e === t || o((n) => {
+	}, []), 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;
 		});
-	}, []), h = t(() => {
-		o(n.current);
+	}, []), _ = t(() => {
+		c(o.current);
 	}, []);
 	return {
-		orderedItems: a,
-		moveUp: s,
-		moveDown: c,
-		canMoveUp: l,
-		canMoveDown: u,
-		moveToTop: d,
-		moveToBottom: f,
-		move: p,
-		swap: m,
+		orderedItems: s,
+		moveUp: l,
+		moveDown: u,
+		canMoveUp: d,
+		canMoveDown: f,
+		moveToTop: p,
+		moveToBottom: m,
+		move: h,
+		swap: g,
 		replaceOrder: t((e) => {
-			o(e);
+			c(Array.isArray(e) ? e : []);
 		}, []),
-		resetOrder: h
+		resetOrder: _
 	};
 }
 //#endregion
 //#region src/state/usePagination/usePagination.ts
-function f(e, r, a = 0) {
-	let [o, s] = i(r), [c, l] = i(a), u = Math.max(1, Math.ceil(e.length / Math.max(1, o))), d = Math.min(Math.max(0, c), u - 1);
-	return c !== d && l(d), {
-		pageItems: n(() => typeof o != "number" || o < 1 ? [] : e.slice(c * o, (c + 1) * o), [
-			c,
-			o,
-			e
+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: o,
-		pageIndex: c,
-		totalPages: u,
-		canPrevious: c > 0,
-		canNext: c < u - 1,
+		pageSize: s,
+		pageIndex: l,
+		totalPages: d,
+		canPrevious: l > 0,
+		canNext: l < d - 1,
 		nextPage: t(() => {
-			l((e) => e < u - 1 ? e + 1 : e);
-		}, [u]),
+			u((e) => e < d - 1 ? e + 1 : e);
+		}, [d]),
 		previousPage: t(() => {
-			l((e) => e > 0 ? e - 1 : e);
+			u((e) => e > 0 ? e - 1 : e);
 		}, []),
 		goToFirstPage: t(() => {
-			l(0);
+			u(0);
 		}, []),
 		goToLastPage: t(() => {
-			l(u - 1);
-		}, [u]),
+			u(d - 1);
+		}, [d]),
 		goToPage: t((e) => {
-			typeof e == "number" && e >= 0 && e <= u - 1 && l(e);
-		}, [u]),
-		changePageSize: t((t) => {
-			if (typeof t == "number" && t > 0) {
-				s(t);
-				let n = Math.max(1, Math.ceil(e.length / Math.max(1, t)));
-				l((e) => Math.min(Math.max(0, e), n - 1));
+			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));
 			}
-		}, [e.length]),
+		}, [o.length]),
 		resetPageIndex: t(() => {
-			l(Math.min(Math.max(0, a), u - 1));
-		}, [a, u]),
+			u(Math.min(Math.max(0, a), d - 1));
+		}, [a, d]),
 		resetPageSize: t(() => {
-			s(Math.max(1, r));
-			let t = Math.max(1, Math.ceil(e.length / Math.max(1, r)));
-			l((e) => Math.min(Math.max(0, e), t - 1));
-		}, [r, e.length]),
+			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(() => {
-			s(Math.max(1, r));
-			let t = Math.max(1, Math.ceil(e.length / Math.max(1, r)));
-			l(Math.min(Math.max(0, a), t - 1));
+			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,
-			e.length
+			o.length
 		])
 	};
 }
@@ -547,13 +547,13 @@ function x(e, t, n = "last", r) {
 }
 //#endregion
 //#region src/state/useSort/useSort.ts
-function S(a, o = []) {
-	let s = r(o), [c, l] = i(() => o), u = n(() => {
-		let t = c.map((e) => ({
+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 [...a].sort((n, r) => {
+		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) {
@@ -584,11 +584,13 @@ function S(a, o = []) {
 			}
 			return 0;
 		});
-	}, [c, a]), d = t((e) => l((t) => t.some((t) => t.id === e.id) ? t.map((t) => t.id === e.id ? e : t) : [...t, e]), []), f = t((e) => {
-		l((t) => Array.isArray(e) ? t.filter((t) => !e.includes(t.id)) : t.filter((t) => t.id !== e));
-	}, []), p = t(() => l([]), []), x = t(() => l(s.current), []), S = t((e) => l(e), []), C = t((e, t, n) => {
+	}, [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 || {};
-		l((n) => {
+		d((n) => {
 			let a = n.find((t) => t.id === e);
 			if (!a) {
 				let a = {
@@ -619,26 +621,26 @@ function S(a, o = []) {
 		});
 	}, []);
 	return {
-		sortedItems: u,
-		sorts: c,
-		upsertSorts: d,
-		removeSort: f,
-		clearSorts: p,
-		resetSorts: x,
-		replaceSorts: S,
+		sortedItems: f,
+		sorts: u,
+		upsertSorts: p,
+		removeSort: x,
+		clearSorts: S,
+		resetSorts: C,
+		replaceSorts: w,
 		getSortDirection: t((e) => {
-			let t = c.find((t) => t.id === e);
+			let t = u.find((t) => t.id === e);
 			return t ? t.desc ? "desc" : "asc" : void 0;
-		}, [c]),
-		toggleSort: C,
+		}, [u]),
+		toggleSort: T,
 		getNextSortingOrder: t((e) => {
-			let t = c.find((t) => t.id === e);
+			let t = u.find((t) => t.id === e);
 			return t ? t.desc ? t.disableSortRemoval ? "asc" : "none" : "desc" : "asc";
-		}, [c]),
+		}, [u]),
 		getSortIndex: t((e) => {
-			let t = c.findIndex((t) => t.id === e);
+			let t = u.findIndex((t) => t.id === e);
 			return t === -1 ? void 0 : t + 1;
-		}, [c])
+		}, [u])
 	};
 }
 //#endregion

package/dist/ui.d.ts

@@ -32,7 +32,7 @@ export interface UseExpansionReturn<T> {
 	resetExpansion: () => void;
 	replaceExpansion: (newExpandedItems: ExpansionId[] | T[]) => void;
 }
-export declare function useExpansion<T = unknown>({ items, field, initialExpandedIds, multiple, }?: {
+export declare function useExpansion<T = unknown>(options?: {
 	items?: T[];
 	field?: string;
 	initialExpandedIds?: ExpansionId[];
@@ -70,8 +70,8 @@ export interface UsePinReturn<T> {
 	pinMultiple: (newItems: PinId[] | T[]) => void;
 	unpinMultiple: (itemsToRemove: PinId[] | T[]) => void;
 }
-export declare function usePin<T = unknown>({ items, field, initialPinnedIds, maxPins, }: {
-	items: T[];
+export declare function usePin<T = unknown>(options?: {
+	items?: T[];
 	field?: string;
 	initialPinnedIds?: PinId[];
 	maxPins?: number;
@@ -91,8 +91,8 @@ export interface UseVisibilityReturn<T> {
 	resetVisibility: () => void;
 	replaceVisibility: (newVisibleItems: VisibilityId[] | T[]) => void;
 }
-export declare function useVisibility<T = unknown>({ items, field, initialVisibleIds, }: {
-	items: T[];
+export declare function useVisibility<T = unknown>(options?: {
+	items?: T[];
 	field?: string;
 	initialVisibleIds?: VisibilityId[];
 }): UseVisibilityReturn<T>;