@earendil-works/chord 1.1.0 → 1.2.0

package/dist/schema.js

@@ -0,0 +1,228 @@
+import { Value } from "typebox/value";
+import { invalid } from "./errors.js";
+const asSchema = (schema) => schema !== null && typeof schema === "object" ? schema : schema === false ? { not: {} } : {};
+/** Canonical JSON: sorted object keys, `undefined` members dropped. */
+export function canonicalJson(value) {
+    if (value === null || typeof value !== "object")
+        return JSON.stringify(value) ?? "null";
+    if (Array.isArray(value))
+        return `[${value.map((item) => canonicalJson(item)).join(",")}]`;
+    const keys = Object.keys(value)
+        .filter((key) => value[key] !== undefined)
+        .sort();
+    return `{${keys.map((key) => `${JSON.stringify(key)}:${canonicalJson(value[key])}`).join(",")}}`;
+}
+/** Non-cryptographic 64-bit hash (two FNV-1a lanes). Contracts are trusted, so collisions are not an attack surface. */
+export function hash64(text) {
+    let a = 0x811c9dc5;
+    let b = 0x01000193 ^ 0x5bd1e995;
+    for (let index = 0; index < text.length; index++) {
+        const code = text.charCodeAt(index);
+        a = Math.imul(a ^ code, 0x01000193);
+        b = Math.imul(b ^ code, 0x5bd1e995) ^ (b >>> 13);
+    }
+    return (a >>> 0).toString(16).padStart(8, "0") + (b >>> 0).toString(16).padStart(8, "0");
+}
+export function deepEqual(a, b) {
+    return a === b || canonicalJson(a) === canonicalJson(b);
+}
+/** Throws `invalid` (with `reason`) and the first schema errors when `value` does not match. */
+export function assertValid(reason, what, schema, value) {
+    if (Value.Check(schema, value))
+        return;
+    const errors = [...Value.Errors(schema, value)].slice(0, 3);
+    const summary = errors.map((error) => `${error.instancePath || "/"} ${error.message}`).join("; ");
+    throw invalid(reason, `${what}: ${summary}`, errors);
+}
+/** Applies defaults, strips unknown fields, validates. Returns a fresh value. */
+export function normalize(schema, value, what) {
+    const normalized = Value.Clean(schema, Value.Default(schema, Value.Clone(value ?? {})));
+    assertValid("input", what, schema, normalized);
+    return normalized;
+}
+/** Canonical identity of a normalized value: fields equal to their schema default are omitted. */
+export function canonicalIdentity(schema, value) {
+    return canonicalJson(stripDefaults(asSchema(schema), value));
+}
+function stripDefaults(schema, value) {
+    if (Array.isArray(value)) {
+        const items = schema.items;
+        if (Array.isArray(items))
+            return value.map((item, index) => stripDefaults(asSchema(items[index]), item));
+        return value.map((item) => stripDefaults(asSchema(items), item));
+    }
+    if (value === null || typeof value !== "object")
+        return value;
+    const properties = asSchema(schema.properties);
+    const result = {};
+    for (const [key, item] of Object.entries(value)) {
+        const property = asSchema(properties[key]);
+        if ("default" in property && deepEqual(property.default, item))
+            continue;
+        result[key] = stripDefaults(property, item);
+    }
+    return result;
+}
+const CONSTRAINTS = [
+    "minLength",
+    "maxLength",
+    "pattern",
+    "format",
+    "minimum",
+    "maximum",
+    "exclusiveMinimum",
+    "exclusiveMaximum",
+    "multipleOf",
+    "minItems",
+    "maxItems",
+    "uniqueItems",
+    "minProperties",
+    "maxProperties",
+];
+const typesOf = (schema) => typeof schema.type === "string" ? [schema.type] : Array.isArray(schema.type) ? schema.type : undefined;
+/** Keywords `fits` reasons about. Any other validation keyword in the provider's schema forces exact equality. */
+const KNOWN = new Set([
+    ...CONSTRAINTS,
+    "type",
+    "properties",
+    "required",
+    "additionalProperties",
+    "patternProperties",
+    "items",
+    "additionalItems",
+    "const",
+    "enum",
+    "anyOf",
+    "parameters",
+    "returnType",
+]);
+/** Annotations: no effect on validity. */
+const ANNOTATIONS = new Set([
+    "title",
+    "description",
+    "default",
+    "examples",
+    "$id",
+    "$schema",
+    "$comment",
+    "readOnly",
+    "writeOnly",
+    "deprecated",
+]);
+const withoutAnnotations = (schema) => Object.fromEntries(Object.entries(schema).filter(([key]) => !ANNOTATIONS.has(key)));
+/**
+ * Conservative structural subtyping: true only if every value valid under `sub` is valid under `sup`, where object
+ * fields missing from `sub` but optional in `sup` count as fine (unknown fields are stripped at the provider, see
+ * `RecordImpl.call`). A provider schema using a keyword this function does not model (`not`, `allOf`, `contains`,
+ * `$ref`, ...) or an `additionalProperties` schema only fits an identical consumer schema.
+ */
+export function fits(subSchema, supSchema) {
+    const sub = withoutAnnotations(asSchema(subSchema));
+    const sup = withoutAnnotations(asSchema(supSchema));
+    if (Object.keys(sup).length === 0)
+        return true;
+    if (deepEqual(sub, sup))
+        return true;
+    if (Object.keys(sup).some((key) => !KNOWN.has(key)))
+        return false;
+    if (sup.additionalProperties !== undefined && typeof sup.additionalProperties !== "boolean")
+        return false;
+    if (Array.isArray(sub.anyOf))
+        return sub.anyOf.every((branch) => fits(branch, sup));
+    if (Array.isArray(sup.anyOf))
+        return sup.anyOf.some((branch) => fits(sub, branch));
+    if ("const" in sup)
+        return "const" in sub && deepEqual(sub.const, sup.const);
+    if (Array.isArray(sup.enum)) {
+        const values = "const" in sub ? [sub.const] : Array.isArray(sub.enum) ? sub.enum : undefined;
+        return values?.every((item) => sup.enum.some((allowed) => deepEqual(allowed, item))) ?? false;
+    }
+    for (const key of CONSTRAINTS)
+        if (key in sup && !deepEqual(sub[key], sup[key]))
+            return false;
+    const supTypes = typesOf(sup);
+    const subTypes = typesOf(sub);
+    if (supTypes === undefined || subTypes === undefined)
+        return false;
+    if (!subTypes.every((type) => supTypes.includes(type) || (type === "integer" && supTypes.includes("number")))) {
+        return false;
+    }
+    if ("const" in sub || Array.isArray(sub.enum))
+        return true;
+    if (subTypes.includes("object") && !objectFits(sub, sup))
+        return false;
+    if (subTypes.includes("array") && !arrayFits(sub, sup))
+        return false;
+    if (subTypes.includes("function"))
+        return functionFits(sub, sup);
+    return true;
+}
+function objectFits(sub, sup) {
+    const subProperties = asSchema(sub.properties);
+    const supProperties = asSchema(sup.properties);
+    const subRequired = new Set(sub.required ?? []);
+    for (const key of sup.required ?? [])
+        if (!subRequired.has(key))
+            return false;
+    for (const [key, property] of Object.entries(supProperties)) {
+        if (key in subProperties) {
+            if (!fits(subProperties[key], property))
+                return false;
+        }
+        else if (typeof sub.additionalProperties === "object" && !fits(sub.additionalProperties, property)) {
+            // The consumer may send this name with any value its `additionalProperties` allows. Open consumer objects
+            // are fine: unknown names are stripped with the consumer's own schema before the call (`RecordImpl.call`).
+            return false;
+        }
+    }
+    if (sup.additionalProperties === false) {
+        if (sub.additionalProperties !== false)
+            return false;
+        if (Object.keys(subProperties).some((key) => !(key in supProperties)))
+            return false;
+    }
+    const supPatterns = asSchema(sup.patternProperties);
+    if (Object.keys(supPatterns).length > 0) {
+        // Every value the consumer may put under a matching name must fit, and the consumer must not allow arbitrary
+        // extra names (it would then allow any value under a matching one).
+        const subPatterns = asSchema(sub.patternProperties);
+        if (sub.additionalProperties !== false && Object.keys(subPatterns).length === 0)
+            return false;
+        for (const [pattern, property] of Object.entries(supPatterns)) {
+            const matcher = new RegExp(pattern, "u");
+            for (const [key, subProperty] of Object.entries(subProperties)) {
+                if (!(key in supProperties) && matcher.test(key) && !fits(subProperty, property))
+                    return false;
+            }
+            if (Object.keys(subPatterns).length > 0 &&
+                (!(pattern in subPatterns) || !fits(subPatterns[pattern], property))) {
+                return false;
+            }
+        }
+        for (const pattern of Object.keys(subPatterns))
+            if (!(pattern in supPatterns))
+                return false;
+    }
+    return true;
+}
+function arrayFits(sub, sup) {
+    if (Array.isArray(sup.items)) {
+        if (!Array.isArray(sub.items) || sub.items.length !== sup.items.length)
+            return false;
+        return sub.items.every((item, index) => fits(item, sup.items[index]));
+    }
+    if (Array.isArray(sub.items))
+        return sub.items.every((item) => fits(item, sup.items));
+    return fits(sub.items, sup.items);
+}
+function functionFits(sub, sup) {
+    const subParameters = sub.parameters ?? [];
+    const supParameters = sup.parameters ?? [];
+    // A function accepting fewer parameters is fine; each shared parameter is contravariant.
+    if (subParameters.length > supParameters.length)
+        return false;
+    if (!subParameters.every((parameter, index) => fits(supParameters[index], parameter)))
+        return false;
+    return fits(sub.returnType, sup.returnType);
+}
+//# sourceMappingURL=schema.js.map

