@adobe/ecs 0.0.0-stage → 0.2.0

package/dist/interface/registry/schemas.js

@@ -0,0 +1,122 @@
+/** 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));
+/** The values of a union of number constants, which is stored as a number, or null for any other schema. */
+export const numberConstants = (schema) => {
+    if (!("anyOf" in schema) || schema.anyOf.length === 0)
+        return null;
+    const values = [];
+    for (const option of schema.anyOf) {
+        if (!("const" in option) || typeof option.const !== "number")
+            return null;
+        values.push(option.const);
+    }
+    return values;
+};
+/** 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 (numberConstants(schema) !== null)
+        return true;
+    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 constant is comparable data: numbers, booleans, strings, and arrays and plain objects of those. */
+const isComparableValue = (value) => typeof value === "number" || typeof value === "boolean" || typeof value === "string"
+    || (Array.isArray(value) ? value.every(isComparableValue) : typeof value === "object" && value !== null && Object.values(value).every(isComparableValue));
+/**
+ * Whether a schema describes comparable data, which a shared component holds: numbers, booleans, strings, and arrays
+ * and objects of those, compared by structure. Not `null`, sets or maps.
+ */
+export const isComparable = (schema) => {
+    if ("const" in schema)
+        return isComparableValue(schema.const);
+    if ("anyOf" in schema)
+        return schema.anyOf.length > 0 && schema.anyOf.every(isComparable);
+    if ("allOf" in schema)
+        return schema.allOf.length > 0 && schema.allOf.every(isComparable);
+    switch (schema.type) {
+        case "number":
+        case "integer":
+        case "boolean":
+        case "string": return true;
+        case "array": return isComparable(schema.items);
+        case "object": return Object.values(schema.properties).every(isComparable);
+        default: return false;
+    }
+};
+/** 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));
+/** Whether `value` is one of `schema`'s values, as a default must be: its type, length, range and fields. */
+export const matchesSchema = (schema, value) => {
+    if ("anyOf" in schema)
+        return schema.anyOf.some(member => matchesSchema(member, value));
+    if ("allOf" in schema)
+        return schema.allOf.every(member => matchesSchema(member, value));
+    if ("const" in schema)
+        return Object.is(schema.const, value) || JSON.stringify(schema.const) === JSON.stringify(value);
+    switch (schema.type) {
+        case "null": return value === null;
+        case "boolean": return typeof value === "boolean";
+        case "string": return typeof value === "string" && value.length >= (schema.minLength ?? 0) && value.length <= (schema.maxLength ?? Infinity);
+        case "number": return typeof value === "number" && (Number.isNaN(value) || (value >= (schema.minimum ?? -Infinity) && value <= (schema.maximum ?? Infinity)));
+        case "integer": return typeof value === "number" && Number.isInteger(value) && ("format" in schema || (value >= (schema.minimum ?? -Infinity) && value <= (schema.maximum ?? Infinity)));
+        case "array": return Array.isArray(value) && value.length >= (schema.minItems ?? 0) && value.length <= (schema.maxItems ?? Infinity) && value.every(item => matchesSchema(schema.items, item));
+        case "set": return value instanceof Set;
+        case "map": return value instanceof Map;
+        case "object": {
+            if (typeof value !== "object" || value === null || Array.isArray(value))
+                return false;
+            const required = schema.required ?? Object.keys(schema.properties);
+            return Object.entries(value).every(([field, item]) => field in schema.properties && matchesSchema(schema.properties[field] ?? { allOf: [] }, item))
+                && required.every(field => field in value);
+        }
+        default: return false;
+    }
+};
+//# 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":"AAGA,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,4GAA4G;AAC5G,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,MAAc,EAA4B,EAAE;IACxE,IAAI,CAAC,CAAC,OAAO,IAAI,MAAM,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACnE,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;QAChC,IAAI,CAAC,CAAC,OAAO,IAAI,MAAM,CAAC,IAAI,OAAO,MAAM,CAAC,KAAK,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC;QAC1E,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC9B,CAAC;IACD,OAAO,MAAM,CAAC;AAClB,CAAC,CAAC;AAEF,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,eAAe,CAAC,MAAM,CAAC,KAAK,IAAI;QAAE,OAAO,IAAI,CAAC;IAClD,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,gHAAgH;AAChH,MAAM,iBAAiB,GAAG,CAAC,KAAc,EAAW,EAAE,CAClD,OAAO,KAAK,KAAK,QAAQ,IAAI,OAAO,KAAK,KAAK,SAAS,IAAI,OAAO,KAAK,KAAK,QAAQ;OACjF,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,iBAAiB,CAAC,CAAC,CAAC;AAE9J;;;GAGG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,MAAc,EAAW,EAAE;IACpD,IAAI,OAAO,IAAI,MAAM;QAAE,OAAO,iBAAiB,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC9D,IAAI,OAAO,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IAC1F,IAAI,OAAO,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;IAC1F,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,QAAQ,CAAC;QAAC,KAAK,SAAS,CAAC;QAAC,KAAK,SAAS,CAAC;QAAC,KAAK,QAAQ,CAAC,CAAC,OAAO,IAAI,CAAC;QAC1E,KAAK,OAAO,CAAC,CAAC,OAAO,YAAY,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAChD,KAAK,QAAQ,CAAC,CAAC,OAAO,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAC3E,OAAO,CAAC,CAAC,OAAO,KAAK,CAAC;IAC1B,CAAC;AACL,CAAC,CAAC;AAEF,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;AAE7D,6GAA6G;AAC7G,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,MAAc,EAAE,KAAc,EAAW,EAAE;IACrE,IAAI,OAAO,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;IACxF,IAAI,OAAO,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,aAAa,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;IACzF,IAAI,OAAO,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC,EAAE,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;IACvH,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,MAAM,CAAC,CAAC,OAAO,KAAK,KAAK,IAAI,CAAC;QACnC,KAAK,SAAS,CAAC,CAAC,OAAO,OAAO,KAAK,KAAK,SAAS,CAAC;QAClD,KAAK,QAAQ,CAAC,CAAC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,SAAS,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,SAAS,IAAI,QAAQ,CAAC,CAAC;QAC7I,KAAK,QAAQ,CAAC,CAAC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC9J,KAAK,SAAS,CAAC,CAAC,OAAO,OAAO,KAAK,KAAK,QAAQ,IAAI,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,QAAQ,IAAI,MAAM,IAAI,CAAC,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,KAAK,IAAI,CAAC,MAAM,CAAC,OAAO,IAAI,QAAQ,CAAC,CAAC,CAAC,CAAC;QACzL,KAAK,OAAO,CAAC,CAAC,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,IAAI,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,QAAQ,IAAI,QAAQ,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,MAAM,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;QAC/L,KAAK,KAAK,CAAC,CAAC,OAAO,KAAK,YAAY,GAAG,CAAC;QACxC,KAAK,KAAK,CAAC,CAAC,OAAO,KAAK,YAAY,GAAG,CAAC;QACxC,KAAK,QAAQ,CAAC,CAAC,CAAC;YACZ,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;gBAAE,OAAO,KAAK,CAAC;YACtF,MAAM,QAAQ,GAAG,MAAM,CAAC,QAAQ,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;YACnE,OAAO,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC,KAAK,IAAI,MAAM,CAAC,UAAU,IAAI,aAAa,CAAC,MAAM,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;mBAC5I,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,IAAI,KAAK,CAAC,CAAC;QACnD,CAAC;QACD,OAAO,CAAC,CAAC,OAAO,KAAK,CAAC;IAC1B,CAAC;AACL,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,95 @@
+// © 2026 Adobe. MIT License. See /LICENSE for details.
+/**
+ * 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,uDAAuD;AACvD;;;;;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 {};

package/dist/interface/registry/threads.js

@@ -0,0 +1,53 @@
+// © 2026 Adobe. MIT License. See /LICENSE for details.
+import { threadOfDeclaration } from './declarations.js';
+import { lookupKeysOf, orderKeysOf } from './indexes.js';
+import { declarationOf, kindOf, labelOf, whyUnregistered } from './names.js';
+/** Throws unless each key is registered as `kind`. */
+export const requireRegistered = (what, name, kind, keys) => {
+    for (const key of keys ?? []) {
+        if (declarationOf(key) === undefined || kindOf(key) !== kind) {
+            throw new Error(`${what} "${name}" uses ${kind} "${labelOf(key)}", which isn't a registered ${kind}: ${whyUnregistered(key)}.`);
+        }
+    }
+};
+/**
+ * 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 const threadOf = (declaration, what, name) => {
+    /** By thread, the labels of the keys placing it there. */
+    const threads = new Map();
+    const add = (kind, keys) => {
+        requireRegistered(what, name, kind, keys);
+        for (const key of keys ?? []) {
+            const found = declarationOf(key);
+            const thread = found === undefined ? null : threadOfDeclaration(found);
+            if (thread === null)
+                continue;
+            const labels = threads.get(thread) ?? new Set();
+            labels.add(`"${labelOf(key)}"`);
+            threads.set(thread, labels);
+        }
+    };
+    const { components, lookup, up, resources } = declaration;
+    add("component", components?.read);
+    add("component", components?.write);
+    add("component", components?.added);
+    add("component", components?.changed);
+    for (const name in lookup) {
+        add("component", lookup[name].read);
+        add("component", lookupKeysOf(lookup[name]));
+    }
+    add("component", up?.read);
+    add("component", orderKeysOf(declaration));
+    add("resource", resources?.read);
+    add("resource", resources?.write);
+    add("resource", resources?.changed);
+    add("resource", resources?.is);
+    if (threads.size > 1) {
+        const placed = [...threads].map(([thread, labels]) => `${[...labels].join(", ")} on "${thread}"`).join(" and ");
+        throw new Error(`${what} "${name}" uses ${placed}; its object components and resources live on one thread.`);
+    }
+    return threads.keys().next().value ?? null;
+};
+//# sourceMappingURL=threads.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"threads.js","sourceRoot":"","sources":["../../../src/interface/registry/threads.ts"],"names":[],"mappings":"AAAA,uDAAuD;AACvD,OAAO,EAAE,mBAAmB,EAAE,MAAM,mBAAmB,CAAC;AACxD,OAAO,EAAE,YAAY,EAAE,WAAW,EAAE,MAAM,cAAc,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAuB7E,sDAAsD;AACtD,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,IAA4B,EAAE,IAAY,EAAE,IAA8B,EAAE,IAAgC,EAAQ,EAAE;IACpJ,KAAK,MAAM,GAAG,IAAI,IAAI,IAAI,EAAE,EAAE,CAAC;QAC3B,IAAI,aAAa,CAAC,GAAG,CAAC,KAAK,SAAS,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;YAC3D,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,KAAK,IAAI,UAAU,IAAI,KAAK,OAAO,CAAC,GAAG,CAAC,+BAA+B,IAAI,KAAK,eAAe,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QACpI,CAAC;IACL,CAAC;AACL,CAAC,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,WAAmB,EAAE,IAA4B,EAAE,IAAY,EAAiB,EAAE;IACvG,0DAA0D;IAC1D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC/C,MAAM,GAAG,GAAG,CAAC,IAA8B,EAAE,IAAgC,EAAQ,EAAE;QACnF,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;QAC1C,KAAK,MAAM,GAAG,IAAI,IAAI,IAAI,EAAE,EAAE,CAAC;YAC3B,MAAM,KAAK,GAAG,aAAa,CAAC,GAAG,CAAC,CAAC;YACjC,MAAM,MAAM,GAAG,KAAK,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,mBAAmB,CAAC,KAAK,CAAC,CAAC;YACvE,IAAI,MAAM,KAAK,IAAI;gBAAE,SAAS;YAC9B,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC;YACxD,MAAM,CAAC,GAAG,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAChC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAChC,CAAC;IACL,CAAC,CAAC;IACF,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,EAAE,EAAE,SAAS,EAAE,GAAG,WAAW,CAAC;IAC1D,GAAG,CAAC,WAAW,EAAE,UAAU,EAAE,IAAI,CAAC,CAAC;IACnC,GAAG,CAAC,WAAW,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;IACpC,GAAG,CAAC,WAAW,EAAE,UAAU,EAAE,KAAK,CAAC,CAAC;IACpC,GAAG,CAAC,WAAW,EAAE,UAAU,EAAE,OAAO,CAAC,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,MAAM,EAAE,CAAC;QACxB,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;QACpC,GAAG,CAAC,WAAW,EAAE,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;IACD,GAAG,CAAC,WAAW,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC;IAC3B,GAAG,CAAC,WAAW,EAAE,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC;IAC3C,GAAG,CAAC,UAAU,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;IACjC,GAAG,CAAC,UAAU,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;IAClC,GAAG,CAAC,UAAU,EAAE,SAAS,EAAE,OAAO,CAAC,CAAC;IACpC,GAAG,CAAC,UAAU,EAAE,SAAS,EAAE,EAAE,CAAC,CAAC;IAC/B,IAAI,OAAO,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACnB,MAAM,MAAM,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,MAAM,GAAG,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAChH,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,KAAK,IAAI,UAAU,MAAM,2DAA2D,CAAC,CAAC;IACjH,CAAC;IACD,OAAO,OAAO,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC,KAAK,IAAI,IAAI,CAAC;AAC/C,CAAC,CAAC"}

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

