@n8n/utils 1.37.2 → 1.38.1

package/dist/placeholder.mjs

@@ -1,3 +1,75 @@
-import { a as isPlaceholderString, i as hasPlaceholderDeep, n as findPlaceholderDetails, o as isPlaceholderValue, r as formatPlaceholderPath, t as extractPlaceholderLabels } from "./placeholder2.mjs";
+//#region src/placeholder.ts
+const PLACEHOLDER_SUFFIX = "__>";
+const PLACEHOLDER_VALUE_PREFIX = "<__PLACEHOLDER_VALUE__";
+const PLACEHOLDER_REGEX = /<__PLACEHOLDER.*?__>/;
+/** Check if a value is a placeholder sentinel string (format: `<__PLACEHOLDER_VALUE__hint__>`). */
+function isPlaceholderString(value) {
+	return typeof value === "string" && value.startsWith(PLACEHOLDER_VALUE_PREFIX) && value.endsWith(PLACEHOLDER_SUFFIX);
+}
+/** Recursively check if a value (string, array, or object) contains any placeholder sentinel strings. */
+function hasPlaceholderDeep(value) {
+	if (typeof value === "string") return isPlaceholderString(value);
+	if (Array.isArray(value)) return value.some(hasPlaceholderDeep);
+	if (value !== null && typeof value === "object") return Object.values(value).some(hasPlaceholderDeep);
+	return false;
+}
+/** Checks if a value is a placeholder value (matches the placeholder regex pattern). */
+function isPlaceholderValue(value) {
+	if (typeof value !== "string") return false;
+	return !!value.match(PLACEHOLDER_REGEX);
+}
+/**
+* Extracts the label from a single placeholder string.
+* Handles formats like:
+* - <__PLACEHOLDER_VALUE__label__>
+* - <__PLACEHOLDER__: label__>
+*/
+function extractLabelFromPlaceholder(placeholder) {
+	let label = placeholder.slice(14, -3);
+	if (label.startsWith("_VALUE__")) label = label.slice(8);
+	else if (label.startsWith("__:")) label = label.slice(3);
+	else if (label.startsWith("__")) label = label.slice(2);
+	return label.trim();
+}
+/**
+* Extracts all placeholder labels from a string value.
+* Handles both cases where the entire value is a placeholder and where
+* placeholders are embedded within code (e.g., Code node).
+* Returns an array of labels found.
+*/
+function extractPlaceholderLabels(value) {
+	if (typeof value !== "string") return [];
+	const labels = [];
+	const regex = new RegExp(PLACEHOLDER_REGEX.source, "g");
+	let match;
+	while ((match = regex.exec(value)) !== null) {
+		const label = extractLabelFromPlaceholder(match[0]);
+		if (label.length > 0) labels.push(label);
+	}
+	return labels;
+}
+/**
+* Recursively searches through a value (object, array, or primitive) to find
+* all placeholder values and their paths.
+*/
+function findPlaceholderDetails(value, path = []) {
+	if (typeof value === "string") return extractPlaceholderLabels(value).map((label) => ({
+		path,
+		label
+	}));
+	if (Array.isArray(value)) return value.flatMap((item, index) => findPlaceholderDetails(item, [...path, `[${index}]`]));
+	if (value !== null && typeof value === "object") return Object.entries(value).flatMap(([key, nested]) => findPlaceholderDetails(nested, [...path, key]));
+	return [];
+}
+/**
+* Formats a path array into a dot-notation string for display.
+* Array indices are preserved as [N] without leading dots.
+*/
+function formatPlaceholderPath(path) {
+	if (path.length === 0) return "parameters";
+	return path.map((segment, index) => segment.startsWith("[") || index === 0 ? segment : `.${segment}`).join("");
+}
 
-export { extractPlaceholderLabels, findPlaceholderDetails, formatPlaceholderPath, hasPlaceholderDeep, isPlaceholderString, isPlaceholderValue };
+//#endregion
+export { extractPlaceholderLabels, findPlaceholderDetails, formatPlaceholderPath, hasPlaceholderDeep, isPlaceholderString, isPlaceholderValue };
+//# sourceMappingURL=placeholder.mjs.map

