Gecko [ fernandoquevedodop.com ]

Name	Size	Permission
AggressiveMergingPlugin.js	2.02 KB	-rw-r--r--
AggressiveSplittingPlugin.js	9.14 KB	-rw-r--r--
ChunkModuleIdRangePlugin.js	1.55 KB	-rw-r--r--
ConcatenatedModule.js	36.82 KB	-rw-r--r--
EnsureChunkConditionsPlugin.js	2.01 KB	-rw-r--r--
FlagIncludedChunksPlugin.js	3.14 KB	-rw-r--r--
LimitChunkCountPlugin.js	7.42 KB	-rw-r--r--
MergeDuplicateChunksPlugin.js	2.43 KB	-rw-r--r--
MinChunkSizePlugin.js	2.53 KB	-rw-r--r--
MinMaxSizeWarning.js	819 B	-rw-r--r--
ModuleConcatenationPlugin.js	14.49 KB	-rw-r--r--
NaturalChunkOrderPlugin.js	1.1 KB	-rw-r--r--
OccurrenceChunkOrderPlugin.js	2.01 KB	-rw-r--r--
OccurrenceModuleOrderPlugin.js	3.27 KB	-rw-r--r--
OccurrenceOrderPlugin.js	3.9 KB	-rw-r--r--
RemoveEmptyChunksPlugin.js	990 B	-rw-r--r--
RemoveParentModulesPlugin.js	3.61 KB	-rw-r--r--
RuntimeChunkPlugin.js	1.04 KB	-rw-r--r--
SideEffectsFlagPlugin.js	5.14 KB	-rw-r--r--
SplitChunksPlugin.js	28.75 KB	-rw-r--r--

Code Editor : OccurrenceModuleOrderPlugin.js

/*
	MIT License http://www.opensource.org/licenses/mit-license.php
	Author Tobias Koppers @sokra
*/
"use strict";

const validateOptions = require("schema-utils").validate;
const schema = require("../../schemas/plugins/optimize/OccurrenceOrderModuleIdsPlugin.json");

/** @typedef {import("../../declarations/plugins/optimize/OccurrenceOrderModuleIdsPlugin").OccurrenceOrderModuleIdsPluginOptions} OccurrenceOrderModuleIdsPluginOptions */

class OccurrenceOrderModuleIdsPlugin {
	/**
	 * @param {OccurrenceOrderModuleIdsPluginOptions=} options options object
	 */
	constructor(options = {}) {
		validateOptions(schema, options, "Occurrence Order Module Ids Plugin");
		this.options = options;
	}

apply(compiler) {
		const prioritiseInitial = this.options.prioritiseInitial;
		compiler.hooks.compilation.tap(
			"OccurrenceOrderModuleIdsPlugin",
			compilation => {
				compilation.hooks.optimizeModuleOrder.tap(
					"OccurrenceOrderModuleIdsPlugin",
					modules => {
						const occursInInitialChunksMap = new Map();
						const occursInAllChunksMap = new Map();

const initialChunkChunkMap = new Map();
						const entryCountMap = new Map();
						for (const m of modules) {
							let initial = 0;
							let entry = 0;
							for (const c of m.chunksIterable) {
								if (c.canBeInitial()) initial++;
								if (c.entryModule === m) entry++;
							}
							initialChunkChunkMap.set(m, initial);
							entryCountMap.set(m, entry);
						}

if (prioritiseInitial) {
							for (const m of modules) {
								const result =
									m.reasons.reduce(countOccursInEntry, 0) +
									initialChunkChunkMap.get(m) +
									entryCountMap.get(m);
								occursInInitialChunksMap.set(m, result);
							}
						}

const originalOrder = new Map();
						let i = 0;
						for (const m of modules) {
							const result =
								m.reasons.reduce(countOccurs, 0) +
								m.getNumberOfChunks() +
								entryCountMap.get(m);
							occursInAllChunksMap.set(m, result);
							originalOrder.set(m, i++);
						}

modules.sort((a, b) => {
							if (prioritiseInitial) {
								const aEntryOccurs = occursInInitialChunksMap.get(a);
								const bEntryOccurs = occursInInitialChunksMap.get(b);
								if (aEntryOccurs > bEntryOccurs) return -1;
								if (aEntryOccurs < bEntryOccurs) return 1;
							}
							const aOccurs = occursInAllChunksMap.get(a);
							const bOccurs = occursInAllChunksMap.get(b);
							if (aOccurs > bOccurs) return -1;
							if (aOccurs < bOccurs) return 1;
							const orgA = originalOrder.get(a);
							const orgB = originalOrder.get(b);
							return orgA - orgB;
						});
					}
				);
			}
		);
	}
}

module.exports = OccurrenceOrderModuleIdsPlugin;

${this.title}

Code Editor : OccurrenceModuleOrderPlugin.js