@elaraai/east 0.0.1-beta.8 → 1.0.0

package/dist/src/patch/type_of_patch.js

@@ -0,0 +1,144 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+/**
+ * PatchType constructor for computing patch types from East types.
+ *
+ * @module
+ */
+import { NullType, StructType, VariantType, ArrayType, DictType, IntegerType, } from "../types.js";
+import { fromEastTypeValue } from "../type_of_type.js";
+import { isVariant } from "../containers/variant.js";
+export function PatchType(type, ctx) {
+    if (isVariant(type))
+        type = fromEastTypeValue(type);
+    // Initialize context for tracking recursive types
+    const context = ctx ?? new Map();
+    // Check if we've already computed the patch type for this type (handles recursion)
+    const cached = context.get(type);
+    if (cached !== undefined) {
+        return cached;
+    }
+    const t = type;
+    if (t.type === "Never" ||
+        t.type === "Null" ||
+        t.type === "Boolean" ||
+        t.type === "Integer" ||
+        t.type === "Float" ||
+        t.type === "String" ||
+        t.type === "DateTime" ||
+        t.type === "Blob" ||
+        t.type === "Vector" ||
+        t.type === "Matrix") {
+        return VariantType({
+            unchanged: NullType,
+            replace: StructType({ before: type, after: type }),
+        });
+    }
+    else if (t.type === "Array") {
+        const elementType = t.value;
+        const elementPatchType = PatchType(elementType, context);
+        const operationType = VariantType({
+            delete: elementType,
+            insert: elementType,
+            update: elementPatchType,
+        });
+        const entryType = StructType({
+            key: IntegerType,
+            offset: IntegerType,
+            operation: operationType,
+        });
+        return VariantType({
+            unchanged: NullType,
+            replace: StructType({ before: type, after: type }),
+            patch: ArrayType(entryType),
+        });
+    }
+    else if (t.type === "Set") {
+        const keyType = t.key;
+        const operationType = VariantType({
+            delete: NullType,
+            insert: NullType,
+        });
+        return VariantType({
+            unchanged: NullType,
+            replace: StructType({ before: type, after: type }),
+            patch: DictType(keyType, operationType),
+        });
+    }
+    else if (t.type === "Dict") {
+        const keyType = t.key;
+        const valueType = t.value;
+        const valuePatchType = PatchType(valueType, context);
+        const operationType = VariantType({
+            delete: valueType,
+            insert: valueType,
+            update: valuePatchType,
+        });
+        return VariantType({
+            unchanged: NullType,
+            replace: StructType({ before: type, after: type }),
+            patch: DictType(keyType, operationType),
+        });
+    }
+    else if (t.type === "Struct") {
+        const fieldTypes = t.fields;
+        const patchFields = {};
+        for (const [name, fieldType] of Object.entries(fieldTypes)) {
+            patchFields[name] = PatchType(fieldType, context);
+        }
+        return VariantType({
+            unchanged: NullType,
+            replace: StructType({ before: type, after: type }),
+            patch: StructType(patchFields),
+        });
+    }
+    else if (t.type === "Variant") {
+        const caseTypes = t.cases;
+        const patchCases = {};
+        for (const [name, caseType] of Object.entries(caseTypes)) {
+            patchCases[name] = PatchType(caseType, context);
+        }
+        return VariantType({
+            unchanged: NullType,
+            replace: StructType({ before: type, after: type }),
+            patch: VariantType(patchCases),
+        });
+    }
+    else if (t.type === "Ref") {
+        const innerType = t.value;
+        const innerPatchType = PatchType(innerType, context);
+        return VariantType({
+            unchanged: NullType,
+            replace: StructType({ before: type, after: type }),
+            patch: innerPatchType,
+        });
+    }
+    else if (t.type === "Recursive") {
+        // Check if we've already seen this type (handles circular back-references)
+        const cached = context.get(type);
+        if (cached !== undefined) {
+            return cached;
+        }
+        // For back-references within the recursive structure, use replace-only semantics
+        // Register this BEFORE recursing so circular refs are caught
+        const replaceOnlyType = VariantType({
+            unchanged: NullType,
+            replace: StructType({ before: type, after: type }),
+        });
+        context.set(type, replaceOnlyType);
+        // Recurse into the node - the outer structure gets structural patching
+        return PatchType(t.node, context);
+    }
+    else if (t.type === "Function" || t.type === "AsyncFunction") {
+        return VariantType({
+            unchanged: NullType,
+            replace: StructType({ before: type, after: type }),
+        });
+    }
+    else {
+        throw new Error(`Unhandled type in PatchType: ${t.type}`);
+    }
+}
+//# sourceMappingURL=type_of_patch.js.map