package/dist/placeholder.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"placeholder.mjs","names":["labels: string[]"],"sources":["../src/placeholder.ts"],"sourcesContent":["const PLACEHOLDER_PREFIX = '<__PLACEHOLDER';\nconst PLACEHOLDER_SUFFIX = '__>';\nconst PLACEHOLDER_VALUE_PREFIX = '<__PLACEHOLDER_VALUE__';\n\nconst PLACEHOLDER_REGEX = /<__PLACEHOLDER.*?__>/;\n\nexport interface PlaceholderDetail {\n\tpath: string[];\n\tlabel: string;\n}\n\n/** Check if a value is a placeholder sentinel string (format: `<__PLACEHOLDER_VALUE__hint__>`). */\nexport function isPlaceholderString(value: unknown): boolean {\n\treturn (\n\t\ttypeof value === 'string' &&\n\t\tvalue.startsWith(PLACEHOLDER_VALUE_PREFIX) &&\n\t\tvalue.endsWith(PLACEHOLDER_SUFFIX)\n\t);\n}\n\n/** Recursively check if a value (string, array, or object) contains any placeholder sentinel strings. */\nexport function hasPlaceholderDeep(value: unknown): boolean {\n\tif (typeof value === 'string') return isPlaceholderString(value);\n\tif (Array.isArray(value)) return value.some(hasPlaceholderDeep);\n\tif (value !== null && typeof value === 'object') {\n\t\treturn Object.values(value as Record<string, unknown>).some(hasPlaceholderDeep);\n\t}\n\treturn false;\n}\n\n/** Checks if a value is a placeholder value (matches the placeholder regex pattern). */\nexport function isPlaceholderValue(value: unknown): boolean {\n\tif (typeof value !== 'string') return false;\n\treturn !!value.match(PLACEHOLDER_REGEX);\n}\n\n/**\n * Extracts the label from a single placeholder string.\n * Handles formats like:\n * - <__PLACEHOLDER_VALUE__label__>\n * - <__PLACEHOLDER__: label__>\n */\nfunction extractLabelFromPlaceholder(placeholder: string): string {\n\tlet label = placeholder.slice(PLACEHOLDER_PREFIX.length, -PLACEHOLDER_SUFFIX.length);\n\n\tif (label.startsWith('_VALUE__')) {\n\t\tlabel = label.slice('_VALUE__'.length);\n\t} else if (label.startsWith('__:')) {\n\t\tlabel = label.slice('__:'.length);\n\t} else if (label.startsWith('__')) {\n\t\tlabel = label.slice('__'.length);\n\t}\n\n\treturn label.trim();\n}\n\n/**\n * Extracts all placeholder labels from a string value.\n * Handles both cases where the entire value is a placeholder and where\n * placeholders are embedded within code (e.g., Code node).\n * Returns an array of labels found.\n */\nexport function extractPlaceholderLabels(value: unknown): string[] {\n\tif (typeof value !== 'string') return [];\n\n\tconst labels: string[] = [];\n\tconst regex = new RegExp(PLACEHOLDER_REGEX.source, 'g');\n\tlet match;\n\n\twhile ((match = regex.exec(value)) !== null) {\n\t\tconst label = extractLabelFromPlaceholder(match[0]);\n\t\tif (label.length > 0) {\n\t\t\tlabels.push(label);\n\t\t}\n\t}\n\n\treturn labels;\n}\n\n/**\n * Recursively searches through a value (object, array, or primitive) to find\n * all placeholder values and their paths.\n */\nexport function findPlaceholderDetails(value: unknown, path: string[] = []): PlaceholderDetail[] {\n\tif (typeof value === 'string') {\n\t\tconst labels = extractPlaceholderLabels(value);\n\t\treturn labels.map((label) => ({ path, label }));\n\t}\n\n\tif (Array.isArray(value)) {\n\t\treturn value.flatMap((item, index) => findPlaceholderDetails(item, [...path, `[${index}]`]));\n\t}\n\n\tif (value !== null && typeof value === 'object') {\n\t\treturn Object.entries(value).flatMap(([key, nested]) =>\n\t\t\tfindPlaceholderDetails(nested, [...path, key]),\n\t\t);\n\t}\n\n\treturn [];\n}\n\n/**\n * Formats a path array into a dot-notation string for display.\n * Array indices are preserved as [N] without leading dots.\n */\nexport function formatPlaceholderPath(path: string[]): string {\n\tif (path.length === 0) return 'parameters';\n\n\treturn path\n\t\t.map((segment, index) => (segment.startsWith('[') || index === 0 ? segment : `.${segment}`))\n\t\t.join('');\n}\n"],"mappings":";AACA,MAAM,qBAAqB;AAC3B,MAAM,2BAA2B;AAEjC,MAAM,oBAAoB;;AAQ1B,SAAgB,oBAAoB,OAAyB;AAC5D,QACC,OAAO,UAAU,YACjB,MAAM,WAAW,yBAAyB,IAC1C,MAAM,SAAS,mBAAmB;;;AAKpC,SAAgB,mBAAmB,OAAyB;AAC3D,KAAI,OAAO,UAAU,SAAU,QAAO,oBAAoB,MAAM;AAChE,KAAI,MAAM,QAAQ,MAAM,CAAE,QAAO,MAAM,KAAK,mBAAmB;AAC/D,KAAI,UAAU,QAAQ,OAAO,UAAU,SACtC,QAAO,OAAO,OAAO,MAAiC,CAAC,KAAK,mBAAmB;AAEhF,QAAO;;;AAIR,SAAgB,mBAAmB,OAAyB;AAC3D,KAAI,OAAO,UAAU,SAAU,QAAO;AACtC,QAAO,CAAC,CAAC,MAAM,MAAM,kBAAkB;;;;;;;;AASxC,SAAS,4BAA4B,aAA6B;CACjE,IAAI,QAAQ,YAAY,MAAM,IAA2B,GAA2B;AAEpF,KAAI,MAAM,WAAW,WAAW,CAC/B,SAAQ,MAAM,MAAM,EAAkB;UAC5B,MAAM,WAAW,MAAM,CACjC,SAAQ,MAAM,MAAM,EAAa;UACvB,MAAM,WAAW,KAAK,CAChC,SAAQ,MAAM,MAAM,EAAY;AAGjC,QAAO,MAAM,MAAM;;;;;;;;AASpB,SAAgB,yBAAyB,OAA0B;AAClE,KAAI,OAAO,UAAU,SAAU,QAAO,EAAE;CAExC,MAAMA,SAAmB,EAAE;CAC3B,MAAM,QAAQ,IAAI,OAAO,kBAAkB,QAAQ,IAAI;CACvD,IAAI;AAEJ,SAAQ,QAAQ,MAAM,KAAK,MAAM,MAAM,MAAM;EAC5C,MAAM,QAAQ,4BAA4B,MAAM,GAAG;AACnD,MAAI,MAAM,SAAS,EAClB,QAAO,KAAK,MAAM;;AAIpB,QAAO;;;;;;AAOR,SAAgB,uBAAuB,OAAgB,OAAiB,EAAE,EAAuB;AAChG,KAAI,OAAO,UAAU,SAEpB,QADe,yBAAyB,MAAM,CAChC,KAAK,WAAW;EAAE;EAAM;EAAO,EAAE;AAGhD,KAAI,MAAM,QAAQ,MAAM,CACvB,QAAO,MAAM,SAAS,MAAM,UAAU,uBAAuB,MAAM,CAAC,GAAG,MAAM,IAAI,MAAM,GAAG,CAAC,CAAC;AAG7F,KAAI,UAAU,QAAQ,OAAO,UAAU,SACtC,QAAO,OAAO,QAAQ,MAAM,CAAC,SAAS,CAAC,KAAK,YAC3C,uBAAuB,QAAQ,CAAC,GAAG,MAAM,IAAI,CAAC,CAC9C;AAGF,QAAO,EAAE;;;;;;AAOV,SAAgB,sBAAsB,MAAwB;AAC7D,KAAI,KAAK,WAAW,EAAG,QAAO;AAE9B,QAAO,KACL,KAAK,SAAS,UAAW,QAAQ,WAAW,IAAI,IAAI,UAAU,IAAI,UAAU,IAAI,UAAW,CAC3F,KAAK,GAAG"}

package/dist/promise/deferred-promise.cjs

@@ -0,0 +1,14 @@
+
+//#region src/promise/deferred-promise.ts
+function createDeferredPromise() {
+	const deferred = {};
+	deferred.promise = new Promise((resolve, reject) => {
+		deferred.resolve = resolve;
+		deferred.reject = reject;
+	});
+	return deferred;
+}
+
+//#endregion
+exports.createDeferredPromise = createDeferredPromise;
+//# sourceMappingURL=deferred-promise.cjs.map

package/dist/promise/deferred-promise.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"deferred-promise.cjs","names":["deferred: Partial<IDeferredPromise<T>>"],"sources":["../../src/promise/deferred-promise.ts"],"sourcesContent":["type ResolveFn<T> = (result: T | PromiseLike<T>) => void;\ntype RejectFn = (error: Error) => void;\n\nexport interface IDeferredPromise<T> {\n\tpromise: Promise<T>;\n\tresolve: ResolveFn<T>;\n\treject: RejectFn;\n}\n\nexport function createDeferredPromise<T = void>(): IDeferredPromise<T> {\n\tconst deferred: Partial<IDeferredPromise<T>> = {};\n\tdeferred.promise = new Promise<T>((resolve, reject) => {\n\t\tdeferred.resolve = resolve;\n\t\tdeferred.reject = reject;\n\t});\n\treturn deferred as IDeferredPromise<T>;\n}\n"],"mappings":";;AASA,SAAgB,wBAAuD;CACtE,MAAMA,WAAyC,EAAE;AACjD,UAAS,UAAU,IAAI,SAAY,SAAS,WAAW;AACtD,WAAS,UAAU;AACnB,WAAS,SAAS;GACjB;AACF,QAAO"}

package/dist/promise/deferred-promise.d.cts

@@ -0,0 +1,12 @@
+//#region src/promise/deferred-promise.d.ts
+type ResolveFn<T> = (result: T | PromiseLike<T>) => void;
+type RejectFn = (error: Error) => void;
+interface IDeferredPromise<T> {
+  promise: Promise<T>;
+  resolve: ResolveFn<T>;
+  reject: RejectFn;
+}
+declare function createDeferredPromise<T = void>(): IDeferredPromise<T>;
+//#endregion
+export { IDeferredPromise, createDeferredPromise };
+//# sourceMappingURL=deferred-promise.d.cts.map

package/dist/promise/deferred-promise.d.mts

@@ -0,0 +1,12 @@
+//#region src/promise/deferred-promise.d.ts
+type ResolveFn<T> = (result: T | PromiseLike<T>) => void;
+type RejectFn = (error: Error) => void;
+interface IDeferredPromise<T> {
+  promise: Promise<T>;
+  resolve: ResolveFn<T>;
+  reject: RejectFn;
+}
+declare function createDeferredPromise<T = void>(): IDeferredPromise<T>;
+//#endregion
+export { IDeferredPromise, createDeferredPromise };
+//# sourceMappingURL=deferred-promise.d.mts.map

package/dist/promise/deferred-promise.mjs

@@ -0,0 +1,13 @@
+//#region src/promise/deferred-promise.ts
+function createDeferredPromise() {
+	const deferred = {};
+	deferred.promise = new Promise((resolve, reject) => {
+		deferred.resolve = resolve;
+		deferred.reject = reject;
+	});
+	return deferred;
+}
+
+//#endregion
+export { createDeferredPromise };
+//# sourceMappingURL=deferred-promise.mjs.map

