@astrale-os/kernel-core 0.4.1

package/dist/graph/sync/matching.d.ts

@@ -0,0 +1,53 @@
+/**
+ * MatchingStrategy — caller-declared identity for diff/reconcile.
+ *
+ * SPEC §8.0. Replaces the hardcoded `externalId`-property lookup with a
+ * pluggable key function. A strategy returns a string for every entity it
+ * can match on, or `undefined` for entities it can't key. Two entities
+ * match iff their strategies yield the same non-undefined key.
+ *
+ * **Totality** distinguishes:
+ * - `total` — always returns a key. `byPath` qualifies.
+ *   No entity ends up in the `untracked` arm of `Change<T>`.
+ * - `partial` — may return `undefined`. `byProp` qualifies (the entity may
+ *   lack the target property). Base-side entities returning `undefined`
+ *   populate the `untracked` op of `Change<T>`.
+ *
+ * **Symmetry constraint.** A strategy used for `DiffConfig.nodes` must be
+ * a pure function of fields present on both `Node` (base) and `NodeSpec`
+ * (incoming). Strategies that read only `class` / `path` / `props` satisfy
+ * this trivially. Strategies reading `id` (base-only) break symmetry and
+ * are rejected.
+ */
+import type { Properties } from '#graph/props';
+import type { AbsolutePath } from '#graph/tree';
+export interface MatchingStrategy<T> {
+    readonly name: string;
+    readonly totality: 'total' | 'partial';
+    key(entity: T): string | undefined;
+}
+/**
+ * Namespaced built-in strategies. Use `MatchingStrategy.byProp('k')` etc.
+ * Avoids bare-import footguns and leaves room to extend.
+ */
+export declare const MatchingStrategy: {
+    /**
+     * Key by a property on `entity.props`. Partial: entities missing the
+     * property yield `undefined` and land in `untracked`.
+     */
+    byProp(propKey: string): MatchingStrategy<{
+        readonly props: Readonly<Properties>;
+    }>;
+    /**
+     * Key by primary path. Total: every Node has an AbsolutePath (I2).
+     * Use for snapshot-vs-snapshot diffs that don't carry remote metadata.
+     */
+    byPath: {
+        name: string;
+        totality: 'total';
+        key: (e: {
+            readonly path: AbsolutePath;
+        }) => string;
+    };
+};
+//# sourceMappingURL=matching.d.ts.map

package/dist/graph/sync/matching.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"matching.d.ts","sourceRoot":"","sources":["../../../graph/sync/matching.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,cAAc,CAAA;AAC9C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAA;AAE/C,MAAM,WAAW,gBAAgB,CAAC,CAAC;IACjC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAA;IACrB,QAAQ,CAAC,QAAQ,EAAE,OAAO,GAAG,SAAS,CAAA;IACtC,GAAG,CAAC,MAAM,EAAE,CAAC,GAAG,MAAM,GAAG,SAAS,CAAA;CACnC;AAQD;;;GAGG;AACH,eAAO,MAAM,gBAAgB;IAC3B;;;OAGG;oBACa,MAAM,GAAG,gBAAgB,CAAC;QAAE,QAAQ,CAAC,KAAK,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAA;KAAE,CAAC;IAQnF;;;OAGG;;;kBAGS,OAAO;iBACR;YAAE,QAAQ,CAAC,IAAI,EAAE,YAAY,CAAA;SAAE;;CAE3C,CAAA"}

package/dist/graph/sync/matching.js

@@ -0,0 +1,54 @@
+/**
+ * MatchingStrategy — caller-declared identity for diff/reconcile.
+ *
+ * SPEC §8.0. Replaces the hardcoded `externalId`-property lookup with a
+ * pluggable key function. A strategy returns a string for every entity it
+ * can match on, or `undefined` for entities it can't key. Two entities
+ * match iff their strategies yield the same non-undefined key.
+ *
+ * **Totality** distinguishes:
+ * - `total` — always returns a key. `byPath` qualifies.
+ *   No entity ends up in the `untracked` arm of `Change<T>`.
+ * - `partial` — may return `undefined`. `byProp` qualifies (the entity may
+ *   lack the target property). Base-side entities returning `undefined`
+ *   populate the `untracked` op of `Change<T>`.
+ *
+ * **Symmetry constraint.** A strategy used for `DiffConfig.nodes` must be
+ * a pure function of fields present on both `Node` (base) and `NodeSpec`
+ * (incoming). Strategies that read only `class` / `path` / `props` satisfy
+ * this trivially. Strategies reading `id` (base-only) break symmetry and
+ * are rejected.
+ */
+function readString(props, key) {
+    if (!props)
+        return undefined;
+    const v = props[key];
+    return typeof v === 'string' && v.length > 0 ? v : undefined;
+}
+/**
+ * Namespaced built-in strategies. Use `MatchingStrategy.byProp('k')` etc.
+ * Avoids bare-import footguns and leaves room to extend.
+ */
+export const MatchingStrategy = {
+    /**
+     * Key by a property on `entity.props`. Partial: entities missing the
+     * property yield `undefined` and land in `untracked`.
+     */
+    byProp(propKey) {
+        return {
+            name: `by-prop:${propKey}`,
+            totality: 'partial',
+            key: (e) => readString(e.props, propKey),
+        };
+    },
+    /**
+     * Key by primary path. Total: every Node has an AbsolutePath (I2).
+     * Use for snapshot-vs-snapshot diffs that don't carry remote metadata.
+     */
+    byPath: {
+        name: 'by-path',
+        totality: 'total',
+        key: (e) => e.path.raw,
+    },
+};
+//# sourceMappingURL=matching.js.map

