@unbrained/pm-cli 2026.7.19 → 2026.7.20

package/dist/sdk/merge/three-way.js

@@ -0,0 +1,545 @@
+/**
+ * @module sdk/merge/three-way
+ *
+ * Field-aware three-way merge primitives for every mergeable tracker artifact
+ * class: append-only history JSONL streams, item documents (TOON or
+ * JSON+Markdown), and key-level JSON configuration/schema files. These
+ * primitives are pure (content in, content out) so the CLI merge driver, the
+ * MCP surface, and package integrations all share one merge semantics
+ * definition for multi-branch agent workflows.
+ */
+
+!function(){try{var e="undefined"!=typeof window?window:"undefined"!=typeof global?global:"undefined"!=typeof globalThis?globalThis:"undefined"!=typeof self?self:{},n=(new e.Error).stack;n&&(e._sentryDebugIds=e._sentryDebugIds||{},e._sentryDebugIds[n]="fa427b53-b1ae-53d0-acec-dfc1eb22bfd1")}catch(e){}}();
+import { historyEntriesToRaw, reanchorHistoryEntries, } from "../../core/history/replay.js";
+import { canonicalDocument, parseItemDocument, serializeItemDocument, } from "../../core/item/item-format.js";
+import { EXIT_CODE } from "../../core/shared/constants.js";
+import { findFirstMergeConflictMarker } from "../../core/shared/conflict-markers.js";
+import { PmCliError } from "../../core/shared/errors.js";
+import { stableStringify } from "../../core/shared/serialization.js";
+import { compareTimestampStrings } from "../../core/shared/time.js";
+function parseHistoryJsonl(raw, label) {
+    const conflictMarker = findFirstMergeConflictMarker(raw);
+    if (conflictMarker) {
+        throw new PmCliError(`History merge input (${label}) contains unresolved conflict markers at line ${conflictMarker.line}. Merge drivers must receive clean per-side versions.`, EXIT_CODE.GENERIC_FAILURE);
+    }
+    const entries = [];
+    for (const [index, rawLine] of raw.split(/\r?\n/).entries()) {
+        const line = rawLine.trim();
+        if (!line) {
+            continue;
+        }
+        try {
+            const parsed = JSON.parse(line);
+            if (typeof parsed !== "object" || parsed === null || Array.isArray(parsed)) {
+                throw new TypeError("history entry must be an object");
+            }
+            entries.push(parsed);
+        }
+        catch {
+            throw new PmCliError(`History merge input (${label}) contains invalid JSON at line ${index + 1}.`, EXIT_CODE.GENERIC_FAILURE);
+        }
+    }
+    return entries;
+}
+function historyEntryIdentity(entry) {
+    return stableStringify({
+        ts: entry.ts,
+        author: entry.author,
+        op: entry.op,
+        patch: entry.patch,
+        message: entry.message ?? null,
+    });
+}
+function commonHistoryPrefixLength(ours, theirs) {
+    const limit = Math.min(ours.length, theirs.length);
+    let shared = 0;
+    while (shared < limit &&
+        historyEntryIdentity(ours[shared]) === historyEntryIdentity(theirs[shared])) {
+        shared += 1;
+    }
+    return shared;
+}
+/**
+ * Deterministically merge two diverged versions of one append-only history
+ * JSONL stream. Identical streams and one-sided fast-forwards keep the winning
+ * side byte-for-byte; genuinely diverged streams are merged as the shared
+ * prefix plus both suffixes ordered by timestamp (ours-first on ties), then
+ * hash re-anchored so the resulting chain verifies again. No side's events are
+ * ever discarded: content divergence is preserved for the post-merge
+ * reconciliation pass (`pm validate` + `pm history-repair`) instead of being
+ * silently resolved by last-writer-wins.
+ */
+export function mergeHistoryStreams(baseRaw, oursRaw, theirsRaw) {
+    parseHistoryJsonl(baseRaw, "base");
+    const ours = parseHistoryJsonl(oursRaw, "ours");
+    const theirs = parseHistoryJsonl(theirsRaw, "theirs");
+    const shared = commonHistoryPrefixLength(ours, theirs);
+    if (shared === ours.length && shared === theirs.length) {
+        return {
+            merged: historyEntriesToRaw(ours),
+            strategy: "identical",
+            common_entries: shared,
+            entries_from_ours: 0,
+            entries_from_theirs: 0,
+            entries_total: ours.length,
+            reanchored: false,
+        };
+    }
+    if (shared === theirs.length) {
+        return {
+            merged: historyEntriesToRaw(ours),
+            strategy: "fast_forward_ours",
+            common_entries: shared,
+            entries_from_ours: ours.length - shared,
+            entries_from_theirs: 0,
+            entries_total: ours.length,
+            reanchored: false,
+        };
+    }
+    if (shared === ours.length) {
+        return {
+            merged: historyEntriesToRaw(theirs),
+            strategy: "fast_forward_theirs",
+            common_entries: shared,
+            entries_from_ours: 0,
+            entries_from_theirs: theirs.length - shared,
+            entries_total: theirs.length,
+            reanchored: false,
+        };
+    }
+    const oursSuffix = ours.slice(shared);
+    const seenIdentities = new Set(oursSuffix.map(historyEntryIdentity));
+    const theirsSuffix = theirs
+        .slice(shared)
+        .filter((entry) => !seenIdentities.has(historyEntryIdentity(entry)));
+    const mergedSuffix = [...oursSuffix, ...theirsSuffix].sort((left, right) => {
+        const byTs = compareTimestampStrings(left.ts, right.ts);
+        if (byTs !== 0) {
+            return byTs;
+        }
+        const leftFromOurs = seenIdentities.has(historyEntryIdentity(left));
+        const rightFromOurs = seenIdentities.has(historyEntryIdentity(right));
+        if (leftFromOurs !== rightFromOurs) {
+            return Number(rightFromOurs) - Number(leftFromOurs);
+        }
+        return historyEntryIdentity(left).localeCompare(historyEntryIdentity(right));
+    });
+    const reanchored = reanchorHistoryEntries([
+        ...ours.slice(0, shared),
+        ...mergedSuffix,
+    ]);
+    return {
+        merged: historyEntriesToRaw(reanchored.entries),
+        strategy: "union_reanchor",
+        common_entries: shared,
+        entries_from_ours: oursSuffix.length,
+        entries_from_theirs: theirsSuffix.length,
+        entries_total: reanchored.entries.length,
+        reanchored: true,
+    };
+}
+function parseRelationshipJsonl(raw, label) {
+    const conflictMarker = findFirstMergeConflictMarker(raw);
+    if (conflictMarker) {
+        throw new PmCliError(`Relationship merge input (${label}) contains unresolved conflict markers at line ${conflictMarker.line}. Merge drivers must receive clean per-side versions.`, EXIT_CODE.GENERIC_FAILURE);
+    }
+    const events = [];
+    for (const [index, rawLine] of raw.split(/\r?\n/).entries()) {
+        const line = rawLine.trim();
+        if (!line) {
+            continue;
+        }
+        let parsed;
+        try {
+            parsed = JSON.parse(line);
+        }
+        catch {
+            throw new PmCliError(`Relationship merge input (${label}) contains invalid JSON at line ${index + 1}.`, EXIT_CODE.GENERIC_FAILURE);
+        }
+        if (typeof parsed !== "object" ||
+            parsed === null ||
+            Array.isArray(parsed) ||
+            typeof parsed.eventId !== "string" ||
+            typeof parsed.sequence !== "number") {
+            throw new PmCliError(`Relationship merge input (${label}) line ${index + 1} is not a relationship event (eventId + sequence required).`, EXIT_CODE.GENERIC_FAILURE);
+        }
+        events.push(parsed);
+    }
+    return events;
+}
+function relationshipEventsToRaw(events) {
+    return events.length === 0
+        ? ""
+        : `${events.map((event) => JSON.stringify(event)).join("\n")}\n`;
+}
+function renumberRelationshipEvents(events) {
+    return events.map((event, index) => ({ ...event, sequence: index + 1 }));
+}
+/**
+ * Deterministically merge two diverged versions of one append-only
+ * relationship event JSONL store. The store's loader enforces strictly
+ * consecutive one-based `sequence` values, so a plain text union of two
+ * diverged streams is always unreadable; this merge keeps the shared prefix,
+ * unions both divergent suffixes by `eventId` (ordered by event timestamp,
+ * ours-first on ties), and renumbers every merged sequence consecutively so
+ * the resulting stream loads again. No side's events are ever discarded.
+ */
+export function mergeRelationshipEventStreams(baseRaw, oursRaw, theirsRaw) {
+    parseRelationshipJsonl(baseRaw, "base");
+    const ours = parseRelationshipJsonl(oursRaw, "ours");
+    const theirs = parseRelationshipJsonl(theirsRaw, "theirs");
+    const limit = Math.min(ours.length, theirs.length);
+    let shared = 0;
+    while (shared < limit && ours[shared].eventId === theirs[shared].eventId) {
+        shared += 1;
+    }
+    if (shared === ours.length && shared === theirs.length) {
+        return {
+            merged: relationshipEventsToRaw(ours),
+            strategy: "identical",
+            common_entries: shared,
+            entries_from_ours: 0,
+            entries_from_theirs: 0,
+            entries_total: ours.length,
+            reanchored: false,
+        };
+    }
+    if (shared === theirs.length) {
+        return {
+            merged: relationshipEventsToRaw(ours),
+            strategy: "fast_forward_ours",
+            common_entries: shared,
+            entries_from_ours: ours.length - shared,
+            entries_from_theirs: 0,
+            entries_total: ours.length,
+            reanchored: false,
+        };
+    }
+    if (shared === ours.length) {
+        return {
+            merged: relationshipEventsToRaw(theirs),
+            strategy: "fast_forward_theirs",
+            common_entries: shared,
+            entries_from_ours: 0,
+            entries_from_theirs: theirs.length - shared,
+            entries_total: theirs.length,
+            reanchored: false,
+        };
+    }
+    const oursSuffix = ours.slice(shared);
+    const oursEventIds = new Set(oursSuffix.map((event) => event.eventId));
+    const theirsSuffix = theirs
+        .slice(shared)
+        .filter((event) => !oursEventIds.has(event.eventId));
+    const mergedSuffix = [...oursSuffix, ...theirsSuffix].sort((left, right) => {
+        if (left.timestamp !== undefined && right.timestamp !== undefined) {
+            const byTs = compareTimestampStrings(left.timestamp, right.timestamp);
+            if (byTs !== 0) {
+                return byTs;
+            }
+        }
+        else if (left.timestamp === undefined && right.timestamp !== undefined) {
+            return 1;
+        }
+        else if (left.timestamp !== undefined) {
+            return -1;
+        }
+        const leftFromOurs = oursEventIds.has(left.eventId);
+        const rightFromOurs = oursEventIds.has(right.eventId);
+        if (leftFromOurs !== rightFromOurs) {
+            return Number(rightFromOurs) - Number(leftFromOurs);
+        }
+        // Array.prototype.sort is stable: returning zero preserves each side's
+        // original append order when its events share a timestamp.
+        return 0;
+    });
+    const merged = renumberRelationshipEvents([
+        ...ours.slice(0, shared),
+        ...mergedSuffix,
+    ]);
+    return {
+        merged: relationshipEventsToRaw(merged),
+        strategy: "union_reanchor",
+        common_entries: shared,
+        entries_from_ours: oursSuffix.length,
+        entries_from_theirs: theirsSuffix.length,
+        entries_total: merged.length,
+        reanchored: true,
+    };
+}
+/**
+ * Item metadata collections merged by element-identity set semantics instead
+ * of whole-field three-way comparison: concurrent commutative appends from two
+ * branches (notes on A, tags on B, a test run on each) must merge cleanly.
+ * Element identity is the stable serialization of the normalized element, so
+ * an element edited on one side counts as remove-old + add-new and both sides'
+ * contributions survive. Plan collections are deliberately excluded: plan
+ * steps carry cross-element ordering invariants that set-union would corrupt,
+ * so they stay under scalar three-way semantics with explicit conflicts.
+ */
+export const ITEM_UNION_COLLECTION_FIELDS = [
+    "tags",
+    "dependencies",
+    "comments",
+    "notes",
+    "learnings",
+    "files",
+    "tests",
+    "test_runs",
+    "docs",
+    "reminders",
+    "events",
+];
+/** Item metadata fields resolved by deterministic latest-timestamp-wins instead of three-way conflict, so disjoint-field edits never conflict on the shared freshness scalar every mutation rewrites. */
+export const ITEM_LATEST_TIMESTAMP_FIELDS = ["updated_at"];
+function jsonEquals(left, right) {
+    return stableStringify(left ?? null) === stableStringify(right ?? null);
+}
+function unionCollection(base, ours, theirs) {
+    const toEntries = (value) => Array.isArray(value) ? value : [];
+    const baseIds = new Set(toEntries(base).map((entry) => stableStringify(entry)));
+    const oursEntries = toEntries(ours);
+    const oursIds = new Set(oursEntries.map((entry) => stableStringify(entry)));
+    const theirsEntries = toEntries(theirs);
+    const theirsIds = new Set(theirsEntries.map((entry) => stableStringify(entry)));
+    const merged = oursEntries.filter((entry) => {
+        const identity = stableStringify(entry);
+        // An element kept by ours survives unless theirs deleted it (present in
+        // base, absent from theirs).
+        return !baseIds.has(identity) || theirsIds.has(identity);
+    });
+    for (const entry of theirsEntries) {
+        const identity = stableStringify(entry);
+        if (!oursIds.has(identity) && !baseIds.has(identity)) {
+            merged.push(entry);
+        }
+    }
+    return merged;
+}
+function latestTimestamp(ours, theirs) {
+    return compareTimestampStrings(String(ours), String(theirs)) >= 0
+        ? ours
+        : theirs;
+}
+function mergeScalarThreeWay(base, ours, theirs, preferred) {
+    if (jsonEquals(ours, theirs)) {
+        return { value: ours, from_theirs: false, conflict: false };
+    }
+    if (jsonEquals(base, ours)) {
+        return { value: theirs, from_theirs: true, conflict: false };
+    }
+    if (jsonEquals(base, theirs)) {
+        return { value: ours, from_theirs: false, conflict: false };
+    }
+    return {
+        value: preferred === "theirs" ? theirs : ours,
+        from_theirs: preferred === "theirs",
+        conflict: true,
+    };
+}
+function toMetadataRecord(document) {
+    return { ...document.metadata };
+}
+function parseItemMergeSide(raw, label, options) {
+    try {
+        return canonicalDocument(parseItemDocument(raw, options), options);
+    }
+    catch (error) {
+        throw new PmCliError(`Item merge input (${label}) is not a readable item document: ${String(error)}`, EXIT_CODE.GENERIC_FAILURE);
+    }
+}
+function mergeItemMetadataRecords(baseRecord, oursRecord, theirsRecord, preferred) {
+    const unionFieldSet = new Set(ITEM_UNION_COLLECTION_FIELDS);
+    const latestFieldSet = new Set(ITEM_LATEST_TIMESTAMP_FIELDS);
+    const fieldNames = [
+        ...new Set([...Object.keys(oursRecord), ...Object.keys(theirsRecord)]),
+    ].sort((left, right) => left.localeCompare(right));
+    const accumulator = {
+        merged: {},
+        conflictFields: [],
+        fieldsFromTheirs: [],
+        unionFields: [],
+    };
+    for (const field of fieldNames) {
+        const baseValue = baseRecord[field];
+        const oursValue = oursRecord[field];
+        const theirsValue = theirsRecord[field];
+        if (unionFieldSet.has(field)) {
+            const union = unionCollection(baseValue, oursValue, theirsValue);
+            // `fieldNames` is derived from both records' own keys, so a collection
+            // reached here is declared by at least one side. Preserve even an empty
+            // result (`tags` is required) so serialization never drops it.
+            accumulator.merged[field] = union;
+            if (!jsonEquals(union, oursValue)) {
+                accumulator.unionFields.push(field);
+            }
+            continue;
+        }
+        if (latestFieldSet.has(field)) {
+            accumulator.merged[field] = latestTimestamp(oursValue, theirsValue);
+            continue;
+        }
+        const outcome = mergeScalarThreeWay(baseValue, oursValue, theirsValue, preferred);
+        if (outcome.value !== undefined) {
+            accumulator.merged[field] = outcome.value;
+        }
+        if (outcome.conflict) {
+            accumulator.conflictFields.push(field);
+        }
+        else if (outcome.from_theirs) {
+            accumulator.fieldsFromTheirs.push(field);
+        }
+    }
+    return accumulator;
+}
+/**
+ * Field-aware three-way merge of one tracker item document. Commutative
+ * collections (notes, tags, tests, ...) union by element identity so
+ * concurrent appends never conflict; `updated_at` resolves to the latest
+ * timestamp so disjoint-field edits never collide on the shared freshness
+ * scalar; every other metadata field and the body use classic three-way
+ * resolution. Unresolvable both-sides-changed conflicts are resolved toward
+ * the preferred side but reported in `conflict_fields`, and the merged output
+ * is always canonically serialized — count-prefixed TOON array headers are
+ * recomputed, so the hand-resolution corruption class (stale `notes[N]`
+ * headers) cannot be produced by this merge.
+ */
+export function mergeItemDocuments(baseRaw, oursRaw, theirsRaw, options = {}) {
+    const preferred = options.preferred ?? "ours";
+    // An empty base means both branches created the file independently
+    // (add/add); three-way falls back to treating every differing field as an
+    // ours/theirs decision, which the scalar resolver already models.
+    const hasBase = baseRaw.trim().length > 0;
+    const ours = parseItemMergeSide(oursRaw, "ours", options);
+    const theirs = parseItemMergeSide(theirsRaw, "theirs", options);
+    const base = hasBase ? parseItemMergeSide(baseRaw, "base", options) : ours;
+    const baseRecord = hasBase
+        ? toMetadataRecord(base)
+        : {};
+    const oursRecord = toMetadataRecord(ours);
+    const theirsRecord = toMetadataRecord(theirs);
+    const { merged, conflictFields, fieldsFromTheirs, unionFields } = mergeItemMetadataRecords(baseRecord, oursRecord, theirsRecord, preferred);
+    const bodyOutcome = mergeScalarThreeWay(hasBase ? base.body : "", ours.body, theirs.body, preferred);
+    if (bodyOutcome.conflict) {
+        conflictFields.push("body");
+    }
+    else if (bodyOutcome.from_theirs) {
+        fieldsFromTheirs.push("body");
+    }
+    const mergedRaw = serializeItemDocument({
+        metadata: merged,
+        body: bodyOutcome.value,
+    }, options);
+    return {
+        merged: mergedRaw,
+        conflict_fields: conflictFields,
+        fields_from_theirs: fieldsFromTheirs,
+        union_fields: unionFields,
+        preferred,
+    };
+}
+function isPlainObject(value) {
+    return (typeof value === "object" &&
+        value !== null &&
+        !Array.isArray(value));
+}
+function parseJsonSide(raw, label) {
+    const conflictMarker = findFirstMergeConflictMarker(raw);
+    if (conflictMarker) {
+        throw new PmCliError(`JSON merge input (${label}) contains unresolved conflict markers at line ${conflictMarker.line}.`, EXIT_CODE.GENERIC_FAILURE);
+    }
+    if (raw.trim().length === 0) {
+        return undefined;
+    }
+    try {
+        return JSON.parse(raw);
+    }
+    catch {
+        throw new PmCliError(`JSON merge input (${label}) is not valid JSON.`, EXIT_CODE.GENERIC_FAILURE);
+    }
+}
+function mergeJsonValue(base, ours, theirs, preferred, pathPrefix, conflictPaths, pathsFromTheirs) {
+    if (jsonEquals(ours, theirs)) {
+        return ours;
+    }
+    if (isPlainObject(ours) && isPlainObject(theirs)) {
+        const baseObject = isPlainObject(base) ? base : {};
+        const merged = {};
+        const keys = [
+            ...new Set([...Object.keys(ours), ...Object.keys(theirs)]),
+        ].sort((left, right) => left.localeCompare(right));
+        for (const key of keys) {
+            const childPath = pathPrefix.length > 0 ? `${pathPrefix}.${key}` : key;
+            const child = mergeJsonKey(baseObject, ours, theirs, key, preferred, childPath, conflictPaths, pathsFromTheirs);
+            if (child !== undefined) {
+                merged[key] = child;
+            }
+        }
+        return merged;
+    }
+    const outcome = mergeScalarThreeWay(base, ours, theirs, preferred);
+    if (outcome.conflict) {
+        conflictPaths.push(pathPrefix);
+    }
+    else if (outcome.from_theirs) {
+        pathsFromTheirs.push(pathPrefix);
+    }
+    return outcome.value;
+}
+function mergeJsonKey(base, ours, theirs, key, preferred, childPath, conflictPaths, pathsFromTheirs) {
+    const inOurs = Object.prototype.hasOwnProperty.call(ours, key);
+    const inTheirs = Object.prototype.hasOwnProperty.call(theirs, key);
+    const inBase = Object.prototype.hasOwnProperty.call(base, key);
+    if (inOurs && inTheirs) {
+        return mergeJsonValue(base[key], ours[key], theirs[key], preferred, childPath, conflictPaths, pathsFromTheirs);
+    }
+    if (inOurs) {
+        // Present only in ours: either ours added it (keep) or theirs deleted it
+        // (honor the delete when ours left it untouched from base).
+        if (inBase && jsonEquals(base[key], ours[key])) {
+            pathsFromTheirs.push(childPath);
+            return undefined;
+        }
+        if (inBase) {
+            conflictPaths.push(childPath);
+            return preferred === "theirs" ? undefined : ours[key];
+        }
+        return ours[key];
+    }
+    // Present only in theirs (mirror of the branch above).
+    if (inBase && jsonEquals(base[key], theirs[key])) {
+        return undefined;
+    }
+    if (inBase) {
+        conflictPaths.push(childPath);
+        return preferred === "theirs" ? theirs[key] : undefined;
+    }
+    pathsFromTheirs.push(childPath);
+    return theirs[key];
+}
+/**
+ * Key-level three-way merge for the tracker's single-file JSON configuration
+ * artifacts (`settings.json`, `schema/*.json`). Nested objects merge
+ * recursively per key so two branches editing disjoint settings never
+ * conflict; both-sides-changed leaf values resolve toward the preferred side
+ * and are reported in `conflict_paths`. The output is always valid JSON, so a
+ * merged configuration can never regress into the silent-defaults fallback
+ * that raw conflict markers cause.
+ */
+export function mergeJsonDocuments(baseRaw, oursRaw, theirsRaw, options = {}) {
+    const preferred = options.preferred ?? "ours";
+    const base = parseJsonSide(baseRaw, "base");
+    const ours = parseJsonSide(oursRaw, "ours");
+    const theirs = parseJsonSide(theirsRaw, "theirs");
+    const conflictPaths = [];
+    const pathsFromTheirs = [];
+    const merged = mergeJsonValue(base, ours, theirs, preferred, "", conflictPaths, pathsFromTheirs);
+    return {
+        merged: `${JSON.stringify(merged ?? null, null, 2)}\n`,
+        conflict_paths: conflictPaths,
+        paths_from_theirs: pathsFromTheirs,
+        preferred,
+    };
+}
+//# sourceMappingURL=three-way.js.map
+//# debugId=fa427b53-b1ae-53d0-acec-dfc1eb22bfd1