package/dist/schema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema.js","sourceRoot":"","sources":["../src/schema.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,EAAE,MAAM,eAAe,CAAC;AACtC,OAAO,EAAyB,OAAO,EAAE,MAAM,aAAa,CAAC;AAK7D,MAAM,QAAQ,GAAG,CAAC,MAAe,EAAU,EAAE,CAC5C,MAAM,KAAK,IAAI,IAAI,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAE,MAAiB,CAAC,CAAC,CAAC,MAAM,KAAK,KAAK,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;AAE1G,uEAAuE;AACvE,MAAM,UAAU,aAAa,CAAC,KAAc;IAC3C,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,MAAM,CAAC;IACxF,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;IAC3F,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;SAC7B,MAAM,CAAC,CAAC,GAAG,EAAE,EAAE,CAAE,KAAiC,CAAC,GAAG,CAAC,KAAK,SAAS,CAAC;SACtE,IAAI,EAAE,CAAC;IACT,OAAO,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,aAAa,CAAE,KAAiC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;AAC/H,CAAC;AAED,wHAAwH;AACxH,MAAM,UAAU,MAAM,CAAC,IAAY;IAClC,IAAI,CAAC,GAAG,UAAU,CAAC;IACnB,IAAI,CAAC,GAAG,UAAU,GAAG,UAAU,CAAC;IAChC,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,CAAC;QACpC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;IAClD,CAAC;IACD,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;AAC1F,CAAC;AAED,MAAM,UAAU,SAAS,CAAC,CAAU,EAAE,CAAU;IAC/C,OAAO,CAAC,KAAK,CAAC,IAAI,aAAa,CAAC,CAAC,CAAC,KAAK,aAAa,CAAC,CAAC,CAAC,CAAC;AACzD,CAAC;AAED,gGAAgG;AAChG,MAAM,UAAU,WAAW,CAAC,MAAwB,EAAE,IAAY,EAAE,MAAe,EAAE,KAAc;IAClG,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC;QAAE,OAAO;IACvC,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC5D,MAAM,OAAO,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,YAAY,IAAI,GAAG,IAAI,KAAK,CAAC,OAAO,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAClG,MAAM,OAAO,CAAC,MAAM,EAAE,GAAG,IAAI,KAAK,OAAO,EAAE,EAAE,MAAM,CAAC,CAAC;AACtD,CAAC;AAED,iFAAiF;AACjF,MAAM,UAAU,SAAS,CAAC,MAAe,EAAE,KAAc,EAAE,IAAY;IACtE,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,KAAK,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;IACxF,WAAW,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IAC/C,OAAO,UAAU,CAAC;AACnB,CAAC;AAED,kGAAkG;AAClG,MAAM,UAAU,iBAAiB,CAAC,MAAe,EAAE,KAAc;IAChE,OAAO,aAAa,CAAC,aAAa,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;AAC9D,CAAC;AAED,SAAS,aAAa,CAAC,MAAc,EAAE,KAAc;IACpD,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QAC1B,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC;QAC3B,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;QACzG,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,aAAa,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC;IAClE,CAAC;IACD,IAAI,KAAK,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,KAAK,CAAC;IAC9D,MAAM,UAAU,GAAG,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;IAC/C,MAAM,MAAM,GAA4B,EAAE,CAAC;IAC3C,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,MAAM,QAAQ,GAAG,QAAQ,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;QAC3C,IAAI,SAAS,IAAI,QAAQ,IAAI,SAAS,CAAC,QAAQ,CAAC,OAAO,EAAE,IAAI,CAAC;YAAE,SAAS;QACzE,MAAM,CAAC,GAAG,CAAC,GAAG,aAAa,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,MAAM,CAAC;AACf,CAAC;AAED,MAAM,WAAW,GAAG;IACnB,WAAW;IACX,WAAW;IACX,SAAS;IACT,QAAQ;IACR,SAAS;IACT,SAAS;IACT,kBAAkB;IAClB,kBAAkB;IAClB,YAAY;IACZ,UAAU;IACV,UAAU;IACV,aAAa;IACb,eAAe;IACf,eAAe;CACN,CAAC;AAEX,MAAM,OAAO,GAAG,CAAC,MAAc,EAAwB,EAAE,CACxD,OAAO,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAE,MAAM,CAAC,IAAiB,CAAC,CAAC,CAAC,SAAS,CAAC;AAEtH,kHAAkH;AAClH,MAAM,KAAK,GAAwB,IAAI,GAAG,CAAC;IAC1C,GAAG,WAAW;IACd,MAAM;IACN,YAAY;IACZ,UAAU;IACV,sBAAsB;IACtB,mBAAmB;IACnB,OAAO;IACP,iBAAiB;IACjB,OAAO;IACP,MAAM;IACN,OAAO;IACP,YAAY;IACZ,YAAY;CACZ,CAAC,CAAC;AAEH,0CAA0C;AAC1C,MAAM,WAAW,GAAwB,IAAI,GAAG,CAAC;IAChD,OAAO;IACP,aAAa;IACb,SAAS;IACT,UAAU;IACV,KAAK;IACL,SAAS;IACT,UAAU;IACV,UAAU;IACV,WAAW;IACX,YAAY;CACZ,CAAC,CAAC;AAEH,MAAM,kBAAkB,GAAG,CAAC,MAAc,EAAU,EAAE,CACrD,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;AAErF;;;;;GAKG;AACH,MAAM,UAAU,IAAI,CAAC,SAAkB,EAAE,SAAkB;IAC1D,MAAM,GAAG,GAAG,kBAAkB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;IACpD,MAAM,GAAG,GAAG,kBAAkB,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;IACpD,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAC/C,IAAI,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACrC,IAAI,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IAClE,IAAI,GAAG,CAAC,oBAAoB,KAAK,SAAS,IAAI,OAAO,GAAG,CAAC,oBAAoB,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IAC1G,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;IACpF,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC,CAAC;IACnF,IAAI,OAAO,IAAI,GAAG;QAAE,OAAO,OAAO,IAAI,GAAG,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;IAC7E,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,OAAO,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;QAC7F,OAAO,MAAM,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAE,GAAG,CAAC,IAAkB,CAAC,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,SAAS,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC;IAC9G,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,WAAW;QAAE,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IAC9F,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IAC9B,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IAC9B,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC;IACnE,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;QAC/G,OAAO,KAAK,CAAC;IACd,CAAC;IACD,IAAI,OAAO,IAAI,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAC3D,IAAI,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,EAAE,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACvE,IAAI,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,EAAE,GAAG,CAAC;QAAE,OAAO,KAAK,CAAC;IACrE,IAAI,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC;QAAE,OAAO,YAAY,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IACjE,OAAO,IAAI,CAAC;AACb,CAAC;AAED,SAAS,UAAU,CAAC,GAAW,EAAE,GAAW;IAC3C,MAAM,aAAa,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAC/C,MAAM,aAAa,GAAG,QAAQ,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAC/C,MAAM,WAAW,GAAG,IAAI,GAAG,CAAE,GAAG,CAAC,QAAiC,IAAI,EAAE,CAAC,CAAC;IAC1E,KAAK,MAAM,GAAG,IAAK,GAAG,CAAC,QAAiC,IAAI,EAAE;QAAE,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;IACxG,KAAK,MAAM,CAAC,GAAG,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;QAC7D,IAAI,GAAG,IAAI,aAAa,EAAE,CAAC;YAC1B,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,EAAE,QAAQ,CAAC;gBAAE,OAAO,KAAK,CAAC;QACvD,CAAC;aAAM,IAAI,OAAO,GAAG,CAAC,oBAAoB,KAAK,QAAQ,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,QAAQ,CAAC,EAAE,CAAC;YACtG,0GAA0G;YAC1G,2GAA2G;YAC3G,OAAO,KAAK,CAAC;QACd,CAAC;IACF,CAAC;IACD,IAAI,GAAG,CAAC,oBAAoB,KAAK,KAAK,EAAE,CAAC;QACxC,IAAI,GAAG,CAAC,oBAAoB,KAAK,KAAK;YAAE,OAAO,KAAK,CAAC;QACrD,IAAI,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI,aAAa,CAAC,CAAC;YAAE,OAAO,KAAK,CAAC;IACrF,CAAC;IACD,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;IACpD,IAAI,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzC,6GAA6G;QAC7G,oEAAoE;QACpE,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,iBAAiB,CAAC,CAAC;QACpD,IAAI,GAAG,CAAC,oBAAoB,KAAK,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,KAAK,CAAC;QAC9F,KAAK,MAAM,CAAC,OAAO,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;YAC/D,MAAM,OAAO,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;YACzC,KAAK,MAAM,CAAC,GAAG,EAAE,WAAW,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;gBAChE,IAAI,CAAC,CAAC,GAAG,IAAI,aAAa,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,QAAQ,CAAC;oBAAE,OAAO,KAAK,CAAC;YAChG,CAAC;YACD,IACC,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,MAAM,GAAG,CAAC;gBACnC,CAAC,CAAC,CAAC,OAAO,IAAI,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,EAAE,QAAQ,CAAC,CAAC,EACnE,CAAC;gBACF,OAAO,KAAK,CAAC;YACd,CAAC;QACF,CAAC;QACD,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,IAAI,CAAC,WAAW,CAAC;YAAE,IAAI,CAAC,CAAC,OAAO,IAAI,WAAW,CAAC;gBAAE,OAAO,KAAK,CAAC;IAC7F,CAAC;IACD,OAAO,IAAI,CAAC;AACb,CAAC;AAED,SAAS,SAAS,CAAC,GAAW,EAAE,GAAW;IAC1C,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;QAC9B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,KAAK,GAAG,CAAC,KAAK,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QACrF,OAAO,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAG,GAAG,CAAC,KAAmB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACtF,CAAC;IACD,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;QAAE,OAAO,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACtF,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,CAAC;AACnC,CAAC;AAED,SAAS,YAAY,CAAC,GAAW,EAAE,GAAW;IAC7C,MAAM,aAAa,GAAI,GAAG,CAAC,UAAoC,IAAI,EAAE,CAAC;IACtE,MAAM,aAAa,GAAI,GAAG,CAAC,UAAoC,IAAI,EAAE,CAAC;IACtE,yFAAyF;IACzF,IAAI,aAAa,CAAC,MAAM,GAAG,aAAa,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC;IAC9D,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;QAAE,OAAO,KAAK,CAAC;IACpG,OAAO,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;AAC7C,CAAC","sourcesContent":["import type { TSchema } from \"typebox\";\nimport { Value } from \"typebox/value\";\nimport { type ChordErrorReason, invalid } from \"./errors.ts\";\n\n/** JSON Schema as data. TypeBox schemas are plain JSON Schema objects. */\ntype Schema = { readonly [key: string]: unknown };\n\nconst asSchema = (schema: unknown): Schema =>\n\tschema !== null && typeof schema === \"object\" ? (schema as Schema) : schema === false ? { not: {} } : {};\n\n/** Canonical JSON: sorted object keys, `undefined` members dropped. */\nexport function canonicalJson(value: unknown): string {\n\tif (value === null || typeof value !== \"object\") return JSON.stringify(value) ?? \"null\";\n\tif (Array.isArray(value)) return `[${value.map((item) => canonicalJson(item)).join(\",\")}]`;\n\tconst keys = Object.keys(value)\n\t\t.filter((key) => (value as Record<string, unknown>)[key] !== undefined)\n\t\t.sort();\n\treturn `{${keys.map((key) => `${JSON.stringify(key)}:${canonicalJson((value as Record<string, unknown>)[key])}`).join(\",\")}}`;\n}\n\n/** Non-cryptographic 64-bit hash (two FNV-1a lanes). Contracts are trusted, so collisions are not an attack surface. */\nexport function hash64(text: string): string {\n\tlet a = 0x811c9dc5;\n\tlet b = 0x01000193 ^ 0x5bd1e995;\n\tfor (let index = 0; index < text.length; index++) {\n\t\tconst code = text.charCodeAt(index);\n\t\ta = Math.imul(a ^ code, 0x01000193);\n\t\tb = Math.imul(b ^ code, 0x5bd1e995) ^ (b >>> 13);\n\t}\n\treturn (a >>> 0).toString(16).padStart(8, \"0\") + (b >>> 0).toString(16).padStart(8, \"0\");\n}\n\nexport function deepEqual(a: unknown, b: unknown): boolean {\n\treturn a === b || canonicalJson(a) === canonicalJson(b);\n}\n\n/** Throws `invalid` (with `reason`) and the first schema errors when `value` does not match. */\nexport function assertValid(reason: ChordErrorReason, what: string, schema: TSchema, value: unknown): void {\n\tif (Value.Check(schema, value)) return;\n\tconst errors = [...Value.Errors(schema, value)].slice(0, 3);\n\tconst summary = errors.map((error) => `${error.instancePath || \"/\"} ${error.message}`).join(\"; \");\n\tthrow invalid(reason, `${what}: ${summary}`, errors);\n}\n\n/** Applies defaults, strips unknown fields, validates. Returns a fresh value. */\nexport function normalize(schema: TSchema, value: unknown, what: string): unknown {\n\tconst normalized = Value.Clean(schema, Value.Default(schema, Value.Clone(value ?? {})));\n\tassertValid(\"input\", what, schema, normalized);\n\treturn normalized;\n}\n\n/** Canonical identity of a normalized value: fields equal to their schema default are omitted. */\nexport function canonicalIdentity(schema: TSchema, value: unknown): string {\n\treturn canonicalJson(stripDefaults(asSchema(schema), value));\n}\n\nfunction stripDefaults(schema: Schema, value: unknown): unknown {\n\tif (Array.isArray(value)) {\n\t\tconst items = schema.items;\n\t\tif (Array.isArray(items)) return value.map((item, index) => stripDefaults(asSchema(items[index]), item));\n\t\treturn value.map((item) => stripDefaults(asSchema(items), item));\n\t}\n\tif (value === null || typeof value !== \"object\") return value;\n\tconst properties = asSchema(schema.properties);\n\tconst result: Record<string, unknown> = {};\n\tfor (const [key, item] of Object.entries(value)) {\n\t\tconst property = asSchema(properties[key]);\n\t\tif (\"default\" in property && deepEqual(property.default, item)) continue;\n\t\tresult[key] = stripDefaults(property, item);\n\t}\n\treturn result;\n}\n\nconst CONSTRAINTS = [\n\t\"minLength\",\n\t\"maxLength\",\n\t\"pattern\",\n\t\"format\",\n\t\"minimum\",\n\t\"maximum\",\n\t\"exclusiveMinimum\",\n\t\"exclusiveMaximum\",\n\t\"multipleOf\",\n\t\"minItems\",\n\t\"maxItems\",\n\t\"uniqueItems\",\n\t\"minProperties\",\n\t\"maxProperties\",\n] as const;\n\nconst typesOf = (schema: Schema): string[] | undefined =>\n\ttypeof schema.type === \"string\" ? [schema.type] : Array.isArray(schema.type) ? (schema.type as string[]) : undefined;\n\n/** Keywords `fits` reasons about. Any other validation keyword in the provider's schema forces exact equality. */\nconst KNOWN: ReadonlySet<string> = new Set([\n\t...CONSTRAINTS,\n\t\"type\",\n\t\"properties\",\n\t\"required\",\n\t\"additionalProperties\",\n\t\"patternProperties\",\n\t\"items\",\n\t\"additionalItems\",\n\t\"const\",\n\t\"enum\",\n\t\"anyOf\",\n\t\"parameters\",\n\t\"returnType\",\n]);\n\n/** Annotations: no effect on validity. */\nconst ANNOTATIONS: ReadonlySet<string> = new Set([\n\t\"title\",\n\t\"description\",\n\t\"default\",\n\t\"examples\",\n\t\"$id\",\n\t\"$schema\",\n\t\"$comment\",\n\t\"readOnly\",\n\t\"writeOnly\",\n\t\"deprecated\",\n]);\n\nconst withoutAnnotations = (schema: Schema): Schema =>\n\tObject.fromEntries(Object.entries(schema).filter(([key]) => !ANNOTATIONS.has(key)));\n\n/**\n * Conservative structural subtyping: true only if every value valid under `sub` is valid under `sup`, where object\n * fields missing from `sub` but optional in `sup` count as fine (unknown fields are stripped at the provider, see\n * `RecordImpl.call`). A provider schema using a keyword this function does not model (`not`, `allOf`, `contains`,\n * `$ref`, ...) or an `additionalProperties` schema only fits an identical consumer schema.\n */\nexport function fits(subSchema: unknown, supSchema: unknown): boolean {\n\tconst sub = withoutAnnotations(asSchema(subSchema));\n\tconst sup = withoutAnnotations(asSchema(supSchema));\n\tif (Object.keys(sup).length === 0) return true;\n\tif (deepEqual(sub, sup)) return true;\n\tif (Object.keys(sup).some((key) => !KNOWN.has(key))) return false;\n\tif (sup.additionalProperties !== undefined && typeof sup.additionalProperties !== \"boolean\") return false;\n\tif (Array.isArray(sub.anyOf)) return sub.anyOf.every((branch) => fits(branch, sup));\n\tif (Array.isArray(sup.anyOf)) return sup.anyOf.some((branch) => fits(sub, branch));\n\tif (\"const\" in sup) return \"const\" in sub && deepEqual(sub.const, sup.const);\n\tif (Array.isArray(sup.enum)) {\n\t\tconst values = \"const\" in sub ? [sub.const] : Array.isArray(sub.enum) ? sub.enum : undefined;\n\t\treturn values?.every((item) => (sup.enum as unknown[]).some((allowed) => deepEqual(allowed, item))) ?? false;\n\t}\n\tfor (const key of CONSTRAINTS) if (key in sup && !deepEqual(sub[key], sup[key])) return false;\n\tconst supTypes = typesOf(sup);\n\tconst subTypes = typesOf(sub);\n\tif (supTypes === undefined || subTypes === undefined) return false;\n\tif (!subTypes.every((type) => supTypes.includes(type) || (type === \"integer\" && supTypes.includes(\"number\")))) {\n\t\treturn false;\n\t}\n\tif (\"const\" in sub || Array.isArray(sub.enum)) return true;\n\tif (subTypes.includes(\"object\") && !objectFits(sub, sup)) return false;\n\tif (subTypes.includes(\"array\") && !arrayFits(sub, sup)) return false;\n\tif (subTypes.includes(\"function\")) return functionFits(sub, sup);\n\treturn true;\n}\n\nfunction objectFits(sub: Schema, sup: Schema): boolean {\n\tconst subProperties = asSchema(sub.properties);\n\tconst supProperties = asSchema(sup.properties);\n\tconst subRequired = new Set((sub.required as string[] | undefined) ?? []);\n\tfor (const key of (sup.required as string[] | undefined) ?? []) if (!subRequired.has(key)) return false;\n\tfor (const [key, property] of Object.entries(supProperties)) {\n\t\tif (key in subProperties) {\n\t\t\tif (!fits(subProperties[key], property)) return false;\n\t\t} else if (typeof sub.additionalProperties === \"object\" && !fits(sub.additionalProperties, property)) {\n\t\t\t// The consumer may send this name with any value its `additionalProperties` allows. Open consumer objects\n\t\t\t// are fine: unknown names are stripped with the consumer's own schema before the call (`RecordImpl.call`).\n\t\t\treturn false;\n\t\t}\n\t}\n\tif (sup.additionalProperties === false) {\n\t\tif (sub.additionalProperties !== false) return false;\n\t\tif (Object.keys(subProperties).some((key) => !(key in supProperties))) return false;\n\t}\n\tconst supPatterns = asSchema(sup.patternProperties);\n\tif (Object.keys(supPatterns).length > 0) {\n\t\t// Every value the consumer may put under a matching name must fit, and the consumer must not allow arbitrary\n\t\t// extra names (it would then allow any value under a matching one).\n\t\tconst subPatterns = asSchema(sub.patternProperties);\n\t\tif (sub.additionalProperties !== false && Object.keys(subPatterns).length === 0) return false;\n\t\tfor (const [pattern, property] of Object.entries(supPatterns)) {\n\t\t\tconst matcher = new RegExp(pattern, \"u\");\n\t\t\tfor (const [key, subProperty] of Object.entries(subProperties)) {\n\t\t\t\tif (!(key in supProperties) && matcher.test(key) && !fits(subProperty, property)) return false;\n\t\t\t}\n\t\t\tif (\n\t\t\t\tObject.keys(subPatterns).length > 0 &&\n\t\t\t\t(!(pattern in subPatterns) || !fits(subPatterns[pattern], property))\n\t\t\t) {\n\t\t\t\treturn false;\n\t\t\t}\n\t\t}\n\t\tfor (const pattern of Object.keys(subPatterns)) if (!(pattern in supPatterns)) return false;\n\t}\n\treturn true;\n}\n\nfunction arrayFits(sub: Schema, sup: Schema): boolean {\n\tif (Array.isArray(sup.items)) {\n\t\tif (!Array.isArray(sub.items) || sub.items.length !== sup.items.length) return false;\n\t\treturn sub.items.every((item, index) => fits(item, (sup.items as unknown[])[index]));\n\t}\n\tif (Array.isArray(sub.items)) return sub.items.every((item) => fits(item, sup.items));\n\treturn fits(sub.items, sup.items);\n}\n\nfunction functionFits(sub: Schema, sup: Schema): boolean {\n\tconst subParameters = (sub.parameters as unknown[] | undefined) ?? [];\n\tconst supParameters = (sup.parameters as unknown[] | undefined) ?? [];\n\t// A function accepting fewer parameters is fine; each shared parameter is contravariant.\n\tif (subParameters.length > supParameters.length) return false;\n\tif (!subParameters.every((parameter, index) => fits(supParameters[index], parameter))) return false;\n\treturn fits(sub.returnType, sup.returnType);\n}\n"]}