@@ -0,0 +1,4 @@
+/** Whether `name` is a trait: a built-in one's string, or a registered trait's symbol. */
+export declare const isTrait: (name: unknown) => boolean;
+/** Registers a trait's key; registering it again is accepted. Throws for a key that isn't a plain symbol, or one of another kind. */
+export declare const addTrait: (key: unknown) => void;

package/dist/interface/registry/traits.js

@@ -0,0 +1,11 @@
+// © 2026 Adobe. MIT License. See /LICENSE for details.
+import { claimKey, kindOf } from './names.js';
+const builtIn = new Set(["type", "derived", "within", "reference", "reduce", "thread", "transfer", "shared"]);
+/** Whether `name` is a trait: a built-in one's string, or a registered trait's symbol. */
+export const isTrait = (name) => builtIn.has(name) || kindOf(name) === "trait";
+/** Registers a trait's key; registering it again is accepted. Throws for a key that isn't a plain symbol, or one of another kind. */
+export const addTrait = (key) => {
+    if (kindOf(key) !== "trait")
+        claimKey(key, "trait");
+};
+//# sourceMappingURL=traits.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"traits.js","sourceRoot":"","sources":["../../../src/interface/registry/traits.ts"],"names":[],"mappings":"AAAA,uDAAuD;AACvD,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,MAAM,YAAY,CAAC;AAG9C,MAAM,OAAO,GAAyB,IAAI,GAAG,CAAU,CAAC,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC;AAE7I,0FAA0F;AAC1F,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,IAAa,EAAW,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,OAAO,CAAC;AAEjG,qIAAqI;AACrI,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,GAAY,EAAQ,EAAE;IAC3C,IAAI,MAAM,CAAC,GAAG,CAAC,KAAK,OAAO;QAAE,QAAQ,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;AACxD,CAAC,CAAC"}

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