package/dist/src/patch/type_of_patch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"type_of_patch.js","sourceRoot":"","sources":["../../../src/patch/type_of_patch.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;GAIG;AAEH,OAAO,EAEL,QAAQ,EACR,UAAU,EACV,WAAW,EACX,SAAS,EACT,QAAQ,EACR,WAAW,GACZ,MAAM,aAAa,CAAC;AACrB,OAAO,EAAsB,iBAAiB,EAAE,MAAM,oBAAoB,CAAC;AAC3E,OAAO,EAAE,SAAS,EAAE,MAAM,0BAA0B,CAAC;AAerD,MAAM,UAAU,SAAS,CAAC,IAA8B,EAAE,GAA6B;IACrF,IAAI,SAAS,CAAC,IAAI,CAAC;QAAE,IAAI,GAAG,iBAAiB,CAAC,IAAqB,CAAC,CAAC;IACrE,kDAAkD;IAClD,MAAM,OAAO,GAAG,GAAG,IAAI,IAAI,GAAG,EAAsB,CAAC;IAErD,mFAAmF;IACnF,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACjC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;QACzB,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,MAAM,CAAC,GAAG,IAAgB,CAAC;IAE3B,IACE,CAAC,CAAC,IAAI,KAAK,OAAO;QAClB,CAAC,CAAC,IAAI,KAAK,MAAM;QACjB,CAAC,CAAC,IAAI,KAAK,SAAS;QACpB,CAAC,CAAC,IAAI,KAAK,SAAS;QACpB,CAAC,CAAC,IAAI,KAAK,OAAO;QAClB,CAAC,CAAC,IAAI,KAAK,QAAQ;QACnB,CAAC,CAAC,IAAI,KAAK,UAAU;QACrB,CAAC,CAAC,IAAI,KAAK,MAAM;QACjB,CAAC,CAAC,IAAI,KAAK,QAAQ;QACnB,CAAC,CAAC,IAAI,KAAK,QAAQ,EACnB,CAAC;QACD,OAAO,WAAW,CAAC;YACjB,SAAS,EAAE,QAAQ;YACnB,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;SACnD,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,CAAC,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;QAC9B,MAAM,WAAW,GAAG,CAAC,CAAC,KAAK,CAAC;QAC5B,MAAM,gBAAgB,GAAG,SAAS,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;QACzD,MAAM,aAAa,GAAG,WAAW,CAAC;YAChC,MAAM,EAAE,WAAW;YACnB,MAAM,EAAE,WAAW;YACnB,MAAM,EAAE,gBAAgB;SACzB,CAAC,CAAC;QACH,MAAM,SAAS,GAAG,UAAU,CAAC;YAC3B,GAAG,EAAE,WAAW;YAChB,MAAM,EAAE,WAAW;YACnB,SAAS,EAAE,aAAa;SACzB,CAAC,CAAC;QACH,OAAO,WAAW,CAAC;YACjB,SAAS,EAAE,QAAQ;YACnB,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAClD,KAAK,EAAE,SAAS,CAAC,SAAS,CAAC;SAC5B,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC5B,MAAM,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC;QACtB,MAAM,aAAa,GAAG,WAAW,CAAC;YAChC,MAAM,EAAE,QAAQ;YAChB,MAAM,EAAE,QAAQ;SACjB,CAAC,CAAC;QACH,OAAO,WAAW,CAAC;YACjB,SAAS,EAAE,QAAQ;YACnB,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAClD,KAAK,EAAE,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC;SACxC,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,CAAC,CAAC,GAAG,CAAC;QACtB,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC;QAC1B,MAAM,cAAc,GAAG,SAAS,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QACrD,MAAM,aAAa,GAAG,WAAW,CAAC;YAChC,MAAM,EAAE,SAAS;YACjB,MAAM,EAAE,SAAS;YACjB,MAAM,EAAE,cAAc;SACvB,CAAC,CAAC;QACH,OAAO,WAAW,CAAC;YACjB,SAAS,EAAE,QAAQ;YACnB,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAClD,KAAK,EAAE,QAAQ,CAAC,OAAO,EAAE,aAAa,CAAC;SACxC,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,CAAC,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;QAC/B,MAAM,UAAU,GAAG,CAAC,CAAC,MAAM,CAAC;QAC5B,MAAM,WAAW,GAA6B,EAAE,CAAC;QACjD,KAAK,MAAM,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;YAC3D,WAAW,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QACpD,CAAC;QACD,OAAO,WAAW,CAAC;YACjB,SAAS,EAAE,QAAQ;YACnB,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAClD,KAAK,EAAE,UAAU,CAAC,WAAW,CAAC;SAC/B,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAChC,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC;QAC1B,MAAM,UAAU,GAA6B,EAAE,CAAC;QAChD,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;YACzD,UAAU,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAClD,CAAC;QACD,OAAO,WAAW,CAAC;YACjB,SAAS,EAAE,QAAQ;YACnB,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAClD,KAAK,EAAE,WAAW,CAAC,UAAU,CAAC;SAC/B,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,CAAC,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QAC5B,MAAM,SAAS,GAAG,CAAC,CAAC,KAAK,CAAC;QAC1B,MAAM,cAAc,GAAG,SAAS,CAAC,SAAS,EAAE,OAAO,CAAC,CAAC;QACrD,OAAO,WAAW,CAAC;YACjB,SAAS,EAAE,QAAQ;YACnB,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;YAClD,KAAK,EAAE,cAAc;SACtB,CAAC,CAAC;IACL,CAAC;SAAM,IAAI,CAAC,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QAClC,2EAA2E;QAC3E,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,iFAAiF;QACjF,6DAA6D;QAC7D,MAAM,eAAe,GAAG,WAAW,CAAC;YAClC,SAAS,EAAE,QAAQ;YACnB,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;SACnD,CAAC,CAAC;QACH,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC;QAEnC,uEAAuE;QACvE,OAAO,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;IACpC,CAAC;SAAM,IAAI,CAAC,CAAC,IAAI,KAAK,UAAU,IAAI,CAAC,CAAC,IAAI,KAAK,eAAe,EAAE,CAAC;QAC/D,OAAO,WAAW,CAAC;YACjB,SAAS,EAAE,QAAQ;YACnB,OAAO,EAAE,UAAU,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;SACnD,CAAC,CAAC;IACL,CAAC;SAAM,CAAC;QACN,MAAM,IAAI,KAAK,CAAC,gCAAiC,CAAc,CAAC,IAAI,EAAE,CAAC,CAAC;IAC1E,CAAC;AACH,CAAC"}

