@ecsia/scheduler 0.1.0

package/dist/executor/update-threaded.js

@@ -0,0 +1,67 @@
+// The THREADED frame loop (PHASE-2): the same wave/round walk as the
+// single-thread executor (update.ts/run-wave.ts), but each round's worker-eligible batches are
+// dispatched to the WorkerPool (pool.runRound) — which flips world.phase to 'wave' across the
+// dispatch, awaits the Atomics wave fence, flips back to 'serial', and applies the per-worker command
+// buffers in the deterministic ascending-worker-index merge order (flushAll).
+//
+// This is the missing integration the headline requires: a threaded world REPRODUCES the
+// single-thread observable result through the SAME frame loop, not only
+// through a hand-driven runRound. Worker batches run concurrently on workers; main-thread batches
+// (workerIndex === -1, e.g. object-field systems) run serially on the main thread BEFORE the wave's
+// dispatch, while world.phase is still 'serial' (so their direct-apply fast path is legal).
+//
+// Because batches in a round are conflict-free by construction (WAVE-CONFLICT ) and the command
+// merge order is fixed, the threaded result equals the single-thread result for the same
+// (state, plan, dt).
+function runMainThreadSystem(env, batch, dt) {
+    const sb = env.systems[batch.systemId];
+    const ctx = {
+        world: env.world,
+        dt,
+        tick: env.world.currentTick(),
+        query: env.scopedQueries[sb.id],
+    };
+    sb.run(ctx);
+}
+async function runWaveThreaded(env, pool, wave, dt) {
+    for (const round of wave.rounds) {
+        // Main-thread batches first (phase stays 'serial', direct-apply legal — PHASE-2 ).
+        for (const batch of round) {
+            if (batch.workerIndex < 0)
+                runMainThreadSystem(env, batch, dt);
+        }
+        // Worker-eligible batches dispatched concurrently; runRound flips phase 'wave'→'serial', awaits the
+        // fence, and applies the per-worker command buffers (deterministic merge). It is a no-op if there
+        // are no worker batches in this round.
+        const workerBatches = round.filter((b) => b.workerIndex >= 0);
+        if (workerBatches.length > 0) {
+            await pool.runRound(workerBatches.map((b) => ({ systemId: b.systemId, workerIndex: b.workerIndex })), dt);
+        }
+    }
+    // ---- SERIAL SLOT (after the wave) ---- query maintenance + (per-system) observers.
+    env.world.maintainStructural();
+    if (env.observerCadence === 'per-system')
+        env.world.observerDrain();
+}
+/**
+ * Run one threaded tick: the whole schedule (worker waves) + reactivity flush. The frame order is
+ * byte-identical to the single-thread runUpdate (frameReset → waves → observerDrain → flushLogs);
+ * the only difference is that each round's worker batches run on workers.
+ */
+export async function runUpdateThreaded(env, plan, pool, dt) {
+    const world = env.world;
+    if (world.phase !== 'serial') {
+        throw new Error(`scheduler.update entered with world.phase === '${world.phase}', expected 'serial'`);
+    }
+    world.frameReset();
+    for (const wave of plan.waves) {
+        await runWaveThreaded(env, pool, wave, dt);
+    }
+    if (env.observerCadence === 'frame-end')
+        world.observerDrain();
+    world.flushLogs();
+    if (world.phase !== 'serial') {
+        throw new Error(`scheduler.update exited with world.phase === '${world.phase}', expected 'serial'`);
+    }
+}
+//# sourceMappingURL=update-threaded.js.map

package/dist/executor/update-threaded.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"update-threaded.js","sourceRoot":"","sources":["../../src/executor/update-threaded.ts"],"names":[],"mappings":"AAAA,qEAAqE;AACrE,+FAA+F;AAC/F,8FAA8F;AAC9F,sGAAsG;AACtG,8EAA8E;AAC9E,EAAE;AACF,yFAAyF;AACzF,wEAAwE;AACxE,kGAAkG;AAClG,oGAAoG;AACpG,4FAA4F;AAC5F,EAAE;AACF,gGAAgG;AAChG,yFAAyF;AACzF,qBAAqB;AAcrB,SAAS,mBAAmB,CAAC,GAAgB,EAAE,KAAkB,EAAE,EAAU;IAC3E,MAAM,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,QAA6B,CAAE,CAAA;IAC5D,MAAM,GAAG,GAAkB;QACzB,KAAK,EAAE,GAAG,CAAC,KAAK;QAChB,EAAE;QACF,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,WAAW,EAAqB;QAChD,KAAK,EAAE,GAAG,CAAC,aAAa,CAAC,EAAE,CAAC,EAAuB,CAAE;KACtD,CAAA;IACD,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAA;AACb,CAAC;AAED,KAAK,UAAU,eAAe,CAAC,GAAgB,EAAE,IAAqB,EAAE,IAAkB,EAAE,EAAU;IACpG,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;QAChC,mFAAmF;QACnF,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YAC1B,IAAI,KAAK,CAAC,WAAW,GAAG,CAAC;gBAAE,mBAAmB,CAAC,GAAG,EAAE,KAAK,EAAE,EAAE,CAAC,CAAA;QAChE,CAAC;QACD,oGAAoG;QACpG,kGAAkG;QAClG,uCAAuC;QACvC,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,IAAI,CAAC,CAAC,CAAA;QAC7D,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC7B,MAAM,IAAI,CAAC,QAAQ,CACjB,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,QAAQ,EAAE,CAAC,CAAC,QAAQ,EAAE,WAAW,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,EAChF,EAAE,CACH,CAAA;QACH,CAAC;IACH,CAAC;IACD,qFAAqF;IACrF,GAAG,CAAC,KAAK,CAAC,kBAAkB,EAAE,CAAA;IAC9B,IAAI,GAAG,CAAC,eAAe,KAAK,YAAY;QAAE,GAAG,CAAC,KAAK,CAAC,aAAa,EAAE,CAAA;AACrE,CAAC;AAED;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,GAAgB,EAAE,IAAkB,EAAE,IAAqB,EAAE,EAAU;IAC7G,MAAM,KAAK,GAAU,GAAG,CAAC,KAAK,CAAA;IAC9B,IAAI,KAAK,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CAAC,kDAAkD,KAAK,CAAC,KAAK,sBAAsB,CAAC,CAAA;IACtG,CAAC;IACD,KAAK,CAAC,UAAU,EAAE,CAAA;IAClB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,eAAe,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC,CAAA;IAC5C,CAAC;IACD,IAAI,GAAG,CAAC,eAAe,KAAK,WAAW;QAAE,KAAK,CAAC,aAAa,EAAE,CAAA;IAC9D,KAAK,CAAC,SAAS,EAAE,CAAA;IACjB,IAAI,KAAK,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CAAC,iDAAiD,KAAK,CAAC,KAAK,sBAAsB,CAAC,CAAA;IACrG,CAAC;AACH,CAAC"}

