@doenet/v06-to-v07 0.7.20-dev.310 → 0.7.20-dev.311

package/{index-Bur65SYm.js → index-DjLkBfnN.js}

@@ -40537,20 +40537,20 @@ function getBeginEndFromDoenetMLRange(position2) {
 }
 function findAllNewlines(inText) {
   let allNewlines = [];
-  for (let i2 = 0; i2 < inText.length; i2++) {
-    if (inText[i2] == "\n") {
-      allNewlines.push(i2 + 1);
+  for (let i3 = 0; i3 < inText.length; i3++) {
+    if (inText[i3] == "\n") {
+      allNewlines.push(i3 + 1);
     }
   }
   return allNewlines;
 }
 function findLineCharInfo(pos, allNewlines) {
-  for (let i2 = 0; i2 < allNewlines.length; i2++) {
-    if (pos <= allNewlines[i2]) {
-      if (i2 === 0) {
+  for (let i3 = 0; i3 < allNewlines.length; i3++) {
+    if (pos <= allNewlines[i3]) {
+      if (i3 === 0) {
         return { line: 1, character: pos };
       } else {
-        return { line: i2 + 1, character: pos - allNewlines[i2 - 1] };
+        return { line: i3 + 1, character: pos - allNewlines[i3 - 1] };
       }
     }
   }
@@ -40643,9 +40643,9 @@ function requireBase32() {
         throw err;
       };
       var toUtf8String = function(bytes) {
-        var str = "", length = bytes.length, i2 = 0, followingChars = 0, b2, c2;
-        while (i2 < length) {
-          b2 = bytes[i2++];
+        var str = "", length = bytes.length, i3 = 0, followingChars = 0, b2, c2;
+        while (i3 < length) {
+          b2 = bytes[i3++];
           if (b2 <= 127) {
             str += String.fromCharCode(b2);
             continue;
@@ -40659,21 +40659,21 @@ function requireBase32() {
             c2 = b2 & 7;
             followingChars = 3;
           } else {
-            throwInvalidUtf8(i2, str);
+            throwInvalidUtf8(i3, str);
           }
           for (var j2 = 0; j2 < followingChars; ++j2) {
-            b2 = bytes[i2++];
+            b2 = bytes[i3++];
             if (b2 < 128 || b2 > 191) {
-              throwInvalidUtf8(i2, str);
+              throwInvalidUtf8(i3, str);
             }
             c2 <<= 6;
             c2 += b2 & 63;
           }
           if (c2 >= 55296 && c2 <= 57343) {
-            throwInvalidUtf8(i2, str);
+            throwInvalidUtf8(i3, str);
           }
           if (c2 > 1114111) {
-            throwInvalidUtf8(i2, str);
+            throwInvalidUtf8(i3, str);
           }
           if (c2 <= 65535) {
             str += String.fromCharCode(c2);
@@ -40693,15 +40693,15 @@ function requireBase32() {
         }
         base32Str = base32Str.replace(/=/g, "");
         var v1, v2, v3, v4, v5, v6, v7, v8, bytes = [], index2 = 0, length = base32Str.length;
-        for (var i2 = 0, count = length >> 3 << 3; i2 < count; ) {
-          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v5 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v6 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v7 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v8 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
+        for (var i3 = 0, count = length >> 3 << 3; i3 < count; ) {
+          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v5 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v6 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v7 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v8 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
           bytes[index2++] = (v1 << 3 | v2 >>> 2) & 255;
           bytes[index2++] = (v2 << 6 | v3 << 1 | v4 >>> 4) & 255;
           bytes[index2++] = (v4 << 4 | v5 >>> 1) & 255;
@@ -40710,33 +40710,33 @@ function requireBase32() {
         }
         var remain = length - count;
         if (remain === 2) {
-          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
+          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
           bytes[index2++] = (v1 << 3 | v2 >>> 2) & 255;
         } else if (remain === 4) {
-          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
+          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
           bytes[index2++] = (v1 << 3 | v2 >>> 2) & 255;
           bytes[index2++] = (v2 << 6 | v3 << 1 | v4 >>> 4) & 255;
         } else if (remain === 5) {
-          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v5 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
+          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v5 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
           bytes[index2++] = (v1 << 3 | v2 >>> 2) & 255;
           bytes[index2++] = (v2 << 6 | v3 << 1 | v4 >>> 4) & 255;
           bytes[index2++] = (v4 << 4 | v5 >>> 1) & 255;
         } else if (remain === 7) {
-          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v5 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v6 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v7 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
+          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v5 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v6 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v7 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
           bytes[index2++] = (v1 << 3 | v2 >>> 2) & 255;
           bytes[index2++] = (v2 << 6 | v3 << 1 | v4 >>> 4) & 255;
           bytes[index2++] = (v4 << 4 | v5 >>> 1) & 255;
@@ -40746,38 +40746,38 @@ function requireBase32() {
       };
       var encodeAscii = function(str) {
         var v1, v2, v3, v4, v5, base32Str = "", length = str.length;
-        for (var i2 = 0, count = parseInt(length / 5) * 5; i2 < count; ) {
-          v1 = str.charCodeAt(i2++);
-          v2 = str.charCodeAt(i2++);
-          v3 = str.charCodeAt(i2++);
-          v4 = str.charCodeAt(i2++);
-          v5 = str.charCodeAt(i2++);
+        for (var i3 = 0, count = parseInt(length / 5) * 5; i3 < count; ) {
+          v1 = str.charCodeAt(i3++);
+          v2 = str.charCodeAt(i3++);
+          v3 = str.charCodeAt(i3++);
+          v4 = str.charCodeAt(i3++);
+          v5 = str.charCodeAt(i3++);
           base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] + BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] + BASE32_ENCODE_CHAR[v2 >>> 1 & 31] + BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] + BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] + BASE32_ENCODE_CHAR[v4 >>> 2 & 31] + BASE32_ENCODE_CHAR[(v4 << 3 | v5 >>> 5) & 31] + BASE32_ENCODE_CHAR[v5 & 31];
         }
         var remain = length - count;
         if (remain === 1) {
-          v1 = str.charCodeAt(i2);
+          v1 = str.charCodeAt(i3);
           base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] + BASE32_ENCODE_CHAR[v1 << 2 & 31] + "======";
         } else if (remain === 2) {
-          v1 = str.charCodeAt(i2++);
-          v2 = str.charCodeAt(i2);
+          v1 = str.charCodeAt(i3++);
+          v2 = str.charCodeAt(i3);
           base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] + BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] + BASE32_ENCODE_CHAR[v2 >>> 1 & 31] + BASE32_ENCODE_CHAR[v2 << 4 & 31] + "====";
         } else if (remain === 3) {
-          v1 = str.charCodeAt(i2++);
-          v2 = str.charCodeAt(i2++);
-          v3 = str.charCodeAt(i2);
+          v1 = str.charCodeAt(i3++);
+          v2 = str.charCodeAt(i3++);
+          v3 = str.charCodeAt(i3);
           base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] + BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] + BASE32_ENCODE_CHAR[v2 >>> 1 & 31] + BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] + BASE32_ENCODE_CHAR[v3 << 1 & 31] + "===";
         } else if (remain === 4) {
-          v1 = str.charCodeAt(i2++);
-          v2 = str.charCodeAt(i2++);
-          v3 = str.charCodeAt(i2++);
-          v4 = str.charCodeAt(i2);
+          v1 = str.charCodeAt(i3++);
+          v2 = str.charCodeAt(i3++);
+          v3 = str.charCodeAt(i3++);
+          v4 = str.charCodeAt(i3);
           base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] + BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] + BASE32_ENCODE_CHAR[v2 >>> 1 & 31] + BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] + BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] + BASE32_ENCODE_CHAR[v4 >>> 2 & 31] + BASE32_ENCODE_CHAR[v4 << 3 & 31] + "=";
         }
         return base32Str;
       };
       var encodeUtf8 = function(str) {
-        var v1, v2, v3, v4, v5, code, end = false, base32Str = "", index2 = 0, i2, start = 0, length = str.length;
+        var v1, v2, v3, v4, v5, code, end = false, base32Str = "", index2 = 0, i3, start = 0, length = str.length;
         if (str === "") {
           return base32Str;
         }
@@ -40785,45 +40785,45 @@ function requireBase32() {
           blocks[0] = blocks[5];
           blocks[1] = blocks[6];
           blocks[2] = blocks[7];
-          for (i2 = start; index2 < length && i2 < 5; ++index2) {
+          for (i3 = start; index2 < length && i3 < 5; ++index2) {
             code = str.charCodeAt(index2);
             if (code < 128) {
-              blocks[i2++] = code;
+              blocks[i3++] = code;
             } else if (code < 2048) {
-              blocks[i2++] = 192 | code >> 6;
-              blocks[i2++] = 128 | code & 63;
+              blocks[i3++] = 192 | code >> 6;
+              blocks[i3++] = 128 | code & 63;
             } else if (code < 55296 || code >= 57344) {
-              blocks[i2++] = 224 | code >> 12;
-              blocks[i2++] = 128 | code >> 6 & 63;
-              blocks[i2++] = 128 | code & 63;
+              blocks[i3++] = 224 | code >> 12;
+              blocks[i3++] = 128 | code >> 6 & 63;
+              blocks[i3++] = 128 | code & 63;
             } else {
               code = 65536 + ((code & 1023) << 10 | str.charCodeAt(++index2) & 1023);
-              blocks[i2++] = 240 | code >> 18;
-              blocks[i2++] = 128 | code >> 12 & 63;
-              blocks[i2++] = 128 | code >> 6 & 63;
-              blocks[i2++] = 128 | code & 63;
+              blocks[i3++] = 240 | code >> 18;
+              blocks[i3++] = 128 | code >> 12 & 63;
+              blocks[i3++] = 128 | code >> 6 & 63;
+              blocks[i3++] = 128 | code & 63;
             }
           }
-          start = i2 - 5;
+          start = i3 - 5;
           if (index2 === length) {
             ++index2;
           }
-          if (index2 > length && i2 < 6) {
+          if (index2 > length && i3 < 6) {
             end = true;
           }
           v1 = blocks[0];
-          if (i2 > 4) {
+          if (i3 > 4) {
             v2 = blocks[1];
             v3 = blocks[2];
             v4 = blocks[3];
             v5 = blocks[4];
             base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] + BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] + BASE32_ENCODE_CHAR[v2 >>> 1 & 31] + BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] + BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] + BASE32_ENCODE_CHAR[v4 >>> 2 & 31] + BASE32_ENCODE_CHAR[(v4 << 3 | v5 >>> 5) & 31] + BASE32_ENCODE_CHAR[v5 & 31];
-          } else if (i2 === 1) {
+          } else if (i3 === 1) {
             base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] + BASE32_ENCODE_CHAR[v1 << 2 & 31] + "======";
-          } else if (i2 === 2) {
+          } else if (i3 === 2) {
             v2 = blocks[1];
             base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] + BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] + BASE32_ENCODE_CHAR[v2 >>> 1 & 31] + BASE32_ENCODE_CHAR[v2 << 4 & 31] + "====";