package/dist/src/patch/types.d.ts

@@ -0,0 +1,220 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+/**
+ * Shared types and context interfaces for the patch system.
+ *
+ * @module
+ */
+import type { EastTypeValue } from "../type_of_type.js";
+import type { EastType, NullType, NeverType, BooleanType, IntegerType, FloatType, StringType, DateTimeType, BlobType, RefType, ArrayType, SetType, DictType, StructType, VariantType, RecursiveType } from "../types.js";
+import type { variant as VariantValue } from "../containers/variant.js";
+/**
+ * Context for building diff handlers with proper recursive type support.
+ * Handlers are built in parallel so that when we encounter a `.Recursive n`
+ * back-reference, we can look up the appropriate handler from any array.
+ */
+export interface DiffContext {
+    /** Diff handlers: (before, after) => Patch */
+    diff: Array<(before: any, after: any) => any>;
+    /** Types at each level - used to call equalFor/compareFor on Recursive back-references */
+    types: Array<EastTypeValue>;
+    /** Equality handlers for recursive types, keyed by type id */
+    equal: Map<bigint, (a: any, b: any) => boolean>;
+}
+/**
+ * Context for building apply handlers with proper recursive type support.
+ */
+export interface ApplyContext {
+    /** Apply handlers: (base, patch) => value */
+    apply: Array<(base: any, patch: any) => any>;
+    /** Types at each level */
+    types: Array<EastTypeValue>;
+    /** Equality handlers for recursive types, keyed by type id */
+    equal: Map<bigint, (a: any, b: any) => boolean>;
+    /** Print handlers built in parallel - used for error messages */
+    print: Map<bigint, (value: any) => string>;
+}
+/**
+ * Context for building compose handlers with proper recursive type support.
+ */
+export interface ComposeContext {
+    /** Compose handlers: (first, second) => combined patch */
+    compose: Array<(first: any, second: any) => any>;
+    /** Apply handlers built in parallel - used instead of calling applyFor with fresh context */
+    apply: Array<(base: any, patch: any) => any>;
+    /** Invert handlers built in parallel - used instead of calling invertFor with fresh context */
+    invert: Array<(patch: any) => any>;
+    /** Types at each level */
+    types: Array<EastTypeValue>;
+    /** Equality handlers for recursive types, keyed by type id */
+    equal: Map<bigint, (a: any, b: any) => boolean>;
+    /** Print handlers built in parallel - used for error messages */
+    print: Map<bigint, (value: any) => string>;
+}
+/**
+ * Context for building invert handlers with proper recursive type support.
+ */
+export interface InvertContext {
+    /** Invert handlers: (patch) => inverted patch */
+    invert: Array<(patch: any) => any>;
+    /** Types at each level */
+    types: Array<EastTypeValue>;
+    /** Equality handlers for recursive types, keyed by type id */
+    equal: Map<bigint, (a: any, b: any) => boolean>;
+}
+/**
+ * A single conflict — two patches against the same base touch the same
+ * leaf with different intentions.
+ */
+export interface Conflict {
+    /**
+     * Dot/bracket-encoded path from the root of T down to the conflicting
+     * leaf. Format:
+     *   - struct field: dot-joined name (e.g. `policy.maxWeeklyHours`)
+     *   - array element: bracket-suffixed (e.g. `roster[2]`)
+     *   - dict entry:    brace-suffixed (e.g. `prices{Cabernet}`)
+     *   - variant case:  at-prefixed   (e.g. `status@active`)
+     *   - root:          empty string
+     */
+    path: string;
+    /** patchA's intended value at this path (whole patch operation, e.g. `{type:"replace",value:{before,after}}`). */
+    valueA: any;
+    /** patchB's intended value at this path. */
+    valueB: any;
+}
+/**
+ * Per-conflict resolution that the caller supplies to
+ * `mergeWithResolutionsFor`. Keys are paths (matching `Conflict.path`).
+ */
+export type Resolution = {
+    type: "keepA";
+} | {
+    type: "keepB";
+} | {
+    type: "manual";
+    value: any;
+};
+/**
+ * Context for building merge handlers with proper recursive type support.
+ *
+ * Carries only the merge-handler stack + types + equality cache. Unlike
+ * `ComposeContext`, merge does NOT need apply/invert handlers — every merge
+ * case is either a clean recursive walk over patch shapes, or a conflict that
+ * the caller resolves; we never need to apply or invert a sub-patch as part of
+ * merging.
+ */
+export interface MergeContext {
+    /** Merge handlers, indexed by type-stack depth. Used for recursive-type
+     *  back-references. The signature is the internal walker's; not exposed in
+     *  the public API. */
+    merge: Array<(a: VariantValue<string, any>, b: VariantValue<string, any>, path: string, accConflict: (path: string, vA: any, vB: any) => void, lookup: ((path: string) => Resolution | undefined) | null) => VariantValue<string, any>>;
+    /** Types at each level — used to resolve `Recursive n` back-references. */
+    types: Array<EastTypeValue>;
+    /** Equality handlers for recursive types, keyed by type id. Threaded
+     *  into every nested `equalFor(...)` call. */
+    equal: Map<bigint, (a: any, b: any) => boolean>;
+}
+/** Type-level computation of the patch type for a given East type. */
+export type PatchTypeOf<T extends EastType> = T extends NeverType | NullType | BooleanType | IntegerType | FloatType | StringType | DateTimeType | BlobType | import("../types.js").VectorType<any> | import("../types.js").MatrixType<any> ? VariantType<{
+    unchanged: NullType;
+    replace: StructType<{
+        before: T;
+        after: T;
+    }>;
+}> : T extends RefType<infer V extends EastType> ? VariantType<{
+    unchanged: NullType;
+    replace: StructType<{
+        before: T;
+        after: T;
+    }>;
+    patch: PatchTypeOf<V>;
+}> : T extends ArrayType<infer E extends EastType> ? VariantType<{
+    unchanged: NullType;
+    replace: StructType<{
+        before: T;
+        after: T;
+    }>;
+    patch: ArrayType<StructType<{
+        key: IntegerType;
+        offset: IntegerType;
+        operation: VariantType<{
+            delete: E;
+            insert: E;
+            update: PatchTypeOf<E>;
+        }>;
+    }>>;
+}> : T extends SetType<infer K> ? VariantType<{
+    unchanged: NullType;
+    replace: StructType<{
+        before: T;
+        after: T;
+    }>;
+    patch: DictType<K, VariantType<{
+        delete: NullType;
+        insert: NullType;
+    }>>;
+}> : T extends DictType<infer K, infer V extends EastType> ? VariantType<{
+    unchanged: NullType;
+    replace: StructType<{
+        before: T;
+        after: T;
+    }>;
+    patch: DictType<K, VariantType<{
+        delete: V;
+        insert: V;
+        update: PatchTypeOf<V>;
+    }>>;
+}> : T extends StructType<infer Fields> ? VariantType<{
+    unchanged: NullType;
+    replace: StructType<{
+        before: T;
+        after: T;
+    }>;
+    patch: StructType<{
+        [K in keyof Fields]: Fields[K] extends EastType ? PatchTypeOf<Fields[K]> : never;
+    }>;
+}> : T extends VariantType<infer Cases> ? VariantType<{
+    unchanged: NullType;
+    replace: StructType<{
+        before: T;
+        after: T;
+    }>;
+    patch: VariantType<{
+        [K in keyof Cases]: Cases[K] extends EastType ? PatchTypeOf<Cases[K]> : never;
+    }>;
+}> : T extends RecursiveType<infer _Node extends EastType> ? VariantType<{
+    unchanged: NullType;
+    replace: StructType<{
+        before: T;
+        after: T;
+    }>;
+}> : VariantType<{
+    unchanged: NullType;
+    replace: StructType<{
+        before: T;
+        after: T;
+    }>;
+}>;
+/**
+ * Error thrown when patch operations encounter conflicts.
+ *
+ * For merge operations, the `conflicts` field lists every detected conflict
+ * with its path and the two divergent patch arms. The caller decides how to
+ * format / render this information.
+ */
+export declare class ConflictError extends Error {
+    /** Detailed conflict list (only populated by merge / merge-with-resolutions). */
+    readonly conflicts: ReadonlyArray<Conflict>;
+    constructor(message: string, conflicts?: ReadonlyArray<Conflict>);
+}
+/**
+ * Compute the Longest Common Subsequence of two arrays.
+ * @internal
+ */
+export declare function computeLCS<T>(before: T[], after: T[], equal: (a: T, b: T) => boolean): {
+    beforeIndices: number[];
+    afterIndices: number[];
+};
+//# sourceMappingURL=types.d.ts.map