package/dist/executor/update.d.ts

@@ -0,0 +1,4 @@
+import type { SchedulePlan } from '../graph/index.js';
+import type { ExecutorEnv } from './run-wave.js';
+export declare function runUpdate(env: ExecutorEnv, plan: SchedulePlan, dt: number): void;
+//# sourceMappingURL=update.d.ts.map

package/dist/executor/update.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"update.d.ts","sourceRoot":"","sources":["../../src/executor/update.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,mBAAmB,CAAA;AAErD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,eAAe,CAAA;AAEhD,wBAAgB,SAAS,CAAC,GAAG,EAAE,WAAW,EAAE,IAAI,EAAE,YAAY,EAAE,EAAE,EAAE,MAAM,GAAG,IAAI,CAiBhF"}

package/dist/executor/update.js

@@ -0,0 +1,23 @@
+// The world.update(dt) frame loop (byte-identical to ). Asserts
+// world.phase === 'serial' on entry and exit: single-thread mode never leaves 'serial'.
+import { runWave } from './run-wave.js';
+export function runUpdate(env, plan, dt) {
+    const world = env.world;
+    if (world.phase !== 'serial') {
+        throw new Error(`scheduler.update entered with world.phase === '${world.phase}', expected 'serial'`);
+    }
+    // ---- 1. frame start ----
+    world.frameReset(); // advance currentTick; reset transient query lists
+    // ---- 2..4. run every wave, flushing structural + reactivity between waves ----
+    for (const wave of plan.waves) {
+        runWave(env, wave, dt);
+    }
+    // ---- 5. end-of-frame reactivity ----
+    if (env.observerCadence === 'frame-end')
+        world.observerDrain();
+    world.flushLogs(); // drain spill, schedule ring resize
+    if (world.phase !== 'serial') {
+        throw new Error(`scheduler.update exited with world.phase === '${world.phase}', expected 'serial'`);
+    }
+}
+//# sourceMappingURL=update.js.map

package/dist/executor/update.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"update.js","sourceRoot":"","sources":["../../src/executor/update.ts"],"names":[],"mappings":"AAAA,gEAAgE;AAChE,wFAAwF;AAIxF,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAA;AAGvC,MAAM,UAAU,SAAS,CAAC,GAAgB,EAAE,IAAkB,EAAE,EAAU;IACxE,MAAM,KAAK,GAAU,GAAG,CAAC,KAAK,CAAA;IAC9B,IAAI,KAAK,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CAAC,kDAAkD,KAAK,CAAC,KAAK,sBAAsB,CAAC,CAAA;IACtG,CAAC;IACD,2BAA2B;IAC3B,KAAK,CAAC,UAAU,EAAE,CAAA,CAAC,mDAAmD;IACtE,iFAAiF;IACjF,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;QAC9B,OAAO,CAAC,GAAG,EAAE,IAAI,EAAE,EAAE,CAAC,CAAA;IACxB,CAAC;IACD,uCAAuC;IACvC,IAAI,GAAG,CAAC,eAAe,KAAK,WAAW;QAAE,KAAK,CAAC,aAAa,EAAE,CAAA;IAC9D,KAAK,CAAC,SAAS,EAAE,CAAA,CAAC,oCAAoC;IACtD,IAAI,KAAK,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC7B,MAAM,IAAI,KAAK,CAAC,iDAAiD,KAAK,CAAC,KAAK,sBAAsB,CAAC,CAAA;IACrG,CAAC;AACH,CAAC"}

package/dist/graph/dag.d.ts

@@ -0,0 +1,16 @@
+import type { SystemId } from '@ecsia/schema';
+import type { SystemBox } from '../planner/index.js';
+import type { Edge } from './edges.js';
+export declare class CycleError extends Error {
+    /** The cycle as a SystemId chain `[A, B, …, A]`. */
+    readonly chain: readonly SystemId[];
+    constructor(message: string, chain: readonly SystemId[]);
+}
+export interface DAG {
+    readonly n: number;
+    /** succ[from] = list of `to` (transitively reduced). */
+    readonly succ: readonly (readonly SystemId[])[];
+}
+/** Build the transitively-reduced DAG, failing fast on any cycle. */
+export declare function buildDAG(systems: readonly SystemBox[], edges: readonly Edge[]): DAG;
+//# sourceMappingURL=dag.d.ts.map

