webpack 3.6.0 → 3.8.1

package/lib/performance/SizeLimitsPlugin.js

@@ -1,102 +1,102 @@
-/*
-	MIT License http://www.opensource.org/licenses/mit-license.php
-	Author Sean Larkin @thelarkinn
-*/
-"use strict";
-const EntrypointsOverSizeLimitWarning = require("./EntrypointsOverSizeLimitWarning");
-const AssetsOverSizeLimitWarning = require("./AssetsOverSizeLimitWarning");
-const NoAsyncChunksWarning = require("./NoAsyncChunksWarning");
-
-module.exports = class SizeLimitsPlugin {
-	constructor(options) {
-		this.hints = options.hints;
-		this.maxAssetSize = options.maxAssetSize;
-		this.maxEntrypointSize = options.maxEntrypointSize;
-		this.assetFilter = options.assetFilter;
-	}
-	apply(compiler) {
-		const entrypointSizeLimit = this.maxEntrypointSize;
-		const assetSizeLimit = this.maxAssetSize;
-		const hints = this.hints;
-		const assetFilter = this.assetFilter || (asset => !(/\.map$/.test(asset)));
-
-		compiler.plugin("after-emit", (compilation, callback) => {
-			const warnings = [];
-
-			const getEntrypointSize = entrypoint =>
-				entrypoint.getFiles()
-				.filter(assetFilter)
-				.map(file => compilation.assets[file])
-				.filter(Boolean)
-				.map(asset => asset.size())
-				.reduce((currentSize, nextSize) => currentSize + nextSize, 0);
-
-			const assetsOverSizeLimit = [];
-			Object.keys(compilation.assets)
-				.filter(assetFilter)
-				.forEach(assetName => {
-					const asset = compilation.assets[assetName];
-					const size = asset.size();
-
-					if(size > assetSizeLimit) {
-						assetsOverSizeLimit.push({
-							name: assetName,
-							size: size,
-						});
-						asset.isOverSizeLimit = true;
-					}
-				});
-
-			const entrypointsOverLimit = [];
-			Object.keys(compilation.entrypoints)
-				.forEach(key => {
-					const entry = compilation.entrypoints[key];
-					const size = getEntrypointSize(entry, compilation);
-
-					if(size > entrypointSizeLimit) {
-						entrypointsOverLimit.push({
-							name: key,
-							size: size,
-							files: entry.getFiles().filter(assetFilter)
-						});
-						entry.isOverSizeLimit = true;
-					}
-				});
-
-			if(hints) {
-				// 1. Individual Chunk: Size < 250kb
-				// 2. Collective Initial Chunks [entrypoint] (Each Set?): Size < 250kb
-				// 3. No Async Chunks
-				// if !1, then 2, if !2 return
-				if(assetsOverSizeLimit.length > 0) {
-					warnings.push(
-						new AssetsOverSizeLimitWarning(
-							assetsOverSizeLimit,
-							assetSizeLimit));
-				}
-				if(entrypointsOverLimit.length > 0) {
-					warnings.push(
-						new EntrypointsOverSizeLimitWarning(
-							entrypointsOverLimit,
-							entrypointSizeLimit));
-				}
-
-				if(warnings.length > 0) {
-					const hasAsyncChunks = compilation.chunks.filter(chunk => !chunk.isInitial()).length > 0;
-
-					if(!hasAsyncChunks) {
-						warnings.push(new NoAsyncChunksWarning());
-					}
-
-					if(hints === "error") {
-						Array.prototype.push.apply(compilation.errors, warnings);
-					} else {
-						Array.prototype.push.apply(compilation.warnings, warnings);
-					}
-				}
-			}
-
-			callback();
-		});
-	}
-};
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Sean Larkin @thelarkinn
+*/
+"use strict";
+const EntrypointsOverSizeLimitWarning = require("./EntrypointsOverSizeLimitWarning");
+const AssetsOverSizeLimitWarning = require("./AssetsOverSizeLimitWarning");
+const NoAsyncChunksWarning = require("./NoAsyncChunksWarning");
+
+module.exports = class SizeLimitsPlugin {
+	constructor(options) {
+		this.hints = options.hints;
+		this.maxAssetSize = options.maxAssetSize;
+		this.maxEntrypointSize = options.maxEntrypointSize;
+		this.assetFilter = options.assetFilter;
+	}
+	apply(compiler) {
+		const entrypointSizeLimit = this.maxEntrypointSize;
+		const assetSizeLimit = this.maxAssetSize;
+		const hints = this.hints;
+		const assetFilter = this.assetFilter || (asset => !(/\.map$/.test(asset)));
+
+		compiler.plugin("after-emit", (compilation, callback) => {
+			const warnings = [];
+
+			const getEntrypointSize = entrypoint =>
+				entrypoint.getFiles()
+				.filter(assetFilter)
+				.map(file => compilation.assets[file])
+				.filter(Boolean)
+				.map(asset => asset.size())
+				.reduce((currentSize, nextSize) => currentSize + nextSize, 0);
+
+			const assetsOverSizeLimit = [];
+			Object.keys(compilation.assets)
+				.filter(assetFilter)
+				.forEach(assetName => {
+					const asset = compilation.assets[assetName];
+					const size = asset.size();
+
+					if(size > assetSizeLimit) {
+						assetsOverSizeLimit.push({
+							name: assetName,
+							size: size,
+						});
+						asset.isOverSizeLimit = true;
+					}
+				});
+
+			const entrypointsOverLimit = [];
+			Object.keys(compilation.entrypoints)
+				.forEach(key => {
+					const entry = compilation.entrypoints[key];
+					const size = getEntrypointSize(entry, compilation);
+
+					if(size > entrypointSizeLimit) {
+						entrypointsOverLimit.push({
+							name: key,
+							size: size,
+							files: entry.getFiles().filter(assetFilter)
+						});
+						entry.isOverSizeLimit = true;
+					}
+				});
+
+			if(hints) {
+				// 1. Individual Chunk: Size < 250kb
+				// 2. Collective Initial Chunks [entrypoint] (Each Set?): Size < 250kb
+				// 3. No Async Chunks
+				// if !1, then 2, if !2 return
+				if(assetsOverSizeLimit.length > 0) {
+					warnings.push(
+						new AssetsOverSizeLimitWarning(
+							assetsOverSizeLimit,
+							assetSizeLimit));
+				}
+				if(entrypointsOverLimit.length > 0) {
+					warnings.push(
+						new EntrypointsOverSizeLimitWarning(
+							entrypointsOverLimit,
+							entrypointSizeLimit));
+				}
+
+				if(warnings.length > 0) {
+					const hasAsyncChunks = compilation.chunks.filter(chunk => !chunk.isInitial()).length > 0;
+
+					if(!hasAsyncChunks) {
+						warnings.push(new NoAsyncChunksWarning());
+					}
+
+					if(hints === "error") {
+						Array.prototype.push.apply(compilation.errors, warnings);
+					} else {
+						Array.prototype.push.apply(compilation.warnings, warnings);
+					}
+				}
+			}
+
+			callback();
+		});
+	}
+};