package/dist/promise/deferred-promise.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"deferred-promise.mjs","names":["deferred: Partial<IDeferredPromise<T>>"],"sources":["../../src/promise/deferred-promise.ts"],"sourcesContent":["type ResolveFn<T> = (result: T | PromiseLike<T>) => void;\ntype RejectFn = (error: Error) => void;\n\nexport interface IDeferredPromise<T> {\n\tpromise: Promise<T>;\n\tresolve: ResolveFn<T>;\n\treject: RejectFn;\n}\n\nexport function createDeferredPromise<T = void>(): IDeferredPromise<T> {\n\tconst deferred: Partial<IDeferredPromise<T>> = {};\n\tdeferred.promise = new Promise<T>((resolve, reject) => {\n\t\tdeferred.resolve = resolve;\n\t\tdeferred.reject = reject;\n\t});\n\treturn deferred as IDeferredPromise<T>;\n}\n"],"mappings":";AASA,SAAgB,wBAAuD;CACtE,MAAMA,WAAyC,EAAE;AACjD,UAAS,UAAU,IAAI,SAAY,SAAS,WAAW;AACtD,WAAS,UAAU;AACnB,WAAS,SAAS;GACjB;AACF,QAAO"}

package/dist/result.cjs

@@ -0,0 +1,30 @@
+const require_ensure_error = require('./ensure-error.cjs');
+
+//#region src/result.ts
+const createResultOk = (data) => ({
+	ok: true,
+	result: data
+});
+const createResultError = (error) => ({
+	ok: false,
+	error
+});
+/**
+* Executes the given function and converts it to a Result object.
+*
+* @example
+* const result = toResult(() => fs.writeFileSync('file.txt', 'Hello, World!'));
+*/
+const toResult = (fn) => {
+	try {
+		return createResultOk(fn());
+	} catch (e) {
+		return createResultError(require_ensure_error.ensureError(e));
+	}
+};
+
+//#endregion
+exports.createResultError = createResultError;
+exports.createResultOk = createResultOk;
+exports.toResult = toResult;
+//# sourceMappingURL=result.cjs.map

package/dist/result.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"result.cjs","names":["ensureError"],"sources":["../src/result.ts"],"sourcesContent":["import { ensureError } from './errors/ensure-error';\n\nexport type ResultOk<T> = { ok: true; result: T };\nexport type ResultError<E> = { ok: false; error: E };\nexport type Result<T, E> = ResultOk<T> | ResultError<E>;\n\nexport const createResultOk = <T>(data: T): ResultOk<T> => ({\n\tok: true,\n\tresult: data,\n});\n\nexport const createResultError = <E = unknown>(error: E): ResultError<E> => ({\n\tok: false,\n\terror,\n});\n\n/**\n * Executes the given function and converts it to a Result object.\n *\n * @example\n * const result = toResult(() => fs.writeFileSync('file.txt', 'Hello, World!'));\n */\nexport const toResult = <T, E extends Error = Error>(fn: () => T): Result<T, E> => {\n\ttry {\n\t\treturn createResultOk<T>(fn());\n\t} catch (e) {\n\t\tconst error = ensureError(e);\n\t\treturn createResultError<E>(error as E);\n\t}\n};\n"],"mappings":";;;AAMA,MAAa,kBAAqB,UAA0B;CAC3D,IAAI;CACJ,QAAQ;CACR;AAED,MAAa,qBAAkC,WAA8B;CAC5E,IAAI;CACJ;CACA;;;;;;;AAQD,MAAa,YAAwC,OAA8B;AAClF,KAAI;AACH,SAAO,eAAkB,IAAI,CAAC;UACtB,GAAG;AAEX,SAAO,kBADOA,iCAAY,EAAE,CACW"}

package/dist/result.d.cts

@@ -0,0 +1,16 @@
+//#region src/result.d.ts
+type ResultOk<T> = {
+  ok: true;
+  result: T;
+};
+type ResultError<E> = {
+  ok: false;
+  error: E;
+};
+type Result<T, E> = ResultOk<T> | ResultError<E>;
+declare const createResultOk: <T>(data: T) => ResultOk<T>;
+declare const createResultError: <E = unknown>(error: E) => ResultError<E>;
+declare const toResult: <T, E extends Error = Error>(fn: () => T) => Result<T, E>;
+//#endregion
+export { Result, ResultError, ResultOk, createResultError, createResultOk, toResult };
+//# sourceMappingURL=result.d.cts.map

package/dist/result.d.mts

@@ -0,0 +1,16 @@
+//#region src/result.d.ts
+type ResultOk<T> = {
+  ok: true;
+  result: T;
+};
+type ResultError<E> = {
+  ok: false;
+  error: E;
+};
+type Result<T, E> = ResultOk<T> | ResultError<E>;
+declare const createResultOk: <T>(data: T) => ResultOk<T>;
+declare const createResultError: <E = unknown>(error: E) => ResultError<E>;
+declare const toResult: <T, E extends Error = Error>(fn: () => T) => Result<T, E>;
+//#endregion
+export { Result, ResultError, ResultOk, createResultError, createResultOk, toResult };
+//# sourceMappingURL=result.d.mts.map

package/dist/result.mjs

@@ -0,0 +1,28 @@
+import { t as ensureError } from "./ensure-error.mjs";
+
+//#region src/result.ts
+const createResultOk = (data) => ({
+	ok: true,
+	result: data
+});
+const createResultError = (error) => ({
+	ok: false,
+	error
+});
+/**
+* Executes the given function and converts it to a Result object.
+*
+* @example
+* const result = toResult(() => fs.writeFileSync('file.txt', 'Hello, World!'));
+*/
+const toResult = (fn) => {
+	try {
+		return createResultOk(fn());
+	} catch (e) {
+		return createResultError(ensureError(e));
+	}
+};
+
+//#endregion
+export { createResultError, createResultOk, toResult };
+//# sourceMappingURL=result.mjs.map

package/dist/result.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"result.mjs","names":[],"sources":["../src/result.ts"],"sourcesContent":["import { ensureError } from './errors/ensure-error';\n\nexport type ResultOk<T> = { ok: true; result: T };\nexport type ResultError<E> = { ok: false; error: E };\nexport type Result<T, E> = ResultOk<T> | ResultError<E>;\n\nexport const createResultOk = <T>(data: T): ResultOk<T> => ({\n\tok: true,\n\tresult: data,\n});\n\nexport const createResultError = <E = unknown>(error: E): ResultError<E> => ({\n\tok: false,\n\terror,\n});\n\n/**\n * Executes the given function and converts it to a Result object.\n *\n * @example\n * const result = toResult(() => fs.writeFileSync('file.txt', 'Hello, World!'));\n */\nexport const toResult = <T, E extends Error = Error>(fn: () => T): Result<T, E> => {\n\ttry {\n\t\treturn createResultOk<T>(fn());\n\t} catch (e) {\n\t\tconst error = ensureError(e);\n\t\treturn createResultError<E>(error as E);\n\t}\n};\n"],"mappings":";;;AAMA,MAAa,kBAAqB,UAA0B;CAC3D,IAAI;CACJ,QAAQ;CACR;AAED,MAAa,qBAAkC,WAA8B;CAC5E,IAAI;CACJ;CACA;;;;;;;AAQD,MAAa,YAAwC,OAA8B;AAClF,KAAI;AACH,SAAO,eAAkB,IAAI,CAAC;UACtB,GAAG;AAEX,SAAO,kBADO,YAAY,EAAE,CACW"}

package/dist/retry.cjs

@@ -1,3 +1,40 @@
-const require_retry = require('./retry2.cjs');
 
-exports.retry = require_retry.retry;
+//#region src/retry.ts
+/**
+* A utility that retries a function every `interval` milliseconds
+* until the function returns true or the maximum number of retries is reached.
+*
+* @param fn - A function that returns a boolean or a Promise resolving to a boolean.
+* @param interval - The time interval (in milliseconds) between each retry. Defaults to 1000.
+* @param maxRetries - The maximum number of retry attempts. Defaults to 3.
+* @param backoff - The backoff strategy to use: 'linear', 'exponential', or null.
+* @returns {Promise<boolean>} - A promise that resolves to:
+*   - true: If the function returns true before reaching maxRetries.
+*   - false: If the function never returns true or if an error occurs.
+*/
+async function retry(fn, interval = 1e3, maxRetries = 3, backoff = "linear") {
+	let attempt = 0;
+	while (attempt < maxRetries) {
+		attempt++;
+		try {
+			if (await fn()) return true;
+		} catch (error) {
+			console.error("Error during retry:", error);
+			throw error;
+		}
+		if (attempt < maxRetries) {
+			let computedInterval = interval;
+			if (backoff === "linear") computedInterval = interval * attempt;
+			else if (backoff === "exponential") {
+				computedInterval = Math.pow(2, attempt - 1) * interval;
+				computedInterval = Math.min(computedInterval, 3e4);
+			}
+			await new Promise((resolve) => setTimeout(resolve, computedInterval));
+		}
+	}
+	return false;
+}
+
+//#endregion
+exports.retry = retry;
+//# sourceMappingURL=retry.cjs.map

