webpack 5.106.1 → 5.106.2

package/lib/util/comparators.js

@@ -24,27 +24,32 @@ const { compareRuntime } = require("./runtime");
 /** @typedef {import("../dependencies/ModuleDependency")} ModuleDependency */
 
 /**
+ * Defines the dependency source order type used by this module.
  * @typedef {object} DependencySourceOrder
  * @property {number} main the main source order
  * @property {number} sub the sub source order
  */
 
 /**
+ * Defines the comparator type used by this module.
  * @template T
  * @typedef {(a: T, b: T) => -1 | 0 | 1} Comparator
  */
 /**
+ * Defines the raw parameterized comparator type used by this module.
  * @template {object} TArg
  * @template T
  * @typedef {(tArg: TArg, a: T, b: T) => -1 | 0 | 1} RawParameterizedComparator
  */
 /**
+ * Defines the parameterized comparator type used by this module.
  * @template {object} TArg
  * @template T
  * @typedef {(tArg: TArg) => Comparator<T>} ParameterizedComparator
  */
 
 /**
+ * Creates a cached parameterized comparator.
  * @template {object} TArg
  * @template {object} T
  * @param {RawParameterizedComparator<TArg, T>} fn comparator with argument
@@ -57,6 +62,7 @@ const createCachedParameterizedComparator = (fn) => {
 		const cachedResult = map.get(/** @type {EXPECTED_OBJECT} */ (arg));
 		if (cachedResult !== undefined) return cachedResult;
 		/**
+		 * Returns compare result.
 		 * @param {T} a first item
 		 * @param {T} b second item
 		 * @returns {-1 | 0 | 1} compare result
@@ -68,6 +74,7 @@ const createCachedParameterizedComparator = (fn) => {
 };
 
 /**
+ * Compares the provided values and returns their ordering.
  * @param {string | number} a first id
  * @param {string | number} b second id
  * @returns {-1 | 0 | 1} compare result
@@ -82,6 +89,7 @@ const compareIds = (a, b) => {
 };
 
 /**
+ * Compares iterables.
  * @template T
  * @param {Comparator<T>} elementComparator comparator for elements
  * @returns {Comparator<Iterable<T>>} comparator for iterables of elements
@@ -90,6 +98,7 @@ const compareIterables = (elementComparator) => {
 	const cacheEntry = compareIteratorsCache.get(elementComparator);
 	if (cacheEntry !== undefined) return cacheEntry;
 	/**
+	 * Returns compare result.
 	 * @param {Iterable<T>} a first value
 	 * @param {Iterable<T>} b second value
 	 * @returns {-1 | 0 | 1} compare result
@@ -177,6 +186,7 @@ const compareLocations = (a, b) => {
 };
 
 /**
+ * Compares modules by id.
  * @param {ChunkGraph} chunkGraph the chunk graph
  * @param {Module} a module
  * @param {Module} b module
@@ -189,6 +199,7 @@ const compareModulesById = (chunkGraph, a, b) =>
 	);
 
 /**
+ * Compares the provided values and returns their ordering.
  * @param {number} a number
  * @param {number} b number
  * @returns {-1 | 0 | 1} compare result
@@ -203,6 +214,7 @@ const compareNumbers = (a, b) => {
 };
 
 /**
+ * Compares strings numeric.
  * @param {string} a string
  * @param {string} b string
  * @returns {-1 | 0 | 1} compare result
@@ -274,6 +286,7 @@ const compareStringsNumeric = (a, b) => {
 };
 
 /**
+ * Compares modules by post order index or identifier.
  * @param {ModuleGraph} moduleGraph the module graph
  * @param {Module} a module
  * @param {Module} b module
@@ -289,6 +302,7 @@ const compareModulesByPostOrderIndexOrIdentifier = (moduleGraph, a, b) => {
 };
 
 /**
+ * Compares modules by pre order index or identifier.
  * @param {ModuleGraph} moduleGraph the module graph
  * @param {Module} a module
  * @param {Module} b module
@@ -304,6 +318,7 @@ const compareModulesByPreOrderIndexOrIdentifier = (moduleGraph, a, b) => {
 };
 
 /**
+ * Compares modules by id or identifier.
  * @param {ChunkGraph} chunkGraph the chunk graph
  * @param {Module} a module
  * @param {Module} b module
@@ -332,6 +347,7 @@ const compareModulesByFullName = (compiler, a, b) => {
 };
 
 /**
+ * Compares the provided values and returns their ordering.
  * @param {ChunkGraph} chunkGraph the chunk graph
  * @param {Chunk} a chunk
  * @param {Chunk} b chunk
@@ -340,6 +356,7 @@ const compareModulesByFullName = (compiler, a, b) => {
 const compareChunks = (chunkGraph, a, b) => chunkGraph.compareChunks(a, b);
 
 /**
+ * Compares the provided values and returns their ordering.
  * @param {string} a first string
  * @param {string} b second string
  * @returns {-1 | 0 | 1} compare result
@@ -351,6 +368,7 @@ const compareStrings = (a, b) => {
 };
 
 /**
+ * Compares chunk groups by index.
  * @param {ChunkGroup} a first chunk group
  * @param {ChunkGroup} b second chunk group
  * @returns {-1 | 0 | 1} compare result
@@ -359,6 +377,7 @@ const compareChunkGroupsByIndex = (a, b) =>
 	/** @type {number} */ (a.index) < /** @type {number} */ (b.index) ? -1 : 1;
 
 /**
+ * Represents TwoKeyWeakMap.
  * @template {EXPECTED_OBJECT} K1
  * @template {EXPECTED_OBJECT} K2
  * @template T
@@ -373,6 +392,7 @@ class TwoKeyWeakMap {
 	}
 
 	/**
+	 * Returns value.
 	 * @param {K1} key1 first key
 	 * @param {K2} key2 second key
 	 * @returns {T | undefined} value
@@ -386,6 +406,7 @@ class TwoKeyWeakMap {
 	}
 
 	/**
+	 * Updates value using the provided key1.
 	 * @param {K1} key1 first key
 	 * @param {K2} key2 second key
 	 * @param {T | undefined} value new value
@@ -405,6 +426,7 @@ class TwoKeyWeakMap {
 const concatComparatorsCache = new TwoKeyWeakMap();
 
 /**
+ * Concat comparators.
  * @template T
  * @param {Comparator<T>} c1 comparator
  * @param {Comparator<T>} c2 comparator
@@ -421,6 +443,7 @@ const concatComparators = (c1, c2, ...cRest) => {
 	);
 	if (cacheEntry !== undefined) return cacheEntry;
 	/**
+	 * Returns compare result.
 	 * @param {T} a first value
 	 * @param {T} b second value
 	 * @returns {-1 | 0 | 1} compare result
@@ -435,6 +458,7 @@ const concatComparators = (c1, c2, ...cRest) => {
 };
 
 /**
+ * Defines the selector type used by this module.
  * @template A, B
  * @typedef {(input: A) => B | undefined | null} Selector
  */
