@oasys/oecs 0.5.3 → 0.6.0

package/dist/reactive/array.d.cts

@@ -1,24 +0,0 @@
-export interface ReactiveArray<T> {
-    /** Read slot `i`, subscribing to that slot (or to structure if out of range). */
-    get(i: number): T | undefined;
-    /** Element count, tracking structure (length changes only, not value updates). */
-    length(): number;
-    /**
-     * Whole-array snapshot. Tracks structure AND every slot value — the COARSE read
-     * (any slot change wakes it). Use `length()` + `get(i)` for the fine-grained path;
-     * `snapshot()` is for feeding a positional array to a Solid `<Index each>`.
-     */
-    snapshot(): readonly T[];
-    /** Fine-grained slot write. Updating an in-range slot wakes only that slot's readers. */
-    set(i: number, value: T): void;
-    /** Append one element; bumps structure. */
-    push(value: T): void;
-    /** Remove + return the last element; bumps structure. */
-    pop(): T | undefined;
-    /** Array-semantics splice; positionally reconciles so only shifted slots wake. */
-    splice(start: number, deleteCount?: number, ...items: T[]): T[];
-    /** Structural-sharing bulk replace: diff vs current, write only changed slots. */
-    reconcile(next: readonly T[]): void;
-}
-export declare function reactiveArray<T>(initial?: readonly T[], eq?: (a: T, b: T) => boolean): ReactiveArray<T>;
-//# sourceMappingURL=array.d.ts.map

package/dist/reactive/array.d.ts

@@ -1,24 +0,0 @@
-export interface ReactiveArray<T> {
-    /** Read slot `i`, subscribing to that slot (or to structure if out of range). */
-    get(i: number): T | undefined;
-    /** Element count, tracking structure (length changes only, not value updates). */
-    length(): number;
-    /**
-     * Whole-array snapshot. Tracks structure AND every slot value — the COARSE read
-     * (any slot change wakes it). Use `length()` + `get(i)` for the fine-grained path;
-     * `snapshot()` is for feeding a positional array to a Solid `<Index each>`.
-     */
-    snapshot(): readonly T[];
-    /** Fine-grained slot write. Updating an in-range slot wakes only that slot's readers. */
-    set(i: number, value: T): void;
-    /** Append one element; bumps structure. */
-    push(value: T): void;
-    /** Remove + return the last element; bumps structure. */
-    pop(): T | undefined;
-    /** Array-semantics splice; positionally reconciles so only shifted slots wake. */
-    splice(start: number, deleteCount?: number, ...items: T[]): T[];
-    /** Structural-sharing bulk replace: diff vs current, write only changed slots. */
-    reconcile(next: readonly T[]): void;
-}
-export declare function reactiveArray<T>(initial?: readonly T[], eq?: (a: T, b: T) => boolean): ReactiveArray<T>;
-//# sourceMappingURL=array.d.ts.map

package/dist/reactive/array.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"array.d.ts","sourceRoot":"","sources":["../../src/reactive/array.ts"],"names":[],"mappings":"AA2CA,MAAM,WAAW,aAAa,CAAC,CAAC;IAC/B,iFAAiF;IACjF,GAAG,CAAC,CAAC,EAAE,MAAM,GAAG,CAAC,GAAG,SAAS,CAAC;IAC9B,kFAAkF;IAClF,MAAM,IAAI,MAAM,CAAC;IACjB;;;;OAIG;IACH,QAAQ,IAAI,SAAS,CAAC,EAAE,CAAC;IACzB,yFAAyF;IACzF,GAAG,CAAC,CAAC,EAAE,MAAM,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IAC/B,2CAA2C;IAC3C,IAAI,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IACrB,yDAAyD;IACzD,GAAG,IAAI,CAAC,GAAG,SAAS,CAAC;IACrB,kFAAkF;IAClF,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,WAAW,CAAC,EAAE,MAAM,EAAE,GAAG,KAAK,EAAE,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;IAChE,kFAAkF;IAClF,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,EAAE,GAAG,IAAI,CAAC;CACpC;AAED,wBAAgB,aAAa,CAAC,CAAC,EAC9B,OAAO,GAAE,SAAS,CAAC,EAAO,EAC1B,EAAE,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAmB,GACrC,aAAa,CAAC,CAAC,CAAC,CAmGlB"}

package/dist/reactive/index.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("../kernel-yWV3XnAb.cjs"),t=require("../shallow-DQ8aG51_.cjs"),r=require("../interop-CT-REx0W.cjs");exports.batch=e.batch;exports.computed=e.computed;exports.effect=e.effect;exports.onCleanup=e.onCleanup;exports.root=e.root;exports.signal=e.signal;exports.untrack=e.untrack;exports.reactiveArray=t.reactiveArray;exports.reactiveMap=t.reactiveMap;exports.reactiveStruct=t.reactiveStruct;exports.shallow=t.shallow;exports.subscribe=r.subscribe;exports.toExternalStore=r.toExternalStore;

package/dist/reactive/index.d.cts

@@ -1,11 +0,0 @@
-/**
- * Reactive kernel — the engine UI seam's fine-grained, glitch-free reactive core
- * (ADR-0021). Zero dependencies; consumer owns rendering. See docs/api/reactive.md.
- */
-export { signal, computed, effect, batch, untrack, root, onCleanup, type Accessor, type Setter, type Eq } from './kernel.cjs';
-export { reactiveMap, type ReactiveMap } from './map.cjs';
-export { reactiveStruct, type StructSetters, type StructEq } from './struct.cjs';
-export { reactiveArray, type ReactiveArray } from './array.cjs';
-export { subscribe, toExternalStore, type ExternalStore } from './interop.cjs';
-export { shallow } from './shallow.cjs';
-//# sourceMappingURL=index.d.ts.map

