cubing 0.22.0 → 0.24.0-pre2

package/dist/esm/chunk-X6JHXPDX.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../src/cubing/protocol/binary/orbit-indexing.ts", "../../src/cubing/kpuzzle/transformations.ts", "../../src/cubing/kpuzzle/kpuzzle.ts", "../../src/cubing/kpuzzle/canonicalize.ts", "../../src/cubing/kpuzzle/parser/parser-peggy.js", "../../src/cubing/kpuzzle/parser/parser-shim.ts", "../../src/cubing/kpuzzle/svg.ts", "../../src/cubing/kpuzzle/3x3x3/3x3x3.kpuzzle.json.ts", "../../src/cubing/kpuzzle/puzzle-orientation.ts", "../../src/cubing/protocol/binary/puzzle-orientation.ts", "../../src/cubing/protocol/binary/binary3x3x3.ts", "../../src/cubing/protocol/binary/hex.ts"],
-  "sourcesContent": ["export function identityPermutation(numElems: number): number[] {\n  const arr = new Array<number>(numElems);\n  for (let i = 0; i < numElems; i++) {\n    arr[i] = i;\n  }\n  return arr;\n}\n\n// Inclusive start, exclusive end (similar to `Array.prototype.slice`)\nexport function orientationsToMask(\n  radix: number,\n  orientations: number[],\n): number {\n  let val = 0;\n  for (const orientation of orientations) {\n    val *= radix;\n    val += orientation;\n  }\n  return val;\n}\n\n// Inclusive start, exclusive end (similar to `Array.prototype.slice`)\nexport function maskToOrientations(\n  radix: number,\n  numElems: number,\n  mask: number,\n): number[] {\n  const arr = [];\n  while (mask > 0) {\n    arr.push(mask % radix);\n    mask = Math.floor(mask / radix);\n  }\n  return new Array<number>(numElems - arr.length).fill(0).concat(arr.reverse());\n}\n\n// From https://www.jaapsch.net/puzzles/compindx.htm#perm\nexport function permutationToLex(permutation: number[]): number {\n  const n = permutation.length;\n  let lexicographicIdx = 0;\n  for (let i = 0; i < n - 1; i++) {\n    lexicographicIdx = lexicographicIdx * (n - i);\n    for (let j = i + 1; j < n; j++) {\n      if (permutation[i] > permutation[j]) {\n        lexicographicIdx += 1;\n      }\n    }\n  }\n  return lexicographicIdx;\n}\n\n// From https://www.jaapsch.net/puzzles/compindx.htm#perm\nexport function lexToPermutation(\n  numPieces: number,\n  lexicographicIdx: number,\n): number[] {\n  const permutation: number[] = new Array(numPieces);\n  permutation[numPieces - 1] = 0;\n  for (let i = numPieces - 2; i >= 0; i--) {\n    permutation[i] = lexicographicIdx % (numPieces - i);\n    lexicographicIdx = Math.floor(lexicographicIdx / (numPieces - i));\n    for (let j = i + 1; j < numPieces; j++) {\n      if (permutation[j] >= permutation[i]) {\n        permutation[j] = permutation[j] + 1;\n      }\n    }\n  }\n  return permutation;\n}\n", "import type {\n  KPuzzleDefinition,\n  OrbitTransformation,\n  Transformation,\n} from \"./definition_types\";\n\n// this is the last identity orbit transformation we saw or looked at.\nlet lasto: OrbitTransformation | null;\n\nfunction isIdentity(omod: number, o: OrbitTransformation): boolean {\n  if (o === lasto) {\n    return true;\n  }\n  const perm = o.permutation;\n  const n = perm.length;\n  for (let idx = 0; idx < n; idx++) {\n    if (perm[idx] !== idx) {\n      return false;\n    }\n  }\n  if (omod > 1) {\n    const ori = o.orientation;\n    for (let idx = 0; idx < n; idx++) {\n      if (ori[idx] !== 0) {\n        return false;\n      }\n    }\n  }\n  lasto = o;\n  return true;\n}\n\nexport function combineTransformations(\n  def: KPuzzleDefinition,\n  t1: Transformation,\n  t2: Transformation,\n): Transformation {\n  const newTrans: Transformation = {} as Transformation;\n  for (const orbitName in def.orbits) {\n    const oDef = def.orbits[orbitName];\n    const o1 = t1[orbitName];\n    const o2 = t2[orbitName];\n    if (isIdentity(oDef.orientations, o2)) {\n      // common case for big cubes\n      newTrans[orbitName] = o1;\n    } else if (isIdentity(oDef.orientations, o1)) {\n      newTrans[orbitName] = o2;\n    } else {\n      const newPerm = new Array(oDef.numPieces);\n      if (oDef.orientations === 1) {\n        for (let idx = 0; idx < oDef.numPieces; idx++) {\n          newPerm[idx] = o1.permutation[o2.permutation[idx]];\n        }\n        newTrans[orbitName] = {\n          permutation: newPerm,\n          orientation: o1.orientation,\n        };\n      } else {\n        const newOri = new Array(oDef.numPieces);\n        for (let idx = 0; idx < oDef.numPieces; idx++) {\n          newOri[idx] =\n            (o1.orientation[o2.permutation[idx]] + o2.orientation[idx]) %\n            oDef.orientations;\n          newPerm[idx] = o1.permutation[o2.permutation[idx]];\n        }\n        newTrans[orbitName] = { permutation: newPerm, orientation: newOri };\n      }\n    }\n  }\n  return newTrans;\n}\n\nexport function multiplyTransformations(\n  def: KPuzzleDefinition,\n  t: Transformation,\n  amount: number,\n): Transformation {\n  if (amount < 0) {\n    return multiplyTransformations(def, invertTransformation(def, t), -amount);\n  }\n  if (amount === 0) {\n    return identityTransformation(def);\n  }\n  if (amount === 1) {\n    return t;\n  }\n  let halfish = t;\n  if (amount !== 2) {\n    halfish = multiplyTransformations(def, t, Math.floor(amount / 2));\n  }\n  const twiceHalfish = combineTransformations(def, halfish, halfish);\n  if (amount % 2 === 0) {\n    return twiceHalfish;\n  } else {\n    return combineTransformations(def, t, twiceHalfish);\n  }\n}\nexport function identityTransformation(\n  definition: KPuzzleDefinition,\n): Transformation {\n  const transformation = {} as Transformation;\n  for (const orbitName in definition.orbits) {\n    const orbitDefinition = definition.orbits[orbitName];\n    if (!lasto || lasto.permutation.length !== orbitDefinition.numPieces) {\n      const newPermutation = new Array(orbitDefinition.numPieces);\n      const newOrientation = new Array(orbitDefinition.numPieces);\n      for (let i = 0; i < orbitDefinition.numPieces; i++) {\n        newPermutation[i] = i;\n        newOrientation[i] = 0;\n      }\n      const orbitTransformation = {\n        permutation: newPermutation,\n        orientation: newOrientation,\n      };\n      lasto = orbitTransformation;\n      // Object.freeze(newPermutation); // TODO\n      // Object.freeze(newOrientation); // TODO\n    }\n    transformation[orbitName] = lasto;\n\n    // Object.freeze(orbitDefinition); // TODO\n  }\n  // Object.freeze(transformation); // TODO\n  return transformation;\n}\n\nexport function invertTransformation(\n  def: KPuzzleDefinition,\n  t: Transformation,\n): Transformation {\n  const newTrans: Transformation = {} as Transformation;\n  for (const orbitName in def.orbits) {\n    const oDef = def.orbits[orbitName];\n    const o = t[orbitName];\n    if (isIdentity(oDef.orientations, o)) {\n      newTrans[orbitName] = o;\n    } else if (oDef.orientations === 1) {\n      const newPerm = new Array(oDef.numPieces);\n      for (let idx = 0; idx < oDef.numPieces; idx++) {\n        newPerm[o.permutation[idx]] = idx;\n      }\n      newTrans[orbitName] = {\n        permutation: newPerm,\n        orientation: o.orientation,\n      };\n    } else {\n      const newPerm = new Array(oDef.numPieces);\n      const newOri = new Array(oDef.numPieces);\n      for (let idx = 0; idx < oDef.numPieces; idx++) {\n        const fromIdx = o.permutation[idx];\n        newPerm[fromIdx] = idx;\n        newOri[fromIdx] =\n          (oDef.orientations - o.orientation[idx] + oDef.orientations) %\n          oDef.orientations;\n      }\n      newTrans[orbitName] = { permutation: newPerm, orientation: newOri };\n    }\n  }\n  return newTrans;\n}\n\nfunction gcd(a: number, b: number): number {\n  if (b) {\n    return gcd(b, a % b);\n  }\n  return a;\n}\n\n/* calculate the order of a particular transformation. */\nexport function transformationOrder(\n  def: KPuzzleDefinition,\n  t: Transformation,\n): number {\n  let r: number = 1;\n  for (const orbitName in def.orbits) {\n    const oDef = def.orbits[orbitName];\n    const o = t[orbitName];\n    const d = new Array(oDef.numPieces);\n    for (let idx = 0; idx < oDef.numPieces; idx++) {\n      if (!d[idx]) {\n        let w = idx;\n        let om = 0;\n        let pm = 0;\n        for (;;) {\n          d[w] = true;\n          om = om + o.orientation[w];\n          pm = pm + 1;\n          w = o.permutation[w];\n          if (w === idx) {\n            break;\n          }\n        }\n        if (om !== 0) {\n          pm = (pm * oDef.orientations) / gcd(oDef.orientations, om);\n        }\n        r = (r * pm) / gcd(r, pm);\n      }\n    }\n  }\n  return r;\n}\n\nexport function areOrbitTransformationsEquivalent(\n  def: KPuzzleDefinition,\n  orbitName: string,\n  t1: Transformation,\n  t2: Transformation,\n  options: {\n    ignoreOrientation?: boolean;\n    ignorePermutation?: boolean;\n  } = {},\n): boolean {\n  const oDef = def.orbits[orbitName];\n  const o1 = t1[orbitName];\n  const o2 = t2[orbitName];\n  for (let idx = 0; idx < oDef.numPieces; idx++) {\n    if (\n      !options?.ignoreOrientation &&\n      o1.orientation[idx] !== o2.orientation[idx]\n    ) {\n      return false;\n    }\n    if (\n      !options?.ignorePermutation &&\n      o1.permutation[idx] !== o2.permutation[idx]\n    ) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function areTransformationsEquivalent(\n  def: KPuzzleDefinition,\n  t1: Transformation,\n  t2: Transformation,\n): boolean {\n  for (const orbitName in def.orbits) {\n    if (!areOrbitTransformationsEquivalent(def, orbitName, t1, t2)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nexport function areStatesEquivalent(\n  def: KPuzzleDefinition,\n  t1: Transformation,\n  t2: Transformation,\n): boolean {\n  // Turn transformations into states.\n  // This accounts for indistinguishable pieces.\n  return areTransformationsEquivalent(\n    def,\n    combineTransformations(def, def.startPieces, t1),\n    combineTransformations(def, def.startPieces, t2),\n  );\n}\n", "import { Alg, Move } from \"../alg\";\nimport type { QuantumMove } from \"../alg/units/leaves/Move\";\nimport type { KPuzzleDefinition, Transformation } from \"./definition_types\";\nimport type { MoveNotation } from \"./move_notation\";\nimport {\n  combineTransformations,\n  identityTransformation,\n  multiplyTransformations,\n} from \"./transformations\";\n\n// TODO: Move other helpers into the definition.\nexport function transformationForQuantumMove(\n  def: KPuzzleDefinition,\n  quantumMove: QuantumMove,\n): Transformation {\n  const transformation = getNotationLayer(def).lookupMove(\n    new Move(quantumMove), // TODO\n  );\n  if (!transformation) {\n    throw new Error(\"Unknown move: \" + quantumMove.toString());\n  }\n  return transformation;\n}\n\n// TODO: Move other helpers into the definition.\nexport function transformationForMove(\n  def: KPuzzleDefinition,\n  move: Move,\n): Transformation {\n  const transformation = getNotationLayer(def).lookupMove(move);\n  if (!transformation) {\n    throw new Error(\"Unknown move: \" + move.toString());\n  }\n  return transformation;\n}\n\nexport function getNotationLayer(def: KPuzzleDefinition): MoveNotation {\n  if (!def.moveNotation) {\n    def.moveNotation = new KPuzzleMoveNotation(def);\n  }\n  return def.moveNotation;\n}\n\nclass KPuzzleMoveNotation implements MoveNotation {\n  private cache: { [key: string]: Transformation } = {};\n  constructor(public def: KPuzzleDefinition) {}\n\n  public lookupMove(move: Move): Transformation | undefined {\n    const key = move.toString();\n    let r: Transformation | undefined = this.cache[key];\n    if (r) {\n      return r;\n    }\n    const quantumKey = move.quantum.toString();\n    r = this.def.moves[quantumKey];\n    if (r) {\n      r = multiplyTransformations(this.def, r, move.amount);\n      this.cache[key] = r;\n    } else {\n      // Handle e.g. `y2` if `y2` is defined.\n      // Note: this doesn't handle multiples.\n      // TODO: Should this be defined in a special place in the KPuzzle def instead of mixed with normal moves?\n      r = this.def.moves[move.toString()];\n      if (r) {\n        this.cache[key] = r;\n      } else {\n        // Handle e.g. `y2'` if `y2` is defined.\n        // Note: this doesn't handle multiples.\n        // TODO: Should this be defined in a special place in the KPuzzle def instead of mixed with normal moves?\n        r = this.def.moves[move.invert().toString()];\n        if (r) {\n          r = multiplyTransformations(this.def, r, -1);\n          this.cache[key] = r;\n        }\n      }\n    }\n\n    return r;\n  }\n}\n\nexport class KPuzzle {\n  public state: Transformation;\n  constructor(public definition: KPuzzleDefinition) {\n    this.state = identityTransformation(definition);\n  }\n\n  public reset(): void {\n    this.state = identityTransformation(this.definition);\n  }\n\n  public serialize(): string {\n    let output = \"\";\n    for (const orbitName in this.definition.orbits) {\n      output += orbitName + \"\\n\";\n      output += this.state[orbitName].permutation.join(\" \") + \"\\n\";\n      output += this.state[orbitName].orientation.join(\" \") + \"\\n\";\n    }\n    output = output.slice(0, output.length - 1); // Trim last newline.\n    return output;\n  }\n\n  public applyMove(move: Move): void {\n    this.state = combineTransformations(\n      this.definition,\n      this.state,\n      transformationForMove(this.definition, move),\n    );\n  }\n\n  public applyAlg(alg: Alg): void {\n    // TODO: use indexer instead of full expansion.\n    for (const move of alg.experimentalLeafMoves()) {\n      this.applyMove(move);\n    }\n  }\n  // TODO: Implement\n  // parseState(): this {}\n\n  // TODO: Alg parsing\n\n  // TODO: Implement.\n  // invert(): this {}\n}\n", "/**\n *  This module manages canonical sequences.  You can merge sequences\n *  combining moves (fully respecting commuting moves), and you can\n *  generate canonical sequences efficiently.\n */\nimport type { Alg, Move } from \"../alg\";\nimport type { KPuzzleDefinition, Transformation } from \"./definition_types\";\nimport {\n  areTransformationsEquivalent,\n  combineTransformations,\n  identityTransformation,\n} from \"./transformations\";\n\nclass InternalMove {\n  constructor(public base: number, public twist: number) {}\n  public getTransformation(canon: Canonicalizer): Transformation {\n    return canon.transforms[this.base][this.twist];\n  }\n\n  public asString(canon: Canonicalizer): string {\n    const mod = canon.moveorder[this.base];\n    let tw = this.twist % mod;\n    while (tw + tw > mod) {\n      tw -= mod;\n    }\n    while (tw + tw <= -mod) {\n      tw += mod;\n    }\n    const nam = canon.movenames[this.base];\n    if (tw === 1) {\n      return nam;\n    } else if (tw === -1) {\n      return nam + \"'\";\n    } else if (tw > 0) {\n      return nam + tw;\n    } else if (tw < 0) {\n      return nam + -tw + \"'\";\n    } else {\n      throw new Error(\"Stringifying null move?\");\n    }\n  }\n}\n\n// represents puzzle move data and its commuting structure\nexport class Canonicalizer {\n  public commutes: boolean[][] = [];\n  public moveorder: number[] = [];\n  public movenames: string[] = [];\n  public transforms: Transformation[][] = [];\n  public moveindex: { [key: string]: number } = {};\n  public baseMoveCount: number;\n  constructor(public def: KPuzzleDefinition) {\n    const basemoves = def.moves;\n    const id = identityTransformation(def);\n    for (const mv1 in basemoves) {\n      this.moveindex[mv1] = this.movenames.length;\n      this.movenames.push(mv1);\n      this.transforms.push([id, basemoves[mv1]]);\n    }\n    this.baseMoveCount = this.movenames.length;\n    for (let i = 0; i < this.baseMoveCount; i++) {\n      this.commutes.push([]);\n      const t1 = this.transforms[i][1];\n      for (let j = 0; j < this.baseMoveCount; j++) {\n        const t2 = this.transforms[j][1];\n        const ab = combineTransformations(def, t1, t2);\n        const ba = combineTransformations(def, t2, t1);\n        this.commutes[i][j] = areTransformationsEquivalent(def, ab, ba);\n      }\n    }\n    for (let i = 0; i < this.baseMoveCount; i++) {\n      const t1 = this.transforms[i][1];\n      let ct = t1;\n      let order = 1;\n      for (let mult = 2; !areTransformationsEquivalent(def, id, ct); mult++) {\n        order++;\n        ct = combineTransformations(def, ct, t1);\n        this.transforms[i].push(ct);\n      }\n      this.moveorder[i] = order;\n    }\n  }\n\n  public blockMoveToInternalMove(move: Move): InternalMove {\n    const quantumMoveStr = move.quantum.toString();\n    if (!(quantumMoveStr in this.def.moves)) {\n      throw new Error(\"! move \" + quantumMoveStr + \" not in def.\");\n    }\n    const ind = this.moveindex[quantumMoveStr];\n    const mod = this.moveorder[ind];\n    let tw = move.amount % mod; // TODO\n    if (tw < 0) {\n      tw = (tw + mod) % mod;\n    }\n    return new InternalMove(ind, tw);\n  }\n\n  // Sequence must be simple sequence of block moves\n  // this one does not attempt to merge.\n  public sequenceToSearchSequence(\n    alg: Alg,\n    tr?: Transformation,\n  ): SearchSequence {\n    const ss = new SearchSequence(this, tr);\n    for (const move of alg.experimentalLeafMoves()) {\n      ss.appendOneMove(this.blockMoveToInternalMove(move));\n    }\n    return ss;\n  }\n\n  // Sequence to simple sequence, with merging.\n  public mergeSequenceToSearchSequence(\n    alg: Alg,\n    tr?: Transformation,\n  ): SearchSequence {\n    const ss = new SearchSequence(this, tr);\n    for (const move of alg.experimentalLeafMoves()) {\n      ss.mergeOneMove(this.blockMoveToInternalMove(move));\n    }\n    return ss;\n  }\n}\n\n// represents a single sequence we are working on\n// this can be a search sequence, or it can be a\n// \"cooked\" sequence that we want to use efficiently.\nexport class SearchSequence {\n  public moveseq: InternalMove[] = [];\n  public trans: Transformation;\n  constructor(private canon: Canonicalizer, tr?: Transformation) {\n    if (tr) {\n      this.trans = tr;\n    } else {\n      this.trans = identityTransformation(canon.def);\n    }\n  }\n\n  /*\n   *  A common use for search sequences is to extend them, but\n   *  sometimes we shouldn't modify the returned one.  This\n   *  method gives you a copy you can do whatever you want with.\n   */\n  public clone(): SearchSequence {\n    const r = new SearchSequence(this.canon, this.trans);\n    r.moveseq = [...this.moveseq];\n    return r;\n  }\n\n  // returns 1 if the move is added, 0 if it is merged, -1 if it cancels a move\n  public mergeOneMove(mv: InternalMove): number {\n    const r = this.onlyMergeOneMove(mv);\n    this.trans = combineTransformations(\n      this.canon.def,\n      this.trans,\n      mv.getTransformation(this.canon),\n    );\n    return r;\n  }\n\n  // does not do merge work; just slaps the new move on\n  public appendOneMove(mv: InternalMove): number {\n    this.moveseq.push(mv);\n    this.trans = combineTransformations(\n      this.canon.def,\n      this.trans,\n      mv.getTransformation(this.canon),\n    );\n    return 1;\n  }\n\n  // pop a move off.\n  public popMove(): number {\n    const mv = this.moveseq.pop();\n    if (!mv) {\n      throw new Error(\"Can't pop an empty sequence\");\n    }\n    this.trans = combineTransformations(\n      this.canon.def,\n      this.trans,\n      this.canon.transforms[mv.base][this.canon.moveorder[mv.base] - mv.twist],\n    );\n    return 1;\n  }\n\n  // do one more twist of the last move\n  public oneMoreTwist(): number {\n    const lastmv = this.moveseq[this.moveseq.length - 1];\n    this.trans = combineTransformations(\n      this.canon.def,\n      this.trans,\n      this.canon.transforms[lastmv.base][1],\n    );\n    this.moveseq[this.moveseq.length - 1] = new InternalMove(\n      lastmv.base,\n      lastmv.twist + 1,\n    );\n    return 0;\n  }\n\n  private onlyMergeOneMove(mv: InternalMove): number {\n    let j = this.moveseq.length - 1;\n    while (j >= 0) {\n      if (mv.base === this.moveseq[j].base) {\n        const mo = this.canon.moveorder[mv.base];\n        let twist = (mv.twist + this.moveseq[j].twist) % mo;\n        if (twist < 0) {\n          twist = (twist + mo) % mo;\n        }\n        if (twist === 0) {\n          // this splice should not be a performance problem because the\n          // typical number of following moves should be small\n          this.moveseq.splice(j, 1);\n          return -1;\n        } else {\n          this.moveseq[j] = new InternalMove(mv.base, twist);\n          return 0;\n        }\n      } else if (this.canon.commutes[mv.base][this.moveseq[j].base]) {\n        j--;\n      } else {\n        break;\n      }\n    }\n    this.moveseq.push(mv);\n    return 1;\n  }\n\n  // returns the length of the merged sequence.\n  public mergeSequence(seq: SearchSequence): number {\n    let r = this.moveseq.length;\n    for (let i = 0; i < seq.moveseq.length; i++) {\n      const mv = seq.moveseq[i];\n      const d = this.onlyMergeOneMove(mv);\n      r += d;\n    }\n    this.trans = combineTransformations(this.canon.def, this.trans, seq.trans);\n    return r;\n  }\n\n  public getSequenceAsString(): string {\n    const r: string[] = [];\n    for (const mv of this.moveseq) {\n      r.push(mv.asString(this.canon));\n    }\n    return r.join(\" \");\n  }\n}\n\n/*\n *   Iterate through canonical sequences by length.  This version\n *   uses generators.\n */\nexport class CanonicalSequenceIterator {\n  public ss: SearchSequence;\n  public targetLength: number;\n  constructor(public canon: Canonicalizer, state?: Transformation) {\n    this.ss = new SearchSequence(canon, state);\n    this.targetLength = 0;\n  }\n\n  public nextState(base: number, canonstate: number[]): null | number[] {\n    const newstate: number[] = [];\n    for (const prevbase of canonstate) {\n      if (prevbase === base) {\n        return null;\n      } else if (!this.canon.commutes[prevbase][base]) {\n        // don't do anything in this case\n      } else if (base < prevbase) {\n        return null;\n      } else {\n        newstate.push(prevbase);\n      }\n    }\n    return newstate;\n  }\n\n  public *genSequence(\n    togo: number,\n    canonstate: number[],\n  ): Generator<SearchSequence, null, void> {\n    if (togo === 0) {\n      yield this.ss;\n    } else {\n      for (let base = 0; base < this.canon.baseMoveCount; base++) {\n        const newstate = this.nextState(base, canonstate);\n        if (newstate) {\n          newstate.push(base);\n          for (let tw = 1; tw < this.canon.moveorder[base]; tw++) {\n            this.ss.appendOneMove(new InternalMove(base, tw));\n            yield* this.genSequence(togo - 1, newstate);\n            this.ss.popMove();\n          }\n        }\n      }\n    }\n    return null;\n  }\n\n  public *generator(): Generator<SearchSequence, SearchSequence, void> {\n    for (let d = 0; ; d++) {\n      yield* this.genSequence(d, []);\n    }\n  }\n\n  public *genSequenceTree(\n    canonstate: number[],\n  ): Generator<SearchSequence, null, number> {\n    const r = yield this.ss;\n    if (r > 0) {\n      return null;\n    }\n    for (let base = 0; base < this.canon.baseMoveCount; base++) {\n      const newstate = this.nextState(base, canonstate);\n      if (newstate) {\n        newstate.push(base);\n        for (let tw = 1; tw < this.canon.moveorder[base]; tw++) {\n          this.ss.appendOneMove(new InternalMove(base, tw));\n          yield* this.genSequenceTree(newstate);\n          this.ss.popMove();\n        }\n      }\n    }\n    return null;\n  }\n}\n", "// Generated by Peggy 1.1.0.\n//\n// https://peggyjs.org/\n\nfunction peg$subclass(child, parent) {\n  function C() {\n    this.constructor = child;\n  }\n  C.prototype = parent.prototype;\n  child.prototype = new C();\n}\n\nfunction peg$SyntaxError(message, expected, found, location) {\n  this.message = message;\n  this.expected = expected;\n  this.found = found;\n  this.location = location;\n  this.name = \"SyntaxError\";\n\n  if (typeof Error.captureStackTrace === \"function\") {\n    Error.captureStackTrace(this, peg$SyntaxError);\n  }\n}\n\npeg$subclass(peg$SyntaxError, Error);\n\npeg$SyntaxError.buildMessage = function (expected, found) {\n  var DESCRIBE_EXPECTATION_FNS = {\n    literal: function (expectation) {\n      return '\"' + literalEscape(expectation.text) + '\"';\n    },\n\n    class: function (expectation) {\n      var escapedParts = expectation.parts.map(function (part) {\n        return Array.isArray(part)\n          ? classEscape(part[0]) + \"-\" + classEscape(part[1])\n          : classEscape(part);\n      });\n\n      return \"[\" + (expectation.inverted ? \"^\" : \"\") + escapedParts + \"]\";\n    },\n\n    any: function () {\n      return \"any character\";\n    },\n\n    end: function () {\n      return \"end of input\";\n    },\n\n    other: function (expectation) {\n      return expectation.description;\n    },\n  };\n\n  function hex(ch) {\n    return ch.charCodeAt(0).toString(16).toUpperCase();\n  }\n\n  function literalEscape(s) {\n    return s\n      .replace(/\\\\/g, \"\\\\\\\\\")\n      .replace(/\"/g, '\\\\\"')\n      .replace(/\\0/g, \"\\\\0\")\n      .replace(/\\t/g, \"\\\\t\")\n      .replace(/\\n/g, \"\\\\n\")\n      .replace(/\\r/g, \"\\\\r\")\n      .replace(/[\\x00-\\x0F]/g, function (ch) {\n        return \"\\\\x0\" + hex(ch);\n      })\n      .replace(/[\\x10-\\x1F\\x7F-\\x9F]/g, function (ch) {\n        return \"\\\\x\" + hex(ch);\n      });\n  }\n\n  function classEscape(s) {\n    return s\n      .replace(/\\\\/g, \"\\\\\\\\\")\n      .replace(/\\]/g, \"\\\\]\")\n      .replace(/\\^/g, \"\\\\^\")\n      .replace(/-/g, \"\\\\-\")\n      .replace(/\\0/g, \"\\\\0\")\n      .replace(/\\t/g, \"\\\\t\")\n      .replace(/\\n/g, \"\\\\n\")\n      .replace(/\\r/g, \"\\\\r\")\n      .replace(/[\\x00-\\x0F]/g, function (ch) {\n        return \"\\\\x0\" + hex(ch);\n      })\n      .replace(/[\\x10-\\x1F\\x7F-\\x9F]/g, function (ch) {\n        return \"\\\\x\" + hex(ch);\n      });\n  }\n\n  function describeExpectation(expectation) {\n    return DESCRIBE_EXPECTATION_FNS[expectation.type](expectation);\n  }\n\n  function describeExpected(expected) {\n    var descriptions = expected.map(describeExpectation);\n    var i, j;\n\n    descriptions.sort();\n\n    if (descriptions.length > 0) {\n      for (i = 1, j = 1; i < descriptions.length; i++) {\n        if (descriptions[i - 1] !== descriptions[i]) {\n          descriptions[j] = descriptions[i];\n          j++;\n        }\n      }\n      descriptions.length = j;\n    }\n\n    switch (descriptions.length) {\n      case 1:\n        return descriptions[0];\n\n      case 2:\n        return descriptions[0] + \" or \" + descriptions[1];\n\n      default:\n        return (\n          descriptions.slice(0, -1).join(\", \") +\n          \", or \" +\n          descriptions[descriptions.length - 1]\n        );\n    }\n  }\n\n  function describeFound(found) {\n    return found ? '\"' + literalEscape(found) + '\"' : \"end of input\";\n  }\n\n  return (\n    \"Expected \" +\n    describeExpected(expected) +\n    \" but \" +\n    describeFound(found) +\n    \" found.\"\n  );\n};\n\nfunction peg$parse(input, options) {\n  options = options !== undefined ? options : {};\n\n  var peg$FAILED = {};\n\n  var peg$startRuleFunctions = { start: peg$parsestart };\n  var peg$startRuleFunction = peg$parsestart;\n\n  var peg$c0 = function (def) {\n    return fixMoves(def);\n  };\n  var peg$c1 = /^[A-Za-z0-9<>]/;\n  var peg$c2 = peg$classExpectation(\n    [[\"A\", \"Z\"], [\"a\", \"z\"], [\"0\", \"9\"], \"<\", \">\"],\n    false,\n    false,\n  );\n  var peg$c3 = function (characters) {\n    return characters.join(\"\");\n  };\n  var peg$c4 = /^[A-Za-z]/;\n  var peg$c5 = peg$classExpectation(\n    [\n      [\"A\", \"Z\"],\n      [\"a\", \"z\"],\n    ],\n    false,\n    false,\n  );\n  var peg$c6 = /^[A-Za-z0-9]/;\n  var peg$c7 = peg$classExpectation(\n    [\n      [\"A\", \"Z\"],\n      [\"a\", \"z\"],\n      [\"0\", \"9\"],\n    ],\n    false,\n    false,\n  );\n  var peg$c8 = function (first, rest) {\n    return [first].concat(rest).join(\"\");\n  };\n  var peg$c9 = /^[0-9]/;\n  var peg$c10 = peg$classExpectation([[\"0\", \"9\"]], false, false);\n  var peg$c11 = function (characters) {\n    return parseInt(characters.join(\"\"), 10);\n  };\n  var peg$c12 = \" \";\n  var peg$c13 = peg$literalExpectation(\" \", false);\n  var peg$c14 = \"Name\";\n  var peg$c15 = peg$literalExpectation(\"Name\", false);\n  var peg$c16 = function (identifier) {\n    return identifier;\n  };\n  var peg$c17 = \"Set\";\n  var peg$c18 = peg$literalExpectation(\"Set\", false);\n  var peg$c19 = function (set_identifier, num_pieces, num_orientations) {\n    return [\n      set_identifier,\n      { numPieces: num_pieces, orientations: num_orientations },\n    ];\n  };\n  var peg$c20 = function (orbit, orbits) {\n    orbits[orbit[0]] = orbit[1];\n    return orbits;\n  };\n  var peg$c21 = function (orbit) {\n    const orbits = {};\n    orbits[orbit[0]] = orbit[1];\n    return orbits;\n  };\n  var peg$c22 = \"\\n\";\n  var peg$c23 = peg$literalExpectation(\"\\n\", false);\n  var peg$c24 = function (num, nums) {\n    return [num].concat(nums);\n  };\n  var peg$c25 = function (num) {\n    return [num];\n  };\n  var peg$c26 = function (nums) {\n    return fixPermutation(nums);\n  };\n  var peg$c27 = function (set_identifier, permutation, nums) {\n    return [set_identifier, { permutation: permutation, orientation: nums }];\n  };\n  var peg$c28 = function (set_identifier, permutation) {\n    return [\n      set_identifier,\n      {\n        permutation: permutation,\n        orientation: new Array(permutation.length).fill(0),\n      },\n    ];\n  };\n  var peg$c29 = function (definition, definitions) {\n    definitions[definition[0]] = definition[1];\n    return definitions;\n  };\n  var peg$c30 = function (definition) {\n    const definitions = {};\n    definitions[definition[0]] = definition[1];\n    return definitions;\n  };\n  var peg$c31 = \"Solved\";\n  var peg$c32 = peg$literalExpectation(\"Solved\", false);\n  var peg$c33 = \"End\";\n  var peg$c34 = peg$literalExpectation(\"End\", false);\n  var peg$c35 = function (definitions) {\n    return definitions;\n  };\n  var peg$c36 = \"Move\";\n  var peg$c37 = peg$literalExpectation(\"Move\", false);\n  var peg$c38 = function (identifier, definitions) {\n    return [identifier, definitions];\n  };\n  var peg$c39 = function (move, moves) {\n    moves[move[0]] = move[1];\n    return moves;\n  };\n  var peg$c40 = function (move) {\n    const moves = {};\n    moves[move[0]] = move[1];\n    return moves;\n  };\n  var peg$c41 = function (name, orbits, start_pieces, moves) {\n    return {\n      name: name,\n      orbits: orbits,\n      moves: moves,\n      startPieces: start_pieces,\n    };\n  };\n\n  var peg$currPos = 0;\n  var peg$savedPos = 0;\n  var peg$posDetailsCache = [{ line: 1, column: 1 }];\n  var peg$maxFailPos = 0;\n  var peg$maxFailExpected = [];\n  var peg$silentFails = 0;\n\n  var peg$result;\n\n  if (\"startRule\" in options) {\n    if (!(options.startRule in peg$startRuleFunctions)) {\n      throw new Error(\n        \"Can't start parsing from rule \\\"\" + options.startRule + '\".',\n      );\n    }\n\n    peg$startRuleFunction = peg$startRuleFunctions[options.startRule];\n  }\n\n  function text() {\n    return input.substring(peg$savedPos, peg$currPos);\n  }\n\n  function location() {\n    return peg$computeLocation(peg$savedPos, peg$currPos);\n  }\n\n  function expected(description, location) {\n    location =\n      location !== undefined\n        ? location\n        : peg$computeLocation(peg$savedPos, peg$currPos);\n\n    throw peg$buildStructuredError(\n      [peg$otherExpectation(description)],\n      input.substring(peg$savedPos, peg$currPos),\n      location,\n    );\n  }\n\n  function error(message, location) {\n    location =\n      location !== undefined\n        ? location\n        : peg$computeLocation(peg$savedPos, peg$currPos);\n\n    throw peg$buildSimpleError(message, location);\n  }\n\n  function peg$literalExpectation(text, ignoreCase) {\n    return { type: \"literal\", text: text, ignoreCase: ignoreCase };\n  }\n\n  function peg$classExpectation(parts, inverted, ignoreCase) {\n    return {\n      type: \"class\",\n      parts: parts,\n      inverted: inverted,\n      ignoreCase: ignoreCase,\n    };\n  }\n\n  function peg$anyExpectation() {\n    return { type: \"any\" };\n  }\n\n  function peg$endExpectation() {\n    return { type: \"end\" };\n  }\n\n  function peg$otherExpectation(description) {\n    return { type: \"other\", description: description };\n  }\n\n  function peg$computePosDetails(pos) {\n    var details = peg$posDetailsCache[pos];\n    var p;\n\n    if (details) {\n      return details;\n    } else {\n      p = pos - 1;\n      while (!peg$posDetailsCache[p]) {\n        p--;\n      }\n\n      details = peg$posDetailsCache[p];\n      details = {\n        line: details.line,\n        column: details.column,\n      };\n\n      while (p < pos) {\n        if (input.charCodeAt(p) === 10) {\n          details.line++;\n          details.column = 1;\n        } else {\n          details.column++;\n        }\n\n        p++;\n      }\n\n      peg$posDetailsCache[pos] = details;\n\n      return details;\n    }\n  }\n\n  function peg$computeLocation(startPos, endPos) {\n    var startPosDetails = peg$computePosDetails(startPos);\n    var endPosDetails = peg$computePosDetails(endPos);\n\n    return {\n      start: {\n        offset: startPos,\n        line: startPosDetails.line,\n        column: startPosDetails.column,\n      },\n      end: {\n        offset: endPos,\n        line: endPosDetails.line,\n        column: endPosDetails.column,\n      },\n    };\n  }\n\n  function peg$fail(expected) {\n    if (peg$currPos < peg$maxFailPos) {\n      return;\n    }\n\n    if (peg$currPos > peg$maxFailPos) {\n      peg$maxFailPos = peg$currPos;\n      peg$maxFailExpected = [];\n    }\n\n    peg$maxFailExpected.push(expected);\n  }\n\n  function peg$buildSimpleError(message, location) {\n    return new peg$SyntaxError(message, null, null, location);\n  }\n\n  function peg$buildStructuredError(expected, found, location) {\n    return new peg$SyntaxError(\n      peg$SyntaxError.buildMessage(expected, found),\n      expected,\n      found,\n      location,\n    );\n  }\n\n  function peg$parsestart() {\n    var s0, s1;\n\n    s0 = peg$currPos;\n    s1 = peg$parseDEFINITION_FILE();\n    if (s1 !== peg$FAILED) {\n      peg$savedPos = s0;\n      s1 = peg$c0(s1);\n    }\n    s0 = s1;\n\n    return s0;\n  }\n\n  function peg$parseIDENTIFIER() {\n    var s0, s1, s2;\n\n    s0 = peg$currPos;\n    s1 = [];\n    if (peg$c1.test(input.charAt(peg$currPos))) {\n      s2 = input.charAt(peg$currPos);\n      peg$currPos++;\n    } else {\n      s2 = peg$FAILED;\n      if (peg$silentFails === 0) {\n        peg$fail(peg$c2);\n      }\n    }\n    if (s2 !== peg$FAILED) {\n      while (s2 !== peg$FAILED) {\n        s1.push(s2);\n        if (peg$c1.test(input.charAt(peg$currPos))) {\n          s2 = input.charAt(peg$currPos);\n          peg$currPos++;\n        } else {\n          s2 = peg$FAILED;\n          if (peg$silentFails === 0) {\n            peg$fail(peg$c2);\n          }\n        }\n      }\n    } else {\n      s1 = peg$FAILED;\n    }\n    if (s1 !== peg$FAILED) {\n      peg$savedPos = s0;\n      s1 = peg$c3(s1);\n    }\n    s0 = s1;\n\n    return s0;\n  }\n\n  function peg$parseSET_IDENTIFIER() {\n    var s0, s1, s2, s3;\n\n    s0 = peg$currPos;\n    if (peg$c4.test(input.charAt(peg$currPos))) {\n      s1 = input.charAt(peg$currPos);\n      peg$currPos++;\n    } else {\n      s1 = peg$FAILED;\n      if (peg$silentFails === 0) {\n        peg$fail(peg$c5);\n      }\n    }\n    if (s1 !== peg$FAILED) {\n      s2 = [];\n      if (peg$c6.test(input.charAt(peg$currPos))) {\n        s3 = input.charAt(peg$currPos);\n        peg$currPos++;\n      } else {\n        s3 = peg$FAILED;\n        if (peg$silentFails === 0) {\n          peg$fail(peg$c7);\n        }\n      }\n      while (s3 !== peg$FAILED) {\n        s2.push(s3);\n        if (peg$c6.test(input.charAt(peg$currPos))) {\n          s3 = input.charAt(peg$currPos);\n          peg$currPos++;\n        } else {\n          s3 = peg$FAILED;\n          if (peg$silentFails === 0) {\n            peg$fail(peg$c7);\n          }\n        }\n      }\n      if (s2 !== peg$FAILED) {\n        peg$savedPos = s0;\n        s1 = peg$c8(s1, s2);\n        s0 = s1;\n      } else {\n        peg$currPos = s0;\n        s0 = peg$FAILED;\n      }\n    } else {\n      peg$currPos = s0;\n      s0 = peg$FAILED;\n    }\n\n    return s0;\n  }\n\n  function peg$parseNUMBER() {\n    var s0, s1, s2;\n\n    s0 = peg$currPos;\n    s1 = [];\n    if (peg$c9.test(input.charAt(peg$currPos))) {\n      s2 = input.charAt(peg$currPos);\n      peg$currPos++;\n    } else {\n      s2 = peg$FAILED;\n      if (peg$silentFails === 0) {\n        peg$fail(peg$c10);\n      }\n    }\n    if (s2 !== peg$FAILED) {\n      while (s2 !== peg$FAILED) {\n        s1.push(s2);\n        if (peg$c9.test(input.charAt(peg$currPos))) {\n          s2 = input.charAt(peg$currPos);\n          peg$currPos++;\n        } else {\n          s2 = peg$FAILED;\n          if (peg$silentFails === 0) {\n            peg$fail(peg$c10);\n          }\n        }\n      }\n    } else {\n      s1 = peg$FAILED;\n    }\n    if (s1 !== peg$FAILED) {\n      peg$savedPos = s0;\n      s1 = peg$c11(s1);\n    }\n    s0 = s1;\n\n    return s0;\n  }\n\n  function peg$parseSPACE() {\n    var s0;\n\n    if (input.charCodeAt(peg$currPos) === 32) {\n      s0 = peg$c12;\n      peg$currPos++;\n    } else {\n      s0 = peg$FAILED;\n      if (peg$silentFails === 0) {\n        peg$fail(peg$c13);\n      }\n    }\n\n    return s0;\n  }\n\n  function peg$parseNAME() {\n    var s0, s1, s2, s3;\n\n    s0 = peg$currPos;\n    if (input.substr(peg$currPos, 4) === peg$c14) {\n      s1 = peg$c14;\n      peg$currPos += 4;\n    } else {\n      s1 = peg$FAILED;\n      if (peg$silentFails === 0) {\n        peg$fail(peg$c15);\n      }\n    }\n    if (s1 !== peg$FAILED) {\n      s2 = peg$parseSPACE();\n      if (s2 !== peg$FAILED) {\n        s3 = peg$parseIDENTIFIER();\n        if (s3 !== peg$FAILED) {\n          peg$savedPos = s0;\n          s1 = peg$c16(s3);\n          s0 = s1;\n        } else {\n          peg$currPos = s0;\n          s0 = peg$FAILED;\n        }\n      } else {\n        peg$currPos = s0;\n        s0 = peg$FAILED;\n      }\n    } else {\n      peg$currPos = s0;\n      s0 = peg$FAILED;\n    }\n\n    return s0;\n  }\n\n  function peg$parseORBIT() {\n    var s0, s1, s2, s3, s4, s5, s6, s7;\n\n    s0 = peg$currPos;\n    if (input.substr(peg$currPos, 3) === peg$c17) {\n      s1 = peg$c17;\n      peg$currPos += 3;\n    } else {\n      s1 = peg$FAILED;\n      if (peg$silentFails === 0) {\n        peg$fail(peg$c18);\n      }\n    }\n    if (s1 !== peg$FAILED) {\n      s2 = peg$parseSPACE();\n      if (s2 !== peg$FAILED) {\n        s3 = peg$parseSET_IDENTIFIER();\n        if (s3 !== peg$FAILED) {\n          s4 = peg$parseSPACE();\n          if (s4 !== peg$FAILED) {\n            s5 = peg$parseNUMBER();\n            if (s5 !== peg$FAILED) {\n              s6 = peg$parseSPACE();\n              if (s6 !== peg$FAILED) {\n                s7 = peg$parseNUMBER();\n                if (s7 !== peg$FAILED) {\n                  peg$savedPos = s0;\n                  s1 = peg$c19(s3, s5, s7);\n                  s0 = s1;\n                } else {\n                  peg$currPos = s0;\n                  s0 = peg$FAILED;\n                }\n              } else {\n                peg$currPos = s0;\n                s0 = peg$FAILED;\n              }\n            } else {\n              peg$currPos = s0;\n              s0 = peg$FAILED;\n            }\n          } else {\n            peg$currPos = s0;\n            s0 = peg$FAILED;\n          }\n        } else {\n          peg$currPos = s0;\n          s0 = peg$FAILED;\n        }\n      } else {\n        peg$currPos = s0;\n        s0 = peg$FAILED;\n      }\n    } else {\n      peg$currPos = s0;\n      s0 = peg$FAILED;\n    }\n\n    return s0;\n  }\n\n  function peg$parseORBITS() {\n    var s0, s1, s2, s3;\n\n    s0 = peg$currPos;\n    s1 = peg$parseORBIT();\n    if (s1 !== peg$FAILED) {\n      s2 = peg$parseNEWLINE();\n      if (s2 !== peg$FAILED) {\n        s3 = peg$parseORBITS();\n        if (s3 !== peg$FAILED) {\n          peg$savedPos = s0;\n          s1 = peg$c20(s1, s3);\n          s0 = s1;\n        } else {\n          peg$currPos = s0;\n          s0 = peg$FAILED;\n        }\n      } else {\n        peg$currPos = s0;\n        s0 = peg$FAILED;\n      }\n    } else {\n      peg$currPos = s0;\n      s0 = peg$FAILED;\n    }\n    if (s0 === peg$FAILED) {\n      s0 = peg$currPos;\n      s1 = peg$parseORBIT();\n      if (s1 !== peg$FAILED) {\n        peg$savedPos = s0;\n        s1 = peg$c21(s1);\n      }\n      s0 = s1;\n    }\n\n    return s0;\n  }\n\n  function peg$parseNEWLINE() {\n    var s0;\n\n    if (input.charCodeAt(peg$currPos) === 10) {\n      s0 = peg$c22;\n      peg$currPos++;\n    } else {\n      s0 = peg$FAILED;\n      if (peg$silentFails === 0) {\n        peg$fail(peg$c23);\n      }\n    }\n\n    return s0;\n  }\n\n  function peg$parseNEWLINES() {\n    var s0, s1;\n\n    s0 = [];\n    if (input.charCodeAt(peg$currPos) === 10) {\n      s1 = peg$c22;\n      peg$currPos++;\n    } else {\n      s1 = peg$FAILED;\n      if (peg$silentFails === 0) {\n        peg$fail(peg$c23);\n      }\n    }\n    if (s1 !== peg$FAILED) {\n      while (s1 !== peg$FAILED) {\n        s0.push(s1);\n        if (input.charCodeAt(peg$currPos) === 10) {\n          s1 = peg$c22;\n          peg$currPos++;\n        } else {\n          s1 = peg$FAILED;\n          if (peg$silentFails === 0) {\n            peg$fail(peg$c23);\n          }\n        }\n      }\n    } else {\n      s0 = peg$FAILED;\n    }\n\n    return s0;\n  }\n\n  function peg$parseOPTIONAL_NEWLINES() {\n    var s0, s1;\n\n    s0 = [];\n    if (input.charCodeAt(peg$currPos) === 10) {\n      s1 = peg$c22;\n      peg$currPos++;\n    } else {\n      s1 = peg$FAILED;\n      if (peg$silentFails === 0) {\n        peg$fail(peg$c23);\n      }\n    }\n    while (s1 !== peg$FAILED) {\n      s0.push(s1);\n      if (input.charCodeAt(peg$currPos) === 10) {\n        s1 = peg$c22;\n        peg$currPos++;\n      } else {\n        s1 = peg$FAILED;\n        if (peg$silentFails === 0) {\n          peg$fail(peg$c23);\n        }\n      }\n    }\n\n    return s0;\n  }\n\n  function peg$parseNUMBERS() {\n    var s0, s1, s2, s3;\n\n    s0 = peg$currPos;\n    s1 = peg$parseNUMBER();\n    if (s1 !== peg$FAILED) {\n      s2 = peg$parseSPACE();\n      if (s2 !== peg$FAILED) {\n        s3 = peg$parseNUMBERS();\n        if (s3 !== peg$FAILED) {\n          peg$savedPos = s0;\n          s1 = peg$c24(s1, s3);\n          s0 = s1;\n        } else {\n          peg$currPos = s0;\n          s0 = peg$FAILED;\n        }\n      } else {\n        peg$currPos = s0;\n        s0 = peg$FAILED;\n      }\n    } else {\n      peg$currPos = s0;\n      s0 = peg$FAILED;\n    }\n    if (s0 === peg$FAILED) {\n      s0 = peg$currPos;\n      s1 = peg$parseNUMBER();\n      if (s1 !== peg$FAILED) {\n        peg$savedPos = s0;\n        s1 = peg$c25(s1);\n      }\n      s0 = s1;\n    }\n\n    return s0;\n  }\n\n  function peg$parsePERMUTATION() {\n    var s0, s1;\n\n    s0 = peg$currPos;\n    s1 = peg$parseNUMBERS();\n    if (s1 !== peg$FAILED) {\n      peg$savedPos = s0;\n      s1 = peg$c26(s1);\n    }\n    s0 = s1;\n\n    return s0;\n  }\n\n  function peg$parseDEFINITION() {\n    var s0, s1, s2, s3, s4, s5;\n\n    s0 = peg$currPos;\n    s1 = peg$parseSET_IDENTIFIER();\n    if (s1 !== peg$FAILED) {\n      s2 = peg$parseNEWLINE();\n      if (s2 !== peg$FAILED) {\n        s3 = peg$parsePERMUTATION();\n        if (s3 !== peg$FAILED) {\n          s4 = peg$parseNEWLINE();\n          if (s4 !== peg$FAILED) {\n            s5 = peg$parseNUMBERS();\n            if (s5 !== peg$FAILED) {\n              peg$savedPos = s0;\n              s1 = peg$c27(s1, s3, s5);\n              s0 = s1;\n            } else {\n              peg$currPos = s0;\n              s0 = peg$FAILED;\n            }\n          } else {\n            peg$currPos = s0;\n            s0 = peg$FAILED;\n          }\n        } else {\n          peg$currPos = s0;\n          s0 = peg$FAILED;\n        }\n      } else {\n        peg$currPos = s0;\n        s0 = peg$FAILED;\n      }\n    } else {\n      peg$currPos = s0;\n      s0 = peg$FAILED;\n    }\n    if (s0 === peg$FAILED) {\n      s0 = peg$currPos;\n      s1 = peg$parseSET_IDENTIFIER();\n      if (s1 !== peg$FAILED) {\n        s2 = peg$parseNEWLINE();\n        if (s2 !== peg$FAILED) {\n          s3 = peg$parsePERMUTATION();\n          if (s3 !== peg$FAILED) {\n            peg$savedPos = s0;\n            s1 = peg$c28(s1, s3);\n            s0 = s1;\n          } else {\n            peg$currPos = s0;\n            s0 = peg$FAILED;\n          }\n        } else {\n          peg$currPos = s0;\n          s0 = peg$FAILED;\n        }\n      } else {\n        peg$currPos = s0;\n        s0 = peg$FAILED;\n      }\n    }\n\n    return s0;\n  }\n\n  function peg$parseDEFINITIONS() {\n    var s0, s1, s2, s3;\n\n    s0 = peg$currPos;\n    s1 = peg$parseDEFINITION();\n    if (s1 !== peg$FAILED) {\n      s2 = peg$parseNEWLINE();\n      if (s2 !== peg$FAILED) {\n        s3 = peg$parseDEFINITIONS();\n        if (s3 !== peg$FAILED) {\n          peg$savedPos = s0;\n          s1 = peg$c29(s1, s3);\n          s0 = s1;\n        } else {\n          peg$currPos = s0;\n          s0 = peg$FAILED;\n        }\n      } else {\n        peg$currPos = s0;\n        s0 = peg$FAILED;\n      }\n    } else {\n      peg$currPos = s0;\n      s0 = peg$FAILED;\n    }\n    if (s0 === peg$FAILED) {\n      s0 = peg$currPos;\n      s1 = peg$parseDEFINITION();\n      if (s1 !== peg$FAILED) {\n        peg$savedPos = s0;\n        s1 = peg$c30(s1);\n      }\n      s0 = s1;\n    }\n\n    return s0;\n  }\n\n  function peg$parseSTART_PIECES() {\n    var s0, s1, s2, s3, s4, s5;\n\n    s0 = peg$currPos;\n    if (input.substr(peg$currPos, 6) === peg$c31) {\n      s1 = peg$c31;\n      peg$currPos += 6;\n    } else {\n      s1 = peg$FAILED;\n      if (peg$silentFails === 0) {\n        peg$fail(peg$c32);\n      }\n    }\n    if (s1 !== peg$FAILED) {\n      s2 = peg$parseNEWLINE();\n      if (s2 !== peg$FAILED) {\n        s3 = peg$parseDEFINITIONS();\n        if (s3 !== peg$FAILED) {\n          s4 = peg$parseNEWLINE();\n          if (s4 !== peg$FAILED) {\n            if (input.substr(peg$currPos, 3) === peg$c33) {\n              s5 = peg$c33;\n              peg$currPos += 3;\n            } else {\n              s5 = peg$FAILED;\n              if (peg$silentFails === 0) {\n                peg$fail(peg$c34);\n              }\n            }\n            if (s5 !== peg$FAILED) {\n              peg$savedPos = s0;\n              s1 = peg$c35(s3);\n              s0 = s1;\n            } else {\n              peg$currPos = s0;\n              s0 = peg$FAILED;\n            }\n          } else {\n            peg$currPos = s0;\n            s0 = peg$FAILED;\n          }\n        } else {\n          peg$currPos = s0;\n          s0 = peg$FAILED;\n        }\n      } else {\n        peg$currPos = s0;\n        s0 = peg$FAILED;\n      }\n    } else {\n      peg$currPos = s0;\n      s0 = peg$FAILED;\n    }\n\n    return s0;\n  }\n\n  function peg$parseMOVE() {\n    var s0, s1, s2, s3, s4, s5, s6, s7;\n\n    s0 = peg$currPos;\n    if (input.substr(peg$currPos, 4) === peg$c36) {\n      s1 = peg$c36;\n      peg$currPos += 4;\n    } else {\n      s1 = peg$FAILED;\n      if (peg$silentFails === 0) {\n        peg$fail(peg$c37);\n      }\n    }\n    if (s1 !== peg$FAILED) {\n      s2 = peg$parseSPACE();\n      if (s2 !== peg$FAILED) {\n        s3 = peg$parseIDENTIFIER();\n        if (s3 !== peg$FAILED) {\n          s4 = peg$parseNEWLINE();\n          if (s4 !== peg$FAILED) {\n            s5 = peg$parseDEFINITIONS();\n            if (s5 !== peg$FAILED) {\n              s6 = peg$parseNEWLINE();\n              if (s6 !== peg$FAILED) {\n                if (input.substr(peg$currPos, 3) === peg$c33) {\n                  s7 = peg$c33;\n                  peg$currPos += 3;\n                } else {\n                  s7 = peg$FAILED;\n                  if (peg$silentFails === 0) {\n                    peg$fail(peg$c34);\n                  }\n                }\n                if (s7 !== peg$FAILED) {\n                  peg$savedPos = s0;\n                  s1 = peg$c38(s3, s5);\n                  s0 = s1;\n                } else {\n                  peg$currPos = s0;\n                  s0 = peg$FAILED;\n                }\n              } else {\n                peg$currPos = s0;\n                s0 = peg$FAILED;\n              }\n            } else {\n              peg$currPos = s0;\n              s0 = peg$FAILED;\n            }\n          } else {\n            peg$currPos = s0;\n            s0 = peg$FAILED;\n          }\n        } else {\n          peg$currPos = s0;\n          s0 = peg$FAILED;\n        }\n      } else {\n        peg$currPos = s0;\n        s0 = peg$FAILED;\n      }\n    } else {\n      peg$currPos = s0;\n      s0 = peg$FAILED;\n    }\n\n    return s0;\n  }\n\n  function peg$parseMOVES() {\n    var s0, s1, s2, s3;\n\n    s0 = peg$currPos;\n    s1 = peg$parseMOVE();\n    if (s1 !== peg$FAILED) {\n      s2 = peg$parseNEWLINES();\n      if (s2 !== peg$FAILED) {\n        s3 = peg$parseMOVES();\n        if (s3 !== peg$FAILED) {\n          peg$savedPos = s0;\n          s1 = peg$c39(s1, s3);\n          s0 = s1;\n        } else {\n          peg$currPos = s0;\n          s0 = peg$FAILED;\n        }\n      } else {\n        peg$currPos = s0;\n        s0 = peg$FAILED;\n      }\n    } else {\n      peg$currPos = s0;\n      s0 = peg$FAILED;\n    }\n    if (s0 === peg$FAILED) {\n      s0 = peg$currPos;\n      s1 = peg$parseMOVE();\n      if (s1 !== peg$FAILED) {\n        peg$savedPos = s0;\n        s1 = peg$c40(s1);\n      }\n      s0 = s1;\n    }\n\n    return s0;\n  }\n\n  function peg$parseDEFINITION_FILE() {\n    var s0, s1, s2, s3, s4, s5, s6, s7, s8;\n\n    s0 = peg$currPos;\n    s1 = peg$parseNAME();\n    if (s1 !== peg$FAILED) {\n      s2 = peg$parseNEWLINES();\n      if (s2 !== peg$FAILED) {\n        s3 = peg$parseORBITS();\n        if (s3 !== peg$FAILED) {\n          s4 = peg$parseNEWLINES();\n          if (s4 !== peg$FAILED) {\n            s5 = peg$parseSTART_PIECES();\n            if (s5 !== peg$FAILED) {\n              s6 = peg$parseNEWLINES();\n              if (s6 !== peg$FAILED) {\n                s7 = peg$parseMOVES();\n                if (s7 !== peg$FAILED) {\n                  s8 = peg$parseOPTIONAL_NEWLINES();\n                  if (s8 !== peg$FAILED) {\n                    peg$savedPos = s0;\n                    s1 = peg$c41(s1, s3, s5, s7);\n                    s0 = s1;\n                  } else {\n                    peg$currPos = s0;\n                    s0 = peg$FAILED;\n                  }\n                } else {\n                  peg$currPos = s0;\n                  s0 = peg$FAILED;\n                }\n              } else {\n                peg$currPos = s0;\n                s0 = peg$FAILED;\n              }\n            } else {\n              peg$currPos = s0;\n              s0 = peg$FAILED;\n            }\n          } else {\n            peg$currPos = s0;\n            s0 = peg$FAILED;\n          }\n        } else {\n          peg$currPos = s0;\n          s0 = peg$FAILED;\n        }\n      } else {\n        peg$currPos = s0;\n        s0 = peg$FAILED;\n      }\n    } else {\n      peg$currPos = s0;\n      s0 = peg$FAILED;\n    }\n\n    return s0;\n  }\n\n  function fixPermutation(permutation) {\n    return permutation.map((x) => x - 1);\n  }\n\n  function fixMoves(def) {\n    for (const moveName in def.moves) {\n      const move = def.moves[moveName];\n      for (const orbitName in def.orbits) {\n        const moveOrbit = move[orbitName];\n        const oldOrientation = moveOrbit.orientation;\n        const perm = moveOrbit.permutation;\n        const newOrientation = new Array(oldOrientation.length);\n        for (let i = 0; i < perm.length; i++) {\n          newOrientation[i] = oldOrientation[perm[i]];\n        }\n        moveOrbit.orientation = newOrientation;\n      }\n    }\n    return def;\n  }\n\n  peg$result = peg$startRuleFunction();\n\n  if (peg$result !== peg$FAILED && peg$currPos === input.length) {\n    return peg$result;\n  } else {\n    if (peg$result !== peg$FAILED && peg$currPos < input.length) {\n      peg$fail(peg$endExpectation());\n    }\n\n    throw peg$buildStructuredError(\n      peg$maxFailExpected,\n      peg$maxFailPos < input.length ? input.charAt(peg$maxFailPos) : null,\n      peg$maxFailPos < input.length\n        ? peg$computeLocation(peg$maxFailPos, peg$maxFailPos + 1)\n        : peg$computeLocation(peg$maxFailPos, peg$maxFailPos),\n    );\n  }\n}\n\nexport { peg$SyntaxError as SyntaxError, peg$parse as parse };\n", "// Note: this file exists so that `parse` doesn't show up for autocompletion (by\n// avoiding a `parser-pegjs.d.ts` file that exports `parse`.)\n\nimport type { KPuzzleDefinition } from \"../definition_types\";\n// eslint-disable-next-line @typescript-eslint/ban-ts-comment\n// @ts-ignore\nimport { parse } from \"./parser-peggy\";\n\nconst pegParseKPuzzleDefinition: (s: string) => KPuzzleDefinition = parse;\n\nexport { pegParseKPuzzleDefinition };\n", "import type {\n  FaceletMeshAppearance,\n  PuzzleAppearance,\n} from \"../puzzles/stickerings/appearance\"; // TODO\nimport type { KPuzzleDefinition, Transformation } from \"./definition_types\";\nimport type { KPuzzle } from \"./kpuzzle\";\n\nconst xmlns = \"http://www.w3.org/2000/svg\";\n\n// Unique ID mechanism to keep SVG gradient element IDs unique. TODO: Is there\n// something more performant, and that can't be broken by other elements of the\n// page? (And also doesn't break if this library is run in parallel.)\nlet svgCounter = 0;\nfunction nextSVGID(): string {\n  svgCounter += 1;\n  return \"svg\" + svgCounter.toString();\n}\n\n// TODO: This is hardcoded to 3x3x3 SVGs\nconst colorMaps: Partial<\n  Record<FaceletMeshAppearance, Record<string, string>>\n> = {\n  dim: {\n    \"white\": \"#dddddd\",\n    \"orange\": \"#884400\",\n    \"limegreen\": \"#008800\",\n    \"red\": \"#660000\",\n    \"rgb(34, 102, 255)\": \"#000088\", // TODO\n    \"yellow\": \"#888800\",\n  },\n  oriented: {\n    \"white\": \"#ff88ff\",\n    \"orange\": \"#ff88ff\",\n    \"limegreen\": \"#ff88ff\",\n    \"red\": \"#ff88ff\",\n    \"rgb(34, 102, 255)\": \"#ff88ff\", // TODO\n    \"yellow\": \"#ff88ff\",\n  },\n  ignored: {\n    \"white\": \"#444444\",\n    \"orange\": \"#444444\",\n    \"limegreen\": \"#444444\",\n    \"red\": \"#444444\",\n    \"rgb(34, 102, 255)\": \"#444444\", // TODO\n    \"yellow\": \"#444444\",\n  },\n  invisible: {\n    \"white\": \"#00000000\",\n    \"orange\": \"#00000000\",\n    \"limegreen\": \"#00000000\",\n    \"red\": \"#00000000\",\n    \"rgb(34, 102, 255)\": \"#00000000\", // TODO\n    \"yellow\": \"#00000000\",\n  },\n};\n\nexport class KPuzzleSVGWrapper {\n  public element: HTMLElement;\n  public gradientDefs: SVGDefsElement;\n  private originalColors: { [type: string]: string } = {};\n  private gradients: { [type: string]: SVGGradientElement } = {};\n  private svgID: string;\n  constructor(\n    public kPuzzleDefinition: KPuzzleDefinition,\n    svgSource: string,\n    experimentalAppearance?: PuzzleAppearance,\n  ) {\n    if (!svgSource) {\n      throw new Error(\n        `No SVG definition for puzzle type: ${kPuzzleDefinition.name}`,\n      );\n    }\n\n    this.svgID = nextSVGID();\n\n    this.element = document.createElement(\"div\");\n    this.element.classList.add(\"svg-wrapper\");\n    // TODO: Sanitization.\n    this.element.innerHTML = svgSource;\n\n    const svgElem = this.element.querySelector(\"svg\");\n    if (!svgElem) {\n      throw new Error(\"Could not get SVG element\");\n    }\n    if (xmlns !== svgElem.namespaceURI) {\n      throw new Error(\"Unexpected XML namespace\");\n    }\n    svgElem.style.maxWidth = \"100%\";\n    svgElem.style.maxHeight = \"100%\";\n    this.gradientDefs = document.createElementNS(xmlns, \"defs\");\n    svgElem.insertBefore(this.gradientDefs, svgElem.firstChild);\n\n    for (const orbitName in kPuzzleDefinition.orbits) {\n      const orbitDefinition = kPuzzleDefinition.orbits[orbitName];\n\n      for (let idx = 0; idx < orbitDefinition.numPieces; idx++) {\n        for (\n          let orientation = 0;\n          orientation < orbitDefinition.orientations;\n          orientation++\n        ) {\n          const id = this.elementID(orbitName, idx, orientation);\n          const elem = this.elementByID(id);\n          let originalColor: string = elem.style.fill;\n          /// TODO: Allow setting appearance dynamically.\n          if (experimentalAppearance) {\n            (() => {\n              // TODO: dedup with Cube3D,,factor out fallback calculations\n              const a = experimentalAppearance.orbits;\n              if (!a) {\n                return;\n              }\n              const orbitAppearance = a[orbitName];\n              if (!orbitAppearance) {\n                return;\n              }\n              const pieceAppearance = orbitAppearance.pieces[idx];\n              if (!pieceAppearance) {\n                return;\n              }\n              const faceletAppearance = pieceAppearance.facelets[orientation];\n              if (!faceletAppearance) {\n                return;\n              }\n              const appearance =\n                typeof faceletAppearance === \"string\"\n                  ? faceletAppearance\n                  : faceletAppearance?.appearance;\n              const colorMap = colorMaps[appearance];\n              if (colorMap) {\n                originalColor = colorMap[originalColor];\n              }\n            })();\n          } else {\n            originalColor = elem.style.fill;\n          }\n          this.originalColors[id] = originalColor;\n          this.gradients[id] = this.newGradient(id, originalColor);\n          this.gradientDefs.appendChild(this.gradients[id]);\n          elem.setAttribute(\"style\", `fill: url(#grad-${this.svgID}-${id})`);\n        }\n      }\n    }\n  }\n\n  public drawKPuzzle(\n    kpuzzle: KPuzzle,\n    nextState?: Transformation,\n    fraction?: number,\n  ): void {\n    this.draw(kpuzzle.definition, kpuzzle.state, nextState, fraction);\n  }\n\n  // TODO: save definition in the constructor?\n  public draw(\n    definition: KPuzzleDefinition,\n    state: Transformation,\n    nextState?: Transformation,\n    fraction?: number,\n  ): void {\n    for (const orbitName in definition.orbits) {\n      const orbitDefinition = definition.orbits[orbitName];\n\n      const curOrbitState = state[orbitName];\n      const nextOrbitState = nextState ? nextState[orbitName] : null;\n      for (let idx = 0; idx < orbitDefinition.numPieces; idx++) {\n        for (\n          let orientation = 0;\n          orientation < orbitDefinition.orientations;\n          orientation++\n        ) {\n          const id = this.elementID(orbitName, idx, orientation);\n          const fromCur = this.elementID(\n            orbitName,\n            curOrbitState.permutation[idx],\n            (orbitDefinition.orientations -\n              curOrbitState.orientation[idx] +\n              orientation) %\n              orbitDefinition.orientations,\n          );\n          let singleColor = false;\n          if (nextOrbitState) {\n            const fromNext = this.elementID(\n              orbitName,\n              nextOrbitState.permutation[idx],\n              (orbitDefinition.orientations -\n                nextOrbitState.orientation[idx] +\n                orientation) %\n                orbitDefinition.orientations,\n            );\n            if (fromCur === fromNext) {\n              singleColor = true; // TODO: Avoid redundant work during move.\n            }\n            fraction = fraction || 0; // TODO Use the type system to tie this to nextState?\n            const easedBackwardsPercent =\n              100 * (1 - fraction * fraction * (2 - fraction * fraction)); // TODO: Move easing up the stack.\n            this.gradients[id].children[0].setAttribute(\n              \"stop-color\",\n              this.originalColors[fromCur],\n            );\n            this.gradients[id].children[1].setAttribute(\n              \"stop-color\",\n              this.originalColors[fromCur],\n            );\n            this.gradients[id].children[1].setAttribute(\n              \"offset\",\n              `${Math.max(easedBackwardsPercent - 5, 0)}%`,\n            );\n            this.gradients[id].children[2].setAttribute(\n              \"offset\",\n              `${Math.max(easedBackwardsPercent - 5, 0)}%`,\n            );\n            this.gradients[id].children[3].setAttribute(\n              \"offset\",\n              `${easedBackwardsPercent}%`,\n            );\n            this.gradients[id].children[4].setAttribute(\n              \"offset\",\n              `${easedBackwardsPercent}%`,\n            );\n            this.gradients[id].children[4].setAttribute(\n              \"stop-color\",\n              this.originalColors[fromNext],\n            );\n            this.gradients[id].children[5].setAttribute(\n              \"stop-color\",\n              this.originalColors[fromNext],\n            );\n          } else {\n            singleColor = true; // TODO: Avoid redundant work during move.\n          }\n          if (singleColor) {\n            this.gradients[id].children[0].setAttribute(\n              \"stop-color\",\n              this.originalColors[fromCur],\n            );\n            this.gradients[id].children[1].setAttribute(\n              \"stop-color\",\n              this.originalColors[fromCur],\n            );\n            this.gradients[id].children[1].setAttribute(\"offset\", `100%`);\n            this.gradients[id].children[2].setAttribute(\"offset\", `100%`);\n            this.gradients[id].children[3].setAttribute(\"offset\", `100%`);\n            this.gradients[id].children[4].setAttribute(\"offset\", `100%`);\n          }\n          // this.gradients[id]\n          // this.elementByID(id).style.fill = this.originalColors[from];\n        }\n      }\n    }\n  }\n\n  private newGradient(id: string, originalColor: string): SVGGradientElement {\n    const grad = document.createElementNS(\n      xmlns,\n      \"radialGradient\",\n    ) as SVGGradientElement;\n    grad.setAttribute(\"id\", `grad-${this.svgID}-${id}`);\n    grad.setAttribute(\"r\", `70.7107%`); // TODO: Adapt to puzzle.\n    const stopDefs = [\n      { offset: 0, color: originalColor },\n      { offset: 0, color: originalColor },\n      { offset: 0, color: \"black\" },\n      { offset: 0, color: \"black\" },\n      { offset: 0, color: originalColor },\n      { offset: 100, color: originalColor },\n    ];\n    for (const stopDef of stopDefs) {\n      const stop = document.createElementNS(xmlns, \"stop\");\n      stop.setAttribute(\"offset\", `${stopDef.offset}%`);\n      stop.setAttribute(\"stop-color\", stopDef.color);\n      stop.setAttribute(\"stop-opacity\", \"1\");\n      grad.appendChild(stop);\n    }\n    return grad;\n  }\n\n  private elementID(\n    orbitName: string,\n    idx: number,\n    orientation: number,\n  ): string {\n    return orbitName + \"-l\" + idx + \"-o\" + orientation;\n  }\n\n  private elementByID(id: string): HTMLElement {\n    // TODO: Use classes and scope selector to SVG element.\n    return this.element.querySelector(\"#\" + id) as HTMLElement;\n  }\n}\n", "// TODO: This file is here to avoid dependency loops, but it should eventually\n// move back into `cubing/puzzles`. We currently have a few functions that are\n// hardcoded to require synchronous access to this definition, and we need to\n// find a better way to do that.\n\n// TODO: this would be a raw `.json` file, but Parcel runs into an error from\n\nimport type { KPuzzleDefinition } from \"..\";\n\n// using that as both a sync and async import. Probably https://github.com/parcel-bundler/parcel/issues/2546\nexport const cube3x3x3KPuzzle: KPuzzleDefinition = {\n  name: \"3x3x3\",\n  orbits: {\n    EDGES: { numPieces: 12, orientations: 2 },\n    CORNERS: { numPieces: 8, orientations: 3 },\n    CENTERS: { numPieces: 6, orientations: 4 },\n  },\n  startPieces: {\n    EDGES: {\n      permutation: [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11],\n      orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n    },\n    CORNERS: {\n      permutation: [0, 1, 2, 3, 4, 5, 6, 7],\n      orientation: [0, 0, 0, 0, 0, 0, 0, 0],\n    },\n    CENTERS: {\n      permutation: [0, 1, 2, 3, 4, 5],\n      orientation: [0, 0, 0, 0, 0, 0],\n    },\n  },\n  moves: {\n    U: {\n      EDGES: {\n        permutation: [1, 2, 3, 0, 4, 5, 6, 7, 8, 9, 10, 11],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      CORNERS: {\n        permutation: [1, 2, 3, 0, 4, 5, 6, 7],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      CENTERS: {\n        permutation: [0, 1, 2, 3, 4, 5],\n        orientation: [1, 0, 0, 0, 0, 0],\n      },\n    },\n    y: {\n      EDGES: {\n        permutation: [1, 2, 3, 0, 5, 6, 7, 4, 10, 8, 11, 9],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1],\n      },\n      CORNERS: {\n        permutation: [1, 2, 3, 0, 7, 4, 5, 6],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      CENTERS: {\n        permutation: [0, 2, 3, 4, 1, 5],\n        orientation: [1, 0, 0, 0, 0, 3],\n      },\n    },\n    x: {\n      EDGES: {\n        permutation: [4, 8, 0, 9, 6, 10, 2, 11, 5, 7, 1, 3],\n        orientation: [1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0],\n      },\n      CORNERS: {\n        permutation: [4, 0, 3, 5, 7, 6, 2, 1],\n        orientation: [2, 1, 2, 1, 1, 2, 1, 2],\n      },\n      CENTERS: {\n        permutation: [2, 1, 5, 3, 0, 4],\n        orientation: [0, 3, 0, 1, 2, 2],\n      },\n    },\n    L: {\n      EDGES: {\n        permutation: [0, 1, 2, 11, 4, 5, 6, 9, 8, 3, 10, 7],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      CORNERS: {\n        permutation: [0, 1, 6, 2, 4, 3, 5, 7],\n        orientation: [0, 0, 2, 1, 0, 2, 1, 0],\n      },\n      CENTERS: {\n        permutation: [0, 1, 2, 3, 4, 5],\n        orientation: [0, 1, 0, 0, 0, 0],\n      },\n    },\n    F: {\n      EDGES: {\n        permutation: [9, 1, 2, 3, 8, 5, 6, 7, 0, 4, 10, 11],\n        orientation: [1, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0],\n      },\n      CORNERS: {\n        permutation: [3, 1, 2, 5, 0, 4, 6, 7],\n        orientation: [1, 0, 0, 2, 2, 1, 0, 0],\n      },\n      CENTERS: {\n        permutation: [0, 1, 2, 3, 4, 5],\n        orientation: [0, 0, 1, 0, 0, 0],\n      },\n    },\n    R: {\n      EDGES: {\n        permutation: [0, 8, 2, 3, 4, 10, 6, 7, 5, 9, 1, 11],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      CORNERS: {\n        permutation: [4, 0, 2, 3, 7, 5, 6, 1],\n        orientation: [2, 1, 0, 0, 1, 0, 0, 2],\n      },\n      CENTERS: {\n        permutation: [0, 1, 2, 3, 4, 5],\n        orientation: [0, 0, 0, 1, 0, 0],\n      },\n    },\n    B: {\n      EDGES: {\n        permutation: [0, 1, 10, 3, 4, 5, 11, 7, 8, 9, 6, 2],\n        orientation: [0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 1, 1],\n      },\n      CORNERS: {\n        permutation: [0, 7, 1, 3, 4, 5, 2, 6],\n        orientation: [0, 2, 1, 0, 0, 0, 2, 1],\n      },\n      CENTERS: {\n        permutation: [0, 1, 2, 3, 4, 5],\n        orientation: [0, 0, 0, 0, 1, 0],\n      },\n    },\n    D: {\n      EDGES: {\n        permutation: [0, 1, 2, 3, 7, 4, 5, 6, 8, 9, 10, 11],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      CORNERS: {\n        permutation: [0, 1, 2, 3, 5, 6, 7, 4],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      CENTERS: {\n        permutation: [0, 1, 2, 3, 4, 5],\n        orientation: [0, 0, 0, 0, 0, 1],\n      },\n    },\n    z: {\n      EDGES: {\n        permutation: [9, 3, 11, 7, 8, 1, 10, 5, 0, 4, 2, 6],\n        orientation: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],\n      },\n      CORNERS: {\n        permutation: [3, 2, 6, 5, 0, 4, 7, 1],\n        orientation: [1, 2, 1, 2, 2, 1, 2, 1],\n      },\n      CENTERS: {\n        permutation: [1, 5, 2, 0, 4, 3],\n        orientation: [1, 1, 1, 1, 3, 1],\n      },\n    },\n    M: {\n      EDGES: {\n        permutation: [2, 1, 6, 3, 0, 5, 4, 7, 8, 9, 10, 11],\n        orientation: [1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0],\n      },\n      CORNERS: {\n        permutation: [0, 1, 2, 3, 4, 5, 6, 7],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      CENTERS: {\n        permutation: [4, 1, 0, 3, 5, 2],\n        orientation: [2, 0, 0, 0, 2, 0],\n      },\n    },\n    E: {\n      EDGES: {\n        permutation: [0, 1, 2, 3, 4, 5, 6, 7, 9, 11, 8, 10],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1],\n      },\n      CORNERS: {\n        permutation: [0, 1, 2, 3, 4, 5, 6, 7],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      CENTERS: {\n        permutation: [0, 4, 1, 2, 3, 5],\n        orientation: [0, 0, 0, 0, 0, 0],\n      },\n    },\n    S: {\n      EDGES: {\n        permutation: [0, 3, 2, 7, 4, 1, 6, 5, 8, 9, 10, 11],\n        orientation: [0, 1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0],\n      },\n      CORNERS: {\n        permutation: [0, 1, 2, 3, 4, 5, 6, 7],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      CENTERS: {\n        permutation: [1, 5, 2, 0, 4, 3],\n        orientation: [1, 1, 0, 1, 0, 1],\n      },\n    },\n    u: {\n      EDGES: {\n        permutation: [1, 2, 3, 0, 4, 5, 6, 7, 10, 8, 11, 9],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1],\n      },\n      CORNERS: {\n        permutation: [1, 2, 3, 0, 4, 5, 6, 7],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      CENTERS: {\n        permutation: [0, 2, 3, 4, 1, 5],\n        orientation: [1, 0, 0, 0, 0, 0],\n      },\n    },\n    l: {\n      EDGES: {\n        permutation: [2, 1, 6, 11, 0, 5, 4, 9, 8, 3, 10, 7],\n        orientation: [1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0],\n      },\n      CORNERS: {\n        permutation: [0, 1, 6, 2, 4, 3, 5, 7],\n        orientation: [0, 0, 2, 1, 0, 2, 1, 0],\n      },\n      CENTERS: {\n        permutation: [4, 1, 0, 3, 5, 2],\n        orientation: [2, 1, 0, 0, 2, 0],\n      },\n    },\n    f: {\n      EDGES: {\n        permutation: [9, 3, 2, 7, 8, 1, 6, 5, 0, 4, 10, 11],\n        orientation: [1, 1, 0, 1, 1, 1, 0, 1, 1, 1, 0, 0],\n      },\n      CORNERS: {\n        permutation: [3, 1, 2, 5, 0, 4, 6, 7],\n        orientation: [1, 0, 0, 2, 2, 1, 0, 0],\n      },\n      CENTERS: {\n        permutation: [1, 5, 2, 0, 4, 3],\n        orientation: [1, 1, 1, 1, 0, 1],\n      },\n    },\n    r: {\n      EDGES: {\n        permutation: [4, 8, 0, 3, 6, 10, 2, 7, 5, 9, 1, 11],\n        orientation: [1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0],\n      },\n      CORNERS: {\n        permutation: [4, 0, 2, 3, 7, 5, 6, 1],\n        orientation: [2, 1, 0, 0, 1, 0, 0, 2],\n      },\n      CENTERS: {\n        permutation: [2, 1, 5, 3, 0, 4],\n        orientation: [0, 0, 0, 1, 2, 2],\n      },\n    },\n    b: {\n      EDGES: {\n        permutation: [0, 5, 10, 1, 4, 7, 11, 3, 8, 9, 6, 2],\n        orientation: [0, 1, 1, 1, 0, 1, 1, 1, 0, 0, 1, 1],\n      },\n      CORNERS: {\n        permutation: [0, 7, 1, 3, 4, 5, 2, 6],\n        orientation: [0, 2, 1, 0, 0, 0, 2, 1],\n      },\n      CENTERS: {\n        permutation: [3, 0, 2, 5, 4, 1],\n        orientation: [3, 3, 0, 3, 1, 3],\n      },\n    },\n    d: {\n      EDGES: {\n        permutation: [0, 1, 2, 3, 7, 4, 5, 6, 9, 11, 8, 10],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1],\n      },\n      CORNERS: {\n        permutation: [0, 1, 2, 3, 5, 6, 7, 4],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      CENTERS: {\n        permutation: [0, 4, 1, 2, 3, 5],\n        orientation: [0, 0, 0, 0, 0, 1],\n      },\n    },\n  },\n};\n\ncube3x3x3KPuzzle.moves[\"Uw\"] = cube3x3x3KPuzzle.moves[\"u\"];\ncube3x3x3KPuzzle.moves[\"Lw\"] = cube3x3x3KPuzzle.moves[\"l\"];\ncube3x3x3KPuzzle.moves[\"Fw\"] = cube3x3x3KPuzzle.moves[\"f\"];\ncube3x3x3KPuzzle.moves[\"Rw\"] = cube3x3x3KPuzzle.moves[\"r\"];\ncube3x3x3KPuzzle.moves[\"Bw\"] = cube3x3x3KPuzzle.moves[\"b\"];\ncube3x3x3KPuzzle.moves[\"Dw\"] = cube3x3x3KPuzzle.moves[\"d\"];\n\ncube3x3x3KPuzzle.moves[\"Rv\"] = cube3x3x3KPuzzle.moves[\"x\"];\ncube3x3x3KPuzzle.moves[\"Uv\"] = cube3x3x3KPuzzle.moves[\"y\"];\ncube3x3x3KPuzzle.moves[\"Fv\"] = cube3x3x3KPuzzle.moves[\"z\"];\ncube3x3x3KPuzzle.moves[\"Lv\"] = {\n  EDGES: {\n    permutation: [2, 10, 6, 11, 0, 8, 4, 9, 1, 3, 5, 7],\n    orientation: [1, 0, 1, 0, 1, 0, 1, 0, 0, 0, 0, 0],\n  },\n  CORNERS: {\n    permutation: [1, 7, 6, 2, 0, 3, 5, 4],\n    orientation: [2, 1, 2, 1, 1, 2, 1, 2],\n  },\n  CENTERS: {\n    permutation: [4, 1, 0, 3, 5, 2],\n    orientation: [2, 1, 0, 3, 2, 0],\n  },\n};\ncube3x3x3KPuzzle.moves[\"Dv\"] = {\n  EDGES: {\n    permutation: [3, 0, 1, 2, 7, 4, 5, 6, 9, 11, 8, 10],\n    orientation: [0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 1, 1],\n  },\n  CORNERS: {\n    permutation: [3, 0, 1, 2, 5, 6, 7, 4],\n    orientation: [0, 0, 0, 0, 0, 0, 0, 0],\n  },\n  CENTERS: {\n    permutation: [0, 4, 1, 2, 3, 5],\n    orientation: [3, 0, 0, 0, 0, 1],\n  },\n};\ncube3x3x3KPuzzle.moves[\"Bv\"] = {\n  EDGES: {\n    permutation: [8, 5, 10, 1, 9, 7, 11, 3, 4, 0, 6, 2],\n    orientation: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1],\n  },\n  CORNERS: {\n    permutation: [4, 7, 1, 0, 5, 3, 2, 6],\n    orientation: [1, 2, 1, 2, 2, 1, 2, 1],\n  },\n  CENTERS: {\n    permutation: [3, 0, 2, 5, 4, 1],\n    orientation: [3, 3, 3, 3, 1, 3],\n  },\n};\n", "import { experimentalNormalizePuzzleOrientation as normalize3x3x3Orientation } from \"../protocol\";\nimport type { Transformation } from \"./definition_types\";\nimport { cube3x3x3KPuzzle as def } from \"./3x3x3/3x3x3.kpuzzle.json\";\nimport {\n  areOrbitTransformationsEquivalent,\n  areTransformationsEquivalent,\n} from \"./transformations\";\n\n// The `options` argument is required for now, because we haven't yet come up\n// with a general way to specify different kinds of solved for the same puzle.\nexport function experimentalIs3x3x3Solved(\n  transformation: Transformation,\n  options: { ignoreCenterOrientation: boolean },\n): boolean {\n  const normalized = normalize3x3x3Orientation(transformation);\n  if (options.ignoreCenterOrientation) {\n    return (\n      areOrbitTransformationsEquivalent(\n        def,\n        \"EDGES\",\n        normalized,\n        def.startPieces,\n      ) &&\n      areOrbitTransformationsEquivalent(\n        def,\n        \"CORNERS\",\n        normalized,\n        def.startPieces,\n      )\n    );\n  } else {\n    return areTransformationsEquivalent(def, normalized, def.startPieces);\n  }\n}\n", "import { Alg } from \"../../alg\";\nimport {\n  combineTransformations,\n  invertTransformation,\n  KPuzzle,\n  Transformation,\n} from \"../../kpuzzle\";\n// TODO: Should we expose this directly in the `puzzles` package for sync uses?\nimport { experimentalCube3x3x3KPuzzle as def } from \"../../kpuzzle\";\n\nexport function puzzleOrientationIdx(state: Transformation): [number, number] {\n  const idxU = state[\"CENTERS\"].permutation[0];\n  const idxD = state[\"CENTERS\"].permutation[5];\n  const unadjustedIdxL = state[\"CENTERS\"].permutation[1];\n  let idxL = unadjustedIdxL;\n  if (idxU < unadjustedIdxL) {\n    idxL--;\n  }\n  if (idxD < unadjustedIdxL) {\n    idxL--;\n  }\n  return [idxU, idxL];\n}\n\nconst puzzleOrientationCache: Transformation[][] = new Array(6)\n  .fill(0)\n  .map(() => {\n    return new Array<Transformation>(6);\n  });\n\n// We use a new block to avoid keeping a reference to temporary vars.\n{\n  const orientationKpuzzle = new KPuzzle(def);\n  const uAlgs: Alg[] = [\"\", \"z\", \"x\", \"z'\", \"x'\", \"x2\"].map((s) =>\n    Alg.fromString(s),\n  );\n  const yAlg = new Alg(\"y\");\n  for (const uAlg of uAlgs) {\n    orientationKpuzzle.reset();\n    orientationKpuzzle.applyAlg(uAlg);\n    for (let i = 0; i < 4; i++) {\n      orientationKpuzzle.applyAlg(yAlg);\n      const [idxU, idxL] = puzzleOrientationIdx(orientationKpuzzle.state);\n      puzzleOrientationCache[idxU][idxL] = invertTransformation(\n        def,\n        orientationKpuzzle.state,\n      );\n    }\n  }\n}\n\nexport function normalizePuzzleOrientation(s: Transformation): Transformation {\n  const [idxU, idxL] = puzzleOrientationIdx(s);\n  const orientationTransformation = puzzleOrientationCache[idxU][idxL];\n  return combineTransformations(def, s, orientationTransformation);\n}\n\n// TODO: combine with `orientPuzzle`?\nexport function reorientPuzzle(\n  s: Transformation,\n  idxU: number,\n  idxL: number,\n): Transformation {\n  const orientationTransformation = invertTransformation(\n    def,\n    puzzleOrientationCache[idxU][idxL],\n  );\n  return combineTransformations(def, s, orientationTransformation);\n}\n", "import type { Transformation } from \"../../kpuzzle\";\nimport {\n  identityPermutation,\n  lexToPermutation,\n  maskToOrientations,\n  orientationsToMask,\n  permutationToLex,\n} from \"./orbit-indexing\";\nimport {\n  normalizePuzzleOrientation,\n  puzzleOrientationIdx,\n  reorientPuzzle,\n} from \"./puzzle-orientation\";\n\ntype Binary3x3x3State = ArrayBuffer;\n\n// Bit lengths of the encoded components, in order.\nconst BIT_LENGTHS = [29, 12, 16, 13, 3, 2, 1, 12];\n\n// These fields are sorted by the order in which they appear in the binary format.\nexport interface Binary3x3x3Components {\n  epLex: number; // 29 bits, edge permutation\n  eoMask: number; // 12 bits, edge orientation\n  cpLex: number; // 16 bits, corner permutation\n  coMask: number; // 13 bits, corner orientation\n  poIdxU: number; // 3 bits, puzzle orientation (U face)\n  poIdxL: number; // 2 bits, puzzle orientation (L face)\n  moSupport: number; // 1 bit, center orientation support\n  moMask: number; // 12 bits, center orientation\n}\n\n// There are various clever ways to do this, but this is simple and efficient.\nfunction arraySum(arr: number[]): number {\n  let total = 0;\n  for (const entry of arr) {\n    total += entry;\n  }\n  return total;\n}\n\n// Due to limitations in JS bit operations, this is unsafe if any of the bit lengths span across the contents of more than 4 bytes.\n// - Safe: [8, 32]\n// - Unsafe: [4, 32, 4]\n// - Unsafe: [40, 4]\nfunction splitBinary(bitLengths: number[], buffy: ArrayBuffer): number[] {\n  const u8buffy = new Uint8Array(buffy);\n  let at = 0;\n  let bits = 0;\n  let accum = 0;\n  const values: number[] = [];\n  for (const bitLength of bitLengths) {\n    while (bits < bitLength) {\n      accum = (accum << 8) | u8buffy[at++];\n      bits += 8;\n    }\n    values.push((accum >> (bits - bitLength)) & ((1 << bitLength) - 1));\n    bits -= bitLength;\n  }\n  return values;\n}\n\n// See above for safety notes.\nfunction concatBinary(bitLengths: number[], values: number[]): ArrayBuffer {\n  const buffy = new Uint8Array(Math.ceil(arraySum(bitLengths) / 8));\n  let at = 0;\n  let bits = 0;\n  let accum = 0;\n  for (let i = 0; i < bitLengths.length; i++) {\n    accum = (accum << bitLengths[i]) | values[i];\n    bits += bitLengths[i];\n    while (bits >= 8) {\n      buffy[at++] = accum >> (bits - 8);\n      bits -= 8;\n    }\n  }\n  if (bits > 0) {\n    buffy[at++] = accum << (8 - bits);\n  }\n  return buffy;\n}\n\n// 0x111 (for idxU) means \"not supported\"\nfunction supportsPuzzleOrientation(components: Binary3x3x3Components): boolean {\n  return components.poIdxU !== 7;\n}\n\nexport function reid3x3x3ToBinaryComponents(\n  state: Transformation,\n): Binary3x3x3Components {\n  const normedState = normalizePuzzleOrientation(state);\n\n  const epLex = permutationToLex(normedState[\"EDGES\"].permutation);\n  const eoMask = orientationsToMask(2, normedState[\"EDGES\"].orientation);\n  const cpLex = permutationToLex(normedState[\"CORNERS\"].permutation);\n  const coMask = orientationsToMask(3, normedState[\"CORNERS\"].orientation);\n  const [poIdxU, poIdxL] = puzzleOrientationIdx(state);\n  const moSupport = 1; // Required for now.\n  const moMask = orientationsToMask(4, normedState[\"CENTERS\"].orientation);\n\n  return {\n    epLex,\n    eoMask,\n    cpLex,\n    coMask,\n    poIdxU,\n    poIdxL,\n    moSupport,\n    moMask,\n  };\n}\n\nexport function binaryComponentsToTwizzleBinary(\n  components: Binary3x3x3Components,\n): Binary3x3x3State {\n  const { epLex, eoMask, cpLex, coMask, poIdxU, poIdxL, moSupport, moMask } =\n    components;\n\n  return concatBinary(BIT_LENGTHS, [\n    epLex,\n    eoMask,\n    cpLex,\n    coMask,\n    poIdxU,\n    poIdxL,\n    moSupport,\n    moMask,\n  ]);\n}\n\nexport function reid3x3x3ToTwizzleBinary(\n  state: Transformation,\n): Binary3x3x3State {\n  const components: Binary3x3x3Components = reid3x3x3ToBinaryComponents(state);\n  return binaryComponentsToTwizzleBinary(components);\n}\n\nexport function twizzleBinaryToBinaryComponents(\n  buffer: ArrayBuffer,\n): Binary3x3x3Components {\n  const [epLex, eoMask, cpLex, coMask, poIdxU, poIdxL, moSupport, moMask] =\n    splitBinary(BIT_LENGTHS, buffer);\n\n  return {\n    epLex,\n    eoMask,\n    cpLex,\n    coMask,\n    poIdxU,\n    poIdxL,\n    moSupport,\n    moMask,\n  };\n}\n\nexport function binaryComponentsToReid3x3x3(\n  components: Binary3x3x3Components,\n): Transformation {\n  if (components.moSupport !== 1) {\n    throw new Error(\"Must support center orientation.\");\n  }\n\n  const normedState = {\n    EDGES: {\n      permutation: lexToPermutation(12, components.epLex),\n      orientation: maskToOrientations(2, 12, components.eoMask),\n    },\n    CORNERS: {\n      permutation: lexToPermutation(8, components.cpLex),\n      orientation: maskToOrientations(3, 8, components.coMask),\n    },\n    CENTERS: {\n      permutation: identityPermutation(6),\n      orientation: maskToOrientations(4, 6, components.moMask),\n    },\n  };\n\n  if (!supportsPuzzleOrientation(components)) {\n    return normedState;\n  }\n\n  return reorientPuzzle(normedState, components.poIdxU, components.poIdxL);\n}\n\n// Returns a list of error string.\n// An empty list means validation success.\nfunction validateComponents(components: Binary3x3x3Components): string[] {\n  const errors = [];\n  if (components.epLex < 0 || components.epLex >= 479001600) {\n    errors.push(`epLex (${components.epLex}) out of range`);\n  }\n  if (components.cpLex < 0 || components.cpLex >= 40320) {\n    errors.push(`cpLex (${components.cpLex}) out of range`);\n  }\n  if (components.coMask < 0 || components.coMask >= 6561) {\n    errors.push(`coMask (${components.coMask}) out of range`);\n  }\n  if (components.poIdxU < 0 || components.poIdxU >= 6) {\n    // 0x111 (for idxU) means \"not supported\"\n    if (supportsPuzzleOrientation(components)) {\n      errors.push(`poIdxU (${components.poIdxU}) out of range`);\n    }\n  }\n  // The following cannot be (f decoded from binary properl) out of rangey.\n  if (components.eoMask < 0 || components.eoMask >= 4096) {\n    errors.push(`eoMask (${components.eoMask}) out of range`);\n  }\n  if (components.moMask < 0 || components.moMask >= 4096) {\n    errors.push(`moMask (${components.moMask}) out of range`);\n  }\n  if (components.poIdxL < 0 || components.poIdxL >= 4) {\n    errors.push(`poIdxL (${components.poIdxL}) out of range`);\n  }\n  if (components.moSupport < 0 || components.moSupport >= 2) {\n    errors.push(`moSupport (${components.moSupport}) out of range`);\n  }\n  return errors;\n}\n\nexport function twizzleBinaryToReid3x3x3(buffy: ArrayBuffer): Transformation {\n  const components = twizzleBinaryToBinaryComponents(buffy);\n  const errors = validateComponents(components);\n  if (errors.length !== 0) {\n    throw new Error(`Invalid binary state components: ${errors.join(\", \")}`);\n  }\n  return binaryComponentsToReid3x3x3(components);\n}\n", "export function bufferToSpacedHex(buffer: ArrayBuffer): string {\n  // buffer is an ArrayBuffer\n  return (\n    Array.prototype.map.call(new Uint8Array(buffer), (x: number) =>\n      (\"00\" + x.toString(16)).slice(-2),\n    ) as string[]\n  ).join(\" \");\n}\n\nexport function spacedHexToBuffer(hex: string): Uint8Array {\n  return new Uint8Array(hex.split(\" \").map((c) => parseInt(c, 16)));\n}\n"],
-  "mappings": ";;;;;;AAAO,6BAA6B,UAA4B;AAC9D,QAAM,MAAM,IAAI,MAAc;AAC9B,WAAS,IAAI,GAAG,IAAI,UAAU,KAAK;AACjC,QAAI,KAAK;AAAA;AAEX,SAAO;AAAA;AAIF,4BACL,OACA,cACQ;AACR,MAAI,MAAM;AACV,aAAW,eAAe,cAAc;AACtC,WAAO;AACP,WAAO;AAAA;AAET,SAAO;AAAA;AAIF,4BACL,OACA,UACA,MACU;AACV,QAAM,MAAM;AACZ,SAAO,OAAO,GAAG;AACf,QAAI,KAAK,OAAO;AAChB,WAAO,KAAK,MAAM,OAAO;AAAA;AAE3B,SAAO,IAAI,MAAc,WAAW,IAAI,QAAQ,KAAK,GAAG,OAAO,IAAI;AAAA;AAI9D,0BAA0B,aAA+B;AAC9D,QAAM,IAAI,YAAY;AACtB,MAAI,mBAAmB;AACvB,WAAS,IAAI,GAAG,IAAI,IAAI,GAAG,KAAK;AAC9B,uBAAmB,mBAAoB,KAAI;AAC3C,aAAS,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK;AAC9B,UAAI,YAAY,KAAK,YAAY,IAAI;AACnC,4BAAoB;AAAA;AAAA;AAAA;AAI1B,SAAO;AAAA;AAIF,0BACL,WACA,kBACU;AACV,QAAM,cAAwB,IAAI,MAAM;AACxC,cAAY,YAAY,KAAK;AAC7B,WAAS,IAAI,YAAY,GAAG,KAAK,GAAG,KAAK;AACvC,gBAAY,KAAK,mBAAoB,aAAY;AACjD,uBAAmB,KAAK,MAAM,mBAAoB,aAAY;AAC9D,aAAS,IAAI,IAAI,GAAG,IAAI,WAAW,KAAK;AACtC,UAAI,YAAY,MAAM,YAAY,IAAI;AACpC,oBAAY,KAAK,YAAY,KAAK;AAAA;AAAA;AAAA;AAIxC,SAAO;AAAA;;;AC3DT,IAAI;AAEJ,oBAAoB,MAAc,GAAiC;AACjE,MAAI,MAAM,OAAO;AACf,WAAO;AAAA;AAET,QAAM,OAAO,EAAE;AACf,QAAM,IAAI,KAAK;AACf,WAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,QAAI,KAAK,SAAS,KAAK;AACrB,aAAO;AAAA;AAAA;AAGX,MAAI,OAAO,GAAG;AACZ,UAAM,MAAM,EAAE;AACd,aAAS,MAAM,GAAG,MAAM,GAAG,OAAO;AAChC,UAAI,IAAI,SAAS,GAAG;AAClB,eAAO;AAAA;AAAA;AAAA;AAIb,UAAQ;AACR,SAAO;AAAA;AAGF,gCACL,KACA,IACA,IACgB;AAChB,QAAM,WAA2B;AACjC,aAAW,aAAa,IAAI,QAAQ;AAClC,UAAM,OAAO,IAAI,OAAO;AACxB,UAAM,KAAK,GAAG;AACd,UAAM,KAAK,GAAG;AACd,QAAI,WAAW,KAAK,cAAc,KAAK;AAErC,eAAS,aAAa;AAAA,eACb,WAAW,KAAK,cAAc,KAAK;AAC5C,eAAS,aAAa;AAAA,WACjB;AACL,YAAM,UAAU,IAAI,MAAM,KAAK;AAC/B,UAAI,KAAK,iBAAiB,GAAG;AAC3B,iBAAS,MAAM,GAAG,MAAM,KAAK,WAAW,OAAO;AAC7C,kBAAQ,OAAO,GAAG,YAAY,GAAG,YAAY;AAAA;AAE/C,iBAAS,aAAa;AAAA,UACpB,aAAa;AAAA,UACb,aAAa,GAAG;AAAA;AAAA,aAEb;AACL,cAAM,SAAS,IAAI,MAAM,KAAK;AAC9B,iBAAS,MAAM,GAAG,MAAM,KAAK,WAAW,OAAO;AAC7C,iBAAO,OACJ,IAAG,YAAY,GAAG,YAAY,QAAQ,GAAG,YAAY,QACtD,KAAK;AACP,kBAAQ,OAAO,GAAG,YAAY,GAAG,YAAY;AAAA;AAE/C,iBAAS,aAAa,EAAE,aAAa,SAAS,aAAa;AAAA;AAAA;AAAA;AAIjE,SAAO;AAAA;AAGF,iCACL,KACA,GACA,QACgB;AAChB,MAAI,SAAS,GAAG;AACd,WAAO,wBAAwB,KAAK,qBAAqB,KAAK,IAAI,CAAC;AAAA;AAErE,MAAI,WAAW,GAAG;AAChB,WAAO,uBAAuB;AAAA;AAEhC,MAAI,WAAW,GAAG;AAChB,WAAO;AAAA;AAET,MAAI,UAAU;AACd,MAAI,WAAW,GAAG;AAChB,cAAU,wBAAwB,KAAK,GAAG,KAAK,MAAM,SAAS;AAAA;AAEhE,QAAM,eAAe,uBAAuB,KAAK,SAAS;AAC1D,MAAI,SAAS,MAAM,GAAG;AACpB,WAAO;AAAA,SACF;AACL,WAAO,uBAAuB,KAAK,GAAG;AAAA;AAAA;AAGnC,gCACL,YACgB;AAChB,QAAM,iBAAiB;AACvB,aAAW,aAAa,WAAW,QAAQ;AACzC,UAAM,kBAAkB,WAAW,OAAO;AAC1C,QAAI,CAAC,SAAS,MAAM,YAAY,WAAW,gBAAgB,WAAW;AACpE,YAAM,iBAAiB,IAAI,MAAM,gBAAgB;AACjD,YAAM,iBAAiB,IAAI,MAAM,gBAAgB;AACjD,eAAS,IAAI,GAAG,IAAI,gBAAgB,WAAW,KAAK;AAClD,uBAAe,KAAK;AACpB,uBAAe,KAAK;AAAA;AAEtB,YAAM,sBAAsB;AAAA,QAC1B,aAAa;AAAA,QACb,aAAa;AAAA;AAEf,cAAQ;AAAA;AAIV,mBAAe,aAAa;AAAA;AAK9B,SAAO;AAAA;AAGF,8BACL,KACA,GACgB;AAChB,QAAM,WAA2B;AACjC,aAAW,aAAa,IAAI,QAAQ;AAClC,UAAM,OAAO,IAAI,OAAO;AACxB,UAAM,IAAI,EAAE;AACZ,QAAI,WAAW,KAAK,cAAc,IAAI;AACpC,eAAS,aAAa;AAAA,eACb,KAAK,iBAAiB,GAAG;AAClC,YAAM,UAAU,IAAI,MAAM,KAAK;AAC/B,eAAS,MAAM,GAAG,MAAM,KAAK,WAAW,OAAO;AAC7C,gBAAQ,EAAE,YAAY,QAAQ;AAAA;AAEhC,eAAS,aAAa;AAAA,QACpB,aAAa;AAAA,QACb,aAAa,EAAE;AAAA;AAAA,WAEZ;AACL,YAAM,UAAU,IAAI,MAAM,KAAK;AAC/B,YAAM,SAAS,IAAI,MAAM,KAAK;AAC9B,eAAS,MAAM,GAAG,MAAM,KAAK,WAAW,OAAO;AAC7C,cAAM,UAAU,EAAE,YAAY;AAC9B,gBAAQ,WAAW;AACnB,eAAO,WACJ,MAAK,eAAe,EAAE,YAAY,OAAO,KAAK,gBAC/C,KAAK;AAAA;AAET,eAAS,aAAa,EAAE,aAAa,SAAS,aAAa;AAAA;AAAA;AAG/D,SAAO;AAAA;AAGT,aAAa,GAAW,GAAmB;AACzC,MAAI,GAAG;AACL,WAAO,IAAI,GAAG,IAAI;AAAA;AAEpB,SAAO;AAAA;AAIF,6BACL,KACA,GACQ;AACR,MAAI,IAAY;AAChB,aAAW,aAAa,IAAI,QAAQ;AAClC,UAAM,OAAO,IAAI,OAAO;AACxB,UAAM,IAAI,EAAE;AACZ,UAAM,IAAI,IAAI,MAAM,KAAK;AACzB,aAAS,MAAM,GAAG,MAAM,KAAK,WAAW,OAAO;AAC7C,UAAI,CAAC,EAAE,MAAM;AACX,YAAI,IAAI;AACR,YAAI,KAAK;AACT,YAAI,KAAK;AACT,mBAAS;AACP,YAAE,KAAK;AACP,eAAK,KAAK,EAAE,YAAY;AACxB,eAAK,KAAK;AACV,cAAI,EAAE,YAAY;AAClB,cAAI,MAAM,KAAK;AACb;AAAA;AAAA;AAGJ,YAAI,OAAO,GAAG;AACZ,eAAM,KAAK,KAAK,eAAgB,IAAI,KAAK,cAAc;AAAA;AAEzD,YAAK,IAAI,KAAM,IAAI,GAAG;AAAA;AAAA;AAAA;AAI5B,SAAO;AAAA;AAGF,2CACL,KACA,WACA,IACA,IACA,UAGI,IACK;AACT,QAAM,OAAO,IAAI,OAAO;AACxB,QAAM,KAAK,GAAG;AACd,QAAM,KAAK,GAAG;AACd,WAAS,MAAM,GAAG,MAAM,KAAK,WAAW,OAAO;AAC7C,QACE,CAAC,SAAS,qBACV,GAAG,YAAY,SAAS,GAAG,YAAY,MACvC;AACA,aAAO;AAAA;AAET,QACE,CAAC,SAAS,qBACV,GAAG,YAAY,SAAS,GAAG,YAAY,MACvC;AACA,aAAO;AAAA;AAAA;AAGX,SAAO;AAAA;AAGF,sCACL,KACA,IACA,IACS;AACT,aAAW,aAAa,IAAI,QAAQ;AAClC,QAAI,CAAC,kCAAkC,KAAK,WAAW,IAAI,KAAK;AAC9D,aAAO;AAAA;AAAA;AAGX,SAAO;AAAA;AAGF,6BACL,KACA,IACA,IACS;AAGT,SAAO,6BACL,KACA,uBAAuB,KAAK,IAAI,aAAa,KAC7C,uBAAuB,KAAK,IAAI,aAAa;AAAA;;;ACpP1C,sCACL,KACA,aACgB;AAChB,QAAM,iBAAiB,iBAAiB,KAAK,WAC3C,IAAI,KAAK;AAEX,MAAI,CAAC,gBAAgB;AACnB,UAAM,IAAI,MAAM,mBAAmB,YAAY;AAAA;AAEjD,SAAO;AAAA;AAIF,+BACL,KACA,MACgB;AAChB,QAAM,iBAAiB,iBAAiB,KAAK,WAAW;AACxD,MAAI,CAAC,gBAAgB;AACnB,UAAM,IAAI,MAAM,mBAAmB,KAAK;AAAA;AAE1C,SAAO;AAAA;AAGF,0BAA0B,KAAsC;AACrE,MAAI,CAAC,IAAI,cAAc;AACrB,QAAI,eAAe,IAAI,oBAAoB;AAAA;AAE7C,SAAO,IAAI;AAAA;AAGb,gCAAkD;AAAA,EAEhD,YAAmB,KAAwB;AAAxB;AADX,iBAA2C;AAAA;AAAA,EAG5C,WAAW,MAAwC;AACxD,UAAM,MAAM,KAAK;AACjB,QAAI,IAAgC,KAAK,MAAM;AAC/C,QAAI,GAAG;AACL,aAAO;AAAA;AAET,UAAM,aAAa,KAAK,QAAQ;AAChC,QAAI,KAAK,IAAI,MAAM;AACnB,QAAI,GAAG;AACL,UAAI,wBAAwB,KAAK,KAAK,GAAG,KAAK;AAC9C,WAAK,MAAM,OAAO;AAAA,WACb;AAIL,UAAI,KAAK,IAAI,MAAM,KAAK;AACxB,UAAI,GAAG;AACL,aAAK,MAAM,OAAO;AAAA,aACb;AAIL,YAAI,KAAK,IAAI,MAAM,KAAK,SAAS;AACjC,YAAI,GAAG;AACL,cAAI,wBAAwB,KAAK,KAAK,GAAG;AACzC,eAAK,MAAM,OAAO;AAAA;AAAA;AAAA;AAKxB,WAAO;AAAA;AAAA;AAIJ,oBAAc;AAAA,EAEnB,YAAmB,YAA+B;AAA/B;AACjB,SAAK,QAAQ,uBAAuB;AAAA;AAAA,EAG/B,QAAc;AACnB,SAAK,QAAQ,uBAAuB,KAAK;AAAA;AAAA,EAGpC,YAAoB;AACzB,QAAI,SAAS;AACb,eAAW,aAAa,KAAK,WAAW,QAAQ;AAC9C,gBAAU,YAAY;AACtB,gBAAU,KAAK,MAAM,WAAW,YAAY,KAAK,OAAO;AACxD,gBAAU,KAAK,MAAM,WAAW,YAAY,KAAK,OAAO;AAAA;AAE1D,aAAS,OAAO,MAAM,GAAG,OAAO,SAAS;AACzC,WAAO;AAAA;AAAA,EAGF,UAAU,MAAkB;AACjC,SAAK,QAAQ,uBACX,KAAK,YACL,KAAK,OACL,sBAAsB,KAAK,YAAY;AAAA;AAAA,EAIpC,SAAS,KAAgB;AAE9B,eAAW,QAAQ,IAAI,yBAAyB;AAC9C,WAAK,UAAU;AAAA;AAAA;AAAA;;;ACpGrB,yBAAmB;AAAA,EACjB,YAAmB,MAAqB,OAAe;AAApC;AAAqB;AAAA;AAAA,EACjC,kBAAkB,OAAsC;AAC7D,WAAO,MAAM,WAAW,KAAK,MAAM,KAAK;AAAA;AAAA,EAGnC,SAAS,OAA8B;AAC5C,UAAM,MAAM,MAAM,UAAU,KAAK;AACjC,QAAI,KAAK,KAAK,QAAQ;AACtB,WAAO,KAAK,KAAK,KAAK;AACpB,YAAM;AAAA;AAER,WAAO,KAAK,MAAM,CAAC,KAAK;AACtB,YAAM;AAAA;AAER,UAAM,MAAM,MAAM,UAAU,KAAK;AACjC,QAAI,OAAO,GAAG;AACZ,aAAO;AAAA,eACE,OAAO,IAAI;AACpB,aAAO,MAAM;AAAA,eACJ,KAAK,GAAG;AACjB,aAAO,MAAM;AAAA,eACJ,KAAK,GAAG;AACjB,aAAO,MAAM,CAAC,KAAK;AAAA,WACd;AACL,YAAM,IAAI,MAAM;AAAA;AAAA;AAAA;AAMf,0BAAoB;AAAA,EAOzB,YAAmB,KAAwB;AAAxB;AANZ,oBAAwB;AACxB,qBAAsB;AACtB,qBAAsB;AACtB,sBAAiC;AACjC,qBAAuC;AAG5C,UAAM,YAAY,IAAI;AACtB,UAAM,KAAK,uBAAuB;AAClC,eAAW,OAAO,WAAW;AAC3B,WAAK,UAAU,OAAO,KAAK,UAAU;AACrC,WAAK,UAAU,KAAK;AACpB,WAAK,WAAW,KAAK,CAAC,IAAI,UAAU;AAAA;AAEtC,SAAK,gBAAgB,KAAK,UAAU;AACpC,aAAS,IAAI,GAAG,IAAI,KAAK,eAAe,KAAK;AAC3C,WAAK,SAAS,KAAK;AACnB,YAAM,KAAK,KAAK,WAAW,GAAG;AAC9B,eAAS,IAAI,GAAG,IAAI,KAAK,eAAe,KAAK;AAC3C,cAAM,KAAK,KAAK,WAAW,GAAG;AAC9B,cAAM,KAAK,uBAAuB,KAAK,IAAI;AAC3C,cAAM,KAAK,uBAAuB,KAAK,IAAI;AAC3C,aAAK,SAAS,GAAG,KAAK,6BAA6B,KAAK,IAAI;AAAA;AAAA;AAGhE,aAAS,IAAI,GAAG,IAAI,KAAK,eAAe,KAAK;AAC3C,YAAM,KAAK,KAAK,WAAW,GAAG;AAC9B,UAAI,KAAK;AACT,UAAI,QAAQ;AACZ,eAAS,OAAO,GAAG,CAAC,6BAA6B,KAAK,IAAI,KAAK,QAAQ;AACrE;AACA,aAAK,uBAAuB,KAAK,IAAI;AACrC,aAAK,WAAW,GAAG,KAAK;AAAA;AAE1B,WAAK,UAAU,KAAK;AAAA;AAAA;AAAA,EAIjB,wBAAwB,MAA0B;AACvD,UAAM,iBAAiB,KAAK,QAAQ;AACpC,QAAI,CAAE,mBAAkB,KAAK,IAAI,QAAQ;AACvC,YAAM,IAAI,MAAM,YAAY,iBAAiB;AAAA;AAE/C,UAAM,MAAM,KAAK,UAAU;AAC3B,UAAM,MAAM,KAAK,UAAU;AAC3B,QAAI,KAAK,KAAK,SAAS;AACvB,QAAI,KAAK,GAAG;AACV,WAAM,MAAK,OAAO;AAAA;AAEpB,WAAO,IAAI,aAAa,KAAK;AAAA;AAAA,EAKxB,yBACL,KACA,IACgB;AAChB,UAAM,KAAK,IAAI,eAAe,MAAM;AACpC,eAAW,QAAQ,IAAI,yBAAyB;AAC9C,SAAG,cAAc,KAAK,wBAAwB;AAAA;AAEhD,WAAO;AAAA;AAAA,EAIF,8BACL,KACA,IACgB;AAChB,UAAM,KAAK,IAAI,eAAe,MAAM;AACpC,eAAW,QAAQ,IAAI,yBAAyB;AAC9C,SAAG,aAAa,KAAK,wBAAwB;AAAA;AAE/C,WAAO;AAAA;AAAA;AAOJ,2BAAqB;AAAA,EAG1B,YAAoB,OAAsB,IAAqB;AAA3C;AAFb,mBAA0B;AAG/B,QAAI,IAAI;AACN,WAAK,QAAQ;AAAA,WACR;AACL,WAAK,QAAQ,uBAAuB,MAAM;AAAA;AAAA;AAAA,EASvC,QAAwB;AAC7B,UAAM,IAAI,IAAI,eAAe,KAAK,OAAO,KAAK;AAC9C,MAAE,UAAU,CAAC,GAAG,KAAK;AACrB,WAAO;AAAA;AAAA,EAIF,aAAa,IAA0B;AAC5C,UAAM,IAAI,KAAK,iBAAiB;AAChC,SAAK,QAAQ,uBACX,KAAK,MAAM,KACX,KAAK,OACL,GAAG,kBAAkB,KAAK;AAE5B,WAAO;AAAA;AAAA,EAIF,cAAc,IAA0B;AAC7C,SAAK,QAAQ,KAAK;AAClB,SAAK,QAAQ,uBACX,KAAK,MAAM,KACX,KAAK,OACL,GAAG,kBAAkB,KAAK;AAE5B,WAAO;AAAA;AAAA,EAIF,UAAkB;AACvB,UAAM,KAAK,KAAK,QAAQ;AACxB,QAAI,CAAC,IAAI;AACP,YAAM,IAAI,MAAM;AAAA;AAElB,SAAK,QAAQ,uBACX,KAAK,MAAM,KACX,KAAK,OACL,KAAK,MAAM,WAAW,GAAG,MAAM,KAAK,MAAM,UAAU,GAAG,QAAQ,GAAG;AAEpE,WAAO;AAAA;AAAA,EAIF,eAAuB;AAC5B,UAAM,SAAS,KAAK,QAAQ,KAAK,QAAQ,SAAS;AAClD,SAAK,QAAQ,uBACX,KAAK,MAAM,KACX,KAAK,OACL,KAAK,MAAM,WAAW,OAAO,MAAM;AAErC,SAAK,QAAQ,KAAK,QAAQ,SAAS,KAAK,IAAI,aAC1C,OAAO,MACP,OAAO,QAAQ;AAEjB,WAAO;AAAA;AAAA,EAGD,iBAAiB,IAA0B;AACjD,QAAI,IAAI,KAAK,QAAQ,SAAS;AAC9B,WAAO,KAAK,GAAG;AACb,UAAI,GAAG,SAAS,KAAK,QAAQ,GAAG,MAAM;AACpC,cAAM,KAAK,KAAK,MAAM,UAAU,GAAG;AACnC,YAAI,QAAS,IAAG,QAAQ,KAAK,QAAQ,GAAG,SAAS;AACjD,YAAI,QAAQ,GAAG;AACb,kBAAS,SAAQ,MAAM;AAAA;AAEzB,YAAI,UAAU,GAAG;AAGf,eAAK,QAAQ,OAAO,GAAG;AACvB,iBAAO;AAAA,eACF;AACL,eAAK,QAAQ,KAAK,IAAI,aAAa,GAAG,MAAM;AAC5C,iBAAO;AAAA;AAAA,iBAEA,KAAK,MAAM,SAAS,GAAG,MAAM,KAAK,QAAQ,GAAG,OAAO;AAC7D;AAAA,aACK;AACL;AAAA;AAAA;AAGJ,SAAK,QAAQ,KAAK;AAClB,WAAO;AAAA;AAAA,EAIF,cAAc,KAA6B;AAChD,QAAI,IAAI,KAAK,QAAQ;AACrB,aAAS,IAAI,GAAG,IAAI,IAAI,QAAQ,QAAQ,KAAK;AAC3C,YAAM,KAAK,IAAI,QAAQ;AACvB,YAAM,IAAI,KAAK,iBAAiB;AAChC,WAAK;AAAA;AAEP,SAAK,QAAQ,uBAAuB,KAAK,MAAM,KAAK,KAAK,OAAO,IAAI;AACpE,WAAO;AAAA;AAAA,EAGF,sBAA8B;AACnC,UAAM,IAAc;AACpB,eAAW,MAAM,KAAK,SAAS;AAC7B,QAAE,KAAK,GAAG,SAAS,KAAK;AAAA;AAE1B,WAAO,EAAE,KAAK;AAAA;AAAA;AAQX,sCAAgC;AAAA,EAGrC,YAAmB,OAAsB,OAAwB;AAA9C;AACjB,SAAK,KAAK,IAAI,eAAe,OAAO;AACpC,SAAK,eAAe;AAAA;AAAA,EAGf,UAAU,MAAc,YAAuC;AACpE,UAAM,WAAqB;AAC3B,eAAW,YAAY,YAAY;AACjC,UAAI,aAAa,MAAM;AACrB,eAAO;AAAA,iBACE,CAAC,KAAK,MAAM,SAAS,UAAU,OAAO;AAAA,iBAEtC,OAAO,UAAU;AAC1B,eAAO;AAAA,aACF;AACL,iBAAS,KAAK;AAAA;AAAA;AAGlB,WAAO;AAAA;AAAA,GAGD,YACN,MACA,YACuC;AACvC,QAAI,SAAS,GAAG;AACd,YAAM,KAAK;AAAA,WACN;AACL,eAAS,OAAO,GAAG,OAAO,KAAK,MAAM,eAAe,QAAQ;AAC1D,cAAM,WAAW,KAAK,UAAU,MAAM;AACtC,YAAI,UAAU;AACZ,mBAAS,KAAK;AACd,mBAAS,KAAK,GAAG,KAAK,KAAK,MAAM,UAAU,OAAO,MAAM;AACtD,iBAAK,GAAG,cAAc,IAAI,aAAa,MAAM;AAC7C,mBAAO,KAAK,YAAY,OAAO,GAAG;AAClC,iBAAK,GAAG;AAAA;AAAA;AAAA;AAAA;AAKhB,WAAO;AAAA;AAAA,GAGD,YAA6D;AACnE,aAAS,IAAI,KAAK,KAAK;AACrB,aAAO,KAAK,YAAY,GAAG;AAAA;AAAA;AAAA,GAIvB,gBACN,YACyC;AACzC,UAAM,IAAI,MAAM,KAAK;AACrB,QAAI,IAAI,GAAG;AACT,aAAO;AAAA;AAET,aAAS,OAAO,GAAG,OAAO,KAAK,MAAM,eAAe,QAAQ;AAC1D,YAAM,WAAW,KAAK,UAAU,MAAM;AACtC,UAAI,UAAU;AACZ,iBAAS,KAAK;AACd,iBAAS,KAAK,GAAG,KAAK,KAAK,MAAM,UAAU,OAAO,MAAM;AACtD,eAAK,GAAG,cAAc,IAAI,aAAa,MAAM;AAC7C,iBAAO,KAAK,gBAAgB;AAC5B,eAAK,GAAG;AAAA;AAAA;AAAA;AAId,WAAO;AAAA;AAAA;;;AC9TX,sBAAsB,OAAO,QAAQ;AACnC,eAAa;AACX,SAAK,cAAc;AAAA;AAErB,IAAE,YAAY,OAAO;AACrB,QAAM,YAAY,IAAI;AAAA;AAGxB,yBAAyB,SAAS,UAAU,OAAO,UAAU;AAC3D,OAAK,UAAU;AACf,OAAK,WAAW;AAChB,OAAK,QAAQ;AACb,OAAK,WAAW;AAChB,OAAK,OAAO;AAEZ,MAAI,OAAO,MAAM,sBAAsB,YAAY;AACjD,UAAM,kBAAkB,MAAM;AAAA;AAAA;AAIlC,aAAa,iBAAiB;AAE9B,gBAAgB,eAAe,SAAU,UAAU,OAAO;AACxD,MAAI,2BAA2B;AAAA,IAC7B,SAAS,SAAU,aAAa;AAC9B,aAAO,MAAM,cAAc,YAAY,QAAQ;AAAA;AAAA,IAGjD,OAAO,SAAU,aAAa;AAC5B,UAAI,eAAe,YAAY,MAAM,IAAI,SAAU,MAAM;AACvD,eAAO,MAAM,QAAQ,QACjB,YAAY,KAAK,MAAM,MAAM,YAAY,KAAK,MAC9C,YAAY;AAAA;AAGlB,aAAO,MAAO,aAAY,WAAW,MAAM,MAAM,eAAe;AAAA;AAAA,IAGlE,KAAK,WAAY;AACf,aAAO;AAAA;AAAA,IAGT,KAAK,WAAY;AACf,aAAO;AAAA;AAAA,IAGT,OAAO,SAAU,aAAa;AAC5B,aAAO,YAAY;AAAA;AAAA;AAIvB,eAAa,IAAI;AACf,WAAO,GAAG,WAAW,GAAG,SAAS,IAAI;AAAA;AAGvC,yBAAuB,GAAG;AACxB,WAAO,EACJ,QAAQ,OAAO,QACf,QAAQ,MAAM,OACd,QAAQ,OAAO,OACf,QAAQ,OAAO,OACf,QAAQ,OAAO,OACf,QAAQ,OAAO,OACf,QAAQ,gBAAgB,SAAU,IAAI;AACrC,aAAO,SAAS,IAAI;AAAA,OAErB,QAAQ,yBAAyB,SAAU,IAAI;AAC9C,aAAO,QAAQ,IAAI;AAAA;AAAA;AAIzB,uBAAqB,GAAG;AACtB,WAAO,EACJ,QAAQ,OAAO,QACf,QAAQ,OAAO,OACf,QAAQ,OAAO,OACf,QAAQ,MAAM,OACd,QAAQ,OAAO,OACf,QAAQ,OAAO,OACf,QAAQ,OAAO,OACf,QAAQ,OAAO,OACf,QAAQ,gBAAgB,SAAU,IAAI;AACrC,aAAO,SAAS,IAAI;AAAA,OAErB,QAAQ,yBAAyB,SAAU,IAAI;AAC9C,aAAO,QAAQ,IAAI;AAAA;AAAA;AAIzB,+BAA6B,aAAa;AACxC,WAAO,yBAAyB,YAAY,MAAM;AAAA;AAGpD,4BAA0B,WAAU;AAClC,QAAI,eAAe,UAAS,IAAI;AAChC,QAAI,GAAG;AAEP,iBAAa;AAEb,QAAI,aAAa,SAAS,GAAG;AAC3B,WAAK,IAAI,GAAG,IAAI,GAAG,IAAI,aAAa,QAAQ,KAAK;AAC/C,YAAI,aAAa,IAAI,OAAO,aAAa,IAAI;AAC3C,uBAAa,KAAK,aAAa;AAC/B;AAAA;AAAA;AAGJ,mBAAa,SAAS;AAAA;AAGxB,YAAQ,aAAa;AAAA,WACd;AACH,eAAO,aAAa;AAAA,WAEjB;AACH,eAAO,aAAa,KAAK,SAAS,aAAa;AAAA;AAG/C,eACE,aAAa,MAAM,GAAG,IAAI,KAAK,QAC/B,UACA,aAAa,aAAa,SAAS;AAAA;AAAA;AAK3C,yBAAuB,QAAO;AAC5B,WAAO,SAAQ,MAAM,cAAc,UAAS,MAAM;AAAA;AAGpD,SACE,cACA,iBAAiB,YACjB,UACA,cAAc,SACd;AAAA;AAIJ,mBAAmB,OAAO,SAAS;AACjC,YAAU,YAAY,SAAY,UAAU;AAE5C,MAAI,aAAa;AAEjB,MAAI,yBAAyB,EAAE,OAAO;AACtC,MAAI,wBAAwB;AAE5B,MAAI,SAAS,SAAU,KAAK;AAC1B,WAAO,SAAS;AAAA;AAElB,MAAI,SAAS;AACb,MAAI,SAAS,qBACX,CAAC,CAAC,KAAK,MAAM,CAAC,KAAK,MAAM,CAAC,KAAK,MAAM,KAAK,MAC1C,OACA;AAEF,MAAI,SAAS,SAAU,YAAY;AACjC,WAAO,WAAW,KAAK;AAAA;AAEzB,MAAI,SAAS;AACb,MAAI,SAAS,qBACX;AAAA,IACE,CAAC,KAAK;AAAA,IACN,CAAC,KAAK;AAAA,KAER,OACA;AAEF,MAAI,SAAS;AACb,MAAI,SAAS,qBACX;AAAA,IACE,CAAC,KAAK;AAAA,IACN,CAAC,KAAK;AAAA,IACN,CAAC,KAAK;AAAA,KAER,OACA;AAEF,MAAI,SAAS,SAAU,OAAO,MAAM;AAClC,WAAO,CAAC,OAAO,OAAO,MAAM,KAAK;AAAA;AAEnC,MAAI,SAAS;AACb,MAAI,UAAU,qBAAqB,CAAC,CAAC,KAAK,OAAO,OAAO;AACxD,MAAI,UAAU,SAAU,YAAY;AAClC,WAAO,SAAS,WAAW,KAAK,KAAK;AAAA;AAEvC,MAAI,UAAU;AACd,MAAI,UAAU,uBAAuB,KAAK;AAC1C,MAAI,UAAU;AACd,MAAI,UAAU,uBAAuB,QAAQ;AAC7C,MAAI,UAAU,SAAU,YAAY;AAClC,WAAO;AAAA;AAET,MAAI,UAAU;AACd,MAAI,UAAU,uBAAuB,OAAO;AAC5C,MAAI,UAAU,SAAU,gBAAgB,YAAY,kBAAkB;AACpE,WAAO;AAAA,MACL;AAAA,MACA,EAAE,WAAW,YAAY,cAAc;AAAA;AAAA;AAG3C,MAAI,UAAU,SAAU,OAAO,QAAQ;AACrC,WAAO,MAAM,MAAM,MAAM;AACzB,WAAO;AAAA;AAET,MAAI,UAAU,SAAU,OAAO;AAC7B,UAAM,SAAS;AACf,WAAO,MAAM,MAAM,MAAM;AACzB,WAAO;AAAA;AAET,MAAI,UAAU;AACd,MAAI,UAAU,uBAAuB,MAAM;AAC3C,MAAI,UAAU,SAAU,KAAK,MAAM;AACjC,WAAO,CAAC,KAAK,OAAO;AAAA;AAEtB,MAAI,UAAU,SAAU,KAAK;AAC3B,WAAO,CAAC;AAAA;AAEV,MAAI,UAAU,SAAU,MAAM;AAC5B,WAAO,eAAe;AAAA;AAExB,MAAI,UAAU,SAAU,gBAAgB,aAAa,MAAM;AACzD,WAAO,CAAC,gBAAgB,EAAE,aAA0B,aAAa;AAAA;AAEnE,MAAI,UAAU,SAAU,gBAAgB,aAAa;AACnD,WAAO;AAAA,MACL;AAAA,MACA;AAAA,QACE;AAAA,QACA,aAAa,IAAI,MAAM,YAAY,QAAQ,KAAK;AAAA;AAAA;AAAA;AAItD,MAAI,UAAU,SAAU,YAAY,aAAa;AAC/C,gBAAY,WAAW,MAAM,WAAW;AACxC,WAAO;AAAA;AAET,MAAI,UAAU,SAAU,YAAY;AAClC,UAAM,cAAc;AACpB,gBAAY,WAAW,MAAM,WAAW;AACxC,WAAO;AAAA;AAET,MAAI,UAAU;AACd,MAAI,UAAU,uBAAuB,UAAU;AAC/C,MAAI,UAAU;AACd,MAAI,UAAU,uBAAuB,OAAO;AAC5C,MAAI,UAAU,SAAU,aAAa;AACnC,WAAO;AAAA;AAET,MAAI,UAAU;AACd,MAAI,UAAU,uBAAuB,QAAQ;AAC7C,MAAI,UAAU,SAAU,YAAY,aAAa;AAC/C,WAAO,CAAC,YAAY;AAAA;AAEtB,MAAI,UAAU,SAAU,MAAM,OAAO;AACnC,UAAM,KAAK,MAAM,KAAK;AACtB,WAAO;AAAA;AAET,MAAI,UAAU,SAAU,MAAM;AAC5B,UAAM,QAAQ;AACd,UAAM,KAAK,MAAM,KAAK;AACtB,WAAO;AAAA;AAET,MAAI,UAAU,SAAU,MAAM,QAAQ,cAAc,OAAO;AACzD,WAAO;AAAA,MACL;AAAA,MACA;AAAA,MACA;AAAA,MACA,aAAa;AAAA;AAAA;AAIjB,MAAI,cAAc;AAClB,MAAI,eAAe;AACnB,MAAI,sBAAsB,CAAC,EAAE,MAAM,GAAG,QAAQ;AAC9C,MAAI,iBAAiB;AACrB,MAAI,sBAAsB;AAC1B,MAAI,kBAAkB;AAEtB,MAAI;AAEJ,MAAI,eAAe,SAAS;AAC1B,QAAI,CAAE,SAAQ,aAAa,yBAAyB;AAClD,YAAM,IAAI,MACR,oCAAqC,QAAQ,YAAY;AAAA;AAI7D,4BAAwB,uBAAuB,QAAQ;AAAA;AAGzD,kBAAgB;AACd,WAAO,MAAM,UAAU,cAAc;AAAA;AAGvC,sBAAoB;AAClB,WAAO,oBAAoB,cAAc;AAAA;AAG3C,oBAAkB,aAAa,WAAU;AACvC,gBACE,cAAa,SACT,YACA,oBAAoB,cAAc;AAExC,UAAM,yBACJ,CAAC,qBAAqB,eACtB,MAAM,UAAU,cAAc,cAC9B;AAAA;AAIJ,iBAAe,SAAS,WAAU;AAChC,gBACE,cAAa,SACT,YACA,oBAAoB,cAAc;AAExC,UAAM,qBAAqB,SAAS;AAAA;AAGtC,kCAAgC,OAAM,YAAY;AAChD,WAAO,EAAE,MAAM,WAAW,MAAM,OAAM;AAAA;AAGxC,gCAA8B,OAAO,UAAU,YAAY;AACzD,WAAO;AAAA,MACL,MAAM;AAAA,MACN;AAAA,MACA;AAAA,MACA;AAAA;AAAA;AAIJ,gCAA8B;AAC5B,WAAO,EAAE,MAAM;AAAA;AAGjB,gCAA8B;AAC5B,WAAO,EAAE,MAAM;AAAA;AAGjB,gCAA8B,aAAa;AACzC,WAAO,EAAE,MAAM,SAAS;AAAA;AAG1B,iCAA+B,KAAK;AAClC,QAAI,UAAU,oBAAoB;AAClC,QAAI;AAEJ,QAAI,SAAS;AACX,aAAO;AAAA,WACF;AACL,UAAI,MAAM;AACV,aAAO,CAAC,oBAAoB,IAAI;AAC9B;AAAA;AAGF,gBAAU,oBAAoB;AAC9B,gBAAU;AAAA,QACR,MAAM,QAAQ;AAAA,QACd,QAAQ,QAAQ;AAAA;AAGlB,aAAO,IAAI,KAAK;AACd,YAAI,MAAM,WAAW,OAAO,IAAI;AAC9B,kBAAQ;AACR,kBAAQ,SAAS;AAAA,eACZ;AACL,kBAAQ;AAAA;AAGV;AAAA;AAGF,0BAAoB,OAAO;AAE3B,aAAO;AAAA;AAAA;AAIX,+BAA6B,UAAU,QAAQ;AAC7C,QAAI,kBAAkB,sBAAsB;AAC5C,QAAI,gBAAgB,sBAAsB;AAE1C,WAAO;AAAA,MACL,OAAO;AAAA,QACL,QAAQ;AAAA,QACR,MAAM,gBAAgB;AAAA,QACtB,QAAQ,gBAAgB;AAAA;AAAA,MAE1B,KAAK;AAAA,QACH,QAAQ;AAAA,QACR,MAAM,cAAc;AAAA,QACpB,QAAQ,cAAc;AAAA;AAAA;AAAA;AAK5B,oBAAkB,WAAU;AAC1B,QAAI,cAAc,gBAAgB;AAChC;AAAA;AAGF,QAAI,cAAc,gBAAgB;AAChC,uBAAiB;AACjB,4BAAsB;AAAA;AAGxB,wBAAoB,KAAK;AAAA;AAG3B,gCAA8B,SAAS,WAAU;AAC/C,WAAO,IAAI,gBAAgB,SAAS,MAAM,MAAM;AAAA;AAGlD,oCAAkC,WAAU,OAAO,WAAU;AAC3D,WAAO,IAAI,gBACT,gBAAgB,aAAa,WAAU,QACvC,WACA,OACA;AAAA;AAIJ,4BAA0B;AACxB,QAAI,IAAI;AAER,SAAK;AACL,SAAK;AACL,QAAI,OAAO,YAAY;AACrB,qBAAe;AACf,WAAK,OAAO;AAAA;AAEd,SAAK;AAEL,WAAO;AAAA;AAGT,iCAA+B;AAC7B,QAAI,IAAI,IAAI;AAEZ,SAAK;AACL,SAAK;AACL,QAAI,OAAO,KAAK,MAAM,OAAO,eAAe;AAC1C,WAAK,MAAM,OAAO;AAClB;AAAA,WACK;AACL,WAAK;AACL,UAAI,oBAAoB,GAAG;AACzB,iBAAS;AAAA;AAAA;AAGb,QAAI,OAAO,YAAY;AACrB,aAAO,OAAO,YAAY;AACxB,WAAG,KAAK;AACR,YAAI,OAAO,KAAK,MAAM,OAAO,eAAe;AAC1C,eAAK,MAAM,OAAO;AAClB;AAAA,eACK;AACL,eAAK;AACL,cAAI,oBAAoB,GAAG;AACzB,qBAAS;AAAA;AAAA;AAAA;AAAA,WAIV;AACL,WAAK;AAAA;AAEP,QAAI,OAAO,YAAY;AACrB,qBAAe;AACf,WAAK,OAAO;AAAA;AAEd,SAAK;AAEL,WAAO;AAAA;AAGT,qCAAmC;AACjC,QAAI,IAAI,IAAI,IAAI;AAEhB,SAAK;AACL,QAAI,OAAO,KAAK,MAAM,OAAO,eAAe;AAC1C,WAAK,MAAM,OAAO;AAClB;AAAA,WACK;AACL,WAAK;AACL,UAAI,oBAAoB,GAAG;AACzB,iBAAS;AAAA;AAAA;AAGb,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,UAAI,OAAO,KAAK,MAAM,OAAO,eAAe;AAC1C,aAAK,MAAM,OAAO;AAClB;AAAA,aACK;AACL,aAAK;AACL,YAAI,oBAAoB,GAAG;AACzB,mBAAS;AAAA;AAAA;AAGb,aAAO,OAAO,YAAY;AACxB,WAAG,KAAK;AACR,YAAI,OAAO,KAAK,MAAM,OAAO,eAAe;AAC1C,eAAK,MAAM,OAAO;AAClB;AAAA,eACK;AACL,eAAK;AACL,cAAI,oBAAoB,GAAG;AACzB,qBAAS;AAAA;AAAA;AAAA;AAIf,UAAI,OAAO,YAAY;AACrB,uBAAe;AACf,aAAK,OAAO,IAAI;AAChB,aAAK;AAAA,aACA;AACL,sBAAc;AACd,aAAK;AAAA;AAAA,WAEF;AACL,oBAAc;AACd,WAAK;AAAA;AAGP,WAAO;AAAA;AAGT,6BAA2B;AACzB,QAAI,IAAI,IAAI;AAEZ,SAAK;AACL,SAAK;AACL,QAAI,OAAO,KAAK,MAAM,OAAO,eAAe;AAC1C,WAAK,MAAM,OAAO;AAClB;AAAA,WACK;AACL,WAAK;AACL,UAAI,oBAAoB,GAAG;AACzB,iBAAS;AAAA;AAAA;AAGb,QAAI,OAAO,YAAY;AACrB,aAAO,OAAO,YAAY;AACxB,WAAG,KAAK;AACR,YAAI,OAAO,KAAK,MAAM,OAAO,eAAe;AAC1C,eAAK,MAAM,OAAO;AAClB;AAAA,eACK;AACL,eAAK;AACL,cAAI,oBAAoB,GAAG;AACzB,qBAAS;AAAA;AAAA;AAAA;AAAA,WAIV;AACL,WAAK;AAAA;AAEP,QAAI,OAAO,YAAY;AACrB,qBAAe;AACf,WAAK,QAAQ;AAAA;AAEf,SAAK;AAEL,WAAO;AAAA;AAGT,4BAA0B;AACxB,QAAI;AAEJ,QAAI,MAAM,WAAW,iBAAiB,IAAI;AACxC,WAAK;AACL;AAAA,WACK;AACL,WAAK;AACL,UAAI,oBAAoB,GAAG;AACzB,iBAAS;AAAA;AAAA;AAIb,WAAO;AAAA;AAGT,2BAAyB;AACvB,QAAI,IAAI,IAAI,IAAI;AAEhB,SAAK;AACL,QAAI,MAAM,OAAO,aAAa,OAAO,SAAS;AAC5C,WAAK;AACL,qBAAe;AAAA,WACV;AACL,WAAK;AACL,UAAI,oBAAoB,GAAG;AACzB,iBAAS;AAAA;AAAA;AAGb,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,aAAK;AACL,YAAI,OAAO,YAAY;AACrB,yBAAe;AACf,eAAK,QAAQ;AACb,eAAK;AAAA,eACA;AACL,wBAAc;AACd,eAAK;AAAA;AAAA,aAEF;AACL,sBAAc;AACd,aAAK;AAAA;AAAA,WAEF;AACL,oBAAc;AACd,WAAK;AAAA;AAGP,WAAO;AAAA;AAGT,4BAA0B;AACxB,QAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAEhC,SAAK;AACL,QAAI,MAAM,OAAO,aAAa,OAAO,SAAS;AAC5C,WAAK;AACL,qBAAe;AAAA,WACV;AACL,WAAK;AACL,UAAI,oBAAoB,GAAG;AACzB,iBAAS;AAAA;AAAA;AAGb,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,aAAK;AACL,YAAI,OAAO,YAAY;AACrB,eAAK;AACL,cAAI,OAAO,YAAY;AACrB,iBAAK;AACL,gBAAI,OAAO,YAAY;AACrB,mBAAK;AACL,kBAAI,OAAO,YAAY;AACrB,qBAAK;AACL,oBAAI,OAAO,YAAY;AACrB,iCAAe;AACf,uBAAK,QAAQ,IAAI,IAAI;AACrB,uBAAK;AAAA,uBACA;AACL,gCAAc;AACd,uBAAK;AAAA;AAAA,qBAEF;AACL,8BAAc;AACd,qBAAK;AAAA;AAAA,mBAEF;AACL,4BAAc;AACd,mBAAK;AAAA;AAAA,iBAEF;AACL,0BAAc;AACd,iBAAK;AAAA;AAAA,eAEF;AACL,wBAAc;AACd,eAAK;AAAA;AAAA,aAEF;AACL,sBAAc;AACd,aAAK;AAAA;AAAA,WAEF;AACL,oBAAc;AACd,WAAK;AAAA;AAGP,WAAO;AAAA;AAGT,6BAA2B;AACzB,QAAI,IAAI,IAAI,IAAI;AAEhB,SAAK;AACL,SAAK;AACL,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,aAAK;AACL,YAAI,OAAO,YAAY;AACrB,yBAAe;AACf,eAAK,QAAQ,IAAI;AACjB,eAAK;AAAA,eACA;AACL,wBAAc;AACd,eAAK;AAAA;AAAA,aAEF;AACL,sBAAc;AACd,aAAK;AAAA;AAAA,WAEF;AACL,oBAAc;AACd,WAAK;AAAA;AAEP,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,uBAAe;AACf,aAAK,QAAQ;AAAA;AAEf,WAAK;AAAA;AAGP,WAAO;AAAA;AAGT,8BAA4B;AAC1B,QAAI;AAEJ,QAAI,MAAM,WAAW,iBAAiB,IAAI;AACxC,WAAK;AACL;AAAA,WACK;AACL,WAAK;AACL,UAAI,oBAAoB,GAAG;AACzB,iBAAS;AAAA;AAAA;AAIb,WAAO;AAAA;AAGT,+BAA6B;AAC3B,QAAI,IAAI;AAER,SAAK;AACL,QAAI,MAAM,WAAW,iBAAiB,IAAI;AACxC,WAAK;AACL;AAAA,WACK;AACL,WAAK;AACL,UAAI,oBAAoB,GAAG;AACzB,iBAAS;AAAA;AAAA;AAGb,QAAI,OAAO,YAAY;AACrB,aAAO,OAAO,YAAY;AACxB,WAAG,KAAK;AACR,YAAI,MAAM,WAAW,iBAAiB,IAAI;AACxC,eAAK;AACL;AAAA,eACK;AACL,eAAK;AACL,cAAI,oBAAoB,GAAG;AACzB,qBAAS;AAAA;AAAA;AAAA;AAAA,WAIV;AACL,WAAK;AAAA;AAGP,WAAO;AAAA;AAGT,wCAAsC;AACpC,QAAI,IAAI;AAER,SAAK;AACL,QAAI,MAAM,WAAW,iBAAiB,IAAI;AACxC,WAAK;AACL;AAAA,WACK;AACL,WAAK;AACL,UAAI,oBAAoB,GAAG;AACzB,iBAAS;AAAA;AAAA;AAGb,WAAO,OAAO,YAAY;AACxB,SAAG,KAAK;AACR,UAAI,MAAM,WAAW,iBAAiB,IAAI;AACxC,aAAK;AACL;AAAA,aACK;AACL,aAAK;AACL,YAAI,oBAAoB,GAAG;AACzB,mBAAS;AAAA;AAAA;AAAA;AAKf,WAAO;AAAA;AAGT,8BAA4B;AAC1B,QAAI,IAAI,IAAI,IAAI;AAEhB,SAAK;AACL,SAAK;AACL,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,aAAK;AACL,YAAI,OAAO,YAAY;AACrB,yBAAe;AACf,eAAK,QAAQ,IAAI;AACjB,eAAK;AAAA,eACA;AACL,wBAAc;AACd,eAAK;AAAA;AAAA,aAEF;AACL,sBAAc;AACd,aAAK;AAAA;AAAA,WAEF;AACL,oBAAc;AACd,WAAK;AAAA;AAEP,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,uBAAe;AACf,aAAK,QAAQ;AAAA;AAEf,WAAK;AAAA;AAGP,WAAO;AAAA;AAGT,kCAAgC;AAC9B,QAAI,IAAI;AAER,SAAK;AACL,SAAK;AACL,QAAI,OAAO,YAAY;AACrB,qBAAe;AACf,WAAK,QAAQ;AAAA;AAEf,SAAK;AAEL,WAAO;AAAA;AAGT,iCAA+B;AAC7B,QAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAExB,SAAK;AACL,SAAK;AACL,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,aAAK;AACL,YAAI,OAAO,YAAY;AACrB,eAAK;AACL,cAAI,OAAO,YAAY;AACrB,iBAAK;AACL,gBAAI,OAAO,YAAY;AACrB,6BAAe;AACf,mBAAK,QAAQ,IAAI,IAAI;AACrB,mBAAK;AAAA,mBACA;AACL,4BAAc;AACd,mBAAK;AAAA;AAAA,iBAEF;AACL,0BAAc;AACd,iBAAK;AAAA;AAAA,eAEF;AACL,wBAAc;AACd,eAAK;AAAA;AAAA,aAEF;AACL,sBAAc;AACd,aAAK;AAAA;AAAA,WAEF;AACL,oBAAc;AACd,WAAK;AAAA;AAEP,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,aAAK;AACL,YAAI,OAAO,YAAY;AACrB,eAAK;AACL,cAAI,OAAO,YAAY;AACrB,2BAAe;AACf,iBAAK,QAAQ,IAAI;AACjB,iBAAK;AAAA,iBACA;AACL,0BAAc;AACd,iBAAK;AAAA;AAAA,eAEF;AACL,wBAAc;AACd,eAAK;AAAA;AAAA,aAEF;AACL,sBAAc;AACd,aAAK;AAAA;AAAA;AAIT,WAAO;AAAA;AAGT,kCAAgC;AAC9B,QAAI,IAAI,IAAI,IAAI;AAEhB,SAAK;AACL,SAAK;AACL,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,aAAK;AACL,YAAI,OAAO,YAAY;AACrB,yBAAe;AACf,eAAK,QAAQ,IAAI;AACjB,eAAK;AAAA,eACA;AACL,wBAAc;AACd,eAAK;AAAA;AAAA,aAEF;AACL,sBAAc;AACd,aAAK;AAAA;AAAA,WAEF;AACL,oBAAc;AACd,WAAK;AAAA;AAEP,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,uBAAe;AACf,aAAK,QAAQ;AAAA;AAEf,WAAK;AAAA;AAGP,WAAO;AAAA;AAGT,mCAAiC;AAC/B,QAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAExB,SAAK;AACL,QAAI,MAAM,OAAO,aAAa,OAAO,SAAS;AAC5C,WAAK;AACL,qBAAe;AAAA,WACV;AACL,WAAK;AACL,UAAI,oBAAoB,GAAG;AACzB,iBAAS;AAAA;AAAA;AAGb,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,aAAK;AACL,YAAI,OAAO,YAAY;AACrB,eAAK;AACL,cAAI,OAAO,YAAY;AACrB,gBAAI,MAAM,OAAO,aAAa,OAAO,SAAS;AAC5C,mBAAK;AACL,6BAAe;AAAA,mBACV;AACL,mBAAK;AACL,kBAAI,oBAAoB,GAAG;AACzB,yBAAS;AAAA;AAAA;AAGb,gBAAI,OAAO,YAAY;AACrB,6BAAe;AACf,mBAAK,QAAQ;AACb,mBAAK;AAAA,mBACA;AACL,4BAAc;AACd,mBAAK;AAAA;AAAA,iBAEF;AACL,0BAAc;AACd,iBAAK;AAAA;AAAA,eAEF;AACL,wBAAc;AACd,eAAK;AAAA;AAAA,aAEF;AACL,sBAAc;AACd,aAAK;AAAA;AAAA,WAEF;AACL,oBAAc;AACd,WAAK;AAAA;AAGP,WAAO;AAAA;AAGT,2BAAyB;AACvB,QAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAEhC,SAAK;AACL,QAAI,MAAM,OAAO,aAAa,OAAO,SAAS;AAC5C,WAAK;AACL,qBAAe;AAAA,WACV;AACL,WAAK;AACL,UAAI,oBAAoB,GAAG;AACzB,iBAAS;AAAA;AAAA;AAGb,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,aAAK;AACL,YAAI,OAAO,YAAY;AACrB,eAAK;AACL,cAAI,OAAO,YAAY;AACrB,iBAAK;AACL,gBAAI,OAAO,YAAY;AACrB,mBAAK;AACL,kBAAI,OAAO,YAAY;AACrB,oBAAI,MAAM,OAAO,aAAa,OAAO,SAAS;AAC5C,uBAAK;AACL,iCAAe;AAAA,uBACV;AACL,uBAAK;AACL,sBAAI,oBAAoB,GAAG;AACzB,6BAAS;AAAA;AAAA;AAGb,oBAAI,OAAO,YAAY;AACrB,iCAAe;AACf,uBAAK,QAAQ,IAAI;AACjB,uBAAK;AAAA,uBACA;AACL,gCAAc;AACd,uBAAK;AAAA;AAAA,qBAEF;AACL,8BAAc;AACd,qBAAK;AAAA;AAAA,mBAEF;AACL,4BAAc;AACd,mBAAK;AAAA;AAAA,iBAEF;AACL,0BAAc;AACd,iBAAK;AAAA;AAAA,eAEF;AACL,wBAAc;AACd,eAAK;AAAA;AAAA,aAEF;AACL,sBAAc;AACd,aAAK;AAAA;AAAA,WAEF;AACL,oBAAc;AACd,WAAK;AAAA;AAGP,WAAO;AAAA;AAGT,4BAA0B;AACxB,QAAI,IAAI,IAAI,IAAI;AAEhB,SAAK;AACL,SAAK;AACL,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,aAAK;AACL,YAAI,OAAO,YAAY;AACrB,yBAAe;AACf,eAAK,QAAQ,IAAI;AACjB,eAAK;AAAA,eACA;AACL,wBAAc;AACd,eAAK;AAAA;AAAA,aAEF;AACL,sBAAc;AACd,aAAK;AAAA;AAAA,WAEF;AACL,oBAAc;AACd,WAAK;AAAA;AAEP,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,uBAAe;AACf,aAAK,QAAQ;AAAA;AAEf,WAAK;AAAA;AAGP,WAAO;AAAA;AAGT,sCAAoC;AAClC,QAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI;AAEpC,SAAK;AACL,SAAK;AACL,QAAI,OAAO,YAAY;AACrB,WAAK;AACL,UAAI,OAAO,YAAY;AACrB,aAAK;AACL,YAAI,OAAO,YAAY;AACrB,eAAK;AACL,cAAI,OAAO,YAAY;AACrB,iBAAK;AACL,gBAAI,OAAO,YAAY;AACrB,mBAAK;AACL,kBAAI,OAAO,YAAY;AACrB,qBAAK;AACL,oBAAI,OAAO,YAAY;AACrB,uBAAK;AACL,sBAAI,OAAO,YAAY;AACrB,mCAAe;AACf,yBAAK,QAAQ,IAAI,IAAI,IAAI;AACzB,yBAAK;AAAA,yBACA;AACL,kCAAc;AACd,yBAAK;AAAA;AAAA,uBAEF;AACL,gCAAc;AACd,uBAAK;AAAA;AAAA,qBAEF;AACL,8BAAc;AACd,qBAAK;AAAA;AAAA,mBAEF;AACL,4BAAc;AACd,mBAAK;AAAA;AAAA,iBAEF;AACL,0BAAc;AACd,iBAAK;AAAA;AAAA,eAEF;AACL,wBAAc;AACd,eAAK;AAAA;AAAA,aAEF;AACL,sBAAc;AACd,aAAK;AAAA;AAAA,WAEF;AACL,oBAAc;AACd,WAAK;AAAA;AAGP,WAAO;AAAA;AAGT,0BAAwB,aAAa;AACnC,WAAO,YAAY,IAAI,CAAC,MAAM,IAAI;AAAA;AAGpC,oBAAkB,KAAK;AACrB,eAAW,YAAY,IAAI,OAAO;AAChC,YAAM,OAAO,IAAI,MAAM;AACvB,iBAAW,aAAa,IAAI,QAAQ;AAClC,cAAM,YAAY,KAAK;AACvB,cAAM,iBAAiB,UAAU;AACjC,cAAM,OAAO,UAAU;AACvB,cAAM,iBAAiB,IAAI,MAAM,eAAe;AAChD,iBAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,KAAK;AACpC,yBAAe,KAAK,eAAe,KAAK;AAAA;AAE1C,kBAAU,cAAc;AAAA;AAAA;AAG5B,WAAO;AAAA;AAGT,eAAa;AAEb,MAAI,eAAe,cAAc,gBAAgB,MAAM,QAAQ;AAC7D,WAAO;AAAA,SACF;AACL,QAAI,eAAe,cAAc,cAAc,MAAM,QAAQ;AAC3D,eAAS;AAAA;AAGX,UAAM,yBACJ,qBACA,iBAAiB,MAAM,SAAS,MAAM,OAAO,kBAAkB,MAC/D,iBAAiB,MAAM,SACnB,oBAAoB,gBAAgB,iBAAiB,KACrD,oBAAoB,gBAAgB;AAAA;AAAA;;;ACvrC9C,IAAM,4BAA8D;;;ACDpE,IAAM,QAAQ;AAKd,IAAI,aAAa;AACjB,qBAA6B;AAC3B,gBAAc;AACd,SAAO,QAAQ,WAAW;AAAA;AAI5B,IAAM,YAEF;AAAA,EACF,KAAK;AAAA,IACH,SAAS;AAAA,IACT,UAAU;AAAA,IACV,aAAa;AAAA,IACb,OAAO;AAAA,IACP,qBAAqB;AAAA,IACrB,UAAU;AAAA;AAAA,EAEZ,UAAU;AAAA,IACR,SAAS;AAAA,IACT,UAAU;AAAA,IACV,aAAa;AAAA,IACb,OAAO;AAAA,IACP,qBAAqB;AAAA,IACrB,UAAU;AAAA;AAAA,EAEZ,SAAS;AAAA,IACP,SAAS;AAAA,IACT,UAAU;AAAA,IACV,aAAa;AAAA,IACb,OAAO;AAAA,IACP,qBAAqB;AAAA,IACrB,UAAU;AAAA;AAAA,EAEZ,WAAW;AAAA,IACT,SAAS;AAAA,IACT,UAAU;AAAA,IACV,aAAa;AAAA,IACb,OAAO;AAAA,IACP,qBAAqB;AAAA,IACrB,UAAU;AAAA;AAAA;AAIP,8BAAwB;AAAA,EAM7B,YACS,mBACP,WACA,wBACA;AAHO;AAJD,0BAA6C;AAC7C,qBAAoD;AAO1D,QAAI,CAAC,WAAW;AACd,YAAM,IAAI,MACR,sCAAsC,kBAAkB;AAAA;AAI5D,SAAK,QAAQ;AAEb,SAAK,UAAU,SAAS,cAAc;AACtC,SAAK,QAAQ,UAAU,IAAI;AAE3B,SAAK,QAAQ,YAAY;AAEzB,UAAM,UAAU,KAAK,QAAQ,cAAc;AAC3C,QAAI,CAAC,SAAS;AACZ,YAAM,IAAI,MAAM;AAAA;AAElB,QAAI,UAAU,QAAQ,cAAc;AAClC,YAAM,IAAI,MAAM;AAAA;AAElB,YAAQ,MAAM,WAAW;AACzB,YAAQ,MAAM,YAAY;AAC1B,SAAK,eAAe,SAAS,gBAAgB,OAAO;AACpD,YAAQ,aAAa,KAAK,cAAc,QAAQ;AAEhD,eAAW,aAAa,kBAAkB,QAAQ;AAChD,YAAM,kBAAkB,kBAAkB,OAAO;AAEjD,eAAS,MAAM,GAAG,MAAM,gBAAgB,WAAW,OAAO;AACxD,iBACM,cAAc,GAClB,cAAc,gBAAgB,cAC9B,eACA;AACA,gBAAM,KAAK,KAAK,UAAU,WAAW,KAAK;AAC1C,gBAAM,OAAO,KAAK,YAAY;AAC9B,cAAI,gBAAwB,KAAK,MAAM;AAEvC,cAAI,wBAAwB;AAC1B,YAAC,OAAM;AAEL,oBAAM,IAAI,uBAAuB;AACjC,kBAAI,CAAC,GAAG;AACN;AAAA;AAEF,oBAAM,kBAAkB,EAAE;AAC1B,kBAAI,CAAC,iBAAiB;AACpB;AAAA;AAEF,oBAAM,kBAAkB,gBAAgB,OAAO;AAC/C,kBAAI,CAAC,iBAAiB;AACpB;AAAA;AAEF,oBAAM,oBAAoB,gBAAgB,SAAS;AACnD,kBAAI,CAAC,mBAAmB;AACtB;AAAA;AAEF,oBAAM,aACJ,OAAO,sBAAsB,WACzB,oBACA,mBAAmB;AACzB,oBAAM,WAAW,UAAU;AAC3B,kBAAI,UAAU;AACZ,gCAAgB,SAAS;AAAA;AAAA;AAAA,iBAGxB;AACL,4BAAgB,KAAK,MAAM;AAAA;AAE7B,eAAK,eAAe,MAAM;AAC1B,eAAK,UAAU,MAAM,KAAK,YAAY,IAAI;AAC1C,eAAK,aAAa,YAAY,KAAK,UAAU;AAC7C,eAAK,aAAa,SAAS,mBAAmB,KAAK,SAAS;AAAA;AAAA;AAAA;AAAA;AAAA,EAM7D,YACL,SACA,WACA,UACM;AACN,SAAK,KAAK,QAAQ,YAAY,QAAQ,OAAO,WAAW;AAAA;AAAA,EAInD,KACL,YACA,OACA,WACA,UACM;AACN,eAAW,aAAa,WAAW,QAAQ;AACzC,YAAM,kBAAkB,WAAW,OAAO;AAE1C,YAAM,gBAAgB,MAAM;AAC5B,YAAM,iBAAiB,YAAY,UAAU,aAAa;AAC1D,eAAS,MAAM,GAAG,MAAM,gBAAgB,WAAW,OAAO;AACxD,iBACM,cAAc,GAClB,cAAc,gBAAgB,cAC9B,eACA;AACA,gBAAM,KAAK,KAAK,UAAU,WAAW,KAAK;AAC1C,gBAAM,UAAU,KAAK,UACnB,WACA,cAAc,YAAY,MACzB,iBAAgB,eACf,cAAc,YAAY,OAC1B,eACA,gBAAgB;AAEpB,cAAI,cAAc;AAClB,cAAI,gBAAgB;AAClB,kBAAM,WAAW,KAAK,UACpB,WACA,eAAe,YAAY,MAC1B,iBAAgB,eACf,eAAe,YAAY,OAC3B,eACA,gBAAgB;AAEpB,gBAAI,YAAY,UAAU;AACxB,4BAAc;AAAA;AAEhB,uBAAW,YAAY;AACvB,kBAAM,wBACJ,MAAO,KAAI,WAAW,WAAY,KAAI,WAAW;AACnD,iBAAK,UAAU,IAAI,SAAS,GAAG,aAC7B,cACA,KAAK,eAAe;AAEtB,iBAAK,UAAU,IAAI,SAAS,GAAG,aAC7B,cACA,KAAK,eAAe;AAEtB,iBAAK,UAAU,IAAI,SAAS,GAAG,aAC7B,UACA,GAAG,KAAK,IAAI,wBAAwB,GAAG;AAEzC,iBAAK,UAAU,IAAI,SAAS,GAAG,aAC7B,UACA,GAAG,KAAK,IAAI,wBAAwB,GAAG;AAEzC,iBAAK,UAAU,IAAI,SAAS,GAAG,aAC7B,UACA,GAAG;AAEL,iBAAK,UAAU,IAAI,SAAS,GAAG,aAC7B,UACA,GAAG;AAEL,iBAAK,UAAU,IAAI,SAAS,GAAG,aAC7B,cACA,KAAK,eAAe;AAEtB,iBAAK,UAAU,IAAI,SAAS,GAAG,aAC7B,cACA,KAAK,eAAe;AAAA,iBAEjB;AACL,0BAAc;AAAA;AAEhB,cAAI,aAAa;AACf,iBAAK,UAAU,IAAI,SAAS,GAAG,aAC7B,cACA,KAAK,eAAe;AAEtB,iBAAK,UAAU,IAAI,SAAS,GAAG,aAC7B,cACA,KAAK,eAAe;AAEtB,iBAAK,UAAU,IAAI,SAAS,GAAG,aAAa,UAAU;AACtD,iBAAK,UAAU,IAAI,SAAS,GAAG,aAAa,UAAU;AACtD,iBAAK,UAAU,IAAI,SAAS,GAAG,aAAa,UAAU;AACtD,iBAAK,UAAU,IAAI,SAAS,GAAG,aAAa,UAAU;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EASxD,YAAY,IAAY,eAA2C;AACzE,UAAM,OAAO,SAAS,gBACpB,OACA;AAEF,SAAK,aAAa,MAAM,QAAQ,KAAK,SAAS;AAC9C,SAAK,aAAa,KAAK;AACvB,UAAM,WAAW;AAAA,MACf,EAAE,QAAQ,GAAG,OAAO;AAAA,MACpB,EAAE,QAAQ,GAAG,OAAO;AAAA,MACpB,EAAE,QAAQ,GAAG,OAAO;AAAA,MACpB,EAAE,QAAQ,GAAG,OAAO;AAAA,MACpB,EAAE,QAAQ,GAAG,OAAO;AAAA,MACpB,EAAE,QAAQ,KAAK,OAAO;AAAA;AAExB,eAAW,WAAW,UAAU;AAC9B,YAAM,OAAO,SAAS,gBAAgB,OAAO;AAC7C,WAAK,aAAa,UAAU,GAAG,QAAQ;AACvC,WAAK,aAAa,cAAc,QAAQ;AACxC,WAAK,aAAa,gBAAgB;AAClC,WAAK,YAAY;AAAA;AAEnB,WAAO;AAAA;AAAA,EAGD,UACN,WACA,KACA,aACQ;AACR,WAAO,YAAY,OAAO,MAAM,OAAO;AAAA;AAAA,EAGjC,YAAY,IAAyB;AAE3C,WAAO,KAAK,QAAQ,cAAc,MAAM;AAAA;AAAA;;;ACrRrC,IAAM,mBAAsC;AAAA,EACjD,MAAM;AAAA,EACN,QAAQ;AAAA,IACN,OAAO,EAAE,WAAW,IAAI,cAAc;AAAA,IACtC,SAAS,EAAE,WAAW,GAAG,cAAc;AAAA,IACvC,SAAS,EAAE,WAAW,GAAG,cAAc;AAAA;AAAA,EAEzC,aAAa;AAAA,IACX,OAAO;AAAA,MACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI;AAAA,MAChD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,IAEjD,SAAS;AAAA,MACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,MACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,IAErC,SAAS;AAAA,MACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,MAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,EAGjC,OAAO;AAAA,IACL,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI;AAAA,QAChD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI;AAAA,QACjD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG;AAAA,QACjD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI;AAAA,QACjD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI;AAAA,QAChD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAChD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG;AAAA,QACjD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI;AAAA,QAChD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG;AAAA,QACjD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI;AAAA,QAChD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG;AAAA,QAChD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI;AAAA,QAChD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI;AAAA,QACjD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI;AAAA,QACjD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI;AAAA,QAChD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAChD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG;AAAA,QACjD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA,IAGjC,GAAG;AAAA,MACD,OAAO;AAAA,QACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG;AAAA,QAChD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEjD,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErC,SAAS;AAAA,QACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,QAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAAA;AAAA;AAMrC,iBAAiB,MAAM,QAAQ,iBAAiB,MAAM;AACtD,iBAAiB,MAAM,QAAQ,iBAAiB,MAAM;AACtD,iBAAiB,MAAM,QAAQ,iBAAiB,MAAM;AACtD,iBAAiB,MAAM,QAAQ,iBAAiB,MAAM;AACtD,iBAAiB,MAAM,QAAQ,iBAAiB,MAAM;AACtD,iBAAiB,MAAM,QAAQ,iBAAiB,MAAM;AAEtD,iBAAiB,MAAM,QAAQ,iBAAiB,MAAM;AACtD,iBAAiB,MAAM,QAAQ,iBAAiB,MAAM;AACtD,iBAAiB,MAAM,QAAQ,iBAAiB,MAAM;AACtD,iBAAiB,MAAM,QAAQ;AAAA,EAC7B,OAAO;AAAA,IACL,aAAa,CAAC,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,IACjD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,EAEjD,SAAS;AAAA,IACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,IACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,EAErC,SAAS;AAAA,IACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,IAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAGjC,iBAAiB,MAAM,QAAQ;AAAA,EAC7B,OAAO;AAAA,IACL,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG;AAAA,IAChD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,EAEjD,SAAS;AAAA,IACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,IACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,EAErC,SAAS;AAAA,IACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,IAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;AAGjC,iBAAiB,MAAM,QAAQ;AAAA,EAC7B,OAAO;AAAA,IACL,aAAa,CAAC,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG;AAAA,IACjD,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,EAEjD,SAAS;AAAA,IACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,IACnC,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,EAErC,SAAS;AAAA,IACP,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA,IAC7B,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA;;;ACtU1B,mCACL,gBACA,SACS;AACT,QAAM,aAAa,2BAA0B;AAC7C,MAAI,QAAQ,yBAAyB;AACnC,WACE,kCACE,kBACA,SACA,YACA,iBAAI,gBAEN,kCACE,kBACA,WACA,YACA,iBAAI;AAAA,SAGH;AACL,WAAO,6BAA6B,kBAAK,YAAY,iBAAI;AAAA;AAAA;;;ACrBtD,8BAA8B,OAAyC;AAC5E,QAAM,OAAO,MAAM,WAAW,YAAY;AAC1C,QAAM,OAAO,MAAM,WAAW,YAAY;AAC1C,QAAM,iBAAiB,MAAM,WAAW,YAAY;AACpD,MAAI,OAAO;AACX,MAAI,OAAO,gBAAgB;AACzB;AAAA;AAEF,MAAI,OAAO,gBAAgB;AACzB;AAAA;AAEF,SAAO,CAAC,MAAM;AAAA;AAGhB,IAAM,yBAA6C,IAAI,MAAM,GAC1D,KAAK,GACL,IAAI,MAAM;AACT,SAAO,IAAI,MAAsB;AAAA;AAIrC;AACE,QAAM,qBAAqB,IAAI,QAAQ;AACvC,QAAM,QAAe,CAAC,IAAI,KAAK,KAAK,MAAM,MAAM,MAAM,IAAI,CAAC,MACzD,IAAI,WAAW;AAEjB,QAAM,OAAO,IAAI,IAAI;AACrB,aAAW,QAAQ,OAAO;AACxB,uBAAmB;AACnB,uBAAmB,SAAS;AAC5B,aAAS,IAAI,GAAG,IAAI,GAAG,KAAK;AAC1B,yBAAmB,SAAS;AAC5B,YAAM,CAAC,MAAM,QAAQ,qBAAqB,mBAAmB;AAC7D,6BAAuB,MAAM,QAAQ,qBACnC,kBACA,mBAAmB;AAAA;AAAA;AAAA;AAMpB,oCAAoC,GAAmC;AAC5E,QAAM,CAAC,MAAM,QAAQ,qBAAqB;AAC1C,QAAM,4BAA4B,uBAAuB,MAAM;AAC/D,SAAO,uBAAuB,kBAAK,GAAG;AAAA;AAIjC,wBACL,GACA,MACA,MACgB;AAChB,QAAM,4BAA4B,qBAChC,kBACA,uBAAuB,MAAM;AAE/B,SAAO,uBAAuB,kBAAK,GAAG;AAAA;;;AClDxC,IAAM,cAAc,CAAC,IAAI,IAAI,IAAI,IAAI,GAAG,GAAG,GAAG;AAe9C,kBAAkB,KAAuB;AACvC,MAAI,QAAQ;AACZ,aAAW,SAAS,KAAK;AACvB,aAAS;AAAA;AAEX,SAAO;AAAA;AAOT,qBAAqB,YAAsB,OAA8B;AACvE,QAAM,UAAU,IAAI,WAAW;AAC/B,MAAI,KAAK;AACT,MAAI,OAAO;AACX,MAAI,QAAQ;AACZ,QAAM,SAAmB;AACzB,aAAW,aAAa,YAAY;AAClC,WAAO,OAAO,WAAW;AACvB,cAAS,SAAS,IAAK,QAAQ;AAC/B,cAAQ;AAAA;AAEV,WAAO,KAAM,SAAU,OAAO,YAAgB,MAAK,aAAa;AAChE,YAAQ;AAAA;AAEV,SAAO;AAAA;AAIT,sBAAsB,YAAsB,QAA+B;AACzE,QAAM,QAAQ,IAAI,WAAW,KAAK,KAAK,SAAS,cAAc;AAC9D,MAAI,KAAK;AACT,MAAI,OAAO;AACX,MAAI,QAAQ;AACZ,WAAS,IAAI,GAAG,IAAI,WAAW,QAAQ,KAAK;AAC1C,YAAS,SAAS,WAAW,KAAM,OAAO;AAC1C,YAAQ,WAAW;AACnB,WAAO,QAAQ,GAAG;AAChB,YAAM,QAAQ,SAAU,OAAO;AAC/B,cAAQ;AAAA;AAAA;AAGZ,MAAI,OAAO,GAAG;AACZ,UAAM,QAAQ,SAAU,IAAI;AAAA;AAE9B,SAAO;AAAA;AAIT,mCAAmC,YAA4C;AAC7E,SAAO,WAAW,WAAW;AAAA;AAGxB,qCACL,OACuB;AACvB,QAAM,cAAc,2BAA2B;AAE/C,QAAM,QAAQ,iBAAiB,YAAY,SAAS;AACpD,QAAM,SAAS,mBAAmB,GAAG,YAAY,SAAS;AAC1D,QAAM,QAAQ,iBAAiB,YAAY,WAAW;AACtD,QAAM,SAAS,mBAAmB,GAAG,YAAY,WAAW;AAC5D,QAAM,CAAC,QAAQ,UAAU,qBAAqB;AAC9C,QAAM,YAAY;AAClB,QAAM,SAAS,mBAAmB,GAAG,YAAY,WAAW;AAE5D,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAIG,yCACL,YACkB;AAClB,QAAM,EAAE,OAAO,QAAQ,OAAO,QAAQ,QAAQ,QAAQ,WAAW,WAC/D;AAEF,SAAO,aAAa,aAAa;AAAA,IAC/B;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAIG,kCACL,OACkB;AAClB,QAAM,aAAoC,4BAA4B;AACtE,SAAO,gCAAgC;AAAA;AAGlC,yCACL,QACuB;AACvB,QAAM,CAAC,OAAO,QAAQ,OAAO,QAAQ,QAAQ,QAAQ,WAAW,UAC9D,YAAY,aAAa;AAE3B,SAAO;AAAA,IACL;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA,IACA;AAAA;AAAA;AAIG,qCACL,YACgB;AAChB,MAAI,WAAW,cAAc,GAAG;AAC9B,UAAM,IAAI,MAAM;AAAA;AAGlB,QAAM,cAAc;AAAA,IAClB,OAAO;AAAA,MACL,aAAa,iBAAiB,IAAI,WAAW;AAAA,MAC7C,aAAa,mBAAmB,GAAG,IAAI,WAAW;AAAA;AAAA,IAEpD,SAAS;AAAA,MACP,aAAa,iBAAiB,GAAG,WAAW;AAAA,MAC5C,aAAa,mBAAmB,GAAG,GAAG,WAAW;AAAA;AAAA,IAEnD,SAAS;AAAA,MACP,aAAa,oBAAoB;AAAA,MACjC,aAAa,mBAAmB,GAAG,GAAG,WAAW;AAAA;AAAA;AAIrD,MAAI,CAAC,0BAA0B,aAAa;AAC1C,WAAO;AAAA;AAGT,SAAO,eAAe,aAAa,WAAW,QAAQ,WAAW;AAAA;AAKnE,4BAA4B,YAA6C;AACvE,QAAM,SAAS;AACf,MAAI,WAAW,QAAQ,KAAK,WAAW,SAAS,WAAW;AACzD,WAAO,KAAK,UAAU,WAAW;AAAA;AAEnC,MAAI,WAAW,QAAQ,KAAK,WAAW,SAAS,OAAO;AACrD,WAAO,KAAK,UAAU,WAAW;AAAA;AAEnC,MAAI,WAAW,SAAS,KAAK,WAAW,UAAU,MAAM;AACtD,WAAO,KAAK,WAAW,WAAW;AAAA;AAEpC,MAAI,WAAW,SAAS,KAAK,WAAW,UAAU,GAAG;AAEnD,QAAI,0BAA0B,aAAa;AACzC,aAAO,KAAK,WAAW,WAAW;AAAA;AAAA;AAItC,MAAI,WAAW,SAAS,KAAK,WAAW,UAAU,MAAM;AACtD,WAAO,KAAK,WAAW,WAAW;AAAA;AAEpC,MAAI,WAAW,SAAS,KAAK,WAAW,UAAU,MAAM;AACtD,WAAO,KAAK,WAAW,WAAW;AAAA;AAEpC,MAAI,WAAW,SAAS,KAAK,WAAW,UAAU,GAAG;AACnD,WAAO,KAAK,WAAW,WAAW;AAAA;AAEpC,MAAI,WAAW,YAAY,KAAK,WAAW,aAAa,GAAG;AACzD,WAAO,KAAK,cAAc,WAAW;AAAA;AAEvC,SAAO;AAAA;AAGF,kCAAkC,OAAoC;AAC3E,QAAM,aAAa,gCAAgC;AACnD,QAAM,SAAS,mBAAmB;AAClC,MAAI,OAAO,WAAW,GAAG;AACvB,UAAM,IAAI,MAAM,oCAAoC,OAAO,KAAK;AAAA;AAElE,SAAO,4BAA4B;AAAA;;;AChO9B,2BAA2B,QAA6B;AAE7D,SACE,MAAM,UAAU,IAAI,KAAK,IAAI,WAAW,SAAS,CAAC,MAC/C,QAAO,EAAE,SAAS,KAAK,MAAM,KAEhC,KAAK;AAAA;AAGF,2BAA2B,KAAyB;AACzD,SAAO,IAAI,WAAW,IAAI,MAAM,KAAK,IAAI,CAAC,MAAM,SAAS,GAAG;AAAA;",
-  "names": []
-}

