cubing 0.22.0 → 0.24.0-pre2

package/{src/cubing/search/inside/solve/vendor/sq12phase/scramble_sq1.js → dist/esm/scramble_sq1-PQ2AYBFW.js}

@@ -1,16 +1,9 @@
-/*
-
-scramble_sq1.js
-
-Square-1 Solver / Scramble Generator in Javascript.
-
-Code by by Shuang Chen.
-Compiled to Javascript using GWT.
-
-*/
-
-import { randomUIntBelowFactory } from "../random-uint-below";
+import {
+  randomUIntBelowFactory
+} from "./chunk-37EHU3GZ.js";
+import "./chunk-WO2AXYFE.js";
 
+// src/cubing/vendor/sq12phase/scramble_sq1.js
 function FullCube_copy(obj, c) {
   obj.ul = c.ul;
   obj.ur = c.ur;
@@ -18,19 +11,18 @@ function FullCube_copy(obj, c) {
   obj.dr = c.dr;
   obj.ml = c.ml;
 }
-
 function FullCube_doMove(obj, move) {
   var temp;
   move <<= 2;
   if (move > 24) {
     move = 48 - move;
     temp = obj.ul;
-    obj.ul = ((~~obj.ul >> move) | (obj.ur << (24 - move))) & 16777215;
-    obj.ur = ((~~obj.ur >> move) | (temp << (24 - move))) & 16777215;
+    obj.ul = (~~obj.ul >> move | obj.ur << 24 - move) & 16777215;
+    obj.ur = (~~obj.ur >> move | temp << 24 - move) & 16777215;
   } else if (move > 0) {
     temp = obj.ul;
-    obj.ul = ((obj.ul << move) | (~~obj.ur >> (24 - move))) & 16777215;
-    obj.ur = ((obj.ur << move) | (~~temp >> (24 - move))) & 16777215;
+    obj.ul = (obj.ul << move | ~~obj.ur >> 24 - move) & 16777215;
+    obj.ur = (obj.ur << move | ~~temp >> 24 - move) & 16777215;
   } else if (move == 0) {
     temp = obj.ur;
     obj.ur = obj.dl;
@@ -39,23 +31,21 @@ function FullCube_doMove(obj, move) {
   } else if (move >= -24) {
     move = -move;
     temp = obj.dl;
-    obj.dl = ((obj.dl << move) | (~~obj.dr >> (24 - move))) & 16777215;
-    obj.dr = ((obj.dr << move) | (~~temp >> (24 - move))) & 16777215;
+    obj.dl = (obj.dl << move | ~~obj.dr >> 24 - move) & 16777215;
+    obj.dr = (obj.dr << move | ~~temp >> 24 - move) & 16777215;
   } else if (move < -24) {
     move = 48 + move;
     temp = obj.dl;
-    obj.dl = ((~~obj.dl >> move) | (obj.dr << (24 - move))) & 16777215;
-    obj.dr = ((~~obj.dr >> move) | (temp << (24 - move))) & 16777215;
+    obj.dl = (~~obj.dl >> move | obj.dr << 24 - move) & 16777215;
+    obj.dr = (~~obj.dr >> move | temp << 24 - move) & 16777215;
   }
 }
-
 function FullCube_getParity(obj) {
   var a, b, cnt, i, p;
   cnt = 0;
   obj.arr[0] = FullCube_pieceAt(obj, 0);
   for (i = 1; i < 24; ++i) {
-    FullCube_pieceAt(obj, i) != obj.arr[cnt] &&
-      (obj.arr[++cnt] = FullCube_pieceAt(obj, i));
+    FullCube_pieceAt(obj, i) != obj.arr[cnt] && (obj.arr[++cnt] = FullCube_pieceAt(obj, i));
   }
   p = 0;
   for (a = 0; a < 16; ++a) {
@@ -65,122 +55,98 @@ function FullCube_getParity(obj) {
   }
   return p;
 }
-
 function FullCube_getShapeIdx(obj) {
   var dlx, drx, ulx, urx;
   urx = obj.ur & 1118481;
   urx |= ~~urx >> 3;
   urx |= ~~urx >> 6;
-  urx = (urx & 15) | ((~~urx >> 12) & 48);
+  urx = urx & 15 | ~~urx >> 12 & 48;
   ulx = obj.ul & 1118481;
   ulx |= ~~ulx >> 3;
   ulx |= ~~ulx >> 6;
-  ulx = (ulx & 15) | ((~~ulx >> 12) & 48);
+  ulx = ulx & 15 | ~~ulx >> 12 & 48;
   drx = obj.dr & 1118481;
   drx |= ~~drx >> 3;
   drx |= ~~drx >> 6;
-  drx = (drx & 15) | ((~~drx >> 12) & 48);
+  drx = drx & 15 | ~~drx >> 12 & 48;
   dlx = obj.dl & 1118481;
   dlx |= ~~dlx >> 3;
   dlx |= ~~dlx >> 6;
-  dlx = (dlx & 15) | ((~~dlx >> 12) & 48);
-  return Shape_getShape2Idx(
-    (FullCube_getParity(obj) << 24) |
-      (ulx << 18) |
-      (urx << 12) |
-      (dlx << 6) |
-      drx,
-  );
+  dlx = dlx & 15 | ~~dlx >> 12 & 48;
+  return Shape_getShape2Idx(FullCube_getParity(obj) << 24 | ulx << 18 | urx << 12 | dlx << 6 | drx);
 }
-
 function FullCube_getSquare(obj, sq) {
   var a, b;
   for (a = 0; a < 8; ++a) {
-    obj.prm[a] = ~~((~~FullCube_pieceAt(obj, a * 3 + 1) >> 1) << 24) >> 24;
+    obj.prm[a] = ~~(~~FullCube_pieceAt(obj, a * 3 + 1) >> 1 << 24) >> 24;
   }
   sq.cornperm = get8Perm(obj.prm);
   sq.topEdgeFirst = FullCube_pieceAt(obj, 0) == FullCube_pieceAt(obj, 1);
   a = sq.topEdgeFirst ? 2 : 0;
   for (b = 0; b < 4; a += 3, ++b)
-    obj.prm[b] = ~~((~~FullCube_pieceAt(obj, a) >> 1) << 24) >> 24;
+    obj.prm[b] = ~~(~~FullCube_pieceAt(obj, a) >> 1 << 24) >> 24;
   sq.botEdgeFirst = FullCube_pieceAt(obj, 12) == FullCube_pieceAt(obj, 13);
   a = sq.botEdgeFirst ? 14 : 12;
   for (; b < 8; a += 3, ++b)
-    obj.prm[b] = ~~((~~FullCube_pieceAt(obj, a) >> 1) << 24) >> 24;
+    obj.prm[b] = ~~(~~FullCube_pieceAt(obj, a) >> 1 << 24) >> 24;
   sq.edgeperm = get8Perm(obj.prm);
   sq.ml = obj.ml;
 }
-
 function FullCube_pieceAt(obj, idx) {
   var ret;
-  idx < 6
-    ? (ret = ~~obj.ul >> ((5 - idx) << 2))
-    : idx < 12
-    ? (ret = ~~obj.ur >> ((11 - idx) << 2))
-    : idx < 18
-    ? (ret = ~~obj.dl >> ((17 - idx) << 2))
-    : (ret = ~~obj.dr >> ((23 - idx) << 2));
+  idx < 6 ? ret = ~~obj.ul >> (5 - idx << 2) : idx < 12 ? ret = ~~obj.ur >> (11 - idx << 2) : idx < 18 ? ret = ~~obj.dl >> (17 - idx << 2) : ret = ~~obj.dr >> (23 - idx << 2);
   return ~~((ret & 15) << 24) >> 24;
 }
-
 function FullCube_setPiece(obj, idx, value) {
   if (idx < 6) {
-    obj.ul &= ~(0xf << ((5 - idx) << 2));
-    obj.ul |= value << ((5 - idx) << 2);
+    obj.ul &= ~(15 << (5 - idx << 2));
+    obj.ul |= value << (5 - idx << 2);
   } else if (idx < 12) {
-    obj.ur &= ~(0xf << ((11 - idx) << 2));
-    obj.ur |= value << ((11 - idx) << 2);
+    obj.ur &= ~(15 << (11 - idx << 2));
+    obj.ur |= value << (11 - idx << 2);
   } else if (idx < 18) {
-    obj.dl &= ~(0xf << ((17 - idx) << 2));
-    obj.dl |= value << ((17 - idx) << 2);
+    obj.dl &= ~(15 << (17 - idx << 2));
+    obj.dl |= value << (17 - idx << 2);
   } else {
-    obj.dr &= ~(0xf << ((23 - idx) << 2));
-    obj.dr |= value << ((23 - idx) << 2);
+    obj.dr &= ~(15 << (23 - idx << 2));
+    obj.dr |= value << (23 - idx << 2);
   }
 }
-
 function FullCube_FullCube__Ljava_lang_String_2V() {
   this.arr = [];
   this.prm = [];
 }
-
 async function FullCube_randomCube() {
   const randomUintBelow = await randomUIntBelowFactory();
-
   var f, i, shape, edge, corner, n_edge, n_corner, rnd, m;
   f = new FullCube_FullCube__Ljava_lang_String_2V();
   shape = Shape_ShapeIdx[randomUintBelow(3678)];
-  corner = (0x01234567 << 1) | 0x11111111;
-  edge = 0x01234567 << 1;
+  corner = 19088743 << 1 | 286331153;
+  edge = 19088743 << 1;
   n_corner = n_edge = 8;
   for (i = 0; i < 24; i++) {
-    if (((shape >> i) & 1) == 0) {
-      //edge
+    if ((shape >> i & 1) == 0) {
       rnd = randomUintBelow(n_edge) << 2;
-      FullCube_setPiece(f, 23 - i, (edge >> rnd) & 0xf);
+      FullCube_setPiece(f, 23 - i, edge >> rnd & 15);
       m = (1 << rnd) - 1;
-      edge = (edge & m) + ((edge >> 4) & ~m);
+      edge = (edge & m) + (edge >> 4 & ~m);
       --n_edge;
     } else {
-      //corner
       rnd = randomUintBelow(n_corner) << 2;
-      FullCube_setPiece(f, 23 - i, (corner >> rnd) & 0xf);
-      FullCube_setPiece(f, 22 - i, (corner >> rnd) & 0xf);
+      FullCube_setPiece(f, 23 - i, corner >> rnd & 15);
+      FullCube_setPiece(f, 22 - i, corner >> rnd & 15);
       m = (1 << rnd) - 1;
-      corner = (corner & m) + ((corner >> 4) & ~m);
+      corner = (corner & m) + (corner >> 4 & ~m);
       --n_corner;
       ++i;
     }
   }
   f.ml = randomUintBelow(2);
-  //	console.log(f);
   return f;
 }
-
-function FullCube() {}
-
-let _ = (FullCube_FullCube__Ljava_lang_String_2V.prototype =
-  FullCube.prototype);
+function FullCube() {
+}
+var _ = FullCube_FullCube__Ljava_lang_String_2V.prototype = FullCube.prototype;
 _.dl = 10062778;
 _.dr = 14536702;
 _.ml = 0;
@@ -196,44 +162,23 @@ function Search_init2(obj) {
   edge = obj.Search_sq.edgeperm;
   corner = obj.Search_sq.cornperm;
   ml = obj.Search_sq.ml;
-  prun = Math.max(
-    SquarePrun[(obj.Search_sq.edgeperm << 1) | ml],
-    SquarePrun[(obj.Search_sq.cornperm << 1) | ml],
-  );
+  prun = Math.max(SquarePrun[obj.Search_sq.edgeperm << 1 | ml], SquarePrun[obj.Search_sq.cornperm << 1 | ml]);
   for (i = prun; i < obj.Search_maxlen2; ++i) {
-    if (
-      Search_phase2(
-        obj,
-        edge,
-        corner,
-        obj.Search_sq.topEdgeFirst,
-        obj.Search_sq.botEdgeFirst,
-        ml,
-        i,
-        obj.Search_length1,
-        0,
-      )
-    ) {
+    if (Search_phase2(obj, edge, corner, obj.Search_sq.topEdgeFirst, obj.Search_sq.botEdgeFirst, ml, i, obj.Search_length1, 0)) {
       for (j = 0; j < i; ++j) {
         FullCube_doMove(obj.Search_d, obj.Search_move[obj.Search_length1 + j]);
-        //console.log(obj.Search_move[obj.Search_length1 + j]);
       }
-      //console.log(obj.Search_d);
-      //console.log(obj.Search_move);
       obj.Search_sol_string = Search_move2string(obj, i + obj.Search_length1);
       return true;
     }
   }
   return false;
 }
-
 function Search_move2string(obj, len) {
   var s = "";
-  var top = 0,
-    bottom = 0;
+  var top = 0, bottom = 0;
   for (var i = len - 1; i >= 0; i--) {
     var val = obj.Search_move[i];
-    //console.log(val);
     if (val > 0) {
       val = 12 - val;
       top = val > 6 ? val - 12 : val;
@@ -252,9 +197,8 @@ function Search_move2string(obj, len) {
   if (top !== 0 || bottom !== 0) {
     s += "(" + top + ", " + bottom + ")";
   }
-  return s; // + " (" + len + "t)";
+  return s;
 }
-
 function Search_phase1(obj, shape, prunvalue, maxl, depth, lm) {
   var m, prunx, shapex;
   if (prunvalue == 0 && maxl < 4) {
@@ -273,7 +217,7 @@ function Search_phase1(obj, shape, prunvalue, maxl, depth, lm) {
   shapex = shape;
   if (lm <= 0) {
     m = 0;
-    for (;;) {
+    for (; ; ) {
       m += Shape_TopMove[shapex];
       shapex = ~~m >> 4;
       m &= 15;
@@ -294,7 +238,7 @@ function Search_phase1(obj, shape, prunvalue, maxl, depth, lm) {
   shapex = shape;
   if (lm <= 1) {
     m = 0;
-    for (;;) {
+    for (; ; ) {
       m += Shape_BottomMove[shapex];
       shapex = ~~m >> 4;
       m &= 15;
@@ -314,18 +258,7 @@ function Search_phase1(obj, shape, prunvalue, maxl, depth, lm) {
   }
   return false;
 }
-
-function Search_phase2(
-  obj,
-  edge,
-  corner,
-  topEdgeFirst,
-  botEdgeFirst,
-  ml,
-  maxl,
-  depth,
-  lm,
-) {
+function Search_phase2(obj, edge, corner, topEdgeFirst, botEdgeFirst, ml, maxl, depth, lm) {
   var botEdgeFirstx, cornerx, edgex, m, prun1, prun2, topEdgeFirstx;
   if (maxl == 0 && !topEdgeFirst && botEdgeFirst) {
     return true;
@@ -333,24 +266,9 @@ function Search_phase2(
   if (lm != 0 && topEdgeFirst == botEdgeFirst) {
     edgex = Square_TwistMove[edge];
     cornerx = Square_TwistMove[corner];
-    if (
-      SquarePrun[(edgex << 1) | (1 - ml)] < maxl &&
-      SquarePrun[(cornerx << 1) | (1 - ml)] < maxl
-    ) {
+    if (SquarePrun[edgex << 1 | 1 - ml] < maxl && SquarePrun[cornerx << 1 | 1 - ml] < maxl) {
       obj.Search_move[depth] = 0;
-      if (
-        Search_phase2(
-          obj,
-          edgex,
-          cornerx,
-          topEdgeFirst,
-          botEdgeFirst,
-          1 - ml,
-          maxl - 1,
-          depth + 1,
-          0,
-        )
-      ) {
+      if (Search_phase2(obj, edgex, cornerx, topEdgeFirst, botEdgeFirst, 1 - ml, maxl - 1, depth + 1, 0)) {
         return true;
       }
     }
@@ -360,35 +278,23 @@ function Search_phase2(
     edgex = topEdgeFirstx ? Square_TopMove[edge] : edge;
     cornerx = topEdgeFirstx ? corner : Square_TopMove[corner];
     m = topEdgeFirstx ? 1 : 2;
-    prun1 = SquarePrun[(edgex << 1) | ml];
-    prun2 = SquarePrun[(cornerx << 1) | ml];
+    prun1 = SquarePrun[edgex << 1 | ml];
+    prun2 = SquarePrun[cornerx << 1 | ml];
     while (m < 12 && prun1 <= maxl && prun1 <= maxl) {
       if (prun1 < maxl && prun2 < maxl) {
         obj.Search_move[depth] = m;
-        if (
-          Search_phase2(
-            obj,
-            edgex,
-            cornerx,
-            topEdgeFirstx,
-            botEdgeFirst,
-            ml,
-            maxl - 1,
-            depth + 1,
-            1,
-          )
-        ) {
+        if (Search_phase2(obj, edgex, cornerx, topEdgeFirstx, botEdgeFirst, ml, maxl - 1, depth + 1, 1)) {
           return true;
         }
       }
       topEdgeFirstx = !topEdgeFirstx;
       if (topEdgeFirstx) {
         edgex = Square_TopMove[edgex];
-        prun1 = SquarePrun[(edgex << 1) | ml];
+        prun1 = SquarePrun[edgex << 1 | ml];
         m += 1;
       } else {
         cornerx = Square_TopMove[cornerx];
-        prun2 = SquarePrun[(cornerx << 1) | ml];
+        prun2 = SquarePrun[cornerx << 1 | ml];
         m += 2;
       }
     }
@@ -398,77 +304,54 @@ function Search_phase2(
     edgex = botEdgeFirstx ? Square_BottomMove[edge] : edge;
     cornerx = botEdgeFirstx ? corner : Square_BottomMove[corner];
     m = botEdgeFirstx ? 1 : 2;
-    prun1 = SquarePrun[(edgex << 1) | ml];
-    prun2 = SquarePrun[(cornerx << 1) | ml];
+    prun1 = SquarePrun[edgex << 1 | ml];
+    prun2 = SquarePrun[cornerx << 1 | ml];
     while (m < (maxl > 3 ? 6 : 12) && prun1 <= maxl && prun1 <= maxl) {
       if (prun1 < maxl && prun2 < maxl) {
         obj.Search_move[depth] = -m;
-        if (
-          Search_phase2(
-            obj,
-            edgex,
-            cornerx,
-            topEdgeFirst,
-            botEdgeFirstx,
-            ml,
-            maxl - 1,
-            depth + 1,
-            2,
-          )
-        ) {
+        if (Search_phase2(obj, edgex, cornerx, topEdgeFirst, botEdgeFirstx, ml, maxl - 1, depth + 1, 2)) {
           return true;
         }
       }
       botEdgeFirstx = !botEdgeFirstx;
       if (botEdgeFirstx) {
         edgex = Square_BottomMove[edgex];
-        prun1 = SquarePrun[(edgex << 1) | ml];
+        prun1 = SquarePrun[edgex << 1 | ml];
         m += 1;
       } else {
         cornerx = Square_BottomMove[cornerx];
-        prun2 = SquarePrun[(cornerx << 1) | ml];
+        prun2 = SquarePrun[cornerx << 1 | ml];
         m += 2;
       }
     }
   }
   return false;
 }
-
 function Search_solution(obj, c) {
   var shape;
   obj.Search_c = c;
   shape = FullCube_getShapeIdx(c);
-  //console.log(shape);
-  for (
-    obj.Search_length1 = ShapePrun[shape];
-    obj.Search_length1 < 100;
-    ++obj.Search_length1
-  ) {
-    //console.log(obj.Search_length1);
+  for (obj.Search_length1 = ShapePrun[shape]; obj.Search_length1 < 100; ++obj.Search_length1) {
     obj.Search_maxlen2 = Math.min(31 - obj.Search_length1, 17);
-    if (
-      Search_phase1(obj, shape, ShapePrun[shape], obj.Search_length1, 0, -1)
-    ) {
+    if (Search_phase1(obj, shape, ShapePrun[shape], obj.Search_length1, 0, -1)) {
       break;
     }
   }
   return obj.Search_sol_string;
 }
-
 function Search_Search() {
   this.Search_move = [];
   this.Search_d = new FullCube_FullCube__Ljava_lang_String_2V();
   this.Search_sq = new Square_Square();
 }
-
-function Search() {}
-
+function Search() {
+}
 _ = Search_Search.prototype = Search.prototype;
 _.Search_c = null;
 _.Search_length1 = 0;
 _.Search_maxlen2 = 0;
 _.Search_sol_string = null;
-let Shape_$clinit_ran = false;
+var Shape_$clinit_ran = false;
 function Shape_$clinit() {
   if (Shape_$clinit_ran) {
     return;
@@ -482,7 +365,6 @@ function Shape_$clinit() {
   Shape_TwistMove = [];
   Shape_init();
 }
-
 function Shape_bottomMove(obj) {
   var move, moveParity;
   move = 0;
@@ -493,29 +375,24 @@ function Shape_bottomMove(obj) {
       obj.bottom = obj.bottom << 1;
     } else {
       move += 2;
-      obj.bottom = (obj.bottom << 2) ^ 12291;
+      obj.bottom = obj.bottom << 2 ^ 12291;
     }
     moveParity = 1 - moveParity;
   } while ((bitCount(obj.bottom & 63) & 1) != 0);
   (bitCount(obj.bottom) & 2) == 0 && (obj.Shape_parity ^= moveParity);
   return move;
 }
-
 function Shape_getIdx(obj) {
   var ret;
-  ret =
-    (binarySearch(Shape_ShapeIdx, (obj.top << 12) | obj.bottom) << 1) |
-    obj.Shape_parity;
+  ret = binarySearch(Shape_ShapeIdx, obj.top << 12 | obj.bottom) << 1 | obj.Shape_parity;
   return ret;
 }
-
 function Shape_setIdx(obj, idx) {
   obj.Shape_parity = idx & 1;
   obj.top = Shape_ShapeIdx[~~idx >> 1];
   obj.bottom = obj.top & 4095;
   obj.top >>= 12;
 }
-
 function Shape_topMove(obj) {
   var move, moveParity;
   move = 0;
@@ -526,46 +403,29 @@ function Shape_topMove(obj) {
       obj.top = obj.top << 1;
     } else {
       move += 2;
-      obj.top = (obj.top << 2) ^ 12291;
+      obj.top = obj.top << 2 ^ 12291;
     }
     moveParity = 1 - moveParity;
   } while ((bitCount(obj.top & 63) & 1) != 0);
   (bitCount(obj.top) & 2) == 0 && (obj.Shape_parity ^= moveParity);
   return move;
 }
-
-function Shape_Shape() {}
-
+function Shape_Shape() {
+}
 function Shape_getShape2Idx(shp) {
   var ret;
-  ret = (binarySearch(Shape_ShapeIdx, shp & 16777215) << 1) | (~~shp >> 24);
+  ret = binarySearch(Shape_ShapeIdx, shp & 16777215) << 1 | ~~shp >> 24;
   return ret;
 }
-
 function Shape_init() {
-  var count,
-    depth,
-    dl,
-    done,
-    done0,
-    dr,
-    i,
-    idx,
-    m,
-    s,
-    ul,
-    ur,
-    value,
-    p1,
-    p3,
-    temp;
+  var count, depth, dl, done, done0, dr, i, idx, m, s, ul, ur, value, p1, p3, temp;
   count = 0;
   for (i = 0; i < 28561; ++i) {
     dr = Shape_halflayer[i % 13];
     dl = Shape_halflayer[~~(i / 13) % 13];
     ur = Shape_halflayer[~~(~~(i / 13) / 13) % 13];
     ul = Shape_halflayer[~~(~~(~~(i / 13) / 13) / 13)];
-    value = (ul << 18) | (ur << 12) | (dl << 6) | dr;
+    value = ul << 18 | ur << 12 | dl << 6 | dr;
     bitCount(value) == 16 && (Shape_ShapeIdx[count++] = value);
   }
   s = new Shape_Shape();
@@ -580,9 +440,9 @@ function Shape_init() {
     temp = s.top & 63;
     p1 = bitCount(temp);
     p3 = bitCount(s.bottom & 4032);
-    s.Shape_parity ^= 1 & (~~(p1 & p3) >> 1);
-    s.top = (s.top & 4032) | ((~~s.bottom >> 6) & 63);
-    s.bottom = (s.bottom & 63) | (temp << 6);
+    s.Shape_parity ^= 1 & ~~(p1 & p3) >> 1;
+    s.top = s.top & 4032 | ~~s.bottom >> 6 & 63;
+    s.bottom = s.bottom & 63 | temp << 6;
     Shape_TwistMove[i] = Shape_getIdx(s);
   }
   for (i = 0; i < 7536; ++i) {
@@ -631,20 +491,19 @@ function Shape_init() {
     }
   }
 }
-
-function Shape() {}
-
+function Shape() {
+}
 _ = Shape_Shape.prototype = Shape.prototype;
 _.bottom = 0;
 _.Shape_parity = 0;
 _.top = 0;
-var Shape_BottomMove,
-  Shape_ShapeIdx,
-  ShapePrun,
-  Shape_TopMove,
-  Shape_TwistMove,
-  Shape_halflayer;
-let Square_$clinit_ran = false;
+var Shape_BottomMove;
+var Shape_ShapeIdx;
+var ShapePrun;
+var Shape_TopMove;
+var Shape_TwistMove;
+var Shape_halflayer;
+var Square_$clinit_ran = false;
 function Square_$clinit() {
   if (Square_$clinit_ran) {
     return;
@@ -656,24 +515,23 @@ function Square_$clinit() {
   Square_BottomMove = [];
   fact = [1, 1, 2, 6, 24, 120, 720, 5040];
   Cnk = [];
-  for (var i = 0; i < 12; ++i) Cnk[i] = [];
+  for (var i = 0; i < 12; ++i)
+    Cnk[i] = [];
   Square_init();
 }
-
-function Square_Square() {}
-
+function Square_Square() {
+}
 function get8Perm(arr) {
   var i, idx, v, val;
   idx = 0;
   val = 1985229328;
   for (i = 0; i < 7; ++i) {
     v = arr[i] << 2;
-    idx = (8 - i) * idx + ((~~val >> v) & 7);
+    idx = (8 - i) * idx + (~~val >> v & 7);
     val -= 286331152 << v;
   }
   return idx & 65535;
 }
-
 function Square_init() {
   var check, depth, done, find, i, idx, idxx, inv, j, m, ml, pos, temp;
   for (i = 0; i < 12; ++i) {
@@ -715,43 +573,45 @@ function Square_init() {
   depth = 0;
   done = 1;
   while (done < 80640) {
-    // console.log(done);
     inv = depth >= 11;
     find = inv ? -1 : depth;
     check = inv ? depth : -1;
     ++depth;
-    OUT: for (i = 0; i < 80640; ++i) {
-      if (SquarePrun[i] == find) {
-        idx = ~~i >> 1;
-        ml = i & 1;
-        idxx = (Square_TwistMove[idx] << 1) | (1 - ml);
-        if (SquarePrun[idxx] == check) {
-          ++done;
-          SquarePrun[inv ? i : idxx] = ~~(depth << 24) >> 24;
-          if (inv) continue OUT;
-        }
-        idxx = idx;
-        for (m = 0; m < 4; ++m) {
-          idxx = Square_TopMove[idxx];
-          if (SquarePrun[(idxx << 1) | ml] == check) {
+    OUT:
+      for (i = 0; i < 80640; ++i) {
+        if (SquarePrun[i] == find) {
+          idx = ~~i >> 1;
+          ml = i & 1;
+          idxx = Square_TwistMove[idx] << 1 | 1 - ml;
+          if (SquarePrun[idxx] == check) {
             ++done;
-            SquarePrun[inv ? i : (idxx << 1) | ml] = ~~(depth << 24) >> 24;
-            if (inv) continue OUT;
+            SquarePrun[inv ? i : idxx] = ~~(depth << 24) >> 24;
+            if (inv)
+              continue OUT;
           }
-        }
-        for (m = 0; m < 4; ++m) {
-          idxx = Square_BottomMove[idxx];
-          if (SquarePrun[(idxx << 1) | ml] == check) {
-            ++done;
-            SquarePrun[inv ? i : (idxx << 1) | ml] = ~~(depth << 24) >> 24;
-            if (inv) continue OUT;
+          idxx = idx;
+          for (m = 0; m < 4; ++m) {
+            idxx = Square_TopMove[idxx];
+            if (SquarePrun[idxx << 1 | ml] == check) {
+              ++done;
+              SquarePrun[inv ? i : idxx << 1 | ml] = ~~(depth << 24) >> 24;
+              if (inv)
+                continue OUT;
+            }
+          }
+          for (m = 0; m < 4; ++m) {
+            idxx = Square_BottomMove[idxx];
+            if (SquarePrun[idxx << 1 | ml] == check) {
+              ++done;
+              SquarePrun[inv ? i : idxx << 1 | ml] = ~~(depth << 24) >> 24;
+              if (inv)
+                continue OUT;
+            }
           }
         }
       }
-    }
   }
 }
-
 function set8Perm(arr, idx) {
   var i, m, p, v, val;
   val = 1985229328;
@@ -760,32 +620,34 @@ function set8Perm(arr, idx) {
     v = ~~(idx / p);
     idx -= v * p;
     v <<= 2;
-    arr[i] = ~~(((~~val >> v) & 7) << 24) >> 24;
+    arr[i] = ~~((~~val >> v & 7) << 24) >> 24;
     m = (1 << v) - 1;
-    val = (val & m) + ((~~val >> 4) & ~m);
+    val = (val & m) + (~~val >> 4 & ~m);
   }
   arr[7] = ~~(val << 24) >> 24;
 }
-
-function Square() {}
-
+function Square() {
+}
 _ = Square_Square.prototype = Square.prototype;
 _.botEdgeFirst = false;
 _.cornperm = 0;
 _.edgeperm = 0;
 _.ml = 0;
 _.topEdgeFirst = false;
-var Square_BottomMove, Cnk, SquarePrun, Square_TopMove, Square_TwistMove, fact;
-
+var Square_BottomMove;
+var Cnk;
+var SquarePrun;
+var Square_TopMove;
+var Square_TwistMove;
+var fact;
 function bitCount(x) {
-  x -= (~~x >> 1) & 1431655765;
-  x = ((~~x >> 2) & 858993459) + (x & 858993459);
-  x = ((~~x >> 4) + x) & 252645135;
+  x -= ~~x >> 1 & 1431655765;
+  x = (~~x >> 2 & 858993459) + (x & 858993459);
+  x = (~~x >> 4) + x & 252645135;
   x += ~~x >> 8;
   x += ~~x >> 16;
   return x & 63;
 }
-
 function binarySearch(sortedArray, key) {
   var high, low, mid, midVal;
   low = 0;
@@ -803,51 +665,42 @@ function binarySearch(sortedArray, key) {
   }
   return -low - 1;
 }
-
-/*
- * Some helper functions.
- */
-
 var square1Solver_initialized = false;
-
-var square1SolverInitialize = function (doneCallback, _, statusCallback) {
+var square1SolverInitialize = function(doneCallback, _2, statusCallback) {
   if (!square1Solver_initialized) {
     Shape_$clinit();
     Square_$clinit();
   }
-
   if (statusCallback) {
     statusCallback("Done initializing Square-1.");
   }
-
   square1Solver_initialized = true;
   if (doneCallback != null) {
     doneCallback();
   }
 };
-
-var square1SolverGetRandomPosition = async function () {
+var square1SolverGetRandomPosition = async function() {
   if (!square1Solver_initialized) {
     square1SolverInitialize();
   }
   return FullCube_randomCube();
 };
-
-var square1SolverGenerate = function (state) {
-  var search_search = new Search_Search(); // Can this be factored out?
+var square1SolverGenerate = function(state) {
+  var search_search = new Search_Search();
   return Search_solution(search_search, state);
 };
-
-var square1SolverGetRandomScramble = async function () {
+var square1SolverGetRandomScramble = async function() {
   var randomState = await square1SolverGetRandomPosition();
   var scrambleString = square1SolverGenerate(randomState);
-
   return {
     state: randomState,
-    scramble_string: scrambleString,
+    scramble_string: scrambleString
   };
 };
-
-export async function getRandomSquare1ScrambleString() {
+async function getRandomSquare1ScrambleString() {
   return (await square1SolverGetRandomScramble()).scramble_string;
 }
+export {
+  getRandomSquare1ScrambleString
+};
+//# sourceMappingURL=scramble_sq1-PQ2AYBFW.js.map