JavaScriptExample
diff --git a/‎lib/optimize/LimitChunkCountPlugin.js‎
Lines changed: 13 additions & 13 deletions b/‎lib/optimize/LimitChunkCountPlugin.js‎
Lines changed: 13 additions & 13 deletions
@@ -21,31 +21,31 @@ class LimitChunkCountPlugin {
 				if(chunks.length <= maxChunks) return;
 
 				if(chunks.length > maxChunks) {
-					let combinations = [];
-					chunks.forEach((a, idx) => {
+					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]);
 						}
-					});
-
-					combinations.forEach((pair) => {
+						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);
-						pair.unshift(a + b - ab, ab);
-						pair.push(a, b);
-					});
-					combinations = combinations.filter((pair) => {
-						return pair[1] !== false;
-					});
-					combinations.sort((a, b) => {
+						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 = combinations[0];
+					const pair = sortedExtendedPairCombinations[0];
 
 					if(pair && pair[2].integrate(pair[3], "limit")) {
 						chunks.splice(chunks.indexOf(pair[3]), 1);