package/lib/prepareOptions.js

@@ -1,29 +1,29 @@
-"use strict";
-
-module.exports = function prepareOptions(options, argv) {
-	argv = argv || {};
-
-	options = handleExport(options);
-
-	if(Array.isArray(options)) {
-		options = options.map(_options => handleFunction(_options, argv));
-	} else {
-		options = handleFunction(options, argv);
-	}
-	return options;
-};
-
-function handleExport(options) {
-	const isES6DefaultExported = (
-		typeof options === "object" && options !== null && typeof options.default !== "undefined"
-	);
-	options = isES6DefaultExported ? options.default : options;
-	return options;
-}
-
-function handleFunction(options, argv) {
-	if(typeof options === "function") {
-		options = options(argv.env, argv);
-	}
-	return options;
-}
+"use strict";
+
+module.exports = function prepareOptions(options, argv) {
+	argv = argv || {};
+
+	options = handleExport(options);
+
+	if(Array.isArray(options)) {
+		options = options.map(_options => handleFunction(_options, argv));
+	} else {
+		options = handleFunction(options, argv);
+	}
+	return options;
+};
+
+function handleExport(options) {
+	const isES6DefaultExported = (
+		typeof options === "object" && options !== null && typeof options.default !== "undefined"
+	);
+	options = isES6DefaultExported ? options.default : options;
+	return options;
+}
+
+function handleFunction(options, argv) {
+	if(typeof options === "function") {
+		options = options(argv.env, argv);
+	}
+	return options;
+}

