@oasys/oecs 0.5.3 → 0.6.0

package/dist/type_primitives/error.d.cts

@@ -6,8 +6,7 @@ export declare enum TYPE_ERROR {
     ASSERTION_FAIL_UNREACHABLE = "ASSERTION_FAIL_UNREACHABLE"
 }
 /**
- * Error class thrown by std's runtime assertions. Non-operational.
- *
+ * Error class thrown by the type-primitive assertions. Non-operational.
  */
 export declare class AssertionError extends AppError {
     readonly category: TYPE_ERROR;

package/dist/type_primitives/error.d.ts

@@ -6,8 +6,7 @@ export declare enum TYPE_ERROR {
     ASSERTION_FAIL_UNREACHABLE = "ASSERTION_FAIL_UNREACHABLE"
 }
 /**
- * Error class thrown by std's runtime assertions. Non-operational.
- *
+ * Error class thrown by the type-primitive assertions. Non-operational.
  */
 export declare class AssertionError extends AppError {
     readonly category: TYPE_ERROR;

package/dist/type_primitives/error.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"error.d.ts","sourceRoot":"","sources":["../../src/type_primitives/error.ts"],"names":[],"mappings":"AAAA;;;;;;KAMK;AAEL,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C,oBAAY,UAAU;IACrB,wBAAwB,6BAA6B;IACrD,yBAAyB,8BAA8B;IACvD,2BAA2B,gCAAgC;IAC3D,0BAA0B,+BAA+B;CACzD;AAED;;;GAGG;AACH,qBAAa,cAAe,SAAQ,QAAQ;aAE1B,QAAQ,EAAE,UAAU;gBAApB,QAAQ,EAAE,UAAU,EACpC,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAIlC"}
+{"version":3,"file":"error.d.ts","sourceRoot":"","sources":["../../src/type_primitives/error.ts"],"names":[],"mappings":"AAAA;;;;;;KAMK;AAEL,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAE1C,oBAAY,UAAU;IACrB,wBAAwB,6BAA6B;IACrD,yBAAyB,8BAA8B;IACvD,2BAA2B,gCAAgC;IAC3D,0BAA0B,+BAA+B;CACzD;AAED;;GAEG;AACH,qBAAa,cAAe,SAAQ,QAAQ;aAE1B,QAAQ,EAAE,UAAU;gBAApB,QAAQ,EAAE,UAAU,EACpC,OAAO,EAAE,MAAM,EACf,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAKlC"}

package/dist/type_primitives/index.d.cts

@@ -1,5 +1,5 @@
 /**
- * Type-primitives barrel — assertions, brands, errors, plus data-structure primitives.
+ * Type-primitives barrel, assertions, brands, errors, plus data-structure primitives.
  */
 export * from './assertions.cjs';
 export * from './brand.cjs';

package/dist/type_primitives/index.d.ts

@@ -1,5 +1,5 @@
 /**
- * Type-primitives barrel — assertions, brands, errors, plus data-structure primitives.
+ * Type-primitives barrel, assertions, brands, errors, plus data-structure primitives.
  */
 export * from './assertions.js';
 export * from './brand.js';

package/dist/type_primitives/sparse_map/sparse_map.d.cts

@@ -1,18 +1,14 @@
 /***
- * SparseMap — O(1) integer-keyed map with cache-friendly dense iteration.
+ * SparseMap. O(1) integer-keyed map with cache-friendly dense iteration.
  *
  * Keys are non-negative integers. Two parallel dense arrays (keys + values)
- * enable linear iteration. A sparse number[] maps key → dense index for
- * O(1) get/set/delete.
+ * enable linear iteration. A sparse number[] maps key → dense index, so get,
+ * set and delete are each O(1).
  *
  * Membership is verified by cross-referencing dense_keys[sparse[key]] === key,
  * so stale sparse entries are harmless. Deletion uses swap-and-pop.
  *
  ***/
-/**
- * O(1) integer-keyed map with cache-friendly dense iteration.
- *
- */
 export declare class SparseMap<V> {
     private _denseKeys;
     private _denseVals;

package/dist/type_primitives/sparse_map/sparse_map.d.ts

@@ -1,18 +1,14 @@
 /***
- * SparseMap — O(1) integer-keyed map with cache-friendly dense iteration.
+ * SparseMap. O(1) integer-keyed map with cache-friendly dense iteration.
  *
  * Keys are non-negative integers. Two parallel dense arrays (keys + values)
- * enable linear iteration. A sparse number[] maps key → dense index for
- * O(1) get/set/delete.
+ * enable linear iteration. A sparse number[] maps key → dense index, so get,
+ * set and delete are each O(1).
  *
  * Membership is verified by cross-referencing dense_keys[sparse[key]] === key,
  * so stale sparse entries are harmless. Deletion uses swap-and-pop.
  *
  ***/
-/**
- * O(1) integer-keyed map with cache-friendly dense iteration.
- *
- */
 export declare class SparseMap<V> {
     private _denseKeys;
     private _denseVals;

package/dist/type_primitives/sparse_map/sparse_map.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sparse_map.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/sparse_map/sparse_map.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;KAUK;AAEL;;;GAGG;AACH,qBAAa,SAAS,CAAC,CAAC;IACvB,OAAO,CAAC,UAAU,CAAgB;IAClC,OAAO,CAAC,UAAU,CAAW;IAC7B,OAAO,CAAC,OAAO,CAAgB;IAE/B,IAAW,IAAI,IAAI,MAAM,CAExB;IAED,IAAW,IAAI,IAAI,SAAS,MAAM,EAAE,CAEnC;IAEM,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAIzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAI/B,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAUhC,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAa5B,KAAK,IAAI,IAAI;IAMb,OAAO,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;IAMzD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;CAe1C"}
+{"version":3,"file":"sparse_map.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/sparse_map/sparse_map.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;KAUK;AAEL,qBAAa,SAAS,CAAC,CAAC;IACvB,OAAO,CAAC,UAAU,CAAgB;IAClC,OAAO,CAAC,UAAU,CAAW;IAC7B,OAAO,CAAC,OAAO,CAAgB;IAE/B,IAAW,IAAI,IAAI,MAAM,CAExB;IAED,IAAW,IAAI,IAAI,SAAS,MAAM,EAAE,CAEnC;IAEM,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAIzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS;IAI/B,GAAG,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI;IAUhC,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAa5B,KAAK,IAAI,IAAI;IAMb,OAAO,CAAC,EAAE,EAAE,CAAC,GAAG,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,IAAI;IAMzD,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;CAe1C"}

package/dist/type_primitives/sparse_set/sparse_set.d.cts

@@ -1,19 +1,15 @@
 /***
- * SparseSet — O(1) integer-key set with cache-friendly dense iteration.
+ * SparseSet. O(1) integer-key set with cache-friendly dense iteration.
  *
  * Keys are non-negative integers. A dense number[] holds members packed
  * at 0..size-1 for linear iteration. A sparse number[] maps
- * key → dense index for O(1) has/add/delete.
+ * key → dense index, so has, add and delete are each O(1).
  *
  * Membership is verified by cross-referencing dense[sparse[key]] === key,
  * so stale sparse entries are harmless (no clearing needed on delete).
  * Deletion uses swap-and-pop to keep data contiguous.
  *
  ***/
-/**
- * O(1) integer-key set with cache-friendly dense iteration.
- *
- */
 export declare class SparseSet {
     private _dense;
     private _sparse;

package/dist/type_primitives/sparse_set/sparse_set.d.ts

@@ -1,19 +1,15 @@
 /***
- * SparseSet — O(1) integer-key set with cache-friendly dense iteration.
+ * SparseSet. O(1) integer-key set with cache-friendly dense iteration.
  *
  * Keys are non-negative integers. A dense number[] holds members packed
  * at 0..size-1 for linear iteration. A sparse number[] maps
- * key → dense index for O(1) has/add/delete.
+ * key → dense index, so has, add and delete are each O(1).
  *
  * Membership is verified by cross-referencing dense[sparse[key]] === key,
  * so stale sparse entries are harmless (no clearing needed on delete).
  * Deletion uses swap-and-pop to keep data contiguous.
  *
  ***/
-/**
- * O(1) integer-key set with cache-friendly dense iteration.
- *
- */
 export declare class SparseSet {
     private _dense;
     private _sparse;

package/dist/type_primitives/sparse_set/sparse_set.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"sparse_set.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/sparse_set/sparse_set.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;KAWK;AAEL;;;GAGG;AACH,qBAAa,SAAS;IACrB,OAAO,CAAC,MAAM,CAAgB;IAC9B,OAAO,CAAC,OAAO,CAAgB;IAE/B,IAAW,IAAI,IAAI,MAAM,CAExB;IAED,IAAW,MAAM,IAAI,SAAS,MAAM,EAAE,CAErC;IAEM,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAIzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAMtB,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAW5B,KAAK,IAAI,IAAI;IAKpB,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC;CAGrC"}
+{"version":3,"file":"sparse_set.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/sparse_set/sparse_set.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;KAWK;AAEL,qBAAa,SAAS;IACrB,OAAO,CAAC,MAAM,CAAgB;IAC9B,OAAO,CAAC,OAAO,CAAgB;IAE/B,IAAW,IAAI,IAAI,MAAM,CAExB;IAED,IAAW,MAAM,IAAI,SAAS,MAAM,EAAE,CAErC;IAEM,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAIzB,GAAG,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAMtB,MAAM,CAAC,GAAG,EAAE,MAAM,GAAG,OAAO;IAW5B,KAAK,IAAI,IAAI;IAKpB,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC;CAGrC"}

package/dist/type_primitives/topological_sort/topological_sort.d.cts

@@ -1,5 +1,5 @@
 /***
- * topologicalSort — Kahn's algorithm with a BinaryHeap ready queue.
+ * topologicalSort. Kahn's algorithm with a BinaryHeap ready queue.
  *
  * Accepts an arbitrary node set, a dependency edge map, and a tiebreaker
  * comparator used to order nodes that are simultaneously ready (zero in-degree).
@@ -21,9 +21,5 @@
  * @returns Sorted array in topological order.
  * @throws {TypeError} If a cycle is detected among the nodes.
  */
-/**
- * Topologically sorts `nodes` respecting dependency edges, breaking ties with the comparator.
- *
- */
 export declare function topologicalSort<T>(nodes: readonly T[], edges: Map<T, T[]>, tiebreaker: (a: T, b: T) => number, nodeName?: (node: T) => string): T[];
 //# sourceMappingURL=topological_sort.d.ts.map

package/dist/type_primitives/topological_sort/topological_sort.d.ts

@@ -1,5 +1,5 @@
 /***
- * topologicalSort — Kahn's algorithm with a BinaryHeap ready queue.
+ * topologicalSort. Kahn's algorithm with a BinaryHeap ready queue.
  *
  * Accepts an arbitrary node set, a dependency edge map, and a tiebreaker
  * comparator used to order nodes that are simultaneously ready (zero in-degree).
@@ -21,9 +21,5 @@
  * @returns Sorted array in topological order.
  * @throws {TypeError} If a cycle is detected among the nodes.
  */
-/**
- * Topologically sorts `nodes` respecting dependency edges, breaking ties with the comparator.
- *
- */
 export declare function topologicalSort<T>(nodes: readonly T[], edges: Map<T, T[]>, tiebreaker: (a: T, b: T) => number, nodeName?: (node: T) => string): T[];
 //# sourceMappingURL=topological_sort.d.ts.map

package/dist/type_primitives/topological_sort/topological_sort.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"topological_sort.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/topological_sort/topological_sort.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;KAWK;AAIL;;;;;;;;;;GAUG;AACH;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAChC,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,KAAK,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAClB,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,EAClC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAC5B,CAAC,EAAE,CA8DL"}
+{"version":3,"file":"topological_sort.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/topological_sort/topological_sort.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;KAWK;AAIL;;;;;;;;;;GAUG;AACH,wBAAgB,eAAe,CAAC,CAAC,EAChC,KAAK,EAAE,SAAS,CAAC,EAAE,EACnB,KAAK,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAClB,UAAU,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM,EAClC,QAAQ,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,MAAM,GAC5B,CAAC,EAAE,CA8DL"}

package/dist/type_primitives/typed_arrays/typed_arrays.d.cts

@@ -1,7 +1,7 @@
 /***
- * GrowableTypedArray — TypedArray wrapper with amortised O(1) append.
+ * GrowableTypedArray. TypedArray wrapper with amortised O(1) append.
  *
- * TypedArrays have fixed length — resizing requires allocating a new
+ * TypedArrays have fixed length, resizing requires allocating a new
  * buffer and copying. GrowableTypedArray wraps one with a separate
  * logical length and doubles the backing buffer on overflow.
  *
@@ -16,8 +16,8 @@ export type TypedArrayTag = "f32" | "f64" | "i8" | "i16" | "i32" | "u8" | "u16"
 export type AnyTypedArray = Float32Array | Float64Array | Int8Array | Int16Array | Int32Array | Uint8Array | Uint16Array | Uint32Array;
 /**
  * Common surface of a row-addressable column buffer. `GrowableTypedArray<T>`
- * implements it over a heap-allocated TypedArray; SAB-backed columns (see
- * `packages/engine/src/core/sab/sab_backed_column.ts`) implement it over a
+ * implements it over a heap-allocated TypedArray. SAB-backed columns (see
+ * `@oasys/oecs/shared`) implement it over a
  * `SharedArrayBuffer` view at a known offset. Archetype column storage
  * targets this interface so a single code path serves both backings.
  */
@@ -29,21 +29,21 @@ export interface ColumnBacking<T extends AnyTypedArray> {
     swapRemove(i: number): number;
     clear(): void;
     view(): T;
-    ensureCapacity(capacity: number): void;
+    /** Guarantee room for `capacity` elements, or throw. An implementation that
+     * owns its buffer grows to fit. One that views a buffer it does not own
+     * cannot grow, so it throws when `capacity` passes the view. Neither name
+     * promises growth, thus a caller plans for the throw. */
+    reserve(capacity: number): void;
     bulkAppend(src: T, srcOffset: number, count: number): void;
     bulkAppendZeroes(count: number): void;
     bulkAppendValue(value: number, count: number): void;
     /** Set the logical length directly, declaring that `[0, len)` already holds
-     * valid data. The snapshot-mount path (`Archetype.restoreHostRows`, #789)
+     * valid data. The snapshot-mount path (`Archetype.restoreHostRows`)
      * uses this: a restored SAB carries the column bytes, but the column's logical
      * length is host state that must be re-synced with `Archetype.length`. Throws
-     * if `len` exceeds capacity. NOT a hot-path method — push/pop track length. */
+     * if `len` exceeds capacity. Not a hot-path method, push and pop track length. */
     setLength(len: number): void;
 }
-/**
- * TypedArray wrapper with amortised O(1) append. Doubles the backing buffer on overflow.
- *
- */
 export declare class GrowableTypedArray<T extends AnyTypedArray> implements ColumnBacking<T> {
     private readonly _ctor;
     private _buf;
@@ -52,7 +52,7 @@ export declare class GrowableTypedArray<T extends AnyTypedArray> implements Colu
     get length(): number;
     push(value: number): void;
     pop(): number;
-    get(i: number): number;
+    getAt(i: number): number;
     setAt(i: number, value: number): void;
     /**
      * Move the last element into slot i, decrement length.
@@ -60,24 +60,25 @@ export declare class GrowableTypedArray<T extends AnyTypedArray> implements Colu
      */
     swapRemove(i: number): number;
     clear(): void;
-    /** Set the logical length directly (snapshot-mount reconstruction, #789). The
+    /** Set the logical length directly (snapshot-mount reconstruction). The
      * caller guarantees `[0, len)` already holds valid data. Grows the backing if
      * needed so the length is always representable. */
     setLength(len: number): void;
     /**
      * Raw backing buffer. Valid data: indices 0..length-1.
-     * This reference is stable until the next push() that triggers a grow —
+     * This reference is stable until the next push() that triggers a grow,
      * do not cache across entity additions.
      */
     get buf(): T;
     /**
      * Zero-copy subarray view of valid data (0..length-1).
-     * Shares the backing buffer — invalidated if a subsequent push() grows.
+     * Shares the backing buffer, invalidated if a subsequent push() grows.
      */
     view(): T;
     [Symbol.iterator](): Iterator<number>;
-    /** Ensure the backing buffer can hold at least `capacity` elements without growing. */
-    ensureCapacity(capacity: number): void;
+    /** Grow the backing buffer to hold `capacity` elements. Reallocates and
+     * copies when the current buffer is short, so `buf` and `view()` go stale. */
+    reserve(capacity: number): void;
     /**
      * Append `count` elements from `src` starting at `srcOffset`.
      * Grows if needed. Equivalent to push() in a loop but uses TypedArray.set().

package/dist/type_primitives/typed_arrays/typed_arrays.d.ts

@@ -1,7 +1,7 @@
 /***
- * GrowableTypedArray — TypedArray wrapper with amortised O(1) append.
+ * GrowableTypedArray. TypedArray wrapper with amortised O(1) append.
  *
- * TypedArrays have fixed length — resizing requires allocating a new
+ * TypedArrays have fixed length, resizing requires allocating a new
  * buffer and copying. GrowableTypedArray wraps one with a separate
  * logical length and doubles the backing buffer on overflow.
  *
@@ -16,8 +16,8 @@ export type TypedArrayTag = "f32" | "f64" | "i8" | "i16" | "i32" | "u8" | "u16"
 export type AnyTypedArray = Float32Array | Float64Array | Int8Array | Int16Array | Int32Array | Uint8Array | Uint16Array | Uint32Array;
 /**
  * Common surface of a row-addressable column buffer. `GrowableTypedArray<T>`
- * implements it over a heap-allocated TypedArray; SAB-backed columns (see
- * `packages/engine/src/core/sab/sab_backed_column.ts`) implement it over a
+ * implements it over a heap-allocated TypedArray. SAB-backed columns (see
+ * `@oasys/oecs/shared`) implement it over a
  * `SharedArrayBuffer` view at a known offset. Archetype column storage
  * targets this interface so a single code path serves both backings.
  */
@@ -29,21 +29,21 @@ export interface ColumnBacking<T extends AnyTypedArray> {
     swapRemove(i: number): number;
     clear(): void;
     view(): T;
-    ensureCapacity(capacity: number): void;
+    /** Guarantee room for `capacity` elements, or throw. An implementation that
+     * owns its buffer grows to fit. One that views a buffer it does not own
+     * cannot grow, so it throws when `capacity` passes the view. Neither name
+     * promises growth, thus a caller plans for the throw. */
+    reserve(capacity: number): void;
     bulkAppend(src: T, srcOffset: number, count: number): void;
     bulkAppendZeroes(count: number): void;
     bulkAppendValue(value: number, count: number): void;
     /** Set the logical length directly, declaring that `[0, len)` already holds
-     * valid data. The snapshot-mount path (`Archetype.restoreHostRows`, #789)
+     * valid data. The snapshot-mount path (`Archetype.restoreHostRows`)
      * uses this: a restored SAB carries the column bytes, but the column's logical
      * length is host state that must be re-synced with `Archetype.length`. Throws
-     * if `len` exceeds capacity. NOT a hot-path method — push/pop track length. */
+     * if `len` exceeds capacity. Not a hot-path method, push and pop track length. */
     setLength(len: number): void;
 }
-/**
- * TypedArray wrapper with amortised O(1) append. Doubles the backing buffer on overflow.
- *
- */
 export declare class GrowableTypedArray<T extends AnyTypedArray> implements ColumnBacking<T> {
     private readonly _ctor;
     private _buf;
@@ -52,7 +52,7 @@ export declare class GrowableTypedArray<T extends AnyTypedArray> implements Colu
     get length(): number;
     push(value: number): void;
     pop(): number;
-    get(i: number): number;
+    getAt(i: number): number;
     setAt(i: number, value: number): void;
     /**
      * Move the last element into slot i, decrement length.
@@ -60,24 +60,25 @@ export declare class GrowableTypedArray<T extends AnyTypedArray> implements Colu
      */
     swapRemove(i: number): number;
     clear(): void;
-    /** Set the logical length directly (snapshot-mount reconstruction, #789). The
+    /** Set the logical length directly (snapshot-mount reconstruction). The
      * caller guarantees `[0, len)` already holds valid data. Grows the backing if
      * needed so the length is always representable. */
     setLength(len: number): void;
     /**
      * Raw backing buffer. Valid data: indices 0..length-1.
-     * This reference is stable until the next push() that triggers a grow —
+     * This reference is stable until the next push() that triggers a grow,
      * do not cache across entity additions.
      */
     get buf(): T;
     /**
      * Zero-copy subarray view of valid data (0..length-1).
-     * Shares the backing buffer — invalidated if a subsequent push() grows.
+     * Shares the backing buffer, invalidated if a subsequent push() grows.
      */
     view(): T;
     [Symbol.iterator](): Iterator<number>;
-    /** Ensure the backing buffer can hold at least `capacity` elements without growing. */
-    ensureCapacity(capacity: number): void;
+    /** Grow the backing buffer to hold `capacity` elements. Reallocates and
+     * copies when the current buffer is short, so `buf` and `view()` go stale. */
+    reserve(capacity: number): void;
     /**
      * Append `count` elements from `src` starting at `srcOffset`.
      * Grows if needed. Equivalent to push() in a loop but uses TypedArray.set().

package/dist/type_primitives/typed_arrays/typed_arrays.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"typed_arrays.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/typed_arrays/typed_arrays.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;KAWK;AAEL,eAAO,MAAM,wBAAwB,KAAK,CAAC;AAC3C,eAAO,MAAM,aAAa,IAAI,CAAC;AAE/B,MAAM,MAAM,aAAa,GAAG,KAAK,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,CAAC;AAExF,MAAM,MAAM,aAAa,GACtB,YAAY,GACZ,YAAY,GACZ,SAAS,GACT,UAAU,GACV,UAAU,GACV,UAAU,GACV,WAAW,GACX,WAAW,CAAC;AAEf;;;;;;GAMG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC,SAAS,aAAa;IACrD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;IAChB,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,GAAG,IAAI,MAAM,CAAC;IACd,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC9B,KAAK,IAAI,IAAI,CAAC;IACd,IAAI,IAAI,CAAC,CAAC;IACV,cAAc,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IACvC,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3D,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACtC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACpD;;;;mFAI+E;IAC/E,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;CAC7B;AAED;;;GAGG;AACH,qBAAa,kBAAkB,CAAC,CAAC,SAAS,aAAa,CAAE,YAAW,aAAa,CAAC,CAAC,CAAC;IAKlF,OAAO,CAAC,QAAQ,CAAC,KAAK;IAJvB,OAAO,CAAC,IAAI,CAAI;IAChB,OAAO,CAAC,IAAI,CAAK;gBAGC,KAAK,EAAE,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,EAC5C,eAAe,SAAK;IAKrB,IAAW,MAAM,IAAI,MAAM,CAE1B;IAEM,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAKzB,GAAG,IAAI,MAAM;IAIb,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAItB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAI5C;;;OAGG;IACI,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAM7B,KAAK,IAAI,IAAI;IAIpB;;uDAEmD;IAC5C,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAKnC;;;;OAIG;IACH,IAAW,GAAG,IAAI,CAAC,CAElB;IAED;;;OAGG;IACI,IAAI,IAAI,CAAC;IAOhB,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC;IAYrC,uFAAuF;IAChF,cAAc,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI;IAS7C;;;OAGG;IACI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAQjE,8CAA8C;IACvC,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAM5C;gEAC4D;IACrD,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAM1D,OAAO,CAAC,KAAK;CAKb;AAED,qBAAa,oBAAqB,SAAQ,kBAAkB,CAAC,YAAY,CAAC;gBAC7D,eAAe,SAA2B;CAGtD;AAED,qBAAa,oBAAqB,SAAQ,kBAAkB,CAAC,YAAY,CAAC;gBAC7D,eAAe,SAA2B;CAGtD;AAED,qBAAa,iBAAkB,SAAQ,kBAAkB,CAAC,SAAS,CAAC;gBACvD,eAAe,SAA2B;CAGtD;AAED,qBAAa,kBAAmB,SAAQ,kBAAkB,CAAC,UAAU,CAAC;gBACzD,eAAe,SAA2B;CAGtD;AAED,qBAAa,kBAAmB,SAAQ,kBAAkB,CAAC,UAAU,CAAC;gBACzD,eAAe,SAA2B;CAGtD;AAED,qBAAa,kBAAmB,SAAQ,kBAAkB,CAAC,UAAU,CAAC;gBACzD,eAAe,SAA2B;CAGtD;AAED,qBAAa,mBAAoB,SAAQ,kBAAkB,CAAC,WAAW,CAAC;gBAC3D,eAAe,SAA2B;CAGtD;AAED,qBAAa,mBAAoB,SAAQ,kBAAkB,CAAC,WAAW,CAAC;gBAC3D,eAAe,SAA2B;CAGtD;AAED,eAAO,MAAM,aAAa;;;;;;;;;CASyE,CAAC"}
+{"version":3,"file":"typed_arrays.d.ts","sourceRoot":"","sources":["../../../src/type_primitives/typed_arrays/typed_arrays.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;KAWK;AAEL,eAAO,MAAM,wBAAwB,KAAK,CAAC;AAC3C,eAAO,MAAM,aAAa,IAAI,CAAC;AAE/B,MAAM,MAAM,aAAa,GAAG,KAAK,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,KAAK,CAAC;AAExF,MAAM,MAAM,aAAa,GACtB,YAAY,GACZ,YAAY,GACZ,SAAS,GACT,UAAU,GACV,UAAU,GACV,UAAU,GACV,WAAW,GACX,WAAW,CAAC;AAEf;;;;;;GAMG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC,SAAS,aAAa;IACrD,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,QAAQ,CAAC,GAAG,EAAE,CAAC,CAAC;IAChB,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAC1B,GAAG,IAAI,MAAM,CAAC;IACd,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM,CAAC;IAC9B,KAAK,IAAI,IAAI,CAAC;IACd,IAAI,IAAI,CAAC,CAAC;IACV;;;6DAGyD;IACzD,OAAO,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI,CAAC;IAChC,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IAC3D,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACtC,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI,CAAC;IACpD;;;;sFAIkF;IAClF,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;CAC7B;AAED,qBAAa,kBAAkB,CAAC,CAAC,SAAS,aAAa,CAAE,YAAW,aAAa,CAAC,CAAC,CAAC;IAKlF,OAAO,CAAC,QAAQ,CAAC,KAAK;IAJvB,OAAO,CAAC,IAAI,CAAI;IAChB,OAAO,CAAC,IAAI,CAAK;gBAGC,KAAK,EAAE,KAAK,CAAC,EAAE,MAAM,KAAK,CAAC,EAC5C,eAAe,SAAK;IAKrB,IAAW,MAAM,IAAI,MAAM,CAE1B;IAEM,IAAI,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAKzB,GAAG,IAAI,MAAM;IAIb,KAAK,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAIxB,KAAK,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAI5C;;;OAGG;IACI,UAAU,CAAC,CAAC,EAAE,MAAM,GAAG,MAAM;IAM7B,KAAK,IAAI,IAAI;IAIpB;;uDAEmD;IAC5C,SAAS,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI;IAKnC;;;;OAIG;IACH,IAAW,GAAG,IAAI,CAAC,CAElB;IAED;;;OAGG;IACI,IAAI,IAAI,CAAC;IAOhB,CAAC,MAAM,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC,MAAM,CAAC;IAYrC;kFAC8E;IACvE,OAAO,CAAC,QAAQ,EAAE,MAAM,GAAG,IAAI;IAStC;;;OAGG;IACI,UAAU,CAAC,GAAG,EAAE,CAAC,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAQjE,8CAA8C;IACvC,gBAAgB,CAAC,KAAK,EAAE,MAAM,GAAG,IAAI;IAM5C;gEAC4D;IACrD,eAAe,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,GAAG,IAAI;IAM1D,OAAO,CAAC,KAAK;CAKb;AAED,qBAAa,oBAAqB,SAAQ,kBAAkB,CAAC,YAAY,CAAC;gBAC7D,eAAe,SAA2B;CAGtD;AAED,qBAAa,oBAAqB,SAAQ,kBAAkB,CAAC,YAAY,CAAC;gBAC7D,eAAe,SAA2B;CAGtD;AAED,qBAAa,iBAAkB,SAAQ,kBAAkB,CAAC,SAAS,CAAC;gBACvD,eAAe,SAA2B;CAGtD;AAED,qBAAa,kBAAmB,SAAQ,kBAAkB,CAAC,UAAU,CAAC;gBACzD,eAAe,SAA2B;CAGtD;AAED,qBAAa,kBAAmB,SAAQ,kBAAkB,CAAC,UAAU,CAAC;gBACzD,eAAe,SAA2B;CAGtD;AAED,qBAAa,kBAAmB,SAAQ,kBAAkB,CAAC,UAAU,CAAC;gBACzD,eAAe,SAA2B;CAGtD;AAED,qBAAa,mBAAoB,SAAQ,kBAAkB,CAAC,WAAW,CAAC;gBAC3D,eAAe,SAA2B;CAGtD;AAED,qBAAa,mBAAoB,SAAQ,kBAAkB,CAAC,WAAW,CAAC;gBAC3D,eAAe,SAA2B;CAGtD;AAED,eAAO,MAAM,aAAa;;;;;;;;;CASyE,CAAC"}

package/dist/utils/error.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"error.d.ts","sourceRoot":"","sources":["../../src/utils/error.ts"],"names":[],"mappings":"AAGA,8BAAsB,QAAS,SAAQ,KAAK;aAGxB,aAAa,EAAE,OAAO;aACtB,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;gBAFjD,OAAO,EAAE,MAAM,EACC,aAAa,EAAE,OAAO,EACtB,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,YAAA;CAMpD"}
+{"version":3,"file":"error.d.ts","sourceRoot":"","sources":["../../src/utils/error.ts"],"names":[],"mappings":"AAGA,8BAAsB,QAAS,SAAQ,KAAK;aAG1B,aAAa,EAAE,OAAO;aACtB,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;gBAFjD,OAAO,EAAE,MAAM,EACC,aAAa,EAAE,OAAO,EACtB,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,YAAA;CAYlD"}

package/dist/version.d.cts

@@ -1,10 +1,10 @@
 /**
- * The package version, readable at runtime (POLISH_AUDIT M21).
+ * The package version, readable at runtime.
  *
  * A literal, not a build-time injection, so raw-source (JSR) consumers get the
- * same value as the npm bundle. Kept in lock-step with `package.json` /
- * `jsr.json` by `src/__tests__/version_sync.test.ts` — bump all three
+ * same value as the npm bundle. Kept in lock-step with `package.json` and
+ * `jsr.json` by `src/__tests__/version_sync.test.ts`, bump all three
  * together.
  */
-export declare const VERSION = "0.5.3";
+export declare const VERSION = "0.6.0";
 //# sourceMappingURL=version.d.ts.map

package/dist/version.d.ts

@@ -1,10 +1,10 @@
 /**
- * The package version, readable at runtime (POLISH_AUDIT M21).
+ * The package version, readable at runtime.
  *
  * A literal, not a build-time injection, so raw-source (JSR) consumers get the
- * same value as the npm bundle. Kept in lock-step with `package.json` /
- * `jsr.json` by `src/__tests__/version_sync.test.ts` — bump all three
+ * same value as the npm bundle. Kept in lock-step with `package.json` and
+ * `jsr.json` by `src/__tests__/version_sync.test.ts`, bump all three
  * together.
  */
-export declare const VERSION = "0.5.3";
+export declare const VERSION = "0.6.0";
 //# sourceMappingURL=version.d.ts.map

package/dist/worker.cjs

@@ -0,0 +1 @@
+"use strict";async function X(){const e=globalThis.process,o=e?.getBuiltinModule;return typeof o=="function"?o.call(e,"node:worker_threads"):await import(["node","worker_threads"].join(":"))}const m=4,N={view_stamp:8,archetype_count:16,layout_descriptor_off:20},F=16,O={component_id:0,field_id:2,type_tag:4,byte_off:8},P=40,U={component_mask:4,row_capacity:24,column_count:28,enabled_count:32},M=0,K=1,q=2,z=3,H=4,W=H+m,Y=W+m,Q=Y+1,Z=Q+1>>1,ee=-1,te=-2,R=16,j=65536,ne=[Uint8Array,Int8Array,Uint16Array,Int16Array,Uint32Array,Int32Array,Float32Array,Float64Array];function oe(e,o){return new DataView(e).getUint32(o+N.view_stamp,!0)}function re(e,o){return new DataView(e).getUint32(o+U.enabled_count,!0)}function se(e,o,r,d,f,p){const l=new DataView(e),y=l.getUint32(o+N.archetype_count,!0);let s=o+l.getUint32(o+N.layout_descriptor_off,!0);const h=r.length>>1,_=[];for(let E=0;E<y;E++){const b=l.getUint32(s+U.column_count,!0),A=s+P+b*F;if(b===0){s=A;continue}let T=!0;for(let n=0;n<m;n++){const a=l.getUint32(s+U.component_mask+n*4,!0);if((a&d[n])!==d[n]){T=!1;break}if(f!==null&&(a&f[n])!==0){T=!1;break}}if(!T){s=A;continue}const $=l.getUint32(s+U.row_capacity,!0),x=s+P,g=p?new Array(h):[],S=p?[]:new Array(h);let t=0;for(let n=0;n<b&&t<h;n++){const a=x+n*F,c=l.getUint16(a+O.component_id,!0),u=l.getUint16(a+O.field_id,!0);for(let i=0;i<h;i++){if(r[i*2]!==c||r[i*2+1]!==u)continue;const w=o+l.getUint32(a+O.byte_off,!0);if(p){const k=ne[l.getUint8(a+O.type_tag)];g[i]=new k(e,w,$)}else S[i]=w;t++}}t===h&&_.push({descriptorOff:s,views:g,offsets:S}),s=A}return _}function G(e){return typeof e=="object"&&e!==null&&"value"in e?e:null}function ae(e){const o=G(e),r=o===null?e:o.value;return typeof r=="number"&&Number.isFinite(r)?r:null}function ce(e,o,r,d,f,p){const l=G(e.exports.__stack_pointer);if(l===null||f===1)return;const y=ae(e.exports.__heap_base);if(y===null)throw new Error(`the kernel export '${o}' comes from a module with a '__stack_pointer' and no numeric '__heap_base', so the worker cannot find the span its stack may use. Link with --export=__heap_base.`);const s=Math.ceil(y/R)*R,h=r-s,_=p>0?p:Math.floor(h/f/R)*R;if(_<j)throw new Error(`the kernel export '${o}' needs one stack region for each of ${f} workers, and the ${h} bytes between __heap_base ${y} and the store base ${r} leave ${_} for each. Raise memory.storeBase to reserve at least ${f*j} bytes above the module's heap.`);if(f*_>h)throw new Error(`the kernel export '${o}' needs one stack region of ${_} bytes for each of ${f} workers, and the ${h} bytes between __heap_base ${y} and the store base ${r} hold fewer. Raise memory.storeBase, or lower stackBytes on workers.attach.`);try{l.value=r-d*_}catch{throw new Error(`the kernel export '${o}' comes from a module whose '__stack_pointer' is immutable, so every worker would share one stack. Build with mutable globals, or give the kernel a body that uses no stack.`)}}function V(e,o){const r=e.store instanceof SharedArrayBuffer?null:e.store,d=r===null?e.store:null,f=e.storeBase,p=e.index,l=e.count,y=e.stackBytes??0,s=new Int32Array(e.control),h=new Float64Array(e.control),_=[],E=new Uint32Array(m),b=new Uint32Array(m);function A(){return r!==null?r.buffer:d}function T(t){const n=t.specs,a=(u,i)=>{_[t.slot]={call:u,exportName:t.exportName,specs:n,wantViews:i,args:new Array((n.length>>1)+3),buffer:null,stamp:-1,masks:new Uint32Array(m*2),hasExclude:!1,bound:[]},o({type:"kernel",slot:t.slot})},c=u=>{o({type:"kernel",slot:t.slot,error:u instanceof Error?u.message:String(u)})};try{if(t.wasm!==void 0){if(r===null)throw new Error("a wasm kernel imports the world's memory, and this world is not backed by a WebAssembly.Memory. Build the world with the wasm backing, or give the system a js kernel");const u=new WebAssembly.Instance(t.wasm,{env:{memory:r}}),i=u.exports[t.exportName];if(typeof i!="function")throw new Error(`the wasm kernel exports no function named ${t.exportName}`);const w=(n.length>>1)+3;if(i.length!==w)throw new Error(`the wasm kernel export '${t.exportName}' takes ${i.length} parameters and the system declares ${n.length>>1} columns, which needs ${w}. Give the kernel one parameter for each column, then begin, end and dt.`);ce(u,t.exportName,f,p,l,y),a(i,!1);return}import(t.js).then(u=>{const i=u[t.exportName];if(typeof i!="function"){c(new Error(`the js kernel exports no function named ${t.exportName}`));return}a(i,!0)},c)}catch(u){c(u)}}function $(t){const n=s[Y]===1;let a=n!==t.hasExclude;for(let c=0;c<m;c++)E[c]=s[H+c]>>>0,b[c]=s[W+c]>>>0,(t.masks[c]!==E[c]||t.masks[m+c]!==b[c])&&(a=!0);return a&&(t.masks.set(E,0),t.masks.set(b,m),t.hasExclude=n),a}function x(t){const n=_[t];if(n===void 0)throw new Error(`no kernel is registered in slot ${t}`);const a=A(),c=oe(a,f);($(n)||n.buffer!==a||n.stamp!==c)&&(n.bound=se(a,f,n.specs,E,n.hasExclude?b:null,n.wantViews),n.buffer=a,n.stamp=c);const i=h[Z],w=n.bound,k=n.args,v=n.specs.length>>1;for(let C=0;C<w.length;C++){const D=re(a,w[C].descriptorOff),I=Math.floor(D*p/l),B=Math.floor(D*(p+1)/l);if(B<=I)continue;const J=n.wantViews?w[C].views:w[C].offsets;for(let L=0;L<v;L++)k[L]=J[L];k[v]=I,k[v+1]=B,k[v+2]=i,n.call.apply(void 0,k)}}let g=0;function S(){for(;;){for(;Atomics.load(s,M)===g;)Atomics.wait(s,M,g);g=Atomics.load(s,M);const t=Atomics.load(s,q);if(t===te)return!1;if(t===ee)return!0;try{x(t)}catch{Atomics.compareExchange(s,z,0,p+1)}Atomics.add(s,K,1)===l-1&&Atomics.notify(s,K)}}return{onMessage(t){if(t.type==="kernel"){T(t);return}S()&&o({type:"yielded"})}}}function ie(){const e=globalThis;let o=null;e.addEventListener("message",r=>{if(o===null){o=V(r.data,d=>e.postMessage(d)),e.postMessage({type:"ready"});return}o.onMessage(r.data)})}function le(){X().then(e=>{const o=e.parentPort;if(o===null)return;const r=V(e.workerData,d=>o.postMessage(d));o.on("message",d=>r.onMessage(d)),o.postMessage({type:"ready"})})}typeof globalThis.WorkerGlobalScope<"u"?ie():le();

package/dist/worker.d.cts

@@ -0,0 +1,17 @@
+/***
+ * The engine's worker entry, `@oasys/oecs/worker`.
+ *
+ * `world.workers.attach` starts this file. It picks the runtime, builds the worker
+ * body, and hands every message to it. It exports nothing, because a worker is
+ * started and not imported.
+ *
+ * Node and the node-compatible runtimes take their start payload from
+ * `workerData`, which is there before the first message. A browser worker takes
+ * it from the first message instead.
+ *
+ * Every import below names the file with its extension. This entry ships as its
+ * own bundle, and the tests load the source through plain node, which resolves
+ * a relative specifier by its extension.
+ ***/
+export {};
+//# sourceMappingURL=worker.d.ts.map

package/dist/worker.d.ts

@@ -0,0 +1,17 @@
+/***
+ * The engine's worker entry, `@oasys/oecs/worker`.
+ *
+ * `world.workers.attach` starts this file. It picks the runtime, builds the worker
+ * body, and hands every message to it. It exports nothing, because a worker is
+ * started and not imported.
+ *
+ * Node and the node-compatible runtimes take their start payload from
+ * `workerData`, which is there before the first message. A browser worker takes
+ * it from the first message instead.
+ *
+ * Every import below names the file with its extension. This entry ships as its
+ * own bundle, and the tests load the source through plain node, which resolves
+ * a relative specifier by its extension.
+ ***/
+export {};
+//# sourceMappingURL=worker.d.ts.map

package/dist/worker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"worker.d.ts","sourceRoot":"","sources":["../src/worker.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;KAcK"}

package/dist/worker.development.cjs

@@ -0,0 +1 @@
+"use strict";async function X(){const e=globalThis.process,o=e?.getBuiltinModule;return typeof o=="function"?o.call(e,"node:worker_threads"):await import(["node","worker_threads"].join(":"))}const m=4,N={view_stamp:8,archetype_count:16,layout_descriptor_off:20},F=16,O={component_id:0,field_id:2,type_tag:4,byte_off:8},P=40,U={component_mask:4,row_capacity:24,column_count:28,enabled_count:32},M=0,K=1,q=2,z=3,H=4,W=H+m,Y=W+m,Q=Y+1,Z=Q+1>>1,ee=-1,te=-2,R=16,j=65536,ne=[Uint8Array,Int8Array,Uint16Array,Int16Array,Uint32Array,Int32Array,Float32Array,Float64Array];function oe(e,o){return new DataView(e).getUint32(o+N.view_stamp,!0)}function re(e,o){return new DataView(e).getUint32(o+U.enabled_count,!0)}function se(e,o,r,d,f,p){const l=new DataView(e),y=l.getUint32(o+N.archetype_count,!0);let s=o+l.getUint32(o+N.layout_descriptor_off,!0);const h=r.length>>1,_=[];for(let E=0;E<y;E++){const b=l.getUint32(s+U.column_count,!0),A=s+P+b*F;if(b===0){s=A;continue}let T=!0;for(let n=0;n<m;n++){const a=l.getUint32(s+U.component_mask+n*4,!0);if((a&d[n])!==d[n]){T=!1;break}if(f!==null&&(a&f[n])!==0){T=!1;break}}if(!T){s=A;continue}const $=l.getUint32(s+U.row_capacity,!0),x=s+P,g=p?new Array(h):[],S=p?[]:new Array(h);let t=0;for(let n=0;n<b&&t<h;n++){const a=x+n*F,c=l.getUint16(a+O.component_id,!0),u=l.getUint16(a+O.field_id,!0);for(let i=0;i<h;i++){if(r[i*2]!==c||r[i*2+1]!==u)continue;const w=o+l.getUint32(a+O.byte_off,!0);if(p){const k=ne[l.getUint8(a+O.type_tag)];g[i]=new k(e,w,$)}else S[i]=w;t++}}t===h&&_.push({descriptorOff:s,views:g,offsets:S}),s=A}return _}function G(e){return typeof e=="object"&&e!==null&&"value"in e?e:null}function ae(e){const o=G(e),r=o===null?e:o.value;return typeof r=="number"&&Number.isFinite(r)?r:null}function ce(e,o,r,d,f,p){const l=G(e.exports.__stack_pointer);if(l===null||f===1)return;const y=ae(e.exports.__heap_base);if(y===null)throw new Error(`the kernel export '${o}' comes from a module with a '__stack_pointer' and no numeric '__heap_base', so the worker cannot find the span its stack may use. Link with --export=__heap_base.`);const s=Math.ceil(y/R)*R,h=r-s,_=p>0?p:Math.floor(h/f/R)*R;if(_<j)throw new Error(`the kernel export '${o}' needs one stack region for each of ${f} workers, and the ${h} bytes between __heap_base ${y} and the store base ${r} leave ${_} for each. Raise memory.storeBase to reserve at least ${f*j} bytes above the module's heap.`);if(f*_>h)throw new Error(`the kernel export '${o}' needs one stack region of ${_} bytes for each of ${f} workers, and the ${h} bytes between __heap_base ${y} and the store base ${r} hold fewer. Raise memory.storeBase, or lower stackBytes on workers.attach.`);try{l.value=r-d*_}catch{throw new Error(`the kernel export '${o}' comes from a module whose '__stack_pointer' is immutable, so every worker would share one stack. Build with mutable globals, or give the kernel a body that uses no stack.`)}}function V(e,o){const r=e.store instanceof SharedArrayBuffer?null:e.store,d=r===null?e.store:null,f=e.storeBase,p=e.index,l=e.count,y=e.stackBytes??0,s=new Int32Array(e.control),h=new Float64Array(e.control),_=[],E=new Uint32Array(m),b=new Uint32Array(m);function A(){return r!==null?r.buffer:d}function T(t){const n=t.specs,a=(u,i)=>{_[t.slot]={call:u,exportName:t.exportName,specs:n,wantViews:i,args:new Array((n.length>>1)+3),buffer:null,stamp:-1,masks:new Uint32Array(m*2),hasExclude:!1,bound:[]},o({type:"kernel",slot:t.slot})},c=u=>{o({type:"kernel",slot:t.slot,error:u instanceof Error?u.message:String(u)})};try{if(t.wasm!==void 0){if(r===null)throw new Error("a wasm kernel imports the world's memory, and this world is not backed by a WebAssembly.Memory. Build the world with the wasm backing, or give the system a js kernel");const u=new WebAssembly.Instance(t.wasm,{env:{memory:r}}),i=u.exports[t.exportName];if(typeof i!="function")throw new Error(`the wasm kernel exports no function named ${t.exportName}`);const w=(n.length>>1)+3;if(i.length!==w)throw new Error(`the wasm kernel export '${t.exportName}' takes ${i.length} parameters and the system declares ${n.length>>1} columns, which needs ${w}. Give the kernel one parameter for each column, then begin, end and dt.`);ce(u,t.exportName,f,p,l,y),a(i,!1);return}import(t.js).then(u=>{const i=u[t.exportName];if(typeof i!="function"){c(new Error(`the js kernel exports no function named ${t.exportName}`));return}a(i,!0)},c)}catch(u){c(u)}}function $(t){const n=s[Y]===1;let a=n!==t.hasExclude;for(let c=0;c<m;c++)E[c]=s[H+c]>>>0,b[c]=s[W+c]>>>0,(t.masks[c]!==E[c]||t.masks[m+c]!==b[c])&&(a=!0);return a&&(t.masks.set(E,0),t.masks.set(b,m),t.hasExclude=n),a}function x(t){const n=_[t];if(n===void 0)throw new Error(`no kernel is registered in slot ${t}`);const a=A(),c=oe(a,f);($(n)||n.buffer!==a||n.stamp!==c)&&(n.bound=se(a,f,n.specs,E,n.hasExclude?b:null,n.wantViews),n.buffer=a,n.stamp=c);const i=h[Z],w=n.bound,k=n.args,v=n.specs.length>>1;for(let C=0;C<w.length;C++){const D=re(a,w[C].descriptorOff),I=Math.floor(D*p/l),B=Math.floor(D*(p+1)/l);if(B<=I)continue;const J=n.wantViews?w[C].views:w[C].offsets;for(let L=0;L<v;L++)k[L]=J[L];k[v]=I,k[v+1]=B,k[v+2]=i,n.call.apply(void 0,k)}}let g=0;function S(){for(;;){for(;Atomics.load(s,M)===g;)Atomics.wait(s,M,g);g=Atomics.load(s,M);const t=Atomics.load(s,q);if(t===te)return!1;if(t===ee)return!0;try{x(t)}catch{Atomics.compareExchange(s,z,0,p+1)}Atomics.add(s,K,1)===l-1&&Atomics.notify(s,K)}}return{onMessage(t){if(t.type==="kernel"){T(t);return}S()&&o({type:"yielded"})}}}function ie(){const e=globalThis;let o=null;e.addEventListener("message",r=>{if(o===null){o=V(r.data,d=>e.postMessage(d)),e.postMessage({type:"ready"});return}o.onMessage(r.data)})}function le(){X().then(e=>{const o=e.parentPort;if(o===null)return;const r=V(e.workerData,d=>o.postMessage(d));o.on("message",d=>r.onMessage(d)),o.postMessage({type:"ready"})})}typeof globalThis.WorkerGlobalScope<"u"?ie():le();