From de98e0b232509d5f40c135d540a70e415272ff85 Mon Sep 17 00:00:00 2001
From: Florian Dold <florian.dold@gmail.com>
Date: Wed, 3 May 2017 15:35:00 +0200
Subject: node_modules

---
 .../webpack/lib/optimize/OccurrenceOrderPlugin.js  | 116 +++++++++++++++++++++
 1 file changed, 116 insertions(+)
 create mode 100644 node_modules/webpack/lib/optimize/OccurrenceOrderPlugin.js

(limited to 'node_modules/webpack/lib/optimize/OccurrenceOrderPlugin.js')

diff --git a/node_modules/webpack/lib/optimize/OccurrenceOrderPlugin.js b/node_modules/webpack/lib/optimize/OccurrenceOrderPlugin.js
new file mode 100644
index 000000000..a6bb30b34
--- /dev/null
+++ b/node_modules/webpack/lib/optimize/OccurrenceOrderPlugin.js
@@ -0,0 +1,116 @@
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+class OccurrenceOrderPlugin {
+	constructor(preferEntry) {
+		if(preferEntry !== undefined && typeof preferEntry !== "boolean") {
+			throw new Error("Argument should be a boolean.\nFor more info on this plugin, see https://webpack.js.org/plugins/");
+		}
+		this.preferEntry = preferEntry;
+	}
+	apply(compiler) {
+		const preferEntry = this.preferEntry;
+		compiler.plugin("compilation", (compilation) => {
+			compilation.plugin("optimize-module-order", (modules) => {
+				function entryChunks(m) {
+					return m.chunks.map((c) => {
+						const sum = (c.isInitial() ? 1 : 0) + (c.entryModule === m ? 1 : 0);
+						return sum;
+					}).reduce((a, b) => {
+						return a + b;
+					}, 0);
+				}
+
+				function occursInEntry(m) {
+					if(typeof m.__OccurenceOrderPlugin_occursInEntry === "number") return m.__OccurenceOrderPlugin_occursInEntry;
+					const result = m.reasons.map((r) => {
+						if(!r.module) return 0;
+						return entryChunks(r.module);
+					}).reduce((a, b) => {
+						return a + b;
+					}, 0) + entryChunks(m);
+					return m.__OccurenceOrderPlugin_occursInEntry = result;
+				}
+
+				function occurs(m) {
+					if(typeof m.__OccurenceOrderPlugin_occurs === "number") return m.__OccurenceOrderPlugin_occurs;
+					const result = m.reasons.map((r) => {
+						if(!r.module) return 0;
+						return r.module.chunks.length;
+					}).reduce((a, b) => {
+						return a + b;
+					}, 0) + m.chunks.length + m.chunks.filter((c) => {
+						return c.entryModule === m;
+					}).length;
+					return m.__OccurenceOrderPlugin_occurs = result;
+				}
+				modules.sort((a, b) => {
+					if(preferEntry) {
+						const aEntryOccurs = occursInEntry(a);
+						const bEntryOccurs = occursInEntry(b);
+						if(aEntryOccurs > bEntryOccurs) return -1;
+						if(aEntryOccurs < bEntryOccurs) return 1;
+					}
+					const aOccurs = occurs(a);
+					const bOccurs = occurs(b);
+					if(aOccurs > bOccurs) return -1;
+					if(aOccurs < bOccurs) return 1;
+					if(a.identifier() > b.identifier()) return 1;
+					if(a.identifier() < b.identifier()) return -1;
+					return 0;
+				});
+				// TODO refactor to Map
+				modules.forEach((m) => {
+					m.__OccurenceOrderPlugin_occursInEntry = undefined;
+					m.__OccurenceOrderPlugin_occurs = undefined;
+				});
+			});
+			compilation.plugin("optimize-chunk-order", (chunks) => {
+				function occursInEntry(c) {
+					if(typeof c.__OccurenceOrderPlugin_occursInEntry === "number") return c.__OccurenceOrderPlugin_occursInEntry;
+					const result = c.parents.filter((p) => {
+						return p.isInitial();
+					}).length;
+					return c.__OccurenceOrderPlugin_occursInEntry = result;
+				}
+
+				function occurs(c) {
+					return c.blocks.length;
+				}
+				chunks.forEach((c) => {
+					c.modules.sort((a, b) => {
+						if(a.identifier() > b.identifier()) return 1;
+						if(a.identifier() < b.identifier()) return -1;
+						return 0;
+					});
+				});
+				chunks.sort((a, b) => {
+					const aEntryOccurs = occursInEntry(a);
+					const bEntryOccurs = occursInEntry(b);
+					if(aEntryOccurs > bEntryOccurs) return -1;
+					if(aEntryOccurs < bEntryOccurs) return 1;
+					const aOccurs = occurs(a);
+					const bOccurs = occurs(b);
+					if(aOccurs > bOccurs) return -1;
+					if(aOccurs < bOccurs) return 1;
+					if(a.modules.length > b.modules.length) return -1;
+					if(a.modules.length < b.modules.length) return 1;
+					for(let i = 0; i < a.modules.length; i++) {
+						if(a.modules[i].identifier() > b.modules[i].identifier()) return -1;
+						if(a.modules[i].identifier() < b.modules[i].identifier()) return 1;
+					}
+					return 0;
+				});
+				// TODO refactor to Map
+				chunks.forEach((c) => {
+					c.__OccurenceOrderPlugin_occursInEntry = undefined;
+				});
+			});
+		});
+	}
+}
+
+module.exports = OccurrenceOrderPlugin;
-- 
cgit v1.2.3