package/dist/retry.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"retry.cjs","names":[],"sources":["../src/retry.ts"],"sourcesContent":["type RetryFn = () => boolean | Promise<boolean>;\n\n/**\n * A utility that retries a function every `interval` milliseconds\n * until the function returns true or the maximum number of retries is reached.\n *\n * @param fn - A function that returns a boolean or a Promise resolving to a boolean.\n * @param interval - The time interval (in milliseconds) between each retry. Defaults to 1000.\n * @param maxRetries - The maximum number of retry attempts. Defaults to 3.\n * @param backoff - The backoff strategy to use: 'linear', 'exponential', or null.\n * @returns {Promise<boolean>} - A promise that resolves to:\n *   - true: If the function returns true before reaching maxRetries.\n *   - false: If the function never returns true or if an error occurs.\n */\nexport async function retry(\n\tfn: RetryFn,\n\tinterval: number = 1000,\n\tmaxRetries: number = 3,\n\tbackoff: 'exponential' | 'linear' | null = 'linear',\n): Promise<boolean> {\n\tlet attempt = 0;\n\n\twhile (attempt < maxRetries) {\n\t\tattempt++;\n\t\ttry {\n\t\t\tconst result = await fn();\n\t\t\tif (result) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t} catch (error) {\n\t\t\tconsole.error('Error during retry:', error);\n\t\t\tthrow error;\n\t\t}\n\n\t\t// Wait for the specified interval before the next attempt, if any attempts remain.\n\t\tif (attempt < maxRetries) {\n\t\t\tlet computedInterval = interval;\n\n\t\t\tif (backoff === 'linear') {\n\t\t\t\tcomputedInterval = interval * attempt;\n\t\t\t} else if (backoff === 'exponential') {\n\t\t\t\tcomputedInterval = Math.pow(2, attempt - 1) * interval;\n\t\t\t\tcomputedInterval = Math.min(computedInterval, 30000); // Cap the maximum interval to 30 seconds\n\t\t\t}\n\n\t\t\tawait new Promise<void>((resolve) => setTimeout(resolve, computedInterval));\n\t\t}\n\t}\n\n\treturn false;\n}\n"],"mappings":";;;;;;;;;;;;;;AAcA,eAAsB,MACrB,IACA,WAAmB,KACnB,aAAqB,GACrB,UAA2C,UACxB;CACnB,IAAI,UAAU;AAEd,QAAO,UAAU,YAAY;AAC5B;AACA,MAAI;AAEH,OADe,MAAM,IAAI,CAExB,QAAO;WAEA,OAAO;AACf,WAAQ,MAAM,uBAAuB,MAAM;AAC3C,SAAM;;AAIP,MAAI,UAAU,YAAY;GACzB,IAAI,mBAAmB;AAEvB,OAAI,YAAY,SACf,oBAAmB,WAAW;YACpB,YAAY,eAAe;AACrC,uBAAmB,KAAK,IAAI,GAAG,UAAU,EAAE,GAAG;AAC9C,uBAAmB,KAAK,IAAI,kBAAkB,IAAM;;AAGrD,SAAM,IAAI,SAAe,YAAY,WAAW,SAAS,iBAAiB,CAAC;;;AAI7E,QAAO"}

package/dist/retry.d.cts

@@ -1,2 +1,6 @@
-import { t as retry } from "./retry2.cjs";
-export { retry };
+//#region src/retry.d.ts
+type RetryFn = () => boolean | Promise<boolean>;
+declare function retry(fn: RetryFn, interval?: number, maxRetries?: number, backoff?: 'exponential' | 'linear' | null): Promise<boolean>;
+//#endregion
+export { retry };
+//# sourceMappingURL=retry.d.cts.map

package/dist/retry.d.mts

@@ -1,2 +1,6 @@
-import { t as retry } from "./retry2.mjs";
-export { retry };
+//#region src/retry.d.ts
+type RetryFn = () => boolean | Promise<boolean>;
+declare function retry(fn: RetryFn, interval?: number, maxRetries?: number, backoff?: 'exponential' | 'linear' | null): Promise<boolean>;
+//#endregion
+export { retry };
+//# sourceMappingURL=retry.d.mts.map

package/dist/retry.mjs

@@ -1,3 +1,39 @@
-import { t as retry } from "./retry2.mjs";
+//#region src/retry.ts
+/**
+* A utility that retries a function every `interval` milliseconds
+* until the function returns true or the maximum number of retries is reached.
+*
+* @param fn - A function that returns a boolean or a Promise resolving to a boolean.
+* @param interval - The time interval (in milliseconds) between each retry. Defaults to 1000.
+* @param maxRetries - The maximum number of retry attempts. Defaults to 3.
+* @param backoff - The backoff strategy to use: 'linear', 'exponential', or null.
+* @returns {Promise<boolean>} - A promise that resolves to:
+*   - true: If the function returns true before reaching maxRetries.
+*   - false: If the function never returns true or if an error occurs.
+*/
+async function retry(fn, interval = 1e3, maxRetries = 3, backoff = "linear") {
+	let attempt = 0;
+	while (attempt < maxRetries) {
+		attempt++;
+		try {
+			if (await fn()) return true;
+		} catch (error) {
+			console.error("Error during retry:", error);
+			throw error;
+		}
+		if (attempt < maxRetries) {
+			let computedInterval = interval;
+			if (backoff === "linear") computedInterval = interval * attempt;
+			else if (backoff === "exponential") {
+				computedInterval = Math.pow(2, attempt - 1) * interval;
+				computedInterval = Math.min(computedInterval, 3e4);
+			}
+			await new Promise((resolve) => setTimeout(resolve, computedInterval));
+		}
+	}
+	return false;
+}
 
-export { retry };
+//#endregion
+export { retry };
+//# sourceMappingURL=retry.mjs.map

package/dist/retry.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"retry.mjs","names":[],"sources":["../src/retry.ts"],"sourcesContent":["type RetryFn = () => boolean | Promise<boolean>;\n\n/**\n * A utility that retries a function every `interval` milliseconds\n * until the function returns true or the maximum number of retries is reached.\n *\n * @param fn - A function that returns a boolean or a Promise resolving to a boolean.\n * @param interval - The time interval (in milliseconds) between each retry. Defaults to 1000.\n * @param maxRetries - The maximum number of retry attempts. Defaults to 3.\n * @param backoff - The backoff strategy to use: 'linear', 'exponential', or null.\n * @returns {Promise<boolean>} - A promise that resolves to:\n *   - true: If the function returns true before reaching maxRetries.\n *   - false: If the function never returns true or if an error occurs.\n */\nexport async function retry(\n\tfn: RetryFn,\n\tinterval: number = 1000,\n\tmaxRetries: number = 3,\n\tbackoff: 'exponential' | 'linear' | null = 'linear',\n): Promise<boolean> {\n\tlet attempt = 0;\n\n\twhile (attempt < maxRetries) {\n\t\tattempt++;\n\t\ttry {\n\t\t\tconst result = await fn();\n\t\t\tif (result) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t} catch (error) {\n\t\t\tconsole.error('Error during retry:', error);\n\t\t\tthrow error;\n\t\t}\n\n\t\t// Wait for the specified interval before the next attempt, if any attempts remain.\n\t\tif (attempt < maxRetries) {\n\t\t\tlet computedInterval = interval;\n\n\t\t\tif (backoff === 'linear') {\n\t\t\t\tcomputedInterval = interval * attempt;\n\t\t\t} else if (backoff === 'exponential') {\n\t\t\t\tcomputedInterval = Math.pow(2, attempt - 1) * interval;\n\t\t\t\tcomputedInterval = Math.min(computedInterval, 30000); // Cap the maximum interval to 30 seconds\n\t\t\t}\n\n\t\t\tawait new Promise<void>((resolve) => setTimeout(resolve, computedInterval));\n\t\t}\n\t}\n\n\treturn false;\n}\n"],"mappings":";;;;;;;;;;;;;AAcA,eAAsB,MACrB,IACA,WAAmB,KACnB,aAAqB,GACrB,UAA2C,UACxB;CACnB,IAAI,UAAU;AAEd,QAAO,UAAU,YAAY;AAC5B;AACA,MAAI;AAEH,OADe,MAAM,IAAI,CAExB,QAAO;WAEA,OAAO;AACf,WAAQ,MAAM,uBAAuB,MAAM;AAC3C,SAAM;;AAIP,MAAI,UAAU,YAAY;GACzB,IAAI,mBAAmB;AAEvB,OAAI,YAAY,SACf,oBAAmB,WAAW;YACpB,YAAY,eAAe;AACrC,uBAAmB,KAAK,IAAI,GAAG,UAAU,EAAE,GAAG;AAC9C,uBAAmB,KAAK,IAAI,kBAAkB,IAAM;;AAGrD,SAAM,IAAI,SAAe,YAAY,WAAW,SAAS,iBAAiB,CAAC;;;AAI7E,QAAO"}