package/dist/graph/sync/matching.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matching.js","sourceRoot":"","sources":["../../../graph/sync/matching.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;GAoBG;AAWH,SAAS,UAAU,CAAC,KAAuC,EAAE,GAAW;IACtE,IAAI,CAAC,KAAK;QAAE,OAAO,SAAS,CAAA;IAC5B,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAA;IACpB,OAAO,OAAO,CAAC,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;AAC9D,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG;IAC9B;;;OAGG;IACH,MAAM,CAAC,OAAe;QACpB,OAAO;YACL,IAAI,EAAE,WAAW,OAAO,EAAE;YAC1B,QAAQ,EAAE,SAAS;YACnB,GAAG,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,EAAE,OAAO,CAAC;SACzC,CAAA;IACH,CAAC;IAED;;;OAGG;IACH,MAAM,EAAE;QACN,IAAI,EAAE,SAAS;QACf,QAAQ,EAAE,OAAgB;QAC1B,GAAG,EAAE,CAAC,CAAkC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG;KACI;CAC9D,CAAA"}

package/dist/graph/sync/merge/index.d.ts

@@ -0,0 +1,3 @@
+export { merge } from './merge';
+export { type MergeConflictPolicy } from './policy';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../graph/sync/merge/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAA;AAC/B,OAAO,EAAE,KAAK,mBAAmB,EAAE,MAAM,UAAU,CAAA"}

package/dist/graph/sync/merge/index.js

@@ -0,0 +1,3 @@
+export { merge } from './merge';
+export {} from './policy';
+//# sourceMappingURL=index.js.map

package/dist/graph/sync/merge/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../graph/sync/merge/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,SAAS,CAAA;AAC/B,OAAO,EAA4B,MAAM,UAAU,CAAA"}

package/dist/graph/sync/merge/merge.d.ts

@@ -0,0 +1,21 @@
+import type { RemoteKeys } from '#graph/sync/remote';
+import { Graph } from '#graph';
+import { type MergeConflictPolicy } from './policy';
+/**
+ * Merge two graphs by id, producing a new Graph.
+ *
+ * Shares primitives with `diff` / `reconcile` / `apply`: all four operate
+ * on identity-keyed pairing with a conflict policy. `merge` is the
+ * symmetric-combining variant, used for client-side integration of fetches
+ * (e.g., the Store combining successive region loads).
+ *
+ * ## Rules
+ *
+ * - Nodes and edges are paired by id.
+ * - Nodes or edges present on only one side are copied through.
+ * - Nodes or edges present on both sides are resolved by the policy.
+ * - Entries without ids (spec-shaped) are concatenated as-is; callers
+ *   combining spec-only graphs should mint ids first.
+ */
+export declare function merge(local: Graph, incoming: Graph, policy: MergeConflictPolicy, remoteKeys?: RemoteKeys): Graph;
+//# sourceMappingURL=merge.d.ts.map

package/dist/graph/sync/merge/merge.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge.d.ts","sourceRoot":"","sources":["../../../../graph/sync/merge/merge.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAA;AAGpD,OAAO,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAE9B,OAAO,EAAE,KAAK,mBAAmB,EAAE,MAAM,UAAU,CAAA;AAEnD;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,KAAK,CACnB,KAAK,EAAE,KAAK,EACZ,QAAQ,EAAE,KAAK,EACf,MAAM,EAAE,mBAAmB,EAC3B,UAAU,CAAC,EAAE,UAAU,GACtB,KAAK,CAuDP"}

package/dist/graph/sync/merge/merge.js

