@zkmake/three-audit 0.3.2 → 0.4.0

package/dist/{load-nqfCU3-k.js.map → load-D4bV0-2t.js.map}

@@ -1 +1 @@
-{"version":3,"file":"load-nqfCU3-k.js","names":[],"sources":["../src/node/draco.ts","../src/node/load.ts"],"sourcesContent":["/**\n * Draco for `GLTFLoader` in Node. three's `DRACOLoader` decodes in Web Workers, which Node lacks;\n * this is its decode run in-process on `draco3dgltf` (Google's Node build of the decoder),\n * shaped like the two methods `GLTFLoader` calls on it.\n */\nimport {\n  BufferAttribute,\n  BufferGeometry,\n  InterleavedBuffer,\n  InterleavedBufferAttribute,\n} from \"three\";\n\ntype TypedArray =\n  | Float32Array\n  | Int8Array\n  | Int16Array\n  | Int32Array\n  | Uint8Array\n  | Uint16Array\n  | Uint32Array;\ntype TypedArrayConstructor = {\n  new (length: number): TypedArray;\n  new (buffer: ArrayBufferLike, offset: number, length: number): TypedArray;\n  BYTES_PER_ELEMENT: number;\n};\n\n/* The slice of the emscripten module this uses. */\ntype DracoAttribute = { num_components(): number };\ntype DracoMesh = { num_faces(): number; num_points(): number; ptr: number };\ntype DracoDecoder = {\n  GetEncodedGeometryType(array: Int8Array): number;\n  DecodeArrayToMesh(\n    array: Int8Array,\n    length: number,\n    mesh: DracoMesh,\n  ): { ok(): boolean; error_msg(): string };\n  GetAttributeByUniqueId(mesh: DracoMesh, id: number): DracoAttribute;\n  GetAttributeDataArrayForAllPoints(\n    mesh: DracoMesh,\n    attribute: DracoAttribute,\n    type: number,\n    byteLength: number,\n    pointer: number,\n  ): boolean;\n  GetTrianglesUInt32Array(mesh: DracoMesh, byteLength: number, pointer: number): boolean;\n};\ntype DracoModule = {\n  Decoder: new () => DracoDecoder;\n  Mesh: new () => DracoMesh;\n  TRIANGULAR_MESH: number;\n  HEAPF32: Float32Array;\n  _malloc(bytes: number): number;\n  _free(pointer: number): void;\n  destroy(object: unknown): void;\n  [type: `DT_${string}`]: number;\n};\n\nconst DATA_TYPES: Record<string, string> = {\n  Float32Array: \"DT_FLOAT32\",\n  Int8Array: \"DT_INT8\",\n  Int16Array: \"DT_INT16\",\n  Int32Array: \"DT_INT32\",\n  Uint8Array: \"DT_UINT8\",\n  Uint16Array: \"DT_UINT16\",\n  Uint32Array: \"DT_UINT32\",\n};\n\nconst decodeAttribute = (\n  draco: DracoModule,\n  decoder: DracoDecoder,\n  mesh: DracoMesh,\n  attribute: DracoAttribute,\n  ArrayType: TypedArrayConstructor,\n) => {\n  const count = mesh.num_points();\n  const itemSize = attribute.num_components();\n  // glTF aligns every vertex to 4 bytes; a narrower one is read interleaved.\n  const srcBytes = itemSize * ArrayType.BYTES_PER_ELEMENT;\n  const stride = (Math.ceil(srcBytes / 4) * 4) / ArrayType.BYTES_PER_ELEMENT;\n  const byteLength = count * srcBytes;\n  const pointer = draco._malloc(byteLength);\n\n  decoder.GetAttributeDataArrayForAllPoints(\n    mesh,\n    attribute,\n    draco[DATA_TYPES[ArrayType.name] as `DT_${string}`]!,\n    byteLength,\n    pointer,\n  );\n\n  const source = new ArrayType(\n    draco.HEAPF32.buffer,\n    pointer,\n    byteLength / ArrayType.BYTES_PER_ELEMENT,\n  );\n  let array: TypedArray;\n\n  if (stride === itemSize) {\n    array = source.slice();\n  } else {\n    array = new ArrayType(count * stride);\n\n    for (let i = 0; i < count; i += 1) {\n      for (let k = 0; k < itemSize; k += 1) {\n        array[i * stride + k] = source[i * itemSize + k]!;\n      }\n    }\n  }\n\n  draco._free(pointer);\n\n  return stride === itemSize\n    ? new BufferAttribute(array, itemSize)\n    : new InterleavedBufferAttribute(new InterleavedBuffer(array, stride), itemSize, 0);\n};\n\nconst decode = (\n  draco: DracoModule,\n  buffer: ArrayBuffer,\n  attributeIds: Record<string, number>,\n  attributeTypes: Record<string, string>,\n) => {\n  const decoder = new draco.Decoder();\n  const array = new Int8Array(buffer);\n\n  if (decoder.GetEncodedGeometryType(array) !== draco.TRIANGULAR_MESH) {\n    draco.destroy(decoder);\n    throw new Error(\"three-audit: Draco point clouds aren't supported\");\n  }\n\n  const mesh = new draco.Mesh();\n  const status = decoder.DecodeArrayToMesh(array, array.byteLength, mesh);\n\n  if (!status.ok() || mesh.ptr === 0) {\n    draco.destroy(mesh);\n    draco.destroy(decoder);\n    throw new Error(`three-audit: Draco decoding failed: ${status.error_msg()}`);\n  }\n\n  const geometry = new BufferGeometry();\n\n  for (const [name, id] of Object.entries(attributeIds)) {\n    const ArrayType = (globalThis as unknown as Record<string, TypedArrayConstructor>)[\n      attributeTypes[name] ?? \"Float32Array\"\n    ]!;\n\n    geometry.setAttribute(\n      name,\n      decodeAttribute(draco, decoder, mesh, decoder.GetAttributeByUniqueId(mesh, id), ArrayType),\n    );\n  }\n\n  const indices = mesh.num_faces() * 3;\n  const pointer = draco._malloc(indices * 4);\n\n  decoder.GetTrianglesUInt32Array(mesh, indices * 4, pointer);\n  geometry.setIndex(\n    new BufferAttribute(new Uint32Array(draco.HEAPF32.buffer, pointer, indices).slice(), 1),\n  );\n  draco._free(pointer);\n  draco.destroy(mesh);\n  draco.destroy(decoder);\n\n  return geometry;\n};\n\n/** Stands in for `DRACOLoader` in `gltfLoader.setDRACOLoader(...)`. Needs `draco3dgltf`. */\nexport const createNodeDracoLoader = async () => {\n  let module: { createDecoderModule(options: object): Promise<DracoModule> };\n\n  try {\n    module = ((await import(\"draco3dgltf\")) as { default: typeof module }).default;\n  } catch {\n    throw new Error(\n      \"three-audit: this model is Draco-compressed; install draco3dgltf to read it (npm i -D draco3dgltf)\",\n    );\n  }\n\n  const draco = await module.createDecoderModule({});\n\n  return {\n    preload() {\n      return this;\n    },\n    decodeDracoFile(\n      buffer: ArrayBuffer,\n      callback: (geometry: BufferGeometry) => void,\n      attributeIds: Record<string, number>,\n      attributeTypes: Record<string, string>,\n      _colorSpace?: string,\n      onError: (error: unknown) => void = () => {},\n    ) {\n      try {\n        callback(decode(draco, buffer, attributeIds, attributeTypes));\n      } catch (error) {\n        onError(error);\n      }\n    },\n  };\n};\n","/**\n * Load a glTF model in Node for the checks: `.glb`, or `.gltf` with its buffers beside it.\n *\n * Textures are stripped before parsing: no check reads them, and decoding images needs a DOM.\n * Draco (`draco3dgltf`) and Meshopt (`meshoptimizer`) compressed geometry decode when those\n * packages are installed.\n */\nimport { readFile } from \"node:fs/promises\";\nimport { dirname, resolve } from \"node:path\";\nimport type { Group } from \"three\";\nimport { GLTFLoader } from \"three/addons/loaders/GLTFLoader.js\";\n\nimport { createNodeDracoLoader } from \"./draco.ts\";\n\ntype Json = Record<string, unknown>;\n\nconst GLB_MAGIC = 0x46546c67;\nconst JSON_CHUNK = 0x4e4f534a;\nconst BIN_CHUNK = 0x004e4942;\nconst TEXTURE_EXTENSIONS = [\n  \"KHR_texture_basisu\",\n  \"KHR_texture_transform\",\n  \"EXT_texture_webp\",\n  \"EXT_texture_avif\",\n];\n\n/** Every `…Texture` reference in a material, extensions included. */\nconst dropTextureRefs = (value: unknown) => {\n  if (value === null || typeof value !== \"object\") {\n    return;\n  }\n\n  for (const [key, child] of Object.entries(value)) {\n    if (\n      key.endsWith(\"Texture\") &&\n      child !== null &&\n      typeof child === \"object\" &&\n      \"index\" in child\n    ) {\n      delete (value as Json)[key];\n    } else {\n      dropTextureRefs(child);\n    }\n  }\n};\n\nconst stripTextures = (json: Json) => {\n  delete json.images;\n  delete json.textures;\n  delete json.samplers;\n  dropTextureRefs(json.materials);\n\n  for (const key of [\"extensionsUsed\", \"extensionsRequired\"]) {\n    if (Array.isArray(json[key])) {\n      json[key] = (json[key] as string[]).filter((name) => !TEXTURE_EXTENSIONS.includes(name));\n    }\n  }\n};\n\nconst uses = (json: Json, extension: string) =>\n  Array.isArray(json.extensionsUsed) && (json.extensionsUsed as string[]).includes(extension);\n\n/** Split a GLB into its JSON and binary chunks. */\nconst readGlb = (bytes: Uint8Array) => {\n  const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n  let json: Json | null = null;\n  let bin: Uint8Array | null = null;\n\n  for (let offset = 12; offset < bytes.byteLength;) {\n    const length = view.getUint32(offset, true);\n    const type = view.getUint32(offset + 4, true);\n    const chunk = bytes.subarray(offset + 8, offset + 8 + length);\n\n    if (type === JSON_CHUNK) {\n      json = JSON.parse(new TextDecoder().decode(chunk)) as Json;\n    } else if (type === BIN_CHUNK) {\n      bin = chunk;\n    }\n\n    offset += 8 + length;\n  }\n\n  if (!json) {\n    throw new Error(\"three-audit: GLB has no JSON chunk\");\n  }\n\n  return { json, bin };\n};\n\n/** A GLB from JSON and an optional binary chunk, each padded to four bytes. */\nconst writeGlb = (json: Json, bin: Uint8Array | null) => {\n  const text = new TextEncoder().encode(JSON.stringify(json));\n  const jsonLength = Math.ceil(text.byteLength / 4) * 4;\n  const binLength = bin ? Math.ceil(bin.byteLength / 4) * 4 : 0;\n  const total = 12 + 8 + jsonLength + (bin ? 8 + binLength : 0);\n  const out = new Uint8Array(total);\n  const view = new DataView(out.buffer);\n\n  view.setUint32(0, GLB_MAGIC, true);\n  view.setUint32(4, 2, true);\n  view.setUint32(8, total, true);\n  view.setUint32(12, jsonLength, true);\n  view.setUint32(16, JSON_CHUNK, true);\n  out.fill(0x20, 20, 20 + jsonLength);\n  out.set(text, 20);\n\n  if (bin) {\n    view.setUint32(20 + jsonLength, binLength, true);\n    view.setUint32(24 + jsonLength, BIN_CHUNK, true);\n    out.set(bin, 28 + jsonLength);\n  }\n\n  return out.buffer;\n};\n\n/** A buffer's bytes: the GLB's binary chunk, a data URI, or a file beside the model. */\nconst bufferBytes = async (\n  buffer: { uri?: string },\n  index: number,\n  bin: Uint8Array | null,\n  directory: string,\n) => {\n  if (buffer.uri === undefined) {\n    if (index !== 0 || !bin) {\n      throw new Error(\"three-audit: a buffer without a uri must be the GLB's binary chunk\");\n    }\n\n    return bin;\n  }\n\n  if (buffer.uri.startsWith(\"data:\")) {\n    return new Uint8Array(Buffer.from(buffer.uri.slice(buffer.uri.indexOf(\",\") + 1), \"base64\"));\n  }\n\n  return new Uint8Array(await readFile(resolve(directory, decodeURIComponent(buffer.uri))));\n};\n\n/**\n * Every buffer folded into one binary chunk, the buffer views re-pointed into it. The result is a\n * self-contained GLB, so the loader never fetches: three's `FileLoader` needs browser globals.\n */\nconst packBuffers = async (json: Json, bin: Uint8Array | null, directory: string) => {\n  const buffers = (json.buffers ?? []) as { uri?: string }[];\n  const parts = await Promise.all(\n    buffers.map((buffer, i) => bufferBytes(buffer, i, bin, directory)),\n  );\n  const offsets: number[] = [];\n  let total = 0;\n\n  for (const part of parts) {\n    offsets.push(total);\n    total += Math.ceil(part.byteLength / 4) * 4;\n  }\n\n  const packed = new Uint8Array(total);\n\n  parts.forEach((part, i) => packed.set(part, offsets[i]));\n\n  for (const view of (json.bufferViews ?? []) as { buffer: number; byteOffset?: number }[]) {\n    view.byteOffset = (view.byteOffset ?? 0) + offsets[view.buffer]!;\n    view.buffer = 0;\n  }\n\n  json.buffers = parts.length > 0 ? [{ byteLength: total }] : [];\n\n  return parts.length > 0 ? packed : null;\n};\n\n/** Parse glTF bytes (GLB or JSON) into a three scene, textures stripped. */\nexport const parseModel = async (bytes: Uint8Array, directory = \".\"): Promise<Group> => {\n  const isGlb =\n    bytes.byteLength >= 12 &&\n    new DataView(bytes.buffer, bytes.byteOffset).getUint32(0, true) === GLB_MAGIC;\n  const { json, bin } = isGlb\n    ? readGlb(bytes)\n    : { json: JSON.parse(new TextDecoder().decode(bytes)) as Json, bin: null };\n\n  stripTextures(json);\n\n  const data = writeGlb(json, await packBuffers(json, bin, directory));\n  const loader = new GLTFLoader();\n\n  if (uses(json, \"KHR_draco_mesh_compression\")) {\n    loader.setDRACOLoader((await createNodeDracoLoader()) as never);\n  }\n\n  if (uses(json, \"EXT_meshopt_compression\") || uses(json, \"KHR_meshopt_compression\")) {\n    try {\n      const { MeshoptDecoder } = await import(\"meshoptimizer\");\n\n      await MeshoptDecoder.ready;\n      loader.setMeshoptDecoder(MeshoptDecoder);\n    } catch {\n      throw new Error(\n        \"three-audit: this model is Meshopt-compressed; install meshoptimizer to read it (npm i -D meshoptimizer)\",\n      );\n    }\n  }\n\n  const gltf = await loader.parseAsync(data, \"\");\n\n  return gltf.scene;\n};\n\n/** Read and parse a `.glb` or `.gltf` file into a three scene, ready for the checks. */\nexport const loadModel = async (path: string): Promise<Group> =>\n  parseModel(await readFile(path), dirname(path));\n"],"mappings":";;;;;;;;;;AAyDA,MAAM,aAAqC;CACzC,cAAc;CACd,WAAW;CACX,YAAY;CACZ,YAAY;CACZ,YAAY;CACZ,aAAa;CACb,aAAa;AACf;AAEA,MAAM,mBACJ,OACA,SACA,MACA,WACA,cACG;CACH,MAAM,QAAQ,KAAK,WAAW;CAC9B,MAAM,WAAW,UAAU,eAAe;CAE1C,MAAM,WAAW,WAAW,UAAU;CACtC,MAAM,SAAU,KAAK,KAAK,WAAW,CAAC,IAAI,IAAK,UAAU;CACzD,MAAM,aAAa,QAAQ;CAC3B,MAAM,UAAU,MAAM,QAAQ,UAAU;CAExC,QAAQ,kCACN,MACA,WACA,MAAM,WAAW,UAAU,QAC3B,YACA,OACF;CAEA,MAAM,SAAS,IAAI,UACjB,MAAM,QAAQ,QACd,SACA,aAAa,UAAU,iBACzB;CACA,IAAI;CAEJ,IAAI,WAAW,UACb,QAAQ,OAAO,MAAM;MAChB;EACL,QAAQ,IAAI,UAAU,QAAQ,MAAM;EAEpC,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,GAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,KAAK,GACjC,MAAM,IAAI,SAAS,KAAK,OAAO,IAAI,WAAW;CAGpD;CAEA,MAAM,MAAM,OAAO;CAEnB,OAAO,WAAW,WACd,IAAI,gBAAgB,OAAO,QAAQ,IACnC,IAAI,2BAA2B,IAAI,kBAAkB,OAAO,MAAM,GAAG,UAAU,CAAC;AACtF;AAEA,MAAM,UACJ,OACA,QACA,cACA,mBACG;CACH,MAAM,UAAU,IAAI,MAAM,QAAQ;CAClC,MAAM,QAAQ,IAAI,UAAU,MAAM;CAElC,IAAI,QAAQ,uBAAuB,KAAK,MAAM,MAAM,iBAAiB;EACnE,MAAM,QAAQ,OAAO;EACrB,MAAM,IAAI,MAAM,kDAAkD;CACpE;CAEA,MAAM,OAAO,IAAI,MAAM,KAAK;CAC5B,MAAM,SAAS,QAAQ,kBAAkB,OAAO,MAAM,YAAY,IAAI;CAEtE,IAAI,CAAC,OAAO,GAAG,KAAK,KAAK,QAAQ,GAAG;EAClC,MAAM,QAAQ,IAAI;EAClB,MAAM,QAAQ,OAAO;EACrB,MAAM,IAAI,MAAM,uCAAuC,OAAO,UAAU,GAAG;CAC7E;CAEA,MAAM,WAAW,IAAI,eAAe;CAEpC,KAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,YAAY,GAAG;EACrD,MAAM,YAAa,WACjB,eAAe,SAAS;EAG1B,SAAS,aACP,MACA,gBAAgB,OAAO,SAAS,MAAM,QAAQ,uBAAuB,MAAM,EAAE,GAAG,SAAS,CAC3F;CACF;CAEA,MAAM,UAAU,KAAK,UAAU,IAAI;CACnC,MAAM,UAAU,MAAM,QAAQ,UAAU,CAAC;CAEzC,QAAQ,wBAAwB,MAAM,UAAU,GAAG,OAAO;CAC1D,SAAS,SACP,IAAI,gBAAgB,IAAI,YAAY,MAAM,QAAQ,QAAQ,SAAS,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CACxF;CACA,MAAM,MAAM,OAAO;CACnB,MAAM,QAAQ,IAAI;CAClB,MAAM,QAAQ,OAAO;CAErB,OAAO;AACT;;AAGA,MAAa,wBAAwB,YAAY;CAC/C,IAAI;CAEJ,IAAI;EACF,UAAW,MAAM,OAAO,eAAA,CAA+C;CACzE,QAAQ;EACN,MAAM,IAAI,MACR,oGACF;CACF;CAEA,MAAM,QAAQ,MAAM,OAAO,oBAAoB,CAAC,CAAC;CAEjD,OAAO;EACL,UAAU;GACR,OAAO;EACT;EACA,gBACE,QACA,UACA,cACA,gBACA,aACA,gBAA0C,CAAC,GAC3C;GACA,IAAI;IACF,SAAS,OAAO,OAAO,QAAQ,cAAc,cAAc,CAAC;GAC9D,SAAS,OAAO;IACd,QAAQ,KAAK;GACf;EACF;CACF;AACF;;;;;;;;;;ACvLA,MAAM,YAAY;AAClB,MAAM,aAAa;AACnB,MAAM,YAAY;AAClB,MAAM,qBAAqB;CACzB;CACA;CACA;CACA;AACF;;AAGA,MAAM,mBAAmB,UAAmB;CAC1C,IAAI,UAAU,QAAQ,OAAO,UAAU,UACrC;CAGF,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAC7C,IACE,IAAI,SAAS,SAAS,KACtB,UAAU,QACV,OAAO,UAAU,YACjB,WAAW,OAEX,OAAQ,MAAe;MAEvB,gBAAgB,KAAK;AAG3B;AAEA,MAAM,iBAAiB,SAAe;CACpC,OAAO,KAAK;CACZ,OAAO,KAAK;CACZ,OAAO,KAAK;CACZ,gBAAgB,KAAK,SAAS;CAE9B,KAAK,MAAM,OAAO,CAAC,kBAAkB,oBAAoB,GACvD,IAAI,MAAM,QAAQ,KAAK,IAAI,GACzB,KAAK,OAAQ,KAAK,IAAI,CAAc,QAAQ,SAAS,CAAC,mBAAmB,SAAS,IAAI,CAAC;AAG7F;AAEA,MAAM,QAAQ,MAAY,cACxB,MAAM,QAAQ,KAAK,cAAc,KAAM,KAAK,eAA4B,SAAS,SAAS;;AAG5F,MAAM,WAAW,UAAsB;CACrC,MAAM,OAAO,IAAI,SAAS,MAAM,QAAQ,MAAM,YAAY,MAAM,UAAU;CAC1E,IAAI,OAAoB;CACxB,IAAI,MAAyB;CAE7B,KAAK,IAAI,SAAS,IAAI,SAAS,MAAM,aAAa;EAChD,MAAM,SAAS,KAAK,UAAU,QAAQ,IAAI;EAC1C,MAAM,OAAO,KAAK,UAAU,SAAS,GAAG,IAAI;EAC5C,MAAM,QAAQ,MAAM,SAAS,SAAS,GAAG,SAAS,IAAI,MAAM;EAE5D,IAAI,SAAS,YACX,OAAO,KAAK,MAAM,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CAAC;OAC5C,IAAI,SAAS,WAClB,MAAM;EAGR,UAAU,IAAI;CAChB;CAEA,IAAI,CAAC,MACH,MAAM,IAAI,MAAM,oCAAoC;CAGtD,OAAO;EAAE;EAAM;CAAI;AACrB;;AAGA,MAAM,YAAY,MAAY,QAA2B;CACvD,MAAM,OAAO,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,UAAU,IAAI,CAAC;CAC1D,MAAM,aAAa,KAAK,KAAK,KAAK,aAAa,CAAC,IAAI;CACpD,MAAM,YAAY,MAAM,KAAK,KAAK,IAAI,aAAa,CAAC,IAAI,IAAI;CAC5D,MAAM,QAAQ,KAAS,cAAc,MAAM,IAAI,YAAY;CAC3D,MAAM,MAAM,IAAI,WAAW,KAAK;CAChC,MAAM,OAAO,IAAI,SAAS,IAAI,MAAM;CAEpC,KAAK,UAAU,GAAG,WAAW,IAAI;CACjC,KAAK,UAAU,GAAG,GAAG,IAAI;CACzB,KAAK,UAAU,GAAG,OAAO,IAAI;CAC7B,KAAK,UAAU,IAAI,YAAY,IAAI;CACnC,KAAK,UAAU,IAAI,YAAY,IAAI;CACnC,IAAI,KAAK,IAAM,IAAI,KAAK,UAAU;CAClC,IAAI,IAAI,MAAM,EAAE;CAEhB,IAAI,KAAK;EACP,KAAK,UAAU,KAAK,YAAY,WAAW,IAAI;EAC/C,KAAK,UAAU,KAAK,YAAY,WAAW,IAAI;EAC/C,IAAI,IAAI,KAAK,KAAK,UAAU;CAC9B;CAEA,OAAO,IAAI;AACb;;AAGA,MAAM,cAAc,OAClB,QACA,OACA,KACA,cACG;CACH,IAAI,OAAO,QAAQ,KAAA,GAAW;EAC5B,IAAI,UAAU,KAAK,CAAC,KAClB,MAAM,IAAI,MAAM,oEAAoE;EAGtF,OAAO;CACT;CAEA,IAAI,OAAO,IAAI,WAAW,OAAO,GAC/B,OAAO,IAAI,WAAW,OAAO,KAAK,OAAO,IAAI,MAAM,OAAO,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,QAAQ,CAAC;CAG5F,OAAO,IAAI,WAAW,MAAM,SAAS,QAAQ,WAAW,mBAAmB,OAAO,GAAG,CAAC,CAAC,CAAC;AAC1F;;;;;AAMA,MAAM,cAAc,OAAO,MAAY,KAAwB,cAAsB;CACnF,MAAM,UAAW,KAAK,WAAW,CAAC;CAClC,MAAM,QAAQ,MAAM,QAAQ,IAC1B,QAAQ,KAAK,QAAQ,MAAM,YAAY,QAAQ,GAAG,KAAK,SAAS,CAAC,CACnE;CACA,MAAM,UAAoB,CAAC;CAC3B,IAAI,QAAQ;CAEZ,KAAK,MAAM,QAAQ,OAAO;EACxB,QAAQ,KAAK,KAAK;EAClB,SAAS,KAAK,KAAK,KAAK,aAAa,CAAC,IAAI;CAC5C;CAEA,MAAM,SAAS,IAAI,WAAW,KAAK;CAEnC,MAAM,SAAS,MAAM,MAAM,OAAO,IAAI,MAAM,QAAQ,EAAE,CAAC;CAEvD,KAAK,MAAM,QAAS,KAAK,eAAe,CAAC,GAAiD;EACxF,KAAK,cAAc,KAAK,cAAc,KAAK,QAAQ,KAAK;EACxD,KAAK,SAAS;CAChB;CAEA,KAAK,UAAU,MAAM,SAAS,IAAI,CAAC,EAAE,YAAY,MAAM,CAAC,IAAI,CAAC;CAE7D,OAAO,MAAM,SAAS,IAAI,SAAS;AACrC;;AAGA,MAAa,aAAa,OAAO,OAAmB,YAAY,QAAwB;CAItF,MAAM,EAAE,MAAM,QAFZ,MAAM,cAAc,MACpB,IAAI,SAAS,MAAM,QAAQ,MAAM,UAAU,CAAC,CAAC,UAAU,GAAG,IAAI,MAAM,YAElE,QAAQ,KAAK,IACb;EAAE,MAAM,KAAK,MAAM,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CAAC;EAAW,KAAK;CAAK;CAE3E,cAAc,IAAI;CAElB,MAAM,OAAO,SAAS,MAAM,MAAM,YAAY,MAAM,KAAK,SAAS,CAAC;CACnE,MAAM,SAAS,IAAI,WAAW;CAE9B,IAAI,KAAK,MAAM,4BAA4B,GACzC,OAAO,eAAgB,MAAM,sBAAsB,CAAW;CAGhE,IAAI,KAAK,MAAM,yBAAyB,KAAK,KAAK,MAAM,yBAAyB,GAC/E,IAAI;EACF,MAAM,EAAE,mBAAmB,MAAM,OAAO;EAExC,MAAM,eAAe;EACrB,OAAO,kBAAkB,cAAc;CACzC,QAAQ;EACN,MAAM,IAAI,MACR,0GACF;CACF;CAKF,QAAO,MAFY,OAAO,WAAW,MAAM,EAAE,EAAA,CAEjC;AACd;;AAGA,MAAa,YAAY,OAAO,SAC9B,WAAW,MAAM,SAAS,IAAI,GAAG,QAAQ,IAAI,CAAC"}
+{"version":3,"file":"load-D4bV0-2t.js","names":[],"sources":["../src/node/draco.ts","../src/node/load.ts"],"sourcesContent":["/**\n * Draco for `GLTFLoader` in Node. three's `DRACOLoader` decodes in Web Workers, which Node lacks;\n * this is its decode run in-process on `draco3dgltf` (Google's Node build of the decoder),\n * shaped like the two methods `GLTFLoader` calls on it.\n */\nimport {\n  BufferAttribute,\n  BufferGeometry,\n  InterleavedBuffer,\n  InterleavedBufferAttribute,\n} from \"three\";\n\ntype TypedArray =\n  | Float32Array\n  | Int8Array\n  | Int16Array\n  | Int32Array\n  | Uint8Array\n  | Uint16Array\n  | Uint32Array;\ntype TypedArrayConstructor = {\n  new (length: number): TypedArray;\n  new (buffer: ArrayBufferLike, offset: number, length: number): TypedArray;\n  BYTES_PER_ELEMENT: number;\n};\n\n/* The slice of the emscripten module this uses. */\ntype DracoAttribute = { num_components(): number };\ntype DracoMesh = { num_faces(): number; num_points(): number; ptr: number };\ntype DracoDecoder = {\n  GetEncodedGeometryType(array: Int8Array): number;\n  DecodeArrayToMesh(\n    array: Int8Array,\n    length: number,\n    mesh: DracoMesh,\n  ): { ok(): boolean; error_msg(): string };\n  GetAttributeByUniqueId(mesh: DracoMesh, id: number): DracoAttribute;\n  GetAttributeDataArrayForAllPoints(\n    mesh: DracoMesh,\n    attribute: DracoAttribute,\n    type: number,\n    byteLength: number,\n    pointer: number,\n  ): boolean;\n  GetTrianglesUInt32Array(mesh: DracoMesh, byteLength: number, pointer: number): boolean;\n};\ntype DracoModule = {\n  Decoder: new () => DracoDecoder;\n  Mesh: new () => DracoMesh;\n  TRIANGULAR_MESH: number;\n  HEAPF32: Float32Array;\n  _malloc(bytes: number): number;\n  _free(pointer: number): void;\n  destroy(object: unknown): void;\n  [type: `DT_${string}`]: number;\n};\n\nconst DATA_TYPES: Record<string, string> = {\n  Float32Array: \"DT_FLOAT32\",\n  Int8Array: \"DT_INT8\",\n  Int16Array: \"DT_INT16\",\n  Int32Array: \"DT_INT32\",\n  Uint8Array: \"DT_UINT8\",\n  Uint16Array: \"DT_UINT16\",\n  Uint32Array: \"DT_UINT32\",\n};\n\nconst decodeAttribute = (\n  draco: DracoModule,\n  decoder: DracoDecoder,\n  mesh: DracoMesh,\n  attribute: DracoAttribute,\n  ArrayType: TypedArrayConstructor,\n) => {\n  const count = mesh.num_points();\n  const itemSize = attribute.num_components();\n  // glTF aligns every vertex to 4 bytes; a narrower one is read interleaved.\n  const srcBytes = itemSize * ArrayType.BYTES_PER_ELEMENT;\n  const stride = (Math.ceil(srcBytes / 4) * 4) / ArrayType.BYTES_PER_ELEMENT;\n  const byteLength = count * srcBytes;\n  const pointer = draco._malloc(byteLength);\n\n  decoder.GetAttributeDataArrayForAllPoints(\n    mesh,\n    attribute,\n    draco[DATA_TYPES[ArrayType.name] as `DT_${string}`]!,\n    byteLength,\n    pointer,\n  );\n\n  const source = new ArrayType(\n    draco.HEAPF32.buffer,\n    pointer,\n    byteLength / ArrayType.BYTES_PER_ELEMENT,\n  );\n  let array: TypedArray;\n\n  if (stride === itemSize) {\n    array = source.slice();\n  } else {\n    array = new ArrayType(count * stride);\n\n    for (let i = 0; i < count; i += 1) {\n      for (let k = 0; k < itemSize; k += 1) {\n        array[i * stride + k] = source[i * itemSize + k]!;\n      }\n    }\n  }\n\n  draco._free(pointer);\n\n  return stride === itemSize\n    ? new BufferAttribute(array, itemSize)\n    : new InterleavedBufferAttribute(new InterleavedBuffer(array, stride), itemSize, 0);\n};\n\nconst decode = (\n  draco: DracoModule,\n  buffer: ArrayBuffer,\n  attributeIds: Record<string, number>,\n  attributeTypes: Record<string, string>,\n) => {\n  const decoder = new draco.Decoder();\n  const array = new Int8Array(buffer);\n\n  if (decoder.GetEncodedGeometryType(array) !== draco.TRIANGULAR_MESH) {\n    draco.destroy(decoder);\n    throw new Error(\"three-audit: Draco point clouds aren't supported\");\n  }\n\n  const mesh = new draco.Mesh();\n  const status = decoder.DecodeArrayToMesh(array, array.byteLength, mesh);\n\n  if (!status.ok() || mesh.ptr === 0) {\n    draco.destroy(mesh);\n    draco.destroy(decoder);\n    throw new Error(`three-audit: Draco decoding failed: ${status.error_msg()}`);\n  }\n\n  const geometry = new BufferGeometry();\n\n  for (const [name, id] of Object.entries(attributeIds)) {\n    const ArrayType = (globalThis as unknown as Record<string, TypedArrayConstructor>)[\n      attributeTypes[name] ?? \"Float32Array\"\n    ]!;\n\n    geometry.setAttribute(\n      name,\n      decodeAttribute(draco, decoder, mesh, decoder.GetAttributeByUniqueId(mesh, id), ArrayType),\n    );\n  }\n\n  const indices = mesh.num_faces() * 3;\n  const pointer = draco._malloc(indices * 4);\n\n  decoder.GetTrianglesUInt32Array(mesh, indices * 4, pointer);\n  geometry.setIndex(\n    new BufferAttribute(new Uint32Array(draco.HEAPF32.buffer, pointer, indices).slice(), 1),\n  );\n  draco._free(pointer);\n  draco.destroy(mesh);\n  draco.destroy(decoder);\n\n  return geometry;\n};\n\n/** Stands in for `DRACOLoader` in `gltfLoader.setDRACOLoader(...)`. Needs `draco3dgltf`. */\nexport const createNodeDracoLoader = async () => {\n  let module: { createDecoderModule(options: object): Promise<DracoModule> };\n\n  try {\n    module = ((await import(\"draco3dgltf\")) as { default: typeof module }).default;\n  } catch {\n    throw new Error(\n      \"three-audit: this model is Draco-compressed; install draco3dgltf to read it (npm i -D draco3dgltf)\",\n    );\n  }\n\n  const draco = await module.createDecoderModule({});\n\n  return {\n    preload() {\n      return this;\n    },\n    decodeDracoFile(\n      buffer: ArrayBuffer,\n      callback: (geometry: BufferGeometry) => void,\n      attributeIds: Record<string, number>,\n      attributeTypes: Record<string, string>,\n      _colorSpace?: string,\n      onError: (error: unknown) => void = () => {},\n    ) {\n      try {\n        callback(decode(draco, buffer, attributeIds, attributeTypes));\n      } catch (error) {\n        onError(error);\n      }\n    },\n  };\n};\n","/**\n * Load a glTF model in Node for the checks: `.glb`, or `.gltf` with its buffers beside it.\n *\n * Textures are stripped before parsing: no check reads them, and decoding images needs a DOM.\n * Draco (`draco3dgltf`) and Meshopt (`meshoptimizer`) compressed geometry decode when those\n * packages are installed.\n */\nimport { readFile } from \"node:fs/promises\";\nimport { dirname, resolve } from \"node:path\";\nimport type { Group } from \"three\";\nimport { GLTFLoader } from \"three/addons/loaders/GLTFLoader.js\";\n\nimport { createNodeDracoLoader } from \"./draco.ts\";\n\ntype Json = Record<string, unknown>;\n\nconst GLB_MAGIC = 0x46546c67;\nconst JSON_CHUNK = 0x4e4f534a;\nconst BIN_CHUNK = 0x004e4942;\nconst TEXTURE_EXTENSIONS = [\n  \"KHR_texture_basisu\",\n  \"KHR_texture_transform\",\n  \"EXT_texture_webp\",\n  \"EXT_texture_avif\",\n];\n\n/** Every `…Texture` reference in a material, extensions included. */\nconst dropTextureRefs = (value: unknown) => {\n  if (value === null || typeof value !== \"object\") {\n    return;\n  }\n\n  for (const [key, child] of Object.entries(value)) {\n    if (\n      key.endsWith(\"Texture\") &&\n      child !== null &&\n      typeof child === \"object\" &&\n      \"index\" in child\n    ) {\n      delete (value as Json)[key];\n    } else {\n      dropTextureRefs(child);\n    }\n  }\n};\n\nconst stripTextures = (json: Json) => {\n  delete json.images;\n  delete json.textures;\n  delete json.samplers;\n  dropTextureRefs(json.materials);\n\n  for (const key of [\"extensionsUsed\", \"extensionsRequired\"]) {\n    if (Array.isArray(json[key])) {\n      json[key] = (json[key] as string[]).filter((name) => !TEXTURE_EXTENSIONS.includes(name));\n    }\n  }\n};\n\nconst uses = (json: Json, extension: string) =>\n  Array.isArray(json.extensionsUsed) && (json.extensionsUsed as string[]).includes(extension);\n\n/** Split a GLB into its JSON and binary chunks. */\nconst readGlb = (bytes: Uint8Array) => {\n  const view = new DataView(bytes.buffer, bytes.byteOffset, bytes.byteLength);\n  let json: Json | null = null;\n  let bin: Uint8Array | null = null;\n\n  for (let offset = 12; offset < bytes.byteLength;) {\n    const length = view.getUint32(offset, true);\n    const type = view.getUint32(offset + 4, true);\n    const chunk = bytes.subarray(offset + 8, offset + 8 + length);\n\n    if (type === JSON_CHUNK) {\n      json = JSON.parse(new TextDecoder().decode(chunk)) as Json;\n    } else if (type === BIN_CHUNK) {\n      bin = chunk;\n    }\n\n    offset += 8 + length;\n  }\n\n  if (!json) {\n    throw new Error(\"three-audit: GLB has no JSON chunk\");\n  }\n\n  return { json, bin };\n};\n\n/** A GLB from JSON and an optional binary chunk, each padded to four bytes. */\nconst writeGlb = (json: Json, bin: Uint8Array | null) => {\n  const text = new TextEncoder().encode(JSON.stringify(json));\n  const jsonLength = Math.ceil(text.byteLength / 4) * 4;\n  const binLength = bin ? Math.ceil(bin.byteLength / 4) * 4 : 0;\n  const total = 12 + 8 + jsonLength + (bin ? 8 + binLength : 0);\n  const out = new Uint8Array(total);\n  const view = new DataView(out.buffer);\n\n  view.setUint32(0, GLB_MAGIC, true);\n  view.setUint32(4, 2, true);\n  view.setUint32(8, total, true);\n  view.setUint32(12, jsonLength, true);\n  view.setUint32(16, JSON_CHUNK, true);\n  out.fill(0x20, 20, 20 + jsonLength);\n  out.set(text, 20);\n\n  if (bin) {\n    view.setUint32(20 + jsonLength, binLength, true);\n    view.setUint32(24 + jsonLength, BIN_CHUNK, true);\n    out.set(bin, 28 + jsonLength);\n  }\n\n  return out.buffer;\n};\n\n/** A buffer's bytes: the GLB's binary chunk, a data URI, or a file beside the model. */\nconst bufferBytes = async (\n  buffer: { uri?: string },\n  index: number,\n  bin: Uint8Array | null,\n  directory: string,\n) => {\n  if (buffer.uri === undefined) {\n    if (index !== 0 || !bin) {\n      throw new Error(\"three-audit: a buffer without a uri must be the GLB's binary chunk\");\n    }\n\n    return bin;\n  }\n\n  if (buffer.uri.startsWith(\"data:\")) {\n    return new Uint8Array(Buffer.from(buffer.uri.slice(buffer.uri.indexOf(\",\") + 1), \"base64\"));\n  }\n\n  return new Uint8Array(await readFile(resolve(directory, decodeURIComponent(buffer.uri))));\n};\n\n/**\n * Every buffer folded into one binary chunk, the buffer views re-pointed into it. The result is a\n * self-contained GLB, so the loader never fetches: three's `FileLoader` needs browser globals.\n */\nconst packBuffers = async (json: Json, bin: Uint8Array | null, directory: string) => {\n  const buffers = (json.buffers ?? []) as { uri?: string }[];\n  const parts = await Promise.all(\n    buffers.map((buffer, i) => bufferBytes(buffer, i, bin, directory)),\n  );\n  const offsets: number[] = [];\n  let total = 0;\n\n  for (const part of parts) {\n    offsets.push(total);\n    total += Math.ceil(part.byteLength / 4) * 4;\n  }\n\n  const packed = new Uint8Array(total);\n\n  parts.forEach((part, i) => packed.set(part, offsets[i]));\n\n  for (const view of (json.bufferViews ?? []) as { buffer: number; byteOffset?: number }[]) {\n    view.byteOffset = (view.byteOffset ?? 0) + offsets[view.buffer]!;\n    view.buffer = 0;\n  }\n\n  json.buffers = parts.length > 0 ? [{ byteLength: total }] : [];\n\n  return parts.length > 0 ? packed : null;\n};\n\n/** Parse glTF bytes (GLB or JSON) into a three scene, textures stripped. */\nexport const parseModel = async (bytes: Uint8Array, directory = \".\"): Promise<Group> => {\n  const isGlb =\n    bytes.byteLength >= 12 &&\n    new DataView(bytes.buffer, bytes.byteOffset).getUint32(0, true) === GLB_MAGIC;\n  const { json, bin } = isGlb\n    ? readGlb(bytes)\n    : { json: JSON.parse(new TextDecoder().decode(bytes)) as Json, bin: null };\n\n  stripTextures(json);\n\n  const data = writeGlb(json, await packBuffers(json, bin, directory));\n  const loader = new GLTFLoader();\n\n  if (uses(json, \"KHR_draco_mesh_compression\")) {\n    loader.setDRACOLoader((await createNodeDracoLoader()) as never);\n  }\n\n  if (uses(json, \"EXT_meshopt_compression\") || uses(json, \"KHR_meshopt_compression\")) {\n    try {\n      const { MeshoptDecoder } = await import(\"meshoptimizer\");\n\n      await MeshoptDecoder.ready;\n      loader.setMeshoptDecoder(MeshoptDecoder);\n    } catch {\n      throw new Error(\n        \"three-audit: this model is Meshopt-compressed; install meshoptimizer to read it (npm i -D meshoptimizer)\",\n      );\n    }\n  }\n\n  const gltf = await loader.parseAsync(data, \"\");\n\n  return gltf.scene;\n};\n\n/** Read and parse a `.glb` or `.gltf` file into a three scene, ready for the checks. */\nexport const loadModel = async (path: string): Promise<Group> =>\n  parseModel(await readFile(path), dirname(path));\n"],"mappings":";;;;;;;;;;AAyDA,MAAM,aAAqC;CACzC,cAAc;CACd,WAAW;CACX,YAAY;CACZ,YAAY;CACZ,YAAY;CACZ,aAAa;CACb,aAAa;AACf;AAEA,MAAM,mBACJ,OACA,SACA,MACA,WACA,cACG;CACH,MAAM,QAAQ,KAAK,WAAW;CAC9B,MAAM,WAAW,UAAU,eAAe;CAE1C,MAAM,WAAW,WAAW,UAAU;CACtC,MAAM,SAAU,KAAK,KAAK,WAAW,CAAC,IAAI,IAAK,UAAU;CACzD,MAAM,aAAa,QAAQ;CAC3B,MAAM,UAAU,MAAM,QAAQ,UAAU;CAExC,QAAQ,kCACN,MACA,WACA,MAAM,WAAW,UAAU,QAC3B,YACA,OACF;CAEA,MAAM,SAAS,IAAI,UACjB,MAAM,QAAQ,QACd,SACA,aAAa,UAAU,iBACzB;CACA,IAAI;CAEJ,IAAI,WAAW,UACb,QAAQ,OAAO,MAAM;MAChB;EACL,QAAQ,IAAI,UAAU,QAAQ,MAAM;EAEpC,KAAK,IAAI,IAAI,GAAG,IAAI,OAAO,KAAK,GAC9B,KAAK,IAAI,IAAI,GAAG,IAAI,UAAU,KAAK,GACjC,MAAM,IAAI,SAAS,KAAK,OAAO,IAAI,WAAW;CAGpD;CAEA,MAAM,MAAM,OAAO;CAEnB,OAAO,WAAW,WACd,IAAI,gBAAgB,OAAO,QAAQ,IACnC,IAAI,2BAA2B,IAAI,kBAAkB,OAAO,MAAM,GAAG,UAAU,CAAC;AACtF;AAEA,MAAM,UACJ,OACA,QACA,cACA,mBACG;CACH,MAAM,UAAU,IAAI,MAAM,QAAQ;CAClC,MAAM,QAAQ,IAAI,UAAU,MAAM;CAElC,IAAI,QAAQ,uBAAuB,KAAK,MAAM,MAAM,iBAAiB;EACnE,MAAM,QAAQ,OAAO;EACrB,MAAM,IAAI,MAAM,kDAAkD;CACpE;CAEA,MAAM,OAAO,IAAI,MAAM,KAAK;CAC5B,MAAM,SAAS,QAAQ,kBAAkB,OAAO,MAAM,YAAY,IAAI;CAEtE,IAAI,CAAC,OAAO,GAAG,KAAK,KAAK,QAAQ,GAAG;EAClC,MAAM,QAAQ,IAAI;EAClB,MAAM,QAAQ,OAAO;EACrB,MAAM,IAAI,MAAM,uCAAuC,OAAO,UAAU,GAAG;CAC7E;CAEA,MAAM,WAAW,IAAI,eAAe;CAEpC,KAAK,MAAM,CAAC,MAAM,OAAO,OAAO,QAAQ,YAAY,GAAG;EACrD,MAAM,YAAa,WACjB,eAAe,SAAS;EAG1B,SAAS,aACP,MACA,gBAAgB,OAAO,SAAS,MAAM,QAAQ,uBAAuB,MAAM,EAAE,GAAG,SAAS,CAC3F;CACF;CAEA,MAAM,UAAU,KAAK,UAAU,IAAI;CACnC,MAAM,UAAU,MAAM,QAAQ,UAAU,CAAC;CAEzC,QAAQ,wBAAwB,MAAM,UAAU,GAAG,OAAO;CAC1D,SAAS,SACP,IAAI,gBAAgB,IAAI,YAAY,MAAM,QAAQ,QAAQ,SAAS,OAAO,CAAC,CAAC,MAAM,GAAG,CAAC,CACxF;CACA,MAAM,MAAM,OAAO;CACnB,MAAM,QAAQ,IAAI;CAClB,MAAM,QAAQ,OAAO;CAErB,OAAO;AACT;;AAGA,MAAa,wBAAwB,YAAY;CAC/C,IAAI;CAEJ,IAAI;EACF,UAAW,MAAM,OAAO,eAAA,CAA+C;CACzE,QAAQ;EACN,MAAM,IAAI,MACR,oGACF;CACF;CAEA,MAAM,QAAQ,MAAM,OAAO,oBAAoB,CAAC,CAAC;CAEjD,OAAO;EACL,UAAU;GACR,OAAO;EACT;EACA,gBACE,QACA,UACA,cACA,gBACA,aACA,gBAA0C,CAAC,GAC3C;GACA,IAAI;IACF,SAAS,OAAO,OAAO,QAAQ,cAAc,cAAc,CAAC;GAC9D,SAAS,OAAO;IACd,QAAQ,KAAK;GACf;EACF;CACF;AACF;;;;;;;;;ACvLA,MAAM,YAAY;AAClB,MAAM,aAAa;AACnB,MAAM,YAAY;AAClB,MAAM,qBAAqB;CACzB;CACA;CACA;CACA;AACF;;AAGA,MAAM,mBAAmB,UAAmB;CAC1C,IAAI,UAAU,QAAQ,OAAO,UAAU,UACrC;CAGF,KAAK,MAAM,CAAC,KAAK,UAAU,OAAO,QAAQ,KAAK,GAC7C,IACE,IAAI,SAAS,SAAS,KACtB,UAAU,QACV,OAAO,UAAU,YACjB,WAAW,OAEX,OAAQ,MAAe;MAEvB,gBAAgB,KAAK;AAG3B;AAEA,MAAM,iBAAiB,SAAe;CACpC,OAAO,KAAK;CACZ,OAAO,KAAK;CACZ,OAAO,KAAK;CACZ,gBAAgB,KAAK,SAAS;CAE9B,KAAK,MAAM,OAAO,CAAC,kBAAkB,oBAAoB,GACvD,IAAI,MAAM,QAAQ,KAAK,IAAI,GACzB,KAAK,OAAQ,KAAK,IAAI,CAAc,QAAQ,SAAS,CAAC,mBAAmB,SAAS,IAAI,CAAC;AAG7F;AAEA,MAAM,QAAQ,MAAY,cACxB,MAAM,QAAQ,KAAK,cAAc,KAAM,KAAK,eAA4B,SAAS,SAAS;;AAG5F,MAAM,WAAW,UAAsB;CACrC,MAAM,OAAO,IAAI,SAAS,MAAM,QAAQ,MAAM,YAAY,MAAM,UAAU;CAC1E,IAAI,OAAoB;CACxB,IAAI,MAAyB;CAE7B,KAAK,IAAI,SAAS,IAAI,SAAS,MAAM,aAAa;EAChD,MAAM,SAAS,KAAK,UAAU,QAAQ,IAAI;EAC1C,MAAM,OAAO,KAAK,UAAU,SAAS,GAAG,IAAI;EAC5C,MAAM,QAAQ,MAAM,SAAS,SAAS,GAAG,SAAS,IAAI,MAAM;EAE5D,IAAI,SAAS,YACX,OAAO,KAAK,MAAM,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CAAC;OAC5C,IAAI,SAAS,WAClB,MAAM;EAGR,UAAU,IAAI;CAChB;CAEA,IAAI,CAAC,MACH,MAAM,IAAI,MAAM,oCAAoC;CAGtD,OAAO;EAAE;EAAM;CAAI;AACrB;;AAGA,MAAM,YAAY,MAAY,QAA2B;CACvD,MAAM,OAAO,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,UAAU,IAAI,CAAC;CAC1D,MAAM,aAAa,KAAK,KAAK,KAAK,aAAa,CAAC,IAAI;CACpD,MAAM,YAAY,MAAM,KAAK,KAAK,IAAI,aAAa,CAAC,IAAI,IAAI;CAC5D,MAAM,QAAQ,KAAS,cAAc,MAAM,IAAI,YAAY;CAC3D,MAAM,MAAM,IAAI,WAAW,KAAK;CAChC,MAAM,OAAO,IAAI,SAAS,IAAI,MAAM;CAEpC,KAAK,UAAU,GAAG,WAAW,IAAI;CACjC,KAAK,UAAU,GAAG,GAAG,IAAI;CACzB,KAAK,UAAU,GAAG,OAAO,IAAI;CAC7B,KAAK,UAAU,IAAI,YAAY,IAAI;CACnC,KAAK,UAAU,IAAI,YAAY,IAAI;CACnC,IAAI,KAAK,IAAM,IAAI,KAAK,UAAU;CAClC,IAAI,IAAI,MAAM,EAAE;CAEhB,IAAI,KAAK;EACP,KAAK,UAAU,KAAK,YAAY,WAAW,IAAI;EAC/C,KAAK,UAAU,KAAK,YAAY,WAAW,IAAI;EAC/C,IAAI,IAAI,KAAK,KAAK,UAAU;CAC9B;CAEA,OAAO,IAAI;AACb;;AAGA,MAAM,cAAc,OAClB,QACA,OACA,KACA,cACG;CACH,IAAI,OAAO,QAAQ,KAAA,GAAW;EAC5B,IAAI,UAAU,KAAK,CAAC,KAClB,MAAM,IAAI,MAAM,oEAAoE;EAGtF,OAAO;CACT;CAEA,IAAI,OAAO,IAAI,WAAW,OAAO,GAC/B,OAAO,IAAI,WAAW,OAAO,KAAK,OAAO,IAAI,MAAM,OAAO,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,QAAQ,CAAC;CAG5F,OAAO,IAAI,WAAW,MAAM,SAAS,QAAQ,WAAW,mBAAmB,OAAO,GAAG,CAAC,CAAC,CAAC;AAC1F;;;;;AAMA,MAAM,cAAc,OAAO,MAAY,KAAwB,cAAsB;CACnF,MAAM,UAAW,KAAK,WAAW,CAAC;CAClC,MAAM,QAAQ,MAAM,QAAQ,IAC1B,QAAQ,KAAK,QAAQ,MAAM,YAAY,QAAQ,GAAG,KAAK,SAAS,CAAC,CACnE;CACA,MAAM,UAAoB,CAAC;CAC3B,IAAI,QAAQ;CAEZ,KAAK,MAAM,QAAQ,OAAO;EACxB,QAAQ,KAAK,KAAK;EAClB,SAAS,KAAK,KAAK,KAAK,aAAa,CAAC,IAAI;CAC5C;CAEA,MAAM,SAAS,IAAI,WAAW,KAAK;CAEnC,MAAM,SAAS,MAAM,MAAM,OAAO,IAAI,MAAM,QAAQ,EAAE,CAAC;CAEvD,KAAK,MAAM,QAAS,KAAK,eAAe,CAAC,GAAiD;EACxF,KAAK,cAAc,KAAK,cAAc,KAAK,QAAQ,KAAK;EACxD,KAAK,SAAS;CAChB;CAEA,KAAK,UAAU,MAAM,SAAS,IAAI,CAAC,EAAE,YAAY,MAAM,CAAC,IAAI,CAAC;CAE7D,OAAO,MAAM,SAAS,IAAI,SAAS;AACrC;;AAGA,MAAa,aAAa,OAAO,OAAmB,YAAY,QAAwB;CAItF,MAAM,EAAE,MAAM,QAFZ,MAAM,cAAc,MACpB,IAAI,SAAS,MAAM,QAAQ,MAAM,UAAU,CAAC,CAAC,UAAU,GAAG,IAAI,MAAM,YAElE,QAAQ,KAAK,IACb;EAAE,MAAM,KAAK,MAAM,IAAI,YAAY,CAAC,CAAC,OAAO,KAAK,CAAC;EAAW,KAAK;CAAK;CAE3E,cAAc,IAAI;CAElB,MAAM,OAAO,SAAS,MAAM,MAAM,YAAY,MAAM,KAAK,SAAS,CAAC;CACnE,MAAM,SAAS,IAAI,WAAW;CAE9B,IAAI,KAAK,MAAM,4BAA4B,GACzC,OAAO,eAAgB,MAAM,sBAAsB,CAAW;CAGhE,IAAI,KAAK,MAAM,yBAAyB,KAAK,KAAK,MAAM,yBAAyB,GAC/E,IAAI;EACF,MAAM,EAAE,mBAAmB,MAAM,OAAO;EAExC,MAAM,eAAe;EACrB,OAAO,kBAAkB,cAAc;CACzC,QAAQ;EACN,MAAM,IAAI,MACR,0GACF;CACF;CAKF,QAAO,MAFY,OAAO,WAAW,MAAM,EAAE,EAAA,CAEjC;AACd;;AAGA,MAAa,YAAY,OAAO,SAC9B,WAAW,MAAM,SAAS,IAAI,GAAG,QAAQ,IAAI,CAAC"}