package/dist/scrub-secrets.cjs

@@ -1,5 +1,45 @@
-const require_scrub_secrets = require('./scrub-secrets2.cjs');
 
-exports.SECRET_KEYS = require_scrub_secrets.SECRET_KEYS;
-exports.SECRET_VALUE_PATTERNS = require_scrub_secrets.SECRET_VALUE_PATTERNS;
-exports.scrubSecretsInText = require_scrub_secrets.scrubSecretsInText;
+//#region src/scrub-secrets.ts
+/**
+* Replace common credential patterns in free-form text with `[REDACTED]`.
+*
+* Used before persisting or transmitting user-supplied text (telemetry
+* excerpts, eval report HTML, free-form feedback) where keys/tokens
+* accidentally pasted into prompts or command lines could otherwise leak
+* downstream.
+*
+* Conservative by design: matches well-known prefixed tokens, explicit
+* `key=value` pairs, and quoted JSON/JS-object fields with sensitive
+* names. We don't attempt to redact arbitrary long opaque strings — false
+* positives on file paths, IDs, or base64 payloads would make the output
+* unreadable.
+*/
+const SECRET_KEYS = "password|passwd|secret|credentials?|api[_-]?key|authorization|access[_-]?token|refresh[_-]?token|id[_-]?token|session[_-]?token|auth[_-]?token";
+const SECRET_VALUE_PATTERNS = [
+	/-----BEGIN (?:RSA |EC |DSA |OPENSSH |PGP )?PRIVATE KEY-----[\s\S]*?-----END (?:RSA |EC |DSA |OPENSSH |PGP )?PRIVATE KEY-----/g,
+	/\beyJ[A-Za-z0-9_-]+\.eyJ[A-Za-z0-9_-]+\.[A-Za-z0-9_-]+/g,
+	/\b(?:Bearer|Basic|Token)\s+[A-Za-z0-9._~+/=-]{12,}/gi,
+	/\bsk-(?:ant-|proj-)?[A-Za-z0-9_-]{16,}/g,
+	/\b(?:sk|rk|pk)_(?:live|test)_[A-Za-z0-9]{16,}/g,
+	/\bAIza[0-9A-Za-z_-]{35}\b/g,
+	/\bxox[abprso]-[A-Za-z0-9-]{10,}/g,
+	/\bgh[psoru]_[A-Za-z0-9]{20,}/g,
+	/\bgithub_pat_[A-Za-z0-9_]{22,}/g,
+	/\bAKIA[0-9A-Z]{16}\b/g,
+	/\b(?:bot)?\d{8,10}:[A-Za-z0-9_-]{35}\b/g,
+	/(?<=:\/\/)[^\s:/@]+:[^\s:/@]+(?=@)/g,
+	new RegExp(`"(?:${SECRET_KEYS})"\\s*:\\s*"(?!\\[(?:redacted|REDACTED)(?::[^"\\]]*)?\\]")(?:[^"\\\\\\r\\n]|\\\\.)*"`, "gi"),
+	new RegExp(`'(?:${SECRET_KEYS})'\\s*:\\s*'(?!\\[(?:redacted|REDACTED)(?::[^'\\]]*)?\\]')(?:[^'\\\\\\r\\n]|\\\\.)*'`, "gi"),
+	new RegExp(`(?<!\\[(?:redacted|REDACTED):)\\b(?:${SECRET_KEYS})\\s*[:=]\\s*(?!\\[?(?:redacted|REDACTED)\\b)\\S+`, "gi")
+];
+function scrubSecretsInText(input) {
+	let out = input;
+	for (const pattern of SECRET_VALUE_PATTERNS) out = out.replace(pattern, "[REDACTED]");
+	return out;
+}
+
+//#endregion
+exports.SECRET_KEYS = SECRET_KEYS;
+exports.SECRET_VALUE_PATTERNS = SECRET_VALUE_PATTERNS;
+exports.scrubSecretsInText = scrubSecretsInText;
+//# sourceMappingURL=scrub-secrets.cjs.map

