@vestcards/shared 1.1.0 → 1.3.0

package/dist/spaced-repetition.js

@@ -1,1195 +1,1315 @@
-var Oe = Object.defineProperty;
-var Fe = (t, e, i) => e in t ? Oe(t, e, { enumerable: !0, configurable: !0, writable: !0, value: i }) : t[e] = i;
-var _ = (t, e, i) => Fe(t, typeof e != "symbol" ? e + "" : e, i);
-import { r as V, a as Ne, b as fe } from "./fsrs-sJJWxUiC.js";
-import "date-fns/locale";
-import { isSameDay as Ie } from "date-fns";
-import "date-fns-tz";
-const Pe = 0.9, Ft = 50, Nt = 200, It = 10, Pt = 10;
-var h = ((t) => (t[t.New = 0] = "New", t[t.Learning = 1] = "Learning", t[t.Review = 2] = "Review", t[t.Relearning = 3] = "Relearning", t))(h || {}), l = ((t) => (t[t.Manual = 0] = "Manual", t[t.Again = 1] = "Again", t[t.Hard = 2] = "Hard", t[t.Good = 3] = "Good", t[t.Easy = 4] = "Easy", t))(l || {});
-class d {
-  static card(e) {
-    return { ...e, state: d.state(e.state), due: d.time(e.due), last_review: e.last_review ? d.time(e.last_review) : void 0 };
-  }
-  static rating(e) {
-    if (typeof e == "string") {
-      const i = e.charAt(0).toUpperCase(), r = e.slice(1).toLowerCase(), s = l[`${i}${r}`];
-      if (s === void 0) throw new Error(`Invalid rating:[${e}]`);
-      return s;
-    } else if (typeof e == "number") return e;
-    throw new Error(`Invalid rating:[${e}]`);
-  }
-  static state(e) {
-    if (typeof e == "string") {
-      const i = e.charAt(0).toUpperCase(), r = e.slice(1).toLowerCase(), s = h[`${i}${r}`];
-      if (s === void 0) throw new Error(`Invalid state:[${e}]`);
-      return s;
-    } else if (typeof e == "number") return e;
-    throw new Error(`Invalid state:[${e}]`);
-  }
-  static time(e) {
-    if (typeof e == "object" && e instanceof Date) return e;
-    if (typeof e == "string") {
-      const i = Date.parse(e);
-      if (isNaN(i)) throw new Error(`Invalid date:[${e}]`);
-      return new Date(i);
-    } else if (typeof e == "number") return new Date(e);
-    throw new Error(`Invalid date:[${e}]`);
-  }
-  static review_log(e) {
-    return { ...e, due: d.time(e.due), rating: d.rating(e.rating), state: d.state(e.state), review: d.time(e.review) };
-  }
-}
-Date.prototype.scheduler = function(t, e) {
-  return Ae(this, t, e);
-}, Date.prototype.diff = function(t, e) {
-  return Te(this, t, e);
+import { t as e } from "./date-DS8JYZte.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 {
+	static card(t) {
+		return {
+			...t,
+			state: e.state(t.state),
+			due: e.time(t.due),
+			last_review: t.last_review ? e.time(t.last_review) : void 0
+		};
+	}
+	static rating(e) {
+		if (typeof e == "string") {
+			let t = u[`${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;
+		throw Error(`Invalid rating:[${e}]`);
+	}
+	static state(e) {
+		if (typeof e == "string") {
+			let t = l[`${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;
+		throw Error(`Invalid state:[${e}]`);
+	}
+	static time(e) {
+		if (typeof e == "object" && e instanceof Date) return e;
+		if (typeof e == "string") {
+			let t = Date.parse(e);
+			if (isNaN(t)) throw Error(`Invalid date:[${e}]`);
+			return new Date(t);
+		} else if (typeof e == "number") return new Date(e);
+		throw Error(`Invalid date:[${e}]`);
+	}
+	static review_log(t) {
+		return {
+			...t,
+			due: e.time(t.due),
+			rating: e.rating(t.rating),
+			state: e.state(t.state),
+			review: e.time(t.review)
+		};
+	}
+}, f = "4.7.1";
+Date.prototype.scheduler = function(e, t) {
+	return p(this, e, t);
+}, Date.prototype.diff = function(e, t) {
+	return m(this, e, t);
 }, Date.prototype.format = function() {
-  return ke(this);
-}, Date.prototype.dueFormat = function(t, e, i) {
-  return je(this, t, e, i);
+	return ee(this);
+}, Date.prototype.dueFormat = function(e, t, n) {
+	return te(this, e, t, n);
 };
-function Ae(t, e, i) {
-  return new Date(i ? d.time(t).getTime() + e * 24 * 60 * 60 * 1e3 : d.time(t).getTime() + e * 60 * 1e3);
-}
-function Te(t, e, i) {
-  if (!t || !e) throw new Error("Invalid date");
-  const r = d.time(t).getTime() - d.time(e).getTime();
-  let s = 0;
-  switch (i) {
-    case "days":
-      s = Math.floor(r / (1440 * 60 * 1e3));
-      break;
-    case "minutes":
-      s = Math.floor(r / (60 * 1e3));
-      break;
-  }
-  return s;
-}
-function ke(t) {
-  const e = d.time(t), i = e.getFullYear(), r = e.getMonth() + 1, s = e.getDate(), n = e.getHours(), a = e.getMinutes(), o = e.getSeconds();
-  return `${i}-${D(r)}-${D(s)} ${D(n)}:${D(a)}:${D(o)}`;
-}
-function D(t) {
-  return t < 10 ? `0${t}` : `${t}`;
-}
-const L = [60, 60, 24, 31, 12], G = ["second", "min", "hour", "day", "month", "year"];
-function je(t, e, i, r = G) {
-  t = d.time(t), e = d.time(e), r.length !== G.length && (r = G);
-  let s = t.getTime() - e.getTime(), n;
-  for (s /= 1e3, n = 0; n < L.length && !(s < L[n]); n++) s /= L[n];
-  return `${Math.floor(s)}${i ? r[n] : ""}`;
-}
-const he = Object.freeze([l.Again, l.Hard, l.Good, l.Easy]), He = [{ start: 2.5, end: 7, factor: 0.15 }, { start: 7, end: 20, factor: 0.1 }, { start: 20, end: 1 / 0, factor: 0.05 }];
-function $e(t, e, i) {
-  let r = 1;
-  for (const a of He) r += a.factor * Math.max(Math.min(t, a.end) - a.start, 0);
-  t = Math.min(t, i);
-  let s = Math.max(2, Math.round(t - r));
-  const n = Math.min(Math.round(t + r), i);
-  return t > e && (s = Math.max(s, e + 1)), s = Math.min(s, n), { min_ivl: s, max_ivl: n };
-}
-function b(t, e, i) {
-  return Math.min(Math.max(t, e), i);
-}
-function Le(t, e) {
-  const i = Date.UTC(t.getUTCFullYear(), t.getUTCMonth(), t.getUTCDate()), r = Date.UTC(e.getUTCFullYear(), e.getUTCMonth(), e.getUTCDate());
-  return Math.floor((r - i) / 864e5);
-}
-const Ge = 0.9, Ue = 36500, qe = Object.freeze([0.40255, 1.18385, 3.173, 15.69105, 7.1949, 0.5345, 1.4604, 46e-4, 1.54575, 0.1192, 1.01925, 1.9395, 0.11, 0.29605, 2.2698, 0.2315, 2.9898, 0.51655, 0.6621]), We = !1, Ye = !0, p = 0.01, N = 100, ie = Object.freeze([Object.freeze([p, N]), Object.freeze([p, N]), Object.freeze([p, N]), Object.freeze([p, N]), Object.freeze([1, 10]), Object.freeze([1e-3, 4]), Object.freeze([1e-3, 4]), Object.freeze([1e-3, 0.75]), Object.freeze([0, 4.5]), Object.freeze([0, 0.8]), Object.freeze([1e-3, 3.5]), Object.freeze([1e-3, 5]), Object.freeze([1e-3, 0.25]), Object.freeze([1e-3, 0.9]), Object.freeze([0, 4]), Object.freeze([0, 1]), Object.freeze([1, 6]), Object.freeze([0, 2]), Object.freeze([0, 2])]), W = (t) => {
-  let e = [...qe];
-  return t != null && t.w && (t.w.length === 19 ? e = [...t.w] : t.w.length === 17 && (e = t == null ? void 0 : t.w.concat([0, 0]), e[4] = +(e[5] * 2 + e[4]).toFixed(8), e[5] = +(Math.log(e[5] * 3 + 1) / 3).toFixed(8), e[6] = +(e[6] + 0.5).toFixed(8), console.debug("[FSRS V5]auto fill w to 19 length"))), e = e.map((i, r) => b(i, ie[r][0], ie[r][1])), { request_retention: (t == null ? void 0 : t.request_retention) || Ge, maximum_interval: (t == null ? void 0 : t.maximum_interval) || Ue, w: e, enable_fuzz: (t == null ? void 0 : t.enable_fuzz) ?? We, enable_short_term: (t == null ? void 0 : t.enable_short_term) ?? Ye };
+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 m(e, t, n) {
+	if (!e || !t) throw Error("Invalid date");
+	let r = d.time(e).getTime() - d.time(t).getTime(), i = 0;
+	switch (n) {
+		case "days":
+			i = Math.floor(r / (1440 * 60 * 1e3));
+			break;
+		case "minutes":
+			i = Math.floor(r / (60 * 1e3));
+			break;
+	}
+	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();
+	return `${n}-${h(r)}-${h(i)} ${h(a)}:${h(o)}:${h(s)}`;
+}
+function h(e) {
+	return e < 10 ? `0${e}` : `${e}`;
+}
+var g = [
+	60,
+	60,
+	24,
+	31,
+	12
+], _ = [
+	"second",
+	"min",
+	"hour",
+	"day",
+	"month",
+	"year"
+];
+function te(e, t, n, r = _) {
+	e = d.time(e), t = d.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 = [
+	{
+		start: 2.5,
+		end: 7,
+		factor: .15
+	},
+	{
+		start: 7,
+		end: 20,
+		factor: .1
+	},
+	{
+		start: 20,
+		end: Infinity,
+		factor: .05
+	}
+];
+function ie(e, t, n) {
+	let r = 1;
+	for (let t of re) 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), {
+		min_ivl: i,
+		max_ivl: a
+	};
+}
+function v(e, t, n) {
+	return Math.min(Math.max(e, t), n);
+}
+function ae(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([
+	.40255,
+	1.18385,
+	3.173,
+	15.69105,
+	7.1949,
+	.5345,
+	1.4604,
+	.0046,
+	1.54575,
+	.1192,
+	1.01925,
+	1.9395,
+	.11,
+	.29605,
+	2.2698,
+	.2315,
+	2.9898,
+	.51655,
+	.6621
+]);
+`${f}`;
+var y = .01, se = Object.freeze([
+	Object.freeze([y, 100]),
+	Object.freeze([y, 100]),
+	Object.freeze([y, 100]),
+	Object.freeze([y, 100]),
+	Object.freeze([1, 10]),
+	Object.freeze([.001, 4]),
+	Object.freeze([.001, 4]),
+	Object.freeze([.001, .75]),
+	Object.freeze([0, 4.5]),
+	Object.freeze([0, .8]),
+	Object.freeze([.001, 3.5]),
+	Object.freeze([.001, 5]),
+	Object.freeze([.001, .25]),
+	Object.freeze([.001, .9]),
+	Object.freeze([0, 4]),
+	Object.freeze([0, 1]),
+	Object.freeze([1, 6]),
+	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])), {
+		request_retention: e?.request_retention || .9,
+		maximum_interval: e?.maximum_interval || 36500,
+		w: t,
+		enable_fuzz: e?.enable_fuzz ?? !1,
+		enable_short_term: e?.enable_short_term ?? !0
+	};
 };
-function P(t, e) {
-  const i = { due: t ? d.time(t) : /* @__PURE__ */ new Date(), stability: 0, difficulty: 0, elapsed_days: 0, scheduled_days: 0, reps: 0, lapses: 0, state: h.New, last_review: void 0 };
-  return e && typeof e == "function" ? e(i) : i;
-}
-class Ke {
-  constructor(e) {
-    _(this, "c");
-    _(this, "s0");
-    _(this, "s1");
-    _(this, "s2");
-    const i = Be();
-    this.c = 1, this.s0 = i(" "), this.s1 = i(" "), this.s2 = i(" "), e == null && (e = +/* @__PURE__ */ new Date()), this.s0 -= i(e), this.s0 < 0 && (this.s0 += 1), this.s1 -= i(e), this.s1 < 0 && (this.s1 += 1), this.s2 -= i(e), this.s2 < 0 && (this.s2 += 1);
-  }
-  next() {
-    const e = 2091639 * this.s0 + this.c * 23283064365386963e-26;
-    return this.s0 = this.s1, this.s1 = this.s2, this.s2 = e - (this.c = e | 0), this.s2;
-  }
-  set state(e) {
-    this.c = e.c, this.s0 = e.s0, this.s1 = e.s1, this.s2 = e.s2;
-  }
-  get state() {
-    return { c: this.c, s0: this.s0, s1: this.s1, s2: this.s2 };
-  }
-}
-function Be() {
-  let t = 4022871197;
-  return function(e) {
-    e = String(e);
-    for (let i = 0; i < e.length; i++) {
-      t += e.charCodeAt(i);
-      let r = 0.02519603282416938 * t;
-      t = r >>> 0, r -= t, r *= t, t = r >>> 0, r -= t, t += r * 4294967296;
-    }
-    return (t >>> 0) * 23283064365386963e-26;
-  };
-}
-function Xe(t) {
-  const e = new Ke(t), i = () => e.next();
-  return i.int32 = () => e.next() * 4294967296 | 0, i.double = () => i() + (i() * 2097152 | 0) * 11102230246251565e-32, i.state = () => e.state, i.importState = (r) => (e.state = r, i), i;
-}
-const _e = -0.5, ye = 19 / 81;
-function Ze(t, e) {
-  return +Math.pow(1 + ye * t / e, _e).toFixed(8);
-}
-class Je {
-  constructor(e) {
-    _(this, "param");
-    _(this, "intervalModifier");
-    _(this, "_seed");
-    _(this, "forgetting_curve", Ze);
-    this.param = new Proxy(W(e), this.params_handler_proxy()), this.intervalModifier = this.calculate_interval_modifier(this.param.request_retention);
-  }
-  get interval_modifier() {
-    return this.intervalModifier;
-  }
-  set seed(e) {
-    this._seed = e;
-  }
-  calculate_interval_modifier(e) {
-    if (e <= 0 || e > 1) throw new Error("Requested retention rate should be in the range (0,1]");
-    return +((Math.pow(e, 1 / _e) - 1) / ye).toFixed(8);
-  }
-  get parameters() {
-    return this.param;
-  }
-  set parameters(e) {
-    this.update_parameters(e);
-  }
-  params_handler_proxy() {
-    const e = this;
-    return { set: function(i, r, s) {
-      return r === "request_retention" && Number.isFinite(s) && (e.intervalModifier = e.calculate_interval_modifier(Number(s))), Reflect.set(i, r, s), !0;
-    } };
-  }
-  update_parameters(e) {
-    const i = W(e);
-    for (const r in i) if (r in this.param) {
-      const s = r;
-      this.param[s] = i[s];
-    }
-  }
-  init_stability(e) {
-    return Math.max(this.param.w[e - 1], 0.1);
-  }
-  init_difficulty(e) {
-    return this.constrain_difficulty(this.param.w[4] - Math.exp((e - 1) * this.param.w[5]) + 1);
-  }
-  apply_fuzz(e, i) {
-    if (!this.param.enable_fuzz || e < 2.5) return Math.round(e);
-    const r = Xe(this._seed)(), { min_ivl: s, max_ivl: n } = $e(e, i, this.param.maximum_interval);
-    return Math.floor(r * (n - s + 1) + s);
-  }
-  next_interval(e, i) {
-    const r = Math.min(Math.max(1, Math.round(e * this.intervalModifier)), this.param.maximum_interval);
-    return this.apply_fuzz(r, i);
-  }
-  linear_damping(e, i) {
-    return +(e * (10 - i) / 9).toFixed(8);
-  }
-  next_difficulty(e, i) {
-    const r = -this.param.w[6] * (i - 3), s = e + this.linear_damping(r, e);
-    return this.constrain_difficulty(this.mean_reversion(this.init_difficulty(l.Easy), s));
-  }
-  constrain_difficulty(e) {
-    return Math.min(Math.max(+e.toFixed(8), 1), 10);
-  }
-  mean_reversion(e, i) {
-    return +(this.param.w[7] * e + (1 - this.param.w[7]) * i).toFixed(8);
-  }
-  next_recall_stability(e, i, r, s) {
-    const n = l.Hard === s ? this.param.w[15] : 1, a = l.Easy === s ? this.param.w[16] : 1;
-    return +b(i * (1 + Math.exp(this.param.w[8]) * (11 - e) * Math.pow(i, -this.param.w[9]) * (Math.exp((1 - r) * this.param.w[10]) - 1) * n * a), p, 36500).toFixed(8);
-  }
-  next_forget_stability(e, i, r) {
-    return +b(this.param.w[11] * Math.pow(e, -this.param.w[12]) * (Math.pow(i + 1, this.param.w[13]) - 1) * Math.exp((1 - r) * this.param.w[14]), p, 36500).toFixed(8);
-  }
-  next_short_term_stability(e, i) {
-    return +b(e * Math.exp(this.param.w[17] * (i - 3 + this.param.w[18])), p, 36500).toFixed(8);
-  }
-  next_state(e, i, r) {
-    const { difficulty: s, stability: n } = e ?? { difficulty: 0, stability: 0 };
-    if (i < 0) throw new Error(`Invalid delta_t "${i}"`);
-    if (r < 0 || r > 4) throw new Error(`Invalid grade "${r}"`);
-    if (s === 0 && n === 0) return { difficulty: this.init_difficulty(r), stability: this.init_stability(r) };
-    if (r === 0) return { difficulty: s, stability: n };
-    if (s < 1 || n < p) throw new Error(`Invalid memory state { difficulty: ${s}, stability: ${n} }`);
-    const a = this.forgetting_curve(i, n), o = this.next_recall_stability(s, n, a, r), c = this.next_forget_stability(s, n, a), u = this.next_short_term_stability(n, r);
-    let f = o;
-    if (r === 1) {
-      let [y, g] = [0, 0];
-      this.param.enable_short_term && (y = this.param.w[17], g = this.param.w[18]);
-      const E = n / Math.exp(y * g);
-      f = b(+E.toFixed(8), p, c);
-    }
-    return i === 0 && this.param.enable_short_term && (f = u), { difficulty: this.next_difficulty(s, r), stability: f };
-  }
-}
-function me() {
-  const t = this.review_time.getTime(), e = this.current.reps, i = this.current.difficulty * this.current.stability;
-  return `${t}_${e}_${i}`;
-}
-var Y = ((t) => (t.SCHEDULER = "Scheduler", t.SEED = "Seed", t))(Y || {});
-class we {
-  constructor(e, i, r, s = { seed: me }) {
-    _(this, "last");
-    _(this, "current");
-    _(this, "review_time");
-    _(this, "next", /* @__PURE__ */ new Map());
-    _(this, "algorithm");
-    _(this, "initSeedStrategy");
-    this.algorithm = r, this.initSeedStrategy = s.seed.bind(this), this.last = d.card(e), this.current = d.card(e), this.review_time = d.time(i), this.init();
-  }
-  init() {
-    const { state: e, last_review: i } = this.current;
-    let r = 0;
-    e !== h.New && i && (r = Le(i, this.review_time)), this.current.last_review = this.review_time, this.current.elapsed_days = r, this.current.reps += 1, this.algorithm.seed = this.initSeedStrategy();
-  }
-  preview() {
-    return { [l.Again]: this.review(l.Again), [l.Hard]: this.review(l.Hard), [l.Good]: this.review(l.Good), [l.Easy]: this.review(l.Easy), [Symbol.iterator]: this.previewIterator.bind(this) };
-  }
-  *previewIterator() {
-    for (const e of he) yield this.review(e);
-  }
-  review(e) {
-    const { state: i } = this.last;
-    let r;
-    switch (i) {
-      case h.New:
-        r = this.newState(e);
-        break;
-      case h.Learning:
-      case h.Relearning:
-        r = this.learningState(e);
-        break;
-      case h.Review:
-        r = this.reviewState(e);
-        break;
-    }
-    if (r) return r;
-    throw new Error("Invalid grade");
-  }
-  buildLog(e) {
-    const { last_review: i, due: r, elapsed_days: s } = this.last;
-    return { rating: e, state: this.current.state, due: i || r, stability: this.current.stability, difficulty: this.current.difficulty, elapsed_days: this.current.elapsed_days, last_elapsed_days: s, scheduled_days: this.current.scheduled_days, review: this.review_time };
-  }
-}
-class re extends we {
-  newState(e) {
-    const i = this.next.get(e);
-    if (i) return i;
-    const r = d.card(this.current);
-    switch (r.difficulty = this.algorithm.init_difficulty(e), r.stability = this.algorithm.init_stability(e), e) {
-      case l.Again:
-        r.scheduled_days = 0, r.due = this.review_time.scheduler(1), r.state = h.Learning;
-        break;
-      case l.Hard:
-        r.scheduled_days = 0, r.due = this.review_time.scheduler(5), r.state = h.Learning;
-        break;
-      case l.Good:
-        r.scheduled_days = 0, r.due = this.review_time.scheduler(10), r.state = h.Learning;
-        break;
-      case l.Easy: {
-        const n = this.algorithm.next_interval(r.stability, this.current.elapsed_days);
-        r.scheduled_days = n, r.due = this.review_time.scheduler(n, !0), r.state = h.Review;
-        break;
-      }
-      default:
-        throw new Error("Invalid grade");
-    }
-    const s = { card: r, log: this.buildLog(e) };
-    return this.next.set(e, s), s;
-  }
-  learningState(e) {
-    const i = this.next.get(e);
-    if (i) return i;
-    const { state: r, difficulty: s, stability: n } = this.last, a = d.card(this.current), o = this.current.elapsed_days;
-    switch (a.difficulty = this.algorithm.next_difficulty(s, e), a.stability = this.algorithm.next_short_term_stability(n, e), e) {
-      case l.Again: {
-        a.scheduled_days = 0, a.due = this.review_time.scheduler(5, !1), a.state = r;
-        break;
-      }
-      case l.Hard: {
-        a.scheduled_days = 0, a.due = this.review_time.scheduler(10), a.state = r;
-        break;
-      }
-      case l.Good: {
-        const u = this.algorithm.next_interval(a.stability, o);
-        a.scheduled_days = u, a.due = this.review_time.scheduler(u, !0), a.state = h.Review;
-        break;
-      }
-      case l.Easy: {
-        const u = this.algorithm.next_short_term_stability(n, l.Good), f = this.algorithm.next_interval(u, o), y = Math.max(this.algorithm.next_interval(a.stability, o), f + 1);
-        a.scheduled_days = y, a.due = this.review_time.scheduler(y, !0), a.state = h.Review;
-        break;
-      }
-      default:
-        throw new Error("Invalid grade");
-    }
-    const c = { card: a, log: this.buildLog(e) };
-    return this.next.set(e, c), c;
-  }
-  reviewState(e) {
-    const i = this.next.get(e);
-    if (i) return i;
-    const r = this.current.elapsed_days, { difficulty: s, stability: n } = this.last, a = this.algorithm.forgetting_curve(r, n), o = d.card(this.current), c = d.card(this.current), u = d.card(this.current), f = d.card(this.current);
-    this.next_ds(o, c, u, f, s, n, a), this.next_interval(o, c, u, f, r), this.next_state(o, c, u, f), o.lapses += 1;
-    const y = { card: o, log: this.buildLog(l.Again) }, g = { card: c, log: super.buildLog(l.Hard) }, E = { card: u, log: super.buildLog(l.Good) }, R = { card: f, log: super.buildLog(l.Easy) };
-    return this.next.set(l.Again, y), this.next.set(l.Hard, g), this.next.set(l.Good, E), this.next.set(l.Easy, R), this.next.get(e);
-  }
-  next_ds(e, i, r, s, n, a, o) {
-    e.difficulty = this.algorithm.next_difficulty(n, l.Again);
-    const c = a / Math.exp(this.algorithm.parameters.w[17] * this.algorithm.parameters.w[18]), u = this.algorithm.next_forget_stability(n, a, o);
-    e.stability = b(+c.toFixed(8), p, u), i.difficulty = this.algorithm.next_difficulty(n, l.Hard), i.stability = this.algorithm.next_recall_stability(n, a, o, l.Hard), r.difficulty = this.algorithm.next_difficulty(n, l.Good), r.stability = this.algorithm.next_recall_stability(n, a, o, l.Good), s.difficulty = this.algorithm.next_difficulty(n, l.Easy), s.stability = this.algorithm.next_recall_stability(n, a, o, l.Easy);
-  }
-  next_interval(e, i, r, s, n) {
-    let a, o;
-    a = this.algorithm.next_interval(i.stability, n), o = this.algorithm.next_interval(r.stability, n), a = Math.min(a, o), o = Math.max(o, a + 1);
-    const c = Math.max(this.algorithm.next_interval(s.stability, n), o + 1);
-    e.scheduled_days = 0, e.due = this.review_time.scheduler(5), i.scheduled_days = a, i.due = this.review_time.scheduler(a, !0), r.scheduled_days = o, r.due = this.review_time.scheduler(o, !0), s.scheduled_days = c, s.due = this.review_time.scheduler(c, !0);
-  }
-  next_state(e, i, r, s) {
-    e.state = h.Relearning, i.state = h.Review, r.state = h.Review, s.state = h.Review;
-  }
-}
-class se extends we {
-  newState(e) {
-    const i = this.next.get(e);
-    if (i) return i;
-    this.current.scheduled_days = 0, this.current.elapsed_days = 0;
-    const r = d.card(this.current), s = d.card(this.current), n = d.card(this.current), a = d.card(this.current);
-    return this.init_ds(r, s, n, a), this.next_interval(r, s, n, a, 0), this.next_state(r, s, n, a), this.update_next(r, s, n, a), this.next.get(e);
-  }
-  init_ds(e, i, r, s) {
-    e.difficulty = this.algorithm.init_difficulty(l.Again), e.stability = this.algorithm.init_stability(l.Again), i.difficulty = this.algorithm.init_difficulty(l.Hard), i.stability = this.algorithm.init_stability(l.Hard), r.difficulty = this.algorithm.init_difficulty(l.Good), r.stability = this.algorithm.init_stability(l.Good), s.difficulty = this.algorithm.init_difficulty(l.Easy), s.stability = this.algorithm.init_stability(l.Easy);
-  }
-  learningState(e) {
-    return this.reviewState(e);
-  }
-  reviewState(e) {
-    const i = this.next.get(e);
-    if (i) return i;
-    const r = this.current.elapsed_days, { difficulty: s, stability: n } = this.last, a = this.algorithm.forgetting_curve(r, n), o = d.card(this.current), c = d.card(this.current), u = d.card(this.current), f = d.card(this.current);
-    return this.next_ds(o, c, u, f, s, n, a), this.next_interval(o, c, u, f, r), this.next_state(o, c, u, f), o.lapses += 1, this.update_next(o, c, u, f), this.next.get(e);
-  }
-  next_ds(e, i, r, s, n, a, o) {
-    e.difficulty = this.algorithm.next_difficulty(n, l.Again);
-    const c = this.algorithm.next_forget_stability(n, a, o);
-    e.stability = b(a, p, c), i.difficulty = this.algorithm.next_difficulty(n, l.Hard), i.stability = this.algorithm.next_recall_stability(n, a, o, l.Hard), r.difficulty = this.algorithm.next_difficulty(n, l.Good), r.stability = this.algorithm.next_recall_stability(n, a, o, l.Good), s.difficulty = this.algorithm.next_difficulty(n, l.Easy), s.stability = this.algorithm.next_recall_stability(n, a, o, l.Easy);
-  }
-  next_interval(e, i, r, s, n) {
-    let a, o, c, u;
-    a = this.algorithm.next_interval(e.stability, n), o = this.algorithm.next_interval(i.stability, n), c = this.algorithm.next_interval(r.stability, n), u = this.algorithm.next_interval(s.stability, n), a = Math.min(a, o), o = Math.max(o, a + 1), c = Math.max(c, o + 1), u = Math.max(u, c + 1), e.scheduled_days = a, e.due = this.review_time.scheduler(a, !0), i.scheduled_days = o, i.due = this.review_time.scheduler(o, !0), r.scheduled_days = c, r.due = this.review_time.scheduler(c, !0), s.scheduled_days = u, s.due = this.review_time.scheduler(u, !0);
-  }
-  next_state(e, i, r, s) {
-    e.state = h.Review, i.state = h.Review, r.state = h.Review, s.state = h.Review;
-  }
-  update_next(e, i, r, s) {
-    const n = { card: e, log: this.buildLog(l.Again) }, a = { card: i, log: super.buildLog(l.Hard) }, o = { card: r, log: super.buildLog(l.Good) }, c = { card: s, log: super.buildLog(l.Easy) };
-    this.next.set(l.Again, n), this.next.set(l.Hard, a), this.next.set(l.Good, o), this.next.set(l.Easy, c);
-  }
-}
-class Qe {
-  constructor(e) {
-    _(this, "fsrs");
-    this.fsrs = e;
-  }
-  replay(e, i, r) {
-    return this.fsrs.next(e, i, r);
-  }
-  handleManualRating(e, i, r, s, n, a, o) {
-    if (typeof i > "u") throw new Error("reschedule: state is required for manual rating");
-    let c, u;
-    if (i === h.New) c = { rating: l.Manual, state: i, due: o ?? r, stability: e.stability, difficulty: e.difficulty, elapsed_days: s, last_elapsed_days: e.elapsed_days, scheduled_days: e.scheduled_days, review: r }, u = P(r), u.last_review = r;
-    else {
-      if (typeof o > "u") throw new Error("reschedule: due is required for manual rating");
-      const f = o.diff(r, "days");
-      c = { rating: l.Manual, state: e.state, due: e.last_review || e.due, stability: e.stability, difficulty: e.difficulty, elapsed_days: s, last_elapsed_days: e.elapsed_days, scheduled_days: e.scheduled_days, review: r }, u = { ...e, state: i, due: o, last_review: r, stability: n || e.stability, difficulty: a || e.difficulty, elapsed_days: s, scheduled_days: f, reps: e.reps + 1 };
-    }
-    return { card: u, log: c };
-  }
-  reschedule(e, i) {
-    const r = [];
-    let s = P(e.due);
-    for (const n of i) {
-      let a;
-      if (n.review = d.time(n.review), n.rating === l.Manual) {
-        let o = 0;
-        s.state !== h.New && s.last_review && (o = n.review.diff(s.last_review, "days")), a = this.handleManualRating(s, n.state, n.review, o, n.stability, n.difficulty, n.due ? d.time(n.due) : void 0);
-      } else a = this.replay(s, n.review, n.rating);
-      r.push(a), s = a.card;
-    }
-    return r;
-  }
-  calculateManualRecord(e, i, r, s) {
-    if (!r) return null;
-    const { card: n, log: a } = r, o = d.card(e);
-    return o.due.getTime() === n.due.getTime() ? null : (o.scheduled_days = n.due.diff(o.due, "days"), this.handleManualRating(o, n.state, d.time(i), a.elapsed_days, s ? n.stability : void 0, s ? n.difficulty : void 0, n.due));
-  }
-}
-class Ve extends Je {
-  constructor(i) {
-    super(i);
-    _(this, "strategyHandler", /* @__PURE__ */ new Map());
-    _(this, "Scheduler");
-    const { enable_short_term: r } = this.parameters;
-    this.Scheduler = r ? re : se;
-  }
-  params_handler_proxy() {
-    const i = this;
-    return { set: function(r, s, n) {
-      return s === "request_retention" && Number.isFinite(n) ? i.intervalModifier = i.calculate_interval_modifier(Number(n)) : s === "enable_short_term" && (i.Scheduler = n === !0 ? re : se), Reflect.set(r, s, n), !0;
-    } };
-  }
-  useStrategy(i, r) {
-    return this.strategyHandler.set(i, r), this;
-  }
-  clearStrategy(i) {
-    return i ? this.strategyHandler.delete(i) : this.strategyHandler.clear(), this;
-  }
-  getScheduler(i, r) {
-    const s = this.strategyHandler.get(Y.SEED), n = this.strategyHandler.get(Y.SCHEDULER) || this.Scheduler, a = s || me;
-    return new n(i, r, this, { seed: a });
-  }
-  repeat(i, r, s) {
-    const n = this.getScheduler(i, r).preview();
-    return s && typeof s == "function" ? s(n) : n;
-  }
-  next(i, r, s, n) {
-    const a = this.getScheduler(i, r), o = d.rating(s);
-    if (o === l.Manual) throw new Error("Cannot review a manual rating");
-    const c = a.review(o);
-    return n && typeof n == "function" ? n(c) : c;
-  }
-  get_retrievability(i, r, s = !0) {
-    const n = d.card(i);
-    r = r ? d.time(r) : /* @__PURE__ */ new Date();
-    const a = n.state !== h.New ? Math.max(r.diff(n.last_review, "days"), 0) : 0, o = n.state !== h.New ? this.forgetting_curve(a, +n.stability.toFixed(8)) : 0;
-    return s ? `${(o * 100).toFixed(2)}%` : o;
-  }
-  rollback(i, r, s) {
-    const n = d.card(i), a = d.review_log(r);
-    if (a.rating === l.Manual) throw new Error("Cannot rollback a manual rating");
-    let o, c, u;
-    switch (a.state) {
-      case h.New:
-        o = a.due, c = void 0, u = 0;
-        break;
-      case h.Learning:
-      case h.Relearning:
-      case h.Review:
-        o = a.review, c = a.due, u = n.lapses - (a.rating === l.Again && a.state === h.Review ? 1 : 0);
-        break;
-    }
-    const f = { ...n, due: o, stability: a.stability, difficulty: a.difficulty, elapsed_days: a.last_elapsed_days, scheduled_days: a.scheduled_days, reps: Math.max(0, n.reps - 1), lapses: Math.max(0, u), state: a.state, last_review: c };
-    return s && typeof s == "function" ? s(f) : f;
-  }
-  forget(i, r, s = !1, n) {
-    const a = d.card(i);
-    r = d.time(r);
-    const o = a.state === h.New ? 0 : r.diff(a.last_review, "days"), c = { rating: l.Manual, state: a.state, due: a.due, stability: a.stability, difficulty: a.difficulty, elapsed_days: 0, last_elapsed_days: a.elapsed_days, scheduled_days: o, review: r }, u = { card: { ...a, due: r, stability: 0, difficulty: 0, elapsed_days: 0, scheduled_days: 0, reps: s ? 0 : a.reps, lapses: s ? 0 : a.lapses, state: h.New, last_review: a.last_review }, log: c };
-    return n && typeof n == "function" ? n(u) : u;
-  }
-  reschedule(i, r = [], s = {}) {
-    const { recordLogHandler: n, reviewsOrderBy: a, skipManual: o = !0, now: c = /* @__PURE__ */ new Date(), update_memory_state: u = !1 } = s;
-    a && typeof a == "function" && r.sort(a), o && (r = r.filter((ze) => ze.rating !== l.Manual));
-    const f = new Qe(this), y = f.reschedule(s.first_card || P(), r), g = y.length, E = d.card(i), R = f.calculateManualRecord(E, c, g ? y[g - 1] : void 0, u);
-    return n && typeof n == "function" ? { collections: y.map(n), reschedule_item: R ? n(R) : null } : { collections: y, reschedule_item: R };
-  }
-}
-const et = (t) => new Ve(t || {}), tt = W({
-  request_retention: Pe,
-  enable_fuzz: !0,
-  maximum_interval: 100
-}), pe = et(tt), ge = (t) => t.due ? t : { ...t, due: /* @__PURE__ */ new Date() }, it = (t) => fe.indexOf(t), ve = (t) => ({
-  due: t.due,
-  stability: t.stability,
-  difficulty: t.difficulty,
-  elapsed_days: t.elapsedDays,
-  scheduled_days: t.scheduledDays,
-  reps: t.reps,
-  lapses: t.lapses,
-  state: it(t.state),
-  last_review: t.lastReview
-}), rt = (t, e, i) => {
-  const r = /* @__PURE__ */ new Date(), s = ve(ge(t));
-  return pe.repeat(s, r, (a) => {
-    const o = at(e), c = a[o], u = nt(c.card, t), f = c.log, y = {
-      id: 0,
-      // will be set by the database
-      cardReviewId: t.id,
-      grade: e,
-      state: be(f.state),
-      due: f.due,
-      stability: f.stability,
-      difficulty: f.difficulty,
-      elapsedDays: f.elapsed_days,
-      lastElapsedDays: f.last_elapsed_days,
-      scheduledDays: f.scheduled_days,
-      review: f.review,
-      duration: i
-    };
-    return { nextCard: u, reviewLog: y };
-  });
+function x(e, t) {
+	let n = {
+		due: e ? d.time(e) : /* @__PURE__ */ new Date(),
+		stability: 0,
+		difficulty: 0,
+		elapsed_days: 0,
+		scheduled_days: 0,
+		reps: 0,
+		lapses: 0,
+		state: l.New,
+		last_review: void 0
+	};
+	return t && typeof t == "function" ? t(n) : n;
+}
+var ce = class {
+	c;
+	s0;
+	s1;
+	s2;
+	constructor(e) {
+		let t = le();
+		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() {
+		let e = 2091639 * this.s0 + this.c * 23283064365386963e-26;
+		return this.s0 = this.s1, this.s1 = this.s2, this.s2 = e - (this.c = e | 0), this.s2;
+	}
+	set state(e) {
+		this.c = e.c, this.s0 = e.s0, this.s1 = e.s1, this.s2 = e.s2;
+	}
+	get state() {
+		return {
+			c: this.c,
+			s0: this.s0,
+			s1: this.s1,
+			s2: this.s2
+		};
+	}
 };
-function At(t) {
-  const e = /* @__PURE__ */ new Date(), i = ve(ge(t)), r = pe.repeat(i, e), s = Object.fromEntries(V.map((n) => [n, /* @__PURE__ */ new Date()]));
-  for (const n of he) {
-    const a = r[n].card.due, o = st(n);
-    s[o] = a;
-  }
-  return s;
-}
-function st(t) {
-  return V[t];
-}
-function be(t) {
-  return fe[t];
-}
-function nt(t, e) {
-  return {
-    ...e,
-    due: t.due,
-    stability: t.stability,
-    difficulty: t.difficulty,
-    elapsedDays: t.elapsed_days,
-    scheduledDays: t.scheduled_days,
-    reps: t.reps,
-    lapses: t.lapses,
-    state: be(t.state),
-    lastReview: t.last_review ?? null
-  };
-}
-function at(t) {
-  const e = V.indexOf(t);
-  if (e === -1)
-    throw new Error(`Invalid rating: ${t}`);
-  return e;
-}
-function Tt(t, e) {
-  const i = P();
-  return {
-    id: "",
-    due: null,
-    stability: i.stability,
-    difficulty: i.difficulty,
-    elapsedDays: i.elapsed_days,
-    scheduledDays: i.scheduled_days,
-    reps: i.reps,
-    lapses: i.lapses,
-    state: Ne.New,
-    lastReview: i.last_review ?? null,
-    userDeckStudyId: t,
-    cardId: e
-  };
-}
-var xe = Symbol.for("immer-nothing"), ne = Symbol.for("immer-draftable"), w = Symbol.for("immer-state"), ot = process.env.NODE_ENV !== "production" ? [
-  // All error codes, starting by 0:
-  function(t) {
-    return `The plugin for '${t}' has not been loaded into Immer. To enable the plugin, import and call \`enable${t}()\` when initializing your application.`;
-  },
-  function(t) {
-    return `produce can only be called on things that are draftable: plain objects, arrays, Map, Set or classes that are marked with '[immerable]: true'. Got '${t}'`;
-  },
-  "This object has been frozen and should not be mutated",
-  function(t) {
-    return "Cannot use a proxy that has been revoked. Did you pass an object from inside an immer function to an async process? " + t;
-  },
-  "An immer producer returned a new value *and* modified its draft. Either return a new value *or* modify the draft.",
-  "Immer forbids circular references",
-  "The first or second argument to `produce` must be a function",
-  "The third argument to `produce` must be a function or undefined",
-  "First argument to `createDraft` must be a plain object, an array, or an immerable object",
-  "First argument to `finishDraft` must be a draft returned by `createDraft`",
-  function(t) {
-    return `'current' expects a draft, got: ${t}`;
-  },
-  "Object.defineProperty() cannot be used on an Immer draft",
-  "Object.setPrototypeOf() cannot be used on an Immer draft",
-  "Immer only supports deleting array indices",
-  "Immer only supports setting array indices and the 'length' property",
-  function(t) {
-    return `'original' expects a draft, got: ${t}`;
-  }
-  // Note: if more errors are added, the errorOffset in Patches.ts should be increased
-  // See Patches.ts for additional errors
-] : [];
-function m(t, ...e) {
-  if (process.env.NODE_ENV !== "production") {
-    const i = ot[t], r = typeof i == "function" ? i.apply(null, e) : i;
-    throw new Error(`[Immer] ${r}`);
-  }
-  throw new Error(
-    `[Immer] minified error nr: ${t}. Full error at: https://bit.ly/3cXEKWf`
-  );
-}
-var C = Object.getPrototypeOf;
-function S(t) {
-  return !!t && !!t[w];
-}
-function x(t) {
-  var e;
-  return t ? Me(t) || Array.isArray(t) || !!t[ne] || !!((e = t.constructor) != null && e[ne]) || F(t) || H(t) : !1;
-}
-var lt = Object.prototype.constructor.toString(), ae = /* @__PURE__ */ new WeakMap();
-function Me(t) {
-  if (!t || typeof t != "object")
-    return !1;
-  const e = Object.getPrototypeOf(t);
-  if (e === null || e === Object.prototype)
-    return !0;
-  const i = Object.hasOwnProperty.call(e, "constructor") && e.constructor;
-  if (i === Object)
-    return !0;
-  if (typeof i != "function")
-    return !1;
-  let r = ae.get(i);
-  return r === void 0 && (r = Function.toString.call(i), ae.set(i, r)), r === lt;
-}
-function A(t, e, i = !0) {
-  j(t) === 0 ? (i ? Reflect.ownKeys(t) : Object.keys(t)).forEach((s) => {
-    e(s, t[s], t);
-  }) : t.forEach((r, s) => e(s, r, t));
-}
-function j(t) {
-  const e = t[w];
-  return e ? e.type_ : Array.isArray(t) ? 1 : F(t) ? 2 : H(t) ? 3 : 0;
-}
-function K(t, e) {
-  return j(t) === 2 ? t.has(e) : Object.prototype.hasOwnProperty.call(t, e);
-}
-function Se(t, e, i) {
-  const r = j(t);
-  r === 2 ? t.set(e, i) : r === 3 ? t.add(i) : t[e] = i;
-}
-function ct(t, e) {
-  return t === e ? t !== 0 || 1 / t === 1 / e : t !== t && e !== e;
-}
-function F(t) {
-  return t instanceof Map;
-}
-function H(t) {
-  return t instanceof Set;
-}
-function v(t) {
-  return t.copy_ || t.base_;
-}
-function B(t, e) {
-  if (F(t))
-    return new Map(t);
-  if (H(t))
-    return new Set(t);
-  if (Array.isArray(t))
-    return Array.prototype.slice.call(t);
-  const i = Me(t);
-  if (e === !0 || e === "class_only" && !i) {
-    const r = Object.getOwnPropertyDescriptors(t);
-    delete r[w];
-    let s = Reflect.ownKeys(r);
-    for (let n = 0; n < s.length; n++) {
-      const a = s[n], o = r[a];
-      o.writable === !1 && (o.writable = !0, o.configurable = !0), (o.get || o.set) && (r[a] = {
-        configurable: !0,
-        writable: !0,
-        // could live with !!desc.set as well here...
-        enumerable: o.enumerable,
-        value: t[a]
-      });
-    }
-    return Object.create(C(t), r);
-  } else {
-    const r = C(t);
-    if (r !== null && i)
-      return { ...t };
-    const s = Object.create(r);
-    return Object.assign(s, t);
-  }
-}
-function ee(t, e = !1) {
-  return $(t) || S(t) || !x(t) || (j(t) > 1 && Object.defineProperties(t, {
-    set: I,
-    add: I,
-    clear: I,
-    delete: I
-  }), Object.freeze(t), e && Object.values(t).forEach((i) => ee(i, !0))), t;
-}
-function ut() {
-  m(2);
-}
-var I = {
-  value: ut
+function le() {
+	let e = 4022871197;
+	return function(t) {
+		t = String(t);
+		for (let n = 0; n < t.length; n++) {
+			e += t.charCodeAt(n);
+			let r = .02519603282416938 * e;
+			e = r >>> 0, r -= e, r *= e, e = r >>> 0, r -= e, e += r * 4294967296;
+		}
+		return (e >>> 0) * 23283064365386963e-26;
+	};
+}
+function ue(e) {
+	let t = new ce(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 me = class {
+	param;
+	intervalModifier;
+	_seed;
+	constructor(e) {
+		this.param = new Proxy(b(e), this.params_handler_proxy()), this.intervalModifier = this.calculate_interval_modifier(this.param.request_retention);
+	}
+	get interval_modifier() {
+		return this.intervalModifier;
+	}
+	set seed(e) {
+		this._seed = e;
+	}
+	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);
+	}
+	get parameters() {
+		return this.param;
+	}
+	set parameters(e) {
+		this.update_parameters(e);
+	}
+	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))), Reflect.set(t, n, r), !0;
+		} };
+	}
+	update_parameters(e) {
+		let t = b(e);
+		for (let e in t) if (e in this.param) {
+			let n = e;
+			this.param[n] = t[n];
+		}
+	}
+	init_stability(e) {
+		return Math.max(this.param.w[e - 1], .1);
+	}
+	init_difficulty(e) {
+		return this.constrain_difficulty(this.param.w[4] - Math.exp((e - 1) * this.param.w[5]) + 1);
+	}
+	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);
+		return Math.floor(n * (i - r + 1) + r);
+	}
+	next_interval(e, t) {
+		let n = Math.min(Math.max(1, Math.round(e * this.intervalModifier)), this.param.maximum_interval);
+		return this.apply_fuzz(n, t);
+	}
+	linear_damping(e, t) {
+		return +(e * (10 - t) / 9).toFixed(8);
+	}
+	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));
+	}
+	constrain_difficulty(e) {
+		return Math.min(Math.max(+e.toFixed(8), 1), 10);
+	}
+	mean_reversion(e, t) {
+		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;
+		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) {
+		return +v(this.param.w[11] * e ** +-this.param.w[12] * ((t + 1) ** +this.param.w[13] - 1) * Math.exp((1 - n) * this.param.w[14]), y, 36500).toFixed(8);
+	}
+	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;
+	next_state(e, t, n) {
+		let { difficulty: r, stability: i } = e ?? {
+			difficulty: 0,
+			stability: 0
+		};
+		if (t < 0) throw Error(`Invalid delta_t "${t}"`);
+		if (n < 0 || n > 4) throw Error(`Invalid grade "${n}"`);
+		if (r === 0 && i === 0) return {
+			difficulty: this.init_difficulty(n),
+			stability: this.init_stability(n)
+		};
+		if (n === 0) return {
+			difficulty: r,
+			stability: i
+		};
+		if (r < 1 || i < .01) throw Error(`Invalid memory state { difficulty: ${r}, stability: ${i} }`);
+		let a = this.forgetting_curve(t, i), o = this.next_recall_stability(r, i, a, n), s = this.next_forget_stability(r, i, a), c = this.next_short_term_stability(i, n), l = o;
+		if (n === 1) {
+			let [e, t] = [0, 0];
+			this.param.enable_short_term && (e = this.param.w[17], t = this.param.w[18]), l = v(+(i / Math.exp(e * t)).toFixed(8), y, s);
+		}
+		return t === 0 && this.param.enable_short_term && (l = c), {
+			difficulty: this.next_difficulty(r, n),
+			stability: l
+		};
+	}
 };
