@intlayer/cli 7.1.4 → 7.1.6

package/dist/esm/chokidar/dist/esm/utils/chunkJSON.mjs

@@ -1,236 +0,0 @@
-import { getChunk } from "./getChunk.mjs";
-
-//#region ../chokidar/dist/esm/utils/chunkJSON.mjs
-/**
-* Split & reassemble JSON by character budget.
-* - Measures serialized size using JSON.stringify(..).length (characters).
-* - Ensures each chunk is itself valid JSON.
-* - Very large strings are split into safe pieces using getChunk and re-concatenated on assemble.
-* - Protects against circular structures (JSON can't serialize those anyway).
-*/
-const isObject = (val) => {
-	return typeof val === "object" && val !== null && !Array.isArray(val);
-};
-const computeDjb2 = (str) => {
-	let hash = 5381;
-	for (let i = 0; i < str.length; i++) hash = (hash << 5) + hash ^ str.charCodeAt(i);
-	return (hash >>> 0).toString(16).padStart(8, "0");
-};
-const setAtPath = (root, path, value) => {
-	let current = root;
-	for (let i = 0; i < path.length - 1; i++) {
-		const key = path[i];
-		const isNextIndex = typeof path[i + 1] === "number";
-		if (typeof key === "number") {
-			if (!Array.isArray(current)) throw new Error(`Expected array at path segment ${i}`);
-			if (current[key] === void 0) current[key] = isNextIndex ? [] : {};
-			current = current[key];
-		} else {
-			if (!isObject(current)) throw new Error(`Expected object at path segment ${i}`);
-			if (!(key in current)) current[key] = isNextIndex ? [] : {};
-			current = current[key];
-		}
-	}
-	const last = path[path.length - 1];
-	if (typeof last === "number") {
-		if (!Array.isArray(current)) throw new Error(`Expected array at final segment`);
-		current[last] = value;
-	} else {
-		if (!isObject(current)) throw new Error(`Expected object at final segment`);
-		current[last] = value;
-	}
-};
-/**
-* Split a string into parts using getChunk with a charLength budget per part.
-*/
-const splitStringByBudget = (str, maxCharsPerPart) => {
-	if (maxCharsPerPart <= 0) throw new Error("maxChars must be > 0");
-	const output = [];
-	let offset = 0;
-	while (offset < str.length) {
-		const part = getChunk(str, {
-			charStart: offset,
-			charLength: maxCharsPerPart
-		});
-		if (!part) break;
-		output.push(part);
-		offset += part.length;
-	}
-	return output;
-};
-/**
-* Flatten JSON into patches (leaf writes). Strings too large to fit in a single
-* chunk are yielded as multiple str-append patches.
-*/
-const flattenToPatches = (value, maxCharsPerChunk, path = [], seen = /* @__PURE__ */ new WeakSet()) => {
-	const maxStringPiece = Math.max(1, Math.floor((maxCharsPerChunk - 400) * .8));
-	const patches = [];
-	const walk = (currentValue, currentPath) => {
-		if (typeof currentValue === "string") {
-			const testPatch = {
-				op: "set",
-				path: currentPath,
-				value: currentValue
-			};
-			if (JSON.stringify(testPatch).length + 150 <= maxCharsPerChunk) {
-				patches.push(testPatch);
-				return;
-			}
-			const parts = splitStringByBudget(currentValue, maxStringPiece);
-			patches.push({
-				op: "set",
-				path: [...currentPath, "__splittedType"],
-				value: "string"
-			});
-			patches.push({
-				op: "set",
-				path: [...currentPath, "__total"],
-				value: parts.length
-			});
-			for (let i = 0; i < parts.length; i++) patches.push({
-				op: "set",
-				path: [...currentPath, String(i + 1)],
-				value: parts[i]
-			});
-			return;
-		}
-		if (currentValue === null || typeof currentValue !== "object") {
-			patches.push({
-				op: "set",
-				path: currentPath,
-				value: currentValue
-			});
-			return;
-		}
-		if (seen.has(currentValue)) throw new Error("Cannot serialize circular structures to JSON.");
-		seen.add(currentValue);
-		if (Array.isArray(currentValue)) for (let i = 0; i < currentValue.length; i++) walk(currentValue[i], [...currentPath, i]);
-		else for (const key of Object.keys(currentValue)) walk(currentValue[key], [...currentPath, key]);
-		seen.delete(currentValue);
-	};
-	walk(value, path);
-	return patches;
-};
-/**
-* Split JSON into chunks constrained by character count of serialized chunk.
-*/
-const chunkJSON = (value, maxChars) => {
-	if (!isObject(value) && !Array.isArray(value)) throw new Error("Root must be an object or array.");
-	if (maxChars < 500) throw new Error("maxChars is too small. Use at least 500 characters.");
-	const rootType = Array.isArray(value) ? "array" : "object";
-	let sourceString;
-	try {
-		sourceString = JSON.stringify(value);
-	} catch {
-		throw new Error("Cannot serialize circular structures to JSON.");
-	}
-	const checksum = computeDjb2(sourceString);
-	const allPatches = flattenToPatches(value, maxChars);
-	const chunks = [];
-	let currentChunk = {
-		schemaVersion: 1,
-		index: 0,
-		total: 0,
-		rootType,
-		checksum,
-		entries: []
-	};
-	const emptyEnvelopeSize = JSON.stringify({
-		...currentChunk,
-		entries: []
-	}).length;
-	const tryFlush = () => {
-		if (currentChunk.entries.length > 0) {
-			chunks.push(currentChunk);
-			currentChunk = {
-				schemaVersion: 1,
-				index: 0,
-				total: 0,
-				rootType,
-				checksum,
-				entries: []
-			};
-		}
-	};
-	for (const patch of allPatches) if (emptyEnvelopeSize + JSON.stringify(currentChunk.entries).length + (currentChunk.entries.length ? 1 : 0) + JSON.stringify(patch).length <= maxChars) currentChunk.entries.push(patch);
-	else {
-		if (currentChunk.entries.length > 0) tryFlush();
-		if (emptyEnvelopeSize + JSON.stringify([patch]).length > maxChars) throw new Error("A single entry exceeds maxChars and cannot be split. Reduce entry size or increase maxChars.");
-		currentChunk.entries.push(patch);
-	}
-	tryFlush();
-	if (chunks.length === 0) chunks.push({
-		schemaVersion: 1,
-		index: 0,
-		total: 0,
-		rootType,
-		checksum,
-		entries: []
-	});
-	const totalChunks = chunks.length;
-	chunks.forEach((chunk, index) => {
-		chunk.index = index;
-		chunk.total = totalChunks;
-	});
-	return chunks;
-};
-/**
-* Reassemble JSON from chunks.
-* - Validates checksums and indices.
-* - Applies 'set' patches and merges string pieces from 'str-append'.
-*/
-/**
-* Reconstruct content from a single chunk without validation.
-* Useful for processing individual chunks in a pipeline where you don't have all chunks yet.
-* Note: This will only reconstruct the partial content contained in this chunk.
-*/
-const reconstructFromSingleChunk = (chunk) => {
-	const root = chunk.rootType === "array" ? [] : {};
-	for (const entry of chunk.entries) if (entry.op === "set") setAtPath(root, entry.path, entry.value);
-	const reconcileSplitNodes = (node) => {
-		if (node === null || typeof node !== "object") return node;
-		if (Array.isArray(node)) {
-			for (let i = 0; i < node.length; i++) node[i] = reconcileSplitNodes(node[i]);
-			return node;
-		}
-		if (node["__splittedType"] === "string") {
-			const total = node["__total"];
-			if (typeof total !== "number" || total <= 0) return node;
-			const parts = [];
-			let hasAllParts = true;
-			for (let i = 1; i <= total; i++) {
-				const piece = node[String(i)];
-				if (typeof piece !== "string") {
-					hasAllParts = false;
-					break;
-				}
-				parts.push(piece);
-			}
-			if (hasAllParts) return parts.join("");
-			return node;
-		}
-		if (node["__splittedType"] === "array") {
-			const total = node["__total"];
-			if (typeof total !== "number" || total < 0) return node;
-			const output = [];
-			let hasAllParts = true;
-			for (let i = 1; i <= total; i++) {
-				const slice = node[String(i)];
-				if (!Array.isArray(slice)) {
-					hasAllParts = false;
-					break;
-				}
-				for (let j = 0; j < slice.length; j++) output.push(reconcileSplitNodes(slice[j]));
-			}
-			if (hasAllParts) return output;
-			return node;
-		}
-		for (const key of Object.keys(node)) node[key] = reconcileSplitNodes(node[key]);
-		return node;
-	};
-	return reconcileSplitNodes(root);
-};
-
-//#endregion
-export { chunkJSON, reconstructFromSingleChunk };
-//# sourceMappingURL=chunkJSON.mjs.map

