webpack
Version:
Packs ECMAScript/CommonJs/AMD modules for the browser. Allows you to split your codebase into multiple bundles, which can be loaded on demand. Supports loaders to preprocess files, i.e. json, jsx, es7, css, less, ... and your custom stuff.
1,688 lines (1,553 loc) • 62.1 kB
JavaScript
/*
MIT License http://www.opensource.org/licenses/mit-license.php
Author Tobias Koppers @sokra
*/
"use strict";
const util = require("util");
const Entrypoint = require("./Entrypoint");
const ModuleGraphConnection = require("./ModuleGraphConnection");
const { DEFAULTS } = require("./config/defaults");
const { first } = require("./util/SetHelpers");
const SortableSet = require("./util/SortableSet");
const {
compareIds,
compareIterables,
compareModulesById,
compareModulesByIdentifier,
compareSelect,
concatComparators
} = require("./util/comparators");
const createHash = require("./util/createHash");
const findGraphRoots = require("./util/findGraphRoots");
const {
RuntimeSpecMap,
RuntimeSpecSet,
forEachRuntime,
mergeRuntime,
runtimeToString
} = require("./util/runtime");
/** @typedef {import("./AsyncDependenciesBlock")} AsyncDependenciesBlock */
/** @typedef {import("./Chunk")} Chunk */
/** @typedef {import("./Chunk").Chunks} Chunks */
/** @typedef {import("./Chunk").Entrypoints} Entrypoints */
/** @typedef {import("./Chunk").ChunkId} ChunkId */
/** @typedef {import("./ChunkGroup")} ChunkGroup */
/** @typedef {import("./Module")} Module */
/** @typedef {import("./Module").SourceType} SourceType */
/** @typedef {import("./Module").SourceTypes} SourceTypes */
/** @typedef {import("./Module").ReadOnlyRuntimeRequirements} ReadOnlyRuntimeRequirements */
/** @typedef {import("./Module").RuntimeRequirements} RuntimeRequirements */
/** @typedef {import("./ModuleGraph")} ModuleGraph */
/** @typedef {import("./ModuleGraphConnection").ConnectionState} ConnectionState */
/** @typedef {import("./RuntimeModule")} RuntimeModule */
/** @typedef {import("./util/Hash").HashFunction} HashFunction */
/** @typedef {import("./util/runtime").RuntimeSpec} RuntimeSpec */
/** @type {ReadonlySet<string>} */
const EMPTY_SET = new Set();
const ZERO_BIG_INT = BigInt(0);
const compareModuleIterables = compareIterables(compareModulesByIdentifier);
/** @typedef {(c: Chunk, chunkGraph: ChunkGraph) => boolean} ChunkFilterPredicate */
/** @typedef {(m: Module) => boolean} ModuleFilterPredicate */
/** @typedef {[Module, Entrypoint | undefined]} EntryModuleWithChunkGroup */
/**
* Represents the module hash info runtime component.
* @typedef {object} ChunkSizeOptions
* @property {number=} chunkOverhead constant overhead for a chunk
* @property {number=} entryChunkMultiplicator multiplicator for initial chunks
*/
class ModuleHashInfo {
/**
* Creates an instance of ModuleHashInfo.
* @param {string} hash hash
* @param {string} renderedHash rendered hash
*/
constructor(hash, renderedHash) {
/** @type {string} */
this.hash = hash;
/** @type {string} */
this.renderedHash = renderedHash;
}
}
/**
* Returns set as array.
* @template T
* @param {SortableSet<T>} set the set
* @returns {T[]} set as array
*/
const getArray = (set) => [...set];
/**
* Gets module runtimes.
* @param {SortableChunks} chunks the chunks
* @returns {RuntimeSpecSet} runtimes
*/
const getModuleRuntimes = (chunks) => {
const runtimes = new RuntimeSpecSet();
for (const chunk of chunks) {
runtimes.add(chunk.runtime);
}
return runtimes;
};
/**
* Modules by source type.
* @param {SourceTypesByModule | undefined} sourceTypesByModule sourceTypesByModule
* @returns {ModulesBySourceType} modules by source type
*/
const modulesBySourceType = (sourceTypesByModule) => (set) => {
/** @typedef {SortableSet<Module>} ModuleSortableSet */
/** @type {Map<SourceType, ModuleSortableSet>} */
const map = new Map();
for (const module of set) {
const sourceTypes =
(sourceTypesByModule && sourceTypesByModule.get(module)) ||
module.getSourceTypes();
for (const sourceType of sourceTypes) {
let innerSet = map.get(sourceType);
if (innerSet === undefined) {
/** @type {ModuleSortableSet} */
innerSet = new SortableSet();
map.set(sourceType, innerSet);
}
innerSet.add(module);
}
}
for (const [key, innerSet] of map) {
// When all modules have the source type, we reuse the original SortableSet
// to benefit from the shared cache (especially for sorting)
if (innerSet.size === set.size) {
map.set(key, set);
}
}
return map;
};
/** @typedef {(set: SortableSet<Module>) => Map<string, SortableSet<Module>>} ModulesBySourceType */
/** @type {ModulesBySourceType} */
const defaultModulesBySourceType = modulesBySourceType(undefined);
/**
* Defines the module set to array function type used by this module.
* @typedef {(set: SortableSet<Module>) => Module[]} ModuleSetToArrayFunction
*/
/**
* @template T
* @type {WeakMap<ModuleComparator, ModuleSetToArrayFunction>}
*/
const createOrderedArrayFunctionMap = new WeakMap();
/**
* Creates an ordered array function.
* @template T
* @param {ModuleComparator} comparator comparator function
* @returns {ModuleSetToArrayFunction} set as ordered array
*/
const createOrderedArrayFunction = (comparator) => {
let fn = createOrderedArrayFunctionMap.get(comparator);
if (fn !== undefined) return fn;
fn = (set) => {
set.sortWith(comparator);
return [...set];
};
createOrderedArrayFunctionMap.set(comparator, fn);
return fn;
};
/**
* Returns the size of the modules.
* @param {Iterable<Module>} modules the modules to get the count/size of
* @returns {number} the size of the modules
*/
const getModulesSize = (modules) => {
let size = 0;
for (const module of modules) {
for (const type of module.getSourceTypes()) {
size += module.size(type);
}
}
return size;
};
/** @typedef {Record<string, number>} SizesOfModules */
/**
* Gets modules sizes.
* @param {Iterable<Module>} modules the sortable Set to get the size of
* @returns {SizesOfModules} the sizes of the modules
*/
const getModulesSizes = (modules) => {
/** @type {SizesOfModules} */
const sizes = Object.create(null);
for (const module of modules) {
for (const type of module.getSourceTypes()) {
sizes[type] = (sizes[type] || 0) + module.size(type);
}
}
return sizes;
};
/**
* Checks whether this module hash info is available chunk.
* @param {Chunk} a chunk
* @param {Chunk} b chunk
* @returns {boolean} true, if a is always a parent of b
*/
const isAvailableChunk = (a, b) => {
const queue = new Set(b.groupsIterable);
for (const chunkGroup of queue) {
if (a.isInGroup(chunkGroup)) continue;
if (chunkGroup.isInitial()) return false;
for (const parent of chunkGroup.parentsIterable) {
queue.add(parent);
}
}
return true;
};
/** @typedef {SortableSet<Chunk>} SortableChunks */
/** @typedef {Set<Chunk>} EntryInChunks */
/** @typedef {Set<Chunk>} RuntimeInChunks */
/** @typedef {string | number} ModuleId */
/** @typedef {RuntimeSpecMap<Set<string>, RuntimeRequirements>} ChunkGraphRuntimeRequirements */
class ChunkGraphModule {
constructor() {
/** @type {SortableChunks} */
this.chunks = new SortableSet();
/** @type {EntryInChunks | undefined} */
this.entryInChunks = undefined;
/** @type {RuntimeInChunks | undefined} */
this.runtimeInChunks = undefined;
/** @type {RuntimeSpecMap<ModuleHashInfo> | undefined} */
this.hashes = undefined;
/** @type {ModuleId | null} */
this.id = null;
/** @type {ChunkGraphRuntimeRequirements | undefined} */
this.runtimeRequirements = undefined;
/** @type {RuntimeSpecMap<string, bigint> | undefined} */
this.graphHashes = undefined;
/** @type {RuntimeSpecMap<string, string> | undefined} */
this.graphHashesWithConnections = undefined;
}
}
/** @typedef {WeakMap<Module, SourceTypes>} SourceTypesByModule */
/** @typedef {Map<Module, Entrypoint>} EntryModules */
class ChunkGraphChunk {
constructor() {
/** @type {SortableSet<Module>} */
this.modules = new SortableSet();
/** @type {SourceTypesByModule | undefined} */
this.sourceTypesByModule = undefined;
/** @type {EntryModules} */
this.entryModules = new Map();
/** @type {SortableSet<RuntimeModule>} */
this.runtimeModules = new SortableSet();
/** @type {Set<RuntimeModule> | undefined} */
this.fullHashModules = undefined;
/** @type {Set<RuntimeModule> | undefined} */
this.dependentHashModules = undefined;
/** @type {RuntimeRequirements | undefined} */
this.runtimeRequirements = undefined;
/** @type {Set<string>} */
this.runtimeRequirementsInTree = new Set();
/** @type {ModulesBySourceType} */
this._modulesBySourceType = defaultModulesBySourceType;
}
}
/** @typedef {string | number} RuntimeId */
/** @typedef {Record<ModuleId, string>} IdToHashMap */
/** @typedef {Record<ChunkId, IdToHashMap>} ChunkModuleHashMap */
/** @typedef {Record<ChunkId, ModuleId[]>} ChunkModuleIdMap */
/** @typedef {Record<ChunkId, boolean>} ChunkConditionMap */
/** @typedef {(a: Module, b: Module) => -1 | 0 | 1} ModuleComparator */
class ChunkGraph {
/**
* Creates an instance of ChunkGraph.
* @param {ModuleGraph} moduleGraph the module graph
* @param {HashFunction} hashFunction the hash function to use
*/
constructor(moduleGraph, hashFunction = DEFAULTS.HASH_FUNCTION) {
/**
* @private
* @type {WeakMap<Module, ChunkGraphModule>}
*/
this._modules = new WeakMap();
/**
* @private
* @type {WeakMap<Chunk, ChunkGraphChunk>}
*/
this._chunks = new WeakMap();
/**
* @private
* @type {WeakMap<AsyncDependenciesBlock, ChunkGroup>}
*/
this._blockChunkGroups = new WeakMap();
/**
* @private
* @type {Map<string, RuntimeId>}
*/
this._runtimeIds = new Map();
/** @type {ModuleGraph} */
this.moduleGraph = moduleGraph;
this._hashFunction = hashFunction;
this._getGraphRoots = this._getGraphRoots.bind(this);
}
/**
* Get chunk graph module.
* @private
* @param {Module} module the module
* @returns {ChunkGraphModule} internal module
*/
_getChunkGraphModule(module) {
let cgm = this._modules.get(module);
if (cgm === undefined) {
cgm = new ChunkGraphModule();
this._modules.set(module, cgm);
}
return cgm;
}
/**
* Get chunk graph chunk.
* @private
* @param {Chunk} chunk the chunk
* @returns {ChunkGraphChunk} internal chunk
*/
_getChunkGraphChunk(chunk) {
let cgc = this._chunks.get(chunk);
if (cgc === undefined) {
cgc = new ChunkGraphChunk();
this._chunks.set(chunk, cgc);
}
return cgc;
}
/**
* Returns the graph roots.
* @param {SortableSet<Module>} set the sortable Set to get the roots of
* @returns {Module[]} the graph roots
*/
_getGraphRoots(set) {
const { moduleGraph } = this;
return [
...findGraphRoots(set, (module) => {
/** @type {Set<Module>} */
const set = new Set();
/**
* Adds the provided module to the chunk graph.
* @param {Module} module module
*/
const addDependencies = (module) => {
for (const connection of moduleGraph.getOutgoingConnections(module)) {
if (!connection.module) continue;
const activeState = connection.getActiveState(undefined);
if (activeState === false) continue;
if (activeState === ModuleGraphConnection.TRANSITIVE_ONLY) {
addDependencies(connection.module);
continue;
}
set.add(connection.module);
}
};
addDependencies(module);
return set;
})
].sort(compareModulesByIdentifier);
}
/**
* Connects chunk and module.
* @param {Chunk} chunk the new chunk
* @param {Module} module the module
* @returns {void}
*/
connectChunkAndModule(chunk, module) {
const cgm = this._getChunkGraphModule(module);
const cgc = this._getChunkGraphChunk(chunk);
cgm.chunks.add(chunk);
cgc.modules.add(module);
}
/**
* Disconnects chunk and module.
* @param {Chunk} chunk the chunk
* @param {Module} module the module
* @returns {void}
*/
disconnectChunkAndModule(chunk, module) {
const cgm = this._getChunkGraphModule(module);
const cgc = this._getChunkGraphChunk(chunk);
cgc.modules.delete(module);
// No need to invalidate cgc._modulesBySourceType because we modified cgc.modules anyway
if (cgc.sourceTypesByModule) cgc.sourceTypesByModule.delete(module);
cgm.chunks.delete(chunk);
}
/**
* Processes the provided chunk.
* @param {Chunk} chunk the chunk which will be disconnected
* @returns {void}
*/
disconnectChunk(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
for (const module of cgc.modules) {
const cgm = this._getChunkGraphModule(module);
cgm.chunks.delete(chunk);
}
cgc.modules.clear();
chunk.disconnectFromGroups();
ChunkGraph.clearChunkGraphForChunk(chunk);
}
/**
* Processes the provided chunk.
* @param {Chunk} chunk the chunk
* @param {Iterable<Module>} modules the modules
* @returns {void}
*/
attachModules(chunk, modules) {
const cgc = this._getChunkGraphChunk(chunk);
for (const module of modules) {
cgc.modules.add(module);
}
}
/**
* Attach runtime modules.
* @param {Chunk} chunk the chunk
* @param {Iterable<RuntimeModule>} modules the runtime modules
* @returns {void}
*/
attachRuntimeModules(chunk, modules) {
const cgc = this._getChunkGraphChunk(chunk);
for (const module of modules) {
cgc.runtimeModules.add(module);
}
}
/**
* Attach full hash modules.
* @param {Chunk} chunk the chunk
* @param {Iterable<RuntimeModule>} modules the modules that require a full hash
* @returns {void}
*/
attachFullHashModules(chunk, modules) {
const cgc = this._getChunkGraphChunk(chunk);
if (cgc.fullHashModules === undefined) cgc.fullHashModules = new Set();
for (const module of modules) {
cgc.fullHashModules.add(module);
}
}
/**
* Attach dependent hash modules.
* @param {Chunk} chunk the chunk
* @param {Iterable<RuntimeModule>} modules the modules that require a full hash
* @returns {void}
*/
attachDependentHashModules(chunk, modules) {
const cgc = this._getChunkGraphChunk(chunk);
if (cgc.dependentHashModules === undefined) {
cgc.dependentHashModules = new Set();
}
for (const module of modules) {
cgc.dependentHashModules.add(module);
}
}
/**
* Processes the provided old module.
* @param {Module} oldModule the replaced module
* @param {Module} newModule the replacing module
* @returns {void}
*/
replaceModule(oldModule, newModule) {
const oldCgm = this._getChunkGraphModule(oldModule);
const newCgm = this._getChunkGraphModule(newModule);
for (const chunk of oldCgm.chunks) {
const cgc = this._getChunkGraphChunk(chunk);
cgc.modules.delete(oldModule);
cgc.modules.add(newModule);
newCgm.chunks.add(chunk);
}
oldCgm.chunks.clear();
if (oldCgm.entryInChunks !== undefined) {
if (newCgm.entryInChunks === undefined) {
newCgm.entryInChunks = new Set();
}
for (const chunk of oldCgm.entryInChunks) {
const cgc = this._getChunkGraphChunk(chunk);
const old = /** @type {Entrypoint} */ (cgc.entryModules.get(oldModule));
/** @type {EntryModules} */
const newEntryModules = new Map();
for (const [m, cg] of cgc.entryModules) {
if (m === oldModule) {
newEntryModules.set(newModule, old);
} else {
newEntryModules.set(m, cg);
}
}
cgc.entryModules = newEntryModules;
newCgm.entryInChunks.add(chunk);
}
oldCgm.entryInChunks = undefined;
}
if (oldCgm.runtimeInChunks !== undefined) {
if (newCgm.runtimeInChunks === undefined) {
newCgm.runtimeInChunks = new Set();
}
for (const chunk of oldCgm.runtimeInChunks) {
const cgc = this._getChunkGraphChunk(chunk);
cgc.runtimeModules.delete(/** @type {RuntimeModule} */ (oldModule));
cgc.runtimeModules.add(/** @type {RuntimeModule} */ (newModule));
newCgm.runtimeInChunks.add(chunk);
if (
cgc.fullHashModules !== undefined &&
cgc.fullHashModules.has(/** @type {RuntimeModule} */ (oldModule))
) {
cgc.fullHashModules.delete(/** @type {RuntimeModule} */ (oldModule));
cgc.fullHashModules.add(/** @type {RuntimeModule} */ (newModule));
}
if (
cgc.dependentHashModules !== undefined &&
cgc.dependentHashModules.has(/** @type {RuntimeModule} */ (oldModule))
) {
cgc.dependentHashModules.delete(
/** @type {RuntimeModule} */ (oldModule)
);
cgc.dependentHashModules.add(
/** @type {RuntimeModule} */ (newModule)
);
}
}
oldCgm.runtimeInChunks = undefined;
}
}
/**
* Checks whether this chunk graph is module in chunk.
* @param {Module} module the checked module
* @param {Chunk} chunk the checked chunk
* @returns {boolean} true, if the chunk contains the module
*/
isModuleInChunk(module, chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.modules.has(module);
}
/**
* Checks whether this chunk graph is module in chunk group.
* @param {Module} module the checked module
* @param {ChunkGroup} chunkGroup the checked chunk group
* @returns {boolean} true, if the chunk contains the module
*/
isModuleInChunkGroup(module, chunkGroup) {
for (const chunk of chunkGroup.chunks) {
if (this.isModuleInChunk(module, chunk)) return true;
}
return false;
}
/**
* Checks whether this chunk graph is entry module.
* @param {Module} module the checked module
* @returns {boolean} true, if the module is entry of any chunk
*/
isEntryModule(module) {
const cgm = this._getChunkGraphModule(module);
return cgm.entryInChunks !== undefined;
}
/**
* Gets module chunks iterable.
* @param {Module} module the module
* @returns {Iterable<Chunk>} iterable of chunks (do not modify)
*/
getModuleChunksIterable(module) {
const cgm = this._getChunkGraphModule(module);
return cgm.chunks;
}
/**
* Gets ordered module chunks iterable.
* @param {Module} module the module
* @param {(a: Chunk, b: Chunk) => -1 | 0 | 1} sortFn sort function
* @returns {Iterable<Chunk>} iterable of chunks (do not modify)
*/
getOrderedModuleChunksIterable(module, sortFn) {
const cgm = this._getChunkGraphModule(module);
cgm.chunks.sortWith(sortFn);
return cgm.chunks;
}
/**
* Gets module chunks.
* @param {Module} module the module
* @returns {Chunk[]} array of chunks (cached, do not modify)
*/
getModuleChunks(module) {
const cgm = this._getChunkGraphModule(module);
return cgm.chunks.getFromCache(getArray);
}
/**
* Gets number of module chunks.
* @param {Module} module the module
* @returns {number} the number of chunk which contain the module
*/
getNumberOfModuleChunks(module) {
const cgm = this._getChunkGraphModule(module);
return cgm.chunks.size;
}
/**
* Gets module runtimes.
* @param {Module} module the module
* @returns {RuntimeSpecSet} runtimes
*/
getModuleRuntimes(module) {
const cgm = this._getChunkGraphModule(module);
return cgm.chunks.getFromUnorderedCache(getModuleRuntimes);
}
/**
* Gets number of chunk modules.
* @param {Chunk} chunk the chunk
* @returns {number} the number of modules which are contained in this chunk
*/
getNumberOfChunkModules(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.modules.size;
}
/**
* Gets number of chunk full hash modules.
* @param {Chunk} chunk the chunk
* @returns {number} the number of full hash modules which are contained in this chunk
*/
getNumberOfChunkFullHashModules(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.fullHashModules === undefined ? 0 : cgc.fullHashModules.size;
}
/**
* Gets chunk modules iterable.
* @param {Chunk} chunk the chunk
* @returns {Iterable<Module>} return the modules for this chunk
*/
getChunkModulesIterable(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.modules;
}
/**
* Gets chunk modules iterable by source type.
* @param {Chunk} chunk the chunk
* @param {string} sourceType source type
* @returns {Iterable<Module> | undefined} return the modules for this chunk
*/
getChunkModulesIterableBySourceType(chunk, sourceType) {
const cgc = this._getChunkGraphChunk(chunk);
const modulesWithSourceType = cgc.modules
.getFromUnorderedCache(cgc._modulesBySourceType)
.get(sourceType);
return modulesWithSourceType;
}
/**
* Sets chunk module source types.
* @param {Chunk} chunk chunk
* @param {Module} module chunk module
* @param {SourceTypes} sourceTypes source types
*/
setChunkModuleSourceTypes(chunk, module, sourceTypes) {
const cgc = this._getChunkGraphChunk(chunk);
if (cgc.sourceTypesByModule === undefined) {
cgc.sourceTypesByModule = new WeakMap();
}
cgc.sourceTypesByModule.set(module, sourceTypes);
// Update cgc._modulesBySourceType to invalidate the cache
cgc._modulesBySourceType = modulesBySourceType(cgc.sourceTypesByModule);
}
/**
* Gets chunk module source types.
* @param {Chunk} chunk chunk
* @param {Module} module chunk module
* @returns {SourceTypes} source types
*/
getChunkModuleSourceTypes(chunk, module) {
const cgc = this._getChunkGraphChunk(chunk);
if (cgc.sourceTypesByModule === undefined) {
return module.getSourceTypes();
}
return cgc.sourceTypesByModule.get(module) || module.getSourceTypes();
}
/**
* Gets module source types.
* @param {Module} module module
* @returns {SourceTypes} source types
*/
getModuleSourceTypes(module) {
return (
this._getOverwrittenModuleSourceTypes(module) || module.getSourceTypes()
);
}
/**
* Get overwritten module source types.
* @param {Module} module module
* @returns {SourceTypes | undefined} source types
*/
_getOverwrittenModuleSourceTypes(module) {
let newSet = false;
/** @type {Set<SourceType> | undefined} */
let sourceTypes;
for (const chunk of this.getModuleChunksIterable(module)) {
const cgc = this._getChunkGraphChunk(chunk);
if (cgc.sourceTypesByModule === undefined) return;
const st = cgc.sourceTypesByModule.get(module);
if (st === undefined) return;
if (!sourceTypes) {
sourceTypes = /** @type {Set<SourceType>} */ (st);
} else if (!newSet) {
for (const type of st) {
if (!newSet) {
if (!sourceTypes.has(type)) {
newSet = true;
sourceTypes = new Set(sourceTypes);
sourceTypes.add(type);
}
} else {
sourceTypes.add(type);
}
}
} else {
for (const type of st) sourceTypes.add(type);
}
}
return sourceTypes;
}
/**
* Gets ordered chunk modules iterable.
* @param {Chunk} chunk the chunk
* @param {ModuleComparator} comparator comparator function
* @returns {Iterable<Module>} return the modules for this chunk
*/
getOrderedChunkModulesIterable(chunk, comparator) {
const cgc = this._getChunkGraphChunk(chunk);
cgc.modules.sortWith(comparator);
return cgc.modules;
}
/**
* Gets ordered chunk modules iterable by source type.
* @param {Chunk} chunk the chunk
* @param {string} sourceType source type
* @param {ModuleComparator} comparator comparator function
* @returns {Iterable<Module> | undefined} return the modules for this chunk
*/
getOrderedChunkModulesIterableBySourceType(chunk, sourceType, comparator) {
const cgc = this._getChunkGraphChunk(chunk);
const modulesWithSourceType = cgc.modules
.getFromUnorderedCache(cgc._modulesBySourceType)
.get(sourceType);
if (modulesWithSourceType === undefined) return;
modulesWithSourceType.sortWith(comparator);
return modulesWithSourceType;
}
/**
* Gets chunk modules.
* @param {Chunk} chunk the chunk
* @returns {Module[]} return the modules for this chunk (cached, do not modify)
*/
getChunkModules(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.modules.getFromUnorderedCache(getArray);
}
/**
* Gets ordered chunk modules.
* @param {Chunk} chunk the chunk
* @param {ModuleComparator} comparator comparator function
* @returns {Module[]} return the modules for this chunk (cached, do not modify)
*/
getOrderedChunkModules(chunk, comparator) {
const cgc = this._getChunkGraphChunk(chunk);
const arrayFunction = createOrderedArrayFunction(comparator);
return cgc.modules.getFromUnorderedCache(arrayFunction);
}
/**
* Gets chunk module id map.
* @param {Chunk} chunk the chunk
* @param {ModuleFilterPredicate} filterFn function used to filter modules
* @param {boolean} includeAllChunks all chunks or only async chunks
* @returns {ChunkModuleIdMap} chunk to module ids object
*/
getChunkModuleIdMap(chunk, filterFn, includeAllChunks = false) {
/** @type {ChunkModuleIdMap} */
const chunkModuleIdMap = Object.create(null);
for (const asyncChunk of includeAllChunks
? chunk.getAllReferencedChunks()
: chunk.getAllAsyncChunks()) {
/** @type {ModuleId[] | undefined} */
let array;
for (const module of this.getOrderedChunkModulesIterable(
asyncChunk,
compareModulesById(this)
)) {
if (filterFn(module)) {
if (array === undefined) {
array = [];
chunkModuleIdMap[/** @type {ChunkId} */ (asyncChunk.id)] = array;
}
const moduleId = /** @type {ModuleId} */ (this.getModuleId(module));
array.push(moduleId);
}
}
}
return chunkModuleIdMap;
}
/**
* Gets chunk module rendered hash map.
* @param {Chunk} chunk the chunk
* @param {ModuleFilterPredicate} filterFn function used to filter modules
* @param {number} hashLength length of the hash
* @param {boolean} includeAllChunks all chunks or only async chunks
* @returns {ChunkModuleHashMap} chunk to module id to module hash object
*/
getChunkModuleRenderedHashMap(
chunk,
filterFn,
hashLength = 0,
includeAllChunks = false
) {
/** @type {ChunkModuleHashMap} */
const chunkModuleHashMap = Object.create(null);
for (const asyncChunk of includeAllChunks
? chunk.getAllReferencedChunks()
: chunk.getAllAsyncChunks()) {
/** @type {IdToHashMap | undefined} */
let idToHashMap;
for (const module of this.getOrderedChunkModulesIterable(
asyncChunk,
compareModulesById(this)
)) {
if (filterFn(module)) {
if (idToHashMap === undefined) {
/** @type {IdToHashMap} */
idToHashMap = Object.create(null);
chunkModuleHashMap[/** @type {ChunkId} */ (asyncChunk.id)] =
/** @type {IdToHashMap} */
(idToHashMap);
}
const moduleId = this.getModuleId(module);
const hash = this.getRenderedModuleHash(module, asyncChunk.runtime);
/** @type {IdToHashMap} */
(idToHashMap)[/** @type {ModuleId} */ (moduleId)] = hashLength
? hash.slice(0, hashLength)
: hash;
}
}
}
return chunkModuleHashMap;
}
/**
* Gets chunk condition map.
* @param {Chunk} chunk the chunk
* @param {ChunkFilterPredicate} filterFn function used to filter chunks
* @returns {ChunkConditionMap} chunk condition map
*/
getChunkConditionMap(chunk, filterFn) {
/** @type {ChunkConditionMap} */
const map = Object.create(null);
for (const c of chunk.getAllReferencedChunks()) {
map[/** @type {ChunkId} */ (c.id)] = filterFn(c, this);
}
return map;
}
/**
* Checks whether this chunk graph contains the chunk.
* @param {Chunk} chunk the chunk
* @param {ModuleFilterPredicate} filterFn predicate function used to filter modules
* @param {ChunkFilterPredicate=} filterChunkFn predicate function used to filter chunks
* @returns {boolean} return true if module exists in graph
*/
hasModuleInGraph(chunk, filterFn, filterChunkFn) {
const queue = new Set(chunk.groupsIterable);
/** @type {Set<Chunk>} */
const chunksProcessed = new Set();
for (const chunkGroup of queue) {
for (const innerChunk of chunkGroup.chunks) {
if (!chunksProcessed.has(innerChunk)) {
chunksProcessed.add(innerChunk);
if (!filterChunkFn || filterChunkFn(innerChunk, this)) {
for (const module of this.getChunkModulesIterable(innerChunk)) {
if (filterFn(module)) {
return true;
}
}
}
}
}
for (const child of chunkGroup.childrenIterable) {
queue.add(child);
}
}
return false;
}
/**
* Compares the provided values and returns their ordering.
* @param {Chunk} chunkA first chunk
* @param {Chunk} chunkB second chunk
* @returns {-1 | 0 | 1} this is a comparator function like sort and returns -1, 0, or 1 based on sort order
*/
compareChunks(chunkA, chunkB) {
const cgcA = this._getChunkGraphChunk(chunkA);
const cgcB = this._getChunkGraphChunk(chunkB);
if (cgcA.modules.size > cgcB.modules.size) return -1;
if (cgcA.modules.size < cgcB.modules.size) return 1;
cgcA.modules.sortWith(compareModulesByIdentifier);
cgcB.modules.sortWith(compareModulesByIdentifier);
return compareModuleIterables(cgcA.modules, cgcB.modules);
}
/**
* Gets chunk modules size.
* @param {Chunk} chunk the chunk
* @returns {number} total size of all modules in the chunk
*/
getChunkModulesSize(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.modules.getFromUnorderedCache(getModulesSize);
}
/**
* Gets chunk modules sizes.
* @param {Chunk} chunk the chunk
* @returns {Record<string, number>} total sizes of all modules in the chunk by source type
*/
getChunkModulesSizes(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.modules.getFromUnorderedCache(getModulesSizes);
}
/**
* Gets chunk root modules.
* @param {Chunk} chunk the chunk
* @returns {Module[]} root modules of the chunks (ordered by identifier)
*/
getChunkRootModules(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.modules.getFromUnorderedCache(this._getGraphRoots);
}
/**
* Returns total size of the chunk.
* @param {Chunk} chunk the chunk
* @param {ChunkSizeOptions} options options object
* @returns {number} total size of the chunk
*/
getChunkSize(chunk, options = {}) {
const cgc = this._getChunkGraphChunk(chunk);
const modulesSize = cgc.modules.getFromUnorderedCache(getModulesSize);
const chunkOverhead =
typeof options.chunkOverhead === "number" ? options.chunkOverhead : 10000;
const entryChunkMultiplicator =
typeof options.entryChunkMultiplicator === "number"
? options.entryChunkMultiplicator
: 10;
return (
chunkOverhead +
modulesSize * (chunk.canBeInitial() ? entryChunkMultiplicator : 1)
);
}
/**
* Gets integrated chunks size.
* @param {Chunk} chunkA chunk
* @param {Chunk} chunkB chunk
* @param {ChunkSizeOptions} options options object
* @returns {number} total size of the chunk or false if chunks can't be integrated
*/
getIntegratedChunksSize(chunkA, chunkB, options = {}) {
const cgcA = this._getChunkGraphChunk(chunkA);
const cgcB = this._getChunkGraphChunk(chunkB);
const allModules = new Set(cgcA.modules);
for (const m of cgcB.modules) allModules.add(m);
const modulesSize = getModulesSize(allModules);
const chunkOverhead =
typeof options.chunkOverhead === "number" ? options.chunkOverhead : 10000;
const entryChunkMultiplicator =
typeof options.entryChunkMultiplicator === "number"
? options.entryChunkMultiplicator
: 10;
return (
chunkOverhead +
modulesSize *
(chunkA.canBeInitial() || chunkB.canBeInitial()
? entryChunkMultiplicator
: 1)
);
}
/**
* Checks whether it can chunks be integrated.
* @param {Chunk} chunkA chunk
* @param {Chunk} chunkB chunk
* @returns {boolean} true, if chunks could be integrated
*/
canChunksBeIntegrated(chunkA, chunkB) {
if (chunkA.preventIntegration || chunkB.preventIntegration) {
return false;
}
const hasRuntimeA = chunkA.hasRuntime();
const hasRuntimeB = chunkB.hasRuntime();
if (hasRuntimeA !== hasRuntimeB) {
if (hasRuntimeA) {
return isAvailableChunk(chunkA, chunkB);
} else if (hasRuntimeB) {
return isAvailableChunk(chunkB, chunkA);
}
return false;
}
if (
this.getNumberOfEntryModules(chunkA) > 0 ||
this.getNumberOfEntryModules(chunkB) > 0
) {
return false;
}
return true;
}
/**
* Processes the provided chunk a.
* @param {Chunk} chunkA the target chunk
* @param {Chunk} chunkB the chunk to integrate
* @returns {void}
*/
integrateChunks(chunkA, chunkB) {
// Decide for one name (deterministic)
if (chunkA.name && chunkB.name) {
if (
this.getNumberOfEntryModules(chunkA) > 0 ===
this.getNumberOfEntryModules(chunkB) > 0
) {
// When both chunks have entry modules or none have one, use
// shortest name
if (chunkA.name.length !== chunkB.name.length) {
chunkA.name =
chunkA.name.length < chunkB.name.length ? chunkA.name : chunkB.name;
} else {
chunkA.name = chunkA.name < chunkB.name ? chunkA.name : chunkB.name;
}
} else if (this.getNumberOfEntryModules(chunkB) > 0) {
// Pick the name of the chunk with the entry module
chunkA.name = chunkB.name;
}
} else if (chunkB.name) {
chunkA.name = chunkB.name;
}
// Merge id name hints
for (const hint of chunkB.idNameHints) {
chunkA.idNameHints.add(hint);
}
// Merge runtime
chunkA.runtime = mergeRuntime(chunkA.runtime, chunkB.runtime);
// getChunkModules is used here to create a clone, because disconnectChunkAndModule modifies
for (const module of this.getChunkModules(chunkB)) {
this.disconnectChunkAndModule(chunkB, module);
this.connectChunkAndModule(chunkA, module);
}
for (const [
module,
chunkGroup
] of this.getChunkEntryModulesWithChunkGroupIterable(chunkB)) {
this.disconnectChunkAndEntryModule(chunkB, module);
this.connectChunkAndEntryModule(
chunkA,
module,
/** @type {Entrypoint} */
(chunkGroup)
);
}
for (const chunkGroup of chunkB.groupsIterable) {
chunkGroup.replaceChunk(chunkB, chunkA);
chunkA.addGroup(chunkGroup);
chunkB.removeGroup(chunkGroup);
}
ChunkGraph.clearChunkGraphForChunk(chunkB);
}
/**
* Upgrade dependent to full hash modules.
* @param {Chunk} chunk the chunk to upgrade
* @returns {void}
*/
upgradeDependentToFullHashModules(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
if (cgc.dependentHashModules === undefined) return;
if (cgc.fullHashModules === undefined) {
cgc.fullHashModules = cgc.dependentHashModules;
} else {
for (const m of cgc.dependentHashModules) {
cgc.fullHashModules.add(m);
}
cgc.dependentHashModules = undefined;
}
}
/**
* Checks whether this chunk graph is entry module in chunk.
* @param {Module} module the checked module
* @param {Chunk} chunk the checked chunk
* @returns {boolean} true, if the chunk contains the module as entry
*/
isEntryModuleInChunk(module, chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.entryModules.has(module);
}
/**
* Connects chunk and entry module.
* @param {Chunk} chunk the new chunk
* @param {Module} module the entry module
* @param {Entrypoint} entrypoint the chunk group which must be loaded before the module is executed
* @returns {void}
*/
connectChunkAndEntryModule(chunk, module, entrypoint) {
const cgm = this._getChunkGraphModule(module);
const cgc = this._getChunkGraphChunk(chunk);
if (cgm.entryInChunks === undefined) {
cgm.entryInChunks = new Set();
}
cgm.entryInChunks.add(chunk);
cgc.entryModules.set(module, entrypoint);
}
/**
* Connects chunk and runtime module.
* @param {Chunk} chunk the new chunk
* @param {RuntimeModule} module the runtime module
* @returns {void}
*/
connectChunkAndRuntimeModule(chunk, module) {
const cgm = this._getChunkGraphModule(module);
const cgc = this._getChunkGraphChunk(chunk);
if (cgm.runtimeInChunks === undefined) {
cgm.runtimeInChunks = new Set();
}
cgm.runtimeInChunks.add(chunk);
cgc.runtimeModules.add(module);
}
/**
* Adds full hash module to chunk.
* @param {Chunk} chunk the new chunk
* @param {RuntimeModule} module the module that require a full hash
* @returns {void}
*/
addFullHashModuleToChunk(chunk, module) {
const cgc = this._getChunkGraphChunk(chunk);
if (cgc.fullHashModules === undefined) cgc.fullHashModules = new Set();
cgc.fullHashModules.add(module);
}
/**
* Adds dependent hash module to chunk.
* @param {Chunk} chunk the new chunk
* @param {RuntimeModule} module the module that require a full hash
* @returns {void}
*/
addDependentHashModuleToChunk(chunk, module) {
const cgc = this._getChunkGraphChunk(chunk);
if (cgc.dependentHashModules === undefined) {
cgc.dependentHashModules = new Set();
}
cgc.dependentHashModules.add(module);
}
/**
* Disconnects chunk and entry module.
* @param {Chunk} chunk the new chunk
* @param {Module} module the entry module
* @returns {void}
*/
disconnectChunkAndEntryModule(chunk, module) {
const cgm = this._getChunkGraphModule(module);
const cgc = this._getChunkGraphChunk(chunk);
/** @type {EntryInChunks} */
(cgm.entryInChunks).delete(chunk);
if (/** @type {EntryInChunks} */ (cgm.entryInChunks).size === 0) {
cgm.entryInChunks = undefined;
}
cgc.entryModules.delete(module);
}
/**
* Disconnects chunk and runtime module.
* @param {Chunk} chunk the new chunk
* @param {RuntimeModule} module the runtime module
* @returns {void}
*/
disconnectChunkAndRuntimeModule(chunk, module) {
const cgm = this._getChunkGraphModule(module);
const cgc = this._getChunkGraphChunk(chunk);
/** @type {RuntimeInChunks} */
(cgm.runtimeInChunks).delete(chunk);
if (/** @type {RuntimeInChunks} */ (cgm.runtimeInChunks).size === 0) {
cgm.runtimeInChunks = undefined;
}
cgc.runtimeModules.delete(module);
}
/**
* Disconnects entry module.
* @param {Module} module the entry module, it will no longer be entry
* @returns {void}
*/
disconnectEntryModule(module) {
const cgm = this._getChunkGraphModule(module);
for (const chunk of /** @type {EntryInChunks} */ (cgm.entryInChunks)) {
const cgc = this._getChunkGraphChunk(chunk);
cgc.entryModules.delete(module);
}
cgm.entryInChunks = undefined;
}
/**
* Disconnects entries.
* @param {Chunk} chunk the chunk, for which all entries will be removed
* @returns {void}
*/
disconnectEntries(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
for (const module of cgc.entryModules.keys()) {
const cgm = this._getChunkGraphModule(module);
/** @type {EntryInChunks} */
(cgm.entryInChunks).delete(chunk);
if (/** @type {EntryInChunks} */ (cgm.entryInChunks).size === 0) {
cgm.entryInChunks = undefined;
}
}
cgc.entryModules.clear();
}
/**
* Gets number of entry modules.
* @param {Chunk} chunk the chunk
* @returns {number} the amount of entry modules in chunk
*/
getNumberOfEntryModules(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.entryModules.size;
}
/**
* Gets number of runtime modules.
* @param {Chunk} chunk the chunk
* @returns {number} the amount of entry modules in chunk
*/
getNumberOfRuntimeModules(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.runtimeModules.size;
}
/**
* Gets chunk entry modules iterable.
* @param {Chunk} chunk the chunk
* @returns {Iterable<Module>} iterable of modules (do not modify)
*/
getChunkEntryModulesIterable(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.entryModules.keys();
}
/**
* Gets chunk entry dependent chunks iterable.
* @param {Chunk} chunk the chunk
* @returns {Iterable<Chunk>} iterable of chunks
*/
getChunkEntryDependentChunksIterable(chunk) {
/** @type {Chunks} */
const set = new Set();
for (const chunkGroup of chunk.groupsIterable) {
if (chunkGroup instanceof Entrypoint) {
const entrypointChunk = chunkGroup.getEntrypointChunk();
const cgc = this._getChunkGraphChunk(entrypointChunk);
for (const chunkGroup of cgc.entryModules.values()) {
for (const c of chunkGroup.chunks) {
if (c !== chunk && c !== entrypointChunk && !c.hasRuntime()) {
set.add(c);
}
}
}
}
}
return set;
}
/**
* Gets runtime chunk dependent chunks iterable.
* @param {Chunk} chunk the chunk
* @returns {Iterable<Chunk>} iterable of chunks and include chunks from children entrypoints
*/
getRuntimeChunkDependentChunksIterable(chunk) {
/** @type {Chunks} */
const set = new Set();
/** @type {Entrypoints} */
const entrypoints = new Set();
for (const chunkGroup of chunk.groupsIterable) {
if (chunkGroup instanceof Entrypoint) {
const queue = [chunkGroup];
while (queue.length > 0) {
const current = queue.shift();
if (current) {
entrypoints.add(current);
let hasChildrenEntrypoint = false;
for (const child of current.childrenIterable) {
if (child instanceof Entrypoint && child.dependOn(current)) {
hasChildrenEntrypoint = true;
queue.push(/** @type {Entrypoint} */ (child));
}
}
// entryChunkB: hasChildrenEntrypoint = true
// entryChunkA: dependOn = entryChunkB
if (hasChildrenEntrypoint) {
const entrypointChunk = current.getEntrypointChunk();
if (entrypointChunk !== chunk && !entrypointChunk.hasRuntime()) {
// add entryChunkB to set
set.add(entrypointChunk);
}
}
}
}
}
}
for (const entrypoint of entrypoints) {
const entrypointChunk = entrypoint.getEntrypointChunk();
const cgc = this._getChunkGraphChunk(entrypointChunk);
for (const chunkGroup of cgc.entryModules.values()) {
for (const c of chunkGroup.chunks) {
if (c !== chunk && c !== entrypointChunk && !c.hasRuntime()) {
set.add(c);
}
}
}
}
return set;
}
/**
* Checks whether this chunk graph contains the chunk.
* @param {Chunk} chunk the chunk
* @returns {boolean} true, when it has dependent chunks
*/
hasChunkEntryDependentChunks(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
for (const chunkGroup of cgc.entryModules.values()) {
for (const c of chunkGroup.chunks) {
if (c !== chunk) {
return true;
}
}
}
return false;
}
/**
* Gets chunk runtime modules iterable.
* @param {Chunk} chunk the chunk
* @returns {Iterable<RuntimeModule>} iterable of modules (do not modify)
*/
getChunkRuntimeModulesIterable(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.runtimeModules;
}
/**
* Gets chunk runtime modules in order.
* @param {Chunk} chunk the chunk
* @returns {RuntimeModule[]} array of modules in order of execution
*/
getChunkRuntimeModulesInOrder(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
const array = [...cgc.runtimeModules];
array.sort(
concatComparators(
compareSelect(
(r) => /** @type {RuntimeModule} */ (r).stage,
compareIds
),
compareModulesByIdentifier
)
);
return array;
}
/**
* Gets chunk full hash modules iterable.
* @param {Chunk} chunk the chunk
* @returns {Iterable<RuntimeModule> | undefined} iterable of modules (do not modify)
*/
getChunkFullHashModulesIterable(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.fullHashModules;
}
/**
* Gets chunk full hash modules set.
* @param {Chunk} chunk the chunk
* @returns {ReadonlySet<RuntimeModule> | undefined} set of modules (do not modify)
*/
getChunkFullHashModulesSet(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.fullHashModules;
}
/**
* Gets chunk dependent hash modules iterable.
* @param {Chunk} chunk the chunk
* @returns {Iterable<RuntimeModule> | undefined} iterable of modules (do not modify)
*/
getChunkDependentHashModulesIterable(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.dependentHashModules;
}
/**
* Gets chunk entry modules with chunk group iterable.
* @param {Chunk} chunk the chunk
* @returns {Iterable<EntryModuleWithChunkGroup>} iterable of modules (do not modify)
*/
getChunkEntryModulesWithChunkGroupIterable(chunk) {
const cgc = this._getChunkGraphChunk(chunk);
return cgc.entryModules;
}
/**
* Gets block chunk group.
* @param {AsyncDependenciesBlock} depBlock the async block
* @returns {ChunkGroup | undefined} the chunk group
*/
getBlockChunkGroup(depBlock) {
return this._blockChunkGroups.get(depBlock);
}
/**
* Connects block and chunk group.
* @param {AsyncDependenciesBlock} depBlock the async block
* @param {ChunkGroup} chunkGroup the chunk group
* @returns {void}
*/
connectBlockAndChunkGroup(depBlock, chunkGroup) {
this._blockChunkGroups.set(depBlock, chunkGroup);
chunkGroup.addBlock(depBlock);
}
/**
* Disconnects chunk group.
* @param {ChunkGroup} chunkGroup the chunk group
* @returns {void}
*/
disconnectChunkGroup(chunkGroup) {
for (const block of chunkGroup.blocksIterable) {
this._blockChunkGroups.delete(block);
}
// TODO refactor by moving blocks list into ChunkGraph
chunkGroup._blocks.clear();
}
/**
* Returns the id of the module.
* @param {Module} module the module
* @returns {ModuleId | null} the id of the module
*/
getModuleId(module) {
const cgm = this._getChunkGraphModule(module);
return cgm.id;
}
/**
* Updates module id using the provided module.
* @param {Module} module the module
* @param {ModuleId} id the id of the module
* @returns {void}
*/
setModuleId(module, id) {
const cgm = this._getChunkGraphModule(module);
cgm.id = id;
}
/**
* Returns the id of the runtime.
* @param {string} runtime runtime
* @returns {RuntimeId} the id of the runtime
*/
getRuntimeId(runtime) {
return /** @type {RuntimeId} */ (this._runtimeIds.get(runtime));
}
/**
* Updates runtime id using the provided runtime.
* @param {string} runtime runtime
* @param {RuntimeId} id the id of the runtime
* @returns {void}
*/
setRuntimeId(runtime, id) {
this._runtimeIds.set(runtime, id);
}
/**
* Get module hash info.
* @template T
* @param {Module} module the module
* @param {RuntimeSpecMap<T>} hashes hashes data
* @param {RuntimeSpec} runtime the runtime
* @returns {T} hash
*/
_getModuleHashInfo(module, hashes, runtime) {
if (!hashes) {
throw new Error(
`Module ${module.identifier()} has no hash info for runtime ${runtimeToString(
runtime
)} (hashes not set at all)`
);
} else if (runtime === undefined) {
const hashInfoItems = new Set(hashes.values());
if (hashInfoItems.size !== 1) {
throw new Error(
`No unique hash info entry for unspecified runtime for ${module.identifier()} (existing runtimes: ${Array.from(
hashes.keys(),
(r) => runtimeToString(r)
).join(", ")}).
Caller might not support runtime-dependent code generation (opt-out via optimization.usedExports: "global").`
);
}
return /** @type {T} */ (first(hashInfoItems));
} else {
const hashInfo = hashes.get(runtime);
if (!hashInfo) {
throw new Error(
`Module ${module.identifier()} has no hash info for runtime ${runtimeToString(
runtime
)} (available runtimes ${Array.from(
hashes.keys(),
runtimeToString
).join(", ")})`
);
}
return hashInfo;
}
}
/**
* Checks whether this chunk graph contains the module.
* @param {Module} module the module
* @param {RuntimeSpec} runtime the runtime
* @returns {boolean} true, if the module has hashes for this runtime
*/
hasModuleHashes(module, runtime) {
const cgm = this._getChunkGraphModule(module);
const hashes = /** @type {RuntimeSpecMap<ModuleHashInfo>} */ (cgm.hashes);
return hashes && hashes.has(runtime);
}
/**
* Returns hash.
* @param {Module} module the module
* @param {RuntimeSpec} runtime the runtime
* @returns {string} hash
*/
getModuleHash(module, runtime) {
const cgm = this._getChunkGraphModule(module);
const hashes = /** @type {RuntimeSpecMap<ModuleHashInfo>} */ (cgm.hashes);
return this._getModuleHashInfo(module, hashes, runtime).hash;
}
/**
* Gets rendered module hash.
* @param {Module} module the module
* @param {RuntimeSpec} runtime the runtime
* @returns {string} hash
*/
getRenderedModuleHash(module, runtime) {
const cgm = this._getChunkGraphModule(module);
const hashes = /** @type {RuntimeSpecMap<ModuleHashInfo>} */ (cgm.hashes);
return this._getModuleHashInfo(module, hashes, runtime).renderedHash;
}
/**
* Sets module hashes.
* @param {Module} module the module
* @param {RuntimeSpec} runtime the runtime
* @param {string} hash the full hash
* @param {string} renderedHash the shortened hash for rendering
* @returns {void}
*/
setModuleHashes(module, runtime, hash, renderedHash) {
const cgm = this._getChunkGraphModule(module);
if (cgm.hashes === undefined) {
cgm.hashes = new RuntimeSpecMap();
}
cgm.hashes.set(runtime, new ModuleHashInfo(hash, renderedHash));
}
/**
* Adds module runtime requirements.
* @param {Module} module the module
* @param {RuntimeSpec} runtime the runtime
* @param {RuntimeRequirements} items runtime requirements to be added (ownership of this Set is given to ChunkGraph when transferOwnership not false)
* @param {boolean} transferOwnership true: transfer ownership of the items object, false: items is immutable and shared and won't be modified
* @returns {void}
*/
addModuleRuntimeRequirements(
module,
runtime,
items,
transferOwnership = true
) {
const cgm = this._getChunkGraphModule(module);
const runtimeRequirementsMap = cgm.runtimeRequirements;
if (runtimeRequirementsMap === undefined) {
/** @type {ChunkGraphRuntimeRequirements} */
const map = new RuntimeSpecMap();
// TODO avoid cloning item and track ownership instead
map.set(runtime, transferOwnership ? items : new Set(items));
cgm.runtimeRequirements = map;
return;
}
runtimeRequirementsMap.update(runtime, (runtimeRequirements) => {
if (runtimeRequirements === undefined) {
return transferOwnership ? items : new Set(items);
} else if (!transferOwnership || runtimeRequirements.size >= items.size) {
for (const item of items) runtimeRequirements.add(item);
return runtimeRequirements;
}
for (const item of runtimeRequirements) items.add(item);
return items;
});
}
/**
* Adds chunk runtime requirements.
* @param {Chunk} chunk the chunk