package/dist/src/patch/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/patch/types.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;GAIG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACxD,OAAO,KAAK,EACV,QAAQ,EACR,QAAQ,EACR,SAAS,EACT,WAAW,EACX,WAAW,EACX,SAAS,EACT,UAAU,EACV,YAAY,EACZ,QAAQ,EACR,OAAO,EACP,SAAS,EACT,OAAO,EACP,QAAQ,EACR,UAAU,EACV,WAAW,EACX,aAAa,EACd,MAAM,aAAa,CAAC;AACrB,OAAO,KAAK,EAAE,OAAO,IAAI,YAAY,EAAE,MAAM,0BAA0B,CAAC;AAMxE;;;;GAIG;AACH,MAAM,WAAW,WAAW;IAC1B,8CAA8C;IAC9C,IAAI,EAAE,KAAK,CAAC,CAAC,MAAM,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC;IAC9C,0FAA0F;IAC1F,KAAK,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;IAC5B,8DAA8D;IAC9D,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,KAAK,OAAO,CAAC,CAAC;CACjD;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,6CAA6C;IAC7C,KAAK,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC;IAC7C,0BAA0B;IAC1B,KAAK,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;IAC5B,8DAA8D;IAC9D,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,KAAK,OAAO,CAAC,CAAC;IAChD,iEAAiE;IACjE,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,MAAM,CAAC,CAAC;CAC5C;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B,0DAA0D;IAC1D,OAAO,EAAE,KAAK,CAAC,CAAC,KAAK,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC;IACjD,6FAA6F;IAC7F,KAAK,EAAE,KAAK,CAAC,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC;IAC7C,+FAA+F;IAC/F,MAAM,EAAE,KAAK,CAAC,CAAC,KAAK,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC;IACnC,0BAA0B;IAC1B,KAAK,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;IAC5B,8DAA8D;IAC9D,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,KAAK,OAAO,CAAC,CAAC;IAChD,iEAAiE;IACjE,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,KAAK,EAAE,GAAG,KAAK,MAAM,CAAC,CAAC;CAC5C;AAED;;GAEG;AACH,MAAM,WAAW,aAAa;IAC5B,iDAAiD;IACjD,MAAM,EAAE,KAAK,CAAC,CAAC,KAAK,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC;IACnC,0BAA0B;IAC1B,KAAK,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;IAC5B,8DAA8D;IAC9D,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,KAAK,OAAO,CAAC,CAAC;CACjD;AAED;;;GAGG;AACH,MAAM,WAAW,QAAQ;IACvB;;;;;;;;OAQG;IACH,IAAI,EAAE,MAAM,CAAC;IACb,kHAAkH;IAClH,MAAM,EAAE,GAAG,CAAC;IACZ,4CAA4C;IAC5C,MAAM,EAAE,GAAG,CAAC;CACb;AAED;;;GAGG;AACH,MAAM,MAAM,UAAU,GAClB;IAAE,IAAI,EAAE,OAAO,CAAA;CAAE,GACjB;IAAE,IAAI,EAAE,OAAO,CAAA;CAAE,GACjB;IAAE,IAAI,EAAE,QAAQ,CAAC;IAAC,KAAK,EAAE,GAAG,CAAA;CAAE,CAAC;AAEnC;;;;;;;;GAQG;AACH,MAAM,WAAW,YAAY;IAC3B;;0BAEsB;IACtB,KAAK,EAAE,KAAK,CAAC,CACX,CAAC,EAAE,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,EAC5B,CAAC,EAAE,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,EAC5B,IAAI,EAAE,MAAM,EACZ,WAAW,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,GAAG,KAAK,IAAI,EACrD,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,MAAM,KAAK,UAAU,GAAG,SAAS,CAAC,GAAG,IAAI,KACtD,YAAY,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC;IAChC,2EAA2E;IAC3E,KAAK,EAAE,KAAK,CAAC,aAAa,CAAC,CAAC;IAC5B;kDAC8C;IAC9C,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,GAAG,KAAK,OAAO,CAAC,CAAC;CACjD;AAMD,sEAAsE;AACtE,MAAM,MAAM,WAAW,CAAC,CAAC,SAAS,QAAQ,IACxC,CAAC,SAAS,SAAS,GAAG,QAAQ,GAAG,WAAW,GAAG,WAAW,GAAG,SAAS,GAAG,UAAU,GAAG,YAAY,GAAG,QAAQ,GAAG,OAAO,aAAa,EAAE,UAAU,CAAC,GAAG,CAAC,GAAG,OAAO,aAAa,EAAE,UAAU,CAAC,GAAG,CAAC,GACzL,WAAW,CAAC;IAAE,SAAS,EAAE,QAAQ,CAAC;IAAC,OAAO,EAAE,UAAU,CAAC;QAAE,MAAM,EAAE,CAAC,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAC,CAAA;CAAE,CAAC,GACpF,CAAC,SAAS,OAAO,CAAC,MAAM,CAAC,SAAS,QAAQ,CAAC,GACzC,WAAW,CAAC;IAAE,SAAS,EAAE,QAAQ,CAAC;IAAC,OAAO,EAAE,UAAU,CAAC;QAAE,MAAM,EAAE,CAAC,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAC,CAAC;IAAC,KAAK,EAAE,WAAW,CAAC,CAAC,CAAC,CAAA;CAAE,CAAC,GAC3G,CAAC,SAAS,SAAS,CAAC,MAAM,CAAC,SAAS,QAAQ,CAAC,GAC3C,WAAW,CAAC;IACV,SAAS,EAAE,QAAQ,CAAC;IACpB,OAAO,EAAE,UAAU,CAAC;QAAE,MAAM,EAAE,CAAC,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAC,CAAC;IAC7C,KAAK,EAAE,SAAS,CAAC,UAAU,CAAC;QAC1B,GAAG,EAAE,WAAW,CAAC;QACjB,MAAM,EAAE,WAAW,CAAC;QACpB,SAAS,EAAE,WAAW,CAAC;YAAE,MAAM,EAAE,CAAC,CAAC;YAAC,MAAM,EAAE,CAAC,CAAC;YAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,CAAA;SAAE,CAAC,CAAC;KAC1E,CAAC,CAAC,CAAC;CACL,CAAC,GACJ,CAAC,SAAS,OAAO,CAAC,MAAM,CAAC,CAAC,GACxB,WAAW,CAAC;IACV,SAAS,EAAE,QAAQ,CAAC;IACpB,OAAO,EAAE,UAAU,CAAC;QAAE,MAAM,EAAE,CAAC,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAC,CAAC;IAC7C,KAAK,EAAE,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC;QAAE,MAAM,EAAE,QAAQ,CAAC;QAAC,MAAM,EAAE,QAAQ,CAAA;KAAE,CAAC,CAAC,CAAC;CACzE,CAAC,GACJ,CAAC,SAAS,QAAQ,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC,SAAS,QAAQ,CAAC,GACnD,WAAW,CAAC;IACV,SAAS,EAAE,QAAQ,CAAC;IACpB,OAAO,EAAE,UAAU,CAAC;QAAE,MAAM,EAAE,CAAC,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAC,CAAC;IAC7C,KAAK,EAAE,QAAQ,CAAC,CAAC,EAAE,WAAW,CAAC;QAAE,MAAM,EAAE,CAAC,CAAC;QAAC,MAAM,EAAE,CAAC,CAAC;QAAC,MAAM,EAAE,WAAW,CAAC,CAAC,CAAC,CAAA;KAAE,CAAC,CAAC,CAAC;CACnF,CAAC,GACJ,CAAC,SAAS,UAAU,CAAC,MAAM,MAAM,CAAC,GAChC,WAAW,CAAC;IACV,SAAS,EAAE,QAAQ,CAAC;IACpB,OAAO,EAAE,UAAU,CAAC;QAAE,MAAM,EAAE,CAAC,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAC,CAAC;IAC7C,KAAK,EAAE,UAAU,CAAC;SAAG,CAAC,IAAI,MAAM,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,SAAS,QAAQ,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;KAAE,CAAC,CAAC;CACzG,CAAC,GACJ,CAAC,SAAS,WAAW,CAAC,MAAM,KAAK,CAAC,GAChC,WAAW,CAAC;IACV,SAAS,EAAE,QAAQ,CAAC;IACpB,OAAO,EAAE,UAAU,CAAC;QAAE,MAAM,EAAE,CAAC,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAC,CAAC;IAC7C,KAAK,EAAE,WAAW,CAAC;SAAG,CAAC,IAAI,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,SAAS,QAAQ,GAAG,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,KAAK;KAAE,CAAC,CAAC;CACvG,CAAC,GACJ,CAAC,SAAS,aAAa,CAAC,MAAM,KAAK,SAAS,QAAQ,CAAC,GACnD,WAAW,CAAC;IACV,SAAS,EAAE,QAAQ,CAAC;IACpB,OAAO,EAAE,UAAU,CAAC;QAAE,MAAM,EAAE,CAAC,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAC,CAAC;CAE9C,CAAC,GACJ,WAAW,CAAC;IAAE,SAAS,EAAE,QAAQ,CAAC;IAAC,OAAO,EAAE,UAAU,CAAC;QAAE,MAAM,EAAE,CAAC,CAAC;QAAC,KAAK,EAAE,CAAC,CAAA;KAAE,CAAC,CAAA;CAAE,CAAC,CAAC;AAEvF;;;;;;GAMG;AACH,qBAAa,aAAc,SAAQ,KAAK;IACtC,iFAAiF;IACjF,QAAQ,CAAC,SAAS,EAAE,aAAa,CAAC,QAAQ,CAAC,CAAC;gBAEhC,OAAO,EAAE,MAAM,EAAE,SAAS,GAAE,aAAa,CAAC,QAAQ,CAAM;CAKrE;AAOD;;;GAGG;AACH,wBAAgB,UAAU,CAAC,CAAC,EAC1B,MAAM,EAAE,CAAC,EAAE,EACX,KAAK,EAAE,CAAC,EAAE,EACV,KAAK,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,OAAO,GAC7B;IAAE,aAAa,EAAE,MAAM,EAAE,CAAC;IAAC,YAAY,EAAE,MAAM,EAAE,CAAA;CAAE,CAmCrD"}