package/dist/reactive/index.d.ts

@@ -1,11 +0,0 @@
-/**
- * Reactive kernel — the engine UI seam's fine-grained, glitch-free reactive core
- * (ADR-0021). Zero dependencies; consumer owns rendering. See docs/api/reactive.md.
- */
-export { signal, computed, effect, batch, untrack, root, onCleanup, type Accessor, type Setter, type Eq } from './kernel.js';
-export { reactiveMap, type ReactiveMap } from './map.js';
-export { reactiveStruct, type StructSetters, type StructEq } from './struct.js';
-export { reactiveArray, type ReactiveArray } from './array.js';
-export { subscribe, toExternalStore, type ExternalStore } from './interop.js';
-export { shallow } from './shallow.js';
-//# sourceMappingURL=index.d.ts.map

package/dist/reactive/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/reactive/index.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EACN,MAAM,EACN,QAAQ,EACR,MAAM,EACN,KAAK,EACL,OAAO,EACP,IAAI,EACJ,SAAS,EACT,KAAK,QAAQ,EACb,KAAK,MAAM,EACX,KAAK,EAAE,EACP,MAAM,UAAU,CAAC;AAClB,OAAO,EAAE,WAAW,EAAE,KAAK,WAAW,EAAE,MAAM,OAAO,CAAC;AACtD,OAAO,EAAE,cAAc,EAAE,KAAK,aAAa,EAAE,KAAK,QAAQ,EAAE,MAAM,UAAU,CAAC;AAC7E,OAAO,EAAE,aAAa,EAAE,KAAK,aAAa,EAAE,MAAM,SAAS,CAAC;AAC5D,OAAO,EAAE,SAAS,EAAE,eAAe,EAAE,KAAK,aAAa,EAAE,MAAM,WAAW,CAAC;AAC3E,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC"}

package/dist/reactive/index.development.cjs

@@ -1 +0,0 @@
-"use strict";Object.defineProperty(exports,Symbol.toStringTag,{value:"Module"});const e=require("../kernel-sw7ScKWu.cjs"),t=require("../shallow-C5YmTbtb.cjs"),r=require("../interop-T1HZ-Dpa.cjs");exports.batch=e.batch;exports.computed=e.computed;exports.effect=e.effect;exports.onCleanup=e.onCleanup;exports.root=e.root;exports.signal=e.signal;exports.untrack=e.untrack;exports.reactiveArray=t.reactiveArray;exports.reactiveMap=t.reactiveMap;exports.reactiveStruct=t.reactiveStruct;exports.shallow=t.shallow;exports.subscribe=r.subscribe;exports.toExternalStore=r.toExternalStore;

package/dist/reactive/index.development.js

@@ -1,18 +0,0 @@
-import { b as r, c as e, e as t, o, r as c, s as p, u } from "../kernel-Cz2Kxlwl.js";
-import { b as f, r as i, a as l, s as n } from "../shallow-9S1pY_Iw.js";
-import { s as x, t as v } from "../interop-DqxleBo7.js";
-export {
-  r as batch,
-  e as computed,
-  t as effect,
-  o as onCleanup,
-  f as reactiveArray,
-  i as reactiveMap,
-  l as reactiveStruct,
-  c as root,
-  n as shallow,
-  p as signal,
-  x as subscribe,
-  v as toExternalStore,
-  u as untrack
-};

package/dist/reactive/index.js

@@ -1,18 +0,0 @@
-import { b as r, c as e, e as t, o, r as c, s as p, u } from "../kernel-DgyrLFjW.js";
-import { b as f, r as i, a as l, s as n } from "../shallow-DfnAm9vG.js";
-import { s as x, t as v } from "../interop-CcY6ASQc.js";
-export {
-  r as batch,
-  e as computed,
-  t as effect,
-  o as onCleanup,
-  f as reactiveArray,
-  i as reactiveMap,
-  l as reactiveStruct,
-  c as root,
-  n as shallow,
-  p as signal,
-  x as subscribe,
-  v as toExternalStore,
-  u as untrack
-};

package/dist/reactive/interop.d.cts

@@ -1,19 +0,0 @@
-import { Accessor } from './kernel.cjs';
-/**
- * Vanilla subscription: invoke `onChange(value)` once per coalesced change to
- * whatever `accessor` reads. Does NOT fire on subscribe (the consumer reads the
- * initial value itself); returns a disposer. This is the universal adapter base.
- */
-export declare function subscribe<T>(accessor: Accessor<T>, onChange: (value: T) => void): () => void;
-/**
- * The framework-agnostic external-store contract (React's useSyncExternalStore
- * shape, but useful everywhere). `subscribe` takes a zero-arg "something changed"
- * callback; `getSnapshot` reads the current, referentially-stable value.
- */
-export interface ExternalStore<T> {
-    subscribe(onStoreChange: () => void): () => void;
-    getSnapshot(): T;
-}
-/** Wrap an accessor as an ExternalStore. Snapshot stability comes from the kernel. */
-export declare function toExternalStore<T>(accessor: Accessor<T>): ExternalStore<T>;
-//# sourceMappingURL=interop.d.ts.map

package/dist/reactive/interop.d.ts