package/dist/graph/dag.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag.d.ts","sourceRoot":"","sources":["../../src/graph/dag.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAC7C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAA;AACpD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAEtC,qBAAa,UAAW,SAAQ,KAAK;IACnC,oDAAoD;IACpD,QAAQ,CAAC,KAAK,EAAE,SAAS,QAAQ,EAAE,CAAA;gBACvB,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,QAAQ,EAAE;CAKxD;AAED,MAAM,WAAW,GAAG;IAClB,QAAQ,CAAC,CAAC,EAAE,MAAM,CAAA;IAClB,wDAAwD;IACxD,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,SAAS,QAAQ,EAAE,CAAC,EAAE,CAAA;CAChD;AAwGD,qEAAqE;AACrE,wBAAgB,QAAQ,CAAC,OAAO,EAAE,SAAS,SAAS,EAAE,EAAE,KAAK,EAAE,SAAS,IAAI,EAAE,GAAG,GAAG,CAMnF"}

package/dist/graph/dag.js

@@ -0,0 +1,118 @@
+// Conflict DAG construction: adjacency from the resolved max-weight edges, DFS
+// three-color cycle detection with NAMED-CHAIN reporting + a suggested break edge, and
+// DFS-based transitive reduction so the topological layering produces the widest possible waves.
+export class CycleError extends Error {
+    /** The cycle as a SystemId chain `[A, B, …, A]`. */
+    chain;
+    constructor(message, chain) {
+        super(message);
+        this.name = 'CycleError';
+        this.chain = chain;
+    }
+}
+function adjacency(n, edges) {
+    const succ = Array.from({ length: n }, () => []);
+    for (const e of edges)
+        succ[e.from].push(e.to);
+    return succ;
+}
+function edgeCause(edges, from, to) {
+    const fn = from;
+    const tn = to;
+    for (const e of edges) {
+        if (e.from === fn && e.to === tn)
+            return e.cause;
+    }
+    return '';
+}
+/**
+ *: a single DFS finds ANY cycle; the gray-stack gives the full chain. Throws CycleError with the
+ * named chain and a suggested `inAnyOrderWith` break edge. Fail-fast at createWorld, never at
+ * frame time.
+ */
+function detectCycle(systems, succ, edges) {
+    const n = succ.length;
+    const color = new Uint8Array(n);
+    const stack = [];
+    const dfs = (u) => {
+        const un = u;
+        color[un] = 1;
+        stack.push(u);
+        for (const v of succ[un]) {
+            const vn = v;
+            if (color[vn] === 1) {
+                // Back edge → cycle. Slice the gray stack from v to u, then close it.
+                const start = stack.findIndex((s) => s === vn);
+                const cycle = [...stack.slice(start), v];
+                throw new CycleError(reportChain(systems, edges, cycle), cycle);
+            }
+            if (color[vn] === 0)
+                dfs(v);
+        }
+        color[un] = 2;
+        stack.pop();
+    };
+    for (let i = 0; i < n; i++) {
+        if (color[i] === 0)
+            dfs(i);
+    }
+}
+function reportChain(systems, edges, cycle) {
+    const name = (id) => systems[id]?.name ?? `#${id}`;
+    const lines = ['System cycle detected:'];
+    for (let i = 0; i + 1 < cycle.length; i++) {
+        const from = cycle[i];
+        const to = cycle[i + 1];
+        const cause = edgeCause(edges, from, to);
+        lines.push(`  ${name(from)} → ${name(to)}${cause ? `   (${cause})` : ''}`);
+    }
+    // Suggest breaking the first implicit-looking edge with inAnyOrderWith.
+    const a = name(cycle[0]);
+    const b = name(cycle[1] ?? cycle[0]);
+    lines.push(`Break it by declaring inAnyOrderWith(${a}, ${b}) if the order is irrelevant, or remove one of the conflicting declarations.`);
+    return lines.join('\n');
+}
+/**: remove edge A→C if a path A→B→C exists (B ≠ C). DFS reachability excluding the direct edge. */
+function transitiveReduction(succ) {
+    const n = succ.length;
+    const reduced = Array.from({ length: n }, () => []);
+    // reachExcludingDirect(u, target): is `target` reachable from `u` WITHOUT using the direct u→target edge?
+    const reachableVia = (u, target) => {
+        const un = u;
+        const tn = target;
+        const seen = new Uint8Array(n);
+        const visit = (x) => {
+            for (const w of succ[x]) {
+                const wn = w;
+                if (x === un && wn === tn)
+                    continue; // skip ONLY the direct u→target edge
+                if (wn === tn)
+                    return true;
+                if (seen[wn] === 0) {
+                    seen[wn] = 1;
+                    if (visit(wn))
+                        return true;
+                }
+            }
+            return false;
+        };
+        return visit(un);
+    };
+    for (let u = 0; u < n; u++) {
+        for (const v of succ[u]) {
+            // Keep u→v unless v is reachable from u through an intermediary (redundant transitive edge).
+            if (!reachableVia(u, v))
+                reduced[u].push(v);
+        }
+    }
+    return reduced;
+}
+/** Build the transitively-reduced DAG, failing fast on any cycle. */
+export function buildDAG(systems, edges) {
+    const n = systems.length;
+    const succ = adjacency(n, edges);
+    detectCycle(systems, succ, edges);
+    const reduced = transitiveReduction(succ);
+    return { n, succ: reduced };
+}
+//# sourceMappingURL=dag.js.map

