uni-answer-sheet 2.0.0 → 2.2.0

package/dist/chunks/index-ChLOq9ID.js

@@ -0,0 +1,2260 @@
+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 || 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 $t(t) {
+  const e = [], r = (n) => {
+    if (n.type === "choiceGroup") {
+      typeof n.attrs?.id == "string" && e.push({
+        id: n.attrs.id,
+        label: n.attrs.label || String(e.length + 1),
+        options: (n.content || []).map((o, s) => ({ id: o.attrs?.id, label: String.fromCharCode(65 + s) })).filter((o) => typeof o.id == "string")
+      });
+      return;
+    }
+    n.content?.forEach(r);
+  };
+  return r(t.content), e;
+}
+class Ct extends Error {
+  constructor(e, r) {
+    super(r), this.path = e;
+  }
+}
+const B = (t, e) => {
+  throw new Ct(t, e);
+}, ot = {
+  语文: "CHINESE",
+  数学: "MATHS",
+  英语: "ENGLISH",
+  科学: "SCIENCE",
+  物理: "PHYSICAL",
+  化学: "CHEMICAL",
+  生物: "BIOLOGICAL",
+  地理: "GEOGRAPHIC",
+  历史: "HISTORY",
+  政治: "POLITICAL",
+  思想政治: "POLITICAL",
+  道德与法治: "POLITICAL",
+  信息科技: "IT",
+  信息技术: "IT",
+  日语: "JAPANESE"
+}, Wt = {
+  P: ["语文", "数学", "英语", "科学", "道德与法治"],
+  J: ["语文", "数学", "英语", "物理", "化学", "生物", "地理", "历史", "道德与法治", "信息科技"],
+  S: ["语文", "数学", "英语", "物理", "化学", "生物", "政治", "历史", "地理", "信息技术", "日语"]
+}, 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, "字典必须是对象"), 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`), 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 ? 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 = 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"), 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 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: Lt(n) } : B("initialization.courseCode", "当前年级没有此课程");
+}
+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 ? ht(t, n, s) : { grade: "", subject: "", gradeCode: "", courseCode: "" };
+}
+function Dt(t) {
+  return t?.subjectCode || ot[t?.subject || ""];
+}
+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,
+    indefinite: !!(t.multiple && t.indefinite),
+    score: e,
+    scoreType: t.multiple && t.scoreType === "ITEM_SCORE" ? "ITEM_SCORE" : "LESS_SCORE",
+    lessScore: t.multiple && e !== null && v(t.lessScore ?? 0) ? Math.max(0, Math.min(e, t.lessScore ?? 0)) : 0,
+    correctIds: t.multiple ? r : r.slice(0, 1)
+  };
+}
+function St(t, e, r) {
+  let n = { ...t };
+  if (e.kind !== void 0) {
+    const o = e.kind !== "single";
+    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), Jt(n);
+}
+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 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 Fe(t, e) {
+  const r = new Map(t.options.map((n) => [n.id, crypto.randomUUID()]));
+  return {
+    ...t,
+    id: crypto.randomUUID(),
+    label: e,
+    breakBefore: !1,
+    contentTarget: null,
+    options: t.options.map((n) => ({ ...n, id: r.get(n.id) })),
+    correctIds: t.correctIds.map((n) => r.get(n)).filter(Boolean)
+  };
+}
+function Xt(t, e, r) {
+  return r.trim() ? t.some((n) => n.id !== e && n.label.trim() === r.trim()) ? "题组内题号不能重复" : null : "题号不能为空";
+}
+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: 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 (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) => 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 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 = Xt(i, a.id, a.label) || kt(a);
+    if (y) return { error: `第 ${a.label} 题：${y}` };
+  }
+  return { value: { ...t, questions: i } };
+}
+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((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((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 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 = [], b = /* @__PURE__ */ new Set(), m = t.questions.filter((f) => {
+    if (!r || n === "concentrated") return !0;
+    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 || 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 : (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 } };
+}
+function at(t, e = 4) {
+  return {
+    id: crypto.randomUUID(),
+    label: String(t + 1),
+    multiple: !1,
+    indefinite: !1,
+    score: null,
+    scoreType: "LESS_SCORE",
+    lessScore: 0,
+    correctIds: [],
+    breakBefore: !1,
+    options: Array.from({ length: e }, (r, n) => ({ id: crypto.randomUUID(), label: String.fromCharCode(65 + n) }))
+  };
+}
+function te(t = 8) {
+  return {
+    source: "manual",
+    presentation: "concentrated",
+    direction: "row",
+    rowsPerColumn: 5,
+    marker: "box",
+    rowGap: 0,
+    columnGap: 0,
+    questions: Array.from({ length: t }, (e, r) => at(r))
+  };
+}
+function ze(t) {
+  return new Set(t.questions.map((e) => e.options.length)).size > 1 ? "column" : t.direction;
+}
+function ee(t) {
+  const e = [];
+  for (const r of t.questions) {
+    const n = e.at(-1);
+    (!n || n.length >= t.rowsPerColumn || r.breakBefore || n[0].options.length !== r.options.length) && e.push([]), e[e.length - 1].push(r);
+  }
+  return e;
+}
+function We(t) {
+  const e = [];
+  for (const r of ee(t))
+    (!e.length || r[0].breakBefore) && e.push([]), e[e.length - 1].push(r);
+  return e;
+}
+const ne = {
+  judge: "判断题",
+  fill: "填空题",
+  answer: "解答题",
+  calculation: "计算／证明",
+  matching: "信息匹配／连线",
+  ordering: "排序／分类",
+  correction: "改错题",
+  drawing: "作图题",
+  table: "表格填答",
+  writing: "语文作文",
+  english: "外语写作",
+  reading: "阅读理解",
+  cloze: "完形填空",
+  completion: "语法填空",
+  chunk: "断句题",
+  composite: "材料／复合题",
+  optional: "选做题组",
+  practice: "实践评价"
+}, 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 ie(t, e = "1") {
+  const r = crypto.randomUUID();
+  return {
+    id: r,
+    label: e,
+    kind: t,
+    document: j(),
+    reference: j(),
+    explanation: j(),
+    score: null,
+    choice: { ...at(0, t === "judge" ? 2 : 4), id: r, label: e },
+    presentation: "concentrated",
+    blanks: [re()],
+    steps: [],
+    needsReason: !1,
+    judgment: null,
+    targets: [],
+    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 se(t) {
+  return ["reading", "cloze", "chunk"].includes(t) ? "choice" : ["matching", "completion"].includes(t) ? "fill" : ["ordering", "composite", "optional", "practice"].includes(t) ? "answer" : t;
+}
+function Ye(t) {
+  return {
+    items: [ie(se(t))],
+    judgeLabels: "symbols",
+    fillNewLine: !0,
+    pool: [],
+    relation: "one",
+    reuseOptions: !0,
+    matchingDisplay: "letters",
+    ordering: "sequence",
+    sequence: [],
+    categories: [],
+    assignments: {},
+    chooseCount: 1,
+    groupScore: null,
+    chunkText: "",
+    chunkPoints: [],
+    chunkCorrect: [],
+    chunkMax: 3,
+    chunkScore: null,
+    attachmentUrl: ""
+  };
+}
+function Ze(t) {
+  return String(Math.max(0, ...t.map((e) => /^\d+$/.test(e.label) ? Number(e.label) : 0)) + 1);
+}
+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);
+    });
+  };
+  n(e);
+  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 qe(t, e) {
+  const r = Pt(t);
+  return { ...r, label: e, choice: { ...r.choice, label: e } };
+}
+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 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 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 on(t, e) {
+  let r = 0;
+  for (; r < e.length && r < t.chunkText.length && e[r] === t.chunkText[r]; ) r++;
+  let n = 0;
+  for (; n < e.length - r && n < t.chunkText.length - r && e[e.length - 1 - n] === t.chunkText[t.chunkText.length - 1 - n]; ) n++;
+  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 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 > 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} 题分项分值之和与题分不一致`);
+  }
+  if (["matching", "ordering"].includes(e)) {
+    const o = t.pool.map((s) => s.label.trim());
+    (o.some((s) => !s) || new Set(o).size !== o.length) && r.push("共享选项编号不能为空或重复");
+  }
+  return e === "optional" && t.chooseCount > t.items.length && r.push("选做数量不能超过题目数量"), e === "chunk" && t.chunkCorrect.length > t.chunkMax && r.push("正确断点数不能超过最多选择数"), r;
+}
+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 cn = { choice: "选择题", area: "空白区域", ...ne };
+function an(t) {
+  return {
+    id: crypto.randomUUID(),
+    kind: "area",
+    areaType: t,
+    title: t === "forbiden" ? "禁止答题区" : "空白答题区",
+    answerHeight: t === "forbiden" ? 100 : 200,
+    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 ce() {
+  return { version: 1, title: "", questionCard: !1, preset: "a3-two", margin: 15, gap: 10, blocks: [] };
+}
+function ae(t = "") {
+  return {
+    // 22px title + the configured 9mm line spacing + 10px bottom inset.
+    id: crypto.randomUUID(),
+    height: 70,
+    document: { version: 1, content: { type: "doc", content: [{
+      type: "paragraph",
+      attrs: { textAlign: "center", lineSpacing: 9 },
+      ...t ? { content: [{ type: "text", text: t, marks: [{ type: "textStyle", attrs: { fontFamily: "SimSun, 宋体, serif", fontSize: "22px" } }] }] } : {}
+    }] } }
+  };
+}
+function le(t) {
+  return {
+    ...ce(),
+    title: t.name,
+    creation: t,
+    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 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, 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 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((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 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 && 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: 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: b.id,
+      page: o,
+      column: s,
+      x: n.columnX(o, s),
+      y: o * (n.height + et) + n.topInset + n.headerHeight(o, s) + c,
+      height: f,
+      available: A,
+      overflowing: C,
+      fragments: [{ page: o, column: s, x: n.columnX(o, s), y: o * (n.height + et) + n.topInset + n.headerHeight(o, s) + c, from: 0, to: Math.min(f, A) }]
+    };
+    return c += Math.min(f, A) + it, x;
+  }), y = /* @__PURE__ */ new Map();
+  a.forEach((b, m) => b.fragments.forEach((f) => {
+    const p = `${f.page}/${f.column}`, l = y.get(p) || [];
+    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 = 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);
+    }));
+  });
+  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 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" } }] }] : []
+  ] }] } };
+}
+function st(t, e, r) {
+  const n = (o) => {
+    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, 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 }] : [];
+    }), i = c.findIndex((a) => a.marks?.some((y) => y.type === "documentLabel" && y.attrs?.kind === "number"));
+    return r && i >= 0 && !c.some((a) => a.marks?.some((y) => y.type === "documentLabel" && y.attrs?.kind === "score")) && c.splice(i + 1, 0, { type: "text", text: `（${r}分）`, marks: [{ type: "documentLabel", attrs: { kind: "score" } }] }), { ...o, content: c };
+  };
+  return { ...t, content: n(t.content) };
+}
+const yt = {
+  SCHOICE: "单选题",
+  MCHOICE: "多选题",
+  JUDGE: "判断题",
+  FILLBLANK: "填空题",
+  SHORTANSWER: "解答题",
+  MIXED: "复合题",
+  CLOZE: "完形填空",
+  READTHENANSWER: "阅读理解",
+  INFO_MATCHING: "信息匹配",
+  TEXT_COMPLETION: "语法填空",
+  ECOMPOSITION: "英语作文",
+  CCOMPOSITION: "语文作文",
+  CHUNK_CHOICE: "断句题"
+}, 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 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: { ...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) => {
+  if (t.type === "choiceStemAnchor" || t.type === "text" && t.marks?.some((n) => n.type === "documentLabel" && n.attrs?.kind === "number")) return null;
+  const { contentId: e, ...r } = t.attrs || {};
+  return { ...t, ...t.attrs ? { attrs: r } : {}, ...t.content ? { content: t.content.map(ct).filter((n) => n !== null) } : {} };
+};
+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" } }] };
+    ["paragraph", "heading"].includes(o[0]?.type || "") || o.unshift({ type: "paragraph", attrs: { contentId: e }, content: [] }), o[0] = { ...o[0], content: [s, ...o[0].content || []] };
+  }
+  return t.itemsContent.length && o.push({ type: "choiceGroup", attrs: { id: t.groupId, contentId: e, ...t.layout }, content: t.itemsContent.map((s) => ({
+    type: "choiceOption",
+    attrs: { id: s.id, label: s.key, sourceKey: s.key, marker: "letter" },
+    content: s.content.content.content || [{ type: "paragraph" }]
+  })) }), o;
+}
+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) => {
+    i.marks?.some((a) => a.type === "documentLabel" && a.attrs?.kind === "number") && (s = !0), i.content?.forEach(c);
+  };
+  return o.forEach(c), {
+    ...t,
+    numbered: s,
+    content: Z(o.map(ct).filter((i) => i !== null)),
+    groupId: n?.attrs?.id || t.groupId,
+    layout: n ? Object.fromEntries(Object.entries(t.layout).map(([i, a]) => [i, n.attrs?.[i] ?? a])) : t.layout,
+    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 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)) ? 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 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(...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 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 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 = pe(n, t.document, t.id, e?.document), e && t.reference === e.reference))
+    return { ...t, reference: n };
+  e?.reference && t.reference !== e.reference && (n = me(n, e.reference));
+  const o = { ...t, reference: n };
+  return r || !J(t.document) ? { ...o, document: ge(o) } : o;
+}
+const lt = {
+  SCHOICE: { count: 200, options: [2, 12], parts: 1, score: 15 },
+  MCHOICE: { count: 200, options: [2, 12], parts: 1, score: 15 },
+  JUDGE: { count: 200, options: [2, 2], parts: 1, score: 15 },
+  CHUNK_CHOICE: { count: 100, options: [2, 26], parts: 1, score: 10 },
+  FILLBLANK: { count: 50, options: [0, 0], parts: 20, score: 15 },
+  SHORTANSWER: { count: 100, options: [0, 0], parts: 10, score: 60 },
+  CLOZE: { count: 20, options: [4, 4], parts: 20, score: 15 },
+  READTHENANSWER: { count: 20, options: [2, 12], parts: 20, score: 15 },
+  INFO_MATCHING: { count: 20, options: [1, 9], parts: 9, score: 15 },
+  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), 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 hn(t) {
+  return { id: crypto.randomUUID(), kind: Ce[t], title: yt[t], answerHeight: 0, document: j(), reference: Ie(t) };
+}
+function pn(t, e = 1, r) {
+  const n = t === "MCHOICE" && pt(r);
+  return {
+    type: t,
+    start: e,
+    end: e,
+    optionCount: t === "INFO_MATCHING" ? null : t === "CHUNK_CHOICE" ? 12 : t === "JUDGE" ? 2 : 4,
+    partCount: R(t) ? null : 1,
+    score: n ? 6 : null,
+    scoreType: n ? "ITEM_SCORE" : "LESS_SCORE",
+    lessScore: 0,
+    characters: 1e3,
+    lines: 10,
+    rightAnswers: null,
+    singleScore: 1
+  };
+}
+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 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,
+    score: e,
+    width: 25,
+    breakAfter: !1,
+    height: 100,
+    document: r === "SHORTANSWER" ? gt(t, e) : j(),
+    choice: s,
+    ...R(r) && r !== "TEXT_COMPLETION" ? { text: Rt(r, s) } : {}
+  };
+}
+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 ? jt(i) : o,
+    choice: a,
+    text: Rt(n, a, R(n)),
+    parts: i,
+    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,
+    lines: t.lines,
+    halfPoint: !1,
+    rightAnswers: t.rightAnswers,
+    singleScore: t.singleScore
+  };
+}
+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 gn(t) {
+  return Math.max(0, ...bt(t).map(Number).filter(Number.isFinite)) + 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 = 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}`;
+  if (R(e.type) && s % e.partCount !== 0) return "题目数量无法按子题数量均分，请重新设置";
+  if (e.type === "INFO_MATCHING" && e.partCount > e.optionCount) return "选项个数需大于等于子题数量";
+  if (e.type === "SHORTANSWER" && (r || t.optional) && e.partCount !== 1) return "网阅或选做题不支持小题";
+  if (e.score !== null && (!Number.isFinite(e.score) || e.score < (n ? 0 : 0.5) || e.score > o.score || !Number.isInteger(e.score * 2))) return `分值须为 ${n ? 0 : 0.5}–${o.score} 分，按 0.5 分递增`;
+  if (e.type === "MCHOICE" && (e.lessScore < 0 || !Number.isInteger(e.lessScore * 2) || e.lessScore > (e.score || 0))) return "少选得分不能超过本题分值";
+  if (e.type === "CHUNK_CHOICE") {
+    if (!e.rightAnswers || !Number.isInteger(e.rightAnswers) || e.rightAnswers >= e.optionCount) return "正确答案个数需小于选项个数";
+    if (e.singleScore === null || e.singleScore < 0.5 || !Number.isInteger(e.singleScore * 2) || e.score !== null && e.score !== 0 && e.singleScore * e.rightAnswers > e.score) return "每处得分乘以正确答案个数不可大于每题分数";
+  }
+  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 Cn(t, e, r) {
+  const n = R(e.type) ? e.partCount : 1, o = [];
+  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 In(t) {
+  return t.questions.flatMap((e) => [e, ...e.parts]);
+}
+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 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 En(t) {
+  return Math.max(1, Math.floor((t - 6) / 31));
+}
+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 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 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 we = ["000", "100", "110", "111", "101", "010", "011", "001"], Sn = (t) => we[t - 1], Gt = {
+  CHINESE: [1],
+  MATHS: [2],
+  ENGLISH: [3],
+  PHYSICAL: [4],
+  CHEMICAL: [1, 2],
+  POLITICAL: [1, 3],
+  BIOLOGICAL: [1, 4],
+  GEOGRAPHIC: [2, 3],
+  JAPANESE: [2, 4],
+  IT: [3, 4],
+  GYM: [1, 2, 3],
+  MUSIC: [1, 2, 4],
+  ART: [1, 3, 4],
+  SCIENCE: [2, 3, 4],
+  HISTORY: [1, 2, 3, 4]
+}, Te = {
+  语文: "CHINESE",
+  数学: "MATHS",
+  英语: "ENGLISH",
+  物理: "PHYSICAL",
+  化学: "CHEMICAL",
+  政治: "POLITICAL",
+  思想政治: "POLITICAL",
+  道德与法治: "POLITICAL",
+  生物: "BIOLOGICAL",
+  地理: "GEOGRAPHIC",
+  日语: "JAPANESE",
+  信息科技: "IT",
+  信息技术: "IT",
+  体育: "GYM",
+  音乐: "MUSIC",
+  美术: "ART",
+  科学: "SCIENCE",
+  历史: "HISTORY"
+};
+function Se(t) {
+  return t?.subjectCode || (t?.courseCode && Gt[t.courseCode] ? t.courseCode : Te[t?.subject || ""]);
+}
+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;
+}
+const V = function(t, e) {
+  let o = t;
+  const s = X[e];
+  let c = null, i = 0, a = null;
+  const y = [], b = {}, m = function(h, I) {
+    i = o * 4 + 17, c = (function(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)
+          E[w][S] = null;
+      }
+      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 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 E = F.getLostPoint(b);
+      (d == 0 || h > E) && (h = E, I = d);
+    }
+    return I;
+  }, l = function() {
+    for (let h = 8; h < i - 8; h += 1)
+      c[h][6] == null && (c[h][6] = h % 2 == 0);
+    for (let h = 8; h < i - 8; h += 1)
+      c[6][h] == null && (c[6][h] = h % 2 == 0);
+  }, u = function() {
+    const h = F.getPatternPosition(o);
+    for (let I = 0; I < h.length; I += 1)
+      for (let d = 0; d < h.length; d += 1) {
+        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[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 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 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, 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 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, 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[E][L - _] == null) {
+            let k = !1;
+            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 (E += d, E < 0 || i <= E) {
+          E -= d, d = -d;
+          break;
+        }
+      }
+  }, x = function(h, I) {
+    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;
+      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), Et = q(S[$], ft.getLength() - 1).mod(ft);
+      N[$] = new Array(ft.getLength() - 1);
+      for (let G = 0; G < N[$].length; G += 1) {
+        const wt = G + Et.getLength() - N[$].length;
+        N[$][G] = wt >= 0 ? Et.getAt(wt) : 0;
+      }
+    }
+    let L = 0;
+    for (let $ = 0; $ < I.length; $ += 1)
+      L += I[$].totalCount;
+    const _ = new Array(L);
+    let k = 0;
+    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; $ < 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 E = Mt.getRSBlocks(h, I), w = xt();
+    for (let N = 0; N < d.length; N += 1) {
+      const L = d[N];
+      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 < 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);
+  };
+  b.addData = function(h, I) {
+    I = I || "Byte";
+    let d = null;
+    switch (I) {
+      case "Numeric":
+        d = Ae(h);
+        break;
+      case "Alphanumeric":
+        d = Oe(h);
+        break;
+      case "Byte":
+        d = Ne(h);
+        break;
+      case "Kanji":
+        d = Me(h);
+        break;
+      default:
+        throw "mode:" + I;
+    }
+    y.push(d), a = null;
+  }, b.isDark = function(h, I) {
+    if (h < 0 || i <= h || I < 0 || i <= I)
+      throw h + "," + I;
+    return c[h][I];
+  }, b.getModuleCount = function() {
+    return i;
+  }, b.make = function() {
+    if (o < 1) {
+      let h = 1;
+      for (; h < 40; h++) {
+        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 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());
+  }, 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 E = 0; E < b.getModuleCount(); E += 1) {
+      d += "<tr>";
+      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;
+  }, 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"', $ += 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>", $;
+  }, b.createDataURL = function(h, I) {
+    h = h || 2, I = typeof I > "u" ? h * 4 : I;
+    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;
+    });
+  }, b.createImgTag = function(h, I, d) {
+    h = h || 2, I = typeof I > "u" ? h * 4 : I;
+    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 T = function(h) {
+    let I = "";
+    for (let d = 0; d < h.length; d += 1) {
+      const E = h.charAt(d);
+      switch (E) {
+        case "<":
+          I += "&lt;";
+          break;
+        case ">":
+          I += "&gt;";
+          break;
+        case "&":
+          I += "&amp;";
+          break;
+        case '"':
+          I += "&quot;";
+          break;
+        default:
+          I += E;
+          break;
+      }
+    }
+    return I;
+  }, O = function(h) {
+    h = typeof h > "u" ? 2 : h;
+    const d = b.getModuleCount() * 1 + h * 2, E = h, w = d - h;
+    let S, N, L, _, k;
+    const $ = {
+      "██": "█",
+      "█ ": "▀",
+      " █": "▄",
+      "  ": " "
+    }, D = {
+      "██": "▀",
+      "█ ": "▀",
+      " █": " ",
+      "  ": " "
+    };
+    let H = "";
+    for (S = 0; S < d; S += 2) {
+      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 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 = 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 - 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);
+  }, b.renderTo2dContext = function(h, I) {
+    I = I || 2;
+    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 = [];
+  for (let r = 0; r < t.length; r += 1) {
+    const n = t.charCodeAt(r);
+    e.push(n & 255);
+  }
+  return e;
+};
+V.createStringToBytes = function(t, e) {
+  const r = (function() {
+    const o = $e(t), s = function() {
+      const a = o.read();
+      if (a == -1) throw "eof";
+      return a;
+    };
+    let c = 0;
+    const i = {};
+    for (; ; ) {
+      const a = o.read();
+      if (a == -1) break;
+      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)
+      throw c + " != " + e;
+    return i;
+  })(), n = 63;
+  return function(o) {
+    const s = [];
+    for (let c = 0; c < o.length; c += 1) {
+      const i = o.charCodeAt(c);
+      if (i < 128)
+        s.push(i);
+      else {
+        const a = r[o.charAt(c)];
+        typeof a == "number" ? (a & 255) == a ? s.push(a) : (s.push(a >>> 8), s.push(a & 255)) : s.push(n);
+      }
+    }
+    return s;
+  };
+};
+const P = {
+  MODE_NUMBER: 1,
+  MODE_ALPHA_NUM: 2,
+  MODE_8BIT_BYTE: 4,
+  MODE_KANJI: 8
+}, X = {
+  L: 1,
+  M: 0,
+  Q: 3,
+  H: 2
+}, U = {
+  PATTERN000: 0,
+  PATTERN001: 1,
+  PATTERN010: 2,
+  PATTERN011: 3,
+  PATTERN100: 4,
+  PATTERN101: 5,
+  PATTERN110: 6,
+  PATTERN111: 7
+}, F = (function() {
+  const t = [
+    [],
+    [6, 18],
+    [6, 22],
+    [6, 26],
+    [6, 30],
+    [6, 34],
+    [6, 22, 38],
+    [6, 24, 42],
+    [6, 26, 46],
+    [6, 28, 50],
+    [6, 30, 54],
+    [6, 32, 58],
+    [6, 34, 62],
+    [6, 26, 46, 66],
+    [6, 26, 48, 70],
+    [6, 26, 50, 74],
+    [6, 30, 54, 78],
+    [6, 30, 56, 82],
+    [6, 30, 58, 86],
+    [6, 34, 62, 90],
+    [6, 28, 50, 72, 94],
+    [6, 26, 50, 74, 98],
+    [6, 30, 54, 78, 102],
+    [6, 28, 54, 80, 106],
+    [6, 32, 58, 84, 110],
+    [6, 30, 58, 86, 114],
+    [6, 34, 62, 90, 118],
+    [6, 26, 50, 74, 98, 122],
+    [6, 30, 54, 78, 102, 126],
+    [6, 26, 52, 78, 104, 130],
+    [6, 30, 56, 82, 108, 134],
+    [6, 34, 60, 86, 112, 138],
+    [6, 30, 58, 86, 114, 142],
+    [6, 34, 62, 90, 118, 146],
+    [6, 30, 54, 78, 102, 126, 150],
+    [6, 24, 50, 76, 102, 128, 154],
+    [6, 28, 54, 80, 106, 132, 158],
+    [6, 32, 58, 84, 110, 136, 162],
+    [6, 26, 54, 82, 110, 138, 166],
+    [6, 30, 58, 86, 114, 142, 170]
+  ], e = 1335, r = 7973, n = 21522, o = {}, s = function(c) {
+    let i = 0;
+    for (; c != 0; )
+      i += 1, c >>>= 1;
+    return i;
+  };
+  return o.getBCHTypeInfo = function(c) {
+    let i = c << 10;
+    for (; s(i) - s(e) >= 0; )
+      i ^= e << s(i) - s(e);
+    return (c << 10 | i) ^ n;
+  }, o.getBCHTypeNumber = function(c) {
+    let i = c << 12;
+    for (; s(i) - s(r) >= 0; )
+      i ^= r << s(i) - s(r);
+    return c << 12 | i;
+  }, o.getPatternPosition = function(c) {
+    return t[c - 1];
+  }, o.getMaskFunction = function(c) {
+    switch (c) {
+      case U.PATTERN000:
+        return function(i, a) {
+          return (i + a) % 2 == 0;
+        };
+      case U.PATTERN001:
+        return function(i, a) {
+          return i % 2 == 0;
+        };
+      case U.PATTERN010:
+        return function(i, a) {
+          return a % 3 == 0;
+        };
+      case U.PATTERN011:
+        return function(i, a) {
+          return (i + a) % 3 == 0;
+        };
+      case U.PATTERN100:
+        return function(i, a) {
+          return (Math.floor(i / 2) + Math.floor(a / 3)) % 2 == 0;
+        };
+      case U.PATTERN101:
+        return function(i, a) {
+          return i * a % 2 + i * a % 3 == 0;
+        };
+      case U.PATTERN110:
+        return function(i, a) {
+          return (i * a % 2 + i * a % 3) % 2 == 0;
+        };
+      case U.PATTERN111:
+        return function(i, a) {
+          return (i * a % 3 + (i + a) % 2) % 2 == 0;
+        };
+      default:
+        throw "bad maskPattern:" + c;
+    }
+  }, o.getErrorCorrectPolynomial = function(c) {
+    let i = q([1], 0);
+    for (let a = 0; a < c; a += 1)
+      i = i.multiply(q([1, K.gexp(a)], 0));
+    return i;
+  }, o.getLengthInBits = function(c, i) {
+    if (1 <= i && i < 10)
+      switch (c) {
+        case P.MODE_NUMBER:
+          return 10;
+        case P.MODE_ALPHA_NUM:
+          return 9;
+        case P.MODE_8BIT_BYTE:
+          return 8;
+        case P.MODE_KANJI:
+          return 8;
+        default:
+          throw "mode:" + c;
+      }
+    else if (i < 27)
+      switch (c) {
+        case P.MODE_NUMBER:
+          return 12;
+        case P.MODE_ALPHA_NUM:
+          return 11;
+        case P.MODE_8BIT_BYTE:
+          return 16;
+        case P.MODE_KANJI:
+          return 10;
+        default:
+          throw "mode:" + c;
+      }
+    else if (i < 41)
+      switch (c) {
+        case P.MODE_NUMBER:
+          return 14;
+        case P.MODE_ALPHA_NUM:
+          return 13;
+        case P.MODE_8BIT_BYTE:
+          return 16;
+        case P.MODE_KANJI:
+          return 12;
+        default:
+          throw "mode:" + c;
+      }
+    else
+      throw "type:" + i;
+  }, o.getLostPoint = function(c) {
+    const i = c.getModuleCount();
+    let a = 0;
+    for (let m = 0; m < i; m += 1)
+      for (let f = 0; f < i; f += 1) {
+        let p = 0;
+        const l = c.isDark(m, f);
+        for (let u = -1; u <= 1; u += 1)
+          if (!(m + u < 0 || i <= m + u))
+            for (let g = -1; g <= 1; g += 1)
+              f + g < 0 || i <= f + g || u == 0 && g == 0 || l == c.isDark(m + u, f + g) && (p += 1);
+        p > 5 && (a += 3 + p - 5);
+      }
+    for (let m = 0; m < i - 1; m += 1)
+      for (let f = 0; f < i - 1; f += 1) {
+        let p = 0;
+        c.isDark(m, f) && (p += 1), c.isDark(m + 1, f) && (p += 1), c.isDark(m, f + 1) && (p += 1), c.isDark(m + 1, f + 1) && (p += 1), (p == 0 || p == 4) && (a += 3);
+      }
+    for (let m = 0; m < i; m += 1)
+      for (let f = 0; f < i - 6; f += 1)
+        c.isDark(m, f) && !c.isDark(m, f + 1) && c.isDark(m, f + 2) && c.isDark(m, f + 3) && c.isDark(m, f + 4) && !c.isDark(m, f + 5) && c.isDark(m, f + 6) && (a += 40);
+    for (let m = 0; m < i; m += 1)
+      for (let f = 0; f < i - 6; f += 1)
+        c.isDark(f, m) && !c.isDark(f + 1, m) && c.isDark(f + 2, m) && c.isDark(f + 3, m) && c.isDark(f + 4, m) && !c.isDark(f + 5, m) && c.isDark(f + 6, m) && (a += 40);
+    let y = 0;
+    for (let m = 0; m < i; m += 1)
+      for (let f = 0; f < i; f += 1)
+        c.isDark(f, m) && (y += 1);
+    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);
+  for (let n = 0; n < 8; n += 1)
+    t[n] = 1 << n;
+  for (let n = 8; n < 256; n += 1)
+    t[n] = t[n - 4] ^ t[n - 5] ^ t[n - 6] ^ t[n - 8];
+  for (let n = 0; n < 255; n += 1)
+    e[t[n]] = n;
+  const r = {};
+  return r.glog = function(n) {
+    if (n < 1)
+      throw "glog(" + n + ")";
+    return e[n];
+  }, r.gexp = function(n) {
+    for (; n < 0; )
+      n += 255;
+    for (; n >= 256; )
+      n -= 255;
+    return t[n];
+  }, r;
+})(), q = function(t, e) {
+  if (typeof t.length > "u")
+    throw t.length + "/" + e;
+  const r = (function() {
+    let o = 0;
+    for (; o < t.length && t[o] == 0; )
+      o += 1;
+    const s = new Array(t.length - o + e);
+    for (let c = 0; c < t.length - o; c += 1)
+      s[c] = t[c + o];
+    return s;
+  })(), n = {};
+  return n.getAt = function(o) {
+    return r[o];
+  }, n.getLength = function() {
+    return r.length;
+  }, n.multiply = function(o) {
+    const s = new Array(n.getLength() + o.getLength() - 1);
+    for (let c = 0; c < n.getLength(); c += 1)
+      for (let i = 0; i < o.getLength(); i += 1)
+        s[c + i] ^= K.gexp(K.glog(n.getAt(c)) + K.glog(o.getAt(i)));
+    return q(s, 0);
+  }, n.mod = function(o) {
+    if (n.getLength() - o.getLength() < 0)
+      return n;
+    const s = K.glog(n.getAt(0)) - K.glog(o.getAt(0)), c = new Array(n.getLength());
+    for (let i = 0; i < n.getLength(); i += 1)
+      c[i] = n.getAt(i);
+    for (let i = 0; i < o.getLength(); i += 1)
+      c[i] ^= K.gexp(K.glog(o.getAt(i)) + s);
+    return q(c, 0).mod(o);
+  }, n;
+}, Mt = (function() {
+  const t = [
+    // L
+    // M
+    // Q
+    // H
+    // 1
+    [1, 26, 19],
+    [1, 26, 16],
+    [1, 26, 13],
+    [1, 26, 9],
+    // 2
+    [1, 44, 34],
+    [1, 44, 28],
+    [1, 44, 22],
+    [1, 44, 16],
+    // 3
+    [1, 70, 55],
+    [1, 70, 44],
+    [2, 35, 17],
+    [2, 35, 13],
+    // 4
+    [1, 100, 80],
+    [2, 50, 32],
+    [2, 50, 24],
+    [4, 25, 9],
+    // 5
+    [1, 134, 108],
+    [2, 67, 43],
+    [2, 33, 15, 2, 34, 16],
+    [2, 33, 11, 2, 34, 12],
+    // 6
+    [2, 86, 68],
+    [4, 43, 27],
+    [4, 43, 19],
+    [4, 43, 15],
+    // 7
+    [2, 98, 78],
+    [4, 49, 31],
+    [2, 32, 14, 4, 33, 15],
+    [4, 39, 13, 1, 40, 14],
+    // 8
+    [2, 121, 97],
+    [2, 60, 38, 2, 61, 39],
+    [4, 40, 18, 2, 41, 19],
+    [4, 40, 14, 2, 41, 15],
+    // 9
+    [2, 146, 116],
+    [3, 58, 36, 2, 59, 37],
+    [4, 36, 16, 4, 37, 17],
+    [4, 36, 12, 4, 37, 13],
+    // 10
+    [2, 86, 68, 2, 87, 69],
+    [4, 69, 43, 1, 70, 44],
+    [6, 43, 19, 2, 44, 20],
+    [6, 43, 15, 2, 44, 16],
+    // 11
+    [4, 101, 81],
+    [1, 80, 50, 4, 81, 51],
+    [4, 50, 22, 4, 51, 23],
+    [3, 36, 12, 8, 37, 13],
+    // 12
+    [2, 116, 92, 2, 117, 93],
+    [6, 58, 36, 2, 59, 37],
+    [4, 46, 20, 6, 47, 21],
+    [7, 42, 14, 4, 43, 15],
+    // 13
+    [4, 133, 107],
+    [8, 59, 37, 1, 60, 38],
+    [8, 44, 20, 4, 45, 21],
+    [12, 33, 11, 4, 34, 12],
+    // 14
+    [3, 145, 115, 1, 146, 116],
+    [4, 64, 40, 5, 65, 41],
+    [11, 36, 16, 5, 37, 17],
+    [11, 36, 12, 5, 37, 13],
+    // 15
+    [5, 109, 87, 1, 110, 88],
+    [5, 65, 41, 5, 66, 42],
+    [5, 54, 24, 7, 55, 25],
+    [11, 36, 12, 7, 37, 13],
+    // 16
+    [5, 122, 98, 1, 123, 99],
+    [7, 73, 45, 3, 74, 46],
+    [15, 43, 19, 2, 44, 20],
+    [3, 45, 15, 13, 46, 16],
+    // 17
+    [1, 135, 107, 5, 136, 108],
+    [10, 74, 46, 1, 75, 47],
+    [1, 50, 22, 15, 51, 23],
+    [2, 42, 14, 17, 43, 15],
+    // 18
+    [5, 150, 120, 1, 151, 121],
+    [9, 69, 43, 4, 70, 44],
+    [17, 50, 22, 1, 51, 23],
+    [2, 42, 14, 19, 43, 15],
+    // 19
+    [3, 141, 113, 4, 142, 114],
+    [3, 70, 44, 11, 71, 45],
+    [17, 47, 21, 4, 48, 22],
+    [9, 39, 13, 16, 40, 14],
+    // 20
+    [3, 135, 107, 5, 136, 108],
+    [3, 67, 41, 13, 68, 42],
+    [15, 54, 24, 5, 55, 25],
+    [15, 43, 15, 10, 44, 16],
+    // 21
+    [4, 144, 116, 4, 145, 117],
+    [17, 68, 42],
+    [17, 50, 22, 6, 51, 23],
+    [19, 46, 16, 6, 47, 17],
+    // 22
+    [2, 139, 111, 7, 140, 112],
+    [17, 74, 46],
+    [7, 54, 24, 16, 55, 25],
+    [34, 37, 13],
+    // 23
+    [4, 151, 121, 5, 152, 122],
+    [4, 75, 47, 14, 76, 48],
+    [11, 54, 24, 14, 55, 25],
+    [16, 45, 15, 14, 46, 16],
+    // 24
+    [6, 147, 117, 4, 148, 118],
+    [6, 73, 45, 14, 74, 46],
+    [11, 54, 24, 16, 55, 25],
+    [30, 46, 16, 2, 47, 17],
+    // 25
+    [8, 132, 106, 4, 133, 107],
+    [8, 75, 47, 13, 76, 48],
+    [7, 54, 24, 22, 55, 25],
+    [22, 45, 15, 13, 46, 16],
+    // 26
+    [10, 142, 114, 2, 143, 115],
+    [19, 74, 46, 4, 75, 47],
+    [28, 50, 22, 6, 51, 23],
+    [33, 46, 16, 4, 47, 17],
+    // 27
+    [8, 152, 122, 4, 153, 123],
+    [22, 73, 45, 3, 74, 46],
+    [8, 53, 23, 26, 54, 24],
+    [12, 45, 15, 28, 46, 16],
+    // 28
+    [3, 147, 117, 10, 148, 118],
+    [3, 73, 45, 23, 74, 46],
+    [4, 54, 24, 31, 55, 25],
+    [11, 45, 15, 31, 46, 16],
+    // 29
+    [7, 146, 116, 7, 147, 117],
+    [21, 73, 45, 7, 74, 46],
+    [1, 53, 23, 37, 54, 24],
+    [19, 45, 15, 26, 46, 16],
+    // 30
+    [5, 145, 115, 10, 146, 116],
+    [19, 75, 47, 10, 76, 48],
+    [15, 54, 24, 25, 55, 25],
+    [23, 45, 15, 25, 46, 16],
+    // 31
+    [13, 145, 115, 3, 146, 116],
+    [2, 74, 46, 29, 75, 47],
+    [42, 54, 24, 1, 55, 25],
+    [23, 45, 15, 28, 46, 16],
+    // 32
+    [17, 145, 115],
+    [10, 74, 46, 23, 75, 47],
+    [10, 54, 24, 35, 55, 25],
+    [19, 45, 15, 35, 46, 16],
+    // 33
+    [17, 145, 115, 1, 146, 116],
+    [14, 74, 46, 21, 75, 47],
+    [29, 54, 24, 19, 55, 25],
+    [11, 45, 15, 46, 46, 16],
+    // 34
+    [13, 145, 115, 6, 146, 116],
+    [14, 74, 46, 23, 75, 47],
+    [44, 54, 24, 7, 55, 25],
+    [59, 46, 16, 1, 47, 17],
+    // 35
+    [12, 151, 121, 7, 152, 122],
+    [12, 75, 47, 26, 76, 48],
+    [39, 54, 24, 14, 55, 25],
+    [22, 45, 15, 41, 46, 16],
+    // 36
+    [6, 151, 121, 14, 152, 122],
+    [6, 75, 47, 34, 76, 48],
+    [46, 54, 24, 10, 55, 25],
+    [2, 45, 15, 64, 46, 16],
+    // 37
+    [17, 152, 122, 4, 153, 123],
+    [29, 74, 46, 14, 75, 47],
+    [49, 54, 24, 10, 55, 25],
+    [24, 45, 15, 46, 46, 16],
+    // 38
+    [4, 152, 122, 18, 153, 123],
+    [13, 74, 46, 32, 75, 47],
+    [48, 54, 24, 14, 55, 25],
+    [42, 45, 15, 32, 46, 16],
+    // 39
+    [20, 147, 117, 4, 148, 118],
+    [40, 75, 47, 7, 76, 48],
+    [43, 54, 24, 22, 55, 25],
+    [10, 45, 15, 67, 46, 16],
+    // 40
+    [19, 148, 118, 6, 149, 119],
+    [18, 75, 47, 31, 76, 48],
+    [34, 54, 24, 34, 55, 25],
+    [20, 45, 15, 61, 46, 16]
+  ], e = function(o, s) {
+    const c = {};
+    return c.totalCount = o, c.dataCount = s, c;
+  }, r = {}, n = function(o, s) {
+    switch (s) {
+      case X.L:
+        return t[(o - 1) * 4 + 0];
+      case X.M:
+        return t[(o - 1) * 4 + 1];
+      case X.Q:
+        return t[(o - 1) * 4 + 2];
+      case X.H:
+        return t[(o - 1) * 4 + 3];
+      default:
+        return;
+    }
+  };
+  return r.getRSBlocks = function(o, s) {
+    const c = n(o, s);
+    if (typeof c > "u")
+      throw "bad rs block @ typeNumber:" + o + "/errorCorrectionLevel:" + s;
+    const i = c.length / 3, a = [];
+    for (let y = 0; y < i; y += 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;
+})(), xt = function() {
+  const t = [];
+  let e = 0;
+  const r = {};
+  return r.getBuffer = function() {
+    return t;
+  }, r.getAt = function(n) {
+    const o = Math.floor(n / 8);
+    return (t[o] >>> 7 - n % 8 & 1) == 1;
+  }, r.put = function(n, o) {
+    for (let s = 0; s < o; s += 1)
+      r.putBit((n >>> o - s - 1 & 1) == 1);
+  }, r.getLengthInBits = function() {
+    return e;
+  }, r.putBit = function(n) {
+    const o = Math.floor(e / 8);
+    t.length <= o && t.push(0), n && (t[o] |= 128 >>> e % 8), e += 1;
+  }, r;
+}, Ae = function(t) {
+  const e = P.MODE_NUMBER, r = t, n = {};
+  n.getMode = function() {
+    return e;
+  }, n.getLength = function(c) {
+    return r.length;
+  }, n.write = function(c) {
+    const i = r;
+    let a = 0;
+    for (; a + 2 < i.length; )
+      c.put(o(i.substring(a, a + 3)), 10), a += 3;
+    a < i.length && (i.length - a == 1 ? c.put(o(i.substring(a, a + 1)), 4) : i.length - a == 2 && c.put(o(i.substring(a, a + 2)), 7));
+  };
+  const o = function(c) {
+    let i = 0;
+    for (let a = 0; a < c.length; a += 1)
+      i = i * 10 + s(c.charAt(a));
+    return i;
+  }, s = function(c) {
+    if ("0" <= c && c <= "9")
+      return c.charCodeAt(0) - 48;
+    throw "illegal char :" + c;
+  };
+  return n;
+}, Oe = function(t) {
+  const e = P.MODE_ALPHA_NUM, r = t, n = {};
+  n.getMode = function() {
+    return e;
+  }, n.getLength = function(s) {
+    return r.length;
+  }, n.write = function(s) {
+    const c = r;
+    let i = 0;
+    for (; i + 1 < c.length; )
+      s.put(
+        o(c.charAt(i)) * 45 + o(c.charAt(i + 1)),
+        11
+      ), i += 2;
+    i < c.length && s.put(o(c.charAt(i)), 6);
+  };
+  const o = function(s) {
+    if ("0" <= s && s <= "9")
+      return s.charCodeAt(0) - 48;
+    if ("A" <= s && s <= "Z")
+      return s.charCodeAt(0) - 65 + 10;
+    switch (s) {
+      case " ":
+        return 36;
+      case "$":
+        return 37;
+      case "%":
+        return 38;
+      case "*":
+        return 39;
+      case "+":
+        return 40;
+      case "-":
+        return 41;
+      case ".":
+        return 42;
+      case "/":
+        return 43;
+      case ":":
+        return 44;
+      default:
+        throw "illegal char :" + s;
+    }
+  };
+  return n;
+}, Ne = function(t) {
+  const e = P.MODE_8BIT_BYTE, r = V.stringToBytes(t), n = {};
+  return n.getMode = function() {
+    return e;
+  }, n.getLength = function(o) {
+    return r.length;
+  }, n.write = function(o) {
+    for (let s = 0; s < r.length; s += 1)
+      o.put(r[s], 8);
+  }, n;
+}, Me = function(t) {
+  const e = P.MODE_KANJI, r = V.stringToBytes;
+  (function(s, c) {
+    const i = r(s);
+    if (i.length != 2 || (i[0] << 8 | i[1]) != c)
+      throw "sjis not supported.";
+  })("友", 38726);
+  const n = r(t), o = {};
+  return o.getMode = function() {
+    return e;
+  }, o.getLength = function(s) {
+    return ~~(n.length / 2);
+  }, o.write = function(s) {
+    const c = n;
+    let i = 0;
+    for (; i + 1 < c.length; ) {
+      let a = (255 & c[i]) << 8 | 255 & c[i + 1];
+      if (33088 <= a && a <= 40956)
+        a -= 33088;
+      else if (57408 <= a && a <= 60351)
+        a -= 49472;
+      else
+        throw "illegal char at " + (i + 1) + "/" + a;
+      a = (a >>> 8 & 255) * 192 + (a & 255), s.put(a, 13), i += 2;
+    }
+    if (i < c.length)
+      throw "illegal char at " + (i + 1);
+  }, o;
+}, Ut = function() {
+  const t = [], e = {};
+  return e.writeByte = function(r) {
+    t.push(r & 255);
+  }, e.writeShort = function(r) {
+    e.writeByte(r), e.writeByte(r >>> 8);
+  }, e.writeBytes = function(r, n, o) {
+    n = n || 0, o = o || r.length;
+    for (let s = 0; s < o; s += 1)
+      e.writeByte(r[s + n]);
+  }, e.writeString = function(r) {
+    for (let n = 0; n < r.length; n += 1)
+      e.writeByte(r.charCodeAt(n));
+  }, e.toByteArray = function() {
+    return t;
+  }, e.toString = function() {
+    let r = "";
+    r += "[";
+    for (let n = 0; n < t.length; n += 1)
+      n > 0 && (r += ","), r += t[n];
+    return r += "]", r;
+  }, e;
+}, xe = function() {
+  let t = 0, e = 0, r = 0, n = "";
+  const o = {}, s = function(i) {
+    n += String.fromCharCode(c(i & 63));
+  }, c = function(i) {
+    if (i < 0)
+      throw "n:" + i;
+    if (i < 26)
+      return 65 + i;
+    if (i < 52)
+      return 97 + (i - 26);
+    if (i < 62)
+      return 48 + (i - 52);
+    if (i == 62)
+      return 43;
+    if (i == 63)
+      return 47;
+    throw "n:" + i;
+  };
+  return o.writeByte = function(i) {
+    for (t = t << 8 | i & 255, e += 8, r += 1; e >= 6; )
+      s(t >>> e - 6), e -= 6;
+  }, o.flush = function() {
+    if (e > 0 && (s(t << 6 - e), t = 0, e = 0), r % 3 != 0) {
+      const i = 3 - r % 3;
+      for (let a = 0; a < i; a += 1)
+        n += "=";
+    }
+  }, o.toString = function() {
+    return n;
+  }, o;
+}, $e = function(t) {
+  const e = t;
+  let r = 0, n = 0, o = 0;
+  const s = {};
+  s.read = function() {
+    for (; o < 8; ) {
+      if (r >= e.length) {
+        if (o == 0)
+          return -1;
+        throw "unexpected end of file./" + o;
+      }
+      const a = e.charAt(r);
+      if (r += 1, a == "=")
+        return o = 0, -1;
+      if (a.match(/^\s$/))
+        continue;
+      n = n << 6 | c(a.charCodeAt(0)), o += 6;
+    }
+    const i = n >>> o - 8 & 255;
+    return o -= 8, i;
+  };
+  const c = function(i) {
+    if (65 <= i && i <= 90)
+      return i - 65;
+    if (97 <= i && i <= 122)
+      return i - 97 + 26;
+    if (48 <= i && i <= 57)
+      return i - 48 + 52;
+    if (i == 43)
+      return 62;
+    if (i == 47)
+      return 63;
+    throw "c:" + i;
+  };
+  return s;
+}, Le = function(t, e) {
+  const r = t, n = e, o = new Array(t * e), s = {};
+  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 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 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; )
+        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 && b.writeByte(f);
+    }, p;
+  }, i = function(y) {
+    const b = 1 << y, m = (1 << y) + 1;
+    let f = y + 1;
+    const p = a();
+    for (let C = 0; C < b; C += 1)
+      p.add(String.fromCharCode(C));
+    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]);
+      g += 1, p.contains(A + C) ? A = A + C : (u.write(p.indexOf(A), f), p.size() < 4095 && (p.size() == 1 << f && (f += 1), p.add(A + C)), A = C);
+    }
+    return u.write(p.indexOf(A), f), u.write(m, f), u.flush(), l.toByteArray();
+  }, a = function() {
+    const y = {};
+    let b = 0;
+    const m = {};
+    return m.add = function(f) {
+      if (m.contains(f))
+        throw "dup key:" + f;
+      y[f] = b, b += 1;
+    }, m.size = function() {
+      return b;
+    }, m.indexOf = function(f) {
+      return y[f];
+    }, m.contains = function(f) {
+      return typeof y[f] < "u";
+    }, m;
+  };
+  return s;
+}, _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 = Ut();
+  n.write(o);
+  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 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();
+  let o = "";
+  for (let s = 0; s < n; s++) for (let c = 0; c < n; c++) e.isDark(s, c) && (o += `M${c} ${s}h1v1h-1z`);
+  return { count: n, path: o };
+}
+class ut extends Error {
+  constructor(r) {
+    super(r[0]?.message || "题卡数据无效");
+    Tt(this, "issues");
+    this.name = "AnswerSheetDataError", this.issues = r;
+  }
+}
+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) => {
+    typeof l != "string" && r(u);
+  }, c = (l, u, g = 0, A = 1e5) => {
+    (typeof l != "number" || !Number.isFinite(l) || l < g || l > A) && r(u);
+  }, i = (l, u) => {
+    n(l, u);
+    const g = e.validateDocument(l);
+    g.length && r(u, g[0]);
+  }, a = (l, u) => {
+    const g = n(l, u);
+    if (s(g.id, `${u}.id`), s(g.label, `${u}.label`), (typeof g.multiple != "boolean" || typeof g.breakBefore != "boolean") && r(u), g.contentTarget !== void 0 && g.contentTarget !== null) {
+      const A = n(g.contentTarget, `${u}.contentTarget`);
+      s(A.groupId, `${u}.contentTarget.groupId`), o(A.optionIds, `${u}.contentTarget.optionIds`).forEach((C, x) => s(C, `${u}.contentTarget.optionIds.${x}`));
+    }
+    o(g.options, `${u}.options`).forEach((A, C) => {
+      const x = n(A, `${u}.options.${C}`);
+      s(x.id, `${u}.options.${C}.id`), s(x.label, `${u}.options.${C}.label`);
+    }), o(g.correctIds, `${u}.correctIds`).forEach((A, C) => s(A, `${u}.correctIds.${C}`));
+  }, 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}`));
+  }, b = /* @__PURE__ */ new WeakSet(), m = (l, u) => {
+    if (!(!l || typeof l != "object")) {
+      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) => {
+    f[l] !== void 0 && typeof f[l] != "boolean" && r(l);
+  }), ["a4", "a3-two", "a3-three"].includes(String(f.preset)) || r("preset"), c(f.margin, "margin", 0, 100), c(f.gap, "gap", 0, 100), f.creation) {
+    const l = n(f.creation, "creation");
+    ["template", "exam"].includes(String(l.mode)) || r("creation.mode"), ["name", "grade", "subject"].forEach((u) => s(l[u], `creation.${u}`));
+    for (const u of ["gradeCode", "courseCode", "subjectCode"]) l[u] !== void 0 && (typeof l[u] != "string" || !l[u].trim()) && r(`creation.${u}`);
+    l.phaseCode !== void 0 && !["P", "J", "S"].includes(String(l.phaseCode)) && r("creation.phaseCode"), l.createMode !== void 0 && !["MANUALLY", "IMPORTED", "THIRD"].includes(String(l.createMode)) && r("creation.createMode");
+    for (const u of ["id", "exampaperId"]) if (l[u] !== void 0) {
+      const g = l[u];
+      typeof g == "string" && g.trim() || typeof g == "number" && Number.isSafeInteger(g) && g >= 0 || r(`creation.${u}`);
+    }
+  }
+  if (f.paperTitle) {
+    const l = n(f.paperTitle, "paperTitle");
+    s(l.id, "paperTitle.id"), c(l.height, "paperTitle.height", 1, 1e3), i(l.document, "paperTitle.document");
+  }
+  if (f.header) {
+    const l = n(f.header, "header");
+    ["code", "school"].includes(String(l.kaohao)) || r("header.kaohao"), c(l.weishu, "header.weishu", 1, 20), l.tiaomaStyle !== void 0 && ![1, 2].includes(l.tiaomaStyle) && r("header.tiaomaStyle"), l.classText !== void 0 && typeof l.classText != "boolean" && r("header.classText");
+  }
+  if (f.recognition !== void 0) {
+    const l = n(f.recognition, "recognition");
+    for (const u of ["examQrCode", "subjectMarkers", "pointBlack"]) l[u] !== void 0 && typeof l[u] != "boolean" && r(`recognition.${u}`);
+  }
+  o(f.blocks, "blocks").forEach((l, u) => {
+    const g = `blocks.${u}`, A = n(l, g);
+    if (s(A.id, `${g}.id`), s(A.title, `${g}.title`), c(A.answerHeight, `${g}.answerHeight`), i(A.document, `${g}.document`), A.kind === "area") {
+      (!["forbiden", "editArea"].includes(String(A.areaType)) || A.reference || A.choices || A.exercise) && r(`${g}.areaType`), c(A.answerHeight, `${g}.answerHeight`, 100, 4e3);
+      return;
+    }
+    if (!A.reference) {
+      if (A.choices) {
+        y(A.choices, `${g}.choices`);
+        return;
+      }
+      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(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 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, `${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 = 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 Nn(t, e) {
+  try {
+    ke(t, e);
+  } catch (p) {
+    return { valid: !1, issues: p instanceof ut ? p.issues : [{ code: "INVALID_DATA", path: "", message: "题卡数据无法读取" }] };
+  }
+  const r = [];
+  let n = {};
+  const o = (p, l, u) => r.push({ code: p, path: l, message: u, ...n }), s = /* @__PURE__ */ new Set(), c = (p, l) => {
+    (!p.trim() || s.has(p)) && o("DUPLICATE_ID", l, "题块、题目和选项 ID 必须非空且唯一"), s.add(p);
+  }, i = (p, l, u) => {
+    (p === null || !Number.isFinite(p) || p < (t.usage === "homework" ? 0 : 0.5) || p > l || !Number.isInteger(p * 2)) && o("INVALID_SCORE", u, `分值须为 ${t.usage === "homework" ? 0 : 0.5}–${l} 分，按 0.5 分递增`);
+  }, a = (p, l, u) => {
+    (p.options.length < l[0] || p.options.length > l[1]) && o("INVALID_OPTIONS", `${u}.options`, `选项个数须为 ${l[0]}–${l[1]}`), p.options.forEach((g, A) => c(g.id, `${u}.options.${A}.id`)), (new Set(p.correctIds).size !== p.correctIds.length || p.correctIds.some((g) => !p.options.some((A) => A.id === g))) && o("INVALID_ANSWER_REFERENCE", `${u}.correctIds`, "答案引用了不存在或重复的选项");
+  }, y = (p, l, u, g = 0, A = !0) => {
+    A && !rt(p?.content.content) && o("MISSING_CONTENT", `${l}.content`, "请填写题干或材料"), u && (p?.itemsContent.length !== g || p.itemsContent.some((C) => !rt(C.content.content))) && o("MISSING_OPTION_CONTENT", `${l}.itemsContent`, "请补全每个选项的内容");
+  };
+  if (t.title.trim() || o("MISSING_TITLE", "title", "请填写题卡名称"), t.recognition?.examQrCode) {
+    const p = String(t.creation?.exampaperId ?? "").trim();
+    if (!p) o("MISSING_EXAM_ID", "creation.exampaperId", "显示试卷二维码需要填写试卷 ID");
+    else
+      try {
+        De(p);
+      } catch {
+        o("INVALID_QR_PAYLOAD", "creation.exampaperId", "试卷 ID 太长，无法生成二维码");
+      }
+  }
+  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") {
+      p.areaType === (t.questionCard ? "forbiden" : "editArea") && o("INVALID_AREA_MODE", `${u}.areaType`, "题卡合一使用空白答题区，独立答题卡使用禁止答题区");
+      return;
+    }
+    p.title.trim() || o("MISSING_BLOCK_TITLE", `${u}.title`, "请填写题块标题"), p.id === "reference-merged-objective" && o("RESERVED_ID", `${u}.id`, "题块使用了系统保留 ID");
+    const g = p.reference;
+    if (!g) {
+      p.choices?.questions.length || o("EMPTY_BLOCK", u, "题块中没有题目"), p.choices?.questions.forEach((C, x) => {
+        n = { blockId: p.id, questionId: C.id }, c(C.id, `${u}.choices.questions.${x}.id`), a(C, [2, 12], `${u}.choices.questions.${x}`), i(C.score ?? null, 15, `${u}.choices.questions.${x}.score`);
+      });
+      return;
+    }
+    g.questions.length || o("EMPTY_BLOCK", `${u}.reference.questions`, "题块中没有题目");
+    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}`, 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 > 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, 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((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 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 && 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`));
+  };
+  return m(t.paperTitle?.document, "paperTitle.document"), t.blocks.forEach((p, l) => {
+    n = { blockId: p.id };
+    const u = `blocks.${l}`;
+    m(p.document, `${u}.document`), m(p.reference?.material, `${u}.reference.material`), p.reference?.questions.forEach((g, A) => {
+      n = { blockId: p.id, questionId: g.id };
+      const C = `blocks.${l}.reference.questions.${A}`;
+      m(g.document, `${C}.document`), f(g.text, `${C}.text`), g.parts.forEach((x, M) => {
+        n = { blockId: p.id, questionId: x.id }, m(x.document, `${C}.parts.${M}.document`), f(x.text, `${C}.parts.${M}.text`);
+      });
+    });
+  }), { valid: r.length === 0, issues: r };
+}
+function mt(t) {
+  if (t !== void 0)
+    try {
+      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 Ct ? new ut([{ code: "INVALID_DICTIONARIES", path: e.path, message: e.message }]) : e;
+    }
+}
+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 = (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 b = _t(mt(e)), m = a.gradeCode !== void 0 || a.courseCode !== void 0 || a.subjectCode !== void 0;
+  let f;
+  if (m) {
+    try {
+      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 T of ["grade", "subject", "subjectCode"]) a[T] !== void 0 && o(a[T], `initialization.${T}`) !== f[T] && r(`initialization.${T}`, "名称或学科编码与课程字典不一致");
+  } else {
+    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 ? 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 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 = (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 [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 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 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 = 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 Mn(t, e) {
+  if (typeof document > "u") throw new Error("请在浏览器挂载后创建制卡实例");
+  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, b;
+  const m = new Promise((u, g) => {
+    y = u, b = g;
+  });
+  m.catch(() => {
+  });
+  const f = () => {
+    if (c) throw new Error("制卡实例已销毁");
+    if (!a?.isReady()) throw new Error("请先等待 sheet.ready");
+    return a;
+  }, p = async () => (await m, f()), l = {
+    ready: m,
+    async initialize(u) {
+      if (c) throw new Error("制卡实例已销毁");
+      const g = Pe(u, i.dictionaries);
+      a || (i = { ...i, initialValue: g }), await (await p()).setDocument(g);
+    },
+    getDocument: () => f().getDocument(),
+    load: async (u) => (await p()).setDocument(u),
+    setDocument: async (u) => (await p()).setDocument(u),
+    newDocument: async (u) => (await p()).newDocument(u),
+    getReferenceData: () => f().getReferenceData(),
+    setReferenceData: async (u) => (await p()).setReferenceData(u),
+    validate: async () => (await p()).validate(),
+    save: async () => (await p()).save(),
+    getRecognitionData: async () => (await p()).getRecognitionData(),
+    focusIssue: (u) => f().focusIssue(u),
+    setOptions(u) {
+      if (c) throw new Error("制卡实例已销毁");
+      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(), b(new DOMException("制卡实例已销毁", "AbortError")));
+    }
+  };
+  return Promise.all([r.prepare(), import("./runtime-QFMZtUfH.js")]).then(([, { mountAnswerSheet: u }]) => {
+    c || (a = u(s, r, i, y, (g) => {
+      b(g), l.destroy(), i.onError?.(g instanceof Error ? g : new Error(String(g)));
+    }));
+  }).catch((u) => {
+    b(u), l.destroy(), i.onError?.(u instanceof Error ? u : new Error(String(u)));
+  }), l;
+}
+export {
+  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,
+  Ge as X,
+  St as Y,
+  Fe as Z,
+  tn as _,
+  be as a,
+  re as a0,
+  on as a1,
+  en as a2,
+  nn as a3,
+  rn as a4,
+  Xe as a5,
+  oe as a6,
+  ie as a7,
+  se as a8,
+  Ve as a9,
+  Sn as aA,
+  De as aB,
+  ke as aC,
+  ut as aD,
+  Nn as aE,
+  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,
+  yn as h,
+  R as i,
+  j,
+  dn as k,
+  Pt as l,
+  Q as m,
+  At as n,
+  hn as o,
+  ge as p,
+  yt as q,
+  qt as r,
+  jt as s,
+  J as t,
+  st as u,
+  Rt as v,
+  pe as w,
+  Nt as x,
+  Z as y,
+  nt as z
+};