package/dist/state.d.ts

@@ -0,0 +1,92 @@
+/**
+ * Replicated state: an immutable JSON value with ordered, serialized change notifications. Either authoritative and
+ * mutable (`replicatedState(initial)`) or a publication-only view of an external revision source
+ * (`replicatedState(source)`).
+ */
+import { type Context } from "./context/index.ts";
+import { type Draft, type Op } from "./delta/index.ts";
+export interface ReplicatedStateDelivery {
+    readonly kind: "hydrate" | "update";
+    readonly sequence: number;
+}
+export interface ReplicatedState<T> {
+    /**
+     * Contract-immutable value, or undefined until hydration. It is not frozen and may share containers with an
+     * in-process provider; consumers must not mutate it. Later updates do not mutate previously returned values.
+     */
+    readonly value: T | undefined;
+    /**
+     * Each subscription serializes callbacks, awaiting hydration before updates. Values are immutable and may
+     * share unchanged revision data. At most 100 deliveries wait behind the running callback; overflow keeps
+     * only the newest pending value/context/delivery, so update sequences may skip. Failures are reported in
+     * isolation and delivery continues. Unsubscribe discards pending work without aborting or joining a callback.
+     */
+    subscribe(listener: (value: T, context: Context, delivery: ReplicatedStateDelivery) => Promise<void>): () => void;
+    subscribe(listener: (value: T, context: Context, delivery: ReplicatedStateDelivery) => void): () => void;
+}
+export interface MutableReplicatedState<T extends object> extends ReplicatedState<T> {
+    readonly value: T;
+    /**
+     * Atomically publish one synchronous overlay mutation. Draft handles are unusable after the callback returns.
+     * Values placed through the draft are cloned by value; assigning `undefined` to an object property deletes it.
+     */
+    change(context: Context, mutate: (draft: Draft<T>) => void): void;
+    /**
+     * Atomically take immutable ownership of an alias-free strict-JSON replacement.
+     * The caller must not mutate the transferred root after this call.
+     */
+    replace(context: Context, value: T): void;
+}
+/** One immutable authoritative revision committed after an attachment snapshot. */
+export interface ReplicatedStateSourceFrame<T> {
+    /** Monotonic source cursor. The first frame after a snapshot must be `snapshot.cursor + 1`. */
+    readonly cursor: number;
+    /** The exact immutable value produced by this commit. */
+    readonly value: T;
+    /** The exact immutable operation batch that produced `value` from the preceding source revision. */
+    readonly ops: readonly Op[];
+    readonly context: Context;
+}
+export interface ReplicatedStateSourceAttachment<T> {
+    /** Fixed immutable snapshot captured at the atomic attachment boundary. */
+    readonly snapshot: {
+        readonly value: T;
+        readonly cursor: number;
+    };
+    /**
+     * Install the sole listener and synchronously drain every buffered frame in source commit order.
+     * This method is single-use. After it begins, every new committed frame must also be delivered in order
+     * until disposal, including commits made reentrantly while a prior frame is being delivered.
+     */
+    activate(listener: (frame: ReplicatedStateSourceFrame<T>) => void): void;
+    /** Stop delivery and release source resources. Disposal must be idempotent. */
+    dispose(): void;
+}
+/**
+ * An authoritative immutable revision source.
+ *
+ * `attach()` must synchronously and atomically capture one snapshot and register the returned attachment to buffer
+ * every later committed frame. The snapshot must include every commit before that boundary; buffered frames must
+ * include every commit after it, with no overlap or gap. Snapshot values, frame values, and operation batches are
+ * immutable and remain valid after delivery. Chord only publishes these references; it never applies or re-diffs them.
+ */
+export interface ReplicatedStateSource<T> {
+    attach(): ReplicatedStateSourceAttachment<T>;
+}
+export interface ReplicatedStateSourceOptions {
+    /** Receives source-contract and publication-listener failures without throwing them into the source. */
+    readonly onError?: (error: Error) => void;
+}
+/** A synchronously hydrated publication-only state backed by one source attachment. */
+export interface AttachedReplicatedState<T> extends ReplicatedState<T> {
+    readonly value: T;
+    /** Idempotently release the source attachment. The last published value remains readable. */
+    dispose(): void;
+}
+export declare function replicatedState<T>(source: ReplicatedStateSource<T>, options?: ReplicatedStateSourceOptions): AttachedReplicatedState<T>;
+/**
+ * Create authoritative state by taking immutable ownership of an alias-free strict-JSON root.
+ * The caller must not mutate `initial` after this call.
+ */
+export declare function replicatedState<T extends object>(initial: T): MutableReplicatedState<T>;
+//# sourceMappingURL=state.d.ts.map

