Function interpolate

lib/TemplatedPathPlugin.js:341–727

(path, data, assetInfo)

 * @returns {string} the interpolated path
 */
const interpolate = (path, data, assetInfo) => {
	if (typeof path === "function") {
		path = path(data, assetInfo);
	}

	// Literal paths carry no `[placeholder]`, so the whole replacement table
	// and regex pass are pure overhead — building replacers has no side effects
	// (those only fire when a replacer is invoked), so the output is identical.
	if (!path.includes("[")) {
		return path;
	}

	// Only build replacers for placeholders the template actually uses — most
	// templates reference a handful, so building the whole table per call is
	// wasted work. Replacer construction has no side effects (those fire only
	// when a replacer is invoked, which happens for present kinds), so this is
	// output-identical.
	const presentKinds = getPresentKinds(path);

	const chunkGraph = data.chunkGraph;
	// Digest the stored hashes are encoded in, so `[hash:<digest>]` can re-encode.
	const sourceDigest = data.hashDigest || "hex";

	/** @type {Map<string, Replacer>} */
	const replacements = new Map();

	// Filename context
	//
	// Placeholders
	//
	// for /some/path/file.js?query#fragment:
	// [file] - /some/path/file.js
	// [query] - ?query
	// [fragment] - #fragment
	// [base] - file.js
	// [path] - /some/path/
	// [name] - file
	// [ext] - .js
	if (
		typeof data.filename === "string" &&
		(presentKinds.has("file") ||
			presentKinds.has("query") ||
			presentKinds.has("fragment") ||
			presentKinds.has("path") ||
			presentKinds.has("base") ||
			presentKinds.has("name") ||
			presentKinds.has("ext") ||
			presentKinds.has("filebase"))
	) {
		// check that filename is data uri
		const match = data.filename.match(/^data:([^;,]+)/);
		if (match) {
			const ext = getMimeTypes().extension(match[1]);
			const emptyReplacer = replacer("", true);
			// "XXXX" used for `updateHash`, so we don't need it here
			const contentHash =
				data.contentHash && !/X+/.test(data.contentHash)
					? data.contentHash