@adobe/ecs 0.0.0-stage → 0.1.0

package/dist/interface/registry/program.js

@@ -0,0 +1,96 @@
+import { recordItem, registeredAs } from './items.js';
+import { declarationOf, firstKeyOf, labelOf, sameDeclaration } from './names.js';
+import { orderFinalizers } from './finalizer-order.js';
+import { strataOf } from './strata.js';
+const rules = [];
+/** In the order every world runs them. */
+let finalizers = [];
+let created = 0;
+/**
+ * Records a system under the id the plugin gave its declaration. Declared again under that id the same, as a module
+ * evaluated again declares it, it's a new value of the same system. Throws for that id with another kind or declaration.
+ */
+export const claimSystem = (system, id) => {
+    recordItem(system, id, registeredAs(system, id, sameDeclaration));
+};
+/** Every rule's facts with the `within` hosts of their components, numbered for this check only. Throws for a cycle. */
+const checkStrata = (all) => {
+    const ids = new Map();
+    const keys = [];
+    const hosts = [];
+    const idOf = (symbol) => {
+        const key = firstKeyOf(symbol);
+        const existing = ids.get(key);
+        if (existing !== undefined)
+            return existing;
+        const id = keys.length;
+        ids.set(key, id);
+        keys.push(key);
+        hosts.push(-1);
+        const within = declarationOf(key)?.within;
+        if (typeof within === "symbol")
+            hosts[id] = idOf(within);
+        return id;
+    };
+    const facts = all.map((rule) => {
+        const { components, derive } = rule.declaration;
+        return { has: (components.has ?? []).map(idOf), not: (components.not ?? []).map(idOf), derives: derive.map(idOf) };
+    });
+    strataOf(facts, hosts, id => labelOf(keys[id]));
+};
+/**
+ * Records a rule under the id the plugin gave its declaration, which applies in every world, and returns it; declared
+ * again under that id the same, it's the rule already recorded. Throws for a cycle through a negation, and for that id
+ * with another kind or declaration.
+ */
+export const addRule = (rule, id) => {
+    const existing = registeredAs(rule, id, sameDeclaration);
+    const found = existing === undefined ? undefined : rules.find(other => other === existing);
+    if (found !== undefined)
+        return found;
+    checkStrata([...rules, rule]);
+    recordItem(rule, id, undefined);
+    rules.push(rule);
+    created++;
+    return rule;
+};
+/**
+ * Records a finalizer under the id the plugin gave its declaration, which applies in every world, and returns it;
+ * declared again under that id the same, it's the finalizer already recorded, which keeps its place with the new body.
+ * Throws for an order that cycles or leaves a resource conflict, and for that id with another kind or declaration.
+ */
+export const addFinalizer = (finalizer, id) => {
+    const registered = registeredAs(finalizer, id, sameDeclaration);
+    const existing = registered === undefined ? undefined : finalizers.find(other => other === registered);
+    if (existing?.kind === "finalizer" && finalizer.kind === "finalizer") {
+        existing.body = finalizer.body;
+        return existing;
+    }
+    if (existing?.kind === "changes" && finalizer.kind === "changes") {
+        existing.body = finalizer.body;
+        return existing;
+    }
+    const ordered = orderFinalizers([...finalizers, finalizer]);
+    recordItem(finalizer, id, undefined);
+    finalizers = ordered;
+    created++;
+    return finalizer;
+};
+/** Only constructors make values with a system's kind and a declaration. */
+const isDefinition = (system) => "declaration" in system && "kind" in system && (system.kind === "system" || system.kind === "render" || system.kind === "composite");
+/** A system's definition: the value a System constructor returned, or undefined for any other value. */
+export const definitionOf = (system) => isDefinition(system) ? system : undefined;
+/** A system's definition. Throws for a value no constructor returned. */
+export const requireDefinition = (system) => {
+    const definition = definitionOf(system);
+    if (definition === undefined)
+        throw new Error(`"${String(system.name)}" isn't a system a System constructor returned.`);
+    return definition;
+};
+/** Counts rules and finalizers recorded, so a world can tell when one was added since it last looked. */
+export const programVersion = () => created;
+/** The program's rules, in creation order. */
+export const programRules = () => rules;
+/** The program's finalizers, in the order every world runs them. */
+export const programFinalizers = () => finalizers;
+//# sourceMappingURL=program.js.map