package/dist/graph/dag.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dag.js","sourceRoot":"","sources":["../../src/graph/dag.ts"],"names":[],"mappings":"AAAA,+EAA+E;AAC/E,uFAAuF;AACvF,iGAAiG;AAMjG,MAAM,OAAO,UAAW,SAAQ,KAAK;IACnC,oDAAoD;IAC3C,KAAK,CAAqB;IACnC,YAAY,OAAe,EAAE,KAA0B;QACrD,KAAK,CAAC,OAAO,CAAC,CAAA;QACd,IAAI,CAAC,IAAI,GAAG,YAAY,CAAA;QACxB,IAAI,CAAC,KAAK,GAAG,KAAK,CAAA;IACpB,CAAC;CACF;AAUD,SAAS,SAAS,CAAC,CAAS,EAAE,KAAsB;IAClD,MAAM,IAAI,GAAiB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAA;IAC9D,KAAK,MAAM,CAAC,IAAI,KAAK;QAAE,IAAI,CAAC,CAAC,CAAC,IAAyB,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;IACpE,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAS,SAAS,CAAC,KAAsB,EAAE,IAAc,EAAE,EAAY;IACrE,MAAM,EAAE,GAAG,IAAyB,CAAA;IACpC,MAAM,EAAE,GAAG,EAAuB,CAAA;IAClC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,IAAK,CAAC,CAAC,IAA0B,KAAK,EAAE,IAAK,CAAC,CAAC,EAAwB,KAAK,EAAE;YAAE,OAAO,CAAC,CAAC,KAAK,CAAA;IAChG,CAAC;IACD,OAAO,EAAE,CAAA;AACX,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAAC,OAA6B,EAAE,IAA2B,EAAE,KAAsB;IACrG,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IACrB,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,CAAC,CAAuB,CAAA;IACrD,MAAM,KAAK,GAAe,EAAE,CAAA;IAE5B,MAAM,GAAG,GAAG,CAAC,CAAW,EAAQ,EAAE;QAChC,MAAM,EAAE,GAAG,CAAsB,CAAA;QACjC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,CAAA;QACb,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACb,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,EAAE,CAAE,EAAE,CAAC;YAC1B,MAAM,EAAE,GAAG,CAAsB,CAAA;YACjC,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;gBACpB,sEAAsE;gBACtE,MAAM,KAAK,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAE,CAAuB,KAAK,EAAE,CAAC,CAAA;gBACrE,MAAM,KAAK,GAAG,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAA;gBACxC,MAAM,IAAI,UAAU,CAAC,WAAW,CAAC,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,EAAE,KAAK,CAAC,CAAA;YACjE,CAAC;YACD,IAAI,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC;gBAAE,GAAG,CAAC,CAAC,CAAC,CAAA;QAC7B,CAAC;QACD,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,CAAA;QACb,KAAK,CAAC,GAAG,EAAE,CAAA;IACb,CAAC,CAAA;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,IAAI,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;YAAE,GAAG,CAAC,CAAwB,CAAC,CAAA;IACnD,CAAC;AACH,CAAC;AAED,SAAS,WAAW,CAAC,OAA6B,EAAE,KAAsB,EAAE,KAA0B;IACpG,MAAM,IAAI,GAAG,CAAC,EAAY,EAAU,EAAE,CAAC,OAAO,CAAC,EAAuB,CAAC,EAAE,IAAI,IAAI,IAAI,EAAuB,EAAE,CAAA;IAC9G,MAAM,KAAK,GAAa,CAAC,wBAAwB,CAAC,CAAA;IAClD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAE,CAAA;QACtB,MAAM,EAAE,GAAG,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAA;QACxB,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,CAAC,CAAA;QACxC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;IAC5E,CAAC;IACD,wEAAwE;IACxE,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAA;IACzB,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAE,CAAC,CAAA;IACrC,KAAK,CAAC,IAAI,CACR,wCAAwC,CAAC,KAAK,CAAC,8EAA8E,CAC9H,CAAA;IACD,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;AACzB,CAAC;AAED,mGAAmG;AACnG,SAAS,mBAAmB,CAAC,IAA2B;IACtD,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAA;IACrB,MAAM,OAAO,GAAiB,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAA;IAEjE,0GAA0G;IAC1G,MAAM,YAAY,GAAG,CAAC,CAAW,EAAE,MAAgB,EAAW,EAAE;QAC9D,MAAM,EAAE,GAAG,CAAsB,CAAA;QACjC,MAAM,EAAE,GAAG,MAA2B,CAAA;QACtC,MAAM,IAAI,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,CAAA;QAC9B,MAAM,KAAK,GAAG,CAAC,CAAS,EAAW,EAAE;YACnC,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,CAAE,EAAE,CAAC;gBACzB,MAAM,EAAE,GAAG,CAAsB,CAAA;gBACjC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE;oBAAE,SAAQ,CAAC,qCAAqC;gBACzE,IAAI,EAAE,KAAK,EAAE;oBAAE,OAAO,IAAI,CAAA;gBAC1B,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;oBACnB,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAA;oBACZ,IAAI,KAAK,CAAC,EAAE,CAAC;wBAAE,OAAO,IAAI,CAAA;gBAC5B,CAAC;YACH,CAAC;YACD,OAAO,KAAK,CAAA;QACd,CAAC,CAAA;QACD,OAAO,KAAK,CAAC,EAAE,CAAC,CAAA;IAClB,CAAC,CAAA;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,CAAC,CAAE,EAAE,CAAC;YACzB,6FAA6F;YAC7F,IAAI,CAAC,YAAY,CAAC,CAAwB,EAAE,CAAC,CAAC;gBAAE,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACrE,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAA;AAChB,CAAC;AAED,qEAAqE;AACrE,MAAM,UAAU,QAAQ,CAAC,OAA6B,EAAE,KAAsB;IAC5E,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM,CAAA;IACxB,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,EAAE,KAAK,CAAC,CAAA;IAChC,WAAW,CAAC,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,CAAA;IACjC,MAAM,OAAO,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAA;IACzC,OAAO,EAAE,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,CAAA;AAC7B,CAAC"}

package/dist/graph/edges.d.ts