package/dist/src/patch/types.js

@@ -0,0 +1,62 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+/**
+ * Error thrown when patch operations encounter conflicts.
+ *
+ * For merge operations, the `conflicts` field lists every detected conflict
+ * with its path and the two divergent patch arms. The caller decides how to
+ * format / render this information.
+ */
+export class ConflictError extends Error {
+    /** Detailed conflict list (only populated by merge / merge-with-resolutions). */
+    conflicts;
+    constructor(message, conflicts = []) {
+        super(message);
+        this.name = "ConflictError";
+        this.conflicts = conflicts;
+    }
+}
+// ============================================================================
+// Helper functions
+// ============================================================================
+/**
+ * Compute the Longest Common Subsequence of two arrays.
+ * @internal
+ */
+export function computeLCS(before, after, equal) {
+    const m = before.length;
+    const n = after.length;
+    const dp = Array.from({ length: m + 1 }, () => Array(n + 1).fill(0));
+    for (let i = 1; i <= m; i++) {
+        for (let j = 1; j <= n; j++) {
+            if (equal(before[i - 1], after[j - 1])) {
+                dp[i][j] = dp[i - 1][j - 1] + 1;
+            }
+            else {
+                dp[i][j] = Math.max(dp[i - 1][j], dp[i][j - 1]);
+            }
+        }
+    }
+    const beforeIndices = [];
+    const afterIndices = [];
+    let i = m;
+    let j = n;
+    while (i > 0 && j > 0) {
+        if (equal(before[i - 1], after[j - 1])) {
+            beforeIndices.unshift(i - 1);
+            afterIndices.unshift(j - 1);
+            i--;
+            j--;
+        }
+        else if (dp[i - 1][j] > dp[i][j - 1]) {
+            i--;
+        }
+        else {
+            j--;
+        }
+    }
+    return { beforeIndices, afterIndices };
+}
+//# sourceMappingURL=types.js.map