@@ -0,0 +1,4 @@
+/** Throws if `writes` lists a resource only the world writes. */
+export declare const checkWorldWritten: (what: string, writes: readonly (symbol)[] | undefined) => void;
+/** Whether only the world writes a resource. */
+export declare const isWorldWritten: (key: symbol) => boolean;

package/dist/interface/registry/written.js

@@ -0,0 +1,14 @@
+// © 2026 Adobe. MIT License. See /LICENSE for details.
+import { clock } from '../resources/clock.js';
+import { labelOf } from './names.js';
+/** Resources only the world writes. */
+const worldWritten = new Set([clock]);
+/** Throws if `writes` lists a resource only the world writes. */
+export const checkWorldWritten = (what, writes) => {
+    const found = writes?.find(key => worldWritten.has(key));
+    if (found !== undefined)
+        throw new Error(`${what} writes "${labelOf(found)}", which only the world writes.`);
+};
+/** Whether only the world writes a resource. */
+export const isWorldWritten = (key) => worldWritten.has(key);
+//# sourceMappingURL=written.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"written.js","sourceRoot":"","sources":["../../../src/interface/registry/written.ts"],"names":[],"mappings":"AAAA,uDAAuD;AACvD,OAAO,EAAE,KAAK,EAAE,MAAM,uBAAuB,CAAC;AAC9C,OAAO,EAAE,OAAO,EAAE,MAAM,YAAY,CAAC;AAErC,uCAAuC;AACvC,MAAM,YAAY,GAAwB,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;AAE3D,iEAAiE;AACjE,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAAC,IAAY,EAAE,MAAuC,EAAQ,EAAE;IAC7F,MAAM,KAAK,GAAG,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC;IACzD,IAAI,KAAK,KAAK,SAAS;QAAE,MAAM,IAAI,KAAK,CAAC,GAAG,IAAI,YAAY,OAAO,CAAC,KAAK,CAAC,iCAAiC,CAAC,CAAC;AACjH,CAAC,CAAC;AAEF,gDAAgD;AAChD,MAAM,CAAC,MAAM,cAAc,GAAG,CAAC,GAAW,EAAW,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC"}