-          } else if (i2 === 3) {
+          } else if (i3 === 3) {
             v2 = blocks[1];
             v3 = blocks[2];
             base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] + BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] + BASE32_ENCODE_CHAR[v2 >>> 1 & 31] + BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] + BASE32_ENCODE_CHAR[v3 << 1 & 31] + "===";
@@ -40838,32 +40838,32 @@ function requireBase32() {
       };
       var encodeBytes = function(bytes) {
         var v1, v2, v3, v4, v5, base32Str = "", length = bytes.length;
-        for (var i2 = 0, count = parseInt(length / 5) * 5; i2 < count; ) {
-          v1 = bytes[i2++];
-          v2 = bytes[i2++];
-          v3 = bytes[i2++];
-          v4 = bytes[i2++];
-          v5 = bytes[i2++];
+        for (var i3 = 0, count = parseInt(length / 5) * 5; i3 < count; ) {
+          v1 = bytes[i3++];
+          v2 = bytes[i3++];
+          v3 = bytes[i3++];
+          v4 = bytes[i3++];
+          v5 = bytes[i3++];
           base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] + BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] + BASE32_ENCODE_CHAR[v2 >>> 1 & 31] + BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] + BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] + BASE32_ENCODE_CHAR[v4 >>> 2 & 31] + BASE32_ENCODE_CHAR[(v4 << 3 | v5 >>> 5) & 31] + BASE32_ENCODE_CHAR[v5 & 31];
         }
         var remain = length - count;
         if (remain === 1) {
-          v1 = bytes[i2];
+          v1 = bytes[i3];
           base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] + BASE32_ENCODE_CHAR[v1 << 2 & 31] + "======";
         } else if (remain === 2) {
-          v1 = bytes[i2++];
-          v2 = bytes[i2];
+          v1 = bytes[i3++];
+          v2 = bytes[i3];
           base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] + BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] + BASE32_ENCODE_CHAR[v2 >>> 1 & 31] + BASE32_ENCODE_CHAR[v2 << 4 & 31] + "====";
         } else if (remain === 3) {
-          v1 = bytes[i2++];
-          v2 = bytes[i2++];
-          v3 = bytes[i2];
+          v1 = bytes[i3++];
+          v2 = bytes[i3++];
+          v3 = bytes[i3];
           base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] + BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] + BASE32_ENCODE_CHAR[v2 >>> 1 & 31] + BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] + BASE32_ENCODE_CHAR[v3 << 1 & 31] + "===";
         } else if (remain === 4) {
-          v1 = bytes[i2++];
-          v2 = bytes[i2++];
-          v3 = bytes[i2++];
-          v4 = bytes[i2];
+          v1 = bytes[i3++];
+          v2 = bytes[i3++];
+          v3 = bytes[i3++];
+          v4 = bytes[i3];
           base32Str += BASE32_ENCODE_CHAR[v1 >>> 3] + BASE32_ENCODE_CHAR[(v1 << 2 | v2 >>> 6) & 31] + BASE32_ENCODE_CHAR[v2 >>> 1 & 31] + BASE32_ENCODE_CHAR[(v2 << 4 | v3 >>> 4) & 31] + BASE32_ENCODE_CHAR[(v3 << 1 | v4 >>> 7) & 31] + BASE32_ENCODE_CHAR[v4 >>> 2 & 31] + BASE32_ENCODE_CHAR[v4 << 3 & 31] + "=";
         }
         return base32Str;