package/dist/esm/chokidar/dist/esm/utils/chunkJSON.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"chunkJSON.mjs","names":[],"sources":["../../../../../../../chokidar/dist/esm/utils/chunkJSON.mjs"],"sourcesContent":["import { getChunk } from \"./getChunk.mjs\";\n\n//#region src/utils/chunkJSON.ts\n/**\n* Split & reassemble JSON by character budget.\n* - Measures serialized size using JSON.stringify(..).length (characters).\n* - Ensures each chunk is itself valid JSON.\n* - Very large strings are split into safe pieces using getChunk and re-concatenated on assemble.\n* - Protects against circular structures (JSON can't serialize those anyway).\n*/\nconst isObject = (val) => {\n\treturn typeof val === \"object\" && val !== null && !Array.isArray(val);\n};\nconst computeDjb2 = (str) => {\n\tlet hash = 5381;\n\tfor (let i = 0; i < str.length; i++) hash = (hash << 5) + hash ^ str.charCodeAt(i);\n\treturn (hash >>> 0).toString(16).padStart(8, \"0\");\n};\nconst setAtPath = (root, path, value) => {\n\tlet current = root;\n\tfor (let i = 0; i < path.length - 1; i++) {\n\t\tconst key = path[i];\n\t\tconst isNextIndex = typeof path[i + 1] === \"number\";\n\t\tif (typeof key === \"number\") {\n\t\t\tif (!Array.isArray(current)) throw new Error(`Expected array at path segment ${i}`);\n\t\t\tif (current[key] === void 0) current[key] = isNextIndex ? [] : {};\n\t\t\tcurrent = current[key];\n\t\t} else {\n\t\t\tif (!isObject(current)) throw new Error(`Expected object at path segment ${i}`);\n\t\t\tif (!(key in current)) current[key] = isNextIndex ? [] : {};\n\t\t\tcurrent = current[key];\n\t\t}\n\t}\n\tconst last = path[path.length - 1];\n\tif (typeof last === \"number\") {\n\t\tif (!Array.isArray(current)) throw new Error(`Expected array at final segment`);\n\t\tcurrent[last] = value;\n\t} else {\n\t\tif (!isObject(current)) throw new Error(`Expected object at final segment`);\n\t\tcurrent[last] = value;\n\t}\n};\nconst pathKey = (path) => {\n\treturn JSON.stringify(path);\n};\n/**\n* Split a string into parts using getChunk with a charLength budget per part.\n*/\nconst splitStringByBudget = (str, maxCharsPerPart) => {\n\tif (maxCharsPerPart <= 0) throw new Error(\"maxChars must be > 0\");\n\tconst output = [];\n\tlet offset = 0;\n\twhile (offset < str.length) {\n\t\tconst part = getChunk(str, {\n\t\t\tcharStart: offset,\n\t\t\tcharLength: maxCharsPerPart\n\t\t});\n\t\tif (!part) break;\n\t\toutput.push(part);\n\t\toffset += part.length;\n\t}\n\treturn output;\n};\n/**\n* Flatten JSON into patches (leaf writes). Strings too large to fit in a single\n* chunk are yielded as multiple str-append patches.\n*/\nconst flattenToPatches = (value, maxCharsPerChunk, path = [], seen = /* @__PURE__ */ new WeakSet()) => {\n\tconst maxStringPiece = Math.max(1, Math.floor((maxCharsPerChunk - 400) * .8));\n\tconst patches = [];\n\tconst walk = (currentValue, currentPath) => {\n\t\tif (typeof currentValue === \"string\") {\n\t\t\tconst testPatch = {\n\t\t\t\top: \"set\",\n\t\t\t\tpath: currentPath,\n\t\t\t\tvalue: currentValue\n\t\t\t};\n\t\t\tif (JSON.stringify(testPatch).length + 150 <= maxCharsPerChunk) {\n\t\t\t\tpatches.push(testPatch);\n\t\t\t\treturn;\n\t\t\t}\n\t\t\tconst parts = splitStringByBudget(currentValue, maxStringPiece);\n\t\t\tpatches.push({\n\t\t\t\top: \"set\",\n\t\t\t\tpath: [...currentPath, \"__splittedType\"],\n\t\t\t\tvalue: \"string\"\n\t\t\t});\n\t\t\tpatches.push({\n\t\t\t\top: \"set\",\n\t\t\t\tpath: [...currentPath, \"__total\"],\n\t\t\t\tvalue: parts.length\n\t\t\t});\n\t\t\tfor (let i = 0; i < parts.length; i++) patches.push({\n\t\t\t\top: \"set\",\n\t\t\t\tpath: [...currentPath, String(i + 1)],\n\t\t\t\tvalue: parts[i]\n\t\t\t});\n\t\t\treturn;\n\t\t}\n\t\tif (currentValue === null || typeof currentValue !== \"object\") {\n\t\t\tpatches.push({\n\t\t\t\top: \"set\",\n\t\t\t\tpath: currentPath,\n\t\t\t\tvalue: currentValue\n\t\t\t});\n\t\t\treturn;\n\t\t}\n\t\tif (seen.has(currentValue)) throw new Error(\"Cannot serialize circular structures to JSON.\");\n\t\tseen.add(currentValue);\n\t\tif (Array.isArray(currentValue)) for (let i = 0; i < currentValue.length; i++) walk(currentValue[i], [...currentPath, i]);\n\t\telse for (const key of Object.keys(currentValue)) walk(currentValue[key], [...currentPath, key]);\n\t\tseen.delete(currentValue);\n\t};\n\twalk(value, path);\n\treturn patches;\n};\n/**\n* Split JSON into chunks constrained by character count of serialized chunk.\n*/\nconst chunkJSON = (value, maxChars) => {\n\tif (!isObject(value) && !Array.isArray(value)) throw new Error(\"Root must be an object or array.\");\n\tif (maxChars < 500) throw new Error(\"maxChars is too small. Use at least 500 characters.\");\n\tconst rootType = Array.isArray(value) ? \"array\" : \"object\";\n\tlet sourceString;\n\ttry {\n\t\tsourceString = JSON.stringify(value);\n\t} catch {\n\t\tthrow new Error(\"Cannot serialize circular structures to JSON.\");\n\t}\n\tconst checksum = computeDjb2(sourceString);\n\tconst allPatches = flattenToPatches(value, maxChars);\n\tconst chunks = [];\n\tlet currentChunk = {\n\t\tschemaVersion: 1,\n\t\tindex: 0,\n\t\ttotal: 0,\n\t\trootType,\n\t\tchecksum,\n\t\tentries: []\n\t};\n\tconst emptyEnvelopeSize = JSON.stringify({\n\t\t...currentChunk,\n\t\tentries: []\n\t}).length;\n\tconst tryFlush = () => {\n\t\tif (currentChunk.entries.length > 0) {\n\t\t\tchunks.push(currentChunk);\n\t\t\tcurrentChunk = {\n\t\t\t\tschemaVersion: 1,\n\t\t\t\tindex: 0,\n\t\t\t\ttotal: 0,\n\t\t\t\trootType,\n\t\t\t\tchecksum,\n\t\t\t\tentries: []\n\t\t\t};\n\t\t}\n\t};\n\tfor (const patch of allPatches) if (emptyEnvelopeSize + JSON.stringify(currentChunk.entries).length + (currentChunk.entries.length ? 1 : 0) + JSON.stringify(patch).length <= maxChars) currentChunk.entries.push(patch);\n\telse {\n\t\tif (currentChunk.entries.length > 0) tryFlush();\n\t\tif (emptyEnvelopeSize + JSON.stringify([patch]).length > maxChars) throw new Error(\"A single entry exceeds maxChars and cannot be split. Reduce entry size or increase maxChars.\");\n\t\tcurrentChunk.entries.push(patch);\n\t}\n\ttryFlush();\n\tif (chunks.length === 0) chunks.push({\n\t\tschemaVersion: 1,\n\t\tindex: 0,\n\t\ttotal: 0,\n\t\trootType,\n\t\tchecksum,\n\t\tentries: []\n\t});\n\tconst totalChunks = chunks.length;\n\tchunks.forEach((chunk, index) => {\n\t\tchunk.index = index;\n\t\tchunk.total = totalChunks;\n\t});\n\treturn chunks;\n};\n/**\n* Reassemble JSON from chunks.\n* - Validates checksums and indices.\n* - Applies 'set' patches and merges string pieces from 'str-append'.\n*/\n/**\n* Reconstruct content from a single chunk without validation.\n* Useful for processing individual chunks in a pipeline where you don't have all chunks yet.\n* Note: This will only reconstruct the partial content contained in this chunk.\n*/\nconst reconstructFromSingleChunk = (chunk) => {\n\tconst root = chunk.rootType === \"array\" ? [] : {};\n\tfor (const entry of chunk.entries) if (entry.op === \"set\") setAtPath(root, entry.path, entry.value);\n\tconst reconcileSplitNodes = (node) => {\n\t\tif (node === null || typeof node !== \"object\") return node;\n\t\tif (Array.isArray(node)) {\n\t\t\tfor (let i = 0; i < node.length; i++) node[i] = reconcileSplitNodes(node[i]);\n\t\t\treturn node;\n\t\t}\n\t\tif (node[\"__splittedType\"] === \"string\") {\n\t\t\tconst total = node[\"__total\"];\n\t\t\tif (typeof total !== \"number\" || total <= 0) return node;\n\t\t\tconst parts = [];\n\t\t\tlet hasAllParts = true;\n\t\t\tfor (let i = 1; i <= total; i++) {\n\t\t\t\tconst piece = node[String(i)];\n\t\t\t\tif (typeof piece !== \"string\") {\n\t\t\t\t\thasAllParts = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tparts.push(piece);\n\t\t\t}\n\t\t\tif (hasAllParts) return parts.join(\"\");\n\t\t\treturn node;\n\t\t}\n\t\tif (node[\"__splittedType\"] === \"array\") {\n\t\t\tconst total = node[\"__total\"];\n\t\t\tif (typeof total !== \"number\" || total < 0) return node;\n\t\t\tconst output = [];\n\t\t\tlet hasAllParts = true;\n\t\t\tfor (let i = 1; i <= total; i++) {\n\t\t\t\tconst slice = node[String(i)];\n\t\t\t\tif (!Array.isArray(slice)) {\n\t\t\t\t\thasAllParts = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t\tfor (let j = 0; j < slice.length; j++) output.push(reconcileSplitNodes(slice[j]));\n\t\t\t}\n\t\t\tif (hasAllParts) return output;\n\t\t\treturn node;\n\t\t}\n\t\tfor (const key of Object.keys(node)) node[key] = reconcileSplitNodes(node[key]);\n\t\treturn node;\n\t};\n\treturn reconcileSplitNodes(root);\n};\nconst assembleJSON = (chunks) => {\n\tif (!chunks || chunks.length === 0) throw new Error(\"No chunks provided.\");\n\tconst sorted = [...chunks].sort((a, b) => a.index - b.index);\n\tconst { checksum, rootType } = sorted[0];\n\tconst schemaVersion = 1;\n\tfor (let i = 0; i < sorted.length; i++) {\n\t\tconst chunk = sorted[i];\n\t\tif (chunk.schemaVersion !== schemaVersion) {\n\t\t\tconsole.error(\"Unsupported schemaVersion.\", {\n\t\t\t\tcause: chunk,\n\t\t\t\tschemaVersion\n\t\t\t});\n\t\t\tthrow new Error(\"Unsupported schemaVersion.\");\n\t\t}\n\t\tif (chunk.rootType !== rootType) {\n\t\t\tconsole.error(\"Chunks rootType mismatch.\", {\n\t\t\t\tcause: chunk,\n\t\t\t\trootType\n\t\t\t});\n\t\t\tthrow new Error(\"Chunks rootType mismatch.\");\n\t\t}\n\t\tif (chunk.checksum !== checksum) {\n\t\t\tconsole.error(\"Chunks checksum mismatch (different source objects?).\", {\n\t\t\t\tcause: chunk,\n\t\t\t\tchecksum\n\t\t\t});\n\t\t\tthrow new Error(\"Chunks checksum mismatch (different source objects?).\");\n\t\t}\n\t\tif (chunk.index !== i) {\n\t\t\tconsole.error(\"Chunk indices are not contiguous or sorted.\", {\n\t\t\t\tcause: chunk,\n\t\t\t\tindex: chunk.index,\n\t\t\t\ti\n\t\t\t});\n\t\t\tthrow new Error(\"Chunk indices are not contiguous or sorted.\");\n\t\t}\n\t}\n\tconst root = rootType === \"array\" ? [] : {};\n\tconst stringParts = /* @__PURE__ */ new Map();\n\tconst applySet = (patch) => setAtPath(root, patch.path, patch.value);\n\tfor (const chunk of sorted) for (const entry of chunk.entries) if (entry.op === \"set\") applySet(entry);\n\telse {\n\t\tconst key = pathKey(entry.path);\n\t\tconst record = stringParts.get(key) ?? {\n\t\t\tpath: entry.path,\n\t\t\ttotal: entry.total,\n\t\t\treceived: []\n\t\t};\n\t\tif (record.total !== entry.total) throw new Error(\"Inconsistent string part totals for a path.\");\n\t\trecord.received.push(entry);\n\t\tstringParts.set(key, record);\n\t}\n\tfor (const { path, total, received } of stringParts.values()) {\n\t\tif (received.length !== total) throw new Error(\"Missing string parts for a path; incomplete chunk set.\");\n\t\treceived.sort((a, b) => a.index - b.index);\n\t\tsetAtPath(root, path, received.map((part) => part.value).join(\"\"));\n\t}\n\tconst reconcileSplitNodes = (node) => {\n\t\tif (node === null || typeof node !== \"object\") return node;\n\t\tif (Array.isArray(node)) {\n\t\t\tfor (let i = 0; i < node.length; i++) node[i] = reconcileSplitNodes(node[i]);\n\t\t\treturn node;\n\t\t}\n\t\tif (node[\"__splittedType\"] === \"string\") {\n\t\t\tconst total = node[\"__total\"];\n\t\t\tif (typeof total !== \"number\" || total <= 0) throw new Error(\"Invalid split-node total for a path.\");\n\t\t\tconst parts = [];\n\t\t\tfor (let i = 1; i <= total; i++) {\n\t\t\t\tconst piece = node[String(i)];\n\t\t\t\tif (typeof piece !== \"string\") throw new Error(\"Missing string parts for a path; incomplete chunk set.\");\n\t\t\t\tparts.push(piece);\n\t\t\t}\n\t\t\treturn parts.join(\"\");\n\t\t}\n\t\tif (node[\"__splittedType\"] === \"array\") {\n\t\t\tconst total = node[\"__total\"];\n\t\t\tif (typeof total !== \"number\" || total < 0) throw new Error(\"Invalid split-node total for a path.\");\n\t\t\tconst output = [];\n\t\t\tfor (let i = 1; i <= total; i++) {\n\t\t\t\tconst slice = node[String(i)];\n\t\t\t\tif (!Array.isArray(slice)) throw new Error(\"Missing string parts for a path; incomplete chunk set.\");\n\t\t\t\tfor (let j = 0; j < slice.length; j++) output.push(reconcileSplitNodes(slice[j]));\n\t\t\t}\n\t\t\treturn output;\n\t\t}\n\t\tfor (const key of Object.keys(node)) node[key] = reconcileSplitNodes(node[key]);\n\t\treturn node;\n\t};\n\tconst reconciled = reconcileSplitNodes(root);\n\tfor (let i = 0; i < sorted.length; i++) {\n\t\tconst chunk = sorted[i];\n\t\tif (chunk.total !== sorted.length) throw new Error(`Chunk total does not match provided count. Expected ${sorted.length}, but chunk ${i} has total=${chunk.total}`);\n\t}\n\treturn reconciled;\n};\n\n//#endregion\nexport { assembleJSON, chunkJSON, reconstructFromSingleChunk };\n//# sourceMappingURL=chunkJSON.mjs.map"],"mappings":";;;;;;;;;;AAUA,MAAM,YAAY,QAAQ;AACzB,QAAO,OAAO,QAAQ,YAAY,QAAQ,QAAQ,CAAC,MAAM,QAAQ,IAAI;;AAEtE,MAAM,eAAe,QAAQ;CAC5B,IAAI,OAAO;AACX,MAAK,IAAI,IAAI,GAAG,IAAI,IAAI,QAAQ,IAAK,SAAQ,QAAQ,KAAK,OAAO,IAAI,WAAW,EAAE;AAClF,SAAQ,SAAS,GAAG,SAAS,GAAG,CAAC,SAAS,GAAG,IAAI;;AAElD,MAAM,aAAa,MAAM,MAAM,UAAU;CACxC,IAAI,UAAU;AACd,MAAK,IAAI,IAAI,GAAG,IAAI,KAAK,SAAS,GAAG,KAAK;EACzC,MAAM,MAAM,KAAK;EACjB,MAAM,cAAc,OAAO,KAAK,IAAI,OAAO;AAC3C,MAAI,OAAO,QAAQ,UAAU;AAC5B,OAAI,CAAC,MAAM,QAAQ,QAAQ,CAAE,OAAM,IAAI,MAAM,kCAAkC,IAAI;AACnF,OAAI,QAAQ,SAAS,KAAK,EAAG,SAAQ,OAAO,cAAc,EAAE,GAAG,EAAE;AACjE,aAAU,QAAQ;SACZ;AACN,OAAI,CAAC,SAAS,QAAQ,CAAE,OAAM,IAAI,MAAM,mCAAmC,IAAI;AAC/E,OAAI,EAAE,OAAO,SAAU,SAAQ,OAAO,cAAc,EAAE,GAAG,EAAE;AAC3D,aAAU,QAAQ;;;CAGpB,MAAM,OAAO,KAAK,KAAK,SAAS;AAChC,KAAI,OAAO,SAAS,UAAU;AAC7B,MAAI,CAAC,MAAM,QAAQ,QAAQ,CAAE,OAAM,IAAI,MAAM,kCAAkC;AAC/E,UAAQ,QAAQ;QACV;AACN,MAAI,CAAC,SAAS,QAAQ,CAAE,OAAM,IAAI,MAAM,mCAAmC;AAC3E,UAAQ,QAAQ;;;;;;AASlB,MAAM,uBAAuB,KAAK,oBAAoB;AACrD,KAAI,mBAAmB,EAAG,OAAM,IAAI,MAAM,uBAAuB;CACjE,MAAM,SAAS,EAAE;CACjB,IAAI,SAAS;AACb,QAAO,SAAS,IAAI,QAAQ;EAC3B,MAAM,OAAO,SAAS,KAAK;GAC1B,WAAW;GACX,YAAY;GACZ,CAAC;AACF,MAAI,CAAC,KAAM;AACX,SAAO,KAAK,KAAK;AACjB,YAAU,KAAK;;AAEhB,QAAO;;;;;;AAMR,MAAM,oBAAoB,OAAO,kBAAkB,OAAO,EAAE,EAAE,uBAAuB,IAAI,SAAS,KAAK;CACtG,MAAM,iBAAiB,KAAK,IAAI,GAAG,KAAK,OAAO,mBAAmB,OAAO,GAAG,CAAC;CAC7E,MAAM,UAAU,EAAE;CAClB,MAAM,QAAQ,cAAc,gBAAgB;AAC3C,MAAI,OAAO,iBAAiB,UAAU;GACrC,MAAM,YAAY;IACjB,IAAI;IACJ,MAAM;IACN,OAAO;IACP;AACD,OAAI,KAAK,UAAU,UAAU,CAAC,SAAS,OAAO,kBAAkB;AAC/D,YAAQ,KAAK,UAAU;AACvB;;GAED,MAAM,QAAQ,oBAAoB,cAAc,eAAe;AAC/D,WAAQ,KAAK;IACZ,IAAI;IACJ,MAAM,CAAC,GAAG,aAAa,iBAAiB;IACxC,OAAO;IACP,CAAC;AACF,WAAQ,KAAK;IACZ,IAAI;IACJ,MAAM,CAAC,GAAG,aAAa,UAAU;IACjC,OAAO,MAAM;IACb,CAAC;AACF,QAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAAK,SAAQ,KAAK;IACnD,IAAI;IACJ,MAAM,CAAC,GAAG,aAAa,OAAO,IAAI,EAAE,CAAC;IACrC,OAAO,MAAM;IACb,CAAC;AACF;;AAED,MAAI,iBAAiB,QAAQ,OAAO,iBAAiB,UAAU;AAC9D,WAAQ,KAAK;IACZ,IAAI;IACJ,MAAM;IACN,OAAO;IACP,CAAC;AACF;;AAED,MAAI,KAAK,IAAI,aAAa,CAAE,OAAM,IAAI,MAAM,gDAAgD;AAC5F,OAAK,IAAI,aAAa;AACtB,MAAI,MAAM,QAAQ,aAAa,CAAE,MAAK,IAAI,IAAI,GAAG,IAAI,aAAa,QAAQ,IAAK,MAAK,aAAa,IAAI,CAAC,GAAG,aAAa,EAAE,CAAC;MACpH,MAAK,MAAM,OAAO,OAAO,KAAK,aAAa,CAAE,MAAK,aAAa,MAAM,CAAC,GAAG,aAAa,IAAI,CAAC;AAChG,OAAK,OAAO,aAAa;;AAE1B,MAAK,OAAO,KAAK;AACjB,QAAO;;;;;AAKR,MAAM,aAAa,OAAO,aAAa;AACtC,KAAI,CAAC,SAAS,MAAM,IAAI,CAAC,MAAM,QAAQ,MAAM,CAAE,OAAM,IAAI,MAAM,mCAAmC;AAClG,KAAI,WAAW,IAAK,OAAM,IAAI,MAAM,sDAAsD;CAC1F,MAAM,WAAW,MAAM,QAAQ,MAAM,GAAG,UAAU;CAClD,IAAI;AACJ,KAAI;AACH,iBAAe,KAAK,UAAU,MAAM;SAC7B;AACP,QAAM,IAAI,MAAM,gDAAgD;;CAEjE,MAAM,WAAW,YAAY,aAAa;CAC1C,MAAM,aAAa,iBAAiB,OAAO,SAAS;CACpD,MAAM,SAAS,EAAE;CACjB,IAAI,eAAe;EAClB,eAAe;EACf,OAAO;EACP,OAAO;EACP;EACA;EACA,SAAS,EAAE;EACX;CACD,MAAM,oBAAoB,KAAK,UAAU;EACxC,GAAG;EACH,SAAS,EAAE;EACX,CAAC,CAAC;CACH,MAAM,iBAAiB;AACtB,MAAI,aAAa,QAAQ,SAAS,GAAG;AACpC,UAAO,KAAK,aAAa;AACzB,kBAAe;IACd,eAAe;IACf,OAAO;IACP,OAAO;IACP;IACA;IACA,SAAS,EAAE;IACX;;;AAGH,MAAK,MAAM,SAAS,WAAY,KAAI,oBAAoB,KAAK,UAAU,aAAa,QAAQ,CAAC,UAAU,aAAa,QAAQ,SAAS,IAAI,KAAK,KAAK,UAAU,MAAM,CAAC,UAAU,SAAU,cAAa,QAAQ,KAAK,MAAM;MACnN;AACJ,MAAI,aAAa,QAAQ,SAAS,EAAG,WAAU;AAC/C,MAAI,oBAAoB,KAAK,UAAU,CAAC,MAAM,CAAC,CAAC,SAAS,SAAU,OAAM,IAAI,MAAM,+FAA+F;AAClL,eAAa,QAAQ,KAAK,MAAM;;AAEjC,WAAU;AACV,KAAI,OAAO,WAAW,EAAG,QAAO,KAAK;EACpC,eAAe;EACf,OAAO;EACP,OAAO;EACP;EACA;EACA,SAAS,EAAE;EACX,CAAC;CACF,MAAM,cAAc,OAAO;AAC3B,QAAO,SAAS,OAAO,UAAU;AAChC,QAAM,QAAQ;AACd,QAAM,QAAQ;GACb;AACF,QAAO;;;;;;;;;;;;AAYR,MAAM,8BAA8B,UAAU;CAC7C,MAAM,OAAO,MAAM,aAAa,UAAU,EAAE,GAAG,EAAE;AACjD,MAAK,MAAM,SAAS,MAAM,QAAS,KAAI,MAAM,OAAO,MAAO,WAAU,MAAM,MAAM,MAAM,MAAM,MAAM;CACnG,MAAM,uBAAuB,SAAS;AACrC,MAAI,SAAS,QAAQ,OAAO,SAAS,SAAU,QAAO;AACtD,MAAI,MAAM,QAAQ,KAAK,EAAE;AACxB,QAAK,IAAI,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAK,MAAK,KAAK,oBAAoB,KAAK,GAAG;AAC5E,UAAO;;AAER,MAAI,KAAK,sBAAsB,UAAU;GACxC,MAAM,QAAQ,KAAK;AACnB,OAAI,OAAO,UAAU,YAAY,SAAS,EAAG,QAAO;GACpD,MAAM,QAAQ,EAAE;GAChB,IAAI,cAAc;AAClB,QAAK,IAAI,IAAI,GAAG,KAAK,OAAO,KAAK;IAChC,MAAM,QAAQ,KAAK,OAAO,EAAE;AAC5B,QAAI,OAAO,UAAU,UAAU;AAC9B,mBAAc;AACd;;AAED,UAAM,KAAK,MAAM;;AAElB,OAAI,YAAa,QAAO,MAAM,KAAK,GAAG;AACtC,UAAO;;AAER,MAAI,KAAK,sBAAsB,SAAS;GACvC,MAAM,QAAQ,KAAK;AACnB,OAAI,OAAO,UAAU,YAAY,QAAQ,EAAG,QAAO;GACnD,MAAM,SAAS,EAAE;GACjB,IAAI,cAAc;AAClB,QAAK,IAAI,IAAI,GAAG,KAAK,OAAO,KAAK;IAChC,MAAM,QAAQ,KAAK,OAAO,EAAE;AAC5B,QAAI,CAAC,MAAM,QAAQ,MAAM,EAAE;AAC1B,mBAAc;AACd;;AAED,SAAK,IAAI,IAAI,GAAG,IAAI,MAAM,QAAQ,IAAK,QAAO,KAAK,oBAAoB,MAAM,GAAG,CAAC;;AAElF,OAAI,YAAa,QAAO;AACxB,UAAO;;AAER,OAAK,MAAM,OAAO,OAAO,KAAK,KAAK,CAAE,MAAK,OAAO,oBAAoB,KAAK,KAAK;AAC/E,SAAO;;AAER,QAAO,oBAAoB,KAAK"}