package/dist/scrub-secrets.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"scrub-secrets.cjs","names":["SECRET_VALUE_PATTERNS: readonly RegExp[]"],"sources":["../src/scrub-secrets.ts"],"sourcesContent":["/**\n * Replace common credential patterns in free-form text with `[REDACTED]`.\n *\n * Used before persisting or transmitting user-supplied text (telemetry\n * excerpts, eval report HTML, free-form feedback) where keys/tokens\n * accidentally pasted into prompts or command lines could otherwise leak\n * downstream.\n *\n * Conservative by design: matches well-known prefixed tokens, explicit\n * `key=value` pairs, and quoted JSON/JS-object fields with sensitive\n * names. We don't attempt to redact arbitrary long opaque strings — false\n * positives on file paths, IDs, or base64 payloads would make the output\n * unreadable.\n */\nexport const SECRET_KEYS =\n\t'password|passwd|secret|credentials?|api[_-]?key|authorization|access[_-]?token|refresh[_-]?token|id[_-]?token|session[_-]?token|auth[_-]?token';\n\nexport const SECRET_VALUE_PATTERNS: readonly RegExp[] = [\n\t// PEM private-key blocks (RSA/EC/DSA/OpenSSH/PGP). Whole block, multiline.\n\t/-----BEGIN (?:RSA |EC |DSA |OPENSSH |PGP )?PRIVATE KEY-----[\\s\\S]*?-----END (?:RSA |EC |DSA |OPENSSH |PGP )?PRIVATE KEY-----/g,\n\t// JWTs: `eyJ<header>.eyJ<payload>.<signature>` (both leading segments are\n\t// base64url of a `{\"` object, which makes this highly distinctive).\n\t/\\beyJ[A-Za-z0-9_-]+\\.eyJ[A-Za-z0-9_-]+\\.[A-Za-z0-9_-]+/g,\n\t// Authorization-header substrings: `Bearer <token>`, `Basic <token>`, `Token <token>`\n\t/\\b(?:Bearer|Basic|Token)\\s+[A-Za-z0-9._~+/=-]{12,}/gi,\n\t// OpenAI / Anthropic API keys\n\t/\\bsk-(?:ant-|proj-)?[A-Za-z0-9_-]{16,}/g,\n\t// Stripe secret/restricted/publishable keys (`sk_live_…`, `rk_test_…`, …)\n\t/\\b(?:sk|rk|pk)_(?:live|test)_[A-Za-z0-9]{16,}/g,\n\t// Google API keys\n\t/\\bAIza[0-9A-Za-z_-]{35}\\b/g,\n\t// Slack tokens (xoxb, xoxp, xoxa, xoxr, xoxs, xoxo)\n\t/\\bxox[abprso]-[A-Za-z0-9-]{10,}/g,\n\t// GitHub tokens (ghp, ghs, gho, ghr, ghu)\n\t/\\bgh[psoru]_[A-Za-z0-9]{20,}/g,\n\t// GitHub fine-grained personal access tokens\n\t/\\bgithub_pat_[A-Za-z0-9_]{22,}/g,\n\t// AWS access key id\n\t/\\bAKIA[0-9A-Z]{16}\\b/g,\n\t// Telegram bot token (`<bot id>:<35-char secret>`, also inside `/bot…/` URLs)\n\t/\\b(?:bot)?\\d{8,10}:[A-Za-z0-9_-]{35}\\b/g,\n\t// Credentials embedded in a URL: `scheme://user:password@` — redact the userinfo.\n\t/(?<=:\\/\\/)[^\\s:/@]+:[^\\s:/@]+(?=@)/g,\n\t// JSON-shaped `\"key\": \"value\"` — matches the quoted field as a whole.\n\t// Run before the loose pattern so nested objects like\n\t// `{\"credentials\": {\"apiKey\": \"...\"}}` don't have the outer key consume\n\t// the inner key on its way to a non-quoted (object) value. The value\n\t// body uses the unrolled JSON-string idiom `(?:[^\"\\\\\\r\\n]|\\\\.)*`: the\n\t// negated class excludes the backslash so a backslash can only be consumed\n\t// by the `\\\\.` escape branch. Keep the two alternatives disjoint (don't\n\t// fold `\\\\` back into the negated class) — that keeps every run of\n\t// backslashes to a single, unambiguous parse, so matching stays fast on any\n\t// input. An escaped quote inside the value (`\"abc\\\"def\"`) still doesn't end\n\t// the match early, via the escape branch. The negative lookahead skips\n\t// values that are already a `[redacted]` / `[REDACTED]` / typed\n\t// `[REDACTED:<type>:<index>]` placeholder so this stays idempotent when\n\t// chained behind upstream object-walking redaction (langsmith trace\n\t// payloads, mcp-browser markers).\n\tnew RegExp(\n\t\t`\"(?:${SECRET_KEYS})\"\\\\s*:\\\\s*\"(?!\\\\[(?:redacted|REDACTED)(?::[^\"\\\\]]*)?\\\\]\")(?:[^\"\\\\\\\\\\\\r\\\\n]|\\\\\\\\.)*\"`,\n\t\t'gi',\n\t),\n\t// JS-object-shaped `'key': 'value'`\n\tnew RegExp(\n\t\t`'(?:${SECRET_KEYS})'\\\\s*:\\\\s*'(?!\\\\[(?:redacted|REDACTED)(?::[^'\\\\]]*)?\\\\]')(?:[^'\\\\\\\\\\\\r\\\\n]|\\\\\\\\.)*'`,\n\t\t'gi',\n\t),\n\t// Generic `password=...` / `api_key=...` / `secret=...` style assignments.\n\t// The negative lookbehind skips a keyword sitting at the `<type>` position of\n\t// an upstream `[REDACTED:<type>:<index>]` marker (e.g. mcp-browser output), so\n\t// the `secret:1]` tail isn't re-matched into a nested `[REDACTED:[REDACTED]`.\n\t// Checking only the `[REDACTED:` prefix suffices: inside a marker a keyword can\n\t// only start a `\\b` match right after that prefix — every other keyword-shaped\n\t// substring is preceded by `_` (snake_case type slug) or a digit, so no word\n\t// boundary opens there. The value lookahead skips values that are already a\n\t// redaction placeholder (bracketed, typed, or URL-safe bare form) — the same\n\t// idempotency convention as the quoted forms.\n\tnew RegExp(\n\t\t`(?<!\\\\[(?:redacted|REDACTED):)\\\\b(?:${SECRET_KEYS})\\\\s*[:=]\\\\s*(?!\\\\[?(?:redacted|REDACTED)\\\\b)\\\\S+`,\n\t\t'gi',\n\t),\n];\n\nexport function scrubSecretsInText(input: string): string {\n\tlet out = input;\n\tfor (const pattern of SECRET_VALUE_PATTERNS) {\n\t\tout = out.replace(pattern, '[REDACTED]');\n\t}\n\treturn out;\n}\n"],"mappings":";;;;;;;;;;;;;;;;AAcA,MAAa,cACZ;AAED,MAAaA,wBAA2C;CAEvD;CAGA;CAEA;CAEA;CAEA;CAEA;CAEA;CAEA;CAEA;CAEA;CAEA;CAEA;CAgBA,IAAI,OACH,OAAO,YAAY,uFACnB,KACA;CAED,IAAI,OACH,OAAO,YAAY,uFACnB,KACA;CAWD,IAAI,OACH,uCAAuC,YAAY,oDACnD,KACA;CACD;AAED,SAAgB,mBAAmB,OAAuB;CACzD,IAAI,MAAM;AACV,MAAK,MAAM,WAAW,sBACrB,OAAM,IAAI,QAAQ,SAAS,aAAa;AAEzC,QAAO"}

package/dist/scrub-secrets.d.cts

@@ -1,2 +1,7 @@
-import { n as SECRET_VALUE_PATTERNS, r as scrubSecretsInText, t as SECRET_KEYS } from "./scrub-secrets2.cjs";
-export { SECRET_KEYS, SECRET_VALUE_PATTERNS, scrubSecretsInText };
+//#region src/scrub-secrets.d.ts
+declare const SECRET_KEYS = "password|passwd|secret|credentials?|api[_-]?key|authorization|access[_-]?token|refresh[_-]?token|id[_-]?token|session[_-]?token|auth[_-]?token";
+declare const SECRET_VALUE_PATTERNS: readonly RegExp[];
+declare function scrubSecretsInText(input: string): string;
+//#endregion
+export { SECRET_KEYS, SECRET_VALUE_PATTERNS, scrubSecretsInText };
+//# sourceMappingURL=scrub-secrets.d.cts.map

package/dist/scrub-secrets.d.mts

@@ -1,2 +1,7 @@
-import { n as SECRET_VALUE_PATTERNS, r as scrubSecretsInText, t as SECRET_KEYS } from "./scrub-secrets2.mjs";
-export { SECRET_KEYS, SECRET_VALUE_PATTERNS, scrubSecretsInText };
+//#region src/scrub-secrets.d.ts
+declare const SECRET_KEYS = "password|passwd|secret|credentials?|api[_-]?key|authorization|access[_-]?token|refresh[_-]?token|id[_-]?token|session[_-]?token|auth[_-]?token";
+declare const SECRET_VALUE_PATTERNS: readonly RegExp[];
+declare function scrubSecretsInText(input: string): string;
+//#endregion
+export { SECRET_KEYS, SECRET_VALUE_PATTERNS, scrubSecretsInText };
+//# sourceMappingURL=scrub-secrets.d.mts.map

package/dist/scrub-secrets.mjs