package/dist/node.d.ts

@@ -1,15 +1,11 @@
 import { BufferGeometry, Group } from "three";
-//#region src/node/load.d.ts
 /** Parse glTF bytes (GLB or JSON) into a three scene, textures stripped. */
 export declare const parseModel: (bytes: Uint8Array, directory?: string) => Promise<Group>;
 /** Read and parse a `.glb` or `.gltf` file into a three scene, ready for the checks. */
 export declare const loadModel: (path: string) => Promise<Group>;
-//#endregion
-//#region src/node/draco.d.ts
 /** Stands in for `DRACOLoader` in `gltfLoader.setDRACOLoader(...)`. Needs `draco3dgltf`. */
 export declare const createNodeDracoLoader: () => Promise<{
   preload(): /*elided*/ any;
   decodeDracoFile(buffer: ArrayBuffer, callback: (geometry: BufferGeometry) => void, attributeIds: Record<string, number>, attributeTypes: Record<string, string>, _colorSpace?: string, onError?: (error: unknown) => void): void;
 }>;
-//#endregion
 //# sourceMappingURL=node.d.ts.map

package/dist/node.js

@@ -1,2 +1 @@
-import { n as parseModel, r as createNodeDracoLoader, t as loadModel } from "./load-nqfCU3-k.js";
-export { createNodeDracoLoader, loadModel, parseModel };
+export { r as createNodeDracoLoader, t as loadModel, n as parseModel } from "./load-D4bV0-2t.js";