@@ -443,6 +467,7 @@ const concatComparators = (c1, c2, ...cRest) => {
 const compareSelectCache = new TwoKeyWeakMap();
 
 /**
+ * Compares the provided values and returns their ordering.
  * @template T
  * @template R
  * @param {Selector<T, R>} getter getter for value
@@ -453,6 +478,7 @@ const compareSelect = (getter, comparator) => {
 	const cacheEntry = compareSelectCache.get(getter, comparator);
 	if (cacheEntry !== undefined) return cacheEntry;
 	/**
+	 * Returns compare result.
 	 * @param {T} a first value
 	 * @param {T} b second value
 	 * @returns {-1 | 0 | 1} compare result
@@ -481,6 +507,7 @@ const compareIteratorsCache = new WeakMap();
 // TODO this is no longer needed when minimum node.js version is >= 12
 // since these versions ship with a stable sort function
 /**
+ * Keep original order.
  * @template T
  * @param {Iterable<T>} iterable original ordered list
  * @returns {Comparator<T>} comparator
@@ -500,6 +527,7 @@ const keepOriginalOrder = (iterable) => {
 };
 
 /**
+ * Compares chunks natural.
  * @param {ChunkGraph} chunkGraph the chunk graph
  * @returns {Comparator<Chunk>} comparator
  */
@@ -511,6 +539,7 @@ const compareChunksNatural = (chunkGraph) => {
 		compareSelect((chunk) => chunk.runtime, compareRuntime),
 		compareSelect(
 			/**
+			 * Handles the callback logic for this hook.
 			 * @param {Chunk} chunk a chunk
 			 * @returns {Iterable<Module>} modules
 			 */
@@ -591,6 +620,7 @@ module.exports.compareChunkGroupsByIndex = compareChunkGroupsByIndex;
 module.exports.compareChunks =
 	createCachedParameterizedComparator(compareChunks);
 /**
+ * Returns compare result.
  * @param {Chunk} a chunk
  * @param {Chunk} b chunk
  * @returns {-1 | 0 | 1} compare result
@@ -617,6 +647,7 @@ module.exports.compareModulesById =
 module.exports.compareModulesByIdOrIdentifier =
 	createCachedParameterizedComparator(compareModulesByIdOrIdentifier);
 /**
+ * Returns compare result.
  * @param {Module} a module
  * @param {Module} b module
  * @returns {-1 | 0 | 1} compare result

package/lib/util/compileBooleanMatcher.js

@@ -6,12 +6,14 @@
 "use strict";
 
 /**
+ * Returns quoted meta.
  * @param {string} str string
  * @returns {string} quoted meta
  */
 const quoteMeta = (str) => str.replace(/[-[\]\\/{}()*+?.^$|]/g, "\\$&");
 
 /**
+ * Quote meta in char class.
  * @param {string} char character to escape for use in character class
  * @returns {string} escaped character
  */
@@ -85,6 +87,7 @@ const formatRange = (start, end) => {
 };
 
 /**
+ * Returns string.
  * @param {string} str string
  * @returns {string} string
  */
@@ -96,6 +99,7 @@ const toSimpleString = (str) => {
 };
 
 /**
+ * Compile boolean matcher.
  * @param {Record<string | number, boolean>} map value map
  * @returns {boolean | ((value: string) => string)} true/false, when unconditionally true/false, or a template function to determine the value at runtime
  */
@@ -108,6 +112,7 @@ const compileBooleanMatcher = (map) => {
 };
 
 /**
+ * Compile boolean matcher from lists.
  * @param {string[]} positiveItems positive items
  * @param {string[]} negativeItems negative items
  * @returns {(value: string) => string} a template function to determine the value at runtime
@@ -132,6 +137,7 @@ const compileBooleanMatcherFromLists = (positiveItems, negativeItems) => {
 /** @typedef {string[][]} ListOfCommonItems */
 
 /**
+ * Returns list of common items.
  * @param {Set<string>} itemsSet items set
  * @param {(str: string) => string | false} getKey get key function
  * @param {(str: string[]) => boolean} condition condition
@@ -166,6 +172,7 @@ const popCommonItems = (itemsSet, getKey, condition) => {
 };
 
 /**
+ * Gets common prefix.
  * @param {string[]} items items
  * @returns {string} common prefix
  */
@@ -184,6 +191,7 @@ const getCommonPrefix = (items) => {
 };
 
 /**
+ * Gets common suffix.
  * @param {string[]} items items
  * @returns {string} common suffix
  */
@@ -202,6 +210,7 @@ const getCommonSuffix = (items) => {
 };
 
 /**
+ * Returns regexp.
  * @param {string[]} itemsArr array of items
  * @returns {string} regexp
  */

package/lib/util/concatenate.js

@@ -18,6 +18,7 @@ const DEFAULT_EXPORT = "__WEBPACK_DEFAULT_EXPORT__";
 const NAMESPACE_OBJECT_EXPORT = "__WEBPACK_NAMESPACE_OBJECT__";
 
 /**
+ * Gets all references.
  * @param {Variable} variable variable
  * @returns {Reference[]} references
  */
@@ -37,6 +38,7 @@ const getAllReferences = (variable) => {
 };
 
 /**
+ * Returns result.
  * @param {Node | Node[]} ast ast
  * @param {Node} node node
  * @returns {undefined | Node[]} result
@@ -49,6 +51,7 @@ const getPathInAst = (ast, node) => {
 	const nr = /** @type {Range} */ (node.range);
 
 	/**
+	 * Returns result.
 	 * @param {Node} n node
 	 * @returns {Node[] | undefined} result
 	 */
@@ -92,6 +95,7 @@ const getPathInAst = (ast, node) => {
 };
 
 /**
+ * Returns found new name.
  * @param {string} oldName old name
  * @param {UsedNames} usedNamed1 used named 1
  * @param {UsedNames} usedNamed2 used named 2
@@ -142,6 +146,7 @@ function findNewName(oldName, usedNamed1, usedNamed2, extraInfo) {
 /** @typedef {Set<Scope>} ScopeSet */
 
 /**
+ * Adds scope symbols.
  * @param {Scope | null} s scope
  * @param {UsedNames} nameSet name set
  * @param {ScopeSet} scopeSet1 scope set 1
@@ -202,6 +207,7 @@ const RESERVED_NAMES = new Set(
 /** @typedef {Map<string, ScopeInfo>} UsedNamesInScopeInfo */
 
 /**
+ * Gets used names in scope info.
  * @param {UsedNamesInScopeInfo} usedNamesInScopeInfo used names in scope info
  * @param {string} module module identifier
  * @param {string} id export id

package/lib/util/conventions.js

@@ -8,6 +8,7 @@
 /** @typedef {import("../../declarations/WebpackOptions").CssGeneratorExportsConvention} CssGeneratorExportsConvention */
 // Copy from css-loader
 /**
+ * Preserve camel case.
  * @param {string} string string
  * @returns {string} result
  */
@@ -51,6 +52,7 @@ const preserveCamelCase = (string) => {
 
 // Copy from css-loader
 /**
+ * Returns result.
  * @param {string} input input
  * @returns {string} result
  */
@@ -79,6 +81,7 @@ module.exports.camelCase = (input) => {
 };
 
 /**
+ * Returns results.
  * @param {string} input input
  * @param {CssGeneratorExportsConvention | undefined} convention convention
  * @returns {string[]} results
@@ -119,6 +122,7 @@ module.exports.cssExportConvention = (input, convention) => {
 
 // Copy from css-loader
 /**
+ * Returns result.
  * @param {string} input input
  * @returns {string} result
  */

package/lib/util/dataURL.js

@@ -10,6 +10,7 @@
 const URIRegEx = /^data:([^;,]+)?((?:;[^;,]+)*?)(?:;(base64)?)?,(.*)$/i;
 
 /**
+ * Decodes the provided uri.
  * @param {string} uri data URI
  * @returns {Buffer | null} decoded data
  */

package/lib/util/deprecation.js

@@ -11,16 +11,19 @@ const util = require("util");
 const deprecationCache = new Map();
 
 /**
+ * Defines the fake hook marker type used by this module.
  * @typedef {object} FakeHookMarker
  * @property {true} _fakeHook it's a fake hook
  */
 
 /**
+ * Defines the shared type used by this module.
  * @template T
  * @typedef {T & FakeHookMarker} FakeHook<T>
  */
 
 /**
+ * Creates a deprecation.
  * @param {string} message deprecation message
  * @param {string} code deprecation code
  * @returns {() => void} function to trigger deprecation
@@ -74,11 +77,13 @@ const DISABLED_METHODS = [
 ];
 
 /**
+ * Defines the set with deprecated array methods type used by this module.
  * @template T
  * @typedef {Set<T> & { [Symbol.isConcatSpreadable]: boolean } & { push: (...items: T[]) => void, length?: number } & { [P in DISABLED_METHODS_NAMES]: () => void } & { [P in COPY_METHODS_NAMES]: P extends keyof Array<T> ? () => Pick<Array<T>, P> : never }} SetWithDeprecatedArrayMethods
  */
 
 /**
+ * Processes the provided set.
  * @template T
  * @param {Set<T>} set new set
  * @param {string} name property name
@@ -139,11 +144,13 @@ module.exports.arrayToSetDeprecation = (set, name) => {
 		};
 	}
 	/**
+	 * Creates an index getter.
 	 * @param {number} index index
 	 * @returns {() => T | undefined} value
 	 */
 	const createIndexGetter = (index) => {
 		/**
+		 * Returns the value at this location.
 		 * @this {Set<T>} a Set
 		 * @returns {T | undefined} the value at this location
 		 */
@@ -158,6 +165,7 @@ module.exports.arrayToSetDeprecation = (set, name) => {
 		return fn;
 	};
 	/**
+	 * Define index getter.
 	 * @param {number} index index
 	 */
 	const defineIndexGetter = (index) => {
@@ -192,6 +200,7 @@ module.exports.arrayToSetDeprecation = (set, name) => {
 };
 
 /**
+ * Returns } SetDeprecatedArray.
  * @template T
  * @param {string} name name
  * @returns {{ new <T = EXPECTED_ANY>(values?: ReadonlyArray<T> | null): SetDeprecatedArray<T> }} SetDeprecatedArray
@@ -200,10 +209,12 @@ module.exports.createArrayToSetDeprecationSet = (name) => {
 	let initialized = false;
 
 	/**
+	 * Represents SetDeprecatedArray.
 	 * @template T
 	 */
 	class SetDeprecatedArray extends Set {
 		/**
+		 * Creates an instance of SetDeprecatedArray.
 		 * @param {ReadonlyArray<T> | null=} items items
 		 */
 		constructor(items) {
@@ -222,6 +233,7 @@ module.exports.createArrayToSetDeprecationSet = (name) => {
 };
 
 /**
+ * Returns fake hook which redirects.
  * @template {object} T
  * @param {T} fakeHook fake hook implementation
  * @param {string=} message deprecation message (not deprecated when unset)
@@ -238,6 +250,7 @@ module.exports.createFakeHook = (fakeHook, message, code) => {
 };
 
 /**
+ * Deprecate all properties.
  * @template T
  * @param {T} obj object
  * @param {string} message deprecation message
@@ -269,6 +282,7 @@ const deprecateAllProperties = (obj, message, code) => {
 				set: descriptor.writable
 					? util.deprecate(
 							/**
+							 * Handles the callback logic for this hook.
 							 * @template T
 							 * @param {T} v value
 							 * @returns {T} result
@@ -287,6 +301,7 @@ const deprecateAllProperties = (obj, message, code) => {
 module.exports.deprecateAllProperties = deprecateAllProperties;
 
 /**
+ * Returns frozen object with deprecation when modifying.
  * @template {object} T
  * @param {T} obj object
  * @param {string} name property name
@@ -302,6 +317,7 @@ module.exports.soonFrozenObjectDeprecation = (obj, name, code, note = "") => {
 		new Proxy(obj, {
 			set: util.deprecate(
 				/**
+				 * Handles the callback logic for this hook.
 				 * @param {object} target target
 				 * @param {string | symbol} property property
 				 * @param {EXPECTED_ANY} value value
@@ -315,6 +331,7 @@ module.exports.soonFrozenObjectDeprecation = (obj, name, code, note = "") => {
 			),
 			defineProperty: util.deprecate(
 				/**
+				 * Handles the define property callback for this hook.
 				 * @param {object} target target
 				 * @param {string | symbol} property property
 				 * @param {PropertyDescriptor} descriptor descriptor
@@ -327,6 +344,7 @@ module.exports.soonFrozenObjectDeprecation = (obj, name, code, note = "") => {
 			),
 			deleteProperty: util.deprecate(
 				/**
+				 * Handles the delete property callback for this hook.
 				 * @param {object} target target
 				 * @param {string | symbol} property property
 				 * @returns {boolean} result
@@ -337,6 +355,7 @@ module.exports.soonFrozenObjectDeprecation = (obj, name, code, note = "") => {
 			),
 			setPrototypeOf: util.deprecate(
 				/**
+				 * Updates prototype of using the provided target.
 				 * @param {object} target target
 				 * @param {EXPECTED_OBJECT | null} proto proto
 				 * @returns {boolean} result

package/lib/util/deterministicGrouping.js

@@ -25,6 +25,7 @@
 // 3.2% that 5 or more groups are invalidated
 
 /**
+ * Returns the similarity as number.
  * @param {string} a key
  * @param {string} b key
  * @returns {number} the similarity as number
@@ -41,6 +42,7 @@ const similarity = (a, b) => {
 };
 
 /**
+ * Returns the common part and a single char for the difference.
  * @param {string} a key
  * @param {string} b key
  * @param {Set<string>} usedNames set of already used names
@@ -73,6 +75,7 @@ const getName = (a, b, usedNames) => {
 /** @typedef {Record<string, number>} Sizes */
 
 /**
+ * Adds the provided total to this object.
  * @param {Sizes} total total size
  * @param {Sizes} size single size
  * @returns {void}
@@ -84,6 +87,7 @@ const addSizeTo = (total, size) => {
 };
 
 /**
+ * Subtract size from.
  * @param {Sizes} total total size
  * @param {Sizes} size single size
  * @returns {void}
@@ -95,6 +99,7 @@ const subtractSizeFrom = (total, size) => {
 };
 
 /**
+ * Returns total size.
  * @template T
  * @param {Iterable<Node<T>>} nodes some nodes
  * @returns {Sizes} total size
@@ -109,6 +114,7 @@ const sumSize = (nodes) => {
 };
 
 /**
+ * Checks whether this object is too big.
  * @param {Sizes} size size
  * @param {Sizes} maxSize minimum size
  * @returns {boolean} true, when size is too big
@@ -124,6 +130,7 @@ const isTooBig = (size, maxSize) => {
 };
 
 /**
+ * Checks whether this object is too small.
  * @param {Sizes} size size
  * @param {Sizes} minSize minimum size
  * @returns {boolean} true, when size is too small
@@ -141,6 +148,7 @@ const isTooSmall = (size, minSize) => {
 /** @typedef {Set<string>} Types */
 
 /**
+ * Gets too small types.
  * @param {Sizes} size size
  * @param {Sizes} minSize minimum size
  * @returns {Types} set of types that are too small
@@ -158,6 +166,7 @@ const getTooSmallTypes = (size, minSize) => {
 };
 
 /**
+ * Gets number of matching size types.
  * @template {object} T
  * @param {T} size size
  * @param {Types} types types
@@ -172,6 +181,7 @@ const getNumberOfMatchingSizeTypes = (size, types) => {
 };
 
 /**
+ * Selective size sum.
  * @param {Sizes} size size
  * @param {Types} types types
  * @returns {number} selective size sum
@@ -185,10 +195,12 @@ const selectiveSizeSum = (size, types) => {
 };
 
 /**
+ * Represents the node runtime component.
  * @template T
  */
 class Node {
 	/**
+	 * Creates an instance of Node.
 	 * @param {T} item item
 	 * @param {string} key key
 	 * @param {Sizes} size size
@@ -203,10 +215,12 @@ class Node {
 /** @typedef {number[]} Similarities */
 
 /**
+ * Represents the group runtime component.
  * @template T
  */
 class Group {
 	/**
+	 * Creates an instance of Group.
 	 * @param {Node<T>[]} nodes nodes
 	 * @param {Similarities | null} similarities similarities between the nodes (length = nodes.length - 1)
 	 * @param {Sizes=} size size of the group
@@ -220,6 +234,7 @@ class Group {
 	}
 
 	/**
+	 * Returns removed nodes.
 	 * @param {(node: Node<T>) => boolean} filter filter function
 	 * @returns {Node<T>[] | undefined} removed nodes
 	 */
@@ -257,6 +272,7 @@ class Group {
 }
 
 /**
+ * Returns similarities.
  * @template T
  * @param {Iterable<Node<T>>} nodes nodes
  * @returns {Similarities} similarities
@@ -277,6 +293,7 @@ const getSimilarities = (nodes) => {
 };
 
 /**
+ * Defines the shared type used by this module.
  * @template T
  * @typedef {object} GroupedItems<T>
  * @property {string} key
@@ -285,6 +302,7 @@ const getSimilarities = (nodes) => {
  */
 
 /**
+ * Defines the options type used by this module.
  * @template T
  * @typedef {object} Options
  * @property {Sizes} maxSize maximum size of a group
@@ -295,6 +313,7 @@ const getSimilarities = (nodes) => {
  */
 
 /**
+ * Returns grouped items.
  * @template T
  * @param {Options<T>} options options object
  * @returns {GroupedItems<T>[]} grouped items
@@ -332,6 +351,7 @@ module.exports = ({ maxSize, minSize, items, getSize, getKey }) => {
 		const initialGroup = new Group(initialNodes, getSimilarities(initialNodes));
 
 		/**
+		 * Removes problematic nodes.
 		 * @param {Group<T>} group group
 		 * @param {Sizes} consideredSize size of the group to consider
 		 * @returns {boolean} true, if the group was modified

package/lib/util/extractSourceMap.js

@@ -16,6 +16,7 @@ const { isAbsolute, join } = require("./fs");
 /** @typedef {(resourcePath: string) => Promise<StringOrBuffer>} ReadResource */
 
 /**
+ * Defines the source mapping url type used by this module.
  * @typedef {object} SourceMappingURL
  * @property {string} sourceMappingURL
  * @property {string} replacementString

package/lib/util/extractUrlAndGlobal.js

@@ -6,6 +6,7 @@
 "use strict";
 
 /**
+ * Returns script url and its global variable.
  * @param {string} urlAndGlobal the script request
  * @returns {string[]} script url and its global variable
  */