@@ -0,0 +1,20 @@
+import type { SystemId } from '@ecsia/schema';
+import type { AccessMaps } from '../planner/index.js';
+import type { SystemBox, SystemDef } from '../planner/index.js';
+import { EdgeWeight } from './weights.js';
+/** A resolved directed edge with the diagnostic cause(s) that produced its winning weight. */
+export interface Edge {
+    readonly from: SystemId;
+    readonly to: SystemId;
+    readonly weight: EdgeWeight;
+    /** Human-readable cause used in cycle reporting. */
+    readonly cause: string;
+}
+/**
+ * Resolve before/after declarations to SystemIds, returning a new SystemBox set with `before`/`after`
+ * populated (the lowered boxes start with empty arrays — they need the full def→id map).
+ */
+export declare function resolveOrdering(systems: readonly SystemBox[], defs: readonly SystemDef[]): SystemBox[];
+/** Build the resolved max-weight edge set (DENY-suppressed IMPLICIT removed by construction). */
+export declare function buildEdges(systems: readonly SystemBox[], defs: readonly SystemDef[], access: AccessMaps): Edge[];
+//# sourceMappingURL=edges.d.ts.map

package/dist/graph/edges.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"edges.d.ts","sourceRoot":"","sources":["../../src/graph/edges.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAe,QAAQ,EAAE,MAAM,eAAe,CAAA;AAC1D,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAA;AACrD,OAAO,KAAK,EAAgB,SAAS,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAA;AAC7E,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAA;AAEzC,8FAA8F;AAC9F,MAAM,WAAW,IAAI;IACnB,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAA;IACvB,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAA;IACrB,QAAQ,CAAC,MAAM,EAAE,UAAU,CAAA;IAC3B,oDAAoD;IACpD,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAA;CACvB;AA8BD;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,OAAO,EAAE,SAAS,SAAS,EAAE,EAC7B,IAAI,EAAE,SAAS,SAAS,EAAE,GACzB,SAAS,EAAE,CAoBb;AA8HD,iGAAiG;AACjG,wBAAgB,UAAU,CACxB,OAAO,EAAE,SAAS,SAAS,EAAE,EAC7B,IAAI,EAAE,SAAS,SAAS,EAAE,EAC1B,MAAM,EAAE,UAAU,GACjB,IAAI,EAAE,CAQR"}

package/dist/graph/edges.js

@@ -0,0 +1,181 @@
+// Conflict-edge derivation. Produces the resolved max-weight directed edge
+// set `A → B` ("A must run before B") from four sources: EXPLICIT before/after (5), DENY suppression
+// (4, removes IMPLICIT only), CLASS_HINT coarse helpers (3), and the auto IMPLICIT conflict edges (1).
+import { EdgeWeight } from './weights.js';
+function key(from, to) {
+    // Pack an ordered (from,to) pair into one number; system counts are well under 2^16.
+    return from * 0x10000 + to;
+}
+/** A DENY between A and B suppresses an IMPLICIT edge in BOTH directions. Keyed on the unordered pair. */
+function denyKey(a, b) {
+    const lo = a < b ? a : b;
+    const hi = a < b ? b : a;
+    return lo * 0x10000 + hi;
+}
+function offer(b, edge) {
+    if (edge.from === edge.to)
+        return;
+    const k = key(edge.from, edge.to);
+    const prev = b.best.get(k);
+    if (prev === undefined || edge.weight > prev.weight) {
+        b.best.set(k, edge);
+    }
+    else if (edge.weight === prev.weight && edge.cause !== prev.cause) {
+        b.best.set(k, { ...prev, cause: `${prev.cause}; ${edge.cause}` });
+    }
+}
+/**
+ * Resolve before/after declarations to SystemIds, returning a new SystemBox set with `before`/`after`
+ * populated (the lowered boxes start with empty arrays — they need the full def→id map).
+ */
+export function resolveOrdering(systems, defs) {
+    const idByDef = new Map();
+    defs.forEach((d, i) => idByDef.set(d, i));
+    const resolve = (list, owner) => {
+        if (list === undefined)
+            return [];
+        return list.map((d) => {
+            const id = idByDef.get(d);
+            if (id === undefined) {
+                throw new Error(`system '${owner}' references an unregistered system in before/after`);
+            }
+            return id;
+        });
+    };
+    return systems.map((sb) => Object.freeze({
+        ...sb,
+        before: resolve(sb.def.before, sb.name),
+        after: resolve(sb.def.after, sb.name),
+    }));
+}
+/**
+ * Collect the unordered pairs the user denied any implicit ordering between. Endpoints resolve
+ * by SystemDef identity first, then by `name` (unique per world) — name-matching tolerates the common
+ * spread-copy pattern `defineSystem({ ...a, order: [inAnyOrderWith(a, b)] })` where the registered def
+ * is a copy of the hint endpoint.
+ */
+function collectDenials(systems, defs) {
+    const idByDef = new Map();
+    const idByName = new Map();
+    defs.forEach((d, i) => {
+        idByDef.set(d, i);
+        idByName.set(d.name, i);
+    });
+    const resolve = (d) => idByDef.get(d) ?? idByName.get(d.name);
+    const denied = new Set();
+    for (const sb of systems) {
+        for (const hint of sb.def.order ?? []) {
+            if (hint.kind === 'deny') {
+                const a = resolve(hint.a);
+                const b = resolve(hint.b);
+                if (a !== undefined && b !== undefined) {
+                    denied.add(denyKey(a, b));
+                }
+            }
+        }
+    }
+    return denied;
+}
+function nameOf(systems, id) {
+    return systems[id]?.name ?? `#${id}`;
+}
+/** Does system `id` write component `c`? Tested against the packed write words. */
+function writes(systems, id, c) {
+    const words = systems[id].writeWords;
+    return (words[c >>> 5] & (1 << (c & 31))) !== 0;
+}
+/**: IMPLICIT conflict edges. Reader–reader pairs never conflict; direction = registration order. */
+function deriveImplicit(systems, access, denied, b) {
+    const allIds = new Set([...access.readers.keys(), ...access.writers.keys()]);
+    for (const c of allIds) {
+        const cn = c;
+        const W = access.writers.get(c) ?? new Set();
+        if (W.size === 0)
+            continue; // a pure reader-reader set on `c` never conflicts
+        const R = access.readers.get(c) ?? new Set();
+        const members = [...new Set([...W, ...R])];
+        for (let i = 0; i < members.length; i++) {
+            for (let j = i + 1; j < members.length; j++) {
+                const a = members[i];
+                const bb = members[j];
+                const an = a;
+                const bn = bb;
+                // At least one must WRITE `c` (a reader-reader pair drawn from R does not conflict).
+                if (!writes(systems, a, cn) && !writes(systems, bb, cn))
+                    continue;
+                if (denied.has(denyKey(an, bn)))
+                    continue;
+                const lo = an < bn ? a : bb; // earlier-registered runs first
+                const hi = an < bn ? bb : a;
+                const loVerb = writes(systems, lo, cn) ? 'writes' : 'reads';
+                const hiVerb = writes(systems, hi, cn) ? 'writes' : 'reads';
+                offer(b, {
+                    from: lo,
+                    to: hi,
+                    weight: EdgeWeight.IMPLICIT,
+                    cause: `both access component#${cn}: ${nameOf(systems, lo)} ${loVerb}, ${nameOf(systems, hi)} ${hiVerb}`,
+                });
+            }
+        }
+    }
+}
+/**: CLASS_HINT coarse helpers add weight-3 edges to all current writers/readers of `c`. */
+function applyClassHints(systems, access, b) {
+    for (const sb of systems) {
+        for (const hint of sb.def.order ?? []) {
+            if (hint.kind === 'deny')
+                continue;
+            const cid = hint.component.id;
+            if (hint.kind === 'beforeWritersOf') {
+                const writers = access.writers.get(cid);
+                if (writers === undefined)
+                    continue;
+                for (const w of writers) {
+                    offer(b, {
+                        from: sb.id,
+                        to: w,
+                        weight: EdgeWeight.CLASS_HINT,
+                        cause: `${sb.name}.beforeWritersOf(${hint.component.name})`,
+                    });
+                }
+            }
+            else {
+                const readers = access.readers.get(cid);
+                if (readers === undefined)
+                    continue;
+                for (const r of readers) {
+                    offer(b, {
+                        from: r,
+                        to: sb.id,
+                        weight: EdgeWeight.CLASS_HINT,
+                        cause: `${sb.name}.afterReadersOf(${hint.component.name})`,
+                    });
+                }
+            }
+        }
+    }
+}
+/**: EXPLICIT before/after edges (weight 5). */
+function applyExplicit(systems, b) {
+    for (const sb of systems) {
+        for (const after of sb.after) {
+            // sb runs AFTER `after` ⇒ edge after → sb
+            offer(b, { from: after, to: sb.id, weight: EdgeWeight.EXPLICIT, cause: `${sb.name}.after = [${nameOf(systems, after)}]` });
+        }
+        for (const before of sb.before) {
+            // sb runs BEFORE `before` ⇒ edge sb → before
+            offer(b, { from: sb.id, to: before, weight: EdgeWeight.EXPLICIT, cause: `${sb.name}.before = [${nameOf(systems, before)}]` });
+        }
+    }
+}
+/** Build the resolved max-weight edge set (DENY-suppressed IMPLICIT removed by construction). */
+export function buildEdges(systems, defs, access) {
+    const b = { best: new Map() };
+    const denied = collectDenials(systems, defs);
+    // Order matters only for cause-merge readability; max-weight resolution is order-independent.
+    applyExplicit(systems, b);
+    applyClassHints(systems, access, b);
+    deriveImplicit(systems, access, denied, b);
+    return [...b.best.values()];
+}
+//# sourceMappingURL=edges.js.map

