Code coverage report for lib\optimize\AggressiveMergingPlugin.js

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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
 
 
 
 
1
1
 
1
 
1
1
1
1
8
9
 
9
 
 
1
1
2
2
11
5
13
13
4
 
 
 
2
4
4
4
4
4
 
4
4
4
4
4
4
 
 
 
 
4
 
2
4
 
2
3
 
 
2
 
2
2
 
1
1
2
 
1
2
 
1
2
 
1
1
1
1
1
1
 
 
1
1
1
1
1
1
 
 
 
1
1
1
 
 
 
 
 
 
/*
	MIT License http://www.opensource.org/licenses/mit-license.php
	Author Tobias Koppers @sokra
*/
function AggressiveMergingPlugin(options) {
	this.options = options || {};
}
module.exports = AggressiveMergingPlugin;
 
AggressiveMergingPlugin.prototype.apply = function(compiler) {
	var options = this.options;
	var minSizeReduce = options.minSizeReduce || 1.5;
	function getParentsWeight(chunk) {
		return chunk.parents.map(function(p) {
			return p.initial ? options.entryChunkMultiplicator || 10 : 1;
		}).reduce(function(a, b) {
			return a + b;
		}, 0);
	}
	compiler.plugin("compilation", function(compilation) {
		compilation.plugin("optimize-chunks", function(chunks) {
			var combinations = [];
			chunks.forEach(function(a, idx) {
				if(a.initial) return;
				for(var i = 0; i < idx; i++) {
					var b = chunks[i];
					if(b.initial) continue;
					combinations.push([b, a]);
				}
			});
 
			combinations.forEach(function(pair) {
				var a = pair[0].size({chunkOverhead: 0});
				var b = pair[1].size({chunkOverhead: 0});
				var ab = pair[0].integratedSize(pair[1], {chunkOverhead: 0});
				pair.push({ a: a, b: b, ab: ab });
				Iif(ab === false) {
					pair.unshift(false);
				} else Eif(options.moveToParents) {
					var aOnly = ab - b;
					var bOnly = ab - a;
					var common = a + b - ab;
					var newSize = common + getParentsWeight(pair[0]) * aOnly + getParentsWeight(pair[1]) * bOnly;
					pair.push({ aOnly: aOnly, bOnly: bOnly, common: common, newSize: newSize });
				} else {
					var newSize = ab;
				}
 
				pair.unshift((a + b) / newSize);
			});
			combinations = combinations.filter(function(pair) {
				return pair[0] !== false;
			});
			combinations.sort(function(a,b) {
				return b[0] - a[0];
			});
 
			var pair = combinations[0];
 
			Iif(!pair) return;
			if(pair[0] < minSizeReduce) return;
 
			Eif(options.moveToParents) {
				var commonModules = pair[1].modules.filter(function(m) {
					return pair[2].modules.indexOf(m) >= 0;
				});
				var aOnlyModules = pair[1].modules.filter(function(m) {
					return commonModules.indexOf(m) < 0;
				});
				var bOnlyModules = pair[2].modules.filter(function(m) {
					return commonModules.indexOf(m) < 0;
				});
				aOnlyModules.forEach(function(m) {
					pair[1].removeModule(m);
					m.removeChunk(pair[1]);
					pair[1].parents.forEach(function(c) {
						c.addModule(m);
						m.addChunk(c);
					});
				});
				bOnlyModules.forEach(function(m) {
					pair[2].removeModule(m);
					m.removeChunk(pair[2]);
					pair[2].parents.forEach(function(c) {
						c.addModule(m);
						m.addChunk(c);
					});
				});
			}
			Eif(pair[1].integrate(pair[2], "aggressive-merge")) {
				chunks.splice(chunks.indexOf(pair[2]), 1);
				this.restartApplyPlugins();
			}
		});
	});
};