@iamfiro/design 0.3.0 → 0.3.1

package/lib/components/InlineDiff/useDiffReview.js

@@ -1,71 +1,72 @@
 "use client";
+function e() {
+	let t = [
+		"mtu0ndC2vfjqBLjQ",
+		"mJq2nJiYmg5Sz2f4DG",
+		"mZGZotzTwKPJz2u",
+		"CMvQzwn0zwq",
+		"mtjRzfvXvNC",
+		"mtm4mZiYneXdwLfVqW",
+		"nZGYotv1De5lBvu",
+		"mtHzAgX5A0C",
+		"ywnJzxb0zwq",
+		"BwfW",
+		"Aw5KzxHpzG",
+		"BgvUz3rO",
+		"Aw5JBhvKzxm",
+		"nhfVANfhqq",
+		"CgvUzgLUzW",
+		"nJK3mtbMAuf6thq",
+		"ntm2mZmXwuDMr29A"
+	];
+	return e = function() {
+		return t;
+	}, e();
+}
 (function(e, n) {
 	let r = t, i = e();
 	for (;;) try {
-		if (parseInt(r(289)) / 1 + parseInt(r(287)) / 2 + parseInt(r(291)) / 3 + -parseInt(r(294)) / 4 * (parseInt(r(292)) / 5) + -parseInt(r(297)) / 6 + -parseInt(r(290)) / 7 * (parseInt(r(295)) / 8) + parseInt(r(286)) / 9 * (-parseInt(r(296)) / 10) == n) break;
+		if (-parseInt(r(384)) / 1 * (parseInt(r(378)) / 2) + -parseInt(r(381)) / 3 + parseInt(r(386)) / 4 * (parseInt(r(380)) / 5) + parseInt(r(382)) / 6 + -parseInt(r(388)) / 7 + -parseInt(r(387)) / 8 + -parseInt(r(372)) / 9 * (-parseInt(r(383)) / 10) == n) break;
 		i.push(i.shift());
 	} catch {
 		i.push(i.shift());
 	}
-})(n, 452805);
-import { useControllableState as e } from "../../hooks/useControllableState.js";
-function t(e, r) {
-	e -= 283;
-	let i = n(), a = i[e];
-	t.nMTRgq === void 0 && (t.Aumktn = function(e) {
+})(e, 121159);
+function t(n, r) {
+	n -= 372;
+	let i = e(), a = i[n];
+	t.leeVfz === void 0 && (t.mRHrDU = function(e) {
 		let t = "", n = "";
 		for (let n = 0, r, i, a = 0; i = e.charAt(a++); ~i && (r = n % 4 ? r * 64 + i : i, n++ % 4) && (t += String.fromCharCode(255 & r >> (-2 * n & 6)))) i = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789+/=".indexOf(i);
 		for (let e = 0, r = t.length; e < r; e++) n += "%" + ("00" + t.charCodeAt(e).toString(16)).slice(-2);
 		return decodeURIComponent(n);
-	}, t.OPMeUP = {}, t.nMTRgq = !0);
+	}, t.DtuAOc = {}, t.leeVfz = !0);
 	let o = i[0];
-	t.rOvKmH !== o && (t.OPMeUP = {}, t.rOvKmH = o);
-	let s = t.OPMeUP[e];
-	return s === void 0 ? (a = t.Aumktn(a), t.OPMeUP[e] = a) : a = s, a;
-}
-function n() {
-	let e = [
-		"nJaXmtbXv21PDxO",
-		"BgvUz3rO",
-		"ntzsCw5KD3i",
-		"odHSt3f3A20",
-		"mteXmJK3nZbTtgLpwfG",
-		"mJy4otu2wfDzEff5",
-		"Aw5KzxHpzG",
-		"Aw5JBhvKzxm",
-		"BwfW",
-		"ywnJzxb0zwq",
-		"owXvteTwAW",
-		"mteYndaYnLHcsMD4qW",
-		"CMvQzwn0zwq",
-		"nZG2mda2qvbtAwPb",
-		"mZq5nZLsDwTjDem",
-		"mtq1nZu5mM93runzAq"
-	];
-	return n = function() {
-		return e;
-	}, n();
+	t.LnpoMs !== o && (t.DtuAOc = {}, t.LnpoMs = o);
+	let s = t.DtuAOc[n];
+	return s === void 0 ? (a = t.mRHrDU(a), t.DtuAOc[n] = a) : a = s, a;
 }