@@ -1,3 +1,42 @@
-import { n as SECRET_VALUE_PATTERNS, r as scrubSecretsInText, t as SECRET_KEYS } from "./scrub-secrets2.mjs";
+//#region src/scrub-secrets.ts
+/**
+* Replace common credential patterns in free-form text with `[REDACTED]`.
+*
+* Used before persisting or transmitting user-supplied text (telemetry
+* excerpts, eval report HTML, free-form feedback) where keys/tokens
+* accidentally pasted into prompts or command lines could otherwise leak
+* downstream.
+*
+* Conservative by design: matches well-known prefixed tokens, explicit
+* `key=value` pairs, and quoted JSON/JS-object fields with sensitive
+* names. We don't attempt to redact arbitrary long opaque strings — false
+* positives on file paths, IDs, or base64 payloads would make the output
+* unreadable.
+*/
+const SECRET_KEYS = "password|passwd|secret|credentials?|api[_-]?key|authorization|access[_-]?token|refresh[_-]?token|id[_-]?token|session[_-]?token|auth[_-]?token";
+const SECRET_VALUE_PATTERNS = [
+	/-----BEGIN (?:RSA |EC |DSA |OPENSSH |PGP )?PRIVATE KEY-----[\s\S]*?-----END (?:RSA |EC |DSA |OPENSSH |PGP )?PRIVATE KEY-----/g,
+	/\beyJ[A-Za-z0-9_-]+\.eyJ[A-Za-z0-9_-]+\.[A-Za-z0-9_-]+/g,
+	/\b(?:Bearer|Basic|Token)\s+[A-Za-z0-9._~+/=-]{12,}/gi,
+	/\bsk-(?:ant-|proj-)?[A-Za-z0-9_-]{16,}/g,
+	/\b(?:sk|rk|pk)_(?:live|test)_[A-Za-z0-9]{16,}/g,
+	/\bAIza[0-9A-Za-z_-]{35}\b/g,
+	/\bxox[abprso]-[A-Za-z0-9-]{10,}/g,
+	/\bgh[psoru]_[A-Za-z0-9]{20,}/g,
+	/\bgithub_pat_[A-Za-z0-9_]{22,}/g,
+	/\bAKIA[0-9A-Z]{16}\b/g,
+	/\b(?:bot)?\d{8,10}:[A-Za-z0-9_-]{35}\b/g,
+	/(?<=:\/\/)[^\s:/@]+:[^\s:/@]+(?=@)/g,
+	new RegExp(`"(?:${SECRET_KEYS})"\\s*:\\s*"(?!\\[(?:redacted|REDACTED)(?::[^"\\]]*)?\\]")(?:[^"\\\\\\r\\n]|\\\\.)*"`, "gi"),
+	new RegExp(`'(?:${SECRET_KEYS})'\\s*:\\s*'(?!\\[(?:redacted|REDACTED)(?::[^'\\]]*)?\\]')(?:[^'\\\\\\r\\n]|\\\\.)*'`, "gi"),
+	new RegExp(`(?<!\\[(?:redacted|REDACTED):)\\b(?:${SECRET_KEYS})\\s*[:=]\\s*(?!\\[?(?:redacted|REDACTED)\\b)\\S+`, "gi")
+];
+function scrubSecretsInText(input) {
+	let out = input;
+	for (const pattern of SECRET_VALUE_PATTERNS) out = out.replace(pattern, "[REDACTED]");
+	return out;
+}
 
-export { SECRET_KEYS, SECRET_VALUE_PATTERNS, scrubSecretsInText };
+//#endregion
+export { SECRET_KEYS, SECRET_VALUE_PATTERNS, scrubSecretsInText };
+//# sourceMappingURL=scrub-secrets.mjs.map

package/dist/scrub-secrets.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"scrub-secrets.mjs","names":["SECRET_VALUE_PATTERNS: readonly RegExp[]"],"sources":["../src/scrub-secrets.ts"],"sourcesContent":["/**\n * Replace common credential patterns in free-form text with `[REDACTED]`.\n *\n * Used before persisting or transmitting user-supplied text (telemetry\n * excerpts, eval report HTML, free-form feedback) where keys/tokens\n * accidentally pasted into prompts or command lines could otherwise leak\n * downstream.\n *\n * Conservative by design: matches well-known prefixed tokens, explicit\n * `key=value` pairs, and quoted JSON/JS-object fields with sensitive\n * names. We don't attempt to redact arbitrary long opaque strings — false\n * positives on file paths, IDs, or base64 payloads would make the output\n * unreadable.\n */\nexport const SECRET_KEYS =\n\t'password|passwd|secret|credentials?|api[_-]?key|authorization|access[_-]?token|refresh[_-]?token|id[_-]?token|session[_-]?token|auth[_-]?token';\n\nexport const SECRET_VALUE_PATTERNS: readonly RegExp[] = [\n\t// PEM private-key blocks (RSA/EC/DSA/OpenSSH/PGP). Whole block, multiline.\n\t/-----BEGIN (?:RSA |EC |DSA |OPENSSH |PGP )?PRIVATE KEY-----[\\s\\S]*?-----END (?:RSA |EC |DSA |OPENSSH |PGP )?PRIVATE KEY-----/g,\n\t// JWTs: `eyJ<header>.eyJ<payload>.<signature>` (both leading segments are\n\t// base64url of a `{\"` object, which makes this highly distinctive).\n\t/\\beyJ[A-Za-z0-9_-]+\\.eyJ[A-Za-z0-9_-]+\\.[A-Za-z0-9_-]+/g,\n\t// Authorization-header substrings: `Bearer <token>`, `Basic <token>`, `Token <token>`\n\t/\\b(?:Bearer|Basic|Token)\\s+[A-Za-z0-9._~+/=-]{12,}/gi,\n\t// OpenAI / Anthropic API keys\n\t/\\bsk-(?:ant-|proj-)?[A-Za-z0-9_-]{16,}/g,\n\t// Stripe secret/restricted/publishable keys (`sk_live_…`, `rk_test_…`, …)\n\t/\\b(?:sk|rk|pk)_(?:live|test)_[A-Za-z0-9]{16,}/g,\n\t// Google API keys\n\t/\\bAIza[0-9A-Za-z_-]{35}\\b/g,\n\t// Slack tokens (xoxb, xoxp, xoxa, xoxr, xoxs, xoxo)\n\t/\\bxox[abprso]-[A-Za-z0-9-]{10,}/g,\n\t// GitHub tokens (ghp, ghs, gho, ghr, ghu)\n\t/\\bgh[psoru]_[A-Za-z0-9]{20,}/g,\n\t// GitHub fine-grained personal access tokens\n\t/\\bgithub_pat_[A-Za-z0-9_]{22,}/g,\n\t// AWS access key id\n\t/\\bAKIA[0-9A-Z]{16}\\b/g,\n\t// Telegram bot token (`<bot id>:<35-char secret>`, also inside `/bot…/` URLs)\n\t/\\b(?:bot)?\\d{8,10}:[A-Za-z0-9_-]{35}\\b/g,\n\t// Credentials embedded in a URL: `scheme://user:password@` — redact the userinfo.\n\t/(?<=:\\/\\/)[^\\s:/@]+:[^\\s:/@]+(?=@)/g,\n\t// JSON-shaped `\"key\": \"value\"` — matches the quoted field as a whole.\n\t// Run before the loose pattern so nested objects like\n\t// `{\"credentials\": {\"apiKey\": \"...\"}}` don't have the outer key consume\n\t// the inner key on its way to a non-quoted (object) value. The value\n\t// body uses the unrolled JSON-string idiom `(?:[^\"\\\\\\r\\n]|\\\\.)*`: the\n\t// negated class excludes the backslash so a backslash can only be consumed\n\t// by the `\\\\.` escape branch. Keep the two alternatives disjoint (don't\n\t// fold `\\\\` back into the negated class) — that keeps every run of\n\t// backslashes to a single, unambiguous parse, so matching stays fast on any\n\t// input. An escaped quote inside the value (`\"abc\\\"def\"`) still doesn't end\n\t// the match early, via the escape branch. The negative lookahead skips\n\t// values that are already a `[redacted]` / `[REDACTED]` / typed\n\t// `[REDACTED:<type>:<index>]` placeholder so this stays idempotent when\n\t// chained behind upstream object-walking redaction (langsmith trace\n\t// payloads, mcp-browser markers).\n\tnew RegExp(\n\t\t`\"(?:${SECRET_KEYS})\"\\\\s*:\\\\s*\"(?!\\\\[(?:redacted|REDACTED)(?::[^\"\\\\]]*)?\\\\]\")(?:[^\"\\\\\\\\\\\\r\\\\n]|\\\\\\\\.)*\"`,\n\t\t'gi',\n\t),\n\t// JS-object-shaped `'key': 'value'`\n\tnew RegExp(\n\t\t`'(?:${SECRET_KEYS})'\\\\s*:\\\\s*'(?!\\\\[(?:redacted|REDACTED)(?::[^'\\\\]]*)?\\\\]')(?:[^'\\\\\\\\\\\\r\\\\n]|\\\\\\\\.)*'`,\n\t\t'gi',\n\t),\n\t// Generic `password=...` / `api_key=...` / `secret=...` style assignments.\n\t// The negative lookbehind skips a keyword sitting at the `<type>` position of\n\t// an upstream `[REDACTED:<type>:<index>]` marker (e.g. mcp-browser output), so\n\t// the `secret:1]` tail isn't re-matched into a nested `[REDACTED:[REDACTED]`.\n\t// Checking only the `[REDACTED:` prefix suffices: inside a marker a keyword can\n\t// only start a `\\b` match right after that prefix — every other keyword-shaped\n\t// substring is preceded by `_` (snake_case type slug) or a digit, so no word\n\t// boundary opens there. The value lookahead skips values that are already a\n\t// redaction placeholder (bracketed, typed, or URL-safe bare form) — the same\n\t// idempotency convention as the quoted forms.\n\tnew RegExp(\n\t\t`(?<!\\\\[(?:redacted|REDACTED):)\\\\b(?:${SECRET_KEYS})\\\\s*[:=]\\\\s*(?!\\\\[?(?:redacted|REDACTED)\\\\b)\\\\S+`,\n\t\t'gi',\n\t),\n];\n\nexport function scrubSecretsInText(input: string): string {\n\tlet out = input;\n\tfor (const pattern of SECRET_VALUE_PATTERNS) {\n\t\tout = out.replace(pattern, '[REDACTED]');\n\t}\n\treturn out;\n}\n"],"mappings":";;;;;;;;;;;;;;;AAcA,MAAa,cACZ;AAED,MAAaA,wBAA2C;CAEvD;CAGA;CAEA;CAEA;CAEA;CAEA;CAEA;CAEA;CAEA;CAEA;CAEA;CAEA;CAgBA,IAAI,OACH,OAAO,YAAY,uFACnB,KACA;CAED,IAAI,OACH,OAAO,YAAY,uFACnB,KACA;CAWD,IAAI,OACH,uCAAuC,YAAY,oDACnD,KACA;CACD;AAED,SAAgB,mBAAmB,OAAuB;CACzD,IAAI,MAAM;AACV,MAAK,MAAM,WAAW,sBACrB,OAAM,IAAI,QAAQ,SAAS,aAAa;AAEzC,QAAO"}

