@keboola/design 11.0.0 → 11.2.0

package/dist/useMergeDiff-CvowEXJ1.js

@@ -0,0 +1,465 @@
+import { CHANGE_CLASS, CHUNK_TYPE } from "./internal/components/MergeEditor/constants.js";
+import { useCallback, useEffect, useLayoutEffect, useMemo, useRef, useState } from "react";
+import { diffLines } from "diff";
+import { diff3Merge } from "node-diff3";
+//#region src/components/MergeEditor/helpers.ts
+/**
+* Computes diff chunks between oldText and newText using line-level diffing.
+* Adjacent removed+added pairs are kept as separate chunks so the consumer
+* can pair them into "modifications" for accept controls.
+*/
+const computeDiffChunks = (oldText, newText) => {
+	const changes = diffLines(oldText, newText);
+	const chunks = [];
+	let oldLine = 1;
+	let newLine = 1;
+	for (const change of changes) {
+		if (change.value === "") continue;
+		const lineCount = change.count || change.value.replace(/\n$/, "").split("\n").length;
+		if (change.removed) {
+			chunks.push({
+				type: CHUNK_TYPE.REMOVED,
+				value: change.value,
+				oldStart: oldLine,
+				oldEnd: oldLine + lineCount - 1,
+				newStart: newLine,
+				newEnd: newLine
+			});
+			oldLine += lineCount;
+		} else if (change.added) {
+			chunks.push({
+				type: CHUNK_TYPE.ADDED,
+				value: change.value,
+				oldStart: oldLine,
+				oldEnd: oldLine,
+				newStart: newLine,
+				newEnd: newLine + lineCount - 1
+			});
+			newLine += lineCount;
+		} else {
+			chunks.push({
+				type: CHUNK_TYPE.UNCHANGED,
+				value: change.value,
+				oldStart: oldLine,
+				oldEnd: oldLine + lineCount - 1,
+				newStart: newLine,
+				newEnd: newLine + lineCount - 1
+			});
+			oldLine += lineCount;
+			newLine += lineCount;
+		}
+	}
+	return chunks;
+};
+/**
+* Collects 1-indexed line numbers that are marked as changed (added or removed)
+* from a set of diff chunks. `side` determines which line range to use.
+*/
+const getChangedLineNumbers = (chunks, side) => {
+	const lines = /* @__PURE__ */ new Set();
+	for (const chunk of chunks) {
+		if (chunk.type === CHUNK_TYPE.UNCHANGED) continue;
+		if (side === "old" && chunk.type === CHUNK_TYPE.REMOVED) for (let i = chunk.oldStart; i <= chunk.oldEnd; i++) lines.add(i);
+		if (side === "new" && chunk.type === CHUNK_TYPE.ADDED) for (let i = chunk.newStart; i <= chunk.newEnd; i++) lines.add(i);
+	}
+	return lines;
+};
+/**
+* Filters changed line numbers, keeping only those that are classified
+* and not suppressed (resolved/dismissed).
+*
+* `classification` and `suppressedLines` must be keyed by line numbers
+* from the same `side` (old-side lines for 'old', new-side lines for 'new').
+*/
+const filterHighlightedLines = (chunks, side, classification, suppressedLines) => {
+	const filtered = /* @__PURE__ */ new Set();
+	for (const line of getChangedLineNumbers(chunks, side)) if (classification.has(line) && !suppressedLines.has(line)) filtered.add(line);
+	return filtered;
+};
+/**
+* Replaces lines in `text` between `startLine` and `endLine` (1-indexed, inclusive)
+* with `replacementLines`. If startLine > endLine, inserts before startLine.
+*/
+const replaceLines = (text, startLine, endLine, replacement) => {
+	const lines = text.split("\n");
+	const before = lines.slice(0, startLine - 1);
+	const after = startLine > endLine ? lines.slice(startLine - 1) : lines.slice(endLine);
+	const replacementArr = replacement === "" ? [] : replacement.replace(/\n$/, "").split("\n");
+	return [
+		...before,
+		...replacementArr,
+		...after
+	].join("\n");
+};
+//#endregion
+//#region src/components/MergeEditor/useMergeDiff.ts
+const DEBOUNCE_MS = 150;
+const rangesOverlap = (s1, e1, s2, e2) => s1 <= e2 && e1 >= s2;
+const computeSuppressedLines = (dismissedLines, pairs, resolvedIds, getRange) => {
+	const lines = new Set(dismissedLines);
+	for (const pair of pairs) if (resolvedIds.has(pair.id)) {
+		const [start, end] = getRange(pair);
+		for (let i = start; i <= end; i++) lines.add(i);
+	}
+	return lines;
+};
+const filterVisibleConflicts = (conflicts, classification, dismissedLines, getRange, findPair, fullyResolvedPairIds) => conflicts.filter((c) => {
+	const [start, end] = getRange(c);
+	let hasClassifiedLine = false;
+	let allDismissed = true;
+	for (let i = start; i <= end; i++) {
+		if (classification.has(i)) hasClassifiedLine = true;
+		if (!dismissedLines.has(i)) allDismissed = false;
+	}
+	if (!hasClassifiedLine || allDismissed) return false;
+	const pair = findPair(c);
+	return !pair || !fullyResolvedPairIds.has(pair.id);
+});
+const useMergeDiff = (baseText, leftText, rightText) => {
+	const [mergeValue, setMergeValue] = useState(baseText);
+	const debounceRef = useRef(null);
+	const [debouncedMergeValue, setDebouncedMergeValue] = useState(mergeValue);
+	const [acceptedPairSides, setAcceptedPairSides] = useState(() => /* @__PURE__ */ new Map());
+	const [dismissedLeftLines, setDismissedLeftLines] = useState(() => /* @__PURE__ */ new Set());
+	const [dismissedRightLines, setDismissedRightLines] = useState(() => /* @__PURE__ */ new Set());
+	const reset = useCallback(() => {
+		if (debounceRef.current) {
+			clearTimeout(debounceRef.current);
+			debounceRef.current = null;
+		}
+		setMergeValue(baseText);
+		setDebouncedMergeValue(baseText);
+		setAcceptedPairSides(/* @__PURE__ */ new Map());
+		setDismissedLeftLines(/* @__PURE__ */ new Set());
+		setDismissedRightLines(/* @__PURE__ */ new Set());
+	}, [baseText]);
+	useLayoutEffect(() => {
+		reset();
+	}, [
+		baseText,
+		leftText,
+		rightText
+	]);
+	useEffect(() => {
+		return () => {
+			if (debounceRef.current) clearTimeout(debounceRef.current);
+		};
+	}, []);
+	const handleMergeChange = useCallback((value) => {
+		setMergeValue(value);
+		if (debounceRef.current) clearTimeout(debounceRef.current);
+		debounceRef.current = setTimeout(() => {
+			setDebouncedMergeValue(value);
+		}, DEBOUNCE_MS);
+	}, []);
+	const leftDiffChunks = useMemo(() => computeDiffChunks(leftText, debouncedMergeValue), [leftText, debouncedMergeValue]);
+	const rightDiffChunks = useMemo(() => computeDiffChunks(debouncedMergeValue, rightText), [debouncedMergeValue, rightText]);
+	const leftConflicts = useMemo(() => pairChunksIntoConflicts(leftDiffChunks), [leftDiffChunks]);
+	const rightConflicts = useMemo(() => pairChunksIntoConflicts(rightDiffChunks), [rightDiffChunks]);
+	const leftVsBase = useMemo(() => computeDiffChunks(baseText, leftText), [baseText, leftText]);
+	const rightVsBase = useMemo(() => computeDiffChunks(baseText, rightText), [baseText, rightText]);
+	const { leftClassification, rightClassification, conflictPairs } = useMemo(() => {
+		const baseLines = baseText.split("\n");
+		const leftLines = leftText.split("\n");
+		const rightLines = rightText.split("\n");
+		const result = diff3Merge(leftLines, baseLines, rightLines);
+		const leftConflictLineSet = /* @__PURE__ */ new Set();
+		const rightConflictLineSet = /* @__PURE__ */ new Set();
+		const pairs = [];
+		for (const block of result) if ("conflict" in block && block.conflict) {
+			const { a, aIndex, b, bIndex } = block.conflict;
+			for (let i = 0; i < a.length; i++) leftConflictLineSet.add(aIndex + i + 1);
+			for (let i = 0; i < b.length; i++) rightConflictLineSet.add(bIndex + i + 1);
+			pairs.push({
+				id: `pair-${aIndex}-${bIndex}`,
+				leftStart: aIndex + 1,
+				leftEnd: aIndex + a.length,
+				rightStart: bIndex + 1,
+				rightEnd: bIndex + b.length
+			});
+		}
+		const leftChanged = getChangedLineNumbers(leftVsBase, "new");
+		const rightChanged = getChangedLineNumbers(rightVsBase, "new");
+		const leftMap = /* @__PURE__ */ new Map();
+		for (const line of leftChanged) leftMap.set(line, leftConflictLineSet.has(line) ? CHANGE_CLASS.CONFLICT : CHANGE_CLASS.SAFE);
+		const rightMap = /* @__PURE__ */ new Map();
+		for (const line of rightChanged) rightMap.set(line, rightConflictLineSet.has(line) ? CHANGE_CLASS.CONFLICT : CHANGE_CLASS.SAFE);
+		return {
+			leftClassification: leftMap,
+			rightClassification: rightMap,
+			conflictPairs: pairs
+		};
+	}, [
+		baseText,
+		leftText,
+		rightText,
+		leftVsBase,
+		rightVsBase
+	]);
+	const findPairForLeft = useCallback((conflict) => conflictPairs.find((p) => rangesOverlap(conflict.oldStartLine, conflict.oldEndLine, p.leftStart, p.leftEnd)), [conflictPairs]);
+	const findPairForRight = useCallback((conflict) => conflictPairs.find((p) => rangesOverlap(conflict.newStartLine, conflict.newEndLine, p.rightStart, p.rightEnd)), [conflictPairs]);
+	const markSideAccepted = useCallback((pair, side) => {
+		if (!pair) return;
+		setAcceptedPairSides((prev) => {
+			const next = new Map(prev);
+			const sides = new Set(prev.get(pair.id) ?? []);
+			sides.add(side);
+			next.set(pair.id, sides);
+			return next;
+		});
+	}, []);
+	const isOtherSideAccepted = useCallback((pair, side) => {
+		if (!pair) return false;
+		const otherSide = side === "left" ? "right" : "left";
+		return acceptedPairSides.get(pair.id)?.has(otherSide) ?? false;
+	}, [acceptedPairSides]);
+	const acceptSide = useCallback((conflict, side) => {
+		const pair = (side === "left" ? findPairForLeft : findPairForRight)(conflict);
+		const otherAccepted = isOtherSideAccepted(pair, side);
+		const sourceValue = side === "left" ? conflict.oldValue : conflict.newValue;
+		const targetStart = side === "left" ? conflict.newStartLine : conflict.oldStartLine;
+		const targetEnd = side === "left" ? conflict.newEndLine : conflict.oldEndLine;
+		if (debounceRef.current) {
+			clearTimeout(debounceRef.current);
+			debounceRef.current = null;
+		}
+		const mergeTargetEmpty = side === "left" ? conflict.newValue === "" : conflict.oldValue === "";
+		const newValue = otherAccepted ? replaceLines(mergeValue, targetEnd + 1, targetEnd, sourceValue) : mergeTargetEmpty ? replaceLines(mergeValue, targetStart, targetStart - 1, sourceValue) : replaceLines(mergeValue, targetStart, targetEnd, sourceValue);
+		setMergeValue(newValue);
+		setDebouncedMergeValue(newValue);
+		markSideAccepted(pair, side);
+		if (!pair) {
+			const setDismissedSide = side === "left" ? setDismissedLeftLines : setDismissedRightLines;
+			const [sideStart, sideEnd] = side === "left" ? [conflict.oldStartLine, conflict.oldEndLine] : [conflict.newStartLine, conflict.newEndLine];
+			setDismissedSide((prev) => {
+				const next = new Set(prev);
+				for (let i = sideStart; i <= sideEnd; i++) next.add(i);
+				return next;
+			});
+		}
+	}, [
+		mergeValue,
+		findPairForLeft,
+		findPairForRight,
+		isOtherSideAccepted,
+		markSideAccepted
+	]);
+	const acceptLeft = useCallback((conflict) => acceptSide(conflict, "left"), [acceptSide]);
+	const acceptRight = useCallback((conflict) => acceptSide(conflict, "right"), [acceptSide]);
+	const dismissSide = useCallback((conflict, side) => {
+		const setDismissed = side === "left" ? setDismissedLeftLines : setDismissedRightLines;
+		const [sideStart, sideEnd] = side === "left" ? [conflict.oldStartLine, conflict.oldEndLine] : [conflict.newStartLine, conflict.newEndLine];
+		setDismissed((prev) => {
+			const next = new Set(prev);
+			for (let i = sideStart; i <= sideEnd; i++) next.add(i);
+			return next;
+		});
+	}, []);
+	const dismissLeft = useCallback((conflict) => dismissSide(conflict, "left"), [dismissSide]);
+	const dismissRight = useCallback((conflict) => dismissSide(conflict, "right"), [dismissSide]);
+	const fullyResolvedPairIds = useMemo(() => {
+		const ids = /* @__PURE__ */ new Set();
+		for (const pair of conflictPairs) {
+			const leftAccepted = acceptedPairSides.get(pair.id)?.has("left") ?? false;
+			const rightAccepted = acceptedPairSides.get(pair.id)?.has("right") ?? false;
+			let leftDismissed = true;
+			for (let i = pair.leftStart; i <= pair.leftEnd; i++) if (!dismissedLeftLines.has(i)) {
+				leftDismissed = false;
+				break;
+			}
+			let rightDismissed = true;
+			for (let i = pair.rightStart; i <= pair.rightEnd; i++) if (!dismissedRightLines.has(i)) {
+				rightDismissed = false;
+				break;
+			}
+			if ((leftAccepted || leftDismissed) && (rightAccepted || rightDismissed)) ids.add(pair.id);
+		}
+		return ids;
+	}, [
+		conflictPairs,
+		acceptedPairSides,
+		dismissedLeftLines,
+		dismissedRightLines
+	]);
+	const visibleLeftConflicts = useMemo(() => filterVisibleConflicts(leftConflicts, leftClassification, dismissedLeftLines, (c) => [c.oldStartLine, c.oldEndLine], findPairForLeft, fullyResolvedPairIds), [
+		leftConflicts,
+		leftClassification,
+		dismissedLeftLines,
+		findPairForLeft,
+		fullyResolvedPairIds
+	]);
+	const visibleRightConflicts = useMemo(() => filterVisibleConflicts(rightConflicts, rightClassification, dismissedRightLines, (c) => [c.newStartLine, c.newEndLine], findPairForRight, fullyResolvedPairIds), [
+		rightConflicts,
+		rightClassification,
+		dismissedRightLines,
+		findPairForRight,
+		fullyResolvedPairIds
+	]);
+	const suppressedLeftLines = useMemo(() => computeSuppressedLines(dismissedLeftLines, conflictPairs, fullyResolvedPairIds, (p) => [p.leftStart, p.leftEnd]), [
+		conflictPairs,
+		fullyResolvedPairIds,
+		dismissedLeftLines
+	]);
+	const suppressedRightLines = useMemo(() => computeSuppressedLines(dismissedRightLines, conflictPairs, fullyResolvedPairIds, (p) => [p.rightStart, p.rightEnd]), [
+		conflictPairs,
+		fullyResolvedPairIds,
+		dismissedRightLines
+	]);
+	const { mergeHighlightedLines, mergeClassification } = useMemo(() => {
+		const mergeLeftLines = getChangedLineNumbers(leftDiffChunks, "new");
+		const mergeRightLines = getChangedLineNumbers(rightDiffChunks, "old");
+		const mergeLineToPair = /* @__PURE__ */ new Map();
+		for (const conflict of leftConflicts) {
+			const pair = findPairForLeft(conflict);
+			if (pair) for (let i = conflict.newStartLine; i <= conflict.newEndLine; i++) mergeLineToPair.set(i, pair.id);
+		}
+		for (const conflict of rightConflicts) {
+			const pair = findPairForRight(conflict);
+			if (pair) for (let i = conflict.oldStartLine; i <= conflict.oldEndLine; i++) mergeLineToPair.set(i, pair.id);
+		}
+		const suppressedMergeLines = /* @__PURE__ */ new Set();
+		for (const conflict of leftConflicts) {
+			if (findPairForLeft(conflict)) continue;
+			if (conflict.oldStartLine > conflict.oldEndLine) continue;
+			let allDismissed = true;
+			for (let i = conflict.oldStartLine; i <= conflict.oldEndLine; i++) if (!dismissedLeftLines.has(i)) {
+				allDismissed = false;
+				break;
+			}
+			if (allDismissed) for (let i = conflict.newStartLine; i <= conflict.newEndLine; i++) suppressedMergeLines.add(i);
+		}
+		for (const conflict of rightConflicts) {
+			if (findPairForRight(conflict)) continue;
+			if (conflict.newStartLine > conflict.newEndLine) continue;
+			let allDismissed = true;
+			for (let i = conflict.newStartLine; i <= conflict.newEndLine; i++) if (!dismissedRightLines.has(i)) {
+				allDismissed = false;
+				break;
+			}
+			if (allDismissed) for (let i = conflict.oldStartLine; i <= conflict.oldEndLine; i++) suppressedMergeLines.add(i);
+		}
+		const allMergeLines = /* @__PURE__ */ new Set();
+		for (const line of mergeLeftLines) allMergeLines.add(line);
+		for (const line of mergeRightLines) allMergeLines.add(line);
+		const highlighted = /* @__PURE__ */ new Set();
+		const classification = /* @__PURE__ */ new Map();
+		for (const line of allMergeLines) {
+			if (suppressedMergeLines.has(line)) continue;
+			const pairId = mergeLineToPair.get(line);
+			if (pairId && fullyResolvedPairIds.has(pairId)) continue;
+			highlighted.add(line);
+			classification.set(line, pairId ? CHANGE_CLASS.CONFLICT : CHANGE_CLASS.SAFE);
+		}
+		return {
+			mergeHighlightedLines: highlighted,
+			mergeClassification: classification
+		};
+	}, [
+		leftDiffChunks,
+		rightDiffChunks,
+		leftConflicts,
+		rightConflicts,
+		findPairForLeft,
+		findPairForRight,
+		fullyResolvedPairIds,
+		dismissedLeftLines,
+		dismissedRightLines
+	]);
+	const leftHighlightedLines = useMemo(() => filterHighlightedLines(leftDiffChunks, "old", leftClassification, suppressedLeftLines), [
+		leftDiffChunks,
+		leftClassification,
+		suppressedLeftLines
+	]);
+	const rightHighlightedLines = useMemo(() => filterHighlightedLines(rightDiffChunks, "new", rightClassification, suppressedRightLines), [
+		rightDiffChunks,
+		rightClassification,
+		suppressedRightLines
+	]);
+	const remainingSafeChanges = useMemo(() => {
+		return visibleLeftConflicts.filter((c) => !findPairForLeft(c)).length + visibleRightConflicts.filter((c) => !findPairForRight(c)).length;
+	}, [
+		visibleLeftConflicts,
+		visibleRightConflicts,
+		findPairForLeft,
+		findPairForRight
+	]);
+	return {
+		mergeValue,
+		handleMergeChange,
+		leftConflicts: visibleLeftConflicts,
+		rightConflicts: visibleRightConflicts,
+		leftHighlightedLines,
+		rightHighlightedLines,
+		leftClassification,
+		rightClassification,
+		mergeHighlightedLines,
+		mergeClassification,
+		acceptLeft,
+		acceptRight,
+		dismissLeft,
+		dismissRight,
+		totalConflicts: conflictPairs.length,
+		resolvedConflicts: fullyResolvedPairIds.size,
+		remainingSafeChanges,
+		isDirty: mergeValue !== baseText || dismissedLeftLines.size > 0 || dismissedRightLines.size > 0,
+		reset
+	};
+};
+/**
+* Pairs adjacent removed+added chunks into MergeConflicts.
+* A standalone REMOVED or ADDED chunk becomes a conflict with
+* the other side empty.
+*/
+const pairChunksIntoConflicts = (chunks) => {
+	const conflicts = [];
+	let i = 0;
+	while (i < chunks.length) {
+		const chunk = chunks[i];
+		if (chunk.type === CHUNK_TYPE.UNCHANGED) {
+			i++;
+			continue;
+		}
+		if (chunk.type === CHUNK_TYPE.REMOVED) {
+			const next = chunks[i + 1];
+			if (next?.type === CHUNK_TYPE.ADDED) {
+				conflicts.push({
+					id: `${chunk.oldStart}-${next.newStart}`,
+					oldValue: chunk.value,
+					oldStartLine: chunk.oldStart,
+					oldEndLine: chunk.oldEnd,
+					newValue: next.value,
+					newStartLine: next.newStart,
+					newEndLine: next.newEnd
+				});
+				i += 2;
+			} else {
+				conflicts.push({
+					id: `${chunk.oldStart}-del`,
+					oldValue: chunk.value,
+					oldStartLine: chunk.oldStart,
+					oldEndLine: chunk.oldEnd,
+					newValue: "",
+					newStartLine: chunk.newStart,
+					newEndLine: chunk.newStart
+				});
+				i++;
+			}
+		} else {
+			conflicts.push({
+				id: `add-${chunk.newStart}`,
+				oldValue: "",
+				oldStartLine: chunk.oldStart,
+				oldEndLine: chunk.oldStart,
+				newValue: chunk.value,
+				newStartLine: chunk.newStart,
+				newEndLine: chunk.newEnd
+			});
+			i++;
+		}
+	}
+	return conflicts;
+};
+//#endregion
+export { useMergeDiff };
+
+//# sourceMappingURL=useMergeDiff-CvowEXJ1.js.map