@@ -1,19 +0,0 @@
-import { Accessor } from './kernel.js';
-/**
- * Vanilla subscription: invoke `onChange(value)` once per coalesced change to
- * whatever `accessor` reads. Does NOT fire on subscribe (the consumer reads the
- * initial value itself); returns a disposer. This is the universal adapter base.
- */
-export declare function subscribe<T>(accessor: Accessor<T>, onChange: (value: T) => void): () => void;
-/**
- * The framework-agnostic external-store contract (React's useSyncExternalStore
- * shape, but useful everywhere). `subscribe` takes a zero-arg "something changed"
- * callback; `getSnapshot` reads the current, referentially-stable value.
- */
-export interface ExternalStore<T> {
-    subscribe(onStoreChange: () => void): () => void;
-    getSnapshot(): T;
-}
-/** Wrap an accessor as an ExternalStore. Snapshot stability comes from the kernel. */
-export declare function toExternalStore<T>(accessor: Accessor<T>): ExternalStore<T>;
-//# sourceMappingURL=interop.d.ts.map

package/dist/reactive/interop.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"interop.d.ts","sourceRoot":"","sources":["../../src/reactive/interop.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,OAAO,EAAmB,KAAK,QAAQ,EAAE,MAAM,UAAU,CAAC;AAE1D;;;;GAIG;AACH,wBAAgB,SAAS,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,KAAK,IAAI,GAAG,MAAM,IAAI,CAW5F;AAED;;;;GAIG;AACH,MAAM,WAAW,aAAa,CAAC,CAAC;IAC/B,SAAS,CAAC,aAAa,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC;IACjD,WAAW,IAAI,CAAC,CAAC;CACjB;AAED,sFAAsF;AACtF,wBAAgB,eAAe,CAAC,CAAC,EAAE,QAAQ,EAAE,QAAQ,CAAC,CAAC,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC,CAK1E"}

package/dist/reactive/kernel.d.cts

@@ -1,73 +0,0 @@
-/**
- * In-house fine-grained reactive kernel — signal / computed / effect / batch,
- * plus ownership scopes (`root` / `onCleanup`). Zero dependencies (ADR-0021).
- *
- * This is the engine UI seam's propagation core. It is the same class of machine
- * as the ECS observer system (ADR-0013) — fine-grained, glitch-free, cascades to
- * a fixed point — at a different granularity, which is exactly why #646 chose to
- * own it rather than adopt solid-js / @preact/signals-core / alien-signals.
- *
- * The dependency graph is an intrusive doubly-linked structure. One pooled `Link`
- * per edge is threaded into BOTH the source's subscriber list and the target's
- * dependency list at once, so link/unlink is O(1) pointer surgery with no hashing,
- * and a stable-dependency re-run reuses its edges via a tail cursor (zero graph
- * mutation). That is the entire performance story: it ties the throughput leaders
- * on the hot paths and avoids the Set-based prototype's fan-in collapse.
- *
- * Computed is lazy and glitch-free via a version-cutoff pull (the model
- * alien-signals / preact use):
- *
- *   - Every source carries a `version` that bumps only when its value actually
- *     changes. Each edge (`Link`) remembers the source version it last saw.
- *   - A write does NOT eagerly recompute anything. It propagates a "maybe-dirty"
- *     mark (`OUTDATED`) down through computeds to effects, and queues the effects.
- *     Computeds stay lazy.
- *   - Work happens on the pull: when an effect flushes (or a computed is read),
- *     `needsRecompute` walks its deps, refreshes each, and recomputes only if a
- *     dep's version actually advanced. A recompute that produces an equal value
- *     does NOT bump the node's own version, so its subscribers are skipped.
- *
- * That gives glitch-freedom (a diamond resolves with one consistent recompute of
- * the join) and minimal work (unchanged values cut propagation) at once.
- *
- * Known, deliberate scope (refinements, not correctness gaps): computeds ALWAYS
- * track their sources (no auto-unsubscribe of unobserved computeds — the TRACKING
- * optimization) and there is no global-version fast path. The two help only a
- * workload heavy in *unobserved* computeds and are low-value without each other;
- * see ADR-0021. Cycle reads return the stale value rather than throwing.
- */
-export type Eq<T> = (a: T, b: T) => boolean;
-/** A read accessor; calling it inside an effect/computed subscribes to the source. */
-export type Accessor<T> = () => T;
-/** A write setter; a same-value write (per `eq`) is a no-op and wakes nobody. */
-export type Setter<T> = (v: T) => void;
-/** Create a writable signal. Returns `[read, write]`; `eq` defaults to `Object.is`.
- * The zero-arg form (Solid parity) starts at `undefined` for late-initialized
- * values: `const [user, setUser] = signal<User>();` reads `User | undefined`. */
-export declare function signal<T>(): readonly [Accessor<T | undefined>, Setter<T | undefined>];
-export declare function signal<T>(initial: T, eq?: Eq<T>): readonly [Accessor<T>, Setter<T>];
-/** Create a lazy, glitch-free derived value. Recomputes on pull only when a dep changed. */
-export declare function computed<T>(fn: () => T, eq?: Eq<T>): Accessor<T>;
-/** Run `fn` now and re-run it whenever a tracked dep changes. Returns a disposer. */
-export declare function effect(fn: () => void): () => void;
-/** Coalesce all writes inside `fn` into a single flush at the outermost boundary. */
-export declare function batch(fn: () => void): void;
-/**
- * Read inside `fn` without subscribing the enclosing effect/computed to anything it
- * touches (Solid's `untrack`). Use it when a callback that runs during a tracked run
- * must NOT become a dependency — e.g. an interop subscriber whose `onChange` reads
- * other accessors. Returns `fn`'s result.
- */
-export declare function untrack<T>(fn: () => T): T;
-/**
- * Create an ownership scope. `fn` receives a disposer that tears down every
- * effect/computed (and their onCleanups) created under the scope. Detached from
- * any enclosing owner — you hold the disposer (Solid's `createRoot` contract).
- */
-export declare function root<T>(fn: (dispose: () => void) => T): T;
-/**
- * Register a cleanup with the owner in scope. Inside an effect/computed it runs
- * before each re-run and on dispose; inside a `root` it runs on root disposal.
- */
-export declare function onCleanup(fn: () => void): void;
-//# sourceMappingURL=kernel.d.ts.map