@@ -40894,43 +40894,43 @@ function requireBase32() {
         if (length === -1) {
           length = base32Str.length;
         }
-        for (var i2 = 0, count = length >> 3 << 3; i2 < count; ) {
-          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v5 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v6 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v7 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v8 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
+        for (var i3 = 0, count = length >> 3 << 3; i3 < count; ) {
+          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v5 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v6 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v7 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v8 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
           str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255) + String.fromCharCode((v2 << 6 | v3 << 1 | v4 >>> 4) & 255) + String.fromCharCode((v4 << 4 | v5 >>> 1) & 255) + String.fromCharCode((v5 << 7 | v6 << 2 | v7 >>> 3) & 255) + String.fromCharCode((v7 << 5 | v8) & 255);
         }
         var remain = length - count;
         if (remain === 2) {
-          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
+          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
           str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255);
         } else if (remain === 4) {
-          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
+          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
           str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255) + String.fromCharCode((v2 << 6 | v3 << 1 | v4 >>> 4) & 255);
         } else if (remain === 5) {
-          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v5 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
+          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v5 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
           str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255) + String.fromCharCode((v2 << 6 | v3 << 1 | v4 >>> 4) & 255) + String.fromCharCode((v4 << 4 | v5 >>> 1) & 255);
         } else if (remain === 7) {
-          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v5 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v6 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
-          v7 = BASE32_DECODE_CHAR[base32Str.charAt(i2++)];
+          v1 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v2 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v3 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v4 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v5 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v6 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
+          v7 = BASE32_DECODE_CHAR[base32Str.charAt(i3++)];
           str += String.fromCharCode((v1 << 3 | v2 >>> 2) & 255) + String.fromCharCode((v2 << 6 | v3 << 1 | v4 >>> 4) & 255) + String.fromCharCode((v4 << 4 | v5 >>> 1) & 255) + String.fromCharCode((v5 << 7 | v6 << 2 | v7 >>> 3) & 255);
         }
         return str;
