nucleation 0.10.21 → 0.10.23

package/renderer/Scripting.d.ts

@@ -0,0 +1,40 @@
+// generated by diplomat-tool
+import type { NucleationError } from "./NucleationError.mjs"
+import type { Schematic } from "./Schematic.mjs"
+import type { pointer, codepoint } from "./diplomat-runtime.d.ts";
+
+
+
+/**
+ * Namespace for the script-runner free functions of the old ABI
+ * (`run_lua_script`, `run_js_script`, `run_script`).
+ */
+export class Scripting {
+    /** @internal */
+    get ffiValue(): pointer;
+    /** @internal */
+    constructor();
+
+
+    /**
+     * Run a Lua script file. Returns the schematic the script assigns to
+     * `result`; `NotFound` if it produced none, `Parse` if it failed, and
+     * `InvalidArgument` when built without the `scripting-lua` feature.
+     */
+    static runLuaScript(path: string): Schematic;
+
+    /**
+     * Run a JS script file. Returns the schematic the script assigns to
+     * `result`; `NotFound` if it produced none, `Parse` if it failed, and
+     * `InvalidArgument` when built without the `scripting-js` feature.
+     */
+    static runJsScript(path: string): Schematic;
+
+    /**
+     * Run a script file, auto-detecting the engine by extension (`.lua` or
+     * `.js`). Returns the schematic the script assigns to `result`; `NotFound`
+     * if it produced none, `Parse` if it failed (including unsupported
+     * extensions).
+     */
+    static runScript(path: string): Schematic;
+}

package/renderer/Scripting.mjs

