@himanshu-sorathiya/react-kit 1.0.20 → 1.0.21

package/dist/events2.js

@@ -16,7 +16,7 @@ function i(i, a, { enabled: o = !0, preventDefault: s = !0, stopPropagation: c =
 	}, [o]), e(() => {
 		let e = g && "current" in g ? g.current : g;
 		if (!e) return;
-		let t = i.toLowerCase(), n = r.includes(l) ? l : "keydown", a = u && n !== "keyup";
+		let t = String(i || "").toLowerCase(), n = r.includes(l) ? l : "keydown", a = u && n !== "keyup";
 		function o() {
 			y.current = !1;
 		}

package/dist/index.d.ts

@@ -361,7 +361,7 @@ export interface UseFilterReturn<T> {
 	updateFilterValue: (id: string, value: unknown) => void;
 	isFilterActive: (id: string) => boolean;
 }
-export declare function useFilter<T>(data: T[], initialFilters?: FilterState<T>): UseFilterReturn<T>;
+export declare function useFilter<T>(data?: T[], initialFilters?: FilterState<T>): UseFilterReturn<T>;
 export interface FuzzySearchOptions {
 	threshold?: number;
 	caseSensitive?: boolean;
@@ -404,8 +404,8 @@ export interface UseGroupingReturn<T> {
 	resetGrouping: () => void;
 	getGroupItems: (groupKey: string) => T[];
 }
-export declare function useGrouping<T = unknown>({ items, initialGroupBy, }: {
-	items: T[];
+export declare function useGrouping<T = unknown>(options?: {
+	items?: T[];
 	initialGroupBy?: string;
 }): UseGroupingReturn<T>;
 export type SelectionId = string | number;
@@ -428,8 +428,8 @@ export interface UseMultipleSelectionReturn<T> {
 	deselectMultiple: (itemsToRemove: SelectionId[] | T[]) => void;
 	retainOnly: (itemsToRetain: SelectionId[] | T[]) => void;
 }
-export declare function useMultipleSelection<T = unknown>({ items, field, initialSelectedIds, }: {
-	items: T[];
+export declare function useMultipleSelection<T = unknown>(options?: {
+	items?: T[];
 	field?: string;
 	initialSelectedIds?: SelectionId[];
 }): UseMultipleSelectionReturn<T>;
@@ -446,7 +446,7 @@ export interface UseOrderReturn<T> {
 	resetOrder: () => void;
 	replaceOrder: (newOrderedItems: T[]) => void;
 }
-export declare function useOrder<T>(initialItems: T[]): UseOrderReturn<T>;
+export declare function useOrder<T>(initialItems?: T[]): UseOrderReturn<T>;
 export interface UsePaginationReturn<T> {
 	pageItems: T[];
 	pageSize: number;
@@ -464,7 +464,7 @@ export interface UsePaginationReturn<T> {
 	resetPageSize: () => void;
 	resetPagination: () => void;
 }
-export declare function usePagination<T>(data: T[], initialPageSize: number, initialPageIndex?: number): UsePaginationReturn<T>;
+export declare function usePagination<T>(data: T[] | undefined, initialPageSize: number, initialPageIndex?: number): UsePaginationReturn<T>;
 type SelectionId$1 = string | number;
 export interface UseSingleSelectionReturn {
 	selectedId: SelectionId$1 | undefined;
@@ -516,7 +516,7 @@ export interface UseSortReturn<T> {
 	getNextSortingOrder: (id: string) => "asc" | "desc" | "none";
 	getSortIndex: (id: string) => number | undefined;
 }
-export declare function useSort<T>(data: T[], initialSorts?: SortState): UseSortReturn<T>;
+export declare function useSort<T>(data?: T[], initialSorts?: SortState): UseSortReturn<T>;
 export interface FuzzyHighlighterProps {
 	text: string;
 	query: string;
@@ -546,7 +546,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[];
@@ -584,8 +584,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;
@@ -605,8 +605,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>;

package/dist/performance2.js

@@ -1,27 +1,27 @@
 import { useCallback as e, useEffect as t, useRef as n, useState as r } from "react";
 //#region src/performance/useDebounce/useDebounce.ts
 function i(i, a = {}) {
-	let [o, s] = r(!1), c = a.maxWait, l = !!a.leading, u = !l && a.trailing === !1 ? !0 : a.trailing ?? !l, d = n(null), f = n(null), p = n(null), m = n(-1), h = n(-1), g = e(() => {
-		p.current &&= (clearTimeout(p.current), null), m.current = -1, h.current = -1, f.current = null, d.current = null, s(!1);
-	}, []), _ = e(() => {
-		p.current && d.current && f.current && (clearTimeout(p.current), p.current = null, d.current(...f.current), m.current = Date.now(), h.current = -1, f.current = null, d.current = null, s(!1));
+	let o = Math.max(0, Number(i) || 0), [s, c] = r(!1), l = a?.maxWait, u = !!a?.leading, d = !u && a?.trailing === !1 ? !0 : a?.trailing ?? !u, f = n(null), p = n(null), m = n(null), h = n(-1), g = n(-1), _ = e(() => {
+		m.current &&= (clearTimeout(m.current), null), h.current = -1, g.current = -1, p.current = null, f.current = null, c(!1);
+	}, []), v = e(() => {
+		m.current && f.current && p.current && (clearTimeout(m.current), m.current = null, f.current(...p.current), h.current = Date.now(), g.current = -1, p.current = null, f.current = null, c(!1));
 	}, []);
 	return t(() => () => {
-		g();
-	}, [g]), {
+		_();
+	}, [_]), {
 		run: e((e, ...t) => {
-			s(!0), h.current = Date.now(), f.current = t, d.current = e, m.current === -1 && (m.current = Date.now(), l === !0 && d.current(...t)), c !== void 0 && Date.now() - m.current >= c ? (p.current && clearTimeout(p.current), d.current && d.current(...t), m.current = -1, s(!1)) : (p.current && clearTimeout(p.current), p.current = setTimeout(() => {
-				h.current !== m.current && u !== !1 && d.current && f.current && d.current(...f.current), m.current = -1, s(!1);
-			}, i));
+			c(!0), g.current = Date.now(), p.current = t, f.current = e, h.current === -1 && (h.current = Date.now(), u === !0 && f.current(...t)), l !== void 0 && Date.now() - h.current >= l ? (m.current && clearTimeout(m.current), f.current && f.current(...t), h.current = -1, c(!1)) : (m.current && clearTimeout(m.current), m.current = setTimeout(() => {
+				g.current !== h.current && d !== !1 && f.current && p.current && f.current(...p.current), h.current = -1, c(!1);
+			}, o));
 		}, [
-			i,
-			c,
-			u,
-			l
+			o,
+			l,
+			d,
+			u
 		]),
-		cancel: g,
-		flush: _,
-		isPending: o
+		cancel: _,
+		flush: v,
+		isPending: s
 	};
 }
 //#endregion
@@ -71,34 +71,34 @@ function s(e, n, i = {}) {
 //#endregion
 //#region src/performance/useRateLimit/useRateLimit.ts
 function c(i, a, o) {
-	let [s, c] = r(i), l = o?.refillStrategy ?? "burst", u = n(o?.onRateLimitReached);
+	let s = Math.max(1, Number(i) || 1), c = Math.max(0, Number(a) || 0), [l, u] = r(s), d = o?.refillStrategy ?? "burst", f = n(o?.onRateLimitReached);
 	t(() => {
-		u.current = o?.onRateLimitReached;
+		f.current = o?.onRateLimitReached;
 	}, [o?.onRateLimitReached]);
-	let d = n(i), [f] = r(() => Date.now()), p = n(f), m = n(null);
+	let p = n(s), [m] = r(() => Date.now()), h = n(m), g = n(null);
 	return t(() => () => {
-		m.current && clearTimeout(m.current);
+		g.current && clearTimeout(g.current);
 	}, []), {
 		run: e((e, ...t) => {
-			let n = Date.now(), r = n - p.current;
-			if (l === "burst") r >= a && (d.current = i, p.current = n);
+			let n = Date.now(), r = n - h.current;
+			if (d === "burst") r >= c && (p.current = s, h.current = n);
 			else {
-				let e = a / i, t = Math.floor(r / e);
-				t > 0 && (d.current = Math.min(i, d.current + t), p.current += t * e);
+				let e = c / s, t = Math.floor(r / e);
+				t > 0 && (p.current = Math.min(s, p.current + t), h.current += t * e);
 			}
-			if (d.current > 0 ? (--d.current, c(d.current), e(...t)) : u.current && u.current(), m.current && clearTimeout(m.current), d.current < i) {
-				let e = a / i, t = l === "burst" ? a - (Date.now() - p.current) : e - (Date.now() - p.current);
-				m.current = setTimeout(() => {
-					c((e) => Math.min(i, e + 1)), p.current = Date.now(), d.current = Math.min(i, d.current + 1);
+			if (p.current > 0 ? (--p.current, u(p.current), e(...t)) : f.current && f.current(), g.current && clearTimeout(g.current), p.current < s) {
+				let e = c / s, t = d === "burst" ? c - (Date.now() - h.current) : e - (Date.now() - h.current);
+				g.current = setTimeout(() => {
+					u((e) => Math.min(s, e + 1)), h.current = Date.now(), p.current = Math.min(s, p.current + 1);
 				}, Math.max(0, t));
 			}
 		}, [
-			i,
-			a,
-			l
+			s,
+			c,
+			d
 		]),
-		remaining: s,
-		isRateLimited: s === 0
+		remaining: l,
+		isRateLimited: l === 0
 	};
 }
 //#endregion
@@ -120,34 +120,34 @@ function l(r, i, a, o) {
 //#endregion
 //#region src/performance/useThrottle/useThrottle.ts
 function u(i, a = {}) {
-	let [o, s] = r(!1), c = a.leading ?? !0, l = a.trailing ?? !0;
-	c === !1 && l === !1 && (c = !0, l = !0);
-	let u = n(null), d = n(null), f = n(null), p = n(-1), m = e(() => {
-		f.current &&= (clearTimeout(f.current), null), p.current = -1, d.current = null, u.current = null, s(!1);
-	}, []), h = e(() => {
-		d.current && u.current && (f.current &&= (clearTimeout(f.current), null), u.current(...d.current), p.current = c ? Date.now() : -1, d.current = null, u.current = null, s(!1));
-	}, [c]);
+	let o = Math.max(0, Number(i) || 0), [s, c] = r(!1), l = a?.leading ?? !0, u = a?.trailing ?? !0;
+	l === !1 && u === !1 && (l = !0, u = !0);
+	let d = n(null), f = n(null), p = n(null), m = n(-1), h = e(() => {
+		p.current &&= (clearTimeout(p.current), null), m.current = -1, f.current = null, d.current = null, c(!1);
+	}, []), g = e(() => {
+		f.current && d.current && (p.current &&= (clearTimeout(p.current), null), d.current(...f.current), m.current = l ? Date.now() : -1, f.current = null, d.current = null, c(!1));
+	}, [l]);
 	return t(() => () => {
-		m();
-	}, [m]), {
+		h();
+	}, [h]), {
 		run: e((e, ...t) => {
-			s(!0);
+			c(!0);
 			let n = Date.now();
-			if (d.current = t, u.current = e, p.current === -1 ? c : n - p.current >= i) f.current &&= (clearTimeout(f.current), null), u.current(...t), p.current = n, d.current = null, s(!1);
-			else if (!f.current) {
-				let e = i - (p.current === -1 ? 0 : n - p.current);
-				f.current = setTimeout(() => {
-					l && d.current && u.current ? (u.current(...d.current), p.current = c ? Date.now() : -1) : p.current = -1, d.current = null, u.current = null, f.current = null, s(!1);
-				}, e);
+			if (f.current = t, d.current = e, m.current === -1 ? l : n - m.current >= o) p.current &&= (clearTimeout(p.current), null), d.current(...t), m.current = n, f.current = null, c(!1);
+			else if (!p.current) {
+				let e = m.current === -1 ? 0 : n - m.current, t = o - e;
+				p.current = setTimeout(() => {
+					u && f.current && d.current ? (d.current(...f.current), m.current = l ? Date.now() : -1) : m.current = -1, f.current = null, d.current = null, p.current = null, c(!1);
+				}, t);
 			}
 		}, [
-			i,
-			c,
-			l
+			o,
+			l,
+			u
 		]),
-		cancel: m,
-		flush: h,
-		isPending: o
+		cancel: h,
+		flush: g,
+		isPending: s
 	};
 }
 //#endregion

package/dist/state.d.ts

@@ -75,7 +75,7 @@ export interface UseFilterReturn<T> {
 	updateFilterValue: (id: string, value: unknown) => void;
 	isFilterActive: (id: string) => boolean;
 }
-export declare function useFilter<T>(data: T[], initialFilters?: FilterState<T>): UseFilterReturn<T>;
+export declare function useFilter<T>(data?: T[], initialFilters?: FilterState<T>): UseFilterReturn<T>;
 export interface FuzzySearchOptions {
 	threshold?: number;
 	caseSensitive?: boolean;
@@ -118,8 +118,8 @@ export interface UseGroupingReturn<T> {
 	resetGrouping: () => void;
 	getGroupItems: (groupKey: string) => T[];
 }
-export declare function useGrouping<T = unknown>({ items, initialGroupBy, }: {
-	items: T[];
+export declare function useGrouping<T = unknown>(options?: {
+	items?: T[];
 	initialGroupBy?: string;
 }): UseGroupingReturn<T>;
 export type SelectionId = string | number;
@@ -142,8 +142,8 @@ export interface UseMultipleSelectionReturn<T> {
 	deselectMultiple: (itemsToRemove: SelectionId[] | T[]) => void;
 	retainOnly: (itemsToRetain: SelectionId[] | T[]) => void;
 }
-export declare function useMultipleSelection<T = unknown>({ items, field, initialSelectedIds, }: {
-	items: T[];
+export declare function useMultipleSelection<T = unknown>(options?: {
+	items?: T[];
 	field?: string;
 	initialSelectedIds?: SelectionId[];
 }): UseMultipleSelectionReturn<T>;
@@ -160,7 +160,7 @@ export interface UseOrderReturn<T> {
 	resetOrder: () => void;
 	replaceOrder: (newOrderedItems: T[]) => void;
 }
-export declare function useOrder<T>(initialItems: T[]): UseOrderReturn<T>;
+export declare function useOrder<T>(initialItems?: T[]): UseOrderReturn<T>;
 export interface UsePaginationReturn<T> {
 	pageItems: T[];
 	pageSize: number;
@@ -178,7 +178,7 @@ export interface UsePaginationReturn<T> {
 	resetPageSize: () => void;
 	resetPagination: () => void;
 }
-export declare function usePagination<T>(data: T[], initialPageSize: number, initialPageIndex?: number): UsePaginationReturn<T>;
+export declare function usePagination<T>(data: T[] | undefined, initialPageSize: number, initialPageIndex?: number): UsePaginationReturn<T>;
 type SelectionId$1 = string | number;
 export interface UseSingleSelectionReturn {
 	selectedId: SelectionId$1 | undefined;
@@ -230,6 +230,6 @@ export interface UseSortReturn<T> {
 	getNextSortingOrder: (id: string) => "asc" | "desc" | "none";
 	getSortIndex: (id: string) => number | undefined;
 }
-export declare function useSort<T>(data: T[], initialSorts?: SortState): UseSortReturn<T>;
+export declare function useSort<T>(data?: T[], initialSorts?: SortState): UseSortReturn<T>;
 
 export {};

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>;

package/dist/ui2.js

@@ -4,22 +4,22 @@ import { Fragment as c, jsx as l } from "react/jsx-runtime";
 import { createPortal as u } from "react-dom";
 //#region src/ui/FuzzyHighlighter/FuzzyHighlighter.tsx
 function d({ text: e, query: t, className: n = "", caseSensitive: r = !1 }) {
-	let i = t.trim();
-	if (!i || !e) return /* @__PURE__ */ l(c, { children: e });
-	let a = i.split(/\s+/).filter((e) => e.length > 0);
-	if (a.length === 0) return /* @__PURE__ */ l(c, { children: e });
-	let o = `fuzzy-highlight ${n}`.trim(), s = [...a].sort((e, t) => t.length - e.length).map((e) => e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&")), u = [...s];
-	if (s.length > 1) {
-		let e = a.map((e) => e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&")).join("\\s+");
-		u.unshift(e);
+	let i = String(t || "").trim(), a = String(e || "");
+	if (!i || !a) return /* @__PURE__ */ l(c, { children: a });
+	let o = i.split(/\s+/).filter((e) => e.length > 0);
+	if (o.length === 0) return /* @__PURE__ */ l(c, { children: a });
+	let s = `fuzzy-highlight ${n}`.trim(), u = [...o].sort((e, t) => t.length - e.length).map((e) => e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&")), d = [...u];
+	if (u.length > 1) {
+		let e = o.map((e) => e.replace(/[.*+?^${}()|[\]\\]/g, "\\$&")).join("\\s+");
+		d.unshift(e);
 	}
 	if (i.length > 1 && i === i.toUpperCase() && /^[A-Z]+$/.test(i)) {
 		let e = i.split("").map((e) => `\\b${e}`).join("[^a-z0-9]*");
-		u.unshift(e);
+		d.unshift(e);
 	}
-	let d = `(${u.join("|")})`, f = new RegExp(d, r ? "g" : "gi");
-	return /* @__PURE__ */ l(c, { children: e.split(f).map((e, t) => f.test(e) ? /* @__PURE__ */ l("strong", {
-		className: o,
+	let f = `(${d.join("|")})`, p = new RegExp(f, r ? "g" : "gi");
+	return /* @__PURE__ */ l(c, { children: a.split(p).map((e, t) => p.test(e) ? /* @__PURE__ */ l("strong", {
+		className: s,
 		children: e
 	}, t) : e) });
 }
@@ -80,207 +80,207 @@ function _({ modalId: e, children: t, wrapperClassName: n = "", wrapperStyle: r,
 }
 //#endregion
 //#region src/ui/useExpansion/useExpansion.ts
-function v({ items: t = [], field: r, initialExpandedIds: i = [], multiple: c = !1 } = {}) {
-	let l = o(i), [u, d] = s(() => new Set(i)), f = n((t) => {
-		let n = e(t, r);
-		return u.has(n);
-	}, [u, r]), p = n((t) => {
-		d((n) => {
-			let i = e(t, r);
-			if (n.has(i)) return n;
-			let a = c ? new Set(n) : /* @__PURE__ */ new Set();
-			return a.add(i), a;
+function v(t = {}) {
+	let r = t || {}, i = a(() => Array.isArray(r.items) ? r.items : [], [r.items]), c = Array.isArray(r.initialExpandedIds) ? r.initialExpandedIds : [], l = r.field, u = !!r.multiple, d = o(c), [f, p] = s(() => new Set(c)), m = n((t) => {
+		let n = e(t, l);
+		return f.has(n);
+	}, [f, l]), h = n((t) => {
+		p((n) => {
+			let r = e(t, l);
+			if (n.has(r)) return n;
+			let i = u ? new Set(n) : /* @__PURE__ */ new Set();
+			return i.add(r), i;
 		});
-	}, [r, c]), m = n((t) => {
-		d((n) => {
-			let i = e(t, r);
-			if (!n.has(i)) return n;
-			let a = new Set(n);
-			return a.delete(i), a;
+	}, [l, u]), g = n((t) => {
+		p((n) => {
+			let r = e(t, l);
+			if (!n.has(r)) return n;
+			let i = new Set(n);
+			return i.delete(r), i;
 		});
-	}, [r]), h = n((t) => {
-		d((n) => {
-			let i = e(t, r), a = c ? new Set(n) : /* @__PURE__ */ new Set();
-			return n.has(i) ? c && a.delete(i) : a.add(i), a;
+	}, [l]), _ = n((t) => {
+		p((n) => {
+			let r = e(t, l), i = u ? new Set(n) : /* @__PURE__ */ new Set();
+			return n.has(r) ? u && i.delete(r) : i.add(r), i;
 		});
-	}, [r, c]), g = n(() => {
-		if (!c) return;
-		let n = t.map((t) => e(t, r));
-		d(new Set(n));
+	}, [l, u]), v = n(() => {
+		if (!u) return;
+		let t = (Array.isArray(i) ? i : []).map((t) => e(t, l));
+		p(new Set(t));
 	}, [
-		t,
-		r,
-		c
-	]), _ = n(() => {
-		d(/* @__PURE__ */ new Set());
-	}, []), v = n(() => {
-		d(new Set(l.current));
-	}, []), y = n((t) => {
-		let n = t.map((t) => e(t, r));
-		d(new Set(n));
-	}, [r]), b = a(() => t.filter((t) => u.has(e(t, r))), [
-		t,
-		r,
+		i,
+		l,
 		u
+	]), y = n(() => {
+		p(/* @__PURE__ */ new Set());
+	}, []), b = n(() => {
+		p(new Set(d.current));
+	}, []), x = n((t) => {
+		let n = (Array.isArray(t) ? t : []).map((t) => e(t, l));
+		p(new Set(n));
+	}, [l]), S = a(() => (Array.isArray(i) ? i : []).filter((t) => f.has(e(t, l))), [
+		i,
+		l,
+		f
 	]);
 	return {
-		expandedIds: [...u],
-		expandedItems: b,
-		isExpanded: f,
-		expand: p,
-		collapse: m,
-		toggle: h,
-		expandAll: g,
-		collapseAll: _,
-		resetExpansion: v,
-		replaceExpansion: y
+		expandedIds: [...f],
+		expandedItems: S,
+		isExpanded: m,
+		expand: h,
+		collapse: g,
+		toggle: _,
+		expandAll: v,
+		collapseAll: y,
+		resetExpansion: b,
+		replaceExpansion: x
 	};
 }
 //#endregion
 //#region src/ui/usePin/usePin.ts
-function y({ items: t, field: r, initialPinnedIds: i = [], maxPins: c = 2 ** 53 - 1 }) {
-	let l = o(i), [u, d] = s(() => new Set(i)), f = n((t) => {
-		d((n) => {
-			if (n.size >= c) return n;
-			let i = new Set(n), a = e(t, r);
-			return i.add(a), i;
+function y(t = {}) {
+	let r = t || {}, i = a(() => Array.isArray(r.items) ? r.items : [], [r.items]), c = Array.isArray(r.initialPinnedIds) ? r.initialPinnedIds : [], l = r.field, u = typeof r.maxPins == "number" && !isNaN(r.maxPins) ? Math.max(1, r.maxPins) : 2 ** 53 - 1, d = o(c), [f, p] = s(() => new Set(c)), m = n((t) => {
+		p((n) => {
+			if (n.size >= u) return n;
+			let r = new Set(n), i = e(t, l);
+			return r.add(i), r;
 		});
-	}, [r, c]), p = n((t) => {
-		d((n) => {
-			let i = new Set(n), a = e(t, r);
-			return i.delete(a), i;
+	}, [l, u]), h = n((t) => {
+		p((n) => {
+			let r = new Set(n), i = e(t, l);
+			return r.delete(i), r;
 		});
-	}, [r]), m = n((t) => {
-		d((n) => {
-			let i = new Set(n), a = e(t, r);
-			if (i.has(a)) i.delete(a);
+	}, [l]), g = n((t) => {
+		p((n) => {
+			let r = new Set(n), i = e(t, l);
+			if (r.has(i)) r.delete(i);
 			else {
-				if (i.size >= c) return n;
-				i.add(a);
+				if (r.size >= u) return n;
+				r.add(i);
 			}
-			return i;
+			return r;
 		});
-	}, [r, c]), h = n((t) => {
-		let n = e(t, r);
-		return u.has(n);
-	}, [u, r]), g = n(() => d(/* @__PURE__ */ new Set()), []), _ = n(() => d(new Set(l.current)), [l]), v = n((t) => {
-		let n = t.map((t) => e(t, r));
-		d(new Set(n.slice(0, c)));
-	}, [r, c]), y = n((t) => {
-		d((n) => {
-			let i = new Set(n), a = t.map((t) => e(t, r));
-			for (let e of a) {
-				if (i.size >= c && !i.has(e)) break;
-				i.add(e);
+	}, [l, u]), _ = n((t) => {
+		let n = e(t, l);
+		return f.has(n);
+	}, [f, l]), v = n(() => p(/* @__PURE__ */ new Set()), []), y = n(() => p(new Set(d.current)), [d]), b = n((t) => {
+		let n = (Array.isArray(t) ? t : []).map((t) => e(t, l));
+		p(new Set(n.slice(0, u)));
+	}, [l, u]), x = n((t) => {
+		p((n) => {
+			let r = new Set(n), i = (Array.isArray(t) ? t : []).map((t) => e(t, l));
+			for (let e of i) {
+				if (r.size >= u && !r.has(e)) break;
+				r.add(e);
 			}
-			return i;
+			return r;
 		});
-	}, [r, c]), b = n((t) => {
-		d((n) => {
-			let i = new Set(n);
-			return t.map((t) => e(t, r)).forEach((e) => i.delete(e)), i;
+	}, [l, u]), S = n((t) => {
+		p((n) => {
+			let r = new Set(n);
+			return (Array.isArray(t) ? t : []).map((t) => e(t, l)).forEach((e) => r.delete(e)), r;
 		});
-	}, [r]), x = a(() => t.filter((t) => {
-		let n = e(t, r);
-		return u.has(n);
+	}, [l]), C = a(() => (Array.isArray(i) ? i : []).filter((t) => {
+		let n = e(t, l);
+		return f.has(n);
 	}), [
-		t,
-		r,
-		u
-	]), S = a(() => t.filter((t) => {
-		let n = e(t, r);
-		return !u.has(n);
+		i,
+		l,
+		f
+	]), w = a(() => (Array.isArray(i) ? i : []).filter((t) => {
+		let n = e(t, l);
+		return !f.has(n);
 	}), [
-		t,
-		r,
-		u
+		i,
+		l,
+		f
 	]);
 	return {
-		pinnedIds: [...u],
-		pinnedItems: x,
-		unpinnedItems: S,
-		pinnedCount: u.size,
-		hasPins: u.size > 0,
-		isAtMaxLimit: u.size >= c,
-		pin: f,
-		unpin: p,
-		togglePin: m,
-		isPinned: h,
-		clearPins: g,
-		resetPins: _,
-		replacePins: v,
-		pinMultiple: y,
-		unpinMultiple: b
+		pinnedIds: [...f],
+		pinnedItems: C,
+		unpinnedItems: w,
+		pinnedCount: f.size,
+		hasPins: f.size > 0,
+		isAtMaxLimit: f.size >= u,
+		pin: m,
+		unpin: h,
+		togglePin: g,
+		isPinned: _,
+		clearPins: v,
+		resetPins: y,
+		replacePins: b,
+		pinMultiple: x,
+		unpinMultiple: S
 	};
 }
 //#endregion
 //#region src/ui/useVisibility/useVisibility.ts
-function b({ items: t, field: r, initialVisibleIds: i = [] }) {
-	let c = o(i), [l, u] = s(() => new Set(i)), d = n((t) => {
-		let n = e(t, r);
-		return l.has(n);
-	}, [l, r]), f = n((t) => {
-		u((n) => {
-			let i = new Set(n), a = e(t, r);
-			return i.add(a), i;
+function b(t = {}) {
+	let r = t || {}, i = a(() => Array.isArray(r.items) ? r.items : [], [r.items]), c = Array.isArray(r.initialVisibleIds) ? r.initialVisibleIds : [], l = r.field, u = o(c), [d, f] = s(() => new Set(c)), p = n((t) => {
+		let n = e(t, l);
+		return d.has(n);
+	}, [d, l]), m = n((t) => {
+		f((n) => {
+			let r = new Set(n), i = e(t, l);
+			return r.add(i), r;
 		});
-	}, [r]), p = n((t) => {
-		u((n) => {
-			let i = new Set(n), a = e(t, r);
-			return i.delete(a), i;
+	}, [l]), h = n((t) => {
+		f((n) => {
+			let r = new Set(n), i = e(t, l);
+			return r.delete(i), r;
 		});
-	}, [r]), m = n((t) => {
-		u((n) => {
-			let i = new Set(n), a = e(t, r);
-			return i.has(a) ? i.delete(a) : i.add(a), i;
+	}, [l]), g = n((t) => {
+		f((n) => {
+			let r = new Set(n), i = e(t, l);
+			return r.has(i) ? r.delete(i) : r.add(i), r;
 		});
-	}, [r]), h = n((n) => {
-		u((i) => {
-			let a = new Set(i);
-			return (n ?? t).forEach((t) => {
-				a.add(e(t, r));
-			}), a;
+	}, [l]), _ = n((t) => {
+		f((n) => {
+			let r = new Set(n);
+			return (Array.isArray(t) ? t : Array.isArray(i) ? i : []).forEach((t) => {
+				r.add(e(t, l));
+			}), r;
 		});
-	}, [t, r]), g = n((n) => {
-		u((i) => {
-			let a = new Set(i);
-			return (n ?? t).forEach((t) => {
-				a.delete(e(t, r));
-			}), a;
+	}, [i, l]), v = n((t) => {
+		f((n) => {
+			let r = new Set(n);
+			return (Array.isArray(t) ? t : Array.isArray(i) ? i : []).forEach((t) => {
+				r.delete(e(t, l));
+			}), r;
 		});
-	}, [t, r]), _ = n(() => {
-		u(() => new Set(c.current));
-	}, []), v = n((t) => {
-		let n = t.map((t) => e(t, r));
-		u(() => new Set(n));
-	}, [r]), y = a(() => t.filter((t) => {
-		let n = e(t, r);
-		return l.has(n);
+	}, [i, l]), y = n(() => {
+		f(() => new Set(u.current));
+	}, []), b = n((t) => {
+		let n = (Array.isArray(t) ? t : []).map((t) => e(t, l));
+		f(() => new Set(n));
+	}, [l]), x = a(() => (Array.isArray(i) ? i : []).filter((t) => {
+		let n = e(t, l);
+		return d.has(n);
 	}), [
-		t,
-		r,
-		l
-	]), b = a(() => t.filter((t) => {
-		let n = e(t, r);
-		return !l.has(n);
+		i,
+		l,
+		d
+	]), S = a(() => (Array.isArray(i) ? i : []).filter((t) => {
+		let n = e(t, l);
+		return !d.has(n);
 	}), [
-		t,
-		r,
-		l
+		i,
+		l,
+		d
 	]);
 	return {
-		visibleIds: [...l],
-		visibleItems: y,
-		hiddenItems: b,
-		visibleCount: l.size,
-		isVisible: d,
-		show: f,
-		hide: p,
-		toggleVisibility: m,
-		showAll: h,
-		hideAll: g,
-		replaceVisibility: v,
-		resetVisibility: _
+		visibleIds: [...d],
+		visibleItems: x,
+		hiddenItems: S,
+		visibleCount: d.size,
+		isVisible: p,
+		show: m,
+		hide: h,
+		toggleVisibility: g,
+		showAll: _,
+		hideAll: v,
+		replaceVisibility: b,
+		resetVisibility: y
 	};
 }
 //#endregion

package/package.json

@@ -1,6 +1,6 @@
 {
 	"name": "@himanshu-sorathiya/react-kit",
-	"version": "1.0.20",
+	"version": "1.0.21",
 	"description": "An opinionated collection of react hooks, and reusable UI components.",
 	"type": "module",
 	"module": "./dist/index.js",