package/dist/reactive/kernel.d.ts

@@ -1,73 +0,0 @@
-/**
- * In-house fine-grained reactive kernel — signal / computed / effect / batch,
- * plus ownership scopes (`root` / `onCleanup`). Zero dependencies (ADR-0021).
- *
- * This is the engine UI seam's propagation core. It is the same class of machine
- * as the ECS observer system (ADR-0013) — fine-grained, glitch-free, cascades to
- * a fixed point — at a different granularity, which is exactly why #646 chose to
- * own it rather than adopt solid-js / @preact/signals-core / alien-signals.
- *
- * The dependency graph is an intrusive doubly-linked structure. One pooled `Link`
- * per edge is threaded into BOTH the source's subscriber list and the target's
- * dependency list at once, so link/unlink is O(1) pointer surgery with no hashing,
- * and a stable-dependency re-run reuses its edges via a tail cursor (zero graph
- * mutation). That is the entire performance story: it ties the throughput leaders
- * on the hot paths and avoids the Set-based prototype's fan-in collapse.
- *
- * Computed is lazy and glitch-free via a version-cutoff pull (the model
- * alien-signals / preact use):
- *
- *   - Every source carries a `version` that bumps only when its value actually
- *     changes. Each edge (`Link`) remembers the source version it last saw.
- *   - A write does NOT eagerly recompute anything. It propagates a "maybe-dirty"
- *     mark (`OUTDATED`) down through computeds to effects, and queues the effects.
- *     Computeds stay lazy.
- *   - Work happens on the pull: when an effect flushes (or a computed is read),
- *     `needsRecompute` walks its deps, refreshes each, and recomputes only if a
- *     dep's version actually advanced. A recompute that produces an equal value
- *     does NOT bump the node's own version, so its subscribers are skipped.
- *
- * That gives glitch-freedom (a diamond resolves with one consistent recompute of
- * the join) and minimal work (unchanged values cut propagation) at once.
- *
- * Known, deliberate scope (refinements, not correctness gaps): computeds ALWAYS
- * track their sources (no auto-unsubscribe of unobserved computeds — the TRACKING
- * optimization) and there is no global-version fast path. The two help only a
- * workload heavy in *unobserved* computeds and are low-value without each other;
- * see ADR-0021. Cycle reads return the stale value rather than throwing.
- */
-export type Eq<T> = (a: T, b: T) => boolean;
-/** A read accessor; calling it inside an effect/computed subscribes to the source. */
-export type Accessor<T> = () => T;
-/** A write setter; a same-value write (per `eq`) is a no-op and wakes nobody. */
-export type Setter<T> = (v: T) => void;
-/** Create a writable signal. Returns `[read, write]`; `eq` defaults to `Object.is`.
- * The zero-arg form (Solid parity) starts at `undefined` for late-initialized
- * values: `const [user, setUser] = signal<User>();` reads `User | undefined`. */
-export declare function signal<T>(): readonly [Accessor<T | undefined>, Setter<T | undefined>];
-export declare function signal<T>(initial: T, eq?: Eq<T>): readonly [Accessor<T>, Setter<T>];
-/** Create a lazy, glitch-free derived value. Recomputes on pull only when a dep changed. */
-export declare function computed<T>(fn: () => T, eq?: Eq<T>): Accessor<T>;
-/** Run `fn` now and re-run it whenever a tracked dep changes. Returns a disposer. */
-export declare function effect(fn: () => void): () => void;
-/** Coalesce all writes inside `fn` into a single flush at the outermost boundary. */
-export declare function batch(fn: () => void): void;
-/**
- * Read inside `fn` without subscribing the enclosing effect/computed to anything it
- * touches (Solid's `untrack`). Use it when a callback that runs during a tracked run
- * must NOT become a dependency — e.g. an interop subscriber whose `onChange` reads
- * other accessors. Returns `fn`'s result.
- */
-export declare function untrack<T>(fn: () => T): T;
-/**
- * Create an ownership scope. `fn` receives a disposer that tears down every
- * effect/computed (and their onCleanups) created under the scope. Detached from
- * any enclosing owner — you hold the disposer (Solid's `createRoot` contract).
- */
-export declare function root<T>(fn: (dispose: () => void) => T): T;
-/**
- * Register a cleanup with the owner in scope. Inside an effect/computed it runs
- * before each re-run and on dispose; inside a `root` it runs on root disposal.
- */
-export declare function onCleanup(fn: () => void): void;
-//# sourceMappingURL=kernel.d.ts.map