-function $(t) {
-  return t === null || typeof t != "object" ? !0 : Object.isFrozen(t);
-}
-var dt = {};
-function M(t) {
-  const e = dt[t];
-  return e || m(0, t), e;
-}
-var z;
-function Ee() {
-  return z;
-}
-function ft(t, e) {
-  return {
-    drafts_: [],
-    parent_: t,
-    immer_: e,
-    // Whenever the modified draft contains a draft from another scope, we
-    // need to prevent auto-freezing so the unowned draft can be finalized.
-    canAutoFreeze_: !0,
-    unfinalizedDrafts_: 0
-  };
-}
-function oe(t, e) {
-  e && (M("Patches"), t.patches_ = [], t.inversePatches_ = [], t.patchListener_ = e);
-}
-function X(t) {
-  Z(t), t.drafts_.forEach(ht), t.drafts_ = null;
-}
-function Z(t) {
-  t === z && (z = t.parent_);
-}
-function le(t) {
-  return z = ft(z, t);
-}
-function ht(t) {
-  const e = t[w];
-  e.type_ === 0 || e.type_ === 1 ? e.revoke_() : e.revoked_ = !0;
-}
-function ce(t, e) {
-  e.unfinalizedDrafts_ = e.drafts_.length;
-  const i = e.drafts_[0];
-  return t !== void 0 && t !== i ? (i[w].modified_ && (X(e), m(4)), x(t) && (t = T(e, t), e.parent_ || k(e, t)), e.patches_ && M("Patches").generateReplacementPatches_(
-    i[w].base_,
-    t,
-    e.patches_,
-    e.inversePatches_
-  )) : t = T(e, i, []), X(e), e.patches_ && e.patchListener_(e.patches_, e.inversePatches_), t !== xe ? t : void 0;
-}
-function T(t, e, i) {
-  if ($(e))
-    return e;
-  const r = t.immer_.shouldUseStrictIteration(), s = e[w];
-  if (!s)
-    return A(
-      e,
-      (n, a) => ue(t, s, e, n, a, i),
-      r
-    ), e;
-  if (s.scope_ !== t)
-    return e;
-  if (!s.modified_)
-    return k(t, s.base_, !0), s.base_;
-  if (!s.finalized_) {
-    s.finalized_ = !0, s.scope_.unfinalizedDrafts_--;
-    const n = s.copy_;
-    let a = n, o = !1;
-    s.type_ === 3 && (a = new Set(n), n.clear(), o = !0), A(
-      a,
-      (c, u) => ue(
-        t,
-        s,
-        n,
-        c,
-        u,
-        i,
-        o
-      ),
-      r
-    ), k(t, n, !1), i && t.patches_ && M("Patches").generatePatches_(
-      s,
-      i,
-      t.patches_,
-      t.inversePatches_
-    );
-  }
-  return s.copy_;
-}
-function ue(t, e, i, r, s, n, a) {
-  if (s == null || typeof s != "object" && !a)
-    return;
-  const o = $(s);
-  if (!(o && !a)) {
-    if (process.env.NODE_ENV !== "production" && s === i && m(5), S(s)) {
-      const c = n && e && e.type_ !== 3 && // Set objects are atomic since they have no keys.
-      !K(e.assigned_, r) ? n.concat(r) : void 0, u = T(t, s, c);
-      if (Se(i, r, u), S(u))
-        t.canAutoFreeze_ = !1;
-      else
-        return;
-    } else a && i.add(s);
-    if (x(s) && !o) {
-      if (!t.immer_.autoFreeze_ && t.unfinalizedDrafts_ < 1 || e && e.base_ && e.base_[r] === s && o)
-        return;
-      T(t, s), (!e || !e.scope_.parent_) && typeof r != "symbol" && (F(i) ? i.has(r) : Object.prototype.propertyIsEnumerable.call(i, r)) && k(t, s);
-    }
-  }
-}
-function k(t, e, i = !1) {
-  !t.parent_ && t.immer_.autoFreeze_ && t.canAutoFreeze_ && ee(e, i);
-}
-function _t(t, e) {
-  const i = Array.isArray(t), r = {
-    type_: i ? 1 : 0,
-    // Track which produce call this is associated with.
-    scope_: e ? e.scope_ : Ee(),
-    // True for both shallow and deep changes.
-    modified_: !1,
-    // Used during finalization.
-    finalized_: !1,
-    // Track which properties have been assigned (true) or deleted (false).
-    assigned_: {},
-    // The parent draft state.
-    parent_: e,
-    // The base state.
-    base_: t,
-    // The base proxy.
-    draft_: null,
-    // set below
-    // The base copy with any updated values.
-    copy_: null,
-    // Called by the `produce` function.
-    revoke_: null,
-    isManual_: !1
-  };
-  let s = r, n = te;
-  i && (s = [r], n = O);
-  const { revoke: a, proxy: o } = Proxy.revocable(s, n);
-  return r.draft_ = o, r.revoke_ = a, o;
-}
-var te = {
-  get(t, e) {
-    if (e === w)
-      return t;
-    const i = v(t);
-    if (!K(i, e))
-      return yt(t, i, e);
-    const r = i[e];
-    return t.finalized_ || !x(r) ? r : r === U(t.base_, e) ? (q(t), t.copy_[e] = Q(r, t)) : r;
-  },
-  has(t, e) {
-    return e in v(t);
-  },
-  ownKeys(t) {
-    return Reflect.ownKeys(v(t));
-  },
-  set(t, e, i) {
-    const r = Re(v(t), e);
-    if (r != null && r.set)
-      return r.set.call(t.draft_, i), !0;
-    if (!t.modified_) {
-      const s = U(v(t), e), n = s == null ? void 0 : s[w];
-      if (n && n.base_ === i)
-        return t.copy_[e] = i, t.assigned_[e] = !1, !0;
-      if (ct(i, s) && (i !== void 0 || K(t.base_, e)))
-        return !0;
-      q(t), J(t);
-    }
-    return t.copy_[e] === i && // special case: handle new props with value 'undefined'
-    (i !== void 0 || e in t.copy_) || // special case: NaN
-    Number.isNaN(i) && Number.isNaN(t.copy_[e]) || (t.copy_[e] = i, t.assigned_[e] = !0), !0;
-  },
-  deleteProperty(t, e) {
-    return U(t.base_, e) !== void 0 || e in t.base_ ? (t.assigned_[e] = !1, q(t), J(t)) : delete t.assigned_[e], t.copy_ && delete t.copy_[e], !0;
-  },
-  // Note: We never coerce `desc.value` into an Immer draft, because we can't make
-  // the same guarantee in ES5 mode.
-  getOwnPropertyDescriptor(t, e) {
-    const i = v(t), r = Reflect.getOwnPropertyDescriptor(i, e);
-    return r && {
-      writable: !0,
-      configurable: t.type_ !== 1 || e !== "length",
-      enumerable: r.enumerable,
-      value: i[e]
-    };
-  },
-  defineProperty() {
-    m(11);
-  },
-  getPrototypeOf(t) {
-    return C(t.base_);
-  },
-  setPrototypeOf() {
-    m(12);
-  }
-}, O = {};
-A(te, (t, e) => {
-  O[t] = function() {
-    return arguments[0] = arguments[0][0], e.apply(this, arguments);
-  };
-});
-O.deleteProperty = function(t, e) {
-  return process.env.NODE_ENV !== "production" && isNaN(parseInt(e)) && m(13), O.set.call(this, t, e, void 0);
+function he() {
+	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 {
+	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();
+	}
+	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();
+	}
+	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),
+			[Symbol.iterator]: this.previewIterator.bind(this)
+		};
+	}
+	*previewIterator() {
+		for (let e of ne) yield this.review(e);
+	}
+	review(e) {
+		let { state: t } = this.last, n;
+		switch (t) {
+			case l.New:
+				n = this.newState(e);
+				break;
+			case l.Learning:
+			case l.Relearning:
+				n = this.learningState(e);
+				break;
+			case l.Review:
+				n = this.reviewState(e);
+				break;
+		}
+		if (n) return n;
+		throw Error("Invalid grade");
+	}
+	buildLog(e) {
+		let { last_review: t, due: n, elapsed_days: r } = this.last;
+		return {
+			rating: e,
+			state: this.current.state,
+			due: t || n,
+			stability: this.current.stability,
+			difficulty: this.current.difficulty,
+			elapsed_days: this.current.elapsed_days,
+			last_elapsed_days: r,
+			scheduled_days: this.current.scheduled_days,
+			review: this.review_time
+		};
+	}
+}, _e = class extends ge {
+	newState(e) {
+		let t = this.next.get(e);
+		if (t) return t;
+		let n = d.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;
+				break;
+			case u.Hard:
+				n.scheduled_days = 0, n.due = this.review_time.scheduler(5), n.state = l.Learning;
+				break;
+			case u.Good:
+				n.scheduled_days = 0, n.due = this.review_time.scheduler(10), n.state = l.Learning;
+				break;
+			case u.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;
+				break;
+			}
+			default: throw Error("Invalid grade");
+		}
+		let r = {
+			card: n,
+			log: this.buildLog(e)
+		};
+		return this.next.set(e, r), r;
+	}
+	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;
+		switch (a.difficulty = this.algorithm.next_difficulty(r, e), a.stability = this.algorithm.next_short_term_stability(i, e), e) {
+			case u.Again:
+				a.scheduled_days = 0, a.due = this.review_time.scheduler(5, !1), a.state = n;
+				break;
+			case u.Hard:
+				a.scheduled_days = 0, a.due = this.review_time.scheduler(10), a.state = n;
+				break;
+			case u.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;
+				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;
+				break;
+			}
+			default: throw Error("Invalid grade");
+		}
+		let s = {
+			card: a,
+			log: this.buildLog(e)
+		};
+		return this.next.set(e, s), s;
+	}
+	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);
+		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 = {
+			card: o,
+			log: this.buildLog(u.Again)
+		}, p = {
+			card: s,
+			log: super.buildLog(u.Hard)
+		}, m = {
+			card: c,
+			log: super.buildLog(u.Good)
+		}, ee = {
+			card: l,
+			log: super.buildLog(u.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);
+	}
+	next_ds(e, t, n, r, i, a, o) {
+		e.difficulty = this.algorithm.next_difficulty(i, u.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);
+	}
+	next_interval(e, t, n, r, i) {
+		let a, o;
+		a = this.algorithm.next_interval(t.stability, i), o = this.algorithm.next_interval(n.stability, i), a = Math.min(a, o), o = Math.max(o, a + 1);
+		let s = Math.max(this.algorithm.next_interval(r.stability, i), o + 1);
+		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;
+	}
+}, ve = class extends ge {
+	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);
+		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);
+	}
+	learningState(e) {
+		return this.reviewState(e);
+	}
+	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);
+		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);
+	}
+	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;
+	}
+	update_next(e, t, n, r) {
+		let i = {
+			card: e,
+			log: this.buildLog(u.Again)
+		}, a = {
+			card: t,
+			log: super.buildLog(u.Hard)
+		}, o = {
+			card: n,
+			log: super.buildLog(u.Good)
+		}, s = {
+			card: r,
+			log: super.buildLog(u.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);
+	}
+}, ye = class {
+	fsrs;
+	constructor(e) {
+		this.fsrs = e;
+	}
+	replay(e, t, n) {
+		return this.fsrs.next(e, t, n);
+	}
+	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,
+			state: t,
+			due: o ?? n,
+			stability: e.stability,
+			difficulty: e.difficulty,
+			elapsed_days: r,
+			last_elapsed_days: e.elapsed_days,
+			scheduled_days: e.scheduled_days,
+			review: n
+		}, c = x(n), c.last_review = n;
+		else {
+			if (typeof o > "u") throw Error("reschedule: due is required for manual rating");
+			let l = o.diff(n, "days");
+			s = {
+				rating: u.Manual,
+				state: e.state,
+				due: e.last_review || e.due,
+				stability: e.stability,
+				difficulty: e.difficulty,
+				elapsed_days: r,
+				last_elapsed_days: e.elapsed_days,
+				scheduled_days: e.scheduled_days,
+				review: n
+			}, c = {
+				...e,
+				state: t,
+				due: o,
+				last_review: n,
+				stability: i || e.stability,
+				difficulty: a || e.difficulty,
+				elapsed_days: r,
+				scheduled_days: l,
+				reps: e.reps + 1
+			};
+		}
+		return {
+			card: c,
+			log: s
+		};
+	}
+	reschedule(e, t) {
+		let n = [], r = x(e.due);
+		for (let e of t) {
+			let t;
+			if (e.review = d.time(e.review), e.rating === u.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);
+			} else t = this.replay(r, e.review, e.rating);
+			n.push(t), r = t.card;
+		}
+		return n;
+	}
+	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));
+	}
+}, be = class extends me {
+	strategyHandler = /* @__PURE__ */ new Map();
+	Scheduler;
+	constructor(e) {
+		super(e);
+		let { enable_short_term: t } = this.parameters;
+		this.Scheduler = t ? _e : ve;
+	}
+	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;
+		} };
+	}
+	useStrategy(e, t) {
+		return this.strategyHandler.set(e, t), this;
+	}
+	clearStrategy(e) {
+		return e ? this.strategyHandler.delete(e) : this.strategyHandler.clear(), this;
+	}
+	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 });
+	}
+	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 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));
+		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 a, o, s;
+		switch (i.state) {
+			case l.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);
+				break;
+		}
+		let c = {
+			...r,
+			due: a,
+			stability: i.stability,
+			difficulty: i.difficulty,
+			elapsed_days: i.last_elapsed_days,
+			scheduled_days: i.scheduled_days,
+			reps: Math.max(0, r.reps - 1),
+			lapses: Math.max(0, s),
+			state: i.state,
+			last_review: o
+		};
+		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,
+			state: i.state,
+			due: i.due,
+			stability: i.stability,
+			difficulty: i.difficulty,
+			elapsed_days: 0,
+			last_elapsed_days: i.elapsed_days,
+			scheduled_days: a,
+			review: t
+		}, s = {
+			card: {
+				...i,
+				due: t,
+				stability: 0,
+				difficulty: 0,
+				elapsed_days: 0,
+				scheduled_days: 0,
+				reps: n ? 0 : i.reps,
+				lapses: n ? 0 : i.lapses,
+				state: l.New,
+				last_review: i.last_review
+			},
+			log: o
+		};
+		return r && typeof r == "function" ? r(s) : s;
+	}
+	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);
+		return r && typeof r == "function" ? {
+			collections: l.map(r),
+			reschedule_item: m ? r(m) : null
+		} : {
+			collections: l,
+			reschedule_item: m
+		};
+	}
+}, xe = ((e) => new be(e || {}))(b({
+	request_retention: i,
+	enable_fuzz: !0,
+	maximum_interval: 100
+})), Se = (e) => e.due ? e : {
+	...e,
+	due: /* @__PURE__ */ new Date()
+}, Ce = (e) => t.indexOf(e), we = (e) => ({
+	due: e.due,
+	stability: e.stability,
+	difficulty: e.difficulty,
+	elapsed_days: e.elapsedDays,
+	scheduled_days: e.scheduledDays,
+	reps: e.reps,
+	lapses: e.lapses,
+	state: Ce(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;
+		return {
+			nextCard: a,
+			reviewLog: {
+				id: 0,
+				cardReviewId: e.id,
+				grade: t,
+				state: Oe(o.state),
+				due: o.due,
+				stability: o.stability,
+				difficulty: o.difficulty,
+				elapsedDays: o.elapsed_days,
+				lastElapsedDays: o.last_elapsed_days,
+				scheduledDays: o.scheduled_days,
+				review: o.review,
+				duration: n
+			}
+		};
+	});
 };