@@ -0,0 +1,105 @@
+import { Graph } from '#graph';
+import {} from './policy';
+/**
+ * Merge two graphs by id, producing a new Graph.
+ *
+ * Shares primitives with `diff` / `reconcile` / `apply`: all four operate
+ * on identity-keyed pairing with a conflict policy. `merge` is the
+ * symmetric-combining variant, used for client-side integration of fetches
+ * (e.g., the Store combining successive region loads).
+ *
+ * ## Rules
+ *
+ * - Nodes and edges are paired by id.
+ * - Nodes or edges present on only one side are copied through.
+ * - Nodes or edges present on both sides are resolved by the policy.
+ * - Entries without ids (spec-shaped) are concatenated as-is; callers
+ *   combining spec-only graphs should mint ids first.
+ */
+export function merge(local, incoming, policy, remoteKeys) {
+    const nodes = [];
+    const edges = [];
+    // ── Nodes ─────────────────────────────────────────────────
+    const seenNodeIds = new Set();
+    for (const n of local.nodes) {
+        const id = n.id;
+        if (id === undefined) {
+            nodes.push(n);
+            continue;
+        }
+        if (seenNodeIds.has(id))
+            continue;
+        seenNodeIds.add(id);
+        const other = incoming.nodes.byId(id);
+        nodes.push(other ? resolveConflict(n, other, policy, remoteKeys) : n);
+    }
+    for (const n of incoming.nodes) {
+        const id = n.id;
+        if (id === undefined) {
+            nodes.push(n);
+            continue;
+        }
+        if (seenNodeIds.has(id))
+            continue;
+        seenNodeIds.add(id);
+        nodes.push(n);
+    }
+    // ── Edges ─────────────────────────────────────────────────
+    const seenEdgeIds = new Set();
+    for (const e of local.edges.all) {
+        const id = e.id;
+        if (id === undefined) {
+            edges.push(e);
+            continue;
+        }
+        if (seenEdgeIds.has(id))
+            continue;
+        seenEdgeIds.add(id);
+        const other = incoming.edges.byId(id);
+        edges.push(other ? resolveConflict(e, other, policy, remoteKeys) : e);
+    }
+    for (const e of incoming.edges.all) {
+        const id = e.id;
+        if (id === undefined) {
+            edges.push(e);
+            continue;
+        }
+        if (seenEdgeIds.has(id))
+            continue;
+        seenEdgeIds.add(id);
+        edges.push(e);
+    }
+    return Graph.from({ nodes, edges });
+}
+// ─── Internals ───────────────────────────────────────────────
+function resolveConflict(local, incoming, policy, remoteKeys) {
+    switch (policy) {
+        case 'fail': {
+            const id = local.id ?? '(unknown)';
+            throw new Error(`Graph merge: duplicate id "${String(id)}" with policy 'fail'`);
+        }
+        case 'keep-local':
+            return local;
+        case 'keep-incoming':
+            return incoming;
+        case 'keep-newer': {
+            if (!remoteKeys)
+                return incoming;
+            const lt = getUpdatedAt(local, remoteKeys);
+            const it = getUpdatedAt(incoming, remoteKeys);
+            if (lt === undefined || it === undefined)
+                return incoming;
+            return it >= lt ? incoming : local;
+        }
+    }
+}
+function getUpdatedAt(value, keys) {
+    if (typeof value !== 'object' || value === null)
+        return undefined;
+    const props = value.props;
+    if (!props)
+        return undefined;
+    const v = props[keys.updatedAt];
+    return typeof v === 'string' ? v : undefined;
+}
+//# sourceMappingURL=merge.js.map

package/dist/graph/sync/merge/merge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"merge.js","sourceRoot":"","sources":["../../../../graph/sync/merge/merge.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,KAAK,EAAE,MAAM,QAAQ,CAAA;AAE9B,OAAO,EAA4B,MAAM,UAAU,CAAA;AAEnD;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,KAAK,CACnB,KAAY,EACZ,QAAe,EACf,MAA2B,EAC3B,UAAuB;IAEvB,MAAM,KAAK,GAAW,EAAE,CAAA;IACxB,MAAM,KAAK,GAAW,EAAE,CAAA;IAExB,6DAA6D;IAC7D,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;IAErC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC5B,MAAM,EAAE,GAAI,CAAqB,CAAC,EAAE,CAAA;QACpC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACb,SAAQ;QACV,CAAC;QACD,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAQ;QACjC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACnB,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACrC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACvE,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,EAAE,GAAI,CAAqB,CAAC,EAAE,CAAA;QACpC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACb,SAAQ;QACV,CAAC;QACD,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAQ;QACjC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACnB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACf,CAAC;IAED,6DAA6D;IAC7D,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAA;IAErC,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QAChC,MAAM,EAAE,GAAI,CAAqB,CAAC,EAAE,CAAA;QACpC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACb,SAAQ;QACV,CAAC;QACD,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAQ;QACjC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACnB,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACrC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,EAAE,KAAK,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACvE,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;QACnC,MAAM,EAAE,GAAI,CAAqB,CAAC,EAAE,CAAA;QACpC,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACb,SAAQ;QACV,CAAC;QACD,IAAI,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;YAAE,SAAQ;QACjC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACnB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;IACf,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAA;AACrC,CAAC;AAED,gEAAgE;AAEhE,SAAS,eAAe,CACtB,KAAQ,EACR,QAAW,EACX,MAA2B,EAC3B,UAAuB;IAEvB,QAAQ,MAAM,EAAE,CAAC;QACf,KAAK,MAAM,EAAE,CAAC;YACZ,MAAM,EAAE,GAAI,KAA0B,CAAC,EAAE,IAAI,WAAW,CAAA;YACxD,MAAM,IAAI,KAAK,CAAC,8BAA8B,MAAM,CAAC,EAAE,CAAC,sBAAsB,CAAC,CAAA;QACjF,CAAC;QACD,KAAK,YAAY;YACf,OAAO,KAAK,CAAA;QACd,KAAK,eAAe;YAClB,OAAO,QAAQ,CAAA;QACjB,KAAK,YAAY,EAAE,CAAC;YAClB,IAAI,CAAC,UAAU;gBAAE,OAAO,QAAQ,CAAA;YAChC,MAAM,EAAE,GAAG,YAAY,CAAC,KAAK,EAAE,UAAU,CAAC,CAAA;YAC1C,MAAM,EAAE,GAAG,YAAY,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAA;YAC7C,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS;gBAAE,OAAO,QAAQ,CAAA;YACzD,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,CAAA;QACpC,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,YAAY,CAAC,KAAc,EAAE,IAAgB;IACpD,IAAI,OAAO,KAAK,KAAK,QAAQ,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,SAAS,CAAA;IACjE,MAAM,KAAK,GAAI,KAA6C,CAAC,KAAK,CAAA;IAClE,IAAI,CAAC,KAAK;QAAE,OAAO,SAAS,CAAA;IAC5B,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IAC/B,OAAO,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAA;AAC9C,CAAC"}

