@pie-element/placement-ordering 14.1.1-next.11 → 14.1.2-next.0

package/dist/browser/controller/index.js

@@ -0,0 +1,319 @@
+import { R as e, V as t, X as n, b as r, c as i, i as a, l as o, n as s, ot as c, p as l, r as u, t as d, u as f } from "../browser-CvJkn_Ec.js";
+import { a as p, i as ee, n as m, o as h, r as te, s as g, t as _ } from "../dist-BTHiIs74.js";
+import { t as v } from "../last-D7N4Qfx4.js";
+//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/noop.js
+function y() {}
+//#endregion
+//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_arrayReduce.js
+function b(e, t, n, r) {
+	var i = -1, a = e == null ? 0 : e.length;
+	for (r && a && (n = e[++i]); ++i < a;) n = t(n, e[i], i, e);
+	return n;
+}
+//#endregion
+//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/differenceWith.js
+var x = t(function(e, t) {
+	var n = v(t);
+	return a(n) && (n = void 0), a(e) ? te(e, r(t, 1, a, !0), void 0, n) : [];
+});
+//#endregion
+//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_arrayEvery.js
+function S(e, t) {
+	for (var n = -1, r = e == null ? 0 : e.length; ++n < r;) if (!t(e[n], n, e)) return !1;
+	return !0;
+}
+//#endregion
+//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_baseEvery.js
+function C(e, t) {
+	var n = !0;
+	return p(e, function(e, r, i) {
+		return n = !!t(e, r, i), n;
+	}), n;
+}
+//#endregion
+//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/every.js
+function w(t, r, i) {
+	var a = n(t) ? S : C;
+	return i && e(t, r, i) && (r = void 0), a(t, h(r, 3));
+}
+//#endregion
+//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_baseReduce.js
+function T(e, t, n, r, i) {
+	return i(e, function(e, i, a) {
+		n = r ? (r = !1, e) : t(n, e, i, a);
+	}), n;
+}
+//#endregion
+//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/reduce.js
+function E(e, t, r) {
+	var i = n(e) ? b : T, a = arguments.length < 3;
+	return i(e, h(t, 4), r, a, p);
+}
+//#endregion
+//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_createSet.js
+var D = l && 1 / i(new l([, -0]))[1] == Infinity ? function(e) {
+	return new l(e);
+} : y, O = 200;
+function ne(e, t, n) {
+	var r = -1, a = g, s = e.length, c = !0, l = [], u = l;
+	if (n) c = !1, a = ee;
+	else if (s >= O) {
+		var d = t ? null : D(e);
+		if (d) return i(d);
+		c = !1, a = o, u = new f();
+	} else u = t ? [] : l;
+	outer: for (; ++r < s;) {
+		var p = e[r], m = t ? t(p) : p;
+		if (p = n || p !== 0 ? p : 0, c && m === m) {
+			for (var h = u.length; h--;) if (u[h] === m) continue outer;
+			t && u.push(m), l.push(p);
+		} else a(u, m, n) || (u !== l && u.push(m), l.push(p));
+	}
+	return l;
+}
+//#endregion
+//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/uniq.js
+function k(e) {
+	return e && e.length ? ne(e) : [];
+}
+//#endregion
+//#region ../../../node_modules/.bun/js-combinatorics@2.1.2/node_modules/js-combinatorics/combinatorics.js
+function A(e, t) {
+	if (e < 0) throw RangeError(`${e} is out of range`);
+	if (t < 0) throw RangeError(`${t} is out of range`);
+	if (t == 0) return 1n;
+	if (e < t) return 0n;
+	let [n, r, i] = [
+		BigInt(e),
+		BigInt(t),
+		1n
+	];
+	for (; r--;) i *= n--;
+	return i;
+}
+function j(e, t) {
+	return t == 0 || e == t ? 1n : e < t ? 0n : A(e, t) / A(t, t);
+}
+var M = typeof crypto < "u" ? crypto : {};
+typeof M.randomBytes == "function" || M.getRandomValues;
+//#endregion
+//#region src/controller/scoring.ts
+var N = /* @__PURE__ */ c(d(), 1), P = (0, N.default)("pie-elements:placement-ordering:controller"), F = (e) => /* @__PURE__ */ Error(`Cant score answer: ${e} it has duplicates and allowDuplicates is false`), I = (e, t, n) => {
+	if (n = {
+		allowDuplicates: !1,
+		orderMustBeComplete: !1,
+		...n
+	}, !n.allowDuplicates && !s(k(e), e)) throw F(t);
+	if (n.allowDuplicates === !1 && t.length !== k(t).length) return 0;
+	if (t = n.allowDuplicates === !1 ? k(t) : t, P("answer:", t), !Array.isArray(e) || e.length === 0) throw Error("correct must be non empty an array");
+	if (e.length === 1) return +!!s(e, t);
+	if (!Array.isArray(t) || t.length < 2 || t.length > e.length || e.length !== t.length && n.orderMustBeComplete) return 0;
+	let r = j(e, 2).toArray(), i = j(t, 2).toArray(), a = x(i, r, s), o = r.length - i.length, c = r.length, l = ((c - a.length - o) / c).toFixed(2);
+	return parseFloat(l);
+}, L = (e) => e.correctResponse ? e.correctResponse.map((e) => e && e.id ? e.id : e) : [], R = (e) => {
+	let t = (e.alternateResponses || []).map((e) => Array.isArray(e) ? e : e.response).filter((e) => e !== void 0);
+	return [L(e), ...t];
+}, z = (e, t) => {
+	let { value: n } = t || {};
+	if (!n) return 0;
+	let r = R(e), i = (e.configure && e.configure.removeTilesAfterPlacing) !== !1, a = 0;
+	return r.forEach((e) => {
+		let t = I(e, n, { allowDuplicates: i });
+		t >= a && (a = t);
+	}), a;
+}, B = {
+	correct: {
+		type: "default",
+		default: "Correct",
+		custom: "Correct"
+	},
+	incorrect: {
+		type: "default",
+		default: "Incorrect",
+		custom: "Incorrect"
+	},
+	partial: {
+		type: "default",
+		default: "Nearly",
+		custom: "Nearly"
+	},
+	unanswered: {
+		type: "default",
+		default: "You have not entered a response",
+		custom: "You have not entered a response"
+	}
+};
+function V(e) {
+	return e === "partially-correct" ? "partial" : e;
+}
+function H(e, t = {}) {
+	return new Promise((n) => {
+		let r = {
+			...B,
+			...t
+		}, i = V(e), a = r[i], o = B[i];
+		U(a, o[a.type]).then(n);
+	});
+}
+function U(e, t) {
+	return new Promise((n) => {
+		if (!e || e.type === "none") {
+			n(void 0);
+			return;
+		}
+		n(e[e.type] || t);
+	});
+}
+//#endregion
+//#region ../../shared/controller-utils/dist/index.js
+var W = Object.defineProperty, G = /* @__PURE__ */ ((e, t) => {
+	let n = {};
+	for (var r in e) W(n, r, {
+		get: e[r],
+		enumerable: !0
+	});
+	return t || W(n, Symbol.toStringTag, { value: "Module" }), n;
+})({ enabled: () => K });
+function K(e, t, n) {
+	return e?.partialScoring === !1 || t?.partialScoring === !1 ? !1 : typeof n == "boolean" ? n : !0;
+}
+//#endregion
+//#region src/controller/defaults.ts
+var q = {
+	choiceLabel: "",
+	choiceLabelEnabled: !0,
+	choices: [],
+	correctResponse: [],
+	feedbackEnabled: !1,
+	numberedGuides: !1,
+	orientation: "vertical",
+	partialScoring: !0,
+	placementArea: !1,
+	prompt: "",
+	promptEnabled: !0,
+	rationale: "",
+	rationaleEnabled: !0,
+	removeTilesAfterPlacing: !0,
+	scoringType: "auto",
+	studentInstructionsEnabled: !0,
+	targetLabel: "",
+	teacherInstructions: "",
+	teacherInstructionsEnabled: !0,
+	toolbarEditorPosition: "bottom"
+}, J = (0, N.default)("@pie-element:placement-ordering:controller"), { translator: Y } = _, X = () => /* @__PURE__ */ Error("Question is missing required array: correctResponse"), Z = (e, t, n) => {
+	let r = [], i = t?.value || [];
+	e?.correctResponse;
+	let a = e?.placementArea === !0;
+	if (!i.length) return a ? r.push("Student did not place any tiles in the target area.") : r.push("Student did not reorder any tiles."), r.push("Final score: 0."), r;
+	let o = R(e), c = {
+		score: 0,
+		response: []
+	};
+	o.forEach((e) => {
+		let t = 0;
+		i.forEach((n, r) => {
+			e[r] === n && t++;
+		}), t > c.score && (c = {
+			score: t,
+			response: e
+		});
+	});
+	let l = c.score, u = i.length - l;
+	l > 0 && r.push(`${l} tile(s) placed in the correct order.`), u > 0 && r.push(`${u} tile(s) placed in an incorrect order.`), o.some((e) => s(e, i));
+	let d = G.enabled(e, n || {});
+	d ? (r.push("Score calculated using partial scoring."), r.push("Each tile placed in the correct position contributes to the score.")) : (r.push("Score calculated using all-or-nothing scoring."), a ? r.push("Student must place all tiles in the correct positions within the target area to receive full credit.") : r.push("Student must arrange all tiles in the correct order to receive full credit."));
+	let f = z(e, t), p = d ? f : +(f === 1);
+	return r.push(`Final score: ${p}.`), r;
+};
+function re(e, t, n) {
+	return new Promise((r, i) => {
+		if (!t || u(t)) {
+			r({
+				score: 0,
+				empty: !0,
+				logTrace: ["Student did not interact with the placement-ordering item."]
+			});
+			return;
+		}
+		if (!e || !e.correctResponse || u(e.correctResponse)) i(X());
+		else try {
+			let i = z(e, t);
+			r({
+				score: G.enabled(e, n || {}) ? i : +(i === 1),
+				logTrace: Z(e, t, n)
+			});
+		} catch (e) {
+			i(e);
+		}
+	});
+}
+function ie(e = {}) {
+	return new Promise((t) => {
+		t({
+			...q,
+			...e
+		});
+	});
+}
+var Q = (e) => ({
+	...q,
+	rationaleEnabled: !0,
+	feedbackEnabled: !1,
+	promptEnabled: !0,
+	teacherInstructionsEnabled: !0,
+	studentInstructionsEnabled: !0,
+	...e
+});
+async function ae(e, t, r) {
+	let i = Q(e), a = {};
+	if (e.alternateResponses && w(e.alternateResponses, n) && (J("Deprecated structure of alternateResponses is in use"), console.error("Deprecated structure of alternateResponses is in use")), a.env = r, a.extraCSSRules = i.extraCSSRules, a.outcomes = [], a.completeLength = (i.correctResponse || []).length, a.choices = (i.choices || []).filter((e) => e.label), a.note = i.note, a.showNote = i.alternateResponses && i.alternateResponses.length > 0, a.language = i.language, J("[model] removing tileSize for the moment."), a.prompt = i.promptEnabled ? i.prompt : null, a.config = {
+		orientation: i.orientation || "vertical",
+		includeTargets: i.placementArea,
+		choiceLabelEnabled: i.choiceLabelEnabled,
+		targetLabel: i.targetLabel,
+		choiceLabel: i.choiceLabel,
+		showOrdering: i.numberedGuides,
+		allowSameChoiceInTargets: !i.removeTilesAfterPlacing
+	}, a.disabled = r.mode !== "gather", a.note ||= Y.t("common:commonCorrectAnswerWithAlternates", { lng: i.language }), r.role === "instructor" && (r.mode === "view" || r.mode === "evaluate") ? (a.rationale = i.rationaleEnabled ? i.rationale : null, a.teacherInstructions = i.teacherInstructionsEnabled ? i.teacherInstructions : null) : (a.rationale = null, a.teacherInstructions = null), r.mode === "evaluate") {
+		let n = t && t.value || [], o = R(i), c = o.reduce((e, t) => {
+			let r = E(n, (e, n, r) => e + (Array.isArray(t) && t[r] === n ? 1 : 0), 0);
+			return r > e.score ? {
+				arr: t,
+				score: r
+			} : e;
+		}, {
+			arr: [],
+			score: 0
+		});
+		a.outcomes = m(n, (e, t) => ({
+			id: e,
+			outcome: c.arr[t] === e ? "correct" : "incorrect"
+		}));
+		let l = o.some((e) => s(e, n)), u = z(e, t), d = u === 1, f = !d && G.enabled(i, r || {}) && u !== 0;
+		return a.correctness = d ? "correct" : f ? "partial" : "incorrect", l || (a.correctResponse = L(i)), i.feedback || (i.feedbackEnabled = !1), a.feedback = i.feedbackEnabled ? await H(a.correctness, i.feedback) : void 0, a;
+	} else return a;
+}
+var oe = (e, t) => new Promise((n) => {
+	t.mode !== "evaluate" && t.role === "instructor" ? n({
+		id: "1",
+		value: L(e)
+	}) : n(null);
+}), $ = (e) => (e || "").replace(/(<(?!img|iframe|source)([^>]+)>)/gi, ""), se = (e = {}, t = {}) => {
+	let { choices: n, correctResponse: r } = e, i = {};
+	[
+		"teacherInstructions",
+		"prompt",
+		"rationale"
+	].forEach((n) => {
+		t[n]?.required && !$(e[n]) && (i[n] = "This field is required.");
+	});
+	let a = [...n || []].reverse(), o = {};
+	return a.forEach((e, t) => {
+		let { id: n, label: r } = e;
+		$(r) ? a.slice(t + 1).some((e) => e.label === r) && (o[n] = "Content should be unique.") : o[n] = "Content should not be empty.";
+	}), s((n || []).map((e) => e.id), (r || []).map((e) => e.id || e)) && (i.orderError = "The correct ordering should not be identical to the initial ordering."), u(o) || (i.choicesErrors = o), i;
+};
+//#endregion
+export { oe as createCorrectResponseSession, ie as createDefaultModel, Z as getLogTrace, ae as model, Q as normalize, re as outcome, X as questionError, se as validate };
+
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","names":[],"sources":["../../../../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/noop.js","../../../../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_arrayReduce.js","../../../../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/differenceWith.js","../../../../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_arrayEvery.js","../../../../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_baseEvery.js","../../../../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/every.js","../../../../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_baseReduce.js","../../../../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/reduce.js","../../../../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_createSet.js","../../../../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_baseUniq.js","../../../../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/uniq.js","../../../../../../node_modules/.bun/js-combinatorics@2.1.2/node_modules/js-combinatorics/combinatorics.js","../../../src/controller/scoring.ts","../../../../../shared/feedback/dist/index.js","../../../../../shared/controller-utils/dist/index.js","../../../src/controller/defaults.ts","../../../src/controller/index.ts"],"sourcesContent":["/**\n * This method returns `undefined`.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n *\n * _.times(2, _.noop);\n * // => [undefined, undefined]\n */\nfunction noop() {\n  // No operation performed.\n}\n\nexport default noop;\n","/**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n *  the initial value.\n * @returns {*} Returns the accumulated value.\n */\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  if (initAccum && length) {\n    accumulator = array[++index];\n  }\n  while (++index < length) {\n    accumulator = iteratee(accumulator, array[index], index, array);\n  }\n  return accumulator;\n}\n\nexport default arrayReduce;\n","import baseDifference from './_baseDifference.js';\nimport baseFlatten from './_baseFlatten.js';\nimport baseRest from './_baseRest.js';\nimport isArrayLikeObject from './isArrayLikeObject.js';\nimport last from './last.js';\n\n/**\n * This method is like `_.difference` except that it accepts `comparator`\n * which is invoked to compare elements of `array` to `values`. The order and\n * references of result values are determined by the first array. The comparator\n * is invoked with two arguments: (arrVal, othVal).\n *\n * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {...Array} [values] The values to exclude.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new array of filtered values.\n * @example\n *\n * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n *\n * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n * // => [{ 'x': 2, 'y': 1 }]\n */\nvar differenceWith = baseRest(function(array, values) {\n  var comparator = last(values);\n  if (isArrayLikeObject(comparator)) {\n    comparator = undefined;\n  }\n  return isArrayLikeObject(array)\n    ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n    : [];\n});\n\nexport default differenceWith;\n","/**\n * A specialized version of `_.every` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n *  else `false`.\n */\nfunction arrayEvery(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (!predicate(array[index], index, array)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport default arrayEvery;\n","import baseEach from './_baseEach.js';\n\n/**\n * The base implementation of `_.every` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n *  else `false`\n */\nfunction baseEvery(collection, predicate) {\n  var result = true;\n  baseEach(collection, function(value, index, collection) {\n    result = !!predicate(value, index, collection);\n    return result;\n  });\n  return result;\n}\n\nexport default baseEvery;\n","import arrayEvery from './_arrayEvery.js';\nimport baseEvery from './_baseEvery.js';\nimport baseIteratee from './_baseIteratee.js';\nimport isArray from './isArray.js';\nimport isIterateeCall from './_isIterateeCall.js';\n\n/**\n * Checks if `predicate` returns truthy for **all** elements of `collection`.\n * Iteration is stopped once `predicate` returns falsey. The predicate is\n * invoked with three arguments: (value, index|key, collection).\n *\n * **Note:** This method returns `true` for\n * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n * elements of empty collections.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n * @returns {boolean} Returns `true` if all elements pass the predicate check,\n *  else `false`.\n * @example\n *\n * _.every([true, 1, null, 'yes'], Boolean);\n * // => false\n *\n * var users = [\n *   { 'user': 'barney', 'age': 36, 'active': false },\n *   { 'user': 'fred',   'age': 40, 'active': false }\n * ];\n *\n * // The `_.matches` iteratee shorthand.\n * _.every(users, { 'user': 'barney', 'active': false });\n * // => false\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.every(users, ['active', false]);\n * // => true\n *\n * // The `_.property` iteratee shorthand.\n * _.every(users, 'active');\n * // => false\n */\nfunction every(collection, predicate, guard) {\n  var func = isArray(collection) ? arrayEvery : baseEvery;\n  if (guard && isIterateeCall(collection, predicate, guard)) {\n    predicate = undefined;\n  }\n  return func(collection, baseIteratee(predicate, 3));\n}\n\nexport default every;\n","/**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n *  `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\nfunction baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n  eachFunc(collection, function(value, index, collection) {\n    accumulator = initAccum\n      ? (initAccum = false, value)\n      : iteratee(accumulator, value, index, collection);\n  });\n  return accumulator;\n}\n\nexport default baseReduce;\n","import arrayReduce from './_arrayReduce.js';\nimport baseEach from './_baseEach.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseReduce from './_baseReduce.js';\nimport isArray from './isArray.js';\n\n/**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n *   return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n *   (result[value] || (result[value] = [])).push(key);\n *   return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\nfunction reduce(collection, iteratee, accumulator) {\n  var func = isArray(collection) ? arrayReduce : baseReduce,\n      initAccum = arguments.length < 3;\n\n  return func(collection, baseIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n}\n\nexport default reduce;\n","import Set from './_Set.js';\nimport noop from './noop.js';\nimport setToArray from './_setToArray.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n  return new Set(values);\n};\n\nexport default createSet;\n","import SetCache from './_SetCache.js';\nimport arrayIncludes from './_arrayIncludes.js';\nimport arrayIncludesWith from './_arrayIncludesWith.js';\nimport cacheHas from './_cacheHas.js';\nimport createSet from './_createSet.js';\nimport setToArray from './_setToArray.js';\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\nfunction baseUniq(array, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      length = array.length,\n      isCommon = true,\n      result = [],\n      seen = result;\n\n  if (comparator) {\n    isCommon = false;\n    includes = arrayIncludesWith;\n  }\n  else if (length >= LARGE_ARRAY_SIZE) {\n    var set = iteratee ? null : createSet(array);\n    if (set) {\n      return setToArray(set);\n    }\n    isCommon = false;\n    includes = cacheHas;\n    seen = new SetCache;\n  }\n  else {\n    seen = iteratee ? [] : result;\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var seenIndex = seen.length;\n      while (seenIndex--) {\n        if (seen[seenIndex] === computed) {\n          continue outer;\n        }\n      }\n      if (iteratee) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n    else if (!includes(seen, computed, comparator)) {\n      if (seen !== result) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nexport default baseUniq;\n","import baseUniq from './_baseUniq.js';\n\n/**\n * Creates a duplicate-free version of an array, using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons, in which only the first occurrence of each element\n * is kept. The order of result values is determined by the order they occur\n * in the array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @returns {Array} Returns the new duplicate free array.\n * @example\n *\n * _.uniq([2, 1, 2]);\n * // => [2, 1]\n */\nfunction uniq(array) {\n  return (array && array.length) ? baseUniq(array) : [];\n}\n\nexport default uniq;\n","/**\n * combinatorics.js\n *\n *  Licensed under the MIT license.\n *  http://www.opensource.org/licenses/mit-license.php\n *\n *  @author: Dan Kogai <dankogai+github@gmail.com>\n *\n *  References:\n *  @link: http://www.ruby-doc.org/core-2.0/Array.html#method-i-combination\n *  @link: http://www.ruby-doc.org/core-2.0/Array.html#method-i-permutation\n *  @link: http://en.wikipedia.org/wiki/Factorial_number_system\n *  @link: https://en.wikipedia.org/wiki/Combinatorial_number_system\n */\nexport const version = '2.1.2';\n/**\n * calculates `P(n, k)`.\n *\n * @link https://en.wikipedia.org/wiki/Permutation\n */\nexport function permutation(n, k) {\n    if (n < 0)\n        throw new RangeError(`${n} is out of range`);\n    if (k < 0)\n        throw new RangeError(`${k} is out of range`);\n    if (0 == k)\n        return 1n;\n    if (n < k)\n        return 0n;\n    let [bn, bk, bp] = [BigInt(n), BigInt(k), 1n];\n    while (bk--)\n        bp *= bn--;\n    return bp;\n}\n/**\n * calculates `C(n, k)`.\n *\n * @link https://en.wikipedia.org/wiki/Combination\n */\nexport function combination(n, k) {\n    if (0 == k)\n        return 1n;\n    if (n == k)\n        return 1n;\n    if (n < k)\n        return 0n;\n    return permutation(n, k) / permutation(k, k);\n}\n/**\n * calculates `n!` === `P(n, n)`.\n *\n * @link https://en.wikipedia.org/wiki/Factorial\n */\nexport function factorial(n) {\n    return permutation(n, n);\n}\n/**\n * returns the factoradic representation of `n`, least significant order.\n *\n * @link https://en.wikipedia.org/wiki/Factorial_number_system\n * @param {number} l the number of digits\n */\nexport function factoradic(n, l = 0) {\n    if (n < 0)\n        throw new RangeError(`${n} is out of range`);\n    let [bn, bf] = [BigInt(n), 1n];\n    if (!l) {\n        for (l = 1; bf < bn; bf *= BigInt(++l))\n            ;\n        if (bn < bf)\n            bf /= BigInt(l--);\n    }\n    else {\n        bf = BigInt(factorial(l));\n    }\n    let digits = [0];\n    for (; l; bf /= BigInt(l--)) {\n        digits[l] = Number(bn / bf);\n        bn %= bf;\n    }\n    return digits;\n}\n/**\n * `combinadic(n, k)` returns a function\n * that takes `m` as an argument and\n * returns the combinadics representation of `m` for `n C k`.\n *\n * @link https://en.wikipedia.org/wiki/Combinatorial_number_system\n */\nexport function combinadic(n, k) {\n    const count = combination(n, k);\n    const [bn, bk] = [BigInt(n), BigInt(k)];\n    return (m) => {\n        if (m < 0 || count <= m)\n            throw new RangeError(`${m} is out of range`);\n        let digits = [];\n        let [ba, bb] = [bn, bk];\n        let x = BigInt(count) - 1n - BigInt(m);\n        for (let i = 0; i < k; i++) {\n            ba--;\n            while (x < combination(ba, bb))\n                ba--;\n            digits.push(Number(bn - 1n - ba));\n            x -= combination(ba, bb);\n            bb--;\n        }\n        return digits;\n    };\n}\n/**\n *\n */\nconst _crypto = typeof crypto !== 'undefined' ? crypto : {};\nconst _randomBytes = typeof _crypto['randomBytes'] === 'function'\n    ? (len) => Uint8Array.from(_crypto['randomBytes'](len))\n    : typeof _crypto['getRandomValues'] === 'function'\n        ? (len) => _crypto['getRandomValues'](new Uint8Array(len))\n        : (len) => Uint8Array.from(Array(len), () => Math.random() * 256);\n/**\n * returns random integer `n` where `min` <= `n` < `max`:\n *\n * if the argument is `BigInt` the result is also `BigInt`.\n *\n * @param {anyint} min\n * @param {anyint} max\n */\nexport function randomInteger(min = 0, max = Math.pow(2, 53)) {\n    let ctor = min.constructor;\n    if (arguments.length === 0) {\n        return Math.floor(Math.random() * ctor(max));\n    }\n    if (arguments.length == 1) {\n        [min, max] = [ctor(0), min];\n    }\n    if (typeof min == 'number') { // number\n        [min, max] = [Math.ceil(Number(min)), Math.ceil(Number(max))];\n        return Math.floor(Math.random() * (max - min)) + min;\n    }\n    const mag = ctor(max) - ctor(min);\n    const len = mag.toString(16).length;\n    const u8s = _randomBytes(len);\n    const rnd = u8s.reduce((a, v) => ((a << ctor(8)) + ctor(v)), ctor(0));\n    return ((ctor(rnd) * mag) >> ctor(len * 8)) + ctor(min);\n}\n;\n/**\n * Base Class of `js-combinatorics`\n */\nclass _CBase {\n    /**\n     * does `new`\n     * @param args\n     */\n    static of(...args) {\n        return new (Function.prototype.bind.apply(this, [null].concat(args)));\n    }\n    /**\n     * Same as `of` but takes a single array `arg`\n     *\n     * cf. https://stackoverflow.com/questions/1606797/use-of-apply-with-new-operator-is-this-possible\n     */\n    static from(arg) {\n        return new (Function.prototype.bind.apply(this, [null].concat(arg)));\n    }\n    /**\n     * Common iterator\n     */\n    [Symbol.iterator]() {\n        return function* (it, len) {\n            for (let i = 0n; i < len; i++)\n                yield it.at(i);\n        }(this, this.length);\n    }\n    /**\n     * returns `[...this]`.\n     */\n    toArray() {\n        return [...this];\n    }\n    /**\n     * @deprecated\n     * tells wether you need `BigInt` to access all elements.\n     */\n    get isBig() {\n        return Number.MAX_SAFE_INTEGER < this.length;\n    }\n    /**\n     * @deprecated\n     * tells wether it is safe to work on this instance.\n     *\n     * * always `true` unless your platform does not support `BigInt`.\n     * * if not, `true` iff `.isBig` is `false`.\n     */\n    get isSafe() {\n        return typeof BigInt !== 'undefined' || !this.isBig;\n    }\n    /**\n    * check n for nth\n    */\n    _check(n) {\n        if (n < 0) {\n            if (this.length < -n)\n                throw new RangeError(`${n} is out of range`);\n            return BigInt(this.length) + BigInt(n);\n        }\n        if (this.length <= n)\n            throw new RangeError(`${n} is out of range`);\n        return n;\n    }\n    /**\n     * get the `n`th element of the iterator.\n     * negative `n` goes backwards\n     * like `Array.prototype.at()`\n     * @link: https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/at\n     */\n    at(n) { return undefined; }\n    /**\n     * an alias of `at`\n     */\n    nth(n) { return this.at(n); }\n    /**\n     * the seed iterable\n     */\n    seed;\n    /**\n     * the size (# of elements) of each element.\n     */\n    size;\n    /**\n     * the number of elements\n     */\n    length;\n    /**\n     * pick random element\n     */\n    sample() {\n        return this.at(randomInteger(this.length));\n    }\n    /**\n     * an infinite steam of random elements\n     */\n    samples() {\n        return function* (it) {\n            while (true)\n                yield it.sample();\n        }(this);\n    }\n}\n/**\n * Permutation\n */\nexport class Permutation extends _CBase {\n    constructor(seed, size = 0) {\n        super();\n        this.seed = [...seed];\n        this.size = 0 < size ? size : this.seed.length;\n        this.length = permutation(this.seed.length, this.size);\n        Object.freeze(this);\n    }\n    at(n) {\n        n = this._check(n);\n        if (n === undefined)\n            return undefined;\n        const offset = this.seed.length - this.size;\n        const skip = factorial(offset);\n        let digits = factoradic(BigInt(n) * BigInt(skip), this.seed.length);\n        let source = this.seed.slice();\n        let result = [];\n        for (let i = this.seed.length - 1; offset <= i; i--) {\n            result.push(source.splice(digits[i], 1)[0]);\n        }\n        return result;\n    }\n}\n/**\n * Combination\n */\nexport class Combination extends _CBase {\n    comb;\n    constructor(seed, size = 0) {\n        super();\n        this.seed = [...seed];\n        this.size = 0 < size ? size : this.seed.length;\n        this.size = size;\n        this.length = combination(this.seed.length, this.size);\n        this.comb = combinadic(this.seed.length, this.size);\n        Object.freeze(this);\n    }\n    /**\n     * returns an iterator which is more efficient\n     * than the default iterator that uses .nth\n     *\n     * @link https://en.wikipedia.org/wiki/Combinatorial_number_system#Applications\n     */\n    bitwiseIterator() {\n        // [Symbol.iterator]() {\n        // console.log('overriding _CBase');\n        const inc = (x) => {\n            if (x <= 0n)\n                return 0n;\n            const u = x & -x;\n            const v = u + x;\n            return v + (((v ^ x) / u) >> 2n);\n        };\n        let x = (1n << BigInt(this.size)) - 1n; // 0b11...1\n        return function* (it, len) {\n            for (let i = 0n; i < BigInt(len); i++, x = inc(x)) {\n                let result = [];\n                for (let y = x, j = 0; 0n < y; y >>= 1n, j++) {\n                    if (y & 1n)\n                        result.push(it.seed[j]);\n                }\n                // console.log(`x = ${x}`);\n                yield result;\n            }\n        }(this, this.length);\n    }\n    at(n) {\n        n = this._check(n);\n        if (n === undefined)\n            return undefined;\n        let result = [];\n        for (let i of this.comb(n)) {\n            result.push(this.seed[i]);\n        }\n        return result;\n    }\n}\n/**\n * Base N\n */\nexport class BaseN extends _CBase {\n    base;\n    constructor(seed, size = 1) {\n        if (size < 1)\n            throw new RangeError(`${size} is out of range`);\n        super();\n        this.seed = [...seed];\n        this.size = size;\n        let base = this.seed.length;\n        this.base = base;\n        this.length = BigInt(base) ** BigInt(size);\n        Object.freeze(this);\n    }\n    at(n) {\n        n = this._check(n);\n        if (n === undefined)\n            return undefined;\n        let bn = BigInt(n);\n        const bb = BigInt(this.base);\n        let result = [];\n        for (let i = 0; i < this.size; i++) {\n            let bd = bn % bb;\n            result.push(this.seed[Number(bd)]);\n            bn -= bd;\n            bn /= bb;\n        }\n        return result;\n    }\n}\n/**\n * Power Set\n */\nexport class PowerSet extends _CBase {\n    constructor(seed) {\n        super();\n        this.seed = [...seed];\n        const length = 1n << BigInt(this.seed.length);\n        this.length = length;\n        Object.freeze(this);\n    }\n    at(n) {\n        n = this._check(n);\n        if (n === undefined)\n            return undefined;\n        let bn = BigInt(n);\n        let result = [];\n        for (let bi = 0n; bn; bn >>= 1n, bi++)\n            if (bn & 1n)\n                result.push(this.seed[Number(bi)]);\n        return result;\n    }\n}\n/**\n * Cartesian Product\n */\nexport class CartesianProduct extends _CBase {\n    constructor(...args) {\n        super();\n        this.seed = args.map(v => [...v]);\n        this.size = this.seed.length;\n        const length = this.seed.reduce((a, v) => a * BigInt(v.length), 1n);\n        this.length = length;\n        Object.freeze(this);\n    }\n    at(n) {\n        n = this._check(n);\n        if (n === undefined)\n            return undefined;\n        let bn = BigInt(n);\n        let result = [];\n        for (let i = 0; i < this.size; i++) {\n            const base = this.seed[i].length;\n            const bb = BigInt(base);\n            const bd = bn % bb;\n            result.push(this.seed[i][Number(bd)]);\n            bn -= bd;\n            bn /= bb;\n        }\n        return result;\n    }\n}\n","// @ts-nocheck\n/**\n * @synced-from pie-elements/packages/placement-ordering/controller/src/scoring.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 } from 'lodash-es';\nimport { combination } from 'js-combinatorics';\nimport debug from 'debug';\n\nconst log = debug('pie-elements:placement-ordering:controller');\n\nexport const illegalArgumentError = (answer) =>\n  new Error(`Cant score answer: ${answer} it has duplicates and allowDuplicates is false`);\nexport const pairwiseCombinationScore = (correct, answer, opts) => {\n  opts = { allowDuplicates: false, orderMustBeComplete: false, ...opts };\n\n  if (!opts.allowDuplicates && !isEqual(uniq(correct), correct)) {\n    throw illegalArgumentError(answer);\n  }\n\n  if (opts.allowDuplicates === false && answer.length !== uniq(answer).length) {\n    return 0;\n  }\n\n  answer = opts.allowDuplicates !== false ? answer : uniq(answer);\n\n  log('answer:', answer);\n  if (!Array.isArray(correct) || correct.length === 0) {\n    throw new Error('correct must be non empty an array');\n  }\n\n  if (correct.length === 1) {\n    return isEqual(correct, answer) ? 1 : 0;\n  }\n\n  if (!Array.isArray(answer) || answer.length < 2) {\n    return 0;\n  }\n\n  if (answer.length > correct.length) {\n    return 0;\n  }\n\n  if (correct.length !== answer.length && opts.orderMustBeComplete) {\n    return 0;\n  }\n\n  const correctCombo = combination(correct, 2).toArray();\n  const answerCombo = combination(answer, 2).toArray();\n\n  const diff = differenceWith(answerCombo, correctCombo, isEqual);\n\n  const comboLengthDiff = correctCombo.length - answerCombo.length;\n\n  const total = correctCombo.length;\n  const actual = total - diff.length - comboLengthDiff;\n\n  const n = (actual / total).toFixed(2);\n\n  return parseFloat(n);\n};\n\n/**\n * Flattens the correctResponse into an array of ordered identifiers representing the\n * correct response.\n */\nexport const flattenCorrect = (question) =>\n  question.correctResponse ? question.correctResponse.map((r) => (r && r.id ? r.id : r)) : [];\n\n/**\n * Returns all correct responses for this question\n * @param question - array\n */\nexport const getAllCorrectResponses = (question) => {\n  const alternates = (question.alternateResponses || [])\n    .map((alternate) => {\n      if (Array.isArray(alternate)) {\n        return alternate;\n      }\n\n      return alternate.response;\n    })\n    .filter((item) => item !== undefined);\n\n  return [flattenCorrect(question), ...alternates];\n};\n\n/**\n * Returns the score for a session. If weighted scoring is present in the correctResponse\n * field for the question, this will be used. If partial scoring is present in the question\n * model, this will be used. Otherwise the default scoring mechanism (0 for any incorrect, 1\n * for all correct) will be used.\n */\n\nexport const score = (question, session) => {\n  const { value } = session || {};\n\n  if (!value) {\n    return 0;\n  }\n\n  const allCorrectResponse = getAllCorrectResponses(question);\n  const allowDuplicates = (question.configure && question.configure.removeTilesAfterPlacing) !== false;\n\n  /**\n   * We require this to be the case - locking\n   */\n  //const orderMustBeComplete = true;\n\n  let bestScore = 0;\n\n  allCorrectResponse.forEach((cr) => {\n    const currentScore = pairwiseCombinationScore(cr, value, {\n      allowDuplicates,\n    });\n\n    if (currentScore >= bestScore) {\n      bestScore = currentScore;\n    }\n  });\n\n  return bestScore;\n};\n","//#region src/defaults.ts\nvar e = {\n\tcorrect: {\n\t\ttype: \"default\",\n\t\tdefault: \"Correct\",\n\t\tcustom: \"Correct\"\n\t},\n\tincorrect: {\n\t\ttype: \"default\",\n\t\tdefault: \"Incorrect\",\n\t\tcustom: \"Incorrect\"\n\t},\n\tpartial: {\n\t\ttype: \"default\",\n\t\tdefault: \"Nearly\",\n\t\tcustom: \"Nearly\"\n\t},\n\tunanswered: {\n\t\ttype: \"default\",\n\t\tdefault: \"You have not entered a response\",\n\t\tcustom: \"You have not entered a response\"\n\t}\n};\n//#endregion\n//#region src/utils.ts\nfunction t(e) {\n\treturn e === \"partially-correct\" ? \"partial\" : e;\n}\n//#endregion\n//#region src/index.ts\nfunction n(n, i = {}) {\n\treturn new Promise((a) => {\n\t\tlet o = {\n\t\t\t...e,\n\t\t\t...i\n\t\t}, s = t(n), c = o[s], l = e[s];\n\t\tr(c, l[c.type]).then(a);\n\t});\n}\nfunction r(e, t) {\n\treturn new Promise((n) => {\n\t\tif (!e || e.type === \"none\") {\n\t\t\tn(void 0);\n\t\t\treturn;\n\t\t}\n\t\tn(e[e.type] || t);\n\t});\n}\nfunction i(n, r = {}) {\n\tlet i = {\n\t\t...e,\n\t\t...r\n\t}, o = t(n), s = i[o], c = e[o];\n\treturn a(s, c[s.type]);\n}\nfunction a(e, t) {\n\tif (!(!e || e.type === \"none\")) return e[e.type] || t;\n}\n//#endregion\nexport { e as defaultFeedback, a as getActualFeedback, i as getActualFeedbackForCorrectness, r as getFeedback, n as getFeedbackForCorrectness, t as normalizeCorrectness };\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/placement-ordering/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\nexport default {\n  choiceLabel: '',\n  choiceLabelEnabled: true,\n  choices: [],\n  correctResponse: [],\n  feedbackEnabled: false,\n  numberedGuides: false,\n  orientation: 'vertical',\n  partialScoring: true,\n  placementArea: false,\n  prompt: '',\n  promptEnabled: true,\n  rationale: '',\n  rationaleEnabled: true,\n  removeTilesAfterPlacing: true,\n  scoringType: 'auto',\n  studentInstructionsEnabled: true,\n  targetLabel: '',\n  teacherInstructions: '',\n  teacherInstructionsEnabled: true,\n  toolbarEditorPosition: 'bottom',\n};\n","// @ts-nocheck\n/**\n * @synced-from pie-elements/packages/placement-ordering/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 { flattenCorrect, getAllCorrectResponses, score } from './scoring.js';\n\nimport { every, isArray, isEmpty, isEqual, map, reduce } from 'lodash-es';\nimport { getFeedbackForCorrectness } from '@pie-element/shared-feedback';\nimport { partialScoring } from '@pie-element/shared-controller-utils';\nimport debug from 'debug';\n\nimport defaults from './defaults.js';\n\nconst log = debug('@pie-element:placement-ordering:controller');\nimport Translator from '@pie-lib/translator';\n\nconst { translator } = Translator;\n\nexport const questionError = () => new Error('Question is missing required array: correctResponse');\n\n/**\n * Generates detailed trace log for placement-ordering scoring evaluation\n * @param {Object} question - the question model\n * @param {Object} session - the student session\n * @param {Object} env - the environment\n * @returns {Array<string>} traceLog\n */\nexport const getLogTrace = (question, session, env) => {\n  const traceLog = [];\n\n  const value = session?.value || [];\n  const correctResponse = question?.correctResponse || [];\n  const hasPlacementArea = question?.placementArea === true;\n\n  if (!value.length) {\n    if (hasPlacementArea) {\n      traceLog.push('Student did not place any tiles in the target area.');\n    } else {\n      traceLog.push('Student did not reorder any tiles.');\n    }\n    traceLog.push('Final score: 0.');\n    return traceLog;\n  }\n\n  const allCorrectResponses = getAllCorrectResponses(question);\n\n  let bestMatch = { score: 0, response: [] };\n\n  allCorrectResponses.forEach((cr) => {\n    let matchCount = 0;\n    value.forEach((v, idx) => {\n      if (cr[idx] === v) {\n        matchCount++;\n      }\n    });\n\n    if (matchCount > bestMatch.score) {\n      bestMatch = { score: matchCount, response: cr };\n    }\n  });\n\n  const correctCount = bestMatch.score;\n  const incorrectCount = value.length - correctCount;\n\n  if (correctCount > 0) {\n    traceLog.push(`${correctCount} tile(s) placed in the correct order.`);\n    }\n\n    if (incorrectCount > 0) {\n    traceLog.push(`${incorrectCount} tile(s) placed in an incorrect order.`);\n  }\n\n  const isFullyCorrect = allCorrectResponses.some((cr) => isEqual(cr, value));\n\n  const partialScoringEnabled = partialScoring.enabled(question, env || {});\n\n  if (partialScoringEnabled) {\n    traceLog.push('Score calculated using partial scoring.');\n    traceLog.push(\n      'Each tile placed in the correct position contributes to the score.',\n    );\n  } else {\n    traceLog.push('Score calculated using all-or-nothing scoring.');\n    if (hasPlacementArea) {\n      traceLog.push(\n        'Student must place all tiles in the correct positions within the target area to receive full credit.',\n      );\n    } else {\n      traceLog.push(\n        'Student must arrange all tiles in the correct order to receive full credit.',\n      );\n    }\n  }\n\n  const rawScore = score(question, session);\n  const finalScore = partialScoringEnabled ? rawScore : rawScore === 1 ? 1 : 0;\n\n  traceLog.push(`Final score: ${finalScore}.`);\n\n  return traceLog;\n};\n\nexport function outcome(question, session, env) {\n  return new Promise((resolve, reject) => {\n    if (!session || isEmpty(session)) {\n      resolve({ \n        score: 0, \n        empty: true, \n        logTrace: ['Student did not interact with the placement-ordering item.'] \n      });\n      return;\n    }\n\n    if (!question || !question.correctResponse || isEmpty(question.correctResponse)) {\n      reject(questionError());\n    } else {\n      try {\n        const s = score(question, session);\n        const finalScore = partialScoring.enabled(question, env || {}) ? s : s === 1 ? 1 : 0;\n        resolve({\n          score: finalScore,\n          logTrace: getLogTrace(question, session, env)\n        });\n      } catch (e) {\n        reject(e);\n      }\n    }\n  });\n}\n\nexport function createDefaultModel(model = {}) {\n  return new Promise((resolve) => {\n    resolve({\n      ...defaults,\n      ...model,\n    });\n  });\n}\n\nexport const normalize = (question) => ({\n  ...defaults,\n  rationaleEnabled: true,\n  feedbackEnabled: false,\n  promptEnabled: true,\n  teacherInstructionsEnabled: true,\n  studentInstructionsEnabled: true,\n  ...question,\n});\n\n/**\n *\n * @param {*} question\n * @param {*} session\n * @param {*} env\n */\nexport async function model(question, session, env) {\n  const normalizedQuestion = normalize(question);\n  const base = {};\n\n  if (question.alternateResponses && every(question.alternateResponses, isArray)) {\n    log('Deprecated structure of alternateResponses is in use');\n    // eslint-disable-next-line no-console\n    console.error('Deprecated structure of alternateResponses is in use');\n  }\n\n  base.env = env;\n  base.extraCSSRules = normalizedQuestion.extraCSSRules;\n  base.outcomes = [];\n  base.completeLength = (normalizedQuestion.correctResponse || []).length;\n  base.choices = (normalizedQuestion.choices || []).filter((choice) => choice.label);\n  base.note = normalizedQuestion.note;\n  base.showNote = normalizedQuestion.alternateResponses && normalizedQuestion.alternateResponses.length > 0;\n  base.language = normalizedQuestion.language;\n\n  log('[model] removing tileSize for the moment.');\n\n  base.prompt = normalizedQuestion.promptEnabled ? normalizedQuestion.prompt : null;\n  base.config = {\n    orientation: normalizedQuestion.orientation || 'vertical',\n    includeTargets: normalizedQuestion.placementArea,\n    choiceLabelEnabled: normalizedQuestion.choiceLabelEnabled,\n    targetLabel: normalizedQuestion.targetLabel,\n    choiceLabel: normalizedQuestion.choiceLabel,\n    showOrdering: normalizedQuestion.numberedGuides,\n    allowSameChoiceInTargets: !normalizedQuestion.removeTilesAfterPlacing,\n  };\n\n  base.disabled = env.mode !== 'gather';\n\n  if (!base.note) {\n    base.note = translator.t('common:commonCorrectAnswerWithAlternates', { lng: normalizedQuestion.language });\n  }\n\n  if (env.role === 'instructor' && (env.mode === 'view' || env.mode === 'evaluate')) {\n    base.rationale = normalizedQuestion.rationaleEnabled ? normalizedQuestion.rationale : null;\n    base.teacherInstructions = normalizedQuestion.teacherInstructionsEnabled\n      ? normalizedQuestion.teacherInstructions\n      : null;\n  } else {\n    base.rationale = null;\n    base.teacherInstructions = null;\n  }\n\n  if (env.mode === 'evaluate') {\n    const value = (session && session.value) || [];\n    const allCorrectResponses = getAllCorrectResponses(normalizedQuestion);\n\n    const bestSetOfResponses = allCorrectResponses.reduce(\n      (info, cr) => {\n        const currentScore = reduce(value, (acc, c, idx) => acc + (Array.isArray(cr) && cr[idx] === c ? 1 : 0), 0);\n\n        if (currentScore > info.score) {\n          return {\n            arr: cr,\n            score: currentScore,\n          };\n        }\n\n        return info;\n      },\n      { arr: [], score: 0 },\n    );\n\n    base.outcomes = map(value, (c, idx) => {\n      return {\n        id: c,\n        outcome: bestSetOfResponses.arr[idx] === c ? 'correct' : 'incorrect',\n      };\n    });\n\n    const isResponseCorrect = allCorrectResponses.some((response) => isEqual(response, value));\n    const responseScore = score(question, session);\n    const isCorrect = responseScore === 1;\n    const isPartialCorrect = !isCorrect && partialScoring.enabled(normalizedQuestion, env || {}) && responseScore !== 0;\n\n    base.correctness = isCorrect ? 'correct' : isPartialCorrect ? 'partial' : 'incorrect';\n\n    if (!isResponseCorrect) {\n      base.correctResponse = flattenCorrect(normalizedQuestion);\n    }\n\n    // requirement made in PD-2182\n    if (!normalizedQuestion.feedback) {\n      normalizedQuestion.feedbackEnabled = false;\n    }\n\n    const feedback = normalizedQuestion.feedbackEnabled\n      ? await getFeedbackForCorrectness(base.correctness, normalizedQuestion.feedback)\n      : undefined;\n\n    base.feedback = feedback;\n    return base;\n  } else {\n    return base;\n  }\n}\n\nexport const createCorrectResponseSession = (question, env) => {\n  return new Promise((resolve) => {\n    if (env.mode !== 'evaluate' && env.role === 'instructor') {\n      resolve({\n        id: '1',\n        value: flattenCorrect(question),\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 { choices, correctResponse } = model;\n  const errors = {};\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  const reversedChoices = [...(choices || [])].reverse();\n  const choicesErrors = {};\n\n  reversedChoices.forEach((choice, index) => {\n    const { id, label } = choice;\n\n    if (!getContent(label)) {\n      choicesErrors[id] = 'Content should not be empty.';\n    } else {\n      const identicalAnswer = reversedChoices.slice(index + 1).some((c) => c.label === label);\n\n      if (identicalAnswer) {\n        choicesErrors[id] = 'Content should be unique.';\n      }\n    }\n  });\n\n  const choicesIds = (choices || []).map((choice) => choice.id);\n  const correctResponseIds = (correctResponse || []).map((response) => response.id || response);\n\n  if (isEqual(choicesIds, correctResponseIds)) {\n    errors.orderError = 'The correct ordering should not be identical to the initial ordering.';\n  }\n\n  if (!isEmpty(choicesErrors)) {\n    errors.choicesErrors = choicesErrors;\n  }\n\n  return errors;\n};\n"],"x_google_ignoreList":[0,1,2,3,4,5,6,7,8,9,10,11],"mappings":";;;;AAYA,SAAS,IAAO,CAEhB;;;ACFA,SAAS,EAAY,GAAO,GAAU,GAAa,GAAW;CAC5D,IAAI,IAAQ,IACR,IAAS,KAAS,OAAO,IAAI,EAAM;CAKvC,KAHI,KAAa,MACf,IAAc,EAAM,EAAE,KAEjB,EAAE,IAAQ,IACf,IAAc,EAAS,GAAa,EAAM,IAAQ,GAAO,CAAK;CAEhE,OAAO;AACT;;;ACMA,IAAI,IAAiB,EAAS,SAAS,GAAO,GAAQ;CACpD,IAAI,IAAa,EAAK,CAAM;CAI5B,OAHI,EAAkB,CAAU,MAC9B,IAAa,KAAA,IAER,EAAkB,CAAK,IAC1B,GAAe,GAAO,EAAY,GAAQ,GAAG,GAAmB,EAAI,GAAG,KAAA,GAAW,CAAU,IAC5F,CAAC;AACP,CAAC;;;AC3BD,SAAS,EAAW,GAAO,GAAW;CAIpC,KAHA,IAAI,IAAQ,IACR,IAAS,KAAS,OAAO,IAAI,EAAM,QAEhC,EAAE,IAAQ,IACf,IAAI,CAAC,EAAU,EAAM,IAAQ,GAAO,CAAK,GACvC,OAAO;CAGX,OAAO;AACT;;;ACTA,SAAS,EAAU,GAAY,GAAW;CACxC,IAAI,IAAS;CAKb,OAJA,EAAS,GAAY,SAAS,GAAO,GAAO,GAAY;EAEtD,OADA,IAAS,CAAC,CAAC,EAAU,GAAO,GAAO,CAAU,GACtC;CACT,CAAC,GACM;AACT;;;AC6BA,SAAS,EAAM,GAAY,GAAW,GAAO;CAC3C,IAAI,IAAO,EAAQ,CAAU,IAAI,IAAa;CAI9C,OAHI,KAAS,EAAe,GAAY,GAAW,CAAK,MACtD,IAAY,KAAA,IAEP,EAAK,GAAY,EAAa,GAAW,CAAC,CAAC;AACpD;;;ACxCA,SAAS,EAAW,GAAY,GAAU,GAAa,GAAW,GAAU;CAM1E,OALA,EAAS,GAAY,SAAS,GAAO,GAAO,GAAY;EACtD,IAAc,KACT,IAAY,IAAO,KACpB,EAAS,GAAa,GAAO,GAAO,CAAU;CACpD,CAAC,GACM;AACT;;;ACuBA,SAAS,EAAO,GAAY,GAAU,GAAa;CACjD,IAAI,IAAO,EAAQ,CAAU,IAAI,IAAc,GAC3C,IAAY,UAAU,SAAS;CAEnC,OAAO,EAAK,GAAY,EAAa,GAAU,CAAC,GAAG,GAAa,GAAW,CAAQ;AACrF;;;AClCA,IAAI,IAAc,KAAQ,IAAI,EAAW,IAAI,EAAI,GAAE,EAAE,CAAC,CAAC,EAAE,MAAO,WAAmB,SAAS,GAAQ;CAClG,OAAO,IAAI,EAAI,CAAM;AACvB,IAF4E,GCNxE,IAAmB;AAWvB,SAAS,GAAS,GAAO,GAAU,GAAY;CAC7C,IAAI,IAAQ,IACR,IAAW,GACX,IAAS,EAAM,QACf,IAAW,IACX,IAAS,CAAC,GACV,IAAO;CAEX,IAAI,GAEF,AADA,IAAW,IACX,IAAW;MAER,IAAI,KAAU,GAAkB;EACnC,IAAI,IAAM,IAAW,OAAO,EAAU,CAAK;EAC3C,IAAI,GACF,OAAO,EAAW,CAAG;EAIvB,AAFA,IAAW,IACX,IAAW,GACX,IAAO,IAAI,EAAO;CACpB,OAEE,IAAO,IAAW,CAAC,IAAI;CAEzB,OACA,OAAO,EAAE,IAAQ,IAAQ;EACvB,IAAI,IAAQ,EAAM,IACd,IAAW,IAAW,EAAS,CAAK,IAAI;EAG5C,IADA,IAAS,KAAc,MAAU,IAAK,IAAQ,GAC1C,KAAY,MAAa,GAAU;GAErC,KADA,IAAI,IAAY,EAAK,QACd,MACL,IAAI,EAAK,OAAe,GACtB,SAAS;GAMb,AAHI,KACF,EAAK,KAAK,CAAQ,GAEpB,EAAO,KAAK,CAAK;EACnB,OACK,AAAK,EAAS,GAAM,GAAU,CAAU,MACvC,MAAS,KACX,EAAK,KAAK,CAAQ,GAEpB,EAAO,KAAK,CAAK;CAErB;CACA,OAAO;AACT;;;ACjDA,SAAS,EAAK,GAAO;CACnB,OAAQ,KAAS,EAAM,SAAU,GAAS,CAAK,IAAI,CAAC;AACtD;;;ACFA,SAAgB,EAAY,GAAG,GAAG;CAC9B,IAAI,IAAI,GACJ,MAAU,WAAW,GAAG,EAAE,iBAAiB;CAC/C,IAAI,IAAI,GACJ,MAAU,WAAW,GAAG,EAAE,iBAAiB;CAC/C,IAAS,KAAL,GACA,OAAO;CACX,IAAI,IAAI,GACJ,OAAO;CACX,IAAI,CAAC,GAAI,GAAI,KAAM;EAAC,OAAO,CAAC;EAAG,OAAO,CAAC;EAAG;CAAE;CAC5C,OAAO,MACH,KAAM;CACV,OAAO;AACX;AAMA,SAAgB,EAAY,GAAG,GAAG;CAO9B,OANS,KAAL,KAEA,KAAK,IACE,KACP,IAAI,IACG,KACJ,EAAY,GAAG,CAAC,IAAI,EAAY,GAAG,CAAC;AAC/C;AAiEA,IAAM,IAAU,OAAO,SAAW,MAAc,SAAS,CAAC;AACrC,OAAO,EAAQ,eAAmB,cAE1C,EAAQ;;;mCCrGf,KAAA,GAAA,EAAA,SAAY,4CAA4C,GAEjD,KAAwB,MACnC,gBAAI,MAAM,sBAAsB,EAAO,gDAAgD,GAC5E,KAA4B,GAAS,GAAQ,MAAS;CAGjE,IAFA,IAAO;EAAE,iBAAiB;EAAO,qBAAqB;EAAO,GAAG;CAAK,GAEjE,CAAC,EAAK,mBAAmB,CAAC,EAAQ,EAAK,CAAO,GAAG,CAAO,GAC1D,MAAM,EAAqB,CAAM;CAGnC,IAAI,EAAK,oBAAoB,MAAS,EAAO,WAAW,EAAK,CAAM,EAAE,QACnE,OAAO;CAMT,IAHA,IAAS,EAAK,oBAAoB,KAAiB,EAAK,CAAM,IAApB,GAE1C,EAAI,WAAW,CAAM,GACjB,CAAC,MAAM,QAAQ,CAAO,KAAK,EAAQ,WAAW,GAChD,MAAU,MAAM,oCAAoC;CAGtD,IAAI,EAAQ,WAAW,GACrB,OAAO,KAAQ,GAAS,CAAM;CAWhC,IARI,CAAC,MAAM,QAAQ,CAAM,KAAK,EAAO,SAAS,KAI1C,EAAO,SAAS,EAAQ,UAIxB,EAAQ,WAAW,EAAO,UAAU,EAAK,qBAC3C,OAAO;CAGT,IAAM,IAAe,EAAY,GAAS,CAAC,EAAE,QAAQ,GAC/C,IAAc,EAAY,GAAQ,CAAC,EAAE,QAAQ,GAE7C,IAAO,EAAe,GAAa,GAAc,CAAO,GAExD,IAAkB,EAAa,SAAS,EAAY,QAEpD,IAAQ,EAAa,QAGrB,MAFS,IAAQ,EAAK,SAAS,KAEjB,GAAO,QAAQ,CAAC;CAEpC,OAAO,WAAW,CAAC;AACrB,GAMa,KAAkB,MAC7B,EAAS,kBAAkB,EAAS,gBAAgB,KAAK,MAAO,KAAK,EAAE,KAAK,EAAE,KAAK,CAAE,IAAI,CAAC,GAM/E,KAA0B,MAAa;CAClD,IAAM,KAAc,EAAS,sBAAsB,CAAC,GACjD,KAAK,MACA,MAAM,QAAQ,CAAS,IAClB,IAGF,EAAU,QAClB,EACA,QAAQ,MAAS,MAAS,KAAA,CAAS;CAEtC,OAAO,CAAC,EAAe,CAAQ,GAAG,GAAG,CAAU;AACjD,GASa,KAAS,GAAU,MAAY;CAC1C,IAAM,EAAE,aAAU,KAAW,CAAC;CAE9B,IAAI,CAAC,GACH,OAAO;CAGT,IAAM,IAAqB,EAAuB,CAAQ,GACpD,KAAmB,EAAS,aAAa,EAAS,UAAU,6BAA6B,IAO3F,IAAY;CAYhB,OAVA,EAAmB,SAAS,MAAO;EACjC,IAAM,IAAe,EAAyB,GAAI,GAAO,EACvD,mBACF,CAAC;EAED,AAAI,KAAgB,MAClB,IAAY;CAEhB,CAAC,GAEM;AACT,GC9HI,IAAI;CACP,SAAS;EACR,MAAM;EACN,SAAS;EACT,QAAQ;CACT;CACA,WAAW;EACV,MAAM;EACN,SAAS;EACT,QAAQ;CACT;CACA,SAAS;EACR,MAAM;EACN,SAAS;EACT,QAAQ;CACT;CACA,YAAY;EACX,MAAM;EACN,SAAS;EACT,QAAQ;CACT;AACD;AAGA,SAAS,EAAE,GAAG;CACb,OAAO,MAAM,sBAAsB,YAAY;AAChD;AAGA,SAAS,EAAE,GAAG,IAAI,CAAC,GAAG;CACrB,OAAO,IAAI,SAAS,MAAM;EACzB,IAAI,IAAI;GACP,GAAG;GACH,GAAG;EACJ,GAAG,IAAI,EAAE,CAAC,GAAG,IAAI,EAAE,IAAI,IAAI,EAAE;EAC7B,EAAE,GAAG,EAAE,EAAE,KAAK,EAAE,KAAK,CAAC;CACvB,CAAC;AACF;AACA,SAAS,EAAE,GAAG,GAAG;CAChB,OAAO,IAAI,SAAS,MAAM;EACzB,IAAI,CAAC,KAAK,EAAE,SAAS,QAAQ;GAC5B,EAAE,KAAK,CAAC;GACR;EACD;EACA,EAAE,EAAE,EAAE,SAAS,CAAC;CACjB,CAAC;AACF;;;AC9CA,IAAI,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;;;ACxCA,IAAA,IAAe;CACb,aAAa;CACb,oBAAoB;CACpB,SAAS,CAAC;CACV,iBAAiB,CAAC;CAClB,iBAAiB;CACjB,gBAAgB;CAChB,aAAa;CACb,gBAAgB;CAChB,eAAe;CACf,QAAQ;CACR,eAAe;CACf,WAAW;CACX,kBAAkB;CAClB,yBAAyB;CACzB,aAAa;CACb,4BAA4B;CAC5B,aAAa;CACb,qBAAqB;CACrB,4BAA4B;CAC5B,uBAAuB;AACzB,GCZM,KAAA,GAAA,EAAA,SAAY,4CAA4C,GAGxD,EAAE,kBAAe,GAEV,UAAsB,gBAAI,MAAM,qDAAqD,GASrF,KAAe,GAAU,GAAS,MAAQ;CACrD,IAAM,IAAW,CAAC,GAEZ,IAAQ,GAAS,SAAS,CAAC;CACT,GAAU;CAClC,IAAM,IAAmB,GAAU,kBAAkB;CAErD,IAAI,CAAC,EAAM,QAOT,OANI,IACF,EAAS,KAAK,qDAAqD,IAEnE,EAAS,KAAK,oCAAoC,GAEpD,EAAS,KAAK,iBAAiB,GACxB;CAGT,IAAM,IAAsB,EAAuB,CAAQ,GAEvD,IAAY;EAAE,OAAO;EAAG,UAAU,CAAC;CAAE;CAEzC,EAAoB,SAAS,MAAO;EAClC,IAAI,IAAa;EAOjB,AANA,EAAM,SAAS,GAAG,MAAQ;GACxB,AAAI,EAAG,OAAS,KACd;EAEJ,CAAC,GAEG,IAAa,EAAU,UACzB,IAAY;GAAE,OAAO;GAAY,UAAU;EAAG;CAElD,CAAC;CAED,IAAM,IAAe,EAAU,OACzB,IAAiB,EAAM,SAAS;CAUf,AARnB,IAAe,KACjB,EAAS,KAAK,GAAG,EAAa,sCAAsC,GAGhE,IAAiB,KACrB,EAAS,KAAK,GAAG,EAAe,uCAAuC,GAGlD,EAAoB,MAAM,MAAO,EAAQ,GAAI,CAAK,CAAC;CAE1E,IAAM,IAAwB,EAAe,QAAQ,GAAU,KAAO,CAAC,CAAC;CAExE,AAAI,KACF,EAAS,KAAK,yCAAyC,GACvD,EAAS,KACP,oEACF,MAEA,EAAS,KAAK,gDAAgD,GAC1D,IACF,EAAS,KACP,sGACF,IAEA,EAAS,KACP,6EACF;CAIJ,IAAM,IAAW,EAAM,GAAU,CAAO,GAClC,IAAa,IAAwB,IAAW,QAAa;CAInE,OAFA,EAAS,KAAK,gBAAgB,EAAW,EAAE,GAEpC;AACT;AAEA,SAAgB,GAAQ,GAAU,GAAS,GAAK;CAC9C,OAAO,IAAI,SAAS,GAAS,MAAW;EACtC,IAAI,CAAC,KAAW,EAAQ,CAAO,GAAG;GAChC,EAAQ;IACN,OAAO;IACP,OAAO;IACP,UAAU,CAAC,4DAA4D;GACzE,CAAC;GACD;EACF;EAEA,IAAI,CAAC,KAAY,CAAC,EAAS,mBAAmB,EAAQ,EAAS,eAAe,GAC5E,EAAO,EAAc,CAAC;OAEtB,IAAI;GACF,IAAM,IAAI,EAAM,GAAU,CAAO;GAEjC,EAAQ;IACN,OAFiB,EAAe,QAAQ,GAAU,KAAO,CAAC,CAAC,IAAI,IAAI,QAAM;IAGzE,UAAU,EAAY,GAAU,GAAS,CAAG;GAC9C,CAAC;EACH,SAAS,GAAG;GACV,EAAO,CAAC;EACV;CAEJ,CAAC;AACH;AAEA,SAAgB,GAAmB,IAAQ,CAAC,GAAG;CAC7C,OAAO,IAAI,SAAS,MAAY;EAC9B,EAAQ;GACN,GAAG;GACH,GAAG;EACL,CAAC;CACH,CAAC;AACH;AAEA,IAAa,KAAa,OAAc;CACtC,GAAG;CACH,kBAAkB;CAClB,iBAAiB;CACjB,eAAe;CACf,4BAA4B;CAC5B,4BAA4B;CAC5B,GAAG;AACL;AAQA,eAAsB,GAAM,GAAU,GAAS,GAAK;CAClD,IAAM,IAAqB,EAAU,CAAQ,GACvC,IAAO,CAAC;CA8Cd,IA5CI,EAAS,sBAAsB,EAAM,EAAS,oBAAoB,CAAO,MAC3E,EAAI,sDAAsD,GAE1D,QAAQ,MAAM,sDAAsD,IAGtE,EAAK,MAAM,GACX,EAAK,gBAAgB,EAAmB,eACxC,EAAK,WAAW,CAAC,GACjB,EAAK,kBAAkB,EAAmB,mBAAmB,CAAC,GAAG,QACjE,EAAK,WAAW,EAAmB,WAAW,CAAC,GAAG,QAAQ,MAAW,EAAO,KAAK,GACjF,EAAK,OAAO,EAAmB,MAC/B,EAAK,WAAW,EAAmB,sBAAsB,EAAmB,mBAAmB,SAAS,GACxG,EAAK,WAAW,EAAmB,UAEnC,EAAI,2CAA2C,GAE/C,EAAK,SAAS,EAAmB,gBAAgB,EAAmB,SAAS,MAC7E,EAAK,SAAS;EACZ,aAAa,EAAmB,eAAe;EAC/C,gBAAgB,EAAmB;EACnC,oBAAoB,EAAmB;EACvC,aAAa,EAAmB;EAChC,aAAa,EAAmB;EAChC,cAAc,EAAmB;EACjC,0BAA0B,CAAC,EAAmB;CAChD,GAEA,EAAK,WAAW,EAAI,SAAS,UAE7B,AACE,EAAK,SAAO,EAAW,EAAE,4CAA4C,EAAE,KAAK,EAAmB,SAAS,CAAC,GAGvG,EAAI,SAAS,iBAAiB,EAAI,SAAS,UAAU,EAAI,SAAS,eACpE,EAAK,YAAY,EAAmB,mBAAmB,EAAmB,YAAY,MACtF,EAAK,sBAAsB,EAAmB,6BAC1C,EAAmB,sBACnB,SAEJ,EAAK,YAAY,MACjB,EAAK,sBAAsB,OAGzB,EAAI,SAAS,YAAY;EAC3B,IAAM,IAAS,KAAW,EAAQ,SAAU,CAAC,GACvC,IAAsB,EAAuB,CAAkB,GAE/D,IAAqB,EAAoB,QAC5C,GAAM,MAAO;GACZ,IAAM,IAAe,EAAO,IAAQ,GAAK,GAAG,MAAQ,KAAO,MAAM,QAAQ,CAAE,KAAK,EAAG,OAAS,IAAI,IAAI,IAAI,CAAC;GASzG,OAPI,IAAe,EAAK,QACf;IACL,KAAK;IACL,OAAO;GACT,IAGK;EACT,GACA;GAAE,KAAK,CAAC;GAAG,OAAO;EAAE,CACtB;EAEA,EAAK,WAAW,EAAI,IAAQ,GAAG,OACtB;GACL,IAAI;GACJ,SAAS,EAAmB,IAAI,OAAS,IAAI,YAAY;EAC3D,EACD;EAED,IAAM,IAAoB,EAAoB,MAAM,MAAa,EAAQ,GAAU,CAAK,CAAC,GACnF,IAAgB,EAAM,GAAU,CAAO,GACvC,IAAY,MAAkB,GAC9B,IAAmB,CAAC,KAAa,EAAe,QAAQ,GAAoB,KAAO,CAAC,CAAC,KAAK,MAAkB;EAkBlH,OAhBA,EAAK,cAAc,IAAY,YAAY,IAAmB,YAAY,aAErE,MACH,EAAK,kBAAkB,EAAe,CAAkB,IAIrD,EAAmB,aACtB,EAAmB,kBAAkB,KAOvC,EAAK,WAJY,EAAmB,kBAChC,MAAM,EAA0B,EAAK,aAAa,EAAmB,QAAQ,IAC7E,KAAA,GAGG;CACT,OACE,OAAO;AAEX;AAEA,IAAa,MAAgC,GAAU,MAC9C,IAAI,SAAS,MAAY;CAC9B,AAAI,EAAI,SAAS,cAAc,EAAI,SAAS,eAC1C,EAAQ;EACN,IAAI;EACJ,OAAO,EAAe,CAAQ;CAChC,CAAC,IAED,EAAQ,IAAI;AAEhB,CAAC,GAOG,KAAc,OAAU,KAAQ,IAAI,QAAQ,sCAAsC,EAAE,GAE7E,MAAY,IAAQ,CAAC,GAAG,IAAS,CAAC,MAAM;CACnD,IAAM,EAAE,YAAS,uBAAoB,GAC/B,IAAS,CAAC;CAEhB;EAAC;EAAuB;EAAU;CAAW,EAAE,SAAS,MAAU;EAChE,AAAI,EAAO,IAAQ,YAAY,CAAC,EAAW,EAAM,EAAM,MACrD,EAAO,KAAS;CAEpB,CAAC;CAED,IAAM,IAAkB,CAAC,GAAI,KAAW,CAAC,CAAE,EAAE,QAAQ,GAC/C,IAAgB,CAAC;CA2BvB,OAzBA,EAAgB,SAAS,GAAQ,MAAU;EACzC,IAAM,EAAE,OAAI,aAAU;EAEtB,AAAK,EAAW,CAAK,IAGK,EAAgB,MAAM,IAAQ,CAAC,EAAE,MAAM,MAAM,EAAE,UAAU,CAE7E,MACF,EAAc,KAAM,+BALtB,EAAc,KAAM;CAQxB,CAAC,GAKG,GAHgB,KAAW,CAAC,GAAG,KAAK,MAAW,EAAO,EAG9C,IAFgB,KAAmB,CAAC,GAAG,KAAK,MAAa,EAAS,MAAM,CAE5D,CAAkB,MACxC,EAAO,aAAa,0EAGjB,EAAQ,CAAa,MACxB,EAAO,gBAAgB,IAGlB;AACT"}