@teachinglab/omd 0.7.35 → 0.7.37

package/dist/omd.browser.js

@@ -3814,12 +3814,12 @@ typeof BigInt > "u" && (BigInt = function(n) {
   if (isNaN(n)) throw new Error("");
   return n;
 });
-const Pe = BigInt(0), ot = BigInt(1), ar = BigInt(2), La = BigInt(3), Rs = BigInt(5), Hr = BigInt(10);
+const Pe = BigInt(0), ut = BigInt(1), ar = BigInt(2), La = BigInt(3), Rs = BigInt(5), Hr = BigInt(10);
 BigInt(Number.MAX_SAFE_INTEGER);
 const NT = 2e3, Ee = {
-  s: ot,
+  s: ut,
   n: Pe,
-  d: ot
+  d: ut
 };
 function Yi(n, e) {
   try {
@@ -3836,17 +3836,17 @@ function zt(n, e) {
   if (e === Pe)
     throw lv();
   const t = Object.create(oi.prototype);
-  t.s = n < Pe ? -ot : ot, n = n < Pe ? -n : n;
+  t.s = n < Pe ? -ut : ut, n = n < Pe ? -n : n;
   const r = Kn(n, e);
   return t.n = n / r, t.d = e / r, t;
 }
 const CT = [ar * ar, ar, ar * ar, ar, ar * ar, ar * La, ar, ar * La];
 function _s(n) {
   const e = /* @__PURE__ */ Object.create(null);
-  if (n <= ot)
-    return e[n] = ot, e;
+  if (n <= ut)
+    return e[n] = ut, e;
   const t = (r) => {
-    e[r] = (e[r] || Pe) + ot;
+    e[r] = (e[r] || Pe) + ut;
   };
   for (; n % ar === Pe; )
     t(ar), n /= ar;
@@ -3859,10 +3859,10 @@ function _s(n) {
       t(i), n /= i;
     i += CT[r], r = r + 1 & 7;
   }
-  return n > ot && t(n), e;
+  return n > ut && t(n), e;
 }
 const nr = function(n, e) {
-  let t = Pe, r = ot, i = ot;
+  let t = Pe, r = ut, i = ut;
   if (n != null) if (e !== void 0) {
     if (typeof n == "bigint")
       t = n;
@@ -3896,7 +3896,7 @@ const nr = function(n, e) {
   } else if (typeof n == "number") {
     if (isNaN(n))
       throw dn();
-    if (n < 0 && (i = -ot, n = -n), n % 1 === 0)
+    if (n < 0 && (i = -ut, n = -n), n % 1 === 0)
       t = BigInt(n);
     else {
       let s = 1, a = 0, o = 1, l = 1, u = 1, c = 1e7;
@@ -3911,26 +3911,26 @@ const nr = function(n, e) {
       t = BigInt(t) * BigInt(s), r = BigInt(r);
     }
   } else if (typeof n == "string") {
-    let s = 0, a = Pe, o = Pe, l = Pe, u = ot, c = ot, h = n.replace(/_/g, "").match(/\d+|./g);
+    let s = 0, a = Pe, o = Pe, l = Pe, u = ut, c = ut, h = n.replace(/_/g, "").match(/\d+|./g);
     if (h === null)
       throw dn();
-    if (h[s] === "-" ? (i = -ot, s++) : h[s] === "+" && s++, h.length === s + 1 ? o = Yi(h[s++], i) : h[s + 1] === "." || h[s] === "." ? (h[s] !== "." && (a = Yi(h[s++], i)), s++, (s + 1 === h.length || h[s + 1] === "(" && h[s + 3] === ")" || h[s + 1] === "'" && h[s + 3] === "'") && (o = Yi(h[s], i), u = Hr ** BigInt(h[s].length), s++), (h[s] === "(" && h[s + 2] === ")" || h[s] === "'" && h[s + 2] === "'") && (l = Yi(h[s + 1], i), c = Hr ** BigInt(h[s + 1].length) - ot, s += 3)) : h[s + 1] === "/" || h[s + 1] === ":" ? (o = Yi(h[s], i), u = Yi(h[s + 2], ot), s += 3) : h[s + 3] === "/" && h[s + 1] === " " && (a = Yi(h[s], i), o = Yi(h[s + 2], i), u = Yi(h[s + 4], ot), s += 5), h.length <= s)
+    if (h[s] === "-" ? (i = -ut, s++) : h[s] === "+" && s++, h.length === s + 1 ? o = Yi(h[s++], i) : h[s + 1] === "." || h[s] === "." ? (h[s] !== "." && (a = Yi(h[s++], i)), s++, (s + 1 === h.length || h[s + 1] === "(" && h[s + 3] === ")" || h[s + 1] === "'" && h[s + 3] === "'") && (o = Yi(h[s], i), u = Hr ** BigInt(h[s].length), s++), (h[s] === "(" && h[s + 2] === ")" || h[s] === "'" && h[s + 2] === "'") && (l = Yi(h[s + 1], i), c = Hr ** BigInt(h[s + 1].length) - ut, s += 3)) : h[s + 1] === "/" || h[s + 1] === ":" ? (o = Yi(h[s], i), u = Yi(h[s + 2], ut), s += 3) : h[s + 3] === "/" && h[s + 1] === " " && (a = Yi(h[s], i), o = Yi(h[s + 2], i), u = Yi(h[s + 4], ut), s += 5), h.length <= s)
       r = u * c, i = /* void */
       t = l + r * a + c * o;
     else
       throw dn();
   } else if (typeof n == "bigint")
-    t = n, i = n, r = ot;
+    t = n, i = n, r = ut;
   else
     throw dn();
   if (r === Pe)
     throw lv();
-  Ee.s = i < Pe ? -ot : ot, Ee.n = t < Pe ? -t : t, Ee.d = r < Pe ? -r : r;
+  Ee.s = i < Pe ? -ut : ut, Ee.n = t < Pe ? -t : t, Ee.d = r < Pe ? -r : r;
 };
 function DT(n, e, t) {
-  let r = ot;
-  for (; e > Pe; n = n * n % t, e >>= ot)
-    e & ot && (r = r * n % t);
+  let r = ut;
+  for (; e > Pe; n = n * n % t, e >>= ut)
+    e & ut && (r = r * n % t);
   return r;
 }
 function AT(n, e) {
@@ -3938,16 +3938,16 @@ function AT(n, e) {
     ;
   for (; e % Rs === Pe; e /= Rs)
     ;
-  if (e === ot)
+  if (e === ut)
     return Pe;
   let t = Hr % e, r = 1;
-  for (; t !== ot; r++)
+  for (; t !== ut; r++)
     if (t = t * Hr % e, r > NT)
       return Pe;
   return BigInt(r);
 }
 function ET(n, e, t) {
-  let r = ot, i = DT(Hr, t, e);
+  let r = ut, i = DT(Hr, t, e);
   for (let s = 0; s < 300; s++) {
     if (r === i)
       return BigInt(s);
@@ -3981,9 +3981,9 @@ const lv = function() {
   return new Error("Parameters must be integer");
 };
 oi.prototype = {
-  s: ot,
+  s: ut,
   n: Pe,
-  d: ot,
+  d: ut,
   /**
    * Calculates the absolute value
    *
@@ -4060,7 +4060,7 @@ oi.prototype = {
    **/
   mod: function(n, e) {
     if (n === void 0)
-      return zt(this.s * this.n % this.d, ot);
+      return zt(this.s * this.n % this.d, ut);
     if (nr(n, e), Pe === Ee.n * this.d)
       throw lv();
     return zt(
@@ -4082,7 +4082,7 @@ oi.prototype = {
    * Ex: new Fraction(5,8).lcm(3,7) => 15
    */
   lcm: function(n, e) {
-    return nr(n, e), Ee.n === Pe && this.n === Pe ? zt(Pe, ot) : zt(Ee.n * this.n, Kn(Ee.n, this.n) * Kn(Ee.d, this.d));
+    return nr(n, e), Ee.n === Pe && this.n === Pe ? zt(Pe, ut) : zt(Ee.n * this.n, Kn(Ee.n, this.n) * Kn(Ee.d, this.d));
   },
   /**
    * Gets the inverse of the fraction, means numerator and denominator are exchanged
@@ -4098,10 +4098,10 @@ oi.prototype = {
    * Ex: new Fraction(-1,2).pow(-3) => -8
    */
   pow: function(n, e) {
-    if (nr(n, e), Ee.d === ot)
+    if (nr(n, e), Ee.d === ut)
       return Ee.s < Pe ? zt((this.s * this.d) ** Ee.n, this.n ** Ee.n) : zt((this.s * this.n) ** Ee.n, this.d ** Ee.n);
     if (this.s < Pe) return null;
-    let t = _s(this.n), r = _s(this.d), i = ot, s = ot;
+    let t = _s(this.n), r = _s(this.d), i = ut, s = ut;
     for (let a in t)
       if (a !== "1") {
         if (a === "0") {
@@ -4215,7 +4215,7 @@ oi.prototype = {
    **/
   ceil: function(n) {
     return n = Hr ** BigInt(n || 0), zt(
-      wi(this.s * n * this.n / this.d) + (n * this.n % this.d > Pe && this.s >= Pe ? ot : Pe),
+      wi(this.s * n * this.n / this.d) + (n * this.n % this.d > Pe && this.s >= Pe ? ut : Pe),
       n
     );
   },
@@ -4226,7 +4226,7 @@ oi.prototype = {
    **/
   floor: function(n) {
     return n = Hr ** BigInt(n || 0), zt(
-      wi(this.s * n * this.n / this.d) - (n * this.n % this.d > Pe && this.s < Pe ? ot : Pe),
+      wi(this.s * n * this.n / this.d) - (n * this.n % this.d > Pe && this.s < Pe ? ut : Pe),
       n
     );
   },
@@ -4237,7 +4237,7 @@ oi.prototype = {
    **/
   round: function(n) {
     return n = Hr ** BigInt(n || 0), zt(
-      wi(this.s * n * this.n / this.d) + this.s * ((this.s >= Pe ? ot : Pe) + ar * (n * this.n % this.d) > this.d ? ot : Pe),
+      wi(this.s * n * this.n / this.d) + this.s * ((this.s >= Pe ? ut : Pe) + ar * (n * this.n % this.d) > this.d ? ut : Pe),
       n
     );
   },
@@ -4294,7 +4294,7 @@ oi.prototype = {
    **/
   toFraction: function(n = !1) {
     let e = this.n, t = this.d, r = this.s < Pe ? "-" : "";
-    if (t === ot)
+    if (t === ut)
       r += e;
     else {
       const i = wi(e / t);
@@ -4309,7 +4309,7 @@ oi.prototype = {
    **/
   toLatex: function(n = !1) {
     let e = this.n, t = this.d, r = this.s < Pe ? "-" : "";
-    if (t === ot)
+    if (t === ut)
       r += e;
     else {
       const i = wi(e / t);
@@ -4335,7 +4335,7 @@ oi.prototype = {
   simplify: function(n = 1e-3) {
     const e = BigInt(Math.ceil(1 / n)), t = this.abs(), r = t.toContinued();
     for (let i = 1; i < r.length; i++) {
-      let s = zt(r[i - 1], ot);
+      let s = zt(r[i - 1], ut);
       for (let o = i - 2; o >= 0; o--)
         s = s.inverse().add(r[o]);
       let a = s.sub(t);
@@ -41156,7 +41156,7 @@ class Hu extends Bt {
     }
   }
 }
-class ut extends Bt {
+class ot extends Bt {
   constructor(e) {
     if (super(e), this.type = "omdEquationNode", (e.type || e.mathjs) === "AssignmentNode") {
       const r = Tt(e.object);
@@ -41307,7 +41307,7 @@ class ut extends Bt {
       object: h.toMathJSNode(),
       index: null,
       value: f.toMathJSNode()
-    }, p = new ut(d);
+    }, p = new ot(d);
     return p.setFontSize(this.getFontSize()), p.provenance.push(this.id), p.left && this.left && this._establishGranularProvenance(p.left, this.left, e, r), p.right && this.right && this._establishGranularProvenance(p.right, this.right, e, r), p.initialize(), p;
   }
   /**
@@ -41452,10 +41452,10 @@ class ut extends Bt {
         };
       }
     };
-    return new ut(s);
+    return new ot(s);
   }
   clone() {
-    const e = JSON.parse(JSON.stringify(this.astNodeData)), t = new ut(e);
+    const e = JSON.parse(JSON.stringify(this.astNodeData)), t = new ot(e);
     return t._syncProvenanceFrom(this), t.setFontSize(this.getFontSize()), t.argumentNodeList = { left: t.left, right: t.right }, t;
   }
   /**
@@ -41536,7 +41536,7 @@ class ut extends Bt {
         };
       }
     };
-    return new ut(r);
+    return new ot(r);
   }
   /**
    * Apply an operation to one or both sides of the equation
@@ -41574,7 +41574,7 @@ class ut extends Bt {
       type: "AssignmentNode",
       object: u.toMathJSNode(),
       value: c.toMathJSNode()
-    }, f = new ut(h);
+    }, f = new ot(h);
     return f.setFontSize(this.getFontSize()), f.provenance.push(this.id), f.initialize(), f;
   }
   /**
@@ -41972,9 +41972,9 @@ function i9(n, e) {
   var t, r;
   switch (n) {
     case "AssignmentNode":
-      return ut;
+      return ot;
     case "OperatorNode":
-      return (e == null ? void 0 : e.op) === "-" && e.args.length === 1 && !e.implicit ? Zi : (e == null ? void 0 : e.op) === "=" ? ut : (e == null ? void 0 : e.op) === "^" ? qi : (e == null ? void 0 : e.op) === "/" ? Vr : Di;
+      return (e == null ? void 0 : e.op) === "-" && e.args.length === 1 && !e.implicit ? Zi : (e == null ? void 0 : e.op) === "=" ? ot : (e == null ? void 0 : e.op) === "^" ? qi : (e == null ? void 0 : e.op) === "/" ? Vr : Di;
     case "ParenthesisNode":
       return ea;
     case "ConstantNode":
@@ -42255,7 +42255,7 @@ const vn = class vn extends Bt {
    */
   _markInitialSteps() {
     !this.steps || !Array.isArray(this.steps) || this.steps.forEach((e, t) => {
-      e instanceof ut && (e.stepMark = 0);
+      e instanceof ot && (e.stepMark = 0);
     });
   }
   /**
@@ -42272,7 +42272,7 @@ const vn = class vn extends Bt {
   getCurrentEquation() {
     if (!this.steps || this.steps.length === 0) return null;
     for (let e = this.steps.length - 1; e >= 0; e--)
-      if (this.steps[e] instanceof ut)
+      if (this.steps[e] instanceof ot)
         return this.steps[e];
     return null;
   }
@@ -42291,7 +42291,7 @@ const vn = class vn extends Bt {
     let i = {};
     typeof t == "string" ? i = { description: t, stepMark: r ?? 2 } : t && (i = t);
     const s = typeof e == "string" ? this._stringToNode(e) : e, a = this.steps.length;
-    return i.description !== void 0 && (this.stepDescriptions[a] = i.description), i.stepMark !== void 0 ? this.importanceLevels[a] = i.stepMark : this.importanceLevels[a] = 0, this.defaultEquationBackground && typeof (s == null ? void 0 : s.setBackgroundStyle) == "function" && s.setBackgroundStyle(this.defaultEquationBackground), s.setFontSize(this.getFontSize()), s.initialize(), this.steps.push(s), this.addChild(s), this.argumentNodeList.steps = this.steps, this.rebuildNodeMap(), s instanceof ut ? s.stepMark = i.stepMark ?? this._determineStepMark(s, i) : i.stepMark !== void 0 ? s.stepMark = i.stepMark : s.stepMark = 0, this.computeDimensions(), this.updateLayout(), window.refreshDisplayAndFilters && window.refreshDisplayAndFilters(), this._reapplyCurrentFilter(), a;
+    return i.description !== void 0 && (this.stepDescriptions[a] = i.description), i.stepMark !== void 0 ? this.importanceLevels[a] = i.stepMark : this.importanceLevels[a] = 0, this.defaultEquationBackground && typeof (s == null ? void 0 : s.setBackgroundStyle) == "function" && s.setBackgroundStyle(this.defaultEquationBackground), s.setFontSize(this.getFontSize()), s.initialize(), this.steps.push(s), this.addChild(s), this.argumentNodeList.steps = this.steps, this.rebuildNodeMap(), s instanceof ot ? s.stepMark = i.stepMark ?? this._determineStepMark(s, i) : i.stepMark !== void 0 ? s.stepMark = i.stepMark : s.stepMark = 0, this.computeDimensions(), this.updateLayout(), window.refreshDisplayAndFilters && window.refreshDisplayAndFilters(), this._reapplyCurrentFilter(), a;
   }
   /**
    * Sets a default background style to be applied to all equation steps added thereafter.
@@ -42320,7 +42320,7 @@ const vn = class vn extends Bt {
    * @private
    */
   _isFullySimplified(e) {
-    if (!(e instanceof ut)) return !1;
+    if (!(e instanceof ot)) return !1;
     const t = this._isSimpleExpression(e.left), r = this._isSimpleExpression(e.right);
     return t && r;
   }
@@ -42651,7 +42651,7 @@ const vn = class vn extends Bt {
   _calculateAlignmentPoint(e) {
     const t = [];
     return e.forEach((r) => {
-      if (r instanceof ut) {
+      if (r instanceof ot) {
         if (typeof r.getEqualsAnchorX == "function")
           t.push(r.getEqualsAnchorX());
         else if (r.equalsSign && r.left) {
@@ -42667,7 +42667,7 @@ const vn = class vn extends Bt {
     const i = 15 * this.getFontSize() / this.getRootFontSize();
     return e.forEach((s, a) => {
       let o = 0;
-      s instanceof ut ? o = this.alignPointX + s.equalsSign.width + s.right.width : o = s.width, t = Math.max(t, o), r += s.height, a < e.length - 1 && (r += i);
+      s instanceof ot ? o = this.alignPointX + s.equalsSign.width + s.right.width : o = s.width, t = Math.max(t, o), r += s.height, a < e.length - 1 && (r += i);
     }), { maxWidth: t, totalHeight: r };
   }
   /**
@@ -42681,7 +42681,7 @@ const vn = class vn extends Bt {
   _computeStepXOffset(e) {
     if (this.alignmentMode === "center")
       return (this.width - e.width) / 2;
-    if (e instanceof ut) {
+    if (e instanceof ot) {
       const t = typeof e.getEqualsAnchorX == "function" ? e.getEqualsAnchorX() : e.left.width;
       return this.alignPointX - t;
     }
@@ -42715,7 +42715,7 @@ const vn = class vn extends Bt {
     const t = e.map((r) => {
       const i = r.trim();
       if (i.includes("="))
-        return ut.fromString(i);
+        return ot.fromString(i);
       throw new Error(`Step string "${i}" is not a valid equation for omdEquationSequenceNode.`);
     });
     return new vn(t);
@@ -42737,17 +42737,16 @@ const vn = class vn extends Bt {
    * @returns {omdNode} The current step
    */
   getCurrentStep() {
-    var t;
     if (!this.steps || this.steps.length === 0) return null;
     let e = -1;
-    for (let r = this.steps.length - 1; r >= 0; r--) {
-      const i = this.steps[r];
-      if (i && i.visible !== !1) {
-        if (((t = i.constructor) == null ? void 0 : t.name) === "omdEquationNode") {
-          e = r;
+    for (let t = this.steps.length - 1; t >= 0; t--) {
+      const r = this.steps[t];
+      if (r && r.visible !== !1) {
+        if (r instanceof ot || r.type === "omdEquationNode") {
+          e = t;
           break;
         }
-        e === -1 && (e = r);
+        e === -1 && (e = t);
       }
     }
     return e === -1 && (e = this.steps.length - 1), e < 0 && (e = 0), e >= this.steps.length && (e = this.steps.length - 1), this.currentStepIndex = e, this.steps[e];
@@ -42836,7 +42835,7 @@ const vn = class vn extends Bt {
       const s = r.trim();
       let a;
       if (s.includes("="))
-        a = ut.fromString(s);
+        a = ot.fromString(s);
       else {
         if (!window.math)
           throw new Error("Math.js is required for parsing expressions");
@@ -42859,7 +42858,7 @@ const vn = class vn extends Bt {
   _stringToNode(e) {
     const t = e.trim();
     if (t.includes("="))
-      return ut.fromString(t);
+      return ot.fromString(t);
     if (!window.math)
       throw new Error("Math.js is required for parsing expressions");
     const r = window.math.parse(t), i = Tt(r);
@@ -43505,7 +43504,7 @@ class s9 {
   _findNearestVisibleEquationAbove(e) {
     for (let t = e - 1; t >= 0; t--) {
       const r = this.stepVisualizer.steps[t];
-      if (r instanceof ut && r.visible !== !1)
+      if (r instanceof ot && r.visible !== !1)
         return r;
     }
     return null;
@@ -43555,7 +43554,7 @@ class s9 {
     let s = null;
     for (let l = i - 1; l >= 0; l--) {
       const u = this.stepVisualizer.steps[l];
-      if (u instanceof ut && u.visible !== !1) {
+      if (u instanceof ot && u.visible !== !1) {
         s = u;
         break;
       }
@@ -44044,7 +44043,7 @@ class o9 {
     const r = t.equationRef, i = this.stepVisualizer.steps.indexOf(r);
     for (let s = i - 1; s >= 0; s--) {
       const a = this.stepVisualizer.steps[s];
-      if (a instanceof ut && a.visible !== !1) {
+      if (a instanceof ot && a.visible !== !1) {
         for (let o = e - 1; o >= 0; o--) {
           const l = this.stepVisualizer.stepDots[o];
           if (l && l.equationRef === a)
@@ -44115,7 +44114,7 @@ class u9 {
     let o = 0;
     const l = 15 * this.stepVisualizer.getFontSize() / this.stepVisualizer.getRootFontSize();
     a.forEach((f, d) => {
-      if (f instanceof ut) {
+      if (f instanceof ot) {
         const p = this.findDotIndexForEquation(f);
         if (p >= 0 && p < this.stepVisualizer.stepDots.length) {
           const m = this.stepVisualizer.stepDots[p];
@@ -44169,7 +44168,7 @@ class u9 {
       const e = this.stepVisualizer.steps || [];
       let t = 0;
       return e.forEach((r) => {
-        if (r instanceof ut && r.visible !== !1 && typeof r.getEffectiveBackgroundPaddingX == "function") {
+        if (r instanceof ot && r.visible !== !1 && typeof r.getEffectiveBackgroundPaddingX == "function") {
           const i = Number(r.getEffectiveBackgroundPaddingX());
           t = Math.max(t, isNaN(i) ? 0 : i);
         }
@@ -44256,20 +44255,20 @@ class u9 {
   _createExpansionDots() {
     const e = this.stepVisualizer, t = e.stepDots;
     e.stepDots.filter((i) => i.visible), e.steps.forEach((i, s) => {
-      i && (i instanceof ut || i.constructor.name);
+      i && (i instanceof ot || i.type);
     }), t.forEach((i, s) => {
       i && i.equationRef;
     });
     const r = [];
     e.steps.forEach((i, s) => {
-      i && (i instanceof ut || i.constructor.name === "omdEquationNode") && i.stepMark === 0 && i.visible === !0 && r.push(s);
+      i && (i instanceof ot || i.type === "omdEquationNode") && i.stepMark === 0 && i.visible === !0 && r.push(s);
     });
     for (let i = 1; i < r.length; i++) {
       const s = r[i - 1], a = r[i];
       let o = 0;
       for (let l = s + 1; l < a; l++) {
         const u = e.steps[l];
-        u && (u instanceof ut || u.constructor.name === "omdEquationNode") && u.stepMark > 0 && u.visible === !1 && o++;
+        u && (u instanceof ot || u.type === "omdEquationNode") && u.stepMark > 0 && u.visible === !1 && o++;
       }
       if (o > 0) {
         const l = e.steps[a];
@@ -44295,7 +44294,7 @@ class u9 {
     const o = r.steps.indexOf(s), l = r.steps.indexOf(a);
     for (let h = o + 1; h < l; h++) {
       const f = r.steps[h];
-      f && (f instanceof ut || f.constructor.name === "omdEquationNode") && f.stepMark !== void 0 && f.stepMark > 0 && f.visible === !1 && i++;
+      f && (f instanceof ot || f.type === "omdEquationNode") && f.stepMark !== void 0 && f.stepMark > 0 && f.visible === !1 && i++;
     }
     return i;
   }
@@ -44365,7 +44364,7 @@ class u9 {
         let h = -1;
         for (let f = c + 1; f < e.steps.length; f++) {
           const d = e.steps[f];
-          if (d && (d instanceof ut || d.constructor.name === "omdEquationNode") && d.stepMark === 0 && d.visible === !0) {
+          if (d && (d instanceof ot || d.type === "omdEquationNode") && d.stepMark === 0 && d.visible === !0) {
             h = f;
             break;
           }
@@ -44398,7 +44397,7 @@ class u9 {
       s >= 0 && this.expansionDots.splice(s, 1);
       for (let a = i + 1; a < r; a++) {
         const o = t.steps[a];
-        if (o && (o instanceof ut || o.constructor.name === "omdEquationNode") && o.stepMark > 0) {
+        if (o && (o instanceof ot || o.type === "omdEquationNode") && o.stepMark > 0) {
           this._showStep(o);
           const l = t.stepDots.findIndex((u) => u.equationRef === o);
           if (l >= 0) {
@@ -44637,7 +44636,7 @@ class Vu extends Uu {
    * @private
    */
   _initializeVisualElements() {
-    this._clearVisualElements(), this.nodeToStepMap.clear(), this.steps.filter((t) => t instanceof ut).forEach((t, r) => {
+    this._clearVisualElements(), this.nodeToStepMap.clear(), this.steps.filter((t) => t instanceof ot).forEach((t, r) => {
       this._createStepDot(t, r), t.findAllNodes().forEach((i) => {
         this.nodeToStepMap.set(i.id, r);
       }), r > 0 && this._createStepLine(r - 1, r);
@@ -44675,8 +44674,8 @@ class Vu extends Uu {
    * Override addStep to update visual elements when new steps are added
    */
   addStep(e, t = {}) {
-    if (this.highlighting && typeof this.highlighting.clearAllExplainHighlights == "function" && this.highlighting.clearAllExplainHighlights(), super.addStep(e, t), e instanceof ut) {
-      const r = this.steps.filter((i) => i instanceof ut).indexOf(e);
+    if (this.highlighting && typeof this.highlighting.clearAllExplainHighlights == "function" && this.highlighting.clearAllExplainHighlights(), super.addStep(e, t), e instanceof ot) {
+      const r = this.steps.filter((i) => i instanceof ot).indexOf(e);
       if (r >= 0) {
         const i = this._createStepDot(e, r);
         if (e.findAllNodes().forEach((s) => {
@@ -44872,7 +44871,7 @@ class Vu extends Uu {
    */
   _findPreviousVisibleEquationIndex(e) {
     for (let t = e - 1; t >= 0; t--)
-      if (this.steps[t] instanceof ut && this.steps[t].visible !== !1)
+      if (this.steps[t] instanceof ot && this.steps[t].visible !== !1)
         return t;
     return -1;
   }
@@ -45528,30 +45527,29 @@ class c9 extends Oe {
    * @returns {boolean} Whether an operation was undone
    */
   undoLastOperation() {
-    var i, s;
     const e = this.sequence;
     if (!e || !Array.isArray(e.steps) || e.steps.length === 0) return !1;
     let t = -1;
-    for (let a = e.steps.length - 1; a >= 0; a--) {
-      const o = e.steps[a], l = (i = o == null ? void 0 : o.constructor) == null ? void 0 : i.name;
-      if (o instanceof ut || l === "omdEquationNode") {
-        t = a;
+    for (let i = e.steps.length - 1; i >= 0; i--) {
+      const s = e.steps[i];
+      if (s instanceof ot || (s == null ? void 0 : s.type) === "omdEquationNode") {
+        t = i;
         break;
       }
     }
     if (t === -1) return !1;
     let r = t;
-    for (let a = t; a >= 0; a--) {
-      const o = e.steps[a], l = (s = o == null ? void 0 : o.constructor) == null ? void 0 : s.name;
-      if (o instanceof ta || l === "omdOperationDisplayNode") {
-        r = a;
+    for (let i = t; i >= 0; i--) {
+      const s = e.steps[i];
+      if (s instanceof ta || (s == null ? void 0 : s.type) === "omdOperationDisplayNode") {
+        r = i;
         break;
       }
     }
-    for (let a = e.steps.length - 1; a >= r; a--) {
-      const o = e.steps[a];
+    for (let i = e.steps.length - 1; i >= r; i--) {
+      const s = e.steps[i];
       try {
-        e.removeChild(o);
+        e.removeChild(s);
       } catch {
       }
     }
@@ -45566,47 +45564,44 @@ class c9 extends Oe {
       } catch {
       }
     try {
-      const a = (l) => {
-        var u;
-        return l instanceof ut || ((u = l == null ? void 0 : l.constructor) == null ? void 0 : u.name) === "omdEquationNode";
-      }, o = Array.isArray(e.steps) ? e.steps.filter(a).length : 0;
+      const i = (a) => a instanceof ot || (a == null ? void 0 : a.type) === "omdEquationNode", s = Array.isArray(e.steps) ? e.steps.filter(i).length : 0;
       if (Array.isArray(e.stepDots) && e.visualContainer) {
-        const l = new Set(e.steps.filter(a)), u = [];
-        for (const c of e.stepDots)
-          if (!c || !c.equationRef || !l.has(c.equationRef))
+        const a = new Set(e.steps.filter(i)), o = [];
+        for (const l of e.stepDots)
+          if (!l || !l.equationRef || !a.has(l.equationRef))
             try {
-              e.visualContainer.removeChild(c);
+              e.visualContainer.removeChild(l);
             } catch {
             }
           else
-            u.push(c);
-        e.stepDots = u;
+            o.push(l);
+        e.stepDots = o;
       }
       if (e.visualContainer && Array.isArray(e.visualContainer.childList)) {
-        const l = /* @__PURE__ */ new Set([...e.stepDots || [], ...e.stepLines || []]), u = [];
-        e.visualContainer.childList.forEach((c) => {
-          l.has(c) || u.push(c);
-        }), u.forEach((c) => {
+        const a = /* @__PURE__ */ new Set([...e.stepDots || [], ...e.stepLines || []]), o = [];
+        e.visualContainer.childList.forEach((l) => {
+          a.has(l) || o.push(l);
+        }), o.forEach((l) => {
           try {
-            e.visualContainer.removeChild(c);
+            e.visualContainer.removeChild(l);
           } catch {
           }
         });
       }
       if (Array.isArray(e.stepDots) && e.visualContainer)
-        for (; e.stepDots.length > o; ) {
-          const l = e.stepDots.pop();
+        for (; e.stepDots.length > s; ) {
+          const a = e.stepDots.pop();
           try {
-            e.visualContainer.removeChild(l);
+            e.visualContainer.removeChild(a);
           } catch {
           }
         }
       if (Array.isArray(e.stepLines) && e.visualContainer) {
-        const l = Math.max(0, o - 1);
-        for (; e.stepLines.length > l; ) {
-          const u = e.stepLines.pop();
+        const a = Math.max(0, s - 1);
+        for (; e.stepLines.length > a; ) {
+          const o = e.stepLines.pop();
           try {
-            e.visualContainer.removeChild(u);
+            e.visualContainer.removeChild(o);
           } catch {
           }
         }
@@ -45864,7 +45859,6 @@ class j9 {
     })), this.svg.svgObject.appendChild(t);
   }
   centerNode() {
-    var m;
     if (!this.node) return;
     if (this._centerCallCount || (this._centerCallCount = 0), this._centerCallCount++, this._centerCallCount > 500) {
       console.warn("omdDisplay: excessive centerNode calls detected; halting further centering to prevent loop");
@@ -45878,12 +45872,12 @@ class j9 {
       }
     let r = this.node.width || 0, i = this.node.height || 0;
     if (this.node.getSequence) {
-      const y = this.node.getSequence();
-      if (y && (y.width && y.height && (r = y.sequenceWidth || y.width, i = y.sequenceHeight || y.height), y.getCurrentStep)) {
-        const v = y.getCurrentStep();
-        if (v && v.width && v.height) {
-          const S = y.sequenceWidth || v.width, g = y.sequenceHeight || v.height;
-          r = Math.max(r, S), i = Math.max(i, g);
+      const m = this.node.getSequence();
+      if (m && (m.width && m.height && (r = m.sequenceWidth || m.width, i = m.sequenceHeight || m.height), m.getCurrentStep)) {
+        const y = m.getCurrentStep();
+        if (y && y.width && y.height) {
+          const v = m.sequenceWidth || y.width, S = m.sequenceHeight || y.height;
+          r = Math.max(r, v), i = Math.max(i, S);
         }
       }
     }
@@ -45894,19 +45888,19 @@ class j9 {
           typeof this.node.closeActiveDot == "function" ? this.node.closeActiveDot() : typeof this.node.closeAllTextBoxes == "function" && this.node.closeAllTextBoxes();
         } catch {
         }
-      let y = !1;
-      if (this.node && (y = ((m = this.node.constructor) == null ? void 0 : m.name) === "omdStepVisualizer" || this.node.type === "omdStepVisualizer" || typeof Vu < "u" && this.node instanceof Vu), y) {
-        const v = this.node && typeof this.node.scale == "number" ? this.node.scale : void 0;
-        s = v && v > 0 ? v : 1;
+      let m = !1;
+      if (this.node && (m = this.node.type === "omdStepVisualizer" || typeof Vu < "u" && this.node instanceof Vu), m) {
+        const y = this.node && typeof this.node.scale == "number" ? this.node.scale : void 0;
+        s = y && y > 0 ? y : 1;
       } else {
-        const v = this.options.edgePadding || 0, S = this.options.topMargin || 0;
-        let b = this.options.bottomMargin || 0;
+        const y = this.options.edgePadding || 0, v = this.options.topMargin || 0;
+        let g = this.options.bottomMargin || 0;
         if (this.node && typeof this.node.isToolbarOverlay == "function" && this.node.isToolbarOverlay()) {
-          const A = typeof this.node.getToolbarVisualHeight == "function" ? this.node.getToolbarVisualHeight() : 0;
-          b += A + (this.node.getOverlayPadding ? this.node.getOverlayPadding() : 16);
+          const C = typeof this.node.getToolbarVisualHeight == "function" ? this.node.getToolbarVisualHeight() : 0;
+          g += C + (this.node.getOverlayPadding ? this.node.getOverlayPadding() : 16);
         }
-        const w = Math.max(0, e - v * 2), x = Math.max(0, t - (S + b)), N = w > 0 ? w / r : 1, D = x > 0 ? x / i : 1, C = typeof this.options.maxScale == "number" ? this.options.maxScale : 1;
-        s = Math.min(N, D, C), (!isFinite(s) || s <= 0) && (s = 1);
+        const b = Math.max(0, e - y * 2), w = Math.max(0, t - (v + g)), x = b > 0 ? b / r : 1, N = w > 0 ? w / i : 1, D = typeof this.options.maxScale == "number" ? this.options.maxScale : 1;
+        s = Math.min(x, N, D), (!isFinite(s) || s <= 0) && (s = 1);
       }
     }
     typeof this.node.setScale == "function" && this.node.setScale(s);
@@ -45914,8 +45908,8 @@ class j9 {
     if (this.node.type === "omdEquationSequenceNode" && this.node.alignPointX !== void 0)
       a = e / 2 - this.node.alignPointX * s;
     else {
-      const y = r * s;
-      a = (e - y) / 2;
+      const m = r * s;
+      a = (e - m) / 2;
     }
     const o = r * s, l = i * s, u = Math.max(
       0,
@@ -45933,7 +45927,7 @@ class j9 {
   _createNodeFromSegment(e, t) {
     try {
       if (e.includes("="))
-        return ut.fromString(e);
+        return ot.fromString(e);
       if (!t || typeof t.parse != "function")
         throw new Error("math.js parser is unavailable");
       const r = t.parse(e), i = Tt(r);
@@ -48510,7 +48504,7 @@ class Xa extends _t {
   _renderWithEquationNode(e, t) {
     if (typeof math > "u" || typeof math.parse != "function")
       throw new Error("math.js is required to parse equation strings");
-    const r = ut.fromString(e);
+    const r = ot.fromString(e);
     typeof t == "number" && r.setFontSize && r.setFontSize(t), r.hideBackgroundByDefault && r.hideBackgroundByDefault(), r.computeDimensions && r.computeDimensions(), r.updateLayout && r.updateLayout(), typeof this.equationStack.removeAllChildren == "function" ? this.equationStack.removeAllChildren() : this.equationStack.childList = [], this.equationStack.addChild(r), this.equationStack.setSpacer(0), this.equationNode = r, this.leftExpression = null, this.rightExpression = null, this.centerEquation = !1, this.updateLayout();
   }
   setLeftAndRightExpressions(e, t) {
@@ -49051,7 +49045,7 @@ class J9 extends Z2 {
       case "equation":
         if (e.equation && typeof e.equation == "string" && e.equation.includes("="))
           try {
-            t = ut.fromString(e.equation), typeof t.computeDimensions == "function" && t.computeDimensions(), typeof t.updateLayout == "function" && t.updateLayout(), t.setPosition(0, 30), this.addChild(t);
+            t = ot.fromString(e.equation), typeof t.computeDimensions == "function" && t.computeDimensions(), typeof t.updateLayout == "function" && t.updateLayout(), t.setPosition(0, 30), this.addChild(t);
             return;
           } catch (i) {
             console.warn("⚠️ omdEquationNode failed, falling back to legacy omdEquation:", i);
@@ -49518,7 +49512,7 @@ class uE {
     }
     this.pointerEventHandler.handlePointerDown(e, r);
     const i = this.canvas.toolManager.getActiveTool();
-    i && (i.onPointerDown(r), this.isDrawing === !1 && i.constructor.name !== "PointerTool" && (this.isDrawing = !0)), this.canvas.emit("pointerDown", r);
+    i && (i.onPointerDown(r), this.isDrawing === !1 && (i == null ? void 0 : i.name) !== "pointer" && (this.isDrawing = !0)), this.canvas.emit("pointerDown", r);
   }
   /**
    * Handle pointer move events
@@ -53106,11 +53100,11 @@ const eH = Z0, tH = {
     return new r(t);
   },
   createEquation(n) {
-    return ut.fromString(n);
+    return ot.fromString(n);
   },
   createStepVisualizer(n) {
     const e = n.map(
-      (t) => ut.fromString(t)
+      (t) => ot.fromString(t)
     );
     return new Vu(e);
   }
@@ -53169,7 +53163,7 @@ export {
   iE as omdDoubleTapeDiagram,
   sa as omdEllipse,
   Xa as omdEquation,
-  ut as omdEquationNode,
+  ot as omdEquationNode,
   Uu as omdEquationSequenceNode,
   c9 as omdEquationStack,
   kt as omdExpression,