package/dist/graph/sync/merge/policy.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Conflict resolution policies for `merge`.
+ *
+ * - `'fail'`            — a duplicate id on both sides throws.
+ * - `'keep-local'`      — existing entry wins.
+ * - `'keep-incoming'`   — new entry wins.
+ * - `'keep-newer'`      — compare `remote.updatedAt` via `remoteKeys.updatedAt`;
+ *                         newer wins. If either side lacks the key, falls back
+ *                         to `'keep-incoming'`.
+ *
+ */
+export type MergeConflictPolicy = 'fail' | 'keep-local' | 'keep-incoming' | 'keep-newer';
+//# sourceMappingURL=policy.d.ts.map

package/dist/graph/sync/merge/policy.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"policy.d.ts","sourceRoot":"","sources":["../../../../graph/sync/merge/policy.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AACH,MAAM,MAAM,mBAAmB,GAAG,MAAM,GAAG,YAAY,GAAG,eAAe,GAAG,YAAY,CAAA"}

package/dist/graph/sync/merge/policy.js

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

package/dist/graph/sync/merge/policy.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"policy.js","sourceRoot":"","sources":["../../../../graph/sync/merge/policy.ts"],"names":[],"mappings":""}

package/dist/graph/sync/patch/index.d.ts

@@ -0,0 +1,4 @@
+export type { EdgeCreate, EdgeDelete, EdgeMatcher, EdgeUpdate, NodeCreate, NodeDelete, NodeUpdate, PatchData, } from './types';
+export { Minter, Patch } from './patch';
+export { setAliases } from './set-aliases';
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../graph/sync/patch/index.ts"],"names":[],"mappings":"AAAA,YAAY,EACV,UAAU,EACV,UAAU,EACV,WAAW,EACX,UAAU,EACV,UAAU,EACV,UAAU,EACV,UAAU,EACV,SAAS,GACV,MAAM,SAAS,CAAA;AAEhB,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,SAAS,CAAA;AACvC,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAA"}

package/dist/graph/sync/patch/index.js

@@ -0,0 +1,3 @@
+export { Minter, Patch } from './patch';
+export { setAliases } from './set-aliases';
+//# sourceMappingURL=index.js.map

package/dist/graph/sync/patch/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../graph/sync/patch/index.ts"],"names":[],"mappings":"AAWA,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,SAAS,CAAA;AACvC,OAAO,EAAE,UAAU,EAAE,MAAM,eAAe,CAAA"}

package/dist/graph/sync/patch/patch.d.ts