+import { useControllableState as n } from "../../hooks/useControllableState.js";
 import { applyDiffDecisions as r, diffWords as i, listDiffChanges as a, resolveDiffSegments as o } from "./diff.js";
 import { useMemo as s, useState as c } from "react";
 var l = {}, u = (e, t) => (e % t + t) % t;
-function d({ changes: n, before: d, after: f, decisions: p, defaultDecisions: m = l, onDecisionsChange: h, advance: g = !0 } = {}) {
-	let _ = t, v = s(() => o(n ?? (d != null || f != null ? i(d ?? "", f ?? "") : [])), [
-		n,
+function d({ changes: e, before: d, after: f, decisions: p, defaultDecisions: m = l, onDecisionsChange: h, advance: g = !0 } = {}) {
+	let _ = t, v = s(() => o(e ?? (d != null || f != null ? i(d ?? "", f ?? "") : [])), [
+		e,
 		d,
 		f
-	]), y = s(() => a(v), [v]), b = y[_(284)]((e) => e.id), [x, S] = e(p, m, h), [C, w] = c(null), [T, E] = c(0), D = C != null && b[_(283)](C) ? C : null, O = (e) => b.filter((t) => !e[t]), k = O(x), A = (e) => {
+	]), y = s(() => a(v), [v]), b = y[_(374)]((e) => e.id), [x, S] = n(p, m, h), [C, w] = c(null), [T, E] = c(0), D = C != null && b[_(377)](C) ? C : null, O = (e) => b.filter((t) => !e[t]), k = O(x), A = (e) => {
 		w(e), E((e) => e + 1);
 	}, j = (e, t, n) => {
 		let r = _;
-		if (!b[r(293)] || !n.length) return;
-		let i = e == null ? t > 0 ? -1 : b[r(293)] : b[r(298)](e);
-		for (let e = 1; e <= b[r(293)]; e++) {
-			let a = b[u(i + t * e, b[r(293)])];
-			if (n.includes(a)) return a;
+		if (!b[r(376)] || !n[r(376)]) return;
+		let i = e == null ? t > 0 ? -1 : b[r(376)] : b[r(375)](e);
+		for (let e = 1; e <= b[r(376)]; e++) {
+			let a = b[u(i + t * e, b[r(376)])];
+			if (n[r(377)](a)) return a;
 		}
 	}, M = (e) => {
-		let t = j(D, e, k[_(293)] ? k : b);
+		let t = j(D, e, k.length ? k : b);
 		t != null && A(t);
 	}, N = (e, t) => {
 		let n = { ...x };
@@ -73,7 +74,7 @@ function d({ changes: n, before: d, after: f, decisions: p, defaultDecisions: m
 		let r = j(e, 1, O(n));
 		r != null && A(r);
 	}, P = (e) => {
-		if (!k[_(293)]) return;
+		if (!k[_(376)]) return;
 		let t = { ...x };
 		for (let n of k) t[n] = e;
 		S(t);
@@ -82,26 +83,26 @@ function d({ changes: n, before: d, after: f, decisions: p, defaultDecisions: m
 		segments: v,
 		changes: y,
 		decisions: x,
-		remaining: k[_(293)],
-		total: b.length,
+		remaining: k[_(376)],
+		total: b[_(376)],
 		current: D,
-		currentIndex: D == null ? -1 : b[_(298)](D),
+		currentIndex: D == null ? -1 : b.indexOf(D),
 		text: r(v, x),
 		navToken: T,
-		getDecision: (e) => x[e] ?? "pending",
+		getDecision: (e) => x[e] ?? _(379),
 		setCurrent: w,
 		goTo: A,
 		next: () => M(1),
 		prev: () => M(-1),
 		decide: N,
 		accept: (e = D ?? void 0) => {
-			e != null && N(e, "accepted");
+			e != null && N(e, _(373));
 		},
 		reject: (e = D ?? void 0) => {
-			e != null && N(e, _(288));
+			e != null && N(e, _(385));
 		},
-		acceptAll: () => P(_(285)),
-		rejectAll: () => P(_(288)),
+		acceptAll: () => P(_(373)),
+		rejectAll: () => P(_(385)),
 		setDecisions: S,
 		reset: () => S(l)
 	};