@pie-element/graphing 10.1.2-next.2 → 10.1.2

package/dist/browser/controller/index.js

@@ -1,353 +0,0 @@
-import { D as e, E as t, R as n, b as r, f as i, i as a, l as o, p as s, r as c, s as l, u, w as d } from "../dist-BrN2xZtM.js";
-//#region src/controller/defaults.ts
-var f = /* @__PURE__ */ n(u(), 1), p = {
-	answers: { correctAnswer: {
-		name: "Correct Answer",
-		marks: []
-	} },
-	arrows: {
-		left: !0,
-		right: !0,
-		up: !0,
-		down: !0
-	},
-	backgroundMarks: [],
-	coordinatesOnHover: !1,
-	defaultGridConfiguration: 0,
-	domain: {
-		min: -5,
-		max: 5,
-		step: 1,
-		labelStep: 1,
-		axisLabel: "x"
-	},
-	graph: {
-		width: 500,
-		height: 500
-	},
-	includeAxes: !0,
-	labels: {},
-	labelsEnabled: !0,
-	padding: !0,
-	prompt: "",
-	promptEnabled: !0,
-	range: {
-		min: -5,
-		max: 5,
-		step: 1,
-		labelStep: 1,
-		axisLabel: "y"
-	},
-	rationale: "",
-	rationaleEnabled: !0,
-	standardGrid: !1,
-	studentInstructionsEnabled: !0,
-	teacherInstructions: "",
-	teacherInstructionsEnabled: !0,
-	title: "",
-	titleEnabled: !0,
-	toolbarTools: [
-		"circle",
-		"line",
-		"label",
-		"parabola",
-		"point",
-		"polygon",
-		"ray",
-		"segment",
-		"sine",
-		"vector"
-	]
-}, m = (e, t) => (e = { ...e }, t = { ...t }, s(e.x, t.x) && s(e.y, t.y)), h = (e, t) => {
-	let n = !0;
-	return e = { ...e }, t = { ...t }, (e.label || t.label) && (n = s(e.label, t.label)), s(e.x, t.x) && s(e.y, t.y) && n;
-}, g = (e, t) => s(e.from, t.from) && s(e.to, t.to) || s(e.to, t.from) && s(e.from, t.to), _ = (e, t) => s(e.from, t.from) && s(e.to, t.to), v = (e) => Object.keys(e || {}).sort().reduce((t, n) => (n !== "correctAnswer" && (t[n] = e[n]), t), {}), y = (e) => {
-	e = {
-		...e,
-		to: { ...e.to },
-		from: { ...e.from }
-	};
-	let t = e.from.x, n = e.from.y, r = e.to.x, i = e.to.y;
-	return {
-		a: i - n,
-		b: t - r,
-		c: r * n - t * i
-	};
-}, b = (e) => Math.round(e * 1e4) / 1e4, x = (e, t) => {
-	let { a: n, b: r, c: a } = y(e), { a: o, b: s, c } = y(t), l = [];
-	if (o !== 0) l.push(b(n / o));
-	else if (n !== o) return !1;
-	if (s !== 0) l.push(b(r / s));
-	else if (r !== s) return !1;
-	if (c !== 0) l.push(b(a / c));
-	else if (a !== c) return !1;
-	return i(l).length === 1;
-}, S = (e, t) => {
-	e = {
-		...e,
-		to: { ...e.to },
-		from: { ...e.from }
-	}, t = {
-		...t,
-		to: { ...t.to },
-		from: { ...t.from }
-	};
-	let n = (e.to.y - e.from.y) / (e.to.x - e.from.x), r = (t.to.y - t.from.y) / (t.to.x - t.from.x), i = Math.atan2(e.to.y - e.from.y, e.to.x - e.from.x) * 180 / Math.PI, a = Math.atan2(t.to.y - t.from.y, t.to.x - t.from.x) * 180 / Math.PI;
-	return n === r && e.from.x === t.from.x && e.from.y === t.from.y && i === a;
-}, C = (e) => (e || []).map((t, n) => ({
-	from: t,
-	to: e[(n + 1) % e.length]
-})), w = (e) => (e ||= [], d(e, (e, t) => g(e, t))), T = (e) => (e ||= [], e.filter((e) => !s(e.from, e.to))), E = (e, n) => {
-	let { points: r } = e, { points: i } = n, a = C(r), o = C(i), s = w(T(a)), c = w(T(o)), l = t(s, c, g), u = t(c, s, g);
-	return (!l || !l.length) && (!u || !u.length);
-}, D = (e, t) => {
-	if (e = {
-		...e,
-		root: { ...e.root },
-		edge: { ...e.edge }
-	}, t = {
-		...t,
-		root: { ...t.root },
-		edge: { ...t.edge }
-	}, s(t.edge, e.edge) && s(t.root, e.root)) return !0;
-	let n = Math.sqrt((e.edge.x - e.root.x) ** 2 + (e.edge.y - e.root.y) ** 2), r = Math.sqrt((t.edge.x - t.root.x) ** 2 + (t.edge.y - t.root.y) ** 2);
-	return s(t.root, e.root) && s(n, r);
-}, O = (e, t) => {
-	let n = ({ root: e, edge: t }) => {
-		e = { ...e }, t = { ...t };
-		let { amplitude: n, freq: r } = l(e, t), i = Math.abs(e.y - t.y) * 2, a = Math.abs(e.x - t.x) * 2, o = t.x, s = t.y;
-		for (; o < 0 && a !== 0;) o += a, s = s < e.y ? s + i : s - i;
-		for (; o - a > 0 && a !== 0;) o -= a, s = s < e.y ? s + i : s - i;
-		return {
-			amplitude: b(n),
-			freq: b(r),
-			min: b(t.y < e.y ? t.y : t.y - i),
-			max: b(t.y < e.y ? t.y + i : t.y),
-			edgeAboveZeroX: b(o),
-			edgeAboveZeroY: b(s)
-		};
-	}, r = n(e), i = n(t), { amplitude: a, freq: o, min: s, max: c, edgeAboveZeroX: u, edgeAboveZeroY: d } = r, { amplitude: f, freq: p, min: m, max: h, edgeAboveZeroX: g, edgeAboveZeroY: _ } = i;
-	return Math.abs(a) === Math.abs(f) && Math.abs(o) === Math.abs(p) && s === m && c === h && u === g && d === _;
-}, k = (e, t) => {
-	let { edge: n } = e, { edge: r } = t, { root: i } = e, { root: a } = t;
-	i = { ...i }, a = { ...a };
-	let o = n || { ...i }, s = r || { ...a }, l = {
-		x: i.x - (o.x - i.x),
-		y: o.y
-	}, u = {
-		x: a.x - (s.x - a.x),
-		y: s.y
-	};
-	if (!n || !r) return !1;
-	let { a: d, b: f, c: p } = c(i, n, l), { a: m, b: h, c: g } = c(a, r, u), _ = (e) => Math.round(e * 1e4) / 1e4;
-	return _(d) === _(m) && _(f) === _(h) && _(p) === _(g);
-}, A = (e, t) => {
-	let { edge: n } = e, { edge: r } = t, { root: i } = e, { root: o } = t;
-	i = { ...i }, o = { ...o };
-	let c = n || { ...i }, l = r || { ...o }, u = a(i, c), d = a(o, l);
-	return s(o, i) && s(d, u);
-}, j = (e, t) => {
-	let { edge: n } = e, { edge: r } = t, { root: i } = e, { root: a } = t;
-	i = { ...i }, a = { ...a };
-	let c = n || { ...i }, l = r || { ...a }, { a1: u, b1: d } = o(i, c), { a2: f, b2: p } = o(a, l);
-	return s(f, u) && s(p, d);
-}, M = {
-	circle: (e, t) => D(e, t),
-	line: (e, t) => x(e, t),
-	parabola: (e, t) => k(e, t),
-	absolute: (e, t) => A(e, t),
-	exponential: (e, t) => j(e, t),
-	point: (e, t) => m(e, t),
-	polygon: (e, t) => E(e, t),
-	ray: (e, t) => S(e, t),
-	segment: (e, t) => g(e, t),
-	sine: (e, t) => O(e, t),
-	vector: (e, t) => _(e, t)
-}, N = Object.defineProperty, P = /* @__PURE__ */ ((e, t) => {
-	let n = {};
-	for (var r in e) N(n, r, {
-		get: e[r],
-		enumerable: !0
-	});
-	return t || N(n, Symbol.toStringTag, { value: "Module" }), n;
-})({ enabled: () => F });
-function F(e, t, n) {
-	return e?.partialScoring === !1 || t?.partialScoring === !1 ? !1 : typeof n == "boolean" ? n : !0;
-}
-//#endregion
-//#region src/controller/index.ts
-var I = (0, f.default)("@pie-element:graphing:controller"), L = () => ({
-	point: [],
-	segment: [],
-	line: [],
-	ray: [],
-	vector: [],
-	polygon: [],
-	circle: [],
-	sine: [],
-	parabola: [],
-	absolute: [],
-	exponential: []
-}), R = {
-	incorrect: 0,
-	correct: 1,
-	missing: 2
-}, z = (e, t) => !!(e && t && e.type === t.type && M[e.type] && M[e.type](e, t)), B = (e, t) => e.label === t.label ? "correct" : "incorrect", V = ({ sessionAnswers: t, marks: n, withPointLabel: r = !1 }) => {
-	t ||= [], n ||= [];
-	let i = e(t).reduce((e, t) => {
-		let i = n.find((e) => z(t, e));
-		return t.correctness = (i && t.type === "point" && r ? h(t, i) : i) ? "correct" : "incorrect", i && (t.correctnesslabel = B(t, i), t.correctlabel = i.label ? i.label : "", t.label = t.label ? t.label : ""), [...e, t];
-	}, []), a = e(n).reduce((e, n) => t.find((e) => z(n, e)) ? e : [...e, {
-		...n,
-		correctness: "missing"
-	}], []);
-	return [...i, ...a];
-}, H = ({ scoringType: e, env: t }) => {
-	let n = e;
-	return e && (n = e === "partial scoring"), P.enabled({ partialScoring: n }, t);
-}, U = (t, n, i = {}) => {
-	let { answers: a = {}, scoringType: o } = t || {}, { answer: s } = n || {};
-	Object.entries(a || {}).forEach(([e, t]) => a[e] = {
-		...t,
-		marks: t?.marks.filter((e) => !e.building)
-	}), s ||= [], s = s.filter((e) => !e.building), a = r(a) ? { correctAnswer: L() } : {
-		correctAnswer: a.correctAnswer,
-		...v(a)
-	};
-	let c = H({
-		scoringType: o,
-		env: i
-	}), l = d(s, z);
-	return Object.entries(a).reduce((e, t) => {
-		let n = t[0], { marks: r } = t[1] || {};
-		if (!r || !r.length) return e;
-		let i = V({
-			sessionAnswers: l,
-			marks: r
-		}), a = V({
-			sessionAnswers: l,
-			marks: r,
-			withPointLabel: !0
-		}), o = a.filter((e) => e.correctness === "correct"), s = a.filter((e) => e.correctness !== "missing"), u = r.length, d = o.length;
-		return s.length > u && (d -= s.length - u), d < 0 && (d = 0), (d / u > e.bestScore || !e.foundOneSolution) && (c ? e.bestScore = parseFloat((d / u).toFixed(2)) : e.bestScore = Math.floor(d / u), e.bestScoreAnswerKey = n, e.answersCorrected = i, e.foundOneSolution = !0), e;
-	}, {
-		bestScore: 0,
-		bestScoreAnswerKey: null,
-		answersCorrected: e(l).map((e) => ({
-			...e,
-			correctness: "incorrect"
-		})),
-		foundOneSolution: !1
-	});
-}, W = (e) => ({
-	...p,
-	...e
-});
-function G(e, t, n) {
-	return new Promise((i) => {
-		let a = W(e);
-		t ??= {};
-		let { defaultTool: o, extraCSSRules: s, prompt: c, promptEnabled: l, graph: u, answers: d, toolbarTools: f, ...p } = a || {}, { arrows: m } = a, { mode: h, role: g } = n || {};
-		typeof m == "boolean" && (m = m ? {
-			left: !0,
-			right: !0,
-			up: !0,
-			down: !0
-		} : {
-			left: !1,
-			right: !1,
-			up: !1,
-			down: !1
-		});
-		let _ = (f || []).filter((e) => e !== "label"), v = o || _.length && _[0] || "", y = {
-			...p,
-			answers: d,
-			arrows: m,
-			defaultTool: v,
-			disabled: n.mode !== "gather",
-			prompt: l ? c : null,
-			rationale: null,
-			size: u,
-			showKeyLegend: n.mode === "evaluate",
-			showToggle: n.mode === "evaluate" && !r(d) && d.correctAnswer && d.correctAnswer.marks && !r(d.correctAnswer.marks),
-			teacherInstructions: null,
-			toolbarTools: f,
-			extraCSSRules: s
-		};
-		if (g === "instructor" && (h === "view" || h === "evaluate")) {
-			let { rationale: e, rationaleEnabled: t, teacherInstructions: n, teacherInstructionsEnabled: r } = a || {};
-			y.rationale = t ? e : null, y.teacherInstructions = r ? n : null;
-		}
-		if (h === "evaluate") if (!r(d) && d.correctAnswer && d.correctAnswer.marks && !r(d.correctAnswer.marks)) {
-			let { answersCorrected: e, bestScoreAnswerKey: r, bestScore: i } = U(a, t, n);
-			y.answersCorrected = e.sort((e, t) => R[e.correctness] - R[t.correctness]), y.correctResponse = r ? (d[r] || {}).marks : [], y.showToggle = y.showToggle && i !== 1;
-		} else y.answersCorrected = t && t.answer || [], y.correctResponse = [];
-		I("base: ", y), i(y);
-	});
-}
-var K = (e, t, n) => {
-	let r = [], { answers: i = {}, scoringType: a } = e || {}, o = t && t.answer || [];
-	if (!o.length) return ["Student did not interact with the graph."];
-	r.push(`Student added ${o.length} object(s) to the graph.`);
-	let s = H({
-		scoringType: a,
-		env: n
-	}), { answersCorrected: c, bestScore: l, bestScoreAnswerKey: u } = U(e, t, n), d = u && i[u] && i[u].marks || [], f = 0, p = 0, m = 0;
-	for (let e = 0; e < c.length; e++) {
-		let t = c[e].correctness;
-		t === "correct" ? f++ : t === "incorrect" ? p++ : t === "missing" && m++;
-	}
-	if (f > 0 && r.push(`Correct objects: ${f}.`), p > 0 && r.push(`Incorrect objects: ${p}.`), m > 0 && r.push(`Missing required objects: ${m}.`), c.forEach((e, t) => {
-		let n = e.type || "graph object", i = e.label ? `'${e.label}'` : "", a = `with index ${t + 1}`;
-		e.correctness === "correct" && r.push(`${n.charAt(0).toUpperCase() + n.slice(1)} ${i || a} is correct.`), e.correctness === "incorrect" && r.push(`${n.charAt(0).toUpperCase() + n.slice(1)} ${i || a} does not match the expected ${n}.`), e.correctness === "missing" && r.push(`Expected ${n} ${i || a} was not plotted by the student.`);
-	}), o.length > d.length) {
-		let e = o.length - d.length;
-		r.push(`${e} extra object(s) were plotted and are penalized in scoring.`);
-	}
-	return s ? r.push("Score calculated using partial scoring.") : r.push("Score calculated using all-or-nothing scoring."), r.push(`Final score: ${l}.`), r;
-};
-function q(e, t, n = {}) {
-	return new Promise((i) => {
-		(!t || r(t)) && i({
-			score: 0,
-			empty: !0,
-			logTrace: ["Student did not interact with the graph."]
-		}), (n.mode !== "evaluate" || r(e.answers) || e.answers && e.answers.correctAnswer && r(e.answers.correctAnswer.marks)) && i({
-			score: 0,
-			empty: !0,
-			logTrace: ["Student did not interact with the graph."]
-		});
-		let { bestScore: a } = U(e, t, n);
-		i({
-			score: a,
-			empty: !1,
-			logTrace: K(e, t, n)
-		});
-	});
-}
-var J = (e, t) => new Promise((n) => {
-	if (t.mode !== "evaluate" && t.role === "instructor") {
-		let { answers: t } = e || {}, r = [];
-		t && Object.values(t) && (r = (t.correctAnswer || Object.values(t)[0] || {}).marks || []), n({
-			answer: r,
-			id: "1"
-		});
-	} else n(null);
-}), Y = (e) => (e || "").replace(/(<(?!img|iframe|source)([^>]+)>)/gi, ""), X = (e = {}, t = {}) => {
-	let { answers: n, toolbarTools: i } = e, a = {}, o = {};
-	return (i || []).filter((e) => e !== "label").length || (a.toolbarToolsError = "There should be at least 1 tool defined."), [
-		"teacherInstructions",
-		"prompt",
-		"rationale"
-	].forEach((n) => {
-		t[n]?.required && !Y(e[n]) && (a[n] = "This field is required.");
-	}), Object.entries(n || {}).forEach(([e, t]) => {
-		t.marks.length || (o[e] = "At least 1 graph object should be defined."), t.marks.length > 0 && t.marks.forEach((t) => {
-			t.building && (o[e] = "At least 1 graph object is not correctly defined.");
-		});
-	}), r(o) || (a.correctAnswerErrors = o), a;
-};
-//#endregion
-export { B as comparLabelMarks, z as compareMarks, J as createCorrectResponseSession, V as getAnswerCorrected, U as getBestAnswer, K as getLogTrace, G as model, W as normalize, q as outcome, X as validate };
-
-//# sourceMappingURL=index.js.map

