uni-answer-sheet 2.1.0 → 2.2.0

package/dist/chunks/{index-CDvIw14k.js → index-ChLOq9ID.js}

@@ -1,15 +1,15 @@
-var Ut = Object.defineProperty;
-var Ft = (t, e, r) => e in t ? Ut(t, e, { enumerable: !0, configurable: !0, writable: !0, value: r }) : t[e] = r;
-var wt = (t, e, r) => Ft(t, typeof e != "symbol" ? e + "" : e, r);
-const Kt = ["pagination", "content-identity", "choice-fill", "answer-regions", "html-codec", "status"];
-function vt(t) {
+var Ft = Object.defineProperty;
+var Kt = (t, e, r) => e in t ? Ft(t, e, { enumerable: !0, configurable: !0, writable: !0, value: r }) : t[e] = r;
+var Tt = (t, e, r) => Kt(t, typeof e != "symbol" ? e + "" : e, r);
+const vt = ["pagination", "content-identity", "choice-fill", "answer-regions", "html-codec", "status"];
+function zt(t) {
   const e = t.filter((n) => n?.kind === "answer-sheet-editor");
   if (e.length !== 1) throw new Error("请显式注册一个富文本插件：plugins: [createEditorPlugin()]");
   const r = e[0];
-  if (r.apiVersion !== 1 || r.documentVersion !== 1 || Kt.some((n) => !r.capabilities?.includes(n)) || typeof r.prepare != "function" || typeof r.create != "function" || typeof r.validateDocument != "function" || typeof r.html?.parse != "function" || typeof r.html?.serialize != "function") throw new Error("富文本插件协议不兼容，需要支持制卡协议 v1 的 uni-editor/plugin");
+  if (r.apiVersion !== 1 || r.documentVersion !== 1 || vt.some((n) => !r.capabilities?.includes(n)) || typeof r.prepare != "function" || typeof r.create != "function" || typeof r.validateDocument != "function" || typeof r.html?.parse != "function" || typeof r.html?.serialize != "function") throw new Error("富文本插件协议不兼容，需要支持制卡协议 v1 的 uni-editor/plugin");
   return r;
 }
-function xt(t) {
+function $t(t) {
   const e = [], r = (n) => {
     if (n.type === "choiceGroup") {
       typeof n.attrs?.id == "string" && e.push({
@@ -23,13 +23,13 @@ function xt(t) {
   };
   return r(t.content), e;
 }
-class mt extends Error {
+class Ct extends Error {
   constructor(e, r) {
     super(r), this.path = e;
   }
 }
 const B = (t, e) => {
-  throw new mt(t, e);
+  throw new Ct(t, e);
 }, ot = {
   语文: "CHINESE",
   数学: "MATHS",
@@ -46,50 +46,50 @@ const B = (t, e) => {
   信息科技: "IT",
   信息技术: "IT",
   日语: "JAPANESE"
-}, zt = {
+}, Wt = {
   P: ["语文", "数学", "英语", "科学", "道德与法治"],
   J: ["语文", "数学", "英语", "物理", "化学", "生物", "地理", "历史", "道德与法治", "信息科技"],
   S: ["语文", "数学", "英语", "物理", "化学", "生物", "政治", "历史", "地理", "信息技术", "日语"]
-}, Wt = ["一年级", "二年级", "三年级", "四年级", "五年级", "六年级", "初一", "初二", "初三", "高一", "高二", "高三"], Vt = Wt.map((t, e) => {
+}, Vt = ["一年级", "二年级", "三年级", "四年级", "五年级", "六年级", "初一", "初二", "初三", "高一", "高二", "高三"], Qt = Vt.map((t, e) => {
   const r = e < 6 ? "P" : e < 9 ? "J" : "S";
   return { label: t, value: `${r}0${e < 6 ? e + 1 : (e - 6) % 3 + 1}`, classify: r };
-}), z = (t, e) => typeof t == "string" && t.trim() ? t.trim() : B(e, "字典编码和名称必须是非空字符串"), tt = (t, e) => t && typeof t == "object" && !Array.isArray(t) ? t : B(e, "字典必须是对象"), $t = (t) => t.classify || (/^[PJS]/.test(t.value) ? t.value[0] : void 0);
-function Lt(t = {}) {
+}), z = (t, e) => typeof t == "string" && t.trim() ? t.trim() : B(e, "字典编码和名称必须是非空字符串"), tt = (t, e) => t && typeof t == "object" && !Array.isArray(t) ? t : B(e, "字典必须是对象"), Lt = (t) => t.classify || (/^[PJS]/.test(t.value) ? t.value[0] : void 0);
+function _t(t = {}) {
   const e = tt(t, "dictionaries"), r = (l, u) => {
     if (!Array.isArray(l)) return B(u, "字典选项必须是数组");
     const g = /* @__PURE__ */ new Set();
     return l.map((A, C) => {
-      const x = tt(A, `${u}.${C}`), M = z(x.value, `${u}.${C}.value`), w = z(x.label, `${u}.${C}.label`);
-      return g.has(M) && B(`${u}.${C}.value`, "字典编码重复"), g.add(M), { ...x, value: M, label: w };
+      const x = tt(A, `${u}.${C}`), M = z(x.value, `${u}.${C}.value`), T = z(x.label, `${u}.${C}.label`);
+      return g.has(M) && B(`${u}.${C}.value`, "字典编码重复"), g.add(M), { ...x, value: M, label: T };
     });
-  }, n = r(e.grades === void 0 ? Vt : e.grades, "dictionaries.grades").map((l, u) => (l.classify !== void 0 && !["P", "J", "S"].includes(String(l.classify)) && B(`dictionaries.grades.${u}.classify`, "学段为 P、J 或 S"), { value: l.value, label: l.label, classify: l.classify })), o = e.gradeCourseMap === void 0 ? void 0 : tt(e.gradeCourseMap, "dictionaries.gradeCourseMap"), s = e.courseCodeToSubjectCode === void 0 ? {} : tt(e.courseCodeToSubjectCode, "dictionaries.courseCodeToSubjectCode");
+  }, n = r(e.grades === void 0 ? Qt : e.grades, "dictionaries.grades").map((l, u) => (l.classify !== void 0 && !["P", "J", "S"].includes(String(l.classify)) && B(`dictionaries.grades.${u}.classify`, "学段为 P、J 或 S"), { value: l.value, label: l.label, classify: l.classify })), o = e.gradeCourseMap === void 0 ? void 0 : tt(e.gradeCourseMap, "dictionaries.gradeCourseMap"), s = e.courseCodeToSubjectCode === void 0 ? {} : tt(e.courseCodeToSubjectCode, "dictionaries.courseCodeToSubjectCode");
   for (const [l, u] of Object.entries(s)) z(u, `dictionaries.courseCodeToSubjectCode.${l}`);
   const c = /* @__PURE__ */ new Map(), i = Object.fromEntries(n.map((l) => {
-    const u = $t(l), g = (u ? zt[u] : []).map((x) => ({ value: ot[x], label: x, subjectCode: ot[x] })), A = `dictionaries.gradeCourseMap.${l.value}`, C = r(o ? o[l.value] ?? [] : g, A).map((x, M) => {
-      const w = s[x.value];
-      x.subjectCode !== void 0 && w !== void 0 && x.subjectCode !== w && B(`${A}.${M}.subjectCode`, "课程对应的学科编码冲突");
-      const O = z(x.subjectCode ?? w ?? (Object.values(ot).includes(x.value) ? x.value : void 0), `${A}.${M}.subjectCode`);
+    const u = Lt(l), g = (u ? Wt[u] : []).map((x) => ({ value: ot[x], label: x, subjectCode: ot[x] })), A = `dictionaries.gradeCourseMap.${l.value}`, C = r(o ? o[l.value] ?? [] : g, A).map((x, M) => {
+      const T = s[x.value];
+      x.subjectCode !== void 0 && T !== void 0 && x.subjectCode !== T && B(`${A}.${M}.subjectCode`, "课程对应的学科编码冲突");
+      const O = z(x.subjectCode ?? T ?? (Object.values(ot).includes(x.value) ? x.value : void 0), `${A}.${M}.subjectCode`);
       return c.has(x.value) && c.get(x.value) !== O && B(`${A}.${M}.subjectCode`, "同一课程不能对应不同学科"), c.set(x.value, O), x.custom !== void 0 && typeof x.custom != "boolean" && B(`${A}.${M}.custom`, "custom 必须是布尔值"), { value: x.value, label: x.label, subjectCode: O, ...x.custom === void 0 ? {} : { custom: x.custom } };
     });
     return [l.value, C];
-  })), a = n.filter((l) => i[l.value].length), y = e.defaultGradeCode === void 0 ? void 0 : z(e.defaultGradeCode, "dictionaries.defaultGradeCode"), T = a.find((l) => l.value === y)?.value || a[0]?.value || "", m = e.defaultCourseCode === void 0 ? void 0 : z(e.defaultCourseCode, "dictionaries.defaultCourseCode"), f = i[T] || [], p = f.find((l) => l.value === m)?.value || f[0]?.value || "";
-  return { grades: a, gradeCourseMap: i, defaultGradeCode: T, defaultCourseCode: p };
+  })), a = n.filter((l) => i[l.value].length), y = e.defaultGradeCode === void 0 ? void 0 : z(e.defaultGradeCode, "dictionaries.defaultGradeCode"), b = a.find((l) => l.value === y)?.value || a[0]?.value || "", m = e.defaultCourseCode === void 0 ? void 0 : z(e.defaultCourseCode, "dictionaries.defaultCourseCode"), f = i[b] || [], p = f.find((l) => l.value === m)?.value || f[0]?.value || "";
+  return { grades: a, gradeCourseMap: i, defaultGradeCode: b, defaultCourseCode: p };
 }
-function dt(t, e, r) {
+function ht(t, e, r) {
   const n = t.grades.find((s) => s.value === e);
   if (!n) return B("initialization.gradeCode", "年级不在可用字典中");
   const o = t.gradeCourseMap[e]?.find((s) => s.value === r);
-  return o ? { grade: n.label, subject: o.label, gradeCode: e, courseCode: r, subjectCode: o.subjectCode, phaseCode: $t(n) } : B("initialization.courseCode", "当前年级没有此课程");
+  return o ? { grade: n.label, subject: o.label, gradeCode: e, courseCode: r, subjectCode: o.subjectCode, phaseCode: Lt(n) } : B("initialization.courseCode", "当前年级没有此课程");
 }
-function He(t, e = {}) {
+function Be(t, e = {}) {
   const n = t.grades.find((c) => c.value === e.gradeCode || !e.gradeCode && c.label === e.grade)?.value || t.defaultGradeCode, o = t.gradeCourseMap[n] || [], s = o.find((c) => c.value === e.courseCode || !e.courseCode && c.label === e.subject)?.value || (n === t.defaultGradeCode ? t.defaultCourseCode : o[0]?.value) || "";
-  return n && s ? dt(t, n, s) : { grade: "", subject: "", gradeCode: "", courseCode: "" };
+  return n && s ? ht(t, n, s) : { grade: "", subject: "", gradeCode: "", courseCode: "" };
 }
-function _t(t) {
+function Dt(t) {
   return t?.subjectCode || ot[t?.subject || ""];
 }
-const W = { questions: 200, options: 12, score: 15 }, Be = (t) => t.multiple ? t.indefinite ? "indefinite" : "multiple" : "single", v = (t) => Number.isFinite(t) && Number.isInteger(t * 2), ht = (t) => !!(_t(t) === "MATHS" && (t?.phaseCode ? t.phaseCode === "S" : t?.gradeCode ? t.gradeCode.startsWith("S") : /^高[一二三]/.test(t?.grade || "")));
-function Qt(t) {
+const W = { questions: 200, options: 12, score: 15 }, je = (t) => t.multiple ? t.indefinite ? "indefinite" : "multiple" : "single", v = (t) => Number.isFinite(t) && Number.isInteger(t * 2), pt = (t) => !!(Dt(t) === "MATHS" && (t?.phaseCode ? t.phaseCode === "S" : t?.gradeCode ? t.gradeCode.startsWith("S") : /^高[一二三]/.test(t?.grade || "")));
+function Jt(t) {
   const e = typeof t.score == "number" && v(t.score) && t.score >= 0.5 && t.score <= W.score ? t.score : null, r = [...new Set(t.correctIds)].filter((n) => t.options.some((o) => o.id === n));
   return {
     ...t,
@@ -100,32 +100,32 @@ function Qt(t) {
     correctIds: t.multiple ? r : r.slice(0, 1)
   };
 }
-function Tt(t, e, r) {
+function St(t, e, r) {
   let n = { ...t };
   if (e.kind !== void 0) {
     const o = e.kind !== "single";
-    o && !t.multiple && (n.scoreType = ht(r) ? "ITEM_SCORE" : "LESS_SCORE", typeof n.score != "number" && ht(r) && (n.score = 6)), n.multiple = o, n.indefinite = e.kind === "indefinite";
+    o && !t.multiple && (n.scoreType = pt(r) ? "ITEM_SCORE" : "LESS_SCORE", typeof n.score != "number" && pt(r) && (n.score = 6)), n.multiple = o, n.indefinite = e.kind === "indefinite";
   }
   if (e.optionCount !== void 0) {
     const o = Math.max(2, Math.min(W.options, Math.round(e.optionCount)));
     n.options = Array.from({ length: o }, (s, c) => t.options[c] || { id: crypto.randomUUID(), label: String.fromCharCode(65 + c) });
   }
-  return e.score !== void 0 && (n.score = e.score), e.scoreType !== void 0 && (n.scoreType = e.scoreType), e.lessScore !== void 0 && (n.lessScore = e.lessScore), Qt(n);
+  return e.score !== void 0 && (n.score = e.score), e.scoreType !== void 0 && (n.scoreType = e.scoreType), e.lessScore !== void 0 && (n.lessScore = e.lessScore), Jt(n);
 }
-function Dt(t) {
+function kt(t) {
   return typeof t.score == "number" && (!v(t.score) || t.score < 0.5 || t.score > W.score) ? "每题分值须为 0.5–15 分，按 0.5 分递增" : t.multiple && t.scoreType === "LESS_SCORE" && typeof t.score == "number" && (!v(t.lessScore ?? 0) || (t.lessScore ?? 0) < 0 || (t.lessScore ?? 0) > t.score) ? "少选得分须为 0.5 的倍数，且不能超过本题分值" : t.multiple && t.scoreType === "ITEM_SCORE" && typeof t.score == "number" && t.correctIds.length && !v(t.score / t.correctIds.length) ? "答案个数与分值不匹配，每个正确选项的得分须为 0.5 的倍数" : null;
 }
-function je(t) {
-  return t.multiple && t.scoreType === "ITEM_SCORE" && typeof t.score == "number" && t.correctIds.length && !Dt(t) ? t.score / t.correctIds.length : null;
-}
 function Ge(t) {
+  return t.multiple && t.scoreType === "ITEM_SCORE" && typeof t.score == "number" && t.correctIds.length && !kt(t) ? t.score / t.correctIds.length : null;
+}
+function Ue(t) {
   const e = t.map((o) => Number(o.label)).filter((o) => Number.isSafeInteger(o) && o > 0 && o < 1e5);
   let r = String(Math.max(0, ...e) + 1);
   const n = new Set(t.map((o) => o.label));
   for (; n.has(r); ) r = String(Number(r) + 1);
   return r;
 }
-function Ue(t, e) {
+function Fe(t, e) {
   const r = new Map(t.options.map((n) => [n.id, crypto.randomUUID()]));
   return {
     ...t,
@@ -137,73 +137,73 @@ function Ue(t, e) {
     correctIds: t.correctIds.map((n) => r.get(n)).filter(Boolean)
   };
 }
-function Jt(t, e, r) {
+function Xt(t, e, r) {
   return r.trim() ? t.some((n) => n.id !== e && n.label.trim() === r.trim()) ? "题组内题号不能重复" : null : "题号不能为空";
 }
-function Fe(t, e, r, n) {
+function Ke(t, e, r, n) {
   const o = t.questions.filter((a) => e.includes(a.id));
   if (!o.length) return { error: "请选择要修改的题目" };
   let s;
   if (r.type === "settings") {
     if (!Object.keys(r.patch).length) return { error: "请设置需要修改的属性" };
-    const { optionCount: a, score: y, lessScore: T } = r.patch;
+    const { optionCount: a, score: y, lessScore: b } = r.patch;
     if (a !== void 0 && (!Number.isInteger(a) || a < 2 || a > W.options)) return { error: "选项个数须为 2–12 的整数" };
     if (typeof y == "number" && (!v(y) || y < 0.5 || y > W.score)) return { error: "每题分值须为 0.5–15 分，按 0.5 分递增" };
-    if (T !== void 0 && (!v(T) || T < 0)) return { error: "少选得分须为非负的 0.5 倍数" };
-    if (s = o.map((m) => Tt(m, r.patch, n)), T !== void 0 && s.some((m) => m.multiple && m.scoreType !== "ITEM_SCORE" && T > (m.score ?? 0))) return { error: "少选得分不能超过所选题目的分值" };
+    if (b !== void 0 && (!v(b) || b < 0)) return { error: "少选得分须为非负的 0.5 倍数" };
+    if (s = o.map((m) => St(m, r.patch, n)), b !== void 0 && s.some((m) => m.multiple && m.scoreType !== "ITEM_SCORE" && b > (m.score ?? 0))) return { error: "少选得分不能超过所选题目的分值" };
   } else if (r.type === "numbering") {
     if (!Number.isInteger(r.start) || r.start < 1 || r.start + o.length - 1 > 1e3) return { error: "连续题号须在 1–1000 内" };
     s = o.map((a, y) => ({ ...a, label: String(r.start + y) }));
   } else if (r.type === "average") {
     const a = r.total / o.length;
     if (!v(a) || a < 0.5 || a > W.score) return { error: "总分无法平均分配，每题须为 0.5–15 分且为 0.5 的倍数" };
-    s = o.map((y) => Tt(y, { score: a }));
+    s = o.map((y) => St(y, { score: a }));
   } else {
     const a = r.text.toUpperCase().trim().split(/[\s,，;；]+/).filter(Boolean);
     if (a.length !== o.length) return { error: `需要 ${o.length} 组答案，当前为 ${a.length} 组` };
     s = [];
     for (let y = 0; y < o.length; y++) {
-      const T = o[y], m = a[y];
-      if (m !== "-" && (!/^[A-T]+$/.test(m) || new Set(m).size !== m.length || [...m].some((p) => !T.options.some((l) => l.label === p)))) return { error: `第 ${T.label} 题包含无效或重复选项` };
-      const f = m === "-" ? [] : [...m].map((p) => T.options.find((l) => l.label === p).id);
-      if (!T.multiple && f.length > 1) return { error: `第 ${T.label} 题为单选，只能设置一个答案` };
-      s.push({ ...T, correctIds: f });
+      const b = o[y], m = a[y];
+      if (m !== "-" && (!/^[A-T]+$/.test(m) || new Set(m).size !== m.length || [...m].some((p) => !b.options.some((l) => l.label === p)))) return { error: `第 ${b.label} 题包含无效或重复选项` };
+      const f = m === "-" ? [] : [...m].map((p) => b.options.find((l) => l.label === p).id);
+      if (!b.multiple && f.length > 1) return { error: `第 ${b.label} 题为单选，只能设置一个答案` };
+      s.push({ ...b, correctIds: f });
     }
   }
   const c = new Map(s.map((a) => [a.id, a])), i = t.questions.map((a) => c.get(a.id) || a);
   for (const a of s) {
-    const y = Jt(i, a.id, a.label) || Dt(a);
+    const y = Xt(i, a.id, a.label) || kt(a);
     if (y) return { error: `第 ${a.label} 题：${y}` };
   }
   return { value: { ...t, questions: i } };
 }
-const Xt = { layout: "natural", columns: 2, indent: !1, rowGap: 0, columnGap: 32, marker: "letter" }, St = (t) => `question:${t}`, Yt = (t) => t.presentation === "stem" ? "stem" : ["option", "distributed"].includes(t.presentation) ? "option" : "concentrated";
-function Ke(t, e, r) {
-  const n = xt(e), o = /* @__PURE__ */ new Map(), s = (i, a) => {
+const Yt = { layout: "natural", columns: 2, indent: !1, rowGap: 0, columnGap: 32, marker: "letter" }, At = (t) => `question:${t}`, Zt = (t) => t.presentation === "stem" ? "stem" : ["option", "distributed"].includes(t.presentation) ? "option" : "concentrated";
+function ve(t, e, r) {
+  const n = $t(e), o = /* @__PURE__ */ new Map(), s = (i, a) => {
     const y = i.attrs?.contentId || a;
-    i.type === "choiceGroup" && y && o.set(i.attrs.id, y), i.content?.forEach((T) => s(T, y));
+    i.type === "choiceGroup" && y && o.set(i.attrs.id, y), i.content?.forEach((b) => s(b, y));
   };
   s(e.content);
   const c = new Set(t.questions.map((i) => i.contentTarget?.groupId));
   return { ...t, presentation: r, questions: t.questions.map((i, a) => {
-    const y = n.find((T) => o.get(T.id) === i.id) || (o.size ? void 0 : n[a]);
-    return r === "concentrated" || i.contentTarget !== void 0 || !y || c.has(y.id) ? i : (c.add(y.id), { ...i, contentTarget: { groupId: y.id, optionIds: y.options.map((T) => T.id) } });
+    const y = n.find((b) => o.get(b.id) === i.id) || (o.size ? void 0 : n[a]);
+    return r === "concentrated" || i.contentTarget !== void 0 || !y || c.has(y.id) ? i : (c.add(y.id), { ...i, contentTarget: { groupId: y.id, optionIds: y.options.map((b) => b.id) } });
   }) };
 }
-function Zt(t, e, r) {
-  const n = Yt(t), o = new Map(xt(e).map((f) => [f.id, f])), s = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), a = (f, p) => {
+function qt(t, e, r) {
+  const n = Zt(t), o = new Map($t(e).map((f) => [f.id, f])), s = /* @__PURE__ */ new Set(), c = /* @__PURE__ */ new Map(), i = /* @__PURE__ */ new Map(), a = (f, p) => {
     const l = f.attrs?.contentId || p;
     f.type === "choiceGroup" && l && (c.set(l, [...c.get(l) || [], f.attrs.id]), i.set(f.attrs.id, l)), f.type === "choiceStemAnchor" && typeof f.attrs?.groupId == "string" && s.add(f.attrs.groupId), f.content?.forEach((u) => a(u, l));
   };
   a(e.content);
-  const y = [], T = /* @__PURE__ */ new Set(), m = t.questions.filter((f) => {
+  const y = [], b = /* @__PURE__ */ new Set(), m = t.questions.filter((f) => {
     if (!r || n === "concentrated") return !0;
-    if (n === "stem" && s.has(St(f.id)))
-      return y.push({ groupId: St(f.id), questionId: f.id, options: f.options.map((C) => ({ ...C, contentOptionId: C.id })) }), !1;
+    if (n === "stem" && s.has(At(f.id)))
+      return y.push({ groupId: At(f.id), questionId: f.id, options: f.options.map((C) => ({ ...C, contentOptionId: C.id })) }), !1;
     const p = c.get(f.id), l = p?.length === 1 ? o.get(p[0]) : void 0, u = l ? { groupId: l.id, optionIds: l.options.map((C) => C.id) } : f.contentTarget, g = u && o.get(u.groupId);
-    if (!u || !g || T.has(g.id) || n === "stem" && !s.has(g.id) || i.has(g.id) && i.get(g.id) !== f.id) return !0;
+    if (!u || !g || b.has(g.id) || n === "stem" && !s.has(g.id) || i.has(g.id) && i.get(g.id) !== f.id) return !0;
     const A = u.optionIds.slice(0, f.options.length);
-    return A.length !== f.options.length || new Set(A).size !== A.length || A.some((C) => !g.options.some((x) => x.id === C)) ? !0 : (T.add(g.id), y.push({ groupId: g.id, questionId: f.id, options: f.options.map((C, x) => ({ ...C, contentOptionId: A[x] })) }), !1);
+    return A.length !== f.options.length || new Set(A).size !== A.length || A.some((C) => !g.options.some((x) => x.id === C)) ? !0 : (b.add(g.id), y.push({ groupId: g.id, questionId: f.id, options: f.options.map((C, x) => ({ ...C, contentOptionId: A[x] })) }), !1);
   });
   return { position: n === "concentrated" ? void 0 : n, bindings: y, concentrated: { ...t, questions: m } };
 }
@@ -221,7 +221,7 @@ function at(t, e = 4) {
     options: Array.from({ length: e }, (r, n) => ({ id: crypto.randomUUID(), label: String.fromCharCode(65 + n) }))
   };
 }
-function qt(t = 8) {
+function te(t = 8) {
   return {
     source: "manual",
     presentation: "concentrated",
@@ -233,10 +233,10 @@ function qt(t = 8) {
     questions: Array.from({ length: t }, (e, r) => at(r))
   };
 }
-function ve(t) {
+function ze(t) {
   return new Set(t.questions.map((e) => e.options.length)).size > 1 ? "column" : t.direction;
 }
-function te(t) {
+function ee(t) {
   const e = [];
   for (const r of t.questions) {
     const n = e.at(-1);
@@ -244,13 +244,13 @@ function te(t) {
   }
   return e;
 }
-function ze(t) {
+function We(t) {
   const e = [];
-  for (const r of te(t))
+  for (const r of ee(t))
     (!e.length || r[0].breakBefore) && e.push([]), e[e.length - 1].push(r);
   return e;
 }
-const ee = {
+const ne = {
   judge: "判断题",
   fill: "填空题",
   answer: "解答题",
@@ -269,11 +269,11 @@ const ee = {
   composite: "材料／复合题",
   optional: "选做题组",
   practice: "实践评价"
-}, We = { choice: "选择", judge: "判断", fill: "填空", answer: "简答", calculation: "计算／证明", correction: "改错", drawing: "作图", table: "表格", writing: "作文", english: "外语写作" }, Ve = ["reading", "cloze", "completion", "composite", "optional"], j = () => ({ version: 1, content: { type: "doc", content: [{ type: "paragraph" }] } }), Qe = { symbols: ["√", "×"], letters: ["T", "F"], words: ["正确", "错误"] }, ne = (t) => ["writing", "english"].includes(t) ? 70 : ["answer", "calculation", "drawing", "table", "correction"].includes(t) ? 60 : 15, Je = (t) => t === "judge" ? 200 : t === "fill" ? 50 : ["reading", "cloze", "completion"].includes(t) ? 20 : t === "matching" ? 9 : 100;
-function oe(t = 0) {
+}, Ve = { choice: "选择", judge: "判断", fill: "填空", answer: "简答", calculation: "计算／证明", correction: "改错", drawing: "作图", table: "表格", writing: "作文", english: "外语写作" }, Qe = ["reading", "cloze", "completion", "composite", "optional"], j = () => ({ version: 1, content: { type: "doc", content: [{ type: "paragraph" }] } }), Je = { symbols: ["√", "×"], letters: ["T", "F"], words: ["正确", "错误"] }, oe = (t) => ["writing", "english"].includes(t) ? 70 : ["answer", "calculation", "drawing", "table", "correction"].includes(t) ? 60 : 15, Xe = (t) => t === "judge" ? 200 : t === "fill" ? 50 : ["reading", "cloze", "completion"].includes(t) ? 20 : t === "matching" ? 9 : 100;
+function re(t = 0) {
   return { id: crypto.randomUUID(), label: String(t + 1), width: 50, style: "line", characters: 6, score: null, answers: [], prefix: "", suffix: "", breakAfter: !1 };
 }
-function re(t, e = "1") {
+function ie(t, e = "1") {
   const r = crypto.randomUUID();
   return {
     id: r,
@@ -285,7 +285,7 @@ function re(t, e = "1") {
     score: null,
     choice: { ...at(0, t === "judge" ? 2 : 4), id: r, label: e },
     presentation: "concentrated",
-    blanks: [oe()],
+    blanks: [re()],
     steps: [],
     needsReason: !1,
     judgment: null,
@@ -293,12 +293,12 @@ function re(t, e = "1") {
     area: { style: t === "writing" ? "characters" : t === "english" ? "lines" : t === "drawing" ? "grid" : "blank", rows: t === "writing" ? 20 : 6, columns: 20, rowHeight: t === "writing" ? 40 : 28, wordMark: 100, title: !1, backgroundUrl: "" }
   };
 }
-function ie(t) {
+function se(t) {
   return ["reading", "cloze", "chunk"].includes(t) ? "choice" : ["matching", "completion"].includes(t) ? "fill" : ["ordering", "composite", "optional", "practice"].includes(t) ? "answer" : t;
 }
-function Xe(t) {
+function Ye(t) {
   return {
-    items: [re(ie(t))],
+    items: [ie(se(t))],
     judgeLabels: "symbols",
     fillNewLine: !0,
     pool: [],
@@ -319,10 +319,10 @@ function Xe(t) {
     attachmentUrl: ""
   };
 }
-function Ye(t) {
+function Ze(t) {
   return String(Math.max(0, ...t.map((e) => /^\d+$/.test(e.label) ? Number(e.label) : 0)) + 1);
 }
-function kt(t) {
+function Pt(t) {
   const e = structuredClone(t), r = /* @__PURE__ */ new Map(), n = (s) => {
     !s || typeof s != "object" || Object.entries(s).forEach(([c, i]) => {
       ["id", "answerId"].includes(c) && typeof i == "string" ? r.set(i, crypto.randomUUID()) : n(i);
@@ -332,24 +332,24 @@ function kt(t) {
   const o = (s) => typeof s == "string" ? r.get(s) || s : Array.isArray(s) ? s.map(o) : s && typeof s == "object" ? Object.fromEntries(Object.entries(s).map(([c, i]) => [r.get(c) || c, o(i)])) : s;
   return o(e);
 }
-function Ze(t, e) {
-  const r = kt(t);
+function qe(t, e) {
+  const r = Pt(t);
   return { ...r, label: e, choice: { ...r.choice, label: e } };
 }
-function qe(t, e, r) {
+function tn(t, e, r) {
   const n = t.findIndex((c) => c.id === e), o = n + r;
   if (n < 0 || o < 0 || o >= t.length) return t;
   const s = [...t];
   return s.splice(o, 0, ...s.splice(n, 1)), s;
 }
-function tn(t, e) {
+function en(t, e) {
   return { ...t, pool: t.pool.filter((r) => r.id !== e), sequence: t.sequence.filter((r) => r !== e), assignments: Object.fromEntries(Object.entries(t.assignments).filter(([r]) => r !== e)), items: t.items.map((r) => ({ ...r, targets: r.targets.filter((n) => n !== e) })) };
 }
-function en(t, e, r) {
+function nn(t, e, r) {
   const n = [...new Set(r)].filter((s) => t.pool.some((c) => c.id === s)), o = t.relation === "one" ? n.slice(-1) : n;
   return { ...t, items: t.items.map((s) => s.id === e ? { ...s, targets: o } : t.reuseOptions ? s : { ...s, targets: s.targets.filter((c) => !o.includes(c)) }) };
 }
-function nn(t, e) {
+function on(t, e) {
   let r = 0;
   for (; r < e.length && r < t.chunkText.length && e[r] === t.chunkText[r]; ) r++;
   let n = 0;
@@ -357,11 +357,11 @@ function nn(t, e) {
   const o = t.chunkText.length - n, s = /* @__PURE__ */ new Set(), c = t.chunkPoints.filter((i) => i.offset <= r || i.offset >= o).map((i) => ({ ...i, offset: i.offset <= r ? i.offset : i.offset + e.length - t.chunkText.length })).filter((i) => i.offset <= 0 || i.offset >= e.length || s.has(i.offset) ? !1 : (s.add(i.offset), !0));
   return { ...t, chunkText: e, chunkPoints: c, chunkCorrect: t.chunkCorrect.filter((i) => c.some((a) => a.id === i)) };
 }
-function on(t, e) {
+function rn(t, e) {
   const r = [], n = t.items.map((o) => o.label.trim());
   (n.some((o) => !o) || new Set(n).size !== n.length) && r.push("题号不能为空或重复");
   for (const o of t.items) {
-    o.score !== null && (!Number.isFinite(o.score) || o.score < 0.5 || o.score > ne(o.kind) || !Number.isInteger(o.score * 2)) && r.push(`${o.label} 题分值超出范围或不是 0.5 的倍数`);
+    o.score !== null && (!Number.isFinite(o.score) || o.score < 0.5 || o.score > oe(o.kind) || !Number.isInteger(o.score * 2)) && r.push(`${o.label} 题分值超出范围或不是 0.5 的倍数`);
     const c = (o.kind === "fill" ? o.blanks : o.steps).map((i) => i.score);
     c.length && o.score !== null && c.every((i) => i !== null) && c.reduce((i, a) => i + (a || 0), 0) !== o.score && r.push(`${o.label} 题分项分值之和与题分不一致`);
   }
@@ -371,15 +371,15 @@ function on(t, e) {
   }
   return e === "optional" && t.chooseCount > t.items.length && r.push("选做数量不能超过题目数量"), e === "chunk" && t.chunkCorrect.length > t.chunkMax && r.push("正确断点数不能超过最多选择数"), r;
 }
-function rn(t = 3, e = 3) {
+function sn(t = 3, e = 3) {
   return { version: 1, content: { type: "doc", content: [{ type: "table", content: Array.from({ length: t }, () => ({ type: "tableRow", content: Array.from({ length: e }, () => ({ type: "tableCell", content: [{ type: "paragraph" }] })) })) }] } };
 }
 function J(t) {
   const e = (r) => !!(r.text || r.type && !["doc", "paragraph", "choiceStemAnchor"].includes(r.type) || r.content?.some(e));
   return !e(t.content);
 }
-const sn = { choice: "选择题", area: "空白区域", ...ee };
-function cn(t) {
+const cn = { choice: "选择题", area: "空白区域", ...ne };
+function an(t) {
   return {
     id: crypto.randomUUID(),
     kind: "area",
@@ -389,10 +389,10 @@ function cn(t) {
     document: { version: 1, content: { type: "doc", content: t === "forbiden" ? ["请勿在此区域作答", "或者做任何标记"].map((e) => ({ type: "paragraph", attrs: { textAlign: "center", lineSpacing: 0 }, content: [{ type: "text", text: e }] })) : [{ type: "paragraph" }] } }
   };
 }
-function se() {
+function ce() {
   return { version: 1, title: "", questionCard: !1, preset: "a3-two", margin: 15, gap: 10, blocks: [] };
 }
-function ce(t = "") {
+function ae(t = "") {
   return {
     // 22px title + the configured 9mm line spacing + 10px bottom inset.
     id: crypto.randomUUID(),
@@ -404,56 +404,56 @@ function ce(t = "") {
     }] } }
   };
 }
-function ae(t) {
+function le(t) {
   return {
-    ...se(),
+    ...ce(),
     title: t.name,
     creation: t,
-    paperTitle: ce(t.name),
+    paperTitle: ae(t.name),
     header: { focusText: !0, writeKaohao: !1, missExam: !1, mifeng: !1, kaohao: "school", weishu: 8 }
   };
 }
 function Q(t, e = 96) {
   return t * e / 25.4;
 }
-const le = {
+const ue = {
   a4: { label: "A4 单栏", width: 210, height: 297, columns: 1 },
   "a3-two": { label: "A3 双栏", width: 420, height: 297, columns: 2 },
   "a3-three": { label: "A3 三栏", width: 420, height: 297, columns: 3 }
-}, et = 44, it = 16;
-function Ct(t, e) {
-  const r = le[t.preset], n = Q(r.width), o = Q(r.height), s = Q(t.margin), c = Q(t.gap), i = t.usage !== "homework" && t.header?.mifeng ? Q(t.header.kaohao === "code" ? 26 : 14) : 0, a = n - s * 2 - i, y = (a - c * (r.columns - 1)) / r.columns, T = Math.max(s, t.header ? t.recognition?.examQrCode ? 64 : 39 : 0), m = Math.max(s, t.header ? 56 : 0), f = o - T - m, p = f - it, l = t.header ? y : a, u = e && e.id === t.paperTitle?.id && Math.abs(e.width - l) < 1 ? e : void 0, g = t.paperTitle ? Math.min(f, u?.height ?? t.paperTitle.height + (t.header ? 260 : it)) : 0, A = (w, O = 0) => !!t.paperTitle && (t.header ? w % 2 === 0 && O === 0 : w === 0), C = (w, O = 0) => A(w, O) ? g : 0;
-  return { ...r, width: n, height: o, margin: s, topInset: T, bottomInset: m, gap: c, sealWidth: i, contentWidth: a, contentHeight: f, columnWidth: y, columnX: (w, O) => s + (w % 2 === 0 ? i : 0) + O * (y + c), titleWidth: l, titleMaxHeight: p, hasHeader: A, headerHeight: C, capacity: (w, O = 0) => f - C(w, O) };
+}, et = 44, it = 16, dt = 1;
+function It(t, e) {
+  const r = ue[t.preset], n = Q(r.width), o = Q(r.height), s = Q(t.margin), c = Q(t.gap), i = t.usage !== "homework" && t.header?.mifeng ? Q(t.header.kaohao === "code" ? 26 : 14) : 0, a = n - s * 2 - i, y = (a - c * (r.columns - 1)) / r.columns, b = Math.max(s, t.header ? t.recognition?.examQrCode ? 64 : 39 : 0), m = Math.max(s, t.header ? 56 : 0), f = o - b - m, p = f - it, l = t.header ? y : a, u = e && e.id === t.paperTitle?.id && Math.abs(e.width - l) < 1 ? e : void 0, g = t.paperTitle ? Math.min(f, u?.height ?? t.paperTitle.height + (t.header ? 260 : it)) : 0, A = (T, O = 0) => !!t.paperTitle && (t.header ? T % 2 === 0 && O === 0 : T === 0), C = (T, O = 0) => A(T, O) ? g : 0;
+  return { ...r, width: n, height: o, margin: s, topInset: b, bottomInset: m, gap: c, sealWidth: i, contentWidth: a, contentHeight: f, columnWidth: y, columnX: (T, O) => s + (T % 2 === 0 ? i : 0) + O * (y + c), titleWidth: l, titleMaxHeight: p, hasHeader: A, headerHeight: C, capacity: (T, O = 0) => f - C(T, O) };
 }
-function an(t, e, r) {
-  const n = Ct(t, r);
+function ln(t, e, r) {
+  const n = It(t, r);
   let o = 0, s = 0, c = 0;
   const i = () => {
     s++, s === n.columns && (s = 0, o++), c = 0;
-  }, a = t.blocks.map((T) => {
-    const m = e[T.id], f = m && Math.abs(m.width - n.columnWidth) < 1 ? m.height : 100 + T.answerHeight, p = m && Math.abs(m.width - n.columnWidth) < 1 ? [...new Set([...m.breaks || [], f].filter((M) => Number.isFinite(M) && M > 0 && M <= f))].sort((M, w) => M - w) : [], l = T.reference?.type === "CCOMPOSITION", u = (M) => l && M > 0 ? Math.max(0, 6 - Math.max(0, (m?.compositionStart || 0) - M)) : 0;
-    if (p.length > 1 && p.every((M, w) => {
-      const O = p[w - 1] || 0;
+  }, a = t.blocks.map((b) => {
+    const m = e[b.id], f = m && Math.abs(m.width - n.columnWidth) < 1 ? m.height : 100 + b.answerHeight, p = m && Math.abs(m.width - n.columnWidth) < 1 ? [...new Set([...m.breaks || [], f].filter((M) => Number.isFinite(M) && M > 0 && M <= f))].sort((M, T) => M - T) : [], l = b.reference?.type === "CCOMPOSITION", u = (M) => l && M > 0 ? Math.max(0, 6 - Math.max(0, (m?.compositionStart || 0) - M)) : 0;
+    if (p.length > 1 && p.every((M, T) => {
+      const O = p[T - 1] || 0;
       return M - O + u(O) <= n.capacity(1) + 0.5;
     })) {
       const M = [];
-      let w = 0;
-      for (; w < f - 0.5; ) {
-        const h = n.capacity(o, s) - c, I = w, d = u(w), b = (N) => m?.markingFrames?.some((L) => L.from >= I - 0.5 && L.from < N - 0.5 && L.to > N + 0.5) ? 22 : 0, E = p.filter((N) => N > I + 0.5 && N + b(N) <= I + h - d + 0.5).at(-1);
-        if (E === void 0) {
+      let T = 0;
+      for (; T < f - 0.5; ) {
+        const h = n.capacity(o, s) - c, I = T, d = u(T), E = (N) => m?.markingFrames?.some((L) => L.from >= I - 0.5 && L.from < N - 0.5 && L.to > N + 0.5) ? 22 : 0, w = p.filter((N) => N > I + 0.5 && N + E(N) <= I + h - d + 0.5).at(-1);
+        if (w === void 0) {
           i();
           continue;
         }
-        const S = l && E < f - 0.5 ? Math.max(b(E), h - d - (E - w)) : b(E);
-        M.push({ page: o, column: s, x: n.columnX(o, s), y: o * (n.height + et) + n.topInset + n.headerHeight(o, s) + c, from: w, to: E, ...d ? { topPadding: d } : {}, ...S ? { bottomPadding: S } : {} }), c += E - w + d, w = E, w < f - 0.5 && i();
+        const S = l && w < f - 0.5 ? Math.max(E(w), h - d - (w - T)) : E(w);
+        M.push({ page: o, column: s, x: n.columnX(o, s), y: o * (n.height + et) + n.topInset + n.headerHeight(o, s) + c, from: T, to: w, ...d ? { topPadding: d } : {}, ...S ? { bottomPadding: S } : {} }), c += w - T + d, T = w, T < f - 0.5 && i();
       }
       c += it;
       const O = M[0];
-      return { id: T.id, ...O, height: f, available: n.capacity(O.page, O.column), overflowing: !1, fragments: M };
+      return { id: b.id, ...O, height: f, available: n.capacity(O.page, O.column), overflowing: !1, fragments: M };
     }
     for (; c + f > n.capacity(o, s) + 0.5 && (c > 0 || n.headerHeight(o, s) > 0); ) i();
     const A = n.capacity(o, s), C = f > A + 0.5, x = {
-      id: T.id,
+      id: b.id,
       page: o,
       column: s,
       x: n.columnX(o, s),
@@ -465,19 +465,22 @@ function an(t, e, r) {
     };
     return c += Math.min(f, A) + it, x;
   }), y = /* @__PURE__ */ new Map();
-  return a.forEach((T, m) => T.fragments.forEach((f) => {
+  a.forEach((b, m) => b.fragments.forEach((f) => {
     const p = `${f.page}/${f.column}`, l = y.get(p) || [];
-    l.push({ fragment: f, placement: T, blockIndex: m }), y.set(p, l);
-  })), y.forEach((T) => {
-    const m = T.filter((u) => ["answer", "writing", "english", "composite", "area"].includes(t.blocks[u.blockIndex].kind)).at(-1);
+    l.push({ fragment: f, placement: b, blockIndex: m }), y.set(p, l);
+  })), y.forEach((b) => {
+    const m = b.filter((u) => ["answer", "writing", "english", "composite", "area"].includes(t.blocks[u.blockIndex].kind)).at(-1);
     if (!m || t.blocks[m.blockIndex].reference?.type !== "CCOMPOSITION" && t.blocks[m.blockIndex].kind !== "area") return;
-    const f = T.at(-1).fragment, l = f.page * (n.height + et) + n.height - n.bottomInset - f.y - (f.to - f.from) - (f.topPadding || 0) - (f.bottomPadding || 0);
-    l <= 0 || l > 30 || (m.fragment.bottomPadding = (m.fragment.bottomPadding || 0) + l, T.slice(T.indexOf(m) + 1).forEach(({ fragment: u, placement: g }) => {
+    const f = b.at(-1).fragment, l = f.page * (n.height + et) + n.height - n.bottomInset - f.y - (f.to - f.from) - (f.topPadding || 0) - (f.bottomPadding || 0);
+    l <= 0 || l > 30 || (m.fragment.bottomPadding = (m.fragment.bottomPadding || 0) + l, b.slice(b.indexOf(m) + 1).forEach(({ fragment: u, placement: g }) => {
       u.y += l, g.fragments[0] === u && (g.y = u.y);
     }));
-  }), { geometry: n, placements: a, pageCount: o + 1 };
+  });
+  for (const b of a)
+    (b.overflowing || b.fragments.some((m) => m.page >= dt)) && (b.overflowFrom = b.fragments.filter((m) => m.page < dt).at(-1)?.to || 0);
+  return { geometry: n, placements: a, pageCount: dt, requiredPageCount: o + 1 };
 }
-function pt(t, e) {
+function gt(t, e) {
   return { version: 1, content: { type: "doc", content: [{ type: "paragraph", content: [
     { type: "text", text: `${t}.`, marks: [{ type: "documentLabel", attrs: { kind: "number" } }] },
     ...e ? [{ type: "text", text: `（${e}分）`, marks: [{ type: "documentLabel", attrs: { kind: "score" } }] }] : []
@@ -488,8 +491,8 @@ function st(t, e, r) {
     if (!o.content) return o;
     let s;
     const c = o.content.flatMap((a) => {
-      const y = a.type === "text" && a.marks?.find((f) => f.type === "documentLabel")?.attrs?.kind, T = y && y === s;
-      if (s = y, T) return [];
+      const y = a.type === "text" && a.marks?.find((f) => f.type === "documentLabel")?.attrs?.kind, b = y && y === s;
+      if (s = y, b) return [];
       if (!y) return [n(a)];
       const m = y === "number" ? `${e}.` : r ? `（${r}分）` : "";
       return m ? [{ ...a, text: m }] : [];
@@ -498,7 +501,7 @@ function st(t, e, r) {
   };
   return { ...t, content: n(t.content) };
 }
-const It = {
+const yt = {
   SCHOICE: "单选题",
   MCHOICE: "多选题",
   JUDGE: "判断题",
@@ -512,19 +515,19 @@ const It = {
   ECOMPOSITION: "英语作文",
   CCOMPOSITION: "语文作文",
   CHUNK_CHOICE: "断句题"
-}, At = ["SCHOICE", "MCHOICE", "JUDGE", "FILLBLANK", "SHORTANSWER", "MIXED"];
-function ln(t, e = !1) {
-  const r = _t(t), n = e ? At.filter((o) => o !== "MIXED") : At;
-  return e ? ["CHINESE", "JAPANESE"].includes(r || "") ? [...n, "CHUNK_CHOICE"] : n : r === "CHINESE" ? [...n, "CCOMPOSITION", "CHUNK_CHOICE"] : r === "ENGLISH" ? [...n, "CLOZE", "READTHENANSWER", "INFO_MATCHING", "TEXT_COMPLETION", "ECOMPOSITION"] : r === "JAPANESE" ? Object.keys(It) : ["POLITICAL", "HISTORY"].includes(r || "") ? [...n, "CCOMPOSITION"] : n;
+}, Ot = ["SCHOICE", "MCHOICE", "JUDGE", "FILLBLANK", "SHORTANSWER", "MIXED"];
+function un(t, e = !1) {
+  const r = Dt(t), n = e ? Ot.filter((o) => o !== "MIXED") : Ot;
+  return e ? ["CHINESE", "JAPANESE"].includes(r || "") ? [...n, "CHUNK_CHOICE"] : n : r === "CHINESE" ? [...n, "CCOMPOSITION", "CHUNK_CHOICE"] : r === "ENGLISH" ? [...n, "CLOZE", "READTHENANSWER", "INFO_MATCHING", "TEXT_COMPLETION", "ECOMPOSITION"] : r === "JAPANESE" ? Object.keys(yt) : ["POLITICAL", "HISTORY"].includes(r || "") ? [...n, "CCOMPOSITION"] : n;
 }
-const ue = (t) => ["CLOZE", "READTHENANSWER", "INFO_MATCHING", "TEXT_COMPLETION"].includes(t), fe = (t) => ["SCHOICE", "MCHOICE", "CLOZE", "READTHENANSWER", "INFO_MATCHING", "JUDGE"].includes(t), Z = (t) => ({ version: 1, content: { type: "doc", content: t.length ? t : [{ type: "paragraph" }] } });
-function Pt(t, e, r = !1) {
+const fe = (t) => ["CLOZE", "READTHENANSWER", "INFO_MATCHING", "TEXT_COMPLETION"].includes(t), de = (t) => ["SCHOICE", "MCHOICE", "CLOZE", "READTHENANSWER", "INFO_MATCHING", "JUDGE"].includes(t), Z = (t) => ({ version: 1, content: { type: "doc", content: t.length ? t : [{ type: "paragraph" }] } });
+function Rt(t, e, r = !1) {
   return {
     content: j(),
     numbered: !r,
     groupId: `options:${e.id}`,
-    layout: { ...Xt, columns: t === "CLOZE" ? 4 : 2, ...t === "READTHENANSWER" ? { layout: "fixed", columnGap: 0 } : {} },
-    itemsContent: !r && fe(t) ? e.options.map((n) => ({ id: n.id, key: n.label, content: j() })) : []
+    layout: { ...Yt, columns: t === "CLOZE" ? 4 : 2, ...t === "READTHENANSWER" ? { layout: "fixed", columnGap: 0 } : {} },
+    itemsContent: !r && de(t) ? e.options.map((n) => ({ id: n.id, key: n.label, content: j() })) : []
   };
 }
 const ct = (t) => {
@@ -532,7 +535,7 @@ const ct = (t) => {
   const { contentId: e, ...r } = t.attrs || {};
   return { ...t, ...t.attrs ? { attrs: r } : {}, ...t.content ? { content: t.content.map(ct).filter((n) => n !== null) } : {} };
 };
-function Ot(t, e, r) {
+function Nt(t, e, r) {
   const o = (t.content.content.content || [{ type: "paragraph" }]).map((s) => ({ ...s, attrs: { ...s.attrs, contentId: e } }));
   if (t.numbered) {
     const s = { type: "text", text: `${r}．`, marks: [{ type: "documentLabel", attrs: { kind: "number" } }] };
@@ -544,7 +547,7 @@ function Ot(t, e, r) {
     content: s.content.content.content || [{ type: "paragraph" }]
   })) }), o;
 }
-function de(t, e) {
+function he(t, e) {
   const r = e.filter((i) => i.type === "choiceGroup"), n = r.find((i) => i.attrs?.id === t.groupId) || (r.length === 1 ? r[0] : void 0), o = e.filter((i) => i !== n);
   let s = !1;
   const c = (i) => {
@@ -559,45 +562,45 @@ function de(t, e) {
     itemsContent: (n?.content || []).map((i, a) => ({ id: i.attrs?.id || t.itemsContent[a]?.id || crypto.randomUUID(), key: i.attrs?.label || String.fromCharCode(65 + a), content: Z((i.content || []).map(ct).filter((y) => y !== null)) }))
   };
 }
-function he(t, e, r, n) {
+function pe(t, e, r, n) {
   const o = /* @__PURE__ */ new Map();
   e.content.content?.forEach((i) => {
     i.attrs?.contentId && o.set(i.attrs.contentId, [...o.get(i.attrs.contentId) || [], i]);
   });
-  const s = new Set(n?.content.content?.map((i) => i.attrs?.contentId).filter(Boolean)), c = (i, a) => a && (o.has(i) || s.has(i)) ? de(a, o.get(i) || []) : a;
+  const s = new Set(n?.content.content?.map((i) => i.attrs?.contentId).filter(Boolean)), c = (i, a) => a && (o.has(i) || s.has(i)) ? he(a, o.get(i) || []) : a;
   return {
     ...t,
     ...o.has(r) ? { material: Z(o.get(r).map((i) => ct(i))) } : {},
     questions: t.questions.map((i) => ({ ...i, text: c(i.id, i.text), parts: i.parts.map((a) => ({ ...a, text: c(a.id, a.text) })) }))
   };
 }
-function pe(t) {
+function ge(t) {
   const e = t.reference, r = [];
   e.type === "MIXED" && r.push(...(e.material || j()).content.content.map((o) => ({ ...o, attrs: { ...o.attrs, contentId: t.id } }))), e.questions.forEach((o) => {
-    o.text && r.push(...Ot(o.text, o.id, o.label)), ue(o.type) && o.parts.forEach((s) => {
-      s.text && r.push(...Ot(s.text, s.id, s.label));
+    o.text && r.push(...Nt(o.text, o.id, o.label)), fe(o.type) && o.parts.forEach((s) => {
+      s.text && r.push(...Nt(s.text, s.id, s.label));
     });
   });
   const n = (t.document.content.content || []).filter((o) => !o.attrs?.contentId);
   return J(Z(n)) || r.push(...n), Z(r);
 }
-function ge(t, e) {
+function me(t, e) {
   const r = (n, o, s) => !n || !s || o.options.map((c) => c.id).join() === s.options.map((c) => c.id).join() ? n : { ...n, itemsContent: o.options.map((c) => ({ ...n.itemsContent.find((i) => i.id === c.id), id: c.id, key: c.label, content: n.itemsContent.find((i) => i.id === c.id)?.content || j() })) };
   return { ...t, questions: t.questions.map((n) => {
     const o = e.questions.find((s) => s.id === n.id);
     return { ...n, text: r(n.text, n.choice, o?.choice), parts: n.parts.map((s) => ({ ...s, text: r(s.text, s.choice, o?.parts.find((c) => c.id === s.id)?.choice) })) };
   }) };
 }
-function un(t, e, r) {
+function fn(t, e, r) {
   if (t.reference?.textVersion !== 1) return t;
   let n = t.reference;
   if (!e && !J(t.document) && !t.document.content.content?.some((s) => s.attrs?.contentId)) return { ...t, reference: { ...n, textVersion: void 0 } };
   if (e?.reference === n && e.document === t.document && !J(t.document)) return t;
-  if (t.document !== e?.document && (!J(t.document) || e) && (n = he(n, t.document, t.id, e?.document), e && t.reference === e.reference))
+  if (t.document !== e?.document && (!J(t.document) || e) && (n = pe(n, t.document, t.id, e?.document), e && t.reference === e.reference))
     return { ...t, reference: n };
-  e?.reference && t.reference !== e.reference && (n = ge(n, e.reference));
+  e?.reference && t.reference !== e.reference && (n = me(n, e.reference));
   const o = { ...t, reference: n };
-  return r || !J(t.document) ? { ...o, document: pe(o) } : o;
+  return r || !J(t.document) ? { ...o, document: ge(o) } : o;
 }
 const lt = {
   SCHOICE: { count: 200, options: [2, 12], parts: 1, score: 15 },
@@ -612,15 +615,15 @@ const lt = {
   TEXT_COMPLETION: { count: 20, options: [0, 0], parts: 20, score: 15 },
   CCOMPOSITION: { count: 1, options: [0, 0], parts: 1, score: 70 },
   ECOMPOSITION: { count: 1, options: [0, 0], parts: 1, score: 70 }
-}, Y = (t) => ["SCHOICE", "MCHOICE", "JUDGE", "CHUNK_CHOICE", "CLOZE", "READTHENANSWER", "INFO_MATCHING"].includes(t), R = (t) => ["CLOZE", "READTHENANSWER", "INFO_MATCHING", "TEXT_COMPLETION"].includes(t), fn = (t) => t === "FILLBLANK" || t === "TEXT_COMPLETION", Rt = (t) => t === "CCOMPOSITION" || t === "ECOMPOSITION", me = { SCHOICE: "choice", MCHOICE: "choice", JUDGE: "judge", FILLBLANK: "fill", SHORTANSWER: "answer", MIXED: "composite", CLOZE: "cloze", READTHENANSWER: "reading", INFO_MATCHING: "matching", TEXT_COMPLETION: "completion", ECOMPOSITION: "english", CCOMPOSITION: "writing", CHUNK_CHOICE: "chunk" };
-function Ce(t) {
-  return { type: t, textVersion: 1, questions: [], layout: qt(0), fillNewLine: !1, optional: !1, choose: 1, optionalHeight: 200, scoreType: "LESS_SCORE" };
+}, Y = (t) => ["SCHOICE", "MCHOICE", "JUDGE", "CHUNK_CHOICE", "CLOZE", "READTHENANSWER", "INFO_MATCHING"].includes(t), R = (t) => ["CLOZE", "READTHENANSWER", "INFO_MATCHING", "TEXT_COMPLETION"].includes(t), dn = (t) => t === "FILLBLANK" || t === "TEXT_COMPLETION", Ht = (t) => t === "CCOMPOSITION" || t === "ECOMPOSITION", Ce = { SCHOICE: "choice", MCHOICE: "choice", JUDGE: "judge", FILLBLANK: "fill", SHORTANSWER: "answer", MIXED: "composite", CLOZE: "cloze", READTHENANSWER: "reading", INFO_MATCHING: "matching", TEXT_COMPLETION: "completion", ECOMPOSITION: "english", CCOMPOSITION: "writing", CHUNK_CHOICE: "chunk" };
+function Ie(t) {
+  return { type: t, textVersion: 1, questions: [], layout: te(0), fillNewLine: !1, optional: !1, choose: 1, optionalHeight: 200, scoreType: "LESS_SCORE" };
 }
-function dn(t) {
-  return { id: crypto.randomUUID(), kind: me[t], title: It[t], answerHeight: 0, document: j(), reference: Ce(t) };
+function hn(t) {
+  return { id: crypto.randomUUID(), kind: Ce[t], title: yt[t], answerHeight: 0, document: j(), reference: Ie(t) };
 }
-function hn(t, e = 1, r) {
-  const n = t === "MCHOICE" && ht(r);
+function pn(t, e = 1, r) {
+  const n = t === "MCHOICE" && pt(r);
   return {
     type: t,
     start: e,
@@ -636,12 +639,12 @@ function hn(t, e = 1, r) {
     singleScore: 1
   };
 }
-function Ht(t, e, r) {
+function Bt(t, e, r) {
   const n = Array.from({ length: r }, (o, s) => ({ ...t.options[s] || { id: crypto.randomUUID() }, label: e === "JUDGE" ? ["T", "F"][s] : String.fromCharCode(65 + s) }));
   return { ...t, options: n, multiple: e === "MCHOICE" || e === "CHUNK_CHOICE", indefinite: !1, correctIds: t.correctIds.filter((o) => n.some((s) => s.id === o)).slice(0, e === "MCHOICE" || e === "CHUNK_CHOICE" ? r : 1) };
 }
-function Ie(t, e, r, n = 4) {
-  const o = crypto.randomUUID(), s = { ...Ht(at(0), r, n), id: o, label: t, score: e };
+function ye(t, e, r, n = 4) {
+  const o = crypto.randomUUID(), s = { ...Bt(at(0), r, n), id: o, label: t, score: e };
   return {
     id: o,
     label: t,
@@ -649,22 +652,22 @@ function Ie(t, e, r, n = 4) {
     width: 25,
     breakAfter: !1,
     height: 100,
-    document: r === "SHORTANSWER" ? pt(t, e) : j(),
+    document: r === "SHORTANSWER" ? gt(t, e) : j(),
     choice: s,
-    ...R(r) && r !== "TEXT_COMPLETION" ? { text: Pt(r, s) } : {}
+    ...R(r) && r !== "TEXT_COMPLETION" ? { text: Rt(r, s) } : {}
   };
 }
-function ye(t, e) {
-  const r = crypto.randomUUID(), { type: n, score: o } = t, s = String(e), c = t.partCount || 1, i = Array.from({ length: R(n) || ["FILLBLANK", "SHORTANSWER"].includes(n) ? c : 0 }, (y, T) => Ie(R(n) ? String(e + T) : c === 1 ? s : `${s}.${T + 1}`, o, n, t.optionCount || 4)), a = { ...Ht(at(0), n, t.optionCount || 4), id: r, label: s, score: o, scoreType: t.scoreType, lessScore: t.lessScore };
+function be(t, e) {
+  const r = crypto.randomUUID(), { type: n, score: o } = t, s = String(e), c = t.partCount || 1, i = Array.from({ length: R(n) || ["FILLBLANK", "SHORTANSWER"].includes(n) ? c : 0 }, (y, b) => ye(R(n) ? String(e + b) : c === 1 ? s : `${s}.${b + 1}`, o, n, t.optionCount || 4)), a = { ...Bt(at(0), n, t.optionCount || 4), id: r, label: s, score: o, scoreType: t.scoreType, lessScore: t.lessScore };
   return {
     id: r,
     type: n,
     label: s,
-    score: i.length ? Bt(i) : o,
+    score: i.length ? jt(i) : o,
     choice: a,
-    text: Pt(n, a, R(n)),
+    text: Rt(n, a, R(n)),
     parts: i,
-    document: n === "ECOMPOSITION" ? { version: 1, content: { type: "doc", content: [...pt(s, o).content.content, ...be(t.lines, t.paperWidth || 600).content.content] } } : n === "CCOMPOSITION" ? pt(s, o) : j(),
+    document: n === "ECOMPOSITION" ? { version: 1, content: { type: "doc", content: [...gt(s, o).content.content, ...Ee(t.lines, t.paperWidth || 600).content.content] } } : n === "CCOMPOSITION" ? gt(s, o) : j(),
     height: n === "ECOMPOSITION" ? 50 * t.lines + 40 : 100,
     contentHeight: 38,
     characters: t.characters,
@@ -674,19 +677,19 @@ function ye(t, e) {
     singleScore: t.singleScore
   };
 }
-const Bt = (t) => t.some((e) => e.score === null) ? null : t.reduce((e, r) => e + (r.score || 0), 0);
-function yt(t) {
+const jt = (t) => t.some((e) => e.score === null) ? null : t.reduce((e, r) => e + (r.score || 0), 0);
+function bt(t) {
   return t.questions.flatMap((e) => R(e.type) ? e.parts.map((r) => r.label) : [e.label]);
 }
-function pn(t) {
-  return Math.max(0, ...yt(t).map(Number).filter(Number.isFinite)) + 1;
+function gn(t) {
+  return Math.max(0, ...bt(t).map(Number).filter(Number.isFinite)) + 1;
 }
-function gn(t, e, r = !1, n = !1) {
-  const o = lt[e.type], s = Rt(e.type) ? 1 : e.end - e.start + 1;
+function mn(t, e, r = !1, n = !1) {
+  const o = lt[e.type], s = Ht(e.type) ? 1 : e.end - e.start + 1;
   if (!Number.isInteger(e.start) || e.start < 1 || e.end > 1e3 || !Number.isInteger(s) || s < 1 || s > o.count) return `题号须为 1–1000，单次题数为 1–${o.count}`;
   if (t.type === "CCOMPOSITION" && t.questions.length) return "语文作文每组只能有一道题";
   if (t.optional) return "选做题组不能追加题目";
-  const c = yt(t);
+  const c = bt(t);
   if (Array.from({ length: s }, (i, a) => String(e.start + a)).some((i) => c.includes(i))) return "同一分组内，题号不能重复";
   if (Y(e.type) && (e.optionCount === null || !Number.isInteger(e.optionCount) || e.optionCount < o.options[0] || e.optionCount > o.options[1])) return `选项个数须为 ${o.options[0]}–${o.options[1]}`;
   if ((R(e.type) || ["FILLBLANK", "SHORTANSWER"].includes(e.type)) && (!e.partCount || !Number.isInteger(e.partCount) || e.partCount < 1 || e.partCount > o.parts)) return `子题／空数须为 1–${o.parts}`;
@@ -701,40 +704,40 @@ function gn(t, e, r = !1, n = !1) {
   }
   return e.type === "CCOMPOSITION" && (!Number.isInteger(e.characters) || e.characters < 1 || e.characters > 1200) ? "作文格数须为 1–1200" : e.type === "ECOMPOSITION" && (!Number.isInteger(e.lines) || e.lines < 1 || e.lines > 100) ? "作文行数须为 1–100" : e.score === null ? "请输入分值" : null;
 }
-function mn(t, e, r) {
+function Cn(t, e, r) {
   const n = R(e.type) ? e.partCount : 1, o = [];
-  for (let i = e.start; i <= (Rt(e.type) ? e.start : e.end); i += n) o.push(ye(e, i));
+  for (let i = e.start; i <= (Ht(e.type) ? e.start : e.end); i += n) o.push(be(e, i));
   const s = [...t.questions], c = s.findIndex((i) => i.id === r || i.parts.some((a) => a.id === r));
   return s.splice(c < 0 ? s.length : c + 1, 0, ...o), { ...t, questions: s };
 }
-function Cn(t) {
+function In(t) {
   return t.questions.flatMap((e) => [e, ...e.parts]);
 }
-function In(t) {
+function yn(t) {
   return t.questions.filter((e) => Y(e.type)).flatMap((e) => R(e.type) ? e.parts.map((r) => ({ ...r.choice, label: r.label, score: r.score })) : [{ ...e.choice, label: e.label, score: e.score }]);
 }
-function yn(t, e) {
-  const r = kt(t);
+function bn(t, e) {
+  const r = Pt(t);
   return r.referenceData && (r.referenceData = { ...r.referenceData, questionId: r.id }), r.text && (r.text.groupId = `options:${r.id}`), r.label = String(e), r.choice.label = r.label, r.choice.contentTarget = null, r.choice.breakBefore = !1, r.parts.forEach((n, o) => {
     n.label = R(r.type) ? String(e + o) : r.parts.length === 1 ? r.label : `${e}.${o + 1}`, n.choice.label = n.label, n.choice.contentTarget = null, n.choice.breakBefore = !1;
   }), r.parts.forEach((n) => {
     n.text && (n.text.groupId = `options:${n.id}`), n.referenceData && (n.referenceData = { ...n.referenceData, questionId: n.id, questionPid: r.id });
   }), r.document = st(r.document, r.label, r.score), r.parts = r.parts.map((n) => ({ ...n, document: st(n.document, n.label, n.score) })), r;
 }
-function bn(t) {
+function En(t) {
   return Math.max(1, Math.floor((t - 6) / 31));
 }
-function be(t, e) {
+function Ee(t, e) {
   return { version: 1, content: { type: "doc", content: Array.from({ length: t }, () => ({ type: "paragraph", attrs: { fixedLineHeight: 1152 / 25.4 }, content: [{ type: "text", text: " ".repeat(Math.max(1, Math.floor((e - 24) / 3))), marks: [{ type: "underline" }, { type: "textStyle", attrs: { fontFamily: "Times New Roman, serif", fontSize: "12px" } }] }] })) } };
 }
-function En(t, e, r = !1) {
+function wn(t, e, r = !1) {
   const n = t.questions.reduce((s, c) => s + (c.parts.length || 1), 0), o = e / n;
   return !n || !Number.isFinite(o) || o < (r ? 0 : 0.5) || !Number.isInteger(o * 2) || t.questions.some((s) => o > lt[s.type].score || o !== 0 && s.type === "CHUNK_CHOICE" && (s.rightAnswers || 0) * (s.singleScore || 0) > o) ? null : { ...t, questions: t.questions.map((s) => ({ ...s, score: o * (s.parts.length || 1), document: st(s.document, s.label, o * (s.parts.length || 1)), choice: { ...s.choice, score: o, lessScore: Math.min(s.choice.lessScore || 0, o) }, parts: s.parts.map((c) => ({ ...c, score: o, document: st(c.document, c.label, o), choice: { ...c.choice, score: o } })) })) };
 }
-function wn(t, e) {
+function Tn(t, e) {
   return [...t <= 17 ? Array.from({ length: 18 }, (r, n) => 17 - n <= t ? String(17 - n) : "") : [...Array.from({ length: 7 }, (r, n) => 7 - n <= Math.floor(t / 10) ? `${7 - n}0` : ""), "", ...Array.from({ length: 10 }, (r, n) => String(9 - n))], e ? "0.5" : ""];
 }
-const Ee = ["000", "100", "110", "111", "101", "010", "011", "001"], Tn = (t) => Ee[t - 1], jt = {
+const we = ["000", "100", "110", "111", "101", "010", "011", "001"], Sn = (t) => we[t - 1], Gt = {
   CHINESE: [1],
   MATHS: [2],
   ENGLISH: [3],
@@ -750,7 +753,7 @@ const Ee = ["000", "100", "110", "111", "101", "010", "011", "001"], Tn = (t) =>
   ART: [1, 3, 4],
   SCIENCE: [2, 3, 4],
   HISTORY: [1, 2, 3, 4]
-}, we = {
+}, Te = {
   语文: "CHINESE",
   数学: "MATHS",
   英语: "ENGLISH",
@@ -770,11 +773,11 @@ const Ee = ["000", "100", "110", "111", "101", "010", "011", "001"], Tn = (t) =>
   科学: "SCIENCE",
   历史: "HISTORY"
 };
-function Te(t) {
-  return t?.subjectCode || (t?.courseCode && jt[t.courseCode] ? t.courseCode : we[t?.subject || ""]);
+function Se(t) {
+  return t?.subjectCode || (t?.courseCode && Gt[t.courseCode] ? t.courseCode : Te[t?.subject || ""]);
 }
-const nt = (t) => Math.round(t * 1e3) / 1e3, Sn = (t) => ({ x: nt(t.x), y: nt(t.y), width: nt(t.width), height: nt(t.height) });
-function An(t, e) {
+const nt = (t) => Math.round(t * 1e3) / 1e3, An = (t) => ({ x: nt(t.x), y: nt(t.y), width: nt(t.width), height: nt(t.height) });
+function On(t, e) {
   const r = Math.max(t.x, e.x), n = Math.max(t.y, e.y), o = Math.min(t.x + t.width, e.x + e.width) - r, s = Math.min(t.y + t.height, e.y + e.height) - n;
   return o > 0.01 && s > 0.01 ? { x: r, y: n, width: o, height: s } : void 0;
 }
@@ -782,27 +785,27 @@ const V = function(t, e) {
   let o = t;
   const s = X[e];
   let c = null, i = 0, a = null;
-  const y = [], T = {}, m = function(h, I) {
+  const y = [], b = {}, m = function(h, I) {
     i = o * 4 + 17, c = (function(d) {
-      const b = new Array(d);
-      for (let E = 0; E < d; E += 1) {
-        b[E] = new Array(d);
+      const E = new Array(d);
+      for (let w = 0; w < d; w += 1) {
+        E[w] = new Array(d);
         for (let S = 0; S < d; S += 1)
-          b[E][S] = null;
+          E[w][S] = null;
       }
-      return b;
+      return E;
     })(i), f(0, 0), f(i - 7, 0), f(0, i - 7), u(), l(), A(h, I), o >= 7 && g(h), a == null && (a = M(o, s, y)), C(a, I);
   }, f = function(h, I) {
     for (let d = -1; d <= 7; d += 1)
       if (!(h + d <= -1 || i <= h + d))
-        for (let b = -1; b <= 7; b += 1)
-          I + b <= -1 || i <= I + b || (0 <= d && d <= 6 && (b == 0 || b == 6) || 0 <= b && b <= 6 && (d == 0 || d == 6) || 2 <= d && d <= 4 && 2 <= b && b <= 4 ? c[h + d][I + b] = !0 : c[h + d][I + b] = !1);
+        for (let E = -1; E <= 7; E += 1)
+          I + E <= -1 || i <= I + E || (0 <= d && d <= 6 && (E == 0 || E == 6) || 0 <= E && E <= 6 && (d == 0 || d == 6) || 2 <= d && d <= 4 && 2 <= E && E <= 4 ? c[h + d][I + E] = !0 : c[h + d][I + E] = !1);
   }, p = function() {
     let h = 0, I = 0;
     for (let d = 0; d < 8; d += 1) {
       m(!0, d);
-      const b = F.getLostPoint(T);
-      (d == 0 || h > b) && (h = b, I = d);
+      const E = F.getLostPoint(b);
+      (d == 0 || h > E) && (h = E, I = d);
     }
     return I;
   }, l = function() {
@@ -814,62 +817,62 @@ const V = function(t, e) {
     const h = F.getPatternPosition(o);
     for (let I = 0; I < h.length; I += 1)
       for (let d = 0; d < h.length; d += 1) {
-        const b = h[I], E = h[d];
-        if (c[b][E] == null)
+        const E = h[I], w = h[d];
+        if (c[E][w] == null)
           for (let S = -2; S <= 2; S += 1)
             for (let N = -2; N <= 2; N += 1)
-              S == -2 || S == 2 || N == -2 || N == 2 || S == 0 && N == 0 ? c[b + S][E + N] = !0 : c[b + S][E + N] = !1;
+              S == -2 || S == 2 || N == -2 || N == 2 || S == 0 && N == 0 ? c[E + S][w + N] = !0 : c[E + S][w + N] = !1;
       }
   }, g = function(h) {
     const I = F.getBCHTypeNumber(o);
     for (let d = 0; d < 18; d += 1) {
-      const b = !h && (I >> d & 1) == 1;
-      c[Math.floor(d / 3)][d % 3 + i - 8 - 3] = b;
+      const E = !h && (I >> d & 1) == 1;
+      c[Math.floor(d / 3)][d % 3 + i - 8 - 3] = E;
     }
     for (let d = 0; d < 18; d += 1) {
-      const b = !h && (I >> d & 1) == 1;
-      c[d % 3 + i - 8 - 3][Math.floor(d / 3)] = b;
+      const E = !h && (I >> d & 1) == 1;
+      c[d % 3 + i - 8 - 3][Math.floor(d / 3)] = E;
     }
   }, A = function(h, I) {
-    const d = s << 3 | I, b = F.getBCHTypeInfo(d);
-    for (let E = 0; E < 15; E += 1) {
-      const S = !h && (b >> E & 1) == 1;
-      E < 6 ? c[E][8] = S : E < 8 ? c[E + 1][8] = S : c[i - 15 + E][8] = S;
+    const d = s << 3 | I, E = F.getBCHTypeInfo(d);
+    for (let w = 0; w < 15; w += 1) {
+      const S = !h && (E >> w & 1) == 1;
+      w < 6 ? c[w][8] = S : w < 8 ? c[w + 1][8] = S : c[i - 15 + w][8] = S;
     }
-    for (let E = 0; E < 15; E += 1) {
-      const S = !h && (b >> E & 1) == 1;
-      E < 8 ? c[8][i - E - 1] = S : E < 9 ? c[8][15 - E - 1 + 1] = S : c[8][15 - E - 1] = S;
+    for (let w = 0; w < 15; w += 1) {
+      const S = !h && (E >> w & 1) == 1;
+      w < 8 ? c[8][i - w - 1] = S : w < 9 ? c[8][15 - w - 1 + 1] = S : c[8][15 - w - 1] = S;
     }
     c[i - 8][8] = !h;
   }, C = function(h, I) {
-    let d = -1, b = i - 1, E = 7, S = 0;
+    let d = -1, E = i - 1, w = 7, S = 0;
     const N = F.getMaskFunction(I);
     for (let L = i - 1; L > 0; L -= 2)
       for (L == 6 && (L -= 1); ; ) {
         for (let _ = 0; _ < 2; _ += 1)
-          if (c[b][L - _] == null) {
+          if (c[E][L - _] == null) {
             let k = !1;
-            S < h.length && (k = (h[S] >>> E & 1) == 1), N(b, L - _) && (k = !k), c[b][L - _] = k, E -= 1, E == -1 && (S += 1, E = 7);
+            S < h.length && (k = (h[S] >>> w & 1) == 1), N(E, L - _) && (k = !k), c[E][L - _] = k, w -= 1, w == -1 && (S += 1, w = 7);
           }
-        if (b += d, b < 0 || i <= b) {
-          b -= d, d = -d;
+        if (E += d, E < 0 || i <= E) {
+          E -= d, d = -d;
           break;
         }
       }
   }, x = function(h, I) {
-    let d = 0, b = 0, E = 0;
+    let d = 0, E = 0, w = 0;
     const S = new Array(I.length), N = new Array(I.length);
     for (let $ = 0; $ < I.length; $ += 1) {
       const D = I[$].dataCount, H = I[$].totalCount - D;
-      b = Math.max(b, D), E = Math.max(E, H), S[$] = new Array(D);
+      E = Math.max(E, D), w = Math.max(w, H), S[$] = new Array(D);
       for (let G = 0; G < S[$].length; G += 1)
         S[$][G] = 255 & h.getBuffer()[G + d];
       d += D;
-      const ft = F.getErrorCorrectPolynomial(H), bt = q(S[$], ft.getLength() - 1).mod(ft);
+      const ft = F.getErrorCorrectPolynomial(H), Et = q(S[$], ft.getLength() - 1).mod(ft);
       N[$] = new Array(ft.getLength() - 1);
       for (let G = 0; G < N[$].length; G += 1) {
-        const Et = G + bt.getLength() - N[$].length;
-        N[$][G] = Et >= 0 ? bt.getAt(Et) : 0;
+        const wt = G + Et.getLength() - N[$].length;
+        N[$][G] = wt >= 0 ? Et.getAt(wt) : 0;
       }
     }
     let L = 0;
@@ -877,115 +880,115 @@ const V = function(t, e) {
       L += I[$].totalCount;
     const _ = new Array(L);
     let k = 0;
-    for (let $ = 0; $ < b; $ += 1)
+    for (let $ = 0; $ < E; $ += 1)
       for (let D = 0; D < I.length; D += 1)
         $ < S[D].length && (_[k] = S[D][$], k += 1);
-    for (let $ = 0; $ < E; $ += 1)
+    for (let $ = 0; $ < w; $ += 1)
       for (let D = 0; D < I.length; D += 1)
         $ < N[D].length && (_[k] = N[D][$], k += 1);
     return _;
   }, M = function(h, I, d) {
-    const b = Nt.getRSBlocks(h, I), E = Mt();
+    const E = Mt.getRSBlocks(h, I), w = xt();
     for (let N = 0; N < d.length; N += 1) {
       const L = d[N];
-      E.put(L.getMode(), 4), E.put(L.getLength(), F.getLengthInBits(L.getMode(), h)), L.write(E);
+      w.put(L.getMode(), 4), w.put(L.getLength(), F.getLengthInBits(L.getMode(), h)), L.write(w);
     }
     let S = 0;
-    for (let N = 0; N < b.length; N += 1)
-      S += b[N].dataCount;
-    if (E.getLengthInBits() > S * 8)
-      throw "code length overflow. (" + E.getLengthInBits() + ">" + S * 8 + ")";
-    for (E.getLengthInBits() + 4 <= S * 8 && E.put(0, 4); E.getLengthInBits() % 8 != 0; )
-      E.putBit(!1);
-    for (; !(E.getLengthInBits() >= S * 8 || (E.put(236, 8), E.getLengthInBits() >= S * 8)); )
-      E.put(17, 8);
-    return x(E, b);
+    for (let N = 0; N < E.length; N += 1)
+      S += E[N].dataCount;
+    if (w.getLengthInBits() > S * 8)
+      throw "code length overflow. (" + w.getLengthInBits() + ">" + S * 8 + ")";
+    for (w.getLengthInBits() + 4 <= S * 8 && w.put(0, 4); w.getLengthInBits() % 8 != 0; )
+      w.putBit(!1);
+    for (; !(w.getLengthInBits() >= S * 8 || (w.put(236, 8), w.getLengthInBits() >= S * 8)); )
+      w.put(17, 8);
+    return x(w, E);
   };
-  T.addData = function(h, I) {
+  b.addData = function(h, I) {
     I = I || "Byte";
     let d = null;
     switch (I) {
       case "Numeric":
-        d = Se(h);
+        d = Ae(h);
         break;
       case "Alphanumeric":
-        d = Ae(h);
+        d = Oe(h);
         break;
       case "Byte":
-        d = Oe(h);
+        d = Ne(h);
         break;
       case "Kanji":
-        d = Ne(h);
+        d = Me(h);
         break;
       default:
         throw "mode:" + I;
     }
     y.push(d), a = null;
-  }, T.isDark = function(h, I) {
+  }, b.isDark = function(h, I) {
     if (h < 0 || i <= h || I < 0 || i <= I)
       throw h + "," + I;
     return c[h][I];
-  }, T.getModuleCount = function() {
+  }, b.getModuleCount = function() {
     return i;
-  }, T.make = function() {
+  }, b.make = function() {
     if (o < 1) {
       let h = 1;
       for (; h < 40; h++) {
-        const I = Nt.getRSBlocks(h, s), d = Mt();
-        for (let E = 0; E < y.length; E++) {
-          const S = y[E];
+        const I = Mt.getRSBlocks(h, s), d = xt();
+        for (let w = 0; w < y.length; w++) {
+          const S = y[w];
           d.put(S.getMode(), 4), d.put(S.getLength(), F.getLengthInBits(S.getMode(), h)), S.write(d);
         }
-        let b = 0;
-        for (let E = 0; E < I.length; E++)
-          b += I[E].dataCount;
-        if (d.getLengthInBits() <= b * 8)
+        let E = 0;
+        for (let w = 0; w < I.length; w++)
+          E += I[w].dataCount;
+        if (d.getLengthInBits() <= E * 8)
           break;
       }
       o = h;
     }
     m(!1, p());
-  }, T.createTableTag = function(h, I) {
+  }, b.createTableTag = function(h, I) {
     h = h || 2, I = typeof I > "u" ? h * 4 : I;
     let d = "";
     d += '<table style="', d += " border-width: 0px; border-style: none;", d += " border-collapse: collapse;", d += " padding: 0px; margin: " + I + "px;", d += '">', d += "<tbody>";
-    for (let b = 0; b < T.getModuleCount(); b += 1) {
+    for (let E = 0; E < b.getModuleCount(); E += 1) {
       d += "<tr>";
-      for (let E = 0; E < T.getModuleCount(); E += 1)
-        d += '<td style="', d += " border-width: 0px; border-style: none;", d += " border-collapse: collapse;", d += " padding: 0px; margin: 0px;", d += " width: " + h + "px;", d += " height: " + h + "px;", d += " background-color: ", d += T.isDark(b, E) ? "#000000" : "#ffffff", d += ";", d += '"/>';
+      for (let w = 0; w < b.getModuleCount(); w += 1)
+        d += '<td style="', d += " border-width: 0px; border-style: none;", d += " border-collapse: collapse;", d += " padding: 0px; margin: 0px;", d += " width: " + h + "px;", d += " height: " + h + "px;", d += " background-color: ", d += b.isDark(E, w) ? "#000000" : "#ffffff", d += ";", d += '"/>';
       d += "</tr>";
     }
     return d += "</tbody>", d += "</table>", d;
-  }, T.createSvgTag = function(h, I, d, b) {
-    let E = {};
-    typeof arguments[0] == "object" && (E = arguments[0], h = E.cellSize, I = E.margin, d = E.alt, b = E.title), h = h || 2, I = typeof I > "u" ? h * 4 : I, d = typeof d == "string" ? { text: d } : d || {}, d.text = d.text || null, d.id = d.text ? d.id || "qrcode-description" : null, b = typeof b == "string" ? { text: b } : b || {}, b.text = b.text || null, b.id = b.text ? b.id || "qrcode-title" : null;
-    const S = T.getModuleCount() * h + I * 2;
+  }, b.createSvgTag = function(h, I, d, E) {
+    let w = {};
+    typeof arguments[0] == "object" && (w = arguments[0], h = w.cellSize, I = w.margin, d = w.alt, E = w.title), h = h || 2, I = typeof I > "u" ? h * 4 : I, d = typeof d == "string" ? { text: d } : d || {}, d.text = d.text || null, d.id = d.text ? d.id || "qrcode-description" : null, E = typeof E == "string" ? { text: E } : E || {}, E.text = E.text || null, E.id = E.text ? E.id || "qrcode-title" : null;
+    const S = b.getModuleCount() * h + I * 2;
     let N, L, _, k, $ = "", D;
-    for (D = "l" + h + ",0 0," + h + " -" + h + ",0 0,-" + h + "z ", $ += '<svg version="1.1" xmlns="http://www.w3.org/2000/svg"', $ += E.scalable ? "" : ' width="' + S + 'px" height="' + S + 'px"', $ += ' viewBox="0 0 ' + S + " " + S + '" ', $ += ' preserveAspectRatio="xMinYMin meet"', $ += b.text || d.text ? ' role="img" aria-labelledby="' + w([b.id, d.id].join(" ").trim()) + '"' : "", $ += ">", $ += b.text ? '<title id="' + w(b.id) + '">' + w(b.text) + "</title>" : "", $ += d.text ? '<description id="' + w(d.id) + '">' + w(d.text) + "</description>" : "", $ += '<rect width="100%" height="100%" fill="white" cx="0" cy="0"/>', $ += '<path d="', _ = 0; _ < T.getModuleCount(); _ += 1)
-      for (k = _ * h + I, N = 0; N < T.getModuleCount(); N += 1)
-        T.isDark(_, N) && (L = N * h + I, $ += "M" + L + "," + k + D);
+    for (D = "l" + h + ",0 0," + h + " -" + h + ",0 0,-" + h + "z ", $ += '<svg version="1.1" xmlns="http://www.w3.org/2000/svg"', $ += w.scalable ? "" : ' width="' + S + 'px" height="' + S + 'px"', $ += ' viewBox="0 0 ' + S + " " + S + '" ', $ += ' preserveAspectRatio="xMinYMin meet"', $ += E.text || d.text ? ' role="img" aria-labelledby="' + T([E.id, d.id].join(" ").trim()) + '"' : "", $ += ">", $ += E.text ? '<title id="' + T(E.id) + '">' + T(E.text) + "</title>" : "", $ += d.text ? '<description id="' + T(d.id) + '">' + T(d.text) + "</description>" : "", $ += '<rect width="100%" height="100%" fill="white" cx="0" cy="0"/>', $ += '<path d="', _ = 0; _ < b.getModuleCount(); _ += 1)
+      for (k = _ * h + I, N = 0; N < b.getModuleCount(); N += 1)
+        b.isDark(_, N) && (L = N * h + I, $ += "M" + L + "," + k + D);
     return $ += '" stroke="transparent" fill="black"/>', $ += "</svg>", $;
-  }, T.createDataURL = function(h, I) {
+  }, b.createDataURL = function(h, I) {
     h = h || 2, I = typeof I > "u" ? h * 4 : I;
-    const d = T.getModuleCount() * h + I * 2, b = I, E = d - I;
-    return Le(d, d, function(S, N) {
-      if (b <= S && S < E && b <= N && N < E) {
-        const L = Math.floor((S - b) / h), _ = Math.floor((N - b) / h);
-        return T.isDark(_, L) ? 0 : 1;
+    const d = b.getModuleCount() * h + I * 2, E = I, w = d - I;
+    return _e(d, d, function(S, N) {
+      if (E <= S && S < w && E <= N && N < w) {
+        const L = Math.floor((S - E) / h), _ = Math.floor((N - E) / h);
+        return b.isDark(_, L) ? 0 : 1;
       } else
         return 1;
     });
-  }, T.createImgTag = function(h, I, d) {
+  }, b.createImgTag = function(h, I, d) {
     h = h || 2, I = typeof I > "u" ? h * 4 : I;
-    const b = T.getModuleCount() * h + I * 2;
-    let E = "";
-    return E += "<img", E += ' src="', E += T.createDataURL(h, I), E += '"', E += ' width="', E += b, E += '"', E += ' height="', E += b, E += '"', d && (E += ' alt="', E += w(d), E += '"'), E += "/>", E;
+    const E = b.getModuleCount() * h + I * 2;
+    let w = "";
+    return w += "<img", w += ' src="', w += b.createDataURL(h, I), w += '"', w += ' width="', w += E, w += '"', w += ' height="', w += E, w += '"', d && (w += ' alt="', w += T(d), w += '"'), w += "/>", w;
   };
-  const w = function(h) {
+  const T = function(h) {
     let I = "";
     for (let d = 0; d < h.length; d += 1) {
-      const b = h.charAt(d);
-      switch (b) {
+      const E = h.charAt(d);
+      switch (E) {
         case "<":
           I += "&lt;";
           break;
@@ -999,14 +1002,14 @@ const V = function(t, e) {
           I += "&quot;";
           break;
         default:
-          I += b;
+          I += E;
           break;
       }
     }
     return I;
   }, O = function(h) {
     h = typeof h > "u" ? 2 : h;
-    const d = T.getModuleCount() * 1 + h * 2, b = h, E = d - h;
+    const d = b.getModuleCount() * 1 + h * 2, E = h, w = d - h;
     let S, N, L, _, k;
     const $ = {
       "██": "█",
@@ -1021,36 +1024,36 @@ const V = function(t, e) {
     };
     let H = "";
     for (S = 0; S < d; S += 2) {
-      for (L = Math.floor((S - b) / 1), _ = Math.floor((S + 1 - b) / 1), N = 0; N < d; N += 1)
-        k = "█", b <= N && N < E && b <= S && S < E && T.isDark(L, Math.floor((N - b) / 1)) && (k = " "), b <= N && N < E && b <= S + 1 && S + 1 < E && T.isDark(_, Math.floor((N - b) / 1)) ? k += " " : k += "█", H += h < 1 && S + 1 >= E ? D[k] : $[k];
+      for (L = Math.floor((S - E) / 1), _ = Math.floor((S + 1 - E) / 1), N = 0; N < d; N += 1)
+        k = "█", E <= N && N < w && E <= S && S < w && b.isDark(L, Math.floor((N - E) / 1)) && (k = " "), E <= N && N < w && E <= S + 1 && S + 1 < w && b.isDark(_, Math.floor((N - E) / 1)) ? k += " " : k += "█", H += h < 1 && S + 1 >= w ? D[k] : $[k];
       H += `
 `;
     }
     return d % 2 && h > 0 ? H.substring(0, H.length - d - 1) + Array(d + 1).join("▀") : H.substring(0, H.length - 1);
   };
-  return T.createASCII = function(h, I) {
+  return b.createASCII = function(h, I) {
     if (h = h || 1, h < 2)
       return O(I);
     h -= 1, I = typeof I > "u" ? h * 2 : I;
-    const d = T.getModuleCount() * h + I * 2, b = I, E = d - I;
+    const d = b.getModuleCount() * h + I * 2, E = I, w = d - I;
     let S, N, L, _;
     const k = Array(h + 1).join("██"), $ = Array(h + 1).join("  ");
     let D = "", H = "";
     for (S = 0; S < d; S += 1) {
-      for (L = Math.floor((S - b) / h), H = "", N = 0; N < d; N += 1)
-        _ = 1, b <= N && N < E && b <= S && S < E && T.isDark(L, Math.floor((N - b) / h)) && (_ = 0), H += _ ? k : $;
+      for (L = Math.floor((S - E) / h), H = "", N = 0; N < d; N += 1)
+        _ = 1, E <= N && N < w && E <= S && S < w && b.isDark(L, Math.floor((N - E) / h)) && (_ = 0), H += _ ? k : $;
       for (L = 0; L < h; L += 1)
         D += H + `
 `;
     }
     return D.substring(0, D.length - 1);
-  }, T.renderTo2dContext = function(h, I) {
+  }, b.renderTo2dContext = function(h, I) {
     I = I || 2;
-    const d = T.getModuleCount();
-    for (let b = 0; b < d; b++)
-      for (let E = 0; E < d; E++)
-        h.fillStyle = T.isDark(b, E) ? "black" : "white", h.fillRect(E * I, b * I, I, I);
-  }, T;
+    const d = b.getModuleCount();
+    for (let E = 0; E < d; E++)
+      for (let w = 0; w < d; w++)
+        h.fillStyle = b.isDark(E, w) ? "black" : "white", h.fillRect(w * I, E * I, I, I);
+  }, b;
 };
 V.stringToBytes = function(t) {
   const e = [];
@@ -1062,7 +1065,7 @@ V.stringToBytes = function(t) {
 };
 V.createStringToBytes = function(t, e) {
   const r = (function() {
-    const o = xe(t), s = function() {
+    const o = $e(t), s = function() {
       const a = o.read();
       if (a == -1) throw "eof";
       return a;
@@ -1072,7 +1075,7 @@ V.createStringToBytes = function(t, e) {
     for (; ; ) {
       const a = o.read();
       if (a == -1) break;
-      const y = s(), T = s(), m = s(), f = String.fromCharCode(a << 8 | y), p = T << 8 | m;
+      const y = s(), b = s(), m = s(), f = String.fromCharCode(a << 8 | y), p = b << 8 | m;
       i[f] = p, c += 1;
     }
     if (c != e)
@@ -1284,8 +1287,8 @@ const P = {
     for (let m = 0; m < i; m += 1)
       for (let f = 0; f < i; f += 1)
         c.isDark(f, m) && (y += 1);
-    const T = Math.abs(100 * y / i / i - 50) / 5;
-    return a += T * 10, a;
+    const b = Math.abs(100 * y / i / i - 50) / 5;
+    return a += b * 10, a;
   }, o;
 })(), K = (function() {
   const t = new Array(256), e = new Array(256);
@@ -1339,7 +1342,7 @@ const P = {
       c[i] ^= K.gexp(K.glog(o.getAt(i)) + s);
     return q(c, 0).mod(o);
   }, n;
-}, Nt = (function() {
+}, Mt = (function() {
   const t = [
     // L
     // M
@@ -1568,13 +1571,13 @@ const P = {
       throw "bad rs block @ typeNumber:" + o + "/errorCorrectionLevel:" + s;
     const i = c.length / 3, a = [];
     for (let y = 0; y < i; y += 1) {
-      const T = c[y * 3 + 0], m = c[y * 3 + 1], f = c[y * 3 + 2];
-      for (let p = 0; p < T; p += 1)
+      const b = c[y * 3 + 0], m = c[y * 3 + 1], f = c[y * 3 + 2];
+      for (let p = 0; p < b; p += 1)
         a.push(e(m, f));
     }
     return a;
   }, r;
-})(), Mt = function() {
+})(), xt = function() {
   const t = [];
   let e = 0;
   const r = {};
@@ -1592,7 +1595,7 @@ const P = {
     const o = Math.floor(e / 8);
     t.length <= o && t.push(0), n && (t[o] |= 128 >>> e % 8), e += 1;
   }, r;
-}, Se = function(t) {
+}, Ae = function(t) {
   const e = P.MODE_NUMBER, r = t, n = {};
   n.getMode = function() {
     return e;
@@ -1616,7 +1619,7 @@ const P = {
     throw "illegal char :" + c;
   };
   return n;
-}, Ae = function(t) {
+}, Oe = function(t) {
   const e = P.MODE_ALPHA_NUM, r = t, n = {};
   n.getMode = function() {
     return e;
@@ -1661,7 +1664,7 @@ const P = {
     }
   };
   return n;
-}, Oe = function(t) {
+}, Ne = function(t) {
   const e = P.MODE_8BIT_BYTE, r = V.stringToBytes(t), n = {};
   return n.getMode = function() {
     return e;
@@ -1671,7 +1674,7 @@ const P = {
     for (let s = 0; s < r.length; s += 1)
       o.put(r[s], 8);
   }, n;
-}, Ne = function(t) {
+}, Me = function(t) {
   const e = P.MODE_KANJI, r = V.stringToBytes;
   (function(s, c) {
     const i = r(s);
@@ -1699,7 +1702,7 @@ const P = {
     if (i < c.length)
       throw "illegal char at " + (i + 1);
   }, o;
-}, Gt = function() {
+}, Ut = function() {
   const t = [], e = {};
   return e.writeByte = function(r) {
     t.push(r & 255);
@@ -1721,7 +1724,7 @@ const P = {
       n > 0 && (r += ","), r += t[n];
     return r += "]", r;
   }, e;
-}, Me = function() {
+}, xe = function() {
   let t = 0, e = 0, r = 0, n = "";
   const o = {}, s = function(i) {
     n += String.fromCharCode(c(i & 63));
@@ -1752,7 +1755,7 @@ const P = {
   }, o.toString = function() {
     return n;
   }, o;
-}, xe = function(t) {
+}, $e = function(t) {
   const e = t;
   let r = 0, n = 0, o = 0;
   const s = {};
@@ -1787,41 +1790,41 @@ const P = {
     throw "c:" + i;
   };
   return s;
-}, $e = function(t, e) {
+}, Le = function(t, e) {
   const r = t, n = e, o = new Array(t * e), s = {};
-  s.setPixel = function(y, T, m) {
-    o[T * r + y] = m;
+  s.setPixel = function(y, b, m) {
+    o[b * r + y] = m;
   }, s.write = function(y) {
     y.writeString("GIF87a"), y.writeShort(r), y.writeShort(n), y.writeByte(128), y.writeByte(0), y.writeByte(0), y.writeByte(0), y.writeByte(0), y.writeByte(0), y.writeByte(255), y.writeByte(255), y.writeByte(255), y.writeString(","), y.writeShort(0), y.writeShort(0), y.writeShort(r), y.writeShort(n), y.writeByte(0);
-    const T = 2, m = i(T);
-    y.writeByte(T);
+    const b = 2, m = i(b);
+    y.writeByte(b);
     let f = 0;
     for (; m.length - f > 255; )
       y.writeByte(255), y.writeBytes(m, f, 255), f += 255;
     y.writeByte(m.length - f), y.writeBytes(m, f, m.length - f), y.writeByte(0), y.writeString(";");
   };
   const c = function(y) {
-    const T = y;
+    const b = y;
     let m = 0, f = 0;
     const p = {};
     return p.write = function(l, u) {
       if (l >>> u)
         throw "length over";
       for (; m + u >= 8; )
-        T.writeByte(255 & (l << m | f)), u -= 8 - m, l >>>= 8 - m, f = 0, m = 0;
+        b.writeByte(255 & (l << m | f)), u -= 8 - m, l >>>= 8 - m, f = 0, m = 0;
       f = l << m | f, m = m + u;
     }, p.flush = function() {
-      m > 0 && T.writeByte(f);
+      m > 0 && b.writeByte(f);
     }, p;
   }, i = function(y) {
-    const T = 1 << y, m = (1 << y) + 1;
+    const b = 1 << y, m = (1 << y) + 1;
     let f = y + 1;
     const p = a();
-    for (let C = 0; C < T; C += 1)
+    for (let C = 0; C < b; C += 1)
       p.add(String.fromCharCode(C));
-    p.add(String.fromCharCode(T)), p.add(String.fromCharCode(m));
-    const l = Gt(), u = c(l);
-    u.write(T, f);
+    p.add(String.fromCharCode(b)), p.add(String.fromCharCode(m));
+    const l = Ut(), u = c(l);
+    u.write(b, f);
     let g = 0, A = String.fromCharCode(o[g]);
     for (g += 1; g < o.length; ) {
       const C = String.fromCharCode(o[g]);
@@ -1830,14 +1833,14 @@ const P = {
     return u.write(p.indexOf(A), f), u.write(m, f), u.flush(), l.toByteArray();
   }, a = function() {
     const y = {};
-    let T = 0;
+    let b = 0;
     const m = {};
     return m.add = function(f) {
       if (m.contains(f))
         throw "dup key:" + f;
-      y[f] = T, T += 1;
+      y[f] = b, b += 1;
     }, m.size = function() {
-      return T;
+      return b;
     }, m.indexOf = function(f) {
       return y[f];
     }, m.contains = function(f) {
@@ -1845,20 +1848,20 @@ const P = {
     }, m;
   };
   return s;
-}, Le = function(t, e, r) {
-  const n = $e(t, e);
+}, _e = function(t, e, r) {
+  const n = Le(t, e);
   for (let i = 0; i < e; i += 1)
     for (let a = 0; a < t; a += 1)
       n.setPixel(a, i, r(a, i));
-  const o = Gt();
+  const o = Ut();
   n.write(o);
-  const s = Me(), c = o.toByteArray();
+  const s = xe(), c = o.toByteArray();
   for (let i = 0; i < c.length; i += 1)
     s.writeByte(c[i]);
   return s.flush(), "data:image/gif;base64," + s;
 };
 V.stringToBytes;
-function _e(t) {
+function De(t) {
   const e = V(0, "M"), r = Array.from(new TextEncoder().encode(t), (s) => String.fromCharCode(s)).join("");
   e.addData(r, /^\d+$/.test(t) ? "Numeric" : "Byte"), e.make();
   const n = e.getModuleCount();
@@ -1869,11 +1872,11 @@ function _e(t) {
 class ut extends Error {
   constructor(r) {
     super(r[0]?.message || "题卡数据无效");
-    wt(this, "issues");
+    Tt(this, "issues");
     this.name = "AnswerSheetDataError", this.issues = r;
   }
 }
-function De(t, e) {
+function ke(t, e) {
   const r = (l, u = "题卡数据结构无效") => {
     throw new ut([{ code: "INVALID_DATA", path: l, message: u }]);
   }, n = (l, u) => !l || typeof l != "object" || Array.isArray(l) ? r(u) : l, o = (l, u) => Array.isArray(l) ? l : r(u), s = (l, u) => {
@@ -1897,10 +1900,10 @@ function De(t, e) {
   }, y = (l, u) => {
     const g = n(l, u);
     (!["row", "column"].includes(String(g.direction)) || !["concentrated", "distributed", "stem", "option"].includes(String(g.presentation)) || !["box", "check", "bubble"].includes(String(g.marker))) && r(u), c(g.rowsPerColumn, `${u}.rowsPerColumn`, 1, 5), c(g.rowGap, `${u}.rowGap`, 0, 64), c(g.columnGap, `${u}.columnGap`, 0, 64), o(g.questions, `${u}.questions`).forEach((A, C) => a(A, `${u}.questions.${C}`));
-  }, T = /* @__PURE__ */ new WeakSet(), m = (l, u) => {
+  }, b = /* @__PURE__ */ new WeakSet(), m = (l, u) => {
     if (!(!l || typeof l != "object")) {
-      if (T.has(l)) return r(u, "题卡必须是无循环引用的 JSON 数据");
-      T.add(l), Object.entries(l).forEach(([g, A]) => m(A, `${u}.${g}`)), T.delete(l);
+      if (b.has(l)) return r(u, "题卡必须是无循环引用的 JSON 数据");
+      b.add(l), Object.entries(l).forEach(([g, A]) => m(A, `${u}.${g}`)), b.delete(l);
     }
   }, f = n(t, "");
   if (f.version !== 1 && r("version", "不支持的题卡数据版本"), s(f.title, "title"), f.usage !== void 0 && !["exam", "homework"].includes(String(f.usage)) && r("usage"), ["questionCard", "scanMarking", "halfPoint", "mergeObjective"].forEach((l) => {
@@ -1941,32 +1944,32 @@ function De(t, e) {
       r(`${g}.reference`, "请使用包含 reference 题目结构的制卡数据");
     }
     const C = n(A.reference, `${g}.reference`);
-    C.material !== void 0 && i(C.material, `${g}.reference.material`), C.textVersion !== void 0 && C.textVersion !== 1 && r(`${g}.reference.textVersion`), Object.hasOwn(It, String(C.type)) || r(`${g}.reference.type`), y(C.layout, `${g}.reference.layout`), c(C.optionalHeight, `${g}.reference.optionalHeight`), o(C.questions, `${g}.reference.questions`).forEach((x, M) => {
-      const w = `${g}.reference.questions.${M}`, O = n(x, w);
-      Object.hasOwn(lt, String(O.type)) || r(`${w}.type`), s(O.id, `${w}.id`), s(O.label, `${w}.label`), a(O.choice, `${w}.choice`), ["height", "contentHeight", "characters", "lines"].forEach((I) => c(O[I], `${w}.${I}`)), i(O.document, `${w}.document`);
+    C.material !== void 0 && i(C.material, `${g}.reference.material`), C.textVersion !== void 0 && C.textVersion !== 1 && r(`${g}.reference.textVersion`), Object.hasOwn(yt, String(C.type)) || r(`${g}.reference.type`), y(C.layout, `${g}.reference.layout`), c(C.optionalHeight, `${g}.reference.optionalHeight`), o(C.questions, `${g}.reference.questions`).forEach((x, M) => {
+      const T = `${g}.reference.questions.${M}`, O = n(x, T);
+      Object.hasOwn(lt, String(O.type)) || r(`${T}.type`), s(O.id, `${T}.id`), s(O.label, `${T}.label`), a(O.choice, `${T}.choice`), ["height", "contentHeight", "characters", "lines"].forEach((I) => c(O[I], `${T}.${I}`)), i(O.document, `${T}.document`);
       const h = (I, d) => {
         if (!I) return;
-        const b = n(I, d);
-        i(b.content, `${d}.content`), n(b.layout, `${d}.layout`), s(b.groupId, `${d}.groupId`), o(b.itemsContent, `${d}.itemsContent`).forEach((E, S) => {
-          const N = n(E, `${d}.itemsContent.${S}`);
+        const E = n(I, d);
+        i(E.content, `${d}.content`), n(E.layout, `${d}.layout`), s(E.groupId, `${d}.groupId`), o(E.itemsContent, `${d}.itemsContent`).forEach((w, S) => {
+          const N = n(w, `${d}.itemsContent.${S}`);
           s(N.id, `${d}.itemsContent.${S}.id`), s(N.key, `${d}.itemsContent.${S}.key`), i(N.content, `${d}.itemsContent.${S}.content`);
         });
       };
-      h(O.text, `${w}.text`), o(O.parts, `${w}.parts`).forEach((I, d) => {
-        const b = `${w}.parts.${d}`, E = n(I, b);
-        s(E.id, `${b}.id`), s(E.label, `${b}.label`), c(E.width, `${b}.width`), c(E.height, `${b}.height`), i(E.document, `${b}.document`), a(E.choice, `${b}.choice`), h(E.text, `${b}.text`);
+      h(O.text, `${T}.text`), o(O.parts, `${T}.parts`).forEach((I, d) => {
+        const E = `${T}.parts.${d}`, w = n(I, E);
+        s(w.id, `${E}.id`), s(w.label, `${E}.label`), c(w.width, `${E}.width`), c(w.height, `${E}.height`), i(w.document, `${E}.document`), a(w.choice, `${E}.choice`), h(w.text, `${E}.text`);
       });
     });
   }), m(t, "");
-  const p = Ct(t);
+  const p = It(t);
   (p.columnWidth < 100 || p.contentHeight < 100) && r("margin", "边距或栏间距过大，纸张没有足够的作答区域");
 }
 function rt(t) {
   return !t || t.marks?.some((e) => e.type === "documentLabel") ? !1 : t.type === "text" ? !!t.text?.trim() : t.type === "image" ? !!t.attrs?.src : t.type === "formula" || t.type === "blockFormula" ? !!t.attrs?.latex?.trim() : !!t.content?.some(rt);
 }
-function On(t, e) {
+function Nn(t, e) {
   try {
-    De(t, e);
+    ke(t, e);
   } catch (p) {
     return { valid: !1, issues: p instanceof ut ? p.issues : [{ code: "INVALID_DATA", path: "", message: "题卡数据无法读取" }] };
   }
@@ -1986,12 +1989,12 @@ function On(t, e) {
     if (!p) o("MISSING_EXAM_ID", "creation.exampaperId", "显示试卷二维码需要填写试卷 ID");
     else
       try {
-        _e(p);
+        De(p);
       } catch {
         o("INVALID_QR_PAYLOAD", "creation.exampaperId", "试卷 ID 太长，无法生成二维码");
       }
   }
-  t.header && t.recognition?.subjectMarkers !== !1 && !jt[Te(t.creation) || ""] && o("UNKNOWN_SUBJECT_MARK", "creation.subjectCode", "当前学科没有参考识别编码，请配置标准学科或关闭学科标记"), (!t.creation?.grade.trim() || !t.creation.subject.trim()) && o("MISSING_CREATION", "creation", "请选择年级和学科"), (!t.paperTitle || !rt(t.paperTitle.document.content)) && o("MISSING_PAPER_TITLE", "paperTitle", "请填写纸面标题"), t.blocks.some((p) => p.kind !== "area") || o("EMPTY_CARD", "blocks", "请至少添加一个题块和一道题目"), t.paperTitle && c(t.paperTitle.id, "paperTitle.id"), t.blocks.forEach((p, l) => {
+  t.header && t.recognition?.subjectMarkers !== !1 && !Gt[Se(t.creation) || ""] && o("UNKNOWN_SUBJECT_MARK", "creation.subjectCode", "当前学科没有参考识别编码，请配置标准学科或关闭学科标记"), (!t.creation?.grade.trim() || !t.creation.subject.trim()) && o("MISSING_CREATION", "creation", "请选择年级和学科"), (!t.paperTitle || !rt(t.paperTitle.document.content)) && o("MISSING_PAPER_TITLE", "paperTitle", "请填写纸面标题"), t.blocks.some((p) => p.kind !== "area") || o("EMPTY_CARD", "blocks", "请至少添加一个题块和一道题目"), t.paperTitle && c(t.paperTitle.id, "paperTitle.id"), t.blocks.forEach((p, l) => {
     n = { blockId: p.id };
     const u = `blocks.${l}`;
     if (c(p.id, `${u}.id`), p.kind === "area") {
@@ -2007,25 +2010,25 @@ function On(t, e) {
       return;
     }
     g.questions.length || o("EMPTY_BLOCK", `${u}.reference.questions`, "题块中没有题目");
-    const A = yt(g);
+    const A = bt(g);
     if ((A.some((C) => !C.trim()) || new Set(A).size !== A.length) && o("INVALID_QUESTION_NUMBER", `${u}.reference.questions`, "同一题块内的题号须非空且不能重复"), g.optional && (g.type !== "SHORTANSWER" || !Number.isInteger(g.choose) || g.choose < 1 || g.choose >= g.questions.length) && o("INVALID_OPTIONAL", `${u}.reference.choose`, "选做题须为解答题，且选做数量小于总题数"), g.type === "CCOMPOSITION" && g.questions.length > 1 && o("INVALID_COUNT", `${u}.reference.questions`, "语文作文每组只能有一道题"), g.questions.forEach((C, x) => {
       n = { blockId: p.id, questionId: C.id };
-      const M = `${u}.reference.questions.${x}`, w = lt[C.type];
+      const M = `${u}.reference.questions.${x}`, T = lt[C.type];
       c(C.id, `${M}.id`), g.type !== "MIXED" && g.type !== C.type && o("TYPE_MISMATCH", `${M}.type`, "题目类型与题块不一致"), C.choice.id !== C.id && o("INVALID_BINDING", `${M}.choice.id`, "题目与填涂项 ID 不一致");
       const O = R(C.type) || ["FILLBLANK", "SHORTANSWER"].includes(C.type);
-      (O && (C.parts.length < 1 || C.parts.length > w.parts) || !O && C.parts.length) && o("INVALID_PARTS", `${M}.parts`, `子题／空数须为 ${O ? `1–${w.parts}` : "0"}`), C.parts.length ? C.score !== Bt(C.parts) && o("SCORE_MISMATCH", `${M}.score`, "总分与子题分值之和不一致") : i(C.score, w.score, `${M}.score`), Y(C.type) && !R(C.type) && a(C.choice, w.options, `${M}.choice`), C.type === "INFO_MATCHING" && (a(C.choice, w.options, `${M}.choice`), C.parts.length > C.choice.options.length && o("INVALID_OPTIONS", `${M}.choice.options`, "信息匹配的选项数不能少于子题数")), C.type === "MCHOICE" && (!Number.isFinite(C.choice.lessScore) || C.choice.lessScore < 0 || C.choice.lessScore > (C.score || 0) || !Number.isInteger(C.choice.lessScore * 2)) && o("INVALID_LESS_SCORE", `${M}.choice.lessScore`, "少选得分须按 0.5 分递增且不能超过本题分值"), C.type === "CHUNK_CHOICE" && (!C.rightAnswers || !Number.isInteger(C.rightAnswers) || C.rightAnswers >= C.choice.options.length || !C.singleScore || C.singleScore < 0.5 || !Number.isInteger(C.singleScore * 2) || C.score !== 0 && C.singleScore * C.rightAnswers > (C.score || 0)) && o("INVALID_CHUNK_SCORE", M, "请检查正确答案个数及每处得分"), C.type === "CCOMPOSITION" && (!Number.isInteger(C.characters) || C.characters < 1 || C.characters > 1200) && o("INVALID_GRID_COUNT", `${M}.characters`, "作文格数须为 1–1200"), C.type === "ECOMPOSITION" && (!Number.isInteger(C.lines) || C.lines < 1 || C.lines > 100) && o("INVALID_LINE_COUNT", `${M}.lines`, "作文行数须为 1–100"), t.questionCard && y(C.text, `${M}.text`, ["SCHOICE", "MCHOICE"].includes(C.type), C.choice.options.length), C.parts.forEach((h, I) => {
+      (O && (C.parts.length < 1 || C.parts.length > T.parts) || !O && C.parts.length) && o("INVALID_PARTS", `${M}.parts`, `子题／空数须为 ${O ? `1–${T.parts}` : "0"}`), C.parts.length ? C.score !== jt(C.parts) && o("SCORE_MISMATCH", `${M}.score`, "总分与子题分值之和不一致") : i(C.score, T.score, `${M}.score`), Y(C.type) && !R(C.type) && a(C.choice, T.options, `${M}.choice`), C.type === "INFO_MATCHING" && (a(C.choice, T.options, `${M}.choice`), C.parts.length > C.choice.options.length && o("INVALID_OPTIONS", `${M}.choice.options`, "信息匹配的选项数不能少于子题数")), C.type === "MCHOICE" && (!Number.isFinite(C.choice.lessScore) || C.choice.lessScore < 0 || C.choice.lessScore > (C.score || 0) || !Number.isInteger(C.choice.lessScore * 2)) && o("INVALID_LESS_SCORE", `${M}.choice.lessScore`, "少选得分须按 0.5 分递增且不能超过本题分值"), C.type === "CHUNK_CHOICE" && (!C.rightAnswers || !Number.isInteger(C.rightAnswers) || C.rightAnswers >= C.choice.options.length || !C.singleScore || C.singleScore < 0.5 || !Number.isInteger(C.singleScore * 2) || C.score !== 0 && C.singleScore * C.rightAnswers > (C.score || 0)) && o("INVALID_CHUNK_SCORE", M, "请检查正确答案个数及每处得分"), C.type === "CCOMPOSITION" && (!Number.isInteger(C.characters) || C.characters < 1 || C.characters > 1200) && o("INVALID_GRID_COUNT", `${M}.characters`, "作文格数须为 1–1200"), C.type === "ECOMPOSITION" && (!Number.isInteger(C.lines) || C.lines < 1 || C.lines > 100) && o("INVALID_LINE_COUNT", `${M}.lines`, "作文行数须为 1–100"), t.questionCard && y(C.text, `${M}.text`, ["SCHOICE", "MCHOICE"].includes(C.type), C.choice.options.length), C.parts.forEach((h, I) => {
         const d = `${M}.parts.${I}`;
-        n = { blockId: p.id, questionId: h.id }, c(h.id, `${d}.id`), i(h.score, w.score, `${d}.score`), R(C.type) && Y(C.type) && (a(h.choice, w.options, `${d}.choice`), h.choice.id !== h.id && o("INVALID_BINDING", `${d}.choice.id`, "子题与填涂项 ID 不一致")), t.questionCard && ["CLOZE", "READTHENANSWER"].includes(C.type) && y(h.text, `${d}.text`, !0, h.choice.options.length, C.type === "READTHENANSWER");
+        n = { blockId: p.id, questionId: h.id }, c(h.id, `${d}.id`), i(h.score, T.score, `${d}.score`), R(C.type) && Y(C.type) && (a(h.choice, T.options, `${d}.choice`), h.choice.id !== h.id && o("INVALID_BINDING", `${d}.choice.id`, "子题与填涂项 ID 不一致")), t.questionCard && ["CLOZE", "READTHENANSWER"].includes(C.type) && y(h.text, `${d}.text`, !0, h.choice.options.length, C.type === "READTHENANSWER");
       });
     }), n = { blockId: p.id }, t.questionCard && g.layout.presentation !== "concentrated") {
-      const C = g.questions.filter((M) => Y(M.type)).flatMap((M) => R(M.type) ? M.parts.map((w) => w.choice) : [M.choice]);
-      Zt({ ...g.layout, questions: C }, p.document, !0).concentrated.questions.length && o("MISSING_FILL_TARGET", `${u}.reference.layout.presentation`, "部分填涂框没有对应的题干或选项位置");
+      const C = g.questions.filter((M) => Y(M.type)).flatMap((M) => R(M.type) ? M.parts.map((T) => T.choice) : [M.choice]);
+      qt({ ...g.layout, questions: C }, p.document, !0).concentrated.questions.length && o("MISSING_FILL_TARGET", `${u}.reference.layout.presentation`, "部分填涂框没有对应的题干或选项位置");
     }
   }), n = {};
-  const T = (p, l) => {
-    p.type === "image" && (!p.attrs?.src || /^blob:/i.test(p.attrs.src)) && o("INVALID_IMAGE_URL", l, "图片缺少可保存的地址，请上传后使用持久 URL 或内嵌图片"), ["formula", "blockFormula"].includes(p.type || "") && !String(p.attrs?.latex || "").trim() && o("EMPTY_FORMULA", l, "请填写公式或删除空公式"), p.content?.forEach((u, g) => T(u, `${l}.content.${g}`));
+  const b = (p, l) => {
+    p.type === "image" && (!p.attrs?.src || /^blob:/i.test(p.attrs.src)) && o("INVALID_IMAGE_URL", l, "图片缺少可保存的地址，请上传后使用持久 URL 或内嵌图片"), ["formula", "blockFormula"].includes(p.type || "") && !String(p.attrs?.latex || "").trim() && o("EMPTY_FORMULA", l, "请填写公式或删除空公式"), p.content?.forEach((u, g) => b(u, `${l}.content.${g}`));
   }, m = (p, l) => {
-    p && T(p.content, `${l}.content`);
+    p && b(p.content, `${l}.content`);
   }, f = (p, l) => {
     m(p?.content, `${l}.content`), p?.itemsContent.forEach((u, g) => m(u.content, `${l}.itemsContent.${g}.content`));
   };
@@ -2041,81 +2044,81 @@ function On(t, e) {
     });
   }), { valid: r.length === 0, issues: r };
 }
-function gt(t) {
+function mt(t) {
   if (t !== void 0)
     try {
-      const e = Lt(t);
+      const e = _t(t);
       return { grades: e.grades, gradeCourseMap: e.gradeCourseMap, defaultGradeCode: e.defaultGradeCode || void 0, defaultCourseCode: e.defaultCourseCode || void 0 };
     } catch (e) {
-      throw e instanceof mt ? new ut([{ code: "INVALID_DICTIONARIES", path: e.path, message: e.message }]) : e;
+      throw e instanceof Ct ? new ut([{ code: "INVALID_DICTIONARIES", path: e.path, message: e.message }]) : e;
     }
 }
-function ke(t, e) {
-  const r = (w, O) => {
-    throw new ut([{ code: "INVALID_INITIALIZATION", path: w, message: O }]);
-  }, n = (w, O, h) => {
-    if (!w || typeof w != "object" || Array.isArray(w)) return r(O, "初始化配置必须是对象");
-    const I = Object.entries(w);
+function Pe(t, e) {
+  const r = (T, O) => {
+    throw new ut([{ code: "INVALID_INITIALIZATION", path: T, message: O }]);
+  }, n = (T, O, h) => {
+    if (!T || typeof T != "object" || Array.isArray(T)) return r(O, "初始化配置必须是对象");
+    const I = Object.entries(T);
     for (const [d] of I) h.includes(d) || r(`${O}.${d}`, "不支持的初始化字段");
     return Object.fromEntries(I.filter(([, d]) => d !== void 0));
-  }, o = (w, O) => typeof w != "string" || !w.trim() ? r(O, "请提供非空的试卷名称、年级和学科") : w.trim(), s = (w, O, h) => {
-    w !== void 0 && !h.includes(w) && r(O, `可选值为 ${h.join("、")}`);
-  }, c = (w, O) => {
-    w !== void 0 && typeof w != "boolean" && r(O, "请使用布尔值");
-  }, i = (w, O, h, I) => {
-    w !== void 0 && (typeof w != "number" || !Number.isFinite(w) || w < h || w > I) && r(O, `数值必须在 ${h}–${I} 之间`);
+  }, o = (T, O) => typeof T != "string" || !T.trim() ? r(O, "请提供非空的试卷名称、年级和学科") : T.trim(), s = (T, O, h) => {
+    T !== void 0 && !h.includes(T) && r(O, `可选值为 ${h.join("、")}`);
+  }, c = (T, O) => {
+    T !== void 0 && typeof T != "boolean" && r(O, "请使用布尔值");
+  }, i = (T, O, h, I) => {
+    T !== void 0 && (typeof T != "number" || !Number.isFinite(T) || T < h || T > I) && r(O, `数值必须在 ${h}–${I} 之间`);
   }, a = n(t, "initialization", ["name", "grade", "subject", "gradeCode", "courseCode", "subjectCode", "mode", "id", "exampaperId", "createMode", "layout", "header", "recognition"]), y = o(a.name, "initialization.name");
   y.length > 30 && r("initialization.name", "试卷名称最多 30 个字符");
-  const T = Lt(gt(e)), m = a.gradeCode !== void 0 || a.courseCode !== void 0 || a.subjectCode !== void 0;
+  const b = _t(mt(e)), m = a.gradeCode !== void 0 || a.courseCode !== void 0 || a.subjectCode !== void 0;
   let f;
   if (m) {
     try {
-      f = dt(T, o(a.gradeCode, "initialization.gradeCode"), o(a.courseCode, "initialization.courseCode"));
-    } catch (w) {
-      if (w instanceof mt) return r(w.path, w.message);
-      throw w;
+      f = ht(b, o(a.gradeCode, "initialization.gradeCode"), o(a.courseCode, "initialization.courseCode"));
+    } catch (T) {
+      if (T instanceof Ct) return r(T.path, T.message);
+      throw T;
     }
-    for (const w of ["grade", "subject", "subjectCode"]) a[w] !== void 0 && o(a[w], `initialization.${w}`) !== f[w] && r(`initialization.${w}`, "名称或学科编码与课程字典不一致");
+    for (const T of ["grade", "subject", "subjectCode"]) a[T] !== void 0 && o(a[T], `initialization.${T}`) !== f[T] && r(`initialization.${T}`, "名称或学科编码与课程字典不一致");
   } else {
-    const w = o(a.grade, "initialization.grade"), O = o(a.subject, "initialization.subject"), h = T.grades.filter((b) => b.label === w);
+    const T = o(a.grade, "initialization.grade"), O = o(a.subject, "initialization.subject"), h = b.grades.filter((E) => E.label === T);
     h.length > 1 && r("initialization.grade", "同名年级不唯一，请使用 gradeCode");
-    const I = h[0], d = I ? T.gradeCourseMap[I.value].filter((b) => b.label === O) : [];
-    d.length > 1 && r("initialization.subject", "同名课程不唯一，请使用 courseCode"), e && (!I || !d.length) && r(I ? "initialization.subject" : "initialization.grade", "名称不在可用字典中，请使用年级和课程编码"), f = I && d.length ? dt(T, I.value, d[0].value) : { grade: w, subject: O };
+    const I = h[0], d = I ? b.gradeCourseMap[I.value].filter((E) => E.label === O) : [];
+    d.length > 1 && r("initialization.subject", "同名课程不唯一，请使用 courseCode"), e && (!I || !d.length) && r(I ? "initialization.subject" : "initialization.grade", "名称不在可用字典中，请使用年级和课程编码"), f = I && d.length ? ht(b, I.value, d[0].value) : { grade: T, subject: O };
   }
   s(a.mode, "initialization.mode", ["template", "exam"]), s(a.createMode, "initialization.createMode", ["MANUALLY", "IMPORTED", "THIRD"]);
   const p = {};
-  for (const w of ["id", "exampaperId"]) if (a[w] !== void 0) {
-    const O = a[w];
-    typeof O == "string" ? p[w] = o(O, `initialization.${w}`) : typeof O == "number" && Number.isSafeInteger(O) && O >= 0 ? p[w] = O : r(`initialization.${w}`, "ID 必须是非空字符串或非负安全整数");
+  for (const T of ["id", "exampaperId"]) if (a[T] !== void 0) {
+    const O = a[T];
+    typeof O == "string" ? p[T] = o(O, `initialization.${T}`) : typeof O == "number" && Number.isSafeInteger(O) && O >= 0 ? p[T] = O : r(`initialization.${T}`, "ID 必须是非空字符串或非负安全整数");
   }
   a.createMode !== void 0 && (p.createMode = a.createMode);
-  const l = a.layout === void 0 ? {} : n(a.layout, "initialization.layout", ["usage", "preset", "margin", "gap", "questionCard", "scanMarking", "halfPoint", "choiceDirection", "mergeObjective", "pageNum", "quesCard", "scoreType", "choiceType", "mixOb"]), u = (w, O, h) => {
-    l[w] !== void 0 && (l[O] !== void 0 && l[O] !== h && r(`initialization.layout.${w}`, `与 ${O} 设置冲突`), l[O] = h, delete l[w]);
+  const l = a.layout === void 0 ? {} : n(a.layout, "initialization.layout", ["usage", "preset", "margin", "gap", "questionCard", "scanMarking", "halfPoint", "choiceDirection", "mergeObjective", "pageNum", "quesCard", "scoreType", "choiceType", "mixOb"]), u = (T, O, h) => {
+    l[T] !== void 0 && (l[O] !== void 0 && l[O] !== h && r(`initialization.layout.${T}`, `与 ${O} 设置冲突`), l[O] = h, delete l[T]);
   };
   l.pageNum !== void 0 && ![1, 2, 3].includes(l.pageNum) && r("initialization.layout.pageNum", "分栏数为 1、2 或 3"), u("pageNum", "preset", { 1: "a4", 2: "a3-two", 3: "a3-three" }[l.pageNum]);
-  for (const [w, O] of [["quesCard", "questionCard"], ["scoreType", "halfPoint"], ["mixOb", "mergeObjective"], ["choiceType", "choiceDirection"]])
-    c(l[w], `initialization.layout.${w}`), u(w, O, w === "choiceType" ? l[w] ? "column" : "row" : l[w]);
+  for (const [T, O] of [["quesCard", "questionCard"], ["scoreType", "halfPoint"], ["mixOb", "mergeObjective"], ["choiceType", "choiceDirection"]])
+    c(l[T], `initialization.layout.${T}`), u(T, O, T === "choiceType" ? l[T] ? "column" : "row" : l[T]);
   s(l.preset, "initialization.layout.preset", ["a4", "a3-two", "a3-three"]), s(l.usage, "initialization.layout.usage", ["exam", "homework"]), s(l.choiceDirection, "initialization.layout.choiceDirection", ["row", "column"]), i(l.margin, "initialization.layout.margin", 0, 100), i(l.gap, "initialization.layout.gap", 0, 100);
-  for (const w of ["questionCard", "scanMarking", "halfPoint", "mergeObjective"]) c(l[w], `initialization.layout.${w}`);
+  for (const T of ["questionCard", "scanMarking", "halfPoint", "mergeObjective"]) c(l[T], `initialization.layout.${T}`);
   const g = a.header === void 0 ? {} : n(a.header, "initialization.header", ["focusText", "writeKaohao", "missExam", "mifeng", "kaohao", "weishu", "tiaomaStyle", "classText"]);
-  for (const w of ["focusText", "writeKaohao", "missExam", "mifeng", "classText"]) c(g[w], `initialization.header.${w}`);
+  for (const T of ["focusText", "writeKaohao", "missExam", "mifeng", "classText"]) c(g[T], `initialization.header.${T}`);
   g.tiaomaStyle !== void 0 && ![1, 2].includes(g.tiaomaStyle) && r("initialization.header.tiaomaStyle", "考号版式为 1（填涂）或 2（条形码）"), s(g.kaohao, "initialization.header.kaohao", ["school", "code"]), i(g.weishu, "initialization.header.weishu", 4, 12), g.weishu !== void 0 && !Number.isInteger(g.weishu) && r("initialization.header.weishu", "考号位数必须是整数");
-  const A = ae({ name: y, ...f, ...p, mode: a.mode ?? "template" }), C = a.recognition === void 0 ? void 0 : n(a.recognition, "initialization.recognition", ["examQrCode", "subjectMarkers", "pointBlack"]);
-  if (C) for (const w of ["examQrCode", "subjectMarkers", "pointBlack"]) c(C[w], `initialization.recognition.${w}`);
-  const x = { ...A, ...l, header: { ...A.header, ...g }, ...C ? { recognition: C } : {} }, M = Ct(x);
+  const A = le({ name: y, ...f, ...p, mode: a.mode ?? "template" }), C = a.recognition === void 0 ? void 0 : n(a.recognition, "initialization.recognition", ["examQrCode", "subjectMarkers", "pointBlack"]);
+  if (C) for (const T of ["examQrCode", "subjectMarkers", "pointBlack"]) c(C[T], `initialization.recognition.${T}`);
+  const x = { ...A, ...l, header: { ...A.header, ...g }, ...C ? { recognition: C } : {} }, M = It(x);
   return (M.columnWidth < 100 || M.contentHeight < 100) && r("initialization.layout", "边距或栏间距过大，纸张没有足够的作答区域"), x;
 }
-function Nn(t, e) {
+function Mn(t, e) {
   if (typeof document > "u") throw new Error("请在浏览器挂载后创建制卡实例");
-  const r = vt(e?.plugins || []), n = gt(e.dictionaries), o = typeof t == "string" ? document.querySelector(t) : t;
+  const r = zt(e?.plugins || []), n = mt(e.dictionaries), o = typeof t == "string" ? document.querySelector(t) : t;
   if (!(o instanceof HTMLElement) || o.ownerDocument !== document || /^(INPUT|TEXTAREA|SELECT|BUTTON|IMG|CANVAS|IFRAME)$/.test(o.tagName)) throw new Error("制卡需要一个空的 HTML 容器，例如 div");
   if (document.querySelector("[data-uni-answer-sheet-mount], #uni-answer-sheet")) throw new Error("当前文档已挂载制卡工作区；切换容器前请先 destroy()");
   if (o.textContent?.trim() || o.children.length) throw new Error("请提供空容器，已有题卡请通过 initialValue 传入");
   const s = document.createElement("div");
   s.className = "uni-answer-sheet-host", s.dataset.uniAnswerSheetMount = "", s.style.height = "100%", o.append(s);
-  let c = !1, i = { ...e, dictionaries: n }, a, y, T;
+  let c = !1, i = { ...e, dictionaries: n }, a, y, b;
   const m = new Promise((u, g) => {
-    y = u, T = g;
+    y = u, b = g;
   });
   m.catch(() => {
   });
@@ -2127,7 +2130,7 @@ function Nn(t, e) {
     ready: m,
     async initialize(u) {
       if (c) throw new Error("制卡实例已销毁");
-      const g = ke(u, i.dictionaries);
+      const g = Pe(u, i.dictionaries);
       a || (i = { ...i, initialValue: g }), await (await p()).setDocument(g);
     },
     getDocument: () => f().getDocument(),
@@ -2142,115 +2145,116 @@ function Nn(t, e) {
     focusIssue: (u) => f().focusIssue(u),
     setOptions(u) {
       if (c) throw new Error("制卡实例已销毁");
-      const g = Object.hasOwn(u, "dictionaries") ? gt(u.dictionaries) : i.dictionaries;
+      const g = Object.hasOwn(u, "dictionaries") ? mt(u.dictionaries) : i.dictionaries;
       i = { ...i, ...u, dictionaries: g }, a?.update(i);
     },
     destroy() {
-      c || (c = !0, a?.destroy(), s.remove(), T(new DOMException("制卡实例已销毁", "AbortError")));
+      c || (c = !0, a?.destroy(), s.remove(), b(new DOMException("制卡实例已销毁", "AbortError")));
     }
   };
-  return Promise.all([r.prepare(), import("./runtime-C-fdAw2T.js")]).then(([, { mountAnswerSheet: u }]) => {
+  return Promise.all([r.prepare(), import("./runtime-QFMZtUfH.js")]).then(([, { mountAnswerSheet: u }]) => {
     c || (a = u(s, r, i, y, (g) => {
-      T(g), l.destroy(), i.onError?.(g instanceof Error ? g : new Error(String(g)));
+      b(g), l.destroy(), i.onError?.(g instanceof Error ? g : new Error(String(g)));
     }));
   }).catch((u) => {
-    T(u), l.destroy(), i.onError?.(u instanceof Error ? u : new Error(String(u)));
+    b(u), l.destroy(), i.onError?.(u instanceof Error ? u : new Error(String(u)));
   }), l;
 }
 export {
-  oe as $,
-  An as A,
-  Sn as B,
-  Lt as C,
-  se as D,
-  un as E,
-  an as F,
-  et as G,
-  Cn as H,
-  ae as I,
-  ln as J,
-  v as K,
-  W as L,
-  Fe as M,
-  ve as N,
-  Yt as O,
-  xt as P,
-  Jt as Q,
-  Dt as R,
-  Ke as S,
-  Ge as T,
-  at as U,
-  Be as V,
+  Ze as $,
+  On as A,
+  dt as B,
+  An as C,
+  _t as D,
+  ce as E,
+  fn as F,
+  ln as G,
+  et as H,
+  In as I,
+  le as J,
+  un as K,
+  v as L,
+  W as M,
+  Ke as N,
+  ze as O,
+  Zt as P,
+  $t as Q,
+  Xt as R,
+  kt as S,
+  ve as T,
+  Ue as U,
+  at as V,
   je as W,
-  Tt as X,
-  Ue as Y,
-  qe as Z,
-  Ye as _,
-  ye as a,
-  nn as a0,
-  tn as a1,
+  Ge as X,
+  St as Y,
+  Fe as Z,
+  tn as _,
+  be as a,
+  re as a0,
+  on as a1,
   en as a2,
-  on as a3,
-  Je as a4,
-  ne as a5,
-  re as a6,
+  nn as a3,
+  rn as a4,
+  Xe as a5,
+  oe as a6,
   ie as a7,
-  We as a8,
-  Qe as a9,
-  _e as aA,
+  se as a8,
+  Ve as a9,
+  Sn as aA,
   De as aB,
-  ut as aC,
-  On as aD,
+  ke as aC,
+  ut as aD,
   Nn as aE,
-  qt as aa,
-  rn as ab,
-  Ze as ac,
-  Ve as ad,
-  lt as ae,
-  Rt as af,
-  gn as ag,
-  yn as ah,
-  pn as ai,
-  mn as aj,
-  En as ak,
-  ht as al,
-  sn as am,
-  Xe as an,
-  He as ao,
-  dt as ap,
-  le as aq,
-  cn as ar,
-  ze as as,
-  de as at,
-  bn as au,
-  wn as av,
-  it as aw,
-  Te as ax,
-  jt as ay,
-  Tn as az,
-  hn as b,
-  Ce as c,
-  Ht as d,
-  Ie as e,
-  pt as f,
+  Mn as aF,
+  Je as aa,
+  te as ab,
+  sn as ac,
+  qe as ad,
+  Qe as ae,
+  lt as af,
+  Ht as ag,
+  mn as ah,
+  bn as ai,
+  gn as aj,
+  Cn as ak,
+  wn as al,
+  pt as am,
+  cn as an,
+  Ye as ao,
+  Be as ap,
+  ht as aq,
+  ue as ar,
+  We as as,
+  he as at,
+  En as au,
+  Tn as av,
+  an as aw,
+  it as ax,
+  Se as ay,
+  Gt as az,
+  pn as b,
+  Ie as c,
+  Bt as d,
+  ye as e,
+  gt as f,
   Y as g,
-  In as h,
+  yn as h,
   R as i,
   j,
-  fn as k,
-  kt as l,
+  dn as k,
+  Pt as l,
   Q as m,
-  St as n,
-  dn as o,
-  pe as p,
-  It as q,
-  Zt as r,
-  Bt as s,
+  At as n,
+  hn as o,
+  ge as p,
+  yt as q,
+  qt as r,
+  jt as s,
   J as t,
   st as u,
-  Pt as v,
-  he as w,
-  Ot as x,
+  Rt as v,
+  pe as w,
+  Nt as x,
   Z as y,
   nt as z
 };