package/dist/esm/chokidar/dist/esm/utils/formatter.mjs

@@ -1,13 +0,0 @@
-import { built_default } from "../config/dist/esm/built.mjs";
-import { getLocaleName } from "../core/dist/esm/localization/getLocaleName.mjs";
-import { locales_exports } from "../types/dist/esm/locales.mjs";
-import { relative } from "node:path";
-import { ANSIColors, colorize, colorizePath } from "@intlayer/config";
-
-//#region ../chokidar/dist/esm/utils/formatter.mjs
-const formatPath = (path, color) => [path].flat().map((path$1) => path$1.startsWith("/") ? relative(built_default.content.baseDir, path$1) : path$1).map((relativePath) => color === false ? relativePath : colorizePath(relativePath, color)).join(`, `);
-const formatLocale = (locale, color = ANSIColors.GREEN) => [locale].flat().map((locale$1) => `${getLocaleName(locale$1, locales_exports.ENGLISH)} (${locale$1})`).map((text) => color === false ? text : colorize(text, color)).join(`, `);
-
-//#endregion
-export { formatLocale, formatPath };
-//# sourceMappingURL=formatter.mjs.map

package/dist/esm/chokidar/dist/esm/utils/formatter.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"formatter.mjs","names":[],"sources":["../../../../../../../chokidar/dist/esm/utils/formatter.mjs"],"sourcesContent":["import { built_default } from \"../config/dist/esm/built.mjs\";\nimport { getLocaleName } from \"../core/dist/esm/localization/getLocaleName.mjs\";\nimport { locales_exports } from \"../types/dist/esm/locales.mjs\";\nimport { relative } from \"node:path\";\nimport { ANSIColors, colorize, colorizePath } from \"@intlayer/config\";\n\n//#region src/utils/formatter.ts\nconst formatPath = (path, color) => [path].flat().map((path$1) => path$1.startsWith(\"/\") ? relative(built_default.content.baseDir, path$1) : path$1).map((relativePath) => color === false ? relativePath : colorizePath(relativePath, color)).join(`, `);\nconst formatLocale = (locale, color = ANSIColors.GREEN) => [locale].flat().map((locale$1) => `${getLocaleName(locale$1, locales_exports.ENGLISH)} (${locale$1})`).map((text) => color === false ? text : colorize(text, color)).join(`, `);\n\n//#endregion\nexport { formatLocale, formatPath };\n//# sourceMappingURL=formatter.mjs.map"],"mappings":";;;;;;;AAOA,MAAM,cAAc,MAAM,UAAU,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,WAAW,OAAO,WAAW,IAAI,GAAG,SAAS,cAAc,QAAQ,SAAS,OAAO,GAAG,OAAO,CAAC,KAAK,iBAAiB,UAAU,QAAQ,eAAe,aAAa,cAAc,MAAM,CAAC,CAAC,KAAK,KAAK;AACzP,MAAM,gBAAgB,QAAQ,QAAQ,WAAW,UAAU,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,aAAa,GAAG,cAAc,UAAU,gBAAgB,QAAQ,CAAC,IAAI,SAAS,GAAG,CAAC,KAAK,SAAS,UAAU,QAAQ,OAAO,SAAS,MAAM,MAAM,CAAC,CAAC,KAAK,KAAK"}