@@ -40963,7 +40963,7 @@ async function cidFromArrayBuffer(data) {
       await crypto.subtle.digest("SHA-256", new Uint8Array());
       digest = (data2) => crypto.subtle.digest("SHA-256", data2);
     } catch (e22) {
-      const sha256 = (await import("./sha256-C0vj3HDn-C8N7qkQo-_aAug7Di.js").then((n2) => n2.s)).default;
+      const sha256 = (await import("./sha256-C0vj3HDn-NmLt_Hqd-CPz_Y_rr.js").then((n2) => n2.s)).default;
       digest = (data2) => sha256(data2, {
         asBytes: true
       });
@@ -42374,9 +42374,9 @@ function enumeratePermutations({
     if (arr.length === 0) {
       result2.push(m2);
     } else {
-      for (let i2 = 0; i2 < arr.length; i2++) {
+      for (let i3 = 0; i3 < arr.length; i3++) {
         let curr = arr.slice();
-        let next = curr.splice(i2, 1);
+        let next = curr.splice(i3, 1);
         permute(curr.slice(), m2.concat(next));
         if (result2.length >= maxNumber) {
           return;
@@ -42398,8 +42398,8 @@ function normalizeMathExpression({
   if (assumptions && assumptions.tree !== "＿") {
     const assumptionsToAdd = [];
     if (Array.isArray(assumptions.tree) && assumptions.tree[0] === "list") {
-      for (let i2 = 1; i2 < assumptions.tree.length; i2++) {
-        assumptionsToAdd.push(Context.fromAst(assumptions.tree[i2]));
+      for (let i3 = 1; i3 < assumptions.tree.length; i3++) {
+        assumptionsToAdd.push(Context.fromAst(assumptions.tree[i3]));
       }
     } else {
       assumptionsToAdd.push(assumptions);
@@ -42510,16 +42510,16 @@ function returnNumericalFunctionFromFormula({
     };
   }
   let varStrings = [];
-  for (let i2 = 0; i2 < numInputs; i2++) {
-    varStrings.push(variables2[i2].subscripts_to_strings().tree);
+  for (let i3 = 0; i3 < numInputs; i3++) {
+    varStrings.push(variables2[i3].subscripts_to_strings().tree);
   }
   let haveDomain = false;
   let domainIntervals = [];
   let domainOpens = [];
   if (domain !== null) {
     haveDomain = true;
-    for (let i2 = 0; i2 < numInputs; i2++) {
-      let thisDomain = domain[i2];
+    for (let i3 = 0; i3 < numInputs; i3++) {
+      let thisDomain = domain[i3];
       if (!thisDomain) {
         haveDomain = false;
         break;
@@ -42550,18 +42550,18 @@ function returnNumericalFunctionFromFormula({
   }
   return function(...xs) {
     let fArgs = {};
-    for (let i2 = 0; i2 < numInputs; i2++) {
-      let x2 = xs[i2];
+    for (let i3 = 0; i3 < numInputs; i3++) {
+      let x2 = xs[i3];
       if (isNaN(x2)) {
         return NaN;
       } else if (haveDomain) {
-        let [minx, maxx] = domainIntervals[i2];
-        let [openMin, openMax] = domainOpens[i2];
+        let [minx, maxx] = domainIntervals[i3];
+        let [openMin, openMax] = domainOpens[i3];
         if (!(x2 >= minx) || !(x2 <= maxx) || openMin && x2 === minx || openMax && x2 === maxx) {
           return NaN;
         }
       }
-      fArgs[varStrings[i2]] = x2;
+      fArgs[varStrings[i3]] = x2;
     }
     try {
       return formula_f(fArgs);
@@ -42652,16 +42652,16 @@ function returnNumericalFunctionFromReevaluatedFormula({
     };
   }
   let varStrings = [];
-  for (let i2 = 0; i2 < numInputs; i2++) {
-    varStrings.push(variables2[i2].subscripts_to_strings().tree);
+  for (let i3 = 0; i3 < numInputs; i3++) {
+    varStrings.push(variables2[i3].subscripts_to_strings().tree);
   }
   let haveDomain = false;
   let domainIntervals = [];
   let domainOpens = [];
   if (domain !== null) {
     haveDomain = true;
-    for (let i2 = 0; i2 < numInputs; i2++) {
-      let thisDomain = domain[i2];
+    for (let i3 = 0; i3 < numInputs; i3++) {
+      let thisDomain = domain[i3];
       if (!thisDomain) {
         haveDomain = false;
         break;
@@ -42692,18 +42692,18 @@ function returnNumericalFunctionFromReevaluatedFormula({
   }
   return function(...xs) {
     let fArgs = {};
-    for (let i2 = 0; i2 < numInputs; i2++) {
-      let x2 = xs[i2];
+    for (let i3 = 0; i3 < numInputs; i3++) {
+      let x2 = xs[i3];
       if (typeof x2 !== "number" || isNaN(x2)) {
         return NaN;
       } else if (haveDomain) {
-        let [minx, maxx] = domainIntervals[i2];
-        let [openMin, openMax] = domainOpens[i2];
+        let [minx, maxx] = domainIntervals[i3];
+        let [openMin, openMax] = domainOpens[i3];
         if (!(x2 >= minx) || !(x2 <= maxx) || openMin && x2 === minx || openMax && x2 === maxx) {
           return NaN;
         }
       }
-      fArgs[varStrings[i2]] = x2;
+      fArgs[varStrings[i3]] = x2;
     }
     let argsForInputs = { ...fArgs };
     for (let code in evaluateChildrenToReevaluate) {
@@ -42821,16 +42821,16 @@ function returnSymbolicFunctionFromFormula({
     };
   }
   let varStrings = [];
-  for (let i2 = 0; i2 < numInputs; i2++) {
-    varStrings.push(variables2[i2].subscripts_to_strings().tree);
+  for (let i3 = 0; i3 < numInputs; i3++) {
+    varStrings.push(variables2[i3].subscripts_to_strings().tree);
   }
   let haveDomain = false;
   let domainIntervals = [];
   let domainOpens = [];
   if (domain !== null) {
     haveDomain = true;
-    for (let i2 = 0; i2 < numInputs; i2++) {
-      let thisDomain = domain[i2];
+    for (let i3 = 0; i3 < numInputs; i3++) {
+      let thisDomain = domain[i3];
       if (!thisDomain) {
         haveDomain = false;
         break;
@@ -42868,21 +42868,21 @@ function returnSymbolicFunctionFromFormula({
     let subArgs = {};
     let foundOutsideDomain = false;
     let allNumeric = true;
-    for (let i2 = 0; i2 < numInputs; i2++) {
-      let x2 = xs[i2];
+    for (let i3 = 0; i3 < numInputs; i3++) {
+      let x2 = xs[i3];
       if (haveDomain && allNumeric) {
         let xNum = x2.evaluate_to_constant();
         if (Number.isNaN(xNum)) {
           allNumeric = false;
         } else {
-          let [minx, maxx] = domainIntervals[i2];
-          let [openMin, openMax] = domainOpens[i2];
+          let [minx, maxx] = domainIntervals[i3];
+          let [openMin, openMax] = domainOpens[i3];
           if (!(xNum >= minx) || !(xNum <= maxx) || openMin && xNum === minx || openMax && xNum === maxx) {
             foundOutsideDomain = true;
           }
         }
       }
-      subArgs[varStrings[i2]] = x2;
+      subArgs[varStrings[i3]] = x2;
     }
     if (allNumeric && foundOutsideDomain) {
       return Context.fromAst("＿");
@@ -42972,16 +42972,16 @@ function returnSymbolicFunctionFromReevaluatedFormula({
     };
   }
   let varStrings = [];
-  for (let i2 = 0; i2 < numInputs; i2++) {
-    varStrings.push(variables2[i2].subscripts_to_strings().tree);
+  for (let i3 = 0; i3 < numInputs; i3++) {
+    varStrings.push(variables2[i3].subscripts_to_strings().tree);
   }
   let haveDomain = false;
   let domainIntervals = [];
   let domainOpens = [];
   if (domain !== null) {
     haveDomain = true;
-    for (let i2 = 0; i2 < numInputs; i2++) {
-      let thisDomain = domain[i2];
+    for (let i3 = 0; i3 < numInputs; i3++) {
+      let thisDomain = domain[i3];
       if (!thisDomain) {
         haveDomain = false;
         break;
@@ -43015,22 +43015,22 @@ function returnSymbolicFunctionFromReevaluatedFormula({
     let argsForInputs = {};
     let foundOutsideDomain = false;
     let allNumeric = true;
-    for (let i2 = 0; i2 < numInputs; i2++) {
-      let x2 = xs[i2];
+    for (let i3 = 0; i3 < numInputs; i3++) {
+      let x2 = xs[i3];
       if (haveDomain && allNumeric) {
         let xNum = x2.evaluate_to_constant();
         if (Number.isNaN(xNum)) {
           allNumeric = false;
         } else {
-          let [minx, maxx] = domainIntervals[i2];
-          let [openMin, openMax] = domainOpens[i2];
+          let [minx, maxx] = domainIntervals[i3];
+          let [openMin, openMax] = domainOpens[i3];
           if (!(xNum >= minx) || !(xNum <= maxx) || openMin && xNum === minx || openMax && xNum === maxx) {
             foundOutsideDomain = true;
           }
         }
       }
-      subArgs[varStrings[i2]] = x2;
-      argsForInputs[varStrings[i2]] = x2.tree;
+      subArgs[varStrings[i3]] = x2;
+      argsForInputs[varStrings[i3]] = x2.tree;
     }
     if (allNumeric && foundOutsideDomain) {
       return Context.fromAst("＿");
@@ -43257,9 +43257,9 @@ function returnInterpolatedFunction({
         return interpolationPointYs[mid];
       }
     }
-    let i2 = Math.max(0, high);
-    x2 -= xs[i2];
-    let c2 = coeffs[i2];
+    let i3 = Math.max(0, high);
+    x2 -= xs[i3];
+    let c2 = coeffs[i3];
     return ((c2[3] * x2 + c2[2]) * x2 + c2[1]) * x2 + c2[0];
   };
 }
@@ -43329,9 +43329,9 @@ function returnReturnDerivativesOfInterpolatedFunction({
           }
         }
       }
-      let i2 = Math.max(0, high);
-      x2 -= xs[i2];
-      let c2 = coeffs[i2];
+      let i3 = Math.max(0, high);
+      x2 -= xs[i3];
+      let c2 = coeffs[i3];
       if (order2 === 1) {
         return (3 * c2[3] * x2 + 2 * c2[2]) * x2 + c2[1];
       } else if (order2 === 2) {
@@ -43666,7 +43666,7 @@ const maxWidth = 850;
 const sizePossibilities = ["tiny", "small", "medium", "large", "full"];
 const widthFractions = [1 / 12, 0.3, 0.5, 0.7, 1];
 const fractionMidpoints = widthFractions.map(
-  (x2, i2) => (x2 + (widthFractions[i2 + 1] || Infinity)) / 2
+  (x2, i3) => (x2 + (widthFractions[i3 + 1] || Infinity)) / 2
 );
 const orderedWidthMidpoints = fractionMidpoints.map((x2) => maxWidth * x2);
 const orderedPercentWidthMidpoints = fractionMidpoints.map(
@@ -43674,11 +43674,11 @@ const orderedPercentWidthMidpoints = fractionMidpoints.map(
 );
 const widthsBySize = {};
 sizePossibilities.forEach(
-  (x2, i2) => widthsBySize[x2] = Math.floor(widthFractions[i2] * maxWidth)
+  (x2, i3) => widthsBySize[x2] = Math.floor(widthFractions[i3] * maxWidth)
 );
 const percentWidthsBySize = {};
 sizePossibilities.forEach(
-  (x2, i2) => percentWidthsBySize[x2] = Math.round(widthFractions[i2] * 100)
+  (x2, i3) => percentWidthsBySize[x2] = Math.round(widthFractions[i3] * 100)
 );
 function flattenDeep(arr1) {
   return arr1.reduce(
@@ -228870,4 +228870,4 @@ export {
   getDefaultExportFromCjs as g,
   updateSyntaxFromV06toV07 as u
 };
-//# sourceMappingURL=index-Bur65SYm.js.map
+//# sourceMappingURL=index-DjLkBfnN.js.map