package/dist/report-lines-Myjl7bcq.js

@@ -0,0 +1,23 @@
+// src/report-lines.ts
+const count = (value) => value.toLocaleString("en-US");
+const plural = (n, one, many = `${one}s`) => n === 1 ? one : many;
+const zFightingLines = (rows) => rows.flatMap((row) => {
+	const more = row.planes.length > 1 ? ` (+${row.planes.length - 1} more)` : "";
+	const copies = row.count > 1 ? `, ×${row.count} identical pairs` : "";
+	return [
+		`      ${row.a}`,
+		`    ↔ ${row.b}`,
+		`      ${row.triangles} triangles in ${row.planes[0]}${more}; overlap ${row.overlap.area} m² at (${row.overlap.centre.join(", ")})${copies}`
+	];
+});
+const badGeometryLines = (rows) => rows.map((row) => `      ${row.mesh}${row.under ? ` (${row.under})` : ""}: ${row.nonFinite} non-finite, ${row.zeroNormals} zero normals`);
+const emptyMeshLines = (rows) => rows.map((row) => `      ${row.mesh}`);
+const meshLines = (rows) => rows.map((row) => `      ${count(row.total).padStart(9)}  ${row.name}${row.instances > 1 ? ` ×${row.instances}` : ""}`);
+/** `triangles  8,120 > 7,500 ✗`, one per limit, numbers lined up. */
+const budgetLines = (rows) => {
+	const actual = Math.max(...rows.map((row) => count(row.actual).length));
+	return rows.map((row) => `      ${row.metric.padEnd(9)} ${count(row.actual).padStart(actual)} ${row.over ? ">" : "≤"} ${count(row.limit)}${row.over ? "  ✗" : ""}`);
+};
+export { meshLines as a, emptyMeshLines as i, budgetLines as n, plural as o, count as r, zFightingLines as s, badGeometryLines as t };
+
+//# sourceMappingURL=report-lines-Myjl7bcq.js.map

package/dist/report-lines-Myjl7bcq.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"report-lines-Myjl7bcq.js","names":[],"sources":["../src/report-lines.ts"],"sourcesContent":["/**\n * The checks' rows as text lines, as the `three-audit` CLI prints them and the Vitest matchers\n * fail with.\n */\nimport type { BadGeometryRow, EmptyMeshRow } from \"./bad-geometry.ts\";\nimport type { BudgetCheck } from \"./budgets.ts\";\nimport type { MeshRow } from \"./triangles.ts\";\nimport type { ZFightingRow } from \"./z-fighting.ts\";\n\nexport const count = (value: number) => value.toLocaleString(\"en-US\");\n\nexport const plural = (n: number, one: string, many = `${one}s`) => (n === 1 ? one : many);\n\nexport const zFightingLines = (rows: readonly ZFightingRow[]) =>\n  rows.flatMap((row) => {\n    const more = row.planes.length > 1 ? ` (+${row.planes.length - 1} more)` : \"\";\n    const copies = row.count > 1 ? `, ×${row.count} identical pairs` : \"\";\n\n    return [\n      `      ${row.a}`,\n      `    ↔ ${row.b}`,\n      `      ${row.triangles} triangles in ${row.planes[0]}${more}; overlap ${row.overlap.area} m² at (${row.overlap.centre.join(\", \")})${copies}`,\n    ];\n  });\n\nexport const badGeometryLines = (rows: readonly BadGeometryRow[]) =>\n  rows.map(\n    (row) =>\n      `      ${row.mesh}${row.under ? ` (${row.under})` : \"\"}: ${row.nonFinite} non-finite, ${row.zeroNormals} zero normals`,\n  );\n\nexport const emptyMeshLines = (rows: readonly EmptyMeshRow[]) =>\n  rows.map((row) => `      ${row.mesh}`);\n\nexport const meshLines = (rows: readonly MeshRow[]) =>\n  rows.map(\n    (row) =>\n      `      ${count(row.total).padStart(9)}  ${row.name}${row.instances > 1 ? ` ×${row.instances}` : \"\"}`,\n  );\n\n/** `triangles  8,120 > 7,500 ✗`, one per limit, numbers lined up. */\nexport const budgetLines = (rows: readonly BudgetCheck[]) => {\n  const actual = Math.max(...rows.map((row) => count(row.actual).length));\n\n  return rows.map(\n    (row) =>\n      `      ${row.metric.padEnd(9)} ${count(row.actual).padStart(actual)} ${row.over ? \">\" : \"≤\"} ${count(row.limit)}${row.over ? \"  ✗\" : \"\"}`,\n  );\n};\n"],"mappings":";AASA,MAAa,SAAS,UAAkB,MAAM,eAAe,OAAO;AAEpE,MAAa,UAAU,GAAW,KAAa,OAAO,GAAG,IAAI,OAAQ,MAAM,IAAI,MAAM;AAErF,MAAa,kBAAkB,SAC7B,KAAK,SAAS,QAAQ;CACpB,MAAM,OAAO,IAAI,OAAO,SAAS,IAAI,MAAM,IAAI,OAAO,SAAS,EAAE,UAAU;CAC3E,MAAM,SAAS,IAAI,QAAQ,IAAI,MAAM,IAAI,MAAM,oBAAoB;CAEnE,OAAO;EACL,SAAS,IAAI;EACb,SAAS,IAAI;EACb,SAAS,IAAI,UAAU,gBAAgB,IAAI,OAAO,KAAK,KAAK,YAAY,IAAI,QAAQ,KAAK,UAAU,IAAI,QAAQ,OAAO,KAAK,IAAI,EAAE,GAAG;CACtI;AACF,CAAC;AAEH,MAAa,oBAAoB,SAC/B,KAAK,KACF,QACC,SAAS,IAAI,OAAO,IAAI,QAAQ,KAAK,IAAI,MAAM,KAAK,GAAG,IAAI,IAAI,UAAU,eAAe,IAAI,YAAY,cAC5G;AAEF,MAAa,kBAAkB,SAC7B,KAAK,KAAK,QAAQ,SAAS,IAAI,MAAM;AAEvC,MAAa,aAAa,SACxB,KAAK,KACF,QACC,SAAS,MAAM,IAAI,KAAK,CAAC,CAAC,SAAS,CAAC,EAAE,IAAI,IAAI,OAAO,IAAI,YAAY,IAAI,KAAK,IAAI,cAAc,IACpG;;AAGF,MAAa,eAAe,SAAiC;CAC3D,MAAM,SAAS,KAAK,IAAI,GAAG,KAAK,KAAK,QAAQ,MAAM,IAAI,MAAM,CAAC,CAAC,MAAM,CAAC;CAEtE,OAAO,KAAK,KACT,QACC,SAAS,IAAI,OAAO,OAAO,CAAC,EAAE,GAAG,MAAM,IAAI,MAAM,CAAC,CAAC,SAAS,MAAM,EAAE,GAAG,IAAI,OAAO,MAAM,IAAI,GAAG,MAAM,IAAI,KAAK,IAAI,IAAI,OAAO,QAAQ,IACzI;AACF"}

package/dist/vitest.d.ts