package/dist/esm/chokidar/dist/esm/utils/getChunk.mjs

@@ -1,34 +0,0 @@
-import { splitTextByLines } from "./splitTextByLine.mjs";
-
-//#region ../chokidar/dist/esm/utils/getChunk.mjs
-const getChunk = (text, options = {}) => {
-	const { lineStart, lineLength, charStart, charLength } = options;
-	if (lineStart === void 0 && lineLength === void 0 && charStart === void 0 && charLength === void 0) return text;
-	const lines = splitTextByLines(text);
-	const getCharIndexOfLineStart = (lineNumber) => {
-		if (lineNumber <= 0) return 0;
-		let idx = 0;
-		for (let i = 0; i < Math.min(lineNumber, lines.length); i++) idx += lines[i].length;
-		return idx;
-	};
-	const getCharIndexOfLineEnd = (lineNumber) => {
-		if (lineNumber >= lines.length) return text.length;
-		const line = lines[lineNumber];
-		return getCharIndexOfLineStart(lineNumber) + line.length;
-	};
-	let effectiveStart = 0;
-	let effectiveEnd = text.length;
-	if (lineStart !== void 0) effectiveStart = Math.max(effectiveStart, getCharIndexOfLineStart(lineStart));
-	if (charStart !== void 0) effectiveStart = Math.max(effectiveStart, charStart);
-	if (lineLength !== void 0) {
-		const endLine = (lineStart ?? 0) + lineLength - 1;
-		effectiveEnd = Math.min(effectiveEnd, getCharIndexOfLineEnd(endLine));
-	}
-	if (charLength !== void 0) effectiveEnd = Math.min(effectiveEnd, (charStart ?? effectiveStart) + charLength);
-	if (effectiveStart >= effectiveEnd) return "";
-	return text.slice(effectiveStart, effectiveEnd);
-};
-
-//#endregion
-export { getChunk };
-//# sourceMappingURL=getChunk.mjs.map

