@tinypoly/gpu-renderer 0.2.4 → 0.3.0

package/dist/skyBake.js

@@ -1,5 +1,6 @@
 import { compileProgram } from "./shaderProgram.js";
 import { createShaderModule } from "./shaderModule.js";
+import { traversalConstants } from "./pathTracePass.js";
 import { BVH_WGSL } from "./wgsl/bvh.wgsl.js";
 import { COMMON_WGSL } from "./wgsl/common.wgsl.js";
 import { RANDOM_WGSL } from "./wgsl/random.wgsl.js";
@@ -13,7 +14,7 @@ const WORKGROUP = 8;
  * goes to the binding the path tracer accumulates into, which is the one read-write buffer the support code declares.
  */
 export function skyBakeSource(program, width, height) {
-    return `${COMMON_WGSL}${RANDOM_WGSL}${BVH_WGSL}${SAMPLING_WGSL}${TEXTURE_WGSL}${SHADER_SUPPORT_WGSL}
+    return `${traversalConstants(false)}${COMMON_WGSL}${RANDOM_WGSL}${BVH_WGSL}${SAMPLING_WGSL}${TEXTURE_WGSL}${SHADER_SUPPORT_WGSL}
 ${program.wgsl}
 
 @compute @workgroup_size(${WORKGROUP}, ${WORKGROUP})
@@ -62,11 +63,12 @@ export async function bakeSkyOnDevice(device, program, uniforms, width) {
         layout: device.createPipelineLayout({ bindGroupLayouts: [layout] }),
         compute: { module, entryPoint: "main" },
     });
-    const output = device.createBuffer({ size: texels * 16, usage: GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC });
+    const output = device.createBuffer({ label: "sky bake", size: texels * 16, usage: GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC });
     const data = device.createBuffer({
+        label: "sky bake",
         size: Math.max(16, words.byteLength), usage: GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_DST,
     });