package/dist/state.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"state.d.ts","sourceRoot":"","sources":["../src/state.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,EAAsB,KAAK,OAAO,EAAE,MAAM,oBAAoB,CAAC;AACtE,OAAO,EAAE,KAAK,KAAK,EAAE,KAAK,EAAE,EAAsC,MAAM,kBAAkB,CAAC;AAE3F,MAAM,WAAW,uBAAuB;IACvC,QAAQ,CAAC,IAAI,EAAE,SAAS,GAAG,QAAQ,CAAC;IACpC,QAAQ,CAAC,QAAQ,EAAE,MAAM,CAAC;CAC1B;AAED,MAAM,WAAW,eAAe,CAAC,CAAC;IACjC;;;OAGG;IACH,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,SAAS,CAAC;IAC9B;;;;;OAKG;IACH,SAAS,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,uBAAuB,KAAK,OAAO,CAAC,IAAI,CAAC,GAAG,MAAM,IAAI,CAAC;IAClH,SAAS,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,CAAC,EAAE,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,uBAAuB,KAAK,IAAI,GAAG,MAAM,IAAI,CAAC;CACzG;AAED,MAAM,WAAW,sBAAsB,CAAC,CAAC,SAAS,MAAM,CAAE,SAAQ,eAAe,CAAC,CAAC,CAAC;IACnF,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IAClB;;;OAGG;IACH,MAAM,CAAC,OAAO,EAAE,OAAO,EAAE,MAAM,EAAE,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG,IAAI,CAAC;IAClE;;;OAGG;IACH,OAAO,CAAC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC,GAAG,IAAI,CAAC;CAC1C;AAED,mFAAmF;AACnF,MAAM,WAAW,0BAA0B,CAAC,CAAC;IAC5C,+FAA+F;IAC/F,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;IACxB,yDAAyD;IACzD,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IAClB,oGAAoG;IACpG,QAAQ,CAAC,GAAG,EAAE,SAAS,EAAE,EAAE,CAAC;IAC5B,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC;CAC1B;AAED,MAAM,WAAW,+BAA+B,CAAC,CAAC;IACjD,2EAA2E;IAC3E,QAAQ,CAAC,QAAQ,EAAE;QAAE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;QAAC,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAA;KAAE,CAAC;IAClE;;;;OAIG;IACH,QAAQ,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,0BAA0B,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG,IAAI,CAAC;IACzE,+EAA+E;IAC/E,OAAO,IAAI,IAAI,CAAC;CAChB;AAED;;;;;;;GAOG;AACH,MAAM,WAAW,qBAAqB,CAAC,CAAC;IACvC,MAAM,IAAI,+BAA+B,CAAC,CAAC,CAAC,CAAC;CAC7C;AAED,MAAM,WAAW,4BAA4B;IAC5C,wGAAwG;IACxG,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,KAAK,IAAI,CAAC;CAC1C;AAED,uFAAuF;AACvF,MAAM,WAAW,uBAAuB,CAAC,CAAC,CAAE,SAAQ,eAAe,CAAC,CAAC,CAAC;IACrE,QAAQ,CAAC,KAAK,EAAE,CAAC,CAAC;IAClB,6FAA6F;IAC7F,OAAO,IAAI,IAAI,CAAC;CAChB;AA0TD,wBAAgB,eAAe,CAAC,CAAC,EAChC,MAAM,EAAE,qBAAqB,CAAC,CAAC,CAAC,EAChC,OAAO,CAAC,EAAE,4BAA4B,GACpC,uBAAuB,CAAC,CAAC,CAAC,CAAC;AAC9B;;;GAGG;AACH,wBAAgB,eAAe,CAAC,CAAC,SAAS,MAAM,EAAE,OAAO,EAAE,CAAC,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC"}