package/dist/esm/chokidar/dist/esm/utils/getChunk.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"getChunk.mjs","names":[],"sources":["../../../../../../../chokidar/dist/esm/utils/getChunk.mjs"],"sourcesContent":["import { splitTextByLines } from \"./splitTextByLine.mjs\";\n\n//#region src/utils/getChunk.ts\nconst getChunk = (text, options = {}) => {\n\tconst { lineStart, lineLength, charStart, charLength } = options;\n\tif (lineStart === void 0 && lineLength === void 0 && charStart === void 0 && charLength === void 0) return text;\n\tconst lines = splitTextByLines(text);\n\tconst getCharIndexOfLineStart = (lineNumber) => {\n\t\tif (lineNumber <= 0) return 0;\n\t\tlet idx = 0;\n\t\tfor (let i = 0; i < Math.min(lineNumber, lines.length); i++) idx += lines[i].length;\n\t\treturn idx;\n\t};\n\tconst getCharIndexOfLineEnd = (lineNumber) => {\n\t\tif (lineNumber >= lines.length) return text.length;\n\t\tconst line = lines[lineNumber];\n\t\treturn getCharIndexOfLineStart(lineNumber) + line.length;\n\t};\n\tlet effectiveStart = 0;\n\tlet effectiveEnd = text.length;\n\tif (lineStart !== void 0) effectiveStart = Math.max(effectiveStart, getCharIndexOfLineStart(lineStart));\n\tif (charStart !== void 0) effectiveStart = Math.max(effectiveStart, charStart);\n\tif (lineLength !== void 0) {\n\t\tconst endLine = (lineStart ?? 0) + lineLength - 1;\n\t\teffectiveEnd = Math.min(effectiveEnd, getCharIndexOfLineEnd(endLine));\n\t}\n\tif (charLength !== void 0) effectiveEnd = Math.min(effectiveEnd, (charStart ?? effectiveStart) + charLength);\n\tif (effectiveStart >= effectiveEnd) return \"\";\n\treturn text.slice(effectiveStart, effectiveEnd);\n};\n\n//#endregion\nexport { getChunk };\n//# sourceMappingURL=getChunk.mjs.map"],"mappings":";;;AAGA,MAAM,YAAY,MAAM,UAAU,EAAE,KAAK;CACxC,MAAM,EAAE,WAAW,YAAY,WAAW,eAAe;AACzD,KAAI,cAAc,KAAK,KAAK,eAAe,KAAK,KAAK,cAAc,KAAK,KAAK,eAAe,KAAK,EAAG,QAAO;CAC3G,MAAM,QAAQ,iBAAiB,KAAK;CACpC,MAAM,2BAA2B,eAAe;AAC/C,MAAI,cAAc,EAAG,QAAO;EAC5B,IAAI,MAAM;AACV,OAAK,IAAI,IAAI,GAAG,IAAI,KAAK,IAAI,YAAY,MAAM,OAAO,EAAE,IAAK,QAAO,MAAM,GAAG;AAC7E,SAAO;;CAER,MAAM,yBAAyB,eAAe;AAC7C,MAAI,cAAc,MAAM,OAAQ,QAAO,KAAK;EAC5C,MAAM,OAAO,MAAM;AACnB,SAAO,wBAAwB,WAAW,GAAG,KAAK;;CAEnD,IAAI,iBAAiB;CACrB,IAAI,eAAe,KAAK;AACxB,KAAI,cAAc,KAAK,EAAG,kBAAiB,KAAK,IAAI,gBAAgB,wBAAwB,UAAU,CAAC;AACvG,KAAI,cAAc,KAAK,EAAG,kBAAiB,KAAK,IAAI,gBAAgB,UAAU;AAC9E,KAAI,eAAe,KAAK,GAAG;EAC1B,MAAM,WAAW,aAAa,KAAK,aAAa;AAChD,iBAAe,KAAK,IAAI,cAAc,sBAAsB,QAAQ,CAAC;;AAEtE,KAAI,eAAe,KAAK,EAAG,gBAAe,KAAK,IAAI,eAAe,aAAa,kBAAkB,WAAW;AAC5G,KAAI,kBAAkB,aAAc,QAAO;AAC3C,QAAO,KAAK,MAAM,gBAAgB,aAAa"}

package/dist/esm/chokidar/dist/esm/utils/getFileHash.mjs

@@ -1,10 +0,0 @@
-import crypto from "crypto-js";
-
-//#region ../chokidar/dist/esm/utils/getFileHash.mjs
-const getFileHash = (filePath) => {
-	return crypto.SHA3(filePath).toString(crypto.enc.Base64).replace(/[^A-Z\d]/gi, "").substring(0, 20);
-};
-
-//#endregion
-export { getFileHash };
-//# sourceMappingURL=getFileHash.mjs.map

package/dist/esm/chokidar/dist/esm/utils/getFileHash.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"getFileHash.mjs","names":[],"sources":["../../../../../../../chokidar/dist/esm/utils/getFileHash.mjs"],"sourcesContent":["import crypto from \"crypto-js\";\n\n//#region src/utils/getFileHash.ts\nconst getFileHash = (filePath) => {\n\treturn crypto.SHA3(filePath).toString(crypto.enc.Base64).replace(/[^A-Z\\d]/gi, \"\").substring(0, 20);\n};\n\n//#endregion\nexport { getFileHash };\n//# sourceMappingURL=getFileHash.mjs.map"],"mappings":";;;AAGA,MAAM,eAAe,aAAa;AACjC,QAAO,OAAO,KAAK,SAAS,CAAC,SAAS,OAAO,IAAI,OAAO,CAAC,QAAQ,cAAc,GAAG,CAAC,UAAU,GAAG,GAAG"}

package/dist/esm/chokidar/dist/esm/utils/getFormatFromExtension.mjs

@@ -1,17 +0,0 @@
-//#region ../chokidar/dist/esm/utils/getFormatFromExtension.mjs
-const getFormatFromExtension = (extension) => {
-	switch (extension) {
-		case ".ts":
-		case ".tsx": return "ts";
-		case ".cjs":
-		case ".cjsx": return "cjs";
-		case ".mjs": return "esm";
-		case ".json":
-		case ".json5": return "json";
-	}
-	return "esm";
-};
-
-//#endregion
-export { getFormatFromExtension };
-//# sourceMappingURL=getFormatFromExtension.mjs.map

package/dist/esm/chokidar/dist/esm/utils/getFormatFromExtension.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"getFormatFromExtension.mjs","names":[],"sources":["../../../../../../../chokidar/dist/esm/utils/getFormatFromExtension.mjs"],"sourcesContent":["//#region src/utils/getFormatFromExtension.ts\nconst getFormatFromExtension = (extension) => {\n\tswitch (extension) {\n\t\tcase \".ts\":\n\t\tcase \".tsx\": return \"ts\";\n\t\tcase \".cjs\":\n\t\tcase \".cjsx\": return \"cjs\";\n\t\tcase \".mjs\": return \"esm\";\n\t\tcase \".json\":\n\t\tcase \".json5\": return \"json\";\n\t}\n\treturn \"esm\";\n};\nconst getExtensionFromFormat = (format) => {\n\tswitch (format) {\n\t\tcase \"ts\": return \".ts\";\n\t\tcase \"cjs\": return \".cjs\";\n\t\tcase \"json\": return \".json\";\n\t\tcase \"esm\": return \".mjs\";\n\t}\n\treturn \".mjs\";\n};\n\n//#endregion\nexport { getExtensionFromFormat, getFormatFromExtension };\n//# sourceMappingURL=getFormatFromExtension.mjs.map"],"mappings":";AACA,MAAM,0BAA0B,cAAc;AAC7C,SAAQ,WAAR;EACC,KAAK;EACL,KAAK,OAAQ,QAAO;EACpB,KAAK;EACL,KAAK,QAAS,QAAO;EACrB,KAAK,OAAQ,QAAO;EACpB,KAAK;EACL,KAAK,SAAU,QAAO;;AAEvB,QAAO"}