package/dist/interface/resource/condition.d.ts

@@ -0,0 +1,8 @@
+import type { Key } from "./key.js";
+import type { Value } from './value.js';
+/** The resources a system can run on the condition of: their type allows `null` or `false`. */
+export type Condition = {
+    [K in Key]: null extends Value<K> ? K : false extends Value<K> ? K : never;
+}[Key];
+/** A condition's value while `is` holds: neither `null` nor `false`. */
+export type Holding<K extends Key> = Exclude<Value<K>, null | false>;

package/dist/interface/resource/condition.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=condition.js.map

package/dist/interface/resource/condition.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"condition.js","sourceRoot":"","sources":["../../../src/interface/resource/condition.ts"],"names":[],"mappings":""}

package/dist/interface/resource/index.d.ts

@@ -0,0 +1,2 @@
+export type { Key } from './key.js';
+export type { Value } from './value.js';

package/dist/interface/resource/index.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=index.js.map

package/dist/interface/resource/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/interface/resource/index.ts"],"names":[],"mappings":""}

package/dist/interface/resource/key.d.ts

@@ -0,0 +1,2 @@
+import type { Resources } from './types.js';
+export type Key = keyof Resources;

package/dist/interface/resource/key.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=key.js.map

package/dist/interface/resource/key.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"key.js","sourceRoot":"","sources":["../../../src/interface/resource/key.ts"],"names":[],"mappings":""}

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