package/dist/useMergeDiff-CvowEXJ1.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"useMergeDiff-CvowEXJ1.js","names":[],"sources":["../src/components/MergeEditor/helpers.ts","../src/components/MergeEditor/useMergeDiff.ts"],"sourcesContent":["import { diffLines } from 'diff';\n\nimport { type ChangeClassification, CHUNK_TYPE, type DiffChunk } from './constants';\n\n/**\n * Computes diff chunks between oldText and newText using line-level diffing.\n * Adjacent removed+added pairs are kept as separate chunks so the consumer\n * can pair them into \"modifications\" for accept controls.\n */\nexport const computeDiffChunks = (oldText: string, newText: string): DiffChunk[] => {\n  const changes = diffLines(oldText, newText);\n  const chunks: DiffChunk[] = [];\n  let oldLine = 1;\n  let newLine = 1;\n\n  for (const change of changes) {\n    if (change.value === '') continue;\n\n    const lineCount = change.count || change.value.replace(/\\n$/, '').split('\\n').length;\n\n    if (change.removed) {\n      // newStart/newEnd anchor to the current new-side position (insertion point) for alignment\n      chunks.push({\n        type: CHUNK_TYPE.REMOVED,\n        value: change.value,\n        oldStart: oldLine,\n        oldEnd: oldLine + lineCount - 1,\n        newStart: newLine,\n        newEnd: newLine,\n      });\n      oldLine += lineCount;\n    } else if (change.added) {\n      // oldStart/oldEnd anchor to the current old-side position (insertion point) for alignment\n      chunks.push({\n        type: CHUNK_TYPE.ADDED,\n        value: change.value,\n        oldStart: oldLine,\n        oldEnd: oldLine,\n        newStart: newLine,\n        newEnd: newLine + lineCount - 1,\n      });\n      newLine += lineCount;\n    } else {\n      chunks.push({\n        type: CHUNK_TYPE.UNCHANGED,\n        value: change.value,\n        oldStart: oldLine,\n        oldEnd: oldLine + lineCount - 1,\n        newStart: newLine,\n        newEnd: newLine + lineCount - 1,\n      });\n      oldLine += lineCount;\n      newLine += lineCount;\n    }\n  }\n\n  return chunks;\n};\n\n/**\n * Collects 1-indexed line numbers that are marked as changed (added or removed)\n * from a set of diff chunks. `side` determines which line range to use.\n */\nexport const getChangedLineNumbers = (chunks: DiffChunk[], side: 'old' | 'new'): Set<number> => {\n  const lines = new Set<number>();\n\n  for (const chunk of chunks) {\n    if (chunk.type === CHUNK_TYPE.UNCHANGED) continue;\n\n    if (side === 'old' && chunk.type === CHUNK_TYPE.REMOVED) {\n      for (let i = chunk.oldStart; i <= chunk.oldEnd; i++) lines.add(i);\n    }\n    if (side === 'new' && chunk.type === CHUNK_TYPE.ADDED) {\n      for (let i = chunk.newStart; i <= chunk.newEnd; i++) lines.add(i);\n    }\n  }\n\n  return lines;\n};\n\n/**\n * Filters changed line numbers, keeping only those that are classified\n * and not suppressed (resolved/dismissed).\n *\n * `classification` and `suppressedLines` must be keyed by line numbers\n * from the same `side` (old-side lines for 'old', new-side lines for 'new').\n */\nexport const filterHighlightedLines = (\n  chunks: DiffChunk[],\n  side: 'old' | 'new',\n  classification: Map<number, ChangeClassification>,\n  suppressedLines: Set<number>,\n): Set<number> => {\n  const filtered = new Set<number>();\n  for (const line of getChangedLineNumbers(chunks, side)) {\n    if (classification.has(line) && !suppressedLines.has(line)) filtered.add(line);\n  }\n  return filtered;\n};\n\n/**\n * Replaces lines in `text` between `startLine` and `endLine` (1-indexed, inclusive)\n * with `replacementLines`. If startLine > endLine, inserts before startLine.\n */\nexport const replaceLines = (\n  text: string,\n  startLine: number,\n  endLine: number,\n  replacement: string,\n): string => {\n  const lines = text.split('\\n');\n  const before = lines.slice(0, startLine - 1);\n  const after = startLine > endLine ? lines.slice(startLine - 1) : lines.slice(endLine);\n\n  const replacementArr = replacement === '' ? [] : replacement.replace(/\\n$/, '').split('\\n');\n\n  return [...before, ...replacementArr, ...after].join('\\n');\n};\n","import { useCallback, useEffect, useLayoutEffect, useMemo, useRef, useState } from 'react';\nimport { diff3Merge } from 'node-diff3';\n\nimport {\n  CHANGE_CLASS,\n  type ChangeClassification,\n  CHUNK_TYPE,\n  type DiffChunk,\n  type MergeConflict,\n} from './constants';\nimport {\n  computeDiffChunks,\n  filterHighlightedLines,\n  getChangedLineNumbers,\n  replaceLines,\n} from './helpers';\n\nconst DEBOUNCE_MS = 150;\n\ntype ConflictPair = {\n  id: string;\n  leftStart: number;\n  leftEnd: number;\n  rightStart: number;\n  rightEnd: number;\n};\n\ntype Side = 'left' | 'right';\n\nconst rangesOverlap = (s1: number, e1: number, s2: number, e2: number) => s1 <= e2 && e1 >= s2;\n\nconst computeSuppressedLines = (\n  dismissedLines: Set<number>,\n  pairs: ConflictPair[],\n  resolvedIds: Set<string>,\n  getRange: (p: ConflictPair) => [number, number],\n): Set<number> => {\n  const lines = new Set(dismissedLines);\n  for (const pair of pairs) {\n    if (resolvedIds.has(pair.id)) {\n      const [start, end] = getRange(pair);\n      for (let i = start; i <= end; i++) lines.add(i);\n    }\n  }\n  return lines;\n};\n\nconst filterVisibleConflicts = (\n  conflicts: MergeConflict[],\n  classification: Map<number, ChangeClassification>,\n  dismissedLines: Set<number>,\n  getRange: (c: MergeConflict) => [number, number],\n  findPair: (c: MergeConflict) => ConflictPair | undefined,\n  fullyResolvedPairIds: Set<string>,\n): MergeConflict[] =>\n  conflicts.filter((c) => {\n    const [start, end] = getRange(c);\n    let hasClassifiedLine = false;\n    let allDismissed = true;\n    for (let i = start; i <= end; i++) {\n      if (classification.has(i)) hasClassifiedLine = true;\n      if (!dismissedLines.has(i)) allDismissed = false;\n    }\n    if (!hasClassifiedLine || allDismissed) return false;\n\n    const pair = findPair(c);\n    return !pair || !fullyResolvedPairIds.has(pair.id);\n  });\n\nexport const useMergeDiff = (baseText: string, leftText: string, rightText: string) => {\n  const [mergeValue, setMergeValue] = useState(baseText);\n  const debounceRef = useRef<ReturnType<typeof setTimeout> | null>(null);\n  const [debouncedMergeValue, setDebouncedMergeValue] = useState(mergeValue);\n  const [acceptedPairSides, setAcceptedPairSides] = useState<Map<string, Set<Side>>>(\n    () => new Map(),\n  );\n  const [dismissedLeftLines, setDismissedLeftLines] = useState<Set<number>>(() => new Set());\n  const [dismissedRightLines, setDismissedRightLines] = useState<Set<number>>(() => new Set());\n\n  const reset = useCallback(() => {\n    if (debounceRef.current) {\n      clearTimeout(debounceRef.current);\n      debounceRef.current = null;\n    }\n\n    setMergeValue(baseText);\n    setDebouncedMergeValue(baseText);\n    setAcceptedPairSides(new Map());\n    setDismissedLeftLines(new Set());\n    setDismissedRightLines(new Set());\n  }, [baseText]);\n\n  // Reset all state when input texts change (e.g. async data arrives).\n  // useLayoutEffect prevents a one-frame flash of incorrect diff rendering\n  // when mergeValue is still '' but the real texts have arrived.\n  useLayoutEffect(() => {\n    reset();\n  }, [baseText, leftText, rightText]); // eslint-disable-line react-hooks/exhaustive-deps\n\n  // Clean up debounce timer on unmount\n  useEffect(() => {\n    return () => {\n      if (debounceRef.current) clearTimeout(debounceRef.current);\n    };\n  }, []);\n\n  const handleMergeChange = useCallback((value: string) => {\n    setMergeValue(value);\n\n    if (debounceRef.current) {\n      clearTimeout(debounceRef.current);\n    }\n\n    debounceRef.current = setTimeout(() => {\n      setDebouncedMergeValue(value);\n    }, DEBOUNCE_MS);\n  }, []);\n\n  // diff(production, mergeResult) — highlights for left pane\n  const leftDiffChunks = useMemo(\n    () => computeDiffChunks(leftText, debouncedMergeValue),\n    [leftText, debouncedMergeValue],\n  );\n\n  // diff(mergeResult, branch) — highlights for right pane\n  const rightDiffChunks = useMemo(\n    () => computeDiffChunks(debouncedMergeValue, rightText),\n    [debouncedMergeValue, rightText],\n  );\n\n  // Recompute conflict positions based on current merge value vs both sides\n  const leftConflicts = useMemo(() => pairChunksIntoConflicts(leftDiffChunks), [leftDiffChunks]);\n\n  const rightConflicts = useMemo(() => pairChunksIntoConflicts(rightDiffChunks), [rightDiffChunks]);\n\n  // Base-vs-side diffs (stable unless source texts change)\n  const leftVsBase = useMemo(() => computeDiffChunks(baseText, leftText), [baseText, leftText]);\n  const rightVsBase = useMemo(() => computeDiffChunks(baseText, rightText), [baseText, rightText]);\n\n  const { leftClassification, rightClassification, conflictPairs } = useMemo(() => {\n    const baseLines = baseText.split('\\n');\n    const leftLines = leftText.split('\\n');\n    const rightLines = rightText.split('\\n');\n\n    const result = diff3Merge(leftLines, baseLines, rightLines);\n\n    const leftConflictLineSet = new Set<number>();\n    const rightConflictLineSet = new Set<number>();\n    const pairs: ConflictPair[] = [];\n\n    for (const block of result) {\n      if ('conflict' in block && block.conflict) {\n        const { a, aIndex, b, bIndex } = block.conflict;\n        for (let i = 0; i < a.length; i++) leftConflictLineSet.add(aIndex + i + 1);\n        for (let i = 0; i < b.length; i++) rightConflictLineSet.add(bIndex + i + 1);\n\n        pairs.push({\n          id: `pair-${aIndex}-${bIndex}`,\n          leftStart: aIndex + 1,\n          leftEnd: aIndex + a.length,\n          rightStart: bIndex + 1,\n          rightEnd: bIndex + b.length,\n        });\n      }\n    }\n\n    const leftChanged = getChangedLineNumbers(leftVsBase, 'new');\n    const rightChanged = getChangedLineNumbers(rightVsBase, 'new');\n\n    const leftMap = new Map<number, ChangeClassification>();\n    for (const line of leftChanged) {\n      leftMap.set(line, leftConflictLineSet.has(line) ? CHANGE_CLASS.CONFLICT : CHANGE_CLASS.SAFE);\n    }\n\n    const rightMap = new Map<number, ChangeClassification>();\n    for (const line of rightChanged) {\n      rightMap.set(\n        line,\n        rightConflictLineSet.has(line) ? CHANGE_CLASS.CONFLICT : CHANGE_CLASS.SAFE,\n      );\n    }\n\n    return {\n      leftClassification: leftMap,\n      rightClassification: rightMap,\n      conflictPairs: pairs,\n    };\n  }, [baseText, leftText, rightText, leftVsBase, rightVsBase]);\n\n  const findPairForLeft = useCallback(\n    (conflict: MergeConflict) =>\n      conflictPairs.find((p) =>\n        rangesOverlap(conflict.oldStartLine, conflict.oldEndLine, p.leftStart, p.leftEnd),\n      ),\n    [conflictPairs],\n  );\n\n  const findPairForRight = useCallback(\n    (conflict: MergeConflict) =>\n      conflictPairs.find((p) =>\n        rangesOverlap(conflict.newStartLine, conflict.newEndLine, p.rightStart, p.rightEnd),\n      ),\n    [conflictPairs],\n  );\n\n  const markSideAccepted = useCallback((pair: ConflictPair | undefined, side: Side) => {\n    if (!pair) return;\n    setAcceptedPairSides((prev) => {\n      const next = new Map(prev);\n      const sides = new Set(prev.get(pair.id) ?? []);\n      sides.add(side);\n      next.set(pair.id, sides);\n      return next;\n    });\n  }, []);\n\n  const isOtherSideAccepted = useCallback(\n    (pair: ConflictPair | undefined, side: Side) => {\n      if (!pair) return false;\n      const otherSide = side === 'left' ? 'right' : 'left';\n      return acceptedPairSides.get(pair.id)?.has(otherSide) ?? false;\n    },\n    [acceptedPairSides],\n  );\n\n  const acceptSide = useCallback(\n    (conflict: MergeConflict, side: Side) => {\n      const findPair = side === 'left' ? findPairForLeft : findPairForRight;\n      const pair = findPair(conflict);\n      const otherAccepted = isOtherSideAccepted(pair, side);\n      const sourceValue = side === 'left' ? conflict.oldValue : conflict.newValue;\n      const targetStart = side === 'left' ? conflict.newStartLine : conflict.oldStartLine;\n      const targetEnd = side === 'left' ? conflict.newEndLine : conflict.oldEndLine;\n\n      if (debounceRef.current) {\n        clearTimeout(debounceRef.current);\n        debounceRef.current = null;\n      }\n\n      const mergeTargetEmpty =\n        side === 'left' ? conflict.newValue === '' : conflict.oldValue === '';\n      const newValue = otherAccepted\n        ? replaceLines(mergeValue, targetEnd + 1, targetEnd, sourceValue)\n        : mergeTargetEmpty\n          ? replaceLines(mergeValue, targetStart, targetStart - 1, sourceValue)\n          : replaceLines(mergeValue, targetStart, targetEnd, sourceValue);\n\n      setMergeValue(newValue);\n      setDebouncedMergeValue(newValue);\n      markSideAccepted(pair, side);\n\n      if (!pair) {\n        // Dismiss the source side-pane lines so the change doesn't reappear\n        // if the user later edits the accepted text in the merge pane\n        const setDismissedSide = side === 'left' ? setDismissedLeftLines : setDismissedRightLines;\n        const [sideStart, sideEnd] =\n          side === 'left'\n            ? [conflict.oldStartLine, conflict.oldEndLine]\n            : [conflict.newStartLine, conflict.newEndLine];\n\n        setDismissedSide((prev) => {\n          const next = new Set(prev);\n          for (let i = sideStart; i <= sideEnd; i++) next.add(i);\n          return next;\n        });\n      }\n    },\n    [mergeValue, findPairForLeft, findPairForRight, isOtherSideAccepted, markSideAccepted],\n  );\n\n  const acceptLeft = useCallback(\n    (conflict: MergeConflict) => acceptSide(conflict, 'left'),\n    [acceptSide],\n  );\n\n  const acceptRight = useCallback(\n    (conflict: MergeConflict) => acceptSide(conflict, 'right'),\n    [acceptSide],\n  );\n\n  const dismissSide = useCallback((conflict: MergeConflict, side: Side) => {\n    const setDismissed = side === 'left' ? setDismissedLeftLines : setDismissedRightLines;\n    const [sideStart, sideEnd] =\n      side === 'left'\n        ? [conflict.oldStartLine, conflict.oldEndLine]\n        : [conflict.newStartLine, conflict.newEndLine];\n\n    setDismissed((prev) => {\n      const next = new Set(prev);\n      for (let i = sideStart; i <= sideEnd; i++) next.add(i);\n      return next;\n    });\n  }, []);\n\n  const dismissLeft = useCallback(\n    (conflict: MergeConflict) => dismissSide(conflict, 'left'),\n    [dismissSide],\n  );\n\n  const dismissRight = useCallback(\n    (conflict: MergeConflict) => dismissSide(conflict, 'right'),\n    [dismissSide],\n  );\n\n  const fullyResolvedPairIds = useMemo(() => {\n    const ids = new Set<string>();\n    for (const pair of conflictPairs) {\n      const leftAccepted = acceptedPairSides.get(pair.id)?.has('left') ?? false;\n      const rightAccepted = acceptedPairSides.get(pair.id)?.has('right') ?? false;\n\n      let leftDismissed = true;\n      for (let i = pair.leftStart; i <= pair.leftEnd; i++) {\n        if (!dismissedLeftLines.has(i)) {\n          leftDismissed = false;\n          break;\n        }\n      }\n\n      let rightDismissed = true;\n      for (let i = pair.rightStart; i <= pair.rightEnd; i++) {\n        if (!dismissedRightLines.has(i)) {\n          rightDismissed = false;\n          break;\n        }\n      }\n\n      if ((leftAccepted || leftDismissed) && (rightAccepted || rightDismissed)) {\n        ids.add(pair.id);\n      }\n    }\n    return ids;\n  }, [conflictPairs, acceptedPairSides, dismissedLeftLines, dismissedRightLines]);\n\n  const visibleLeftConflicts = useMemo(\n    () =>\n      filterVisibleConflicts(\n        leftConflicts,\n        leftClassification,\n        dismissedLeftLines,\n        (c) => [c.oldStartLine, c.oldEndLine],\n        findPairForLeft,\n        fullyResolvedPairIds,\n      ),\n    [leftConflicts, leftClassification, dismissedLeftLines, findPairForLeft, fullyResolvedPairIds],\n  );\n\n  const visibleRightConflicts = useMemo(\n    () =>\n      filterVisibleConflicts(\n        rightConflicts,\n        rightClassification,\n        dismissedRightLines,\n        (c) => [c.newStartLine, c.newEndLine],\n        findPairForRight,\n        fullyResolvedPairIds,\n      ),\n    [\n      rightConflicts,\n      rightClassification,\n      dismissedRightLines,\n      findPairForRight,\n      fullyResolvedPairIds,\n    ],\n  );\n\n  const suppressedLeftLines = useMemo(\n    () =>\n      computeSuppressedLines(dismissedLeftLines, conflictPairs, fullyResolvedPairIds, (p) => [\n        p.leftStart,\n        p.leftEnd,\n      ]),\n    [conflictPairs, fullyResolvedPairIds, dismissedLeftLines],\n  );\n\n  const suppressedRightLines = useMemo(\n    () =>\n      computeSuppressedLines(dismissedRightLines, conflictPairs, fullyResolvedPairIds, (p) => [\n        p.rightStart,\n        p.rightEnd,\n      ]),\n    [conflictPairs, fullyResolvedPairIds, dismissedRightLines],\n  );\n\n  const { mergeHighlightedLines, mergeClassification } = useMemo(() => {\n    const mergeLeftLines = getChangedLineNumbers(leftDiffChunks, 'new');\n    const mergeRightLines = getChangedLineNumbers(rightDiffChunks, 'old');\n\n    const mergeLineToPair = new Map<number, string>();\n\n    for (const conflict of leftConflicts) {\n      const pair = findPairForLeft(conflict);\n      if (pair) {\n        for (let i = conflict.newStartLine; i <= conflict.newEndLine; i++) {\n          mergeLineToPair.set(i, pair.id);\n        }\n      }\n    }\n\n    for (const conflict of rightConflicts) {\n      const pair = findPairForRight(conflict);\n      if (pair) {\n        for (let i = conflict.oldStartLine; i <= conflict.oldEndLine; i++) {\n          mergeLineToPair.set(i, pair.id);\n        }\n      }\n    }\n\n    // Derive suppressed merge lines from side-pane dismissals.\n    // Side texts are static, so their line numbers never go stale.\n    const suppressedMergeLines = new Set<number>();\n\n    for (const conflict of leftConflicts) {\n      if (findPairForLeft(conflict)) continue;\n      if (conflict.oldStartLine > conflict.oldEndLine) continue;\n      let allDismissed = true;\n      for (let i = conflict.oldStartLine; i <= conflict.oldEndLine; i++) {\n        if (!dismissedLeftLines.has(i)) {\n          allDismissed = false;\n          break;\n        }\n      }\n      if (allDismissed) {\n        for (let i = conflict.newStartLine; i <= conflict.newEndLine; i++) {\n          suppressedMergeLines.add(i);\n        }\n      }\n    }\n\n    for (const conflict of rightConflicts) {\n      if (findPairForRight(conflict)) continue;\n      if (conflict.newStartLine > conflict.newEndLine) continue;\n      let allDismissed = true;\n      for (let i = conflict.newStartLine; i <= conflict.newEndLine; i++) {\n        if (!dismissedRightLines.has(i)) {\n          allDismissed = false;\n          break;\n        }\n      }\n      if (allDismissed) {\n        for (let i = conflict.oldStartLine; i <= conflict.oldEndLine; i++) {\n          suppressedMergeLines.add(i);\n        }\n      }\n    }\n\n    const allMergeLines = new Set<number>();\n    for (const line of mergeLeftLines) allMergeLines.add(line);\n    for (const line of mergeRightLines) allMergeLines.add(line);\n\n    const highlighted = new Set<number>();\n    const classification = new Map<number, ChangeClassification>();\n\n    for (const line of allMergeLines) {\n      if (suppressedMergeLines.has(line)) continue;\n\n      const pairId = mergeLineToPair.get(line);\n      if (pairId && fullyResolvedPairIds.has(pairId)) continue;\n\n      highlighted.add(line);\n      classification.set(line, pairId ? CHANGE_CLASS.CONFLICT : CHANGE_CLASS.SAFE);\n    }\n\n    return { mergeHighlightedLines: highlighted, mergeClassification: classification };\n  }, [\n    leftDiffChunks,\n    rightDiffChunks,\n    leftConflicts,\n    rightConflicts,\n    findPairForLeft,\n    findPairForRight,\n    fullyResolvedPairIds,\n    dismissedLeftLines,\n    dismissedRightLines,\n  ]);\n\n  const leftHighlightedLines = useMemo(\n    () => filterHighlightedLines(leftDiffChunks, 'old', leftClassification, suppressedLeftLines),\n    [leftDiffChunks, leftClassification, suppressedLeftLines],\n  );\n\n  const rightHighlightedLines = useMemo(\n    () => filterHighlightedLines(rightDiffChunks, 'new', rightClassification, suppressedRightLines),\n    [rightDiffChunks, rightClassification, suppressedRightLines],\n  );\n\n  const remainingSafeChanges = useMemo(() => {\n    const leftSafe = visibleLeftConflicts.filter((c) => !findPairForLeft(c)).length;\n    const rightSafe = visibleRightConflicts.filter((c) => !findPairForRight(c)).length;\n    return leftSafe + rightSafe;\n  }, [visibleLeftConflicts, visibleRightConflicts, findPairForLeft, findPairForRight]);\n\n  return {\n    mergeValue,\n    handleMergeChange,\n    leftConflicts: visibleLeftConflicts,\n    rightConflicts: visibleRightConflicts,\n    leftHighlightedLines,\n    rightHighlightedLines,\n    leftClassification,\n    rightClassification,\n    mergeHighlightedLines,\n    mergeClassification,\n    acceptLeft,\n    acceptRight,\n    dismissLeft,\n    dismissRight,\n    totalConflicts: conflictPairs.length,\n    resolvedConflicts: fullyResolvedPairIds.size,\n    remainingSafeChanges,\n    isDirty: mergeValue !== baseText || dismissedLeftLines.size > 0 || dismissedRightLines.size > 0,\n    reset,\n  };\n};\n\n/**\n * Pairs adjacent removed+added chunks into MergeConflicts.\n * A standalone REMOVED or ADDED chunk becomes a conflict with\n * the other side empty.\n */\nconst pairChunksIntoConflicts = (chunks: DiffChunk[]): MergeConflict[] => {\n  const conflicts: MergeConflict[] = [];\n  let i = 0;\n\n  while (i < chunks.length) {\n    const chunk = chunks[i]!;\n\n    if (chunk.type === CHUNK_TYPE.UNCHANGED) {\n      i++;\n      continue;\n    }\n\n    if (chunk.type === CHUNK_TYPE.REMOVED) {\n      const next = chunks[i + 1];\n\n      if (next?.type === CHUNK_TYPE.ADDED) {\n        conflicts.push({\n          id: `${chunk.oldStart}-${next.newStart}`,\n          oldValue: chunk.value,\n          oldStartLine: chunk.oldStart,\n          oldEndLine: chunk.oldEnd,\n          newValue: next.value,\n          newStartLine: next.newStart,\n          newEndLine: next.newEnd,\n        });\n        i += 2;\n      } else {\n        conflicts.push({\n          id: `${chunk.oldStart}-del`,\n          oldValue: chunk.value,\n          oldStartLine: chunk.oldStart,\n          oldEndLine: chunk.oldEnd,\n          newValue: '',\n          newStartLine: chunk.newStart,\n          newEndLine: chunk.newStart,\n        });\n        i++;\n      }\n    } else {\n      conflicts.push({\n        id: `add-${chunk.newStart}`,\n        oldValue: '',\n        oldStartLine: chunk.oldStart,\n        oldEndLine: chunk.oldStart,\n        newValue: chunk.value,\n        newStartLine: chunk.newStart,\n        newEndLine: chunk.newEnd,\n      });\n      i++;\n    }\n  }\n\n  return conflicts;\n};\n"],"mappings":";;;;;;;;;;AASA,MAAa,qBAAqB,SAAiB,YAAiC;CAClF,MAAM,UAAU,UAAU,SAAS,OAAO;CAC1C,MAAM,SAAsB,CAAC;CAC7B,IAAI,UAAU;CACd,IAAI,UAAU;CAEd,KAAK,MAAM,UAAU,SAAS;EAC5B,IAAI,OAAO,UAAU,IAAI;EAEzB,MAAM,YAAY,OAAO,SAAS,OAAO,MAAM,QAAQ,OAAO,EAAE,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC;EAE9E,IAAI,OAAO,SAAS;GAElB,OAAO,KAAK;IACV,MAAM,WAAW;IACjB,OAAO,OAAO;IACd,UAAU;IACV,QAAQ,UAAU,YAAY;IAC9B,UAAU;IACV,QAAQ;GACV,CAAC;GACD,WAAW;EACb,OAAO,IAAI,OAAO,OAAO;GAEvB,OAAO,KAAK;IACV,MAAM,WAAW;IACjB,OAAO,OAAO;IACd,UAAU;IACV,QAAQ;IACR,UAAU;IACV,QAAQ,UAAU,YAAY;GAChC,CAAC;GACD,WAAW;EACb,OAAO;GACL,OAAO,KAAK;IACV,MAAM,WAAW;IACjB,OAAO,OAAO;IACd,UAAU;IACV,QAAQ,UAAU,YAAY;IAC9B,UAAU;IACV,QAAQ,UAAU,YAAY;GAChC,CAAC;GACD,WAAW;GACX,WAAW;EACb;CACF;CAEA,OAAO;AACT;;;;;AAMA,MAAa,yBAAyB,QAAqB,SAAqC;CAC9F,MAAM,wBAAQ,IAAI,IAAY;CAE9B,KAAK,MAAM,SAAS,QAAQ;EAC1B,IAAI,MAAM,SAAS,WAAW,WAAW;EAEzC,IAAI,SAAS,SAAS,MAAM,SAAS,WAAW,SAC9C,KAAK,IAAI,IAAI,MAAM,UAAU,KAAK,MAAM,QAAQ,KAAK,MAAM,IAAI,CAAC;EAElE,IAAI,SAAS,SAAS,MAAM,SAAS,WAAW,OAC9C,KAAK,IAAI,IAAI,MAAM,UAAU,KAAK,MAAM,QAAQ,KAAK,MAAM,IAAI,CAAC;CAEpE;CAEA,OAAO;AACT;;;;;;;;AASA,MAAa,0BACX,QACA,MACA,gBACA,oBACgB;CAChB,MAAM,2BAAW,IAAI,IAAY;CACjC,KAAK,MAAM,QAAQ,sBAAsB,QAAQ,IAAI,GACnD,IAAI,eAAe,IAAI,IAAI,KAAK,CAAC,gBAAgB,IAAI,IAAI,GAAG,SAAS,IAAI,IAAI;CAE/E,OAAO;AACT;;;;;AAMA,MAAa,gBACX,MACA,WACA,SACA,gBACW;CACX,MAAM,QAAQ,KAAK,MAAM,IAAI;CAC7B,MAAM,SAAS,MAAM,MAAM,GAAG,YAAY,CAAC;CAC3C,MAAM,QAAQ,YAAY,UAAU,MAAM,MAAM,YAAY,CAAC,IAAI,MAAM,MAAM,OAAO;CAEpF,MAAM,iBAAiB,gBAAgB,KAAK,CAAC,IAAI,YAAY,QAAQ,OAAO,EAAE,CAAC,CAAC,MAAM,IAAI;CAE1F,OAAO;EAAC,GAAG;EAAQ,GAAG;EAAgB,GAAG;CAAK,CAAC,CAAC,KAAK,IAAI;AAC3D;;;ACpGA,MAAM,cAAc;AAYpB,MAAM,iBAAiB,IAAY,IAAY,IAAY,OAAe,MAAM,MAAM,MAAM;AAE5F,MAAM,0BACJ,gBACA,OACA,aACA,aACgB;CAChB,MAAM,QAAQ,IAAI,IAAI,cAAc;CACpC,KAAK,MAAM,QAAQ,OACjB,IAAI,YAAY,IAAI,KAAK,EAAE,GAAG;EAC5B,MAAM,CAAC,OAAO,OAAO,SAAS,IAAI;EAClC,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,KAAK,MAAM,IAAI,CAAC;CAChD;CAEF,OAAO;AACT;AAEA,MAAM,0BACJ,WACA,gBACA,gBACA,UACA,UACA,yBAEA,UAAU,QAAQ,MAAM;CACtB,MAAM,CAAC,OAAO,OAAO,SAAS,CAAC;CAC/B,IAAI,oBAAoB;CACxB,IAAI,eAAe;CACnB,KAAK,IAAI,IAAI,OAAO,KAAK,KAAK,KAAK;EACjC,IAAI,eAAe,IAAI,CAAC,GAAG,oBAAoB;EAC/C,IAAI,CAAC,eAAe,IAAI,CAAC,GAAG,eAAe;CAC7C;CACA,IAAI,CAAC,qBAAqB,cAAc,OAAO;CAE/C,MAAM,OAAO,SAAS,CAAC;CACvB,OAAO,CAAC,QAAQ,CAAC,qBAAqB,IAAI,KAAK,EAAE;AACnD,CAAC;AAEH,MAAa,gBAAgB,UAAkB,UAAkB,cAAsB;CACrF,MAAM,CAAC,YAAY,iBAAiB,SAAS,QAAQ;CACrD,MAAM,cAAc,OAA6C,IAAI;CACrE,MAAM,CAAC,qBAAqB,0BAA0B,SAAS,UAAU;CACzE,MAAM,CAAC,mBAAmB,wBAAwB,+BAC1C,IAAI,IAAI,CAChB;CACA,MAAM,CAAC,oBAAoB,yBAAyB,+BAA4B,IAAI,IAAI,CAAC;CACzF,MAAM,CAAC,qBAAqB,0BAA0B,+BAA4B,IAAI,IAAI,CAAC;CAE3F,MAAM,QAAQ,kBAAkB;EAC9B,IAAI,YAAY,SAAS;GACvB,aAAa,YAAY,OAAO;GAChC,YAAY,UAAU;EACxB;EAEA,cAAc,QAAQ;EACtB,uBAAuB,QAAQ;EAC/B,qCAAqB,IAAI,IAAI,CAAC;EAC9B,sCAAsB,IAAI,IAAI,CAAC;EAC/B,uCAAuB,IAAI,IAAI,CAAC;CAClC,GAAG,CAAC,QAAQ,CAAC;CAKb,sBAAsB;EACpB,MAAM;CACR,GAAG;EAAC;EAAU;EAAU;CAAS,CAAC;CAGlC,gBAAgB;EACd,aAAa;GACX,IAAI,YAAY,SAAS,aAAa,YAAY,OAAO;EAC3D;CACF,GAAG,CAAC,CAAC;CAEL,MAAM,oBAAoB,aAAa,UAAkB;EACvD,cAAc,KAAK;EAEnB,IAAI,YAAY,SACd,aAAa,YAAY,OAAO;EAGlC,YAAY,UAAU,iBAAiB;GACrC,uBAAuB,KAAK;EAC9B,GAAG,WAAW;CAChB,GAAG,CAAC,CAAC;CAGL,MAAM,iBAAiB,cACf,kBAAkB,UAAU,mBAAmB,GACrD,CAAC,UAAU,mBAAmB,CAChC;CAGA,MAAM,kBAAkB,cAChB,kBAAkB,qBAAqB,SAAS,GACtD,CAAC,qBAAqB,SAAS,CACjC;CAGA,MAAM,gBAAgB,cAAc,wBAAwB,cAAc,GAAG,CAAC,cAAc,CAAC;CAE7F,MAAM,iBAAiB,cAAc,wBAAwB,eAAe,GAAG,CAAC,eAAe,CAAC;CAGhG,MAAM,aAAa,cAAc,kBAAkB,UAAU,QAAQ,GAAG,CAAC,UAAU,QAAQ,CAAC;CAC5F,MAAM,cAAc,cAAc,kBAAkB,UAAU,SAAS,GAAG,CAAC,UAAU,SAAS,CAAC;CAE/F,MAAM,EAAE,oBAAoB,qBAAqB,kBAAkB,cAAc;EAC/E,MAAM,YAAY,SAAS,MAAM,IAAI;EACrC,MAAM,YAAY,SAAS,MAAM,IAAI;EACrC,MAAM,aAAa,UAAU,MAAM,IAAI;EAEvC,MAAM,SAAS,WAAW,WAAW,WAAW,UAAU;EAE1D,MAAM,sCAAsB,IAAI,IAAY;EAC5C,MAAM,uCAAuB,IAAI,IAAY;EAC7C,MAAM,QAAwB,CAAC;EAE/B,KAAK,MAAM,SAAS,QAClB,IAAI,cAAc,SAAS,MAAM,UAAU;GACzC,MAAM,EAAE,GAAG,QAAQ,GAAG,WAAW,MAAM;GACvC,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,oBAAoB,IAAI,SAAS,IAAI,CAAC;GACzE,KAAK,IAAI,IAAI,GAAG,IAAI,EAAE,QAAQ,KAAK,qBAAqB,IAAI,SAAS,IAAI,CAAC;GAE1E,MAAM,KAAK;IACT,IAAI,QAAQ,OAAO,GAAG;IACtB,WAAW,SAAS;IACpB,SAAS,SAAS,EAAE;IACpB,YAAY,SAAS;IACrB,UAAU,SAAS,EAAE;GACvB,CAAC;EACH;EAGF,MAAM,cAAc,sBAAsB,YAAY,KAAK;EAC3D,MAAM,eAAe,sBAAsB,aAAa,KAAK;EAE7D,MAAM,0BAAU,IAAI,IAAkC;EACtD,KAAK,MAAM,QAAQ,aACjB,QAAQ,IAAI,MAAM,oBAAoB,IAAI,IAAI,IAAI,aAAa,WAAW,aAAa,IAAI;EAG7F,MAAM,2BAAW,IAAI,IAAkC;EACvD,KAAK,MAAM,QAAQ,cACjB,SAAS,IACP,MACA,qBAAqB,IAAI,IAAI,IAAI,aAAa,WAAW,aAAa,IACxE;EAGF,OAAO;GACL,oBAAoB;GACpB,qBAAqB;GACrB,eAAe;EACjB;CACF,GAAG;EAAC;EAAU;EAAU;EAAW;EAAY;CAAW,CAAC;CAE3D,MAAM,kBAAkB,aACrB,aACC,cAAc,MAAM,MAClB,cAAc,SAAS,cAAc,SAAS,YAAY,EAAE,WAAW,EAAE,OAAO,CAClF,GACF,CAAC,aAAa,CAChB;CAEA,MAAM,mBAAmB,aACtB,aACC,cAAc,MAAM,MAClB,cAAc,SAAS,cAAc,SAAS,YAAY,EAAE,YAAY,EAAE,QAAQ,CACpF,GACF,CAAC,aAAa,CAChB;CAEA,MAAM,mBAAmB,aAAa,MAAgC,SAAe;EACnF,IAAI,CAAC,MAAM;EACX,sBAAsB,SAAS;GAC7B,MAAM,OAAO,IAAI,IAAI,IAAI;GACzB,MAAM,QAAQ,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,KAAK,CAAC,CAAC;GAC7C,MAAM,IAAI,IAAI;GACd,KAAK,IAAI,KAAK,IAAI,KAAK;GACvB,OAAO;EACT,CAAC;CACH,GAAG,CAAC,CAAC;CAEL,MAAM,sBAAsB,aACzB,MAAgC,SAAe;EAC9C,IAAI,CAAC,MAAM,OAAO;EAClB,MAAM,YAAY,SAAS,SAAS,UAAU;EAC9C,OAAO,kBAAkB,IAAI,KAAK,EAAE,CAAC,EAAE,IAAI,SAAS,KAAK;CAC3D,GACA,CAAC,iBAAiB,CACpB;CAEA,MAAM,aAAa,aAChB,UAAyB,SAAe;EAEvC,MAAM,QADW,SAAS,SAAS,kBAAkB,iBAAA,CAC/B,QAAQ;EAC9B,MAAM,gBAAgB,oBAAoB,MAAM,IAAI;EACpD,MAAM,cAAc,SAAS,SAAS,SAAS,WAAW,SAAS;EACnE,MAAM,cAAc,SAAS,SAAS,SAAS,eAAe,SAAS;EACvE,MAAM,YAAY,SAAS,SAAS,SAAS,aAAa,SAAS;EAEnE,IAAI,YAAY,SAAS;GACvB,aAAa,YAAY,OAAO;GAChC,YAAY,UAAU;EACxB;EAEA,MAAM,mBACJ,SAAS,SAAS,SAAS,aAAa,KAAK,SAAS,aAAa;EACrE,MAAM,WAAW,gBACb,aAAa,YAAY,YAAY,GAAG,WAAW,WAAW,IAC9D,mBACE,aAAa,YAAY,aAAa,cAAc,GAAG,WAAW,IAClE,aAAa,YAAY,aAAa,WAAW,WAAW;EAElE,cAAc,QAAQ;EACtB,uBAAuB,QAAQ;EAC/B,iBAAiB,MAAM,IAAI;EAE3B,IAAI,CAAC,MAAM;GAGT,MAAM,mBAAmB,SAAS,SAAS,wBAAwB;GACnE,MAAM,CAAC,WAAW,WAChB,SAAS,SACL,CAAC,SAAS,cAAc,SAAS,UAAU,IAC3C,CAAC,SAAS,cAAc,SAAS,UAAU;GAEjD,kBAAkB,SAAS;IACzB,MAAM,OAAO,IAAI,IAAI,IAAI;IACzB,KAAK,IAAI,IAAI,WAAW,KAAK,SAAS,KAAK,KAAK,IAAI,CAAC;IACrD,OAAO;GACT,CAAC;EACH;CACF,GACA;EAAC;EAAY;EAAiB;EAAkB;EAAqB;CAAgB,CACvF;CAEA,MAAM,aAAa,aAChB,aAA4B,WAAW,UAAU,MAAM,GACxD,CAAC,UAAU,CACb;CAEA,MAAM,cAAc,aACjB,aAA4B,WAAW,UAAU,OAAO,GACzD,CAAC,UAAU,CACb;CAEA,MAAM,cAAc,aAAa,UAAyB,SAAe;EACvE,MAAM,eAAe,SAAS,SAAS,wBAAwB;EAC/D,MAAM,CAAC,WAAW,WAChB,SAAS,SACL,CAAC,SAAS,cAAc,SAAS,UAAU,IAC3C,CAAC,SAAS,cAAc,SAAS,UAAU;EAEjD,cAAc,SAAS;GACrB,MAAM,OAAO,IAAI,IAAI,IAAI;GACzB,KAAK,IAAI,IAAI,WAAW,KAAK,SAAS,KAAK,KAAK,IAAI,CAAC;GACrD,OAAO;EACT,CAAC;CACH,GAAG,CAAC,CAAC;CAEL,MAAM,cAAc,aACjB,aAA4B,YAAY,UAAU,MAAM,GACzD,CAAC,WAAW,CACd;CAEA,MAAM,eAAe,aAClB,aAA4B,YAAY,UAAU,OAAO,GAC1D,CAAC,WAAW,CACd;CAEA,MAAM,uBAAuB,cAAc;EACzC,MAAM,sBAAM,IAAI,IAAY;EAC5B,KAAK,MAAM,QAAQ,eAAe;GAChC,MAAM,eAAe,kBAAkB,IAAI,KAAK,EAAE,CAAC,EAAE,IAAI,MAAM,KAAK;GACpE,MAAM,gBAAgB,kBAAkB,IAAI,KAAK,EAAE,CAAC,EAAE,IAAI,OAAO,KAAK;GAEtE,IAAI,gBAAgB;GACpB,KAAK,IAAI,IAAI,KAAK,WAAW,KAAK,KAAK,SAAS,KAC9C,IAAI,CAAC,mBAAmB,IAAI,CAAC,GAAG;IAC9B,gBAAgB;IAChB;GACF;GAGF,IAAI,iBAAiB;GACrB,KAAK,IAAI,IAAI,KAAK,YAAY,KAAK,KAAK,UAAU,KAChD,IAAI,CAAC,oBAAoB,IAAI,CAAC,GAAG;IAC/B,iBAAiB;IACjB;GACF;GAGF,KAAK,gBAAgB,mBAAmB,iBAAiB,iBACvD,IAAI,IAAI,KAAK,EAAE;EAEnB;EACA,OAAO;CACT,GAAG;EAAC;EAAe;EAAmB;EAAoB;CAAmB,CAAC;CAE9E,MAAM,uBAAuB,cAEzB,uBACE,eACA,oBACA,qBACC,MAAM,CAAC,EAAE,cAAc,EAAE,UAAU,GACpC,iBACA,oBACF,GACF;EAAC;EAAe;EAAoB;EAAoB;EAAiB;CAAoB,CAC/F;CAEA,MAAM,wBAAwB,cAE1B,uBACE,gBACA,qBACA,sBACC,MAAM,CAAC,EAAE,cAAc,EAAE,UAAU,GACpC,kBACA,oBACF,GACF;EACE;EACA;EACA;EACA;EACA;CACF,CACF;CAEA,MAAM,sBAAsB,cAExB,uBAAuB,oBAAoB,eAAe,uBAAuB,MAAM,CACrF,EAAE,WACF,EAAE,OACJ,CAAC,GACH;EAAC;EAAe;EAAsB;CAAkB,CAC1D;CAEA,MAAM,uBAAuB,cAEzB,uBAAuB,qBAAqB,eAAe,uBAAuB,MAAM,CACtF,EAAE,YACF,EAAE,QACJ,CAAC,GACH;EAAC;EAAe;EAAsB;CAAmB,CAC3D;CAEA,MAAM,EAAE,uBAAuB,wBAAwB,cAAc;EACnE,MAAM,iBAAiB,sBAAsB,gBAAgB,KAAK;EAClE,MAAM,kBAAkB,sBAAsB,iBAAiB,KAAK;EAEpE,MAAM,kCAAkB,IAAI,IAAoB;EAEhD,KAAK,MAAM,YAAY,eAAe;GACpC,MAAM,OAAO,gBAAgB,QAAQ;GACrC,IAAI,MACF,KAAK,IAAI,IAAI,SAAS,cAAc,KAAK,SAAS,YAAY,KAC5D,gBAAgB,IAAI,GAAG,KAAK,EAAE;EAGpC;EAEA,KAAK,MAAM,YAAY,gBAAgB;GACrC,MAAM,OAAO,iBAAiB,QAAQ;GACtC,IAAI,MACF,KAAK,IAAI,IAAI,SAAS,cAAc,KAAK,SAAS,YAAY,KAC5D,gBAAgB,IAAI,GAAG,KAAK,EAAE;EAGpC;EAIA,MAAM,uCAAuB,IAAI,IAAY;EAE7C,KAAK,MAAM,YAAY,eAAe;GACpC,IAAI,gBAAgB,QAAQ,GAAG;GAC/B,IAAI,SAAS,eAAe,SAAS,YAAY;GACjD,IAAI,eAAe;GACnB,KAAK,IAAI,IAAI,SAAS,cAAc,KAAK,SAAS,YAAY,KAC5D,IAAI,CAAC,mBAAmB,IAAI,CAAC,GAAG;IAC9B,eAAe;IACf;GACF;GAEF,IAAI,cACF,KAAK,IAAI,IAAI,SAAS,cAAc,KAAK,SAAS,YAAY,KAC5D,qBAAqB,IAAI,CAAC;EAGhC;EAEA,KAAK,MAAM,YAAY,gBAAgB;GACrC,IAAI,iBAAiB,QAAQ,GAAG;GAChC,IAAI,SAAS,eAAe,SAAS,YAAY;GACjD,IAAI,eAAe;GACnB,KAAK,IAAI,IAAI,SAAS,cAAc,KAAK,SAAS,YAAY,KAC5D,IAAI,CAAC,oBAAoB,IAAI,CAAC,GAAG;IAC/B,eAAe;IACf;GACF;GAEF,IAAI,cACF,KAAK,IAAI,IAAI,SAAS,cAAc,KAAK,SAAS,YAAY,KAC5D,qBAAqB,IAAI,CAAC;EAGhC;EAEA,MAAM,gCAAgB,IAAI,IAAY;EACtC,KAAK,MAAM,QAAQ,gBAAgB,cAAc,IAAI,IAAI;EACzD,KAAK,MAAM,QAAQ,iBAAiB,cAAc,IAAI,IAAI;EAE1D,MAAM,8BAAc,IAAI,IAAY;EACpC,MAAM,iCAAiB,IAAI,IAAkC;EAE7D,KAAK,MAAM,QAAQ,eAAe;GAChC,IAAI,qBAAqB,IAAI,IAAI,GAAG;GAEpC,MAAM,SAAS,gBAAgB,IAAI,IAAI;GACvC,IAAI,UAAU,qBAAqB,IAAI,MAAM,GAAG;GAEhD,YAAY,IAAI,IAAI;GACpB,eAAe,IAAI,MAAM,SAAS,aAAa,WAAW,aAAa,IAAI;EAC7E;EAEA,OAAO;GAAE,uBAAuB;GAAa,qBAAqB;EAAe;CACnF,GAAG;EACD;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;CACF,CAAC;CAED,MAAM,uBAAuB,cACrB,uBAAuB,gBAAgB,OAAO,oBAAoB,mBAAmB,GAC3F;EAAC;EAAgB;EAAoB;CAAmB,CAC1D;CAEA,MAAM,wBAAwB,cACtB,uBAAuB,iBAAiB,OAAO,qBAAqB,oBAAoB,GAC9F;EAAC;EAAiB;EAAqB;CAAoB,CAC7D;CAEA,MAAM,uBAAuB,cAAc;EAGzC,OAFiB,qBAAqB,QAAQ,MAAM,CAAC,gBAAgB,CAAC,CAAC,CAAC,CAAC,SACvD,sBAAsB,QAAQ,MAAM,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC;CAE9E,GAAG;EAAC;EAAsB;EAAuB;EAAiB;CAAgB,CAAC;CAEnF,OAAO;EACL;EACA;EACA,eAAe;EACf,gBAAgB;EAChB;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA;EACA,gBAAgB,cAAc;EAC9B,mBAAmB,qBAAqB;EACxC;EACA,SAAS,eAAe,YAAY,mBAAmB,OAAO,KAAK,oBAAoB,OAAO;EAC9F;CACF;AACF;;;;;;AAOA,MAAM,2BAA2B,WAAyC;CACxE,MAAM,YAA6B,CAAC;CACpC,IAAI,IAAI;CAER,OAAO,IAAI,OAAO,QAAQ;EACxB,MAAM,QAAQ,OAAO;EAErB,IAAI,MAAM,SAAS,WAAW,WAAW;GACvC;GACA;EACF;EAEA,IAAI,MAAM,SAAS,WAAW,SAAS;GACrC,MAAM,OAAO,OAAO,IAAI;GAExB,IAAI,MAAM,SAAS,WAAW,OAAO;IACnC,UAAU,KAAK;KACb,IAAI,GAAG,MAAM,SAAS,GAAG,KAAK;KAC9B,UAAU,MAAM;KAChB,cAAc,MAAM;KACpB,YAAY,MAAM;KAClB,UAAU,KAAK;KACf,cAAc,KAAK;KACnB,YAAY,KAAK;IACnB,CAAC;IACD,KAAK;GACP,OAAO;IACL,UAAU,KAAK;KACb,IAAI,GAAG,MAAM,SAAS;KACtB,UAAU,MAAM;KAChB,cAAc,MAAM;KACpB,YAAY,MAAM;KAClB,UAAU;KACV,cAAc,MAAM;KACpB,YAAY,MAAM;IACpB,CAAC;IACD;GACF;EACF,OAAO;GACL,UAAU,KAAK;IACb,IAAI,OAAO,MAAM;IACjB,UAAU;IACV,cAAc,MAAM;IACpB,YAAY,MAAM;IAClB,UAAU,MAAM;IAChB,cAAc,MAAM;IACpB,YAAY,MAAM;GACpB,CAAC;GACD;EACF;CACF;CAEA,OAAO;AACT"}