@@ -0,0 +1,138 @@
+// generated by diplomat-tool
+import { NucleationError } from "./NucleationError.mjs"
+import { Schematic } from "./Schematic.mjs"
+import wasm from "./diplomat-wasm.mjs";
+import * as diplomatRuntime from "./diplomat-runtime.mjs";
+
+const Scripting_box_destroy_registry = new FinalizationRegistry((ptr) => {
+    wasm.Scripting_destroy(ptr);
+});
+
+/**
+ * Namespace for the script-runner free functions of the old ABI
+ * (`run_lua_script`, `run_js_script`, `run_script`).
+ */
+export class Scripting {
+    // Internal ptr reference:
+    #ptr = null;
+
+    // Lifetimes are only to keep dependencies alive.
+    // Since JS won't garbage collect until there are no incoming edges.
+    #selfEdge = [];
+
+    #internalConstructor(symbol, ptr, selfEdge) {
+        if (symbol !== diplomatRuntime.internalConstructor) {
+            console.error("Scripting is an Opaque type. You cannot call its constructor.");
+            return;
+        }
+        this.#ptr = ptr;
+        this.#selfEdge = selfEdge;
+
+        // Are we being borrowed? If not, we can register.
+        if (this.#selfEdge.length === 0) {
+            Scripting_box_destroy_registry.register(this, this.#ptr);
+        }
+
+        return this;
+    }
+    /** @internal */
+    get ffiValue() {
+        return this.#ptr;
+    }
+
+
+    /**
+     * Run a Lua script file. Returns the schematic the script assigns to
+     * `result`; `NotFound` if it produced none, `Parse` if it failed, and
+     * `InvalidArgument` when built without the `scripting-lua` feature.
+     */
+    static runLuaScript(path) {
+        let functionCleanupArena = new diplomatRuntime.CleanupArena();
+
+        const pathSlice = functionCleanupArena.alloc(diplomatRuntime.DiplomatBuf.sliceWrapper(wasm, diplomatRuntime.DiplomatBuf.str8(wasm, path)));
+        const diplomatReceive = new diplomatRuntime.DiplomatReceiveBuf(wasm, 5, 4, true);
+
+
+        const result = wasm.Scripting_run_lua_script(diplomatReceive.buffer, pathSlice.ptr);
+
+        try {
+            if (!diplomatReceive.resultFlag) {
+                const cause = new NucleationError(diplomatRuntime.internalConstructor, diplomatRuntime.enumDiscriminant(wasm, diplomatReceive.buffer));
+                throw new globalThis.Error('NucleationError.' + cause.value, { cause });
+            }
+            return new Schematic(diplomatRuntime.internalConstructor, diplomatRuntime.ptrRead(wasm, diplomatReceive.buffer), []);
+        }
+
+        finally {
+            diplomatRuntime.FUNCTION_PARAM_ALLOC.clean();
+            functionCleanupArena.free();
+
+            diplomatReceive.free();
+        }
+    }
+
+    /**
+     * Run a JS script file. Returns the schematic the script assigns to
+     * `result`; `NotFound` if it produced none, `Parse` if it failed, and
+     * `InvalidArgument` when built without the `scripting-js` feature.
+     */
+    static runJsScript(path) {
+        let functionCleanupArena = new diplomatRuntime.CleanupArena();
+
+        const pathSlice = functionCleanupArena.alloc(diplomatRuntime.DiplomatBuf.sliceWrapper(wasm, diplomatRuntime.DiplomatBuf.str8(wasm, path)));
+        const diplomatReceive = new diplomatRuntime.DiplomatReceiveBuf(wasm, 5, 4, true);
+
+
+        const result = wasm.Scripting_run_js_script(diplomatReceive.buffer, pathSlice.ptr);
+
+        try {
+            if (!diplomatReceive.resultFlag) {
+                const cause = new NucleationError(diplomatRuntime.internalConstructor, diplomatRuntime.enumDiscriminant(wasm, diplomatReceive.buffer));
+                throw new globalThis.Error('NucleationError.' + cause.value, { cause });
+            }
+            return new Schematic(diplomatRuntime.internalConstructor, diplomatRuntime.ptrRead(wasm, diplomatReceive.buffer), []);
+        }
+
+        finally {
+            diplomatRuntime.FUNCTION_PARAM_ALLOC.clean();
+            functionCleanupArena.free();
+
+            diplomatReceive.free();
+        }
+    }
+
+    /**
+     * Run a script file, auto-detecting the engine by extension (`.lua` or
+     * `.js`). Returns the schematic the script assigns to `result`; `NotFound`
+     * if it produced none, `Parse` if it failed (including unsupported
+     * extensions).
+     */
+    static runScript(path) {
+        let functionCleanupArena = new diplomatRuntime.CleanupArena();
+
+        const pathSlice = functionCleanupArena.alloc(diplomatRuntime.DiplomatBuf.sliceWrapper(wasm, diplomatRuntime.DiplomatBuf.str8(wasm, path)));
+        const diplomatReceive = new diplomatRuntime.DiplomatReceiveBuf(wasm, 5, 4, true);
+
+
+        const result = wasm.Scripting_run_script(diplomatReceive.buffer, pathSlice.ptr);
+
+        try {
+            if (!diplomatReceive.resultFlag) {
+                const cause = new NucleationError(diplomatRuntime.internalConstructor, diplomatRuntime.enumDiscriminant(wasm, diplomatReceive.buffer));
+                throw new globalThis.Error('NucleationError.' + cause.value, { cause });
+            }
+            return new Schematic(diplomatRuntime.internalConstructor, diplomatRuntime.ptrRead(wasm, diplomatReceive.buffer), []);
+        }
+
+        finally {
+            diplomatRuntime.FUNCTION_PARAM_ALLOC.clean();
+            functionCleanupArena.free();
+
+            diplomatReceive.free();
+        }
+    }
+
+    constructor(symbol, ptr, selfEdge) {
+        return this.#internalConstructor(...arguments)
+    }
+}

package/renderer/Sdf.d.mts