@@ -0,0 +1,82 @@
+import type { EdgeSpec, NodeSpec } from '#graph';
+import type { Path } from '#graph/nav/path';
+import type { AbsolutePath } from '#graph/tree';
+import { Graph } from '#graph/graph';
+import { NodeId } from '#ids';
+import type { EdgeDelete, EdgeMatcher, EdgeUpdate, NodeDelete, NodeUpdate, PatchData } from './types';
+/**
+ * Mint map keyed by each `NodeCreate.path.raw` → `NodeId`. Produced by the
+ * push pipeline's resolver; consumed by `Patch.toGraph(minter)` when
+ * explicit identity preservation is required (across retries, cross-instance
+ * matching via externalId). Disjoint-union monoid: composing two Minters
+ * is allowed iff their key sets are disjoint.
+ */
+export type Minter = ReadonlyMap<string, NodeId>;
+export declare const Minter: {
+    empty(): Minter;
+    of(entries: Iterable<readonly [string, NodeId]>): Minter;
+    /**
+     * Merge two minters. Throws on any overlapping key (monoid: composition
+     * is only defined on disjoint domains). Covers the push pipeline's
+     * resolver → external-fallback merge where each source is expected to
+     * own disjoint paths.
+     */
+    merge(a: Minter, b: Minter): Minter;
+};
+/**
+ * Unified authoring + diff-output record.
+ *
+ * Two roles in one shape (SPEC §4.7 Patch lifecycle):
+ *
+ * 1. **Authoring.** Build from scratch — `Patch.empty()` →
+ *    `addNode(spec)` / `addEdge(spec)` / `removeNodeAt(path)` /
+ *    `removeEdge(matcher)` → `toGraph(minter?)` promotes to a read-mode
+ *    `Graph`. Populates only `nodes.create` / `edges.create` (authoring
+ *    doesn't express updates of an existing DB state).
+ *
+ * 2. **Reconcile output.** `reconcile(changeset)` returns a Patch whose
+ *    six arms (create/update/delete × nodes/edges) carry the operations
+ *    the push pipeline applies against a live store.
+ *
+ * Both roles share the same shape; the six arms are simply empty in
+ * pure-authoring mode. `Patch.from(data)` wraps a plain `PatchData`
+ * object for callers (primarily `reconcile`) who construct the full
+ * six-arm shape directly.
+ */
+export declare class Patch implements PatchData {
+    private readonly _nodes;
+    private readonly _edges;
+    private readonly _aliases;
+    private constructor();
+    get nodes(): PatchData['nodes'];
+    get edges(): PatchData['edges'];
+    get aliases(): ReadonlyMap<string, Path>;
+    static empty(): Patch;
+    static from(data: PatchData): Patch;
+    addNode(spec: NodeSpec): this;
+    addEdge(spec: EdgeSpec): this;
+    setAlias(treeRaw: string, typed: Path): this;
+    /**
+     * Remove a pending `addNode` that targeted `path`. Pure undo of authoring
+     * intent — no-op on already-persisted nodes (use the full six-arm shape
+     * or a diff round-trip to express a semantic delete against live state).
+     */
+    removeNodeAt(path: AbsolutePath): this;
+    removeEdge(matcher: EdgeMatcher): this;
+    updateNode(u: NodeUpdate): this;
+    deleteNode(d: NodeDelete): this;
+    updateEdge(u: EdgeUpdate): this;
+    deleteEdge(d: EdgeDelete): this;
+    /**
+     * Materialize the authoring side (`nodes.create` + `edges.create`) into a
+     * read-mode `Graph`. Mints fresh NodeIds/EdgeIds when `minter` is omitted;
+     * otherwise the supplied mapping (from the resolver pipeline) is used and
+     * must cover every `NodeCreate.path.raw` — partial coverage raises.
+     *
+     * `update` / `delete` arms are ignored: they express operations against
+     * a live store, not the contents of a fresh Graph. Callers that want the
+     * diff applied should run the push pipeline against a real adapter.
+     */
+    toGraph(minter?: Minter): Graph;
+}
+//# sourceMappingURL=patch.d.ts.map

package/dist/graph/sync/patch/patch.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"patch.d.ts","sourceRoot":"","sources":["../../../../graph/sync/patch/patch.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAQ,QAAQ,EAAQ,QAAQ,EAAE,MAAM,QAAQ,CAAA;AAC5D,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,iBAAiB,CAAA;AAC3C,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,aAAa,CAAA;AAG/C,OAAO,EAAE,KAAK,EAAE,MAAM,cAAc,CAAA;AACpC,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAA;AAE7B,OAAO,KAAK,EAEV,UAAU,EACV,WAAW,EACX,UAAU,EAEV,UAAU,EACV,UAAU,EACV,SAAS,EACV,MAAM,SAAS,CAAA;AAIhB;;;;;;GAMG;AACH,MAAM,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;AAEhD,eAAO,MAAM,MAAM;IACjB,KAAK,IAAI,MAAM;IAIf,EAAE,UAAU,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,GAAG,MAAM;IAIxD;;;;;OAKG;IACH,KAAK,IAAI,MAAM,KAAK,MAAM,GAAG,MAAM;CAUpC,CAAA;AAID;;;;;;;;;;;;;;;;;;;GAmBG;AACH,qBAAa,KAAM,YAAW,SAAS;IACrC,OAAO,CAAC,QAAQ,CAAC,MAAM,CAItB;IACD,OAAO,CAAC,QAAQ,CAAC,MAAM,CAItB;IAED,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAA0B;IAEnD,OAAO,eAWN;IAED,IAAI,KAAK,IAAI,SAAS,CAAC,OAAO,CAAC,CAE9B;IAED,IAAI,KAAK,IAAI,SAAS,CAAC,OAAO,CAAC,CAE9B;IAED,IAAI,OAAO,IAAI,WAAW,CAAC,MAAM,EAAE,IAAI,CAAC,CAEvC;IAID,MAAM,CAAC,KAAK,IAAI,KAAK,CAEpB;IAED,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,GAAG,KAAK,CAElC;IAID,OAAO,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAO5B;IAED,OAAO,CAAC,IAAI,EAAE,QAAQ,GAAG,IAAI,CAS5B;IAED,QAAQ,CAAC,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,GAAG,IAAI,CAU3C;IAED;;;;OAIG;IACH,YAAY,CAAC,IAAI,EAAE,YAAY,GAAG,IAAI,CAQrC;IAED,UAAU,CAAC,OAAO,EAAE,WAAW,GAAG,IAAI,CASrC;IAOD,UAAU,CAAC,CAAC,EAAE,UAAU,GAAG,IAAI,CAG9B;IAED,UAAU,CAAC,CAAC,EAAE,UAAU,GAAG,IAAI,CAG9B;IAED,UAAU,CAAC,CAAC,EAAE,UAAU,GAAG,IAAI,CAG9B;IAED,UAAU,CAAC,CAAC,EAAE,UAAU,GAAG,IAAI,CAG9B;IAID;;;;;;;;;OASG;IACH,OAAO,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,KAAK,CA0C9B;CACF"}