package/dist/browser/controller/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","names":[],"sources":["../../../src/controller/defaults.ts","../../../src/controller/utils.ts","../../../../../shared/controller-utils/dist/index.js","../../../src/controller/index.ts"],"sourcesContent":["// @ts-nocheck\n/**\n * @synced-from pie-elements/packages/graphing/controller/src/defaults.js\n * @auto-generated\n *\n * This file is automatically synced from pie-elements and converted to TypeScript.\n * Manual edits will be overwritten on next sync.\n * To make changes, edit the upstream JavaScript file and run sync again.\n */\n\n// TODO: This is lifted from @pie-lib/graphing, however importing this will break a controller build because it has jsx source in that package.\nconst allTools = [\n  'circle',\n  'line',\n  'label',\n  'parabola',\n  'point',\n  'polygon',\n  'ray',\n  'segment',\n  'sine',\n  'vector',\n  // 'absolute', // - not available as default\n  // 'exponential', // - not available as default\n];\n\n/* model defaults */\nexport default {\n  answers: {\n    correctAnswer: {\n      name: 'Correct Answer',\n      marks: [],\n    },\n  },\n  arrows: {\n    left: true,\n    right: true,\n    up: true,\n    down: true,\n  },\n  backgroundMarks: [],\n  coordinatesOnHover: false,\n  defaultGridConfiguration: 0,\n  domain: {\n    min: -5,\n    max: 5,\n    step: 1,\n    labelStep: 1,\n    axisLabel: 'x',\n  },\n  graph: { width: 500, height: 500 },\n  includeAxes: true,\n  labels: {},\n  labelsEnabled: true,\n  padding: true,\n  prompt: '',\n  promptEnabled: true,\n  range: {\n    min: -5,\n    max: 5,\n    step: 1,\n    labelStep: 1,\n    axisLabel: 'y',\n  },\n  rationale: '',\n  rationaleEnabled: true,\n  standardGrid: false,\n  studentInstructionsEnabled: true,\n  teacherInstructions: '',\n  teacherInstructionsEnabled: true,\n  title: '',\n  titleEnabled: true,\n  toolbarTools: allTools,\n};\n","// @ts-nocheck\n/**\n * @synced-from pie-elements/packages/graphing/controller/src/utils.js\n * @auto-generated\n *\n * This file is automatically synced from pie-elements and converted to TypeScript.\n * Manual edits will be overwritten on next sync.\n * To make changes, edit the upstream JavaScript file and run sync again.\n */\n\nimport { differenceWith, isEqual, uniq, uniqWith } from '@pie-element/shared-lodash';\nimport {\n  getAmplitudeAndFreq,\n  pointsToABC,\n  pointsToAForAbsolute,\n  pointsToABForExponential,\n} from '@pie-lib/graphing-utils';\n\nexport const equalPoint = (A, B) => {\n  A = { ...A };\n  B = { ...B };\n\n  return isEqual(A.x, B.x) && isEqual(A.y, B.y);\n};\n\nexport const equalPointWithLabel = (A, B) => {\n  // x1 = x2 & y1 = y2\n  // A point is only correct if both its position AND its label match.\n  // Labels are not scored independently; a point in the correct position\n  // with the wrong label is considered incorrect as a whole.\n  let equalLabel = true;\n\n  A = { ...A };\n  B = { ...B };\n\n  if (A.label || B.label) {\n    equalLabel = isEqual(A.label, B.label);\n  }\n\n  return isEqual(A.x, B.x) && isEqual(A.y, B.y) && equalLabel;\n};\n\nexport const equalSegment = (segment1, segment2) => {\n  // A.from = B.from, A.to = B.to OR A.from = B.to, A.to = B.from\n  // x1 = x3 & y1 = y3 & x2 = x4 & y2 = y4\n  return (\n    (isEqual(segment1.from, segment2.from) && isEqual(segment1.to, segment2.to)) ||\n    (isEqual(segment1.to, segment2.from) && isEqual(segment1.from, segment2.to))\n  );\n};\n\nexport const equalVector = (vector1, vector2) => {\n  // A.from = B.from, A.to = B.to;\n  // x1 = x3 & y1 = y3 & x2 = x4 & y2 = y4\n  return isEqual(vector1.from, vector2.from) && isEqual(vector1.to, vector2.to);\n};\n\n// this function is implemented in configure as well\nexport const sortedAnswers = (answers) =>\n  Object.keys(answers || {})\n    .sort()\n    .reduce((result, key) => {\n      if (key !== 'correctAnswer') {\n        result[key] = answers[key];\n      }\n\n      return result;\n    }, {});\n\nconst returnLineEquationCoefficients = (line) => {\n  line = { ...line, to: { ...line.to }, from: { ...line.from } };\n\n  const xA = line.from.x;\n  const yA = line.from.y;\n  const xB = line.to.x;\n  const yB = line.to.y;\n\n  return {\n    a: yB - yA,\n    b: xA - xB,\n    c: xB * yA - xA * yB,\n  };\n};\n\nconst getSignificantDecimals = (number) => Math.round(number * 10000) / 10000;\n\nexport const equalLine = (line1, line2) => {\n  // line equation: ax + by + c = 0\n  // 2 lines are equal if a1/a2 = b1/b2 = c1/c2, where a, b, c are the coefficients in line equation\n\n  // line equation knowing 2 points: (y - yA) / (yB - yA) = (x - xA) / (xB - xA)\n  // extending this equation, we get: x * (yB - yA) + y * (xA - xB) + (xB * yA - xA * yB) = 0\n  // where a = yB - yA; b = xA - xB; c = xB * yA - xA * yB\n\n  const { a: a1, b: b1, c: c1 } = returnLineEquationCoefficients(line1);\n  const { a: a2, b: b2, c: c2 } = returnLineEquationCoefficients(line2);\n\n  const proportions = [];\n\n  if (a2 !== 0) {\n    proportions.push(getSignificantDecimals(a1 / a2));\n  } else if (a1 !== a2) {\n    return false;\n  }\n\n  if (b2 !== 0) {\n    proportions.push(getSignificantDecimals(b1 / b2));\n  } else if (b1 !== b2) {\n    return false;\n  }\n\n  if (c2 !== 0) {\n    proportions.push(getSignificantDecimals(c1 / c2));\n  } else if (c1 !== c2) {\n    return false;\n  }\n\n  return uniq(proportions).length === 1;\n\n  // (y2 - y1)/(x2 - x1) = (y4 - y3)/(x4 - x3);\n  // return ((Math.abs((line1.to.y - line1.from.y) / (line1.to.x - line1.from.x))) === (Math.abs((line2.to.y - line2.from.y) / (line2.to.x - line2.from.x))));\n};\n\nexport const equalRay = (ray1, ray2) => {\n  ray1 = { ...ray1, to: { ...ray1.to }, from: { ...ray1.from } };\n  ray2 = { ...ray2, to: { ...ray2.to }, from: { ...ray2.from } };\n\n  // slope: m = (y2-y1)/(x2-x1)\n  // slope & x1 = x3 & y1 = y3 & angle between (x1, y1) (x2, y2) is same as angle between (x3, y3) (x4, y4)\n  const mRay1 = (ray1.to.y - ray1.from.y) / (ray1.to.x - ray1.from.x);\n  const mRay2 = (ray2.to.y - ray2.from.y) / (ray2.to.x - ray2.from.x);\n  const angleRay1 = (Math.atan2(ray1.to.y - ray1.from.y, ray1.to.x - ray1.from.x) * 180) / Math.PI;\n  const angleRay2 = (Math.atan2(ray2.to.y - ray2.from.y, ray2.to.x - ray2.from.x) * 180) / Math.PI;\n\n  return mRay1 === mRay2 && ray1.from.x === ray2.from.x && ray1.from.y === ray2.from.y && angleRay1 === angleRay2;\n};\n\nexport const constructSegmentsFromPoints = (points) => {\n  // takes the list of points that represent a polygon and transforms it into a list of segments; eg.:\n  // points: A, B, C, D => segments: AB, BC, CD, DA\n  return (points || []).map((point, index) => ({ from: point, to: points[(index + 1) % points.length] }));\n};\n\nexport const removeDuplicateSegments = (segments) => {\n  segments = segments || [];\n  // removes segments that are duplicates; eg. These segments are the same, so one will be removed:\n  // segment1: from: { x: 1, y: 1 }, to: { x: 2, y: 1 }\n  // segment2: from: { x: 2, y: 1 }, to: { x: 1, y: 1 }\n  return uniqWith(segments, (s1, s2) => equalSegment(s1, s2));\n};\n\nexport const removeInvalidSegments = (segments) => {\n  segments = segments || [];\n  // removes segments that start in a point and end in the same point (eg.: from: { x: 1, y: 1 }, to: { x: 1, y: 1 })\n\n  return segments.filter((segment) => !isEqual(segment.from, segment.to));\n};\n\nexport const equalPolygon = (poly1, poly2) => {\n  const { points: points1 } = poly1;\n  const { points: points2 } = poly2;\n\n  // generate segments\n  const segments1 = constructSegmentsFromPoints(points1);\n  const segments2 = constructSegmentsFromPoints(points2);\n\n  const segments1NoDuplicates = removeDuplicateSegments(removeInvalidSegments(segments1));\n  const segments2NoDuplicates = removeDuplicateSegments(removeInvalidSegments(segments2));\n\n  const differentSegments1 = differenceWith(segments1NoDuplicates, segments2NoDuplicates, equalSegment);\n  const differentSegments2 = differenceWith(segments2NoDuplicates, segments1NoDuplicates, equalSegment);\n\n  return (!differentSegments1 || !differentSegments1.length) && (!differentSegments2 || !differentSegments2.length);\n};\n\nexport const equalCircle = (c1, c2) => {\n  c1 = { ...c1, root: { ...c1.root }, edge: { ...c1.edge } };\n  c2 = { ...c2, root: { ...c2.root }, edge: { ...c2.edge } };\n  const equalRootAndEdge = isEqual(c2.edge, c1.edge) && isEqual(c2.root, c1.root);\n\n  // if both edge and root are the same, it means the shapes are exactly the same\n  if (equalRootAndEdge) return true;\n\n  const rC1 = Math.sqrt((c1.edge.x - c1.root.x) ** 2 + (c1.edge.y - c1.root.y) ** 2);\n  const rC2 = Math.sqrt((c2.edge.x - c2.root.x) ** 2 + (c2.edge.y - c2.root.y) ** 2);\n\n  // if both root and radius are the same, it means the shapes are equal\n  return isEqual(c2.root, c1.root) && isEqual(rC1, rC2);\n};\n\nexport const equalSine = (sine1, sine2) => {\n  const getPoints = ({ root, edge }) => {\n    root = { ...root };\n    edge = { ...edge };\n\n    const { amplitude, freq } = getAmplitudeAndFreq(root, edge);\n    // the height of the sine wave\n    const tY = Math.abs(root.y - edge.y) * 2;\n    // the distance on x axis between edge and root\n    const tXRoot = Math.abs(root.x - edge.x);\n    // the distance on x axis between 2 edges for sine wave (min & max)\n    const tX = tXRoot * 2;\n    // the first edge placed east side of root\n    let edgeAboveZeroX = edge.x;\n    let edgeAboveZeroY = edge.y;\n\n    // if edge less then 0, find out the appropriate edge placed east side of zero (0)\n    while (edgeAboveZeroX < 0 && tX !== 0) {\n      edgeAboveZeroX = edgeAboveZeroX + tX;\n      edgeAboveZeroY = edgeAboveZeroY < root.y ? edgeAboveZeroY + tY : edgeAboveZeroY - tY;\n    }\n\n    // if edge more then 0, find out the appropriate edge placed east side of zero (0)\n    while (edgeAboveZeroX - tX > 0 && tX !== 0) {\n      edgeAboveZeroX = edgeAboveZeroX - tX;\n      edgeAboveZeroY = edgeAboveZeroY < root.y ? edgeAboveZeroY + tY : edgeAboveZeroY - tY;\n    }\n\n    return {\n      amplitude: getSignificantDecimals(amplitude),\n      freq: getSignificantDecimals(freq),\n      min: getSignificantDecimals(edge.y < root.y ? edge.y : edge.y - tY),\n      max: getSignificantDecimals(edge.y < root.y ? edge.y + tY : edge.y),\n      edgeAboveZeroX: getSignificantDecimals(edgeAboveZeroX),\n      edgeAboveZeroY: getSignificantDecimals(edgeAboveZeroY),\n    };\n  };\n\n  const studentAnswerBpY = getPoints(sine1);\n  const correctAnswerBpY = getPoints(sine2);\n\n  const {\n    amplitude: amplitude1,\n    freq: freq1,\n    min: min1,\n    max: max1,\n    edgeAboveZeroX: edgeAboveZeroX1,\n    edgeAboveZeroY: edgeAboveZeroY1,\n  } = studentAnswerBpY;\n  const {\n    amplitude: amplitude2,\n    freq: freq2,\n    min: min2,\n    max: max2,\n    edgeAboveZeroX: edgeAboveZeroX2,\n    edgeAboveZeroY: edgeAboveZeroY2,\n  } = correctAnswerBpY;\n\n  return (\n    Math.abs(amplitude1) === Math.abs(amplitude2) &&\n    Math.abs(freq1) === Math.abs(freq2) &&\n    min1 === min2 &&\n    max1 === max2 &&\n    edgeAboveZeroX1 === edgeAboveZeroX2 &&\n    edgeAboveZeroY1 === edgeAboveZeroY2\n  );\n  // rootDiff1 === rootDiff2);\n};\n\nexport const equalParabola = (p1, p2) => {\n  const { edge: edgeP1 } = p1;\n  const { edge: edgeP2 } = p2;\n  let { root: rootP1 } = p1;\n  let { root: rootP2 } = p2;\n\n  rootP1 = { ...rootP1 };\n  rootP2 = { ...rootP2 };\n\n  const p1edge = edgeP1 || { ...rootP1 };\n  const p2edge = edgeP2 || { ...rootP2 };\n\n  const p1mirrorEdge = { x: rootP1.x - (p1edge.x - rootP1.x), y: p1edge.y };\n  const p2mirrorEdge = { x: rootP2.x - (p2edge.x - rootP2.x), y: p2edge.y };\n\n  if (!edgeP1 || !edgeP2) return false;\n\n  const { a: a1, b: b1, c: c1 } = pointsToABC(rootP1, edgeP1, p1mirrorEdge);\n  const { a: a2, b: b2, c: c2 } = pointsToABC(rootP2, edgeP2, p2mirrorEdge);\n\n  // sometimes numbers have this form: 1.00000000002 because of calculations, we have to round them\n  const round = (number) => Math.round(number * 10000) / 10000;\n\n  return round(a1) === round(a2) && round(b1) === round(b2) && round(c1) === round(c2);\n};\n\n/*\n * Function to check if given two points for absolute function\n * for correct answer and student answer are equal or not.\n * @param p1 - student answer\n * @param p2 - correct answer\n * */\nexport const equalAbsolute = (p1, p2) => {\n  const { edge: edgeP1 } = p1;\n  const { edge: edgeP2 } = p2;\n  let { root: rootP1 } = p1;\n  let { root: rootP2 } = p2;\n\n  rootP1 = { ...rootP1 };\n  rootP2 = { ...rootP2 };\n\n  const p1edge = edgeP1 || { ...rootP1 };\n  const p2edge = edgeP2 || { ...rootP2 };\n\n  const p1a1 = pointsToAForAbsolute(rootP1, p1edge);\n  const p2a2 = pointsToAForAbsolute(rootP2, p2edge);\n\n  // if both root and a value are equal\n  return isEqual(rootP2, rootP1) && isEqual(p2a2, p1a1);\n};\n\n/*\n * Function to check if given two points for exponential function\n * for correct answer and student answer are equal or not.\n * @param p1 - student answer\n * @param p2 - correct answer\n * */\nexport const equalExponential = (p1, p2) => {\n  const { edge: edgeP1 } = p1;\n  const { edge: edgeP2 } = p2;\n  let { root: rootP1 } = p1;\n  let { root: rootP2 } = p2;\n\n  rootP1 = { ...rootP1 };\n  rootP2 = { ...rootP2 };\n\n  const p1edge = edgeP1 || { ...rootP1 };\n  const p2edge = edgeP2 || { ...rootP2 };\n\n  const { a1, b1 } = pointsToABForExponential(rootP1, p1edge);\n  const { a2, b2 } = pointsToABForExponential(rootP2, p2edge);\n\n  // if both a and b value are equal\n  return isEqual(a2, a1) && isEqual(b2, b1);\n};\n\nexport const equalMarks = {\n  circle: (sessAnswer, mark) => equalCircle(sessAnswer, mark),\n  line: (sessAnswer, mark) => equalLine(sessAnswer, mark),\n  parabola: (sessAnswer, mark) => equalParabola(sessAnswer, mark),\n  absolute: (sessAnswer, mark) => equalAbsolute(sessAnswer, mark),\n  exponential: (sessAnswer, mark) => equalExponential(sessAnswer, mark),\n  point: (sessAnswer, mark) => equalPoint(sessAnswer, mark),\n  polygon: (sessAnswer, poly) => equalPolygon(sessAnswer, poly),\n  ray: (sessAnswer, mark) => equalRay(sessAnswer, mark),\n  segment: (sessAnswer, mark) => equalSegment(sessAnswer, mark),\n  sine: (sessAnswer, mark) => equalSine(sessAnswer, mark),\n  vector: (sessAnswer, mark) => equalVector(sessAnswer, mark),\n};\n\nconst completePoint = (point) => point && Number.isFinite(point.x) && Number.isFinite(point.y);\nconst completeFromTo = (item) => item && completeMark.point(item.from) && completeMark.point(item.to);\nconst completeRootEdge = (item) => item && completeMark.point(item.edge) && completeMark.point(item.root);\nconst completePoints = (item) =>\n  item &&\n  item.points &&\n  item.points.length &&\n  (item.points.filter((point) => completePoint(point)) || []).length === item.points.length;\n\nconst completeMark = {\n  point: completePoint,\n  line: completeFromTo,\n  ray: completeFromTo,\n  segment: completeFromTo,\n  vector: completeFromTo,\n  circle: completeRootEdge,\n  parabola: completeRootEdge,\n  absolute: completeRootEdge,\n  exponential: completeRootEdge,\n  sine: completeRootEdge,\n  polygon: completePoints,\n};\n","//#region \\0rolldown/runtime.js\nvar e = Object.defineProperty, t = (t, n) => {\n\tlet r = {};\n\tfor (var i in t) e(r, i, {\n\t\tget: t[i],\n\t\tenumerable: !0\n\t});\n\treturn n || e(r, Symbol.toStringTag, { value: \"Module\" }), r;\n};\n//#endregion\n//#region src/persistence.ts\nfunction n(e) {\n\treturn Array.isArray(e) ? e.filter((e) => e != null) : [];\n}\nfunction r(e) {\n\tlet t = [...e];\n\tfor (let e = t.length - 1; e > 0; e--) {\n\t\tlet n = Math.floor(Math.random() * (e + 1));\n\t\t[t[e], t[n]] = [t[n], t[e]];\n\t}\n\treturn t;\n}\nfunction i(e) {\n\treturn e == null ? !0 : Array.isArray(e) ? e.length === 0 : typeof e == \"object\" ? Object.keys(e).length === 0 : !1;\n}\nasync function a(e, t, a, o = \"value\") {\n\tlet s = n(t?.data?.shuffledValues ?? t?.shuffledValues ?? []);\n\tif (!t) {\n\t\tconsole.warn(\"Unable to save shuffled choices because there's no session.\");\n\t\treturn;\n\t}\n\tif (!i(s)) return n(s.map((t) => e.find((e) => e[o] === t)));\n\tlet c = r(e);\n\tif (a && typeof a == \"function\") try {\n\t\tlet e = n(c.map((e) => e[o]));\n\t\ti(e) ? console.error(`shuffledValues is an empty array - refusing to call updateSession. shuffledChoices: ${JSON.stringify(c)}, key: ${o}`) : t.id && t.element && await a(t.id, t.element, { shuffledValues: e });\n\t} catch (e) {\n\t\tconsole.warn(\"Unable to save shuffled order for choices\"), console.error(e);\n\t}\n\telse console.warn(\"Unable to save shuffled choices, shuffle will happen every time.\");\n\treturn c;\n}\nfunction o(e, t, n) {\n\treturn !!(e.lockChoiceOrder || n[\"@pie-element\"]?.lockChoiceOrder || (n.role ?? \"student\") === \"instructor\");\n}\n//#endregion\n//#region src/partial-scoring.ts\nvar s = /* @__PURE__ */ t({ enabled: () => c });\nfunction c(e, t, n) {\n\treturn e?.partialScoring === !1 || t?.partialScoring === !1 ? !1 : typeof n == \"boolean\" ? n : !0;\n}\n//#endregion\nexport { a as getShuffledChoices, o as lockChoices, s as partialScoring };\n","// @ts-nocheck\n/**\n * @synced-from pie-elements/packages/graphing/controller/src/index.js\n * @auto-generated\n *\n * This file is automatically synced from pie-elements and converted to TypeScript.\n * Manual edits will be overwritten on next sync.\n * To make changes, edit the upstream JavaScript file and run sync again.\n */\n\nimport debug from 'debug';\n\nimport { cloneDeep, isEmpty, uniqWith } from '@pie-element/shared-lodash';\nimport defaults from './defaults.js';\nimport { equalMarks, equalPointWithLabel, sortedAnswers } from './utils.js';\n\nimport { partialScoring } from '@pie-element/shared-controller-utils';\n\nconst log = debug('@pie-element:graphing:controller');\n\nconst initializeGraphMap = () => ({\n  point: [],\n  segment: [],\n  line: [],\n  ray: [],\n  vector: [],\n  polygon: [],\n  circle: [],\n  sine: [],\n  parabola: [],\n  absolute: [],\n  exponential: [],\n});\n\nconst graphObjectsOrder = {\n  incorrect: 0,\n  correct: 1,\n  missing: 2,\n};\n\nexport const compareMarks = (mark1, mark2) => {\n  // marks can be compared with equalMarks[type] function only if they have the same type;\n  // if type is different, they are clearly not equal\n  return !!(\n    mark1 &&\n    mark2 &&\n    mark1.type === mark2.type &&\n    equalMarks[mark1.type] &&\n    equalMarks[mark1.type](mark1, mark2)\n  );\n};\n\nexport const comparLabelMarks = (mark1, mark2) => {\n  return mark1.label === mark2.label ? 'correct' : 'incorrect';\n};\n\nexport const getAnswerCorrected = ({ sessionAnswers, marks: correctAnswers, withPointLabel = false }) => {\n  sessionAnswers = sessionAnswers || [];\n  correctAnswers = correctAnswers || [];\n\n  const rez = cloneDeep(sessionAnswers).reduce((correctedAnswer, answer) => {\n    const answerIsCorrect = correctAnswers.find((mark) => compareMarks(answer, mark));\n\n    // For scoring points, check if both position AND label match\n    const isCorrectForScoring = answerIsCorrect && answer.type === 'point' && withPointLabel \n      ? equalPointWithLabel(answer, answerIsCorrect)\n      : !!answerIsCorrect;\n\n    answer.correctness = isCorrectForScoring ? 'correct' : 'incorrect';\n    if (answerIsCorrect) {\n      answer.correctnesslabel = comparLabelMarks(answer, answerIsCorrect);\n      answer.correctlabel = answerIsCorrect.label ? answerIsCorrect.label : '';\n      answer.label = answer.label ? answer.label : '';\n    }\n    return [...correctedAnswer, answer];\n  }, []);\n\n  // add missing objects from correct answer\n  const missingAnswers = cloneDeep(correctAnswers).reduce((correctedAnswer, answer) => {\n    const answerIndex = sessionAnswers.find((mark) => compareMarks(answer, mark));\n\n    if (!answerIndex) {\n      // means that corrected answer is missing from session, so we mark it as missing object\n      return [...correctedAnswer, { ...answer, correctness: 'missing' }];\n    }\n\n    return correctedAnswer;\n  }, []);\n\n  return [...rez, ...missingAnswers];\n};\n\nconst getPartialScoring = ({ scoringType, env }) => {\n  let pS = scoringType;\n\n  // if scoringType is undefined, partialScoring should be considered undefined (not set)\n  // because partialScoring.enabled is using that information\n  // if it has a value, we check if it is partial scoring or dichotomous\n  if (scoringType) {\n    pS = scoringType === 'partial scoring';\n  }\n\n  return partialScoring.enabled({ partialScoring: pS }, env);\n};\n\nexport const getBestAnswer = (question, session, env = {}) => {\n  // questionPossibleAnswers contains all possible answers (correct response and alternates);\n  let { answers: questionPossibleAnswers = {}, scoringType } = question || {};\n  let { answer } = session || {};\n\n  // filter the incomplete objects\n  Object.entries(questionPossibleAnswers || {}).forEach(\n    ([key, value]) =>\n      (questionPossibleAnswers[key] = { ...value, marks: value?.marks.filter((mark) => !mark.building) }),\n  );\n\n  // initialize answer if no values\n  answer = answer || [];\n\n  //filter the incomplete objects for student response - Fix for SC-33160\n  answer = answer.filter((mark) => !mark.building);\n\n  // initialize one possible answer if no values\n  if (isEmpty(questionPossibleAnswers)) {\n    questionPossibleAnswers = { correctAnswer: initializeGraphMap() };\n  } else {\n    questionPossibleAnswers = {\n      correctAnswer: questionPossibleAnswers.correctAnswer,\n      ...sortedAnswers(questionPossibleAnswers),\n    };\n  }\n\n  const partialScoringEnabled = getPartialScoring({ scoringType, env });\n\n  // student's answers without DUPLICATES\n  const sessionAnswers = uniqWith(answer, compareMarks);\n  // array of possible answers entries\n  const possibleAnswers = Object.entries(questionPossibleAnswers);\n\n  return possibleAnswers.reduce(\n    (acc, entry) => {\n      // iterating each possible answer (main + alternates)\n      const possibleAnswerKey = entry[0];\n      const possibleAnswer = entry[1] || {};\n      let { marks } = possibleAnswer;\n\n      if (!marks || !marks.length) {\n        return acc;\n      }\n\n      // returns array of marks, each having 'correctness' property\n      const correctedAnswer = getAnswerCorrected({ sessionAnswers, marks });\n      const correctedAnswerWithLabels = getAnswerCorrected({ sessionAnswers, marks, withPointLabel: true });\n      const correctMarks = correctedAnswerWithLabels.filter((answer) => answer.correctness === 'correct');\n      // filter out missing objects because they do not affect the calculation of the score\n      // only correct and incorrect are needed\n      const scoredCorrectedAnswer = correctedAnswerWithLabels.filter((answer) => answer.correctness !== 'missing');\n\n      const maxScore = marks.length;\n      let score = correctMarks.length;\n\n      // if extra placements\n      if (scoredCorrectedAnswer.length > maxScore) {\n        score -= scoredCorrectedAnswer.length - maxScore;\n      }\n\n      if (score < 0) {\n        score = 0;\n      }\n\n      if (score / maxScore > acc.bestScore || !acc.foundOneSolution) {\n        if (partialScoringEnabled) {\n          acc.bestScore = parseFloat((score / maxScore).toFixed(2));\n        } else {\n          acc.bestScore = Math.floor(score / maxScore);\n        }\n\n        acc.bestScoreAnswerKey = possibleAnswerKey;\n        acc.answersCorrected = correctedAnswer;\n        acc.foundOneSolution = true;\n      }\n\n      return acc;\n    },\n    {\n      bestScore: 0,\n      bestScoreAnswerKey: null,\n      // initially we just suppose all the answers are incorrect\n      answersCorrected: cloneDeep(sessionAnswers).map((answer) => ({ ...answer, correctness: 'incorrect' })),\n      foundOneSolution: false,\n    },\n  );\n};\n\nexport const normalize = (question) => ({ ...defaults, ...question });\n\nexport function model(question, session, env) {\n  return new Promise((resolve) => {\n    const normalizedQuestion = normalize(question);\n\n    // added a sanity check for session for environments where it is not passed initially (ex. pie-website)\n    if (session === undefined || session === null) {\n      session = {};\n    }\n    // console.log('normalizedQuestion', normalizedQuestion);\n    const { defaultTool, extraCSSRules, prompt, promptEnabled, graph, answers, toolbarTools, ...questionProps } =\n      normalizedQuestion || {};\n    let { arrows } = normalizedQuestion;\n    const { mode, role } = env || {};\n\n    // This is used for offering support for old models which have the property arrows: boolean\n    // Same thing is set in authoring : packages/graphing/configure/src/configure.jsx - componentDidMount\n    if (typeof arrows === 'boolean') {\n      if (arrows) {\n        arrows = {\n          left: true,\n          right: true,\n          up: true,\n          down: true,\n        };\n      } else {\n        arrows = {\n          left: false,\n          right: false,\n          up: false,\n          down: false,\n        };\n      }\n    }\n\n    // added support for models without defaultTool defined; also used in packages/graphing/configure/src/index.js\n    const toolbarToolsNoLabel = (toolbarTools || []).filter((tool) => tool !== 'label');\n    const normalizedDefaultTool = defaultTool || (toolbarToolsNoLabel.length && toolbarToolsNoLabel[0]) || '';\n\n    const base = {\n      ...questionProps,\n      answers,\n      arrows,\n      defaultTool: normalizedDefaultTool,\n      disabled: env.mode !== 'gather',\n      prompt: promptEnabled ? prompt : null,\n      rationale: null,\n      size: graph,\n      showKeyLegend: env.mode === 'evaluate',\n      showToggle:\n        env.mode === 'evaluate' &&\n        !isEmpty(answers) &&\n        answers.correctAnswer &&\n        answers.correctAnswer.marks &&\n        !isEmpty(answers.correctAnswer.marks),\n      teacherInstructions: null,\n      toolbarTools,\n      extraCSSRules,\n    };\n\n    if (role === 'instructor' && (mode === 'view' || mode === 'evaluate')) {\n      const { rationale, rationaleEnabled, teacherInstructions, teacherInstructionsEnabled } = normalizedQuestion || {};\n\n      base.rationale = rationaleEnabled ? rationale : null;\n      base.teacherInstructions = teacherInstructionsEnabled ? teacherInstructions : null;\n    }\n\n    if (mode === 'evaluate') {\n      if (\n        !isEmpty(answers) &&\n        answers.correctAnswer &&\n        answers.correctAnswer.marks &&\n        !isEmpty(answers.correctAnswer.marks)\n      ) {\n        const { answersCorrected, bestScoreAnswerKey, bestScore } = getBestAnswer(normalizedQuestion, session, env);\n        // array of marks from session with 'correctness' property set\n        base.answersCorrected = answersCorrected.sort(\n          (a, b) => graphObjectsOrder[a.correctness] - graphObjectsOrder[b.correctness],\n        );\n        base.correctResponse = bestScoreAnswerKey ? (answers[bestScoreAnswerKey] || {}).marks : [];\n        base.showToggle = base.showToggle && bestScore !== 1;\n      } else {\n        base.answersCorrected = (session && session.answer) || [];\n        base.correctResponse = [];\n      }\n    }\n\n    log('base: ', base);\n    resolve(base);\n  });\n}\n\n  /**\n * Generates detailed trace log for scoring evaluation\n * @param {Object} model - the question model\n * @param {Object} session - the student session\n * @param {Object} env - the environment\n * @returns {Array} traceLog - array of trace messages\n */\nexport const getLogTrace = (question, session, env) => {\n  const traceLog = [];\n  const { answers = {}, scoringType } = question || {};\n  const studentMarks = (session && session.answer) || [];\n\n  if (!studentMarks.length) {\n    return ['Student did not interact with the graph.'];\n  }\n\n  traceLog.push(`Student added ${studentMarks.length} object(s) to the graph.`);\n\n  const partialScoringEnabled = getPartialScoring({ scoringType, env });\n\n  const {\n    answersCorrected,\n    bestScore,\n    bestScoreAnswerKey,\n  } = getBestAnswer(question, session, env);\n\n  const correctResponse =\n    bestScoreAnswerKey && answers[bestScoreAnswerKey]\n      ? answers[bestScoreAnswerKey].marks || []\n      : [];\n\n  let correctCount = 0;\n  let incorrectCount = 0;\n  let missingCount = 0;\n\n  for (let i = 0; i < answersCorrected.length; i++) {\n    const c = answersCorrected[i].correctness;\n    if (c === 'correct') correctCount++;\n    else if (c === 'incorrect') incorrectCount++;\n    else if (c === 'missing') missingCount++;\n  }\n\n  if (correctCount > 0) {\n    traceLog.push(`Correct objects: ${correctCount}.`);\n  }\n\n  if (incorrectCount > 0) {\n    traceLog.push(`Incorrect objects: ${incorrectCount}.`);\n  }\n\n  if (missingCount > 0) {\n    traceLog.push(`Missing required objects: ${missingCount}.`);\n  }\n\n  answersCorrected.forEach((mark, index) => {\n    const objectType = mark.type || 'graph object';\n    const objectLabel = mark.label ? `'${mark.label}'` : '';\n    const objectIndex = `with index ${index + 1}`;\n\n    if (mark.correctness === 'correct') {\n      traceLog.push(\n        `${objectType.charAt(0).toUpperCase() + objectType.slice(1)} ${objectLabel || objectIndex} is correct.`\n      );\n    }\n\n    if (mark.correctness === 'incorrect') {\n      traceLog.push(\n        `${objectType.charAt(0).toUpperCase() + objectType.slice(1)} ${objectLabel || objectIndex} does not match the expected ${objectType}.`\n      );\n    }\n\n    if (mark.correctness === 'missing') {\n      traceLog.push(`Expected ${objectType} ${objectLabel || objectIndex} was not plotted by the student.`);\n    }\n  });\n\n  if (studentMarks.length > correctResponse.length) {\n    const extra = studentMarks.length - correctResponse.length;\n    traceLog.push(`${extra} extra object(s) were plotted and are penalized in scoring.`);\n  }\n\n  if (partialScoringEnabled) {\n    traceLog.push('Score calculated using partial scoring.');\n  } else {\n    traceLog.push('Score calculated using all-or-nothing scoring.');\n  }\n\n  traceLog.push(`Final score: ${bestScore}.`);\n\n  return traceLog;\n};\n\n\nexport function outcome(question, session, env = {}) {\n  return new Promise((resolve) => {\n    if (!session || isEmpty(session)) {\n      resolve({ score: 0, empty: true, logTrace: ['Student did not interact with the graph.'] });\n    }\n\n    if (\n      env.mode !== 'evaluate' ||\n      isEmpty(question.answers) ||\n      (question.answers && question.answers.correctAnswer && isEmpty(question.answers.correctAnswer.marks))\n    ) {\n      resolve({ score: 0, empty: true, logTrace: ['Student did not interact with the graph.'] });\n    }\n\n    const { bestScore } = getBestAnswer(question, session, env);\n\n    resolve({ score: bestScore, empty: false, logTrace: getLogTrace(question, session, env) });\n  });\n}\n\nexport const createCorrectResponseSession = (question, env) => {\n  return new Promise((resolve) => {\n    if (env.mode !== 'evaluate' && env.role === 'instructor') {\n      const { answers } = question || {};\n      let marks = [];\n\n      if (answers && Object.values(answers)) {\n        const correctAnswer = answers.correctAnswer || Object.values(answers)[0] || {};\n        marks = correctAnswer.marks || [];\n      }\n\n      resolve({\n        answer: marks,\n        id: '1',\n      });\n    } else {\n      resolve(null);\n    }\n  });\n};\n\n// remove all html tags\nconst getInnerText = (html) => (html || '').replaceAll(/<[^>]*>/g, '');\n\n// remove all html tags except img, iframe and source tag for audio\nconst getContent = (html) => (html || '').replace(/(<(?!img|iframe|source)([^>]+)>)/gi, '');\n\nexport const validate = (model = {}, config = {}) => {\n  const { answers, toolbarTools } = model;\n  const errors = {};\n  const correctAnswerErrors = {};\n  const toolbarToolsNoLabel = (toolbarTools || []).filter((tool) => tool !== 'label');\n\n  if (!toolbarToolsNoLabel.length) {\n    errors.toolbarToolsError = 'There should be at least 1 tool defined.';\n  }\n\n  ['teacherInstructions', 'prompt', 'rationale'].forEach((field) => {\n    if (config[field]?.required && !getContent(model[field])) {\n      errors[field] = 'This field is required.';\n    }\n  });\n\n  Object.entries(answers || {}).forEach(([key, value]) => {\n    if (!value.marks.length) {\n      correctAnswerErrors[key] = 'At least 1 graph object should be defined.';\n    }\n\n    // check if all graph objects are correctly defined with respect to root, edge and from, to\n    if (value.marks.length > 0) {\n      value.marks.forEach((mark) => {\n        if (mark.building) {\n          correctAnswerErrors[key] = 'At least 1 graph object is not correctly defined.';\n        }\n      });\n    }\n  });\n\n  if (!isEmpty(correctAnswerErrors)) {\n    errors.correctAnswerErrors = correctAnswerErrors;\n  }\n\n  return errors;\n};\n"],"mappings":";;mCA2BA,IAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA8CA,GCvDa,KAAc,GAAG,OAC5B,IAAI,EAAE,GAAG,EAAE,GACX,IAAI,EAAE,GAAG,EAAE,GAEJ,EAAQ,EAAE,GAAG,EAAE,CAAC,KAAK,EAAQ,EAAE,GAAG,EAAE,CAAC,IAGjC,KAAuB,GAAG,MAAM;CAK3C,IAAI,IAAa;CASjB,OAPA,IAAI,EAAE,GAAG,EAAE,GACX,IAAI,EAAE,GAAG,EAAE,IAEP,EAAE,SAAS,EAAE,WACf,IAAa,EAAQ,EAAE,OAAO,EAAE,KAAK,IAGhC,EAAQ,EAAE,GAAG,EAAE,CAAC,KAAK,EAAQ,EAAE,GAAG,EAAE,CAAC,KAAK;AACnD,GAEa,KAAgB,GAAU,MAIlC,EAAQ,EAAS,MAAM,EAAS,IAAI,KAAK,EAAQ,EAAS,IAAI,EAAS,EAAE,KACzE,EAAQ,EAAS,IAAI,EAAS,IAAI,KAAK,EAAQ,EAAS,MAAM,EAAS,EAAE,GAIjE,KAAe,GAAS,MAG5B,EAAQ,EAAQ,MAAM,EAAQ,IAAI,KAAK,EAAQ,EAAQ,IAAI,EAAQ,EAAE,GAIjE,KAAiB,MAC5B,OAAO,KAAK,KAAW,CAAC,CAAC,EACtB,KAAK,EACL,QAAQ,GAAQ,OACX,MAAQ,oBACV,EAAO,KAAO,EAAQ,KAGjB,IACN,CAAC,CAAC,GAEH,KAAkC,MAAS;CAC/C,IAAO;EAAE,GAAG;EAAM,IAAI,EAAE,GAAG,EAAK,GAAG;EAAG,MAAM,EAAE,GAAG,EAAK,KAAK;CAAE;CAE7D,IAAM,IAAK,EAAK,KAAK,GACf,IAAK,EAAK,KAAK,GACf,IAAK,EAAK,GAAG,GACb,IAAK,EAAK,GAAG;CAEnB,OAAO;EACL,GAAG,IAAK;EACR,GAAG,IAAK;EACR,GAAG,IAAK,IAAK,IAAK;CACpB;AACF,GAEM,KAA0B,MAAW,KAAK,MAAM,IAAS,GAAK,IAAI,KAE3D,KAAa,GAAO,MAAU;CAQzC,IAAM,EAAE,GAAG,GAAI,GAAG,GAAI,GAAG,MAAO,EAA+B,CAAK,GAC9D,EAAE,GAAG,GAAI,GAAG,GAAO,MAAO,EAA+B,CAAK,GAE9D,IAAc,CAAC;CAErB,IAAI,MAAO,GACT,EAAY,KAAK,EAAuB,IAAK,CAAE,CAAC;MAC3C,IAAI,MAAO,GAChB,OAAO;CAGT,IAAI,MAAO,GACT,EAAY,KAAK,EAAuB,IAAK,CAAE,CAAC;MAC3C,IAAI,MAAO,GAChB,OAAO;CAGT,IAAI,MAAO,GACT,EAAY,KAAK,EAAuB,IAAK,CAAE,CAAC;MAC3C,IAAI,MAAO,GAChB,OAAO;CAGT,OAAO,EAAK,CAAW,EAAE,WAAW;AAItC,GAEa,KAAY,GAAM,MAAS;CAEtC,AADA,IAAO;EAAE,GAAG;EAAM,IAAI,EAAE,GAAG,EAAK,GAAG;EAAG,MAAM,EAAE,GAAG,EAAK,KAAK;CAAE,GAC7D,IAAO;EAAE,GAAG;EAAM,IAAI,EAAE,GAAG,EAAK,GAAG;EAAG,MAAM,EAAE,GAAG,EAAK,KAAK;CAAE;CAI7D,IAAM,KAAS,EAAK,GAAG,IAAI,EAAK,KAAK,MAAM,EAAK,GAAG,IAAI,EAAK,KAAK,IAC3D,KAAS,EAAK,GAAG,IAAI,EAAK,KAAK,MAAM,EAAK,GAAG,IAAI,EAAK,KAAK,IAC3D,IAAa,KAAK,MAAM,EAAK,GAAG,IAAI,EAAK,KAAK,GAAG,EAAK,GAAG,IAAI,EAAK,KAAK,CAAC,IAAI,MAAO,KAAK,IACxF,IAAa,KAAK,MAAM,EAAK,GAAG,IAAI,EAAK,KAAK,GAAG,EAAK,GAAG,IAAI,EAAK,KAAK,CAAC,IAAI,MAAO,KAAK;CAE9F,OAAO,MAAU,KAAS,EAAK,KAAK,MAAM,EAAK,KAAK,KAAK,EAAK,KAAK,MAAM,EAAK,KAAK,KAAK,MAAc;AACxG,GAEa,KAA+B,OAGlC,KAAU,CAAC,GAAG,KAAK,GAAO,OAAW;CAAE,MAAM;CAAO,IAAI,GAAQ,IAAQ,KAAK,EAAO;AAAQ,EAAE,GAG3F,KAA2B,OACtC,MAAuB,CAAC,GAIjB,EAAS,IAAW,GAAI,MAAO,EAAa,GAAI,CAAE,CAAC,IAG/C,KAAyB,OACpC,MAAuB,CAAC,GAGjB,EAAS,QAAQ,MAAY,CAAC,EAAQ,EAAQ,MAAM,EAAQ,EAAE,CAAC,IAG3D,KAAgB,GAAO,MAAU;CAC5C,IAAM,EAAE,QAAQ,MAAY,GACtB,EAAE,QAAQ,MAAY,GAGtB,IAAY,EAA4B,CAAO,GAC/C,IAAY,EAA4B,CAAO,GAE/C,IAAwB,EAAwB,EAAsB,CAAS,CAAC,GAChF,IAAwB,EAAwB,EAAsB,CAAS,CAAC,GAEhF,IAAqB,EAAe,GAAuB,GAAuB,CAAY,GAC9F,IAAqB,EAAe,GAAuB,GAAuB,CAAY;CAEpG,QAAQ,CAAC,KAAsB,CAAC,EAAmB,YAAY,CAAC,KAAsB,CAAC,EAAmB;AAC5G,GAEa,KAAe,GAAI,MAAO;CAMrC,IALA,IAAK;EAAE,GAAG;EAAI,MAAM,EAAE,GAAG,EAAG,KAAK;EAAG,MAAM,EAAE,GAAG,EAAG,KAAK;CAAE,GACzD,IAAK;EAAE,GAAG;EAAI,MAAM,EAAE,GAAG,EAAG,KAAK;EAAG,MAAM,EAAE,GAAG,EAAG,KAAK;CAAE,GAChC,EAAQ,EAAG,MAAM,EAAG,IAAI,KAAK,EAAQ,EAAG,MAAM,EAAG,IAAI,GAGxD,OAAO;CAE7B,IAAM,IAAM,KAAK,MAAM,EAAG,KAAK,IAAI,EAAG,KAAK,MAAM,KAAK,EAAG,KAAK,IAAI,EAAG,KAAK,MAAM,CAAC,GAC3E,IAAM,KAAK,MAAM,EAAG,KAAK,IAAI,EAAG,KAAK,MAAM,KAAK,EAAG,KAAK,IAAI,EAAG,KAAK,MAAM,CAAC;CAGjF,OAAO,EAAQ,EAAG,MAAM,EAAG,IAAI,KAAK,EAAQ,GAAK,CAAG;AACtD,GAEa,KAAa,GAAO,MAAU;CACzC,IAAM,KAAa,EAAE,SAAM,cAAW;EAEpC,AADA,IAAO,EAAE,GAAG,EAAK,GACjB,IAAO,EAAE,GAAG,EAAK;EAEjB,IAAM,EAAE,cAAW,YAAS,EAAoB,GAAM,CAAI,GAEpD,IAAK,KAAK,IAAI,EAAK,IAAI,EAAK,CAAC,IAAI,GAIjC,IAFS,KAAK,IAAI,EAAK,IAAI,EAAK,CAE3B,IAAS,GAEhB,IAAiB,EAAK,GACtB,IAAiB,EAAK;EAG1B,OAAO,IAAiB,KAAK,MAAO,IAElC,AADA,KAAkC,GAClC,IAAiB,IAAiB,EAAK,IAAI,IAAiB,IAAK,IAAiB;EAIpF,OAAO,IAAiB,IAAK,KAAK,MAAO,IAEvC,AADA,KAAkC,GAClC,IAAiB,IAAiB,EAAK,IAAI,IAAiB,IAAK,IAAiB;EAGpF,OAAO;GACL,WAAW,EAAuB,CAAS;GAC3C,MAAM,EAAuB,CAAI;GACjC,KAAK,EAAuB,EAAK,IAAI,EAAK,IAAI,EAAK,IAAI,EAAK,IAAI,CAAE;GAClE,KAAK,EAAuB,EAAK,IAAI,EAAK,IAAI,EAAK,IAAI,IAAK,EAAK,CAAC;GAClE,gBAAgB,EAAuB,CAAc;GACrD,gBAAgB,EAAuB,CAAc;EACvD;CACF,GAEM,IAAmB,EAAU,CAAK,GAClC,IAAmB,EAAU,CAAK,GAElC,EACJ,WAAW,GACX,MAAM,GACN,KAAK,GACL,KAAK,GACL,gBAAgB,GAChB,gBAAgB,MACd,GACE,EACJ,WAAW,GACX,MAAM,GACN,KAAK,GACL,KAAK,GACL,gBAAgB,GAChB,gBAAgB,MACd;CAEJ,OACE,KAAK,IAAI,CAAU,MAAM,KAAK,IAAI,CAAU,KAC5C,KAAK,IAAI,CAAK,MAAM,KAAK,IAAI,CAAK,KAClC,MAAS,KACT,MAAS,KACT,MAAoB,KACpB,MAAoB;AAGxB,GAEa,KAAiB,GAAI,MAAO;CACvC,IAAM,EAAE,MAAM,MAAW,GACnB,EAAE,MAAM,MAAW,GACrB,EAAE,MAAM,MAAW,GACnB,EAAE,MAAM,MAAW;CAGvB,AADA,IAAS,EAAE,GAAG,EAAO,GACrB,IAAS,EAAE,GAAG,EAAO;CAErB,IAAM,IAAS,KAAU,EAAE,GAAG,EAAO,GAC/B,IAAS,KAAU,EAAE,GAAG,EAAO,GAE/B,IAAe;EAAE,GAAG,EAAO,KAAK,EAAO,IAAI,EAAO;EAAI,GAAG,EAAO;CAAE,GAClE,IAAe;EAAE,GAAG,EAAO,KAAK,EAAO,IAAI,EAAO;EAAI,GAAG,EAAO;CAAE;CAExE,IAAI,CAAC,KAAU,CAAC,GAAQ,OAAO;CAE/B,IAAM,EAAE,GAAG,GAAI,GAAG,GAAI,GAAG,MAAO,EAAY,GAAQ,GAAQ,CAAY,GAClE,EAAE,GAAG,GAAI,GAAG,GAAI,GAAG,MAAO,EAAY,GAAQ,GAAQ,CAAY,GAGlE,KAAS,MAAW,KAAK,MAAM,IAAS,GAAK,IAAI;CAEvD,OAAO,EAAM,CAAE,MAAM,EAAM,CAAE,KAAK,EAAM,CAAE,MAAM,EAAM,CAAE,KAAK,EAAM,CAAE,MAAM,EAAM,CAAE;AACrF,GAQa,KAAiB,GAAI,MAAO;CACvC,IAAM,EAAE,MAAM,MAAW,GACnB,EAAE,MAAM,MAAW,GACrB,EAAE,MAAM,MAAW,GACnB,EAAE,MAAM,MAAW;CAGvB,AADA,IAAS,EAAE,GAAG,EAAO,GACrB,IAAS,EAAE,GAAG,EAAO;CAErB,IAAM,IAAS,KAAU,EAAE,GAAG,EAAO,GAC/B,IAAS,KAAU,EAAE,GAAG,EAAO,GAE/B,IAAO,EAAqB,GAAQ,CAAM,GAC1C,IAAO,EAAqB,GAAQ,CAAM;CAGhD,OAAO,EAAQ,GAAQ,CAAM,KAAK,EAAQ,GAAM,CAAI;AACtD,GAQa,KAAoB,GAAI,MAAO;CAC1C,IAAM,EAAE,MAAM,MAAW,GACnB,EAAE,MAAM,MAAW,GACrB,EAAE,MAAM,MAAW,GACnB,EAAE,MAAM,MAAW;CAGvB,AADA,IAAS,EAAE,GAAG,EAAO,GACrB,IAAS,EAAE,GAAG,EAAO;CAErB,IAAM,IAAS,KAAU,EAAE,GAAG,EAAO,GAC/B,IAAS,KAAU,EAAE,GAAG,EAAO,GAE/B,EAAE,OAAI,UAAO,EAAyB,GAAQ,CAAM,GACpD,EAAE,OAAI,UAAO,EAAyB,GAAQ,CAAM;CAG1D,OAAO,EAAQ,GAAI,CAAE,KAAK,EAAQ,GAAI,CAAE;AAC1C,GAEa,IAAa;CACxB,SAAS,GAAY,MAAS,EAAY,GAAY,CAAI;CAC1D,OAAO,GAAY,MAAS,EAAU,GAAY,CAAI;CACtD,WAAW,GAAY,MAAS,EAAc,GAAY,CAAI;CAC9D,WAAW,GAAY,MAAS,EAAc,GAAY,CAAI;CAC9D,cAAc,GAAY,MAAS,EAAiB,GAAY,CAAI;CACpE,QAAQ,GAAY,MAAS,EAAW,GAAY,CAAI;CACxD,UAAU,GAAY,MAAS,EAAa,GAAY,CAAI;CAC5D,MAAM,GAAY,MAAS,EAAS,GAAY,CAAI;CACpD,UAAU,GAAY,MAAS,EAAa,GAAY,CAAI;CAC5D,OAAO,GAAY,MAAS,EAAU,GAAY,CAAI;CACtD,SAAS,GAAY,MAAS,EAAY,GAAY,CAAI;AAC5D,GC1VI,IAAI,OAAO,gBA8CX,IAAoB,kBA9CY,GAAG,MAAM;CAC5C,IAAI,IAAI,CAAC;CACT,KAAK,IAAI,KAAK,GAAG,EAAE,GAAG,GAAG;EACxB,KAAK,EAAE;EACP,YAAY,CAAC;CACd,CAAC;CACD,OAAO,KAAK,EAAE,GAAG,OAAO,aAAa,EAAE,OAAO,SAAS,CAAC,GAAG;AAC5D,GAuC0B,EAAE,eAAe,EAAE,CAAC;AAC9C,SAAS,EAAE,GAAG,GAAG,GAAG;CACnB,OAAO,GAAG,mBAAmB,CAAC,KAAK,GAAG,mBAAmB,CAAC,IAAI,CAAC,IAAI,OAAO,KAAK,YAAY,IAAI,CAAC;AACjG;;;AChCA,IAAM,KAAA,GAAA,EAAA,SAAY,kCAAkC,GAE9C,WAA4B;CAChC,OAAO,CAAC;CACR,SAAS,CAAC;CACV,MAAM,CAAC;CACP,KAAK,CAAC;CACN,QAAQ,CAAC;CACT,SAAS,CAAC;CACV,QAAQ,CAAC;CACT,MAAM,CAAC;CACP,UAAU,CAAC;CACX,UAAU,CAAC;CACX,aAAa,CAAC;AAChB,IAEM,IAAoB;CACxB,WAAW;CACX,SAAS;CACT,SAAS;AACX,GAEa,KAAgB,GAAO,MAG3B,CAAC,EACN,KACA,KACA,EAAM,SAAS,EAAM,QACrB,EAAW,EAAM,SACjB,EAAW,EAAM,MAAM,GAAO,CAAK,IAI1B,KAAoB,GAAO,MAC/B,EAAM,UAAU,EAAM,QAAQ,YAAY,aAGtC,KAAsB,EAAE,mBAAgB,OAAO,GAAgB,oBAAiB,SAAY;CAEvG,AADA,MAAmC,CAAC,GACpC,MAAmC,CAAC;CAEpC,IAAM,IAAM,EAAU,CAAc,EAAE,QAAQ,GAAiB,MAAW;EACxE,IAAM,IAAkB,EAAe,MAAM,MAAS,EAAa,GAAQ,CAAI,CAAC;EAahF,OANA,EAAO,eAJqB,KAAmB,EAAO,SAAS,WAAW,IACtE,EAAoB,GAAQ,CAAe,IACzC,KAEqC,YAAY,aACnD,MACF,EAAO,mBAAmB,EAAiB,GAAQ,CAAe,GAClE,EAAO,eAAe,EAAgB,QAAQ,EAAgB,QAAQ,IACtE,EAAO,QAAQ,EAAO,QAAQ,EAAO,QAAQ,KAExC,CAAC,GAAG,GAAiB,CAAM;CACpC,GAAG,CAAC,CAAC,GAGC,IAAiB,EAAU,CAAc,EAAE,QAAQ,GAAiB,MACpD,EAAe,MAAM,MAAS,EAAa,GAAQ,CAAI,CAEtE,IAKE,IAHE,CAAC,GAAG,GAAiB;EAAE,GAAG;EAAQ,aAAa;CAAU,CAAC,GAIlE,CAAC,CAAC;CAEL,OAAO,CAAC,GAAG,GAAK,GAAG,CAAc;AACnC,GAEM,KAAqB,EAAE,gBAAa,aAAU;CAClD,IAAI,IAAK;CAST,OAJI,MACF,IAAK,MAAgB,oBAGhB,EAAe,QAAQ,EAAE,gBAAgB,EAAG,GAAG,CAAG;AAC3D,GAEa,KAAiB,GAAU,GAAS,IAAM,CAAC,MAAM;CAE5D,IAAI,EAAE,SAAS,IAA0B,CAAC,GAAG,mBAAgB,KAAY,CAAC,GACtE,EAAE,cAAW,KAAW,CAAC;CAe7B,AAZA,OAAO,QAAQ,KAA2B,CAAC,CAAC,EAAE,SAC3C,CAAC,GAAK,OACJ,EAAwB,KAAO;EAAE,GAAG;EAAO,OAAO,GAAO,MAAM,QAAQ,MAAS,CAAC,EAAK,QAAQ;CAAE,CACrG,GAGA,MAAmB,CAAC,GAGpB,IAAS,EAAO,QAAQ,MAAS,CAAC,EAAK,QAAQ,GAG/C,AAGE,IAHE,EAAQ,CAAuB,IACP,EAAE,eAAe,EAAmB,EAAE,IAEtC;EACxB,eAAe,EAAwB;EACvC,GAAG,EAAc,CAAuB;CAC1C;CAGF,IAAM,IAAwB,EAAkB;EAAE;EAAa;CAAI,CAAC,GAG9D,IAAiB,EAAS,GAAQ,CAAY;CAIpD,OAFwB,OAAO,QAAQ,CAEhC,EAAgB,QACpB,GAAK,MAAU;EAEd,IAAM,IAAoB,EAAM,IAE5B,EAAE,aADiB,EAAM,MAAM,CAAC;EAGpC,IAAI,CAAC,KAAS,CAAC,EAAM,QACnB,OAAO;EAIT,IAAM,IAAkB,EAAmB;GAAE;GAAgB;EAAM,CAAC,GAC9D,IAA4B,EAAmB;GAAE;GAAgB;GAAO,gBAAgB;EAAK,CAAC,GAC9F,IAAe,EAA0B,QAAQ,MAAW,EAAO,gBAAgB,SAAS,GAG5F,IAAwB,EAA0B,QAAQ,MAAW,EAAO,gBAAgB,SAAS,GAErG,IAAW,EAAM,QACnB,IAAQ,EAAa;EAuBzB,OApBI,EAAsB,SAAS,MACjC,KAAS,EAAsB,SAAS,IAGtC,IAAQ,MACV,IAAQ,KAGN,IAAQ,IAAW,EAAI,aAAa,CAAC,EAAI,sBACvC,IACF,EAAI,YAAY,YAAY,IAAQ,GAAU,QAAQ,CAAC,CAAC,IAExD,EAAI,YAAY,KAAK,MAAM,IAAQ,CAAQ,GAG7C,EAAI,qBAAqB,GACzB,EAAI,mBAAmB,GACvB,EAAI,mBAAmB,KAGlB;CACT,GACA;EACE,WAAW;EACX,oBAAoB;EAEpB,kBAAkB,EAAU,CAAc,EAAE,KAAK,OAAY;GAAE,GAAG;GAAQ,aAAa;EAAY,EAAE;EACrG,kBAAkB;CACpB,CACF;AACF,GAEa,KAAa,OAAc;CAAE,GAAG;CAAU,GAAG;AAAS;AAEnE,SAAgB,EAAM,GAAU,GAAS,GAAK;CAC5C,OAAO,IAAI,SAAS,MAAY;EAC9B,IAAM,IAAqB,EAAU,CAAQ;EAG7C,AACE,MAAU,CAAC;EAGb,IAAM,EAAE,gBAAa,kBAAe,WAAQ,kBAAe,UAAO,YAAS,iBAAc,GAAG,MAC1F,KAAsB,CAAC,GACrB,EAAE,cAAW,GACX,EAAE,SAAM,YAAS,KAAO,CAAC;EAI/B,AAAI,OAAO,KAAW,cACpB,AAQE,IARE,IACO;GACP,MAAM;GACN,OAAO;GACP,IAAI;GACJ,MAAM;EACR,IAES;GACP,MAAM;GACN,OAAO;GACP,IAAI;GACJ,MAAM;EACR;EAKJ,IAAM,KAAuB,KAAgB,CAAC,GAAG,QAAQ,MAAS,MAAS,OAAO,GAC5E,IAAwB,KAAgB,EAAoB,UAAU,EAAoB,MAAO,IAEjG,IAAO;GACX,GAAG;GACH;GACA;GACA,aAAa;GACb,UAAU,EAAI,SAAS;GACvB,QAAQ,IAAgB,IAAS;GACjC,WAAW;GACX,MAAM;GACN,eAAe,EAAI,SAAS;GAC5B,YACE,EAAI,SAAS,cACb,CAAC,EAAQ,CAAO,KAChB,EAAQ,iBACR,EAAQ,cAAc,SACtB,CAAC,EAAQ,EAAQ,cAAc,KAAK;GACtC,qBAAqB;GACrB;GACA;EACF;EAEA,IAAI,MAAS,iBAAiB,MAAS,UAAU,MAAS,aAAa;GACrE,IAAM,EAAE,cAAW,qBAAkB,wBAAqB,kCAA+B,KAAsB,CAAC;GAGhH,AADA,EAAK,YAAY,IAAmB,IAAY,MAChD,EAAK,sBAAsB,IAA6B,IAAsB;EAChF;EAEA,IAAI,MAAS,YACX,IACE,CAAC,EAAQ,CAAO,KAChB,EAAQ,iBACR,EAAQ,cAAc,SACtB,CAAC,EAAQ,EAAQ,cAAc,KAAK,GACpC;GACA,IAAM,EAAE,qBAAkB,uBAAoB,iBAAc,EAAc,GAAoB,GAAS,CAAG;GAM1G,AAJA,EAAK,mBAAmB,EAAiB,MACtC,GAAG,MAAM,EAAkB,EAAE,eAAe,EAAkB,EAAE,YACnE,GACA,EAAK,kBAAkB,KAAsB,EAAQ,MAAuB,CAAC,GAAG,QAAQ,CAAC,GACzF,EAAK,aAAa,EAAK,cAAc,MAAc;EACrD,OAEE,AADA,EAAK,mBAAoB,KAAW,EAAQ,UAAW,CAAC,GACxD,EAAK,kBAAkB,CAAC;EAK5B,AADA,EAAI,UAAU,CAAI,GAClB,EAAQ,CAAI;CACd,CAAC;AACH;AASA,IAAa,KAAe,GAAU,GAAS,MAAQ;CACrD,IAAM,IAAW,CAAC,GACZ,EAAE,aAAU,CAAC,GAAG,mBAAgB,KAAY,CAAC,GAC7C,IAAgB,KAAW,EAAQ,UAAW,CAAC;CAErD,IAAI,CAAC,EAAa,QAChB,OAAO,CAAC,0CAA0C;CAGpD,EAAS,KAAK,iBAAiB,EAAa,OAAO,yBAAyB;CAE5E,IAAM,IAAwB,EAAkB;EAAE;EAAa;CAAI,CAAC,GAE9D,EACJ,qBACA,cACA,0BACE,EAAc,GAAU,GAAS,CAAG,GAElC,IACJ,KAAsB,EAAQ,MAC1B,EAAQ,GAAoB,SAC5B,CAAC,GAEH,IAAe,GACf,IAAiB,GACjB,IAAe;CAEnB,KAAK,IAAI,IAAI,GAAG,IAAI,EAAiB,QAAQ,KAAK;EAChD,IAAM,IAAI,EAAiB,GAAG;EAC9B,AAAI,MAAM,YAAW,MACZ,MAAM,cAAa,MACnB,MAAM,aAAW;CAC5B;CAoCA,IAlCI,IAAe,KACjB,EAAS,KAAK,oBAAoB,EAAa,EAAE,GAG/C,IAAiB,KACnB,EAAS,KAAK,sBAAsB,EAAe,EAAE,GAGnD,IAAe,KACjB,EAAS,KAAK,6BAA6B,EAAa,EAAE,GAG5D,EAAiB,SAAS,GAAM,MAAU;EACxC,IAAM,IAAa,EAAK,QAAQ,gBAC1B,IAAc,EAAK,QAAQ,IAAI,EAAK,MAAM,KAAK,IAC/C,IAAc,cAAc,IAAQ;EAc1C,AAZI,EAAK,gBAAgB,aACvB,EAAS,KACP,GAAG,EAAW,OAAO,CAAC,EAAE,YAAY,IAAI,EAAW,MAAM,CAAC,EAAE,GAAG,KAAe,EAAY,aAC5F,GAGE,EAAK,gBAAgB,eACvB,EAAS,KACP,GAAG,EAAW,OAAO,CAAC,EAAE,YAAY,IAAI,EAAW,MAAM,CAAC,EAAE,GAAG,KAAe,EAAY,+BAA+B,EAAW,EACtI,GAGE,EAAK,gBAAgB,aACvB,EAAS,KAAK,YAAY,EAAW,GAAG,KAAe,EAAY,iCAAiC;CAExG,CAAC,GAEG,EAAa,SAAS,EAAgB,QAAQ;EAChD,IAAM,IAAQ,EAAa,SAAS,EAAgB;EACpD,EAAS,KAAK,GAAG,EAAM,4DAA4D;CACrF;CAUA,OARI,IACF,EAAS,KAAK,yCAAyC,IAEvD,EAAS,KAAK,gDAAgD,GAGhE,EAAS,KAAK,gBAAgB,EAAU,EAAE,GAEnC;AACT;AAGA,SAAgB,EAAQ,GAAU,GAAS,IAAM,CAAC,GAAG;CACnD,OAAO,IAAI,SAAS,MAAY;EAK9B,CAJI,CAAC,KAAW,EAAQ,CAAO,MAC7B,EAAQ;GAAE,OAAO;GAAG,OAAO;GAAM,UAAU,CAAC,0CAA0C;EAAE,CAAC,IAIzF,EAAI,SAAS,cACb,EAAQ,EAAS,OAAO,KACvB,EAAS,WAAW,EAAS,QAAQ,iBAAiB,EAAQ,EAAS,QAAQ,cAAc,KAAK,MAEnG,EAAQ;GAAE,OAAO;GAAG,OAAO;GAAM,UAAU,CAAC,0CAA0C;EAAE,CAAC;EAG3F,IAAM,EAAE,iBAAc,EAAc,GAAU,GAAS,CAAG;EAE1D,EAAQ;GAAE,OAAO;GAAW,OAAO;GAAO,UAAU,EAAY,GAAU,GAAS,CAAG;EAAE,CAAC;CAC3F,CAAC;AACH;AAEA,IAAa,KAAgC,GAAU,MAC9C,IAAI,SAAS,MAAY;CAC9B,IAAI,EAAI,SAAS,cAAc,EAAI,SAAS,cAAc;EACxD,IAAM,EAAE,eAAY,KAAY,CAAC,GAC7B,IAAQ,CAAC;EAOb,AALI,KAAW,OAAO,OAAO,CAAO,MAElC,KADsB,EAAQ,iBAAiB,OAAO,OAAO,CAAO,EAAE,MAAM,CAAC,GACvD,SAAS,CAAC,IAGlC,EAAQ;GACN,QAAQ;GACR,IAAI;EACN,CAAC;CACH,OACE,EAAQ,IAAI;AAEhB,CAAC,GAOG,KAAc,OAAU,KAAQ,IAAI,QAAQ,sCAAsC,EAAE,GAE7E,KAAY,IAAQ,CAAC,GAAG,IAAS,CAAC,MAAM;CACnD,IAAM,EAAE,YAAS,oBAAiB,GAC5B,IAAS,CAAC,GACV,IAAsB,CAAC;CAgC7B,QA/B6B,KAAgB,CAAC,GAAG,QAAQ,MAAS,MAAS,OAEtE,EAAoB,WACvB,EAAO,oBAAoB,6CAG7B;EAAC;EAAuB;EAAU;CAAW,EAAE,SAAS,MAAU;EAChE,AAAI,EAAO,IAAQ,YAAY,CAAC,EAAW,EAAM,EAAM,MACrD,EAAO,KAAS;CAEpB,CAAC,GAED,OAAO,QAAQ,KAAW,CAAC,CAAC,EAAE,SAAS,CAAC,GAAK,OAAW;EAMtD,AALK,EAAM,MAAM,WACf,EAAoB,KAAO,+CAIzB,EAAM,MAAM,SAAS,KACvB,EAAM,MAAM,SAAS,MAAS;GAC5B,AAAI,EAAK,aACP,EAAoB,KAAO;EAE/B,CAAC;CAEL,CAAC,GAEI,EAAQ,CAAmB,MAC9B,EAAO,sBAAsB,IAGxB;AACT"}