package/dist/esm/chokidar/dist/esm/utils/kebabCaseToCamelCase.mjs

@@ -1,13 +0,0 @@
-//#region ../chokidar/dist/esm/utils/kebabCaseToCamelCase.mjs
-const kebabCaseToCamelCase = (name) => {
-	return name.split(/[^a-zA-Z0-9]+/).filter(Boolean).map((word) => {
-		const lowerWord = word.toLowerCase();
-		let capitalized = lowerWord.charAt(0).toUpperCase() + lowerWord.slice(1);
-		capitalized = capitalized.replace(/(\d)([a-z])/g, (_, number, char) => number + char.toUpperCase());
-		return capitalized;
-	}).join("");
-};
-
-//#endregion
-export { kebabCaseToCamelCase };
-//# sourceMappingURL=kebabCaseToCamelCase.mjs.map

package/dist/esm/chokidar/dist/esm/utils/kebabCaseToCamelCase.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"kebabCaseToCamelCase.mjs","names":[],"sources":["../../../../../../../chokidar/dist/esm/utils/kebabCaseToCamelCase.mjs"],"sourcesContent":["//#region src/utils/kebabCaseToCamelCase.ts\nconst kebabCaseToCamelCase = (name) => {\n\treturn name.split(/[^a-zA-Z0-9]+/).filter(Boolean).map((word) => {\n\t\tconst lowerWord = word.toLowerCase();\n\t\tlet capitalized = lowerWord.charAt(0).toUpperCase() + lowerWord.slice(1);\n\t\tcapitalized = capitalized.replace(/(\\d)([a-z])/g, (_, number, char) => number + char.toUpperCase());\n\t\treturn capitalized;\n\t}).join(\"\");\n};\n\n//#endregion\nexport { kebabCaseToCamelCase };\n//# sourceMappingURL=kebabCaseToCamelCase.mjs.map"],"mappings":";AACA,MAAM,wBAAwB,SAAS;AACtC,QAAO,KAAK,MAAM,gBAAgB,CAAC,OAAO,QAAQ,CAAC,KAAK,SAAS;EAChE,MAAM,YAAY,KAAK,aAAa;EACpC,IAAI,cAAc,UAAU,OAAO,EAAE,CAAC,aAAa,GAAG,UAAU,MAAM,EAAE;AACxE,gBAAc,YAAY,QAAQ,iBAAiB,GAAG,QAAQ,SAAS,SAAS,KAAK,aAAa,CAAC;AACnG,SAAO;GACN,CAAC,KAAK,GAAG"}

package/dist/esm/chokidar/dist/esm/utils/pLimit.mjs