package/dist/reactive/kernel.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"kernel.d.ts","sourceRoot":"","sources":["../../src/reactive/kernel.ts"],"names":[],"mappings":"AACA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAEH,MAAM,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC;AA0W5C,sFAAsF;AACtF,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC;AAClC,iFAAiF;AACjF,MAAM,MAAM,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,KAAK,IAAI,CAAC;AAEvC;;iFAEiF;AACjF,wBAAgB,MAAM,CAAC,CAAC,KAAK,SAAS,CAAC,QAAQ,CAAC,CAAC,GAAG,SAAS,CAAC,EAAE,MAAM,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;AACvF,wBAAgB,MAAM,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;AASrF,4FAA4F;AAC5F,wBAAgB,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,EAAE,EAAE,GAAE,EAAE,CAAC,CAAC,CAAa,GAAG,QAAQ,CAAC,CAAC,CAAC,CAS3E;AAED,qFAAqF;AACrF,wBAAgB,MAAM,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,MAAM,IAAI,CAKjD;AAED,qFAAqF;AACrF,wBAAgB,KAAK,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,IAAI,CAO1C;AAED;;;;;GAKG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC,CAQzC;AAED;;;;GAIG;AACH,wBAAgB,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,EAAE,MAAM,IAAI,KAAK,CAAC,GAAG,CAAC,CASzD;AAED;;;GAGG;AACH,wBAAgB,SAAS,CAAC,EAAE,EAAE,MAAM,IAAI,GAAG,IAAI,CAW9C"}

package/dist/reactive/map.d.cts

@@ -1,16 +0,0 @@
-export interface ReactiveMap<K, V> {
-    /** Read a key's value, subscribing the caller to that key (or to structure if absent). */
-    get(key: K): V | undefined;
-    /** Insert or update a key. Updating an existing key wakes only that key's readers. */
-    set(key: K, value: V): void;
-    /** Remove a key. Wakes that key's readers (now absent) and structure readers. */
-    delete(key: K): boolean;
-    /** Membership test, tracking the key set. */
-    has(key: K): boolean;
-    /** Entry count, tracking the key set. */
-    size(): number;
-    /** Snapshot of keys, tracking the key set. */
-    keys(): K[];
-}
-export declare function reactiveMap<K, V>(eq?: (a: V, b: V) => boolean): ReactiveMap<K, V>;
-//# sourceMappingURL=map.d.ts.map

package/dist/reactive/map.d.ts

@@ -1,16 +0,0 @@
-export interface ReactiveMap<K, V> {
-    /** Read a key's value, subscribing the caller to that key (or to structure if absent). */
-    get(key: K): V | undefined;
-    /** Insert or update a key. Updating an existing key wakes only that key's readers. */
-    set(key: K, value: V): void;
-    /** Remove a key. Wakes that key's readers (now absent) and structure readers. */
-    delete(key: K): boolean;
-    /** Membership test, tracking the key set. */
-    has(key: K): boolean;
-    /** Entry count, tracking the key set. */
-    size(): number;
-    /** Snapshot of keys, tracking the key set. */
-    keys(): K[];
-}
-export declare function reactiveMap<K, V>(eq?: (a: V, b: V) => boolean): ReactiveMap<K, V>;
-//# sourceMappingURL=map.d.ts.map

package/dist/reactive/map.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"map.d.ts","sourceRoot":"","sources":["../../src/reactive/map.ts"],"names":[],"mappings":"AA2BA,MAAM,WAAW,WAAW,CAAC,CAAC,EAAE,CAAC;IAChC,0FAA0F;IAC1F,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC;IAC3B,sFAAsF;IACtF,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;IAC5B,iFAAiF;IACjF,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IACxB,6CAA6C;IAC7C,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,OAAO,CAAC;IACrB,yCAAyC;IACzC,IAAI,IAAI,MAAM,CAAC;IACf,8CAA8C;IAC9C,IAAI,IAAI,CAAC,EAAE,CAAC;CACZ;AAED,wBAAgB,WAAW,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,GAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAmB,GAAG,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAiE5F"}

package/dist/reactive/shallow.d.cts

@@ -1,11 +0,0 @@
-/**
- * Shallow (one-level) value equality — the recommended `eq` for object-valued
- * projections. Mirrors zustand `useShallow` / MobX `comparer.shallow`: two objects
- * are equal iff they have the same own keys with `Object.is`-equal values. Restores
- * "equal write wakes nobody" for projections that build a fresh object each tick.
- *
- * Lives in the kernel entry (`/reactive`) — it has zero ECS dependency
- * (POLISH_AUDIT M12); `/reactive-sync` re-exports it for compatibility.
- */
-export declare function shallow(a: object, b: object): boolean;
-//# sourceMappingURL=shallow.d.ts.map

package/dist/reactive/shallow.d.ts

@@ -1,11 +0,0 @@
-/**
- * Shallow (one-level) value equality — the recommended `eq` for object-valued
- * projections. Mirrors zustand `useShallow` / MobX `comparer.shallow`: two objects
- * are equal iff they have the same own keys with `Object.is`-equal values. Restores
- * "equal write wakes nobody" for projections that build a fresh object each tick.
- *
- * Lives in the kernel entry (`/reactive`) — it has zero ECS dependency
- * (POLISH_AUDIT M12); `/reactive-sync` re-exports it for compatibility.
- */
-export declare function shallow(a: object, b: object): boolean;
-//# sourceMappingURL=shallow.d.ts.map

package/dist/reactive/shallow.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"shallow.d.ts","sourceRoot":"","sources":["../../src/reactive/shallow.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,GAAG,OAAO,CAWrD"}