package/dist/src/patch/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/patch/types.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAwMH;;;;;;GAMG;AACH,MAAM,OAAO,aAAc,SAAQ,KAAK;IACtC,iFAAiF;IACxE,SAAS,CAA0B;IAE5C,YAAY,OAAe,EAAE,YAAqC,EAAE;QAClE,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,eAAe,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;CACF;AAED,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAG/E;;;GAGG;AACH,MAAM,UAAU,UAAU,CACxB,MAAW,EACX,KAAU,EACV,KAA8B;IAE9B,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC;IACxB,MAAM,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC;IAEvB,MAAM,EAAE,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IAEjF,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC5B,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,EAAE,CAAC;gBACzC,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,GAAG,CAAC,CAAC;YACrC,CAAC;iBAAM,CAAC;gBACN,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAE,EAAE,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC;YACvD,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,MAAM,YAAY,GAAa,EAAE,CAAC;IAClC,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,CAAC,GAAG,CAAC,CAAC;IAEV,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;QACtB,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,EAAE,CAAC;YACzC,aAAa,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC7B,YAAY,CAAC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5B,CAAC,EAAE,CAAC;YACJ,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC,CAAC,CAAE,GAAG,EAAE,CAAC,CAAC,CAAE,CAAC,CAAC,GAAG,CAAC,CAAE,EAAE,CAAC;YAC3C,CAAC,EAAE,CAAC;QACN,CAAC;aAAM,CAAC;YACN,CAAC,EAAE,CAAC;QACN,CAAC;IACH,CAAC;IAED,OAAO,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC;AACzC,CAAC"}