@@ -0,0 +1,234 @@
+// generated by diplomat-tool
+import type { Field3 } from "./Field3.mjs"
+import type { FieldProgram } from "./FieldProgram.mjs"
+import type { NucleationError } from "./NucleationError.mjs"
+import type { Schematic } from "./Schematic.mjs"
+import type { SdfAxis } from "./SdfAxis.mjs"
+import type { SdfBounds } from "./SdfBounds.mjs"
+import type { SdfCellMode } from "./SdfCellMode.mjs"
+import type { SdfNormal } from "./SdfNormal.mjs"
+import type { Shape } from "./Shape.mjs"
+import type { pointer, codepoint } from "./diplomat-runtime.d.ts";
+
+
+
+/**
+ * An immutable, composable signed-distance-field expression graph.
+ *
+ * Primitive constructors and every combinator return a new graph, so values
+ * can be shared safely between Flow nodes and across Kotlin/Java, JavaScript,
+ * and Python bindings. JSON is retained only for explicit import/export and
+ * the legacy sampling helpers.
+ */
+export class Sdf {
+    /** @internal */
+    get ffiValue(): pointer;
+    /** @internal */
+    constructor();
+
+
+    static sphere(radius: number): Sdf;
+
+    /**
+     * Axis-aligned rounded box, centered at the origin.
+     */
+    static boxShape(halfX: number, halfY: number, halfZ: number, rounding: number): Sdf;
+
+    static ellipsoid(radiusX: number, radiusY: number, radiusZ: number): Sdf;
+
+    static torus(majorRadius: number, minorRadius: number): Sdf;
+
+    /**
+     * Torus ring cut down to an arc. `cap_angle_degrees` is the half-aperture
+     * in `(0, 180]`, measured from +X and mirrored across X; `180` is a full
+     * torus.
+     */
+    static cappedTorus(majorRadius: number, minorRadius: number, capAngleDegrees: number): Sdf;
+
+    /**
+     * Chain-link shape: a torus stretched along Z by `half_length` and
+     * capped by two half-tori. `half_length: 0` is a plain torus.
+     */
+    static link(majorRadius: number, minorRadius: number, halfLength: number): Sdf;
+
+    static capsule(ax: number, ay: number, az: number, bx: number, by: number, bz: number, radius: number): Sdf;
+
+    /**
+     * Convex hull of two spheres: a capsule with a linear taper between
+     * `r1` (at `a`) and `r2` (at `b`) instead of one constant radius.
+     */
+    static roundCone(ax: number, ay: number, az: number, bx: number, by: number, bz: number, r1: number, r2: number): Sdf;
+
+    /**
+     * Sphere of `radius` intersected with an infinite cone of
+     * half-aperture `angle_degrees` (in `(0, 180)`) from the +Y axis,
+     * apex at the origin.
+     */
+    static solidAngle(radius: number, angleDegrees: number): Sdf;
+
+    /**
+     * Sphere cut by the plane `y = height`, keeping the cap above it
+     * (a dome). `height` must be strictly between `-radius` and
+     * `radius`.
+     */
+    static cutSphere(radius: number, height: number): Sdf;
+
+    /**
+     * Open (hollow) shell of `cut_sphere`'s dome: just the spherical
+     * cap surface, offset by `thickness`, with no flat floor.
+     */
+    static cutHollowSphere(radius: number, height: number, thickness: number): Sdf;
+
+    static cappedCylinder(radius: number, halfHeight: number): Sdf;
+
+    /**
+     * Exact Y-axis cylinder with infinite extent. Sampling requires explicit bounds.
+     */
+    static infiniteCylinder(radius: number): Sdf;
+
+    static cappedCone(halfHeight: number, bottomRadius: number, topRadius: number): Sdf;
+
+    static plane(normalX: number, normalY: number, normalZ: number, offset: number): Sdf;
+
+    static octahedron(size: number): Sdf;
+
+    static hexPrism(radius: number, halfHeight: number): Sdf;
+
+    static superPrism(halfX: number, halfY: number, halfZ: number, exponent: number): Sdf;
+
+    /**
+     * Hollow wireframe box: only the 12 edge beams are solid.
+     */
+    static boxFrame(halfX: number, halfY: number, halfZ: number, thickness: number): Sdf;
+
+    /**
+     * Exact but unbounded Y-axis infinite cone: apex at the origin,
+     * single nappe opening along +Y, half-aperture `angle_degrees`
+     * strictly in `(0, 90)`.
+     */
+    static infiniteCone(angleDegrees: number): Sdf;
+
+    /**
+     * Square-base pyramid, vertically centered: base (half-extent
+     * `half_base`) at `y = -height/2`, apex at `y = height/2`. `height`
+     * must be at least the smallest positive normal `f32`.
+     */
+    static squarePyramid(halfBase: number, height: number): Sdf;
+
+    static cells(frequency: number, seed: number, jitter: number, mode: SdfCellMode, threshold: number): Sdf;
+
+    unionWith(other: Sdf): Sdf;
+
+    intersectionWith(other: Sdf): Sdf;
+
+    subtract(other: Sdf): Sdf;
+
+    smoothUnion(other: Sdf, radius: number): Sdf;
+
+    smoothSubtract(other: Sdf, radius: number): Sdf;
+
+    smoothIntersection(other: Sdf, radius: number): Sdf;
+
+    rounded(radius: number): Sdf;
+
+    shell(thickness: number): Sdf;
+
+    /**
+     * Symmetric difference (XOR): solid where exactly one of `self`/
+     * `other` is solid.
+     */
+    xorWith(other: Sdf): Sdf;
+
+    /**
+     * Stretches this graph with IQ's origin-centered `opElongate` fold.
+     * Exactness requires a suitable origin-centered, reflection-symmetric
+     * child; off-center/asymmetric children are mirrored and produce only
+     * an estimate. Half-lengths must be finite and non-negative, with at
+     * least one strictly positive.
+     */
+    elongate(halfX: number, halfY: number, halfZ: number): Sdf;
+
+    translate(x: number, y: number, z: number): Sdf;
+
+    rotate(xDegrees: number, yDegrees: number, zDegrees: number): Sdf;
+
+    scale(factor: number): Sdf;
+
+    mirror(axis: SdfAxis): Sdf;
+
+    /**
+     * Twists this graph about the Y axis by `amount` radians per unit
+     * Y (IQ's `opTwist`). *Distorted*: not guaranteed exact even when
+     * `self` is.
+     */
+    twist(amount: number): Sdf;
+
+    /**
+     * Cheaply bends this graph by `amount` radians per unit X (IQ's
+     * `opCheapBend`). *Distorted*: not guaranteed exact even when
+     * `self` is.
+     */
+    bend(amount: number): Sdf;
+
+    repeatInfinite(spacingX: number, spacingY: number, spacingZ: number): Sdf;
+
+    repeatCounted(spacingX: number, spacingY: number, spacingZ: number, countX: number, countY: number, countZ: number): Sdf;
+
+    /**
+     * Finite rigid instances of this graph at arbitrary XYZ offsets.
+     * `offsets` is flat `[x0, y0, z0, x1, y1, z1, ...]` and may contain
+     * at most 4096 points.
+     */
+    repeatPoints(offsets: Array<number>): Sdf;
+
+    displace(amplitude: number, frequency: number, seed: number, octaves: number): Sdf;
+
+    /**
+     * Offset this surface by a reusable scalar field. The resulting zero
+     * set is generally an approximate field, not an exact distance field.
+     */
+    offsetByField(field: Field3, amplitude: number): Sdf;
+
+    warp(amplitude: number, frequency: number, seed: number): Sdf;
+
+    evalAt(x: number, y: number, z: number): number;
+
+    normal(x: number, y: number, z: number, epsilon: number): SdfNormal;
+
+    /**
+     * Conservative finite bounds, or `NotFound` for an unbounded graph
+     * (a bare `plane` or `infinite_cylinder` has no finite extent).
+     */
+    bounds(): SdfBounds;
+
+    toShape(): Shape;
+
+    toShapeBounded(minX: number, minY: number, minZ: number, maxX: number, maxY: number, maxZ: number): Shape;
+
+    static fromJsonString(json: string): Sdf;
+
+    toJson(): string;
+
+    /**
+     * Wrap a validated {@link FieldProgram} as an `Sdf` graph (cloning it,
+     * with its own explicit bounds and distance-kind metadata), so it
+     * composes with every other combinator.
+     */
+    static fromProgram(program: FieldProgram): Sdf;
+
+    /**
+     * Legacy JSON-first terrain helper. Prefer typed constructors and
+     * `to_shape()` with `BuildingTool.fill()` for new code.
+     */
+    static schematicFromSdfAuto(sdfJson: string, rulesJson: string): Schematic;
+
+    /**
+     * Legacy JSON-first terrain helper with optional explicit bounds.
+     */
+    static schematicFromSdf(sdfJson: string, rulesJson: string, hasBounds: boolean, minX: number, minY: number, minZ: number, maxX: number, maxY: number, maxZ: number): Schematic;
+
+    /**
+     * Legacy JSON-first evaluator. Prefer `Sdf.from_json_string(...).eval_at(...)`.
+     */
+    static eval(sdfJson: string, x: number, y: number, z: number): number;
+}