package/dist/interface/registry/program.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"program.js","sourceRoot":"","sources":["../../../src/interface/registry/program.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AACtD,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AACjF,OAAO,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AACvD,OAAO,EAAE,QAAQ,EAAkB,MAAM,aAAa,CAAC;AAOvD,MAAM,KAAK,GAAW,EAAE,CAAC;AACzB,0CAA0C;AAC1C,IAAI,UAAU,GAAyB,EAAE,CAAC;AAC1C,IAAI,OAAO,GAAG,CAAC,CAAC;AAEhB;;;GAGG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,MAAkB,EAAE,EAAsB,EAAQ,EAAE;IAC5E,UAAU,CAAC,MAAM,EAAE,EAAE,EAAE,YAAY,CAAC,MAAM,EAAE,EAAE,EAAE,eAAe,CAAC,CAAC,CAAC;AACtE,CAAC,CAAC;AAEF,wHAAwH;AACxH,MAAM,WAAW,GAAG,CAAC,GAAoB,EAAQ,EAAE;IAC/C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAe,CAAC;IACnC,MAAM,IAAI,GAAU,EAAE,CAAC;IACvB,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,CAAC,MAAW,EAAU,EAAE;QACjC,MAAM,GAAG,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC;QAC/B,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9B,IAAI,QAAQ,KAAK,SAAS;YAAE,OAAO,QAAQ,CAAC;QAC5C,MAAM,EAAE,GAAG,IAAI,CAAC,MAAM,CAAC;QACvB,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACf,MAAM,MAAM,GAAG,aAAa,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC;QAC1C,IAAI,OAAO,MAAM,KAAK,QAAQ;YAAE,KAAK,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;QACzD,OAAO,EAAE,CAAC;IACd,CAAC,CAAC;IACF,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,IAAI,EAAa,EAAE;QACtC,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;QAChD,OAAO,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;IACvH,CAAC,CAAC,CAAC;IACH,QAAQ,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AACpD,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,IAAU,EAAE,EAAsB,EAAQ,EAAE;IAChE,MAAM,QAAQ,GAAG,YAAY,CAAC,IAAI,EAAE,EAAE,EAAE,eAAe,CAAC,CAAC;IACzD,MAAM,KAAK,GAAG,QAAQ,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,QAAQ,CAAC,CAAC;IAC3F,IAAI,KAAK,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACtC,WAAW,CAAC,CAAC,GAAG,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;IAC9B,UAAU,CAAC,IAAI,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;IAChC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACjB,OAAO,EAAE,CAAC;IACV,OAAO,IAAI,CAAC;AAChB,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,SAAoB,EAAE,EAAsB,EAAa,EAAE;IACpF,MAAM,UAAU,GAAG,YAAY,CAAC,SAAS,EAAE,EAAE,EAAE,eAAe,CAAC,CAAC;IAChE,MAAM,QAAQ,GAAG,UAAU,KAAK,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,KAAK,UAAU,CAAC,CAAC;IACvG,IAAI,QAAQ,EAAE,IAAI,KAAK,WAAW,IAAI,SAAS,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QACnE,QAAQ,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC;QAC/B,OAAO,QAAQ,CAAC;IACpB,CAAC;IACD,IAAI,QAAQ,EAAE,IAAI,KAAK,SAAS,IAAI,SAAS,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC/D,QAAQ,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC;QAC/B,OAAO,QAAQ,CAAC;IACpB,CAAC;IACD,MAAM,OAAO,GAAG,eAAe,CAAC,CAAC,GAAG,UAAU,EAAE,SAAS,CAAC,CAAC,CAAC;IAC5D,UAAU,CAAC,SAAS,EAAE,EAAE,EAAE,SAAS,CAAC,CAAC;IACrC,UAAU,GAAG,OAAO,CAAC;IACrB,OAAO,EAAE,CAAC;IACV,OAAO,SAAS,CAAC;AACrB,CAAC,CAAC;AAEF,4EAA4E;AAC5E,MAAM,YAAY,GAAG,CAAC,MAAc,EAAwB,EAAE,CAC1D,aAAa,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,IAAI,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,MAAM,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;AAEzI,wGAAwG;AACxG,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,MAAiC,EAA0B,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;AAErI,yEAAyE;AACzE,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,MAAiC,EAAc,EAAE;IAC/E,MAAM,UAAU,GAAG,YAAY,CAAC,MAAM,CAAC,CAAC;IACxC,IAAI,UAAU,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,iDAAiD,CAAC,CAAC;IACxH,OAAO,UAAU,CAAC;AACtB,CAAC,CAAC;AAEF,yGAAyG;AACzG,MAAM,CAAC,MAAM,cAAc,GAAG,GAAW,EAAE,CAAC,OAAO,CAAC;AAEpD,8CAA8C;AAC9C,MAAM,CAAC,MAAM,YAAY,GAAG,GAAoB,EAAE,CAAC,KAAK,CAAC;AAEzD,oEAAoE;AACpE,MAAM,CAAC,MAAM,iBAAiB,GAAG,GAAyB,EAAE,CAAC,UAAU,CAAC"}

package/dist/interface/registry/reduction.d.ts

@@ -0,0 +1,5 @@
+import type { Reduction } from '../resource/reduction.js';
+/** Every reduction operator. */
+export declare const reductionOperators: readonly Reduction[];
+/** Whether a value is a reduction operator. */
+export declare const isReduction: (value: unknown) => value is Reduction;

package/dist/interface/registry/reduction.js

@@ -0,0 +1,5 @@
+/** Every reduction operator. */
+export const reductionOperators = ["+", "*", "min", "max", "&", "|", "^"];
+/** Whether a value is a reduction operator. */
+export const isReduction = (value) => reductionOperators.some(operator => operator === value);
+//# sourceMappingURL=reduction.js.map

package/dist/interface/registry/reduction.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"reduction.js","sourceRoot":"","sources":["../../../src/interface/registry/reduction.ts"],"names":[],"mappings":"AAEA,gCAAgC;AAChC,MAAM,CAAC,MAAM,kBAAkB,GAAyB,CAAC,GAAG,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAEhG,+CAA+C;AAC/C,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,KAAc,EAAsB,EAAE,CAAC,kBAAkB,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,QAAQ,KAAK,KAAK,CAAC,CAAC"}

package/dist/interface/registry/schedule.d.ts

@@ -0,0 +1,32 @@
+import type { Definition } from '../system/definition.js';
+import type { Leaf } from '../system/leaf.js';
+type Key = symbol;
+/**
+ * Leaves in run order, grouped into tiers. Leaves in one tier have no ordering path between them. `reductions` are the
+ * resources its leaves reduce into, each with how many of them contribute. `observer` are its observer leaves, in no
+ * tier: they run after its sync point, ordered with nothing.
+ */
+export type Schedule = {
+    readonly tiers: readonly (readonly Leaf[])[];
+    readonly reductions: ReadonlyMap<Key, number>;
+    readonly observer: readonly Leaf[];
+};
+export declare const isLeaf: (system: Definition) => system is Leaf;
+/** Whether a system is an observer leaf, which runs after a sync point rather than in a tier. */
+export declare const isObserver: (system: Definition) => system is Leaf;
+type Access = {
+    readonly reads: ReadonlySet<Key>;
+    readonly writes: ReadonlySet<Key>;
+    readonly reduces: ReadonlySet<Key>;
+};
+/** The resources a leaf reduces into. */
+export declare const reducedBy: (leaf: Leaf) => readonly Key[];
+/**
+ * Reads include change filters, since they observe writers' ticks, and the key parts of indexes looked up through or
+ * ordered by, which the index is found and kept by. Presence-only lists don't conflict. Keys are each one's first
+ * symbol.
+ */
+export declare const accessOf: (leaf: Leaf) => Access;
+/** A system's schedule, created once per system. Throws on a cycle, or on two conflicting leaves with no ordering path between them. */
+export declare const scheduleOf: (system: Definition) => Schedule;
+export {};

