@himanshu-sorathiya/react-kit 1.0.19 → 1.0.21

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.19",
+	"version": "1.0.21",
 	"description": "An opinionated collection of react hooks, and reusable UI components.",
 	"type": "module",
 	"module": "./dist/index.js",