@@ -1,126 +0,0 @@
-//#region ../chokidar/dist/esm/utils/pLimit.mjs
-var Node = class {
-	value;
-	next;
-	constructor(value) {
-		this.value = value;
-	}
-};
-var Queue = class {
-	#head;
-	#tail;
-	#size;
-	constructor() {
-		this.clear();
-	}
-	enqueue(value) {
-		const node = new Node(value);
-		if (this.#head) {
-			this.#tail.next = node;
-			this.#tail = node;
-		} else {
-			this.#head = node;
-			this.#tail = node;
-		}
-		this.#size++;
-	}
-	dequeue() {
-		const current = this.#head;
-		if (!current) return;
-		this.#head = current.next;
-		this.#size--;
-		return current.value;
-	}
-	peek() {
-		if (!this.#head) return;
-		return this.#head.value;
-	}
-	clear() {
-		this.#head = void 0;
-		this.#tail = void 0;
-		this.#size = 0;
-	}
-	get size() {
-		return this.#size;
-	}
-	*[Symbol.iterator]() {
-		let current = this.#head;
-		while (current) {
-			yield current.value;
-			current = current.next;
-		}
-	}
-	*drain() {
-		while (this.#head) yield this.dequeue();
-	}
-};
-const pLimit = (concurrency) => {
-	validateConcurrency(concurrency);
-	const queue = new Queue();
-	let activeCount = 0;
-	const idleWaiters = [];
-	const notifyIdleIfNeeded = () => {
-		if (activeCount === 0 && queue.size === 0) while (idleWaiters.length) idleWaiters.pop()?.();
-	};
-	const resumeNext = () => {
-		if (activeCount < concurrency && queue.size > 0) {
-			activeCount++;
-			queue.dequeue()?.();
-		}
-	};
-	const next = () => {
-		activeCount--;
-		resumeNext();
-	};
-	const run = async (fn, resolve, arguments_) => {
-		const result = (async () => fn(...arguments_))();
-		resolve(result);
-		try {
-			await result;
-		} catch {}
-		next();
-	};
-	const enqueue = (fn, resolve, arguments_) => {
-		new Promise((internalResolve) => {
-			queue.enqueue(internalResolve);
-		}).then(run.bind(void 0, fn, resolve, arguments_));
-		if (activeCount < concurrency) resumeNext();
-	};
-	const generator = (fn, ...arguments_) => new Promise((resolve) => {
-		enqueue(fn, resolve, arguments_);
-	});
-	Object.defineProperties(generator, {
-		activeCount: { get: () => activeCount },
-		pendingCount: { get: () => queue.size },
-		clearQueue: { value() {
-			queue.clear();
-			notifyIdleIfNeeded();
-		} },
-		concurrency: {
-			get: () => concurrency,
-			set(newConcurrency) {
-				validateConcurrency(newConcurrency);
-				concurrency = newConcurrency;
-				queueMicrotask(() => {
-					while (activeCount < concurrency && queue.size > 0) resumeNext();
-				});
-			}
-		},
-		map: { async value(array, fn) {
-			const promises = array.map((value, index) => this(fn, value, index));
-			return Promise.all(promises);
-		} },
-		onIdle: { value() {
-			if (activeCount === 0 && queue.size === 0) return Promise.resolve();
-			return new Promise((resolve) => idleWaiters.push(resolve));
-		} }
-	});
-	return generator;
-};
-const validateConcurrency = (concurrency) => {
-	if (!((Number.isInteger(concurrency) || concurrency === Number.POSITIVE_INFINITY) && concurrency > 0)) throw new TypeError("Expected `concurrency` to be a number from 1 and up");
-};
-
-//#endregion
-export { pLimit };
-//# sourceMappingURL=pLimit.mjs.map

package/dist/esm/chokidar/dist/esm/utils/pLimit.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"pLimit.mjs","names":["#head","#tail","#size"],"sources":["../../../../../../../chokidar/dist/esm/utils/pLimit.mjs"],"sourcesContent":["//#region src/utils/pLimit.ts\nvar Node = class {\n\tvalue;\n\tnext;\n\tconstructor(value) {\n\t\tthis.value = value;\n\t}\n};\nvar Queue = class {\n\t#head;\n\t#tail;\n\t#size;\n\tconstructor() {\n\t\tthis.clear();\n\t}\n\tenqueue(value) {\n\t\tconst node = new Node(value);\n\t\tif (this.#head) {\n\t\t\tthis.#tail.next = node;\n\t\t\tthis.#tail = node;\n\t\t} else {\n\t\t\tthis.#head = node;\n\t\t\tthis.#tail = node;\n\t\t}\n\t\tthis.#size++;\n\t}\n\tdequeue() {\n\t\tconst current = this.#head;\n\t\tif (!current) return;\n\t\tthis.#head = current.next;\n\t\tthis.#size--;\n\t\treturn current.value;\n\t}\n\tpeek() {\n\t\tif (!this.#head) return;\n\t\treturn this.#head.value;\n\t}\n\tclear() {\n\t\tthis.#head = void 0;\n\t\tthis.#tail = void 0;\n\t\tthis.#size = 0;\n\t}\n\tget size() {\n\t\treturn this.#size;\n\t}\n\t*[Symbol.iterator]() {\n\t\tlet current = this.#head;\n\t\twhile (current) {\n\t\t\tyield current.value;\n\t\t\tcurrent = current.next;\n\t\t}\n\t}\n\t*drain() {\n\t\twhile (this.#head) yield this.dequeue();\n\t}\n};\nconst pLimit = (concurrency) => {\n\tvalidateConcurrency(concurrency);\n\tconst queue = new Queue();\n\tlet activeCount = 0;\n\tconst idleWaiters = [];\n\tconst notifyIdleIfNeeded = () => {\n\t\tif (activeCount === 0 && queue.size === 0) while (idleWaiters.length) idleWaiters.pop()?.();\n\t};\n\tconst resumeNext = () => {\n\t\tif (activeCount < concurrency && queue.size > 0) {\n\t\t\tactiveCount++;\n\t\t\tqueue.dequeue()?.();\n\t\t}\n\t};\n\tconst next = () => {\n\t\tactiveCount--;\n\t\tresumeNext();\n\t};\n\tconst run = async (fn, resolve, arguments_) => {\n\t\tconst result = (async () => fn(...arguments_))();\n\t\tresolve(result);\n\t\ttry {\n\t\t\tawait result;\n\t\t} catch {}\n\t\tnext();\n\t};\n\tconst enqueue = (fn, resolve, arguments_) => {\n\t\tnew Promise((internalResolve) => {\n\t\t\tqueue.enqueue(internalResolve);\n\t\t}).then(run.bind(void 0, fn, resolve, arguments_));\n\t\tif (activeCount < concurrency) resumeNext();\n\t};\n\tconst generator = (fn, ...arguments_) => new Promise((resolve) => {\n\t\tenqueue(fn, resolve, arguments_);\n\t});\n\tObject.defineProperties(generator, {\n\t\tactiveCount: { get: () => activeCount },\n\t\tpendingCount: { get: () => queue.size },\n\t\tclearQueue: { value() {\n\t\t\tqueue.clear();\n\t\t\tnotifyIdleIfNeeded();\n\t\t} },\n\t\tconcurrency: {\n\t\t\tget: () => concurrency,\n\t\t\tset(newConcurrency) {\n\t\t\t\tvalidateConcurrency(newConcurrency);\n\t\t\t\tconcurrency = newConcurrency;\n\t\t\t\tqueueMicrotask(() => {\n\t\t\t\t\twhile (activeCount < concurrency && queue.size > 0) resumeNext();\n\t\t\t\t});\n\t\t\t}\n\t\t},\n\t\tmap: { async value(array, fn) {\n\t\t\tconst promises = array.map((value, index) => this(fn, value, index));\n\t\t\treturn Promise.all(promises);\n\t\t} },\n\t\tonIdle: { value() {\n\t\t\tif (activeCount === 0 && queue.size === 0) return Promise.resolve();\n\t\t\treturn new Promise((resolve) => idleWaiters.push(resolve));\n\t\t} }\n\t});\n\treturn generator;\n};\nconst validateConcurrency = (concurrency) => {\n\tif (!((Number.isInteger(concurrency) || concurrency === Number.POSITIVE_INFINITY) && concurrency > 0)) throw new TypeError(\"Expected `concurrency` to be a number from 1 and up\");\n};\n\n//#endregion\nexport { Queue, pLimit };\n//# sourceMappingURL=pLimit.mjs.map"],"mappings":";AACA,IAAI,OAAO,MAAM;CAChB;CACA;CACA,YAAY,OAAO;AAClB,OAAK,QAAQ;;;AAGf,IAAI,QAAQ,MAAM;CACjB;CACA;CACA;CACA,cAAc;AACb,OAAK,OAAO;;CAEb,QAAQ,OAAO;EACd,MAAM,OAAO,IAAI,KAAK,MAAM;AAC5B,MAAI,MAAKA,MAAO;AACf,SAAKC,KAAM,OAAO;AAClB,SAAKA,OAAQ;SACP;AACN,SAAKD,OAAQ;AACb,SAAKC,OAAQ;;AAEd,QAAKC;;CAEN,UAAU;EACT,MAAM,UAAU,MAAKF;AACrB,MAAI,CAAC,QAAS;AACd,QAAKA,OAAQ,QAAQ;AACrB,QAAKE;AACL,SAAO,QAAQ;;CAEhB,OAAO;AACN,MAAI,CAAC,MAAKF,KAAO;AACjB,SAAO,MAAKA,KAAM;;CAEnB,QAAQ;AACP,QAAKA,OAAQ,KAAK;AAClB,QAAKC,OAAQ,KAAK;AAClB,QAAKC,OAAQ;;CAEd,IAAI,OAAO;AACV,SAAO,MAAKA;;CAEb,EAAE,OAAO,YAAY;EACpB,IAAI,UAAU,MAAKF;AACnB,SAAO,SAAS;AACf,SAAM,QAAQ;AACd,aAAU,QAAQ;;;CAGpB,CAAC,QAAQ;AACR,SAAO,MAAKA,KAAO,OAAM,KAAK,SAAS;;;AAGzC,MAAM,UAAU,gBAAgB;AAC/B,qBAAoB,YAAY;CAChC,MAAM,QAAQ,IAAI,OAAO;CACzB,IAAI,cAAc;CAClB,MAAM,cAAc,EAAE;CACtB,MAAM,2BAA2B;AAChC,MAAI,gBAAgB,KAAK,MAAM,SAAS,EAAG,QAAO,YAAY,OAAQ,aAAY,KAAK,IAAI;;CAE5F,MAAM,mBAAmB;AACxB,MAAI,cAAc,eAAe,MAAM,OAAO,GAAG;AAChD;AACA,SAAM,SAAS,IAAI;;;CAGrB,MAAM,aAAa;AAClB;AACA,cAAY;;CAEb,MAAM,MAAM,OAAO,IAAI,SAAS,eAAe;EAC9C,MAAM,UAAU,YAAY,GAAG,GAAG,WAAW,GAAG;AAChD,UAAQ,OAAO;AACf,MAAI;AACH,SAAM;UACC;AACR,QAAM;;CAEP,MAAM,WAAW,IAAI,SAAS,eAAe;AAC5C,MAAI,SAAS,oBAAoB;AAChC,SAAM,QAAQ,gBAAgB;IAC7B,CAAC,KAAK,IAAI,KAAK,KAAK,GAAG,IAAI,SAAS,WAAW,CAAC;AAClD,MAAI,cAAc,YAAa,aAAY;;CAE5C,MAAM,aAAa,IAAI,GAAG,eAAe,IAAI,SAAS,YAAY;AACjE,UAAQ,IAAI,SAAS,WAAW;GAC/B;AACF,QAAO,iBAAiB,WAAW;EAClC,aAAa,EAAE,WAAW,aAAa;EACvC,cAAc,EAAE,WAAW,MAAM,MAAM;EACvC,YAAY,EAAE,QAAQ;AACrB,SAAM,OAAO;AACb,uBAAoB;KAClB;EACH,aAAa;GACZ,WAAW;GACX,IAAI,gBAAgB;AACnB,wBAAoB,eAAe;AACnC,kBAAc;AACd,yBAAqB;AACpB,YAAO,cAAc,eAAe,MAAM,OAAO,EAAG,aAAY;MAC/D;;GAEH;EACD,KAAK,EAAE,MAAM,MAAM,OAAO,IAAI;GAC7B,MAAM,WAAW,MAAM,KAAK,OAAO,UAAU,KAAK,IAAI,OAAO,MAAM,CAAC;AACpE,UAAO,QAAQ,IAAI,SAAS;KAC1B;EACH,QAAQ,EAAE,QAAQ;AACjB,OAAI,gBAAgB,KAAK,MAAM,SAAS,EAAG,QAAO,QAAQ,SAAS;AACnE,UAAO,IAAI,SAAS,YAAY,YAAY,KAAK,QAAQ,CAAC;KACxD;EACH,CAAC;AACF,QAAO;;AAER,MAAM,uBAAuB,gBAAgB;AAC5C,KAAI,GAAG,OAAO,UAAU,YAAY,IAAI,gBAAgB,OAAO,sBAAsB,cAAc,GAAI,OAAM,IAAI,UAAU,sDAAsD"}

package/dist/esm/chokidar/dist/esm/utils/parallelize.mjs

@@ -1,11 +0,0 @@
-import { pLimit } from "./pLimit.mjs";
-
-//#region ../chokidar/dist/esm/utils/parallelize.mjs
-const parallelize = async (items, callback = async (item) => item, parallelLimit = 10) => {
-	const limit = pLimit(parallelLimit);
-	return Promise.all(items.map((item) => limit(() => callback(item))));
-};
-
-//#endregion
-export { parallelize };
-//# sourceMappingURL=parallelize.mjs.map

package/dist/esm/chokidar/dist/esm/utils/parallelize.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"parallelize.mjs","names":[],"sources":["../../../../../../../chokidar/dist/esm/utils/parallelize.mjs"],"sourcesContent":["import { pLimit } from \"./pLimit.mjs\";\n\n//#region src/utils/parallelize.ts\nconst parallelize = async (items, callback = async (item) => item, parallelLimit = 10) => {\n\tconst limit = pLimit(parallelLimit);\n\treturn Promise.all(items.map((item) => limit(() => callback(item))));\n};\n\n//#endregion\nexport { parallelize };\n//# sourceMappingURL=parallelize.mjs.map"],"mappings":";;;AAGA,MAAM,cAAc,OAAO,OAAO,WAAW,OAAO,SAAS,MAAM,gBAAgB,OAAO;CACzF,MAAM,QAAQ,OAAO,cAAc;AACnC,QAAO,QAAQ,IAAI,MAAM,KAAK,SAAS,YAAY,SAAS,KAAK,CAAC,CAAC,CAAC"}

package/dist/esm/chokidar/dist/esm/utils/parallelizeGlobal.mjs

@@ -1,21 +0,0 @@
-import { pLimit } from "./pLimit.mjs";
-
-//#region ../chokidar/dist/esm/utils/parallelizeGlobal.mjs
-let _globalLimiter = null;
-/** Get (and optionally configure) the single, shared limiter. */
-const getGlobalLimiter = (concurrency) => {
-	if (!_globalLimiter) _globalLimiter = pLimit(concurrency ?? 10);
-	else if (typeof concurrency === "number") _globalLimiter.concurrency = concurrency;
-	return _globalLimiter;
-};
-let _taskLimiter = null;
-/** Limits how many *tasks* run concurrently (independent from AI calls). */
-const getTaskLimiter = (concurrency) => {
-	if (!_taskLimiter) _taskLimiter = pLimit(concurrency ?? 5);
-	else if (typeof concurrency === "number") _taskLimiter.concurrency = concurrency;
-	return _taskLimiter;
-};
-
-//#endregion
-export { getGlobalLimiter, getTaskLimiter };
-//# sourceMappingURL=parallelizeGlobal.mjs.map