package/dist/reactive/struct.d.cts

@@ -1,10 +0,0 @@
-/** Per-field setters: `set.field(value)`. */
-export type StructSetters<T> = {
-    readonly [K in keyof T]: (v: T[K]) => void;
-};
-/** Optional per-field equality overrides. */
-export type StructEq<T> = {
-    readonly [K in keyof T]?: (a: T[K], b: T[K]) => boolean;
-};
-export declare function reactiveStruct<T extends object>(initial: T, eq?: StructEq<T>): readonly [proxy: Readonly<T>, set: StructSetters<T>];
-//# sourceMappingURL=struct.d.ts.map

package/dist/reactive/struct.d.ts

@@ -1,10 +0,0 @@
-/** Per-field setters: `set.field(value)`. */
-export type StructSetters<T> = {
-    readonly [K in keyof T]: (v: T[K]) => void;
-};
-/** Optional per-field equality overrides. */
-export type StructEq<T> = {
-    readonly [K in keyof T]?: (a: T[K], b: T[K]) => boolean;
-};
-export declare function reactiveStruct<T extends object>(initial: T, eq?: StructEq<T>): readonly [proxy: Readonly<T>, set: StructSetters<T>];
-//# sourceMappingURL=struct.d.ts.map

package/dist/reactive/struct.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"struct.d.ts","sourceRoot":"","sources":["../../src/reactive/struct.ts"],"names":[],"mappings":"AA6BA,6CAA6C;AAC7C,MAAM,MAAM,aAAa,CAAC,CAAC,IAAI;IAAE,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI;CAAE,CAAC;AAC9E,6CAA6C;AAC7C,MAAM,MAAM,QAAQ,CAAC,CAAC,IAAI;IAAE,QAAQ,EAAE,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,OAAO;CAAE,CAAC;AAEtF,wBAAgB,cAAc,CAAC,CAAC,SAAS,MAAM,EAC9C,OAAO,EAAE,CAAC,EACV,EAAE,GAAE,QAAQ,CAAC,CAAC,CAAM,GAClB,SAAS,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,aAAa,CAAC,CAAC,CAAC,CAAC,CAyDtD"}

package/dist/shallow-9S1pY_Iw.js