package/dist/interface/registry/schedule.js

@@ -0,0 +1,207 @@
+import { firstItemOf, labelOfItem } from './items.js';
+import { requireDefinition } from './program.js';
+import { firstKeyOf, labelOf, sameDeclaration } from './names.js';
+import { lookupKeysOf, orderKeysOf } from './indexes.js';
+/** Throws unless each leaf's input is an object schema of named fields, and a field several declare has one schema. */
+const checkInputs = (leaves) => {
+    const fields = new Map();
+    for (const leaf of leaves) {
+        const { input } = leaf.declaration;
+        const name = labelOfItem(leaf);
+        if (input === undefined)
+            continue;
+        const schema = input;
+        if (!("type" in schema) || schema.type !== "object" || typeof schema.properties !== "object" || schema.properties === null) {
+            throw new Error(`System "${name}": input is an object schema of named fields.`);
+        }
+        for (const [field, property] of Object.entries(schema.properties)) {
+            const seen = fields.get(field);
+            if (seen === undefined)
+                fields.set(field, { schema: property, system: name });
+            else if (!sameDeclaration(seen.schema, property)) {
+                throw new Error(`Systems "${seen.system}" and "${name}" declare input field "${field}" with different schemas.`);
+            }
+        }
+    }
+};
+export const isLeaf = (system) => system.kind !== "composite";
+/** Whether a system is an observer leaf, which runs after a sync point rather than in a tier. */
+export const isObserver = (system) => system.kind !== "composite" && system.declaration.observer === true;
+/** Each system is an interval, from its start node to its end node. */
+const start = (unit) => 2 * unit;
+const end = (unit) => 2 * unit + 1;
+/**
+ * A leaf runs from its start to its end, and a composite spans its members. `after` and `before` order one system's end
+ * before another's start, and `during` places a system inside another's span. The root's own constraints are ignored,
+ * as are constraints naming systems outside it. Values of one system, as a module evaluated again makes them, are one
+ * unit, the first reached.
+ */
+const graphOf = (root) => {
+    const units = [];
+    const members = [];
+    const indexOf = new Map();
+    const visit = (system) => {
+        const first = firstItemOf(system);
+        const known = indexOf.get(first);
+        if (known !== undefined)
+            return known;
+        const unit = units.push(system) - 1;
+        indexOf.set(first, unit);
+        members[unit] = isLeaf(system) ? [] : system.declaration.systems.map(member => visit(requireDefinition(member)));
+        return unit;
+    };
+    visit(root);
+    const successors = units.flatMap(() => [new Set(), new Set()]);
+    // An observer system is ordered with nothing, so constraints naming one are ignored.
+    const resolve = (systems) => (systems ?? []).flatMap(system => {
+        const unit = indexOf.get(firstItemOf(system));
+        return unit === undefined || isObserver(units[unit]) ? [] : [unit];
+    });
+    units.forEach((system, unit) => {
+        successors[start(unit)].add(end(unit));
+        for (const member of members[unit]) {
+            successors[start(unit)].add(start(member));
+            successors[end(member)].add(end(unit));
+        }
+        if (system === root)
+            return;
+        const { before, after, during } = system.declaration;
+        for (const other of resolve(after))
+            successors[end(other)].add(start(unit));
+        for (const other of resolve(before))
+            successors[end(unit)].add(start(other));
+        for (const other of resolve(during)) {
+            successors[start(other)].add(start(unit));
+            successors[end(unit)].add(end(other));
+        }
+    });
+    return { units, successors };
+};
+/** Kahn's algorithm over nodes. Throws on a cycle. */
+const topologicalOrder = ({ units, successors }) => {
+    const incoming = successors.map(() => 0);
+    for (const next of successors)
+        for (const node of next)
+            incoming[node]++;
+    const order = [];
+    const ready = successors.map((_, node) => node).filter(node => incoming[node] === 0);
+    while (ready.length > 0) {
+        const node = ready.pop() ?? 0;
+        order.push(node);
+        for (const next of successors[node])
+            if (--incoming[next] === 0)
+                ready.push(next);
+    }
+    if (order.length < successors.length) {
+        const cyclic = units.filter((_, unit) => incoming[start(unit)] > 0 || incoming[end(unit)] > 0).map(system => `"${labelOfItem(system)}"`);
+        throw new Error(`Ordering cycle between ${cyclic.join(", ")}.`);
+    }
+    return order;
+};
+/** `reach[a]` has bit `b` set when there's a path from node `a` to node `b`. */
+const reachability = (order, successors) => {
+    const words = Math.ceil(order.length / 32);
+    const reach = order.map(() => new Uint32Array(words));
+    for (let i = order.length - 1; i >= 0; i--) {
+        const node = order[i];
+        for (const next of successors[node]) {
+            reach[node][next >>> 5] |= 1 << (next & 31);
+            for (let w = 0; w < words; w++)
+                reach[node][w] |= reach[next][w];
+        }
+    }
+    return reach;
+};
+const reaches = (reach, from, to) => (reach[from][to >>> 5] & (1 << (to & 31))) !== 0;
+/** Whether one of two systems ends before the other starts. */
+const ordered = (reach, a, b) => reaches(reach, end(a), start(b)) || reaches(reach, end(b), start(a));
+/** Each node's tier: the most leaves on any path to it, so a leaf's tier is where it starts. */
+const depthsOf = ({ units, successors }, order) => {
+    const depth = successors.map(() => 0);
+    for (const node of order) {
+        const step = node % 2 === 0 && isLeaf(units[node >>> 1]) && !isObserver(units[node >>> 1]) ? 1 : 0;
+        for (const next of successors[node])
+            depth[next] = Math.max(depth[next], depth[node] + (next === node + 1 ? step : 0));
+    }
+    return depth;
+};
+/** The resources a leaf reduces into. */
+export const reducedBy = (leaf) => {
+    const { reduce } = leaf.declaration;
+    return reduce === undefined ? [] : Object.getOwnPropertySymbols(reduce).filter(key => Reflect.get(reduce, key) !== undefined);
+};
+/**
+ * Reads include change filters, since they observe writers' ticks, and the key parts of indexes looked up through or
+ * ordered by, which the index is found and kept by. Presence-only lists don't conflict. Keys are each one's first
+ * symbol.
+ */
+export const accessOf = (leaf) => {
+    const { components, lookup, resources, up } = leaf.declaration;
+    const reads = new Set([...components?.read ?? [], ...components?.added ?? [], ...components?.changed ?? [], ...resources?.read ?? [], ...resources?.changed ?? []].map(firstKeyOf));
+    for (const name in lookup)
+        for (const key of [...lookup[name].read ?? [], ...lookupKeysOf(lookup[name])])
+            reads.add(firstKeyOf(key));
+    for (const key of orderKeysOf(leaf.declaration))
+        reads.add(firstKeyOf(key));
+    if (up !== undefined)
+        for (const key of [up.through, ...up.read ?? []])
+            reads.add(firstKeyOf(key));
+    const writes = new Set([...components?.write ?? [], ...resources?.write ?? []].map(firstKeyOf));
+    return { reads, writes, reduces: new Set(reducedBy(leaf).map(firstKeyOf)) };
+};
+/** Contributors to one resource don't conflict with each other: their fold doesn't depend on which runs first. */
+const conflictOf = (a, b) => {
+    for (const key of a.writes)
+        if (b.writes.has(key) || b.reads.has(key) || b.reduces.has(key))
+            return key;
+    for (const key of b.writes)
+        if (a.reads.has(key) || a.reduces.has(key))
+            return key;
+    return undefined;
+};
+const schedules = new WeakMap();
+/** A system's schedule, created once per system. Throws on a cycle, or on two conflicting leaves with no ordering path between them. */
+export const scheduleOf = (system) => {
+    let schedule = schedules.get(system);
+    if (schedule === undefined)
+        schedules.set(system, schedule = createSchedule(system));
+    return schedule;
+};
+/**
+ * Orders a system's leaves into tiers. Throws on a cycle, on two conflicting leaves with no ordering path between them,
+ * or on inputs that don't merge.
+ */
+const createSchedule = (system) => {
+    const graph = graphOf(system);
+    const observer = graph.units.filter(isObserver);
+    const leaves = graph.units.flatMap((unit, index) => isLeaf(unit) && !isObserver(unit) ? [{ leaf: unit, unit: index }] : []);
+    checkInputs(leaves.map(({ leaf }) => leaf));
+    const accesses = leaves.map(({ leaf }) => accessOf(leaf));
+    // Leaves that read a resource run after every leaf that reduces into it, so they read the finished fold.
+    const reductions = new Map();
+    accesses.forEach((access, contributor) => {
+        for (const key of access.reduces) {
+            reductions.set(key, (reductions.get(key) ?? 0) + 1);
+            accesses.forEach((other, reader) => {
+                if (reader !== contributor && other.reads.has(key))
+                    graph.successors[end(leaves[contributor].unit)].add(start(leaves[reader].unit));
+            });
+        }
+    });
+    const order = topologicalOrder(graph);
+    const reach = reachability(order, graph.successors);
+    for (let a = 0; a < leaves.length; a++) {
+        for (let b = a + 1; b < leaves.length; b++) {
+            const key = conflictOf(accesses[a], accesses[b]);
+            if (key !== undefined && !ordered(reach, leaves[a].unit, leaves[b].unit)) {
+                throw new Error(`Systems "${labelOfItem(leaves[a].leaf)}" and "${labelOfItem(leaves[b].leaf)}" both access "${labelOf(key)}" and one writes it; order them with before or after.`);
+            }
+        }
+    }
+    const depth = depthsOf(graph, order);
+    const tiers = [];
+    for (const { leaf, unit } of leaves)
+        (tiers[depth[start(unit)]] ??= []).push(leaf);
+    return { tiers: tiers.filter(tier => tier !== undefined), reductions, observer };
+};
+//# sourceMappingURL=schedule.js.map