@@ -0,0 +1,54 @@
+import { S as BadGeometryOptions, a as FrameBudget, k as Skip, o as PartBudget, u as ZFightingOptions, x as triangles } from "./budgets-Dl-AOd9T.js";
+export type FitBudgetOptions = {
+  skip?: Skip | undefined;
+  /** How many of the costliest meshes a failure lists. Default 5. */
+  top?: number;
+};
+type Context = {
+  isNot: boolean;
+  utils: {
+    matcherHint: (name: string, received?: string, expected?: string) => string;
+  };
+};
+declare const toFitBudget: (this: Context, received: unknown, budget: PartBudget | FrameBudget, options?: FitBudgetOptions) => {
+  pass: boolean;
+  actual: {
+    [k: string]: number;
+  };
+  expected: {
+    [k: string]: number;
+  };
+  message: () => string;
+};
+declare const toHaveNoZFighting: (this: Context, received: unknown, options?: ZFightingOptions) => {
+  pass: boolean;
+  message: () => string;
+};
+declare const toHaveCleanGeometry: (this: Context, received: unknown, options?: BadGeometryOptions) => {
+  pass: boolean;
+  message: () => string;
+};
+/** The matchers, for `expect.extend` by hand. */
+export declare const matchers: {
+  toFitBudget: typeof toFitBudget;
+  toHaveNoZFighting: typeof toHaveNoZFighting;
+  toHaveCleanGeometry: typeof toHaveCleanGeometry;
+};
+/** Registers the matchers on Vitest's `expect`. Importing this entry already has. */
+export declare const installMatchers: () => void;
+declare module "vitest" {
+  interface Matchers<R extends void | Promise<void> = void | Promise<void>, T = unknown> {
+    /**
+     * The object's triangles, draw calls and meshes are within the budget's: a part of
+     * `defineBudgets`'s, or its frame (`calls` counts as `draws`). Fails listing actual against
+     * budget and the costliest meshes.
+     */
+    toFitBudget: (budget: PartBudget | FrameBudget, options?: FitBudgetOptions) => R;
+    /** `findZFighting` finds nothing. Fails listing the pairs. */
+    toHaveNoZFighting: (options?: ZFightingOptions) => R;
+    /** No NaN geometry (`findBadGeometry`) and no empty meshes (`findEmptyMeshes`). */
+    toHaveCleanGeometry: (options?: BadGeometryOptions) => R;
+  }
+}
+export { triangles };
+//# sourceMappingURL=vitest.d.ts.map

package/dist/vitest.js

@@ -0,0 +1,90 @@
+import { c as listMeshes, d as findEmptyMeshes, i as findZFighting, l as triangles, t as checkBudget, u as findBadGeometry } from "./budgets-DQggDhEu.js";
+import { a as meshLines, i as emptyMeshLines, n as budgetLines, o as plural, s as zFightingLines, t as badGeometryLines } from "./report-lines-Myjl7bcq.js";
+import { expect } from "vitest";
+// src/vitest/index.ts
+/**
+* `@zkmake/three-audit/vitest`: the checks as Vitest matchers. Importing this entry registers them
+* (in a test file, or once in a `setupFiles` module):
+*
+*   import "@zkmake/three-audit/vitest";
+*
+*   expect(kart).toFitBudget(budgets.parts.kart);
+*   expect(kart).toHaveNoZFighting();
+*   expect(kart).toHaveCleanGeometry();
+*
+* Failures print what three-audit's CLI does: actual against budget and the costliest meshes,
+* the z-fighting pairs, the bad meshes. Vitest is a peer; the main entry never imports this one.
+*/
+const isObject3D = (value) => typeof value === "object" && value !== null && value.isObject3D === true;
+const nameOf = (object) => {
+	const { name, type } = object;
+	return name ? `"${name}"` : type ?? "the object";
+};
+/** Throws, as a matcher must, when what it was handed isn't a three.js object. */
+const asRoot = (received, matcher) => {
+	if (!isObject3D(received)) throw new TypeError(`${matcher}: expected a three.js object (Object3D), got ${typeof received}`);
+	return received;
+};
+const toFitBudget = function(received, budget, options = {}) {
+	const root = asRoot(received, "toFitBudget");
+	const checks = checkBudget(root, budget, { skip: options.skip });
+	if (checks.length === 0) throw new TypeError("toFitBudget: the budget sets no triangles, draws (calls) or meshes");
+	const over = checks.filter((check) => check.over);
+	const top = listMeshes(root, { skip: options.skip }).slice(0, options.top ?? 5);
+	const hint = this.utils.matcherHint(".toFitBudget", "object", "budget");
+	return {
+		pass: over.length === 0,
+		actual: Object.fromEntries(checks.map((check) => [check.metric, check.actual])),
+		expected: Object.fromEntries(checks.map((check) => [check.metric, check.limit])),
+		message: () => [
+			hint,
+			"",
+			this.isNot ? `${nameOf(root)} fits its budget, expected it not to:` : `${nameOf(root)} is over its budget on ${over.map((check) => check.metric).join(", ")}:`,
+			...budgetLines(checks),
+			...top.length > 0 ? ["  most triangles:", ...meshLines(top)] : []
+		].join("\n")
+	};
+};
+const toHaveNoZFighting = function(received, options = {}) {
+	const root = asRoot(received, "toHaveNoZFighting");
+	const rows = findZFighting(root, options);
+	const hint = this.utils.matcherHint(".toHaveNoZFighting", "object", "");
+	return {
+		pass: rows.length === 0,
+		message: () => this.isNot ? `${hint}\n\n${nameOf(root)} has no z-fighting, expected some` : [
+			hint,
+			"",
+			`${nameOf(root)} has ${rows.length} z-fighting ${plural(rows.length, "pair")}:`,
+			...zFightingLines(rows)
+		].join("\n")
+	};
+};
+const toHaveCleanGeometry = function(received, options = {}) {
+	const root = asRoot(received, "toHaveCleanGeometry");
+	const bad = findBadGeometry(root, options);
+	const empty = findEmptyMeshes(root, options);
+	const hint = this.utils.matcherHint(".toHaveCleanGeometry", "object", "");
+	return {
+		pass: bad.length === 0 && empty.length === 0,
+		message: () => this.isNot ? `${hint}\n\n${nameOf(root)} has clean geometry, expected NaN or empty meshes` : [
+			hint,
+			"",
+			...bad.length > 0 ? [`${nameOf(root)} has ${bad.length} ${plural(bad.length, "mesh", "meshes")} with NaN geometry:`, ...badGeometryLines(bad)] : [],
+			...empty.length > 0 ? [`${nameOf(root)} has ${empty.length} empty ${plural(empty.length, "mesh", "meshes")} (no vertices):`, ...emptyMeshLines(empty)] : []
+		].join("\n")
+	};
+};
+/** The matchers, for `expect.extend` by hand. */
+const matchers = {
+	toFitBudget,
+	toHaveNoZFighting,
+	toHaveCleanGeometry
+};
+/** Registers the matchers on Vitest's `expect`. Importing this entry already has. */
+const installMatchers = () => {
+	expect.extend(matchers);
+};
+installMatchers();
+export { installMatchers, matchers, triangles };
+
+//# sourceMappingURL=vitest.js.map

package/dist/vitest.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"vitest.js","names":[],"sources":["../src/vitest/index.ts"],"sourcesContent":["/**\n * `@zkmake/three-audit/vitest`: the checks as Vitest matchers. Importing this entry registers them\n * (in a test file, or once in a `setupFiles` module):\n *\n *   import \"@zkmake/three-audit/vitest\";\n *\n *   expect(kart).toFitBudget(budgets.parts.kart);\n *   expect(kart).toHaveNoZFighting();\n *   expect(kart).toHaveCleanGeometry();\n *\n * Failures print what three-audit's CLI does: actual against budget and the costliest meshes,\n * the z-fighting pairs, the bad meshes. Vitest is a peer; the main entry never imports this one.\n */\nimport { expect } from \"vitest\";\n\nimport { type BadGeometryOptions, findBadGeometry, findEmptyMeshes } from \"../bad-geometry.ts\";\nimport { checkBudget, type FrameBudget, type PartBudget } from \"../budgets.ts\";\nimport {\n  badGeometryLines,\n  budgetLines,\n  emptyMeshLines,\n  meshLines,\n  plural,\n  zFightingLines,\n} from \"../report-lines.ts\";\nimport type { AnyObject3D, Skip } from \"../scene.ts\";\nimport { listMeshes } from \"../triangles.ts\";\nimport { findZFighting, type ZFightingOptions } from \"../z-fighting.ts\";\n\nexport { triangles } from \"../triangles.ts\";\n\nexport type FitBudgetOptions = {\n  skip?: Skip | undefined;\n  /** How many of the costliest meshes a failure lists. Default 5. */\n  top?: number;\n};\n\ntype Context = {\n  isNot: boolean;\n  utils: { matcherHint: (name: string, received?: string, expected?: string) => string };\n};\n\nconst isObject3D = (value: unknown): value is AnyObject3D =>\n  typeof value === \"object\" &&\n  value !== null &&\n  (value as { isObject3D?: unknown }).isObject3D === true;\n\nconst nameOf = (object: AnyObject3D) => {\n  const { name, type } = object as { name?: string; type?: string };\n\n  return name ? `\"${name}\"` : (type ?? \"the object\");\n};\n\n/** Throws, as a matcher must, when what it was handed isn't a three.js object. */\nconst asRoot = (received: unknown, matcher: string) => {\n  if (!isObject3D(received)) {\n    throw new TypeError(\n      `${matcher}: expected a three.js object (Object3D), got ${typeof received}`,\n    );\n  }\n\n  return received;\n};\n\nconst toFitBudget = function (\n  this: Context,\n  received: unknown,\n  budget: PartBudget | FrameBudget,\n  options: FitBudgetOptions = {},\n) {\n  const root = asRoot(received, \"toFitBudget\");\n  const checks = checkBudget(root, budget, { skip: options.skip });\n\n  if (checks.length === 0) {\n    throw new TypeError(\"toFitBudget: the budget sets no triangles, draws (calls) or meshes\");\n  }\n\n  const over = checks.filter((check) => check.over);\n  const top = listMeshes(root, { skip: options.skip }).slice(0, options.top ?? 5);\n  const hint = this.utils.matcherHint(\".toFitBudget\", \"object\", \"budget\");\n\n  return {\n    pass: over.length === 0,\n    actual: Object.fromEntries(checks.map((check) => [check.metric, check.actual])),\n    expected: Object.fromEntries(checks.map((check) => [check.metric, check.limit])),\n    message: () =>\n      [\n        hint,\n        \"\",\n        this.isNot\n          ? `${nameOf(root)} fits its budget, expected it not to:`\n          : `${nameOf(root)} is over its budget on ${over.map((check) => check.metric).join(\", \")}:`,\n        ...budgetLines(checks),\n        ...(top.length > 0 ? [\"  most triangles:\", ...meshLines(top)] : []),\n      ].join(\"\\n\"),\n  };\n};\n\nconst toHaveNoZFighting = function (\n  this: Context,\n  received: unknown,\n  options: ZFightingOptions = {},\n) {\n  const root = asRoot(received, \"toHaveNoZFighting\");\n  const rows = findZFighting(root, options);\n  const hint = this.utils.matcherHint(\".toHaveNoZFighting\", \"object\", \"\");\n\n  return {\n    pass: rows.length === 0,\n    message: () =>\n      this.isNot\n        ? `${hint}\\n\\n${nameOf(root)} has no z-fighting, expected some`\n        : [\n            hint,\n            \"\",\n            `${nameOf(root)} has ${rows.length} z-fighting ${plural(rows.length, \"pair\")}:`,\n            ...zFightingLines(rows),\n          ].join(\"\\n\"),\n  };\n};\n\nconst toHaveCleanGeometry = function (\n  this: Context,\n  received: unknown,\n  options: BadGeometryOptions = {},\n) {\n  const root = asRoot(received, \"toHaveCleanGeometry\");\n  const bad = findBadGeometry(root, options);\n  const empty = findEmptyMeshes(root, options);\n  const hint = this.utils.matcherHint(\".toHaveCleanGeometry\", \"object\", \"\");\n\n  return {\n    pass: bad.length === 0 && empty.length === 0,\n    message: () =>\n      this.isNot\n        ? `${hint}\\n\\n${nameOf(root)} has clean geometry, expected NaN or empty meshes`\n        : [\n            hint,\n            \"\",\n            ...(bad.length > 0\n              ? [\n                  `${nameOf(root)} has ${bad.length} ${plural(bad.length, \"mesh\", \"meshes\")} with NaN geometry:`,\n                  ...badGeometryLines(bad),\n                ]\n              : []),\n            ...(empty.length > 0\n              ? [\n                  `${nameOf(root)} has ${empty.length} empty ${plural(empty.length, \"mesh\", \"meshes\")} (no vertices):`,\n                  ...emptyMeshLines(empty),\n                ]\n              : []),\n          ].join(\"\\n\"),\n  };\n};\n\n/** The matchers, for `expect.extend` by hand. */\nexport const matchers = { toFitBudget, toHaveNoZFighting, toHaveCleanGeometry };\n\n/** Registers the matchers on Vitest's `expect`. Importing this entry already has. */\nexport const installMatchers = () => {\n  expect.extend(matchers);\n};\n\ninstallMatchers();\n\ndeclare module \"vitest\" {\n  interface Matchers<R extends void | Promise<void> = void | Promise<void>, T = unknown> {\n    /**\n     * The object's triangles, draw calls and meshes are within the budget's: a part of\n     * `defineBudgets`'s, or its frame (`calls` counts as `draws`). Fails listing actual against\n     * budget and the costliest meshes.\n     */\n    toFitBudget: (budget: PartBudget | FrameBudget, options?: FitBudgetOptions) => R;\n    /** `findZFighting` finds nothing. Fails listing the pairs. */\n    toHaveNoZFighting: (options?: ZFightingOptions) => R;\n    /** No NaN geometry (`findBadGeometry`) and no empty meshes (`findEmptyMeshes`). */\n    toHaveCleanGeometry: (options?: BadGeometryOptions) => R;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;AA0CA,MAAM,cAAc,UAClB,OAAO,UAAU,YACjB,UAAU,QACT,MAAmC,eAAe;AAErD,MAAM,UAAU,WAAwB;CACtC,MAAM,EAAE,MAAM,SAAS;CAEvB,OAAO,OAAO,IAAI,KAAK,KAAM,QAAQ;AACvC;;AAGA,MAAM,UAAU,UAAmB,YAAoB;CACrD,IAAI,CAAC,WAAW,QAAQ,GACtB,MAAM,IAAI,UACR,GAAG,QAAQ,+CAA+C,OAAO,UACnE;CAGF,OAAO;AACT;AAEA,MAAM,cAAc,SAElB,UACA,QACA,UAA4B,CAAC,GAC7B;CACA,MAAM,OAAO,OAAO,UAAU,aAAa;CAC3C,MAAM,SAAS,YAAY,MAAM,QAAQ,EAAE,MAAM,QAAQ,KAAK,CAAC;CAE/D,IAAI,OAAO,WAAW,GACpB,MAAM,IAAI,UAAU,oEAAoE;CAG1F,MAAM,OAAO,OAAO,QAAQ,UAAU,MAAM,IAAI;CAChD,MAAM,MAAM,WAAW,MAAM,EAAE,MAAM,QAAQ,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,QAAQ,OAAO,CAAC;CAC9E,MAAM,OAAO,KAAK,MAAM,YAAY,gBAAgB,UAAU,QAAQ;CAEtE,OAAO;EACL,MAAM,KAAK,WAAW;EACtB,QAAQ,OAAO,YAAY,OAAO,KAAK,UAAU,CAAC,MAAM,QAAQ,MAAM,MAAM,CAAC,CAAC;EAC9E,UAAU,OAAO,YAAY,OAAO,KAAK,UAAU,CAAC,MAAM,QAAQ,MAAM,KAAK,CAAC,CAAC;EAC/E,eACE;GACE;GACA;GACA,KAAK,QACD,GAAG,OAAO,IAAI,EAAE,yCAChB,GAAG,OAAO,IAAI,EAAE,yBAAyB,KAAK,KAAK,UAAU,MAAM,MAAM,CAAC,CAAC,KAAK,IAAI,EAAE;GAC1F,GAAG,YAAY,MAAM;GACrB,GAAI,IAAI,SAAS,IAAI,CAAC,qBAAqB,GAAG,UAAU,GAAG,CAAC,IAAI,CAAC;EACnE,CAAC,CAAC,KAAK,IAAI;CACf;AACF;AAEA,MAAM,oBAAoB,SAExB,UACA,UAA4B,CAAC,GAC7B;CACA,MAAM,OAAO,OAAO,UAAU,mBAAmB;CACjD,MAAM,OAAO,cAAc,MAAM,OAAO;CACxC,MAAM,OAAO,KAAK,MAAM,YAAY,sBAAsB,UAAU,EAAE;CAEtE,OAAO;EACL,MAAM,KAAK,WAAW;EACtB,eACE,KAAK,QACD,GAAG,KAAK,MAAM,OAAO,IAAI,EAAE,qCAC3B;GACE;GACA;GACA,GAAG,OAAO,IAAI,EAAE,OAAO,KAAK,OAAO,cAAc,OAAO,KAAK,QAAQ,MAAM,EAAE;GAC7E,GAAG,eAAe,IAAI;EACxB,CAAC,CAAC,KAAK,IAAI;CACnB;AACF;AAEA,MAAM,sBAAsB,SAE1B,UACA,UAA8B,CAAC,GAC/B;CACA,MAAM,OAAO,OAAO,UAAU,qBAAqB;CACnD,MAAM,MAAM,gBAAgB,MAAM,OAAO;CACzC,MAAM,QAAQ,gBAAgB,MAAM,OAAO;CAC3C,MAAM,OAAO,KAAK,MAAM,YAAY,wBAAwB,UAAU,EAAE;CAExE,OAAO;EACL,MAAM,IAAI,WAAW,KAAK,MAAM,WAAW;EAC3C,eACE,KAAK,QACD,GAAG,KAAK,MAAM,OAAO,IAAI,EAAE,qDAC3B;GACE;GACA;GACA,GAAI,IAAI,SAAS,IACb,CACE,GAAG,OAAO,IAAI,EAAE,OAAO,IAAI,OAAO,GAAG,OAAO,IAAI,QAAQ,QAAQ,QAAQ,EAAE,sBAC1E,GAAG,iBAAiB,GAAG,CACzB,IACA,CAAC;GACL,GAAI,MAAM,SAAS,IACf,CACE,GAAG,OAAO,IAAI,EAAE,OAAO,MAAM,OAAO,SAAS,OAAO,MAAM,QAAQ,QAAQ,QAAQ,EAAE,kBACpF,GAAG,eAAe,KAAK,CACzB,IACA,CAAC;EACP,CAAC,CAAC,KAAK,IAAI;CACnB;AACF;;AAGA,MAAa,WAAW;CAAE;CAAa;CAAmB;AAAoB;;AAG9E,MAAa,wBAAwB;CACnC,OAAO,OAAO,QAAQ;AACxB;AAEA,gBAAgB"}

package/package.json

@@ -1,9 +1,10 @@
 {
   "name": "@zkmake/three-audit",
-  "version": "0.3.2",
-  "description": "Scene checks for three.js: triangle counts, cost census, NaN normals, z-fighting, black frames and a one-frame draw-call ledger. Zero dependencies.",
+  "version": "0.4.0",
+  "description": "Scene checks for three.js: triangle counts, cost census, NaN normals, z-fighting, black frames, a one-frame draw-call ledger, and per-app budgets with Vitest matchers. Zero dependencies.",
   "keywords": [
     "audit",
+    "budgets",
     "devtools",
     "draw-calls",
     "lint",
@@ -11,6 +12,7 @@
     "three",
     "threejs",
     "triangles",
+    "vitest",
     "z-fighting"
   ],
   "homepage": "https://zkmake.github.io/three-kit/three-audit/",
@@ -23,7 +25,7 @@
     "directory": "packages/three-audit"
   },
   "bin": {
-    "three-audit": "./dist/cli.js"
+    "three-audit": "dist/cli.js"
   },
   "files": [
     "dist",
@@ -31,10 +33,13 @@
     "LICENSE"
   ],
   "type": "module",