package/renderer/Sdf.d.ts

@@ -0,0 +1,234 @@
+// generated by diplomat-tool
+import type { Field3 } from "./Field3.mjs"
+import type { FieldProgram } from "./FieldProgram.mjs"
+import type { NucleationError } from "./NucleationError.mjs"
+import type { Schematic } from "./Schematic.mjs"
+import type { SdfAxis } from "./SdfAxis.mjs"
+import type { SdfBounds } from "./SdfBounds.mjs"
+import type { SdfCellMode } from "./SdfCellMode.mjs"
+import type { SdfNormal } from "./SdfNormal.mjs"
+import type { Shape } from "./Shape.mjs"
+import type { pointer, codepoint } from "./diplomat-runtime.d.ts";
+
+
+
+/**
+ * An immutable, composable signed-distance-field expression graph.
+ *
+ * Primitive constructors and every combinator return a new graph, so values
+ * can be shared safely between Flow nodes and across Kotlin/Java, JavaScript,
+ * and Python bindings. JSON is retained only for explicit import/export and
+ * the legacy sampling helpers.
+ */
+export class Sdf {
+    /** @internal */
+    get ffiValue(): pointer;
+    /** @internal */
+    constructor();
+
+
+    static sphere(radius: number): Sdf;
+
+    /**
+     * Axis-aligned rounded box, centered at the origin.
+     */
+    static boxShape(halfX: number, halfY: number, halfZ: number, rounding: number): Sdf;
+
+    static ellipsoid(radiusX: number, radiusY: number, radiusZ: number): Sdf;
+
+    static torus(majorRadius: number, minorRadius: number): Sdf;
+
+    /**
+     * Torus ring cut down to an arc. `cap_angle_degrees` is the half-aperture
+     * in `(0, 180]`, measured from +X and mirrored across X; `180` is a full
+     * torus.
+     */
+    static cappedTorus(majorRadius: number, minorRadius: number, capAngleDegrees: number): Sdf;
+
+    /**
+     * Chain-link shape: a torus stretched along Z by `half_length` and
+     * capped by two half-tori. `half_length: 0` is a plain torus.
+     */
+    static link(majorRadius: number, minorRadius: number, halfLength: number): Sdf;
+
+    static capsule(ax: number, ay: number, az: number, bx: number, by: number, bz: number, radius: number): Sdf;
+
+    /**
+     * Convex hull of two spheres: a capsule with a linear taper between
+     * `r1` (at `a`) and `r2` (at `b`) instead of one constant radius.
+     */
+    static roundCone(ax: number, ay: number, az: number, bx: number, by: number, bz: number, r1: number, r2: number): Sdf;
+
+    /**
+     * Sphere of `radius` intersected with an infinite cone of
+     * half-aperture `angle_degrees` (in `(0, 180)`) from the +Y axis,
+     * apex at the origin.
+     */
+    static solidAngle(radius: number, angleDegrees: number): Sdf;
+
+    /**
+     * Sphere cut by the plane `y = height`, keeping the cap above it
+     * (a dome). `height` must be strictly between `-radius` and
+     * `radius`.
+     */
+    static cutSphere(radius: number, height: number): Sdf;
+
+    /**
+     * Open (hollow) shell of `cut_sphere`'s dome: just the spherical
+     * cap surface, offset by `thickness`, with no flat floor.
+     */
+    static cutHollowSphere(radius: number, height: number, thickness: number): Sdf;
+
+    static cappedCylinder(radius: number, halfHeight: number): Sdf;
+
+    /**
+     * Exact Y-axis cylinder with infinite extent. Sampling requires explicit bounds.
+     */
+    static infiniteCylinder(radius: number): Sdf;
+
+    static cappedCone(halfHeight: number, bottomRadius: number, topRadius: number): Sdf;
+
+    static plane(normalX: number, normalY: number, normalZ: number, offset: number): Sdf;
+
+    static octahedron(size: number): Sdf;
+
+    static hexPrism(radius: number, halfHeight: number): Sdf;
+
+    static superPrism(halfX: number, halfY: number, halfZ: number, exponent: number): Sdf;
+
+    /**
+     * Hollow wireframe box: only the 12 edge beams are solid.
+     */
+    static boxFrame(halfX: number, halfY: number, halfZ: number, thickness: number): Sdf;
+
+    /**
+     * Exact but unbounded Y-axis infinite cone: apex at the origin,
+     * single nappe opening along +Y, half-aperture `angle_degrees`
+     * strictly in `(0, 90)`.
+     */
+    static infiniteCone(angleDegrees: number): Sdf;
+
+    /**
+     * Square-base pyramid, vertically centered: base (half-extent
+     * `half_base`) at `y = -height/2`, apex at `y = height/2`. `height`
+     * must be at least the smallest positive normal `f32`.
+     */
+    static squarePyramid(halfBase: number, height: number): Sdf;
+
+    static cells(frequency: number, seed: number, jitter: number, mode: SdfCellMode, threshold: number): Sdf;
+
+    unionWith(other: Sdf): Sdf;
+
+    intersectionWith(other: Sdf): Sdf;
+
+    subtract(other: Sdf): Sdf;
+
+    smoothUnion(other: Sdf, radius: number): Sdf;
+
+    smoothSubtract(other: Sdf, radius: number): Sdf;
+
+    smoothIntersection(other: Sdf, radius: number): Sdf;
+
+    rounded(radius: number): Sdf;
+
+    shell(thickness: number): Sdf;
+
+    /**
+     * Symmetric difference (XOR): solid where exactly one of `self`/
+     * `other` is solid.
+     */
+    xorWith(other: Sdf): Sdf;
+
+    /**
+     * Stretches this graph with IQ's origin-centered `opElongate` fold.
+     * Exactness requires a suitable origin-centered, reflection-symmetric
+     * child; off-center/asymmetric children are mirrored and produce only
+     * an estimate. Half-lengths must be finite and non-negative, with at
+     * least one strictly positive.
+     */
+    elongate(halfX: number, halfY: number, halfZ: number): Sdf;
+
+    translate(x: number, y: number, z: number): Sdf;
+
+    rotate(xDegrees: number, yDegrees: number, zDegrees: number): Sdf;
+
+    scale(factor: number): Sdf;
+
+    mirror(axis: SdfAxis): Sdf;
+
+    /**
+     * Twists this graph about the Y axis by `amount` radians per unit
+     * Y (IQ's `opTwist`). *Distorted*: not guaranteed exact even when
+     * `self` is.
+     */
+    twist(amount: number): Sdf;
+
+    /**
+     * Cheaply bends this graph by `amount` radians per unit X (IQ's
+     * `opCheapBend`). *Distorted*: not guaranteed exact even when
+     * `self` is.
+     */
+    bend(amount: number): Sdf;
+
+    repeatInfinite(spacingX: number, spacingY: number, spacingZ: number): Sdf;
+
+    repeatCounted(spacingX: number, spacingY: number, spacingZ: number, countX: number, countY: number, countZ: number): Sdf;
+
+    /**
+     * Finite rigid instances of this graph at arbitrary XYZ offsets.
+     * `offsets` is flat `[x0, y0, z0, x1, y1, z1, ...]` and may contain
+     * at most 4096 points.
+     */
+    repeatPoints(offsets: Array<number>): Sdf;
+
+    displace(amplitude: number, frequency: number, seed: number, octaves: number): Sdf;
+
+    /**
+     * Offset this surface by a reusable scalar field. The resulting zero
+     * set is generally an approximate field, not an exact distance field.
+     */
+    offsetByField(field: Field3, amplitude: number): Sdf;
+
+    warp(amplitude: number, frequency: number, seed: number): Sdf;
+
+    evalAt(x: number, y: number, z: number): number;
+
+    normal(x: number, y: number, z: number, epsilon: number): SdfNormal;
+
+    /**
+     * Conservative finite bounds, or `NotFound` for an unbounded graph
+     * (a bare `plane` or `infinite_cylinder` has no finite extent).
+     */
+    bounds(): SdfBounds;
+
+    toShape(): Shape;
+
+    toShapeBounded(minX: number, minY: number, minZ: number, maxX: number, maxY: number, maxZ: number): Shape;
+
+    static fromJsonString(json: string): Sdf;
+
+    toJson(): string;
+
+    /**
+     * Wrap a validated {@link FieldProgram} as an `Sdf` graph (cloning it,
+     * with its own explicit bounds and distance-kind metadata), so it
+     * composes with every other combinator.
+     */
+    static fromProgram(program: FieldProgram): Sdf;
+
+    /**
+     * Legacy JSON-first terrain helper. Prefer typed constructors and
+     * `to_shape()` with `BuildingTool.fill()` for new code.
+     */
+    static schematicFromSdfAuto(sdfJson: string, rulesJson: string): Schematic;
+
+    /**
+     * Legacy JSON-first terrain helper with optional explicit bounds.
+     */
+    static schematicFromSdf(sdfJson: string, rulesJson: string, hasBounds: boolean, minX: number, minY: number, minZ: number, maxX: number, maxY: number, maxZ: number): Schematic;
+
+    /**
+     * Legacy JSON-first evaluator. Prefer `Sdf.from_json_string(...).eval_at(...)`.
+     */
+    static eval(sdfJson: string, x: number, y: number, z: number): number;
+}