Function pruneIrrelevantSubtrees

tools/code-sample-minimizer.js:133–196

* Recursively removes descendant subtrees of the given AST node and replaces * them with simplified variants to produce simplified source which is still "bad". * Committed modifications are recorded in modifications; the AST is also * mutated so that traversal state stays consistent wi

(node)

	 * @returns {void}
	 */
	function pruneIrrelevantSubtrees(node) {
		for (const key of visitorKeys[node.type] ?? []) {
			if (Array.isArray(node[key])) {
				for (let index = node[key].length - 1; index >= 0; index--) {
					const childNode = node[key][index];

					if (!childNode) {
						continue;
					}

					const mod = {
						start: childNode.range[0],
						end: childNode.range[1],
						replacement: "",
					};

					if (reproducesBadCase(buildSource(mod))) {
						modifications.push(mod);
						node[key].splice(index, 1);
					} else {
						pruneIrrelevantSubtrees(childNode);
					}
				}
			} else if (typeof node[key] === "object" && node[key] !== null) {
				const childNode = node[key];

				if (isMaybeExpression(childNode)) {
					const name = generateNewIdentifierName();
					const mod = {
						start: childNode.range[0],
						end: childNode.range[1],
						replacement: name,
					};

					if (reproducesBadCase(buildSource(mod))) {
						modifications.push(mod);
						node[key] = {
							type: "Identifier",
							name,
							range: childNode.range,
						};
					} else {
						pruneIrrelevantSubtrees(childNode);
					}
				} else if (isStatement(childNode)) {
					const mod = {
						start: childNode.range[0],
						end: childNode.range[1],
						replacement: ";",
					};

					if (reproducesBadCase(buildSource(mod))) {
						modifications.push(mod);
						node[key] = {
							type: "EmptyStatement",
							range: childNode.range,
						};
					} else {