package/dist/esm/clock.kpuzzle.json-EKWRMHJM.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../src/cubing/puzzles/implementations/clock/clock.kpuzzle.json.ts"],
-  "sourcesContent": ["import type { KPuzzleDefinition } from \"../../../kpuzzle\";\n\nexport const clockKPuzzle: KPuzzleDefinition = {\n  name: \"Clock\",\n  orbits: {\n    DIALS: { numPieces: 18, orientations: 12 },\n    FACES: { numPieces: 18, orientations: 1 },\n    FRAME: { numPieces: 1, orientations: 2 },\n  },\n  startPieces: {\n    DIALS: {\n      permutation: [\n        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n      ],\n      orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n    },\n    FACES: {\n      permutation: [\n        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n      ],\n      orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n    },\n    FRAME: { permutation: [0], orientation: [0] },\n  },\n  moves: {\n    UR_PLUS_: {\n      DIALS: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 1, 1, 0, 1, 1, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FACES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FRAME: { permutation: [0], orientation: [0] },\n    },\n    DR_PLUS_: {\n      DIALS: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, -1, 0, 0],\n      },\n      FACES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FRAME: { permutation: [0], orientation: [0] },\n    },\n    DL_PLUS_: {\n      DIALS: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, -1],\n      },\n      FACES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FRAME: { permutation: [0], orientation: [0] },\n    },\n    UL_PLUS_: {\n      DIALS: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [1, 1, 0, 1, 1, 0, 0, 0, 0, 0, 0, -1, 0, 0, 0, 0, 0, 0],\n      },\n      FACES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FRAME: { permutation: [0], orientation: [0] },\n    },\n    U_PLUS_: {\n      DIALS: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [1, 1, 1, 1, 1, 1, 0, 0, 0, -1, 0, -1, 0, 0, 0, 0, 0, 0],\n      },\n      FACES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FRAME: { permutation: [0], orientation: [0] },\n    },\n    R_PLUS_: {\n      DIALS: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 1, 1, 0, 1, 1, 0, 1, 1, -1, 0, 0, 0, 0, 0, -1, 0, 0],\n      },\n      FACES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FRAME: { permutation: [0], orientation: [0] },\n    },\n    D_PLUS_: {\n      DIALS: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0, -1, 0, -1],\n      },\n      FACES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FRAME: { permutation: [0], orientation: [0] },\n    },\n    L_PLUS_: {\n      DIALS: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [1, 1, 0, 1, 1, 0, 1, 1, 0, 0, 0, -1, 0, 0, 0, 0, 0, -1],\n      },\n      FACES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FRAME: { permutation: [0], orientation: [0] },\n    },\n    ALL_PLUS_: {\n      DIALS: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [1, 1, 1, 1, 1, 1, 1, 1, 1, -1, 0, -1, 0, 0, 0, -1, 0, -1],\n      },\n      FACES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FRAME: { permutation: [0], orientation: [0] },\n    },\n    y2: {\n      DIALS: {\n        permutation: [\n          9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FACES: {\n        permutation: [\n          9, 10, 11, 12, 13, 14, 15, 16, 17, 0, 1, 2, 3, 4, 5, 6, 7, 8,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FRAME: { permutation: [0], orientation: [1] },\n    },\n    UL: {\n      // TODO: define \"pin up\" as something other than a normal move.\n      DIALS: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FACES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FRAME: { permutation: [0], orientation: [0] },\n    },\n    UR: {\n      // TODO: define \"pin up\" as something other than a normal move.\n      DIALS: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FACES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FRAME: { permutation: [0], orientation: [0] },\n    },\n    DL: {\n      // TODO: define \"pin up\" as something other than a normal move.\n      DIALS: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FACES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FRAME: { permutation: [0], orientation: [0] },\n    },\n    DR: {\n      // TODO: define \"pin up\" as something other than a normal move.\n      DIALS: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FACES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17,\n        ],\n        orientation: [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0],\n      },\n      FRAME: { permutation: [0], orientation: [0] },\n    },\n  },\n};\n"],
-  "mappings": ";;;AAEO,IAAM,eAAkC;AAAA,EAC7C,MAAM;AAAA,EACN,QAAQ;AAAA,IACN,OAAO,EAAE,WAAW,IAAI,cAAc;AAAA,IACtC,OAAO,EAAE,WAAW,IAAI,cAAc;AAAA,IACtC,OAAO,EAAE,WAAW,GAAG,cAAc;AAAA;AAAA,EAEvC,aAAa;AAAA,IACX,OAAO;AAAA,MACL,aAAa;AAAA,QACX;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA;AAAA,MAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,IAEnE,OAAO;AAAA,MACL,aAAa;AAAA,QACX;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA;AAAA,MAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,IAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA,EAE3C,OAAO;AAAA,IACL,UAAU;AAAA,MACR,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEpE,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA,IAE3C,UAAU;AAAA,MACR,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG;AAAA;AAAA,MAEpE,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA,IAE3C,UAAU;AAAA,MACR,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA,IAE3C,UAAU;AAAA,MACR,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEpE,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA,IAE3C,SAAS;AAAA,MACP,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAErE,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA,IAE3C,SAAS;AAAA,MACP,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG;AAAA;AAAA,MAErE,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA,IAE3C,SAAS;AAAA,MACP,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG;AAAA;AAAA,MAEpE,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA,IAE3C,SAAS;AAAA,MACP,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEpE,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA,IAE3C,WAAW;AAAA,MACT,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,IAAI,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG;AAAA;AAAA,MAEtE,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA,IAE3C,IAAI;AAAA,MACF,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA;AAAA,QAE7D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA;AAAA,QAE7D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA,IAE3C,IAAI;AAAA,MAEF,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA,IAE3C,IAAI;AAAA,MAEF,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA,IAE3C,IAAI;AAAA,MAEF,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA,IAE3C,IAAI;AAAA,MAEF,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO;AAAA,QACL,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAE5D,aAAa,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG,GAAG;AAAA;AAAA,MAEnE,OAAO,EAAE,aAAa,CAAC,IAAI,aAAa,CAAC;AAAA;AAAA;AAAA;",
-  "names": []
-}