@@ -0,0 +1,14 @@
+import type { Key } from "./key.js";
+import type { Resources } from './types.js';
+/** How a reduction combines values, leaf by leaf: a sum, a product, the least or greatest, or a bitwise fold. */
+export type Reduction = "+" | "*" | "min" | "max" | "&" | "|" | "^";
+/** The resources declared with a `reduce` trait, which systems contribute to and nothing writes. */
+export type Reduced = {
+    [K in Key]: Resources[K] extends {
+        readonly reduce: Reduction;
+    } ? K : never;
+}[Key];
+/** The operator resource `K` is reduced with. */
+export type OperatorOf<K extends Reduced> = Resources[K] extends {
+    readonly reduce: infer R;
+} ? R : never;

package/dist/interface/resource/reduction.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=reduction.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"reduction.js","sourceRoot":"","sources":["../../../src/interface/resource/reduction.ts"],"names":[],"mappings":""}

package/dist/interface/resource/resource.d.ts

@@ -0,0 +1,2 @@
+export type Resource = never;
+export * as Resource from './index.js';

package/dist/interface/resource/resource.js

@@ -0,0 +1,3 @@
+// © 2026 Adobe. MIT License. See /LICENSE for details.
+export * as Resource from './index.js';
+//# sourceMappingURL=resource.js.map

package/dist/interface/resource/resource.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resource.js","sourceRoot":"","sources":["../../../src/interface/resource/resource.ts"],"names":[],"mappings":"AAAA,uDAAuD;AAIvD,OAAO,KAAK,QAAQ,MAAM,YAAY,CAAC"}

package/dist/interface/resource/types.d.ts

@@ -0,0 +1,6 @@
+/**
+ * Each resource's traits, `type` and its `default` included, by augmentation in the module declaring its key:
+ * `[time]: { type: number; default: 0 }`. The build registers each.
+ */
+export interface Resources {
+}

package/dist/interface/resource/types.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=types.js.map

package/dist/interface/resource/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/interface/resource/types.ts"],"names":[],"mappings":""}

package/dist/interface/resource/value.d.ts

@@ -0,0 +1,21 @@
+import type { ThreadOf } from '../thread/of.js';
+import type { Key } from "./key.js";
+import type { Resources } from "./types.js";
+/** Every resource's value type, computed once so `Value` is a lookup. */
+type ValueTypes = {
+    readonly [K in Key]: Resources[K] extends {
+        readonly type: infer T;
+    } ? T : never;
+};
+/** The value type of resource `K`. */
+export type Value<K extends Key> = ValueTypes[K];
+type Primitive = string | number | boolean | bigint | symbol | null | undefined;
+/** Resource `K`'s value as reads return it: read-only, with branded primitives such as `Entity` as they are. */
+export type ReadonlyValue<K extends Key> = Value<K> extends Primitive ? Value<K> : Readonly<Value<K>>;
+/** Every resource's thread, computed once so `ThreadOf` is a lookup. */
+type Threads = {
+    readonly [K in Key]: ThreadOf<Resources[K], Value<K>>;
+};
+/** The thread resource `K` lives on, or `never` for a struct, which lives in shared memory. */
+export type ThreadOfResource<K extends Key> = Threads[K];
+export {};