package/lib/removeAndDo.js

@@ -1,15 +1,15 @@
-/*
-	MIT License http://www.opensource.org/licenses/mit-license.php
-	Author Tobias Koppers @sokra
-*/
-"use strict";
-
-module.exports = function removeAndDo(collection, thing, action) {
-	const idx = this[collection].indexOf(thing);
-	const hasThingInCollection = idx >= 0;
-	if(hasThingInCollection) {
-		this[collection].splice(idx, 1);
-		thing[action](this);
-	}
-	return hasThingInCollection;
-};
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+module.exports = function removeAndDo(collection, thing, action) {
+	const idx = this[collection].indexOf(thing);
+	const hasThingInCollection = idx >= 0;
+	if(hasThingInCollection) {
+		this[collection].splice(idx, 1);
+		thing[action](this);
+	}
+	return hasThingInCollection;
+};

package/lib/util/Queue.js

@@ -0,0 +1,42 @@
+"use strict";
+
+module.exports = class Queue {
+	constructor(items) {
+		this.first = null;
+		this.last = null;
+		this.length = 0;
+		if(items) {
+			for(const item of items) {
+				this.enqueue(item);
+			}
+		}
+	}
+
+	enqueue(item) {
+		const first = this.first;
+		const node = {
+			item,
+			next: null
+		};
+		if(first === null) {
+			this.last = node;
+		} else {
+			first.next = node;
+		}
+		this.first = node;
+		this.length++;
+	}
+
+	dequeue() {
+		const last = this.last;
+		if(last === null)
+			return undefined;
+		const next = last.next;
+		if(next === null) {
+			this.first = null;
+		}
+		this.last = next;
+		this.length--;
+		return last.item;
+	}
+};

package/lib/util/Semaphore.js

@@ -1,32 +1,32 @@
-/*
-	MIT License http://www.opensource.org/licenses/mit-license.php
-	Author Tobias Koppers @sokra
-*/
-"use strict";
-
-class Semaphore {
-	constructor(available) {
-		this.available = available;
-		this.waiters = [];
-	}
-
-	acquire(callback) {
-		if(this.available > 0) {
-			this.available--;
-			callback();
-		} else {
-			this.waiters.push(callback);
-		}
-	}
-
-	release() {
-		if(this.waiters.length > 0) {
-			const callback = this.waiters.pop();
-			process.nextTick(callback);
-		} else {
-			this.available++;
-		}
-	}
-}
-
-module.exports = Semaphore;
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+class Semaphore {
+	constructor(available) {
+		this.available = available;
+		this.waiters = [];
+	}
+
+	acquire(callback) {
+		if(this.available > 0) {
+			this.available--;
+			callback();
+		} else {
+			this.waiters.push(callback);
+		}
+	}
+
+	release() {
+		if(this.waiters.length > 0) {
+			const callback = this.waiters.pop();
+			process.nextTick(callback);
+		} else {
+			this.available++;
+		}
+	}
+}
+
+module.exports = Semaphore;

package/lib/util/identifier.js