package/dist/esm/index.d.ts

@@ -1 +0,0 @@
-export * from "../types";

package/dist/esm/node-WEHVBEKP.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../src/cubing/search/vendor/comlink-everywhere/outside/node.js"],
-  "sourcesContent": ["async function getImports() {\n  return {\n    NodeWorker: (await import(\"worker_threads\")).Worker,\n    nodeEndpoint: (await import(\"comlink/dist/esm/node-adapter.mjs\")).default,\n  };\n}\n\nfunction construct(imports, url, nodeOptions) {\n  const worker = new imports.NodeWorker(url, nodeOptions);\n  // Avoid holding up the entire program exit if only workers are running.\n  // https://nodejs.org/api/worker_threads.html#worker_threads_broadcastchannel_unref\n  worker.unref();\n  const wrappedWorker = imports.nodeEndpoint(worker);\n  return wrappedWorker;\n}\n\nlet cachedNodeWorkerWrapper = null;\nexport async function NodeWorkerWrapper() {\n  const imports = await getImports();\n  return (\n    cachedNodeWorkerWrapper ||\n    (cachedNodeWorkerWrapper = class {\n      constructor(url, _options) {\n        return construct(imports, url);\n      }\n    })\n  );\n}\n\nlet cachedNodeWorkerStringWrapper = null;\nexport async function NodeWorkerStringWrapper() {\n  const imports = await getImports();\n  return (\n    cachedNodeWorkerStringWrapper ||\n    (cachedNodeWorkerStringWrapper = class {\n      constructor(url, _options) {\n        return construct(imports, url, { eval: true });\n      }\n    })\n  );\n}\n"],
-  "mappings": ";;;AAAA,4BAA4B;AAC1B,SAAO;AAAA,IACL,YAAa,OAAM,OAAO,mBAAmB;AAAA,IAC7C,cAAe,OAAM,OAAO,sCAAsC;AAAA;AAAA;AAItE,mBAAmB,SAAS,KAAK,aAAa;AAC5C,QAAM,SAAS,IAAI,QAAQ,WAAW,KAAK;AAG3C,SAAO;AACP,QAAM,gBAAgB,QAAQ,aAAa;AAC3C,SAAO;AAAA;AAGT,IAAI,0BAA0B;AAC9B,mCAA0C;AACxC,QAAM,UAAU,MAAM;AACtB,SACE,2BACC,2BAA0B,MAAM;AAAA,IAC/B,YAAY,KAAK,UAAU;AACzB,aAAO,UAAU,SAAS;AAAA;AAAA;AAAA;AAMlC,IAAI,gCAAgC;AACpC,yCAAgD;AAC9C,QAAM,UAAU,MAAM;AACtB,SACE,iCACC,iCAAgC,MAAM;AAAA,IACrC,YAAY,KAAK,UAAU;AACzB,aAAO,UAAU,SAAS,KAAK,EAAE,MAAM;AAAA;AAAA;AAAA;",
-  "names": []
-}