package/dist/interface/resource/value.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=value.js.map

package/dist/interface/resource/value.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"value.js","sourceRoot":"","sources":["../../../src/interface/resource/value.ts"],"names":[],"mappings":""}

package/dist/interface/resource/written.d.ts

@@ -0,0 +1,3 @@
+import type { clock } from '../resources/clock.js';
+/** Resources only the world writes: systems and finalizers read them, and worlds don't start them at other values. */
+export type WorldWritten = typeof clock;

package/dist/interface/resource/written.js

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=written.js.map

package/dist/interface/resource/written.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"written.js","sourceRoot":"","sources":["../../../src/interface/resource/written.ts"],"names":[],"mappings":""}

package/dist/interface/resources/always.d.ts

@@ -0,0 +1,9 @@
+/** Whether every beat of the cadence runs a tick, not only beats where `wake` is due or a run arrived. False by default. */
+export declare const always: unique symbol;
+declare module '@adobe/ecs' {
+    interface Resources {
+        [always]: {
+            type: boolean;
+        };
+    }
+}

package/dist/interface/resources/always.js

@@ -0,0 +1,6 @@
+// © 2026 Adobe. MIT License. See /LICENSE for details.
+import { registerResource } from '../registry/declarations.js';
+/** Whether every beat of the cadence runs a tick, not only beats where `wake` is due or a run arrived. False by default. */
+export const always = Symbol("always");
+registerResource(always, { type: { type: "boolean" }, default: false });
+//# sourceMappingURL=always.js.map

package/dist/interface/resources/always.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"always.js","sourceRoot":"","sources":["../../../src/interface/resources/always.ts"],"names":[],"mappings":"AAAA,uDAAuD;AACvD,OAAO,EAAE,gBAAgB,EAAE,MAAM,6BAA6B,CAAC;AAE/D,4HAA4H;AAC5H,MAAM,CAAC,MAAM,MAAM,GAAG,MAAM,CAAC,QAAQ,CAAC,CAAC;AAQvC,gBAAgB,CAAC,MAAM,EAAE,EAAE,IAAI,EAAE,EAAE,IAAI,EAAE,SAAS,EAAE,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC"}

package/dist/interface/resources/cadence.d.ts

@@ -0,0 +1,21 @@
+/** The cadence's value, for the implementation: `Resource.Value<typeof cadence>`. */
+export type Cadence = {
+    readonly kind: "frame";
+} | {
+    readonly kind: "fixed";
+    readonly step: number;
+    readonly maxSteps?: number;
+};
+/**
+ * When the world ticks: once per animation frame, `{ kind: "frame" }`, the default, or every `step` milliseconds,
+ * `{ kind: "fixed", step }`. Under `fixed`, a beat that's behind runs at most `maxSteps` ticks, 4 by default, and drops
+ * the rest of the debt; each tick's `clock.delta` is `step`.
+ */
+export declare const cadence: unique symbol;
+declare module '@adobe/ecs' {
+    interface Resources {
+        [cadence]: {
+            type: Cadence;
+        };
+    }
+}

package/dist/interface/resources/cadence.js

@@ -0,0 +1,18 @@
+// © 2026 Adobe. MIT License. See /LICENSE for details.
+import { registerResource } from '../registry/declarations.js';
+/**
+ * When the world ticks: once per animation frame, `{ kind: "frame" }`, the default, or every `step` milliseconds,
+ * `{ kind: "fixed", step }`. Under `fixed`, a beat that's behind runs at most `maxSteps` ticks, 4 by default, and drops
+ * the rest of the debt; each tick's `clock.delta` is `step`.
+ */
+export const cadence = Symbol("cadence");
+registerResource(cadence, {
+    type: {
+        anyOf: [
+            { type: "object", properties: { kind: { const: "frame" } } },
+            { type: "object", properties: { kind: { const: "fixed" }, step: { type: "number", minimum: 0 }, maxSteps: { type: "integer", minimum: 1 } }, required: ["kind", "step"] },
+        ],
+    },
+    default: { kind: "frame" },
+});
+//# sourceMappingURL=cadence.js.map