${yellow(x)}`),
"loggingEntry(info).loggingEntry.message": (message, { green }) =>
- mapLines(message, x => ` ${green(x)}`),
+ mapLines(message, (x) => ` ${green(x)}`),
"loggingEntry(log).loggingEntry.message": (message, { bold }) =>
- mapLines(message, x => ` ${bold(x)}`),
- "loggingEntry(debug).loggingEntry.message": message =>
- mapLines(message, x => ` ${x}`),
- "loggingEntry(trace).loggingEntry.message": message =>
- mapLines(message, x => ` ${x}`),
+ mapLines(message, (x) => ` ${bold(x)}`),
+ "loggingEntry(debug).loggingEntry.message": (message) =>
+ mapLines(message, (x) => ` ${x}`),
+ "loggingEntry(trace).loggingEntry.message": (message) =>
+ mapLines(message, (x) => ` ${x}`),
"loggingEntry(status).loggingEntry.message": (message, { magenta }) =>
- mapLines(message, x => ` ${magenta(x)}`),
+ mapLines(message, (x) => ` ${magenta(x)}`),
"loggingEntry(profile).loggingEntry.message": (message, { magenta }) =>
- mapLines(message, x => ` ${magenta(x)}`),
+ mapLines(message, (x) => `
${magenta(x)}`),
"loggingEntry(profileEnd).loggingEntry.message": (message, { magenta }) =>
- mapLines(message, x => `
${magenta(x)}`),
+ mapLines(message, (x) => ` ${magenta(x)}`),
"loggingEntry(time).loggingEntry.message": (message, { magenta }) =>
- mapLines(message, x => ` ${magenta(x)}`),
+ mapLines(message, (x) => ` ${magenta(x)}`),
"loggingEntry(group).loggingEntry.message": (message, { cyan }) =>
- mapLines(message, x => `<-> ${cyan(x)}`),
+ mapLines(message, (x) => `<-> ${cyan(x)}`),
"loggingEntry(groupCollapsed).loggingEntry.message": (message, { cyan }) =>
- mapLines(message, x => `<+> ${cyan(x)}`),
+ mapLines(message, (x) => `<+> ${cyan(x)}`),
"loggingEntry(clear).loggingEntry": () => " -------",
"loggingEntry(groupCollapsed).loggingEntry.children": () => "",
- "loggingEntry.trace[]": trace =>
- trace ? mapLines(trace, x => `| ${x}`) : undefined,
+ "loggingEntry.trace[]": (trace) =>
+ trace ? mapLines(trace, (x) => `| ${x}`) : undefined,
- loggingGroup: loggingGroup =>
+ loggingGroup: (loggingGroup) =>
loggingGroup.entries.length === 0 ? "" : undefined,
"loggingGroup.debug": (flag, { red }) => (flag ? red("DEBUG") : undefined),
"loggingGroup.name": (name, { bold }) => bold(`LOG from ${name}`),
"loggingGroup.separator!": () => "\n",
- "loggingGroup.filteredEntries": filteredEntries =>
+ "loggingGroup.filteredEntries": (filteredEntries) =>
filteredEntries > 0 ? `+ ${filteredEntries} hidden lines` : undefined
};
@@ -888,14 +888,14 @@ const LOG_ENTRY_PRINTERS = {
/** @type {ModuleTraceItemPrinters} */
const MODULE_TRACE_ITEM_PRINTERS = {
- "moduleTraceItem.originName": originName => originName
+ "moduleTraceItem.originName": (originName) => originName
};
/** @typedef {Printers} ModuleTraceDependencyPrinters */
/** @type {ModuleTraceDependencyPrinters} */
const MODULE_TRACE_DEPENDENCY_PRINTERS = {
- "moduleTraceDependency.loc": loc => loc
+ "moduleTraceDependency.loc": (loc) => loc
};
/**
@@ -932,9 +932,9 @@ const ITEM_NAMES = {
"module.issuerPath[]": "moduleIssuer",
"chunk.origins[]": "chunkOrigin",
"chunk.modules[]": "module",
- "loggingGroup.entries[]": logEntry =>
+ "loggingGroup.entries[]": (logEntry) =>
`loggingEntry(${logEntry.type}).loggingEntry`,
- "loggingEntry.children[]": logEntry =>
+ "loggingEntry.children[]": (logEntry) =>
`loggingEntry(${logEntry.type}).loggingEntry`,
"error.moduleTrace[]": "moduleTraceItem",
"error.errors[]": "error",
@@ -1135,19 +1135,19 @@ const PREFERRED_ORDERS = {
/** @typedef {(items: string[]) => string | undefined} SimpleItemsJoiner */
/** @type {SimpleItemsJoiner} */
-const itemsJoinOneLine = items => items.filter(Boolean).join(" ");
+const itemsJoinOneLine = (items) => items.filter(Boolean).join(" ");
/** @type {SimpleItemsJoiner} */
-const itemsJoinOneLineBrackets = items =>
+const itemsJoinOneLineBrackets = (items) =>
items.length > 0 ? `(${items.filter(Boolean).join(" ")})` : undefined;
/** @type {SimpleItemsJoiner} */
-const itemsJoinMoreSpacing = items => items.filter(Boolean).join("\n\n");
+const itemsJoinMoreSpacing = (items) => items.filter(Boolean).join("\n\n");
/** @type {SimpleItemsJoiner} */
-const itemsJoinComma = items => items.filter(Boolean).join(", ");
+const itemsJoinComma = (items) => items.filter(Boolean).join(", ");
/** @type {SimpleItemsJoiner} */
-const itemsJoinCommaBrackets = items =>
+const itemsJoinCommaBrackets = (items) =>
items.length > 0 ? `(${items.filter(Boolean).join(", ")})` : undefined;
/** @type {(item: string) => SimpleItemsJoiner} */
-const itemsJoinCommaBracketsWithName = name => items =>
+const itemsJoinCommaBracketsWithName = (name) => (items) =>
items.length > 0
? `(${name}: ${items.filter(Boolean).join(", ")})`
: undefined;
@@ -1176,18 +1176,18 @@ const SIMPLE_ITEMS_JOINER = {
"asset.auxiliaryChunkIdHints":
itemsJoinCommaBracketsWithName("auxiliary id hint"),
"module.chunks": itemsJoinOneLine,
- "module.issuerPath": items =>
+ "module.issuerPath": (items) =>
items
.filter(Boolean)
- .map(item => `${item} ->`)
+ .map((item) => `${item} ->`)
.join(" "),
"compilation.errors": itemsJoinMoreSpacing,
"compilation.warnings": itemsJoinMoreSpacing,
"compilation.logging": itemsJoinMoreSpacing,
- "compilation.children": items =>
+ "compilation.children": (items) =>
indent(/** @type {string} */ (itemsJoinMoreSpacing(items)), " "),
"moduleTraceItem.dependencies": itemsJoinOneLine,
- "loggingEntry.children": items =>
+ "loggingEntry.children": (items) =>
indent(items.filter(Boolean).join("\n"), " ", false)
};
@@ -1195,9 +1195,9 @@ const SIMPLE_ITEMS_JOINER = {
* @param {Item[]} items items
* @returns {string} result
*/
-const joinOneLine = items =>
+const joinOneLine = (items) =>
items
- .map(item => item.content)
+ .map((item) => item.content)
.filter(Boolean)
.join(" ");
@@ -1205,7 +1205,7 @@ const joinOneLine = items =>
* @param {Item[]} items items
* @returns {string} result
*/
-const joinInBrackets = items => {
+const joinInBrackets = (items) => {
const res = [];
let mode = 0;
for (const item of items) {
@@ -1269,7 +1269,7 @@ const joinExplicitNewLine = (items, indenter) => {
let firstInLine = true;
let first = true;
return items
- .map(item => {
+ .map((item) => {
if (!item || !item.content) return;
let content = indent(item.content, first ? "" : indenter, !firstInLine);
if (firstInLine) {
@@ -1291,7 +1291,7 @@ const joinExplicitNewLine = (items, indenter) => {
* @returns {SimpleElementJoiner} joiner
*/
const joinError =
- error =>
+ (error) =>
/**
* @param {Item[]} items items
* @param {StatsPrinterContextWithExtra} ctx context
@@ -1308,7 +1308,7 @@ const joinError =
/** @type {Record} */
const SIMPLE_ELEMENT_JOINERS = {
- compilation: items => {
+ compilation: (items) => {
const result = [];
let lastNeedMore = false;
for (const item of items) {
@@ -1328,9 +1328,9 @@ const SIMPLE_ELEMENT_JOINERS = {
if (lastNeedMore) result.push("\n");
return result.join("");
},
- asset: items =>
+ asset: (items) =>
joinExplicitNewLine(
- items.map(item => {
+ items.map((item) => {
if (
(item.element === "related" || item.element === "children") &&
item.content
@@ -1348,7 +1348,7 @@ const SIMPLE_ELEMENT_JOINERS = {
module: (items, { module }) => {
let hasName = false;
return joinExplicitNewLine(
- items.map(item => {
+ items.map((item) => {
switch (item.element) {
case "id":
if (module.id === module.name) {
@@ -1381,10 +1381,10 @@ const SIMPLE_ELEMENT_JOINERS = {
" "
);
},
- chunk: items => {
+ chunk: (items) => {
let hasEntry = false;
return `chunk ${joinExplicitNewLine(
- items.filter(item => {
+ items.filter((item) => {
switch (item.element) {
case "entry":
if (item.content) hasEntry = true;
@@ -1398,15 +1398,15 @@ const SIMPLE_ELEMENT_JOINERS = {
" "
)}`;
},
- "chunk.childrenByOrder[]": items => `(${joinOneLine(items)})`,
- chunkGroup: items => joinExplicitNewLine(items, " "),
+ "chunk.childrenByOrder[]": (items) => `(${joinOneLine(items)})`,
+ chunkGroup: (items) => joinExplicitNewLine(items, " "),
chunkGroupAsset: joinOneLine,
chunkGroupChildGroup: joinOneLine,
chunkGroupChild: joinOneLine,
moduleReason: (items, { moduleReason }) => {
let hasName = false;
return joinExplicitNewLine(
- items.map(item => {
+ items.map((item) => {
switch (item.element) {
case "moduleId":
if (moduleReason.moduleId === moduleReason.module && item.content) {
@@ -1437,14 +1437,14 @@ const SIMPLE_ELEMENT_JOINERS = {
},
"module.profile": joinInBrackets,
moduleIssuer: joinOneLine,
- chunkOrigin: items => `> ${joinOneLine(items)}`,
+ chunkOrigin: (items) => `> ${joinOneLine(items)}`,
"errors[].error": joinError(true),
"warnings[].error": joinError(false),
- error: items => joinExplicitNewLine(items, ""),
- "error.errors[].error": items =>
+ error: (items) => joinExplicitNewLine(items, ""),
+ "error.errors[].error": (items) =>
indent(`[errors]: ${joinExplicitNewLine(items, "")}`, " "),
- loggingGroup: items => joinExplicitNewLine(items, "").trimEnd(),
- moduleTraceItem: items => ` @ ${joinOneLine(items)}`,
+ loggingGroup: (items) => joinExplicitNewLine(items, "").trimEnd(),
+ moduleTraceItem: (items) => ` @ ${joinOneLine(items)}`,
moduleTraceDependency: joinOneLine
};
@@ -1479,11 +1479,11 @@ const AVAILABLE_FORMATS = {
return `{${yellow(id)}}`;
}
},
- formatModuleId: id => `[${id}]`,
+ formatModuleId: (id) => `[${id}]`,
formatFilename: (filename, { green, yellow }, oversize) =>
(oversize ? yellow : green)(filename),
- formatFlag: flag => `[${flag}]`,
- formatLayer: layer => `(in ${layer})`,
+ formatFlag: (flag) => `[${flag}]`,
+ formatLayer: (layer) => `(in ${layer})`,
formatSize: require("../SizeFormatHelpers").formatSize,
formatDateTime: (dateTime, { bold }) => {
const d = new Date(dateTime);
@@ -1559,7 +1559,7 @@ const AVAILABLE_FORMATS = {
/** @typedef {(result: string) => string} ResultModifierFn */
/** @type {Record} */
const RESULT_MODIFIER = {
- "module.modules": result => indent(result, "| ")
+ "module.modules": (result) => indent(result, "| ")
};
/**
@@ -1597,7 +1597,7 @@ class DefaultStatsPrinterPlugin {
* @returns {void}
*/
apply(compiler) {
- compiler.hooks.compilation.tap(PLUGIN_NAME, compilation => {
+ compiler.hooks.compilation.tap(PLUGIN_NAME, (compilation) => {
compilation.hooks.statsPrinter.tap(PLUGIN_NAME, (stats, options) => {
// Put colors into context
stats.hooks.print
@@ -1621,7 +1621,7 @@ class DefaultStatsPrinterPlugin {
}
if (start) {
/** @type {ColorFunction} */
- context[color] = str =>
+ context[color] = (str) =>
`${start}${
typeof str === "string"
? str.replace(
@@ -1636,7 +1636,7 @@ class DefaultStatsPrinterPlugin {
* @param {string} str string
* @returns {string} str string
*/
- context[color] = str => str;
+ context[color] = (str) => str;
}
}
for (const _format of Object.keys(AVAILABLE_FORMATS)) {
diff --git a/lib/stats/StatsFactory.js b/lib/stats/StatsFactory.js
index c59d660eaa2..4a3ada223d6 100644
--- a/lib/stats/StatsFactory.js
+++ b/lib/stats/StatsFactory.js
@@ -273,7 +273,7 @@ class StatsFactory {
// sort items
/** @type {Comparator[]} */
const comparators = [];
- this._forEachLevel(this.hooks.sort, this._caches.sort, type, h =>
+ this._forEachLevel(this.hooks.sort, this._caches.sort, type, (h) =>
h.call(comparators, context)
);
if (comparators.length > 0) {
@@ -306,7 +306,7 @@ class StatsFactory {
this.hooks.getItemName,
this._caches.getItemName,
`${type}[]`,
- h => h.call(item, itemContext)
+ (h) => h.call(item, itemContext)
);
if (itemName) itemContext[itemName] = item;
const innerType = itemName ? `${type}[].${itemName}` : `${type}[]`;
@@ -317,7 +317,7 @@ class StatsFactory {
this.hooks.getItemFactory,
this._caches.getItemFactory,
innerType,
- h => h.call(item, itemContext)
+ (h) => h.call(item, itemContext)
) || this;
// run item factory
@@ -331,7 +331,7 @@ class StatsFactory {
this.hooks.sortResults,
this._caches.sortResults,
type,
- h => h.call(comparators2, context)
+ (h) => h.call(comparators2, context)
);
if (comparators2.length > 0) {
resultItems.sort(
@@ -347,7 +347,7 @@ class StatsFactory {
this.hooks.groupResults,
this._caches.groupResults,
type,
- h => h.call(groupConfigs, context)
+ (h) => h.call(groupConfigs, context)
);
if (groupConfigs.length > 0) {
resultItems = smartGrouping(resultItems, groupConfigs);
@@ -368,7 +368,7 @@ class StatsFactory {
this.hooks.merge,
this._caches.merge,
type,
- h => h.call(finalResultItems, context)
+ (h) => h.call(finalResultItems, context)
);
if (result === undefined) result = finalResultItems;
@@ -385,7 +385,7 @@ class StatsFactory {
const object = {};
// run extract on value
- this._forEachLevel(this.hooks.extract, this._caches.extract, type, h =>
+ this._forEachLevel(this.hooks.extract, this._caches.extract, type, (h) =>
h.call(object, data, context)
);
diff --git a/lib/stats/StatsPrinter.js b/lib/stats/StatsPrinter.js
index 3672ed1fe18..621dd9a2d77 100644
--- a/lib/stats/StatsPrinter.js
+++ b/lib/stats/StatsPrinter.js
@@ -210,13 +210,13 @@ class StatsPrinter {
};
/** @type {string | undefined} */
- let printResult = this._forEachLevel(this.hooks.print, type, hook =>
+ let printResult = this._forEachLevel(this.hooks.print, type, (hook) =>
hook.call(object, context)
);
if (printResult === undefined) {
if (Array.isArray(object)) {
const sortedItems = [...object];
- this._forEachLevel(this.hooks.sortItems, type, h =>
+ this._forEachLevel(this.hooks.sortItems, type, (h) =>
h.call(
sortedItems,
/** @type {StatsPrinterContextWithExtra} */
@@ -233,7 +233,7 @@ class StatsPrinter {
const itemName = this._forEachLevel(
this.hooks.getItemName,
`${type}[]`,
- h => h.call(item, itemContext)
+ (h) => h.call(item, itemContext)
);
if (itemName) itemContext[itemName] = item;
return this.print(
@@ -242,7 +242,7 @@ class StatsPrinter {
itemContext
);
});
- printResult = this._forEachLevel(this.hooks.printItems, type, h =>
+ printResult = this._forEachLevel(this.hooks.printItems, type, (h) =>
h.call(
/** @type {string[]} */ (printedItems),
/** @type {StatsPrinterContextWithExtra} */
@@ -255,16 +255,16 @@ class StatsPrinter {
}
} else if (object !== null && typeof object === "object") {
const elements = Object.keys(object).filter(
- key => object[key] !== undefined
+ (key) => object[key] !== undefined
);
- this._forEachLevel(this.hooks.sortElements, type, h =>
+ this._forEachLevel(this.hooks.sortElements, type, (h) =>
h.call(
elements,
/** @type {StatsPrinterContextWithExtra} */
(context)
)
);
- const printedElements = elements.map(element => {
+ const printedElements = elements.map((element) => {
const content = this.print(`${type}.${element}`, object[element], {
...context,
_parent: object,
@@ -273,7 +273,7 @@ class StatsPrinter {
});
return { element, content };
});
- printResult = this._forEachLevel(this.hooks.printElements, type, h =>
+ printResult = this._forEachLevel(this.hooks.printElements, type, (h) =>
h.call(
printedElements,
/** @type {StatsPrinterContextWithExtra} */
@@ -281,7 +281,7 @@ class StatsPrinter {
)
);
if (printResult === undefined) {
- const result = printedElements.map(e => e.content).filter(Boolean);
+ const result = printedElements.map((e) => e.content).filter(Boolean);
if (result.length > 0) printResult = result.join("\n");
}
}
diff --git a/lib/url/URLParserPlugin.js b/lib/url/URLParserPlugin.js
index 24c6eab2ab8..7a864134edb 100644
--- a/lib/url/URLParserPlugin.js
+++ b/lib/url/URLParserPlugin.js
@@ -33,7 +33,7 @@ const PLUGIN_NAME = "URLParserPlugin";
* @param {NormalModule} module module
* @returns {URL} file url
*/
-const getUrl = module => pathToFileURL(module.resource);
+const getUrl = (module) => pathToFileURL(module.resource);
/**
* @param {Parser} parser parser parser
@@ -108,7 +108,7 @@ class URLParserPlugin {
const relative = this.options.url === "relative";
parser.hooks.canRename.for("URL").tap(PLUGIN_NAME, approve);
- parser.hooks.evaluateNewExpression.for("URL").tap(PLUGIN_NAME, expr => {
+ parser.hooks.evaluateNewExpression.for("URL").tap(PLUGIN_NAME, (expr) => {
const evaluatedExpr = getEvaluatedExpr(expr, parser);
const request = evaluatedExpr && evaluatedExpr.asString();
@@ -119,7 +119,7 @@ class URLParserPlugin {
.setString(url.toString())
.setRange(/** @type {Range} */ (expr.range));
});
- parser.hooks.new.for("URL").tap(PLUGIN_NAME, _expr => {
+ parser.hooks.new.for("URL").tap(PLUGIN_NAME, (_expr) => {
const expr = /** @type {NewExpressionNode} */ (_expr);
const { options: importOptions, errors: commentErrors } =
parser.parseCommentOptions(/** @type {Range} */ (expr.range));
@@ -185,7 +185,7 @@ class URLParserPlugin {
);
dep.loc = /** @type {DependencyLocation} */ (expr.loc);
parser.state.current.addDependency(dep);
- InnerGraph.onUsage(parser.state, e => (dep.usedByExports = e));
+ InnerGraph.onUsage(parser.state, (e) => (dep.usedByExports = e));
return true;
}
@@ -248,7 +248,7 @@ class URLParserPlugin {
parser.state.current.addDependency(dep);
return true;
});
- parser.hooks.isPure.for("NewExpression").tap(PLUGIN_NAME, _expr => {
+ parser.hooks.isPure.for("NewExpression").tap(PLUGIN_NAME, (_expr) => {
const expr = /** @type {NewExpressionNode} */ (_expr);
const { callee } = expr;
if (callee.type !== "Identifier") return;
diff --git a/lib/util/AsyncQueue.js b/lib/util/AsyncQueue.js
index 2ae918b74fb..1bbdc8a52da 100644
--- a/lib/util/AsyncQueue.js
+++ b/lib/util/AsyncQueue.js
@@ -80,7 +80,7 @@ class AsyncQueue {
this._processor = processor;
this._getKey =
getKey ||
- /** @type {getKey} */ (item => /** @type {T & K} */ (item));
+ /** @type {getKey} */ ((item) => /** @type {T & K} */ (item));
/** @type {Map>} */
this._entries = new Map();
/** @type {ArrayQueue>} */
@@ -138,7 +138,7 @@ class AsyncQueue {
*/
add(item, callback) {
if (this._stopped) return callback(new WebpackError("Queue was stopped"));
- this.hooks.beforeAdd.callAsync(item, err => {
+ this.hooks.beforeAdd.callAsync(item, (err) => {
if (err) {
callback(
makeWebpackError(err, `AsyncQueue(${this._name}).hooks.beforeAdd`)
@@ -327,7 +327,7 @@ class AsyncQueue {
* @returns {void}
*/
_startProcessing(entry) {
- this.hooks.beforeStart.callAsync(entry.item, err => {
+ this.hooks.beforeStart.callAsync(entry.item, (err) => {
if (err) {
this._handleResult(
entry,
@@ -356,7 +356,7 @@ class AsyncQueue {
* @returns {void}
*/
_handleResult(entry, err, result) {
- this.hooks.result.callAsync(entry.item, err, result, hookError => {
+ this.hooks.result.callAsync(entry.item, err, result, (hookError) => {
const error = hookError
? makeWebpackError(hookError, `AsyncQueue(${this._name}).hooks.result`)
: err;
diff --git a/lib/util/IterableHelpers.js b/lib/util/IterableHelpers.js
index c90f64e21d0..ef56089fb6a 100644
--- a/lib/util/IterableHelpers.js
+++ b/lib/util/IterableHelpers.js
@@ -10,7 +10,7 @@
* @param {Iterable} set a set
* @returns {T | undefined} last item
*/
-const last = set => {
+const last = (set) => {
let last;
for (const item of set) last = item;
return last;
@@ -34,7 +34,7 @@ const someInIterable = (iterable, filter) => {
* @param {Iterable} iterable an iterable
* @returns {number} count of items
*/
-const countIterable = iterable => {
+const countIterable = (iterable) => {
let i = 0;
for (const _ of iterable) i++;
return i;
diff --git a/lib/util/LazyBucketSortedSet.js b/lib/util/LazyBucketSortedSet.js
index 74030ce9242..26188756a16 100644
--- a/lib/util/LazyBucketSortedSet.js
+++ b/lib/util/LazyBucketSortedSet.js
@@ -162,7 +162,7 @@ class LazyBucketSortedSet {
*/
startUpdate(item) {
if (this._unsortedItems.has(item)) {
- return remove => {
+ return (remove) => {
if (remove) {
this._unsortedItems.delete(item);
this.size--;
@@ -172,7 +172,7 @@ class LazyBucketSortedSet {
const key = this._getKey(item);
if (this._leaf) {
const oldEntry = /** @type {SortableSet} */ (this._map.get(key));
- return remove => {
+ return (remove) => {
if (remove) {
this.size--;
oldEntry.delete(item);
@@ -198,7 +198,7 @@ class LazyBucketSortedSet {
/** @type {LazyBucketSortedSet} */
(this._map.get(key));
const finishUpdate = oldEntry.startUpdate(item);
- return remove => {
+ return (remove) => {
if (remove) {
this.size--;
finishUpdate(true);
diff --git a/lib/util/SetHelpers.js b/lib/util/SetHelpers.js
index aa5753c25a4..9691d9ab7a1 100644
--- a/lib/util/SetHelpers.js
+++ b/lib/util/SetHelpers.js
@@ -11,7 +11,7 @@
* @param {Set[]} sets an array of sets being checked for shared elements
* @returns {Set} returns a new Set containing the intersecting items
*/
-const intersect = sets => {
+const intersect = (sets) => {
if (sets.length === 0) return new Set();
if (sets.length === 1) return new Set(sets[0]);
let minSize = Infinity;
@@ -68,7 +68,7 @@ const find = (set, fn) => {
* @param {Set | ReadonlySet} set a set
* @returns {T | undefined} first item
*/
-const first = set => {
+const first = (set) => {
const entry = set.values().next();
return entry.done ? undefined : entry.value;
};
diff --git a/lib/util/StackedCacheMap.js b/lib/util/StackedCacheMap.js
index 735573610a0..781aa86d694 100644
--- a/lib/util/StackedCacheMap.js
+++ b/lib/util/StackedCacheMap.js
@@ -124,7 +124,7 @@ class StackedCacheMap {
* @returns {Iterator<[K, V]>} iterator
*/
[Symbol.iterator]() {
- const iterators = this.stack.map(map => map[Symbol.iterator]());
+ const iterators = this.stack.map((map) => map[Symbol.iterator]());
let current = this.map[Symbol.iterator]();
return {
next() {
diff --git a/lib/util/StackedMap.js b/lib/util/StackedMap.js
index 9797713b4da..d515db21712 100644
--- a/lib/util/StackedMap.js
+++ b/lib/util/StackedMap.js
@@ -24,7 +24,7 @@ const UNDEFINED_MARKER = Symbol("undefined");
* @param {[K, InternalCell]} pair the internal cell
* @returns {[K, Cell]} its “safe” representation
*/
-const extractPair = pair => {
+const extractPair = (pair) => {
const key = pair[0];
const val = pair[1];
if (val === UNDEFINED_MARKER || val === TOMBSTONE) {
diff --git a/lib/util/TupleSet.js b/lib/util/TupleSet.js
index 3fba7f7a41c..1916ff4d914 100644
--- a/lib/util/TupleSet.js
+++ b/lib/util/TupleSet.js
@@ -125,7 +125,7 @@ class TupleSet {
* @param {MapIterator<[T, InnerMap | Set]>} it iterator
* @returns {boolean} result
*/
- const next = it => {
+ const next = (it) => {
const result = it.next();
if (result.done) {
if (iteratorStack.length === 0) return false;
diff --git a/lib/util/WeakTupleMap.js b/lib/util/WeakTupleMap.js
index 5e0068f982e..563a8dd7016 100644
--- a/lib/util/WeakTupleMap.js
+++ b/lib/util/WeakTupleMap.js
@@ -21,7 +21,7 @@
* @param {EXPECTED_ANY} thing thing
* @returns {boolean} true if is weak
*/
-const isWeakKey = thing => typeof thing === "object" && thing !== null;
+const isWeakKey = (thing) => typeof thing === "object" && thing !== null;
/**
* @template {unknown[]} T
diff --git a/lib/util/cleverMerge.js b/lib/util/cleverMerge.js
index 88d0b8b06db..7e3fbbb71ae 100644
--- a/lib/util/cleverMerge.js
+++ b/lib/util/cleverMerge.js
@@ -123,7 +123,7 @@ const parseCache = new WeakMap();
* @param {T} obj the object
* @returns {ParsedObject} parsed object
*/
-const cachedParseObject = obj => {
+const cachedParseObject = (obj) => {
const entry = parseCache.get(/** @type {EXPECTED_OBJECT} */ (obj));
if (entry !== undefined) return entry;
const result = parseObject(obj);
@@ -138,7 +138,7 @@ const cachedParseObject = obj => {
* @param {T} obj the object
* @returns {ParsedObject} parsed object
*/
-const parseObject = obj => {
+const parseObject = (obj) => {
/** @type {ParsedObjectStatic} */
const info = new Map();
/** @type {ParsedObjectDynamic | undefined} */
@@ -147,7 +147,7 @@ const parseObject = obj => {
* @param {keyof T} p path
* @returns {Partial>} object parsed property entry
*/
- const getInfo = p => {
+ const getInfo = (p) => {
const entry = info.get(p);
if (entry !== undefined) return entry;
const newEntry = {
@@ -275,7 +275,7 @@ const VALUE_TYPE_DELETE = 4;
* @param {T} value a single value
* @returns {VALUE_TYPE_UNDEFINED | VALUE_TYPE_ATOM | VALUE_TYPE_ARRAY_EXTEND | VALUE_TYPE_OBJECT | VALUE_TYPE_DELETE} value type
*/
-const getValueType = value => {
+const getValueType = (value) => {
if (value === undefined) {
return VALUE_TYPE_UNDEFINED;
} else if (value === DELETE) {
@@ -457,7 +457,7 @@ const mergeEntries = (firstEntry, secondEntry, internalCaching) => {
}
if (
[.../** @type {ByValues} */ (firstEntry.byValues).values()].every(
- value => {
+ (value) => {
const type = getValueType(value);
return type === VALUE_TYPE_ATOM || type === VALUE_TYPE_DELETE;
}
@@ -555,7 +555,7 @@ const mergeSingleValue = (a, b, internalCaching) => {
case VALUE_TYPE_UNDEFINED:
return b;
case VALUE_TYPE_DELETE:
- return /** @type {B[]} */ (b).filter(item => item !== "...");
+ return /** @type {B[]} */ (b).filter((item) => item !== "...");
case VALUE_TYPE_ARRAY_EXTEND: {
/** @type {(A | B)[]} */
const newArray = [];
@@ -571,7 +571,7 @@ const mergeSingleValue = (a, b, internalCaching) => {
return newArray;
}
case VALUE_TYPE_OBJECT:
- return /** @type {(A | B)[]} */ (b).map(item =>
+ return /** @type {(A | B)[]} */ (b).map((item) =>
item === "..." ? /** @type {A} */ (a) : item
);
default:
@@ -618,7 +618,7 @@ const removeOperations = (obj, keysToKeepOriginalValue = []) => {
/** @type {T[keyof T]} */
(
/** @type {EXPECTED_ANY[]} */
- (value).filter(i => i !== "...")
+ (value).filter((i) => i !== "...")
);
break;
default:
diff --git a/lib/util/comparators.js b/lib/util/comparators.js
index 034a1740460..5e8004c83dd 100644
--- a/lib/util/comparators.js
+++ b/lib/util/comparators.js
@@ -46,10 +46,10 @@ const { compareRuntime } = require("./runtime");
* @param {RawParameterizedComparator} fn comparator with argument
* @returns {ParameterizedComparator} comparator
*/
-const createCachedParameterizedComparator = fn => {
+const createCachedParameterizedComparator = (fn) => {
/** @type {WeakMap>} */
const map = new WeakMap();
- return arg => {
+ return (arg) => {
const cachedResult = map.get(/** @type {EXPECTED_OBJECT} */ (arg));
if (cachedResult !== undefined) return cachedResult;
/**
@@ -82,7 +82,7 @@ const compareIds = (a, b) => {
* @param {Comparator} elementComparator comparator for elements
* @returns {Comparator>} comparator for iterables of elements
*/
-const compareIterables = elementComparator => {
+const compareIterables = (elementComparator) => {
const cacheEntry = compareIteratorsCache.get(elementComparator);
if (cacheEntry !== undefined) return cacheEntry;
/**
@@ -468,7 +468,7 @@ const compareIteratorsCache = new WeakMap();
* @param {Iterable} iterable original ordered list
* @returns {Comparator} comparator
*/
-const keepOriginalOrder = iterable => {
+const keepOriginalOrder = (iterable) => {
/** @type {Map} */
const map = new Map();
let i = 0;
@@ -486,21 +486,21 @@ const keepOriginalOrder = iterable => {
* @param {ChunkGraph} chunkGraph the chunk graph
* @returns {Comparator} comparator
*/
-const compareChunksNatural = chunkGraph => {
+const compareChunksNatural = (chunkGraph) => {
const cmpFn = module.exports.compareModulesById(chunkGraph);
const cmpIterableFn = compareIterables(cmpFn);
return concatComparators(
compareSelect(
- chunk => /** @type {string|number} */ (chunk.name),
+ (chunk) => /** @type {string|number} */ (chunk.name),
compareIds
),
- compareSelect(chunk => chunk.runtime, compareRuntime),
+ compareSelect((chunk) => chunk.runtime, compareRuntime),
compareSelect(
/**
* @param {Chunk} chunk a chunk
* @returns {Iterable} modules
*/
- chunk => chunkGraph.getOrderedChunkModulesIterable(chunk, cmpFn),
+ (chunk) => chunkGraph.getOrderedChunkModulesIterable(chunk, cmpFn),
cmpIterableFn
)
);
@@ -519,7 +519,7 @@ const sortWithSourceOrder = (dependencies, dependencySourceOrderMap) => {
* @param {Dependency} dep dependency
* @returns {number} source order
*/
- const getSourceOrder = dep => {
+ const getSourceOrder = (dep) => {
if (dependencySourceOrderMap.has(dep)) {
const { main } = /** @type {DependencySourceOrder} */ (
dependencySourceOrderMap.get(dep)
@@ -536,7 +536,7 @@ const sortWithSourceOrder = (dependencies, dependencySourceOrderMap) => {
* @param {number | undefined} sourceOrder sourceOrder
* @returns {boolean} needReSort
*/
- const needReSort = sourceOrder => {
+ const needReSort = (sourceOrder) => {
if (typeof sourceOrder === "number") {
return true;
}
diff --git a/lib/util/compileBooleanMatcher.js b/lib/util/compileBooleanMatcher.js
index ca17d55b2a7..551675d764d 100644
--- a/lib/util/compileBooleanMatcher.js
+++ b/lib/util/compileBooleanMatcher.js
@@ -9,13 +9,13 @@
* @param {string} str string
* @returns {string} quoted meta
*/
-const quoteMeta = str => str.replace(/[-[\]\\/{}()*+?.^$|]/g, "\\$&");
+const quoteMeta = (str) => str.replace(/[-[\]\\/{}()*+?.^$|]/g, "\\$&");
/**
* @param {string} str string
* @returns {string} string
*/
-const toSimpleString = str => {
+const toSimpleString = (str) => {
if (`${Number(str)}` === str) {
return str;
}
@@ -26,9 +26,9 @@ const toSimpleString = str => {
* @param {Record} map value map
* @returns {boolean | ((value: string) => string)} true/false, when unconditionally true/false, or a template function to determine the value at runtime
*/
-const compileBooleanMatcher = map => {
- const positiveItems = Object.keys(map).filter(i => map[i]);
- const negativeItems = Object.keys(map).filter(i => !map[i]);
+const compileBooleanMatcher = (map) => {
+ const positiveItems = Object.keys(map).filter((i) => map[i]);
+ const negativeItems = Object.keys(map).filter((i) => !map[i]);
if (positiveItems.length === 0) return false;
if (negativeItems.length === 0) return true;
return compileBooleanMatcherFromLists(positiveItems, negativeItems);
@@ -43,17 +43,17 @@ const compileBooleanMatcherFromLists = (positiveItems, negativeItems) => {
if (positiveItems.length === 0) return () => "false";
if (negativeItems.length === 0) return () => "true";
if (positiveItems.length === 1) {
- return value => `${toSimpleString(positiveItems[0])} == ${value}`;
+ return (value) => `${toSimpleString(positiveItems[0])} == ${value}`;
}
if (negativeItems.length === 1) {
- return value => `${toSimpleString(negativeItems[0])} != ${value}`;
+ return (value) => `${toSimpleString(negativeItems[0])} != ${value}`;
}
const positiveRegexp = itemsToRegexp(positiveItems);
const negativeRegexp = itemsToRegexp(negativeItems);
if (positiveRegexp.length <= negativeRegexp.length) {
- return value => `/^${positiveRegexp}$/.test(${value})`;
+ return (value) => `/^${positiveRegexp}$/.test(${value})`;
}
- return value => `!/^${negativeRegexp}$/.test(${value})`;
+ return (value) => `!/^${negativeRegexp}$/.test(${value})`;
};
/**
@@ -94,7 +94,7 @@ const popCommonItems = (itemsSet, getKey, condition) => {
* @param {Array} items items
* @returns {string} common prefix
*/
-const getCommonPrefix = items => {
+const getCommonPrefix = (items) => {
let prefix = items[0];
for (let i = 1; i < items.length; i++) {
const item = items[i];
@@ -112,7 +112,7 @@ const getCommonPrefix = items => {
* @param {Array} items items
* @returns {string} common suffix
*/
-const getCommonSuffix = items => {
+const getCommonSuffix = (items) => {
let suffix = items[0];
for (let i = 1; i < items.length; i++) {
const item = items[i];
@@ -130,7 +130,7 @@ const getCommonSuffix = items => {
* @param {Array} itemsArr array of items
* @returns {string} regexp
*/
-const itemsToRegexp = itemsArr => {
+const itemsToRegexp = (itemsArr) => {
if (itemsArr.length === 1) {
return quoteMeta(itemsArr[0]);
}
@@ -165,11 +165,11 @@ const itemsToRegexp = itemsArr => {
if (finishedItems.length === 0 && items.size === 2) {
const prefix = getCommonPrefix(itemsArr);
const suffix = getCommonSuffix(
- itemsArr.map(item => item.slice(prefix.length))
+ itemsArr.map((item) => item.slice(prefix.length))
);
if (prefix.length > 0 || suffix.length > 0) {
return `${quoteMeta(prefix)}${itemsToRegexp(
- itemsArr.map(i => i.slice(prefix.length, -suffix.length || undefined))
+ itemsArr.map((i) => i.slice(prefix.length, -suffix.length || undefined))
)}${quoteMeta(suffix)}`;
}
}
@@ -190,8 +190,8 @@ const itemsToRegexp = itemsArr => {
// find common prefix: (a1|a2|a3|a4|b5) => (a(1|2|3|4)|b5)
const prefixed = popCommonItems(
items,
- item => (item.length >= 1 ? item[0] : false),
- list => {
+ (item) => (item.length >= 1 ? item[0] : false),
+ (list) => {
if (list.length >= 3) return true;
if (list.length <= 1) return false;
return list[0][1] === list[1][1];
@@ -201,7 +201,7 @@ const itemsToRegexp = itemsArr => {
const prefix = getCommonPrefix(prefixedItems);
finishedItems.push(
`${quoteMeta(prefix)}${itemsToRegexp(
- prefixedItems.map(i => i.slice(prefix.length))
+ prefixedItems.map((i) => i.slice(prefix.length))
)}`
);
}
@@ -209,8 +209,8 @@ const itemsToRegexp = itemsArr => {
// find common suffix: (a1|b1|c1|d1|e2) => ((a|b|c|d)1|e2)
const suffixed = popCommonItems(
items,
- item => (item.length >= 1 ? item.slice(-1) : false),
- list => {
+ (item) => (item.length >= 1 ? item.slice(-1) : false),
+ (list) => {
if (list.length >= 3) return true;
if (list.length <= 1) return false;
return list[0].slice(-2) === list[1].slice(-2);
@@ -220,7 +220,7 @@ const itemsToRegexp = itemsArr => {
const suffix = getCommonSuffix(suffixedItems);
finishedItems.push(
`${itemsToRegexp(
- suffixedItems.map(i => i.slice(0, -suffix.length))
+ suffixedItems.map((i) => i.slice(0, -suffix.length))
)}${quoteMeta(suffix)}`
);
}
diff --git a/lib/util/concatenate.js b/lib/util/concatenate.js
index db799b8891d..7dc16cf1304 100644
--- a/lib/util/concatenate.js
+++ b/lib/util/concatenate.js
@@ -22,13 +22,13 @@ const NAMESPACE_OBJECT_EXPORT = "__WEBPACK_NAMESPACE_OBJECT__";
* @param {Variable} variable variable
* @returns {Reference[]} references
*/
-const getAllReferences = variable => {
+const getAllReferences = (variable) => {
let set = variable.references;
// Look for inner scope variables too (like in class Foo { t() { Foo } })
const identifiers = new Set(variable.identifiers);
for (const scope of variable.scope.childScopes) {
for (const innerVar of scope.variables) {
- if (innerVar.identifiers.some(id => identifiers.has(id))) {
+ if (innerVar.identifiers.some((id) => identifiers.has(id))) {
set = [...set, ...innerVar.references];
break;
}
@@ -53,7 +53,7 @@ const getPathInAst = (ast, node) => {
* @param {Node} n node
* @returns {Node[] | undefined} result
*/
- const enterNode = n => {
+ const enterNode = (n) => {
if (!n) return;
const r = n.range;
if (r && r[0] <= nr[0] && r[1] >= nr[1]) {
diff --git a/lib/util/conventions.js b/lib/util/conventions.js
index b1ad4ea9e95..f60517870c9 100644
--- a/lib/util/conventions.js
+++ b/lib/util/conventions.js
@@ -11,7 +11,7 @@
* @param {string} string string
* @returns {string} result
*/
-const preserveCamelCase = string => {
+const preserveCamelCase = (string) => {
let result = string;
let isLastCharLower = false;
let isLastCharUpper = false;
@@ -54,7 +54,7 @@ const preserveCamelCase = string => {
* @param {string} input input
* @returns {string} result
*/
-module.exports.camelCase = input => {
+module.exports.camelCase = (input) => {
let result = input.trim();
if (result.length === 0) {
@@ -75,7 +75,7 @@ module.exports.camelCase = input => {
.replace(/^[_.\- ]+/, "")
.toLowerCase()
.replace(/[_.\- ]+([\p{Alpha}\p{N}_]|$)/gu, (_, p1) => p1.toUpperCase())
- .replace(/\d+([\p{Alpha}\p{N}_]|$)/gu, m => m.toUpperCase());
+ .replace(/\d+([\p{Alpha}\p{N}_]|$)/gu, (m) => m.toUpperCase());
};
/**
@@ -121,5 +121,5 @@ module.exports.cssExportConvention = (input, convention) => {
* @param {string} input input
* @returns {string} result
*/
-module.exports.dashesCamelCase = input =>
+module.exports.dashesCamelCase = (input) =>
input.replace(/-+(\w)/g, (match, firstLetter) => firstLetter.toUpperCase());
diff --git a/lib/util/create-schema-validation.js b/lib/util/create-schema-validation.js
index be9f38ca3d1..6364eda65ff 100644
--- a/lib/util/create-schema-validation.js
+++ b/lib/util/create-schema-validation.js
@@ -22,7 +22,7 @@ const getValidate = memoize(() => require("schema-utils").validate);
*/
const createSchemaValidation = (check, getSchema, options) => {
getSchema = memoize(getSchema);
- return value => {
+ return (value) => {
if (check && value && !check(value)) {
getValidate()(
getSchema(),
diff --git a/lib/util/createHash.js b/lib/util/createHash.js
index a3ad731cb85..2ff475af8f2 100644
--- a/lib/util/createHash.js
+++ b/lib/util/createHash.js
@@ -154,7 +154,7 @@ let BatchedHash;
* @param {HashFunction} algorithm the algorithm name or a constructor creating a hash
* @returns {Hash} the hash
*/
-module.exports = algorithm => {
+module.exports = (algorithm) => {
if (typeof algorithm === "function") {
// eslint-disable-next-line new-cap
return new BulkUpdateDecorator(() => new algorithm());
diff --git a/lib/util/deprecation.js b/lib/util/deprecation.js
index 68537a721b1..5d3b61b31d3 100644
--- a/lib/util/deprecation.js
+++ b/lib/util/deprecation.js
@@ -146,7 +146,7 @@ module.exports.arrayToSetDeprecation = (set, name) => {
* @param {number} index index
* @returns {() => T | undefined} value
*/
- const createIndexGetter = index => {
+ const createIndexGetter = (index) => {
/**
* @this {Set} a Set
* @returns {T | undefined} the value at this location
@@ -164,7 +164,7 @@ module.exports.arrayToSetDeprecation = (set, name) => {
/**
* @param {number} index index
*/
- const defineIndexGetter = index => {
+ const defineIndexGetter = (index) => {
Object.defineProperty(set, index, {
get: createIndexGetter(index),
set(value) {
@@ -199,7 +199,7 @@ module.exports.arrayToSetDeprecation = (set, name) => {
* @param {string} name name
* @returns {{ new (values?: readonly T[] | null): SetDeprecatedArray }} SetDeprecatedArray
*/
-module.exports.createArrayToSetDeprecationSet = name => {
+module.exports.createArrayToSetDeprecationSet = (name) => {
let initialized = false;
/**
@@ -275,7 +275,7 @@ const deprecateAllProperties = (obj, message, code) => {
* @param {T} v value
* @returns {T} result
*/
- v => (value = v),
+ (v) => (value = v),
message,
code
)
diff --git a/lib/util/deterministicGrouping.js b/lib/util/deterministicGrouping.js
index ea289983bfd..4331a3e47f4 100644
--- a/lib/util/deterministicGrouping.js
+++ b/lib/util/deterministicGrouping.js
@@ -97,7 +97,7 @@ const subtractSizeFrom = (total, size) => {
* @param {Iterable>} nodes some nodes
* @returns {Record} total size
*/
-const sumSize = nodes => {
+const sumSize = (nodes) => {
const sum = Object.create(null);
for (const node of nodes) {
addSizeTo(sum, node.size);
@@ -249,7 +249,7 @@ class Group {
* @param {Iterable>} nodes nodes
* @returns {number[]} similarities
*/
-const getSimilarities = nodes => {
+const getSimilarities = (nodes) => {
// calculate similarities between lexically adjacent nodes
/** @type {number[]} */
const similarities = [];
@@ -292,7 +292,7 @@ module.exports = ({ maxSize, minSize, items, getSize, getKey }) => {
const nodes = Array.from(
items,
- item => new Node(item, getKey(item), getSize(item))
+ (item) => new Node(item, getKey(item), getSize(item))
);
/** @type {Node[]} */
@@ -329,12 +329,12 @@ module.exports = ({ maxSize, minSize, items, getSize, getKey }) => {
// We hit an edge case where the working set is already smaller than minSize
// We merge problematic nodes with the smallest result node to keep minSize intact
const problemNodes = group.popNodes(
- n => getNumberOfMatchingSizeTypes(n.size, problemTypes) > 0
+ (n) => getNumberOfMatchingSizeTypes(n.size, problemTypes) > 0
);
if (problemNodes === undefined) return false;
// Only merge it with result nodes that have the problematic size type
const possibleResultGroups = result.filter(
- n => getNumberOfMatchingSizeTypes(n.size, problemTypes) > 0
+ (n) => getNumberOfMatchingSizeTypes(n.size, problemTypes) > 0
);
if (possibleResultGroups.length > 0) {
const bestGroup = possibleResultGroups.reduce((min, group) => {
@@ -531,11 +531,11 @@ module.exports = ({ maxSize, minSize, items, getSize, getKey }) => {
// return the results
return result.map(
- group =>
+ (group) =>
/** @type {GroupedItems} */
({
key: group.key,
- items: group.nodes.map(node => node.item),
+ items: group.nodes.map((node) => node.item),
size: group.size
})
);
diff --git a/lib/util/findGraphRoots.js b/lib/util/findGraphRoots.js
index 8b674a8c79d..d7d02e49f3b 100644
--- a/lib/util/findGraphRoots.js
+++ b/lib/util/findGraphRoots.js
@@ -224,7 +224,7 @@ module.exports = (items, getDependencies) => {
// When roots were found, return them
if (roots.size > 0) {
- return Array.from(roots, r => r.item);
+ return Array.from(roots, (r) => r.item);
}
throw new Error("Implementation of findGraphRoots is broken");
diff --git a/lib/util/fs.js b/lib/util/fs.js
index f6646ddb6be..267e1d14aa6 100644
--- a/lib/util/fs.js
+++ b/lib/util/fs.js
@@ -523,7 +523,7 @@ const dirname = (fs, absPath) => {
* @returns {void}
*/
const mkdirp = (fs, p, callback) => {
- fs.mkdir(p, err => {
+ fs.mkdir(p, (err) => {
if (err) {
if (err.code === "ENOENT") {
const dir = dirname(fs, p);
@@ -531,12 +531,12 @@ const mkdirp = (fs, p, callback) => {
callback(err);
return;
}
- mkdirp(fs, dir, err => {
+ mkdirp(fs, dir, (err) => {
if (err) {
callback(err);
return;
}
- fs.mkdir(p, err => {
+ fs.mkdir(p, (err) => {
if (err) {
if (err.code === "EEXIST") {
callback();
diff --git a/lib/util/identifier.js b/lib/util/identifier.js
index b53efcd842a..1bcdc51a077 100644
--- a/lib/util/identifier.js
+++ b/lib/util/identifier.js
@@ -14,7 +14,7 @@ const WINDOWS_PATH_SEPARATOR_REGEXP = /\\/g;
* @param {string} relativePath relative path
* @returns {string} request
*/
-const relativePathToRequest = relativePath => {
+const relativePathToRequest = (relativePath) => {
if (relativePath === "") return "./.";
if (relativePath === "..") return "../.";
if (relativePath.startsWith("../")) return relativePath;
@@ -103,7 +103,7 @@ const requestToAbsolute = (context, relativePath) => {
* @param {((value: string) => T)} realFn real function
* @returns {MakeCacheableResult & { bindCache: BindCache }} cacheable function
*/
-const makeCacheable = realFn => {
+const makeCacheable = (realFn) => {
/**
* @template T
* @typedef {Map} CacheItem
@@ -115,7 +115,7 @@ const makeCacheable = realFn => {
* @param {AssociatedObjectForCache} associatedObjectForCache an object to which the cache will be attached
* @returns {CacheItem} cache item
*/
- const getCache = associatedObjectForCache => {
+ const getCache = (associatedObjectForCache) => {
const entry = cache.get(associatedObjectForCache);
if (entry !== undefined) return entry;
/** @type {Map