cubing 0.63.4 → 0.63.5

package/experimental-json-schema/kpuzzle/KPatternData.schema.json

@@ -1,34 +1,32 @@
 {
-  "$schema": "http://json-schema.org/draft-07/schema#",
-  "additionalProperties": {
-    "$ref": "#/definitions/KPatternOrbitData"
+  "$schema": "https://json-schema.org/draft/2020-12/schema",
+  "type": "object",
+  "propertyNames": {
+    "type": "string"
   },
-  "definitions": {
-    "KPatternOrbitData": {
-      "properties": {
-        "orientation": {
-          "items": {
-            "type": "number"
-          },
-          "type": "array"
-        },
-        "orientationMod": {
-          "description": "Each piece may have an \"orientation mod\" that means \"the orientation of\nthis piece is known mod [value]\".\n\nSuppose `.numOrientations` for this orbit has a value of N. This is\nconsidered the default value for the orientation mod of each piece in the\norbit.\n\n- Each entry must be one of the following:\n - A proper divisor of N.\n   - For example: if N is 12, then one of: 1, 2, 3, 6\n - The special value 0, indicating the default value (N).\n   - This indicates that the orientation of a piece is fully known, i.e.\n      that its \"orientation mod\" is the default value (N). However, such a\n      value is recorded as 0 instead of N, in order to make it simpler to\n      implement and debug pattern logic involving the default value.\n- If `.orientationMod[i]` is a proper divisor of N (i.e. not 0), then\n `.orientation[i]` must be less than `.orientationMod[i]`. That is, the\n orientation values must be individually \"normalized\" for each piece.\n- If the `orientationMod` field is not present, then every piece is\n considered to have the default value for its \"orientation mod\".\n\nFor a \"real-world\" example of this concept, consider a traditional analog\n12-hour clock dial, like one that might hang on the wall in a school room.\nAlthough there are 24 hours in a day, A.M. and P.M. times are not\ndistinguishable on such a clock. Since 3:00 (AM) and 15:00 are not\ndistinguishable, we would read either of those times as 3:00 with an\nimplicit \"orientation mod\" of 12.\n\nFor most puzzles, however, we care about \"visual\" indistinguishability\nrather than \"temporal\" indistinguishability. To adapt the previous example,\nimagine a 24-hour clock with 24 hour marks around the dial, but where the\nhour hand is symmetric and points equally at the current hour as well as\nits diametic opposite (like a compass needle but painted all in one color).\nThis has the same set of \"valid patterns\" as a normal 12-hour clock. Such a\nclock also has an \"orientation mod\" of 12, but where the multiples of the\nmodulus have been \"unfolded\" to show their full symmetry instead of being\nimplicit.\n\nFor a non-trivial puzzle example, consider Eitan's FisherTwist, a shape mod\nof the 3x3x3 cube:\nhttps://www.hknowstore.com/locale/en-US/item.aspx?corpname=nowstore&itemid=97eb4e89-367e-4d02-b7f0-34e5e7f3cd12\n\n- The 4 equatorial centers have C₂ symmetry — it is possible to rotate any\n of these centers 180° without a visible change to the state. This means\n that the possible orientations \"loop\" after incrementing the orientation\n by 2 (two turns clockwise), and therefore the \"orientation mod\" of a\n given piece is only 2.\n - If we apply a counter-clockwise rotation to one of these centers, the\n   transformation applies an orientation of 3. But the net orientation is\n   recorded as a normalized value of 1 instead, because 3 (mod 2) ≡ 1 (mod\n   2).\n- The 2 polar centers (U and D) have no distinguishable rotations. This\n means that their orientation is \"known mod 1\" — any transformation of one\n of these centers is indistinguishable from another transformation of the\n same center, and all of them are mapped to a value of 0 (the only\n possible value that exists mod 1).\n\nFor 3x3x3:\n\n- When solving a normal 3x3x3, center orientations are conventionally\n ignored. This is similar to the polar center case for Eitan's\n FisherTwist, and the \"orientation mod\" of each piece is 1. This is also\n the core motivating use case.\n- For a supercube\n (https://experiments.cubing.net/cubing.js/twisty/supercube.html) or the\n general case of a \"picture cube\", all four center orientations are\n distinguishable for every center. This means all centers have the default\n orientation mod of 4. As documented above, this can be recorded with a\n `.orientationMod` of `[0, 0, 0, 0, 0, 0]`, or equivalently by omitting\n the `.orientationMod` field.\n- When modeling a real 3x3x3 speedcube, it is common to have a logo on a\n single sticker. If you want to model the exact visually distinguishable\n states of such a puzzles, it is possible to use an `.orientationMod` such\n as `[0, 1, 1, 1, 1, 1]`. For example, this can make it easy to find an\n alg for a given case \"while keeping the logo the same\", without placing\n more restrictions on other centers (which could make the search slower or\n produce longer solutions).\n\nFor those with a mathematical background, you may notice a relationship to\nthe concept of a coset (https://en.wikipedia.org/wiki/Coset). For example,\nconsider the group of patterns of a `KPuzzle` (without indistinguishable\npieces) generated by a set of transformations. We can assign each set of\npiece orbits an orientation mod value (which must be identical for all\nconstituent pieces of the same orbit). Each such choice generates a set of\nvalid `KPattern`s that forms a subgroup, and each set of valid `.orientation`\nvalues defines one coset of this set. However, note that the set of valid\n`KPattern`s does *not* form a group when there are any pieces with different\n`.orientationMod` values that share an orbit.\n\n--------\n\nNote that the concept of \"orientation mod\" exclusively applies to `KPattern`,\nnot `KTransformation`. If we tried to apply the orientation mod\ncalculations to the *transformations* of Eitan's FisherTwist, then `SWAP =\n[U, M' E2 M]` would be indistinguishable from the identity. This would mean\nthat if we calculated `SWAP` and then used this calculation for `S SWAP\nS'`, then we would conclude that it has no net effect. However, `S SWAP S'`\ndoes *not* have the same effect as doing nothing — it visibly rotates the L\nand R centers! (In mathematical terms: the set of `KTransformation`s would\nnot form a valid set of semigroup actions, due to broken associativity.)\n\nAlthough there are times that we could theoretically save some time/space\nby ignoring some information when it's not needed for working with certain\n`KTransformation`s (e.g. ignoring all center orientations for 3x3x3), it is\nmore practical for each `KTransformation` to always track the full range\nfor each piece's `.orientation`. For example:\n\n- This is simpler, both conceptually and in code.\n- This allows changing the set of moves for a puzzle, without recalculating\n cached transformations or certain lookup tables (useful for alg\n searches).\n- This allows swapping out a normal 3x3x3 in a `<twisty-player>` for a\n picture cube, without re-calculating the center orientations of the\n current alg.\n\nThese use cases may not be strictly \"necessary\", but the opposite behaviour\nmight be surprising or frustrating if someone does not expect it. So we\nimplement it this way.\n\nInformally, the `KTransformation` has the full responsibility for tracking\n\"what really happens\" — even if the effect is invisible in some cases,\nwhile the `KPattern` tracks both what \"is\" and what \"isn't\" known.",
-          "items": {
-            "type": "number"
-          },
-          "type": "array"
-        },
-        "pieces": {
-          "items": {
-            "type": "number"
-          },
-          "type": "array"
+  "additionalProperties": {
+    "type": "object",
+    "properties": {
+      "pieces": {
+        "type": "array",
+        "items": {
+          "type": "number"
         }
       },
-      "required": ["orientation", "pieces"],
-      "type": "object"
-    }
-  },
-  "type": "object"
+      "orientation": {
+        "type": "array",
+        "items": {
+          "type": "number"
+        }
+      },
+      "orientationMod": {
+        "type": "array",
+        "items": {
+          "type": "number"
+        }
+      }
+    },
+    "required": ["pieces", "orientation"],
+    "additionalProperties": false
+  }
 }

package/experimental-json-schema/kpuzzle/KPuzzleDefinition.schema.json

@@ -1,97 +1,101 @@
 {
-  "$schema": "http://json-schema.org/draft-07/schema#",
-  "definitions": {
-    "KPatternOrbitData": {
-      "properties": {
-        "orientation": {
-          "items": {
-            "type": "number"
+  "$schema": "https://json-schema.org/draft/2020-12/schema",
+  "type": "object",
+  "properties": {
+    "name": {
+      "type": "string"
+    },
+    "orbits": {
+      "type": "array",
+      "items": {
+        "type": "object",
+        "properties": {
+          "orbitName": {
+            "type": "string"
           },
-          "type": "array"
-        },
-        "orientationMod": {
-          "description": "Each piece may have an \"orientation mod\" that means \"the orientation of\nthis piece is known mod [value]\".\n\nSuppose `.numOrientations` for this orbit has a value of N. This is\nconsidered the default value for the orientation mod of each piece in the\norbit.\n\n- Each entry must be one of the following:\n - A proper divisor of N.\n   - For example: if N is 12, then one of: 1, 2, 3, 6\n - The special value 0, indicating the default value (N).\n   - This indicates that the orientation of a piece is fully known, i.e.\n      that its \"orientation mod\" is the default value (N). However, such a\n      value is recorded as 0 instead of N, in order to make it simpler to\n      implement and debug pattern logic involving the default value.\n- If `.orientationMod[i]` is a proper divisor of N (i.e. not 0), then\n `.orientation[i]` must be less than `.orientationMod[i]`. That is, the\n orientation values must be individually \"normalized\" for each piece.\n- If the `orientationMod` field is not present, then every piece is\n considered to have the default value for its \"orientation mod\".\n\nFor a \"real-world\" example of this concept, consider a traditional analog\n12-hour clock dial, like one that might hang on the wall in a school room.\nAlthough there are 24 hours in a day, A.M. and P.M. times are not\ndistinguishable on such a clock. Since 3:00 (AM) and 15:00 are not\ndistinguishable, we would read either of those times as 3:00 with an\nimplicit \"orientation mod\" of 12.\n\nFor most puzzles, however, we care about \"visual\" indistinguishability\nrather than \"temporal\" indistinguishability. To adapt the previous example,\nimagine a 24-hour clock with 24 hour marks around the dial, but where the\nhour hand is symmetric and points equally at the current hour as well as\nits diametic opposite (like a compass needle but painted all in one color).\nThis has the same set of \"valid patterns\" as a normal 12-hour clock. Such a\nclock also has an \"orientation mod\" of 12, but where the multiples of the\nmodulus have been \"unfolded\" to show their full symmetry instead of being\nimplicit.\n\nFor a non-trivial puzzle example, consider Eitan's FisherTwist, a shape mod\nof the 3x3x3 cube:\nhttps://www.hknowstore.com/locale/en-US/item.aspx?corpname=nowstore&itemid=97eb4e89-367e-4d02-b7f0-34e5e7f3cd12\n\n- The 4 equatorial centers have C₂ symmetry — it is possible to rotate any\n of these centers 180° without a visible change to the state. This means\n that the possible orientations \"loop\" after incrementing the orientation\n by 2 (two turns clockwise), and therefore the \"orientation mod\" of a\n given piece is only 2.\n - If we apply a counter-clockwise rotation to one of these centers, the\n   transformation applies an orientation of 3. But the net orientation is\n   recorded as a normalized value of 1 instead, because 3 (mod 2) ≡ 1 (mod\n   2).\n- The 2 polar centers (U and D) have no distinguishable rotations. This\n means that their orientation is \"known mod 1\" — any transformation of one\n of these centers is indistinguishable from another transformation of the\n same center, and all of them are mapped to a value of 0 (the only\n possible value that exists mod 1).\n\nFor 3x3x3:\n\n- When solving a normal 3x3x3, center orientations are conventionally\n ignored. This is similar to the polar center case for Eitan's\n FisherTwist, and the \"orientation mod\" of each piece is 1. This is also\n the core motivating use case.\n- For a supercube\n (https://experiments.cubing.net/cubing.js/twisty/supercube.html) or the\n general case of a \"picture cube\", all four center orientations are\n distinguishable for every center. This means all centers have the default\n orientation mod of 4. As documented above, this can be recorded with a\n `.orientationMod` of `[0, 0, 0, 0, 0, 0]`, or equivalently by omitting\n the `.orientationMod` field.\n- When modeling a real 3x3x3 speedcube, it is common to have a logo on a\n single sticker. If you want to model the exact visually distinguishable\n states of such a puzzles, it is possible to use an `.orientationMod` such\n as `[0, 1, 1, 1, 1, 1]`. For example, this can make it easy to find an\n alg for a given case \"while keeping the logo the same\", without placing\n more restrictions on other centers (which could make the search slower or\n produce longer solutions).\n\nFor those with a mathematical background, you may notice a relationship to\nthe concept of a coset (https://en.wikipedia.org/wiki/Coset). For example,\nconsider the group of patterns of a `KPuzzle` (without indistinguishable\npieces) generated by a set of transformations. We can assign each set of\npiece orbits an orientation mod value (which must be identical for all\nconstituent pieces of the same orbit). Each such choice generates a set of\nvalid `KPattern`s that forms a subgroup, and each set of valid `.orientation`\nvalues defines one coset of this set. However, note that the set of valid\n`KPattern`s does *not* form a group when there are any pieces with different\n`.orientationMod` values that share an orbit.\n\n--------\n\nNote that the concept of \"orientation mod\" exclusively applies to `KPattern`,\nnot `KTransformation`. If we tried to apply the orientation mod\ncalculations to the *transformations* of Eitan's FisherTwist, then `SWAP =\n[U, M' E2 M]` would be indistinguishable from the identity. This would mean\nthat if we calculated `SWAP` and then used this calculation for `S SWAP\nS'`, then we would conclude that it has no net effect. However, `S SWAP S'`\ndoes *not* have the same effect as doing nothing — it visibly rotates the L\nand R centers! (In mathematical terms: the set of `KTransformation`s would\nnot form a valid set of semigroup actions, due to broken associativity.)\n\nAlthough there are times that we could theoretically save some time/space\nby ignoring some information when it's not needed for working with certain\n`KTransformation`s (e.g. ignoring all center orientations for 3x3x3), it is\nmore practical for each `KTransformation` to always track the full range\nfor each piece's `.orientation`. For example:\n\n- This is simpler, both conceptually and in code.\n- This allows changing the set of moves for a puzzle, without recalculating\n cached transformations or certain lookup tables (useful for alg\n searches).\n- This allows swapping out a normal 3x3x3 in a `<twisty-player>` for a\n picture cube, without re-calculating the center orientations of the\n current alg.\n\nThese use cases may not be strictly \"necessary\", but the opposite behaviour\nmight be surprising or frustrating if someone does not expect it. So we\nimplement it this way.\n\nInformally, the `KTransformation` has the full responsibility for tracking\n\"what really happens\" — even if the effect is invisible in some cases,\nwhile the `KPattern` tracks both what \"is\" and what \"isn't\" known.",
-          "items": {
+          "numPieces": {
             "type": "number"
           },
-          "type": "array"
-        },
-        "pieces": {
-          "items": {
+          "numOrientations": {
             "type": "number"
-          },
-          "type": "array"
-        }
-      },
-      "required": ["orientation", "pieces"],
-      "type": "object"
-    },
-    "KPuzzleOrbitDefinition": {
-      "properties": {
-        "numOrientations": {
-          "type": "number"
-        },
-        "numPieces": {
-          "type": "number"
+          }
         },
-        "orbitName": {
-          "type": "string"
-        }
-      },
-      "required": ["numOrientations", "numPieces", "orbitName"],
-      "type": "object"
+        "required": ["orbitName", "numPieces", "numOrientations"],
+        "additionalProperties": false
+      }
     },
-    "KTransformationOrbitData": {
-      "properties": {
-        "orientationDelta": {
-          "items": {
-            "type": "number"
-          },
-          "type": "array"
-        },
-        "permutation": {
-          "items": {
-            "type": "number"
-          },
-          "type": "array"
-        }
-      },
-      "required": ["orientationDelta", "permutation"],
-      "type": "object"
-    }
-  },
-  "properties": {
     "defaultPattern": {
-      "additionalProperties": {
-        "$ref": "#/definitions/KPatternOrbitData"
-      },
-      "type": "object"
-    },
-    "derivedMoves": {
-      "additionalProperties": {
+      "type": "object",
+      "propertyNames": {
         "type": "string"
       },
-      "type": "object"
+      "additionalProperties": {
+        "type": "object",
+        "properties": {
+          "pieces": {
+            "type": "array",
+            "items": {
+              "type": "number"
+            }
+          },
+          "orientation": {
+            "type": "array",
+            "items": {
+              "type": "number"
+            }
+          },
+          "orientationMod": {
+            "type": "array",
+            "items": {
+              "type": "number"
+            }
+          }
+        },
+        "required": ["pieces", "orientation"],
+        "additionalProperties": false
+      }
     },
     "moves": {
+      "type": "object",
+      "propertyNames": {
+        "type": "string"
+      },
       "additionalProperties": {
-        "additionalProperties": {
-          "$ref": "#/definitions/KTransformationOrbitData"
+        "type": "object",
+        "propertyNames": {
+          "type": "string"
         },
-        "type": "object"
-      },
-      "type": "object"
-    },
-    "name": {
-      "type": "string"
+        "additionalProperties": {
+          "type": "object",
+          "properties": {
+            "permutation": {
+              "type": "array",
+              "items": {
+                "type": "number"
+              }
+            },
+            "orientationDelta": {
+              "type": "array",
+              "items": {
+                "type": "number"
+              }
+            }
+          },
+          "required": ["permutation", "orientationDelta"],
+          "additionalProperties": false
+        }
+      }
     },
-    "orbits": {
-      "items": {
-        "$ref": "#/definitions/KPuzzleOrbitDefinition"
+    "derivedMoves": {
+      "type": "object",
+      "propertyNames": {
+        "type": "string"
       },
-      "type": "array"
+      "additionalProperties": {
+        "type": "string"
+      }
     }
   },
-  "required": ["defaultPattern", "moves", "name", "orbits"],
-  "type": "object"
+  "required": ["name", "orbits", "defaultPattern", "moves"],
+  "additionalProperties": false
 }

package/experimental-json-schema/kpuzzle/KTransformationData.schema.json

@@ -1,27 +1,26 @@
 {
-  "$schema": "http://json-schema.org/draft-07/schema#",
-  "additionalProperties": {
-    "$ref": "#/definitions/KTransformationOrbitData"
+  "$schema": "https://json-schema.org/draft/2020-12/schema",
+  "type": "object",
+  "propertyNames": {
+    "type": "string"
   },
-  "definitions": {
-    "KTransformationOrbitData": {
-      "properties": {
-        "orientationDelta": {
-          "items": {
-            "type": "number"
-          },
-          "type": "array"
-        },
-        "permutation": {
-          "items": {
-            "type": "number"
-          },
-          "type": "array"
+  "additionalProperties": {
+    "type": "object",
+    "properties": {
+      "permutation": {
+        "type": "array",
+        "items": {
+          "type": "number"
         }
       },
-      "required": ["orientationDelta", "permutation"],
-      "type": "object"
-    }
-  },
-  "type": "object"
+      "orientationDelta": {
+        "type": "array",
+        "items": {
+          "type": "number"
+        }
+      }
+    },
+    "required": ["permutation", "orientationDelta"],
+    "additionalProperties": false
+  }
 }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "cubing",
-  "version": "0.63.4",
+  "version": "0.63.5",
   "description": "A collection of JavaScript cubing libraries.",
   "author": "The js.cubing.net team",
   "license": "MPL-2.0 OR GPL-3.0-or-later",
@@ -74,11 +74,12 @@
     "type-fest": "^5.2.0"
   },
   "devDependencies": {
-    "@biomejs/biome": "^2.5.8",
+    "@biomejs/biome": "^2.5.13",
     "@cubing/comlink-everywhere": ">=0.1.2",
     "@cubing/deploy": ">=0.4.11",
     "@cubing/dev-config": ">=0.10.1",
     "@esm-bundle/chai": "^4.3.4-fix.0",
+    "@fontsource/ubuntu": "^5.3.0",
     "@schemastore/package": "^0.0.10",
     "@types/bun": "^1.3.14",
     "@types/chai": "^5.0.0",
@@ -100,7 +101,8 @@
     "playwright": "^1.58.0",
     "printable-shell-command": "^5.3.0",
     "tsdown": "^0.21.10",
-    "typedoc": "^0.28.18"
+    "typedoc": "^0.28.18",
+    "zod": "^4.6.2"
   },
   "files": [
     "./dist/bin/",
@@ -135,5 +137,8 @@
       "fromLocalDir": "./dist/sites/experiments.cubing.net/cubing.js/"
     }
   },
-  "$schema": "./node_modules/@cubing/deploy/config-schema.package.json"
+  "$schema": "./node_modules/@cubing/deploy/config-schema.package.json",
+  "patchedDependencies": {
+    "bun-types@1.3.14": "patches/bun-types@1.3.14.patch"
+  }
 }

package/dist/lib/cubing/chunks/chunk-53SI7XS4.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../../../src/cubing/search/worker-workarounds/index.ts", "../../../../src/cubing/search/instantiator.ts", "../../../../src/cubing/search/outside.ts"],
-  "sourcesContent": ["import { exposeAPI } from \"./worker-guard\";\n\nexport function searchWorkerURLImportMetaResolve(): string {\n  // Note:\n  // - We have to hardcode the expected path of the entry file in the ESM build, due to lack of `esbuild` support: https://github.com/evanw/esbuild/issues/2866\n  //   - This URL is based on the assumption that the code from this file ends up in a shared chunk in the `esm` build. This is not guaranteed by `esbuild`, but it consistently happens for our codebase.\n  // - We inline the value (instead of using a constant), to maximize compatibility for hardcoded syntax detection in bundlers.\n  return import.meta.resolve(\"./search-worker-entry.js\");\n}\n\nexport function searchWorkerURLNewURLImportMetaURL(): URL {\n  // Note:\n  // - We have to hardcode the expected path of the entry file in the ESM build, due to lack of `esbuild` support: https://github.com/evanw/esbuild/issues/795\n  //   - This URL is based on the assumption that the code from this file ends up in a shared chunk in the `esm` build. This is not guaranteed by `esbuild`, but it consistently happens for our codebase.\n  // - We inline the value (instead of using a constant), to maximize compatibility for hardcoded syntax detection in bundlers.\n  return new URL(\"./search-worker-entry.js\", import.meta.url);\n}\n\n// Workaround for `esbuild`: https://github.com/evanw/esbuild/issues/312#issuecomment-1092195778\nexport async function searchWorkerURLEsbuildWorkaround(): Promise<string> {\n  exposeAPI.expose = false;\n  return (await import(\"./search-worker-entry.js\")).WORKER_ENTRY_FILE_URL;\n}\n\nexport function instantiateSearchWorkerURLNewURLImportMetaURL(): Worker {\n  return new Worker(new URL(\"./search-worker-entry.js\", import.meta.url), {\n    type: \"module\",\n  });\n}\n", "import type { Worker as NodeWorker } from \"node:worker_threads\";\nimport { PortableWorker, wrap } from \"@cubing/comlink-everywhere\";\nimport type { WorkerAPI } from \"./inside/api\";\nimport { searchOutsideDebugGlobals } from \"./outside\";\nimport {\n  searchWorkerURLEsbuildWorkaround,\n  searchWorkerURLImportMetaResolve,\n  searchWorkerURLNewURLImportMetaURL,\n} from \"./worker-workarounds\";\n\nfunction wrapAPI(worker: Worker | NodeWorker): WorkerAPI {\n  return wrap<WorkerAPI>(worker);\n}\n\nasync function instantiateModuleWorker(\n  workerEntryFileURL: string | URL,\n): Promise<WorkerAPI> {\n  // biome-ignore lint/suspicious/noAsyncPromiseExecutor: TODO\n  return new Promise<WorkerAPI>(async (resolve, reject) => {\n    try {\n      const worker = new PortableWorker(workerEntryFileURL);\n\n      // TODO: Remove this once we can remove the workarounds for lack of `import.meta.resolve(\u2026)` support.\n      const onFirstMessage = (messageData: string) => {\n        if (messageData === \"comlink-exposed\") {\n          // We need to clear the timeout so that we don't prevent `node` from exiting in the meantime.\n          resolve(wrapAPI(worker));\n        } else {\n          reject(\n            new Error(`wrong module instantiation message ${messageData}`),\n          );\n        }\n      };\n\n      const onError = (e: ErrorEvent) => {\n        reject(e);\n      };\n\n      if (\"once\" in worker /* hack to detect `node` */) {\n        // We have to use `once` so the `unref()` from `comlink-everywhere` allows the process to quit as expected.\n        worker.once(\"message\", onFirstMessage);\n      } else {\n        worker.addEventListener(\"error\", onError, {\n          once: true,\n        });\n        worker.addEventListener(\n          \"message\",\n          (e: MessageEvent) => onFirstMessage(e.data),\n          {\n            once: true,\n          },\n        );\n      }\n    } catch (e) {\n      reject(e);\n    }\n  });\n}\n\nexport const allWorkerAPIPromises: Promise<WorkerAPI>[] = [];\n\nexport async function instantiateWorkerAPI(): Promise<WorkerAPI> {\n  const workerAPIPromise = instantiateWorkerImplementation();\n  allWorkerAPIPromises.push(workerAPIPromise);\n  const insideAPI = await workerAPIPromise;\n  insideAPI.setDebugMeasurePerf(searchOutsideDebugGlobals.logPerf);\n  insideAPI.setDebugForceTwipsForScrambles(\n    searchOutsideDebugGlobals.forceTwipsForScrambles,\n  );\n  insideAPI.setScramblePrefetchLevel(\n    searchOutsideDebugGlobals.scramblePrefetchLevel,\n  );\n  return workerAPIPromise;\n}\n\ntype FallbackStrategyInfo = [\n  fn: () => Promise<WorkerAPI>,\n  description: string,\n  warnOnSuccess: null | string,\n];\n\nasync function instantiateWorkerImplementation(): Promise<WorkerAPI> {\n  if (globalThis.location?.protocol === \"file:\") {\n    console.warn(\n      \"This current web page is loaded from the local filesystem (a URL that starts with `file://`). In this situation, `cubing.js` may be unable to generate scrambles or perform searches in some browsers. See: https://js.cubing.net/cubing/scramble/#file-server-required\",\n    );\n  }\n\n  function failed(methodDescription?: string) {\n    return `Module worker instantiation${\n      methodDescription ? ` ${methodDescription}` : \"\"\n    } failed`;\n  }\n\n  const importMetaResolveStrategy: FallbackStrategyInfo = [\n    async () => instantiateModuleWorker(searchWorkerURLImportMetaResolve()),\n    \"using `import.meta.resolve(\u2026)\",\n    null,\n  ];\n  const esbuildWorkaroundStrategy: FallbackStrategyInfo = [\n    async () =>\n      instantiateModuleWorker(await searchWorkerURLEsbuildWorkaround()),\n    \"using the `esbuild` workaround\",\n    // TODO: we will hopefully discontinue the `esbuild` workaround at some\n    // point, but `esbuild` has been stuck for 3 years on this issue. Because\n    // `esbuild` and Vite (which uses `esbuild`) are now dominating the\n    // ecosystem, this just causes a warning for a lot of devs/users that they\n    // can't do anything about. As frustrating as the situation is, the\n    // workaround is semantically fine (even if it's convoluted) and is\n    // preserved by `esbuild`-based flows in practice. So we suppress the\n    // warning in the medium-term but maintain long-term hope that we can\n    // remove it (and the other fallbacks as well).\n    null,\n  ];\n  const newURLStrategy: FallbackStrategyInfo = [\n    async () => instantiateModuleWorker(searchWorkerURLNewURLImportMetaURL()),\n    \"using `new URL(\u2026, import.meta.url)`\",\n    \"will\",\n  ];\n\n  const fallbackOrder: FallbackStrategyInfo[] =\n    searchOutsideDebugGlobals.prioritizeEsbuildWorkaroundForWorkerInstantiation\n      ? [esbuildWorkaroundStrategy, importMetaResolveStrategy, newURLStrategy]\n      : [importMetaResolveStrategy, esbuildWorkaroundStrategy, newURLStrategy];\n\n  for (const [fn, description, warnOnSuccess] of fallbackOrder) {\n    try {\n      const worker = await fn();\n      if (warnOnSuccess) {\n        if (searchOutsideDebugGlobals.showWorkerInstantiationWarnings) {\n          console.warn(\n            `Module worker instantiation required ${description}. \\`cubing.js\\` ${warnOnSuccess} not support this fallback in the future.`,\n          );\n        }\n      }\n      return worker;\n    } catch {\n      // if (searchOutsideDebugGlobals.showWorkerInstantiationWarnings) {\n      //   console.warn(`${failed(description)}, falling back.`);\n      // }\n    }\n  }\n\n  throw new Error(`${failed()}. There are no more fallbacks available.`);\n}\n", "import { Alg } from \"../alg\";\nimport type { KPuzzle } from \"../kpuzzle\";\n// import { preInitialize222 } from \"../implementations/2x2x2\";\nimport type { KPattern } from \"../kpuzzle/KPattern\";\nimport type { PrefetchLevel, WorkerAPI } from \"./inside/api\";\nimport type { TwipsOptions } from \"./inside/solve/twips\";\nimport { allWorkerAPIPromises, instantiateWorkerAPI } from \"./instantiator\";\n\nlet cachedWorkerInstance: Promise<WorkerAPI> | undefined;\nfunction getCachedWorkerInstance(): Promise<WorkerAPI> {\n  return (cachedWorkerInstance ??= instantiateWorkerAPI());\n}\n\nexport async function mapToAllWorkers(\n  f: (worker: WorkerAPI) => void,\n): Promise<void> {\n  await Promise.all(\n    allWorkerAPIPromises.map(async (worker) => {\n      f(await worker);\n    }),\n  );\n}\n\n// Pre-initialize the scrambler for the given event. (Otherwise, an event is\n// initialized the first time you ask for a scramble for that event.)\n//\n// Some typical numbers for a fast computer:\n// - 3x3x3 initialization: 200ms\n// - Each 3x3x3 scramble: 50ms\n// - 4x4x4 initialization: 2500ms\n// - Each 4x4x4 scramble: 300ms to 800ms\n//\n// It is safe to immediately call for a scramble\n// any time after starting pre-initialization, or to call for them without\n// pre-initializing. Pre-initializing essentially gives the scramble worker a\n// head start in case a scramble doesn't get requested immediately.\n//\n// Note that events cannot be pre-initialized in parallel. Attempting to\n// pre-initialize multiple events will initialize them consecutively. Scrambles\n// for a given event cannot be computed while another event is being initialized.\nexport function _preInitializationHintForEvent(\n  eventID: string,\n  // callback?: () => void\n): void {\n  switch (eventID) {\n    case \"333oh\":\n      _preInitializationHintForEvent(\"333\");\n      return;\n  }\n  void (async () => {\n    await (await getCachedWorkerInstance()).initialize(eventID);\n  })();\n}\n\nexport async function randomScrambleForEvent(eventID: string): Promise<Alg> {\n  const worker = searchOutsideDebugGlobals.forceNewWorkerForEveryScramble\n    ? await instantiateWorkerAPI()\n    : await getCachedWorkerInstance();\n  const scrambleString = await worker.randomScrambleStringForEvent(eventID);\n\n  return Alg.fromString(scrambleString);\n}\n\nexport async function deriveScrambleForEvent(\n  derivationSeedHex: string,\n  derivationSaltHierarchy: string[],\n  eventID: string,\n): Promise<Alg> {\n  if (!searchOutsideDebugGlobals.allowDerivedScrambles) {\n    throw new Error(\"Derived scrambles are not allowed.\");\n  }\n  const worker = searchOutsideDebugGlobals.forceNewWorkerForEveryScramble\n    ? await instantiateWorkerAPI()\n    : await getCachedWorkerInstance();\n  const scrambleString = await worker.deriveScrambleStringForEvent(\n    derivationSeedHex,\n    derivationSaltHierarchy,\n    eventID,\n  );\n  return Alg.fromString(scrambleString);\n}\n\nexport async function experimentalSolve3x3x3IgnoringCenters(\n  pattern: KPattern,\n): Promise<Alg> {\n  const cwi = await getCachedWorkerInstance();\n  return Alg.fromString(await cwi.solve333ToString(pattern.patternData));\n}\n\nexport async function experimentalSolve2x2x2(pattern: KPattern): Promise<Alg> {\n  const cwi = await getCachedWorkerInstance();\n  return Alg.fromString(await cwi.solve222ToString(pattern.patternData));\n}\n\nexport async function solveSkewb(pattern: KPattern): Promise<Alg> {\n  const cwi = await getCachedWorkerInstance();\n  return Alg.fromString(await cwi.solveSkewbToString(pattern.patternData));\n}\n\nexport async function solvePyraminx(pattern: KPattern): Promise<Alg> {\n  const cwi = await getCachedWorkerInstance();\n  return Alg.fromString(await cwi.solvePyraminxToString(pattern.patternData));\n}\n\nexport async function solveMegaminx(pattern: KPattern): Promise<Alg> {\n  const cwi = await getCachedWorkerInstance();\n  return Alg.fromString(await cwi.solveMegaminxToString(pattern.patternData));\n}\n\nexport interface SolveTwipsOptions {\n  generatorMoves?: string[];\n  targetPattern?: KPattern;\n  minDepth?: number;\n  maxDepth?: number;\n}\n\nexport async function solveTwips(\n  kpuzzle: KPuzzle,\n  pattern: KPattern,\n  options?: SolveTwipsOptions,\n): Promise<Alg> {\n  const { targetPattern, ...otherOptions } = options ?? {};\n  const apiOptions: TwipsOptions = otherOptions;\n  if (targetPattern) {\n    apiOptions.targetPattern = targetPattern.patternData;\n  }\n  const { ...def } = kpuzzle.definition;\n  delete def.experimentalIsPatternSolved;\n  // delete def.derivedMoves;\n  const dedicatedWorker = await instantiateWorkerAPI();\n  try {\n    return Alg.fromString(\n      // TODO: unnecessary because we terminate the worker?\n      await dedicatedWorker.solveTwipsToString(\n        def,\n        pattern.patternData,\n        apiOptions,\n      ),\n    );\n  } finally {\n    console.log(\"Search ended, terminating dedicated `twips` worker.\");\n    // TODO: support re-using the same worker for multiple searches..\n    // dedicatedWorker.terminate?.(); // TODO\n  }\n}\n\ninterface SearchOutsideDebugGlobals {\n  logPerf: boolean;\n  scramblePrefetchLevel: `${PrefetchLevel}`;\n  forceNewWorkerForEveryScramble: boolean;\n  showWorkerInstantiationWarnings: boolean;\n  forceTwipsForScrambles: boolean;\n  // This can prevent a request to `search-worker-entry.js` when it doesn't exist, if the library semantics have been mangled by `esbuild`.\n  prioritizeEsbuildWorkaroundForWorkerInstantiation: boolean;\n  allowDerivedScrambles: boolean;\n}\n\nexport const searchOutsideDebugGlobals: SearchOutsideDebugGlobals = {\n  logPerf: true,\n  scramblePrefetchLevel: \"auto\",\n  forceNewWorkerForEveryScramble: false,\n  forceTwipsForScrambles: false,\n  showWorkerInstantiationWarnings: true,\n  prioritizeEsbuildWorkaroundForWorkerInstantiation: false,\n  allowDerivedScrambles: false,\n};\n\nexport function setSearchDebug(\n  options: Partial<SearchOutsideDebugGlobals>,\n): void {\n  const { logPerf, forceTwipsForScrambles, scramblePrefetchLevel } = options;\n  if (typeof logPerf !== \"undefined\") {\n    searchOutsideDebugGlobals.logPerf = logPerf;\n    void mapToAllWorkers((worker) => worker.setDebugMeasurePerf(logPerf));\n  }\n  if (typeof forceTwipsForScrambles !== \"undefined\") {\n    searchOutsideDebugGlobals.forceTwipsForScrambles = forceTwipsForScrambles;\n    void mapToAllWorkers((worker) =>\n      worker.setDebugMeasurePerf(forceTwipsForScrambles),\n    );\n  }\n  if (typeof scramblePrefetchLevel !== \"undefined\") {\n    searchOutsideDebugGlobals.scramblePrefetchLevel = scramblePrefetchLevel;\n    void mapToAllWorkers((worker) =>\n      worker.setScramblePrefetchLevel(scramblePrefetchLevel as PrefetchLevel),\n    );\n  }\n  for (const booleanField of [\n    \"forceNewWorkerForEveryScramble\",\n    \"showWorkerInstantiationWarnings\",\n    \"prioritizeEsbuildWorkaroundForWorkerInstantiation\",\n    \"allowDerivedScrambles\",\n  ] as const) {\n    if (booleanField in options) {\n      searchOutsideDebugGlobals[booleanField] =\n        options[booleanField] ?? searchOutsideDebugGlobals[booleanField];\n    }\n  }\n}\n"],
-  "mappings": ";;;;;;;;;;;;AAEO,SAAS,mCAA2C;AAKzD,SAAO,YAAY,QAAQ,0BAA0B;AACvD;AAEO,SAAS,qCAA0C;AAKxD,SAAO,IAAI,IAAI,4BAA4B,YAAY,GAAG;AAC5D;AAGA,eAAsB,mCAAoD;AACxE,YAAU,SAAS;AACnB,UAAQ,MAAM,OAAO,0BAA0B,GAAG;AACpD;;;ACZA,SAAS,QAAQ,QAAwC;AACvD,SAAO,KAAgB,MAAM;AAC/B;AAEA,eAAe,wBACb,oBACoB;AAEpB,SAAO,IAAI,QAAmB,OAAO,SAAS,WAAW;AACvD,QAAI;AACF,YAAM,SAAS,IAAI,eAAe,kBAAkB;AAGpD,YAAM,iBAAiB,CAAC,gBAAwB;AAC9C,YAAI,gBAAgB,mBAAmB;AAErC,kBAAQ,QAAQ,MAAM,CAAC;AAAA,QACzB,OAAO;AACL;AAAA,YACE,IAAI,MAAM,sCAAsC,WAAW,EAAE;AAAA,UAC/D;AAAA,QACF;AAAA,MACF;AAEA,YAAM,UAAU,CAAC,MAAkB;AACjC,eAAO,CAAC;AAAA,MACV;AAEA,UAAI,UAAU,QAAoC;AAEhD,eAAO,KAAK,WAAW,cAAc;AAAA,MACvC,OAAO;AACL,eAAO,iBAAiB,SAAS,SAAS;AAAA,UACxC,MAAM;AAAA,QACR,CAAC;AACD,eAAO;AAAA,UACL;AAAA,UACA,CAAC,MAAoB,eAAe,EAAE,IAAI;AAAA,UAC1C;AAAA,YACE,MAAM;AAAA,UACR;AAAA,QACF;AAAA,MACF;AAAA,IACF,SAAS,GAAG;AACV,aAAO,CAAC;AAAA,IACV;AAAA,EACF,CAAC;AACH;AAEO,IAAM,uBAA6C,CAAC;AAE3D,eAAsB,uBAA2C;AAC/D,QAAM,mBAAmB,gCAAgC;AACzD,uBAAqB,KAAK,gBAAgB;AAC1C,QAAM,YAAY,MAAM;AACxB,YAAU,oBAAoB,0BAA0B,OAAO;AAC/D,YAAU;AAAA,IACR,0BAA0B;AAAA,EAC5B;AACA,YAAU;AAAA,IACR,0BAA0B;AAAA,EAC5B;AACA,SAAO;AACT;AAQA,eAAe,kCAAsD;AACnE,MAAI,WAAW,UAAU,aAAa,SAAS;AAC7C,YAAQ;AAAA,MACN;AAAA,IACF;AAAA,EACF;AAEA,WAAS,OAAO,mBAA4B;AAC1C,WAAO,8BACL,oBAAoB,IAAI,iBAAiB,KAAK,EAChD;AAAA,EACF;AAEA,QAAM,4BAAkD;AAAA,IACtD,YAAY,wBAAwB,iCAAiC,CAAC;AAAA,IACtE;AAAA,IACA;AAAA,EACF;AACA,QAAM,4BAAkD;AAAA,IACtD,YACE,wBAAwB,MAAM,iCAAiC,CAAC;AAAA,IAClE;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,IAUA;AAAA,EACF;AACA,QAAM,iBAAuC;AAAA,IAC3C,YAAY,wBAAwB,mCAAmC,CAAC;AAAA,IACxE;AAAA,IACA;AAAA,EACF;AAEA,QAAM,gBACJ,0BAA0B,oDACtB,CAAC,2BAA2B,2BAA2B,cAAc,IACrE,CAAC,2BAA2B,2BAA2B,cAAc;AAE3E,aAAW,CAAC,IAAI,aAAa,aAAa,KAAK,eAAe;AAC5D,QAAI;AACF,YAAM,SAAS,MAAM,GAAG;AACxB,UAAI,eAAe;AACjB,YAAI,0BAA0B,iCAAiC;AAC7D,kBAAQ;AAAA,YACN,wCAAwC,WAAW,mBAAmB,aAAa;AAAA,UACrF;AAAA,QACF;AAAA,MACF;AACA,aAAO;AAAA,IACT,QAAQ;AAAA,IAIR;AAAA,EACF;AAEA,QAAM,IAAI,MAAM,GAAG,OAAO,CAAC,0CAA0C;AACvE;;;ACxIA,IAAI;AACJ,SAAS,0BAA8C;AACrD,SAAQ,yBAAyB,qBAAqB;AACxD;AAEA,eAAsB,gBACpB,GACe;AACf,QAAM,QAAQ;AAAA,IACZ,qBAAqB,IAAI,OAAO,WAAW;AACzC,QAAE,MAAM,MAAM;AAAA,IAChB,CAAC;AAAA,EACH;AACF;AAiCA,eAAsB,uBAAuB,SAA+B;AAC1E,QAAM,SAAS,0BAA0B,iCACrC,MAAM,qBAAqB,IAC3B,MAAM,wBAAwB;AAClC,QAAM,iBAAiB,MAAM,OAAO,6BAA6B,OAAO;AAExE,SAAO,IAAI,WAAW,cAAc;AACtC;AAEA,eAAsB,uBACpB,mBACA,yBACA,SACc;AACd,MAAI,CAAC,0BAA0B,uBAAuB;AACpD,UAAM,IAAI,MAAM,oCAAoC;AAAA,EACtD;AACA,QAAM,SAAS,0BAA0B,iCACrC,MAAM,qBAAqB,IAC3B,MAAM,wBAAwB;AAClC,QAAM,iBAAiB,MAAM,OAAO;AAAA,IAClC;AAAA,IACA;AAAA,IACA;AAAA,EACF;AACA,SAAO,IAAI,WAAW,cAAc;AACtC;AAEA,eAAsB,sCACpB,SACc;AACd,QAAM,MAAM,MAAM,wBAAwB;AAC1C,SAAO,IAAI,WAAW,MAAM,IAAI,iBAAiB,QAAQ,WAAW,CAAC;AACvE;AAEA,eAAsB,uBAAuB,SAAiC;AAC5E,QAAM,MAAM,MAAM,wBAAwB;AAC1C,SAAO,IAAI,WAAW,MAAM,IAAI,iBAAiB,QAAQ,WAAW,CAAC;AACvE;AAEA,eAAsB,WAAW,SAAiC;AAChE,QAAM,MAAM,MAAM,wBAAwB;AAC1C,SAAO,IAAI,WAAW,MAAM,IAAI,mBAAmB,QAAQ,WAAW,CAAC;AACzE;AAEA,eAAsB,cAAc,SAAiC;AACnE,QAAM,MAAM,MAAM,wBAAwB;AAC1C,SAAO,IAAI,WAAW,MAAM,IAAI,sBAAsB,QAAQ,WAAW,CAAC;AAC5E;AAEA,eAAsB,cAAc,SAAiC;AACnE,QAAM,MAAM,MAAM,wBAAwB;AAC1C,SAAO,IAAI,WAAW,MAAM,IAAI,sBAAsB,QAAQ,WAAW,CAAC;AAC5E;AASA,eAAsB,WACpB,SACA,SACA,SACc;AACd,QAAM,EAAE,eAAe,GAAG,aAAa,IAAI,WAAW,CAAC;AACvD,QAAM,aAA2B;AACjC,MAAI,eAAe;AACjB,eAAW,gBAAgB,cAAc;AAAA,EAC3C;AACA,QAAM,EAAE,GAAG,IAAI,IAAI,QAAQ;AAC3B,SAAO,IAAI;AAEX,QAAM,kBAAkB,MAAM,qBAAqB;AACnD,MAAI;AACF,WAAO,IAAI;AAAA;AAAA,MAET,MAAM,gBAAgB;AAAA,QACpB;AAAA,QACA,QAAQ;AAAA,QACR;AAAA,MACF;AAAA,IACF;AAAA,EACF,UAAE;AACA,YAAQ,IAAI,qDAAqD;AAAA,EAGnE;AACF;AAaO,IAAM,4BAAuD;AAAA,EAClE,SAAS;AAAA,EACT,uBAAuB;AAAA,EACvB,gCAAgC;AAAA,EAChC,wBAAwB;AAAA,EACxB,iCAAiC;AAAA,EACjC,mDAAmD;AAAA,EACnD,uBAAuB;AACzB;AAEO,SAAS,eACd,SACM;AACN,QAAM,EAAE,SAAS,wBAAwB,sBAAsB,IAAI;AACnE,MAAI,OAAO,YAAY,aAAa;AAClC,8BAA0B,UAAU;AACpC,SAAK,gBAAgB,CAAC,WAAW,OAAO,oBAAoB,OAAO,CAAC;AAAA,EACtE;AACA,MAAI,OAAO,2BAA2B,aAAa;AACjD,8BAA0B,yBAAyB;AACnD,SAAK;AAAA,MAAgB,CAAC,WACpB,OAAO,oBAAoB,sBAAsB;AAAA,IACnD;AAAA,EACF;AACA,MAAI,OAAO,0BAA0B,aAAa;AAChD,8BAA0B,wBAAwB;AAClD,SAAK;AAAA,MAAgB,CAAC,WACpB,OAAO,yBAAyB,qBAAsC;AAAA,IACxE;AAAA,EACF;AACA,aAAW,gBAAgB;AAAA,IACzB;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,EACF,GAAY;AACV,QAAI,gBAAgB,SAAS;AAC3B,gCAA0B,YAAY,IACpC,QAAQ,YAAY,KAAK,0BAA0B,YAAY;AAAA,IACnE;AAAA,EACF;AACF;",
-  "names": []
-}