package/dist/interface/registry/schedule.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schedule.js","sourceRoot":"","sources":["../../../src/interface/registry/schedule.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AACtD,OAAO,EAAE,iBAAiB,EAAE,MAAM,cAAc,CAAC;AACjD,OAAO,EAAE,UAAU,EAAE,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAClE,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AAIzD,uHAAuH;AACvH,MAAM,WAAW,GAAG,CAAC,MAAuB,EAAQ,EAAE;IAClD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAgE,CAAC;IACvF,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;QACnC,MAAM,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QAC/B,IAAI,KAAK,KAAK,SAAS;YAAE,SAAS;QAClC,MAAM,MAAM,GAAW,KAAK,CAAC;QAC7B,IAAI,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,IAAI,OAAO,MAAM,CAAC,UAAU,KAAK,QAAQ,IAAI,MAAM,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YACzH,MAAM,IAAI,KAAK,CAAC,WAAW,IAAI,+CAA+C,CAAC,CAAC;QACpF,CAAC;QACD,KAAK,MAAM,CAAC,KAAK,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;YAChE,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,IAAI,KAAK,SAAS;gBAAE,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC;iBACzE,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAC/C,MAAM,IAAI,KAAK,CAAC,YAAY,IAAI,CAAC,MAAM,UAAU,IAAI,0BAA0B,KAAK,2BAA2B,CAAC,CAAC;YACrH,CAAC;QACL,CAAC;IACL,CAAC;AACL,CAAC,CAAC;AASF,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,MAAkB,EAAkB,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,WAAW,CAAC;AAE1F,iGAAiG;AACjG,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,MAAkB,EAAkB,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,WAAW,IAAI,MAAM,CAAC,WAAW,CAAC,QAAQ,KAAK,IAAI,CAAC;AAEtI,uEAAuE;AACvE,MAAM,KAAK,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC;AACjD,MAAM,GAAG,GAAG,CAAC,IAAY,EAAU,EAAE,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC;AAInD;;;;;GAKG;AACH,MAAM,OAAO,GAAG,CAAC,IAAgB,EAAS,EAAE;IACxC,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,MAAM,OAAO,GAA0B,EAAE,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,KAAK,GAAG,CAAC,MAAkB,EAAU,EAAE;QACzC,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC;QAClC,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACjC,IAAI,KAAK,KAAK,SAAS;YAAE,OAAO,KAAK,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACpC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QACzB,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACjH,OAAO,IAAI,CAAC;IAChB,CAAC,CAAC;IACF,KAAK,CAAC,IAAI,CAAC,CAAC;IACZ,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,GAAG,EAAU,EAAE,IAAI,GAAG,EAAU,CAAC,CAAC,CAAC;IAC/E,qFAAqF;IACrF,MAAM,OAAO,GAAG,CAAC,OAAsC,EAAqB,EAAE,CAC1E,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE;QAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC;QAC9C,OAAO,IAAI,KAAK,SAAS,IAAI,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACvE,CAAC,CAAC,CAAC;IACP,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,IAAI,EAAE,EAAE;QAC3B,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACvC,KAAK,MAAM,MAAM,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YACjC,UAAU,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;YAC3C,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QAC3C,CAAC;QACD,IAAI,MAAM,KAAK,IAAI;YAAE,OAAO;QAC5B,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,CAAC,WAAW,CAAC;QACrD,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,KAAK,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;QAC5E,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC;YAAE,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7E,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAClC,UAAU,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC;YAC1C,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;QAC1C,CAAC;IACL,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;AACjC,CAAC,CAAC;AAEF,sDAAsD;AACtD,MAAM,gBAAgB,GAAG,CAAC,EAAE,KAAK,EAAE,UAAU,EAAS,EAAY,EAAE;IAChE,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,UAAU;QAAE,KAAK,MAAM,IAAI,IAAI,IAAI;YAAE,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;IACzE,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IACrF,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QAC9B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC;YAAE,IAAI,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtF,CAAC;IACD,IAAI,KAAK,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC;QACnC,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,IAAI,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QACzI,MAAM,IAAI,KAAK,CAAC,0BAA0B,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACpE,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF,gFAAgF;AAChF,MAAM,YAAY,GAAG,CAAC,KAAwB,EAAE,UAAkC,EAAiB,EAAE;IACjG,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,EAAE,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,IAAI,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC;IACtD,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,CAAC;YAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACrE,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF,MAAM,OAAO,GAAG,CAAC,KAA6B,EAAE,IAAY,EAAE,EAAU,EAAW,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;AAEvI,+DAA+D;AAC/D,MAAM,OAAO,GAAG,CAAC,KAA6B,EAAE,CAAS,EAAE,CAAS,EAAW,EAAE,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AAEvJ,gGAAgG;AAChG,MAAM,QAAQ,GAAG,CAAC,EAAE,KAAK,EAAE,UAAU,EAAS,EAAE,KAAwB,EAAY,EAAE;IAClF,MAAM,KAAK,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnG,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3H,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAIF,yCAAyC;AACzC,MAAM,CAAC,MAAM,SAAS,GAAG,CAAC,IAAU,EAAkB,EAAE;IACpD,MAAM,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;IACpC,OAAO,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,qBAAqB,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,KAAK,SAAS,CAAC,CAAC;AAClI,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,IAAU,EAAU,EAAE;IAC3C,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,SAAS,EAAE,EAAE,EAAE,GAAG,IAAI,CAAC,WAAW,CAAC;IAC/D,MAAM,KAAK,GAAG,IAAI,GAAG,CAAM,CAAC,GAAG,UAAU,EAAE,IAAI,IAAI,EAAE,EAAE,GAAG,UAAU,EAAE,KAAK,IAAI,EAAE,EAAE,GAAG,UAAU,EAAE,OAAO,IAAI,EAAE,EAAE,GAAG,SAAS,EAAE,IAAI,IAAI,EAAE,EAAE,GAAG,SAAS,EAAE,OAAO,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;IACzL,KAAK,MAAM,IAAI,IAAI,MAAM;QAAE,KAAK,MAAM,GAAG,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,IAAI,EAAE,EAAE,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;IACrI,KAAK,MAAM,GAAG,IAAI,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC;QAAE,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5E,IAAI,EAAE,KAAK,SAAS;QAAE,KAAK,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,GAAG,EAAE,CAAC,IAAI,IAAI,EAAE,CAAC;YAAE,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;IACnG,MAAM,MAAM,GAAG,IAAI,GAAG,CAAM,CAAC,GAAG,UAAU,EAAE,KAAK,IAAI,EAAE,EAAE,GAAG,SAAS,EAAE,KAAK,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC;IACrG,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,IAAI,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,EAAE,CAAC;AAChF,CAAC,CAAC;AAEF,kHAAkH;AAClH,MAAM,UAAU,GAAG,CAAC,CAAS,EAAE,CAAS,EAAmB,EAAE;IACzD,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,MAAM;QAAE,IAAI,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,GAAG,CAAC;IACxG,KAAK,MAAM,GAAG,IAAI,CAAC,CAAC,MAAM;QAAE,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,GAAG,CAAC;IACnF,OAAO,SAAS,CAAC;AACrB,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,IAAI,OAAO,EAAwB,CAAC;AAEtD,wIAAwI;AACxI,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,MAAkB,EAAY,EAAE;IACvD,IAAI,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACrC,IAAI,QAAQ,KAAK,SAAS;QAAE,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,QAAQ,GAAG,cAAc,CAAC,MAAM,CAAC,CAAC,CAAC;IACrF,OAAO,QAAQ,CAAC;AACpB,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,cAAc,GAAG,CAAC,MAAkB,EAAY,EAAE;IACpD,MAAM,KAAK,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC;IAC9B,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAChD,MAAM,MAAM,GAAG,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAC5H,WAAW,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;IAC5C,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1D,yGAAyG;IACzG,MAAM,UAAU,GAAG,IAAI,GAAG,EAAe,CAAC;IAC1C,QAAQ,CAAC,OAAO,CAAC,CAAC,MAAM,EAAE,WAAW,EAAE,EAAE;QACrC,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YAC/B,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACpD,QAAQ,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;gBAC/B,IAAI,MAAM,KAAK,WAAW,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;YACxI,CAAC,CAAC,CAAC;QACP,CAAC;IACL,CAAC,CAAC,CAAC;IACH,MAAM,KAAK,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IACtC,MAAM,KAAK,GAAG,YAAY,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;IACpD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACrC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACzC,MAAM,GAAG,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC;YACjD,IAAI,GAAG,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvE,MAAM,IAAI,KAAK,CAAC,YAAY,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,kBAAkB,OAAO,CAAC,GAAG,CAAC,uDAAuD,CAAC,CAAC;YACvL,CAAC;QACL,CAAC;IACL,CAAC;IACD,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;IACrC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,MAAM;QAAE,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACnF,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,KAAK,SAAS,CAAC,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC;AACrF,CAAC,CAAC"}