@@ -1,159 +0,0 @@
-import { s as y, b as w, u as O } from "./kernel-Cz2Kxlwl.js";
-function j(p = Object.is) {
-  const i = /* @__PURE__ */ new Map(), [t, h] = y(0);
-  let l = 0;
-  const a = (s, n) => s !== void 0 && n !== void 0 ? p(s, n) : s === n;
-  return {
-    get(s) {
-      const n = i.get(s);
-      if (n !== void 0) return n[0]();
-      t();
-    },
-    set(s, n) {
-      n === void 0 && console.warn(
-        "reactiveMap.set(key, undefined): undefined is the absent sentinel — get(key) cannot distinguish it from an unset key; use delete(key) to remove."
-      );
-      const o = i.get(s);
-      o !== void 0 ? o[1](n) : (i.set(s, y(n, a)), h(++l));
-    },
-    delete(s) {
-      const n = i.get(s);
-      return n === void 0 ? !1 : (i.delete(s), w(() => {
-        n[1](void 0), h(++l);
-      }), !0);
-    },
-    has(s) {
-      return t(), i.has(s);
-    },
-    size() {
-      return t(), i.size;
-    },
-    keys() {
-      return t(), [...i.keys()];
-    }
-  };
-}
-function x(p, i = {}) {
-  const t = {}, h = {}, l = Object.keys(p), a = new Set(l);
-  for (const n of l) {
-    const [o, m] = y(
-      p[n],
-      i[n]
-    );
-    t[n] = o, h[n] = m;
-  }
-  return [new Proxy({}, {
-    // A field read subscribes; a NON-field key must not throw. `JSON.stringify`
-    // (`toJSON`), `await proxy` (`then`), `String(proxy)` (`Symbol.toPrimitive`)
-    // and `for..of` (`Symbol.iterator`) all probe keys that aren't fields — fall
-    // through to the (empty) target so they see the ordinary undefined/inherited
-    // value instead of calling `undefined()`. `fieldSet` (not `k in reads`) so
-    // inherited `toString`/`constructor` aren't mistaken for fields.
-    get: (n, o) => a.has(o) ? t[o]() : Reflect.get(n, o),
-    has: (n, o) => a.has(o),
-    // Enumerable without subscribing: enumeration calls `ownKeys` +
-    // `getOwnPropertyDescriptor`, never `get`, so `Object.keys(proxy)` returns
-    // the field set and tracks nothing. The descriptor is an ACCESSOR whose `get`
-    // reads the live signal, so `{...proxy}` / `Object.values(proxy)` /
-    // `Object.getOwnPropertyDescriptor(proxy, f).value` see the current value
-    // (a value-less descriptor would normalize to `value: undefined`). Non-field
-    // keys report no own descriptor. The target is the empty (extensible) object,
-    // so these configurable own keys satisfy the Proxy invariants.
-    ownKeys: () => l,
-    getOwnPropertyDescriptor: (n, o) => a.has(o) ? { get: () => t[o](), enumerable: !0, configurable: !0 } : void 0,
-    // Writes go through `set.field(v)` — the proxy is a READ surface, and its
-    // public type says so (`Readonly<T>`, POLISH_AUDIT #8). The trap backs the
-    // type for JS callers / policed casts: without it, a field assignment threw
-    // an opaque "Cannot redefine property" (the accessor descriptor above has no
-    // setter) and a TYPO'D field silently stuck on the hidden target as a
-    // non-reactive value.
-    set: (n, o) => {
-      throw new TypeError(
-        `reactiveStruct proxy is read-only: use set.${String(o)}(value) — the setters tuple returned alongside the proxy`
-      );
-    }
-  }), h];
-}
-const v = Symbol("reactiveArray.absent");
-function M(p = [], i = Object.is) {
-  const t = [], [h, l] = y(0);
-  let a = 0;
-  const s = (e, r) => e !== v && r !== v ? i(e, r) : e === r, n = (e) => y(e, s), o = (e) => O(t[e][0]);
-  for (const e of p) t.push(n(e));
-  function m(e) {
-    w(() => {
-      const r = t.length, f = e.length, g = f < r ? f : r;
-      for (let c = 0; c < g; c++) t[c][1](e[c]);
-      if (f > r) {
-        for (let c = r; c < f; c++) t.push(n(e[c]));
-        l(++a);
-      } else if (f < r) {
-        const c = t.splice(f);
-        for (let d = 0; d < c.length; d++) c[d][1](v);
-        l(++a);
-      }
-    });
-  }
-  return {
-    get(e) {
-      if (e >= 0 && e < t.length) {
-        const r = t[e][0]();
-        if (r !== v) return r;
-      }
-      h();
-    },
-    length() {
-      return h(), t.length;
-    },
-    snapshot() {
-      h();
-      const e = new Array(t.length);
-      for (let r = 0; r < t.length; r++) e[r] = t[r][0]();
-      return e;
-    },
-    set(e, r) {
-      e >= 0 && e < t.length ? t[e][1](r) : console.warn(
-        `reactiveArray.set(${e}): index out of range [0, ${t.length}); ignored. Use push / splice / reconcile to change length.`
-      );
-    },
-    push(e) {
-      t.push(n(e)), l(++a);
-    },
-    pop() {
-      const e = t.length;
-      if (e === 0) return;
-      const r = o(e - 1), [f] = t.splice(e - 1);
-      return w(() => {
-        f[1](v), l(++a);
-      }), r;
-    },
-    splice(e, r, ...f) {
-      const g = t.length, c = e < 0 ? Math.max(g + e, 0) : Math.min(e, g), d = r === void 0 ? g - c : Math.max(0, Math.min(r, g - c)), k = [];
-      for (let u = 0; u < d; u++) k.push(o(c + u));
-      const b = [];
-      for (let u = 0; u < c; u++) b.push(o(u));
-      for (let u = 0; u < f.length; u++) b.push(f[u]);
-      for (let u = c + d; u < g; u++) b.push(o(u));
-      return m(b), k;
-    },
-    reconcile(e) {
-      m(e);
-    }
-  };
-}
-function A(p, i) {
-  if (Object.is(p, i)) return !0;
-  const t = p, h = i, l = Object.keys(t);
-  if (l.length !== Object.keys(h).length) return !1;
-  for (let a = 0; a < l.length; a++) {
-    const s = l[a];
-    if (!Object.prototype.hasOwnProperty.call(h, s) || !Object.is(t[s], h[s])) return !1;
-  }
-  return !0;
-}
-export {
-  x as a,
-  M as b,
-  j as r,
-  A as s
-};

package/dist/shallow-C5YmTbtb.cjs

@@ -1 +0,0 @@
-"use strict";const p=require("./kernel-sw7ScKWu.cjs");function k(g=Object.is){const i=new Map,[t,h]=p.signal(0);let l=0;const a=(s,n)=>s!==void 0&&n!==void 0?g(s,n):s===n;return{get(s){const n=i.get(s);if(n!==void 0)return n[0]();t()},set(s,n){n===void 0&&console.warn("reactiveMap.set(key, undefined): undefined is the absent sentinel — get(key) cannot distinguish it from an unset key; use delete(key) to remove.");const o=i.get(s);o!==void 0?o[1](n):(i.set(s,p.signal(n,a)),h(++l))},delete(s){const n=i.get(s);return n===void 0?!1:(i.delete(s),p.batch(()=>{n[1](void 0),h(++l)}),!0)},has(s){return t(),i.has(s)},size(){return t(),i.size},keys(){return t(),[...i.keys()]}}}function O(g,i={}){const t={},h={},l=Object.keys(g),a=new Set(l);for(const n of l){const[o,b]=p.signal(g[n],i[n]);t[n]=o,h[n]=b}return[new Proxy({},{get:(n,o)=>a.has(o)?t[o]():Reflect.get(n,o),has:(n,o)=>a.has(o),ownKeys:()=>l,getOwnPropertyDescriptor:(n,o)=>a.has(o)?{get:()=>t[o](),enumerable:!0,configurable:!0}:void 0,set:(n,o)=>{throw new TypeError(`reactiveStruct proxy is read-only: use set.${String(o)}(value) — the setters tuple returned alongside the proxy`)}}),h]}const y=Symbol("reactiveArray.absent");function S(g=[],i=Object.is){const t=[],[h,l]=p.signal(0);let a=0;const s=(e,r)=>e!==y&&r!==y?i(e,r):e===r,n=e=>p.signal(e,s),o=e=>p.untrack(t[e][0]);for(const e of g)t.push(n(e));function b(e){p.batch(()=>{const r=t.length,f=e.length,d=f<r?f:r;for(let c=0;c<d;c++)t[c][1](e[c]);if(f>r){for(let c=r;c<f;c++)t.push(n(e[c]));l(++a)}else if(f<r){const c=t.splice(f);for(let v=0;v<c.length;v++)c[v][1](y);l(++a)}})}return{get(e){if(e>=0&&e<t.length){const r=t[e][0]();if(r!==y)return r}h()},length(){return h(),t.length},snapshot(){h();const e=new Array(t.length);for(let r=0;r<t.length;r++)e[r]=t[r][0]();return e},set(e,r){e>=0&&e<t.length?t[e][1](r):console.warn(`reactiveArray.set(${e}): index out of range [0, ${t.length}); ignored. Use push / splice / reconcile to change length.`)},push(e){t.push(n(e)),l(++a)},pop(){const e=t.length;if(e===0)return;const r=o(e-1),[f]=t.splice(e-1);return p.batch(()=>{f[1](y),l(++a)}),r},splice(e,r,...f){const d=t.length,c=e<0?Math.max(d+e,0):Math.min(e,d),v=r===void 0?d-c:Math.max(0,Math.min(r,d-c)),w=[];for(let u=0;u<v;u++)w.push(o(c+u));const m=[];for(let u=0;u<c;u++)m.push(o(u));for(let u=0;u<f.length;u++)m.push(f[u]);for(let u=c+v;u<d;u++)m.push(o(u));return b(m),w},reconcile(e){b(e)}}}function j(g,i){if(Object.is(g,i))return!0;const t=g,h=i,l=Object.keys(t);if(l.length!==Object.keys(h).length)return!1;for(let a=0;a<l.length;a++){const s=l[a];if(!Object.prototype.hasOwnProperty.call(h,s)||!Object.is(t[s],h[s]))return!1}return!0}exports.reactiveArray=S;exports.reactiveMap=k;exports.reactiveStruct=O;exports.shallow=j;