@@ -1,38 +1,38 @@
-"use strict";
-const path = require("path");
-
-const looksLikeAbsolutePath = (maybeAbsolutePath) => {
-	return /^(?:[a-z]:\\|\/)/i.test(maybeAbsolutePath);
-};
-
-const normalizePathSeparator = (p) => p.replace(/\\/g, "/");
-
-const _makePathsRelative = (context, identifier) => {
-	return identifier
-		.split(/([|! ])/)
-		.map(str => looksLikeAbsolutePath(str) ?
-			normalizePathSeparator(path.relative(context, str)) : str)
-		.join("");
-};
-
-exports.makePathsRelative = (context, identifier, cache) => {
-	if(!cache) return _makePathsRelative(context, identifier);
-
-	const relativePaths = cache.relativePaths || (cache.relativePaths = new Map());
-
-	let cachedResult;
-	let contextCache = relativePaths.get(context);
-	if(typeof contextCache === "undefined") {
-		relativePaths.set(context, contextCache = new Map());
-	} else {
-		cachedResult = contextCache.get(identifier);
-	}
-
-	if(typeof cachedResult !== "undefined") {
-		return cachedResult;
-	} else {
-		const relativePath = _makePathsRelative(context, identifier);
-		contextCache.set(identifier, relativePath);
-		return relativePath;
-	}
-};
+"use strict";
+const path = require("path");
+
+const looksLikeAbsolutePath = (maybeAbsolutePath) => {
+	return /^(?:[a-z]:\\|\/)/i.test(maybeAbsolutePath);
+};
+
+const normalizePathSeparator = (p) => p.replace(/\\/g, "/");
+
+const _makePathsRelative = (context, identifier) => {
+	return identifier
+		.split(/([|! ])/)
+		.map(str => looksLikeAbsolutePath(str) ?
+			normalizePathSeparator(path.relative(context, str)) : str)
+		.join("");
+};
+
+exports.makePathsRelative = (context, identifier, cache) => {
+	if(!cache) return _makePathsRelative(context, identifier);
+
+	const relativePaths = cache.relativePaths || (cache.relativePaths = new Map());
+
+	let cachedResult;
+	let contextCache = relativePaths.get(context);
+	if(typeof contextCache === "undefined") {
+		relativePaths.set(context, contextCache = new Map());
+	} else {
+		cachedResult = contextCache.get(identifier);
+	}
+
+	if(typeof cachedResult !== "undefined") {
+		return cachedResult;
+	} else {
+		const relativePath = _makePathsRelative(context, identifier);
+		contextCache.set(identifier, relativePath);
+		return relativePath;
+	}
+};

package/lib/validateSchema.js

