@vestcards/shared 1.3.0 → 1.5.0

package/dist/spaced-repetition.js

@@ -1,7 +1,20 @@
-import { t as e } from "./date-DS8JYZte.js";
+import { t as e } from "./date-D5P-dKAx.js";
 import { i as t, n, r } from "./fsrs-D2XsH28s.js";
 //#region src/spaced-repetition/config.ts
-var i = .9, a = 50, o = 200, s = 10, c = 10, l = ((e) => (e[e.New = 0] = "New", e[e.Learning = 1] = "Learning", e[e.Review = 2] = "Review", e[e.Relearning = 3] = "Relearning", e))(l || {}), u = ((e) => (e[e.Manual = 0] = "Manual", e[e.Again = 1] = "Again", e[e.Hard = 2] = "Hard", e[e.Good = 3] = "Good", e[e.Easy = 4] = "Easy", e))(u || {}), d = class e {
+var i = .9, a = .1542, o = i ** (-1 / a) - 1, s = 50, c = {
+	learnDailyLimit: {
+		recommended: 200,
+		min: 100,
+		max: 500,
+		step: 50
+	},
+	newCardsPerDeckDailyLimit: {
+		recommended: 10,
+		min: 1,
+		max: 50,
+		step: 5
+	}
+}, l = 10, u = (e, t) => e === c.learnDailyLimit.recommended && t === c.newCardsPerDeckDailyLimit.recommended, d = ((e) => (e[e.New = 0] = "New", e[e.Learning = 1] = "Learning", e[e.Review = 2] = "Review", e[e.Relearning = 3] = "Relearning", e))(d || {}), f = ((e) => (e[e.Manual = 0] = "Manual", e[e.Again = 1] = "Again", e[e.Hard = 2] = "Hard", e[e.Good = 3] = "Good", e[e.Easy = 4] = "Easy", e))(f || {}), p = class e {
 	static card(t) {
 		return {
 			...t,
@@ -12,7 +25,7 @@ var i = .9, a = 50, o = 200, s = 10, c = 10, l = ((e) => (e[e.New = 0] = "New",
 	}
 	static rating(e) {
 		if (typeof e == "string") {
-			let t = u[`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()}`];
+			let t = f[`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()}`];
 			if (t === void 0) throw Error(`Invalid rating:[${e}]`);
 			return t;
 		} else if (typeof e == "number") return e;
@@ -20,7 +33,7 @@ var i = .9, a = 50, o = 200, s = 10, c = 10, l = ((e) => (e[e.New = 0] = "New",
 	}
 	static state(e) {
 		if (typeof e == "string") {
-			let t = l[`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()}`];
+			let t = d[`${e.charAt(0).toUpperCase()}${e.slice(1).toLowerCase()}`];
 			if (t === void 0) throw Error(`Invalid state:[${e}]`);
 			return t;
 		} else if (typeof e == "number") return e;
@@ -44,22 +57,22 @@ var i = .9, a = 50, o = 200, s = 10, c = 10, l = ((e) => (e[e.New = 0] = "New",
 			review: e.time(t.review)
 		};
 	}
-}, f = "4.7.1";
+}, m = "4.7.1";
 Date.prototype.scheduler = function(e, t) {
-	return p(this, e, t);
+	return ee(this, e, t);
 }, Date.prototype.diff = function(e, t) {
-	return m(this, e, t);
+	return te(this, e, t);
 }, Date.prototype.format = function() {
-	return ee(this);
+	return ne(this);
 }, Date.prototype.dueFormat = function(e, t, n) {
-	return te(this, e, t, n);
+	return re(this, e, t, n);
 };
-function p(e, t, n) {
-	return new Date(n ? d.time(e).getTime() + t * 24 * 60 * 60 * 1e3 : d.time(e).getTime() + t * 60 * 1e3);
+function ee(e, t, n) {
+	return new Date(n ? p.time(e).getTime() + t * 24 * 60 * 60 * 1e3 : p.time(e).getTime() + t * 60 * 1e3);
 }
-function m(e, t, n) {
+function te(e, t, n) {
 	if (!e || !t) throw Error("Invalid date");
-	let r = d.time(e).getTime() - d.time(t).getTime(), i = 0;
+	let r = p.time(e).getTime() - p.time(t).getTime(), i = 0;
 	switch (n) {
 		case "days":
 			i = Math.floor(r / (1440 * 60 * 1e3));
@@ -70,8 +83,8 @@ function m(e, t, n) {
 	}
 	return i;
 }
-function ee(e) {
-	let t = d.time(e), n = t.getFullYear(), r = t.getMonth() + 1, i = t.getDate(), a = t.getHours(), o = t.getMinutes(), s = t.getSeconds();
+function ne(e) {
+	let t = p.time(e), n = t.getFullYear(), r = t.getMonth() + 1, i = t.getDate(), a = t.getHours(), o = t.getMinutes(), s = t.getSeconds();
 	return `${n}-${h(r)}-${h(i)} ${h(a)}:${h(o)}:${h(s)}`;
 }
 function h(e) {
@@ -91,18 +104,18 @@ var g = [
 	"month",
 	"year"
 ];
-function te(e, t, n, r = _) {
-	e = d.time(e), t = d.time(t), r.length !== _.length && (r = _);
+function re(e, t, n, r = _) {
+	e = p.time(e), t = p.time(t), r.length !== _.length && (r = _);
 	let i = e.getTime() - t.getTime(), a;
 	for (i /= 1e3, a = 0; a < g.length && !(i < g[a]); a++) i /= g[a];
 	return `${Math.floor(i)}${n ? r[a] : ""}`;
 }
-var ne = Object.freeze([
-	u.Again,
-	u.Hard,
-	u.Good,
-	u.Easy
-]), re = [
+var ie = Object.freeze([
+	f.Again,
+	f.Hard,
+	f.Good,
+	f.Easy
+]), ae = [
 	{
 		start: 2.5,
 		end: 7,
@@ -119,9 +132,9 @@ var ne = Object.freeze([
 		factor: .05
 	}
 ];
-function ie(e, t, n) {
+function oe(e, t, n) {
 	let r = 1;
-	for (let t of re) r += t.factor * Math.max(Math.min(e, t.end) - t.start, 0);
+	for (let t of ae) r += t.factor * Math.max(Math.min(e, t.end) - t.start, 0);
 	e = Math.min(e, n);
 	let i = Math.max(2, Math.round(e - r)), a = Math.min(Math.round(e + r), n);
 	return e > t && (i = Math.max(i, t + 1)), i = Math.min(i, a), {
@@ -132,11 +145,11 @@ function ie(e, t, n) {
 function v(e, t, n) {
 	return Math.min(Math.max(e, t), n);
 }
-function ae(e, t) {
+function se(e, t) {
 	let n = Date.UTC(e.getUTCFullYear(), e.getUTCMonth(), e.getUTCDate()), r = Date.UTC(t.getUTCFullYear(), t.getUTCMonth(), t.getUTCDate());
 	return Math.floor((r - n) / 864e5);
 }
-var oe = Object.freeze([
+var ce = Object.freeze([
 	.40255,
 	1.18385,
 	3.173,
@@ -157,8 +170,8 @@ var oe = Object.freeze([
 	.51655,
 	.6621
 ]);
-`${f}`;
-var y = .01, se = Object.freeze([
+`${m}`;
+var y = .01, le = Object.freeze([
 	Object.freeze([y, 100]),
 	Object.freeze([y, 100]),
 	Object.freeze([y, 100]),
@@ -179,8 +192,8 @@ var y = .01, se = Object.freeze([
 	Object.freeze([0, 2]),
 	Object.freeze([0, 2])
 ]), b = (e) => {
-	let t = [...oe];
-	return e?.w && (e.w.length === 19 ? t = [...e.w] : e.w.length === 17 && (t = e?.w.concat([0, 0]), t[4] = +(t[5] * 2 + t[4]).toFixed(8), t[5] = +(Math.log(t[5] * 3 + 1) / 3).toFixed(8), t[6] = +(t[6] + .5).toFixed(8), console.debug("[FSRS V5]auto fill w to 19 length"))), t = t.map((e, t) => v(e, se[t][0], se[t][1])), {
+	let t = [...ce];
+	return e?.w && (e.w.length === 19 ? t = [...e.w] : e.w.length === 17 && (t = e?.w.concat([0, 0]), t[4] = +(t[5] * 2 + t[4]).toFixed(8), t[5] = +(Math.log(t[5] * 3 + 1) / 3).toFixed(8), t[6] = +(t[6] + .5).toFixed(8), console.debug("[FSRS V5]auto fill w to 19 length"))), t = t.map((e, t) => v(e, le[t][0], le[t][1])), {
 		request_retention: e?.request_retention || .9,
 		maximum_interval: e?.maximum_interval || 36500,
 		w: t,
@@ -190,25 +203,25 @@ var y = .01, se = Object.freeze([
 };
 function x(e, t) {
 	let n = {
-		due: e ? d.time(e) : /* @__PURE__ */ new Date(),
+		due: e ? p.time(e) : /* @__PURE__ */ new Date(),
 		stability: 0,
 		difficulty: 0,
 		elapsed_days: 0,
 		scheduled_days: 0,
 		reps: 0,
 		lapses: 0,
-		state: l.New,
+		state: d.New,
 		last_review: void 0
 	};
 	return t && typeof t == "function" ? t(n) : n;
 }
-var ce = class {
+var ue = class {
 	c;
 	s0;
 	s1;
 	s2;
 	constructor(e) {
-		let t = le();
+		let t = de();
 		this.c = 1, this.s0 = t(" "), this.s1 = t(" "), this.s2 = t(" "), e ??= +/* @__PURE__ */ new Date(), this.s0 -= t(e), this.s0 < 0 && (this.s0 += 1), this.s1 -= t(e), this.s1 < 0 && (this.s1 += 1), this.s2 -= t(e), this.s2 < 0 && (this.s2 += 1);
 	}
 	next() {
@@ -227,7 +240,7 @@ var ce = class {
 		};
 	}
 };
-function le() {
+function de() {
 	let e = 4022871197;
 	return function(t) {
 		t = String(t);
@@ -239,15 +252,15 @@ function le() {
 		return (e >>> 0) * 23283064365386963e-26;
 	};
 }
-function ue(e) {
-	let t = new ce(e), n = () => t.next();
+function fe(e) {
+	let t = new ue(e), n = () => t.next();
 	return n.int32 = () => t.next() * 4294967296 | 0, n.double = () => n() + (n() * 2097152 | 0) * 11102230246251565e-32, n.state = () => t.state, n.importState = (e) => (t.state = e, n), n;
 }
-var de = -.5, fe = 19 / 81;
-function pe(e, t) {
-	return +((1 + fe * e / t) ** +de).toFixed(8);
+var pe = -.5, me = 19 / 81;
+function he(e, t) {
+	return +((1 + me * e / t) ** +pe).toFixed(8);
 }
-var me = class {
+var ge = class {
 	param;
 	intervalModifier;
 	_seed;
@@ -262,7 +275,7 @@ var me = class {
 	}
 	calculate_interval_modifier(e) {
 		if (e <= 0 || e > 1) throw Error("Requested retention rate should be in the range (0,1]");
-		return +((e ** (1 / de) - 1) / fe).toFixed(8);
+		return +((e ** (1 / pe) - 1) / me).toFixed(8);
 	}
 	get parameters() {
 		return this.param;
@@ -291,7 +304,7 @@ var me = class {
 	}
 	apply_fuzz(e, t) {
 		if (!this.param.enable_fuzz || e < 2.5) return Math.round(e);
-		let n = ue(this._seed)(), { min_ivl: r, max_ivl: i } = ie(e, t, this.param.maximum_interval);
+		let n = fe(this._seed)(), { min_ivl: r, max_ivl: i } = oe(e, t, this.param.maximum_interval);
 		return Math.floor(n * (i - r + 1) + r);
 	}
 	next_interval(e, t) {
@@ -303,7 +316,7 @@ var me = class {
 	}
 	next_difficulty(e, t) {
 		let n = -this.param.w[6] * (t - 3), r = e + this.linear_damping(n, e);
-		return this.constrain_difficulty(this.mean_reversion(this.init_difficulty(u.Easy), r));
+		return this.constrain_difficulty(this.mean_reversion(this.init_difficulty(f.Easy), r));
 	}
 	constrain_difficulty(e) {
 		return Math.min(Math.max(+e.toFixed(8), 1), 10);
@@ -312,7 +325,7 @@ var me = class {
 		return +(this.param.w[7] * e + (1 - this.param.w[7]) * t).toFixed(8);
 	}
 	next_recall_stability(e, t, n, r) {
-		let i = u.Hard === r ? this.param.w[15] : 1, a = u.Easy === r ? this.param.w[16] : 1;
+		let i = f.Hard === r ? this.param.w[15] : 1, a = f.Easy === r ? this.param.w[16] : 1;
 		return +v(t * (1 + Math.exp(this.param.w[8]) * (11 - e) * t ** +-this.param.w[9] * (Math.exp((1 - n) * this.param.w[10]) - 1) * i * a), y, 36500).toFixed(8);
 	}
 	next_forget_stability(e, t, n) {
@@ -321,7 +334,7 @@ var me = class {
 	next_short_term_stability(e, t) {
 		return +v(e * Math.exp(this.param.w[17] * (t - 3 + this.param.w[18])), y, 36500).toFixed(8);
 	}
-	forgetting_curve = pe;
+	forgetting_curve = he;
 	next_state(e, t, n) {
 		let { difficulty: r, stability: i } = e ?? {
 			difficulty: 0,
@@ -349,46 +362,46 @@ var me = class {
 		};
 	}
 };
-function he() {
+function _e() {
 	return `${this.review_time.getTime()}_${this.current.reps}_${this.current.difficulty * this.current.stability}`;
 }
-var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge = class {
+var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ve = class {
 	last;
 	current;
 	review_time;
 	next = /* @__PURE__ */ new Map();
 	algorithm;
 	initSeedStrategy;
-	constructor(e, t, n, r = { seed: he }) {
-		this.algorithm = n, this.initSeedStrategy = r.seed.bind(this), this.last = d.card(e), this.current = d.card(e), this.review_time = d.time(t), this.init();
+	constructor(e, t, n, r = { seed: _e }) {
+		this.algorithm = n, this.initSeedStrategy = r.seed.bind(this), this.last = p.card(e), this.current = p.card(e), this.review_time = p.time(t), this.init();
 	}
 	init() {
 		let { state: e, last_review: t } = this.current, n = 0;
-		e !== l.New && t && (n = ae(t, this.review_time)), this.current.last_review = this.review_time, this.current.elapsed_days = n, this.current.reps += 1, this.algorithm.seed = this.initSeedStrategy();
+		e !== d.New && t && (n = se(t, this.review_time)), this.current.last_review = this.review_time, this.current.elapsed_days = n, this.current.reps += 1, this.algorithm.seed = this.initSeedStrategy();
 	}
 	preview() {
 		return {
-			[u.Again]: this.review(u.Again),
-			[u.Hard]: this.review(u.Hard),
-			[u.Good]: this.review(u.Good),
-			[u.Easy]: this.review(u.Easy),
+			[f.Again]: this.review(f.Again),
+			[f.Hard]: this.review(f.Hard),
+			[f.Good]: this.review(f.Good),
+			[f.Easy]: this.review(f.Easy),
 			[Symbol.iterator]: this.previewIterator.bind(this)
 		};
 	}
 	*previewIterator() {
-		for (let e of ne) yield this.review(e);
+		for (let e of ie) yield this.review(e);
 	}
 	review(e) {
 		let { state: t } = this.last, n;
 		switch (t) {
-			case l.New:
+			case d.New:
 				n = this.newState(e);
 				break;
-			case l.Learning:
-			case l.Relearning:
+			case d.Learning:
+			case d.Relearning:
 				n = this.learningState(e);
 				break;
-			case l.Review:
+			case d.Review:
 				n = this.reviewState(e);
 				break;
 		}
@@ -409,24 +422,24 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 			review: this.review_time
 		};
 	}
-}, _e = class extends ge {
+}, ye = class extends ve {
 	newState(e) {
 		let t = this.next.get(e);
 		if (t) return t;
-		let n = d.card(this.current);
+		let n = p.card(this.current);
 		switch (n.difficulty = this.algorithm.init_difficulty(e), n.stability = this.algorithm.init_stability(e), e) {
-			case u.Again:
-				n.scheduled_days = 0, n.due = this.review_time.scheduler(1), n.state = l.Learning;
+			case f.Again:
+				n.scheduled_days = 0, n.due = this.review_time.scheduler(1), n.state = d.Learning;
 				break;
-			case u.Hard:
-				n.scheduled_days = 0, n.due = this.review_time.scheduler(5), n.state = l.Learning;
+			case f.Hard:
+				n.scheduled_days = 0, n.due = this.review_time.scheduler(5), n.state = d.Learning;
 				break;
-			case u.Good:
-				n.scheduled_days = 0, n.due = this.review_time.scheduler(10), n.state = l.Learning;
+			case f.Good:
+				n.scheduled_days = 0, n.due = this.review_time.scheduler(10), n.state = d.Learning;
 				break;
-			case u.Easy: {
+			case f.Easy: {
 				let e = this.algorithm.next_interval(n.stability, this.current.elapsed_days);
-				n.scheduled_days = e, n.due = this.review_time.scheduler(e, !0), n.state = l.Review;
+				n.scheduled_days = e, n.due = this.review_time.scheduler(e, !0), n.state = d.Review;
 				break;
 			}
 			default: throw Error("Invalid grade");
@@ -440,22 +453,22 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 	learningState(e) {
 		let t = this.next.get(e);
 		if (t) return t;
-		let { state: n, difficulty: r, stability: i } = this.last, a = d.card(this.current), o = this.current.elapsed_days;
+		let { state: n, difficulty: r, stability: i } = this.last, a = p.card(this.current), o = this.current.elapsed_days;
 		switch (a.difficulty = this.algorithm.next_difficulty(r, e), a.stability = this.algorithm.next_short_term_stability(i, e), e) {
-			case u.Again:
+			case f.Again:
 				a.scheduled_days = 0, a.due = this.review_time.scheduler(5, !1), a.state = n;
 				break;
-			case u.Hard:
+			case f.Hard:
 				a.scheduled_days = 0, a.due = this.review_time.scheduler(10), a.state = n;
 				break;
-			case u.Good: {
+			case f.Good: {
 				let e = this.algorithm.next_interval(a.stability, o);
-				a.scheduled_days = e, a.due = this.review_time.scheduler(e, !0), a.state = l.Review;
+				a.scheduled_days = e, a.due = this.review_time.scheduler(e, !0), a.state = d.Review;
 				break;
 			}
-			case u.Easy: {
-				let e = this.algorithm.next_short_term_stability(i, u.Good), t = this.algorithm.next_interval(e, o), n = Math.max(this.algorithm.next_interval(a.stability, o), t + 1);
-				a.scheduled_days = n, a.due = this.review_time.scheduler(n, !0), a.state = l.Review;
+			case f.Easy: {
+				let e = this.algorithm.next_short_term_stability(i, f.Good), t = this.algorithm.next_interval(e, o), n = Math.max(this.algorithm.next_interval(a.stability, o), t + 1);
+				a.scheduled_days = n, a.due = this.review_time.scheduler(n, !0), a.state = d.Review;
 				break;
 			}
 			default: throw Error("Invalid grade");
@@ -469,27 +482,27 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 	reviewState(e) {
 		let t = this.next.get(e);
 		if (t) return t;
-		let n = this.current.elapsed_days, { difficulty: r, stability: i } = this.last, a = this.algorithm.forgetting_curve(n, i), o = d.card(this.current), s = d.card(this.current), c = d.card(this.current), l = d.card(this.current);
+		let n = this.current.elapsed_days, { difficulty: r, stability: i } = this.last, a = this.algorithm.forgetting_curve(n, i), o = p.card(this.current), s = p.card(this.current), c = p.card(this.current), l = p.card(this.current);
 		this.next_ds(o, s, c, l, r, i, a), this.next_interval(o, s, c, l, n), this.next_state(o, s, c, l), o.lapses += 1;
-		let f = {
+		let u = {
 			card: o,
-			log: this.buildLog(u.Again)
-		}, p = {
+			log: this.buildLog(f.Again)
+		}, d = {
 			card: s,
-			log: super.buildLog(u.Hard)
+			log: super.buildLog(f.Hard)
 		}, m = {
 			card: c,
-			log: super.buildLog(u.Good)
+			log: super.buildLog(f.Good)
 		}, ee = {
 			card: l,
-			log: super.buildLog(u.Easy)
+			log: super.buildLog(f.Easy)
 		};
-		return this.next.set(u.Again, f), this.next.set(u.Hard, p), this.next.set(u.Good, m), this.next.set(u.Easy, ee), this.next.get(e);
+		return this.next.set(f.Again, u), this.next.set(f.Hard, d), this.next.set(f.Good, m), this.next.set(f.Easy, ee), this.next.get(e);
 	}
 	next_ds(e, t, n, r, i, a, o) {
-		e.difficulty = this.algorithm.next_difficulty(i, u.Again);
+		e.difficulty = this.algorithm.next_difficulty(i, f.Again);
 		let s = a / Math.exp(this.algorithm.parameters.w[17] * this.algorithm.parameters.w[18]), c = this.algorithm.next_forget_stability(i, a, o);
-		e.stability = v(+s.toFixed(8), y, c), t.difficulty = this.algorithm.next_difficulty(i, u.Hard), t.stability = this.algorithm.next_recall_stability(i, a, o, u.Hard), n.difficulty = this.algorithm.next_difficulty(i, u.Good), n.stability = this.algorithm.next_recall_stability(i, a, o, u.Good), r.difficulty = this.algorithm.next_difficulty(i, u.Easy), r.stability = this.algorithm.next_recall_stability(i, a, o, u.Easy);
+		e.stability = v(+s.toFixed(8), y, c), t.difficulty = this.algorithm.next_difficulty(i, f.Hard), t.stability = this.algorithm.next_recall_stability(i, a, o, f.Hard), n.difficulty = this.algorithm.next_difficulty(i, f.Good), n.stability = this.algorithm.next_recall_stability(i, a, o, f.Good), r.difficulty = this.algorithm.next_difficulty(i, f.Easy), r.stability = this.algorithm.next_recall_stability(i, a, o, f.Easy);
 	}
 	next_interval(e, t, n, r, i) {
 		let a, o;
@@ -498,18 +511,18 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 		e.scheduled_days = 0, e.due = this.review_time.scheduler(5), t.scheduled_days = a, t.due = this.review_time.scheduler(a, !0), n.scheduled_days = o, n.due = this.review_time.scheduler(o, !0), r.scheduled_days = s, r.due = this.review_time.scheduler(s, !0);
 	}
 	next_state(e, t, n, r) {
-		e.state = l.Relearning, t.state = l.Review, n.state = l.Review, r.state = l.Review;
+		e.state = d.Relearning, t.state = d.Review, n.state = d.Review, r.state = d.Review;
 	}
-}, ve = class extends ge {
+}, be = class extends ve {
 	newState(e) {
 		let t = this.next.get(e);
 		if (t) return t;
 		this.current.scheduled_days = 0, this.current.elapsed_days = 0;
-		let n = d.card(this.current), r = d.card(this.current), i = d.card(this.current), a = d.card(this.current);
+		let n = p.card(this.current), r = p.card(this.current), i = p.card(this.current), a = p.card(this.current);
 		return this.init_ds(n, r, i, a), this.next_interval(n, r, i, a, 0), this.next_state(n, r, i, a), this.update_next(n, r, i, a), this.next.get(e);
 	}
 	init_ds(e, t, n, r) {
-		e.difficulty = this.algorithm.init_difficulty(u.Again), e.stability = this.algorithm.init_stability(u.Again), t.difficulty = this.algorithm.init_difficulty(u.Hard), t.stability = this.algorithm.init_stability(u.Hard), n.difficulty = this.algorithm.init_difficulty(u.Good), n.stability = this.algorithm.init_stability(u.Good), r.difficulty = this.algorithm.init_difficulty(u.Easy), r.stability = this.algorithm.init_stability(u.Easy);
+		e.difficulty = this.algorithm.init_difficulty(f.Again), e.stability = this.algorithm.init_stability(f.Again), t.difficulty = this.algorithm.init_difficulty(f.Hard), t.stability = this.algorithm.init_stability(f.Hard), n.difficulty = this.algorithm.init_difficulty(f.Good), n.stability = this.algorithm.init_stability(f.Good), r.difficulty = this.algorithm.init_difficulty(f.Easy), r.stability = this.algorithm.init_stability(f.Easy);
 	}
 	learningState(e) {
 		return this.reviewState(e);
@@ -517,36 +530,36 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 	reviewState(e) {
 		let t = this.next.get(e);
 		if (t) return t;
-		let n = this.current.elapsed_days, { difficulty: r, stability: i } = this.last, a = this.algorithm.forgetting_curve(n, i), o = d.card(this.current), s = d.card(this.current), c = d.card(this.current), l = d.card(this.current);
+		let n = this.current.elapsed_days, { difficulty: r, stability: i } = this.last, a = this.algorithm.forgetting_curve(n, i), o = p.card(this.current), s = p.card(this.current), c = p.card(this.current), l = p.card(this.current);
 		return this.next_ds(o, s, c, l, r, i, a), this.next_interval(o, s, c, l, n), this.next_state(o, s, c, l), o.lapses += 1, this.update_next(o, s, c, l), this.next.get(e);
 	}
 	next_ds(e, t, n, r, i, a, o) {
-		e.difficulty = this.algorithm.next_difficulty(i, u.Again), e.stability = v(a, y, this.algorithm.next_forget_stability(i, a, o)), t.difficulty = this.algorithm.next_difficulty(i, u.Hard), t.stability = this.algorithm.next_recall_stability(i, a, o, u.Hard), n.difficulty = this.algorithm.next_difficulty(i, u.Good), n.stability = this.algorithm.next_recall_stability(i, a, o, u.Good), r.difficulty = this.algorithm.next_difficulty(i, u.Easy), r.stability = this.algorithm.next_recall_stability(i, a, o, u.Easy);
+		e.difficulty = this.algorithm.next_difficulty(i, f.Again), e.stability = v(a, y, this.algorithm.next_forget_stability(i, a, o)), t.difficulty = this.algorithm.next_difficulty(i, f.Hard), t.stability = this.algorithm.next_recall_stability(i, a, o, f.Hard), n.difficulty = this.algorithm.next_difficulty(i, f.Good), n.stability = this.algorithm.next_recall_stability(i, a, o, f.Good), r.difficulty = this.algorithm.next_difficulty(i, f.Easy), r.stability = this.algorithm.next_recall_stability(i, a, o, f.Easy);
 	}
 	next_interval(e, t, n, r, i) {
 		let a, o, s, c;
 		a = this.algorithm.next_interval(e.stability, i), o = this.algorithm.next_interval(t.stability, i), s = this.algorithm.next_interval(n.stability, i), c = this.algorithm.next_interval(r.stability, i), a = Math.min(a, o), o = Math.max(o, a + 1), s = Math.max(s, o + 1), c = Math.max(c, s + 1), e.scheduled_days = a, e.due = this.review_time.scheduler(a, !0), t.scheduled_days = o, t.due = this.review_time.scheduler(o, !0), n.scheduled_days = s, n.due = this.review_time.scheduler(s, !0), r.scheduled_days = c, r.due = this.review_time.scheduler(c, !0);
 	}
 	next_state(e, t, n, r) {
-		e.state = l.Review, t.state = l.Review, n.state = l.Review, r.state = l.Review;
+		e.state = d.Review, t.state = d.Review, n.state = d.Review, r.state = d.Review;
 	}
 	update_next(e, t, n, r) {
 		let i = {
 			card: e,
-			log: this.buildLog(u.Again)
+			log: this.buildLog(f.Again)
 		}, a = {
 			card: t,
-			log: super.buildLog(u.Hard)
+			log: super.buildLog(f.Hard)
 		}, o = {
 			card: n,
-			log: super.buildLog(u.Good)
+			log: super.buildLog(f.Good)
 		}, s = {
 			card: r,
-			log: super.buildLog(u.Easy)
+			log: super.buildLog(f.Easy)
 		};
-		this.next.set(u.Again, i), this.next.set(u.Hard, a), this.next.set(u.Good, o), this.next.set(u.Easy, s);
+		this.next.set(f.Again, i), this.next.set(f.Hard, a), this.next.set(f.Good, o), this.next.set(f.Easy, s);
 	}
-}, ye = class {
+}, xe = class {
 	fsrs;
 	constructor(e) {
 		this.fsrs = e;
@@ -557,8 +570,8 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 	handleManualRating(e, t, n, r, i, a, o) {
 		if (typeof t > "u") throw Error("reschedule: state is required for manual rating");
 		let s, c;
-		if (t === l.New) s = {
-			rating: u.Manual,
+		if (t === d.New) s = {
+			rating: f.Manual,
 			state: t,
 			due: o ?? n,
 			stability: e.stability,
@@ -572,7 +585,7 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 			if (typeof o > "u") throw Error("reschedule: due is required for manual rating");
 			let l = o.diff(n, "days");
 			s = {
-				rating: u.Manual,
+				rating: f.Manual,
 				state: e.state,
 				due: e.last_review || e.due,
 				stability: e.stability,
@@ -602,9 +615,9 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 		let n = [], r = x(e.due);
 		for (let e of t) {
 			let t;
-			if (e.review = d.time(e.review), e.rating === u.Manual) {
+			if (e.review = p.time(e.review), e.rating === f.Manual) {
 				let n = 0;
-				r.state !== l.New && r.last_review && (n = e.review.diff(r.last_review, "days")), t = this.handleManualRating(r, e.state, e.review, n, e.stability, e.difficulty, e.due ? d.time(e.due) : void 0);
+				r.state !== d.New && r.last_review && (n = e.review.diff(r.last_review, "days")), t = this.handleManualRating(r, e.state, e.review, n, e.stability, e.difficulty, e.due ? p.time(e.due) : void 0);
 			} else t = this.replay(r, e.review, e.rating);
 			n.push(t), r = t.card;
 		}
@@ -612,21 +625,21 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 	}
 	calculateManualRecord(e, t, n, r) {
 		if (!n) return null;
-		let { card: i, log: a } = n, o = d.card(e);
-		return o.due.getTime() === i.due.getTime() ? null : (o.scheduled_days = i.due.diff(o.due, "days"), this.handleManualRating(o, i.state, d.time(t), a.elapsed_days, r ? i.stability : void 0, r ? i.difficulty : void 0, i.due));
+		let { card: i, log: a } = n, o = p.card(e);
+		return o.due.getTime() === i.due.getTime() ? null : (o.scheduled_days = i.due.diff(o.due, "days"), this.handleManualRating(o, i.state, p.time(t), a.elapsed_days, r ? i.stability : void 0, r ? i.difficulty : void 0, i.due));
 	}
-}, be = class extends me {
+}, Se = class extends ge {
 	strategyHandler = /* @__PURE__ */ new Map();
 	Scheduler;
 	constructor(e) {
 		super(e);
 		let { enable_short_term: t } = this.parameters;
-		this.Scheduler = t ? _e : ve;
+		this.Scheduler = t ? ye : be;
 	}
 	params_handler_proxy() {
 		let e = this;
 		return { set: function(t, n, r) {
-			return n === "request_retention" && Number.isFinite(r) ? e.intervalModifier = e.calculate_interval_modifier(Number(r)) : n === "enable_short_term" && (e.Scheduler = r === !0 ? _e : ve), Reflect.set(t, n, r), !0;
+			return n === "request_retention" && Number.isFinite(r) ? e.intervalModifier = e.calculate_interval_modifier(Number(r)) : n === "enable_short_term" && (e.Scheduler = r === !0 ? ye : be), Reflect.set(t, n, r), !0;
 		} };
 	}
 	useStrategy(e, t) {
@@ -637,36 +650,36 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 	}
 	getScheduler(e, t) {
 		let n = this.strategyHandler.get(S.SEED);
-		return new ((this.strategyHandler.get(S.SCHEDULER)) || this.Scheduler)(e, t, this, { seed: n || he });
+		return new ((this.strategyHandler.get(S.SCHEDULER)) || this.Scheduler)(e, t, this, { seed: n || _e });
 	}
 	repeat(e, t, n) {
 		let r = this.getScheduler(e, t).preview();
 		return n && typeof n == "function" ? n(r) : r;
 	}
 	next(e, t, n, r) {
-		let i = this.getScheduler(e, t), a = d.rating(n);
-		if (a === u.Manual) throw Error("Cannot review a manual rating");
+		let i = this.getScheduler(e, t), a = p.rating(n);
+		if (a === f.Manual) throw Error("Cannot review a manual rating");
 		let o = i.review(a);
 		return r && typeof r == "function" ? r(o) : o;
 	}
 	get_retrievability(e, t, n = !0) {
-		let r = d.card(e);
-		t = t ? d.time(t) : /* @__PURE__ */ new Date();
-		let i = r.state === l.New ? 0 : Math.max(t.diff(r.last_review, "days"), 0), a = r.state === l.New ? 0 : this.forgetting_curve(i, +r.stability.toFixed(8));
+		let r = p.card(e);
+		t = t ? p.time(t) : /* @__PURE__ */ new Date();
+		let i = r.state === d.New ? 0 : Math.max(t.diff(r.last_review, "days"), 0), a = r.state === d.New ? 0 : this.forgetting_curve(i, +r.stability.toFixed(8));
 		return n ? `${(a * 100).toFixed(2)}%` : a;
 	}
 	rollback(e, t, n) {
-		let r = d.card(e), i = d.review_log(t);
-		if (i.rating === u.Manual) throw Error("Cannot rollback a manual rating");
+		let r = p.card(e), i = p.review_log(t);
+		if (i.rating === f.Manual) throw Error("Cannot rollback a manual rating");
 		let a, o, s;
 		switch (i.state) {
-			case l.New:
+			case d.New:
 				a = i.due, o = void 0, s = 0;
 				break;
-			case l.Learning:
-			case l.Relearning:
-			case l.Review:
-				a = i.review, o = i.due, s = r.lapses - +(i.rating === u.Again && i.state === l.Review);
+			case d.Learning:
+			case d.Relearning:
+			case d.Review:
+				a = i.review, o = i.due, s = r.lapses - +(i.rating === f.Again && i.state === d.Review);
 				break;
 		}
 		let c = {
@@ -684,10 +697,10 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 		return n && typeof n == "function" ? n(c) : c;
 	}
 	forget(e, t, n = !1, r) {
-		let i = d.card(e);
-		t = d.time(t);
-		let a = i.state === l.New ? 0 : t.diff(i.last_review, "days"), o = {
-			rating: u.Manual,
+		let i = p.card(e);
+		t = p.time(t);
+		let a = i.state === d.New ? 0 : t.diff(i.last_review, "days"), o = {
+			rating: f.Manual,
 			state: i.state,
 			due: i.due,
 			stability: i.stability,
@@ -706,7 +719,7 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 				scheduled_days: 0,
 				reps: n ? 0 : i.reps,
 				lapses: n ? 0 : i.lapses,
-				state: l.New,
+				state: d.New,
 				last_review: i.last_review
 			},
 			log: o
@@ -715,8 +728,8 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 	}
 	reschedule(e, t = [], n = {}) {
 		let { recordLogHandler: r, reviewsOrderBy: i, skipManual: a = !0, now: o = /* @__PURE__ */ new Date(), update_memory_state: s = !1 } = n;
-		i && typeof i == "function" && t.sort(i), a && (t = t.filter((e) => e.rating !== u.Manual));
-		let c = new ye(this), l = c.reschedule(n.first_card || x(), t), f = l.length, p = d.card(e), m = c.calculateManualRecord(p, o, f ? l[f - 1] : void 0, s);
+		i && typeof i == "function" && t.sort(i), a && (t = t.filter((e) => e.rating !== f.Manual));
+		let c = new xe(this), l = c.reschedule(n.first_card || x(), t), u = l.length, d = p.card(e), m = c.calculateManualRecord(d, o, u ? l[u - 1] : void 0, s);
 		return r && typeof r == "function" ? {
 			collections: l.map(r),
 			reschedule_item: m ? r(m) : null
@@ -725,14 +738,14 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 			reschedule_item: m
 		};
 	}
-}, xe = ((e) => new be(e || {}))(b({
+}, Ce = ((e) => new Se(e || {}))(b({
 	request_retention: i,
 	enable_fuzz: !0,
 	maximum_interval: 100
-})), Se = (e) => e.due ? e : {
+})), we = (e) => e.due ? e : {
 	...e,
 	due: /* @__PURE__ */ new Date()
-}, Ce = (e) => t.indexOf(e), we = (e) => ({
+}, Te = (e) => t.indexOf(e), Ee = (e) => ({
 	due: e.due,
 	stability: e.stability,
 	difficulty: e.difficulty,
@@ -740,19 +753,19 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 	scheduled_days: e.scheduledDays,
 	reps: e.reps,
 	lapses: e.lapses,
-	state: Ce(e.state),
+	state: Te(e.state),
 	last_review: e.lastReview
-}), Te = (e, t, n) => {
-	let r = /* @__PURE__ */ new Date(), i = we(Se(e));
-	return xe.repeat(i, r, (r) => {
-		let i = r[ke(t)], a = C(i.card, e), o = i.log;
+}), De = (e, t, n) => {
+	let r = /* @__PURE__ */ new Date(), i = Ee(we(e));
+	return Ce.repeat(i, r, (r) => {
+		let i = r[je(t)], a = C(i.card, e), o = i.log;
 		return {
 			nextCard: a,
 			reviewLog: {
 				id: 0,
 				cardReviewId: e.id,
 				grade: t,
-				state: Oe(o.state),
+				state: Ae(o.state),
 				due: o.due,
 				stability: o.stability,
 				difficulty: o.difficulty,
@@ -765,18 +778,18 @@ var S = ((e) => (e.SCHEDULER = "Scheduler", e.SEED = "Seed", e))(S || {}), ge =
 		};
 	});
 };
-function Ee(e) {
-	let t = /* @__PURE__ */ new Date(), n = we(Se(e)), i = xe.repeat(n, t), a = Object.fromEntries(r.map((e) => [e, /* @__PURE__ */ new Date()]));
-	for (let e of ne) {
-		let t = i[e].card.due, n = De(e);
+function Oe(e) {
+	let t = /* @__PURE__ */ new Date(), n = Ee(we(e)), i = Ce.repeat(n, t), a = Object.fromEntries(r.map((e) => [e, /* @__PURE__ */ new Date()]));
+	for (let e of ie) {
+		let t = i[e].card.due, n = ke(e);
 		a[n] = t;
 	}
 	return a;
 }
-function De(e) {
+function ke(e) {
 	return r[e];
 }
-function Oe(e) {
+function Ae(e) {
 	return t[e];
 }
 function C(e, t) {
@@ -789,16 +802,16 @@ function C(e, t) {
 		scheduledDays: e.scheduled_days,
 		reps: e.reps,
 		lapses: e.lapses,
-		state: Oe(e.state),
+		state: Ae(e.state),
 		lastReview: e.last_review ?? null
 	};
 }
-function ke(e) {
+function je(e) {
 	let t = r.indexOf(e);
 	if (t === -1) throw Error(`Invalid rating: ${e}`);
 	return t;
 }
-function Ae(e, t) {
+function Me(e, t) {
 	let r = x();
 	return {
 		id: "",
@@ -816,8 +829,16 @@ function Ae(e, t) {
 	};
 }
 //#endregion
+//#region src/spaced-repetition/retention.ts
+function Ne(e, t) {
+	return t <= 0 ? 0 : (1 + o * e / t) ** -a;
+}
+function Pe(e, t) {
+	return Ne(e, t) * 100;
+}
+//#endregion
 //#region ../../node_modules/immer/dist/immer.mjs
-var je = Symbol.for("immer-nothing"), Me = Symbol.for("immer-draftable"), w = Symbol.for("immer-state"), Ne = process.env.NODE_ENV === "production" ? [] : [
+var Fe = Symbol.for("immer-nothing"), Ie = Symbol.for("immer-draftable"), w = Symbol.for("immer-state"), Le = process.env.NODE_ENV === "production" ? [] : [
 	function(e) {
 		return `The plugin for '${e}' has not been loaded into Immer. To enable the plugin, import and call \`enable${e}()\` when initializing your application.`;
 	},
@@ -847,7 +868,7 @@ var je = Symbol.for("immer-nothing"), Me = Symbol.for("immer-draftable"), w = Sy
 ];
 function T(e, ...t) {
 	if (process.env.NODE_ENV !== "production") {
-		let n = Ne[e], r = typeof n == "function" ? n.apply(null, t) : n;
+		let n = Le[e], r = typeof n == "function" ? n.apply(null, t) : n;
 		throw Error(`[Immer] ${r}`);
 	}
 	throw Error(`[Immer] minified error nr: ${e}. Full error at: https://bit.ly/3cXEKWf`);
@@ -857,18 +878,18 @@ function D(e) {
 	return !!e && !!e[w];
 }
 function O(e) {
-	return e ? Ie(e) || Array.isArray(e) || !!e[Me] || !!e.constructor?.[Me] || M(e) || N(e) : !1;
+	return e ? Be(e) || Array.isArray(e) || !!e[Ie] || !!e.constructor?.[Ie] || M(e) || N(e) : !1;
 }
-var Pe = Object.prototype.constructor.toString(), Fe = /* @__PURE__ */ new WeakMap();
-function Ie(e) {
+var Re = Object.prototype.constructor.toString(), ze = /* @__PURE__ */ new WeakMap();
+function Be(e) {
 	if (!e || typeof e != "object") return !1;
 	let t = Object.getPrototypeOf(e);
 	if (t === null || t === Object.prototype) return !0;
 	let n = Object.hasOwnProperty.call(t, "constructor") && t.constructor;
 	if (n === Object) return !0;
 	if (typeof n != "function") return !1;
-	let r = Fe.get(n);
-	return r === void 0 && (r = Function.toString.call(n), Fe.set(n, r)), r === Pe;
+	let r = ze.get(n);
+	return r === void 0 && (r = Function.toString.call(n), ze.set(n, r)), r === Re;
 }
 function k(e, t, n = !0) {
 	A(e) === 0 ? (n ? Reflect.ownKeys(e) : Object.keys(e)).forEach((n) => {
@@ -882,11 +903,11 @@ function A(e) {
 function j(e, t) {
 	return A(e) === 2 ? e.has(t) : Object.prototype.hasOwnProperty.call(e, t);
 }
-function Le(e, t, n) {
+function Ve(e, t, n) {
 	let r = A(e);
 	r === 2 ? e.set(t, n) : r === 3 ? e.add(n) : e[t] = n;
 }
-function Re(e, t) {
+function He(e, t) {
 	return e === t ? e !== 0 || 1 / e == 1 / t : e !== e && t !== t;
 }
 function M(e) {
@@ -902,7 +923,7 @@ function F(e, t) {
 	if (M(e)) return new Map(e);
 	if (N(e)) return new Set(e);
 	if (Array.isArray(e)) return Array.prototype.slice.call(e);
-	let n = Ie(e);
+	let n = Be(e);
 	if (t === !0 || t === "class_only" && !n) {
 		let t = Object.getOwnPropertyDescriptors(e);
 		delete t[w];
@@ -930,23 +951,23 @@ function I(e, t = !1) {
 		delete: L
 	}), Object.freeze(e), t && Object.values(e).forEach((e) => I(e, !0)), e);
 }
-function ze() {
+function Ue() {
 	T(2);
 }
-var L = { value: ze };
+var L = { value: Ue };
 function R(e) {
 	return typeof e != "object" || !e ? !0 : Object.isFrozen(e);
 }
-var Be = {};
+var We = {};
 function z(e) {
-	let t = Be[e];
+	let t = We[e];
 	return t || T(0, e), t;
 }
 var B;
-function Ve() {
+function Ge() {
 	return B;
 }
-function He(e, t) {
+function Ke(e, t) {
 	return {
 		drafts_: [],
 		parent_: e,
@@ -955,47 +976,47 @@ function He(e, t) {
 		unfinalizedDrafts_: 0
 	};
 }
-function Ue(e, t) {
+function qe(e, t) {
 	t && (z("Patches"), e.patches_ = [], e.inversePatches_ = [], e.patchListener_ = t);
 }
 function V(e) {
-	H(e), e.drafts_.forEach(Ge), e.drafts_ = null;
+	H(e), e.drafts_.forEach(Ye), e.drafts_ = null;
 }
 function H(e) {
 	e === B && (B = e.parent_);
 }
-function We(e) {
-	return B = He(B, e);
+function Je(e) {
+	return B = Ke(B, e);
 }
-function Ge(e) {
+function Ye(e) {
 	let t = e[w];
 	t.type_ === 0 || t.type_ === 1 ? t.revoke_() : t.revoked_ = !0;
 }
-function Ke(e, t) {
+function Xe(e, t) {
 	t.unfinalizedDrafts_ = t.drafts_.length;
 	let n = t.drafts_[0];
-	return e !== void 0 && e !== n ? (n[w].modified_ && (V(t), T(4)), O(e) && (e = U(t, e), t.parent_ || W(t, e)), t.patches_ && z("Patches").generateReplacementPatches_(n[w].base_, e, t.patches_, t.inversePatches_)) : e = U(t, n, []), V(t), t.patches_ && t.patchListener_(t.patches_, t.inversePatches_), e === je ? void 0 : e;
+	return e !== void 0 && e !== n ? (n[w].modified_ && (V(t), T(4)), O(e) && (e = U(t, e), t.parent_ || W(t, e)), t.patches_ && z("Patches").generateReplacementPatches_(n[w].base_, e, t.patches_, t.inversePatches_)) : e = U(t, n, []), V(t), t.patches_ && t.patchListener_(t.patches_, t.inversePatches_), e === Fe ? void 0 : e;
 }
 function U(e, t, n) {
 	if (R(t)) return t;
 	let r = e.immer_.shouldUseStrictIteration(), i = t[w];
-	if (!i) return k(t, (r, a) => qe(e, i, t, r, a, n), r), t;
+	if (!i) return k(t, (r, a) => Ze(e, i, t, r, a, n), r), t;
 	if (i.scope_ !== e) return t;
 	if (!i.modified_) return W(e, i.base_, !0), i.base_;
 	if (!i.finalized_) {
 		i.finalized_ = !0, i.scope_.unfinalizedDrafts_--;
 		let t = i.copy_, a = t, o = !1;
-		i.type_ === 3 && (a = new Set(t), t.clear(), o = !0), k(a, (r, a) => qe(e, i, t, r, a, n, o), r), W(e, t, !1), n && e.patches_ && z("Patches").generatePatches_(i, n, e.patches_, e.inversePatches_);
+		i.type_ === 3 && (a = new Set(t), t.clear(), o = !0), k(a, (r, a) => Ze(e, i, t, r, a, n, o), r), W(e, t, !1), n && e.patches_ && z("Patches").generatePatches_(i, n, e.patches_, e.inversePatches_);
 	}
 	return i.copy_;
 }
-function qe(e, t, n, r, i, a, o) {
+function Ze(e, t, n, r, i, a, o) {
 	if (i == null || typeof i != "object" && !o) return;
 	let s = R(i);
 	if (!(s && !o)) {
 		if (process.env.NODE_ENV !== "production" && i === n && T(5), D(i)) {
 			let o = U(e, i, a && t && t.type_ !== 3 && !j(t.assigned_, r) ? a.concat(r) : void 0);
-			if (Le(n, r, o), D(o)) e.canAutoFreeze_ = !1;
+			if (Ve(n, r, o), D(o)) e.canAutoFreeze_ = !1;
 			else return;
 		} else o && n.add(i);
 		if (O(i) && !s) {
@@ -1007,10 +1028,10 @@ function qe(e, t, n, r, i, a, o) {
 function W(e, t, n = !1) {
 	!e.parent_ && e.immer_.autoFreeze_ && e.canAutoFreeze_ && I(t, n);
 }
-function Je(e, t) {
+function Qe(e, t) {
 	let n = Array.isArray(e), r = {
 		type_: +!!n,
-		scope_: t ? t.scope_ : Ve(),
+		scope_: t ? t.scope_ : Ge(),
 		modified_: !1,
 		finalized_: !1,
 		assigned_: {},
@@ -1029,7 +1050,7 @@ var G = {
 	get(e, t) {
 		if (t === w) return e;
 		let n = P(e);
-		if (!j(n, t)) return Ye(e, n, t);
+		if (!j(n, t)) return $e(e, n, t);
 		let r = n[t];
 		return e.finalized_ || !O(r) ? r : r === q(e.base_, t) ? (Y(e), e.copy_[t] = X(r, e)) : r;
 	},
@@ -1040,12 +1061,12 @@ var G = {
 		return Reflect.ownKeys(P(e));
 	},
 	set(e, t, n) {
-		let r = Xe(P(e), t);
+		let r = et(P(e), t);
 		if (r?.set) return r.set.call(e.draft_, n), !0;
 		if (!e.modified_) {
 			let r = q(P(e), t), i = r?.[w];
 			if (i && i.base_ === n) return e.copy_[t] = n, e.assigned_[t] = !1, !0;
-			if (Re(n, r) && (n !== void 0 || j(e.base_, t))) return !0;
+			if (He(n, r) && (n !== void 0 || j(e.base_, t))) return !0;
 			Y(e), J(e);
 		}
 		return e.copy_[t] === n && (n !== void 0 || t in e.copy_) || Number.isNaN(n) && Number.isNaN(e.copy_[t]) ? !0 : (e.copy_[t] = n, e.assigned_[t] = !0, !0);
@@ -1085,11 +1106,11 @@ function q(e, t) {
 	let n = e[w];
 	return (n ? P(n) : e)[t];
 }
-function Ye(e, t, n) {
-	let r = Xe(t, n);
+function $e(e, t, n) {
+	let r = et(t, n);
 	return r ? "value" in r ? r.value : r.get?.call(e.draft_) : void 0;
 }
-function Xe(e, t) {
+function et(e, t) {
 	if (!(t in e)) return;
 	let n = E(e);
 	for (; n;) {
@@ -1104,7 +1125,7 @@ function J(e) {
 function Y(e) {
 	e.copy_ ||= F(e.base_, e.scope_.immer_.useStrictShallowCopy_);
 }
-var Ze = class {
+var tt = class {
 	constructor(e) {
 		this.autoFreeze_ = !0, this.useStrictShallowCopy_ = !1, this.useStrictIteration_ = !0, this.produce = (e, t, n) => {
 			if (typeof e == "function" && typeof t != "function") {
@@ -1118,15 +1139,15 @@ var Ze = class {
 			typeof t != "function" && T(6), n !== void 0 && typeof n != "function" && T(7);
 			let r;
 			if (O(e)) {
-				let i = We(this), a = X(e, void 0), o = !0;
+				let i = Je(this), a = X(e, void 0), o = !0;
 				try {
 					r = t(a), o = !1;
 				} finally {
 					o ? V(i) : H(i);
 				}
-				return Ue(i, n), Ke(r, i);
+				return qe(i, n), Xe(r, i);
 			} else if (!e || typeof e != "object") {
-				if (r = t(e), r === void 0 && (r = e), r === je && (r = void 0), this.autoFreeze_ && I(r, !0), n) {
+				if (r = t(e), r === void 0 && (r = e), r === Fe && (r = void 0), this.autoFreeze_ && I(r, !0), n) {
 					let t = [], i = [];
 					z("Patches").generateReplacementPatches_(e, r, t, i), n(t, i);
 				}
@@ -1145,15 +1166,15 @@ var Ze = class {
 		}, typeof e?.autoFreeze == "boolean" && this.setAutoFreeze(e.autoFreeze), typeof e?.useStrictShallowCopy == "boolean" && this.setUseStrictShallowCopy(e.useStrictShallowCopy), typeof e?.useStrictIteration == "boolean" && this.setUseStrictIteration(e.useStrictIteration);
 	}
 	createDraft(e) {
-		O(e) || T(8), D(e) && (e = Qe(e));
-		let t = We(this), n = X(e, void 0);
+		O(e) || T(8), D(e) && (e = nt(e));
+		let t = Je(this), n = X(e, void 0);
 		return n[w].isManual_ = !0, H(t), n;
 	}
 	finishDraft(e, t) {
 		let n = e && e[w];
 		(!n || !n.isManual_) && T(9);
 		let { scope_: r } = n;
-		return Ue(r, t), Ke(void 0, r);
+		return qe(r, t), Xe(void 0, r);
 	}
 	setAutoFreeze(e) {
 		this.autoFreeze_ = e;
@@ -1182,13 +1203,13 @@ var Ze = class {
 	}
 };
 function X(e, t) {
-	let n = M(e) ? z("MapSet").proxyMap_(e, t) : N(e) ? z("MapSet").proxySet_(e, t) : Je(e, t);
-	return (t ? t.scope_ : Ve()).drafts_.push(n), n;
+	let n = M(e) ? z("MapSet").proxyMap_(e, t) : N(e) ? z("MapSet").proxySet_(e, t) : Qe(e, t);
+	return (t ? t.scope_ : Ge()).drafts_.push(n), n;
 }
-function Qe(e) {
-	return D(e) || T(10, e), Z(e);
+function nt(e) {
+	return D(e) || T(10, e), rt(e);
 }
-function Z(e) {
+function rt(e) {
 	if (!O(e) || R(e)) return e;
 	let t = e[w], n, r = !0;
 	if (t) {
@@ -1196,13 +1217,13 @@ function Z(e) {
 		t.finalized_ = !0, n = F(e, t.scope_.immer_.useStrictShallowCopy_), r = t.scope_.immer_.shouldUseStrictIteration();
 	} else n = F(e, !0);
 	return k(n, (e, t) => {
-		Le(n, e, Z(t));
+		Ve(n, e, rt(t));
 	}, r), t && (t.finalized_ = !1), n;
 }
-var $e = new Ze().produce;
+var Z = new tt().produce;
 //#endregion
 //#region src/spaced-repetition/utils.ts
-function et(e, t) {
+function it(e, t) {
 	let n = e + t, r = 0;
 	for (let e = 0; e < n.length; e++) {
 		let t = n.charCodeAt(e);
@@ -1210,10 +1231,10 @@ function et(e, t) {
 	}
 	return r;
 }
-function tt(e, t) {
-	return (et(e, t) >>> 0) / 4294967295;
+function at(e, t) {
+	return (it(e, t) >>> 0) / 4294967295;
 }
-function nt(e, t = /* @__PURE__ */ new Set()) {
+function ot(e, t = /* @__PURE__ */ new Set()) {
 	if (e.reviewCards.length === 0 && e.newCards.length === 0) return;
 	if (e.reviewCards.length === 0) return Q(e.newCards, t) ?? e.newCards[0];
 	if (e.newCards.length === 0) return Q(e.reviewCards, t) ?? e.reviewCards[0];
@@ -1221,42 +1242,42 @@ function nt(e, t = /* @__PURE__ */ new Set()) {
 	if (!n) return r ?? e.newCards[0];
 	if (!r) return n ?? e.reviewCards[0];
 	let i = e.newCards.length, a = (.33 + i / (i + e.reviewCards.length)) / 2;
-	return tt(n.card.id, r.card.id) < a ? n : r;
+	return at(n.card.id, r.card.id) < a ? n : r;
 }
 function Q(e, t) {
 	return e.find((e) => !t.has(e.card.id));
 }
-function rt(e, t) {
+function st(e, t) {
 	let n = $(e, t);
-	return n ? $e(e, (e) => {
-		at(e, n);
+	return n ? Z(e, (e) => {
+		lt(e, n);
 	}) : e;
 }
-function it(t, n, r) {
+function ct(t, n, r) {
 	let i = $(n, r);
 	if (!i) return n;
-	let { nextCard: a } = Te(i.cardReview, t, 30), o = a.due && (0, e.isSameDay)(a.due, /* @__PURE__ */ new Date());
-	return $e(n, (e) => {
-		at(e, i), o && ot(e, {
+	let { nextCard: a } = De(i.cardReview, t, 30), o = a.due && (0, e.isSameDay)(a.due, /* @__PURE__ */ new Date());
+	return Z(n, (e) => {
+		lt(e, i), o && ut(e, {
 			...i,
 			cardReview: a
 		});
 	});
 }
-function at(e, t) {
-	t.cardReview.state === "New" ? e.newCards = e.newCards.filter((e) => e.card.id !== t.card.id) : e.reviewCards = e.reviewCards.filter((e) => e.card.id !== t.card.id), st(e, t.cardReview.state, "decrease");
+function lt(e, t) {
+	t.cardReview.state === "New" ? e.newCards = e.newCards.filter((e) => e.card.id !== t.card.id) : e.reviewCards = e.reviewCards.filter((e) => e.card.id !== t.card.id), dt(e, t.cardReview.state, "decrease");
 }
-function ot(e, t) {
+function ut(e, t) {
 	if (t.cardReview.state === "New") {
 		let n = e.newCards.findIndex((e) => e.cardReview.due && t.cardReview.due && e.cardReview.due >= t.cardReview.due || e.cardReview.difficulty >= t.cardReview.difficulty);
 		n === -1 ? e.newCards.push(t) : e.newCards.splice(n, 0, t);
 	} else {
-		let n = ct(e, e.reviewCards);
+		let n = ft(e, e.reviewCards);
 		e.reviewCards.splice(n, 0, t);
 	}
-	st(e, t.cardReview.state, "increase");
+	dt(e, t.cardReview.state, "increase");
 }
-function st(e, t, n) {
+function dt(e, t, n) {
 	let r = n === "increase" ? 1 : -1;
 	switch (t) {
 		case "New":
@@ -1278,14 +1299,14 @@ function st(e, t, n) {
 function $(e, t) {
 	return e.newCards.find((e) => e.card.id === t) ?? e.reviewCards.find((e) => e.card.id === t);
 }
-function ct(e, t) {
+function ft(e, t) {
 	if (t.length === 0) return 0;
 	let n = Math.max(4, Math.floor(t.length / 3));
 	return Math.min(n, t.length);
 }
 //#endregion
 //#region src/spaced-repetition/session-manager.ts
-var lt = 5, ut = {
+var pt = 5, mt = {
 	newCards: [],
 	reviewCards: [],
 	stats: {
@@ -1294,8 +1315,9 @@ var lt = 5, ut = {
 		review: 0,
 		total: 0
 	}
-}, dt = class {
+}, ht = class {
 	recentlyReviewed = /* @__PURE__ */ new Set();
+	reviewHistory = [];
 	_reviewsCompleted = 0;
 	_correctGrades = 0;
 	getProgress() {
@@ -1305,11 +1327,32 @@ var lt = 5, ut = {
 		};
 	}
 	nextCard(e) {
-		return nt(e, this.recentlyReviewed);
+		return ot(e, this.recentlyReviewed);
 	}
 	onRate(e, t) {
-		return this.recentlyReviewed.add(e), this.recentlyReviewed.size > 5 && this.recentlyReviewed.delete(this.recentlyReviewed.values().next().value), this._reviewsCompleted++, (t === "Good" || t === "Easy") && this._correctGrades++, this.getProgress();
+		if (this.reviewHistory.push({
+			cardId: e,
+			rating: t
+		}), this.recentlyReviewed.add(e), this.recentlyReviewed.size > 5) {
+			let e = this.recentlyReviewed.values().next().value;
+			typeof e == "string" && this.recentlyReviewed.delete(e);
+		}
+		return this._reviewsCompleted++, (t === "Good" || t === "Easy") && this._correctGrades++, this.getProgress();
+	}
+	undoRate(e, t) {
+		let n = this.reviewHistory.at(-1);
+		return !n || n.cardId !== e || n.rating !== t ? this.getProgress() : (this.reviewHistory = this.reviewHistory.slice(0, -1), this.rebuildStateFromHistory(), this.getProgress());
+	}
+	rebuildStateFromHistory() {
+		this.recentlyReviewed = /* @__PURE__ */ new Set(), this._reviewsCompleted = 0, this._correctGrades = 0;
+		for (let e of this.reviewHistory) {
+			if (this.recentlyReviewed.add(e.cardId), this.recentlyReviewed.size > 5) {
+				let e = this.recentlyReviewed.values().next().value;
+				typeof e == "string" && this.recentlyReviewed.delete(e);
+			}
+			this._reviewsCompleted++, (e.rating === "Good" || e.rating === "Easy") && this._correctGrades++;
+		}
 	}
 };
 //#endregion
-export { i as FSRS_RETENTION, dt as FlashcardSessionManager, a as MAX_CARDS_TO_FETCH, o as MAX_LEARN_PER_DAY, s as MAX_NEW_PER_DECK_DAY, lt as RECENTLY_REVIEWED_SET_SIZE, c as THRESHOLD_CARDS_FOR_REFETCH, ut as defaultSessionData, nt as getNextCardFromSession, Ee as getReviewDateForEachRating, $ as getSessionCard, Te as gradeCard, C as mergeFsrsCard, Ae as newCardReview, it as removeCardFromSessionData, rt as skipCardFromSessionData };
+export { i as FSRS_RETENTION, o as FSRS_RETENTION_FACTOR, a as FSRS_RETRIEVABILITY_DECAY, ht as FlashcardSessionManager, c as LEARNING_SETTINGS_LIMITS, s as MAX_CARDS_TO_FETCH, pt as RECENTLY_REVIEWED_SET_SIZE, l as THRESHOLD_CARDS_FOR_REFETCH, Pe as calculateRetentionPercentage, Ne as calculateRetrievability, mt as defaultSessionData, ot as getNextCardFromSession, Oe as getReviewDateForEachRating, $ as getSessionCard, De as gradeCard, u as isRecommendedLearningSettings, C as mergeFsrsCard, Me as newCardReview, ct as removeCardFromSessionData, st as skipCardFromSessionData };