package/dist/sdk/merge/three-way.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"three-way.js","sources":["sdk/merge/three-way.ts"],"sourceRoot":"/","sourcesContent":["/**\n * @module sdk/merge/three-way\n *\n * Field-aware three-way merge primitives for every mergeable tracker artifact\n * class: append-only history JSONL streams, item documents (TOON or\n * JSON+Markdown), and key-level JSON configuration/schema files. These\n * primitives are pure (content in, content out) so the CLI merge driver, the\n * MCP surface, and package integrations all share one merge semantics\n * definition for multi-branch agent workflows.\n */\nimport {\n  historyEntriesToRaw,\n  reanchorHistoryEntries,\n} from \"../../core/history/replay.js\";\nimport {\n  canonicalDocument,\n  parseItemDocument,\n  serializeItemDocument,\n  type ItemDocumentFormatOptions,\n} from \"../../core/item/item-format.js\";\nimport { EXIT_CODE } from \"../../core/shared/constants.js\";\nimport { findFirstMergeConflictMarker } from \"../../core/shared/conflict-markers.js\";\nimport { PmCliError } from \"../../core/shared/errors.js\";\nimport { stableStringify } from \"../../core/shared/serialization.js\";\nimport { compareTimestampStrings } from \"../../core/shared/time.js\";\nimport type {\n  HistoryEntry,\n  ItemDocument,\n  ItemMetadata,\n} from \"../../types/index.js\";\n\n/** Restricts which side of a three-way merge wins an unresolvable conflict. */\nexport type MergePreferredSide = \"ours\" | \"theirs\";\n\n/** Restricts the strategy labels reported by the history stream merge. */\nexport type HistoryMergeStrategy =\n  | \"identical\"\n  | \"fast_forward_ours\"\n  | \"fast_forward_theirs\"\n  | \"union_reanchor\";\n\n/** Documents the history stream merge result payload exchanged by command, SDK, and package integrations. */\nexport interface HistoryMergeResult {\n  /** Merged JSONL content ready to be written as the resolved history stream. */\n  merged: string;\n  /** Strategy the merge used: identical inputs, one-sided fast-forward, or a deterministic union with a re-anchored hash chain. */\n  strategy: HistoryMergeStrategy;\n  /** Number of entries shared by both sides before their streams diverged. */\n  common_entries: number;\n  /** Number of divergent entries contributed by the ours side. */\n  entries_from_ours: number;\n  /** Number of divergent entries contributed by the theirs side. */\n  entries_from_theirs: number;\n  /** Total entries in the merged stream. */\n  entries_total: number;\n  /** Whether the merged chain required hash re-anchoring (true for every union merge). */\n  reanchored: boolean;\n}\n\nfunction parseHistoryJsonl(raw: string, label: string): HistoryEntry[] {\n  const conflictMarker = findFirstMergeConflictMarker(raw);\n  if (conflictMarker) {\n    throw new PmCliError(\n      `History merge input (${label}) contains unresolved conflict markers at line ${conflictMarker.line}. Merge drivers must receive clean per-side versions.`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n  const entries: HistoryEntry[] = [];\n  for (const [index, rawLine] of raw.split(/\\r?\\n/).entries()) {\n    const line = rawLine.trim();\n    if (!line) {\n      continue;\n    }\n    try {\n      const parsed = JSON.parse(line) as unknown;\n      if (typeof parsed !== \"object\" || parsed === null || Array.isArray(parsed)) {\n        throw new TypeError(\"history entry must be an object\");\n      }\n      entries.push(parsed as HistoryEntry);\n    } catch {\n      throw new PmCliError(\n        `History merge input (${label}) contains invalid JSON at line ${index + 1}.`,\n        EXIT_CODE.GENERIC_FAILURE,\n      );\n    }\n  }\n  return entries;\n}\n\nfunction historyEntryIdentity(entry: HistoryEntry): string {\n  return stableStringify({\n    ts: entry.ts,\n    author: entry.author,\n    op: entry.op,\n    patch: entry.patch,\n    message: entry.message ?? null,\n  });\n}\n\nfunction commonHistoryPrefixLength(\n  ours: HistoryEntry[],\n  theirs: HistoryEntry[],\n): number {\n  const limit = Math.min(ours.length, theirs.length);\n  let shared = 0;\n  while (\n    shared < limit &&\n    historyEntryIdentity(ours[shared]) === historyEntryIdentity(theirs[shared])\n  ) {\n    shared += 1;\n  }\n  return shared;\n}\n\n/**\n * Deterministically merge two diverged versions of one append-only history\n * JSONL stream. Identical streams and one-sided fast-forwards keep the winning\n * side byte-for-byte; genuinely diverged streams are merged as the shared\n * prefix plus both suffixes ordered by timestamp (ours-first on ties), then\n * hash re-anchored so the resulting chain verifies again. No side's events are\n * ever discarded: content divergence is preserved for the post-merge\n * reconciliation pass (`pm validate` + `pm history-repair`) instead of being\n * silently resolved by last-writer-wins.\n */\nexport function mergeHistoryStreams(\n  baseRaw: string,\n  oursRaw: string,\n  theirsRaw: string,\n): HistoryMergeResult {\n  parseHistoryJsonl(baseRaw, \"base\");\n  const ours = parseHistoryJsonl(oursRaw, \"ours\");\n  const theirs = parseHistoryJsonl(theirsRaw, \"theirs\");\n  const shared = commonHistoryPrefixLength(ours, theirs);\n\n  if (shared === ours.length && shared === theirs.length) {\n    return {\n      merged: historyEntriesToRaw(ours),\n      strategy: \"identical\",\n      common_entries: shared,\n      entries_from_ours: 0,\n      entries_from_theirs: 0,\n      entries_total: ours.length,\n      reanchored: false,\n    };\n  }\n  if (shared === theirs.length) {\n    return {\n      merged: historyEntriesToRaw(ours),\n      strategy: \"fast_forward_ours\",\n      common_entries: shared,\n      entries_from_ours: ours.length - shared,\n      entries_from_theirs: 0,\n      entries_total: ours.length,\n      reanchored: false,\n    };\n  }\n  if (shared === ours.length) {\n    return {\n      merged: historyEntriesToRaw(theirs),\n      strategy: \"fast_forward_theirs\",\n      common_entries: shared,\n      entries_from_ours: 0,\n      entries_from_theirs: theirs.length - shared,\n      entries_total: theirs.length,\n      reanchored: false,\n    };\n  }\n\n  const oursSuffix = ours.slice(shared);\n  const seenIdentities = new Set(oursSuffix.map(historyEntryIdentity));\n  const theirsSuffix = theirs\n    .slice(shared)\n    .filter((entry) => !seenIdentities.has(historyEntryIdentity(entry)));\n  const mergedSuffix = [...oursSuffix, ...theirsSuffix].sort((left, right) => {\n    const byTs = compareTimestampStrings(left.ts, right.ts);\n    if (byTs !== 0) {\n      return byTs;\n    }\n    const leftFromOurs = seenIdentities.has(historyEntryIdentity(left));\n    const rightFromOurs = seenIdentities.has(historyEntryIdentity(right));\n    if (leftFromOurs !== rightFromOurs) {\n      return Number(rightFromOurs) - Number(leftFromOurs);\n    }\n    return historyEntryIdentity(left).localeCompare(historyEntryIdentity(right));\n  });\n  const reanchored = reanchorHistoryEntries([\n    ...ours.slice(0, shared),\n    ...mergedSuffix,\n  ]);\n  return {\n    merged: historyEntriesToRaw(reanchored.entries),\n    strategy: \"union_reanchor\",\n    common_entries: shared,\n    entries_from_ours: oursSuffix.length,\n    entries_from_theirs: theirsSuffix.length,\n    entries_total: reanchored.entries.length,\n    reanchored: true,\n  };\n}\n\n/** Documents the relationship event stream merge result payload exchanged by command, SDK, and package integrations. */\nexport interface RelationshipStreamMergeResult {\n  /** Merged JSONL content with consecutively renumbered `sequence` values, ready to be written as the resolved event store. */\n  merged: string;\n  /** Strategy the merge used: identical inputs, one-sided fast-forward, or a deterministic union with renumbered sequences. */\n  strategy: HistoryMergeStrategy;\n  /** Number of events shared by both sides before their streams diverged. */\n  common_entries: number;\n  /** Number of divergent events contributed by the ours side. */\n  entries_from_ours: number;\n  /** Number of divergent events contributed by the theirs side. */\n  entries_from_theirs: number;\n  /** Total events in the merged stream. */\n  entries_total: number;\n  /** Whether merged events required sequence renumbering (true for every union merge). */\n  reanchored: boolean;\n}\n\ninterface RelationshipStreamEvent {\n  /** Globally unique event identity used for prefix detection and suffix deduplication. */\n  eventId: string;\n  /** One-based append sequence; rewritten consecutively in the merged stream. */\n  sequence: number;\n  /** ISO timestamp used to order divergent suffixes deterministically. */\n  timestamp?: string;\n  /** Remaining event payload fields, preserved verbatim. */\n  [key: string]: unknown;\n}\n\nfunction parseRelationshipJsonl(\n  raw: string,\n  label: string,\n): RelationshipStreamEvent[] {\n  const conflictMarker = findFirstMergeConflictMarker(raw);\n  if (conflictMarker) {\n    throw new PmCliError(\n      `Relationship merge input (${label}) contains unresolved conflict markers at line ${conflictMarker.line}. Merge drivers must receive clean per-side versions.`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n  const events: RelationshipStreamEvent[] = [];\n  for (const [index, rawLine] of raw.split(/\\r?\\n/).entries()) {\n    const line = rawLine.trim();\n    if (!line) {\n      continue;\n    }\n    let parsed: unknown;\n    try {\n      parsed = JSON.parse(line) as unknown;\n    } catch {\n      throw new PmCliError(\n        `Relationship merge input (${label}) contains invalid JSON at line ${index + 1}.`,\n        EXIT_CODE.GENERIC_FAILURE,\n      );\n    }\n    if (\n      typeof parsed !== \"object\" ||\n      parsed === null ||\n      Array.isArray(parsed) ||\n      typeof (parsed as { eventId?: unknown }).eventId !== \"string\" ||\n      typeof (parsed as { sequence?: unknown }).sequence !== \"number\"\n    ) {\n      throw new PmCliError(\n        `Relationship merge input (${label}) line ${index + 1} is not a relationship event (eventId + sequence required).`,\n        EXIT_CODE.GENERIC_FAILURE,\n      );\n    }\n    events.push(parsed as RelationshipStreamEvent);\n  }\n  return events;\n}\n\nfunction relationshipEventsToRaw(events: RelationshipStreamEvent[]): string {\n  return events.length === 0\n    ? \"\"\n    : `${events.map((event) => JSON.stringify(event)).join(\"\\n\")}\\n`;\n}\n\nfunction renumberRelationshipEvents(\n  events: RelationshipStreamEvent[],\n): RelationshipStreamEvent[] {\n  return events.map((event, index) => ({ ...event, sequence: index + 1 }));\n}\n\n/**\n * Deterministically merge two diverged versions of one append-only\n * relationship event JSONL store. The store's loader enforces strictly\n * consecutive one-based `sequence` values, so a plain text union of two\n * diverged streams is always unreadable; this merge keeps the shared prefix,\n * unions both divergent suffixes by `eventId` (ordered by event timestamp,\n * ours-first on ties), and renumbers every merged sequence consecutively so\n * the resulting stream loads again. No side's events are ever discarded.\n */\nexport function mergeRelationshipEventStreams(\n  baseRaw: string,\n  oursRaw: string,\n  theirsRaw: string,\n): RelationshipStreamMergeResult {\n  parseRelationshipJsonl(baseRaw, \"base\");\n  const ours = parseRelationshipJsonl(oursRaw, \"ours\");\n  const theirs = parseRelationshipJsonl(theirsRaw, \"theirs\");\n  const limit = Math.min(ours.length, theirs.length);\n  let shared = 0;\n  while (shared < limit && ours[shared].eventId === theirs[shared].eventId) {\n    shared += 1;\n  }\n\n  if (shared === ours.length && shared === theirs.length) {\n    return {\n      merged: relationshipEventsToRaw(ours),\n      strategy: \"identical\",\n      common_entries: shared,\n      entries_from_ours: 0,\n      entries_from_theirs: 0,\n      entries_total: ours.length,\n      reanchored: false,\n    };\n  }\n  if (shared === theirs.length) {\n    return {\n      merged: relationshipEventsToRaw(ours),\n      strategy: \"fast_forward_ours\",\n      common_entries: shared,\n      entries_from_ours: ours.length - shared,\n      entries_from_theirs: 0,\n      entries_total: ours.length,\n      reanchored: false,\n    };\n  }\n  if (shared === ours.length) {\n    return {\n      merged: relationshipEventsToRaw(theirs),\n      strategy: \"fast_forward_theirs\",\n      common_entries: shared,\n      entries_from_ours: 0,\n      entries_from_theirs: theirs.length - shared,\n      entries_total: theirs.length,\n      reanchored: false,\n    };\n  }\n\n  const oursSuffix = ours.slice(shared);\n  const oursEventIds = new Set(oursSuffix.map((event) => event.eventId));\n  const theirsSuffix = theirs\n    .slice(shared)\n    .filter((event) => !oursEventIds.has(event.eventId));\n  const mergedSuffix = [...oursSuffix, ...theirsSuffix].sort((left, right) => {\n    if (left.timestamp !== undefined && right.timestamp !== undefined) {\n      const byTs = compareTimestampStrings(left.timestamp, right.timestamp);\n      if (byTs !== 0) {\n        return byTs;\n      }\n    } else if (left.timestamp === undefined && right.timestamp !== undefined) {\n      return 1;\n    } else if (left.timestamp !== undefined) {\n      return -1;\n    }\n    const leftFromOurs = oursEventIds.has(left.eventId);\n    const rightFromOurs = oursEventIds.has(right.eventId);\n    if (leftFromOurs !== rightFromOurs) {\n      return Number(rightFromOurs) - Number(leftFromOurs);\n    }\n    // Array.prototype.sort is stable: returning zero preserves each side's\n    // original append order when its events share a timestamp.\n    return 0;\n  });\n  const merged = renumberRelationshipEvents([\n    ...ours.slice(0, shared),\n    ...mergedSuffix,\n  ]);\n  return {\n    merged: relationshipEventsToRaw(merged),\n    strategy: \"union_reanchor\",\n    common_entries: shared,\n    entries_from_ours: oursSuffix.length,\n    entries_from_theirs: theirsSuffix.length,\n    entries_total: merged.length,\n    reanchored: true,\n  };\n}\n\n/**\n * Item metadata collections merged by element-identity set semantics instead\n * of whole-field three-way comparison: concurrent commutative appends from two\n * branches (notes on A, tags on B, a test run on each) must merge cleanly.\n * Element identity is the stable serialization of the normalized element, so\n * an element edited on one side counts as remove-old + add-new and both sides'\n * contributions survive. Plan collections are deliberately excluded: plan\n * steps carry cross-element ordering invariants that set-union would corrupt,\n * so they stay under scalar three-way semantics with explicit conflicts.\n */\nexport const ITEM_UNION_COLLECTION_FIELDS = [\n  \"tags\",\n  \"dependencies\",\n  \"comments\",\n  \"notes\",\n  \"learnings\",\n  \"files\",\n  \"tests\",\n  \"test_runs\",\n  \"docs\",\n  \"reminders\",\n  \"events\",\n] as const;\n\n/** Item metadata fields resolved by deterministic latest-timestamp-wins instead of three-way conflict, so disjoint-field edits never conflict on the shared freshness scalar every mutation rewrites. */\nexport const ITEM_LATEST_TIMESTAMP_FIELDS = [\"updated_at\"] as const;\n\n/** Documents the item document merge result payload exchanged by command, SDK, and package integrations. */\nexport interface ItemDocumentMergeResult {\n  /** Serialized merged item document (always parseable; count headers recomputed by canonical serialization). */\n  merged: string;\n  /** Metadata fields (plus `body`) where both sides changed to different values; resolved toward the preferred side. */\n  conflict_fields: string[];\n  /** Fields taken from the theirs side by clean three-way resolution. */\n  fields_from_theirs: string[];\n  /** Collection fields that merged by element-identity union. */\n  union_fields: string[];\n  /** Which side unresolvable conflicts were resolved toward. */\n  preferred: MergePreferredSide;\n}\n\nfunction jsonEquals(left: unknown, right: unknown): boolean {\n  return stableStringify(left ?? null) === stableStringify(right ?? null);\n}\n\nfunction unionCollection(\n  base: unknown,\n  ours: unknown,\n  theirs: unknown,\n): unknown[] {\n  const toEntries = (value: unknown): unknown[] =>\n    Array.isArray(value) ? value : [];\n  const baseIds = new Set(toEntries(base).map((entry) => stableStringify(entry)));\n  const oursEntries = toEntries(ours);\n  const oursIds = new Set(oursEntries.map((entry) => stableStringify(entry)));\n  const theirsEntries = toEntries(theirs);\n  const theirsIds = new Set(\n    theirsEntries.map((entry) => stableStringify(entry)),\n  );\n  const merged = oursEntries.filter((entry) => {\n    const identity = stableStringify(entry);\n    // An element kept by ours survives unless theirs deleted it (present in\n    // base, absent from theirs).\n    return !baseIds.has(identity) || theirsIds.has(identity);\n  });\n  for (const entry of theirsEntries) {\n    const identity = stableStringify(entry);\n    if (!oursIds.has(identity) && !baseIds.has(identity)) {\n      merged.push(entry);\n    }\n  }\n  return merged;\n}\n\nfunction latestTimestamp(ours: unknown, theirs: unknown): unknown {\n  return compareTimestampStrings(String(ours), String(theirs)) >= 0\n    ? ours\n    : theirs;\n}\n\ninterface ScalarMergeOutcome {\n  value: unknown;\n  from_theirs: boolean;\n  conflict: boolean;\n}\n\nfunction mergeScalarThreeWay(\n  base: unknown,\n  ours: unknown,\n  theirs: unknown,\n  preferred: MergePreferredSide,\n): ScalarMergeOutcome {\n  if (jsonEquals(ours, theirs)) {\n    return { value: ours, from_theirs: false, conflict: false };\n  }\n  if (jsonEquals(base, ours)) {\n    return { value: theirs, from_theirs: true, conflict: false };\n  }\n  if (jsonEquals(base, theirs)) {\n    return { value: ours, from_theirs: false, conflict: false };\n  }\n  return {\n    value: preferred === \"theirs\" ? theirs : ours,\n    from_theirs: preferred === \"theirs\",\n    conflict: true,\n  };\n}\n\nfunction toMetadataRecord(document: ItemDocument): Record<string, unknown> {\n  return { ...(document.metadata as unknown as Record<string, unknown>) };\n}\n\nfunction parseItemMergeSide(\n  raw: string,\n  label: string,\n  options: ItemDocumentFormatOptions,\n): ItemDocument {\n  try {\n    return canonicalDocument(parseItemDocument(raw, options), options);\n  } catch (error) {\n    throw new PmCliError(\n      `Item merge input (${label}) is not a readable item document: ${String(error)}`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n}\n\ninterface ItemMetadataMergeAccumulator {\n  /** Merged metadata values keyed by canonical field name. */\n  merged: Record<string, unknown>;\n  /** Scalar fields where both sides diverged from the base. */\n  conflictFields: string[];\n  /** Scalar fields cleanly selected from the other branch. */\n  fieldsFromTheirs: string[];\n  /** Collection fields whose final union differs from ours. */\n  unionFields: string[];\n}\n\nfunction mergeItemMetadataRecords(\n  baseRecord: Record<string, unknown>,\n  oursRecord: Record<string, unknown>,\n  theirsRecord: Record<string, unknown>,\n  preferred: MergePreferredSide,\n): ItemMetadataMergeAccumulator {\n  const unionFieldSet = new Set<string>(ITEM_UNION_COLLECTION_FIELDS);\n  const latestFieldSet = new Set<string>(ITEM_LATEST_TIMESTAMP_FIELDS);\n  const fieldNames = [\n    ...new Set([...Object.keys(oursRecord), ...Object.keys(theirsRecord)]),\n  ].sort((left, right) => left.localeCompare(right));\n  const accumulator: ItemMetadataMergeAccumulator = {\n    merged: {},\n    conflictFields: [],\n    fieldsFromTheirs: [],\n    unionFields: [],\n  };\n\n  for (const field of fieldNames) {\n    const baseValue = baseRecord[field];\n    const oursValue = oursRecord[field];\n    const theirsValue = theirsRecord[field];\n    if (unionFieldSet.has(field)) {\n      const union = unionCollection(baseValue, oursValue, theirsValue);\n      // `fieldNames` is derived from both records' own keys, so a collection\n      // reached here is declared by at least one side. Preserve even an empty\n      // result (`tags` is required) so serialization never drops it.\n      accumulator.merged[field] = union;\n      if (!jsonEquals(union, oursValue)) {\n        accumulator.unionFields.push(field);\n      }\n      continue;\n    }\n    if (latestFieldSet.has(field)) {\n      accumulator.merged[field] = latestTimestamp(oursValue, theirsValue);\n      continue;\n    }\n    const outcome = mergeScalarThreeWay(\n      baseValue,\n      oursValue,\n      theirsValue,\n      preferred,\n    );\n    if (outcome.value !== undefined) {\n      accumulator.merged[field] = outcome.value;\n    }\n    if (outcome.conflict) {\n      accumulator.conflictFields.push(field);\n    } else if (outcome.from_theirs) {\n      accumulator.fieldsFromTheirs.push(field);\n    }\n  }\n  return accumulator;\n}\n\n/**\n * Field-aware three-way merge of one tracker item document. Commutative\n * collections (notes, tags, tests, ...) union by element identity so\n * concurrent appends never conflict; `updated_at` resolves to the latest\n * timestamp so disjoint-field edits never collide on the shared freshness\n * scalar; every other metadata field and the body use classic three-way\n * resolution. Unresolvable both-sides-changed conflicts are resolved toward\n * the preferred side but reported in `conflict_fields`, and the merged output\n * is always canonically serialized — count-prefixed TOON array headers are\n * recomputed, so the hand-resolution corruption class (stale `notes[N]`\n * headers) cannot be produced by this merge.\n */\nexport function mergeItemDocuments(\n  baseRaw: string,\n  oursRaw: string,\n  theirsRaw: string,\n  options: ItemDocumentFormatOptions & {\n    /** Side that wins unresolvable conflicts (default \"ours\"). */\n    preferred?: MergePreferredSide;\n  } = {},\n): ItemDocumentMergeResult {\n  const preferred: MergePreferredSide = options.preferred ?? \"ours\";\n  // An empty base means both branches created the file independently\n  // (add/add); three-way falls back to treating every differing field as an\n  // ours/theirs decision, which the scalar resolver already models.\n  const hasBase = baseRaw.trim().length > 0;\n  const ours = parseItemMergeSide(oursRaw, \"ours\", options);\n  const theirs = parseItemMergeSide(theirsRaw, \"theirs\", options);\n  const base = hasBase ? parseItemMergeSide(baseRaw, \"base\", options) : ours;\n\n  const baseRecord = hasBase\n    ? toMetadataRecord(base)\n    : ({} as Record<string, unknown>);\n  const oursRecord = toMetadataRecord(ours);\n  const theirsRecord = toMetadataRecord(theirs);\n  const { merged, conflictFields, fieldsFromTheirs, unionFields } =\n    mergeItemMetadataRecords(baseRecord, oursRecord, theirsRecord, preferred);\n\n  const bodyOutcome = mergeScalarThreeWay(\n    hasBase ? base.body : \"\",\n    ours.body,\n    theirs.body,\n    preferred,\n  );\n  if (bodyOutcome.conflict) {\n    conflictFields.push(\"body\");\n  } else if (bodyOutcome.from_theirs) {\n    fieldsFromTheirs.push(\"body\");\n  }\n\n  const mergedRaw = serializeItemDocument(\n    {\n      metadata: merged as unknown as ItemMetadata,\n      body: bodyOutcome.value as string,\n    },\n    options,\n  );\n  return {\n    merged: mergedRaw,\n    conflict_fields: conflictFields,\n    fields_from_theirs: fieldsFromTheirs,\n    union_fields: unionFields,\n    preferred,\n  };\n}\n\n/** Documents the JSON document merge result payload exchanged by command, SDK, and package integrations. */\nexport interface JsonDocumentMergeResult {\n  /** Serialized merged JSON document (two-space indent, trailing newline — the tracker's canonical config style). */\n  merged: string;\n  /** Dotted key paths where both sides changed to different values; resolved toward the preferred side. */\n  conflict_paths: string[];\n  /** Dotted key paths taken from the theirs side by clean three-way resolution. */\n  paths_from_theirs: string[];\n  /** Which side unresolvable conflicts were resolved toward. */\n  preferred: MergePreferredSide;\n}\n\nfunction isPlainObject(value: unknown): value is Record<string, unknown> {\n  return (\n    typeof value === \"object\" &&\n    value !== null &&\n    !Array.isArray(value)\n  );\n}\n\nfunction parseJsonSide(raw: string, label: string): unknown {\n  const conflictMarker = findFirstMergeConflictMarker(raw);\n  if (conflictMarker) {\n    throw new PmCliError(\n      `JSON merge input (${label}) contains unresolved conflict markers at line ${conflictMarker.line}.`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n  if (raw.trim().length === 0) {\n    return undefined;\n  }\n  try {\n    return JSON.parse(raw) as unknown;\n  } catch {\n    throw new PmCliError(\n      `JSON merge input (${label}) is not valid JSON.`,\n      EXIT_CODE.GENERIC_FAILURE,\n    );\n  }\n}\n\nfunction mergeJsonValue(\n  base: unknown,\n  ours: unknown,\n  theirs: unknown,\n  preferred: MergePreferredSide,\n  pathPrefix: string,\n  conflictPaths: string[],\n  pathsFromTheirs: string[],\n): unknown {\n  if (jsonEquals(ours, theirs)) {\n    return ours;\n  }\n  if (isPlainObject(ours) && isPlainObject(theirs)) {\n    const baseObject = isPlainObject(base) ? base : {};\n    const merged: Record<string, unknown> = {};\n    const keys = [\n      ...new Set([...Object.keys(ours), ...Object.keys(theirs)]),\n    ].sort((left, right) => left.localeCompare(right));\n    for (const key of keys) {\n      const childPath = pathPrefix.length > 0 ? `${pathPrefix}.${key}` : key;\n      const child = mergeJsonKey(\n        baseObject,\n        ours,\n        theirs,\n        key,\n        preferred,\n        childPath,\n        conflictPaths,\n        pathsFromTheirs,\n      );\n      if (child !== undefined) {\n        merged[key] = child;\n      }\n    }\n    return merged;\n  }\n  const outcome = mergeScalarThreeWay(base, ours, theirs, preferred);\n  if (outcome.conflict) {\n    conflictPaths.push(pathPrefix);\n  } else if (outcome.from_theirs) {\n    pathsFromTheirs.push(pathPrefix);\n  }\n  return outcome.value;\n}\n\nfunction mergeJsonKey(\n  base: Record<string, unknown>,\n  ours: Record<string, unknown>,\n  theirs: Record<string, unknown>,\n  key: string,\n  preferred: MergePreferredSide,\n  childPath: string,\n  conflictPaths: string[],\n  pathsFromTheirs: string[],\n): unknown {\n  const inOurs = Object.prototype.hasOwnProperty.call(ours, key);\n  const inTheirs = Object.prototype.hasOwnProperty.call(theirs, key);\n  const inBase = Object.prototype.hasOwnProperty.call(base, key);\n  if (inOurs && inTheirs) {\n    return mergeJsonValue(\n      base[key],\n      ours[key],\n      theirs[key],\n      preferred,\n      childPath,\n      conflictPaths,\n      pathsFromTheirs,\n    );\n  }\n  if (inOurs) {\n    // Present only in ours: either ours added it (keep) or theirs deleted it\n    // (honor the delete when ours left it untouched from base).\n    if (inBase && jsonEquals(base[key], ours[key])) {\n      pathsFromTheirs.push(childPath);\n      return undefined;\n    }\n    if (inBase) {\n      conflictPaths.push(childPath);\n      return preferred === \"theirs\" ? undefined : ours[key];\n    }\n    return ours[key];\n  }\n  // Present only in theirs (mirror of the branch above).\n  if (inBase && jsonEquals(base[key], theirs[key])) {\n    return undefined;\n  }\n  if (inBase) {\n    conflictPaths.push(childPath);\n    return preferred === \"theirs\" ? theirs[key] : undefined;\n  }\n  pathsFromTheirs.push(childPath);\n  return theirs[key];\n}\n\n/**\n * Key-level three-way merge for the tracker's single-file JSON configuration\n * artifacts (`settings.json`, `schema/*.json`). Nested objects merge\n * recursively per key so two branches editing disjoint settings never\n * conflict; both-sides-changed leaf values resolve toward the preferred side\n * and are reported in `conflict_paths`. The output is always valid JSON, so a\n * merged configuration can never regress into the silent-defaults fallback\n * that raw conflict markers cause.\n */\nexport function mergeJsonDocuments(\n  baseRaw: string,\n  oursRaw: string,\n  theirsRaw: string,\n  options: {\n    /** Side that wins unresolvable conflicts (default \"ours\"). */\n    preferred?: MergePreferredSide;\n  } = {},\n): JsonDocumentMergeResult {\n  const preferred: MergePreferredSide = options.preferred ?? \"ours\";\n  const base = parseJsonSide(baseRaw, \"base\");\n  const ours = parseJsonSide(oursRaw, \"ours\");\n  const theirs = parseJsonSide(theirsRaw, \"theirs\");\n  const conflictPaths: string[] = [];\n  const pathsFromTheirs: string[] = [];\n  const merged = mergeJsonValue(\n    base,\n    ours,\n    theirs,\n    preferred,\n    \"\",\n    conflictPaths,\n    pathsFromTheirs,\n  );\n  return {\n    merged: `${JSON.stringify(merged ?? null, null, 2)}\\n`,\n    conflict_paths: conflictPaths,\n    paths_from_theirs: pathsFromTheirs,\n    preferred,\n  };\n}\n"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;;;AACH,OAAO,EACL,mBAAmB,EACnB,sBAAsB,GACvB,MAAM,8BAA8B,CAAC;AACtC,OAAO,EACL,iBAAiB,EACjB,iBAAiB,EACjB,qBAAqB,GAEtB,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAE,SAAS,EAAE,MAAM,gCAAgC,CAAC;AAC3D,OAAO,EAAE,4BAA4B,EAAE,MAAM,uCAAuC,CAAC;AACrF,OAAO,EAAE,UAAU,EAAE,MAAM,6BAA6B,CAAC;AACzD,OAAO,EAAE,eAAe,EAAE,MAAM,oCAAoC,CAAC;AACrE,OAAO,EAAE,uBAAuB,EAAE,MAAM,2BAA2B,CAAC;AAmCpE,SAAS,iBAAiB,CAAC,GAAW,EAAE,KAAa;IACnD,MAAM,cAAc,GAAG,4BAA4B,CAAC,GAAG,CAAC,CAAC;IACzD,IAAI,cAAc,EAAE,CAAC;QACnB,MAAM,IAAI,UAAU,CAClB,wBAAwB,KAAK,kDAAkD,cAAc,CAAC,IAAI,uDAAuD,EACzJ,SAAS,CAAC,eAAe,CAC1B,CAAC;IACJ,CAAC;IACD,MAAM,OAAO,GAAmB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5D,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,SAAS;QACX,CAAC;QACD,IAAI,CAAC;YACH,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAY,CAAC;YAC3C,IAAI,OAAO,MAAM,KAAK,QAAQ,IAAI,MAAM,KAAK,IAAI,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC3E,MAAM,IAAI,SAAS,CAAC,iCAAiC,CAAC,CAAC;YACzD,CAAC;YACD,OAAO,CAAC,IAAI,CAAC,MAAsB,CAAC,CAAC;QACvC,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,IAAI,UAAU,CAClB,wBAAwB,KAAK,mCAAmC,KAAK,GAAG,CAAC,GAAG,EAC5E,SAAS,CAAC,eAAe,CAC1B,CAAC;QACJ,CAAC;IACH,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,SAAS,oBAAoB,CAAC,KAAmB;IAC/C,OAAO,eAAe,CAAC;QACrB,EAAE,EAAE,KAAK,CAAC,EAAE;QACZ,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,EAAE,EAAE,KAAK,CAAC,EAAE;QACZ,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,OAAO,EAAE,KAAK,CAAC,OAAO,IAAI,IAAI;KAC/B,CAAC,CAAC;AACL,CAAC;AAED,SAAS,yBAAyB,CAChC,IAAoB,EACpB,MAAsB;IAEtB,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IACnD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,OACE,MAAM,GAAG,KAAK;QACd,oBAAoB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,oBAAoB,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,EAC3E,CAAC;QACD,MAAM,IAAI,CAAC,CAAC;IACd,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,mBAAmB,CACjC,OAAe,EACf,OAAe,EACf,SAAiB;IAEjB,iBAAiB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACnC,MAAM,IAAI,GAAG,iBAAiB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAChD,MAAM,MAAM,GAAG,iBAAiB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IACtD,MAAM,MAAM,GAAG,yBAAyB,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAEvD,IAAI,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;QACvD,OAAO;YACL,MAAM,EAAE,mBAAmB,CAAC,IAAI,CAAC;YACjC,QAAQ,EAAE,WAAW;YACrB,cAAc,EAAE,MAAM;YACtB,iBAAiB,EAAE,CAAC;YACpB,mBAAmB,EAAE,CAAC;YACtB,aAAa,EAAE,IAAI,CAAC,MAAM;YAC1B,UAAU,EAAE,KAAK;SAClB,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;QAC7B,OAAO;YACL,MAAM,EAAE,mBAAmB,CAAC,IAAI,CAAC;YACjC,QAAQ,EAAE,mBAAmB;YAC7B,cAAc,EAAE,MAAM;YACtB,iBAAiB,EAAE,IAAI,CAAC,MAAM,GAAG,MAAM;YACvC,mBAAmB,EAAE,CAAC;YACtB,aAAa,EAAE,IAAI,CAAC,MAAM;YAC1B,UAAU,EAAE,KAAK;SAClB,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,OAAO;YACL,MAAM,EAAE,mBAAmB,CAAC,MAAM,CAAC;YACnC,QAAQ,EAAE,qBAAqB;YAC/B,cAAc,EAAE,MAAM;YACtB,iBAAiB,EAAE,CAAC;YACpB,mBAAmB,EAAE,MAAM,CAAC,MAAM,GAAG,MAAM;YAC3C,aAAa,EAAE,MAAM,CAAC,MAAM;YAC5B,UAAU,EAAE,KAAK;SAClB,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACtC,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,oBAAoB,CAAC,CAAC,CAAC;IACrE,MAAM,YAAY,GAAG,MAAM;SACxB,KAAK,CAAC,MAAM,CAAC;SACb,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,YAAY,GAAG,CAAC,GAAG,UAAU,EAAE,GAAG,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QACzE,MAAM,IAAI,GAAG,uBAAuB,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,CAAC,CAAC;QACxD,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACf,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,YAAY,GAAG,cAAc,CAAC,GAAG,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC;QACpE,MAAM,aAAa,GAAG,cAAc,CAAC,GAAG,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC,CAAC;QACtE,IAAI,YAAY,KAAK,aAAa,EAAE,CAAC;YACnC,OAAO,MAAM,CAAC,aAAa,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC;QACtD,CAAC;QACD,OAAO,oBAAoB,CAAC,IAAI,CAAC,CAAC,aAAa,CAAC,oBAAoB,CAAC,KAAK,CAAC,CAAC,CAAC;IAC/E,CAAC,CAAC,CAAC;IACH,MAAM,UAAU,GAAG,sBAAsB,CAAC;QACxC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC;QACxB,GAAG,YAAY;KAChB,CAAC,CAAC;IACH,OAAO;QACL,MAAM,EAAE,mBAAmB,CAAC,UAAU,CAAC,OAAO,CAAC;QAC/C,QAAQ,EAAE,gBAAgB;QAC1B,cAAc,EAAE,MAAM;QACtB,iBAAiB,EAAE,UAAU,CAAC,MAAM;QACpC,mBAAmB,EAAE,YAAY,CAAC,MAAM;QACxC,aAAa,EAAE,UAAU,CAAC,OAAO,CAAC,MAAM;QACxC,UAAU,EAAE,IAAI;KACjB,CAAC;AACJ,CAAC;AA+BD,SAAS,sBAAsB,CAC7B,GAAW,EACX,KAAa;IAEb,MAAM,cAAc,GAAG,4BAA4B,CAAC,GAAG,CAAC,CAAC;IACzD,IAAI,cAAc,EAAE,CAAC;QACnB,MAAM,IAAI,UAAU,CAClB,6BAA6B,KAAK,kDAAkD,cAAc,CAAC,IAAI,uDAAuD,EAC9J,SAAS,CAAC,eAAe,CAC1B,CAAC;IACJ,CAAC;IACD,MAAM,MAAM,GAA8B,EAAE,CAAC;IAC7C,KAAK,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,IAAI,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QAC5D,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,SAAS;QACX,CAAC;QACD,IAAI,MAAe,CAAC;QACpB,IAAI,CAAC;YACH,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAY,CAAC;QACvC,CAAC;QAAC,MAAM,CAAC;YACP,MAAM,IAAI,UAAU,CAClB,6BAA6B,KAAK,mCAAmC,KAAK,GAAG,CAAC,GAAG,EACjF,SAAS,CAAC,eAAe,CAC1B,CAAC;QACJ,CAAC;QACD,IACE,OAAO,MAAM,KAAK,QAAQ;YAC1B,MAAM,KAAK,IAAI;YACf,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YACrB,OAAQ,MAAgC,CAAC,OAAO,KAAK,QAAQ;YAC7D,OAAQ,MAAiC,CAAC,QAAQ,KAAK,QAAQ,EAC/D,CAAC;YACD,MAAM,IAAI,UAAU,CAClB,6BAA6B,KAAK,UAAU,KAAK,GAAG,CAAC,6DAA6D,EAClH,SAAS,CAAC,eAAe,CAC1B,CAAC;QACJ,CAAC;QACD,MAAM,CAAC,IAAI,CAAC,MAAiC,CAAC,CAAC;IACjD,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,uBAAuB,CAAC,MAAiC;IAChE,OAAO,MAAM,CAAC,MAAM,KAAK,CAAC;QACxB,CAAC,CAAC,EAAE;QACJ,CAAC,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;AACrE,CAAC;AAED,SAAS,0BAA0B,CACjC,MAAiC;IAEjC,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3E,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,6BAA6B,CAC3C,OAAe,EACf,OAAe,EACf,SAAiB;IAEjB,sBAAsB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACxC,MAAM,IAAI,GAAG,sBAAsB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACrD,MAAM,MAAM,GAAG,sBAAsB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAC3D,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IACnD,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,OAAO,MAAM,GAAG,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,OAAO,KAAK,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,CAAC;QACzE,MAAM,IAAI,CAAC,CAAC;IACd,CAAC;IAED,IAAI,MAAM,KAAK,IAAI,CAAC,MAAM,IAAI,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;QACvD,OAAO;YACL,MAAM,EAAE,uBAAuB,CAAC,IAAI,CAAC;YACrC,QAAQ,EAAE,WAAW;YACrB,cAAc,EAAE,MAAM;YACtB,iBAAiB,EAAE,CAAC;YACpB,mBAAmB,EAAE,CAAC;YACtB,aAAa,EAAE,IAAI,CAAC,MAAM;YAC1B,UAAU,EAAE,KAAK;SAClB,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,KAAK,MAAM,CAAC,MAAM,EAAE,CAAC;QAC7B,OAAO;YACL,MAAM,EAAE,uBAAuB,CAAC,IAAI,CAAC;YACrC,QAAQ,EAAE,mBAAmB;YAC7B,cAAc,EAAE,MAAM;YACtB,iBAAiB,EAAE,IAAI,CAAC,MAAM,GAAG,MAAM;YACvC,mBAAmB,EAAE,CAAC;YACtB,aAAa,EAAE,IAAI,CAAC,MAAM;YAC1B,UAAU,EAAE,KAAK;SAClB,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,KAAK,IAAI,CAAC,MAAM,EAAE,CAAC;QAC3B,OAAO;YACL,MAAM,EAAE,uBAAuB,CAAC,MAAM,CAAC;YACvC,QAAQ,EAAE,qBAAqB;YAC/B,cAAc,EAAE,MAAM;YACtB,iBAAiB,EAAE,CAAC;YACpB,mBAAmB,EAAE,MAAM,CAAC,MAAM,GAAG,MAAM;YAC3C,aAAa,EAAE,MAAM,CAAC,MAAM;YAC5B,UAAU,EAAE,KAAK;SAClB,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACtC,MAAM,YAAY,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;IACvE,MAAM,YAAY,GAAG,MAAM;SACxB,KAAK,CAAC,MAAM,CAAC;SACb,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;IACvD,MAAM,YAAY,GAAG,CAAC,GAAG,UAAU,EAAE,GAAG,YAAY,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;QACzE,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;YAClE,MAAM,IAAI,GAAG,uBAAuB,CAAC,IAAI,CAAC,SAAS,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;YACtE,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;gBACf,OAAO,IAAI,CAAC;YACd,CAAC;QACH,CAAC;aAAM,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,IAAI,KAAK,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;YACzE,OAAO,CAAC,CAAC;QACX,CAAC;aAAM,IAAI,IAAI,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;YACxC,OAAO,CAAC,CAAC,CAAC;QACZ,CAAC;QACD,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACpD,MAAM,aAAa,GAAG,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QACtD,IAAI,YAAY,KAAK,aAAa,EAAE,CAAC;YACnC,OAAO,MAAM,CAAC,aAAa,CAAC,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC;QACtD,CAAC;QACD,uEAAuE;QACvE,2DAA2D;QAC3D,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;IACH,MAAM,MAAM,GAAG,0BAA0B,CAAC;QACxC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC;QACxB,GAAG,YAAY;KAChB,CAAC,CAAC;IACH,OAAO;QACL,MAAM,EAAE,uBAAuB,CAAC,MAAM,CAAC;QACvC,QAAQ,EAAE,gBAAgB;QAC1B,cAAc,EAAE,MAAM;QACtB,iBAAiB,EAAE,UAAU,CAAC,MAAM;QACpC,mBAAmB,EAAE,YAAY,CAAC,MAAM;QACxC,aAAa,EAAE,MAAM,CAAC,MAAM;QAC5B,UAAU,EAAE,IAAI;KACjB,CAAC;AACJ,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,4BAA4B,GAAG;IAC1C,MAAM;IACN,cAAc;IACd,UAAU;IACV,OAAO;IACP,WAAW;IACX,OAAO;IACP,OAAO;IACP,WAAW;IACX,MAAM;IACN,WAAW;IACX,QAAQ;CACA,CAAC;AAEX,yMAAyM;AACzM,MAAM,CAAC,MAAM,4BAA4B,GAAG,CAAC,YAAY,CAAU,CAAC;AAgBpE,SAAS,UAAU,CAAC,IAAa,EAAE,KAAc;IAC/C,OAAO,eAAe,CAAC,IAAI,IAAI,IAAI,CAAC,KAAK,eAAe,CAAC,KAAK,IAAI,IAAI,CAAC,CAAC;AAC1E,CAAC;AAED,SAAS,eAAe,CACtB,IAAa,EACb,IAAa,EACb,MAAe;IAEf,MAAM,SAAS,GAAG,CAAC,KAAc,EAAa,EAAE,CAC9C,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChF,MAAM,WAAW,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAC5E,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC;IACxC,MAAM,SAAS,GAAG,IAAI,GAAG,CACvB,aAAa,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC,CACrD,CAAC;IACF,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE;QAC1C,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACxC,wEAAwE;QACxE,6BAA6B;QAC7B,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IAC3D,CAAC,CAAC,CAAC;IACH,KAAK,MAAM,KAAK,IAAI,aAAa,EAAE,CAAC;QAClC,MAAM,QAAQ,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACrD,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACrB,CAAC;IACH,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,eAAe,CAAC,IAAa,EAAE,MAAe;IACrD,OAAO,uBAAuB,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC;QAC/D,CAAC,CAAC,IAAI;QACN,CAAC,CAAC,MAAM,CAAC;AACb,CAAC;AAQD,SAAS,mBAAmB,CAC1B,IAAa,EACb,IAAa,EACb,MAAe,EACf,SAA6B;IAE7B,IAAI,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC9D,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;QAC3B,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,WAAW,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC/D,CAAC;IACD,IAAI,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;IAC9D,CAAC;IACD,OAAO;QACL,KAAK,EAAE,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI;QAC7C,WAAW,EAAE,SAAS,KAAK,QAAQ;QACnC,QAAQ,EAAE,IAAI;KACf,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CAAC,QAAsB;IAC9C,OAAO,EAAE,GAAI,QAAQ,CAAC,QAA+C,EAAE,CAAC;AAC1E,CAAC;AAED,SAAS,kBAAkB,CACzB,GAAW,EACX,KAAa,EACb,OAAkC;IAElC,IAAI,CAAC;QACH,OAAO,iBAAiB,CAAC,iBAAiB,CAAC,GAAG,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,CAAC;IACrE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,IAAI,UAAU,CAClB,qBAAqB,KAAK,sCAAsC,MAAM,CAAC,KAAK,CAAC,EAAE,EAC/E,SAAS,CAAC,eAAe,CAC1B,CAAC;IACJ,CAAC;AACH,CAAC;AAaD,SAAS,wBAAwB,CAC/B,UAAmC,EACnC,UAAmC,EACnC,YAAqC,EACrC,SAA6B;IAE7B,MAAM,aAAa,GAAG,IAAI,GAAG,CAAS,4BAA4B,CAAC,CAAC;IACpE,MAAM,cAAc,GAAG,IAAI,GAAG,CAAS,4BAA4B,CAAC,CAAC;IACrE,MAAM,UAAU,GAAG;QACjB,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;KACvE,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;IACnD,MAAM,WAAW,GAAiC;QAChD,MAAM,EAAE,EAAE;QACV,cAAc,EAAE,EAAE;QAClB,gBAAgB,EAAE,EAAE;QACpB,WAAW,EAAE,EAAE;KAChB,CAAC;IAEF,KAAK,MAAM,KAAK,IAAI,UAAU,EAAE,CAAC;QAC/B,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QACpC,MAAM,SAAS,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;QACpC,MAAM,WAAW,GAAG,YAAY,CAAC,KAAK,CAAC,CAAC;QACxC,IAAI,aAAa,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC7B,MAAM,KAAK,GAAG,eAAe,CAAC,SAAS,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;YACjE,uEAAuE;YACvE,wEAAwE;YACxE,+DAA+D;YAC/D,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,KAAK,CAAC;YAClC,IAAI,CAAC,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;gBAClC,WAAW,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACtC,CAAC;YACD,SAAS;QACX,CAAC;QACD,IAAI,cAAc,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;YAC9B,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,eAAe,CAAC,SAAS,EAAE,WAAW,CAAC,CAAC;YACpE,SAAS;QACX,CAAC;QACD,MAAM,OAAO,GAAG,mBAAmB,CACjC,SAAS,EACT,SAAS,EACT,WAAW,EACX,SAAS,CACV,CAAC;QACF,IAAI,OAAO,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAChC,WAAW,CAAC,MAAM,CAAC,KAAK,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;QAC5C,CAAC;QACD,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;YACrB,WAAW,CAAC,cAAc,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzC,CAAC;aAAM,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;YAC/B,WAAW,CAAC,gBAAgB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3C,CAAC;IACH,CAAC;IACD,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,kBAAkB,CAChC,OAAe,EACf,OAAe,EACf,SAAiB,EACjB,UAGI,EAAE;IAEN,MAAM,SAAS,GAAuB,OAAO,CAAC,SAAS,IAAI,MAAM,CAAC;IAClE,mEAAmE;IACnE,0EAA0E;IAC1E,kEAAkE;IAClE,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC;IAC1C,MAAM,IAAI,GAAG,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC;IAC1D,MAAM,MAAM,GAAG,kBAAkB,CAAC,SAAS,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAC;IAChE,MAAM,IAAI,GAAG,OAAO,CAAC,CAAC,CAAC,kBAAkB,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAE3E,MAAM,UAAU,GAAG,OAAO;QACxB,CAAC,CAAC,gBAAgB,CAAC,IAAI,CAAC;QACxB,CAAC,CAAE,EAA8B,CAAC;IACpC,MAAM,UAAU,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;IAC1C,MAAM,YAAY,GAAG,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAC9C,MAAM,EAAE,MAAM,EAAE,cAAc,EAAE,gBAAgB,EAAE,WAAW,EAAE,GAC7D,wBAAwB,CAAC,UAAU,EAAE,UAAU,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;IAE5E,MAAM,WAAW,GAAG,mBAAmB,CACrC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EACxB,IAAI,CAAC,IAAI,EACT,MAAM,CAAC,IAAI,EACX,SAAS,CACV,CAAC;IACF,IAAI,WAAW,CAAC,QAAQ,EAAE,CAAC;QACzB,cAAc,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9B,CAAC;SAAM,IAAI,WAAW,CAAC,WAAW,EAAE,CAAC;QACnC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,SAAS,GAAG,qBAAqB,CACrC;QACE,QAAQ,EAAE,MAAiC;QAC3C,IAAI,EAAE,WAAW,CAAC,KAAe;KAClC,EACD,OAAO,CACR,CAAC;IACF,OAAO;QACL,MAAM,EAAE,SAAS;QACjB,eAAe,EAAE,cAAc;QAC/B,kBAAkB,EAAE,gBAAgB;QACpC,YAAY,EAAE,WAAW;QACzB,SAAS;KACV,CAAC;AACJ,CAAC;AAcD,SAAS,aAAa,CAAC,KAAc;IACnC,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,KAAK,IAAI;QACd,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CACtB,CAAC;AACJ,CAAC;AAED,SAAS,aAAa,CAAC,GAAW,EAAE,KAAa;IAC/C,MAAM,cAAc,GAAG,4BAA4B,CAAC,GAAG,CAAC,CAAC;IACzD,IAAI,cAAc,EAAE,CAAC;QACnB,MAAM,IAAI,UAAU,CAClB,qBAAqB,KAAK,kDAAkD,cAAc,CAAC,IAAI,GAAG,EAClG,SAAS,CAAC,eAAe,CAC1B,CAAC;IACJ,CAAC;IACD,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC5B,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,CAAC;QACH,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAY,CAAC;IACpC,CAAC;IAAC,MAAM,CAAC;QACP,MAAM,IAAI,UAAU,CAClB,qBAAqB,KAAK,sBAAsB,EAChD,SAAS,CAAC,eAAe,CAC1B,CAAC;IACJ,CAAC;AACH,CAAC;AAED,SAAS,cAAc,CACrB,IAAa,EACb,IAAa,EACb,MAAe,EACf,SAA6B,EAC7B,UAAkB,EAClB,aAAuB,EACvB,eAAyB;IAEzB,IAAI,UAAU,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,aAAa,CAAC,IAAI,CAAC,IAAI,aAAa,CAAC,MAAM,CAAC,EAAE,CAAC;QACjD,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC;QACnD,MAAM,MAAM,GAA4B,EAAE,CAAC;QAC3C,MAAM,IAAI,GAAG;YACX,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;SAC3D,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;QACnD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,UAAU,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC;YACvE,MAAM,KAAK,GAAG,YAAY,CACxB,UAAU,EACV,IAAI,EACJ,MAAM,EACN,GAAG,EACH,SAAS,EACT,SAAS,EACT,aAAa,EACb,eAAe,CAChB,CAAC;YACF,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;gBACxB,MAAM,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;YACtB,CAAC;QACH,CAAC;QACD,OAAO,MAAM,CAAC;IAChB,CAAC;IACD,MAAM,OAAO,GAAG,mBAAmB,CAAC,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC;IACnE,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QACrB,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACjC,CAAC;SAAM,IAAI,OAAO,CAAC,WAAW,EAAE,CAAC;QAC/B,eAAe,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,OAAO,CAAC,KAAK,CAAC;AACvB,CAAC;AAED,SAAS,YAAY,CACnB,IAA6B,EAC7B,IAA6B,EAC7B,MAA+B,EAC/B,GAAW,EACX,SAA6B,EAC7B,SAAiB,EACjB,aAAuB,EACvB,eAAyB;IAEzB,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC/D,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IACnE,MAAM,MAAM,GAAG,MAAM,CAAC,SAAS,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;IAC/D,IAAI,MAAM,IAAI,QAAQ,EAAE,CAAC;QACvB,OAAO,cAAc,CACnB,IAAI,CAAC,GAAG,CAAC,EACT,IAAI,CAAC,GAAG,CAAC,EACT,MAAM,CAAC,GAAG,CAAC,EACX,SAAS,EACT,SAAS,EACT,aAAa,EACb,eAAe,CAChB,CAAC;IACJ,CAAC;IACD,IAAI,MAAM,EAAE,CAAC;QACX,yEAAyE;QACzE,4DAA4D;QAC5D,IAAI,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;YAC/C,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAChC,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,IAAI,MAAM,EAAE,CAAC;YACX,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC9B,OAAO,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACxD,CAAC;QACD,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC;IACnB,CAAC;IACD,uDAAuD;IACvD,IAAI,MAAM,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QACjD,OAAO,SAAS,CAAC;IACnB,CAAC;IACD,IAAI,MAAM,EAAE,CAAC;QACX,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC9B,OAAO,SAAS,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAC1D,CAAC;IACD,eAAe,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAChC,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC;AACrB,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,kBAAkB,CAChC,OAAe,EACf,OAAe,EACf,SAAiB,EACjB,UAGI,EAAE;IAEN,MAAM,SAAS,GAAuB,OAAO,CAAC,SAAS,IAAI,MAAM,CAAC;IAClE,MAAM,IAAI,GAAG,aAAa,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC5C,MAAM,IAAI,GAAG,aAAa,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IAC5C,MAAM,MAAM,GAAG,aAAa,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IAClD,MAAM,aAAa,GAAa,EAAE,CAAC;IACnC,MAAM,eAAe,GAAa,EAAE,CAAC;IACrC,MAAM,MAAM,GAAG,cAAc,CAC3B,IAAI,EACJ,IAAI,EACJ,MAAM,EACN,SAAS,EACT,EAAE,EACF,aAAa,EACb,eAAe,CAChB,CAAC;IACF,OAAO;QACL,MAAM,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,IAAI,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI;QACtD,cAAc,EAAE,aAAa;QAC7B,iBAAiB,EAAE,eAAe;QAClC,SAAS;KACV,CAAC;AACJ,CAAC","debugId":"fa427b53-b1ae-53d0-acec-dfc1eb22bfd1"}