package/dist/shallow-DQ8aG51_.cjs

@@ -1 +0,0 @@
-"use strict";const p=require("./kernel-yWV3XnAb.cjs");function O(g=Object.is){const l=new Map,[t,h]=p.signal(0);let i=0;const a=(s,r)=>s!==void 0&&r!==void 0?g(s,r):s===r;return{get(s){const r=l.get(s);if(r!==void 0)return r[0]();t()},set(s,r){const o=l.get(s);o!==void 0?o[1](r):(l.set(s,p.signal(r,a)),h(++i))},delete(s){const r=l.get(s);return r===void 0?!1:(l.delete(s),p.batch(()=>{r[1](void 0),h(++i)}),!0)},has(s){return t(),l.has(s)},size(){return t(),l.size},keys(){return t(),[...l.keys()]}}}function k(g,l={}){const t={},h={},i=Object.keys(g),a=new Set(i);for(const r of i){const[o,b]=p.signal(g[r],l[r]);t[r]=o,h[r]=b}return[new Proxy({},{get:(r,o)=>a.has(o)?t[o]():Reflect.get(r,o),has:(r,o)=>a.has(o),ownKeys:()=>i,getOwnPropertyDescriptor:(r,o)=>a.has(o)?{get:()=>t[o](),enumerable:!0,configurable:!0}:void 0,set:(r,o)=>!1}),h]}const y=Symbol("reactiveArray.absent");function j(g=[],l=Object.is){const t=[],[h,i]=p.signal(0);let a=0;const s=(e,n)=>e!==y&&n!==y?l(e,n):e===n,r=e=>p.signal(e,s),o=e=>p.untrack(t[e][0]);for(const e of g)t.push(r(e));function b(e){p.batch(()=>{const n=t.length,f=e.length,v=f<n?f:n;for(let c=0;c<v;c++)t[c][1](e[c]);if(f>n){for(let c=n;c<f;c++)t.push(r(e[c]));i(++a)}else if(f<n){const c=t.splice(f);for(let d=0;d<c.length;d++)c[d][1](y);i(++a)}})}return{get(e){if(e>=0&&e<t.length){const n=t[e][0]();if(n!==y)return n}h()},length(){return h(),t.length},snapshot(){h();const e=new Array(t.length);for(let n=0;n<t.length;n++)e[n]=t[n][0]();return e},set(e,n){e>=0&&e<t.length&&t[e][1](n)},push(e){t.push(r(e)),i(++a)},pop(){const e=t.length;if(e===0)return;const n=o(e-1),[f]=t.splice(e-1);return p.batch(()=>{f[1](y),i(++a)}),n},splice(e,n,...f){const v=t.length,c=e<0?Math.max(v+e,0):Math.min(e,v),d=n===void 0?v-c:Math.max(0,Math.min(n,v-c)),w=[];for(let u=0;u<d;u++)w.push(o(c+u));const m=[];for(let u=0;u<c;u++)m.push(o(u));for(let u=0;u<f.length;u++)m.push(f[u]);for(let u=c+d;u<v;u++)m.push(o(u));return b(m),w},reconcile(e){b(e)}}}function S(g,l){if(Object.is(g,l))return!0;const t=g,h=l,i=Object.keys(t);if(i.length!==Object.keys(h).length)return!1;for(let a=0;a<i.length;a++){const s=i[a];if(!Object.prototype.hasOwnProperty.call(h,s)||!Object.is(t[s],h[s]))return!1}return!0}exports.reactiveArray=j;exports.reactiveMap=O;exports.reactiveStruct=k;exports.shallow=S;