@@ -1,66 +1,66 @@
-/*
-	MIT License http://www.opensource.org/licenses/mit-license.php
-	Author Gajus Kuizinas @gajus
-*/
-"use strict";
-
-const Ajv = require("ajv");
-const ajv = new Ajv({
-	errorDataPath: "configuration",
-	allErrors: true,
-	verbose: true
-});
-require("ajv-keywords")(ajv, ["instanceof"]);
-require("../schemas/ajv.absolutePath")(ajv);
-
-function validateSchema(schema, options) {
-	if(Array.isArray(options)) {
-		const errors = options.map((options) => validateObject(schema, options));
-		errors.forEach((list, idx) => {
-			list.forEach(function applyPrefix(err) {
-				err.dataPath = `[${idx}]${err.dataPath}`;
-				if(err.children) {
-					err.children.forEach(applyPrefix);
-				}
-			});
-		});
-		return errors.reduce((arr, items) => {
-			return arr.concat(items);
-		}, []);
-	} else {
-		return validateObject(schema, options);
-	}
-}
-
-function validateObject(schema, options) {
-	const validate = ajv.compile(schema);
-	const valid = validate(options);
-	return valid ? [] : filterErrors(validate.errors);
-}
-
-function filterErrors(errors) {
-	let newErrors = [];
-	errors.forEach((err) => {
-		const dataPath = err.dataPath;
-		let children = [];
-		newErrors = newErrors.filter((oldError) => {
-			if(oldError.dataPath.includes(dataPath)) {
-				if(oldError.children) {
-					children = children.concat(oldError.children.slice(0));
-				}
-				oldError.children = undefined;
-				children.push(oldError);
-				return false;
-			}
-			return true;
-		});
-		if(children.length) {
-			err.children = children;
-		}
-		newErrors.push(err);
-	});
-
-	return newErrors;
-}
-
-module.exports = validateSchema;
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Gajus Kuizinas @gajus
+*/
+"use strict";
+
+const Ajv = require("ajv");
+const ajv = new Ajv({
+	errorDataPath: "configuration",
+	allErrors: true,
+	verbose: true
+});
+require("ajv-keywords")(ajv, ["instanceof"]);
+require("../schemas/ajv.absolutePath")(ajv);
+
+function validateSchema(schema, options) {
+	if(Array.isArray(options)) {
+		const errors = options.map((options) => validateObject(schema, options));
+		errors.forEach((list, idx) => {
+			list.forEach(function applyPrefix(err) {
+				err.dataPath = `[${idx}]${err.dataPath}`;
+				if(err.children) {
+					err.children.forEach(applyPrefix);
+				}
+			});
+		});
+		return errors.reduce((arr, items) => {
+			return arr.concat(items);
+		}, []);
+	} else {
+		return validateObject(schema, options);
+	}
+}
+
+function validateObject(schema, options) {
+	const validate = ajv.compile(schema);
+	const valid = validate(options);
+	return valid ? [] : filterErrors(validate.errors);
+}
+
+function filterErrors(errors) {
+	let newErrors = [];
+	errors.forEach((err) => {
+		const dataPath = err.dataPath;
+		let children = [];
+		newErrors = newErrors.filter((oldError) => {
+			if(oldError.dataPath.includes(dataPath)) {
+				if(oldError.children) {
+					children = children.concat(oldError.children.slice(0));
+				}
+				oldError.children = undefined;
+				children.push(oldError);
+				return false;
+			}
+			return true;
+		});
+		if(children.length) {
+			err.children = children;
+		}
+		newErrors.push(err);
+	});
+
+	return newErrors;
+}
+
+module.exports = validateSchema;

package/lib/web/WebEnvironmentPlugin.js

@@ -1,18 +1,18 @@
-/*
-	MIT License http://www.opensource.org/licenses/mit-license.php
-	Author Tobias Koppers @sokra
-*/
-"use strict";
-
-class WebEnvironmentPlugin {
-	constructor(inputFileSystem, outputFileSystem) {
-		this.inputFileSystem = inputFileSystem;
-		this.outputFileSystem = outputFileSystem;
-	}
-
-	apply(compiler) {
-		compiler.outputFileSystem = this.outputFileSystem;
-	}
-}
-
-module.exports = WebEnvironmentPlugin;
+/*
+	MIT License http://www.opensource.org/licenses/mit-license.php
+	Author Tobias Koppers @sokra
+*/
+"use strict";
+
+class WebEnvironmentPlugin {
+	constructor(inputFileSystem, outputFileSystem) {
+		this.inputFileSystem = inputFileSystem;
+		this.outputFileSystem = outputFileSystem;
+	}
+
+	apply(compiler) {
+		compiler.outputFileSystem = this.outputFileSystem;
+	}
+}
+
+module.exports = WebEnvironmentPlugin;

package/lib/webpack.js

@@ -73,6 +73,7 @@ exportPlugins(exports, {
 	"DefinePlugin": () => require("./DefinePlugin"),
 	"NormalModuleReplacementPlugin": () => require("./NormalModuleReplacementPlugin"),
 	"ContextReplacementPlugin": () => require("./ContextReplacementPlugin"),
+	"ContextExclusionPlugin": () => require("./ContextExclusionPlugin"),
 	"IgnorePlugin": () => require("./IgnorePlugin"),
 	"WatchIgnorePlugin": () => require("./WatchIgnorePlugin"),
 	"BannerPlugin": () => require("./BannerPlugin"),