package/dist/esm/chokidar/dist/esm/utils/parallelizeGlobal.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"parallelizeGlobal.mjs","names":[],"sources":["../../../../../../../chokidar/dist/esm/utils/parallelizeGlobal.mjs"],"sourcesContent":["import { pLimit } from \"./pLimit.mjs\";\n\n//#region src/utils/parallelizeGlobal.ts\nlet _globalLimiter = null;\n/** Get (and optionally configure) the single, shared limiter. */\nconst getGlobalLimiter = (concurrency) => {\n\tif (!_globalLimiter) _globalLimiter = pLimit(concurrency ?? 10);\n\telse if (typeof concurrency === \"number\") _globalLimiter.concurrency = concurrency;\n\treturn _globalLimiter;\n};\nlet _taskLimiter = null;\n/** Limits how many *tasks* run concurrently (independent from AI calls). */\nconst getTaskLimiter = (concurrency) => {\n\tif (!_taskLimiter) _taskLimiter = pLimit(concurrency ?? 5);\n\telse if (typeof concurrency === \"number\") _taskLimiter.concurrency = concurrency;\n\treturn _taskLimiter;\n};\nconst parallelizeGlobal = async (items, callback = async (item) => item, options) => {\n\tconst limiter = options?.limiter ?? getGlobalLimiter(options?.concurrency);\n\tconst run = options?.wrapInLimiter ?? true ? (fn) => limiter(fn) : (fn) => fn();\n\tconst promises = items.map((item, index) => run(() => callback(item, index)));\n\treturn Promise.all(promises);\n};\n\n//#endregion\nexport { getGlobalLimiter, getTaskLimiter, parallelizeGlobal };\n//# sourceMappingURL=parallelizeGlobal.mjs.map"],"mappings":";;;AAGA,IAAI,iBAAiB;;AAErB,MAAM,oBAAoB,gBAAgB;AACzC,KAAI,CAAC,eAAgB,kBAAiB,OAAO,eAAe,GAAG;UACtD,OAAO,gBAAgB,SAAU,gBAAe,cAAc;AACvE,QAAO;;AAER,IAAI,eAAe;;AAEnB,MAAM,kBAAkB,gBAAgB;AACvC,KAAI,CAAC,aAAc,gBAAe,OAAO,eAAe,EAAE;UACjD,OAAO,gBAAgB,SAAU,cAAa,cAAc;AACrE,QAAO"}

package/dist/esm/chokidar/dist/esm/utils/reduceObjectFormat.mjs

@@ -1,30 +0,0 @@
-//#region ../chokidar/dist/esm/utils/reduceObjectFormat.mjs
-/**
-* Reduce an object to only the shape provided by a format object.
-* Values are always taken from the source object; the format is used only for structure.
-*
-* Examples:
-* reduceObjectFormat({ a: 1, b: 2 }, { a: 0 }) => { a: 1 }
-* reduceObjectFormat({ a: { x: 1, y: 2 } }, { a: { x: 0 } }) => { a: { x: 1 } }
-*/
-const reduceObjectFormat = (source, format) => {
-	if (Array.isArray(format)) {
-		const sourceArray = Array.isArray(source) ? source : [];
-		return format.map((formatItem, index) => reduceObjectFormat(sourceArray[index], formatItem));
-	}
-	if (typeof format === "object" && format !== null) {
-		const result = {};
-		const sourceObject = typeof source === "object" && source !== null && !Array.isArray(source) ? source : {};
-		for (const key of Object.keys(format)) {
-			const nextSource = sourceObject[key];
-			const nextFormat = format[key];
-			result[key] = reduceObjectFormat(nextSource, nextFormat);
-		}
-		return result;
-	}
-	return source;
-};
-
-//#endregion
-export { reduceObjectFormat };
-//# sourceMappingURL=reduceObjectFormat.mjs.map

package/dist/esm/chokidar/dist/esm/utils/reduceObjectFormat.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"reduceObjectFormat.mjs","names":[],"sources":["../../../../../../../chokidar/dist/esm/utils/reduceObjectFormat.mjs"],"sourcesContent":["//#region src/utils/reduceObjectFormat.ts\n/**\n* Reduce an object to only the shape provided by a format object.\n* Values are always taken from the source object; the format is used only for structure.\n*\n* Examples:\n* reduceObjectFormat({ a: 1, b: 2 }, { a: 0 }) => { a: 1 }\n* reduceObjectFormat({ a: { x: 1, y: 2 } }, { a: { x: 0 } }) => { a: { x: 1 } }\n*/\nconst reduceObjectFormat = (source, format) => {\n\tif (Array.isArray(format)) {\n\t\tconst sourceArray = Array.isArray(source) ? source : [];\n\t\treturn format.map((formatItem, index) => reduceObjectFormat(sourceArray[index], formatItem));\n\t}\n\tif (typeof format === \"object\" && format !== null) {\n\t\tconst result = {};\n\t\tconst sourceObject = typeof source === \"object\" && source !== null && !Array.isArray(source) ? source : {};\n\t\tfor (const key of Object.keys(format)) {\n\t\t\tconst nextSource = sourceObject[key];\n\t\t\tconst nextFormat = format[key];\n\t\t\tresult[key] = reduceObjectFormat(nextSource, nextFormat);\n\t\t}\n\t\treturn result;\n\t}\n\treturn source;\n};\n\n//#endregion\nexport { reduceObjectFormat };\n//# sourceMappingURL=reduceObjectFormat.mjs.map"],"mappings":";;;;;;;;;AASA,MAAM,sBAAsB,QAAQ,WAAW;AAC9C,KAAI,MAAM,QAAQ,OAAO,EAAE;EAC1B,MAAM,cAAc,MAAM,QAAQ,OAAO,GAAG,SAAS,EAAE;AACvD,SAAO,OAAO,KAAK,YAAY,UAAU,mBAAmB,YAAY,QAAQ,WAAW,CAAC;;AAE7F,KAAI,OAAO,WAAW,YAAY,WAAW,MAAM;EAClD,MAAM,SAAS,EAAE;EACjB,MAAM,eAAe,OAAO,WAAW,YAAY,WAAW,QAAQ,CAAC,MAAM,QAAQ,OAAO,GAAG,SAAS,EAAE;AAC1G,OAAK,MAAM,OAAO,OAAO,KAAK,OAAO,EAAE;GACtC,MAAM,aAAa,aAAa;GAChC,MAAM,aAAa,OAAO;AAC1B,UAAO,OAAO,mBAAmB,YAAY,WAAW;;AAEzD,SAAO;;AAER,QAAO"}

package/dist/esm/chokidar/dist/esm/utils/resolveObjectPromises.mjs

@@ -1,20 +0,0 @@
-//#region ../chokidar/dist/esm/utils/resolveObjectPromises.mjs
-/**
-* A more "unified" approach where each type (function, array, object, primitive)
-* is handled inside the main recursive body.
-*/
-const resolveObjectPromises = async (entry) => {
-	if (entry && typeof entry.then === "function") return resolveObjectPromises(await entry);
-	if (typeof entry === "function") return resolveObjectPromises(entry());
-	if (Array.isArray(entry)) return Promise.all(entry.map(async (item) => resolveObjectPromises(item)));
-	if (entry && typeof entry === "object") {
-		const result = {};
-		for (const key of Object.keys(entry)) result[key] = await resolveObjectPromises(entry[key]);
-		return result;
-	}
-	return entry;
-};
-
-//#endregion
-export { resolveObjectPromises };
-//# sourceMappingURL=resolveObjectPromises.mjs.map

package/dist/esm/chokidar/dist/esm/utils/resolveObjectPromises.mjs.map

@@ -1 +0,0 @@
-{"version":3,"file":"resolveObjectPromises.mjs","names":[],"sources":["../../../../../../../chokidar/dist/esm/utils/resolveObjectPromises.mjs"],"sourcesContent":["//#region src/utils/resolveObjectPromises.ts\n/**\n* A more \"unified\" approach where each type (function, array, object, primitive)\n* is handled inside the main recursive body.\n*/\nconst resolveObjectPromises = async (entry) => {\n\tif (entry && typeof entry.then === \"function\") return resolveObjectPromises(await entry);\n\tif (typeof entry === \"function\") return resolveObjectPromises(entry());\n\tif (Array.isArray(entry)) return Promise.all(entry.map(async (item) => resolveObjectPromises(item)));\n\tif (entry && typeof entry === \"object\") {\n\t\tconst result = {};\n\t\tfor (const key of Object.keys(entry)) result[key] = await resolveObjectPromises(entry[key]);\n\t\treturn result;\n\t}\n\treturn entry;\n};\n\n//#endregion\nexport { resolveObjectPromises };\n//# sourceMappingURL=resolveObjectPromises.mjs.map"],"mappings":";;;;;AAKA,MAAM,wBAAwB,OAAO,UAAU;AAC9C,KAAI,SAAS,OAAO,MAAM,SAAS,WAAY,QAAO,sBAAsB,MAAM,MAAM;AACxF,KAAI,OAAO,UAAU,WAAY,QAAO,sBAAsB,OAAO,CAAC;AACtE,KAAI,MAAM,QAAQ,MAAM,CAAE,QAAO,QAAQ,IAAI,MAAM,IAAI,OAAO,SAAS,sBAAsB,KAAK,CAAC,CAAC;AACpG,KAAI,SAAS,OAAO,UAAU,UAAU;EACvC,MAAM,SAAS,EAAE;AACjB,OAAK,MAAM,OAAO,OAAO,KAAK,MAAM,CAAE,QAAO,OAAO,MAAM,sBAAsB,MAAM,KAAK;AAC3F,SAAO;;AAER,QAAO"}