package/dist/interface/registry/schemas.d.ts

@@ -0,0 +1,13 @@
+import type { Schema } from '../schema/schema.js';
+/** Whether a schema describes a struct: numbers, booleans, entities, fixed-length tuples and structs of those. */
+export declare const isStruct: (schema: Schema) => boolean;
+/** Whether a schema describes a string: any string, a string `const`, or a union of those, with `null` or without. */
+export declare const isString: (schema: Schema) => boolean;
+/** Whether a struct schema has a boolean leaf. */
+export declare const hasBoolean: (schema: Schema) => boolean;
+/** Whether a schema accepts `null`, so a value of it may start there. */
+export declare const allowsNull: (schema: Schema) => boolean;
+/** Whether a schema is an entity's. */
+export declare const isEntity: (schema: Schema) => boolean;
+/** Whether a schema accepts `null` or `false`, so a system can run on the condition of a value of it. */
+export declare const conditional: (schema: Schema) => boolean;

package/dist/interface/registry/schemas.js

@@ -0,0 +1,57 @@
+/** Whether a constant is a struct's value: numbers and booleans, in fixed arrays and objects. */
+const isStructValue = (value) => typeof value === "number" || typeof value === "boolean"
+    || (Array.isArray(value) ? value.every(isStructValue) : typeof value === "object" && value !== null && Object.values(value).every(isStructValue));
+/** Whether a schema describes a struct: numbers, booleans, entities, fixed-length tuples and structs of those. */
+export const isStruct = (schema) => {
+    if ("const" in schema)
+        return isStructValue(schema.const);
+    if (!("type" in schema))
+        return false;
+    switch (schema.type) {
+        case "number":
+        case "integer":
+        case "boolean":
+            return true;
+        case "array":
+            return schema.minItems !== undefined && schema.minItems === schema.maxItems && isStruct(schema.items);
+        case "object": {
+            const { required, properties } = schema;
+            const names = Object.keys(properties);
+            return (required === undefined || names.every(name => required.includes(name))) && names.every(name => isStruct(properties[name]));
+        }
+        default:
+            return false;
+    }
+};
+const isNull = (schema) => ("type" in schema && schema.type === "null") || ("const" in schema && schema.const === null);
+/** Whether a schema describes a string: any string, a string `const`, or a union of those, with `null` or without. */
+export const isString = (schema) => {
+    if ("const" in schema)
+        return typeof schema.const === "string";
+    if ("anyOf" in schema)
+        return schema.anyOf.some(isString) && schema.anyOf.every(member => isString(member) || isNull(member));
+    return "type" in schema && schema.type === "string";
+};
+const hasBooleanValue = (value) => typeof value === "boolean" || (typeof value === "object" && value !== null && Object.values(value).some(hasBooleanValue));
+/** Whether a struct schema has a boolean leaf. */
+export const hasBoolean = (schema) => {
+    if ("const" in schema)
+        return hasBooleanValue(schema.const);
+    if (!("type" in schema))
+        return false;
+    if (schema.type === "boolean")
+        return true;
+    if (schema.type === "array")
+        return hasBoolean(schema.items);
+    if (schema.type === "object")
+        return Object.values(schema.properties).some(hasBoolean);
+    return false;
+};
+/** Whether a schema accepts `null`, so a value of it may start there. */
+export const allowsNull = (schema) => ("type" in schema && schema.type === "null") || ("const" in schema && schema.const === null) || ("anyOf" in schema && schema.anyOf.some(allowsNull));
+/** Whether a schema is an entity's. */
+export const isEntity = (schema) => "format" in schema && schema.format === "entity";
+/** Whether a schema accepts `null` or `false`, so a system can run on the condition of a value of it. */
+export const conditional = (schema) => allowsNull(schema) || ("type" in schema && schema.type === "boolean") || ("const" in schema && schema.const === false)
+    || ("anyOf" in schema && schema.anyOf.some(conditional));
+//# sourceMappingURL=schemas.js.map

