@better-openclaw/core 1.0.21 → 1.0.22

package/dist/{vi.2VT5v0um-CFyDIn0m.mjs → vi.2VT5v0um-DvC3SVNc.mjs}

@@ -80,7 +80,6 @@ function f() {
 	return i;
 }
 var C = f();
-
 //#endregion
 //#region node_modules/.pnpm/@vitest+pretty-format@4.0.18/node_modules/@vitest/pretty-format/dist/index.js
 function _mergeNamespaces(n, m) {
@@ -935,7 +934,6 @@ const plugins = {
 	ReactTestComponent: plugin$6,
 	Error: ErrorPlugin
 };
-
 //#endregion
 //#region node_modules/.pnpm/@vitest+utils@4.0.18/node_modules/@vitest/utils/dist/display.js
 const ansiColors$1 = {
@@ -1153,7 +1151,7 @@ function inspectSet$1(set, options) {
 	options.truncate -= 7;
 	return `Set{ ${inspectList$1(arrayFromSet$1(set), options)} }`;
 }
-const stringEscapeChars$1 = new RegExp("['\\u0000-\\u001f\\u007f-\\u009f\\u00ad\\u0600-\\u0604\\u070f\\u17b4\\u17b5\\u200c-\\u200f\\u2028-\\u202f\\u2060-\\u206f\\ufeff\\ufff0-\\uffff]", "g");
+const stringEscapeChars$1 = /* @__PURE__ */ new RegExp("['\\u0000-\\u001f\\u007f-\\u009f\\u00ad\\u0600-\\u0604\\u070f\\u17b4\\u17b5\\u200c-\\u200f\\u2028-\\u202f\\u2060-\\u206f\\ufeff\\ufff0-\\uffff]", "g");
 const escapeCharacters$1 = {
 	"\b": "\\b",
 	"	": "\\t",
@@ -1466,7 +1464,6 @@ function objDisplay$1(obj, options = {}) {
 	} else return str;
 	return str;
 }
-
 //#endregion
 //#region node_modules/.pnpm/@vitest+utils@4.0.18/node_modules/@vitest/utils/dist/helpers.js
 /**
@@ -1583,54 +1580,11 @@ function isNegativeNaN(val) {
 	f64[0] = val;
 	return new Uint32Array(f64.buffer)[1] >>> 31 === 1;
 }
-
 //#endregion
 //#region node_modules/.pnpm/@vitest+utils@4.0.18/node_modules/@vitest/utils/dist/chunk-_commonjsHelpers.js
 function getDefaultExportFromCjs$1(x) {
 	return x && x.__esModule && Object.prototype.hasOwnProperty.call(x, "default") ? x["default"] : x;
 }
-
-//#endregion
-//#region node_modules/.pnpm/@vitest+utils@4.0.18/node_modules/@vitest/utils/dist/diff.js
-/**
-* Diff Match and Patch
-* Copyright 2018 The diff-match-patch Authors.
-* https://github.com/google/diff-match-patch
-*
-* Licensed under the Apache License, Version 2.0 (the "License");
-* you may not use this file except in compliance with the License.
-* You may obtain a copy of the License at
-*
-*   http://www.apache.org/licenses/LICENSE-2.0
-*
-* Unless required by applicable law or agreed to in writing, software
-* distributed under the License is distributed on an "AS IS" BASIS,
-* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
-* See the License for the specific language governing permissions and
-* limitations under the License.
-*/
-/**
-* @fileoverview Computes the difference between two texts to create a patch.
-* Applies the patch onto another text, allowing for errors.
-* @author fraser@google.com (Neil Fraser)
-*/
-/**
-* CHANGES by pedrottimark to diff_match_patch_uncompressed.ts file:
-*
-* 1. Delete anything not needed to use diff_cleanupSemantic method
-* 2. Convert from prototype properties to var declarations
-* 3. Convert Diff to class from constructor and prototype
-* 4. Add type annotations for arguments and return values
-* 5. Add exports
-*/
-/**
-* The data structure representing a diff is an array of tuples:
-* [[DIFF_DELETE, 'Hello'], [DIFF_INSERT, 'Goodbye'], [DIFF_EQUAL, ' world.']]
-* which means: delete 'Hello', add 'Goodbye' and keep ' world.'
-*/
-const DIFF_DELETE = -1;
-const DIFF_INSERT = 1;
-const DIFF_EQUAL = 0;
 /**
 * Class representing one diff tuple.
 * Attempts to look like a two-element array (which is what this used to be).
@@ -1734,7 +1688,7 @@ function diff_cleanupSemantic(diffs) {
 	let length_insertions2 = 0;
 	let length_deletions2 = 0;
 	while (pointer < diffs.length) {
-		if (diffs[pointer][0] === DIFF_EQUAL) {
+		if (diffs[pointer][0] === 0) {
 			equalities[equalitiesLength++] = pointer;
 			length_insertions1 = length_insertions2;
 			length_deletions1 = length_deletions2;
@@ -1742,11 +1696,11 @@ function diff_cleanupSemantic(diffs) {
 			length_deletions2 = 0;
 			lastEquality = diffs[pointer][1];
 		} else {
-			if (diffs[pointer][0] === DIFF_INSERT) length_insertions2 += diffs[pointer][1].length;
+			if (diffs[pointer][0] === 1) length_insertions2 += diffs[pointer][1].length;
 			else length_deletions2 += diffs[pointer][1].length;
 			if (lastEquality && lastEquality.length <= Math.max(length_insertions1, length_deletions1) && lastEquality.length <= Math.max(length_insertions2, length_deletions2)) {
-				diffs.splice(equalities[equalitiesLength - 1], 0, new Diff(DIFF_DELETE, lastEquality));
-				diffs[equalities[equalitiesLength - 1] + 1][0] = DIFF_INSERT;
+				diffs.splice(equalities[equalitiesLength - 1], 0, new Diff(-1, lastEquality));
+				diffs[equalities[equalitiesLength - 1] + 1][0] = 1;
 				equalitiesLength--;
 				equalitiesLength--;
 				pointer = equalitiesLength > 0 ? equalities[equalitiesLength - 1] : -1;
@@ -1764,23 +1718,23 @@ function diff_cleanupSemantic(diffs) {
 	diff_cleanupSemanticLossless(diffs);
 	pointer = 1;
 	while (pointer < diffs.length) {
-		if (diffs[pointer - 1][0] === DIFF_DELETE && diffs[pointer][0] === DIFF_INSERT) {
+		if (diffs[pointer - 1][0] === -1 && diffs[pointer][0] === 1) {
 			const deletion = diffs[pointer - 1][1];
 			const insertion = diffs[pointer][1];
 			const overlap_length1 = diff_commonOverlap_(deletion, insertion);
 			const overlap_length2 = diff_commonOverlap_(insertion, deletion);
 			if (overlap_length1 >= overlap_length2) {
 				if (overlap_length1 >= deletion.length / 2 || overlap_length1 >= insertion.length / 2) {
-					diffs.splice(pointer, 0, new Diff(DIFF_EQUAL, insertion.substring(0, overlap_length1)));
+					diffs.splice(pointer, 0, new Diff(0, insertion.substring(0, overlap_length1)));
 					diffs[pointer - 1][1] = deletion.substring(0, deletion.length - overlap_length1);
 					diffs[pointer + 1][1] = insertion.substring(overlap_length1);
 					pointer++;
 				}
 			} else if (overlap_length2 >= deletion.length / 2 || overlap_length2 >= insertion.length / 2) {
-				diffs.splice(pointer, 0, new Diff(DIFF_EQUAL, deletion.substring(0, overlap_length2)));
-				diffs[pointer - 1][0] = DIFF_INSERT;
+				diffs.splice(pointer, 0, new Diff(0, deletion.substring(0, overlap_length2)));
+				diffs[pointer - 1][0] = 1;
 				diffs[pointer - 1][1] = insertion.substring(0, insertion.length - overlap_length2);
-				diffs[pointer + 1][0] = DIFF_DELETE;
+				diffs[pointer + 1][0] = -1;
 				diffs[pointer + 1][1] = deletion.substring(overlap_length2);
 				pointer++;
 			}
@@ -1803,7 +1757,7 @@ const blanklineStartRegex_ = /^\r?\n\r?\n/;
 function diff_cleanupSemanticLossless(diffs) {
 	let pointer = 1;
 	while (pointer < diffs.length - 1) {
-		if (diffs[pointer - 1][0] === DIFF_EQUAL && diffs[pointer + 1][0] === DIFF_EQUAL) {
+		if (diffs[pointer - 1][0] === 0 && diffs[pointer + 1][0] === 0) {
 			let equality1 = diffs[pointer - 1][1];
 			let edit = diffs[pointer][1];
 			let equality2 = diffs[pointer + 1][1];
@@ -1854,7 +1808,7 @@ function diff_cleanupSemanticLossless(diffs) {
 */
 function diff_cleanupMerge(diffs) {
 	var _diffs$at;
-	diffs.push(new Diff(DIFF_EQUAL, ""));
+	diffs.push(new Diff(0, ""));
 	let pointer = 0;
 	let count_delete = 0;
 	let count_insert = 0;
@@ -1862,24 +1816,24 @@ function diff_cleanupMerge(diffs) {
 	let text_insert = "";
 	let commonlength;
 	while (pointer < diffs.length) switch (diffs[pointer][0]) {
-		case DIFF_INSERT:
+		case 1:
 			count_insert++;
 			text_insert += diffs[pointer][1];
 			pointer++;
 			break;
-		case DIFF_DELETE:
+		case -1:
 			count_delete++;
 			text_delete += diffs[pointer][1];
 			pointer++;
 			break;
-		case DIFF_EQUAL:
+		case 0:
 			if (count_delete + count_insert > 1) {
 				if (count_delete !== 0 && count_insert !== 0) {
 					commonlength = diff_commonPrefix(text_insert, text_delete);
 					if (commonlength !== 0) {
-						if (pointer - count_delete - count_insert > 0 && diffs[pointer - count_delete - count_insert - 1][0] === DIFF_EQUAL) diffs[pointer - count_delete - count_insert - 1][1] += text_insert.substring(0, commonlength);
+						if (pointer - count_delete - count_insert > 0 && diffs[pointer - count_delete - count_insert - 1][0] === 0) diffs[pointer - count_delete - count_insert - 1][1] += text_insert.substring(0, commonlength);
 						else {
-							diffs.splice(0, 0, new Diff(DIFF_EQUAL, text_insert.substring(0, commonlength)));
+							diffs.splice(0, 0, new Diff(0, text_insert.substring(0, commonlength)));
 							pointer++;
 						}
 						text_insert = text_insert.substring(commonlength);
@@ -1895,15 +1849,15 @@ function diff_cleanupMerge(diffs) {
 				pointer -= count_delete + count_insert;
 				diffs.splice(pointer, count_delete + count_insert);
 				if (text_delete.length) {
-					diffs.splice(pointer, 0, new Diff(DIFF_DELETE, text_delete));
+					diffs.splice(pointer, 0, new Diff(-1, text_delete));
 					pointer++;
 				}
 				if (text_insert.length) {
-					diffs.splice(pointer, 0, new Diff(DIFF_INSERT, text_insert));
+					diffs.splice(pointer, 0, new Diff(1, text_insert));
 					pointer++;
 				}
 				pointer++;
-			} else if (pointer !== 0 && diffs[pointer - 1][0] === DIFF_EQUAL) {
+			} else if (pointer !== 0 && diffs[pointer - 1][0] === 0) {
 				diffs[pointer - 1][1] += diffs[pointer][1];
 				diffs.splice(pointer, 1);
 			} else pointer++;
@@ -1917,7 +1871,7 @@ function diff_cleanupMerge(diffs) {
 	let changes = false;
 	pointer = 1;
 	while (pointer < diffs.length - 1) {
-		if (diffs[pointer - 1][0] === DIFF_EQUAL && diffs[pointer + 1][0] === DIFF_EQUAL) {
+		if (diffs[pointer - 1][0] === 0 && diffs[pointer + 1][0] === 0) {
 			if (diffs[pointer][1].substring(diffs[pointer][1].length - diffs[pointer - 1][1].length) === diffs[pointer - 1][1]) {
 				diffs[pointer][1] = diffs[pointer - 1][1] + diffs[pointer][1].substring(0, diffs[pointer][1].length - diffs[pointer - 1][1].length);
 				diffs[pointer + 1][1] = diffs[pointer - 1][1] + diffs[pointer + 1][1];
@@ -2297,7 +2251,7 @@ function joinAlignedDiffsNoExpand(diffs, options) {
 	let i = 0;
 	while (i !== iLength) {
 		const iStart = i;
-		while (i !== iLength && diffs[i][0] === DIFF_EQUAL) i += 1;
+		while (i !== iLength && diffs[i][0] === 0) i += 1;
 		if (iStart !== i) if (iStart === 0) {
 			if (i > nContextLines) {
 				jLength -= i - nContextLines;
@@ -2316,7 +2270,7 @@ function joinAlignedDiffsNoExpand(diffs, options) {
 				nExcessesBetweenChanges += 1;
 			}
 		}
-		while (i !== iLength && diffs[i][0] !== DIFF_EQUAL) i += 1;
+		while (i !== iLength && diffs[i][0] !== 0) i += 1;
 	}
 	const hasPatch = nExcessesBetweenChanges !== 0 || hasExcessAtStartOrEnd;
 	if (nExcessesBetweenChanges !== 0) jLength += nExcessesBetweenChanges + 1;
@@ -2348,7 +2302,7 @@ function joinAlignedDiffsNoExpand(diffs, options) {
 	i = 0;
 	while (i !== iLength) {
 		let iStart = i;
-		while (i !== iLength && diffs[i][0] === DIFF_EQUAL) i += 1;
+		while (i !== iLength && diffs[i][0] === 0) i += 1;
 		if (iStart !== i) if (iStart === 0) {
 			if (i > nContextLines) {
 				iStart = i - nContextLines;
@@ -2377,11 +2331,11 @@ function joinAlignedDiffsNoExpand(diffs, options) {
 				for (let iCommon = i - nContextLines; iCommon !== i; iCommon += 1) pushCommonLine(diffs[iCommon][1]);
 			} else for (let iCommon = iStart; iCommon !== i; iCommon += 1) pushCommonLine(diffs[iCommon][1]);
 		}
-		while (i !== iLength && diffs[i][0] === DIFF_DELETE) {
+		while (i !== iLength && diffs[i][0] === -1) {
 			pushDeleteLine(diffs[i][1]);
 			i += 1;
 		}
-		while (i !== iLength && diffs[i][0] === DIFF_INSERT) {
+		while (i !== iLength && diffs[i][0] === 1) {
 			pushInsertLine(diffs[i][1]);
 			i += 1;
 		}
@@ -2394,8 +2348,8 @@ function joinAlignedDiffsExpand(diffs, options) {
 		const line = diff[1];
 		const isFirstOrLast = i === 0 || i === diffs.length - 1;
 		switch (diff[0]) {
-			case DIFF_DELETE: return printDeleteLine(line, isFirstOrLast, options);
-			case DIFF_INSERT: return printInsertLine(line, isFirstOrLast, options);
+			case -1: return printDeleteLine(line, isFirstOrLast, options);
+			case 1: return printInsertLine(line, isFirstOrLast, options);
 			default: return printCommonLine(line, isFirstOrLast, options);
 		}
 	}).join("\n");
@@ -2451,10 +2405,10 @@ function countChanges(diffs) {
 	let b = 0;
 	diffs.forEach((diff) => {
 		switch (diff[0]) {
-			case DIFF_DELETE:
+			case -1:
 				a += 1;
 				break;
-			case DIFF_INSERT:
+			case 1:
 				b += 1;
 				break;
 		}
@@ -2507,11 +2461,11 @@ function diffLinesUnified2(aLinesDisplay, bLinesDisplay, aLinesCompare, bLinesCo
 	let bIndex = 0;
 	diffs.forEach((diff) => {
 		switch (diff[0]) {
-			case DIFF_DELETE:
+			case -1:
 				diff[1] = aLinesDisplay[aIndex];
 				aIndex += 1;
 				break;
-			case DIFF_INSERT:
+			case 1:
 				diff[1] = bLinesDisplay[bIndex];
 				bIndex += 1;
 				break;
@@ -2534,13 +2488,13 @@ function diffLinesRaw(aLines, bLines, options) {
 	let aIndex = 0;
 	let bIndex = 0;
 	const foundSubsequence = (nCommon, aCommon, bCommon) => {
-		for (; aIndex !== aCommon; aIndex += 1) diffs.push(new Diff(DIFF_DELETE, aLines[aIndex]));
-		for (; bIndex !== bCommon; bIndex += 1) diffs.push(new Diff(DIFF_INSERT, bLines[bIndex]));
-		for (; nCommon !== 0; nCommon -= 1, aIndex += 1, bIndex += 1) diffs.push(new Diff(DIFF_EQUAL, bLines[bIndex]));
+		for (; aIndex !== aCommon; aIndex += 1) diffs.push(new Diff(-1, aLines[aIndex]));
+		for (; bIndex !== bCommon; bIndex += 1) diffs.push(new Diff(1, bLines[bIndex]));
+		for (; nCommon !== 0; nCommon -= 1, aIndex += 1, bIndex += 1) diffs.push(new Diff(0, bLines[bIndex]));
 	};
 	diffSequences(aLength, bLength, isCommon, foundSubsequence);
-	for (; aIndex !== aLength; aIndex += 1) diffs.push(new Diff(DIFF_DELETE, aLines[aIndex]));
-	for (; bIndex !== bLength; bIndex += 1) diffs.push(new Diff(DIFF_INSERT, bLines[bIndex]));
+	for (; aIndex !== aLength; aIndex += 1) diffs.push(new Diff(-1, aLines[aIndex]));
+	for (; bIndex !== bLength; bIndex += 1) diffs.push(new Diff(1, bLines[bIndex]));
 	return [diffs, truncated];
 }
 function getType(value) {
@@ -2587,19 +2541,19 @@ function diffStrings(a, b, options) {
 	let bIndex = 0;
 	const diffs = [];
 	const foundSubsequence = (nCommon, aCommon, bCommon) => {
-		if (aIndex !== aCommon) diffs.push(new Diff(DIFF_DELETE, a.slice(aIndex, aCommon)));
-		if (bIndex !== bCommon) diffs.push(new Diff(DIFF_INSERT, b.slice(bIndex, bCommon)));
+		if (aIndex !== aCommon) diffs.push(new Diff(-1, a.slice(aIndex, aCommon)));
+		if (bIndex !== bCommon) diffs.push(new Diff(1, b.slice(bIndex, bCommon)));
 		aIndex = aCommon + nCommon;
 		bIndex = bCommon + nCommon;
-		diffs.push(new Diff(DIFF_EQUAL, b.slice(bCommon, bIndex)));
+		diffs.push(new Diff(0, b.slice(bCommon, bIndex)));
 	};
 	diffSequences(aLength, bLength, isCommon, foundSubsequence);
-	if (aIndex !== aLength) diffs.push(new Diff(DIFF_DELETE, a.slice(aIndex)));
-	if (bIndex !== bLength) diffs.push(new Diff(DIFF_INSERT, b.slice(bIndex)));
+	if (aIndex !== aLength) diffs.push(new Diff(-1, a.slice(aIndex)));
+	if (bIndex !== bLength) diffs.push(new Diff(1, b.slice(bIndex)));
 	return [diffs, truncated];
 }
 function concatenateRelevantDiffs(op, diffs, changeColor) {
-	return diffs.reduce((reduced, diff) => reduced + (diff[0] === DIFF_EQUAL ? diff[1] : diff[0] === op && diff[1].length !== 0 ? changeColor(diff[1]) : ""), "");
+	return diffs.reduce((reduced, diff) => reduced + (diff[0] === 0 ? diff[1] : diff[0] === op && diff[1].length !== 0 ? changeColor(diff[1]) : ""), "");
 }
 var ChangeBuffer = class {
 	op;
@@ -2692,15 +2646,15 @@ var CommonBuffer = class {
 	}
 };
 function getAlignedDiffs(diffs, changeColor) {
-	const deleteBuffer = new ChangeBuffer(DIFF_DELETE, changeColor);
-	const insertBuffer = new ChangeBuffer(DIFF_INSERT, changeColor);
+	const deleteBuffer = new ChangeBuffer(-1, changeColor);
+	const insertBuffer = new ChangeBuffer(1, changeColor);
 	const commonBuffer = new CommonBuffer(deleteBuffer, insertBuffer);
 	diffs.forEach((diff) => {
 		switch (diff[0]) {
-			case DIFF_DELETE:
+			case -1:
 				deleteBuffer.align(diff);
 				break;
-			case DIFF_INSERT:
+			case 1:
 				insertBuffer.align(diff);
 				break;
 			default: commonBuffer.align(diff);
@@ -2711,9 +2665,9 @@ function getAlignedDiffs(diffs, changeColor) {
 function hasCommonDiff(diffs, isMultiline) {
 	if (isMultiline) {
 		const iLast = diffs.length - 1;
-		return diffs.some((diff, i) => diff[0] === DIFF_EQUAL && (i !== iLast || diff[1] !== "\n"));
+		return diffs.some((diff, i) => diff[0] === 0 && (i !== iLast || diff[1] !== "\n"));
 	}
-	return diffs.some((diff) => diff[0] === DIFF_EQUAL);
+	return diffs.some((diff) => diff[0] === 0);
 }
 function diffStringsUnified(a, b, options) {
 	if (a !== b && a.length !== 0 && b.length !== 0) {
@@ -2856,9 +2810,9 @@ function printDiffOrStringify(received, expected, options) {
 	if (typeof expected === "string" && typeof received === "string" && expected.length > 0 && received.length > 0 && expected.length <= MAX_DIFF_STRING_LENGTH && received.length <= MAX_DIFF_STRING_LENGTH && expected !== received) {
 		if (expected.includes("\n") || received.includes("\n")) return diffStringsUnified(expected, received, options);
 		const [diffs] = diffStringsRaw(expected, received, true);
-		const hasCommonDiff = diffs.some((diff) => diff[0] === DIFF_EQUAL);
+		const hasCommonDiff = diffs.some((diff) => diff[0] === 0);
 		const printLabel = getLabelPrinter(aAnnotation, bAnnotation);
-		return `${printLabel(aAnnotation) + printExpected$1(getCommonAndChangedSubstrings(diffs, DIFF_DELETE, hasCommonDiff))}\n${printLabel(bAnnotation) + printReceived$1(getCommonAndChangedSubstrings(diffs, DIFF_INSERT, hasCommonDiff))}`;
+		return `${printLabel(aAnnotation) + printExpected$1(getCommonAndChangedSubstrings(diffs, -1, hasCommonDiff))}\n${printLabel(bAnnotation) + printReceived$1(getCommonAndChangedSubstrings(diffs, 1, hasCommonDiff))}`;
 	}
 	const clonedExpected = deepClone(expected, { forceWritable: true });
 	const { replacedExpected, replacedActual } = replaceAsymmetricMatcher(deepClone(received, { forceWritable: true }), clonedExpected);
@@ -2925,9 +2879,8 @@ function printExpected$1(value) {
 	return C.green(replaceTrailingSpaces$1(stringify(value)));
 }
 function getCommonAndChangedSubstrings(diffs, op, hasCommonDiff) {
-	return diffs.reduce((reduced, diff) => reduced + (diff[0] === DIFF_EQUAL ? diff[1] : diff[0] === op ? hasCommonDiff ? C.inverse(diff[1]) : diff[1] : ""), "");
+	return diffs.reduce((reduced, diff) => reduced + (diff[0] === 0 ? diff[1] : diff[0] === op ? hasCommonDiff ? C.inverse(diff[1]) : diff[1] : ""), "");
 }
-
 //#endregion
 //#region node_modules/.pnpm/@vitest+spy@4.0.18/node_modules/@vitest/spy/dist/index.js
 function isMockFunction(fn) {
@@ -3279,7 +3232,6 @@ function clearAllMocks() {
 function resetAllMocks() {
 	REGISTERED_MOCKS.forEach((mock) => mock.mockReset());
 }
-
 //#endregion
 //#region node_modules/.pnpm/@vitest+utils@4.0.18/node_modules/@vitest/utils/dist/serialize.js
 const IS_RECORD_SYMBOL$1 = "@@__IMMUTABLE_RECORD__@@";
@@ -3354,7 +3306,6 @@ function safe(fn) {
 function normalizeErrorMessage(message) {
 	return message.replace(/__(vite_ssr_import|vi_import)_\d+__\./g, "");
 }
-
 //#endregion
 //#region node_modules/.pnpm/@vitest+utils@4.0.18/node_modules/@vitest/utils/dist/error.js
 function processError(_err, diffOptions, seen = /* @__PURE__ */ new WeakSet()) {
@@ -3378,7 +3329,6 @@ function processError(_err, diffOptions, seen = /* @__PURE__ */ new WeakSet()) {
 		return serializeValue(/* @__PURE__ */ new Error(`Failed to fully serialize error: ${e === null || e === void 0 ? void 0 : e.message}\nInner error message: ${err === null || err === void 0 ? void 0 : err.message}`));
 	}
 }
-
 //#endregion
 //#region node_modules/.pnpm/chai@6.2.2/node_modules/chai/index.js
 var __defProp = Object.defineProperty;
@@ -6251,7 +6201,6 @@ function use(fn) {
 	return exports;
 }
 __name(use, "use");
-
 //#endregion
 //#region node_modules/.pnpm/@vitest+expect@4.0.18/node_modules/@vitest/expect/dist/index.js
 const MATCHERS_OBJECT = Symbol.for("matchers-object");
@@ -6382,7 +6331,7 @@ function equals(a, b, customTesters, strictCheck) {
 	customTesters = customTesters || [];
 	return eq(a, b, [], [], customTesters, strictCheck ? hasKey : hasDefinedKey);
 }
-const functionToString = Function.prototype.toString;
+Function.prototype.toString;
 function isAsymmetric(obj) {
 	return !!obj && typeof obj === "object" && "asymmetricMatch" in obj && isA("Function", obj.asymmetricMatch);
 }
@@ -7656,7 +7605,6 @@ const JestExtend = (chai, utils) => {
 		use(JestExtendPlugin(chai, expect, expects));
 	});
 };
-
 //#endregion
 //#region node_modules/.pnpm/@vitest+utils@4.0.18/node_modules/@vitest/utils/dist/timers.js
 const SAFE_TIMERS_SYMBOL = Symbol("vitest:SAFE_TIMERS");
@@ -7691,7 +7639,6 @@ function getSafeTimers() {
 function delay(timeout, scheduler = setTimeout) {
 	return new Promise((resolve) => scheduler(resolve, timeout));
 }
-
 //#endregion
 //#region node_modules/.pnpm/@vitest+utils@4.0.18/node_modules/@vitest/utils/dist/chunk-pathe.M-eThtNZ.js
 const _DRIVE_LETTER_START_RE$1 = /^[A-Za-z]:\//;
@@ -7771,10 +7718,7 @@ function normalizeString$1(path, allowAboveRoot) {
 const isAbsolute$1 = function(p) {
 	return _IS_ABSOLUTE_RE$1.test(p);
 };
-
-//#endregion
-//#region node_modules/.pnpm/@vitest+utils@4.0.18/node_modules/@vitest/utils/dist/source-map.js
-var comma$1 = ",".charCodeAt(0);
+",".charCodeAt(0);
 var chars$1 = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
 var intToChar$1 = new Uint8Array(64);
 var charToInt$1 = new Uint8Array(128);
@@ -7861,7 +7805,6 @@ function parseSingleV8Stack$1(raw) {
 		column: Number.parseInt(columnNumber)
 	};
 }
-
 //#endregion
 //#region node_modules/.pnpm/pathe@2.0.3/node_modules/pathe/dist/shared/pathe.M-eThtNZ.mjs
 const _DRIVE_LETTER_START_RE = /^[A-Za-z]:\//;
@@ -7941,7 +7884,6 @@ function normalizeString(path, allowAboveRoot) {
 const isAbsolute = function(p) {
 	return _IS_ABSOLUTE_RE.test(p);
 };
-
 //#endregion
 //#region node_modules/.pnpm/@vitest+runner@4.0.18/node_modules/@vitest/runner/dist/chunk-tasks.js
 function createChainable(keys, fn) {
@@ -7989,7 +7931,6 @@ function getNames(task) {
 function createTaskName(names, separator = " > ") {
 	return names.filter((name) => name !== void 0).join(separator);
 }
-
 //#endregion
 //#region node_modules/.pnpm/@vitest+runner@4.0.18/node_modules/@vitest/runner/dist/index.js
 var PendingError = class extends Error {
@@ -8327,52 +8268,11 @@ function afterEach(fn, timeout) {
 	const runner = getRunner();
 	return getCurrentSuite().on("afterEach", withTimeout(withFixtures(runner, fn), timeout ?? getDefaultHookTimeout(), true, /* @__PURE__ */ new Error("STACK_TRACE_ERROR"), abortIfTimeout));
 }
-/**
-* Registers a callback function to be executed when a test fails within the current suite.
-* This function allows for custom actions to be performed in response to test failures, such as logging, cleanup, or additional diagnostics.
-*
-* **Note:** The `onTestFailed` hooks are running in reverse order of their registration. You can configure this by changing the `sequence.hooks` option in the config file.
-*
-* @param {Function} fn - The callback function to be executed upon a test failure. The function receives the test result (including errors).
-* @param {number} [timeout] - Optional timeout in milliseconds for the hook. If not provided, the default hook timeout from the runner's configuration is used.
-* @throws {Error} Throws an error if the function is not called within a test.
-* @returns {void}
-* @example
-* ```ts
-* // Example of using onTestFailed to log failure details
-* onTestFailed(({ errors }) => {
-*   console.log(`Test failed: ${test.name}`, errors);
-* });
-* ```
-*/
-const onTestFailed = createTestHook("onTestFailed", (test, handler, timeout) => {
+createTestHook("onTestFailed", (test, handler, timeout) => {
 	test.onFailed || (test.onFailed = []);
 	test.onFailed.push(withTimeout(handler, timeout ?? getDefaultHookTimeout(), true, /* @__PURE__ */ new Error("STACK_TRACE_ERROR"), abortIfTimeout));
 });
-/**
-* Registers a callback function to be executed when the current test finishes, regardless of the outcome (pass or fail).
-* This function is ideal for performing actions that should occur after every test execution, such as cleanup, logging, or resetting shared resources.
-*
-* This hook is useful if you have access to a resource in the test itself and you want to clean it up after the test finishes. It is a more compact way to clean up resources than using the combination of `beforeEach` and `afterEach`.
-*
-* **Note:** The `onTestFinished` hooks are running in reverse order of their registration. You can configure this by changing the `sequence.hooks` option in the config file.
-*
-* **Note:** The `onTestFinished` hook is not called if the test is canceled with a dynamic `ctx.skip()` call.
-*
-* @param {Function} fn - The callback function to be executed after a test finishes. The function can receive parameters providing details about the completed test, including its success or failure status.
-* @param {number} [timeout] - Optional timeout in milliseconds for the hook. If not provided, the default hook timeout from the runner's configuration is used.
-* @throws {Error} Throws an error if the function is not called within a test.
-* @returns {void}
-* @example
-* ```ts
-* // Example of using onTestFinished for cleanup
-* const db = await connectToDatabase();
-* onTestFinished(async () => {
-*   await db.disconnect();
-* });
-* ```
-*/
-const onTestFinished = createTestHook("onTestFinished", (test, handler, timeout) => {
+createTestHook("onTestFinished", (test, handler, timeout) => {
 	test.onFinished || (test.onFinished = []);
 	test.onFinished.push(withTimeout(handler, timeout ?? getDefaultHookTimeout(), true, /* @__PURE__ */ new Error("STACK_TRACE_ERROR"), abortIfTimeout));
 });
@@ -8660,17 +8560,6 @@ function createSuiteCollector(name, factory = () => {}, mode, each, suiteOptions
 			meta: Object.create(null),
 			concurrent: suiteOptions === null || suiteOptions === void 0 ? void 0 : suiteOptions.concurrent
 		};
-		if (runner && includeLocation && runner.config.includeTaskLocation) {
-			const limit = Error.stackTraceLimit;
-			Error.stackTraceLimit = 15;
-			const error = (/* @__PURE__ */ new Error("stacktrace")).stack;
-			Error.stackTraceLimit = limit;
-			const stack = findTestFileStackTrace(currentTestFilepath, error);
-			if (stack) suite.location = {
-				line: stack.line,
-				column: stack.column
-			};
-		}
 		setHooks(suite, createSuiteHooks());
 	}
 	function clear() {
@@ -9018,8 +8907,8 @@ function getFileContext(file) {
 	if (!context) throw new Error(`Cannot find file context for ${file.name}`);
 	return context;
 }
-const now$1 = globalThis.performance ? globalThis.performance.now.bind(globalThis.performance) : Date.now;
-const now$3 = globalThis.performance ? globalThis.performance.now.bind(globalThis.performance) : Date.now;
+globalThis.performance ? globalThis.performance.now.bind(globalThis.performance) : Date.now;
+globalThis.performance ? globalThis.performance.now.bind(globalThis.performance) : Date.now;
 const unixNow = Date.now;
 const { clearTimeout, setTimeout: setTimeout$1 } = getSafeTimers();
 const packs = /* @__PURE__ */ new Map();
@@ -9062,7 +8951,7 @@ function throttle(fn, ms) {
 		pendingCall ?? (pendingCall = setTimeout$1(() => call.bind(this)(...args), ms));
 	};
 }
-const sendTasksUpdateThrottled = throttle(sendTasksUpdate, 100);
+throttle(sendTasksUpdate, 100);
 /**
 * @experimental
 * @advanced
@@ -9182,9 +9071,8 @@ function manageArtifactAttachment(attachment) {
 	if (attachment.body && attachment.path) throw new TypeError(`Test attachment requires only one of "body" or "path" to be set. Both are specified.`);
 	if (attachment.body instanceof Uint8Array) attachment.body = encodeUint8Array(attachment.body);
 }
-
 //#endregion
-//#region node_modules/.pnpm/vitest@4.0.18_@types+node@25.3.3_yaml@2.8.2/node_modules/vitest/dist/chunks/utils.DvEY5TfP.js
+//#region node_modules/.pnpm/vitest@4.0.18_@types+node@25.3.5_yaml@2.8.2/node_modules/vitest/dist/chunks/utils.DvEY5TfP.js
 const NAME_WORKER_STATE = "__vitest_worker__";
 function getWorkerState() {
 	const workerState = globalThis[NAME_WORKER_STATE];
@@ -9223,7 +9111,6 @@ async function waitForImportsToResolve() {
 	await Promise.allSettled(promises);
 	await waitForImportsToResolve();
 }
-
 //#endregion
 //#region node_modules/.pnpm/@vitest+snapshot@4.0.18/node_modules/@vitest/snapshot/dist/index.js
 var comma = ",".charCodeAt(0);
@@ -9644,7 +9531,7 @@ function offsetToLineNumber(source, offset) {
 	return line + 1;
 }
 async function saveInlineSnapshots(environment, snapshots) {
-	const MagicString = (await import("./magic-string.es-CfFonO_S.mjs")).default;
+	const MagicString = (await import("./magic-string.es-CoDyF8pj.mjs")).default;
 	const files = new Set(snapshots.map((i) => i.file));
 	await Promise.all(Array.from(files).map(async (file) => {
 		const snaps = snapshots.filter((i) => i.file === file);
@@ -10294,13 +10181,11 @@ var SnapshotClient = class {
 		this.snapshotStateMap.clear();
 	}
 };
-
 //#endregion
-//#region node_modules/.pnpm/vitest@4.0.18_@types+node@25.3.3_yaml@2.8.2/node_modules/vitest/dist/chunks/_commonjsHelpers.D26ty3Ew.js
+//#region node_modules/.pnpm/vitest@4.0.18_@types+node@25.3.5_yaml@2.8.2/node_modules/vitest/dist/chunks/_commonjsHelpers.D26ty3Ew.js
 var commonjsGlobal = typeof globalThis !== "undefined" ? globalThis : typeof window !== "undefined" ? window : typeof global !== "undefined" ? global : typeof self !== "undefined" ? self : {};
-
 //#endregion
-//#region node_modules/.pnpm/vitest@4.0.18_@types+node@25.3.3_yaml@2.8.2/node_modules/vitest/dist/chunks/date.Bq6ZW5rf.js
+//#region node_modules/.pnpm/vitest@4.0.18_@types+node@25.3.5_yaml@2.8.2/node_modules/vitest/dist/chunks/date.Bq6ZW5rf.js
 const RealDate = Date;
 let now = null;
 var MockDate = class MockDate extends RealDate {
@@ -10347,9 +10232,8 @@ function mockDate(date) {
 function resetDate() {
 	globalThis.Date = RealDate;
 }
-
 //#endregion
-//#region node_modules/.pnpm/vitest@4.0.18_@types+node@25.3.3_yaml@2.8.2/node_modules/vitest/dist/chunks/vi.2VT5v0um.js
+//#region node_modules/.pnpm/vitest@4.0.18_@types+node@25.3.5_yaml@2.8.2/node_modules/vitest/dist/chunks/vi.2VT5v0um.js
 const unsupported = [
 	"matchSnapshot",
 	"toMatchSnapshot",
@@ -10687,8 +10571,6 @@ Object.defineProperty(globalThis, GLOBAL_EXPECT, {
 	writable: true,
 	configurable: true
 });
-const assert = assert$2;
-const should = should$1;
 var fakeTimersSrc = {};
 var global$1;
 var hasRequiredGlobal;
@@ -12897,8 +12779,7 @@ function createVitest() {
 	};
 	return utils;
 }
-const vitest = createVitest();
-const vi = vitest;
+const vi = createVitest();
 function _mocker() {
 	return typeof __vitest_mocker__ !== "undefined" ? __vitest_mocker__ : new Proxy({}, { get(_, name) {
 		throw new Error(`Vitest mocker was not initialized in this environment. vi.${String(name)}() is forbidden.`);
@@ -12910,7 +12791,7 @@ function getImporter(name) {
 		return stack.includes(` at Object.${name}`) || stack.includes(`${name}@`) || stack.includes(` at ${name} (`);
 	}) + 1])?.file || "";
 }
-
 //#endregion
 export { describe as n, it as r, globalExpect as t };
-//# sourceMappingURL=vi.2VT5v0um-CFyDIn0m.mjs.map
+
+//# sourceMappingURL=vi.2VT5v0um-DvC3SVNc.mjs.map