@depup/vitest__utils 4.1.0-depup.0

package/dist/error.d.ts

@@ -0,0 +1,8 @@
+import { D as DiffOptions } from './types.d-BCElaP-c.js';
+import { TestError } from './types.js';
+export { serializeValue as serializeError } from './serialize.js';
+import '@vitest/pretty-format';
+
+declare function processError(_err: any, diffOptions?: DiffOptions, seen?: WeakSet<WeakKey>): TestError;
+
+export { processError };

package/dist/error.js

@@ -0,0 +1,41 @@
+import { printDiffOrStringify } from './diff.js';
+import { stringify } from './display.js';
+import { serializeValue } from './serialize.js';
+import '@vitest/pretty-format';
+import 'tinyrainbow';
+import './helpers.js';
+import './constants.js';
+
+function processError(_err, diffOptions, seen = new WeakSet()) {
+	if (!_err || typeof _err !== "object") {
+		return { message: String(_err) };
+	}
+	const err = _err;
+	if (err.showDiff || err.showDiff === undefined && err.expected !== undefined && err.actual !== undefined) {
+		err.diff = printDiffOrStringify(err.actual, err.expected, {
+			...diffOptions,
+			...err.diffOptions
+		});
+	}
+	if ("expected" in err && typeof err.expected !== "string") {
+		err.expected = stringify(err.expected, 10);
+	}
+	if ("actual" in err && typeof err.actual !== "string") {
+		err.actual = stringify(err.actual, 10);
+	}
+	// some Error implementations may not allow rewriting cause
+	// in most cases, the assignment will lead to "err.cause = err.cause"
+	try {
+		if (!seen.has(err) && typeof err.cause === "object") {
+			seen.add(err);
+			err.cause = processError(err.cause, diffOptions, seen);
+		}
+	} catch {}
+	try {
+		return serializeValue(err);
+	} catch (e) {
+		return serializeValue(new Error(`Failed to fully serialize error: ${e?.message}\nInner error message: ${err?.message}`));
+	}
+}
+
+export { processError, serializeValue as serializeError };

package/dist/helpers.d.ts

@@ -0,0 +1,76 @@
+import { Nullable, Arrayable } from './types.js';
+
+declare function nanoid(size?: number): string;
+
+declare function shuffle<T>(array: T[], seed?: number): T[];
+
+interface CloneOptions {
+	forceWritable?: boolean;
+}
+interface ErrorOptions {
+	message?: string;
+	stackTraceLimit?: number;
+}
+
+/**
+* Get original stacktrace without source map support the most performant way.
+* - Create only 1 stack frame.
+* - Rewrite prepareStackTrace to bypass "support-stack-trace" (usually takes ~250ms).
+*/
+declare function createSimpleStackTrace(options?: ErrorOptions): string;
+declare function notNullish<T>(v: T | null | undefined): v is NonNullable<T>;
+declare function assertTypes(value: unknown, name: string, types: string[]): void;
+declare function isPrimitive(value: unknown): boolean;
+declare function slash(path: string): string;
+declare function cleanUrl(url: string): string;
+declare const isExternalUrl: (url: string) => boolean;
+/**
+* Prepend `/@id/` and replace null byte so the id is URL-safe.
+* This is prepended to resolved ids that are not valid browser
+* import specifiers by the importAnalysis plugin.
+*/
+declare function wrapId(id: string): string;
+/**
+* Undo {@link wrapId}'s `/@id/` and null byte replacements.
+*/
+declare function unwrapId(id: string): string;
+declare function withTrailingSlash(path: string): string;
+declare function filterOutComments(s: string): string;
+declare function isBareImport(id: string): boolean;
+declare function toArray<T>(array?: Nullable<Arrayable<T>>): Array<T>;
+declare function isObject(item: unknown): boolean;
+declare function getType(value: unknown): string;
+declare function getOwnProperties(obj: any): (string | symbol)[];
+declare function deepClone<T>(val: T, options?: CloneOptions): T;
+declare function clone<T>(val: T, seen: WeakMap<any, any>, options?: CloneOptions): T;
+declare function noop(): void;
+declare function objectAttr(source: any, path: string, defaultValue?: undefined): any;
+type DeferPromise<T> = Promise<T> & {
+	resolve: (value: T | PromiseLike<T>) => void;
+	reject: (reason?: any) => void;
+};
+declare function createDefer<T>(): DeferPromise<T>;
+/**
+* If code starts with a function call, will return its last index, respecting arguments.
+* This will return 25 - last ending character of toMatch ")"
+* Also works with callbacks
+* ```
+* toMatch({ test: '123' });
+* toBeAliased('123')
+* ```
+*/
+declare function getCallLastIndex(code: string): number | null;
+declare function isNegativeNaN(val: number): boolean;
+declare function ordinal(i: number): string;
+/**
+* Deep merge :P
+*
+* Will merge objects only if they are plain
+*
+* Do not merge types - it is very expensive and usually it's better to case a type here
+*/
+declare function deepMerge<T extends object = object>(target: T, ...sources: any[]): T;
+declare function unique<T>(array: T[]): T[];
+
+export { assertTypes, cleanUrl, clone, createDefer, createSimpleStackTrace, deepClone, deepMerge, filterOutComments, getCallLastIndex, getOwnProperties, getType, isBareImport, isExternalUrl, isNegativeNaN, isObject, isPrimitive, nanoid, noop, notNullish, objectAttr, ordinal, shuffle, slash, toArray, unique, unwrapId, withTrailingSlash, wrapId };
+export type { DeferPromise };