-O.set = function(t, e, i) {
-  return process.env.NODE_ENV !== "production" && e !== "length" && isNaN(parseInt(e)) && m(14), te.set.call(this, t[0], e, i, t[0]);
+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);
+		a[n] = t;
+	}
+	return a;
+}
+function De(e) {
+	return r[e];
+}
+function Oe(e) {
+	return t[e];
+}
+function C(e, t) {
+	return {
+		...t,
+		due: e.due,
+		stability: e.stability,
+		difficulty: e.difficulty,
+		elapsedDays: e.elapsed_days,
+		scheduledDays: e.scheduled_days,
+		reps: e.reps,
+		lapses: e.lapses,
+		state: Oe(e.state),
+		lastReview: e.last_review ?? null
+	};
+}
+function ke(e) {
+	let t = r.indexOf(e);
+	if (t === -1) throw Error(`Invalid rating: ${e}`);
+	return t;
+}
+function Ae(e, t) {
+	let r = x();
+	return {
+		id: "",
+		due: null,
+		stability: r.stability,
+		difficulty: r.difficulty,
+		elapsedDays: r.elapsed_days,
+		scheduledDays: r.scheduled_days,
+		reps: r.reps,
+		lapses: r.lapses,
+		state: n.New,
+		lastReview: r.last_review ?? null,
+		userDeckStudyId: e,
+		cardId: t
+	};
+}
+//#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" ? [] : [
+	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.`;
+	},
+	function(e) {
+		return `produce can only be called on things that are draftable: plain objects, arrays, Map, Set or classes that are marked with '[immerable]: true'. Got '${e}'`;
+	},
+	"This object has been frozen and should not be mutated",
+	function(e) {
+		return "Cannot use a proxy that has been revoked. Did you pass an object from inside an immer function to an async process? " + e;
+	},
+	"An immer producer returned a new value *and* modified its draft. Either return a new value *or* modify the draft.",
+	"Immer forbids circular references",
+	"The first or second argument to `produce` must be a function",
+	"The third argument to `produce` must be a function or undefined",
+	"First argument to `createDraft` must be a plain object, an array, or an immerable object",
+	"First argument to `finishDraft` must be a draft returned by `createDraft`",
+	function(e) {
+		return `'current' expects a draft, got: ${e}`;
+	},
+	"Object.defineProperty() cannot be used on an Immer draft",
+	"Object.setPrototypeOf() cannot be used on an Immer draft",
+	"Immer only supports deleting array indices",
+	"Immer only supports setting array indices and the 'length' property",
+	function(e) {
+		return `'original' expects a draft, got: ${e}`;
+	}
+];
+function T(e, ...t) {
+	if (process.env.NODE_ENV !== "production") {
+		let n = Ne[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`);
+}
+var E = Object.getPrototypeOf;
+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;
+}
+var Pe = Object.prototype.constructor.toString(), Fe = /* @__PURE__ */ new WeakMap();
+function Ie(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;
+}
+function k(e, t, n = !0) {
+	A(e) === 0 ? (n ? Reflect.ownKeys(e) : Object.keys(e)).forEach((n) => {
+		t(n, e[n], e);
+	}) : e.forEach((n, r) => t(r, n, e));
+}
+function A(e) {
+	let t = e[w];
+	return t ? t.type_ : Array.isArray(e) ? 1 : M(e) ? 2 : N(e) ? 3 : 0;
+}
+function j(e, t) {
+	return A(e) === 2 ? e.has(t) : Object.prototype.hasOwnProperty.call(e, t);
+}
+function Le(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) {
+	return e === t ? e !== 0 || 1 / e == 1 / t : e !== e && t !== t;
+}
+function M(e) {
+	return e instanceof Map;
+}
+function N(e) {
+	return e instanceof Set;
+}
+function P(e) {
+	return e.copy_ || e.base_;
+}
+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);
+	if (t === !0 || t === "class_only" && !n) {
+		let t = Object.getOwnPropertyDescriptors(e);
+		delete t[w];
+		let n = Reflect.ownKeys(t);
+		for (let r = 0; r < n.length; r++) {
+			let i = n[r], a = t[i];
+			a.writable === !1 && (a.writable = !0, a.configurable = !0), (a.get || a.set) && (t[i] = {
+				configurable: !0,
+				writable: !0,
+				enumerable: a.enumerable,
+				value: e[i]
+			});
+		}
+		return Object.create(E(e), t);
+	} else {
+		let t = E(e);
+		return t !== null && n ? { ...e } : Object.assign(Object.create(t), e);
+	}
+}
+function I(e, t = !1) {
+	return R(e) || D(e) || !O(e) ? e : (A(e) > 1 && Object.defineProperties(e, {
+		set: L,
+		add: L,
+		clear: L,
+		delete: L
+	}), Object.freeze(e), t && Object.values(e).forEach((e) => I(e, !0)), e);
+}
+function ze() {
+	T(2);
+}
+var L = { value: ze };
+function R(e) {
+	return typeof e != "object" || !e ? !0 : Object.isFrozen(e);
+}
+var Be = {};
+function z(e) {
+	let t = Be[e];
+	return t || T(0, e), t;
+}
+var B;
+function Ve() {
+	return B;
+}
+function He(e, t) {
+	return {
+		drafts_: [],
+		parent_: e,
+		immer_: t,
+		canAutoFreeze_: !0,
+		unfinalizedDrafts_: 0
+	};
+}
+function Ue(e, t) {
+	t && (z("Patches"), e.patches_ = [], e.inversePatches_ = [], e.patchListener_ = t);
+}
+function V(e) {
+	H(e), e.drafts_.forEach(Ge), e.drafts_ = null;
+}
+function H(e) {
+	e === B && (B = e.parent_);
+}
+function We(e) {
+	return B = He(B, e);
+}
+function Ge(e) {
+	let t = e[w];
+	t.type_ === 0 || t.type_ === 1 ? t.revoke_() : t.revoked_ = !0;
+}
+function Ke(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;
+}
+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.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_);
+	}
+	return i.copy_;
+}
+function qe(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;
+			else return;
+		} else o && n.add(i);
+		if (O(i) && !s) {
+			if (!e.immer_.autoFreeze_ && e.unfinalizedDrafts_ < 1 || t && t.base_ && t.base_[r] === i && s) return;
+			U(e, i), (!t || !t.scope_.parent_) && typeof r != "symbol" && (M(n) ? n.has(r) : Object.prototype.propertyIsEnumerable.call(n, r)) && W(e, i);
+		}
+	}
+}
+function W(e, t, n = !1) {
+	!e.parent_ && e.immer_.autoFreeze_ && e.canAutoFreeze_ && I(t, n);
+}
+function Je(e, t) {
+	let n = Array.isArray(e), r = {
+		type_: +!!n,
+		scope_: t ? t.scope_ : Ve(),
+		modified_: !1,
+		finalized_: !1,
+		assigned_: {},
+		parent_: t,
+		base_: e,
+		draft_: null,
+		copy_: null,
+		revoke_: null,
+		isManual_: !1
+	}, i = r, a = G;
+	n && (i = [r], a = K);
+	let { revoke: o, proxy: s } = Proxy.revocable(i, a);
+	return r.draft_ = s, r.revoke_ = o, s;
+}
+var G = {
+	get(e, t) {
+		if (t === w) return e;
+		let n = P(e);
+		if (!j(n, t)) return Ye(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;
+	},
+	has(e, t) {
+		return t in P(e);
+	},
+	ownKeys(e) {
+		return Reflect.ownKeys(P(e));
+	},
+	set(e, t, n) {
+		let r = Xe(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;
+			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);
+	},
+	deleteProperty(e, t) {
+		return q(e.base_, t) !== void 0 || t in e.base_ ? (e.assigned_[t] = !1, Y(e), J(e)) : delete e.assigned_[t], e.copy_ && delete e.copy_[t], !0;
+	},
+	getOwnPropertyDescriptor(e, t) {
+		let n = P(e), r = Reflect.getOwnPropertyDescriptor(n, t);
+		return r && {
+			writable: !0,
+			configurable: e.type_ !== 1 || t !== "length",
+			enumerable: r.enumerable,
+			value: n[t]
+		};
+	},
+	defineProperty() {
+		T(11);
+	},
+	getPrototypeOf(e) {
+		return E(e.base_);
+	},
+	setPrototypeOf() {
+		T(12);
+	}
+}, K = {};
+k(G, (e, t) => {
+	K[e] = function() {
+		return arguments[0] = arguments[0][0], t.apply(this, arguments);
+	};
+}), K.deleteProperty = function(e, t) {
+	return process.env.NODE_ENV !== "production" && isNaN(parseInt(t)) && T(13), K.set.call(this, e, t, void 0);
+}, K.set = function(e, t, n) {
+	return process.env.NODE_ENV !== "production" && t !== "length" && isNaN(parseInt(t)) && T(14), G.set.call(this, e[0], t, n, e[0]);
 };
-function U(t, e) {
-  const i = t[w];
-  return (i ? v(i) : t)[e];
-}
-function yt(t, e, i) {
-  var s;
-  const r = Re(e, i);
-  return r ? "value" in r ? r.value : (
-    // This is a very special case, if the prop is a getter defined by the
-    // prototype, we should invoke it with the draft as context!
-    (s = r.get) == null ? void 0 : s.call(t.draft_)
-  ) : void 0;
-}
-function Re(t, e) {
-  if (!(e in t))
-    return;
-  let i = C(t);
-  for (; i; ) {
-    const r = Object.getOwnPropertyDescriptor(i, e);
-    if (r)
-      return r;
-    i = C(i);
-  }
-}
-function J(t) {
-  t.modified_ || (t.modified_ = !0, t.parent_ && J(t.parent_));
-}
-function q(t) {
-  t.copy_ || (t.copy_ = B(
-    t.base_,
-    t.scope_.immer_.useStrictShallowCopy_
-  ));
-}
-var mt = class {
-  constructor(t) {
-    this.autoFreeze_ = !0, this.useStrictShallowCopy_ = !1, this.useStrictIteration_ = !0, this.produce = (e, i, r) => {
-      if (typeof e == "function" && typeof i != "function") {
-        const n = i;
-        i = e;
-        const a = this;
-        return function(c = n, ...u) {
-          return a.produce(c, (f) => i.call(this, f, ...u));
-        };
-      }
-      typeof i != "function" && m(6), r !== void 0 && typeof r != "function" && m(7);
-      let s;
-      if (x(e)) {
-        const n = le(this), a = Q(e, void 0);
-        let o = !0;
-        try {
-          s = i(a), o = !1;
-        } finally {
-          o ? X(n) : Z(n);
-        }
-        return oe(n, r), ce(s, n);
-      } else if (!e || typeof e != "object") {
-        if (s = i(e), s === void 0 && (s = e), s === xe && (s = void 0), this.autoFreeze_ && ee(s, !0), r) {
-          const n = [], a = [];
-          M("Patches").generateReplacementPatches_(e, s, n, a), r(n, a);
-        }
-        return s;
-      } else
-        m(1, e);
-    }, this.produceWithPatches = (e, i) => {
-      if (typeof e == "function")
-        return (a, ...o) => this.produceWithPatches(a, (c) => e(c, ...o));
-      let r, s;
-      return [this.produce(e, i, (a, o) => {
-        r = a, s = o;
-      }), r, s];
-    }, typeof (t == null ? void 0 : t.autoFreeze) == "boolean" && this.setAutoFreeze(t.autoFreeze), typeof (t == null ? void 0 : t.useStrictShallowCopy) == "boolean" && this.setUseStrictShallowCopy(t.useStrictShallowCopy), typeof (t == null ? void 0 : t.useStrictIteration) == "boolean" && this.setUseStrictIteration(t.useStrictIteration);
-  }
-  createDraft(t) {
-    x(t) || m(8), S(t) && (t = wt(t));
-    const e = le(this), i = Q(t, void 0);
-    return i[w].isManual_ = !0, Z(e), i;
-  }
-  finishDraft(t, e) {
-    const i = t && t[w];
-    (!i || !i.isManual_) && m(9);
-    const { scope_: r } = i;
-    return oe(r, e), ce(void 0, r);
-  }
-  /**
-   * Pass true to automatically freeze all copies created by Immer.
-   *
-   * By default, auto-freezing is enabled.
-   */
-  setAutoFreeze(t) {
-    this.autoFreeze_ = t;
-  }
-  /**
-   * Pass true to enable strict shallow copy.
-   *
-   * By default, immer does not copy the object descriptors such as getter, setter and non-enumrable properties.
-   */
-  setUseStrictShallowCopy(t) {
-    this.useStrictShallowCopy_ = t;
-  }
-  /**
-   * Pass false to use faster iteration that skips non-enumerable properties
-   * but still handles symbols for compatibility.
-   *
-   * By default, strict iteration is enabled (includes all own properties).
-   */
-  setUseStrictIteration(t) {
-    this.useStrictIteration_ = t;
-  }
-  shouldUseStrictIteration() {
-    return this.useStrictIteration_;
-  }
-  applyPatches(t, e) {
-    let i;
-    for (i = e.length - 1; i >= 0; i--) {
-      const s = e[i];
-      if (s.path.length === 0 && s.op === "replace") {
-        t = s.value;
-        break;
-      }
-    }
-    i > -1 && (e = e.slice(i + 1));
-    const r = M("Patches").applyPatches_;
-    return S(t) ? r(t, e) : this.produce(
-      t,
-      (s) => r(s, e)
-    );
-  }
+function q(e, t) {
+	let n = e[w];
+	return (n ? P(n) : e)[t];
+}
+function Ye(e, t, n) {
+	let r = Xe(t, n);
+	return r ? "value" in r ? r.value : r.get?.call(e.draft_) : void 0;
+}
+function Xe(e, t) {
+	if (!(t in e)) return;
+	let n = E(e);
+	for (; n;) {
+		let e = Object.getOwnPropertyDescriptor(n, t);
+		if (e) return e;
+		n = E(n);
+	}
+}
+function J(e) {
+	e.modified_ || (e.modified_ = !0, e.parent_ && J(e.parent_));
+}
+function Y(e) {
+	e.copy_ ||= F(e.base_, e.scope_.immer_.useStrictShallowCopy_);
+}
+var Ze = class {
+	constructor(e) {
+		this.autoFreeze_ = !0, this.useStrictShallowCopy_ = !1, this.useStrictIteration_ = !0, this.produce = (e, t, n) => {
+			if (typeof e == "function" && typeof t != "function") {
+				let n = t;
+				t = e;
+				let r = this;
+				return function(e = n, ...i) {
+					return r.produce(e, (e) => t.call(this, e, ...i));
+				};
+			}
+			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;
+				try {
+					r = t(a), o = !1;
+				} finally {
+					o ? V(i) : H(i);
+				}
+				return Ue(i, n), Ke(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) {
+					let t = [], i = [];
+					z("Patches").generateReplacementPatches_(e, r, t, i), n(t, i);
+				}
+				return r;
+			} else T(1, e);
+		}, this.produceWithPatches = (e, t) => {
+			if (typeof e == "function") return (t, ...n) => this.produceWithPatches(t, (t) => e(t, ...n));
+			let n, r;
+			return [
+				this.produce(e, t, (e, t) => {
+					n = e, r = t;
+				}),
+				n,
+				r
+			];
+		}, 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);
+		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);
+	}
+	setAutoFreeze(e) {
+		this.autoFreeze_ = e;
+	}
+	setUseStrictShallowCopy(e) {
+		this.useStrictShallowCopy_ = e;
+	}
+	setUseStrictIteration(e) {
+		this.useStrictIteration_ = e;
+	}
+	shouldUseStrictIteration() {
+		return this.useStrictIteration_;
+	}
+	applyPatches(e, t) {
+		let n;
+		for (n = t.length - 1; n >= 0; n--) {
+			let r = t[n];
+			if (r.path.length === 0 && r.op === "replace") {
+				e = r.value;
+				break;
+			}
+		}
+		n > -1 && (t = t.slice(n + 1));
+		let r = z("Patches").applyPatches_;
+		return D(e) ? r(e, t) : this.produce(e, (e) => r(e, t));
+	}
 };