package/dist/graph/edges.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"edges.js","sourceRoot":"","sources":["../../src/graph/edges.ts"],"names":[],"mappings":"AAAA,2EAA2E;AAC3E,qGAAqG;AACrG,uGAAuG;AAKvG,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAA;AAWzC,SAAS,GAAG,CAAC,IAAY,EAAE,EAAU;IACnC,qFAAqF;IACrF,OAAO,IAAI,GAAG,OAAO,GAAG,EAAE,CAAA;AAC5B,CAAC;AAED,0GAA0G;AAC1G,SAAS,OAAO,CAAC,CAAS,EAAE,CAAS;IACnC,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACxB,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACxB,OAAO,EAAE,GAAG,OAAO,GAAG,EAAE,CAAA;AAC1B,CAAC;AAOD,SAAS,KAAK,CAAC,CAAe,EAAE,IAAU;IACxC,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE;QAAE,OAAM;IACjC,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,CAAC,IAAyB,EAAE,IAAI,CAAC,EAAuB,CAAC,CAAA;IAC3E,MAAM,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAC1B,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;QACpD,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;IACrB,CAAC;SAAM,IAAI,IAAI,CAAC,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,CAAC;QACpE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,GAAG,IAAI,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,EAAE,EAAE,CAAC,CAAA;IACnE,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAC7B,OAA6B,EAC7B,IAA0B;IAE1B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAA;IAC9C,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAwB,CAAC,CAAC,CAAA;IAChE,MAAM,OAAO,GAAG,CAAC,IAAsC,EAAE,KAAa,EAAc,EAAE;QACpF,IAAI,IAAI,KAAK,SAAS;YAAE,OAAO,EAAE,CAAA;QACjC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACpB,MAAM,EAAE,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;YACzB,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;gBACrB,MAAM,IAAI,KAAK,CAAC,WAAW,KAAK,qDAAqD,CAAC,CAAA;YACxF,CAAC;YACD,OAAO,EAAE,CAAA;QACX,CAAC,CAAC,CAAA;IACJ,CAAC,CAAA;IACD,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CACxB,MAAM,CAAC,MAAM,CAAC;QACZ,GAAG,EAAE;QACL,MAAM,EAAE,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC;QACvC,KAAK,EAAE,OAAO,CAAC,EAAE,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC;KACtC,CAAC,CACH,CAAA;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAS,cAAc,CAAC,OAA6B,EAAE,IAA0B;IAC/E,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAA;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAoB,CAAA;IAC5C,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,CAAwB,CAAC,CAAA;QACxC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAwB,CAAC,CAAA;IAChD,CAAC,CAAC,CAAA;IACF,MAAM,OAAO,GAAG,CAAC,CAAY,EAAwB,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IAC9F,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAA;IAChC,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YACtC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACzB,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBACzB,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;gBACzB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;oBACvC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAsB,EAAE,CAAsB,CAAC,CAAC,CAAA;gBACrE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAS,MAAM,CAAC,OAA6B,EAAE,EAAY;IACzD,OAAO,OAAO,CAAC,EAAuB,CAAC,EAAE,IAAI,IAAI,IAAI,EAAuB,EAAE,CAAA;AAChF,CAAC;AAED,mFAAmF;AACnF,SAAS,MAAM,CAAC,OAA6B,EAAE,EAAY,EAAE,CAAS;IACpE,MAAM,KAAK,GAAG,OAAO,CAAC,EAAuB,CAAE,CAAC,UAAU,CAAA;IAC1D,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAE,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAA;AAClD,CAAC;AAED,oGAAoG;AACpG,SAAS,cAAc,CACrB,OAA6B,EAC7B,MAAkB,EAClB,MAAmB,EACnB,CAAe;IAEf,MAAM,MAAM,GAAG,IAAI,GAAG,CAAc,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,GAAG,MAAM,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;IACzF,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,MAAM,EAAE,GAAG,CAAsB,CAAA;QACjC,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,EAAY,CAAA;QACtD,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC;YAAE,SAAQ,CAAC,kDAAkD;QAC7E,MAAM,CAAC,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,EAAY,CAAA;QACtD,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAW,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAA;QACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACxC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC5C,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;gBACrB,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAE,CAAA;gBACtB,MAAM,EAAE,GAAG,CAAsB,CAAA;gBACjC,MAAM,EAAE,GAAG,EAAuB,CAAA;gBAClC,qFAAqF;gBACrF,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC;oBAAE,SAAQ;gBACjE,IAAI,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;oBAAE,SAAQ;gBACzC,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA,CAAC,gCAAgC;gBAC5D,MAAM,EAAE,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAA;gBAC3B,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAA;gBAC3D,MAAM,MAAM,GAAG,MAAM,CAAC,OAAO,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAA;gBAC3D,KAAK,CAAC,CAAC,EAAE;oBACP,IAAI,EAAE,EAAE;oBACR,EAAE,EAAE,EAAE;oBACN,MAAM,EAAE,UAAU,CAAC,QAAQ;oBAC3B,KAAK,EAAE,yBAAyB,EAAE,KAAK,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,MAAM,KAAK,MAAM,CAAC,OAAO,EAAE,EAAE,CAAC,IAAI,MAAM,EAAE;iBACzG,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,2FAA2F;AAC3F,SAAS,eAAe,CAAC,OAA6B,EAAE,MAAkB,EAAE,CAAe;IACzF,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,EAAE,CAAC;YACtC,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;gBAAE,SAAQ;YAClC,MAAM,GAAG,GAAG,IAAI,CAAC,SAAS,CAAC,EAAuB,CAAA;YAClD,IAAI,IAAI,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;gBACpC,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAA6B,CAAC,CAAA;gBACjE,IAAI,OAAO,KAAK,SAAS;oBAAE,SAAQ;gBACnC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;oBACxB,KAAK,CAAC,CAAC,EAAE;wBACP,IAAI,EAAE,EAAE,CAAC,EAAE;wBACX,EAAE,EAAE,CAAC;wBACL,MAAM,EAAE,UAAU,CAAC,UAAU;wBAC7B,KAAK,EAAE,GAAG,EAAE,CAAC,IAAI,oBAAoB,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG;qBAC5D,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,GAA6B,CAAC,CAAA;gBACjE,IAAI,OAAO,KAAK,SAAS;oBAAE,SAAQ;gBACnC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;oBACxB,KAAK,CAAC,CAAC,EAAE;wBACP,IAAI,EAAE,CAAC;wBACP,EAAE,EAAE,EAAE,CAAC,EAAE;wBACT,MAAM,EAAE,UAAU,CAAC,UAAU;wBAC7B,KAAK,EAAE,GAAG,EAAE,CAAC,IAAI,mBAAmB,IAAI,CAAC,SAAS,CAAC,IAAI,GAAG;qBAC3D,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED,+CAA+C;AAC/C,SAAS,aAAa,CAAC,OAA6B,EAAE,CAAe;IACnE,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC;YAC7B,0CAA0C;YAC1C,KAAK,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,EAAE,MAAM,EAAE,UAAU,CAAC,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,IAAI,aAAa,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,GAAG,EAAE,CAAC,CAAA;QAC5H,CAAC;QACD,KAAK,MAAM,MAAM,IAAI,EAAE,CAAC,MAAM,EAAE,CAAC;YAC/B,6CAA6C;YAC7C,KAAK,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,EAAE,CAAC,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,CAAC,QAAQ,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,IAAI,cAAc,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,EAAE,CAAC,CAAA;QAC/H,CAAC;IACH,CAAC;AACH,CAAC;AAED,iGAAiG;AACjG,MAAM,UAAU,UAAU,CACxB,OAA6B,EAC7B,IAA0B,EAC1B,MAAkB;IAElB,MAAM,CAAC,GAAiB,EAAE,IAAI,EAAE,IAAI,GAAG,EAAE,EAAE,CAAA;IAC3C,MAAM,MAAM,GAAG,cAAc,CAAC,OAAO,EAAE,IAAI,CAAC,CAAA;IAC5C,8FAA8F;IAC9F,aAAa,CAAC,OAAO,EAAE,CAAC,CAAC,CAAA;IACzB,eAAe,CAAC,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,CAAA;IACnC,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,CAAC,CAAC,CAAA;IAC1C,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAA;AAC7B,CAAC"}