package/dist/helpers.js

@@ -0,0 +1,337 @@
+import { VALID_ID_PREFIX, NULL_BYTE_PLACEHOLDER } from './constants.js';
+
+// port from nanoid
+// https://github.com/ai/nanoid
+const urlAlphabet = "useandom-26T198340PX75pxJACKVERYMINDBUSHWOLF_GQZbfghjklqvwyzrict";
+function nanoid(size = 21) {
+	let id = "";
+	let i = size;
+	while (i--) {
+		id += urlAlphabet[Math.random() * 64 | 0];
+	}
+	return id;
+}
+
+const RealDate = Date;
+function random(seed) {
+	const x = Math.sin(seed++) * 1e4;
+	return x - Math.floor(x);
+}
+function shuffle(array, seed = RealDate.now()) {
+	let length = array.length;
+	while (length) {
+		const index = Math.floor(random(seed) * length--);
+		const previous = array[length];
+		array[length] = array[index];
+		array[index] = previous;
+		++seed;
+	}
+	return array;
+}
+
+/**
+* Get original stacktrace without source map support the most performant way.
+* - Create only 1 stack frame.
+* - Rewrite prepareStackTrace to bypass "support-stack-trace" (usually takes ~250ms).
+*/
+function createSimpleStackTrace(options) {
+	const { message = "$$stack trace error", stackTraceLimit = 1 } = options || {};
+	const limit = Error.stackTraceLimit;
+	const prepareStackTrace = Error.prepareStackTrace;
+	Error.stackTraceLimit = stackTraceLimit;
+	Error.prepareStackTrace = (e) => e.stack;
+	const err = new Error(message);
+	const stackTrace = err.stack || "";
+	Error.prepareStackTrace = prepareStackTrace;
+	Error.stackTraceLimit = limit;
+	return stackTrace;
+}
+function notNullish(v) {
+	return v != null;
+}
+function assertTypes(value, name, types) {
+	const receivedType = typeof value;
+	const pass = types.includes(receivedType);
+	if (!pass) {
+		throw new TypeError(`${name} value must be ${types.join(" or ")}, received "${receivedType}"`);
+	}
+}
+function isPrimitive(value) {
+	return value === null || typeof value !== "function" && typeof value !== "object";
+}
+function slash(path) {
+	return path.replace(/\\/g, "/");
+}
+const postfixRE = /[?#].*$/;
+function cleanUrl(url) {
+	return url.replace(postfixRE, "");
+}
+const externalRE = /^(?:[a-z]+:)?\/\//;
+const isExternalUrl = (url) => externalRE.test(url);
+/**
+* Prepend `/@id/` and replace null byte so the id is URL-safe.
+* This is prepended to resolved ids that are not valid browser
+* import specifiers by the importAnalysis plugin.
+*/
+function wrapId(id) {
+	return id.startsWith(VALID_ID_PREFIX) ? id : VALID_ID_PREFIX + id.replace("\0", NULL_BYTE_PLACEHOLDER);
+}
+/**
+* Undo {@link wrapId}'s `/@id/` and null byte replacements.
+*/
+function unwrapId(id) {
+	return id.startsWith(VALID_ID_PREFIX) ? id.slice(VALID_ID_PREFIX.length).replace(NULL_BYTE_PLACEHOLDER, "\0") : id;
+}
+function withTrailingSlash(path) {
+	if (path.at(-1) !== "/") {
+		return `${path}/`;
+	}
+	return path;
+}
+function filterOutComments(s) {
+	const result = [];
+	let commentState = "none";
+	for (let i = 0; i < s.length; ++i) {
+		if (commentState === "singleline") {
+			if (s[i] === "\n") {
+				commentState = "none";
+			}
+		} else if (commentState === "multiline") {
+			if (s[i - 1] === "*" && s[i] === "/") {
+				commentState = "none";
+			}
+		} else if (commentState === "none") {
+			if (s[i] === "/" && s[i + 1] === "/") {
+				commentState = "singleline";
+			} else if (s[i] === "/" && s[i + 1] === "*") {
+				commentState = "multiline";
+				i += 2;
+			} else {
+				result.push(s[i]);
+			}
+		}
+	}
+	return result.join("");
+}
+const bareImportRE = /^(?![a-z]:)[\w@](?!.*:\/\/)/i;
+function isBareImport(id) {
+	return bareImportRE.test(id);
+}
+function toArray(array) {
+	if (array === null || array === undefined) {
+		array = [];
+	}
+	if (Array.isArray(array)) {
+		return array;
+	}
+	return [array];
+}
+function isObject(item) {
+	return item != null && typeof item === "object" && !Array.isArray(item);
+}
+function isFinalObj(obj) {
+	return obj === Object.prototype || obj === Function.prototype || obj === RegExp.prototype;
+}
+function getType(value) {
+	return Object.prototype.toString.apply(value).slice(8, -1);
+}
+function collectOwnProperties(obj, collector) {
+	const collect = typeof collector === "function" ? collector : (key) => collector.add(key);
+	Object.getOwnPropertyNames(obj).forEach(collect);
+	Object.getOwnPropertySymbols(obj).forEach(collect);
+}
+function getOwnProperties(obj) {
+	const ownProps = new Set();
+	if (isFinalObj(obj)) {
+		return [];
+	}
+	collectOwnProperties(obj, ownProps);
+	return Array.from(ownProps);
+}
+const defaultCloneOptions = { forceWritable: false };
+function deepClone(val, options = defaultCloneOptions) {
+	const seen = new WeakMap();
+	return clone(val, seen, options);
+}
+function clone(val, seen, options = defaultCloneOptions) {
+	let k, out;
+	if (seen.has(val)) {
+		return seen.get(val);
+	}
+	if (Array.isArray(val)) {
+		out = Array.from({ length: k = val.length });
+		seen.set(val, out);
+		while (k--) {
+			out[k] = clone(val[k], seen, options);
+		}
+		return out;
+	}
+	if (Object.prototype.toString.call(val) === "[object Object]") {
+		out = Object.create(Object.getPrototypeOf(val));
+		seen.set(val, out);
+		// we don't need properties from prototype
+		const props = getOwnProperties(val);
+		for (const k of props) {
+			const descriptor = Object.getOwnPropertyDescriptor(val, k);
+			if (!descriptor) {
+				continue;
+			}
+			const cloned = clone(val[k], seen, options);
+			if (options.forceWritable) {
+				Object.defineProperty(out, k, {
+					enumerable: descriptor.enumerable,
+					configurable: true,
+					writable: true,
+					value: cloned
+				});
+			} else if ("get" in descriptor) {
+				Object.defineProperty(out, k, {
+					...descriptor,
+					get() {
+						return cloned;
+					}
+				});
+			} else {
+				Object.defineProperty(out, k, {
+					...descriptor,
+					value: cloned
+				});
+			}
+		}
+		return out;
+	}
+	return val;
+}
+function noop() {}
+function objectAttr(source, path, defaultValue = undefined) {
+	// a[3].b -> a.3.b
+	const paths = path.replace(/\[(\d+)\]/g, ".$1").split(".");
+	let result = source;
+	for (const p of paths) {
+		result = new Object(result)[p];
+		if (result === undefined) {
+			return defaultValue;
+		}
+	}
+	return result;
+}
+function createDefer() {
+	let resolve = null;
+	let reject = null;
+	const p = new Promise((_resolve, _reject) => {
+		resolve = _resolve;
+		reject = _reject;
+	});
+	p.resolve = resolve;
+	p.reject = reject;
+	return p;
+}
+/**
+* If code starts with a function call, will return its last index, respecting arguments.
+* This will return 25 - last ending character of toMatch ")"
+* Also works with callbacks
+* ```
+* toMatch({ test: '123' });
+* toBeAliased('123')
+* ```
+*/
+function getCallLastIndex(code) {
+	let charIndex = -1;
+	let inString = null;
+	let startedBracers = 0;
+	let endedBracers = 0;
+	let beforeChar = null;
+	while (charIndex <= code.length) {
+		beforeChar = code[charIndex];
+		charIndex++;
+		const char = code[charIndex];
+		const isCharString = char === "\"" || char === "'" || char === "`";
+		if (isCharString && beforeChar !== "\\") {
+			if (inString === char) {
+				inString = null;
+			} else if (!inString) {
+				inString = char;
+			}
+		}
+		if (!inString) {
+			if (char === "(") {
+				startedBracers++;
+			}
+			if (char === ")") {
+				endedBracers++;
+			}
+		}
+		if (startedBracers && endedBracers && startedBracers === endedBracers) {
+			return charIndex;
+		}
+	}
+	return null;
+}
+function isNegativeNaN(val) {
+	if (!Number.isNaN(val)) {
+		return false;
+	}
+	const f64 = new Float64Array(1);
+	f64[0] = val;
+	const u32 = new Uint32Array(f64.buffer);
+	const isNegative = u32[1] >>> 31 === 1;
+	return isNegative;
+}
+function toString(v) {
+	return Object.prototype.toString.call(v);
+}
+function isPlainObject(val) {
+	return toString(val) === "[object Object]" && (!val.constructor || val.constructor.name === "Object");
+}
+function isMergeableObject(item) {
+	return isPlainObject(item) && !Array.isArray(item);
+}
+function ordinal(i) {
+	const j = i % 10;
+	const k = i % 100;
+	if (j === 1 && k !== 11) {
+		return `${i}st`;
+	}
+	if (j === 2 && k !== 12) {
+		return `${i}nd`;
+	}
+	if (j === 3 && k !== 13) {
+		return `${i}rd`;
+	}
+	return `${i}th`;
+}
+/**
+* Deep merge :P
+*
+* Will merge objects only if they are plain
+*
+* Do not merge types - it is very expensive and usually it's better to case a type here
+*/
+function deepMerge(target, ...sources) {
+	if (!sources.length) {
+		return target;
+	}
+	const source = sources.shift();
+	if (source === undefined) {
+		return target;
+	}
+	if (isMergeableObject(target) && isMergeableObject(source)) {
+		Object.keys(source).forEach((key) => {
+			const _source = source;
+			if (isMergeableObject(_source[key])) {
+				if (!target[key]) {
+					target[key] = {};
+				}
+				deepMerge(target[key], _source[key]);
+			} else {
+				target[key] = _source[key];
+			}
+		});
+	}
+	return deepMerge(target, ...sources);
+}
+function unique(array) {
+	return Array.from(new Set(array));
+}
+
+export { assertTypes, cleanUrl, clone, createDefer, createSimpleStackTrace, deepClone, deepMerge, filterOutComments, getCallLastIndex, getOwnProperties, getType, isBareImport, isExternalUrl, isNegativeNaN, isObject, isPrimitive, nanoid, noop, notNullish, objectAttr, ordinal, shuffle, slash, toArray, unique, unwrapId, withTrailingSlash, wrapId };

package/dist/index.d.ts

@@ -0,0 +1,5 @@
+export { LoupeOptions, StringifyOptions } from './display.js';
+export { DeferPromise } from './helpers.js';
+export { SafeTimers } from './timers.js';
+export { ArgumentsType, Arrayable, Awaitable, Constructable, DeepMerge, MergeInsertions, Nullable, ParsedStack, SerializedError, TestError } from './types.js';
+import '@vitest/pretty-format';

package/dist/index.js

@@ -0,0 +1 @@
+

package/dist/offset.d.ts

@@ -0,0 +1,5 @@
+declare const lineSplitRE: RegExp;
+declare function positionToOffset(source: string, lineNumber: number, columnNumber: number): number;
+declare function offsetToLineNumber(source: string, offset: number): number;
+
+export { lineSplitRE, offsetToLineNumber, positionToOffset };

package/dist/offset.js

@@ -0,0 +1,32 @@
+const lineSplitRE = /\r?\n/;
+function positionToOffset(source, lineNumber, columnNumber) {
+	const lines = source.split(lineSplitRE);
+	const nl = /\r\n/.test(source) ? 2 : 1;
+	let start = 0;
+	if (lineNumber > lines.length) {
+		return source.length;
+	}
+	for (let i = 0; i < lineNumber - 1; i++) {
+		start += lines[i].length + nl;
+	}
+	return start + columnNumber;
+}
+function offsetToLineNumber(source, offset) {
+	if (offset > source.length) {
+		throw new Error(`offset is longer than source length! offset ${offset} > length ${source.length}`);
+	}
+	const lines = source.split(lineSplitRE);
+	const nl = /\r\n/.test(source) ? 2 : 1;
+	let counted = 0;
+	let line = 0;
+	for (; line < lines.length; line++) {
+		const lineLength = lines[line].length + nl;
+		if (counted + lineLength >= offset) {
+			break;
+		}
+		counted += lineLength;
+	}
+	return line + 1;
+}
+
+export { lineSplitRE, offsetToLineNumber, positionToOffset };

package/dist/resolver.d.ts

@@ -0,0 +1,7 @@
+declare function findNearestPackageData(basedir: string): {
+	type?: "module" | "commonjs";
+};
+declare function getCachedData<T>(cache: Map<string, T>, basedir: string, originalBasedir: string): NonNullable<T> | undefined;
+declare function setCacheData<T>(cache: Map<string, T>, data: T, basedir: string, originalBasedir: string): void;
+
+export { findNearestPackageData, getCachedData, setCacheData };

package/dist/resolver.js

@@ -0,0 +1,70 @@
+import fs from 'node:fs';
+import { j as join, d as dirname } from './chunk-pathe.M-eThtNZ.js';
+
+const packageCache = new Map();
+function findNearestPackageData(basedir) {
+	const originalBasedir = basedir;
+	while (basedir) {
+		const cached = getCachedData(packageCache, basedir, originalBasedir);
+		if (cached) {
+			return cached;
+		}
+		const pkgPath = join(basedir, "package.json");
+		if (tryStatSync(pkgPath)?.isFile()) {
+			const pkgData = JSON.parse(stripBomTag(fs.readFileSync(pkgPath, "utf8")));
+			if (packageCache) {
+				setCacheData(packageCache, pkgData, basedir, originalBasedir);
+			}
+			return pkgData;
+		}
+		const nextBasedir = dirname(basedir);
+		if (nextBasedir === basedir) {
+			break;
+		}
+		basedir = nextBasedir;
+	}
+	return {};
+}
+function stripBomTag(content) {
+	if (content.charCodeAt(0) === 65279) {
+		return content.slice(1);
+	}
+	return content;
+}
+function tryStatSync(file) {
+	try {
+		// The "throwIfNoEntry" is a performance optimization for cases where the file does not exist
+		return fs.statSync(file, { throwIfNoEntry: false });
+	} catch {}
+}
+function getCachedData(cache, basedir, originalBasedir) {
+	const pkgData = cache.get(getFnpdCacheKey(basedir));
+	if (pkgData) {
+		traverseBetweenDirs(originalBasedir, basedir, (dir) => {
+			cache.set(getFnpdCacheKey(dir), pkgData);
+		});
+		return pkgData;
+	}
+}
+function setCacheData(cache, data, basedir, originalBasedir) {
+	cache.set(getFnpdCacheKey(basedir), data);
+	traverseBetweenDirs(originalBasedir, basedir, (dir) => {
+		cache.set(getFnpdCacheKey(dir), data);
+	});
+}
+function getFnpdCacheKey(basedir) {
+	return `fnpd_${basedir}`;
+}
+/**
+* Traverse between `longerDir` (inclusive) and `shorterDir` (exclusive) and call `cb` for each dir.
+* @param longerDir Longer dir path, e.g. `/User/foo/bar/baz`
+* @param shorterDir Shorter dir path, e.g. `/User/foo`
+*/
+function traverseBetweenDirs(longerDir, shorterDir, cb) {
+	while (longerDir !== shorterDir) {
+		cb(longerDir);
+		longerDir = dirname(longerDir);
+	}
+}
+
+export { findNearestPackageData, getCachedData, setCacheData };

package/dist/serialize.d.ts

@@ -0,0 +1,3 @@
+declare function serializeValue(val: any, seen?: WeakMap<WeakKey, any>): any;
+
+export { serializeValue };