Blame view

node_modules/webpack/lib/optimize/LimitChunkCountPlugin.js 1.88 KB
2a09d1a4   liuqimichale   添加宜春 天水 宣化
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
  /*
  	MIT License http://www.opensource.org/licenses/mit-license.php
  	Author Tobias Koppers @sokra
  */
  "use strict";
  
  class LimitChunkCountPlugin {
  	constructor(options) {
  		if(options !== undefined && typeof options !== "object" || Array.isArray(options)) {
  			throw new Error("Argument should be an options object.\nFor more info on options, see https://webpack.js.org/plugins/");
  		}
  		this.options = options || {};
  	}
  	apply(compiler) {
  		const options = this.options;
  		compiler.plugin("compilation", (compilation) => {
  			compilation.plugin("optimize-chunks-advanced", (chunks) => {
  				const maxChunks = options.maxChunks;
  				if(!maxChunks) return;
  				if(maxChunks < 1) return;
  				if(chunks.length <= maxChunks) return;
  
  				if(chunks.length > maxChunks) {
  					const sortedExtendedPairCombinations = chunks.reduce((combinations, a, idx) => {
  						// create combination pairs
  						for(let i = 0; i < idx; i++) {
  							const b = chunks[i];
  							combinations.push([b, a]);
  						}
  						return combinations;
  					}, []).map((pair) => {
  						// extend combination pairs with size and integrated size
  						const a = pair[0].size(options);
  						const b = pair[1].size(options);
  						const ab = pair[0].integratedSize(pair[1], options);
  						return [a + b - ab, ab, pair[0], pair[1], a, b];
  					}).filter((extendedPair) => {
  						// filter pairs that do not have an integratedSize
  						// meaning they can NOT be integrated!
  						return extendedPair[1] !== false;
  					}).sort((a, b) => { // sadly javascript does an inplace sort here
  						// sort them by size
  						const diff = b[0] - a[0];
  						if(diff !== 0) return diff;
  						return a[1] - b[1];
  					});
  
  					const pair = sortedExtendedPairCombinations[0];
  
  					if(pair && pair[2].integrate(pair[3], "limit")) {
  						chunks.splice(chunks.indexOf(pair[3]), 1);
  						return true;
  					}
  				}
  			});
  		});
  	}
  }
  module.exports = LimitChunkCountPlugin;