-  "sideEffects": false,
+  "sideEffects": [
+    "./dist/vitest.js"
+  ],
   "exports": {
     ".": "./dist/index.js",
     "./node": "./dist/node.js",
+    "./vitest": "./dist/vitest.js",
     "./package.json": "./package.json"
   },
   "publishConfig": {
@@ -63,7 +68,8 @@
   "peerDependencies": {
     "draco3dgltf": ">=1.5",
     "meshoptimizer": ">=0.21",
-    "three": ">=0.160"
+    "three": ">=0.160",
+    "vitest": ">=5"
   },
   "peerDependenciesMeta": {
     "draco3dgltf": {
@@ -71,6 +77,9 @@
     },
     "meshoptimizer": {
       "optional": true
+    },
+    "vitest": {
+      "optional": true
     }
   },
   "engines": {

package/dist/audit-scene-Da-8SA1x.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"audit-scene-Da-8SA1x.js","names":[],"sources":["../src/scene.ts","../src/bad-geometry.ts","../src/triangles.ts","../src/z-fighting.ts","../src/audit-scene.ts"],"sourcesContent":["/**\n * Scene-graph plumbing every check shares: the walk, mesh kinds, triangle counts, tags and names.\n *\n * Nothing here imports three at runtime; objects are recognised by three's own `is*` flags, so the\n * checks work on whatever copy of three the app bundles.\n */\nimport type { BatchedMesh, BufferGeometry, InstancedMesh, Material, Mesh, Object3D } from \"three\";\n\n/**\n * Any three.js object, from whichever copy of three's types the app has. The checks take this, so\n * an app on a newer `@types/three` than this package was built against passes its scene as is.\n */\nexport type AnyObject3D = { readonly isObject3D: true; readonly children: readonly object[] };\n\n/** The object as three's own type, for the walk. */\nexport const asObject3D = (object: AnyObject3D) => object as unknown as Object3D;\n\n/** Leave an object and everything under it out of a check. */\nexport type Skip = (object: Object3D) => boolean;\n\n/**\n * What a check sees of a bake (`@zkmake/three-batch`'s `bake` and `<Baked>`), which hides its\n * parts and draws one merged mesh per material instead. `sources`: the parts, as if shown, and not\n * the merge, so rows name real parts. `merged`: what the renderer draws.\n */\nexport type Bakes = \"sources\" | \"merged\";\n\nexport type WalkOptions = {\n  skip?: Skip | undefined;\n  /** Prune hidden objects and their subtrees, as the renderer does. */\n  visibleOnly?: boolean;\n  /** With `sources`: prune bake results, and walk the parts a bake hid as though visible. */\n  bakes?: Bakes | undefined;\n};\n\n/**\n * A part a bake hid in favour of its merge: flagged `userData.bakeSource` by three-batch, or (for\n * bakes from before that flag) inside an object that holds a `userData.bakedResult` merge.\n */\nexport const isBakeSource = (object: Object3D) => {\n  if (object.userData.bakeSource === true) {\n    return true;\n  }\n\n  for (let at = object.parent; at; at = at.parent) {\n    if (at.children.some((child) => child.userData.bakedResult === true)) {\n      return true;\n    }\n  }\n\n  return false;\n};\n\n/** Depth-first, in child order. A skipped (or, with `visibleOnly`, hidden) object prunes its subtree. */\nexport const walk = (root: Object3D, options: WalkOptions, visit: (object: Object3D) => void) => {\n  const stack = [root];\n  const sources = options.bakes === \"sources\";\n\n  while (stack.length > 0) {\n    const object = stack.pop()!;\n\n    if (\n      (sources && object.userData.bakedResult === true) ||\n      (options.visibleOnly === true && !object.visible && !(sources && isBakeSource(object))) ||\n      options.skip?.(object) === true\n    ) {\n      continue;\n    }\n\n    visit(object);\n\n    for (let i = object.children.length - 1; i >= 0; i -= 1) {\n      stack.push(object.children[i]!);\n    }\n  }\n};\n\nexport const isMesh = (object: Object3D): object is Mesh => (object as Mesh).isMesh === true;\n\n/** Anything the renderer draws: a mesh, line, point cloud or sprite. */\nexport const isDrawable = (object: Object3D) => {\n  const flags = object as Partial<Record<\"isMesh\" | \"isLine\" | \"isPoints\" | \"isSprite\", boolean>>;\n\n  return (\n    flags.isMesh === true ||\n    flags.isLine === true ||\n    flags.isPoints === true ||\n    flags.isSprite === true\n  );\n};\n\nexport const isInstanced = (mesh: Mesh): mesh is InstancedMesh =>\n  (mesh as InstancedMesh).isInstancedMesh === true;\n\nexport const isBatched = (mesh: Mesh): mesh is BatchedMesh =>\n  (mesh as unknown as BatchedMesh).isBatchedMesh === true;\n\n/** Triangles one draw of this geometry makes: indexed or not, within its draw range. */\nexport const triangleCount = (geometry: BufferGeometry) => {\n  const elements = geometry.index?.count ?? geometry.attributes.position?.count ?? 0;\n  const { start, count } = geometry.drawRange;\n  const drawn = Math.min(elements, start + count) - start;\n\n  return Math.max(0, Math.floor(drawn / 3));\n};\n\n/**\n * A batch's visible instances by the geometry each draws: how many, and that geometry's triangles\n * (its range in the shared buffer). In first-drawn order.\n */\nexport const batchedGeometries = (batch: BatchedMesh) => {\n  const geometries = new Map<number, { instances: number; triangles: number }>();\n\n  for (let id = 0; id < batch.maxInstanceCount; id += 1) {\n    let geometryId: number;\n\n    // Deleted and never-used ids throw.\n    try {\n      if (!batch.getVisibleAt(id)) {\n        continue;\n      }\n\n      geometryId = batch.getGeometryIdAt(id);\n    } catch {\n      continue;\n    }\n\n    const known = geometries.get(geometryId);\n\n    if (known) {\n      known.instances += 1;\n      continue;\n    }\n\n    const range = batch.getGeometryRangeAt(geometryId) as {\n      count?: number;\n      indexCount: number;\n      vertexCount: number;\n    };\n    const elements = range.count ?? (batch.geometry.index ? range.indexCount : range.vertexCount);\n\n    geometries.set(geometryId, { instances: 1, triangles: Math.floor(elements / 3) });\n  }\n\n  return geometries;\n};\n\n/** Triangles a batch draws across its visible instances, and how many instances that is. */\nexport const batchedTriangles = (batch: BatchedMesh) => {\n  let triangles = 0;\n  let instances = 0;\n\n  for (const geometry of batchedGeometries(batch).values()) {\n    triangles += geometry.triangles * geometry.instances;\n    instances += geometry.instances;\n  }\n\n  return { instances, triangles };\n};\n\n/** The tag of the nearest tagged ancestor (the object itself included), or `null`. */\nexport const tagOf = (object: Object3D, tagKey: string) => {\n  for (let at: Object3D | null = object; at; at = at.parent) {\n    const tag: unknown = at.userData[tagKey];\n\n    if (tag !== undefined && tag !== null) {\n      return String(tag);\n    }\n  }\n\n  return null;\n};\n\n/**\n * A skip that keeps only what's tagged `tag`: prunes objects tagged otherwise, and meshes outside\n * any object tagged `tag`. Throws when nothing under `root` carries the tag.\n */\nexport const onlyTag = (root: Object3D, tag: string, tagKey: string, skip?: Skip): Skip => {\n  let found = false;\n\n  walk(root, { skip }, (object) => {\n    const own: unknown = object.userData[tagKey];\n\n    found ||= own !== undefined && own !== null && String(own) === tag;\n  });\n\n  if (!found) {\n    throw new Error(`three-audit: nothing is tagged userData.${tagKey} = \"${tag}\"`);\n  }\n\n  return (object) => {\n    if (skip?.(object) === true) {\n      return true;\n    }\n\n    const own: unknown = object.userData[tagKey];\n\n    if (own !== undefined && own !== null && String(own) !== tag) {\n      return true;\n    }\n\n    return isDrawable(object) && tagOf(object, tagKey) !== tag;\n  };\n};\n\nexport const hasTag = (root: Object3D, tagKey: string, skip?: Skip) => {\n  let found = false;\n\n  walk(root, { skip }, (object) => {\n    found ||= object.userData[tagKey] !== undefined && object.userData[tagKey] !== null;\n  });\n\n  return found;\n};\n\nexport const meshName = (mesh: Mesh) => mesh.name || mesh.geometry.name || mesh.geometry.type;\n\n/**\n * The named ancestors above an object, outermost first, from `root` (included when named) down:\n * at most the nearest `depth`, with `…` for the rest. An unnamed ancestor carrying `tagKey` goes\n * by its tag.\n */\nexport const pathOf = (object: Object3D, root: Object3D | null, tagKey?: string, depth = 3) => {\n  const names: string[] = [];\n\n  for (let at = object.parent; at; at = at === root ? null : at.parent) {\n    const tag: unknown = tagKey === undefined ? undefined : at.userData[tagKey];\n    const name = at.name || (tag === undefined || tag === null ? \"\" : String(tag));\n\n    if (name) {\n      names.unshift(name);\n    }\n  }\n\n  return names.length > depth ? [\"…\", ...names.slice(-depth)] : names;\n};\n\n/** `path/to/mesh [material]`: enough to find a mesh in the scene without walking it by hand. */\nexport const meshLabel = (mesh: Mesh, root: Object3D | null, tagKey?: string) =>\n  `${[...pathOf(mesh, root, tagKey), meshName(mesh)].join(\"/\")} [${materialName(mesh)}]`;\n\nexport const materialName = (mesh: Mesh) => {\n  const material = (Array.isArray(mesh.material) ? mesh.material[0] : mesh.material) as\n    | Material\n    | undefined;\n\n  return material ? material.name || material.type : \"none\";\n};\n\n/** Adds a property JSON and `console.table` leave out: a live object that would serialise the scene. */\nexport const withHidden = <Row extends object, Key extends string, Value>(\n  row: Row,\n  key: Key,\n  value: Value,\n) => Object.defineProperty(row, key, { value, enumerable: false }) as Row & Record<Key, Value>;\n","/**\n * Geometry that lights a pixel NaN: a non-finite position or normal, or a zero-length normal on a\n * triangle with area. Bloom and other blurs spread one NaN pixel into a black block.\n */\nimport type { BufferGeometry, Mesh } from \"three\";\n\nimport {\n  type AnyObject3D,\n  asObject3D,\n  type Bakes,\n  isMesh,\n  meshLabel,\n  meshName,\n  type Skip,\n  tagOf,\n  walk,\n  withHidden,\n} from \"./scene.ts\";\n\nexport type BadGeometryOptions = {\n  skip?: Skip | undefined;\n  /** `userData` key naming the part a mesh belongs to, for the `under` column. */\n  tagKey?: string;\n  /** A bake's parts (default), or its merged meshes: see `Bakes`. Not both, or each counts twice. */\n  bakes?: Bakes | undefined;\n};\n\nexport type BadGeometryRow = {\n  mesh: string;\n  /** The tagged part it sits in, or its parent's name. */\n  under: string;\n  /** Vertices with a NaN or infinite position or normal component. */\n  nonFinite: number;\n  /** Vertices of triangles with area whose normal has no length. */\n  zeroNormals: number;\n  /** Not enumerable: kept out of JSON and `console.table`. */\n  readonly object: Mesh;\n};\n\nconst corner = (geometry: BufferGeometry, k: number) => geometry.index?.getX(k) ?? k;\n\nconst check = (geometry: BufferGeometry) => {\n  const position = geometry.attributes.position!;\n  const normal = geometry.attributes.normal;\n  const flagged = new Uint8Array(position.count);\n  let nonFinite = 0;\n  let zeroNormals = 0;\n\n  for (let v = 0; v < position.count; v += 1) {\n    const finite =\n      Number.isFinite(position.getX(v)) &&\n      Number.isFinite(position.getY(v)) &&\n      Number.isFinite(position.getZ(v)) &&\n      (!normal ||\n        (Number.isFinite(normal.getX(v)) &&\n          Number.isFinite(normal.getY(v)) &&\n          Number.isFinite(normal.getZ(v))));\n\n    if (!finite) {\n      flagged[v] = 1;\n      nonFinite += 1;\n    }\n  }\n\n  if (!normal) {\n    return { nonFinite, zeroNormals };\n  }\n\n  const corners = geometry.index?.count ?? position.count;\n\n  for (let k = 0; k + 2 < corners; k += 3) {\n    const a = corner(geometry, k);\n    const b = corner(geometry, k + 1);\n    const c = corner(geometry, k + 2);\n    const ux = position.getX(b) - position.getX(a);\n    const uy = position.getY(b) - position.getY(a);\n    const uz = position.getZ(b) - position.getZ(a);\n    const vx = position.getX(c) - position.getX(a);\n    const vy = position.getY(c) - position.getY(a);\n    const vz = position.getZ(c) - position.getZ(a);\n    const area = Math.hypot(uy * vz - uz * vy, uz * vx - ux * vz, ux * vy - uy * vx);\n\n    if (!(area > 1e-8)) {\n      continue;\n    }\n\n    for (const v of [a, b, c]) {\n      if (flagged[v] === 0 && Math.hypot(normal.getX(v), normal.getY(v), normal.getZ(v)) < 1e-4) {\n        flagged[v] = 1;\n        zeroNormals += 1;\n      }\n    }\n  }\n\n  return { nonFinite, zeroNormals };\n};\n\n/** Meshes with geometry that renders NaN, hidden ones included. `[]` is a pass. */\nexport const findBadGeometry = (\n  root: AnyObject3D,\n  options: BadGeometryOptions = {},\n): BadGeometryRow[] => {\n  const tagKey = options.tagKey ?? \"studioObject\";\n  const rows: BadGeometryRow[] = [];\n\n  walk(asObject3D(root), { skip: options.skip, bakes: options.bakes ?? \"sources\" }, (object) => {\n    if (!isMesh(object) || !object.geometry.attributes.position) {\n      return;\n    }\n\n    const { nonFinite, zeroNormals } = check(object.geometry);\n\n    if (nonFinite > 0 || zeroNormals > 0) {\n      const under = tagOf(object, tagKey) ?? object.parent?.name ?? \"\";\n\n      rows.push(\n        withHidden({ mesh: meshName(object), under, nonFinite, zeroNormals }, \"object\", object),\n      );\n    }\n  });\n\n  return rows;\n};\n\nexport type EmptyMeshRow = {\n  /** `path/to/mesh [material]`. */\n  mesh: string;\n  /** Not enumerable: kept out of JSON and `console.table`. */\n  readonly object: Mesh;\n};\n\n/**\n * Meshes with no vertices, hidden ones included: what a merge of nothing leaves behind. They draw\n * nothing, but each one is still a draw call and a leak to dispose. A draw range of zero doesn't\n * count: that's usually a pool waiting to fill.\n */\nexport const findEmptyMeshes = (\n  root: AnyObject3D,\n  options: BadGeometryOptions = {},\n): EmptyMeshRow[] => {\n  const scene = asObject3D(root);\n  const rows: EmptyMeshRow[] = [];\n\n  walk(scene, { skip: options.skip, bakes: options.bakes ?? \"sources\" }, (object) => {\n    if (isMesh(object) && (object.geometry.attributes.position?.count ?? 0) === 0) {\n      rows.push(\n        withHidden(\n          { mesh: meshLabel(object, scene, options.tagKey ?? \"studioObject\") },\n          \"object\",\n          object,\n        ),\n      );\n    }\n  });\n\n  return rows;\n};\n","/**\n * Where a triangle budget goes: the total one pass draws, the meshes drawing it, and the\n * geometries behind them.\n */\nimport type { BatchedMesh, Mesh } from \"three\";\n\nimport {\n  type AnyObject3D,\n  asObject3D,\n  batchedGeometries,\n  batchedTriangles,\n  isBatched,\n  isDrawable,\n  isInstanced,\n  isMesh,\n  materialName,\n  meshName,\n  pathOf,\n  type Skip,\n  triangleCount,\n  walk,\n  withHidden,\n} from \"./scene.ts\";\n\nexport type TriangleOptions = { skip?: Skip | undefined };\n\nexport type MeshRow = {\n  /** `path/to/mesh`: its named ancestors, then its name (or its geometry's name or type). */\n  name: string;\n  material: string;\n  /** Triangles in one copy. A batch's is an average: `geometryCensus` breaks it down. */\n  triangles: number;\n  instances: number;\n  total: number;\n  /** Not enumerable: kept out of JSON and `console.table`. */\n  readonly mesh: Mesh;\n};\n\nexport type GeometryRow = {\n  /**\n   * `geometry.name`, or its type and the start of its uuid. For a geometry in a batch, the batch's\n   * `label` for it, or `batch#id`.\n   */\n  geometry: string;\n  /** Copies drawn: every mesh using it, instances counted. */\n  uses: number;\n  triangles: number;\n  total: number;\n  /** Its part of the census's total, 0–1. */\n  share: number;\n  /** With `budget`: whether `share` is over it. */\n  overBudget?: boolean;\n};\n\nexport type CensusOptions = TriangleOptions & {\n  /**\n   * Names a geometry inside a batch, e.g. from the app's own table of what it added. Default\n   * `batch#id`, the batch named by its path.\n   */\n  label?: ((batch: BatchedMesh, geometryId: number) => string | undefined) | undefined;\n  /** Flag rows whose share of the total is over this, 0–1: `0.2` for anything over 20%. */\n  budget?: number | undefined;\n};\n\nconst cost = (mesh: Mesh) => {\n  if (isBatched(mesh)) {\n    return batchedTriangles(mesh);\n  }\n\n  const instances = isInstanced(mesh) ? mesh.count : 1;\n\n  return { instances, triangles: triangleCount(mesh.geometry) * instances };\n};\n\n/**\n * Triangles one pass draws: visible meshes, instances counted, no frustum culling. A shadow pass\n * adds roughly as much again for each shadow-casting light.\n */\nexport const countTriangles = (root: AnyObject3D, options: TriangleOptions = {}) => {\n  let total = 0;\n\n  walk(asObject3D(root), { skip: options.skip, visibleOnly: true }, (object) => {\n    if (isMesh(object)) {\n      total += cost(object).triangles;\n    }\n  });\n\n  return total;\n};\n\n/** Every visible mesh, most triangles drawn first. */\nexport const listMeshes = (scene: AnyObject3D, options: TriangleOptions = {}): MeshRow[] => {\n  const root = asObject3D(scene);\n  const rows: MeshRow[] = [];\n\n  walk(root, { skip: options.skip, visibleOnly: true }, (object) => {\n    if (!isMesh(object)) {\n      return;\n    }\n\n    const { instances, triangles } = cost(object);\n    const row = {\n      name: [...pathOf(object, root), meshName(object)].join(\"/\"),\n      material: materialName(object),\n      triangles: instances > 0 ? Math.round(triangles / instances) : 0,\n      instances,\n      total: triangles,\n    };\n\n    rows.push(withHidden(row, \"mesh\", object));\n  });\n\n  return rows.sort((a, b) => b.total - a.total);\n};\n\n/**\n * Geometries by triangles drawn, hidden meshes included, most first. Name geometries\n * (`geometry.name`) to make this readable. A batch counts each geometry in it separately, by its\n * visible instances: the row a budget is really spent on.\n */\nexport const geometryCensus = (root: AnyObject3D, options: CensusOptions = {}): GeometryRow[] => {\n  const scene = asObject3D(root);\n  const rows = new Map<string, GeometryRow>();\n  const add = (key: string, triangles: number, uses: number) => {\n    const row = rows.get(key) ?? { geometry: key, uses: 0, triangles, total: 0, share: 0 };\n\n    row.uses += uses;\n    row.total += triangles * uses;\n    rows.set(key, row);\n  };\n\n  walk(scene, { skip: options.skip }, (object) => {\n    if (!isMesh(object) || !object.geometry.attributes.position) {\n      return;\n    }\n\n    if (isBatched(object)) {\n      const name = [...pathOf(object, scene), meshName(object)].join(\"/\");\n\n      for (const [id, { instances, triangles }] of batchedGeometries(object)) {\n        add(options.label?.(object, id) ?? `${name}#${id}`, triangles, instances);\n      }\n\n      return;\n    }\n\n    const geometry = object.geometry;\n\n    add(\n      geometry.name || `${geometry.type}:${geometry.uuid.slice(0, 6)}`,\n      triangleCount(geometry),\n      isInstanced(object) ? object.count : 1,\n    );\n  });\n\n  const all = [...rows.values()];\n  const sum = all.reduce((total, row) => total + row.total, 0);\n\n  for (const row of all) {\n    row.share = sum > 0 ? Math.round((row.total / sum) * 1000) / 1000 : 0;\n\n    if (options.budget !== undefined) {\n      row.overBudget = row.total / Math.max(sum, 1) > options.budget;\n    }\n  }\n\n  return all.sort((a, b) => b.total - a.total);\n};\n\n/**\n * Draw calls one main pass makes: one per visible mesh, line or point cloud, or one per material\n * group for a mesh with several materials. Before frustum culling; each shadow-casting light adds\n * one per caster. `recordDrawLedger` counts the real thing.\n */\nexport const countDraws = (root: AnyObject3D, options: TriangleOptions = {}) => {\n  let draws = 0;\n\n  walk(asObject3D(root), { skip: options.skip, visibleOnly: true }, (object) => {\n    if (!isDrawable(object)) {\n      return;\n    }\n\n    const drawable = object as Partial<Mesh>;\n\n    const material = drawable.material;\n\n    if (Array.isArray(material)) {\n      const groups = drawable.geometry?.groups ?? [];\n\n      draws += groups.filter(\n        (group) => material[group.materialIndex ?? 0]?.visible !== false,\n      ).length;\n    } else if (material?.visible !== false) {\n      draws += 1;\n    }\n  });\n\n  return draws;\n};\n","/**\n * Z-fighting found by geometry instead of by eye: pairs of meshes with triangles in (nearly) one\n * plane, facing the same way, overlapping. Those flicker wherever depth precision runs out.\n *\n * Triangles are bucketed by their quantised plane (normal and offset), so only triangles in\n * neighbouring buckets are compared. A pair counts only when each triangle's corners lie within\n * `gap` of the other's plane, measured at the triangles: the offsets are measured from the world\n * origin, and far from it two faces a degree or two apart can share one while metres apart where\n * they stand. Overlap in the shared plane is a separating-axis test, then clipped for its area.\n *\n * A bake's hidden parts are checked in place of its merge (`bakes`). Left out, as they can't\n * fight: other hidden objects, instanced and batched meshes (and geometry a\n * shader positions, `InstancedBufferGeometry`), pairs where neither side writes depth or one\n * doesn't test it, and pairs where either material has a polygon offset (the usual decal fix).\n */\nimport type { Material, Mesh } from \"three\";\n\nimport {\n  type AnyObject3D,\n  asObject3D,\n  type Bakes,\n  hasTag,\n  isBatched,\n  isInstanced,\n  isMesh,\n  meshLabel,\n  type Skip,\n  tagOf,\n  walk,\n  withHidden,\n} from \"./scene.ts\";\n\nexport type ZFightingOptions = {\n  /**\n   * How close two planes count as one, in world units. 0.004 (4 mm at 1 unit = 1 m) is about what\n   * depth precision loses with a camera ~50 m out. Scale it with your units.\n   */\n  gap?: number;\n  /** Also compare triangles within one mesh: for merged geometry whose parts share a buffer. */\n  self?: boolean;\n  /**\n   * Only meshes inside a tagged object (`userData[tagKey]`), so a studio's ground and props stay\n   * out. Defaults to true when anything under the root is tagged, false otherwise.\n   */\n  tagged?: boolean;\n  tagKey?: string;\n  skip?: Skip | undefined;\n  /**\n   * A bake's parts (default), or its merged meshes: see `Bakes`. The parts name what to fix; the\n   * merge is the same faces under one name.\n   */\n  bakes?: Bakes | undefined;\n};\n\nexport type ZFightingRow = {\n  /** `path/to/mesh [material] @ (x, y, z)`: named ancestors, and the centre in world space. */\n  a: string;\n  b: string;\n  /** Overlapping triangle pairs between the two. */\n  triangles: number;\n  /**\n   * The planes they share, most overlap first: `z = -3.000, facing +z` when axis-aligned, else\n   * `(nx, ny, nz) · p = d`. Both faces point along the normal: opposite-facing faces never pair.\n   */\n  planes: string[];\n  /** Where they overlap: the area in world units², and its centre in world space. */\n  overlap: { area: number; centre: [number, number, number] };\n  /** Identical pairs (same labels, triangles and planes) folded into this row. */\n  count: number;\n  /** Not enumerable: kept out of JSON and `console.table`. The first pair folded in. */\n  readonly meshes: readonly [Mesh, Mesh];\n  /** Not enumerable: every pair folded in. */\n  readonly pairs: readonly (readonly [Mesh, Mesh])[];\n};\n\n/** Normals quantised to 1/40: neighbouring buckets are searched, so this only sets bucket size. */\nconst QUANT = 40;\n/** Normals this aligned count as parallel (about 2.6°). */\nconst PARALLEL = 0.999;\n\ntype Part = {\n  mesh: Mesh;\n  label: string;\n  min: number[];\n  max: number[];\n  /** Some material writes depth / tests it / offsets it. */\n  writes: boolean;\n  tests: boolean;\n  offset: boolean;\n};\n\nconst round = (value: number, places = 2) => {\n  const scale = 10 ** places;\n  const rounded = Math.round(value * scale) / scale;\n\n  return rounded === 0 ? 0 : rounded;\n};\n\nconst labelOf = (part: Part) => {\n  const centre = part.min.map((low, axis) => round((low + part.max[axis]!) / 2));\n\n  return `${part.label} @ (${centre.join(\", \")})`;\n};\n\nconst fixed = (value: number) => round(value, 3).toFixed(3);\n\n/** `z = -3.000, facing +z` for an axis-aligned plane, `(nx, ny, nz) · p = d` for any other. */\nconst planeLabel = (nx: number, ny: number, nz: number, d: number) => {\n  for (const [axis, value] of [\n    [\"x\", nx],\n    [\"y\", ny],\n    [\"z\", nz],\n  ] as const) {\n    if (Math.abs(value) > 0.9999) {\n      return `${axis} = ${fixed(d / value)}, facing ${value > 0 ? \"+\" : \"-\"}${axis}`;\n    }\n  }\n\n  return `(${fixed(nx)}, ${fixed(ny)}, ${fixed(nz)}) · p = ${fixed(d)}`;\n};\n\nconst materialsOf = (mesh: Mesh) =>\n  (Array.isArray(mesh.material) ? mesh.material : [mesh.material]).filter(\n    (material): material is Material => material !== undefined && material !== null,\n  );\n\n/** Whether two parts can fight: one writes depth the other tests, and neither is offset. */\nconst canFight = (a: Part, b: Part) =>\n  !a.offset && !b.offset && ((a.writes && b.tests) || (b.writes && a.tests));\n\n/** Pairs of meshes that z-fight, most overlapping triangles first. `[]` is a pass. */\nexport const findZFighting = (\n  scene: AnyObject3D,\n  options: ZFightingOptions = {},\n): ZFightingRow[] => {\n  const root = asObject3D(scene);\n  const gap = options.gap ?? 0.004;\n  const self = options.self ?? false;\n  const tagKey = options.tagKey ?? \"studioObject\";\n  const tagged = options.tagged ?? hasTag(root, tagKey, options.skip);\n\n  root.updateWorldMatrix(true, true);\n\n  const parts: Part[] = [];\n  // Per triangle: its part, plane (nx, ny, nz, d) and world corners (9 numbers).\n  const owner: number[] = [];\n  const planes: number[] = [];\n  const corners: number[] = [];\n  const keys: [number, number, number, number][] = [];\n  const buckets = new Map<string, number[]>();\n  const keyOf = (x: number, y: number, z: number, d: number) => `${x},${y},${z},${d}`;\n\n  walk(\n    root,\n    { skip: options.skip, visibleOnly: true, bakes: options.bakes ?? \"sources\" },\n    (object) => {\n      if (\n        !isMesh(object) ||\n        isInstanced(object) ||\n        isBatched(object) ||\n        (object.geometry as { isInstancedBufferGeometry?: boolean }).isInstancedBufferGeometry ===\n          true ||\n        !object.geometry.attributes.position\n      ) {\n        return;\n      }\n\n      if (tagged && tagOf(object, tagKey) === null) {\n        return;\n      }\n\n      const materials = materialsOf(object).filter((material) => material.visible !== false);\n\n      if (materials.length === 0) {\n        return;\n      }\n\n      const part = parts.length;\n      const { index, attributes } = object.geometry;\n      const position = attributes.position!;\n      const e = object.matrixWorld.elements;\n      const min = [Infinity, Infinity, Infinity];\n      const max = [-Infinity, -Infinity, -Infinity];\n      const count = index?.count ?? position.count;\n      const world = [0, 0, 0, 0, 0, 0, 0, 0, 0];\n\n      parts.push({\n        mesh: object,\n        label: meshLabel(object, root, tagKey),\n        min,\n        max,\n        writes: materials.some((material) => material.depthWrite !== false),\n        tests: materials.some((material) => material.depthTest !== false),\n        offset: materials.some(\n          (material) =>\n            material.polygonOffset === true &&\n            (material.polygonOffsetFactor !== 0 || material.polygonOffsetUnits !== 0),\n        ),\n      });\n\n      for (let k = 0; k + 2 < count; k += 3) {\n        for (let c = 0; c < 3; c += 1) {\n          const v = index?.getX(k + c) ?? k + c;\n          const x = position.getX(v);\n          const y = position.getY(v);\n          const z = position.getZ(v);\n\n          for (let axis = 0; axis < 3; axis += 1) {\n            const value = e[axis]! * x + e[axis + 4]! * y + e[axis + 8]! * z + e[axis + 12]!;\n\n            world[c * 3 + axis] = value;\n            min[axis] = Math.min(min[axis]!, value);\n            max[axis] = Math.max(max[axis]!, value);\n          }\n        }\n\n        const [ax, ay, az, bx, by, bz, cx, cy, cz] = world as [\n          number,\n          number,\n          number,\n          number,\n          number,\n          number,\n          number,\n          number,\n          number,\n        ];\n        const ux = bx - ax;\n        const uy = by - ay;\n        const uz = bz - az;\n        const vx = cx - ax;\n        const vy = cy - ay;\n        const vz = cz - az;\n        let nx = uy * vz - uz * vy;\n        let ny = uz * vx - ux * vz;\n        let nz = ux * vy - uy * vx;\n        const length = Math.hypot(nx, ny, nz);\n\n        // Slivers under ~1e-5 m² show nothing.\n        if (!(length / 2 >= 1e-5)) {\n          continue;\n        }\n\n        nx /= length;\n        ny /= length;\n        nz /= length;\n\n        const d = nx * ax + ny * ay + nz * az;\n        const id = owner.length;\n        const key: [number, number, number, number] = [\n          Math.round(nx * QUANT),\n          Math.round(ny * QUANT),\n          Math.round(nz * QUANT),\n          Math.round(d / gap),\n        ];\n        const bucket = buckets.get(keyOf(...key));\n\n        owner.push(part);\n        planes.push(nx, ny, nz, d);\n        corners.push(...world);\n        keys.push(key);\n\n        if (bucket) {\n          bucket.push(id);\n        } else {\n          buckets.set(keyOf(...key), [id]);\n        }\n      }\n    },\n  );\n\n  // Overlap in s's plane, with a margin so triangles merely sharing an edge don't count.\n  const margin = gap / 2;\n  const flat = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0];\n  // s's plane axes from the last `overlaps`: u, then v.\n  const frame = [0, 0, 0, 0, 0, 0];\n\n  const overlaps = (s: number, t: number) => {\n    const S = s * 9;\n    const T = t * 9;\n    let ux = corners[S + 3]! - corners[S]!;\n    let uy = corners[S + 4]! - corners[S + 1]!;\n    let uz = corners[S + 5]! - corners[S + 2]!;\n    const length = Math.hypot(ux, uy, uz) || 1;\n\n    ux /= length;\n    uy /= length;\n    uz /= length;\n\n    const nx = planes[s * 4]!;\n    const ny = planes[s * 4 + 1]!;\n    const nz = planes[s * 4 + 2]!;\n    const vx = ny * uz - nz * uy;\n    const vy = nz * ux - nx * uz;\n    const vz = nx * uy - ny * ux;\n\n    frame[0] = ux;\n    frame[1] = uy;\n    frame[2] = uz;\n    frame[3] = vx;\n    frame[4] = vy;\n    frame[5] = vz;\n\n    // Corners 0–2 are s, 3–5 are t, as (x, y) in the plane.\n    for (let i = 0; i < 6; i += 1) {\n      const at = i < 3 ? S + i * 3 : T + (i - 3) * 3;\n      const px = corners[at]!;\n      const py = corners[at + 1]!;\n      const pz = corners[at + 2]!;\n\n      flat[i * 2] = px * ux + py * uy + pz * uz;\n      flat[i * 2 + 1] = px * vx + py * vy + pz * vz;\n    }\n\n    for (let edge = 0; edge < 6; edge += 1) {\n      const from = edge;\n      const to = edge < 3 ? (edge + 1) % 3 : 3 + ((edge + 1) % 3);\n      const ex = flat[to * 2]! - flat[from * 2]!;\n      const ey = flat[to * 2 + 1]! - flat[from * 2 + 1]!;\n      const edgeLength = Math.hypot(ex, ey) || 1;\n      const axisX = -ey / edgeLength;\n      const axisY = ex / edgeLength;\n      let p0 = Infinity;\n      let p1 = -Infinity;\n      let q0 = Infinity;\n      let q1 = -Infinity;\n\n      for (let i = 0; i < 6; i += 1) {\n        const value = flat[i * 2]! * axisX + flat[i * 2 + 1]! * axisY;\n\n        if (i < 3) {\n          p0 = Math.min(p0, value);\n          p1 = Math.max(p1, value);\n        } else {\n          q0 = Math.min(q0, value);\n          q1 = Math.max(q1, value);\n        }\n      }\n\n      if (Math.min(p1, q1) - Math.max(p0, q0) < margin) {\n        return false;\n      }\n    }\n\n    return true;\n  };\n\n  /**\n   * The overlap `overlaps` just found, as area and centroid in s's plane: t's triangle clipped to\n   * s's (Sutherland–Hodgman), then the shoelace formula.\n   */\n  const clipped = () => {\n    const turn =\n      (flat[2]! - flat[0]!) * (flat[5]! - flat[1]!) - (flat[4]! - flat[0]!) * (flat[3]! - flat[1]!);\n    // s's corners counter-clockwise.\n    const order = turn >= 0 ? [0, 1, 2] : [0, 2, 1];\n    let polygon = flat.slice(6, 12);\n\n    for (let edge = 0; edge < 3 && polygon.length >= 6; edge += 1) {\n      const ax = flat[order[edge]! * 2]!;\n      const ay = flat[order[edge]! * 2 + 1]!;\n      const ex = flat[order[(edge + 1) % 3]! * 2]! - ax;\n      const ey = flat[order[(edge + 1) % 3]! * 2 + 1]! - ay;\n      const next: number[] = [];\n      const n = polygon.length / 2;\n\n      for (let i = 0; i < n; i += 1) {\n        const px = polygon[i * 2]!;\n        const py = polygon[i * 2 + 1]!;\n        const qx = polygon[((i + 1) % n) * 2]!;\n        const qy = polygon[((i + 1) % n) * 2 + 1]!;\n        const dp = ex * (py - ay) - ey * (px - ax);\n        const dq = ex * (qy - ay) - ey * (qx - ax);\n\n        if (dp >= 0) {\n          next.push(px, py);\n        }\n\n        if (dp >= 0 !== dq >= 0) {\n          const k = dp / (dp - dq);\n\n          next.push(px + (qx - px) * k, py + (qy - py) * k);\n        }\n      }\n\n      polygon = next;\n    }\n\n    let twice = 0;\n    let cx = 0;\n    let cy = 0;\n    const n = polygon.length / 2;\n\n    for (let i = 0; i < n; i += 1) {\n      const x0 = polygon[i * 2]!;\n      const y0 = polygon[i * 2 + 1]!;\n      const x1 = polygon[((i + 1) % n) * 2]!;\n      const y1 = polygon[((i + 1) % n) * 2 + 1]!;\n      const cross = x0 * y1 - x1 * y0;\n\n      twice += cross;\n      cx += (x0 + x1) * cross;\n      cy += (y0 + y1) * cross;\n    }\n\n    return Math.abs(twice) < 1e-12\n      ? { area: 0, x: 0, y: 0 }\n      : { area: Math.abs(twice) / 2, x: cx / (3 * twice), y: cy / (3 * twice) };\n  };\n\n  // Every corner of t within `gap` of s's plane, measured where t stands.\n  const onPlane = (s: number, t: number) => {\n    const nx = planes[s * 4]!;\n    const ny = planes[s * 4 + 1]!;\n    const nz = planes[s * 4 + 2]!;\n    const d = planes[s * 4 + 3]!;\n\n    for (let c = 0; c < 3; c += 1) {\n      const at = t * 9 + c * 3;\n\n      if (Math.abs(nx * corners[at]! + ny * corners[at + 1]! + nz * corners[at + 2]! - d) > gap) {\n        return false;\n      }\n    }\n\n    return true;\n  };\n\n  type Pair = {\n    a: number;\n    b: number;\n    triangles: number;\n    area: number;\n    /** Area-weighted sums of the overlap's centre. */\n    centre: [number, number, number];\n    planes: Map<string, number>;\n  };\n\n  const pairs = new Map<string, Pair>();\n\n  // Every neighbouring bucket, so near-equal planes that round apart still meet.\n  for (let s = 0; s < owner.length; s += 1) {\n    const [kx, ky, kz, kd] = keys[s]!;\n\n    for (let i = -1; i <= 1; i += 1) {\n      for (let j = -1; j <= 1; j += 1) {\n        for (let k = -1; k <= 1; k += 1) {\n          for (let l = -1; l <= 1; l += 1) {\n            for (const t of buckets.get(keyOf(kx + i, ky + j, kz + k, kd + l)) ?? []) {\n              const a = owner[s]!;\n              const b = owner[t]!;\n\n              if (\n                t <= s ||\n                (a === b && !self) ||\n                !canFight(parts[a]!, parts[b]!) ||\n                planes[s * 4]! * planes[t * 4]! +\n                  planes[s * 4 + 1]! * planes[t * 4 + 1]! +\n                  planes[s * 4 + 2]! * planes[t * 4 + 2]! <\n                  PARALLEL ||\n                !onPlane(s, t) ||\n                !onPlane(t, s) ||\n                !overlaps(s, t)\n              ) {\n                continue;\n              }\n\n              const key = a < b ? `${a}:${b}` : `${b}:${a}`;\n              const pair = pairs.get(key) ?? {\n                a: Math.min(a, b),\n                b: Math.max(a, b),\n                triangles: 0,\n                area: 0,\n                centre: [0, 0, 0],\n                planes: new Map<string, number>(),\n              };\n              const nx = planes[s * 4]!;\n              const ny = planes[s * 4 + 1]!;\n              const nz = planes[s * 4 + 2]!;\n              const d = planes[s * 4 + 3]!;\n              const { area, x, y } = clipped();\n              const plane = planeLabel(nx, ny, nz, d);\n\n              pair.triangles += 1;\n              pair.area += area;\n              pair.centre[0] += area * (x * frame[0]! + y * frame[3]! + d * nx);\n              pair.centre[1] += area * (x * frame[1]! + y * frame[4]! + d * ny);\n              pair.centre[2] += area * (x * frame[2]! + y * frame[5]! + d * nz);\n              pair.planes.set(plane, (pair.planes.get(plane) ?? 0) + area);\n              pairs.set(key, pair);\n            }\n          }\n        }\n      }\n    }\n  }\n\n  // Fold identical pairs (pooled copies of one prop, all at one spot) into one row each.\n  const rows = new Map<string, ZFightingRow & { pairs: (readonly [Mesh, Mesh])[] }>();\n\n  for (const pair of [...pairs.values()].sort((x, y) => y.triangles - x.triangles)) {\n    const meshes = [parts[pair.a]!.mesh, parts[pair.b]!.mesh] as const;\n    const a = labelOf(parts[pair.a]!);\n    const b = labelOf(parts[pair.b]!);\n    const planeLabels = [...pair.planes.entries()]\n      .sort((x, y) => y[1] - x[1])\n      .map(([plane]) => plane);\n    const key = JSON.stringify([a, b, pair.triangles, planeLabels]);\n    const folded = rows.get(key);\n\n    if (folded) {\n      folded.count += 1;\n      folded.pairs.push(meshes);\n      continue;\n    }\n\n    const weight = pair.area > 0 ? pair.area : 1;\n    const row = withHidden(\n      withHidden(\n        {\n          a,\n          b,\n          triangles: pair.triangles,\n          planes: planeLabels,\n          overlap: {\n            area: round(pair.area, 4),\n            centre: pair.centre.map((sum) => round(sum / weight)) as [number, number, number],\n          },\n          count: 1,\n        },\n        \"meshes\",\n        meshes,\n      ),\n      \"pairs\",\n      [meshes],\n    );\n\n    rows.set(key, row);\n  }\n\n  return [...rows.values()];\n};\n","import {\n  type BadGeometryRow,\n  type EmptyMeshRow,\n  findBadGeometry,\n  findEmptyMeshes,\n} from \"./bad-geometry.ts\";\nimport { type AnyObject3D, asObject3D, onlyTag, type Skip } from \"./scene.ts\";\nimport { countDraws, countTriangles, listMeshes, type MeshRow } from \"./triangles.ts\";\nimport { findZFighting, type ZFightingOptions, type ZFightingRow } from \"./z-fighting.ts\";\n\nexport type AuditSceneOptions = Pick<ZFightingOptions, \"bakes\" | \"gap\" | \"self\" | \"tagged\"> & {\n  skip?: Skip | undefined;\n  tagKey?: string;\n  /** Only the object(s) tagged this (`userData[tagKey]`): one studio object out of a scene. */\n  tag?: string | undefined;\n  /** How many of the costliest meshes to list. */\n  top?: number;\n};\n\nexport type AuditReport = {\n  triangles: number;\n  /** Draw calls one main pass makes, before culling and shadows: see `countDraws`. */\n  draws: number;\n  zFighting: ZFightingRow[];\n  badGeometry: BadGeometryRow[];\n  emptyMeshes: EmptyMeshRow[];\n  /** The costliest meshes, most triangles first. */\n  meshes: MeshRow[];\n};\n\n/** The skip every check runs with: the caller's, narrowed to `tag` when given. */\nconst scopeOf = (\n  root: AnyObject3D,\n  options: { skip?: Skip | undefined; tag?: string | undefined; tagKey?: string },\n) =>\n  options.tag === undefined\n    ? options.skip\n    : onlyTag(asObject3D(root), options.tag, options.tagKey ?? \"studioObject\", options.skip);\n\n/**\n * Every check at once, JSON-safe: what a test asserts on or a headless browser prints. A clean\n * scene has `zFighting`, `badGeometry` and `emptyMeshes` all `[]`.\n */\nexport const auditScene = (root: AnyObject3D, options: AuditSceneOptions = {}): AuditReport => {\n  const { tagKey, bakes } = options;\n  const skip = scopeOf(root, options);\n  const keyed = { skip, bakes, ...(tagKey === undefined ? {} : { tagKey }) };\n\n  return {\n    triangles: countTriangles(root, { skip }),\n    draws: countDraws(root, { skip }),\n    zFighting: findZFighting(root, {\n      ...options,\n      skip,\n      ...(options.tag === undefined ? {} : { tagged: true }),\n    }),\n    badGeometry: findBadGeometry(root, keyed),\n    emptyMeshes: findEmptyMeshes(root, keyed),\n    meshes: listMeshes(root, { skip }).slice(0, options.top ?? 10),\n  };\n};\n\nexport type AuditSummaryOptions = Pick<\n  AuditSceneOptions,\n  \"bakes\" | \"gap\" | \"skip\" | \"tag\" | \"tagKey\"\n> & {\n  /** Run the z-fighting check, the slow one. Default true; false gives `null` counts. */\n  zFighting?: boolean;\n};\n\nexport type AuditSummary = {\n  triangles: number;\n  draws: number;\n  meshes: number;\n  /** Pairs of meshes that z-fight, identical pairs counted each. */\n  zFighting: number | null;\n  /** Meshes that z-fight with themselves: merged geometry whose parts overlap. */\n  selfZFighting: number | null;\n  badGeometry: number;\n  emptyMeshes: number;\n};\n\n/**\n * Every check as one count each: the single call to run after every edit. `0` everywhere (and\n * `triangles`, `draws` where you expect them) is a pass. Use `auditScene` to see what failed.\n */\nexport const summarizeScene = (\n  root: AnyObject3D,\n  options: AuditSummaryOptions = {},\n): AuditSummary => {\n  const { tagKey, bakes } = options;\n  const skip = scopeOf(root, options);\n  const keyed = { skip, bakes, ...(tagKey === undefined ? {} : { tagKey }) };\n  let zFighting: number | null = null;\n  let selfZFighting: number | null = null;\n\n  if (options.zFighting !== false) {\n    zFighting = 0;\n    selfZFighting = 0;\n\n    for (const row of findZFighting(root, {\n      ...(options.gap === undefined ? {} : { gap: options.gap }),\n      ...(tagKey === undefined ? {} : { tagKey }),\n      ...(options.tag === undefined ? {} : { tagged: true }),\n      skip,\n      bakes,\n      self: true,\n    })) {\n      if (row.meshes[0] === row.meshes[1]) {\n        selfZFighting += row.count;\n      } else {\n        zFighting += row.count;\n      }\n    }\n  }\n\n  return {\n    triangles: countTriangles(root, { skip }),\n    draws: countDraws(root, { skip }),\n    meshes: listMeshes(root, { skip }).length,\n    zFighting,\n    selfZFighting,\n    badGeometry: findBadGeometry(root, keyed).length,\n    emptyMeshes: findEmptyMeshes(root, keyed).length,\n  };\n};\n"],"mappings":";;AAeA,MAAa,cAAc,WAAwB;;;;;AAwBnD,MAAa,gBAAgB,WAAqB;CAChD,IAAI,OAAO,SAAS,eAAe,MACjC,OAAO;CAGT,KAAK,IAAI,KAAK,OAAO,QAAQ,IAAI,KAAK,GAAG,QACvC,IAAI,GAAG,SAAS,MAAM,UAAU,MAAM,SAAS,gBAAgB,IAAI,GACjE,OAAO;CAIX,OAAO;AACT;;AAGA,MAAa,QAAQ,MAAgB,SAAsB,UAAsC;CAC/F,MAAM,QAAQ,CAAC,IAAI;CACnB,MAAM,UAAU,QAAQ,UAAU;CAElC,OAAO,MAAM,SAAS,GAAG;EACvB,MAAM,SAAS,MAAM,IAAI;EAEzB,IACG,WAAW,OAAO,SAAS,gBAAgB,QAC3C,QAAQ,gBAAgB,QAAQ,CAAC,OAAO,WAAW,EAAE,WAAW,aAAa,MAAM,MACpF,QAAQ,OAAO,MAAM,MAAM,MAE3B;EAGF,MAAM,MAAM;EAEZ,KAAK,IAAI,IAAI,OAAO,SAAS,SAAS,GAAG,KAAK,GAAG,KAAK,GACpD,MAAM,KAAK,OAAO,SAAS,EAAG;CAElC;AACF;AAEA,MAAa,UAAU,WAAsC,OAAgB,WAAW;;AAGxF,MAAa,cAAc,WAAqB;CAC9C,MAAM,QAAQ;CAEd,OACE,MAAM,WAAW,QACjB,MAAM,WAAW,QACjB,MAAM,aAAa,QACnB,MAAM,aAAa;AAEvB;AAEA,MAAa,eAAe,SACzB,KAAuB,oBAAoB;AAE9C,MAAa,aAAa,SACvB,KAAgC,kBAAkB;;AAGrD,MAAa,iBAAiB,aAA6B;CACzD,MAAM,WAAW,SAAS,OAAO,SAAS,SAAS,WAAW,UAAU,SAAS;CACjF,MAAM,EAAE,OAAO,UAAU,SAAS;CAClC,MAAM,QAAQ,KAAK,IAAI,UAAU,QAAQ,KAAK,IAAI;CAElD,OAAO,KAAK,IAAI,GAAG,KAAK,MAAM,QAAQ,CAAC,CAAC;AAC1C;;;;;AAMA,MAAa,qBAAqB,UAAuB;CACvD,MAAM,6BAAa,IAAI,IAAsD;CAE7E,KAAK,IAAI,KAAK,GAAG,KAAK,MAAM,kBAAkB,MAAM,GAAG;EACrD,IAAI;EAGJ,IAAI;GACF,IAAI,CAAC,MAAM,aAAa,EAAE,GACxB;GAGF,aAAa,MAAM,gBAAgB,EAAE;EACvC,QAAQ;GACN;EACF;EAEA,MAAM,QAAQ,WAAW,IAAI,UAAU;EAEvC,IAAI,OAAO;GACT,MAAM,aAAa;GACnB;EACF;EAEA,MAAM,QAAQ,MAAM,mBAAmB,UAAU;EAKjD,MAAM,WAAW,MAAM,UAAU,MAAM,SAAS,QAAQ,MAAM,aAAa,MAAM;EAEjF,WAAW,IAAI,YAAY;GAAE,WAAW;GAAG,WAAW,KAAK,MAAM,WAAW,CAAC;EAAE,CAAC;CAClF;CAEA,OAAO;AACT;;AAGA,MAAa,oBAAoB,UAAuB;CACtD,IAAI,YAAY;CAChB,IAAI,YAAY;CAEhB,KAAK,MAAM,YAAY,kBAAkB,KAAK,CAAC,CAAC,OAAO,GAAG;EACxD,aAAa,SAAS,YAAY,SAAS;EAC3C,aAAa,SAAS;CACxB;CAEA,OAAO;EAAE;EAAW;CAAU;AAChC;;AAGA,MAAa,SAAS,QAAkB,WAAmB;CACzD,KAAK,IAAI,KAAsB,QAAQ,IAAI,KAAK,GAAG,QAAQ;EACzD,MAAM,MAAe,GAAG,SAAS;EAEjC,IAAI,QAAQ,KAAA,KAAa,QAAQ,MAC/B,OAAO,OAAO,GAAG;CAErB;CAEA,OAAO;AACT;;;;;AAMA,MAAa,WAAW,MAAgB,KAAa,QAAgB,SAAsB;CACzF,IAAI,QAAQ;CAEZ,KAAK,MAAM,EAAE,KAAK,IAAI,WAAW;EAC/B,MAAM,MAAe,OAAO,SAAS;EAErC,UAAU,QAAQ,KAAA,KAAa,QAAQ,QAAQ,OAAO,GAAG,MAAM;CACjE,CAAC;CAED,IAAI,CAAC,OACH,MAAM,IAAI,MAAM,2CAA2C,OAAO,MAAM,IAAI,EAAE;CAGhF,QAAQ,WAAW;EACjB,IAAI,OAAO,MAAM,MAAM,MACrB,OAAO;EAGT,MAAM,MAAe,OAAO,SAAS;EAErC,IAAI,QAAQ,KAAA,KAAa,QAAQ,QAAQ,OAAO,GAAG,MAAM,KACvD,OAAO;EAGT,OAAO,WAAW,MAAM,KAAK,MAAM,QAAQ,MAAM,MAAM;CACzD;AACF;AAEA,MAAa,UAAU,MAAgB,QAAgB,SAAgB;CACrE,IAAI,QAAQ;CAEZ,KAAK,MAAM,EAAE,KAAK,IAAI,WAAW;EAC/B,UAAU,OAAO,SAAS,YAAY,KAAA,KAAa,OAAO,SAAS,YAAY;CACjF,CAAC;CAED,OAAO;AACT;AAEA,MAAa,YAAY,SAAe,KAAK,QAAQ,KAAK,SAAS,QAAQ,KAAK,SAAS;;;;;;AAOzF,MAAa,UAAU,QAAkB,MAAuB,QAAiB,QAAQ,MAAM;CAC7F,MAAM,QAAkB,CAAC;CAEzB,KAAK,IAAI,KAAK,OAAO,QAAQ,IAAI,KAAK,OAAO,OAAO,OAAO,GAAG,QAAQ;EACpE,MAAM,MAAe,WAAW,KAAA,IAAY,KAAA,IAAY,GAAG,SAAS;EACpE,MAAM,OAAO,GAAG,SAAS,QAAQ,KAAA,KAAa,QAAQ,OAAO,KAAK,OAAO,GAAG;EAE5E,IAAI,MACF,MAAM,QAAQ,IAAI;CAEtB;CAEA,OAAO,MAAM,SAAS,QAAQ,CAAC,KAAK,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,IAAI;AAChE;;AAGA,MAAa,aAAa,MAAY,MAAuB,WAC3D,GAAG,CAAC,GAAG,OAAO,MAAM,MAAM,MAAM,GAAG,SAAS,IAAI,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,IAAI,aAAa,IAAI,EAAE;AAEtF,MAAa,gBAAgB,SAAe;CAC1C,MAAM,WAAY,MAAM,QAAQ,KAAK,QAAQ,IAAI,KAAK,SAAS,KAAK,KAAK;CAIzE,OAAO,WAAW,SAAS,QAAQ,SAAS,OAAO;AACrD;;AAGA,MAAa,cACX,KACA,KACA,UACG,OAAO,eAAe,KAAK,KAAK;CAAE;CAAO,YAAY;AAAM,CAAC;;;ACvNjE,MAAM,UAAU,UAA0B,MAAc,SAAS,OAAO,KAAK,CAAC,KAAK;AAEnF,MAAM,SAAS,aAA6B;CAC1C,MAAM,WAAW,SAAS,WAAW;CACrC,MAAM,SAAS,SAAS,WAAW;CACnC,MAAM,UAAU,IAAI,WAAW,SAAS,KAAK;CAC7C,IAAI,YAAY;CAChB,IAAI,cAAc;CAElB,KAAK,IAAI,IAAI,GAAG,IAAI,SAAS,OAAO,KAAK,GAUvC,IAAI,EARF,OAAO,SAAS,SAAS,KAAK,CAAC,CAAC,KAChC,OAAO,SAAS,SAAS,KAAK,CAAC,CAAC,KAChC,OAAO,SAAS,SAAS,KAAK,CAAC,CAAC,MAC/B,CAAC,UACC,OAAO,SAAS,OAAO,KAAK,CAAC,CAAC,KAC7B,OAAO,SAAS,OAAO,KAAK,CAAC,CAAC,KAC9B,OAAO,SAAS,OAAO,KAAK,CAAC,CAAC,KAEvB;EACX,QAAQ,KAAK;EACb,aAAa;CACf;CAGF,IAAI,CAAC,QACH,OAAO;EAAE;EAAW;CAAY;CAGlC,MAAM,UAAU,SAAS,OAAO,SAAS,SAAS;CAElD,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,SAAS,KAAK,GAAG;EACvC,MAAM,IAAI,OAAO,UAAU,CAAC;EAC5B,MAAM,IAAI,OAAO,UAAU,IAAI,CAAC;EAChC,MAAM,IAAI,OAAO,UAAU,IAAI,CAAC;EAChC,MAAM,KAAK,SAAS,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC;EAC7C,MAAM,KAAK,SAAS,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC;EAC7C,MAAM,KAAK,SAAS,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC;EAC7C,MAAM,KAAK,SAAS,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC;EAC7C,MAAM,KAAK,SAAS,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC;EAC7C,MAAM,KAAK,SAAS,KAAK,CAAC,IAAI,SAAS,KAAK,CAAC;EAG7C,IAAI,EAFS,KAAK,MAAM,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,KAAK,EAEpE,IAAI,OACX;EAGF,KAAK,MAAM,KAAK;GAAC;GAAG;GAAG;EAAC,GACtB,IAAI,QAAQ,OAAO,KAAK,KAAK,MAAM,OAAO,KAAK,CAAC,GAAG,OAAO,KAAK,CAAC,GAAG,OAAO,KAAK,CAAC,CAAC,IAAI,MAAM;GACzF,QAAQ,KAAK;GACb,eAAe;EACjB;CAEJ;CAEA,OAAO;EAAE;EAAW;CAAY;AAClC;;AAGA,MAAa,mBACX,MACA,UAA8B,CAAC,MACV;CACrB,MAAM,SAAS,QAAQ,UAAU;CACjC,MAAM,OAAyB,CAAC;CAEhC,KAAK,WAAW,IAAI,GAAG;EAAE,MAAM,QAAQ;EAAM,OAAO,QAAQ,SAAS;CAAU,IAAI,WAAW;EAC5F,IAAI,CAAC,OAAO,MAAM,KAAK,CAAC,OAAO,SAAS,WAAW,UACjD;EAGF,MAAM,EAAE,WAAW,gBAAgB,MAAM,OAAO,QAAQ;EAExD,IAAI,YAAY,KAAK,cAAc,GAAG;GACpC,MAAM,QAAQ,MAAM,QAAQ,MAAM,KAAK,OAAO,QAAQ,QAAQ;GAE9D,KAAK,KACH,WAAW;IAAE,MAAM,SAAS,MAAM;IAAG;IAAO;IAAW;GAAY,GAAG,UAAU,MAAM,CACxF;EACF;CACF,CAAC;CAED,OAAO;AACT;;;;;;AAcA,MAAa,mBACX,MACA,UAA8B,CAAC,MACZ;CACnB,MAAM,QAAQ,WAAW,IAAI;CAC7B,MAAM,OAAuB,CAAC;CAE9B,KAAK,OAAO;EAAE,MAAM,QAAQ;EAAM,OAAO,QAAQ,SAAS;CAAU,IAAI,WAAW;EACjF,IAAI,OAAO,MAAM,MAAM,OAAO,SAAS,WAAW,UAAU,SAAS,OAAO,GAC1E,KAAK,KACH,WACE,EAAE,MAAM,UAAU,QAAQ,OAAO,QAAQ,UAAU,cAAc,EAAE,GACnE,UACA,MACF,CACF;CAEJ,CAAC;CAED,OAAO;AACT;;;AC5FA,MAAM,QAAQ,SAAe;CAC3B,IAAI,UAAU,IAAI,GAChB,OAAO,iBAAiB,IAAI;CAG9B,MAAM,YAAY,YAAY,IAAI,IAAI,KAAK,QAAQ;CAEnD,OAAO;EAAE;EAAW,WAAW,cAAc,KAAK,QAAQ,IAAI;CAAU;AAC1E;;;;;AAMA,MAAa,kBAAkB,MAAmB,UAA2B,CAAC,MAAM;CAClF,IAAI,QAAQ;CAEZ,KAAK,WAAW,IAAI,GAAG;EAAE,MAAM,QAAQ;EAAM,aAAa;CAAK,IAAI,WAAW;EAC5E,IAAI,OAAO,MAAM,GACf,SAAS,KAAK,MAAM,CAAC,CAAC;CAE1B,CAAC;CAED,OAAO;AACT;;AAGA,MAAa,cAAc,OAAoB,UAA2B,CAAC,MAAiB;CAC1F,MAAM,OAAO,WAAW,KAAK;CAC7B,MAAM,OAAkB,CAAC;CAEzB,KAAK,MAAM;EAAE,MAAM,QAAQ;EAAM,aAAa;CAAK,IAAI,WAAW;EAChE,IAAI,CAAC,OAAO,MAAM,GAChB;EAGF,MAAM,EAAE,WAAW,cAAc,KAAK,MAAM;EAC5C,MAAM,MAAM;GACV,MAAM,CAAC,GAAG,OAAO,QAAQ,IAAI,GAAG,SAAS,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG;GAC1D,UAAU,aAAa,MAAM;GAC7B,WAAW,YAAY,IAAI,KAAK,MAAM,YAAY,SAAS,IAAI;GAC/D;GACA,OAAO;EACT;EAEA,KAAK,KAAK,WAAW,KAAK,QAAQ,MAAM,CAAC;CAC3C,CAAC;CAED,OAAO,KAAK,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC9C;;;;;;AAOA,MAAa,kBAAkB,MAAmB,UAAyB,CAAC,MAAqB;CAC/F,MAAM,QAAQ,WAAW,IAAI;CAC7B,MAAM,uBAAO,IAAI,IAAyB;CAC1C,MAAM,OAAO,KAAa,WAAmB,SAAiB;EAC5D,MAAM,MAAM,KAAK,IAAI,GAAG,KAAK;GAAE,UAAU;GAAK,MAAM;GAAG;GAAW,OAAO;GAAG,OAAO;EAAE;EAErF,IAAI,QAAQ;EACZ,IAAI,SAAS,YAAY;EACzB,KAAK,IAAI,KAAK,GAAG;CACnB;CAEA,KAAK,OAAO,EAAE,MAAM,QAAQ,KAAK,IAAI,WAAW;EAC9C,IAAI,CAAC,OAAO,MAAM,KAAK,CAAC,OAAO,SAAS,WAAW,UACjD;EAGF,IAAI,UAAU,MAAM,GAAG;GACrB,MAAM,OAAO,CAAC,GAAG,OAAO,QAAQ,KAAK,GAAG,SAAS,MAAM,CAAC,CAAC,CAAC,KAAK,GAAG;GAElE,KAAK,MAAM,CAAC,IAAI,EAAE,WAAW,gBAAgB,kBAAkB,MAAM,GACnE,IAAI,QAAQ,QAAQ,QAAQ,EAAE,KAAK,GAAG,KAAK,GAAG,MAAM,WAAW,SAAS;GAG1E;EACF;EAEA,MAAM,WAAW,OAAO;EAExB,IACE,SAAS,QAAQ,GAAG,SAAS,KAAK,GAAG,SAAS,KAAK,MAAM,GAAG,CAAC,KAC7D,cAAc,QAAQ,GACtB,YAAY,MAAM,IAAI,OAAO,QAAQ,CACvC;CACF,CAAC;CAED,MAAM,MAAM,CAAC,GAAG,KAAK,OAAO,CAAC;CAC7B,MAAM,MAAM,IAAI,QAAQ,OAAO,QAAQ,QAAQ,IAAI,OAAO,CAAC;CAE3D,KAAK,MAAM,OAAO,KAAK;EACrB,IAAI,QAAQ,MAAM,IAAI,KAAK,MAAO,IAAI,QAAQ,MAAO,GAAI,IAAI,MAAO;EAEpE,IAAI,QAAQ,WAAW,KAAA,GACrB,IAAI,aAAa,IAAI,QAAQ,KAAK,IAAI,KAAK,CAAC,IAAI,QAAQ;CAE5D;CAEA,OAAO,IAAI,MAAM,GAAG,MAAM,EAAE,QAAQ,EAAE,KAAK;AAC7C;;;;;;AAOA,MAAa,cAAc,MAAmB,UAA2B,CAAC,MAAM;CAC9E,IAAI,QAAQ;CAEZ,KAAK,WAAW,IAAI,GAAG;EAAE,MAAM,QAAQ;EAAM,aAAa;CAAK,IAAI,WAAW;EAC5E,IAAI,CAAC,WAAW,MAAM,GACpB;EAGF,MAAM,WAAW;EAEjB,MAAM,WAAW,SAAS;EAE1B,IAAI,MAAM,QAAQ,QAAQ,GAAG;GAC3B,MAAM,SAAS,SAAS,UAAU,UAAU,CAAC;GAE7C,SAAS,OAAO,QACb,UAAU,SAAS,MAAM,iBAAiB,EAAE,EAAE,YAAY,KAC7D,CAAC,CAAC;EACJ,OAAO,IAAI,UAAU,YAAY,OAC/B,SAAS;CAEb,CAAC;CAED,OAAO;AACT;;;;AC1HA,MAAM,QAAQ;;AAEd,MAAM,WAAW;AAajB,MAAM,SAAS,OAAe,SAAS,MAAM;CAC3C,MAAM,QAAQ,MAAM;CACpB,MAAM,UAAU,KAAK,MAAM,QAAQ,KAAK,IAAI;CAE5C,OAAO,YAAY,IAAI,IAAI;AAC7B;AAEA,MAAM,WAAW,SAAe;CAC9B,MAAM,SAAS,KAAK,IAAI,KAAK,KAAK,SAAS,OAAO,MAAM,KAAK,IAAI,SAAU,CAAC,CAAC;CAE7E,OAAO,GAAG,KAAK,MAAM,MAAM,OAAO,KAAK,IAAI,EAAE;AAC/C;AAEA,MAAM,SAAS,UAAkB,MAAM,OAAO,CAAC,CAAC,CAAC,QAAQ,CAAC;;AAG1D,MAAM,cAAc,IAAY,IAAY,IAAY,MAAc;CACpE,KAAK,MAAM,CAAC,MAAM,UAAU;EAC1B,CAAC,KAAK,EAAE;EACR,CAAC,KAAK,EAAE;EACR,CAAC,KAAK,EAAE;CACV,GACE,IAAI,KAAK,IAAI,KAAK,IAAI,OACpB,OAAO,GAAG,KAAK,KAAK,MAAM,IAAI,KAAK,EAAE,WAAW,QAAQ,IAAI,MAAM,MAAM;CAI5E,OAAO,IAAI,MAAM,EAAE,EAAE,IAAI,MAAM,EAAE,EAAE,IAAI,MAAM,EAAE,EAAE,UAAU,MAAM,CAAC;AACpE;AAEA,MAAM,eAAe,UAClB,MAAM,QAAQ,KAAK,QAAQ,IAAI,KAAK,WAAW,CAAC,KAAK,QAAQ,EAAA,CAAG,QAC9D,aAAmC,aAAa,KAAA,KAAa,aAAa,IAC7E;;AAGF,MAAM,YAAY,GAAS,MACzB,CAAC,EAAE,UAAU,CAAC,EAAE,WAAY,EAAE,UAAU,EAAE,SAAW,EAAE,UAAU,EAAE;;AAGrE,MAAa,iBACX,OACA,UAA4B,CAAC,MACV;CACnB,MAAM,OAAO,WAAW,KAAK;CAC7B,MAAM,MAAM,QAAQ,OAAO;CAC3B,MAAM,OAAO,QAAQ,QAAQ;CAC7B,MAAM,SAAS,QAAQ,UAAU;CACjC,MAAM,SAAS,QAAQ,UAAU,OAAO,MAAM,QAAQ,QAAQ,IAAI;CAElE,KAAK,kBAAkB,MAAM,IAAI;CAEjC,MAAM,QAAgB,CAAC;CAEvB,MAAM,QAAkB,CAAC;CACzB,MAAM,SAAmB,CAAC;CAC1B,MAAM,UAAoB,CAAC;CAC3B,MAAM,OAA2C,CAAC;CAClD,MAAM,0BAAU,IAAI,IAAsB;CAC1C,MAAM,SAAS,GAAW,GAAW,GAAW,MAAc,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG;CAEhF,KACE,MACA;EAAE,MAAM,QAAQ;EAAM,aAAa;EAAM,OAAO,QAAQ,SAAS;CAAU,IAC1E,WAAW;EACV,IACE,CAAC,OAAO,MAAM,KACd,YAAY,MAAM,KAClB,UAAU,MAAM,KACf,OAAO,SAAqD,8BAC3D,QACF,CAAC,OAAO,SAAS,WAAW,UAE5B;EAGF,IAAI,UAAU,MAAM,QAAQ,MAAM,MAAM,MACtC;EAGF,MAAM,YAAY,YAAY,MAAM,CAAC,CAAC,QAAQ,aAAa,SAAS,YAAY,KAAK;EAErF,IAAI,UAAU,WAAW,GACvB;EAGF,MAAM,OAAO,MAAM;EACnB,MAAM,EAAE,OAAO,eAAe,OAAO;EACrC,MAAM,WAAW,WAAW;EAC5B,MAAM,IAAI,OAAO,YAAY;EAC7B,MAAM,MAAM;GAAC;GAAU;GAAU;EAAQ;EACzC,MAAM,MAAM;GAAC;GAAW;GAAW;EAAS;EAC5C,MAAM,QAAQ,OAAO,SAAS,SAAS;EACvC,MAAM,QAAQ;GAAC;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;GAAG;EAAC;EAExC,MAAM,KAAK;GACT,MAAM;GACN,OAAO,UAAU,QAAQ,MAAM,MAAM;GACrC;GACA;GACA,QAAQ,UAAU,MAAM,aAAa,SAAS,eAAe,KAAK;GAClE,OAAO,UAAU,MAAM,aAAa,SAAS,cAAc,KAAK;GAChE,QAAQ,UAAU,MACf,aACC,SAAS,kBAAkB,SAC1B,SAAS,wBAAwB,KAAK,SAAS,uBAAuB,EAC3E;EACF,CAAC;EAED,KAAK,IAAI,IAAI,GAAG,IAAI,IAAI,OAAO,KAAK,GAAG;GACrC,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;IAC7B,MAAM,IAAI,OAAO,KAAK,IAAI,CAAC,KAAK,IAAI;IACpC,MAAM,IAAI,SAAS,KAAK,CAAC;IACzB,MAAM,IAAI,SAAS,KAAK,CAAC;IACzB,MAAM,IAAI,SAAS,KAAK,CAAC;IAEzB,KAAK,IAAI,OAAO,GAAG,OAAO,GAAG,QAAQ,GAAG;KACtC,MAAM,QAAQ,EAAE,QAAS,IAAI,EAAE,OAAO,KAAM,IAAI,EAAE,OAAO,KAAM,IAAI,EAAE,OAAO;KAE5E,MAAM,IAAI,IAAI,QAAQ;KACtB,IAAI,QAAQ,KAAK,IAAI,IAAI,OAAQ,KAAK;KACtC,IAAI,QAAQ,KAAK,IAAI,IAAI,OAAQ,KAAK;IACxC;GACF;GAEA,MAAM,CAAC,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,IAAI,MAAM;GAW7C,MAAM,KAAK,KAAK;GAChB,MAAM,KAAK,KAAK;GAChB,MAAM,KAAK,KAAK;GAChB,MAAM,KAAK,KAAK;GAChB,MAAM,KAAK,KAAK;GAChB,MAAM,KAAK,KAAK;GAChB,IAAI,KAAK,KAAK,KAAK,KAAK;GACxB,IAAI,KAAK,KAAK,KAAK,KAAK;GACxB,IAAI,KAAK,KAAK,KAAK,KAAK;GACxB,MAAM,SAAS,KAAK,MAAM,IAAI,IAAI,EAAE;GAGpC,IAAI,EAAE,SAAS,KAAK,OAClB;GAGF,MAAM;GACN,MAAM;GACN,MAAM;GAEN,MAAM,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK;GACnC,MAAM,KAAK,MAAM;GACjB,MAAM,MAAwC;IAC5C,KAAK,MAAM,KAAK,KAAK;IACrB,KAAK,MAAM,KAAK,KAAK;IACrB,KAAK,MAAM,KAAK,KAAK;IACrB,KAAK,MAAM,IAAI,GAAG;GACpB;GACA,MAAM,SAAS,QAAQ,IAAI,MAAM,GAAG,GAAG,CAAC;GAExC,MAAM,KAAK,IAAI;GACf,OAAO,KAAK,IAAI,IAAI,IAAI,CAAC;GACzB,QAAQ,KAAK,GAAG,KAAK;GACrB,KAAK,KAAK,GAAG;GAEb,IAAI,QACF,OAAO,KAAK,EAAE;QAEd,QAAQ,IAAI,MAAM,GAAG,GAAG,GAAG,CAAC,EAAE,CAAC;EAEnC;CACF,CACF;CAGA,MAAM,SAAS,MAAM;CACrB,MAAM,OAAO;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAEhD,MAAM,QAAQ;EAAC;EAAG;EAAG;EAAG;EAAG;EAAG;CAAC;CAE/B,MAAM,YAAY,GAAW,MAAc;EACzC,MAAM,IAAI,IAAI;EACd,MAAM,IAAI,IAAI;EACd,IAAI,KAAK,QAAQ,IAAI,KAAM,QAAQ;EACnC,IAAI,KAAK,QAAQ,IAAI,KAAM,QAAQ,IAAI;EACvC,IAAI,KAAK,QAAQ,IAAI,KAAM,QAAQ,IAAI;EACvC,MAAM,SAAS,KAAK,MAAM,IAAI,IAAI,EAAE,KAAK;EAEzC,MAAM;EACN,MAAM;EACN,MAAM;EAEN,MAAM,KAAK,OAAO,IAAI;EACtB,MAAM,KAAK,OAAO,IAAI,IAAI;EAC1B,MAAM,KAAK,OAAO,IAAI,IAAI;EAC1B,MAAM,KAAK,KAAK,KAAK,KAAK;EAC1B,MAAM,KAAK,KAAK,KAAK,KAAK;EAC1B,MAAM,KAAK,KAAK,KAAK,KAAK;EAE1B,MAAM,KAAK;EACX,MAAM,KAAK;EACX,MAAM,KAAK;EACX,MAAM,KAAK;EACX,MAAM,KAAK;EACX,MAAM,KAAK;EAGX,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;GAC7B,MAAM,KAAK,IAAI,IAAI,IAAI,IAAI,IAAI,KAAK,IAAI,KAAK;GAC7C,MAAM,KAAK,QAAQ;GACnB,MAAM,KAAK,QAAQ,KAAK;GACxB,MAAM,KAAK,QAAQ,KAAK;GAExB,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;GACvC,KAAK,IAAI,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK;EAC7C;EAEA,KAAK,IAAI,OAAO,GAAG,OAAO,GAAG,QAAQ,GAAG;GACtC,MAAM,OAAO;GACb,MAAM,KAAK,OAAO,KAAK,OAAO,KAAK,IAAI,KAAM,OAAO,KAAK;GACzD,MAAM,KAAK,KAAK,KAAK,KAAM,KAAK,OAAO;GACvC,MAAM,KAAK,KAAK,KAAK,IAAI,KAAM,KAAK,OAAO,IAAI;GAC/C,MAAM,aAAa,KAAK,MAAM,IAAI,EAAE,KAAK;GACzC,MAAM,QAAQ,CAAC,KAAK;GACpB,MAAM,QAAQ,KAAK;GACnB,IAAI,KAAK;GACT,IAAI,KAAK;GACT,IAAI,KAAK;GACT,IAAI,KAAK;GAET,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;IAC7B,MAAM,QAAQ,KAAK,IAAI,KAAM,QAAQ,KAAK,IAAI,IAAI,KAAM;IAExD,IAAI,IAAI,GAAG;KACT,KAAK,KAAK,IAAI,IAAI,KAAK;KACvB,KAAK,KAAK,IAAI,IAAI,KAAK;IACzB,OAAO;KACL,KAAK,KAAK,IAAI,IAAI,KAAK;KACvB,KAAK,KAAK,IAAI,IAAI,KAAK;IACzB;GACF;GAEA,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI,KAAK,IAAI,IAAI,EAAE,IAAI,QACxC,OAAO;EAEX;EAEA,OAAO;CACT;;;;;CAMA,MAAM,gBAAgB;EAIpB,MAAM,SAFH,KAAK,KAAM,KAAK,OAAQ,KAAK,KAAM,KAAK,OAAQ,KAAK,KAAM,KAAK,OAAQ,KAAK,KAAM,KAAK,OAErE,IAAI;GAAC;GAAG;GAAG;EAAC,IAAI;GAAC;GAAG;GAAG;EAAC;EAC9C,IAAI,UAAU,KAAK,MAAM,GAAG,EAAE;EAE9B,KAAK,IAAI,OAAO,GAAG,OAAO,KAAK,QAAQ,UAAU,GAAG,QAAQ,GAAG;GAC7D,MAAM,KAAK,KAAK,MAAM,QAAS;GAC/B,MAAM,KAAK,KAAK,MAAM,QAAS,IAAI;GACnC,MAAM,KAAK,KAAK,OAAO,OAAO,KAAK,KAAM,KAAM;GAC/C,MAAM,KAAK,KAAK,OAAO,OAAO,KAAK,KAAM,IAAI,KAAM;GACnD,MAAM,OAAiB,CAAC;GACxB,MAAM,IAAI,QAAQ,SAAS;GAE3B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;IAC7B,MAAM,KAAK,QAAQ,IAAI;IACvB,MAAM,KAAK,QAAQ,IAAI,IAAI;IAC3B,MAAM,KAAK,SAAU,IAAI,KAAK,IAAK;IACnC,MAAM,KAAK,SAAU,IAAI,KAAK,IAAK,IAAI;IACvC,MAAM,KAAK,MAAM,KAAK,MAAM,MAAM,KAAK;IACvC,MAAM,KAAK,MAAM,KAAK,MAAM,MAAM,KAAK;IAEvC,IAAI,MAAM,GACR,KAAK,KAAK,IAAI,EAAE;IAGlB,IAAI,MAAM,MAAM,MAAM,GAAG;KACvB,MAAM,IAAI,MAAM,KAAK;KAErB,KAAK,KAAK,MAAM,KAAK,MAAM,GAAG,MAAM,KAAK,MAAM,CAAC;IAClD;GACF;GAEA,UAAU;EACZ;EAEA,IAAI,QAAQ;EACZ,IAAI,KAAK;EACT,IAAI,KAAK;EACT,MAAM,IAAI,QAAQ,SAAS;EAE3B,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;GAC7B,MAAM,KAAK,QAAQ,IAAI;GACvB,MAAM,KAAK,QAAQ,IAAI,IAAI;GAC3B,MAAM,KAAK,SAAU,IAAI,KAAK,IAAK;GACnC,MAAM,KAAK,SAAU,IAAI,KAAK,IAAK,IAAI;GACvC,MAAM,QAAQ,KAAK,KAAK,KAAK;GAE7B,SAAS;GACT,OAAO,KAAK,MAAM;GAClB,OAAO,KAAK,MAAM;EACpB;EAEA,OAAO,KAAK,IAAI,KAAK,IAAI,QACrB;GAAE,MAAM;GAAG,GAAG;GAAG,GAAG;EAAE,IACtB;GAAE,MAAM,KAAK,IAAI,KAAK,IAAI;GAAG,GAAG,MAAM,IAAI;GAAQ,GAAG,MAAM,IAAI;EAAO;CAC5E;CAGA,MAAM,WAAW,GAAW,MAAc;EACxC,MAAM,KAAK,OAAO,IAAI;EACtB,MAAM,KAAK,OAAO,IAAI,IAAI;EAC1B,MAAM,KAAK,OAAO,IAAI,IAAI;EAC1B,MAAM,IAAI,OAAO,IAAI,IAAI;EAEzB,KAAK,IAAI,IAAI,GAAG,IAAI,GAAG,KAAK,GAAG;GAC7B,MAAM,KAAK,IAAI,IAAI,IAAI;GAEvB,IAAI,KAAK,IAAI,KAAK,QAAQ,MAAO,KAAK,QAAQ,KAAK,KAAM,KAAK,QAAQ,KAAK,KAAM,CAAC,IAAI,KACpF,OAAO;EAEX;EAEA,OAAO;CACT;CAYA,MAAM,wBAAQ,IAAI,IAAkB;CAGpC,KAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,KAAK,GAAG;EACxC,MAAM,CAAC,IAAI,IAAI,IAAI,MAAM,KAAK;EAE9B,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,KAAK,GAC5B,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,KAAK,GAC5B,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,KAAK,GAC5B,KAAK,IAAI,IAAI,IAAI,KAAK,GAAG,KAAK,GAC5B,KAAK,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,CAAC,CAAC,KAAK,CAAC,GAAG;GACxE,MAAM,IAAI,MAAM;GAChB,MAAM,IAAI,MAAM;GAEhB,IACE,KAAK,KACJ,MAAM,KAAK,CAAC,QACb,CAAC,SAAS,MAAM,IAAK,MAAM,EAAG,KAC9B,OAAO,IAAI,KAAM,OAAO,IAAI,KAC1B,OAAO,IAAI,IAAI,KAAM,OAAO,IAAI,IAAI,KACpC,OAAO,IAAI,IAAI,KAAM,OAAO,IAAI,IAAI,KACpC,YACF,CAAC,QAAQ,GAAG,CAAC,KACb,CAAC,QAAQ,GAAG,CAAC,KACb,CAAC,SAAS,GAAG,CAAC,GAEd;GAGF,MAAM,MAAM,IAAI,IAAI,GAAG,EAAE,GAAG,MAAM,GAAG,EAAE,GAAG;GAC1C,MAAM,OAAO,MAAM,IAAI,GAAG,KAAK;IAC7B,GAAG,KAAK,IAAI,GAAG,CAAC;IAChB,GAAG,KAAK,IAAI,GAAG,CAAC;IAChB,WAAW;IACX,MAAM;IACN,QAAQ;KAAC;KAAG;KAAG;IAAC;IAChB,wBAAQ,IAAI,IAAoB;GAClC;GACA,MAAM,KAAK,OAAO,IAAI;GACtB,MAAM,KAAK,OAAO,IAAI,IAAI;GAC1B,MAAM,KAAK,OAAO,IAAI,IAAI;GAC1B,MAAM,IAAI,OAAO,IAAI,IAAI;GACzB,MAAM,EAAE,MAAM,GAAG,MAAM,QAAQ;GAC/B,MAAM,QAAQ,WAAW,IAAI,IAAI,IAAI,CAAC;GAEtC,KAAK,aAAa;GAClB,KAAK,QAAQ;GACb,KAAK,OAAO,MAAM,QAAQ,IAAI,MAAM,KAAM,IAAI,MAAM,KAAM,IAAI;GAC9D,KAAK,OAAO,MAAM,QAAQ,IAAI,MAAM,KAAM,IAAI,MAAM,KAAM,IAAI;GAC9D,KAAK,OAAO,MAAM,QAAQ,IAAI,MAAM,KAAM,IAAI,MAAM,KAAM,IAAI;GAC9D,KAAK,OAAO,IAAI,QAAQ,KAAK,OAAO,IAAI,KAAK,KAAK,KAAK,IAAI;GAC3D,MAAM,IAAI,KAAK,IAAI;EACrB;CAKV;CAGA,MAAM,uBAAO,IAAI,IAAiE;CAElF,KAAK,MAAM,QAAQ,CAAC,GAAG,MAAM,OAAO,CAAC,CAAC,CAAC,MAAM,GAAG,MAAM,EAAE,YAAY,EAAE,SAAS,GAAG;EAChF,MAAM,SAAS,CAAC,MAAM,KAAK,EAAE,CAAE,MAAM,MAAM,KAAK,EAAE,CAAE,IAAI;EACxD,MAAM,IAAI,QAAQ,MAAM,KAAK,EAAG;EAChC,MAAM,IAAI,QAAQ,MAAM,KAAK,EAAG;EAChC,MAAM,cAAc,CAAC,GAAG,KAAK,OAAO,QAAQ,CAAC,CAAC,CAC3C,MAAM,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC,CAC3B,KAAK,CAAC,WAAW,KAAK;EACzB,MAAM,MAAM,KAAK,UAAU;GAAC;GAAG;GAAG,KAAK;GAAW;EAAW,CAAC;EAC9D,MAAM,SAAS,KAAK,IAAI,GAAG;EAE3B,IAAI,QAAQ;GACV,OAAO,SAAS;GAChB,OAAO,MAAM,KAAK,MAAM;GACxB;EACF;EAEA,MAAM,SAAS,KAAK,OAAO,IAAI,KAAK,OAAO;EAC3C,MAAM,MAAM,WACV,WACE;GACE;GACA;GACA,WAAW,KAAK;GAChB,QAAQ;GACR,SAAS;IACP,MAAM,MAAM,KAAK,MAAM,CAAC;IACxB,QAAQ,KAAK,OAAO,KAAK,QAAQ,MAAM,MAAM,MAAM,CAAC;GACtD;GACA,OAAO;EACT,GACA,UACA,MACF,GACA,SACA,CAAC,MAAM,CACT;EAEA,KAAK,IAAI,KAAK,GAAG;CACnB;CAEA,OAAO,CAAC,GAAG,KAAK,OAAO,CAAC;AAC1B;;;;AC9fA,MAAM,WACJ,MACA,YAEA,QAAQ,QAAQ,KAAA,IACZ,QAAQ,OACR,QAAQ,WAAW,IAAI,GAAG,QAAQ,KAAK,QAAQ,UAAU,gBAAgB,QAAQ,IAAI;;;;;AAM3F,MAAa,cAAc,MAAmB,UAA6B,CAAC,MAAmB;CAC7F,MAAM,EAAE,QAAQ,UAAU;CAC1B,MAAM,OAAO,QAAQ,MAAM,OAAO;CAClC,MAAM,QAAQ;EAAE;EAAM;EAAO,GAAI,WAAW,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO;CAAG;CAEzE,OAAO;EACL,WAAW,eAAe,MAAM,EAAE,KAAK,CAAC;EACxC,OAAO,WAAW,MAAM,EAAE,KAAK,CAAC;EAChC,WAAW,cAAc,MAAM;GAC7B,GAAG;GACH;GACA,GAAI,QAAQ,QAAQ,KAAA,IAAY,CAAC,IAAI,EAAE,QAAQ,KAAK;EACtD,CAAC;EACD,aAAa,gBAAgB,MAAM,KAAK;EACxC,aAAa,gBAAgB,MAAM,KAAK;EACxC,QAAQ,WAAW,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,MAAM,GAAG,QAAQ,OAAO,EAAE;CAC/D;AACF;;;;;AA0BA,MAAa,kBACX,MACA,UAA+B,CAAC,MACf;CACjB,MAAM,EAAE,QAAQ,UAAU;CAC1B,MAAM,OAAO,QAAQ,MAAM,OAAO;CAClC,MAAM,QAAQ;EAAE;EAAM;EAAO,GAAI,WAAW,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO;CAAG;CACzE,IAAI,YAA2B;CAC/B,IAAI,gBAA+B;CAEnC,IAAI,QAAQ,cAAc,OAAO;EAC/B,YAAY;EACZ,gBAAgB;EAEhB,KAAK,MAAM,OAAO,cAAc,MAAM;GACpC,GAAI,QAAQ,QAAQ,KAAA,IAAY,CAAC,IAAI,EAAE,KAAK,QAAQ,IAAI;GACxD,GAAI,WAAW,KAAA,IAAY,CAAC,IAAI,EAAE,OAAO;GACzC,GAAI,QAAQ,QAAQ,KAAA,IAAY,CAAC,IAAI,EAAE,QAAQ,KAAK;GACpD;GACA;GACA,MAAM;EACR,CAAC,GACC,IAAI,IAAI,OAAO,OAAO,IAAI,OAAO,IAC/B,iBAAiB,IAAI;OAErB,aAAa,IAAI;CAGvB;CAEA,OAAO;EACL,WAAW,eAAe,MAAM,EAAE,KAAK,CAAC;EACxC,OAAO,WAAW,MAAM,EAAE,KAAK,CAAC;EAChC,QAAQ,WAAW,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;EACnC;EACA;EACA,aAAa,gBAAgB,MAAM,KAAK,CAAC,CAAC;EAC1C,aAAa,gBAAgB,MAAM,KAAK,CAAC,CAAC;CAC5C;AACF"}