-    const staging = device.createBuffer({ size: texels * 16, usage: GPUBufferUsage.MAP_READ | GPUBufferUsage.COPY_DST });
+    const staging = device.createBuffer({ label: "sky bake", size: texels * 16, usage: GPUBufferUsage.MAP_READ | GPUBufferUsage.COPY_DST });
     try {
         device.queue.writeBuffer(data, 0, words);
         const encoder = device.createCommandEncoder({ label: "sky bake" });

package/dist/skyBake.js.map

@@ -1 +1 @@
-{"version":3,"file":"skyBake.js","sourceRoot":"","sources":["../src/skyBake.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAsB,MAAM,oBAAoB,CAAC;AACxE,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAEvD,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAC9C,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAC;AACnE,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAEtD,MAAM,SAAS,GAAG,CAAC,CAAC;AAEpB;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,OAAsB,EAAE,KAAa,EAAE,MAAc;IACjF,OAAO,GAAG,WAAW,GAAG,WAAW,GAAG,QAAQ,GAAG,aAAa,GAAG,YAAY,GAAG,mBAAmB;EACnG,OAAO,CAAC,IAAI;;2BAEa,SAAS,KAAK,SAAS;;gBAElC,KAAK,gBAAgB,MAAM;;;;gCAIX,KAAK;gCACL,MAAM;;;;;;;;;wBASd,KAAK,gBAAgB,OAAO,CAAC,EAAE;;CAEtD,CAAC;AACF,CAAC;AAED,2HAA2H;AAC3H,MAAM,UAAU,iBAAiB,CAAC,cAAsB;IACtD,OAAO,cAAc,CAAC,CAAC,EAAE,YAAY,EAAE,EAAE,QAAQ,EAAE,cAAc,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;AAC1F,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,MAAiB,EAAE,OAAsB,EAAE,QAAsC,EAAE,KAAa;IAEhG,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;IACzB,MAAM,MAAM,GAAG,KAAK,GAAG,MAAM,CAAC;IAC9B,MAAM,KAAK,GAAG,OAAO,CAAC,YAAY,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACxD,MAAM,MAAM,GAAG,kBAAkB,CAAC,MAAM,EAAE,UAAU,EAAE,aAAa,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;IAE7F,MAAM,MAAM,GAAG,MAAM,CAAC,qBAAqB,CAAC;QAC1C,KAAK,EAAE,UAAU;QACjB,OAAO,EAAE;YACP,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE;YAC/E,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,mBAAmB,EAAE,EAAE;SAC1F;KACF,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,0BAA0B,CAAC;QACvD,KAAK,EAAE,UAAU;QACjB,MAAM,EAAE,MAAM,CAAC,oBAAoB,CAAC,EAAE,gBAAgB,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;QACnE,OAAO,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE;KACxC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,OAAO,GAAG,cAAc,CAAC,QAAQ,EAAE,CAAC,CAAC;IAEnH,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC;QAC/B,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,OAAO,GAAG,cAAc,CAAC,QAAQ;KAC9F,CAAC,CAAC;IAEH,MAAM,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,QAAQ,GAAG,cAAc,CAAC,QAAQ,EAAE,CAAC,CAAC;IAErH,IAAI,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAEzC,MAAM,OAAO,GAAG,MAAM,CAAC,oBAAoB,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;QACnE,MAAM,IAAI,GAAG,OAAO,CAAC,gBAAgB,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;QAE7D,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC3B,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,eAAe,CAAC;YAC1C,MAAM;YACN,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;SACpG,CAAC,CAAC,CAAC;QACJ,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC;QACrF,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,CAAC,CAAC;QAC/D,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAExC,MAAM,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAExC,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,cAAc,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAErE,OAAO,CAAC,KAAK,EAAE,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAE7F,OAAO,QAAQ,CAAC;IAClB,CAAC;YAAS,CAAC;QACT,MAAM,CAAC,OAAO,EAAE,CAAC;QACjB,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,CAAC,OAAO,EAAE,CAAC;IACpB,CAAC;AACH,CAAC"}
+{"version":3,"file":"skyBake.js","sourceRoot":"","sources":["../src/skyBake.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAsB,MAAM,oBAAoB,CAAC;AACxE,OAAO,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAC;AAEvD,OAAO,EAAE,kBAAkB,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAC;AAC9C,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,WAAW,EAAE,MAAM,uBAAuB,CAAC;AACpD,OAAO,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AACxD,OAAO,EAAE,mBAAmB,EAAE,MAAM,8BAA8B,CAAC;AACnE,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAEtD,MAAM,SAAS,GAAG,CAAC,CAAC;AAEpB;;;;GAIG;AACH,MAAM,UAAU,aAAa,CAAC,OAAsB,EAAE,KAAa,EAAE,MAAc;IACjF,OAAO,GAAG,kBAAkB,CAAC,KAAK,CAAC,GAAG,WAAW,GAAG,WAAW,GAAG,QAAQ,GAAG,aAAa,GAAG,YAAY,GAAG,mBAAmB;EAC/H,OAAO,CAAC,IAAI;;2BAEa,SAAS,KAAK,SAAS;;gBAElC,KAAK,gBAAgB,MAAM;;;;gCAIX,KAAK;gCACL,MAAM;;;;;;;;;wBASd,KAAK,gBAAgB,OAAO,CAAC,EAAE;;CAEtD,CAAC;AACF,CAAC;AAED,2HAA2H;AAC3H,MAAM,UAAU,iBAAiB,CAAC,cAAsB;IACtD,OAAO,cAAc,CAAC,CAAC,EAAE,YAAY,EAAE,EAAE,QAAQ,EAAE,cAAc,EAAE,OAAO,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;AAC1F,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CACnC,MAAiB,EAAE,OAAsB,EAAE,QAAsC,EAAE,KAAa;IAEhG,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;IACzB,MAAM,MAAM,GAAG,KAAK,GAAG,MAAM,CAAC;IAC9B,MAAM,KAAK,GAAG,OAAO,CAAC,YAAY,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACxD,MAAM,MAAM,GAAG,kBAAkB,CAAC,MAAM,EAAE,UAAU,EAAE,aAAa,CAAC,OAAO,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;IAE7F,MAAM,MAAM,GAAG,MAAM,CAAC,qBAAqB,CAAC;QAC1C,KAAK,EAAE,UAAU;QACjB,OAAO,EAAE;YACP,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE;YAC/E,EAAE,OAAO,EAAE,CAAC,EAAE,UAAU,EAAE,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,EAAE,IAAI,EAAE,mBAAmB,EAAE,EAAE;SAC1F;KACF,CAAC,CAAC;IAEH,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,0BAA0B,CAAC;QACvD,KAAK,EAAE,UAAU;QACjB,MAAM,EAAE,MAAM,CAAC,oBAAoB,CAAC,EAAE,gBAAgB,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC;QACnE,OAAO,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE;KACxC,CAAC,CAAC;IAEH,MAAM,MAAM,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,OAAO,GAAG,cAAc,CAAC,QAAQ,EAAE,CAAC,CAAC;IAEtI,MAAM,IAAI,GAAG,MAAM,CAAC,YAAY,CAAC;QAC/B,KAAK,EAAE,UAAU;QACjB,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,UAAU,CAAC,EAAE,KAAK,EAAE,cAAc,CAAC,OAAO,GAAG,cAAc,CAAC,QAAQ;KAC9F,CAAC,CAAC;IAEH,MAAM,OAAO,GAAG,MAAM,CAAC,YAAY,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,IAAI,EAAE,MAAM,GAAG,EAAE,EAAE,KAAK,EAAE,cAAc,CAAC,QAAQ,GAAG,cAAc,CAAC,QAAQ,EAAE,CAAC,CAAC;IAExI,IAAI,CAAC;QACH,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAEzC,MAAM,OAAO,GAAG,MAAM,CAAC,oBAAoB,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;QACnE,MAAM,IAAI,GAAG,OAAO,CAAC,gBAAgB,CAAC,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC,CAAC;QAE7D,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;QAC3B,IAAI,CAAC,YAAY,CAAC,CAAC,EAAE,MAAM,CAAC,eAAe,CAAC;YAC1C,MAAM;YACN,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE,CAAC;SACpG,CAAC,CAAC,CAAC;QACJ,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC;QACrF,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,OAAO,CAAC,kBAAkB,CAAC,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,MAAM,GAAG,EAAE,CAAC,CAAC;QAC/D,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QAExC,MAAM,OAAO,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAExC,MAAM,QAAQ,GAAG,IAAI,YAAY,CAAC,OAAO,CAAC,cAAc,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;QAErE,OAAO,CAAC,KAAK,EAAE,CAAC;QAEhB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;gBAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;QAE7F,OAAO,QAAQ,CAAC;IAClB,CAAC;YAAS,CAAC;QACT,MAAM,CAAC,OAAO,EAAE,CAAC;QACjB,IAAI,CAAC,OAAO,EAAE,CAAC;QACf,OAAO,CAAC,OAAO,EAAE,CAAC;IACpB,CAAC;AACH,CAAC"}

package/dist/texturePack.d.ts

@@ -1,11 +1,13 @@
+import type { ShaderPrograms } from "./shaderProgram.js";
 import type { SerializedScene, SerializedTexture } from "./upstream.js";
 /**
  * Every texture of a scene in one storage buffer, led by a table saying where each one lives. Core WebGPU has no binding
  * arrays and `texture_2d_array` wants one size and one format for every layer, which a Three.js scene does not provide,
  * so the texels are read by hand. See the decision in ARCHITECTURE.md.
  *
- * Byte textures keep their eight bits per channel, four to a word, and are decoded from sRGB as they are read. Float
- * textures keep all four, because their range is the reason they are float at all.
+ * Byte textures keep their eight bits per channel, four to a word, and are decoded from sRGB as they are read. A byte
+ * texture of which only one channel is ever read (a roughness or a bump map) keeps that channel alone, four texels to a
+ * word. Float textures keep all four, because their range is the reason they are float at all.
  */
 export interface PackedTextures {
     /**
@@ -46,6 +48,27 @@ declare const REPEAT = 1000;
 declare const MIRRORED_REPEAT = 1002;
 /** How many UV sets the geometry carries, and so the highest channel a texture may ask for. */
 export declare const UV_CHANNELS = 2;
+/**
+ * The channels the kernel reads from each material map slot, as the WGSL reads them: roughness from green, metalness
+ * from blue, and so on. A slot missing here counts as reading all four.
+ */
+export declare const SLOT_CHANNELS: Readonly<Record<string, string>>;
+/** How each texture of a scene is stored: one channel, or all four and why. */
+export interface TextureChannels {
+    /** The channel kept (0 for red to 3 for alpha) of each texture stored one byte a texel. */
+    single: Map<string, number>;
+    /** Why every other texture keeps all four. */
+    whole: Map<string, string>;
+}
+/**
+ * Which byte textures of a scene are read through one channel only: every reference to the texture is a material map
+ * slot, and every such slot reads the same channel. A texture named anywhere else (a light's projected map, the sky, a
+ * planar capture) is read in ways this cannot see, and keeps all four. With the scene's translated programs, a
+ * shader's uniforms count only for the textures its program reads; without them, any texture they name keeps all four.
+ */
+export declare function textureChannels(scene: SerializedScene, programs?: Pick<ShaderPrograms, "fragment" | "after">): TextureChannels;
+/** The byte textures of a scene read through one channel only, with that channel: see `textureChannels`. */
+export declare function singleChannelTextures(scene: SerializedScene, programs?: Pick<ShaderPrograms, "fragment" | "after">): Map<string, number>;
 /**
  * Where everything will go, before anything is written: which index each texture gets and where the words after the
  * texels begin. Materials and lights point into that tail by absolute offset, so they need it before the buffer exists.
@@ -53,14 +76,31 @@ export declare const UV_CHANNELS = 2;
 export interface TexturePlan {
     textures: SerializedTexture[];
     indexOf: Map<string, number>;
+    /** The channel kept of each texture stored one byte a texel, by id. */
+    channelOf: ReadonlyMap<string, number>;
     /** The lookup tables and the texture table together: where the texels begin. */
     tableWords: number;
     /** Where the words appended after the texels begin. */
     extraOffset: number;
 }
-export declare function planTextures(scene: SerializedScene, extraTextures?: readonly SerializedTexture[]): TexturePlan;
+export declare function planTextures(scene: SerializedScene, extraTextures?: readonly SerializedTexture[], channelOf?: ReadonlyMap<string, number>): TexturePlan;
 export declare function packTextures(scene: SerializedScene, extras?: TextureExtras): PackedTextures;
 /** The buffer a plan describes, with `extraWords` appended at its `extraOffset`. */
 export declare function writeTextures(plan: TexturePlan, extraWords: Uint32Array): PackedTextures;
+/**
+ * The same buffer `writeTextures` builds, written to the device a piece at a time: the tables, then each texture's
+ * texels straight from the snapshot, then the extra words. The page never holds the whole buffer, which for a scene of
+ * many large textures is hundreds of megabytes it would only hold to hand over.
+ */
+export interface TextureUpload {
+    byteLength: number;
+    count: number;
+    indexOf: Map<string, number>;
+    extraOffset: number;
+    /** Where each texture's texels start, in words, by its index in the table. */
+    offsets: number[];
+    write(device: GPUDevice, buffer: GPUBuffer): void;
+}
+export declare function textureUpload(plan: TexturePlan, extraWords: Uint32Array): TextureUpload;
 export { MIRRORED_REPEAT, REPEAT };
 //# sourceMappingURL=texturePack.d.ts.map

package/dist/texturePack.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"texturePack.d.ts","sourceRoot":"","sources":["../src/texturePack.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,eAAe,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAExE;;;;;;;GAOG;AACH,MAAM,WAAW,cAAc;IAC7B;;;;;OAKG;IACH,IAAI,EAAE,WAAW,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,wFAAwF;IACxF,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7B,wGAAwG;IACxG,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,oHAAoH;AACpH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,SAAS,iBAAiB,EAAE,CAAC;IACxC,KAAK,CAAC,EAAE,WAAW,CAAC;CACrB;AAED,2EAA2E;AAC3E,eAAO,MAAM,aAAa,KAAK,CAAC;AAEhC;;;;GAIG;AACH,eAAO,MAAM,WAAW,IAAI,CAAC;AAC7B,eAAO,MAAM,UAAU,QAAwB,CAAC;AAChD,+DAA+D;AAC/D,eAAO,MAAM,aAAa,QAAmB,CAAC;AA6C9C,oDAAoD;AACpD,eAAO,MAAM,YAAY,GAAI,OAAO,MAAM,WAA0C,CAAC;AAErF,2EAA2E;AAC3E,eAAO,MAAM,UAAU,aAAa,CAAC;AASrC,qEAAqE;AACrE,QAAA,MAAM,MAAM,OAAO,CAAC;AACpB,QAAA,MAAM,eAAe,OAAO,CAAC;AAE7B,+FAA+F;AAC/F,eAAO,MAAM,WAAW,IAAI,CAAC;AAe7B;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,EAAE,iBAAiB,EAAE,CAAC;IAC9B,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7B,gFAAgF;IAChF,UAAU,EAAE,MAAM,CAAC;IACnB,uDAAuD;IACvD,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,wBAAgB,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,aAAa,GAAE,SAAS,iBAAiB,EAAO,GAAG,WAAW,CAalH;AAED,wBAAgB,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,MAAM,GAAE,aAAkB,GAAG,cAAc,CAE/F;AAED,oFAAoF;AACpF,wBAAgB,aAAa,CAAC,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,GAAG,cAAc,CA+DxF;AAED,OAAO,EAAE,eAAe,EAAE,MAAM,EAAE,CAAC"}
+{"version":3,"file":"texturePack.d.ts","sourceRoot":"","sources":["../src/texturePack.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,KAAK,EAAsB,eAAe,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAE5F;;;;;;;;GAQG;AACH,MAAM,WAAW,cAAc;IAC7B;;;;;OAKG;IACH,IAAI,EAAE,WAAW,CAAC;IAClB,KAAK,EAAE,MAAM,CAAC;IACd,wFAAwF;IACxF,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7B,wGAAwG;IACxG,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,oHAAoH;AACpH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,EAAE,SAAS,iBAAiB,EAAE,CAAC;IACxC,KAAK,CAAC,EAAE,WAAW,CAAC;CACrB;AAED,2EAA2E;AAC3E,eAAO,MAAM,aAAa,KAAK,CAAC;AAEhC;;;;GAIG;AACH,eAAO,MAAM,WAAW,IAAI,CAAC;AAC7B,eAAO,MAAM,UAAU,QAAwB,CAAC;AAChD,+DAA+D;AAC/D,eAAO,MAAM,aAAa,QAAmB,CAAC;AA6C9C,oDAAoD;AACpD,eAAO,MAAM,YAAY,GAAI,OAAO,MAAM,WAA0C,CAAC;AAErF,2EAA2E;AAC3E,eAAO,MAAM,UAAU,aAAa,CAAC;AAWrC,qEAAqE;AACrE,QAAA,MAAM,MAAM,OAAO,CAAC;AACpB,QAAA,MAAM,eAAe,OAAO,CAAC;AAE7B,+FAA+F;AAC/F,eAAO,MAAM,WAAW,IAAI,CAAC;AAe7B;;;GAGG;AACH,eAAO,MAAM,aAAa,EAAE,QAAQ,CAAC,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAM1D,CAAC;AAiBF,+EAA+E;AAC/E,MAAM,WAAW,eAAe;IAC9B,2FAA2F;IAC3F,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC5B,8CAA8C;IAC9C,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAC5B;AA0BD;;;;;GAKG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,eAAe,EACpD,QAAQ,CAAC,EAAE,IAAI,CAAC,cAAc,EAAE,UAAU,GAAG,OAAO,CAAC,GAAG,eAAe,CAoDxE;AAED,4GAA4G;AAC5G,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,eAAe,EAC1D,QAAQ,CAAC,EAAE,IAAI,CAAC,cAAc,EAAE,UAAU,GAAG,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAE5E;AASD;;;GAGG;AACH,MAAM,WAAW,WAAW;IAC1B,QAAQ,EAAE,iBAAiB,EAAE,CAAC;IAC9B,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7B,uEAAuE;IACvE,SAAS,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACvC,gFAAgF;IAChF,UAAU,EAAE,MAAM,CAAC;IACnB,uDAAuD;IACvD,WAAW,EAAE,MAAM,CAAC;CACrB;AAED,wBAAgB,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,aAAa,GAAE,SAAS,iBAAiB,EAAO,EACnG,SAAS,GAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAgC,GAAG,WAAW,CAcpF;AAED,wBAAgB,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,MAAM,GAAE,aAAkB,GAAG,cAAc,CAE/F;AAmED,oFAAoF;AACpF,wBAAgB,aAAa,CAAC,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,GAAG,cAAc,CAiCxF;AAED;;;;GAIG;AACH,MAAM,WAAW,aAAa;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,OAAO,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC7B,WAAW,EAAE,MAAM,CAAC;IACpB,8EAA8E;IAC9E,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,KAAK,CAAC,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,SAAS,GAAG,IAAI,CAAC;CACnD;AAED,wBAAgB,aAAa,CAAC,IAAI,EAAE,WAAW,EAAE,UAAU,EAAE,WAAW,GAAG,aAAa,CAsCvF;AAED,OAAO,EAAE,eAAe,EAAE,MAAM,EAAE,CAAC"}

package/dist/texturePack.js

@@ -52,6 +52,8 @@ const TEXTURE_NEAREST = 4;
 const TEXTURE_FLIP_Y = 8;
 /** An environment map whose mapping bends the view ray instead of mirroring it. */
 const TEXTURE_REFRACTION = 16;
+/** One byte a texel: the only channel the scene reads of it, which the shader hands back in every channel. */
+const TEXTURE_SINGLE = 32;
 /** Three's own wrap constants, which the shader compares against. */
 const REPEAT = 1000;
 const MIRRORED_REPEAT = 1002;
@@ -66,7 +68,118 @@ const isFloat = (texture) => texture.data instanceof Float32Array;
  * texture was converted to linear when the scene was serialized, and had its colour space rewritten to say so.
  */
 const isEncoded = (texture) => !isFloat(texture) && texture.colorSpace === "srgb";
-export function planTextures(scene, extraTextures = []) {
+/**
+ * The channels the kernel reads from each material map slot, as the WGSL reads them: roughness from green, metalness
+ * from blue, and so on. A slot missing here counts as reading all four.
+ */
+export const SLOT_CHANNELS = {
+    map: "rgba", emissiveMap: "rgb", roughnessMap: "g", metalnessMap: "b", normalMap: "rgb", clearcoatNormalMap: "rgb",
+    alphaMap: "g", transmissionMap: "r", thicknessMap: "g", clearcoatMap: "r", clearcoatRoughnessMap: "g",
+    sheenColorMap: "rgb", sheenRoughnessMap: "a", iridescenceMap: "r", iridescenceThicknessMap: "g", anisotropyMap: "rgb",
+    specularMap: "r", specularIntensityMap: "a", specularColorMap: "rgb", bumpMap: "r", displacementMap: "r",
+    lightMap: "rgb", gradientMap: "r", matcap: "rgb", envMap: "rgb",
+};
+/** Every string inside a value, with the first path it was found at, without walking into typed arrays. */
+function collectStrings(value, path, into, seen = new Set()) {
+    if (typeof value === "string") {
+        if (!into.has(value))
+            into.set(value, path);
+        return;
+    }
+    if (!value || typeof value !== "object" || seen.has(value) || ArrayBuffer.isView(value))
+        return;
+    seen.add(value);
+    for (const [key, entry] of Object.entries(value))
+        collectStrings(entry, `${path}.${key}`, into, seen);
+}
+/** Texture indices no table reaches, one per texture, which a program's packed uniforms give back where it reads one. */
+const PROBE = 0x7f000000;
+/**
+ * The textures a material's translated programs read: their uniforms are packed with a probe index for every texture,
+ * and the probes that come back are the textures the programs declare. A texture a hook's uniforms name but its
+ * program never declares (Three hands a patched material's every map to its shader) is not read by it.
+ */
+function programTextures(material, programs, textures) {
+    const probes = new Map(textures.map((texture, index) => [texture.id, PROBE + index]));
+    const uniforms = { ...material.shader?.uniforms, ...material.time !== undefined ? { time: material.time } : {} };
+    const read = new Set();
+    for (const program of [programs.fragment(material), programs.after(material)]) {
+        if (!program)
+            continue;
+        for (const word of program.packUniforms(uniforms, probes))
+            if (word >= PROBE && word < PROBE + textures.length)
+                read.add(textures[word - PROBE].id);
+    }
+    return read;
+}
+/**
+ * Which byte textures of a scene are read through one channel only: every reference to the texture is a material map
+ * slot, and every such slot reads the same channel. A texture named anywhere else (a light's projected map, the sky, a
+ * planar capture) is read in ways this cannot see, and keeps all four. With the scene's translated programs, a
+ * shader's uniforms count only for the textures its program reads; without them, any texture they name keeps all four.
+ */
+export function textureChannels(scene, programs) {
+    const read = new Map();
+    const elsewhere = new Map();
+    const materials = new Set(scene.meshes.flatMap(mesh => mesh.materials));
+    for (const material of materials) {
+        if (!material)
+            continue;
+        const { maps, ...everything } = material;
+        const name = `material "${material.name || material.type}"`;
+        // The shader's uniforms are read only through its translated programs, which say what they sample.
+        const { shader, ...rest } = everything;
+        if (programs && shader) {
+            for (const id of programTextures(material, programs, scene.textures ?? []))
+                if (!elsewhere.has(id))
+                    elsewhere.set(id, `the shader of ${name}`);
+        }
+        else if (shader) {
+            collectStrings(shader, `${name}.shader`, elsewhere);
+        }
+        for (const [slot, id] of Object.entries(maps ?? {})) {
+            if (typeof id !== "string")
+                continue;
+            let channels = read.get(id);
+            if (!channels)
+                read.set(id, channels = new Set());
+            for (const channel of SLOT_CHANNELS[slot] ?? "rgba")
+                channels.add(channel);
+        }
+        collectStrings(rest, name, elsewhere);
+    }
+    // The rest of the scene: its lights, its sky and whatever else names a texture.
+    for (const [key, value] of Object.entries(scene))
+        if (key !== "meshes" && key !== "textures")
+            collectStrings(value, key, elsewhere);
+    const single = new Map();
+    const whole = new Map();
+    for (const texture of scene.textures ?? []) {
+        const channels = read.get(texture.id);
+        const named = elsewhere.get(texture.id);
+        if (isFloat(texture))
+            whole.set(texture.id, "float");
+        else if (!channels)
+            whole.set(texture.id, named ? `named by ${named}` : "not read by any map");
+        else if (channels.size !== 1)
+            whole.set(texture.id, `reads ${[...channels].join("")}`);
+        else if (named)
+            whole.set(texture.id, `named by ${named}`);
+        else
+            single.set(texture.id, "rgba".indexOf([...channels][0]));
+    }
+    return { single, whole };
+}
+/** The byte textures of a scene read through one channel only, with that channel: see `textureChannels`. */
+export function singleChannelTextures(scene, programs) {
+    return textureChannels(scene, programs).single;
+}
+/** Words a texture's texels take in the buffer. */
+function texelWords(texture, single) {
+    const texels = texelCount(texture);
+    return isFloat(texture) ? texels * 4 : single ? Math.ceil(texels / 4) : texels;
+}
+export function planTextures(scene, extraTextures = [], channelOf = singleChannelTextures(scene)) {
     const seen = new Set();
     // A texture id appears once, whoever refers to it; the first copy wins.
     const textures = [...scene.textures ?? [], ...extraTextures]
@@ -74,25 +187,26 @@ export function planTextures(scene, extraTextures = []) {
         .filter(texture => !seen.has(texture.id) && !!seen.add(texture.id));
     const indexOf = new Map(textures.map((texture, index) => [texture.id, index]));
     const tableWords = TEXTURE_TABLE + Math.max(1, textures.length) * TEXTURE_WORDS;
-    const texelWords = textures.reduce((sum, texture) => sum + texelCount(texture) * (isFloat(texture) ? 4 : 1), 0);
-    return { textures, indexOf, tableWords, extraOffset: tableWords + texelWords };
+    const kept = new Map([...channelOf].filter(([id]) => indexOf.has(id)));
+    const words = textures.reduce((sum, texture) => sum + texelWords(texture, kept.has(texture.id)), 0);
+    return { textures, indexOf, channelOf: kept, tableWords, extraOffset: tableWords + words };
 }
 export function packTextures(scene, extras = {}) {
     return writeTextures(planTextures(scene, extras.textures), extras.words ?? new Uint32Array(0));
 }
-/** The buffer a plan describes, with `extraWords` appended at its `extraOffset`. */
-export function writeTextures(plan, extraWords) {
-    const { textures, indexOf, tableWords } = plan;
-    // WebGPU rejects an empty binding, and a scene with no textures at all is ordinary.
-    const data = new Uint32Array(Math.max(4, plan.extraOffset + extraWords.length));
-    const words = data;
-    const floats = new Float32Array(data.buffer);
-    let texelAt = tableWords;
-    data.set(LOOKUP, 0);
-    textures.forEach((texture, index) => {
+/**
+ * The lookup tables and the texture table a plan describes, written at the head of `words`. Returns where each
+ * texture's texels start, in words.
+ */
+function writeTable(words, plan) {
+    const floats = new Float32Array(words.buffer, words.byteOffset, words.length);
+    const offsets = [];
+    let texelAt = plan.tableWords;
+    words.set(LOOKUP, 0);
+    plan.textures.forEach((texture, index) => {
         const at = textureEntry(index);
-        const texels = texelCount(texture);
         const float = isFloat(texture);
+        offsets.push(texelAt);
         words[at] = texture.width;
         words[at + 1] = texture.height;
         words[at + 2] = texelAt;
@@ -100,7 +214,8 @@ export function writeTextures(plan, extraWords) {
             | (isEncoded(texture) ? TEXTURE_SRGB : 0)
             | (texture.nearest ? TEXTURE_NEAREST : 0)
             | (texture.flipY ? TEXTURE_FLIP_Y : 0)
-            | (texture.refraction ? TEXTURE_REFRACTION : 0);
+            | (texture.refraction ? TEXTURE_REFRACTION : 0)
+            | (plan.channelOf.has(texture.id) ? TEXTURE_SINGLE : 0);
         words[at + 4] = texture.wrapS;
         words[at + 5] = texture.wrapT;
         words[at + 6] = Math.min(Math.max(0, texture.channel | 0), UV_CHANNELS - 1);
@@ -109,31 +224,88 @@ export function writeTextures(plan, extraWords) {
         const matrix = texture.matrix?.length === 9 ? texture.matrix : [1, 0, 0, 0, 1, 0, 0, 0, 1];
         floats.set([matrix[0], matrix[3], matrix[6], 0], at + 8);
         floats.set([matrix[1], matrix[4], matrix[7], 0], at + 12);
-        if (float) {
-            // The channels keep their bits and the shader reads them back as floats.
-            floats.set(texture.data.subarray(0, texels * 4), texelAt);
-            texelAt += texels * 4;
+        texelAt += texelWords(texture, plan.channelOf.has(texture.id));
+    });
+    return offsets;
+}
+/**
+ * A texture's texels as the buffer holds them: viewed straight from the snapshot where the bytes already agree, the one
+ * channel kept copied out four texels to a word, or null for a byte texture a big endian page has to turn around.
+ */
+function texelView(texture, channel) {
+    const texels = texelCount(texture);
+    if (isFloat(texture))
+        return texture.data.subarray(0, texels * 4);
+    if (channel !== undefined) {
+        const source = texture.data;
+        // Bytes in the order the device reads a word's, lowest first, so this needs no turning around on any page.
+        const kept = new Uint8Array(Math.ceil(texels / 4) * 4);
+        for (let texel = 0; texel < texels; texel++)
+            kept[texel] = source[texel * 4 + channel];
+        return kept;
+    }
+    return LITTLE_ENDIAN ? texture.data.subarray(0, texels * 4) : null;
+}
+/** The buffer a plan describes, with `extraWords` appended at its `extraOffset`. */
+export function writeTextures(plan, extraWords) {
+    const { textures, indexOf } = plan;
+    // WebGPU rejects an empty binding, and a scene with no textures at all is ordinary.
+    const data = new Uint32Array(Math.max(4, plan.extraOffset + extraWords.length));
+    const offsets = writeTable(data, plan);
+    textures.forEach((texture, index) => {
+        const texelAt = offsets[index];
+        const view = texelView(texture, plan.channelOf.get(texture.id));
+        if (view) {
+            // The channels keep their bits, and bytes already sit in the order the words want them: copied whole.
+            new Uint8Array(data.buffer, texelAt * 4, view.byteLength)
+                .set(new Uint8Array(view.buffer, view.byteOffset, view.byteLength));
+            return;
         }
-        else {
-            const source = texture.data;
-            if (LITTLE_ENDIAN) {
-                // The bytes already sit in the order the words want them: copied whole, as the GPU reads them.
-                new Uint8Array(data.buffer, texelAt * 4, texels * 4).set(source.subarray(0, texels * 4));
-            }
-            else {
-                for (let texel = 0; texel < texels; texel++) {
-                    const offset = texel * 4;
-                    words[texelAt + texel] = source[offset]
-                        | (source[offset + 1] << 8)
-                        | (source[offset + 2] << 16)
-                        | (source[offset + 3] << 24);
-                }
-            }
-            texelAt += texels;
+        const source = texture.data;
+        for (let texel = 0; texel < texelCount(texture); texel++) {
+            const offset = texel * 4;
+            data[texelAt + texel] = source[offset]
+                | (source[offset + 1] << 8)
+                | (source[offset + 2] << 16)
+                | (source[offset + 3] << 24);
         }
     });
-    data.set(extraWords, texelAt);
-    return { data, count: textures.length, indexOf, extraOffset: texelAt };
+    data.set(extraWords, plan.extraOffset);
+    return { data, count: textures.length, indexOf, extraOffset: plan.extraOffset };
+}
+export function textureUpload(plan, extraWords) {
+    const byteLength = Math.max(4, plan.extraOffset + extraWords.length) * 4;
+    // A big endian page has to turn every byte texel around, which needs the whole buffer anyway.
+    if (!LITTLE_ENDIAN) {
+        const packed = writeTextures(plan, extraWords);
+        return {
+            byteLength,
+            count: packed.count,
+            indexOf: packed.indexOf,
+            extraOffset: packed.extraOffset,
+            offsets: plan.textures.map((_, index) => packed.data[textureEntry(index) + 2]),
+            write: (device, buffer) => device.queue.writeBuffer(buffer, 0, packed.data),
+        };
+    }
+    const header = new Uint32Array(plan.tableWords);
+    const offsets = writeTable(header, plan);
+    return {
+        byteLength,
+        count: plan.textures.length,
+        indexOf: plan.indexOf,
+        extraOffset: plan.extraOffset,
+        offsets,
+        write(device, buffer) {
+            device.queue.writeBuffer(buffer, 0, header);
+            plan.textures.forEach((texture, index) => {
+                const view = texelView(texture, plan.channelOf.get(texture.id));
+                if (view.byteLength)
+                    device.queue.writeBuffer(buffer, offsets[index] * 4, view);
+            });
+            if (extraWords.length)
+                device.queue.writeBuffer(buffer, plan.extraOffset * 4, extraWords);
+        },
+    };
 }
 export { MIRRORED_REPEAT, REPEAT };
 //# sourceMappingURL=texturePack.js.map

package/dist/texturePack.js.map

@@ -1 +1 @@
-{"version":3,"file":"texturePack.js","sourceRoot":"","sources":["../src/texturePack.ts"],"names":[],"mappings":"AA+BA,2EAA2E;AAC3E,MAAM,CAAC,MAAM,aAAa,GAAG,EAAE,CAAC;AAEhC;;;;GAIG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC;AAC7B,MAAM,CAAC,MAAM,UAAU,GAAG,WAAW,GAAG,CAAC,GAAG,GAAG,CAAC;AAChD,+DAA+D;AAC/D,MAAM,CAAC,MAAM,aAAa,GAAG,UAAU,GAAG,GAAG,CAAC;AAE9C,wHAAwH;AACxH,SAAS,WAAW;IAClB,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,IAAI,SAAS,GAAG,UAAU,CAAC;IAE3B,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC;QAClC,UAAU,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC;QACjC,SAAS,GAAG,CAAC,SAAS,GAAG,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IAExC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACpC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;YACzC,IAAI,GAAG,GAAG,CAAC,CAAC;YAEZ,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE;gBAAE,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC;oBAAE,GAAG,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;YAE5F,MAAM,CAAC,IAAI,GAAG,GAAG,GAAG,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,4FAA4F;AAC5F,SAAS,SAAS;IAChB,OAAO,YAAY,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;QAEtC,OAAO,KAAK,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC;IAC7E,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE;IACnB,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,aAAa,CAAC,CAAC;IAE7C,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,WAAW,CAAC,CAAC;IACtC,KAAK,CAAC,GAAG,CAAC,IAAI,WAAW,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC;IAE3D,OAAO,KAAK,CAAC;AACf,CAAC,CAAC,EAAE,CAAC;AAEL,oDAAoD;AACpD,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAa,EAAE,EAAE,CAAC,aAAa,GAAG,KAAK,GAAG,aAAa,CAAC;AAErF,2EAA2E;AAC3E,MAAM,CAAC,MAAM,UAAU,GAAG,UAAU,CAAC;AAErC,MAAM,aAAa,GAAG,CAAC,CAAC;AACxB,MAAM,YAAY,GAAG,CAAC,CAAC;AACvB,MAAM,eAAe,GAAG,CAAC,CAAC;AAC1B,MAAM,cAAc,GAAG,CAAC,CAAC;AACzB,mFAAmF;AACnF,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAE9B,qEAAqE;AACrE,MAAM,MAAM,GAAG,IAAI,CAAC;AACpB,MAAM,eAAe,GAAG,IAAI,CAAC;AAE7B,+FAA+F;AAC/F,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC;AAE7B,iHAAiH;AACjH,MAAM,aAAa,GAAG,IAAI,UAAU,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAE3E,MAAM,UAAU,GAAG,CAAC,OAA0B,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;AAE5G,MAAM,OAAO,GAAG,CAAC,OAA0B,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,YAAY,YAAY,CAAC;AAErF;;;GAGG;AACH,MAAM,SAAS,GAAG,CAAC,OAA0B,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,UAAU,KAAK,MAAM,CAAC;AAerG,MAAM,UAAU,YAAY,CAAC,KAAsB,EAAE,gBAA8C,EAAE;IACnG,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,wEAAwE;IACxE,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,QAAQ,IAAI,EAAE,EAAE,GAAG,aAAa,CAAC;SACzD,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;SAC5F,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;IAEtE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAC/E,MAAM,UAAU,GAAG,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,aAAa,CAAC;IAChF,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,CAAC,GAAG,GAAG,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhH,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,GAAG,UAAU,EAAE,CAAC;AACjF,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,KAAsB,EAAE,SAAwB,EAAE;IAC7E,OAAO,aAAa,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,KAAK,IAAI,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;AACjG,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,aAAa,CAAC,IAAiB,EAAE,UAAuB;IACtE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,EAAE,GAAG,IAAI,CAAC;IAE/C,oFAAoF;IACpF,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;IAChF,MAAM,KAAK,GAAG,IAAI,CAAC;IACnB,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC7C,IAAI,OAAO,GAAG,UAAU,CAAC;IAEzB,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAEpB,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE;QAClC,MAAM,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;QACnC,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;QAE/B,KAAK,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;QAC1B,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QAC/B,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;QACxB,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;cACvC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;cACvC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;cACvC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;cACpC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;QAC9B,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;QAC9B,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC;QAC5E,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAElB,mGAAmG;QACnG,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAE3F,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;QAE1D,IAAI,KAAK,EAAE,CAAC;YACV,yEAAyE;YACzE,MAAM,CAAC,GAAG,CAAE,OAAO,CAAC,IAAqB,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YAC5E,OAAO,IAAI,MAAM,GAAG,CAAC,CAAC;QACxB,CAAC;aAAM,CAAC;YACN,MAAM,MAAM,GAAG,OAAO,CAAC,IAAkB,CAAC;YAE1C,IAAI,aAAa,EAAE,CAAC;gBAClB,+FAA+F;gBAC/F,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,GAAG,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;YAC3F,CAAC;iBAAM,CAAC;gBACN,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;oBAC5C,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;oBAEzB,KAAK,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;0BACnC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;0BACzB,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;0BAC1B,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;gBACjC,CAAC;YACH,CAAC;YAED,OAAO,IAAI,MAAM,CAAC;QACpB,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;IAE9B,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;AACzE,CAAC;AAED,OAAO,EAAE,eAAe,EAAE,MAAM,EAAE,CAAC"}
+{"version":3,"file":"texturePack.js","sourceRoot":"","sources":["../src/texturePack.ts"],"names":[],"mappings":"AAiCA,2EAA2E;AAC3E,MAAM,CAAC,MAAM,aAAa,GAAG,EAAE,CAAC;AAEhC;;;;GAIG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC;AAC7B,MAAM,CAAC,MAAM,UAAU,GAAG,WAAW,GAAG,CAAC,GAAG,GAAG,CAAC;AAChD,+DAA+D;AAC/D,MAAM,CAAC,MAAM,aAAa,GAAG,UAAU,GAAG,GAAG,CAAC;AAE9C,wHAAwH;AACxH,SAAS,WAAW;IAClB,MAAM,UAAU,GAAa,EAAE,CAAC;IAChC,IAAI,SAAS,GAAG,UAAU,CAAC;IAE3B,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,EAAE,EAAE,GAAG,EAAE,EAAE,CAAC;QAClC,UAAU,CAAC,IAAI,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC;QACjC,SAAS,GAAG,CAAC,SAAS,GAAG,CAAC,SAAS,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;IAExC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC;QACpC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC;YACzC,IAAI,GAAG,GAAG,CAAC,CAAC;YAEZ,KAAK,IAAI,GAAG,GAAG,CAAC,EAAE,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE;gBAAE,IAAI,KAAK,GAAG,CAAC,CAAC,IAAI,GAAG,CAAC;oBAAE,GAAG,IAAI,UAAU,CAAC,IAAI,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC;YAE5F,MAAM,CAAC,IAAI,GAAG,GAAG,GAAG,KAAK,CAAC,GAAG,GAAG,KAAK,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,4FAA4F;AAC5F,SAAS,SAAS;IAChB,OAAO,YAAY,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE;QACpD,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;QAEtC,OAAO,KAAK,IAAI,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,KAAK,CAAC,GAAG,KAAK,CAAC,IAAI,GAAG,CAAC;IAC7E,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,MAAM,GAAG,CAAC,GAAG,EAAE;IACnB,MAAM,KAAK,GAAG,IAAI,WAAW,CAAC,aAAa,CAAC,CAAC;IAE7C,KAAK,CAAC,GAAG,CAAC,WAAW,EAAE,EAAE,WAAW,CAAC,CAAC;IACtC,KAAK,CAAC,GAAG,CAAC,IAAI,WAAW,CAAC,SAAS,EAAE,CAAC,MAAM,CAAC,EAAE,UAAU,CAAC,CAAC;IAE3D,OAAO,KAAK,CAAC;AACf,CAAC,CAAC,EAAE,CAAC;AAEL,oDAAoD;AACpD,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,KAAa,EAAE,EAAE,CAAC,aAAa,GAAG,KAAK,GAAG,aAAa,CAAC;AAErF,2EAA2E;AAC3E,MAAM,CAAC,MAAM,UAAU,GAAG,UAAU,CAAC;AAErC,MAAM,aAAa,GAAG,CAAC,CAAC;AACxB,MAAM,YAAY,GAAG,CAAC,CAAC;AACvB,MAAM,eAAe,GAAG,CAAC,CAAC;AAC1B,MAAM,cAAc,GAAG,CAAC,CAAC;AACzB,mFAAmF;AACnF,MAAM,kBAAkB,GAAG,EAAE,CAAC;AAC9B,8GAA8G;AAC9G,MAAM,cAAc,GAAG,EAAE,CAAC;AAE1B,qEAAqE;AACrE,MAAM,MAAM,GAAG,IAAI,CAAC;AACpB,MAAM,eAAe,GAAG,IAAI,CAAC;AAE7B,+FAA+F;AAC/F,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,CAAC;AAE7B,iHAAiH;AACjH,MAAM,aAAa,GAAG,IAAI,UAAU,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAE3E,MAAM,UAAU,GAAG,CAAC,OAA0B,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;AAE5G,MAAM,OAAO,GAAG,CAAC,OAA0B,EAAE,EAAE,CAAC,OAAO,CAAC,IAAI,YAAY,YAAY,CAAC;AAErF;;;GAGG;AACH,MAAM,SAAS,GAAG,CAAC,OAA0B,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,UAAU,KAAK,MAAM,CAAC;AAErG;;;GAGG;AACH,MAAM,CAAC,MAAM,aAAa,GAAqC;IAC7D,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,KAAK,EAAE,YAAY,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,SAAS,EAAE,KAAK,EAAE,kBAAkB,EAAE,KAAK;IAClH,QAAQ,EAAE,GAAG,EAAE,eAAe,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,YAAY,EAAE,GAAG,EAAE,qBAAqB,EAAE,GAAG;IACrG,aAAa,EAAE,KAAK,EAAE,iBAAiB,EAAE,GAAG,EAAE,cAAc,EAAE,GAAG,EAAE,uBAAuB,EAAE,GAAG,EAAE,aAAa,EAAE,KAAK;IACrH,WAAW,EAAE,GAAG,EAAE,oBAAoB,EAAE,GAAG,EAAE,gBAAgB,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,EAAE,eAAe,EAAE,GAAG;IACxG,QAAQ,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK;CAChE,CAAC;AAEF,2GAA2G;AAC3G,SAAS,cAAc,CAAC,KAAc,EAAE,IAAY,EAAE,IAAyB,EAAE,OAAO,IAAI,GAAG,EAAW;IACxG,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC9B,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;YAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAE5C,OAAO;IACT,CAAC;IAED,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC;QAAE,OAAO;IAEhG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IAEhB,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,cAAc,CAAC,KAAK,EAAE,GAAG,IAAI,IAAI,GAAG,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;AACxG,CAAC;AAUD,yHAAyH;AACzH,MAAM,KAAK,GAAG,UAAU,CAAC;AAEzB;;;;GAIG;AACH,SAAS,eAAe,CAAC,QAA4B,EAAE,QAAoD,EACzG,QAAsC;IACtC,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;IACtF,MAAM,QAAQ,GAAG,EAAE,GAAG,QAAQ,CAAC,MAAM,EAAE,QAAQ,EAAE,GAAG,QAAQ,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;IACjH,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,KAAK,MAAM,OAAO,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC;QAC9E,IAAI,CAAC,OAAO;YAAE,SAAS;QAEvB,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC;YACvD,IAAI,IAAI,IAAI,KAAK,IAAI,IAAI,GAAG,KAAK,GAAG,QAAQ,CAAC,MAAM;gBAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAC7F,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,eAAe,CAAC,KAAsB,EACpD,QAAqD;IACrD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC5C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;IAExE,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,IAAI,CAAC,QAAQ;YAAE,SAAS;QAExB,MAAM,EAAE,IAAI,EAAE,GAAG,UAAU,EAAE,GAAG,QAAQ,CAAC;QACzC,MAAM,IAAI,GAAG,aAAa,QAAQ,CAAC,IAAI,IAAI,QAAQ,CAAC,IAAI,GAAG,CAAC;QAC5D,mGAAmG;QACnG,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,GAAG,UAAU,CAAC;QAEvC,IAAI,QAAQ,IAAI,MAAM,EAAE,CAAC;YACvB,KAAK,MAAM,EAAE,IAAI,eAAe,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC;gBACxE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,iBAAiB,IAAI,EAAE,CAAC,CAAC;QACvE,CAAC;aAAM,IAAI,MAAM,EAAE,CAAC;YAClB,cAAc,CAAC,MAAM,EAAE,GAAG,IAAI,SAAS,EAAE,SAAS,CAAC,CAAC;QACtD,CAAC;QAED,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,EAAE,CAAC;YACpD,IAAI,OAAO,EAAE,KAAK,QAAQ;gBAAE,SAAS;YAErC,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAE5B,IAAI,CAAC,QAAQ;gBAAE,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,GAAG,IAAI,GAAG,EAAE,CAAC,CAAC;YAElD,KAAK,MAAM,OAAO,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,MAAM;gBAAE,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAC7E,CAAC;QAED,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;IACxC,CAAC;IAED,gFAAgF;IAChF,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC;QAC9C,IAAI,GAAG,KAAK,QAAQ,IAAI,GAAG,KAAK,UAAU;YAAE,cAAc,CAAC,KAAK,EAAE,GAAG,EAAE,SAAS,CAAC,CAAC;IAEpF,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IAExC,KAAK,MAAM,OAAO,IAAI,KAAK,CAAC,QAAQ,IAAI,EAAE,EAAE,CAAC;QAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACtC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAExC,IAAI,OAAO,CAAC,OAAO,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;aAChD,IAAI,CAAC,QAAQ;YAAE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,YAAY,KAAK,EAAE,CAAC,CAAC,CAAC,qBAAqB,CAAC,CAAC;aAC1F,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,SAAS,CAAC,GAAG,QAAQ,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;aAClF,IAAI,KAAK;YAAE,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,YAAY,KAAK,EAAE,CAAC,CAAC;;YACtD,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAChE,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC;AAC3B,CAAC;AAED,4GAA4G;AAC5G,MAAM,UAAU,qBAAqB,CAAC,KAAsB,EAC1D,QAAqD;IACrD,OAAO,eAAe,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,MAAM,CAAC;AACjD,CAAC;AAED,mDAAmD;AACnD,SAAS,UAAU,CAAC,OAA0B,EAAE,MAAe;IAC7D,MAAM,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;IAEnC,OAAO,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;AACjF,CAAC;AAiBD,MAAM,UAAU,YAAY,CAAC,KAAsB,EAAE,gBAA8C,EAAE,EACnG,YAAyC,qBAAqB,CAAC,KAAK,CAAC;IACrE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,wEAAwE;IACxE,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,CAAC,QAAQ,IAAI,EAAE,EAAE,GAAG,aAAa,CAAC;SACzD,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,IAAI,UAAU,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;SAC5F,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;IAEtE,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC;IAC/E,MAAM,UAAU,GAAG,aAAa,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,GAAG,aAAa,CAAC;IAChF,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,OAAO,EAAE,EAAE,CAAC,GAAG,GAAG,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEpG,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,EAAE,IAAI,EAAE,UAAU,EAAE,WAAW,EAAE,UAAU,GAAG,KAAK,EAAE,CAAC;AAC7F,CAAC;AAED,MAAM,UAAU,YAAY,CAAC,KAAsB,EAAE,SAAwB,EAAE;IAC7E,OAAO,aAAa,CAAC,YAAY,CAAC,KAAK,EAAE,MAAM,CAAC,QAAQ,CAAC,EAAE,MAAM,CAAC,KAAK,IAAI,IAAI,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC;AACjG,CAAC;AAED;;;GAGG;AACH,SAAS,UAAU,CAAC,KAAkB,EAAE,IAAiB;IACvD,MAAM,MAAM,GAAG,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IAC9E,MAAM,OAAO,GAAa,EAAE,CAAC;IAC7B,IAAI,OAAO,GAAG,IAAI,CAAC,UAAU,CAAC;IAE9B,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAErB,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE;QACvC,MAAM,EAAE,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,CAAC;QAE/B,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACtB,KAAK,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;QAC1B,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC;QAC/B,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;QAExB,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;cACvC,CAAC,SAAS,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,CAAC;cACvC,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;cACvC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC;cACpC,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,CAAC,CAAC;cAC7C,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE1D,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;QAC9B,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;QAC9B,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC,EAAE,WAAW,GAAG,CAAC,CAAC,CAAC;QAC5E,KAAK,CAAC,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;QAElB,mGAAmG;QACnG,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,EAAE,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QAE3F,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QACzD,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC;QAC1D,OAAO,IAAI,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,SAAS,SAAS,CAAC,OAA0B,EAAE,OAA2B;IACxE,MAAM,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC;IAEnC,IAAI,OAAO,CAAC,OAAO,CAAC;QAAE,OAAQ,OAAO,CAAC,IAAqB,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC;IAEpF,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,MAAM,MAAM,GAAG,OAAO,CAAC,IAAkB,CAAC;QAC1C,2GAA2G;QAC3G,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAEvD,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,MAAM,EAAE,KAAK,EAAE;YAAE,IAAI,CAAC,KAAK,CAAC,GAAG,MAAM,CAAC,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC;QAEvF,OAAO,IAAI,CAAC;IACd,CAAC;IAED,OAAO,aAAa,CAAC,CAAC,CAAE,OAAO,CAAC,IAAmB,CAAC,QAAQ,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACrF,CAAC;AAED,oFAAoF;AACpF,MAAM,UAAU,aAAa,CAAC,IAAiB,EAAE,UAAuB;IACtE,MAAM,EAAE,QAAQ,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC;IACnC,oFAAoF;IACpF,MAAM,IAAI,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC;IAChF,MAAM,OAAO,GAAG,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;IAEvC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE;QAClC,MAAM,OAAO,GAAG,OAAO,CAAC,KAAK,CAAC,CAAC;QAC/B,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QAEhE,IAAI,IAAI,EAAE,CAAC;YACT,sGAAsG;YACtG,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,GAAG,CAAC,EAAE,IAAI,CAAC,UAAU,CAAC;iBACtD,GAAG,CAAC,IAAI,UAAU,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;YAEtE,OAAO;QACT,CAAC;QAED,MAAM,MAAM,GAAG,OAAO,CAAC,IAAkB,CAAC;QAE1C,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;YACzD,MAAM,MAAM,GAAG,KAAK,GAAG,CAAC,CAAC;YAEzB,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;kBAClC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;kBACzB,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;kBAC1B,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC;QACjC,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;IAEvC,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,MAAM,EAAE,OAAO,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE,CAAC;AAClF,CAAC;AAiBD,MAAM,UAAU,aAAa,CAAC,IAAiB,EAAE,UAAuB;IACtE,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,GAAG,UAAU,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAEzE,8FAA8F;IAC9F,IAAI,CAAC,aAAa,EAAE,CAAC;QACnB,MAAM,MAAM,GAAG,aAAa,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;QAE/C,OAAO;YACL,UAAU;YACV,KAAK,EAAE,MAAM,CAAC,KAAK;YACnB,OAAO,EAAE,MAAM,CAAC,OAAO;YACvB,WAAW,EAAE,MAAM,CAAC,WAAW;YAC/B,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9E,KAAK,EAAE,CAAC,MAAM,EAAE,MAAM,EAAE,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC;SAC5E,CAAC;IACJ,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAChD,MAAM,OAAO,GAAG,UAAU,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAEzC,OAAO;QACL,UAAU;QACV,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM;QAC3B,OAAO,EAAE,IAAI,CAAC,OAAO;QACrB,WAAW,EAAE,IAAI,CAAC,WAAW;QAC7B,OAAO;QACP,KAAK,CAAC,MAAM,EAAE,MAAM;YAClB,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;YAE5C,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,KAAK,EAAE,EAAE;gBACvC,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,CAAoB,CAAC;gBAEnF,IAAI,IAAI,CAAC,UAAU;oBAAE,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;YAClF,CAAC,CAAC,CAAC;YAEH,IAAI,UAAU,CAAC,MAAM;gBAAE,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,UAAU,CAAC,CAAC;QAC5F,CAAC;KACF,CAAC;AACJ,CAAC;AAED,OAAO,EAAE,eAAe,EAAE,MAAM,EAAE,CAAC"}

package/dist/wgsl/bvh.wgsl.d.ts

@@ -4,6 +4,10 @@
  * The positions are uploaded in the hierarchy's leaf order, so a leaf is a run of triangles read straight off the
  * buffer; the scene's own triangle number is looked up once, for the hit a trace returns. Every other reader goes the
  * other way, from a triangle number to where its corners sit.
+ *
+ * With INSTANCES compiled in, a leaf with a count of -1 is an instance: the ray is taken into its object space and
+ * the traversal goes on in its prototype's hierarchy, with a marker on the stack that brings it back to world space.
+ * The distance along the ray is the same in both spaces, since the direction is transformed and not normalized.
  */
-export declare const BVH_WGSL = "\n/** A corner of the triangle at this position of the hierarchy's leaf order. */\nfn leafVertex(at: u32, corner: u32) -> vec3<f32> {\n  let base = at * 9u + corner * 3u;\n\n  return vec3<f32>(positions[base], positions[base + 1u], positions[base + 2u]);\n}\n\n/** Where a triangle of the scene sits in the leaf order the positions are stored in. */\nfn leafOf(triangle: u32) -> u32 {\n  return indices[frame.leafOffset + triangle];\n}\n\nfn triangleVertex(triangle: u32, corner: u32) -> vec3<f32> {\n  return leafVertex(leafOf(triangle), corner);\n}\n\n/** Moller-Trumbore. Returns the distance in x and the barycentric coordinates in yz, or a negative distance. */\nfn intersectTriangle(at: u32, origin: vec3<f32>, direction: vec3<f32>) -> vec3<f32> {\n  let miss = vec3<f32>(-1.0, 0.0, 0.0);\n  let a = leafVertex(at, 0u);\n  let edge1 = leafVertex(at, 1u) - a;\n  let edge2 = leafVertex(at, 2u) - a;\n  let p = cross(direction, edge2);\n  let determinant = dot(edge1, p);\n\n  if (abs(determinant) < 1e-12) {\n    return miss;\n  }\n\n  let inverse = 1.0 / determinant;\n  let offset = origin - a;\n  let u = dot(offset, p) * inverse;\n\n  if (u < 0.0 || u > 1.0) {\n    return miss;\n  }\n\n  let q = cross(offset, edge1);\n  let v = dot(direction, q) * inverse;\n\n  if (v < 0.0 || u + v > 1.0) {\n    return miss;\n  }\n\n  return vec3<f32>(dot(edge2, q) * inverse, u, v);\n}\n\n/** Where a ray enters a box, or 1e30 when it misses it or only meets it past maxDistance. */\nfn enterBox(low: vec3<f32>, high: vec3<f32>, origin: vec3<f32>, inverse: vec3<f32>, maxDistance: f32) -> f32 {\n  let first = (low - origin) * inverse;\n  let second = (high - origin) * inverse;\n  let near = min(first, second);\n  let far = max(first, second);\n  let enter = max(max(near.x, near.y), max(near.z, 0.0));\n  let exit = min(min(far.x, far.y), min(far.z, maxDistance));\n\n  return select(1e30, enter, enter <= exit);\n}\n\n/** The triangles of a leaf, against the closest hit so far, which records where in the leaf order it found one. */\nfn intersectLeaf(link: i32, count: i32, origin: vec3<f32>, direction: vec3<f32>, hit: ptr<function, Hit>) {\n  let start = u32(-1 - link);\n\n  for (var i = 0u; i < u32(count); i = i + 1u) {\n    let result = intersectTriangle(start + i, origin, direction);\n\n    if (result.x > RAY_EPSILON && result.x < (*hit).distance) {\n      (*hit).distance = result.x;\n      (*hit).triangle = start + i;\n      (*hit).u = result.y;\n      (*hit).v = result.z;\n    }\n  }\n}\n\n/** Whether any triangle of a leaf lies along the ray before maxDistance: its position in the leaf order, or NO_HIT. */\nfn anyInLeaf(link: i32, count: i32, origin: vec3<f32>, direction: vec3<f32>, maxDistance: f32) -> u32 {\n  let start = u32(-1 - link);\n\n  for (var i = 0u; i < u32(count); i = i + 1u) {\n    let result = intersectTriangle(start + i, origin, direction);\n\n    if (result.x > RAY_EPSILON && result.x < maxDistance) {\n      return start + i;\n    }\n  }\n\n  return NO_HIT;\n}\n\n/** No node to go to: the traversal takes the next entry off the stack. */\nconst NO_NODE: u32 = 0xffffffffu;\n\n/**\n * A stack entry that is a leaf rather than a node: the node holding it and which of its two children it is. A leaf\n * has no node of its own, so this is how one waits its turn.\n */\nconst LEAF_ENTRY: u32 = 0x80000000u;\n\nfn leafEntry(parent: u32, right: bool) -> u32 {\n  return LEAF_ENTRY | (parent << 1u) | select(0u, 1u, right);\n}\n\n/** A waiting leaf's link and count, read back from the node that holds it. */\nfn waitingLeaf(entry: u32) -> vec2<i32> {\n  let parent = (entry & ~LEAF_ENTRY) >> 1u;\n\n  if ((entry & 1u) != 0u) {\n    return vec2<i32>(nodes[parent].rightLink, nodes[parent].rightCount);\n  }\n\n  return vec2<i32>(nodes[parent].leftLink, nodes[parent].leftCount);\n}\n\n/**\n * The closest hit along a ray. A node holds both of its children's boxes, so one read tests them both. The nearer is\n * visited first, so the closest hit shrinks the search early and whole subtrees behind it are skipped; the farther one\n * waits on the stack with where the ray entered it, and is dropped unopened if something closer turned up meanwhile.\n * A leaf is tested at the top of the next step, the one place the loop tests triangles, which keeps the kernel small.\n * This visits what the binary tree's traversal visited, in the same order, so it finds the same hit.\n */\nfn traceScene(origin: vec3<f32>, direction: vec3<f32>, maxDistance: f32) -> Hit {\n  var hit: Hit;\n  hit.distance = maxDistance;\n  hit.triangle = NO_HIT;\n  hit.u = 0.0;\n  hit.v = 0.0;\n\n  if (frame.triangleCount == 0u) {\n    return hit;\n  }\n\n  // A huge finite reciprocal instead of an infinite one: an axis aligned slab would otherwise produce 0 * inf.\n  let signs = select(vec3<f32>(-1.0), vec3<f32>(1.0), direction >= vec3<f32>(0.0));\n  let inverse = signs / max(abs(direction), vec3<f32>(1e-20));\n\n  var stack: array<u32, 32>;\n  var enters: array<f32, 32>;\n  var depth = 0u;\n  var current = 0u;\n  // A leaf to test before anything else: its link, and its triangle count, zero when there is none.\n  var leaf = vec2<i32>(0, 0);\n\n  loop {\n    if (leaf.y > 0) {\n      intersectLeaf(leaf.x, leaf.y, origin, direction, &hit);\n      leaf.y = 0;\n    }\n\n    if (current == NO_NODE) {\n      if (depth == 0u) {\n        break;\n      }\n\n      depth = depth - 1u;\n\n      // Something closer was found since this was pushed.\n      if (enters[depth] > hit.distance) {\n        continue;\n      }\n\n      let entry = stack[depth];\n\n      if ((entry & LEAF_ENTRY) != 0u) {\n        leaf = waitingLeaf(entry);\n        continue;\n      }\n\n      current = entry;\n    }\n\n    let node = nodes[current];\n    let leftEnter = enterBox(node.leftLow, node.leftHigh, origin, inverse, hit.distance);\n    let rightEnter = enterBox(node.rightLow, node.rightHigh, origin, inverse, hit.distance);\n    let leftFirst = leftEnter <= rightEnter;\n    let nearLink = select(node.rightLink, node.leftLink, leftFirst);\n    let farEnter = select(leftEnter, rightEnter, leftFirst);\n    let farLink = select(node.leftLink, node.rightLink, leftFirst);\n    let parent = current;\n\n    current = NO_NODE;\n\n    // The nearer child: a miss means both missed.\n    if (min(leftEnter, rightEnter) < 1e30) {\n      if (nearLink < 0) {\n        leaf = vec2<i32>(nearLink, select(node.rightCount, node.leftCount, leftFirst));\n      } else {\n        current = u32(nearLink);\n      }\n    }\n\n    // The builder caps its depth so the far children always fit; the guard keeps a malformed tree inside the stack.\n    if (farEnter < 1e30 && depth < 32u) {\n      stack[depth] = select(u32(farLink), leafEntry(parent, leftFirst), farLink < 0);\n      enters[depth] = farEnter;\n      depth = depth + 1u;\n    }\n  }\n\n  if (hit.triangle != NO_HIT) {\n    hit.triangle = orderedTriangle(hit.triangle);\n  }\n\n  return hit;\n}\n\n/**\n * Whether anything at all lies along a ray before maxDistance, stopping at the first triangle it finds rather than the\n * closest: what a shadow ray asks when every surface it could meet blocks it. Returns that triangle, or NO_HIT. The\n * right child goes first and the left one waits, the order the binary tree's traversal took.\n */\nfn traceAny(origin: vec3<f32>, direction: vec3<f32>, maxDistance: f32) -> u32 {\n  if (frame.triangleCount == 0u) {\n    return NO_HIT;\n  }\n\n  let signs = select(vec3<f32>(-1.0), vec3<f32>(1.0), direction >= vec3<f32>(0.0));\n  let inverse = signs / max(abs(direction), vec3<f32>(1e-20));\n\n  var stack: array<u32, 32>;\n  var depth = 0u;\n  var current = 0u;\n  var leaf = vec2<i32>(0, 0);\n\n  loop {\n    if (leaf.y > 0) {\n      let found = anyInLeaf(leaf.x, leaf.y, origin, direction, maxDistance);\n\n      if (found != NO_HIT) {\n        return orderedTriangle(found);\n      }\n\n      leaf.y = 0;\n    }\n\n    if (current == NO_NODE) {\n      if (depth == 0u) {\n        break;\n      }\n\n      depth = depth - 1u;\n\n      let entry = stack[depth];\n\n      if ((entry & LEAF_ENTRY) != 0u) {\n        leaf = waitingLeaf(entry);\n        continue;\n      }\n\n      current = entry;\n    }\n\n    let node = nodes[current];\n    let rightHit = enterBox(node.rightLow, node.rightHigh, origin, inverse, maxDistance) < 1e30;\n    let leftHit = enterBox(node.leftLow, node.leftHigh, origin, inverse, maxDistance) < 1e30;\n    let parent = current;\n\n    current = NO_NODE;\n\n    // The right child is taken now and the left one waits; with only one of them hit, that one is taken now.\n    let takeRight = rightHit;\n    let takenLink = select(node.leftLink, node.rightLink, takeRight);\n\n    if (rightHit || leftHit) {\n      if (takenLink < 0) {\n        leaf = vec2<i32>(takenLink, select(node.leftCount, node.rightCount, takeRight));\n      } else {\n        current = u32(takenLink);\n      }\n    }\n\n    if (rightHit && leftHit && depth < 32u) {\n      stack[depth] = select(u32(node.leftLink), leafEntry(parent, false), node.leftLink < 0);\n      depth = depth + 1u;\n    }\n  }\n\n  return NO_HIT;\n}\n";
+export declare const BVH_WGSL = "\n/** A corner of the triangle at this position of the hierarchy's leaf order. */\nfn leafVertex(at: u32, corner: u32) -> vec3<f32> {\n  let base = at * 9u + corner * 3u;\n\n  return vec3<f32>(positions[base], positions[base + 1u], positions[base + 2u]);\n}\n\n/** Where a triangle of the scene sits in the leaf order the positions are stored in. */\nfn leafOf(triangle: u32) -> u32 {\n  return indices[frame.leafOffset + triangle];\n}\n\n/** A corner of a triangle a hit named, in world space. */\nfn triangleVertex(triangle: u32, corner: u32) -> vec3<f32> {\n  let instance = instanceOf(triangle);\n  let p = leafVertex(leafOf(storedTriangle(triangle, instance)), corner);\n\n  if (instance != NO_INSTANCE) {\n    return instancePoint(instance, p);\n  }\n\n  return p;\n}\n\n/** The stack entry that leaves an instance: the traversal goes back to world space. */\nconst RETURN_ENTRY: u32 = 0xffffffffu;\n\n/** A huge finite reciprocal instead of an infinite one: an axis aligned slab would otherwise produce 0 * inf. */\nfn rayInverse(direction: vec3<f32>) -> vec3<f32> {\n  let signs = select(vec3<f32>(-1.0), vec3<f32>(1.0), direction >= vec3<f32>(0.0));\n\n  return signs / max(abs(direction), vec3<f32>(1e-20));\n}\n\n/** The number a hit goes by, from where it sits in the leaf order and the instance it was found in. */\nfn namedTriangle(at: u32, instance: u32) -> u32 {\n  let stored = orderedTriangle(at);\n\n  if (INSTANCES && instance != NO_INSTANCE) {\n    return instanceWord(instance, 26u) + stored - instanceWord(instance, 25u);\n  }\n\n  return stored;\n}\n\n/** Moller-Trumbore. Returns the distance in x and the barycentric coordinates in yz, or a negative distance. */\nfn intersectTriangle(at: u32, origin: vec3<f32>, direction: vec3<f32>) -> vec3<f32> {\n  let miss = vec3<f32>(-1.0, 0.0, 0.0);\n  let a = leafVertex(at, 0u);\n  let edge1 = leafVertex(at, 1u) - a;\n  let edge2 = leafVertex(at, 2u) - a;\n  let p = cross(direction, edge2);\n  let determinant = dot(edge1, p);\n\n  if (abs(determinant) < 1e-12) {\n    return miss;\n  }\n\n  let inverse = 1.0 / determinant;\n  let offset = origin - a;\n  let u = dot(offset, p) * inverse;\n\n  if (u < 0.0 || u > 1.0) {\n    return miss;\n  }\n\n  let q = cross(offset, edge1);\n  let v = dot(direction, q) * inverse;\n\n  if (v < 0.0 || u + v > 1.0) {\n    return miss;\n  }\n\n  return vec3<f32>(dot(edge2, q) * inverse, u, v);\n}\n\n/** Where a ray enters a box, or 1e30 when it misses it or only meets it past maxDistance. */\nfn enterBox(low: vec3<f32>, high: vec3<f32>, origin: vec3<f32>, inverse: vec3<f32>, maxDistance: f32) -> f32 {\n  let first = (low - origin) * inverse;\n  let second = (high - origin) * inverse;\n  let near = min(first, second);\n  let far = max(first, second);\n  let enter = max(max(near.x, near.y), max(near.z, 0.0));\n  let exit = min(min(far.x, far.y), min(far.z, maxDistance));\n\n  return select(1e30, enter, enter <= exit);\n}\n\n/** The triangles of a leaf, against the closest hit so far, which records where in the leaf order it found one. */\nfn intersectLeaf(link: i32, count: i32, origin: vec3<f32>, direction: vec3<f32>, hit: ptr<function, Hit>) {\n  let start = u32(-1 - link);\n\n  for (var i = 0u; i < u32(count); i = i + 1u) {\n    let result = intersectTriangle(start + i, origin, direction);\n\n    if (result.x > RAY_EPSILON && result.x < (*hit).distance) {\n      (*hit).distance = result.x;\n      (*hit).triangle = start + i;\n      (*hit).u = result.y;\n      (*hit).v = result.z;\n    }\n  }\n}\n\n/** Whether any triangle of a leaf lies along the ray before maxDistance: its position in the leaf order, or NO_HIT. */\nfn anyInLeaf(link: i32, count: i32, origin: vec3<f32>, direction: vec3<f32>, maxDistance: f32) -> u32 {\n  let start = u32(-1 - link);\n\n  for (var i = 0u; i < u32(count); i = i + 1u) {\n    let result = intersectTriangle(start + i, origin, direction);\n\n    if (result.x > RAY_EPSILON && result.x < maxDistance) {\n      return start + i;\n    }\n  }\n\n  return NO_HIT;\n}\n\n/** No node to go to: the traversal takes the next entry off the stack. */\nconst NO_NODE: u32 = 0xffffffffu;\n\n/**\n * A stack entry that is a leaf rather than a node: the node holding it and which of its two children it is. A leaf\n * has no node of its own, so this is how one waits its turn.\n */\nconst LEAF_ENTRY: u32 = 0x80000000u;\n\nfn leafEntry(parent: u32, right: bool) -> u32 {\n  return LEAF_ENTRY | (parent << 1u) | select(0u, 1u, right);\n}\n\n/** A waiting leaf's link and count, read back from the node that holds it. */\nfn waitingLeaf(entry: u32) -> vec2<i32> {\n  let parent = (entry & ~LEAF_ENTRY) >> 1u;\n\n  if ((entry & 1u) != 0u) {\n    return vec2<i32>(nodes[parent].rightLink, nodes[parent].rightCount);\n  }\n\n  return vec2<i32>(nodes[parent].leftLink, nodes[parent].leftCount);\n}\n\n/**\n * The closest hit along a ray. A node holds both of its children's boxes, so one read tests them both. The nearer is\n * visited first, so the closest hit shrinks the search early and whole subtrees behind it are skipped; the farther one\n * waits on the stack with where the ray entered it, and is dropped unopened if something closer turned up meanwhile.\n * A leaf is tested at the top of the next step, the one place the loop tests triangles, which keeps the kernel small.\n * This visits what the binary tree's traversal visited, in the same order, so it finds the same hit.\n */\nfn traceScene(worldOrigin: vec3<f32>, worldDirection: vec3<f32>, maxDistance: f32) -> Hit {\n  var hit: Hit;\n  hit.distance = maxDistance;\n  hit.triangle = NO_HIT;\n  hit.u = 0.0;\n  hit.v = 0.0;\n\n  if (frame.triangleCount == 0u) {\n    return hit;\n  }\n\n  var origin = worldOrigin;\n  var direction = worldDirection;\n  var inverse = rayInverse(direction);\n  // The instance the traversal is inside, and the one the closest hit so far was found in.\n  var instance = NO_INSTANCE;\n  var hitInstance = NO_INSTANCE;\n\n  var stack: array<u32, BVH_STACK>;\n  var enters: array<f32, BVH_STACK>;\n  var depth = 0u;\n  var current = 0u;\n  // A leaf to test before anything else: its link, and its triangle count, zero when there is none.\n  var leaf = vec2<i32>(0, 0);\n\n  loop {\n    if (leaf.y > 0) {\n      let before = hit.distance;\n\n      intersectLeaf(leaf.x, leaf.y, origin, direction, &hit);\n\n      if (INSTANCES && hit.distance < before) {\n        hitInstance = instance;\n      }\n\n      leaf.y = 0;\n    }\n\n    if (INSTANCES && leaf.y < 0) {\n      leaf.y = 0;\n\n      if (depth < BVH_STACK) {\n        instance = u32(-1 - leaf.x);\n        stack[depth] = RETURN_ENTRY;\n        enters[depth] = -1.0;\n        depth = depth + 1u;\n        origin = instanceToObject(instance, worldOrigin, 1.0);\n        direction = instanceToObject(instance, worldDirection, 0.0);\n        inverse = rayInverse(direction);\n        current = instanceWord(instance, 24u);\n      }\n    }\n\n    if (current == NO_NODE) {\n      if (depth == 0u) {\n        break;\n      }\n\n      depth = depth - 1u;\n\n      // Something closer was found since this was pushed.\n      if (enters[depth] > hit.distance) {\n        continue;\n      }\n\n      let entry = stack[depth];\n\n      if (INSTANCES && entry == RETURN_ENTRY) {\n        instance = NO_INSTANCE;\n        origin = worldOrigin;\n        direction = worldDirection;\n        inverse = rayInverse(direction);\n        continue;\n      }\n\n      if ((entry & LEAF_ENTRY) != 0u) {\n        leaf = waitingLeaf(entry);\n        continue;\n      }\n\n      current = entry;\n    }\n\n    let node = nodes[current];\n    let leftEnter = enterBox(node.leftLow, node.leftHigh, origin, inverse, hit.distance);\n    let rightEnter = enterBox(node.rightLow, node.rightHigh, origin, inverse, hit.distance);\n    let leftFirst = leftEnter <= rightEnter;\n    let nearLink = select(node.rightLink, node.leftLink, leftFirst);\n    let farEnter = select(leftEnter, rightEnter, leftFirst);\n    let farLink = select(node.leftLink, node.rightLink, leftFirst);\n    let parent = current;\n\n    current = NO_NODE;\n\n    // The nearer child: a miss means both missed.\n    if (min(leftEnter, rightEnter) < 1e30) {\n      if (nearLink < 0) {\n        leaf = vec2<i32>(nearLink, select(node.rightCount, node.leftCount, leftFirst));\n      } else {\n        current = u32(nearLink);\n      }\n    }\n\n    // The builder caps its depth so the far children always fit; the guard keeps a malformed tree inside the stack.\n    if (farEnter < 1e30 && depth < BVH_STACK) {\n      stack[depth] = select(u32(farLink), leafEntry(parent, leftFirst), farLink < 0);\n      enters[depth] = farEnter;\n      depth = depth + 1u;\n    }\n  }\n\n  if (hit.triangle != NO_HIT) {\n    hit.triangle = namedTriangle(hit.triangle, hitInstance);\n  }\n\n  return hit;\n}\n\n/**\n * Whether anything at all lies along a ray before maxDistance, stopping at the first triangle it finds rather than the\n * closest: what a shadow ray asks when every surface it could meet blocks it. Returns that triangle, or NO_HIT. The\n * right child goes first and the left one waits, the order the binary tree's traversal took.\n */\nfn traceAny(worldOrigin: vec3<f32>, worldDirection: vec3<f32>, maxDistance: f32) -> u32 {\n  if (frame.triangleCount == 0u) {\n    return NO_HIT;\n  }\n\n  var origin = worldOrigin;\n  var direction = worldDirection;\n  var inverse = rayInverse(direction);\n  var instance = NO_INSTANCE;\n\n  var stack: array<u32, BVH_STACK>;\n  var depth = 0u;\n  var current = 0u;\n  var leaf = vec2<i32>(0, 0);\n\n  loop {\n    if (leaf.y > 0) {\n      let found = anyInLeaf(leaf.x, leaf.y, origin, direction, maxDistance);\n\n      if (found != NO_HIT) {\n        return namedTriangle(found, instance);\n      }\n\n      leaf.y = 0;\n    }\n\n    if (INSTANCES && leaf.y < 0) {\n      leaf.y = 0;\n\n      if (depth < BVH_STACK) {\n        instance = u32(-1 - leaf.x);\n        stack[depth] = RETURN_ENTRY;\n        depth = depth + 1u;\n        origin = instanceToObject(instance, worldOrigin, 1.0);\n        direction = instanceToObject(instance, worldDirection, 0.0);\n        inverse = rayInverse(direction);\n        current = instanceWord(instance, 24u);\n      }\n    }\n\n    if (current == NO_NODE) {\n      if (depth == 0u) {\n        break;\n      }\n\n      depth = depth - 1u;\n\n      let entry = stack[depth];\n\n      if (INSTANCES && entry == RETURN_ENTRY) {\n        instance = NO_INSTANCE;\n        origin = worldOrigin;\n        direction = worldDirection;\n        inverse = rayInverse(direction);\n        continue;\n      }\n\n      if ((entry & LEAF_ENTRY) != 0u) {\n        leaf = waitingLeaf(entry);\n        continue;\n      }\n\n      current = entry;\n    }\n\n    let node = nodes[current];\n    let rightHit = enterBox(node.rightLow, node.rightHigh, origin, inverse, maxDistance) < 1e30;\n    let leftHit = enterBox(node.leftLow, node.leftHigh, origin, inverse, maxDistance) < 1e30;\n    let parent = current;\n\n    current = NO_NODE;\n\n    // The right child is taken now and the left one waits; with only one of them hit, that one is taken now.\n    let takeRight = rightHit;\n    let takenLink = select(node.leftLink, node.rightLink, takeRight);\n\n    if (rightHit || leftHit) {\n      if (takenLink < 0) {\n        leaf = vec2<i32>(takenLink, select(node.leftCount, node.rightCount, takeRight));\n      } else {\n        current = u32(takenLink);\n      }\n    }\n\n    if (rightHit && leftHit && depth < BVH_STACK) {\n      stack[depth] = select(u32(node.leftLink), leafEntry(parent, false), node.leftLink < 0);\n      depth = depth + 1u;\n    }\n  }\n\n  return NO_HIT;\n}\n";
 //# sourceMappingURL=bvh.wgsl.d.ts.map

package/dist/wgsl/bvh.wgsl.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"bvh.wgsl.d.ts","sourceRoot":"","sources":["../../src/wgsl/bvh.wgsl.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AACH,eAAO,MAAM,QAAQ,+5RAwRpB,CAAC"}
+{"version":3,"file":"bvh.wgsl.d.ts","sourceRoot":"","sources":["../../src/wgsl/bvh.wgsl.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,eAAO,MAAM,QAAQ,65WA8WpB,CAAC"}