package/dist/graph/index.d.ts

@@ -0,0 +1,8 @@
+export { EdgeWeight } from './weights.js';
+export { resolveOrdering, buildEdges } from './edges.js';
+export type { Edge } from './edges.js';
+export { buildDAG, CycleError } from './dag.js';
+export type { DAG } from './dag.js';
+export { buildPlan, concurrencyCompatible } from './waves.js';
+export type { SchedulePlan, ScheduleWave, SystemBatch } from './waves.js';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAA;AACzC,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,YAAY,CAAA;AACxD,YAAY,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AACtC,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,UAAU,CAAA;AAC/C,YAAY,EAAE,GAAG,EAAE,MAAM,UAAU,CAAA;AACnC,OAAO,EAAE,SAAS,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAA;AAC7D,YAAY,EAAE,YAAY,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,YAAY,CAAA"}

package/dist/graph/index.js

@@ -0,0 +1,5 @@
+export { EdgeWeight } from './weights.js';
+export { resolveOrdering, buildEdges } from './edges.js';
+export { buildDAG, CycleError } from './dag.js';
+export { buildPlan, concurrencyCompatible } from './waves.js';
+//# sourceMappingURL=index.js.map

package/dist/graph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/graph/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAA;AACzC,OAAO,EAAE,eAAe,EAAE,UAAU,EAAE,MAAM,YAAY,CAAA;AAExD,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,MAAM,UAAU,CAAA;AAE/C,OAAO,EAAE,SAAS,EAAE,qBAAqB,EAAE,MAAM,YAAY,CAAA"}