package/dist/src/patch/validate.d.ts

@@ -0,0 +1,44 @@
+/**
+ * Copyright (c) 2025 Elara AI Pty Ltd
+ * Dual-licensed under AGPL-3.0 and commercial license. See LICENSE for details.
+ */
+/**
+ * `validatePatchFor` — non-throwing per-leaf validation of a patch against a
+ * base value. Returns the list of paths where the patch's expected `before`
+ * (or expected key presence/absence) disagrees with `base`'s actual value.
+ *
+ * This fills the gap between `applyFor` (which throws on the first stale op,
+ * losing per-leaf granularity) and `mergeFor` (which compares two patches
+ * against a common ancestor — different problem).
+ *
+ * Empty result list ⇒ `applyFor(type)(base, patch)` would succeed cleanly.
+ *
+ * @module
+ */
+import { type EastTypeValue } from "../type_of_type.js";
+import type { EastType } from "../types.js";
+import { type PatchPath } from "./path.js";
+/**
+ * One per-leaf disagreement between a patch and a base value.
+ *
+ * @property path     - structured path from the root of the base/patch.
+ * @property op       - which patch operation didn't apply cleanly.
+ * @property expected - what the patch expected at this path.
+ *                      For `replace`/`delete`/`update`: the patch's `before`.
+ *                      For `insert`: `undefined` (insert expects absence).
+ * @property actual   - what the base actually has at this path.
+ *                      `undefined` when the key/index is missing.
+ */
+export interface PatchConflict {
+    readonly path: PatchPath;
+    readonly op: "replace" | "delete" | "insert" | "update";
+    readonly expected: unknown;
+    readonly actual: unknown;
+}
+/**
+ * Build a validator for patches over `type`. The returned closure walks
+ * `base` and `patch` in parallel and accumulates per-leaf conflicts; never
+ * throws. Empty result ⇒ patch applies cleanly.
+ */
+export declare function validatePatchFor(type: EastTypeValue | EastType): (base: any, patch: any) => PatchConflict[];
+//# sourceMappingURL=validate.d.ts.map

package/dist/src/patch/validate.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validate.d.ts","sourceRoot":"","sources":["../../../src/patch/validate.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;;;;;;;;;;;GAYG;AAEH,OAAO,EAAmB,KAAK,aAAa,EAAE,MAAM,oBAAoB,CAAC;AACzE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAI5C,OAAO,EACL,KAAK,SAAS,EAKf,MAAM,WAAW,CAAC;AAEnB;;;;;;;;;;GAUG;AACH,MAAM,WAAW,aAAa;IAC5B,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC;IACzB,QAAQ,CAAC,EAAE,EAAE,SAAS,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,CAAC;IACxD,QAAQ,CAAC,QAAQ,EAAE,OAAO,CAAC;IAC3B,QAAQ,CAAC,MAAM,EAAE,OAAO,CAAC;CAC1B;AAED;;;;GAIG;AACH,wBAAgB,gBAAgB,CAAC,IAAI,EAAE,aAAa,GAAG,QAAQ,GAAG,CAAC,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,GAAG,KAAK,aAAa,EAAE,CAO3G"}