package/dist/esm/sq1-hyperorbit.kpuzzle.json-N3FGCPML.js.map

@@ -1,7 +0,0 @@
-{
-  "version": 3,
-  "sources": ["../../src/cubing/puzzles/implementations/square1/sq1-hyperorbit.kpuzzle.json.ts"],
-  "sourcesContent": ["import type { KPuzzleDefinition } from \"../../../kpuzzle\";\n\nexport const sq1HyperOrbitKPuzzle: KPuzzleDefinition = {\n  name: \"Square-1\",\n  orbits: {\n    WEDGES: { numPieces: 24, orientations: 9 },\n    EQUATOR: { numPieces: 2, orientations: 6 },\n  },\n  startPieces: {\n    WEDGES: {\n      permutation: [\n        0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19,\n        20, 21, 22, 23,\n      ],\n      orientation: [\n        0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n      ],\n    },\n    EQUATOR: { permutation: [0, 1], orientation: [0, 0] },\n  },\n  moves: {\n    U_SQ_: {\n      WEDGES: {\n        permutation: [\n          11, 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 12, 13, 14, 15, 16, 17, 18, 19,\n          20, 21, 22, 23,\n        ],\n        orientation: [\n          0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n          0,\n        ],\n      },\n      EQUATOR: { permutation: [0, 1], orientation: [0, 0] },\n    },\n    D_SQ_: {\n      WEDGES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 23, 12, 13, 14, 15, 16, 17, 18,\n          19, 20, 21, 22,\n        ],\n        orientation: [\n          0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n          0,\n        ],\n      },\n      EQUATOR: { permutation: [0, 1], orientation: [0, 0] },\n    },\n    _SLASH_: {\n      WEDGES: {\n        permutation: [\n          0, 1, 2, 3, 4, 5, 12, 13, 14, 15, 16, 17, 6, 7, 8, 9, 10, 11, 18, 19,\n          20, 21, 22, 23,\n        ],\n        orientation: [\n          0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,\n          0,\n        ],\n      },\n      EQUATOR: { permutation: [0, 1], orientation: [0, 3] },\n    },\n  },\n};\n"],
-  "mappings": ";;;AAEO,IAAM,uBAA0C;AAAA,EACrD,MAAM;AAAA,EACN,QAAQ;AAAA,IACN,QAAQ,EAAE,WAAW,IAAI,cAAc;AAAA,IACvC,SAAS,EAAE,WAAW,GAAG,cAAc;AAAA;AAAA,EAEzC,aAAa;AAAA,IACX,QAAQ;AAAA,MACN,aAAa;AAAA,QACX;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA,QAClE;AAAA,QAAI;AAAA,QAAI;AAAA,QAAI;AAAA;AAAA,MAEd,aAAa;AAAA,QACX;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA,QAAG;AAAA;AAAA;AAAA,IAGzE,SAAS,EAAE,aAAa,CAAC,GAAG,IAAI,aAAa,CAAC,GAAG;AAAA;AAAA,EAEnD,OAAO;AAAA,IACL,OAAO;AAAA,MACL,QAAQ;AAAA,QACN,aAAa;AAAA,UACX;AAAA,UAAI;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAClE;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAEd,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAClE;AAAA;AAAA;AAAA,MAGJ,SAAS,EAAE,aAAa,CAAC,GAAG,IAAI,aAAa,CAAC,GAAG;AAAA;AAAA,IAEnD,OAAO;AAAA,MACL,QAAQ;AAAA,QACN,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAClE;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAEd,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAClE;AAAA;AAAA;AAAA,MAGJ,SAAS,EAAE,aAAa,CAAC,GAAG,IAAI,aAAa,CAAC,GAAG;AAAA;AAAA,IAEnD,SAAS;AAAA,MACP,QAAQ;AAAA,QACN,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA,UAClE;AAAA,UAAI;AAAA,UAAI;AAAA,UAAI;AAAA;AAAA,QAEd,aAAa;AAAA,UACX;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAAG;AAAA,UAClE;AAAA;AAAA;AAAA,MAGJ,SAAS,EAAE,aAAa,CAAC,GAAG,IAAI,aAAa,CAAC,GAAG;AAAA;AAAA;AAAA;",
-  "names": []
-}