-function Q(t, e) {
-  const i = F(t) ? M("MapSet").proxyMap_(t, e) : H(t) ? M("MapSet").proxySet_(t, e) : _t(t, e);
-  return (e ? e.scope_ : Ee()).drafts_.push(i), i;
-}
-function wt(t) {
-  return S(t) || m(10, t), De(t);
-}
-function De(t) {
-  if (!x(t) || $(t))
-    return t;
-  const e = t[w];
-  let i, r = !0;
-  if (e) {
-    if (!e.modified_)
-      return e.base_;
-    e.finalized_ = !0, i = B(t, e.scope_.immer_.useStrictShallowCopy_), r = e.scope_.immer_.shouldUseStrictIteration();
-  } else
-    i = B(t, !0);
-  return A(
-    i,
-    (s, n) => {
-      Se(i, s, De(n));
-    },
-    r
-  ), e && (e.finalized_ = !1), i;
-}
-var pt = new mt(), gt = pt.produce;
-function vt(t, e) {
-  const i = t + e;
-  let r = 0;
-  for (let s = 0; s < i.length; s++) {
-    const n = i.charCodeAt(s);
-    r = (r << 5) - r + n, r |= 0;
-  }
-  return r;
-}
-function bt(t, e) {
-  return (vt(t, e) >>> 0) / 4294967295;
-}
-function kt(t, e = /* @__PURE__ */ new Set()) {
-  if (t.reviewCards.length === 0 && t.newCards.length === 0)
-    return;
-  if (t.reviewCards.length === 0)
-    return t.newCards[0];
-  if (t.newCards.length === 0)
-    return t.reviewCards[0];
-  const i = de(t.newCards, e), r = de(t.reviewCards, e);
-  if (!i) return r ?? t.newCards[0];
-  if (!r) return i ?? t.reviewCards[0];
-  const s = t.newCards.length, n = t.reviewCards.length, a = s + n, o = 0.33, c = s / a, u = (o + c) / 2;
-  return bt(i.card.id, r.card.id) < u ? i : r;
-}
-function de(t, e) {
-  return t.find((i) => !e.has(i.card.id));
-}
-function jt(t, e, i) {
-  const r = St(e, i);
-  if (!r)
-    return e;
-  const { nextCard: s } = rt(r.cardReview, t, 30), n = s.due && Ie(s.due, /* @__PURE__ */ new Date());
-  return gt(e, (a) => {
-    if (xt(a, r), n) {
-      const o = {
-        ...r,
-        cardReview: s
-      };
-      Mt(a, o);
-    }
-  });
-}
-function xt(t, e) {
-  e.cardReview.state === "New" ? t.newCards = t.newCards.filter((i) => i.card.id !== e.card.id) : t.reviewCards = t.reviewCards.filter((i) => i.card.id !== e.card.id), Ce(t, e.cardReview.state, "decrease");
-}
-function Mt(t, e) {
-  if (e.cardReview.state === "New") {
-    const i = t.newCards.findIndex(
-      (r) => r.cardReview.due && e.cardReview.due && r.cardReview.due >= e.cardReview.due || r.cardReview.difficulty >= e.cardReview.difficulty
-    );
-    i === -1 ? t.newCards.push(e) : t.newCards.splice(i, 0, e);
-  } else {
-    const i = Et(t, t.reviewCards);
-    t.reviewCards.splice(i, 0, e);
-  }
-  Ce(t, e.cardReview.state, "increase");
-}
-function Ce(t, e, i) {
-  const r = i === "increase" ? 1 : -1;
-  switch (e) {
-    case "New":
-      t.stats.new += r;
-      break;
-    case "Learning":
-    case "Relearning":
-      t.stats.learning += r;
-      break;
-    case "Review":
-      t.stats.review += r;
-      break;
-    default:
-      t.stats.new += r;
-      break;
-  }
-  t.stats.total += r;
-}
-function St(t, e) {
-  return t.newCards.find((i) => i.card.id === e) ?? t.reviewCards.find((i) => i.card.id === e);
-}
-function Et(t, e) {
-  if (e.length === 0)
-    return 0;
-  const i = Math.max(4, Math.floor(e.length / 3));
-  return Math.min(i, e.length);
-}
-export {
-  Pe as FSRS_RETENTION,
-  Ft as MAX_CARDS_TO_FETCH,
-  Nt as MAX_LEARN_PER_DAY,
-  It as MAX_NEW_PER_DECK_DAY,
-  Pt as THRESHOLD_CARDS_FOR_REFETCH,
-  kt as getNextCardFromSession,
-  At as getReviewDateForEachRating,
-  St as getSessionCard,
-  rt as gradeCard,
-  nt as mergeFsrsCard,
-  Tt as newCardReview,
-  jt as removeCardFromSessionData
+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;
+}
+function Qe(e) {
+	return D(e) || T(10, e), Z(e);
+}
+function Z(e) {
+	if (!O(e) || R(e)) return e;
+	let t = e[w], n, r = !0;
+	if (t) {
+		if (!t.modified_) return t.base_;
+		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));
+	}, r), t && (t.finalized_ = !1), n;
+}
+var $e = new Ze().produce;
+//#endregion
+//#region src/spaced-repetition/utils.ts
+function et(e, t) {
+	let n = e + t, r = 0;
+	for (let e = 0; e < n.length; e++) {
+		let t = n.charCodeAt(e);
+		r = (r << 5) - r + t, r |= 0;
+	}
+	return r;
+}
+function tt(e, t) {
+	return (et(e, t) >>> 0) / 4294967295;
+}
+function nt(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];
+	let n = Q(e.newCards, t), r = Q(e.reviewCards, t);
+	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;
+}
+function Q(e, t) {
+	return e.find((e) => !t.has(e.card.id));
+}
+function rt(e, t) {
+	let n = $(e, t);
+	return n ? $e(e, (e) => {
+		at(e, n);
+	}) : e;
+}
+function it(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, {
+			...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 ot(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);
+		e.reviewCards.splice(n, 0, t);
+	}
+	st(e, t.cardReview.state, "increase");
+}
+function st(e, t, n) {
+	let r = n === "increase" ? 1 : -1;
+	switch (t) {
+		case "New":
+			e.stats.new += r;
+			break;
+		case "Learning":
+		case "Relearning":
+			e.stats.learning += r;
+			break;
+		case "Review":
+			e.stats.review += r;
+			break;
+		default:
+			e.stats.new += r;
+			break;
+	}
+	e.stats.total += r;
+}
+function $(e, t) {
+	return e.newCards.find((e) => e.card.id === t) ?? e.reviewCards.find((e) => e.card.id === t);
+}
+function ct(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 = {
+	newCards: [],
+	reviewCards: [],
+	stats: {
+		new: 0,
+		learning: 0,
+		review: 0,
+		total: 0
+	}
+}, dt = class {
+	recentlyReviewed = /* @__PURE__ */ new Set();
+	_reviewsCompleted = 0;
+	_correctGrades = 0;
+	getProgress() {
+		return {
+			reviewsCompleted: this._reviewsCompleted,
+			correctGrades: this._correctGrades
+		};
+	}
+	nextCard(e) {
+		return nt(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();
+	}
 };
+//#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 };