@woosh/meep-engine 3.41.0 → 3.42.0

package/src/shade/wgsl/emulator/WGSLLanguageCore.js

@@ -1265,17 +1265,25 @@ export const WGSLLanguageCore = {
      * silently dropped (WGSL semantics). `coords` length matches the
      * texture dimensionality.
      *
+     * Four arguments is the `texture_storage_2d_array` form — `(t, coords, array_index, value)` —
+     * where the third argument selects the slice, stored along z as the sampling side reads it.
+     *
      * @param {import("./CPUBitmapData.js").CPUBitmapData} t
      * @param {Int32Array | Uint32Array | number[] | number} coords
-     * @param {Float32Array | Int32Array | Uint32Array | number[]} value
+     * @param {Float32Array | Int32Array | Uint32Array | number[] | number} value_or_index
+     * @param {Float32Array | Int32Array | Uint32Array | number[]} [array_value]
      */
-    textureStore(t, coords, value) {
+    textureStore(t, coords, value_or_index, array_value = undefined) {
         assert.defined(t, 'texture');
+        if (array_value !== undefined) {
+            t.write(coords[0] | 0, coords[1] | 0, value_or_index | 0, array_value);
+            return;
+        }
         const dim = t.dimensionality;
         const x = (dim >= 1 ? (typeof coords === 'number' ? coords : coords[0]) : 0) | 0;
         const y = (dim >= 2 ? coords[1] : 0) | 0;
         const z = (dim >= 3 ? coords[2] : 0) | 0;
-        t.write(x, y, z, value);
+        t.write(x, y, z, value_or_index);
     },
 
     // CPUBitmapData models one stored mip level.

package/src/core/geom/2d/polygon/polygon2_triangulate.corpus.d.ts

@@ -1,28 +0,0 @@
-/**
- * Inputs that have actually broken {@link polygon2_triangulate}, kept so they can
- * never break it again.
- *
- * This file only ever grows, and only from real failures -- a case someone
- * *imagines* might be hard belongs in the ordinary spec, not here. Every entry
- * records what went wrong when it was added, because that is the part that stops
- * a future change from quietly reintroducing the same class of bug. The practice
- * is borrowed from manifold, whose triangulator carries ~3 MB of recorded failing
- * polygons replayed as tests.
- *
- * `expect_full` says whether the polygon is well-formed enough that the whole of
- * its area must be covered. `false` means the input is genuinely invalid
- * (self-intersecting) and the only requirements are the universal ones: no throw,
- * no hang, no out-of-range index.
- *
- * @author Alex Goldring
- * @copyright Company Named Limited (c) 2026
- */
-export const POLYGON2_TRIANGULATE_CORPUS: {
-    name: string;
-    why: string;
-    points: number[];
-    contour_ends: number[];
-    contour_count: number;
-    expect_full: boolean;
-}[];
-//# sourceMappingURL=polygon2_triangulate.corpus.d.ts.map

package/src/core/geom/2d/polygon/polygon2_triangulate.corpus.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"polygon2_triangulate.corpus.d.ts","sourceRoot":"","sources":["../../../../../../src/core/geom/2d/polygon/polygon2_triangulate.corpus.js"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;GAkBG;AACH;;;;;;;IAkEE"}

package/src/core/geom/2d/polygon/polygon2_triangulate.corpus.js

@@ -1,86 +0,0 @@
-/**
- * Inputs that have actually broken {@link polygon2_triangulate}, kept so they can
- * never break it again.
- *
- * This file only ever grows, and only from real failures -- a case someone
- * *imagines* might be hard belongs in the ordinary spec, not here. Every entry
- * records what went wrong when it was added, because that is the part that stops
- * a future change from quietly reintroducing the same class of bug. The practice
- * is borrowed from manifold, whose triangulator carries ~3 MB of recorded failing
- * polygons replayed as tests.
- *
- * `expect_full` says whether the polygon is well-formed enough that the whole of
- * its area must be covered. `false` means the input is genuinely invalid
- * (self-intersecting) and the only requirements are the universal ones: no throw,
- * no hang, no out-of-range index.
- *
- * @author Alex Goldring
- * @copyright Company Named Limited (c) 2026
- */
-export const POLYGON2_TRIANGULATE_CORPUS = [
-    {
-        name: "unit-offset micro square",
-        why: "Winding was decided by the shoelace sum, whose sign here is pure "
-            + "rounding noise: the true area is 1e-18 against ~1e-16 per-term error. "
-            + "The ring came out backwards, every corner looked reflex, and the "
-            + "result was zero triangles. Fixed by deciding winding with one exact "
-            + "orientation predicate at a hull vertex (polygon2_is_counter_clockwise).",
-        points: [
-            1, 1,
-            1 + 1e-9, 1,
-            1 + 1e-9, 1 + 1e-9,
-            1, 1 + 1e-9,
-        ],
-        contour_ends: [4],
-        contour_count: 1,
-        expect_full: true,
-    },
-    {
-        name: "coarse-grid point soup (fuzz seed 24)",
-        why: "Twenty points on a 7x7 integer grid, with duplicates and collinear "
-            + "runs. The ear search exhausted itself, fell through to the "
-            + "cure-local-intersections pass, and that pass walked the "
-            + "collapsed-ring sentinel as if it were a node -- an infinite loop. "
-            + "Fixed by making the recovery pass accept and propagate the sentinel, "
-            + "and by stopping it once the ring holds fewer than three nodes.",
-        points: [
-            2, 3, 3, 6, 1, 5, 0, 4, 5, 0,
-            4, 2, 3, 3, 3, 6, 2, 3, 6, 1,
-            4, 4, 2, 6, 3, 2, 6, 4, 1, 1,
-            3, 0, 5, 0, 3, 2, 6, 4, 3, 3,
-        ],
-        contour_ends: [20],
-        contour_count: 1,
-        expect_full: false,
-    },
-    {
-        name: "two rectangular holes bridged through a shared edge",
-        why: "Produced 12 triangles where the Euler bound allows 14, which looked "
-            + "like dropped geometry. It was not: the bridges left collinear corners "
-            + "that were correctly absorbed rather than emitted as zero-area "
-            + "triangles. Kept as the standing reminder that V + 2H - 2 is an upper "
-            + "bound, not an equality -- area conservation is the real invariant.",
-        points: [
-            0, 0, 20, 0, 20, 10, 0, 10,
-            2, 8, 6, 8, 6, 2, 2, 2,
-            12, 8, 18, 8, 18, 2, 12, 2,
-        ],
-        contour_ends: [4, 8, 12],
-        contour_count: 3,
-        expect_full: true,
-    },
-    {
-        name: "hole touching the outer boundary at a vertex",
-        why: "Same class as above -- 6 triangles against a bound of 7. The hole's "
-            + "corner lands exactly on the outer edge, so the bridge is degenerate "
-            + "and one corner becomes collinear. Area is still exact and every input "
-            + "vertex is still used.",
-        points: [
-            0, 0, 10, 0, 10, 10, 0, 10,
-            4, 7, 4, 3, 0, 5,
-        ],
-        contour_ends: [4, 7],
-        contour_count: 2,
-        expect_full: true,
-    },
-];

package/src/engine/ecs/storage/binary/object-v2/serializerTestHarness.d.ts

@@ -1,29 +0,0 @@
-/**
- * Serialize `value` with a serializer built on `registry`, then deserialize it with a deserializer built on
- * `registry` + `modules`. Shared by the object-graph specs.
- *
- * @template T
- * @param {T} value
- * @param {{registry?: BinarySerializationRegistry, modules?: ModuleRegistry}} [options]
- * @returns {T}
- */
-export function roundTrip<T>(value: T, { registry, modules }?: {
-    registry?: BinarySerializationRegistry;
-    modules?: ModuleRegistry<any>;
-}): T;
-/**
- * @param {*} value
- * @param {BinarySerializationRegistry} [registry]
- * @returns {BinaryBuffer} rewound to position 0
- */
-export function serialize(value: any, registry?: BinarySerializationRegistry): BinaryBuffer;
-/**
- * @param {*} value
- * @param {BinarySerializationRegistry} [registry]
- * @returns {number} byte length of the serialized form
- */
-export function serializedSize(value: any, registry?: BinarySerializationRegistry): number;
-import { BinarySerializationRegistry } from "../BinarySerializationRegistry.js";
-import { ModuleRegistry } from "../../../../../core/model/ModuleRegistry.js";
-import { BinaryBuffer } from "../../../../../core/binary/BinaryBuffer.js";
-//# sourceMappingURL=serializerTestHarness.d.ts.map

package/src/engine/ecs/storage/binary/object-v2/serializerTestHarness.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"serializerTestHarness.d.ts","sourceRoot":"","sources":["../../../../../../../src/engine/ecs/storage/binary/object-v2/serializerTestHarness.js"],"names":[],"mappings":"AAMA;;;;;;;;GAQG;AACH,+DAHW;IAAC,QAAQ,CAAC,EAAE,2BAA2B,CAAC;IAAC,OAAO,CAAC,sBAAgB;CAAC,KAS5E;AAED;;;;GAIG;AACH,iDAHW,2BAA2B,GACzB,YAAY,CAQxB;AAED;;;;GAIG;AACH,sDAHW,2BAA2B,GACzB,MAAM,CAIlB;4CAzC2C,mCAAmC;+BADhD,6CAA6C;6BAD/C,4CAA4C"}

package/src/engine/ecs/storage/binary/object-v2/serializerTestHarness.js

@@ -1,44 +0,0 @@
-import { BinaryBuffer } from "../../../../../core/binary/BinaryBuffer.js";
-import { ModuleRegistry } from "../../../../../core/model/ModuleRegistry.js";
-import { BinarySerializationRegistry } from "../BinarySerializationRegistry.js";
-import { BinaryObjectDeSerializer } from "./BinaryObjectDeSerializer.js";
-import { BinaryObjectSerializer } from "./BinaryObjectSerializer.js";
-
-/**
- * Serialize `value` with a serializer built on `registry`, then deserialize it with a deserializer built on
- * `registry` + `modules`. Shared by the object-graph specs.
- *
- * @template T
- * @param {T} value
- * @param {{registry?: BinarySerializationRegistry, modules?: ModuleRegistry}} [options]
- * @returns {T}
- */
-export function roundTrip(value, { registry = new BinarySerializationRegistry(), modules = new ModuleRegistry() } = {}) {
-    const buffer = serialize(value, registry);
-
-    buffer.position = 0;
-
-    return new BinaryObjectDeSerializer(registry, modules).deserialize(buffer);
-}
-
-/**
- * @param {*} value
- * @param {BinarySerializationRegistry} [registry]
- * @returns {BinaryBuffer} rewound to position 0
- */
-export function serialize(value, registry = new BinarySerializationRegistry()) {
-    const buffer = new BinaryBuffer();
-
-    new BinaryObjectSerializer(registry).serialize(buffer, value);
-
-    return buffer;
-}
-
-/**
- * @param {*} value
- * @param {BinarySerializationRegistry} [registry]
- * @returns {number} byte length of the serialized form
- */
-export function serializedSize(value, registry = new BinarySerializationRegistry()) {
-    return serialize(value, registry).position;
-}

package/src/shade/renderer/water/medium/shader_water_bodies_derive.d.ts

@@ -1,4 +0,0 @@
-export const WORKGROUP_SIZE: 64;
-export const shader_water_bodies_derive: ComputeShader;
-import { ComputeShader } from "../../shader/ComputeShader.js";
-//# sourceMappingURL=shader_water_bodies_derive.d.ts.map

package/src/shade/renderer/water/medium/shader_water_bodies_derive.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"shader_water_bodies_derive.d.ts","sourceRoot":"","sources":["../../../../../../src/shade/renderer/water/medium/shader_water_bodies_derive.js"],"names":[],"mappings":"AASA,gCAAiC;AAIjC,uDAkBG;8BA/B2B,+BAA+B"}

package/src/shade/renderer/water/medium/shader_water_bodies_derive.js

@@ -1,32 +0,0 @@
-import { ComputeShader } from "../../shader/ComputeShader.js";
-import { CodeChunk } from "../../shader/compiler/CodeChunk.js";
-import { ShaderResourceSetDescriptor } from "../../shader/resource/ShaderResourceSetDescriptor.js";
-import { WebGPUArray } from "../../shader/type/WebGPUArray.js";
-import { chunk_water_medium_derived } from "./chunk_water_medium_derived.js";
-import { chunk_water_medium_scattering } from "./chunk_water_medium_scattering.js";
-import { WATER_BODIES_TABLE as table } from "./chunk_water_bodies.js";
-import { chunk_folded_workgroup_index } from "../../shader/chunk/grid/chunk_folded_workgroup_index.js";
-
-export const WORKGROUP_SIZE = 64;
-const pg = table.page_iterator_symbol_prefix(WORKGROUP_SIZE, true);
-const resources = new ShaderResourceSetDescriptor();
-resources.createGroup().addStorageBuffer('scene_database', WebGPUArray.u32, true);
-export const shader_water_bodies_derive = ComputeShader.from({
-    label: "Water / bodies derive", resources,
-    body: CodeChunk.from(/* language=WGSL */ `
-@compute @workgroup_size(${WORKGROUP_SIZE})
-fn main(@builtin(workgroup_id) group: vec3u, @builtin(local_invocation_index) lane: u32) {
-    if (!${pg}_setup(&scene_database, folded_workgroup_index(group), lane)) { return; }
-    let slot = ${pg}_slot_in_page(lane);
-    if (slot >= ${pg}_ELEMENTS_PER_PAGE || !${pg}_is_occupied(slot)) { return; }
-    var body = ${pg}_read(&scene_database, slot);
-    if (body.dirty == 0u) { return; }
-    body.backscattering = vec4f(water_medium_backscattering(body.medium), 0.0);
-    body.extinction = vec4f(body.medium.absorption + water_medium_scattering(body.medium), 0.0);
-    body.diffuse_transmittance = water_diffuse_fresnel_transmittance(body.ior);
-    body.dirty = 0u;
-    ${table.marshalling_method_write}(&scene_database, ${pg}_slot_to_index(slot), body);
-}
-`, [table.chunk_iterate(WORKGROUP_SIZE, true), table.chunk_write, chunk_water_medium_derived,
-        chunk_water_medium_scattering, chunk_folded_workgroup_index]),
-});

package/src/shade/renderer/water/surface/GPUWaterWaveSimulation.d.ts

@@ -1,25 +0,0 @@
-/**
- * A shared wave atlas, indexed by occupied water_waves rows. Calm bodies allocate no grid.
- * Each fixed step dispatches the whole atlas once; tessellated vertices sample it in local xz.
- * The regular grid is a displacement field, never the rendered water footprint.
- */
-export class GPUWaterWaveSimulation {
-    onInputsConsumed: Signal;
-    resolution: number;
-    step: number;
-    max_steps_per_frame: number;
-    damping: number;
-    get time(): number;
-    get buffer(): any;
-    get grid_resolution(): number;
-    advance(dt: any): void;
-    dispose(): void;
-    record({ graph, device, scene }: {
-        graph: any;
-        device: any;
-        scene: any;
-    }): void;
-    #private;
-}
-import Signal from "../../../../core/events/signal/Signal.js";
-//# sourceMappingURL=GPUWaterWaveSimulation.d.ts.map

package/src/shade/renderer/water/surface/GPUWaterWaveSimulation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"GPUWaterWaveSimulation.d.ts","sourceRoot":"","sources":["../../../../../../src/shade/renderer/water/surface/GPUWaterWaveSimulation.js"],"names":[],"mappings":"AAKA;;;;GAIG;AACH;IACI,yBAAgC;IAChC,mBAAiB;IACjB,aAAe;IACf,4BAAwB;IACxB,gBAAe;IAYf,mBAAiC;IACjC,kBAAkD;IAClD,8BAAqE;IAErE,uBAIC;IAED,gBAMC;IAED;;;;aAiFC;;CACJ;mBA/HkB,0CAA0C"}