package/dist/search/re-rank-search-results.cjs

@@ -1,3 +1,20 @@
-const require_re_rank_search_results = require('../re-rank-search-results.cjs');
 
-exports.reRankSearchResults = require_re_rank_search_results.reRankSearchResults;
+//#region src/search/re-rank-search-results.ts
+function reRankSearchResults(searchResults, additionalFactors) {
+	return searchResults.map(({ score, item }) => {
+		return {
+			score: score + Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {
+				const factorScore = factorScores[item.key];
+				if (factorScore) return acc + factorScore;
+				return acc;
+			}, 0),
+			item
+		};
+	}).sort((a, b) => {
+		return b.score - a.score;
+	});
+}
+
+//#endregion
+exports.reRankSearchResults = reRankSearchResults;
+//# sourceMappingURL=re-rank-search-results.cjs.map

package/dist/search/re-rank-search-results.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"re-rank-search-results.cjs","names":[],"sources":["../../src/search/re-rank-search-results.ts"],"sourcesContent":["export function reRankSearchResults<T extends { key: string }>(\n\tsearchResults: Array<{ score: number; item: T }>,\n\tadditionalFactors: Record<string, Record<string, number>>,\n): Array<{ score: number; item: T }> {\n\treturn searchResults\n\t\t.map(({ score, item }) => {\n\t\t\t// For each additional factor, we check if it exists for the item and type,\n\t\t\t// and if so, we add the score to the item's score.\n\t\t\tconst additionalScore = Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {\n\t\t\t\tconst factorScore = factorScores[item.key];\n\t\t\t\tif (factorScore) {\n\t\t\t\t\treturn acc + factorScore;\n\t\t\t\t}\n\n\t\t\t\treturn acc;\n\t\t\t}, 0);\n\n\t\t\treturn {\n\t\t\t\tscore: score + additionalScore,\n\t\t\t\titem,\n\t\t\t};\n\t\t})\n\t\t.sort((a, b) => {\n\t\t\treturn b.score - a.score;\n\t\t});\n}\n"],"mappings":";;AAAA,SAAgB,oBACf,eACA,mBACoC;AACpC,QAAO,cACL,KAAK,EAAE,OAAO,WAAW;AAYzB,SAAO;GACN,OAAO,QAVgB,OAAO,QAAQ,kBAAkB,CAAC,QAAQ,KAAK,CAAC,GAAG,kBAAkB;IAC5F,MAAM,cAAc,aAAa,KAAK;AACtC,QAAI,YACH,QAAO,MAAM;AAGd,WAAO;MACL,EAAE;GAIJ;GACA;GACA,CACD,MAAM,GAAG,MAAM;AACf,SAAO,EAAE,QAAQ,EAAE;GAClB"}

package/dist/search/re-rank-search-results.d.cts

@@ -1,2 +1,13 @@
-import { t as reRankSearchResults } from "../re-rank-search-results.cjs";
-export { reRankSearchResults };
+//#region src/search/re-rank-search-results.d.ts
+declare function reRankSearchResults<T extends {
+  key: string;
+}>(searchResults: Array<{
+  score: number;
+  item: T;
+}>, additionalFactors: Record<string, Record<string, number>>): Array<{
+  score: number;
+  item: T;
+}>;
+//#endregion
+export { reRankSearchResults };
+//# sourceMappingURL=re-rank-search-results.d.cts.map

package/dist/search/re-rank-search-results.d.mts

@@ -1,2 +1,13 @@
-import { t as reRankSearchResults } from "../re-rank-search-results.mjs";
-export { reRankSearchResults };
+//#region src/search/re-rank-search-results.d.ts
+declare function reRankSearchResults<T extends {
+  key: string;
+}>(searchResults: Array<{
+  score: number;
+  item: T;
+}>, additionalFactors: Record<string, Record<string, number>>): Array<{
+  score: number;
+  item: T;
+}>;
+//#endregion
+export { reRankSearchResults };
+//# sourceMappingURL=re-rank-search-results.d.mts.map

package/dist/search/re-rank-search-results.mjs

@@ -1,3 +1,19 @@
-import { t as reRankSearchResults } from "../re-rank-search-results.mjs";
+//#region src/search/re-rank-search-results.ts
+function reRankSearchResults(searchResults, additionalFactors) {
+	return searchResults.map(({ score, item }) => {
+		return {
+			score: score + Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {
+				const factorScore = factorScores[item.key];
+				if (factorScore) return acc + factorScore;
+				return acc;
+			}, 0),
+			item
+		};
+	}).sort((a, b) => {
+		return b.score - a.score;
+	});
+}
 
-export { reRankSearchResults };
+//#endregion
+export { reRankSearchResults };
+//# sourceMappingURL=re-rank-search-results.mjs.map

package/dist/search/re-rank-search-results.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"re-rank-search-results.mjs","names":[],"sources":["../../src/search/re-rank-search-results.ts"],"sourcesContent":["export function reRankSearchResults<T extends { key: string }>(\n\tsearchResults: Array<{ score: number; item: T }>,\n\tadditionalFactors: Record<string, Record<string, number>>,\n): Array<{ score: number; item: T }> {\n\treturn searchResults\n\t\t.map(({ score, item }) => {\n\t\t\t// For each additional factor, we check if it exists for the item and type,\n\t\t\t// and if so, we add the score to the item's score.\n\t\t\tconst additionalScore = Object.entries(additionalFactors).reduce((acc, [_, factorScores]) => {\n\t\t\t\tconst factorScore = factorScores[item.key];\n\t\t\t\tif (factorScore) {\n\t\t\t\t\treturn acc + factorScore;\n\t\t\t\t}\n\n\t\t\t\treturn acc;\n\t\t\t}, 0);\n\n\t\t\treturn {\n\t\t\t\tscore: score + additionalScore,\n\t\t\t\titem,\n\t\t\t};\n\t\t})\n\t\t.sort((a, b) => {\n\t\t\treturn b.score - a.score;\n\t\t});\n}\n"],"mappings":";AAAA,SAAgB,oBACf,eACA,mBACoC;AACpC,QAAO,cACL,KAAK,EAAE,OAAO,WAAW;AAYzB,SAAO;GACN,OAAO,QAVgB,OAAO,QAAQ,kBAAkB,CAAC,QAAQ,KAAK,CAAC,GAAG,kBAAkB;IAC5F,MAAM,cAAc,aAAa,KAAK;AACtC,QAAI,YACH,QAAO,MAAM;AAGd,WAAO;MACL,EAAE;GAIJ;GACA;GACA,CACD,MAAM,GAAG,MAAM;AACf,SAAO,EAAE,QAAQ,EAAE;GAClB"}