package/dist/interface/registry/schemas.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schemas.js","sourceRoot":"","sources":["../../../src/interface/registry/schemas.ts"],"names":[],"mappings":"AAEA,iGAAiG;AACjG,MAAM,aAAa,GAAG,CAAC,KAAc,EAAW,EAAE,CAC9C,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,SAAS;OACpD,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC;AAEtJ,kHAAkH;AAClH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,MAAc,EAAW,EAAE;IAChD,IAAI,OAAO,IAAI,MAAM;QAAE,OAAO,aAAa,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC1D,IAAI,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC;QAAE,OAAO,KAAK,CAAC;IACtC,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ,CAAC;QACd,KAAK,SAAS,CAAC;QACf,KAAK,SAAS;YACV,OAAO,IAAI,CAAC;QAChB,KAAK,OAAO;YACR,OAAO,MAAM,CAAC,QAAQ,KAAK,SAAS,IAAI,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ,IAAI,QAAQ,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC1G,KAAK,QAAQ,CAAC,CAAC,CAAC;YACZ,MAAM,EAAE,QAAQ,EAAE,UAAU,EAAE,GAAG,MAAM,CAAC;YACxC,MAAM,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YACtC,OAAO,CAAC,QAAQ,KAAK,SAAS,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACvI,CAAC;QACD;YACI,OAAO,KAAK,CAAC;IACrB,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,MAAM,GAAG,CAAC,MAAc,EAAW,EAAE,CAAC,CAAC,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,OAAO,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC;AAEzI,sHAAsH;AACtH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,MAAc,EAAW,EAAE;IAChD,IAAI,OAAO,IAAI,MAAM;QAAE,OAAO,OAAO,MAAM,CAAC,KAAK,KAAK,QAAQ,CAAC;IAC/D,IAAI,OAAO,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC;IAC9H,OAAO,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC;AACxD,CAAC,CAAC;AAEF,MAAM,eAAe,GAAG,CAAC,KAAc,EAAW,EAAE,CAChD,OAAO,KAAK,KAAK,SAAS,IAAI,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,eAAe,CAAC,CAAC,CAAC;AAE9H,kDAAkD;AAClD,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,MAAc,EAAW,EAAE;IAClD,IAAI,OAAO,IAAI,MAAM;QAAE,OAAO,eAAe,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5D,IAAI,CAAC,CAAC,MAAM,IAAI,MAAM,CAAC;QAAE,OAAO,KAAK,CAAC;IACtC,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAC3C,IAAI,MAAM,CAAC,IAAI,KAAK,OAAO;QAAE,OAAO,UAAU,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC7D,IAAI,MAAM,CAAC,IAAI,KAAK,QAAQ;QAAE,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACvF,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF,yEAAyE;AACzE,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,MAAc,EAAW,EAAE,CAClD,CAAC,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,OAAO,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,KAAK,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;AAEzJ,uCAAuC;AACvC,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,MAAc,EAAW,EAAE,CAAC,QAAQ,IAAI,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,QAAQ,CAAC;AAEtG,yGAAyG;AACzG,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,MAAc,EAAW,EAAE,CACnD,UAAU,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,IAAI,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,CAAC,OAAO,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,KAAK,KAAK,CAAC;OACnH,CAAC,OAAO,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC"}