package/dist/graph/sync/patch/patch.js

@@ -0,0 +1,230 @@
+import { toEdgeKey } from '#graph';
+import { Graph } from '#graph/graph';
+import { NodeId } from '#ids';
+export const Minter = {
+    empty() {
+        return new Map();
+    },
+    of(entries) {
+        return new Map(entries);
+    },
+    /**
+     * Merge two minters. Throws on any overlapping key (monoid: composition
+     * is only defined on disjoint domains). Covers the push pipeline's
+     * resolver → external-fallback merge where each source is expected to
+     * own disjoint paths.
+     */
+    merge(a, b) {
+        const out = new Map(a);
+        for (const [k, v] of b) {
+            if (out.has(k)) {
+                throw new Error(`Minter.merge: overlapping key "${k}" — sources must be disjoint`);
+            }
+            out.set(k, v);
+        }
+        return out;
+    },
+};
+// ── Patch ─────────────────────────────────────────────────────
+/**
+ * Unified authoring + diff-output record.
+ *
+ * Two roles in one shape (SPEC §4.7 Patch lifecycle):
+ *
+ * 1. **Authoring.** Build from scratch — `Patch.empty()` →
+ *    `addNode(spec)` / `addEdge(spec)` / `removeNodeAt(path)` /
+ *    `removeEdge(matcher)` → `toGraph(minter?)` promotes to a read-mode
+ *    `Graph`. Populates only `nodes.create` / `edges.create` (authoring
+ *    doesn't express updates of an existing DB state).
+ *
+ * 2. **Reconcile output.** `reconcile(changeset)` returns a Patch whose
+ *    six arms (create/update/delete × nodes/edges) carry the operations
+ *    the push pipeline applies against a live store.
+ *
+ * Both roles share the same shape; the six arms are simply empty in
+ * pure-authoring mode. `Patch.from(data)` wraps a plain `PatchData`
+ * object for callers (primarily `reconcile`) who construct the full
+ * six-arm shape directly.
+ */
+export class Patch {
+    _nodes;
+    _edges;
+    _aliases = new Map();
+    constructor(data) {
+        this._nodes = {
+            create: data ? [...data.nodes.create] : [],
+            update: data ? [...data.nodes.update] : [],
+            delete: data ? [...data.nodes.delete] : [],
+        };
+        this._edges = {
+            create: data ? [...data.edges.create] : [],
+            update: data ? [...data.edges.update] : [],
+            delete: data ? [...data.edges.delete] : [],
+        };
+    }
+    get nodes() {
+        return this._nodes;
+    }
+    get edges() {
+        return this._edges;
+    }
+    get aliases() {
+        return this._aliases;
+    }
+    // ── Factories ───────────────────────────────────────────
+    static empty() {
+        return new Patch();
+    }
+    static from(data) {
+        return new Patch(data);
+    }
+    // ── Authoring ──────────────────────────────────────────
+    addNode(spec) {
+        this._nodes.create.push({
+            class: spec.class,
+            at: spec.path,
+            props: spec.props,
+        });
+        return this;
+    }
+    addEdge(spec) {
+        this._edges.create.push({
+            class: spec.class,
+            source: spec.source,
+            ...(spec.slug !== undefined && { slug: spec.slug }),
+            target: spec.target,
+            props: spec.props,
+        });
+        return this;
+    }
+    setAlias(treeRaw, typed) {
+        const existing = this._aliases.get(treeRaw);
+        if (existing && existing.raw !== typed.raw) {
+            throw new Error(`Patch.setAlias: conflicting typed alias for "${treeRaw}" — ` +
+                `already "${existing.raw}", attempted "${typed.raw}"`);
+        }
+        this._aliases.set(treeRaw, typed);
+        return this;
+    }
+    /**
+     * Remove a pending `addNode` that targeted `path`. Pure undo of authoring
+     * intent — no-op on already-persisted nodes (use the full six-arm shape
+     * or a diff round-trip to express a semantic delete against live state).
+     */
+    removeNodeAt(path) {
+        const kept = [];
+        for (const c of this._nodes.create) {
+            if (c.at.raw !== path.raw)
+                kept.push(c);
+        }
+        this._nodes.create.length = 0;
+        this._nodes.create.push(...kept);
+        return this;
+    }
+    removeEdge(matcher) {
+        const key = edgeMatchKey(matcher);
+        const kept = [];
+        for (const c of this._edges.create) {
+            if (edgeMatchKey(c) !== key)
+                kept.push(c);
+        }
+        this._edges.create.length = 0;
+        this._edges.create.push(...kept);
+        return this;
+    }
+    // ── Reconcile-side builders ────────────────────────────
+    //
+    // Operations against live state. Used by `reconcile(changeset)` to
+    // populate the update/delete arms; authoring callers don't touch these.
+    updateNode(u) {
+        this._nodes.update.push(u);
+        return this;
+    }
+    deleteNode(d) {
+        this._nodes.delete.push(d);
+        return this;
+    }
+    updateEdge(u) {
+        this._edges.update.push(u);
+        return this;
+    }
+    deleteEdge(d) {
+        this._edges.delete.push(d);
+        return this;
+    }
+    // ── Promotion ──────────────────────────────────────────
+    /**
+     * Materialize the authoring side (`nodes.create` + `edges.create`) into a
+     * read-mode `Graph`. Mints fresh NodeIds/EdgeIds when `minter` is omitted;
+     * otherwise the supplied mapping (from the resolver pipeline) is used and
+     * must cover every `NodeCreate.path.raw` — partial coverage raises.
+     *
+     * `update` / `delete` arms are ignored: they express operations against
+     * a live store, not the contents of a fresh Graph. Callers that want the
+     * diff applied should run the push pipeline against a real adapter.
+     */
+    toGraph(minter) {
+        const mint = minter ?? autoMint(this._nodes.create);
+        if (minter !== undefined) {
+            for (const n of this._nodes.create) {
+                if (!mint.has(n.at.raw)) {
+                    throw new Error(`Patch.toGraph: minter missing entry for "${n.at.raw}" — partial coverage is invalid`);
+                }
+            }
+        }
+        const nodes = this._nodes.create.map((spec) => ({
+            id: mint.get(spec.at.raw),
+            class: spec.class,
+            path: spec.at,
+            props: spec.props,
+        }));
+        const edges = this._edges.create.map((spec) => ({
+            ...spec,
+            id: autoMintEdgeId(),
+        }));
+        // Seed `Graph.from` with producer-known typed aliases. Without this,
+        // `PathIndex.build`'s walkChain fixpoint can't resolve has_parent
+        // edges whose source is a typed Path — `BuildTimeView.edgesOutgoing`
+        // filters via `_resolveByRaw[e.source.raw]`, which has no typed
+        // entry until walkChain itself runs (chicken-and-egg).
+        const aliases = [];
+        if (this._aliases.size > 0) {
+            for (const node of nodes) {
+                const typed = this._aliases.get(node.path.raw);
+                if (typed)
+                    aliases.push([node.id, typed]);
+            }
+        }
+        return Graph.from({
+            nodes,
+            edges,
+            ...(aliases.length > 0 ? { aliases } : {}),
+        });
+    }
+}
+// ── Helpers ──────────────────────────────────────────────
+function edgeMatchKey(e) {
+    return toEdgeKey({
+        class: e.class,
+        source: { raw: e.source.raw },
+        ...(e.slug !== undefined && { slug: e.slug }),
+        target: { raw: e.target.raw },
+    });
+}
+function autoMint(creates) {
+    const map = new Map();
+    for (const n of creates) {
+        if (map.has(n.at.raw)) {
+            throw new Error(`Patch.toGraph: duplicate NodeCreate at "${n.at.raw}"`);
+        }
+        map.set(n.at.raw, mintNodeId());
+    }
+    return map;
+}
+function mintNodeId() {
+    return NodeId(crypto.randomUUID());
+}
+function autoMintEdgeId() {
+    return crypto.randomUUID();
+}
+//# sourceMappingURL=patch.js.map