package/src/shade/renderer/water/surface/GPUWaterWaveSimulation.js

@@ -1,128 +0,0 @@
-import Signal from "../../../../core/events/signal/Signal.js";
-import { assert } from "../../../../core/assert.js";
-import { WATER_WAVE_BATCH_STRUCT, shader_water_wave_batch, shader_water_wave_batch_finish } from "./shader_water_wave_batch.js";
-import { shader_water_wave_bounds, shader_water_wave_domain } from "./shader_water_wave_domain.js";
-
-/**
- * A shared wave atlas, indexed by occupied water_waves rows. Calm bodies allocate no grid.
- * Each fixed step dispatches the whole atlas once; tessellated vertices sample it in local xz.
- * The regular grid is a displacement field, never the rendered water footprint.
- */
-export class GPUWaterWaveSimulation {
-    onInputsConsumed = new Signal();
-    resolution = 128;
-    step = 1 / 120;
-    max_steps_per_frame = 8;
-    damping = 0.08;
-    #device = null;
-    #scene = null;
-    #state = [];
-    #domain = null;
-    #capacity = 0;
-    #resolution = 0;
-    #parity = 0;
-    #pending = 0;
-    #time = 0;
-    #recorded = new WeakSet();
-    #write_pending = true;
-    get time() { return this.#time; }
-    get buffer() { return this.#state[this.#parity]; }
-    get grid_resolution() { return this.#resolution || this.resolution; }
-
-    advance(dt) {
-        assert.isFinite(dt, 'dt'); assert.greaterThanOrEqual(dt, 0, 'dt');
-        this.#pending += dt;
-        this.#write_pending = true;
-    }
-
-    dispose() {
-        for (const buffer of this.#state) { buffer.destroy(); }
-        this.#domain?.destroy(); this.#domain = null;
-        this.#state = []; this.#capacity = 0; this.#device = null; this.#scene = null;
-        this.#recorded = new WeakSet();
-        this.#write_pending = true;
-    }
-
-    record({ graph, device, scene }) {
-        if (this.#recorded.has(graph)) { return; }
-        if (device !== this.#device || scene !== this.#scene) {
-            this.dispose(); this.#device = device; this.#scene = scene;
-        }
-        this.#recorded.add(graph);
-        if (!this.#write_pending) { return; }
-        this.#write_pending = false;
-        const table = scene.scene_database.get('water_waves');
-        const capacity = table.count === 0 ? 0 : table.element_capacity;
-        assert.isInteger(this.resolution, 'resolution'); assert.greaterThanOrEqual(this.resolution, 2, 'resolution');
-        assert.greaterThan(this.step, 0, 'step');
-        const resize = capacity > this.#capacity || (capacity === 0 && this.#capacity !== 0) || this.resolution !== this.#resolution;
-        const old = this.#state;
-        const old_domain = this.#domain;
-        if (resize || old.length === 0) {
-            const size = Math.max(4, capacity * this.resolution ** 2 * 4);
-            assert.lessThanOrEqual(size, device.limits.maxStorageBufferBindingSize, 'Water wave atlas exceeds device storage limit; lower waves.resolution');
-            this.#state = [0, 1].map(i => device.createBuffer({ label: `Water / wave state ${i}`, size,
-                usage: GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC | GPUBufferUsage.COPY_DST }));
-            this.#domain = device.createBuffer({ label: 'Water / authored footprint', size,
-                usage: GPUBufferUsage.STORAGE | GPUBufferUsage.COPY_SRC | GPUBufferUsage.COPY_DST });
-            this.#capacity = capacity;
-        }
-        const same_resolution = this.#resolution === this.resolution;
-        this.#resolution = this.resolution;
-        const steps = Math.min(Math.floor(this.#pending / this.step + 1e-6), this.max_steps_per_frame);
-        this.#pending = Math.max(0, Math.min(this.#pending - steps * this.step, this.step));
-        const start = this.#parity, time = this.#time, state = this.#state, domain = this.#domain;
-        this.#parity = (start + steps) % 2;
-        this.#time += steps * this.step;
-        const n = this.#resolution, dt = this.step, damping = this.damping;
-        const pass = graph.add('Water / batched surface update', {}, (_d, _r, { encoder }) => {
-            if (state !== old) {
-                if (same_resolution && old.length !== 0) {
-                    for (let i = 0; i < 2; i++) { encoder.copyBufferToBuffer(old[i], 0, state[i], 0, Math.min(old[i].size, state[i].size)); }
-                    encoder.copyBufferToBuffer(old_domain, 0, domain, 0, Math.min(old_domain.size, domain.size));
-                }
-                encoder.done.then(() => { for (const buffer of old) { buffer.destroy(); } old_domain?.destroy(); });
-            }
-            if (capacity === 0) { return; }
-            const groups = Math.ceil(capacity * n * n / 128);
-            shader_water_wave_domain.dispatch({ encoder, bindings: {
-                batch: encoder.allocateTransientValueBuffer(WATER_WAVE_BATCH_STRUCT,
-                    { resolution: n, capacity, apply_impulses: same_resolution ? 0 : 1 }),
-                scene_database: scene.scene_database_buffer, domain,
-                geometries: scene.geometries.buffer_metadata,
-                blas_lookup: scene.geometries.blas.buffer_metadata, blas_data: scene.geometries.blas.buffer_data,
-                meshlet_metadata: scene.geometries.meshlets.buffer_metadata, meshlet_data: scene.geometries.meshlets.buffer_data,
-            }, group_count_x: Math.min(groups, 65535), group_count_y: Math.ceil(groups / 65535) });
-            const dispatch = (parity, step_dt, step_time, apply_impulses) => {
-                shader_water_wave_batch.dispatch({ encoder, bindings: {
-                    batch: encoder.allocateTransientValueBuffer(WATER_WAVE_BATCH_STRUCT,
-                        { resolution: n, capacity, dt: step_dt, time: step_time, damping, apply_impulses }),
-                    scene_database: scene.scene_database_buffer, domain, state_current: state[parity], state_previous: state[1 - parity],
-                }, group_count_x: Math.min(groups, 65535), group_count_y: Math.ceil(groups / 65535) });
-            };
-            // Clear both histories of new/reused slots before advancing, then release the reset flag.
-            dispatch(0, 0, time, 0); dispatch(1, 0, time, 0);
-            const finish = apply_impulses => {
-                const groups = table.dispatch_group_count(64);
-                shader_water_wave_batch_finish.dispatch({ encoder, bindings: { scene_database: scene.scene_database_buffer,
-                    batch: encoder.allocateTransientValueBuffer(WATER_WAVE_BATCH_STRUCT,
-                        { resolution: n, capacity, dt, time, damping, apply_impulses }) },
-                    group_count_x: Math.min(groups, 65535), group_count_y: Math.ceil(groups / 65535) });
-            };
-            finish(0);
-            for (let i = 0; i < steps; i++) { dispatch((start + i) % 2, dt, time + i * dt, i === 0 ? 1 : 0); }
-            if (steps > 0) {
-                finish(1);
-                // Submit is the ownership boundary for staged CPU inputs. Use the encoder's
-                // existing synchronous signal so a later scene/update cannot be cleared by
-                // an old promise callback.
-                encoder.onFinished.addOne(() => this.onInputsConsumed.dispatch(scene));
-            }
-            shader_water_wave_bounds.dispatch({ encoder, bindings: {
-                batch: encoder.allocateTransientValueBuffer(WATER_WAVE_BATCH_STRUCT, { resolution: n, capacity }),
-                scene_database: scene.scene_database_buffer, state: state[(start + steps) % 2],
-            }, group_count_x: Math.min(capacity, 65535), group_count_y: Math.ceil(capacity / 65535) });
-        });
-        pass.make_side_effect();
-    }
-}

package/src/shade/renderer/water/surface/chunk_water_tessellation.d.ts

@@ -1,9 +0,0 @@
-export const WATER_TILE_CELLS: 16;
-export const WATER_TILE_VERTEX_COUNT: number;
-export const WATER_TILE_STRUCT: WebGPUStruct;
-export const WATER_TESSELLATION_STRUCT: WebGPUStruct;
-/** Clip in barycentric space: every generated point remains on the authored triangle. */
-export const chunk_water_tessellation: CodeChunk;
-import { WebGPUStruct } from "../../shader/type/WebGPUStruct.js";
-import { CodeChunk } from "../../shader/compiler/CodeChunk.js";
-//# sourceMappingURL=chunk_water_tessellation.d.ts.map

package/src/shade/renderer/water/surface/chunk_water_tessellation.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"chunk_water_tessellation.d.ts","sourceRoot":"","sources":["../../../../../../src/shade/renderer/water/surface/chunk_water_tessellation.js"],"names":[],"mappings":"AAKA,kCAAmC;AAEnC,6CAAkE;AAClE,6CAEuB;AACvB,qDAE+B;AAE/B,yFAAyF;AACzF,iDA+H8B;6BA9ID,mCAAmC;0BADtC,oCAAoC"}

package/src/shade/renderer/water/surface/chunk_water_tessellation.js

@@ -1,144 +0,0 @@
-import { CodeChunk } from "../../shader/compiler/CodeChunk.js";
-import { WebGPUStruct } from "../../shader/type/WebGPUStruct.js";
-import { f32, u32, vec2i, vec2u, vec2f, mat4x4f } from "../../shader/type/WEBGPU_WGSL_PRIMITIVE_TYPES.js";
-import { chunk_barycentric_solve } from "../../shader/chunk/geometry/triangle/chunk_barycentric_solve.js";
-
-export const WATER_TILE_CELLS = 16;
-// A triangle clipped by five planes has at most eight corners, hence six fan triangles.
-export const WATER_TILE_VERTEX_COUNT = WATER_TILE_CELLS ** 2 * 18;
-export const WATER_TILE_STRUCT = WebGPUStruct.from({
-    meshlet: u32, triangle: u32, body: u32, anchor: f32, origin: vec2i, size: vec2u, pixels: f32,
-}, 'WaterTile').pack();
-export const WATER_TESSELLATION_STRUCT = WebGPUStruct.from({
-    resolution: vec2f, pixels: f32, view_projection_matrix: mat4x4f,
-}, 'WaterTessellation').pack();
-
-/** Clip in barycentric space: every generated point remains on the authored triangle. */
-export const chunk_water_tessellation = CodeChunk.from(/* language=WGSL */ `
-fn water_reference_position(position: vec3f, height: f32, simulated: bool) -> vec3f {
-    return vec3f(position.x, select(position.y, height, simulated), position.z);
-}
-// Bits identify the boundaries meeting at each corner: the three authored edges,
-// followed by the near plane and four cell edges. Retaining them lets reconstruction
-// evaluate an intersection directly, independent of the polygon clipping history.
-struct WaterPolygon { points: array<vec3f, 8>, boundaries: array<u32, 8>, count: u32 }
-fn water_triangle_polygon() -> WaterPolygon {
-    var p: WaterPolygon;
-    p.points[0] = vec3f(1,0,0); p.points[1] = vec3f(0,1,0); p.points[2] = vec3f(0,0,1); p.count = 3u;
-    p.boundaries[0] = 6u; p.boundaries[1] = 5u; p.boundaries[2] = 3u;
-    return p;
-}
-fn water_clip_polygon(p: WaterPolygon, distances: vec3f, boundary: u32) -> WaterPolygon {
-    var out: WaterPolygon;
-    if (p.count == 0u) { return out; }
-    var previous = p.points[p.count - 1u];
-    var d_previous = dot(previous, distances);
-    for (var i = 0u; i < p.count; i++) {
-        let current = p.points[i]; let d = dot(current, distances);
-        if ((d >= 0.0) != (d_previous >= 0.0)) {
-            let previous_index = select(i - 1u, p.count - 1u, i == 0u);
-            out.boundaries[out.count] = (p.boundaries[previous_index] & p.boundaries[i]) | boundary;
-            out.points[out.count] = mix(previous, current, d_previous / (d_previous - d)); out.count++;
-        }
-        if (d >= 0.0) { out.boundaries[out.count] = p.boundaries[i]; out.points[out.count] = current; out.count++; }
-        previous = current; d_previous = d;
-    }
-    return out;
-}
-fn water_plane_distances(a: vec4f, b: vec4f, c: vec4f, plane: vec4f) -> vec3f {
-    return vec3f(dot(a, plane), dot(b, plane), dot(c, plane));
-}
-fn water_point_weights(a: vec4f, b: vec4f, c: vec4f, point: vec2f) -> vec3f {
-    let w = vec3f(a.w,b.w,c.w);
-    return barycentric_solve(vec3f(a.x,b.x,c.x) - point.x * w, vec3f(a.y,b.y,c.y) - point.y * w);
-}
-fn water_authored_edges(weights: vec3f) -> u32 {
-    return select(0u,1u,weights.x == 0.0) | select(0u,2u,weights.y == 0.0) | select(0u,4u,weights.z == 0.0);
-}
-fn water_boundary_plane(boundary: u32, lo: vec2f, hi: vec2f) -> vec4f {
-    if ((boundary & 8u) != 0u) { return vec4f(0,0,-1,1); }
-    if ((boundary & 16u) != 0u) { return vec4f(1,0,0,-lo.x); }
-    if ((boundary & 32u) != 0u) { return vec4f(-1,0,0,hi.x); }
-    if ((boundary & 64u) != 0u) { return vec4f(0,1,0,-lo.y); }
-    return vec4f(0,-1,0,hi.y);
-}
-fn water_corner_weights(a: vec4f, b: vec4f, c: vec4f, boundaries: u32, lo: vec2f, hi: vec2f) -> vec3f {
-    if ((boundaries & 15u) == 0u) {
-        return water_point_weights(a,b,c,vec2f(select(lo.x,hi.x,(boundaries & 32u) != 0u),
-            select(lo.y,hi.y,(boundaries & 128u) != 0u)));
-    }
-    var distances: array<vec3f, 2>;
-    var count = 0u;
-    for (var bit = 0u; bit < 8u; bit++) {
-        if ((boundaries & (1u << bit)) == 0u) { continue; }
-        if (bit < 3u) { distances[count][bit] = 1.0; }
-        else { distances[count] = water_plane_distances(a,b,c,water_boundary_plane(1u << bit,lo,hi)); }
-        count++;
-        if (count == 2u) { break; }
-    }
-    return barycentric_solve(distances[0], distances[1]);
-}
-fn water_corner_position(a: vec3f, b: vec3f, c: vec3f, ca: vec4f, cb: vec4f, cc: vec4f,
-    weights: vec3f, boundaries: u32, lo: vec2f, hi: vec2f) -> vec3f {
-    let edges = boundaries & 7u;
-    if (edges == 6u) { return a; }
-    if (edges == 5u) { return b; }
-    if (edges == 3u) { return c; }
-    if (edges != 0u) {
-        var p = a; var q = b; var cp = ca; var cq = cb;
-        if (edges == 1u) { p = b; q = c; cp = cb; cq = cc; }
-        if (edges == 2u) { q = c; cq = cc; }
-        // Adjacent authored triangles traverse their common edge in opposite orders.
-        // Canonical endpoints and the original clipping plane give identical f32 positions.
-        if (p.x > q.x || (p.x == q.x && (p.y > q.y || (p.y == q.y && p.z > q.z)))) {
-            let tmp = p; p = q; q = tmp; let tc = cp; cp = cq; cq = tc;
-        }
-        // A cell corner may also lie on an authored edge coincident with a cell plane.
-        // Use the intersecting plane, rather than dividing by that coincident plane's zero span.
-        var dp = 0.0; var dq = 0.0;
-        for (var bit = 3u; bit < 8u; bit++) {
-            if ((boundaries & (1u << bit)) == 0u) { continue; }
-            let plane = water_boundary_plane(1u << bit,lo,hi);
-            let p_distance = dot(cp,plane); let q_distance = dot(cq,plane);
-            if (abs(p_distance - q_distance) > abs(dp - dq)) { dp = p_distance; dq = q_distance; }
-        }
-        return mix(p,q,dp / (dp - dq));
-    }
-    return a * weights.x + b * weights.y + c * weights.z;
-}
-fn water_cell_polygon(a: vec4f, b: vec4f, c: vec4f, lo: vec2f, hi: vec2f) -> WaterPolygon {
-    // Interior cells are ordinary quads. Reuse the rasterizer's homogeneous barycentric solve
-    // and reserve polygon clipping for the authored boundary and near-plane intersections.
-    if (a.w > 0.0 && b.w > 0.0 && c.w > 0.0 && a.w >= a.z && b.w >= b.z && c.w >= c.z) {
-        let p0 = water_point_weights(a,b,c,lo);
-        let p1 = water_point_weights(a,b,c,vec2f(hi.x,lo.y));
-        let p2 = water_point_weights(a,b,c,hi);
-        let p3 = water_point_weights(a,b,c,vec2f(lo.x,hi.y));
-        let minimum = min(min(p0,p1),min(p2,p3));
-        if (all(minimum >= vec3f(0))) {
-            var quad: WaterPolygon;
-            quad.points[0] = p0; quad.points[1] = p1; quad.points[2] = p2; quad.points[3] = p3;
-            quad.boundaries[0] = 80u | water_authored_edges(p0); quad.boundaries[1] = 96u | water_authored_edges(p1);
-            quad.boundaries[2] = 160u | water_authored_edges(p2); quad.boundaries[3] = 144u | water_authored_edges(p3);
-            // Preserve the source triangle's winding, just as the clipped path does.
-            // The rasterizer must identify the same side on interior and boundary cells.
-            if (dot(cross(a.xyw,b.xyw),c.xyw) < 0.0) {
-                quad.points[1] = p3; quad.points[3] = p1;
-                let boundary = quad.boundaries[1]; quad.boundaries[1] = quad.boundaries[3]; quad.boundaries[3] = boundary;
-            }
-            quad.count = 4u; return quad;
-        }
-    }
-    var p = water_triangle_polygon();
-    p = water_clip_polygon(p, water_plane_distances(a,b,c,vec4f(0,0,-1,1)), 8u);
-    p = water_clip_polygon(p, water_plane_distances(a,b,c,vec4f(1,0,0,-lo.x)), 16u);
-    p = water_clip_polygon(p, water_plane_distances(a,b,c,vec4f(-1,0,0,hi.x)), 32u);
-    p = water_clip_polygon(p, water_plane_distances(a,b,c,vec4f(0,1,0,-lo.y)), 64u);
-    p = water_clip_polygon(p, water_plane_distances(a,b,c,vec4f(0,-1,0,hi.y)), 128u);
-    for (var i = 0u; i < p.count; i++) {
-        p.points[i] = water_corner_weights(a,b,c,p.boundaries[i],lo,hi);
-        p.boundaries[i] |= water_authored_edges(p.points[i]);
-    }
-    return p;
-}
-`, [chunk_barycentric_solve]);

package/src/shade/renderer/water/surface/chunk_water_wave.d.ts

@@ -1,13 +0,0 @@
-/**
- * The primitive surface producer's physics, as pure functions so each is testable alone.
- *
- * A damped linear wave equation on a height field, `h_tt = c² ∇²h − γ h_t + f`, stepped by
- * leapfrog. The celerity is the shallow-water one, `c = √(g·d)`. The batched producer uses a
- * one-metre reference depth because an authored surface supplies no bathymetry. This primitive
- * model describes long waves; deep-water wind waves have wavelength-dependent speed.
- *
- * @type {CodeChunk}
- */
-export const chunk_water_wave: CodeChunk;
-import { CodeChunk } from "../../shader/compiler/CodeChunk.js";
-//# sourceMappingURL=chunk_water_wave.d.ts.map

package/src/shade/renderer/water/surface/chunk_water_wave.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"chunk_water_wave.d.ts","sourceRoot":"","sources":["../../../../../../src/shade/renderer/water/surface/chunk_water_wave.js"],"names":[],"mappings":"AAEA;;;;;;;;;GASG;AACH,+BAFU,SAAS,CA6BhB;0BAvCuB,oCAAoC"}

package/src/shade/renderer/water/surface/chunk_water_wave.js

@@ -1,40 +0,0 @@
-import { CodeChunk } from "../../shader/compiler/CodeChunk.js";
-
-/**
- * The primitive surface producer's physics, as pure functions so each is testable alone.
- *
- * A damped linear wave equation on a height field, `h_tt = c² ∇²h − γ h_t + f`, stepped by
- * leapfrog. The celerity is the shallow-water one, `c = √(g·d)`. The batched producer uses a
- * one-metre reference depth because an authored surface supplies no bathymetry. This primitive
- * model describes long waves; deep-water wind waves have wavelength-dependent speed.
- *
- * @type {CodeChunk}
- */
-export const chunk_water_wave = CodeChunk.from(/* language=WGSL */ `
-const WATER_WAVE_GRAVITY: f32 = 9.81;
-
-// Squared celerity of a long wave over water depth metres deep, capped so an explicit step of the
-// size the producer takes stays stable (2-D CFL: c·dt/dx ≤ 1/√2).
-fn water_wave_celerity2(depth: f32, celerity_limit: f32) -> f32 {
-    return min(WATER_WAVE_GRAVITY * max(depth, 0.0), celerity_limit * celerity_limit);
-}
-
-// One leapfrog step of h_tt = c² ∇²h − γ h_t + f: the next height from the current one, the
-// previous one, the current height's Laplacian, c², the damping rate γ (1/s), the forcing f (m/s²)
-// and the step dt (s).
-fn water_wave_step(h: f32, h_previous: f32, laplacian: f32, celerity2: f32, damping: f32,
-    force: f32, dt: f32) -> f32 {
-    return h + (h - h_previous) * max(1.0 - damping * dt, 0.0) + dt * dt * (celerity2 * laplacian + force);
-}
-
-// Extra damping in a band along the grid's border, rising quadratically to strength at the edge,
-// so waves leave the domain instead of reflecting off the end of the grid.
-fn water_wave_sponge(cell: vec2<u32>, resolution: u32, width: f32, strength: f32) -> f32 {
-    let last = f32(resolution - 1u);
-    let p = vec2<f32>(cell);
-    let edge = min(min(p.x, p.y), min(last - p.x, last - p.y));
-    let s = clamp(1.0 - edge / max(width, 1.0), 0.0, 1.0);
-    return strength * s * s;
-}
-
-`);