package/dist/interface/registry/strata.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Structural derivation: which components an archetype's entities have once rules and `within` are applied.
+ * Datalog with stratified negation over the components each entity has. A rule adds the components it derives where
+ * its query matches; a component declared within a host stays only while the host is present. Each stratum is a least
+ * fixed point, evaluated after every stratum it depends on, so the result is a pure function of the archetype.
+ */
+/** A rule as component ids. */
+export type RuleFacts = {
+    readonly has: readonly number[];
+    readonly not: readonly number[];
+    readonly derives: readonly number[];
+};
+/** Strata in evaluation order: the rules deriving into each, with only that stratum's components, and its `within` dependents. */
+export type Strata = readonly {
+    readonly rules: readonly {
+        readonly has: readonly number[];
+        readonly not: readonly number[];
+        readonly derives: readonly number[];
+    }[];
+    readonly within: readonly {
+        readonly dependent: number;
+        readonly host: number;
+    }[];
+}[];
+/**
+ * Orders rules and `within` declarations into strata. Throws for a cycle through a negation, which could oscillate,
+ * and for a cycle through `within`. `hosts[id]` is the host of a component declared within one, or -1.
+ */
+export declare const strataOf: (rules: readonly RuleFacts[], hosts: readonly number[], nameOf: (id: number) => string) => Strata;

package/dist/interface/registry/strata.js