package/dist/graph/sync/patch/patch.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"patch.js","sourceRoot":"","sources":["../../../../graph/sync/patch/patch.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,SAAS,EAAE,MAAM,QAAQ,CAAA;AAClC,OAAO,EAAE,KAAK,EAAE,MAAM,cAAc,CAAA;AACpC,OAAO,EAAE,MAAM,EAAE,MAAM,MAAM,CAAA;AAwB7B,MAAM,CAAC,MAAM,MAAM,GAAG;IACpB,KAAK;QACH,OAAO,IAAI,GAAG,EAAE,CAAA;IAClB,CAAC;IAED,EAAE,CAAC,OAA4C;QAC7C,OAAO,IAAI,GAAG,CAAC,OAAO,CAAC,CAAA;IACzB,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,CAAS,EAAE,CAAS;QACxB,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAA;QACtB,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;gBACf,MAAM,IAAI,KAAK,CAAC,kCAAkC,CAAC,8BAA8B,CAAC,CAAA;YACpF,CAAC;YACD,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;QACf,CAAC;QACD,OAAO,GAAG,CAAA;IACZ,CAAC;CACF,CAAA;AAED,iEAAiE;AAEjE;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,OAAO,KAAK;IACC,MAAM,CAItB;IACgB,MAAM,CAItB;IAEgB,QAAQ,GAAG,IAAI,GAAG,EAAgB,CAAA;IAEnD,YAAoB,IAAgB;QAClC,IAAI,CAAC,MAAM,GAAG;YACZ,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;YAC1C,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;YAC1C,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;SAC3C,CAAA;QACD,IAAI,CAAC,MAAM,GAAG;YACZ,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;YAC1C,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;YAC1C,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,EAAE;SAC3C,CAAA;IACH,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAA;IACpB,CAAC;IAED,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAA;IACpB,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAA;IACtB,CAAC;IAED,2DAA2D;IAE3D,MAAM,CAAC,KAAK;QACV,OAAO,IAAI,KAAK,EAAE,CAAA;IACpB,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,IAAe;QACzB,OAAO,IAAI,KAAK,CAAC,IAAI,CAAC,CAAA;IACxB,CAAC;IAED,0DAA0D;IAE1D,OAAO,CAAC,IAAc;QACpB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;YACtB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,EAAE,EAAE,IAAI,CAAC,IAAI;YACb,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB,CAAC,CAAA;QACF,OAAO,IAAI,CAAA;IACb,CAAC;IAED,OAAO,CAAC,IAAc;QACpB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC;YACtB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,GAAG,CAAC,IAAI,CAAC,IAAI,KAAK,SAAS,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC;YACnD,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB,CAAC,CAAA;QACF,OAAO,IAAI,CAAA;IACb,CAAC;IAED,QAAQ,CAAC,OAAe,EAAE,KAAW;QACnC,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QAC3C,IAAI,QAAQ,IAAI,QAAQ,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,EAAE,CAAC;YAC3C,MAAM,IAAI,KAAK,CACb,gDAAgD,OAAO,MAAM;gBAC3D,YAAY,QAAQ,CAAC,GAAG,iBAAiB,KAAK,CAAC,GAAG,GAAG,CACxD,CAAA;QACH,CAAC;QACD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,KAAK,CAAC,CAAA;QACjC,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;;OAIG;IACH,YAAY,CAAC,IAAkB;QAC7B,MAAM,IAAI,GAAiB,EAAE,CAAA;QAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACnC,IAAI,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,IAAI,CAAC,GAAG;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACzC,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;QAC7B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAA;QAChC,OAAO,IAAI,CAAA;IACb,CAAC;IAED,UAAU,CAAC,OAAoB;QAC7B,MAAM,GAAG,GAAG,YAAY,CAAC,OAAO,CAAC,CAAA;QACjC,MAAM,IAAI,GAAiB,EAAE,CAAA;QAC7B,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;YACnC,IAAI,YAAY,CAAC,CAAC,CAAC,KAAK,GAAG;gBAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC3C,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAA;QAC7B,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAA;QAChC,OAAO,IAAI,CAAA;IACb,CAAC;IAED,0DAA0D;IAC1D,EAAE;IACF,mEAAmE;IACnE,wEAAwE;IAExE,UAAU,CAAC,CAAa;QACtB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC1B,OAAO,IAAI,CAAA;IACb,CAAC;IAED,UAAU,CAAC,CAAa;QACtB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC1B,OAAO,IAAI,CAAA;IACb,CAAC;IAED,UAAU,CAAC,CAAa;QACtB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC1B,OAAO,IAAI,CAAA;IACb,CAAC;IAED,UAAU,CAAC,CAAa;QACtB,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC1B,OAAO,IAAI,CAAA;IACb,CAAC;IAED,0DAA0D;IAE1D;;;;;;;;;OASG;IACH,OAAO,CAAC,MAAe;QACrB,MAAM,IAAI,GAAG,MAAM,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAA;QAEnD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC;gBACnC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;oBACxB,MAAM,IAAI,KAAK,CACb,4CAA4C,CAAC,CAAC,EAAE,CAAC,GAAG,iCAAiC,CACtF,CAAA;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAW,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACtD,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAE;YAC1B,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,IAAI,EAAE,IAAI,CAAC,EAAE;YACb,KAAK,EAAE,IAAI,CAAC,KAAK;SAClB,CAAC,CAAC,CAAA;QACH,MAAM,KAAK,GAAW,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;YACtD,GAAG,IAAI;YACP,EAAE,EAAE,cAAc,EAAE;SACrB,CAAC,CAAC,CAAA;QAEH,qEAAqE;QACrE,kEAAkE;QAClE,qEAAqE;QACrE,gEAAgE;QAChE,uDAAuD;QACvD,MAAM,OAAO,GAAmC,EAAE,CAAA;QAClD,IAAI,IAAI,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;gBAC9C,IAAI,KAAK;oBAAE,OAAO,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC,CAAA;YAC3C,CAAC;QACH,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC;YAChB,KAAK;YACL,KAAK;YACL,GAAG,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SAC3C,CAAC,CAAA;IACJ,CAAC;CACF;AAED,4DAA4D;AAE5D,SAAS,YAAY,CAAC,CAA2B;IAC/C,OAAO,SAAS,CAAC;QACf,KAAK,EAAE,CAAC,CAAC,KAAK;QACd,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE;QAC7B,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAC7C,MAAM,EAAE,EAAE,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,EAAE;KAC9B,CAAC,CAAA;AACJ,CAAC;AAED,SAAS,QAAQ,CAAC,OAA8B;IAC9C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAA;IACrC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;QACxB,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,2CAA2C,CAAC,CAAC,EAAE,CAAC,GAAG,GAAG,CAAC,CAAA;QACzE,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,EAAE,UAAU,EAAE,CAAC,CAAA;IACjC,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,SAAS,UAAU;IACjB,OAAO,MAAM,CAAC,MAAM,CAAC,UAAU,EAAE,CAAC,CAAA;AACpC,CAAC;AAED,SAAS,cAAc;IACrB,OAAO,MAAM,CAAC,UAAU,EAAgB,CAAA;AAC1C,CAAC"}