package/dist/graph/waves.d.ts

@@ -0,0 +1,30 @@
+import type { SystemId } from '@ecsia/schema';
+import type { SystemBox } from '../planner/index.js';
+import type { DAG } from './dag.js';
+export interface SystemBatch {
+    readonly systemId: SystemId;
+    /** 0..workers-1 for worker batches; -1 = main-thread slot. */
+    readonly workerIndex: number;
+}
+export interface ScheduleWave {
+    /** Sequential rounds; rounds[r] runs after rounds[r-1] completes. Members of one round run concurrently. */
+    readonly rounds: readonly (readonly SystemBatch[])[];
+    /** Sum of maxSpawnsPerWave for systems dispatched to each worker this wave (reservation sizing). */
+    readonly perWorkerSpawnHint: Uint32Array;
+}
+export interface SchedulePlan {
+    readonly waves: readonly ScheduleWave[];
+    readonly systems: readonly SystemBox[];
+    readonly accessStrideWords: number;
+    readonly workers: number;
+}
+/**
+ * Rule WAVE-CONFLICT (v1, T5): A and B are concurrency-compatible iff write-sets
+ * are disjoint AND neither writes what the other reads. Pure read–read overlap is allowed.
+ * O(accessStrideWords) per pair — never per-entity, never per-archetype. This is the single seam a v2
+ * column-level build narrows.
+ */
+export declare function concurrencyCompatible(a: SystemBox, b: SystemBox): boolean;
+/** Build the immutable SchedulePlan from the reduced DAG. */
+export declare function buildPlan(systems: readonly SystemBox[], dag: DAG, accessStrideWords: number, workers: number): SchedulePlan;
+//# sourceMappingURL=waves.d.ts.map

package/dist/graph/waves.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"waves.d.ts","sourceRoot":"","sources":["../../src/graph/waves.ts"],"names":[],"mappings":"AAKA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAC7C,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAA;AACpD,OAAO,KAAK,EAAE,GAAG,EAAE,MAAM,UAAU,CAAA;AAEnC,MAAM,WAAW,WAAW;IAC1B,QAAQ,CAAC,QAAQ,EAAE,QAAQ,CAAA;IAC3B,8DAA8D;IAC9D,QAAQ,CAAC,WAAW,EAAE,MAAM,CAAA;CAC7B;AAED,MAAM,WAAW,YAAY;IAC3B,4GAA4G;IAC5G,QAAQ,CAAC,MAAM,EAAE,SAAS,CAAC,SAAS,WAAW,EAAE,CAAC,EAAE,CAAA;IACpD,oGAAoG;IACpG,QAAQ,CAAC,kBAAkB,EAAE,WAAW,CAAA;CACzC;AAED,MAAM,WAAW,YAAY;IAC3B,QAAQ,CAAC,KAAK,EAAE,SAAS,YAAY,EAAE,CAAA;IACvC,QAAQ,CAAC,OAAO,EAAE,SAAS,SAAS,EAAE,CAAA;IACtC,QAAQ,CAAC,iBAAiB,EAAE,MAAM,CAAA;IAClC,QAAQ,CAAC,OAAO,EAAE,MAAM,CAAA;CACzB;AAED;;;;;GAKG;AACH,wBAAgB,qBAAqB,CAAC,CAAC,EAAE,SAAS,EAAE,CAAC,EAAE,SAAS,GAAG,OAAO,CAUzE;AAqGD,6DAA6D;AAC7D,wBAAgB,SAAS,CACvB,OAAO,EAAE,SAAS,SAAS,EAAE,EAC7B,GAAG,EAAE,GAAG,EACR,iBAAiB,EAAE,MAAM,EACzB,OAAO,EAAE,MAAM,GACd,YAAY,CASd"}