@@ -0,0 +1,94 @@
+/**
+ * Structural derivation: which components an archetype's entities have once rules and `within` are applied.
+ * Datalog with stratified negation over the components each entity has. A rule adds the components it derives where
+ * its query matches; a component declared within a host stays only while the host is present. Each stratum is a least
+ * fixed point, evaluated after every stratum it depends on, so the result is a pure function of the archetype.
+ */
+/**
+ * Orders rules and `within` declarations into strata. Throws for a cycle through a negation, which could oscillate,
+ * and for a cycle through `within`. `hosts[id]` is the host of a component declared within one, or -1.
+ */
+export const strataOf = (rules, hosts, nameOf) => {
+    const edges = new Map();
+    const nodes = new Set();
+    const edge = (from, to, negative, within) => {
+        nodes.add(from);
+        nodes.add(to);
+        let list = edges.get(from);
+        if (list === undefined)
+            edges.set(from, list = []);
+        list.push({ to, negative, within });
+    };
+    for (const rule of rules) {
+        for (const derived of rule.derives) {
+            for (const id of rule.has)
+                edge(id, derived, false, false);
+            for (const id of rule.not)
+                edge(id, derived, true, false);
+            nodes.add(derived);
+        }
+    }
+    hosts.forEach((host, dependent) => { if (host >= 0)
+        edge(host, dependent, false, true); });
+    // Tarjan's algorithm: each component is emitted after every component it reaches, so dependents come out first.
+    const index = new Map();
+    const low = new Map();
+    const stack = [];
+    const onStack = new Set();
+    const components = [];
+    let counter = 0;
+    const visit = (node) => {
+        index.set(node, counter);
+        low.set(node, counter);
+        counter++;
+        stack.push(node);
+        onStack.add(node);
+        for (const { to } of edges.get(node) ?? []) {
+            if (!index.has(to)) {
+                visit(to);
+                low.set(node, Math.min(low.get(node) ?? 0, low.get(to) ?? 0));
+            }
+            else if (onStack.has(to))
+                low.set(node, Math.min(low.get(node) ?? 0, index.get(to) ?? 0));
+        }
+        if (low.get(node) !== index.get(node))
+            return;
+        const component = [];
+        for (;;) {
+            const member = stack.pop();
+            if (member === undefined)
+                break;
+            onStack.delete(member);
+            component.push(member);
+            if (member === node)
+                break;
+        }
+        components.push(component);
+    };
+    for (const node of nodes)
+        if (!index.has(node))
+            visit(node);
+    components.reverse();
+    return components.map(members => {
+        const inside = new Set(members);
+        for (const member of members) {
+            for (const { to, negative, within } of edges.get(member) ?? []) {
+                if (!inside.has(to))
+                    continue;
+                const cycle = members.map(nameOf).sort().join(", ");
+                if (negative)
+                    throw new Error(`Rules derive in a cycle through a negation, which could oscillate: ${cycle}.`);
+                if (within)
+                    throw new Error(`Components are within each other in a cycle: ${cycle}.`);
+            }
+        }
+        return {
+            rules: rules.flatMap(rule => {
+                const derives = rule.derives.filter(id => inside.has(id));
+                return derives.length === 0 ? [] : [{ has: rule.has, not: rule.not, derives }];
+            }),
+            within: members.flatMap(dependent => (hosts[dependent] ?? -1) >= 0 ? [{ dependent, host: hosts[dependent] ?? -1 }] : []),
+        };
+    });
+};
+//# sourceMappingURL=strata.js.map

package/dist/interface/registry/strata.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"strata.js","sourceRoot":"","sources":["../../../src/interface/registry/strata.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAaH;;;GAGG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,KAA2B,EAAE,KAAwB,EAAE,MAA8B,EAAU,EAAE;IACtH,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,MAAM,IAAI,GAAG,CAAC,IAAY,EAAE,EAAU,EAAE,QAAiB,EAAE,MAAe,EAAQ,EAAE;QAChF,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAChB,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACd,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC3B,IAAI,IAAI,KAAK,SAAS;YAAE,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;QACnD,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC,CAAC;IACxC,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,KAAK,MAAM,OAAO,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,GAAG;gBAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YAC3D,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,GAAG;gBAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;YAC1D,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACvB,CAAC;IACL,CAAC;IACD,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,SAAS,EAAE,EAAE,GAAG,IAAI,IAAI,IAAI,CAAC;QAAE,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3F,gHAAgH;IAChH,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,UAAU,GAAe,EAAE,CAAC;IAClC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,MAAM,KAAK,GAAG,CAAC,IAAY,EAAQ,EAAE;QACjC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACzB,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;QACvB,OAAO,EAAE,CAAC;QACV,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBACjB,KAAK,CAAC,EAAE,CAAC,CAAC;gBACV,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAClE,CAAC;iBACI,IAAI,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9F,CAAC;QACD,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,OAAO;QAC9C,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,SAAS,CAAC;YACN,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YAC3B,IAAI,MAAM,KAAK,SAAS;gBAAE,MAAM;YAChC,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YACvB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACvB,IAAI,MAAM,KAAK,IAAI;gBAAE,MAAM;QAC/B,CAAC;QACD,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAC/B,CAAC,CAAC;IACF,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,CAAC;IAC5D,UAAU,CAAC,OAAO,EAAE,CAAC;IACrB,OAAO,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE;QAC5B,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;QAChC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC3B,KAAK,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,IAAI,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;gBAC7D,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAS;gBAC9B,MAAM,KAAK,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpD,IAAI,QAAQ;oBAAE,MAAM,IAAI,KAAK,CAAC,sEAAsE,KAAK,GAAG,CAAC,CAAC;gBAC9G,IAAI,MAAM;oBAAE,MAAM,IAAI,KAAK,CAAC,gDAAgD,KAAK,GAAG,CAAC,CAAC;YAC1F,CAAC;QACL,CAAC;QACD,OAAO;YACH,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE;gBACxB,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;gBAC1D,OAAO,OAAO,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,EAAE,OAAO,EAAE,CAAC,CAAC;YACnF,CAAC,CAAC;YACF,MAAM,EAAE,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;SAC3H,CAAC;IACN,CAAC,CAAC,CAAC;AACP,CAAC,CAAC"}

package/dist/interface/registry/threads.d.ts

@@ -0,0 +1,34 @@
+type Key = symbol;
+type Lists = {
+    readonly read?: readonly Key[];
+    readonly write?: readonly Key[];
+    readonly added?: readonly Key[];
+    readonly changed?: readonly Key[];
+    readonly is?: readonly Key[];
+};
+/**
+ * What places a system or finalizer: the names it reads, writes or filters on by change, but not `has` and `not`, and
+ * the key parts of the indexes it looks up through or orders its rows by.
+ */
+export type Placed = {
+    readonly components?: Lists;
+    readonly lookup?: {
+        readonly [name: string]: {
+            readonly read?: readonly Key[];
+            readonly index?: unknown;
+        };
+    };
+    readonly up?: {
+        readonly read?: readonly Key[];
+    };
+    readonly order?: unknown;
+    readonly resources?: Lists;
+};
+/** Throws unless each key is registered as `kind`. */
+export declare const requireRegistered: (what: "System" | "Finalizer", name: string, kind: "component" | "resource", keys: readonly Key[] | undefined) => void;
+/**
+ * The thread a system or finalizer runs on: the one its object components and resources live on, or null when it uses
+ * none. Throws when they live on different threads, or a name it's placed by isn't registered as its kind.
+ */
+export declare const threadOf: (declaration: Placed, what: "System" | "Finalizer", name: string) => string | null;
+export {};