@pie-element/number-line 13.1.2-next.0 → 13.1.2-next.1

package/dist/browser/controller/index.js

@@ -1,261 +1,7 @@
-import { A as e, Da as t, Dr as n, E as r, Er as i, F as a, Gt as o, I as s, Jr as c, N as l, O as u, P as d, Pn as f, Qn as p, Sn as m, T as h, Yn as g, _, b as v, d as ee, f as y, fa as b, ft as x, g as te, i as S, j as ne, k as re, l as ie, li as C, n as ae, o as oe, pa as w, r as T, s as se, t as ce, ti as E, w as le, x as D, y as ue, yt as O } from "../uniqWith-CKN50xMI.js";
-import { _ as de, a as fe, c as k, d as pe, h as me, i as he, l as A, m as ge, n as j, o as _e, r as ve, s as M, t as ye, u as N, v as be } from "../_baseSet-ycZx94p7.js";
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_isIterateeCall.js
-function xe(t, n, r) {
-	if (!a(r)) return !1;
-	var i = typeof n;
-	return (i == "number" ? le(r) && e(n, r.length) : i == "string" && n in r) ? u(r[n], t) : !1;
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_createAssigner.js
-function Se(e) {
-	return pe(function(t, n) {
-		var r = -1, i = n.length, a = i > 1 ? n[i - 1] : void 0, o = i > 2 ? n[2] : void 0;
-		for (a = e.length > 3 && typeof a == "function" ? (i--, a) : void 0, o && xe(n[0], n[1], o) && (a = i < 3 ? void 0 : a, i = 1), t = Object(t); ++r < i;) {
-			var s = n[r];
-			s && e(t, s, r, a);
-		}
-		return t;
-	});
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_baseIsMatch.js
-var Ce = 1, we = 2;
-function Te(e, t, n, r) {
-	var i = n.length, a = i, o = !r;
-	if (e == null) return !a;
-	for (e = Object(e); i--;) {
-		var s = n[i];
-		if (o && s[2] ? s[1] !== e[s[0]] : !(s[0] in e)) return !1;
-	}
-	for (; ++i < a;) {
-		s = n[i];
-		var c = s[0], l = e[c], u = s[1];
-		if (o && s[2]) {
-			if (l === void 0 && !(c in e)) return !1;
-		} else {
-			var d = new y();
-			if (r) var f = r(l, u, c, e, t, d);
-			if (!(f === void 0 ? T(u, l, Ce | we, r, d) : f)) return !1;
-		}
-	}
-	return !0;
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_isStrictComparable.js
-function P(e) {
-	return e === e && !a(e);
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_getMatchData.js
-function Ee(e) {
-	for (var t = _(e), n = t.length; n--;) {
-		var r = t[n], i = e[r];
-		t[n] = [
-			r,
-			i,
-			P(i)
-		];
-	}
-	return t;
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_matchesStrictComparable.js
-function F(e, t) {
-	return function(n) {
-		return n == null ? !1 : n[e] === t && (t !== void 0 || e in Object(n));
-	};
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_baseMatches.js
-function De(e) {
-	var t = Ee(e);
-	return t.length == 1 && t[0][2] ? F(t[0][0], t[0][1]) : function(n) {
-		return n === e || Te(n, e, t);
-	};
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_baseHasIn.js
-function Oe(e, t) {
-	return e != null && t in Object(e);
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_hasPath.js
-function ke(t, n, r) {
-	n = A(n, t);
-	for (var i = -1, a = n.length, o = !1; ++i < a;) {
-		var c = k(n[i]);
-		if (!(o = t != null && r(t, c))) break;
-		t = t[c];
-	}
-	return o || ++i != a ? o : (a = t == null ? 0 : t.length, !!a && h(a) && e(c, a) && (s(t) || D(t)));
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/hasIn.js
-function Ae(e, t) {
-	return e != null && ke(e, t, Oe);
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_baseMatchesProperty.js
-var je = 1, Me = 2;
-function Ne(e, t) {
-	return N(e) && P(t) ? F(k(e), t) : function(n) {
-		var r = _e(n, e);
-		return r === void 0 && r === t ? Ae(n, e) : T(t, r, je | Me);
-	};
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_basePropertyDeep.js
-function Pe(e) {
-	return function(t) {
-		return M(t, e);
-	};
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/property.js
-function Fe(e) {
-	return N(e) ? he(k(e)) : Pe(e);
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_baseIteratee.js
-function I(e) {
-	return typeof e == "function" ? e : e == null ? ge : typeof e == "object" ? s(e) ? Ne(e[0], e[1]) : De(e) : Fe(e);
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_createBaseFor.js
-function Ie(e) {
-	return function(t, n, r) {
-		for (var i = -1, a = Object(t), o = r(t), s = o.length; s--;) {
-			var c = o[e ? s : ++i];
-			if (n(a[c], c, a) === !1) break;
-		}
-		return t;
-	};
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_baseFor.js
-var Le = Ie();
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_assignMergeValue.js
-function L(e, t, n) {
-	(n !== void 0 && !u(e[t], n) || n === void 0 && !(t in e)) && re(e, t, n);
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_safeGet.js
-function R(e, t) {
-	if (!(t === "constructor" && typeof e[t] == "function") && t != "__proto__") return e[t];
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/toPlainObject.js
-function Re(e) {
-	return r(e, te(e));
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_baseMergeDeep.js
-function ze(e, t, n, r, i, o, c) {
-	var u = R(e, n), f = R(t, n), p = c.get(f);
-	if (p) {
-		L(e, n, p);
-		return;
-	}
-	var m = o ? o(u, f, n + "", e, t, c) : void 0, h = m === void 0;
-	if (h) {
-		var g = s(f), _ = !g && v(f), y = !g && !_ && ue(f);
-		m = f, g || _ || y ? s(u) ? m = u : ve(u) ? m = l(u) : _ ? (h = !1, m = ee(f, !0)) : y ? (h = !1, m = se(f, !0)) : m = [] : fe(f) || D(f) ? (m = u, D(u) ? m = Re(u) : (!a(u) || d(u)) && (m = oe(f))) : h = !1;
-	}
-	h && (c.set(f, m), i(m, f, r, o, c), c.delete(f)), L(e, n, m);
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_baseMerge.js
-function z(e, t, n, r, i) {
-	e !== t && Le(t, function(o, s) {
-		if (i ||= new y(), a(o)) ze(e, t, s, n, z, r, i);
-		else {
-			var c = r ? r(R(e, s), o, s + "", e, t, i) : void 0;
-			c === void 0 && (c = o), L(e, s, c);
-		}
-	}, te);
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_createFind.js
-function Be(e) {
-	return function(t, n, r) {
-		var i = Object(t);
-		if (!le(t)) {
-			var a = I(n, 3);
-			t = _(t), n = function(e) {
-				return a(i[e], e, i);
-			};
-		}
-		var o = e(t, n, r);
-		return o > -1 ? i[a ? t[o] : o] : void 0;
-	};
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/findIndex.js
-var Ve = Math.max;
-function He(e, t, n) {
-	var r = e == null ? 0 : e.length;
-	if (!r) return -1;
-	var i = n == null ? 0 : me(n);
-	return i < 0 && (i = Ve(r + i, 0)), ne(e, I(t, 3), i);
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/find.js
-var Ue = Be(He);
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/isEqualWith.js
-function We(e, t, n) {
-	n = typeof n == "function" ? n : void 0;
-	var r = n ? n(e, t) : void 0;
-	return r === void 0 ? T(e, t, void 0, n) : !!r;
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/merge.js
-var Ge = Se(function(e, t, n) {
-	z(e, t, n);
-}), Ke = "Expected a function";
-function qe(e) {
-	if (typeof e != "function") throw TypeError(Ke);
-	return function() {
-		var t = arguments;
-		switch (t.length) {
-			case 0: return !e.call(this);
-			case 1: return !e.call(this, t[0]);
-			case 2: return !e.call(this, t[0], t[1]);
-			case 3: return !e.call(this, t[0], t[1], t[2]);
-		}
-		return !e.apply(this, t);
-	};
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/_basePickBy.js
-function Je(e, t, n) {
-	for (var r = -1, i = t.length, a = {}; ++r < i;) {
-		var o = t[r], s = M(e, o);
-		n(s, o) && ye(a, A(o, e), s);
-	}
-	return a;
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/pickBy.js
-function Ye(e, t) {
-	if (e == null) return {};
-	var n = de(ie(e), function(e) {
-		return [e];
-	});
-	return t = I(t), Je(e, n, function(e, n) {
-		return t(e, n[0]);
-	});
-}
-//#endregion
-//#region ../../../node_modules/.bun/lodash-es@4.18.1/node_modules/lodash-es/omitBy.js
-function B(e, t) {
-	return Ye(e, qe(I(t)));
-}
-//#endregion
+import { $r as e, Et as t, G as n, In as r, Kr as i, Q as a, a as o, bn as s, c, cn as l, d as u, f as d, ga as f, h as p, ha as m, i as h, ja as g, l as _, li as v, m as y, n as b, vr as x, yr as S, zn as C } from "../dist-D5T-OaLo.js";
+import { t as w } from "../impureFunctionsAny.generated-Bqfato71.js";
 //#region ../../shared/feedback/dist/index.js
-var V = {
+var T = {
 	correct: {
 		type: "default",
 		default: "Correct",
@@ -277,19 +23,19 @@ var V = {
 		custom: "You have not entered a response"
 	}
 };
-function Xe(e) {
+function E(e) {
 	return e === "partially-correct" ? "partial" : e;
 }
-function Ze(e, t = {}) {
+function ee(e, t = {}) {
 	return new Promise((n) => {
 		let r = {
-			...V,
+			...T,
 			...t
-		}, i = Xe(e), a = r[i], o = V[i];
-		Qe(a, o[a.type]).then(n);
+		}, i = E(e), a = r[i], o = T[i];
+		te(a, o[a.type]).then(n);
 	});
 }
-function Qe(e, t) {
+function te(e, t) {
 	return new Promise((n) => {
 		if (!e || e.type === "none") {
 			n(void 0);
@@ -300,20 +46,20 @@ function Qe(e, t) {
 }
 //#endregion
 //#region ../../shared/controller-utils/dist/index.js
-var H = Object.defineProperty, U = /* @__PURE__ */ ((e, t) => {
+var D = Object.defineProperty, O = /* @__PURE__ */ ((e, t) => {
 	let n = {};
-	for (var r in e) H(n, r, {
+	for (var r in e) D(n, r, {
 		get: e[r],
 		enumerable: !0
 	});
-	return t || H(n, Symbol.toStringTag, { value: "Module" }), n;
-})({ enabled: () => $e });
-function $e(e, t, n) {
+	return t || D(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 W = {
+var A = {
 	correctResponse: [],
 	feedback: {
 		correct: {
@@ -359,7 +105,7 @@ var W = {
 	teacherInstructionsEnabled: !0,
 	toolbarEditorPosition: "bottom",
 	widthEnabled: !0
-}, et = [
+}, j = [
 	.001,
 	.01,
 	.02,
@@ -370,7 +116,7 @@ var W = {
 	.2,
 	.25,
 	.5
-], tt = [
+], ne = [
 	"1/1000",
 	"1/100",
 	"1/64",
@@ -390,7 +136,7 @@ var W = {
 	"1/4",
 	"1/3",
 	"1/2"
-], G = {
+], M = {
 	1: [
 		1,
 		2,
@@ -511,96 +257,96 @@ var W = {
 		8,
 		10
 	]
-}, nt = (e, r, a) => {
-	if (!f(c(x(e), x(a)), 0)) throw Error("start point must be divisible by interval");
-	if (f(e, r)) return [];
-	let o = t(r, c(r, x(a))), s = i(a, 0) ? "positive" : "negative";
-	if (s === "negative" && n(r, e)) throw Error("start must be > than end when doing a negative decrement");
-	if (s === "positive" && w(r, e)) throw Error("start must be < end when doing increments");
-	let l = s === "positive" ? w : f(o, r) ? n : i, u = [], d = e;
-	for (; l(d, o);) u.push(d), d = O(d, a);
+}, re = (e, t, r) => {
+	if (!s(i(n(e), n(r)), 0)) throw Error("start point must be divisible by interval");
+	if (s(e, t)) return [];
+	let o = g(t, i(t, n(r))), c = x(r, 0) ? "positive" : "negative";
+	if (c === "negative" && S(t, e)) throw Error("start must be > than end when doing a negative decrement");
+	if (c === "positive" && f(t, e)) throw Error("start must be < end when doing increments");
+	let l = c === "positive" ? f : s(o, t) ? S : x, u = [], d = e;
+	for (; l(d, o);) u.push(d), d = a(d, r);
 	return u;
-}, rt = (e, t) => `Can only do a positive or negative range, but got: start: ${e} and end:${t}`, K = (e, n, r) => {
-	if (e = p(e), n = p(n), r = p(r), i(x(t(n, e)), x(n))) throw Error(rt(e, n));
-	let a = {
-		start: x(e),
-		end: x(n),
-		interval: x(r),
-		multiplier: b(r, 0) ? -1 : 1
-	}, o = c(a.start, a.interval), s = nt(i(o, 0) ? O(t(a.start, o), a.interval) : a.start, a.end, a.interval), l = a.multiplier === -1 ? s.map((e) => E(e, -1)) : s;
-	return b(r, 0) && l.reverse(), l;
-}, it = (e, t) => (e = p(e), t = p(t), b(e, t) ? e : t), at = (e, t) => (e = p(e), t = p(t), i(e, t) ? e : t), ot = (e, t, n) => {
-	e = p(e), t = p(t), n = p(n);
-	let r = i(t, 0) ? K(at(0, e), t, n) : [];
-	return ce((b(e, 0) ? K(it(0, t), e, E(n, -1)) : []).concat(r), f);
-}, st = (e, t, n) => {
+}, ie = (e, t) => `Can only do a positive or negative range, but got: start: ${e} and end:${t}`, N = (t, r, o) => {
+	if (t = C(t), r = C(r), o = C(o), x(n(g(r, t)), n(r))) throw Error(ie(t, r));
+	let s = {
+		start: n(t),
+		end: n(r),
+		interval: n(o),
+		multiplier: m(o, 0) ? -1 : 1
+	}, c = i(s.start, s.interval), l = re(x(c, 0) ? a(g(s.start, c), s.interval) : s.start, s.end, s.interval), u = s.multiplier === -1 ? l.map((t) => e(t, -1)) : l;
+	return m(o, 0) && u.reverse(), u;
+}, ae = (e, t) => (e = C(e), t = C(t), m(e, t) ? e : t), oe = (e, t) => (e = C(e), t = C(t), x(e, t) ? e : t), se = (t, n, r) => {
+	t = C(t), n = C(n), r = C(r);
+	let i = x(n, 0) ? N(oe(0, t), n, r) : [];
+	return d((m(t, 0) ? N(ae(0, n), t, e(r, -1)) : []).concat(i), s);
+}, P = (e, t, n) => {
 	n ||= 2;
 	let r = 10 ** -n / 2;
 	return Math.abs(e - t) < r;
-}, q = (e, t, n) => b(Y(e), Y(t)) ? t : i(Y(e), Y(n)) ? n : e, J = (e, t) => {
-	let n = C(E(10, m(p(e.max - e.min), t)));
+}, F = (e, t, n) => m(R(e), R(t)) ? t : x(R(e), R(n)) ? n : e, I = (t, n) => {
+	let r = v(e(10, l(C(t.max - t.min), n)));
 	return {
-		min: n,
-		max: C(E(20, n))
+		min: r,
+		max: v(e(20, r))
 	};
-}, ct = (e, t) => f(c(e, t), 0), Y = (e) => {
-	if (a(e)) return p(e.n * e.s, e.d);
-	if (ae(e)) return p(e);
-}, lt = (e, t, n, r) => {
-	let i = r ? r.limit !== !1 : !0, a = J(e, t), o = i ? q(Y(n.minor), a.min, a.max) : Y(n.minor), s = i ? q(Y(n.major), o, E(o, 20)) : Y(n.major);
-	if (!ct(s, o)) {
-		let e = m(s, o);
+}, L = (e, t) => s(i(e, t), 0), R = (e) => {
+	if (h(e)) return C(e.n * e.s, e.d);
+	if (_(e)) return C(e);
+}, z = (t, n, r, i) => {
+	let a = i ? i.limit !== !1 : !0, o = I(t, n), s = a ? F(R(r.minor), o.min, o.max) : R(r.minor), c = a ? F(R(r.major), s, e(s, 20)) : R(r.major);
+	if (!L(c, s)) {
+		let t = l(c, s);
 		return {
-			minor: o,
-			major: E(o, e <= 2 ? 2 : Math.round(e))
+			minor: s,
+			major: e(s, t <= 2 ? 2 : Math.round(t))
 		};
 	}
 	return {
-		major: s,
-		minor: o
+		major: c,
+		minor: s
 	};
-}, ut = (e, t, n, r) => (n = lt(e, t, n, r), ot(e.min, e.max, n.minor).filter((t) => w(t, p(e.max))).map((e) => {
+}, B = (e, t, n, r) => (n = z(e, t, n, r), se(e.min, e.max, n.minor).filter((t) => f(t, C(e.max))).map((e) => {
 	let t = "minor";
-	return st(C(c(e, n.major)), 0) && (t = "major"), {
+	return P(v(i(e, n.major)), 0) && (t = "major"), {
 		x: e,
 		type: t
 	};
-})), X = (e) => {
+})), V = (e) => {
 	let t = {
 		fraction: [],
 		decimal: []
 	};
-	return et.forEach((n) => {
+	return j.forEach((n) => {
 		n >= e.min && n <= e.max && t.decimal.push(n);
-	}), tt.forEach((n) => {
-		let r = C(p(n));
+	}), ne.forEach((n) => {
+		let r = v(C(n));
 		r >= e.min && r <= e.max && t.fraction.push(n);
 	}), t;
-}, dt = (e, t, n) => {
-	let r = {
+}, H = (t, n, r) => {
+	let i = {
 		decimal: [],
 		fraction: []
-	}, i = p(C(C(e))), a = i.n, o = i.d;
-	if (a >= 1 && o === 1) for (let i = 1; i <= 10; i++) {
-		let o = C(E(a, i));
-		ft(t, n, {
-			minor: e,
-			major: o
-		}, { fraction: void 0 }).filter((e) => e.type === "major").length > 1 && (r.fraction.push(o.toString()), r.decimal.push(o));
+	}, a = C(v(v(t))), o = a.n, s = a.d;
+	if (o >= 1 && s === 1) for (let a = 1; a <= 10; a++) {
+		let s = v(e(o, a));
+		U(n, r, {
+			minor: t,
+			major: s
+		}, { fraction: void 0 }).filter((e) => e.type === "major").length > 1 && (i.fraction.push(s.toString()), i.decimal.push(s));
 	}
-	else for (let i in G[o]) {
-		let s = E(p(a, o), G[o][i]);
-		ft(t, n, {
-			minor: e,
-			major: C(s)
-		}, { fraction: void 0 }).filter((e) => e.type === "major").length > 1 && (s.d === 1 ? r.fraction.push(s.n.toString()) : r.fraction.push(s.n + "/" + s.d), r.decimal.push(C(s)));
+	else for (let a in M[s]) {
+		let c = e(C(o, s), M[s][a]);
+		U(n, r, {
+			minor: t,
+			major: v(c)
+		}, { fraction: void 0 }).filter((e) => e.type === "major").length > 1 && (c.d === 1 ? i.fraction.push(c.n.toString()) : i.fraction.push(c.n + "/" + c.d), i.decimal.push(v(c)));
 	}
-	return r;
-}, ft = (e, t, n, r) => ut(e, t, n, r).map((e) => r.fraction ? e : {
+	return i;
+}, U = (e, t, n, r) => B(e, t, n, r).map((e) => r.fraction ? e : {
 	...e,
-	x: C(e.x) || 0
-}), pt = (e) => {
-	let { domain: t, ticks: n, width: r } = e, i = dt(n.minor, t, r);
+	x: v(e.x) || 0
+}), W = (e) => {
+	let { domain: t, ticks: n, width: r } = e, i = H(n.minor, t, r);
 	if (i.decimal.indexOf(n.major) === -1) {
 		let e = 0;
 		e = n.tickIntervalType === "Integer" && i.decimal.length > 4 ? 4 : i.decimal.length - 1, n.major = i.decimal[e];
@@ -609,132 +355,132 @@ var W = {
 		...e,
 		ticks: n
 	};
-}, mt = (e) => {
-	let { domain: t, ticks: n = {}, width: r } = e;
-	n.tickIntervalType || (n.minor > .5 ? n.tickIntervalType = "Integer" : n.tickIntervalType = "Decimal");
-	let i = J(t, r);
-	if (i.min >= 1) n.tickIntervalType = "Integer", n.minor = n.minor < 1 ? C(o(i.min)) : n.minor >= C(o(i.min)) && n.minor <= C(g(i.max)) ? n.minor : C(o(i.min)), n.integerTick = n.minor, n.fractionTick = "0", n.decimalTick = 0;
-	else if (i.min >= 0 && i.max < 1) {
-		n.tickIntervalType === "Integer" && (n.tickIntervalType = "Fraction");
-		let e = X(i), t = C(p(e.fraction[0])), r = C(p(e.fraction[e.fraction.length - 1]));
-		if (n.minor < t || n.minor > r) switch (n.tickIntervalType) {
+}, G = (e) => {
+	let { domain: n, ticks: i = {}, width: a } = e;
+	i.tickIntervalType || (i.minor > .5 ? i.tickIntervalType = "Integer" : i.tickIntervalType = "Decimal");
+	let o = I(n, a);
+	if (o.min >= 1) i.tickIntervalType = "Integer", i.minor = i.minor < 1 ? v(t(o.min)) : i.minor >= v(t(o.min)) && i.minor <= v(r(o.max)) ? i.minor : v(t(o.min)), i.integerTick = i.minor, i.fractionTick = "0", i.decimalTick = 0;
+	else if (o.min >= 0 && o.max < 1) {
+		i.tickIntervalType === "Integer" && (i.tickIntervalType = "Fraction");
+		let e = V(o), t = v(C(e.fraction[0])), n = v(C(e.fraction[e.fraction.length - 1]));
+		if (i.minor < t || i.minor > n) switch (i.tickIntervalType) {
 			case "Fraction":
-				n.minor = C(p(e.fraction[e.fraction.length - 1])), n.fractionTick = e.fraction[e.fraction.length - 1], n.decimalTick = e.decimal[0];
+				i.minor = v(C(e.fraction[e.fraction.length - 1])), i.fractionTick = e.fraction[e.fraction.length - 1], i.decimalTick = e.decimal[0];
 				break;
 			case "Decimal":
-			case "Integer": n.minor = e.decimal[e.decimal.length - 1], n.decimalTick = e.decimal[e.decimal.length - 1], n.fractionTick = e.fraction[0];
+			case "Integer": i.minor = e.decimal[e.decimal.length - 1], i.decimalTick = e.decimal[e.decimal.length - 1], i.fractionTick = e.fraction[0];
 		}
-		else switch (n.tickIntervalType) {
+		else switch (i.tickIntervalType) {
 			case "Fraction":
-				let t = p(C(n.minor));
-				n.fractionTick = t.n + "/" + t.d, n.decimalTick = n.decimalTick ? n.decimalTick : e.decimal[0];
+				let t = C(v(i.minor));
+				i.fractionTick = t.n + "/" + t.d, i.decimalTick = i.decimalTick ? i.decimalTick : e.decimal[0];
 				break;
 			case "Decimal":
-			case "Integer": n.decimalTick = n.minor, n.fractionTick = n.fractionTick ? n.fractionTick : e.fraction[0];
+			case "Integer": i.decimalTick = i.minor, i.fractionTick = i.fractionTick ? i.fractionTick : e.fraction[0];
 		}
-		n.integerTick = 1;
-	} else if (i.min < 1 && i.max >= 1) {
-		let e = X(i);
-		if (n.minor >= i.min && n.minor <= i.max) switch (n.tickIntervalType) {
+		i.integerTick = 1;
+	} else if (o.min < 1 && o.max >= 1) {
+		let e = V(o);
+		if (i.minor >= o.min && i.minor <= o.max) switch (i.tickIntervalType) {
 			case "Integer":
-				n.integerTick = n.minor, n.decimalTick = i.min > .5 ? 0 : e.decimal[0], n.fractionTick = i.min > .5 ? "0" : e.fraction[0];
+				i.integerTick = i.minor, i.decimalTick = o.min > .5 ? 0 : e.decimal[0], i.fractionTick = o.min > .5 ? "0" : e.fraction[0];
 				break;
 			case "Decimal":
-				n.integerTick = 1, n.decimalTick = n.minor, n.fractionTick = e.fraction[0];
+				i.integerTick = 1, i.decimalTick = i.minor, i.fractionTick = e.fraction[0];
 				break;
 			case "Fraction":
-				n.integerTick = 1, n.decimalTick = e.decimal[0];
-				let t = p(C(n.minor));
-				n.fractionTick = t.n + "/" + t.d;
+				i.integerTick = 1, i.decimalTick = e.decimal[0];
+				let t = C(v(i.minor));
+				i.fractionTick = t.n + "/" + t.d;
 		}
-		else switch (i.min > .5 && (n.tickIntervalType = "Integer"), n.tickIntervalType) {
+		else switch (o.min > .5 && (i.tickIntervalType = "Integer"), i.tickIntervalType) {
 			case "Integer":
-				n.minor = C(o(i.min)), n.integerTick = n.minor, n.decimalTick = i.min > .5 ? 0 : e.decimal[0], n.fractionTick = i.min > .5 ? "0" : e.fraction[0];
+				i.minor = v(t(o.min)), i.integerTick = i.minor, i.decimalTick = o.min > .5 ? 0 : e.decimal[0], i.fractionTick = o.min > .5 ? "0" : e.fraction[0];
 				break;
 			case "Decimal":
-				n.minor = e.decimal[0], n.integerTick = 1, n.decimalTick = n.minor, n.fractionTick = e.fraction[0];
+				i.minor = e.decimal[0], i.integerTick = 1, i.decimalTick = i.minor, i.fractionTick = e.fraction[0];
 				break;
-			case "Fraction": n.minor = C(p(e.fraction[0])), n.integerTick = 1, n.decimalTick = e.decimal[0], n.fractionTick = e.fraction[0];
+			case "Fraction": i.minor = v(C(e.fraction[0])), i.integerTick = 1, i.decimalTick = e.decimal[0], i.fractionTick = e.fraction[0];
 		}
 	}
-	return pt({
+	return W({
 		...e,
-		ticks: n
+		ticks: i
 	});
-}, Z = (e) => ({ score: { scaled: e } }), ht = (e, t) => {
+}, K = (e) => ({ score: { scaled: e } }), ce = (e, t) => {
 	let { correct: n } = e, r = t.find((e) => e.numberOfCorrect === n.length);
 	return r ? 1 * (r.scorePercentage / 100) : 0;
-}, gt = (e) => (t, n) => t + +!!e.some((e) => St(e)(n)), _t = (e, t, n) => {
+}, le = (e) => (t, n) => t + +!!e.some((e) => Y(e)(n)), q = (e, t, n) => {
 	let r = [], i = t?.answer || [], a = e?.correctResponse || [];
 	if (!i.length) return ["Student did not interact with the number line."];
-	let { correct: o, incorrect: s, notInAnswer: c, noCorrectResponse: l } = Q(i, S(a));
+	let { correct: o, incorrect: s, notInAnswer: c, noCorrectResponse: l } = X(i, p(a));
 	if (l) return ["No correct response is defined for this item."];
 	let u = o.length, d = s.length, f = c.length;
 	u > 0 && r.push(`${u} object(s) correctly placed.`), d > 0 && r.push(`${d} incorrect object(s) placed.`), f > 0 && r.push(`${f} expected object(s) were not placed.`);
-	let p = [...i];
+	let m = [...i];
 	[...a], o.forEach((e) => {
-		let t = p[e], n = t?.type || "object";
+		let t = m[e], n = t?.type || "object";
 		r.push(`${n.charAt(0).toUpperCase() + n.slice(1)} at position ${t.domainPosition} is correct.`);
 	}), s.forEach((e) => {
-		let t = p[e], n = t?.type || "object";
+		let t = m[e], n = t?.type || "object";
 		r.push(`${n.charAt(0).toUpperCase() + n.slice(1)} at position ${t.domainPosition} does not match the expected response.`);
 	}), c.forEach((e) => {
 		let t = e?.type || "object";
 		r.push(`Expected ${t} at position ${e.domainPosition} was not placed by the student.`);
 	});
-	let m = U.enabled(e, n);
-	m ? (r.push("Score calculated using partial scoring."), r.push("Partial scoring is based on the number of correct objects, with deductions for extras.")) : r.push("Score calculated using all-or-nothing scoring.");
-	let h = a.length || 1, g = i.length > h ? i.length - h : 0;
-	g > 0 && r.push(`${g} extra object(s) beyond the required amount were placed and deducted.`);
-	let _ = Math.max(0, (u - g) / h), v = m ? _ : +(_ === 1);
-	return r.push(`Final score: ${v}.`), r;
+	let h = O.enabled(e, n);
+	h ? (r.push("Score calculated using partial scoring."), r.push("Partial scoring is based on the number of correct objects, with deductions for extras.")) : r.push("Score calculated using all-or-nothing scoring.");
+	let g = a.length || 1, _ = i.length > g ? i.length - g : 0;
+	_ > 0 && r.push(`${_} extra object(s) beyond the required amount were placed and deducted.`);
+	let v = Math.max(0, (u - _) / g), y = h ? v : +(v === 1);
+	return r.push(`Final score: ${y}.`), r;
 };
-function vt(e, t, n) {
+function ue(e, t, n) {
 	return new Promise((r) => {
-		if (!t || j(t)) r({
+		if (!t || c(t)) r({
 			score: 0,
 			empty: !0,
 			logTrace: ["Student did not interact with the number line."]
 		});
 		else {
-			let i = U.enabled(e, n), a = (t.answer || []).reduce(gt(e.correctResponse), 0), o = e.correctResponse.length, s = 0;
+			let i = O.enabled(e, n), a = (t.answer || []).reduce(le(e.correctResponse), 0), o = e.correctResponse.length, s = 0;
 			(t.answer || []).length > o && (s = (t.answer || []).length - o), o === 0 && (o = 1);
 			let c = a < 0 ? 0 : (a - s) / o;
 			c < 0 && (c = 0), r({
 				score: i ? c : +(c === 1),
-				logTrace: _t(e, t, n)
+				logTrace: q(e, t, n)
 			});
 		}
 	});
 }
-function yt(e, t) {
+function de(e, t) {
 	return new Promise((n) => {
-		if (!t || j(t)) n({ score: { scaled: 0 } });
+		if (!t || c(t)) n({ score: { scaled: 0 } });
 		else {
 			t.answer = t.answer || [];
-			let r = Q(t.answer, S(e.correctResponse)), i = $(r);
-			if (i === "correct") n(Z(1));
-			else if (i === "incorrect") n(Z(0));
+			let r = X(t.answer, p(e.correctResponse)), i = Z(r);
+			if (i === "correct") n(K(1));
+			else if (i === "incorrect") n(K(0));
 			else if (i === "partial") {
-				let { allowPartialScoring: t, partialScoring: i } = e, a = (i || []).filter((e) => !j(e));
-				t && a.length > 0 ? n(Z(ht(r, a))) : n(Z(0));
+				let { allowPartialScoring: t, partialScoring: i } = e, a = (i || []).filter((e) => !c(e));
+				t && a.length > 0 ? n(K(ce(r, a))) : n(K(0));
 			} else n({ score: { scaled: -1 } });
 		}
 	});
 }
-var bt = 3, xt = (e, t, n) => {
+var fe = 3, J = (e, t, n) => {
 	n ||= 5;
 	let r = 10 ** -n / 2;
 	return Math.abs(e - t) <= r;
-}, St = (e) => (t) => We(e, t, (e, t) => {
-	if (typeof e == "number" && typeof t == "number") return xt(e, t, 3);
-}), Q = (e, t) => j(t) && e.length > 0 ? {
+}, Y = (e) => (t) => y(e, t, (e, t) => {
+	if (typeof e == "number" && typeof t == "number") return J(e, t, 3);
+}), X = (e, t) => c(t) && e.length > 0 ? {
 	correct: [],
 	incorrect: [],
 	notInAnswer: [],
 	noCorrectResponse: !0
 } : e.reduce((e, t, n) => {
-	let { correct: r, incorrect: i, notInAnswer: a } = e, o = Ue(a, St(t));
+	let { correct: r, incorrect: i, notInAnswer: a } = e, o = u(a, Y(t));
 	return o ? (r.push(n), a.splice(a.indexOf(o), 1)) : i.push(n), {
 		correct: r,
 		incorrect: i,
@@ -744,56 +490,56 @@ var bt = 3, xt = (e, t, n) => {
 	correct: [],
 	incorrect: [],
 	notInAnswer: t
-}), $ = (e) => {
+}), Z = (e) => {
 	let { incorrect: t, correct: n, notInAnswer: r, noCorrectResponse: i } = e;
 	return i ? "unknown" : t.length === 0 && n.length === 0 ? "unanswered" : t.length === 0 && r.length === 0 ? "correct" : t.length > 0 || r.length > 0 ? n.length > 0 ? "partial" : "incorrect" : "unknown";
 };
-function Ct(e) {
-	let t = Ge(W.feedback, e.feedback);
+function Q(e) {
+	let t = b(A.feedback, e.feedback);
 	return {
-		...W,
+		...A,
 		...e,
 		feedback: t
 	};
 }
-function wt(e = {}) {
+function pe(e = {}) {
 	return new Promise((t) => {
-		t(B({
+		t(o({
 			...e,
 			graph: {
-				...W.graph,
+				...A.graph,
 				...e.graph
 			},
 			colorContrast: "black_on_white"
 		}, (e) => !e));
 	});
 }
-var Tt = (e) => {
+var me = (e) => {
 	let { graph: { domain: t, labelStep: n, ticks: r = {} } = {} } = e, { minor: i, major: a } = r;
 	if (t && (t.min = Number((t.min || 0).toFixed(2)), t.max = Number((t.max || 0).toFixed(2))), n && typeof n == "string" && n.match(/^[1-9][0-9]*\/[1-9][0-9]*$/g)) {
 		e.graph.fraction = !0, r.tickIntervalType = "Fraction";
-		let t = be(n);
+		let t = w(n);
 		t !== a && (r.major = t, r.minor = t / (a / i));
 	}
 	return e;
 };
-async function Et(e, t, n) {
+async function he(e, t, n) {
 	if (!e) throw Error("question is null");
-	let r = await Ct(e), i = mt(Tt(r).graph);
+	let r = await Q(e), i = G(me(r).graph);
 	if (i) {
-		let e = n.mode === "evaluate", a = S(r.correctResponse), o = e && Q(t && t.answer || [], a), s = e && $(o), { exhibitOnly: c } = i, l = n.mode !== "gather" || c === !0, u = null;
-		n.role === "instructor" && (n.mode === "view" || e) && (u = r.teacherInstructions);
-		let d = e ? await Ze(s, r.feedback) : void 0;
-		return B({
+		let e = n.mode === "evaluate", a = p(r.correctResponse), s = e && X(t && t.answer || [], a), c = e && Z(s), { exhibitOnly: l } = i, u = n.mode !== "gather" || l === !0, d = null;
+		n.role === "instructor" && (n.mode === "view" || e) && (d = r.teacherInstructions);
+		let f = e ? await ee(c, r.feedback) : void 0;
+		return o({
 			prompt: r.prompt,
-			teacherInstructions: u,
+			teacherInstructions: d,
 			graph: i,
-			disabled: l,
-			corrected: o,
-			correctResponse: e && ["unanswered", "correct"].indexOf(s) === -1 && r.correctResponse,
-			feedback: d && {
-				type: s,
-				message: d
+			disabled: u,
+			corrected: s,
+			correctResponse: e && ["unanswered", "correct"].indexOf(c) === -1 && r.correctResponse,
+			feedback: f && {
+				type: c,
+				message: f
 			},
 			colorContrast: n.accessibility && n.accessibility.colorContrast || "black_on_white",
 			language: r.language,
@@ -801,7 +547,7 @@ async function Et(e, t, n) {
 		}, (e) => !e);
 	} else throw Error("graph is undefined");
 }
-var Dt = (e, t) => new Promise((n) => {
+var ge = (e, t) => new Promise((n) => {
 	if (t.mode !== "evaluate" && t.role === "instructor") {
 		let { correctResponse: t } = e;
 		n({
@@ -809,15 +555,15 @@ var Dt = (e, t) => new Promise((n) => {
 			id: "1"
 		});
 	} else n(null);
-}), Ot = (e) => (e || "").replace(/(<(?!img|iframe|source)([^>]+)>)/gi, ""), kt = (e = {}, t = {}) => {
+}), $ = (e) => (e || "").replace(/(<(?!img|iframe|source)([^>]+)>)/gi, ""), _e = (e = {}, t = {}) => {
 	let { graph: n, correctResponse: r } = e || {}, { maxMaxElements: i = 20, numberLineDimensions: { min: a = 200, max: o = 800 } = {} } = t || {}, { width: s, domain: c, maxNumberOfPoints: l } = n || {}, { min: u, max: d } = c || {}, f = {};
 	["teacherInstructions", "prompt"].forEach((n) => {
-		t[n]?.required && !Ot(e[n]) && (f[n] = "This field is required.");
+		t[n]?.required && !$(e[n]) && (f[n] = "This field is required.");
 	}), (s < a || s > o) && (f.widthError = `Width should be a value between ${a} and ${o}.`);
 	let p = -1e5, m = 1e5;
 	return (u < p || u > m || d < p || d > m) && (f.domainError = `Min and max values must both be in the range [${p}, ${m}].`), u >= d && (f.maxError = "Max value must be greater than min value."), (l < 1 || l > i) && (f.pointsError = `Max number of elements should be between 1 and ${i}.`), r && r.length === 0 && (f.correctResponseError = "The correct answer should include at least one number line object."), f;
 };
 //#endregion
-export { bt as CLOSE_TO_PRECISION, xt as closeTo, Dt as createCorrectResponseSession, wt as createDefaultModel, Q as getCorrected, $ as getCorrectness, _t as getLogTrace, yt as getScore, Et as model, Ct as normalize, vt as outcome, kt as validate };
+export { fe as CLOSE_TO_PRECISION, J as closeTo, ge as createCorrectResponseSession, pe as createDefaultModel, X as getCorrected, Z as getCorrectness, q as getLogTrace, de as getScore, he as model, Q as normalize, ue as outcome, _e as validate };
 
 //# sourceMappingURL=index.js.map