package/dist/{services/state.js → state.js}

@@ -1,7 +1,10 @@
-import { BACKGROUND_CONTEXT } from "../context/index.js";
-import { applyImmutable, isBase, track } from "../delta/index.js";
-import { JsonRevisionValidator } from "../delta/revision-validator.js";
-import { registerReplicatedStateInternals } from "./state-internals.js";
+/**
+ * Replicated state: an immutable JSON value with ordered, serialized change notifications. Either authoritative and
+ * mutable (`replicatedState(initial)`) or a publication-only view of an external revision source
+ * (`replicatedState(source)`).
+ */
+import { BACKGROUND_CONTEXT } from "./context/index.js";
+import { track } from "./delta/index.js";
 /** One public subscription, independent of producer and other subscriber progress. */
 class StateSubscriber {
     #listener;
@@ -72,7 +75,6 @@ class StateSubscriber {
 class ReplicatedStatePublisher {
     #listeners = new Map();
     #reportError;
-    #sourceListeners = new Set();
     #publications = [];
     #value;
     #sequence = 0;
@@ -91,36 +93,24 @@ class ReplicatedStatePublisher {
         const { value, sequence } = this.snapshot();
         const subscriber = new StateSubscriber(listener, this.#reportError);
         this.#listeners.set(subscriber, sequence);
-        subscriber.push({ value, context: serviceDeliveryContext(), delivery: { kind: "hydrate", sequence } });
+        // Hydration has no caller; it is delivered with the background context.
+        subscriber.push({ value, context: BACKGROUND_CONTEXT, delivery: { kind: "hydrate", sequence } });
         subscriber.drain();
         return () => {
             subscriber.close();
             this.#listeners.delete(subscriber);
         };
     }
-    subscribeSource(listener) {
-        this.#sourceListeners.add(listener);
-        return () => this.#sourceListeners.delete(listener);
-    }
-    /** Publish an already-prepared immutable revision and return isolated listener failures. */
-    publish(value, ops, context) {
+    /** Publish an already-prepared immutable revision. Subscriber failures are reported, never thrown. */
+    publish(value, context) {
         this.#value = value;
         this.#sequence += 1;
-        this.#publications.push({ value, ops, sequence: this.#sequence, context });
+        this.#publications.push({ value, sequence: this.#sequence, context });
         if (this.#delivering)
-            return [];
+            return;
         this.#delivering = true;
-        const errors = [];
         try {
             for (let publication = this.#publications.shift(); publication !== undefined; publication = this.#publications.shift()) {
-                for (const listener of [...this.#sourceListeners]) {
-                    try {
-                        listener(publication.ops, publication.sequence, publication.context);
-                    }
-                    catch (error) {
-                        errors.push(error);
-                    }
-                }
                 const delivery = { kind: "update", sequence: publication.sequence };
                 for (const [subscriber, hydratedSequence] of [...this.#listeners]) {
                     if (publication.sequence <= hydratedSequence)
@@ -133,20 +123,15 @@ class ReplicatedStatePublisher {
         finally {
             this.#delivering = false;
         }
-        return errors;
     }
 }
-export class MutableReplicatedStateImpl {
+class MutableReplicatedStateImpl {
     #tracker;
     #publisher;
     #changing = false;
     constructor(initial) {
         this.#tracker = track(initial);
         this.#publisher = new ReplicatedStatePublisher(this.#tracker.value);
-        registerReplicatedStateInternals(this, {
-            snapshot: () => this.#publisher.snapshot(),
-            subscribe: (listener) => this.#publisher.subscribeSource(listener),
-        });
     }
     get value() {
         return this.#tracker.value;
@@ -175,18 +160,16 @@ export class MutableReplicatedStateImpl {
             this.#changing = false;
         }
         this.#tracker.adopt(prepared);
-        if (prepared.ops.length === 0)
-            return;
-        throwCollectedErrors(this.#publisher.publish(prepared.value, prepared.ops, context), "Replicated state listeners failed");
+        if (prepared.ops.length > 0)
+            this.#publisher.publish(prepared.value, context);
     }
     replace(context, value) {
         if (this.#changing)
             throw new Error("Replicated state cannot be replaced from a change callback");
         const prepared = this.#tracker.prepareReplace(value);
         this.#tracker.adopt(prepared);
-        if (prepared.ops.length === 0)
-            return;
-        throwCollectedErrors(this.#publisher.publish(prepared.value, prepared.ops, context), "Replicated state listeners failed");
+        if (prepared.ops.length > 0)
+            this.#publisher.publish(prepared.value, context);
     }
     subscribe(listener) {
         return this.#publisher.subscribe(listener);
@@ -205,10 +188,6 @@ class AttachedReplicatedStateImpl {
         this.#cursor = snapshot.cursor;
         this.#reportError = options.onError ?? reportErrorAsync;
         this.#publisher = new ReplicatedStatePublisher(snapshot.value, (error) => this.#report(error));
-        registerReplicatedStateInternals(this, {
-            snapshot: () => this.#publisher.snapshot(),
-            subscribe: (listener) => this.#publisher.subscribeSource(listener),
-        });
     }
     get value() {
         return this.#publisher.value;
@@ -235,11 +214,7 @@ class AttachedReplicatedStateImpl {
                 throw new Error(`Replicated state source cursor has a gap: expected ${expected}, received ${frame.cursor}`);
             }
             this.#cursor = frame.cursor;
-            const errors = this.#publisher.publish(frame.value, frame.ops, frame.context);
-            if (errors.length === 1)
-                this.#report(errors[0]);
-            else if (errors.length > 1)
-                this.#report(new AggregateError(errors, "Replicated state listeners failed"));
+            this.#publisher.publish(frame.value, frame.context);
         }
         catch (error) {
             this.#fail(toError(error));
@@ -268,7 +243,7 @@ class AttachedReplicatedStateImpl {
     }
 }
 /** Attach a publication-only replicated state to one authoritative immutable source stream. */
-export function attachReplicatedStateSource(source, options = {}) {
+function attachReplicatedStateSource(source, options = {}) {
     const attachment = source.attach();
     try {
         const state = new AttachedReplicatedStateImpl(attachment, options);
@@ -285,93 +260,6 @@ export function attachReplicatedStateSource(source, options = {}) {
         throw error;
     }
 }
-/** A cold read-only state used by service consumers until a complete snapshot arrives. */
-export class ReplicatedStateReplica {
-    #listeners = new Set();
-    #reportError;
-    #validator = new JsonRevisionValidator();
-    #value;
-    #sequence;
-    constructor(reportError) {
-        this.#reportError = reportError;
-    }
-    get value() {
-        return this.#value;
-    }
-    subscribe(listener) {
-        const subscriber = new StateSubscriber(listener, this.#reportError);
-        this.#listeners.add(subscriber);
-        if (this.#value !== undefined) {
-            subscriber.push({
-                value: this.#value,
-                context: serviceDeliveryContext(),
-                delivery: { kind: "hydrate", sequence: this.#sequence },
-            });
-            subscriber.drain();
-        }
-        return () => {
-            subscriber.close();
-            this.#listeners.delete(subscriber);
-        };
-    }
-    hydrate(sequence, ops, context) {
-        let next;
-        try {
-            if (!isBase(ops))
-                throw new Error("Replicated state snapshot is not a base operation batch");
-            next = this.#validator.validate(applyImmutable(undefined, ops));
-        }
-        catch (error) {
-            this.clear();
-            throw error;
-        }
-        this.#sequence = sequence;
-        this.#value = next;
-        this.#deliverAll(context, { kind: "hydrate", sequence });
-    }
-    update(sequence, ops, context) {
-        if (this.#sequence === undefined || this.#value === undefined) {
-            throw new Error("Replicated state received an update before hydration");
-        }
-        if (sequence !== this.#sequence + 1) {
-            this.clear();
-            throw new Error("Replicated state update sequence has a gap");
-        }
-        let next;
-        try {
-            next = this.#validator.validate(applyImmutable(this.#value, ops));
-        }
-        catch (error) {
-            this.clear();
-            throw error;
-        }
-        this.#sequence = sequence;
-        this.#value = next;
-        this.#deliverAll(context, { kind: "update", sequence });
-    }
-    clear() {
-        this.#value = undefined;
-        this.#sequence = undefined;
-        for (const subscriber of this.#listeners)
-            subscriber.clear();
-    }
-    #deliverAll(context, delivery) {
-        if (this.#value === undefined)
-            return;
-        const frame = { value: this.#value, context, delivery };
-        const subscribers = [...this.#listeners];
-        // Enqueue for everyone before user code can publish another revision reentrantly.
-        for (const subscriber of subscribers)
-            subscriber.push(frame);
-        for (const subscriber of subscribers)
-            subscriber.drain();
-    }
-}
-/** @internal Context for synthetic service deliveries without a caller. */
-export function serviceDeliveryContext() {
-    // TODO: Add delivery-scoped cancellation or metadata if deliveries gain an owned lifecycle.
-    return BACKGROUND_CONTEXT;
-}
 function assertCursor(cursor, kind) {
     if (!Number.isSafeInteger(cursor))
         throw new TypeError(`Replicated state source ${kind} cursor must be a safe integer`);
@@ -380,12 +268,6 @@ function isPromiseLike(value) {
     return (((typeof value === "object" && value !== null) || typeof value === "function") &&
         typeof value.then === "function");
 }
-function throwCollectedErrors(errors, message) {
-    if (errors.length === 1)
-        throw errors[0];
-    if (errors.length > 1)
-        throw new AggregateError(errors, message);
-}
 function reportErrorAsync(error) {
     queueMicrotask(() => {
         throw error;
@@ -394,4 +276,12 @@ function reportErrorAsync(error) {
 function toError(error) {
     return error instanceof Error ? error : new Error(String(error));
 }
+export function replicatedState(initialOrSource, options) {
+    if (isReplicatedStateSource(initialOrSource))
+        return attachReplicatedStateSource(initialOrSource, options);
+    return new MutableReplicatedStateImpl(initialOrSource);
+}
+function isReplicatedStateSource(value) {
+    return typeof value.attach === "function";
+}
 //# sourceMappingURL=state.js.map