| 
									
										
										
										
											2013-01-31 01:49:25 +08:00
										 |  |  | /* | 
					
						
							|  |  |  | 	MIT License http://www.opensource.org/licenses/mit-license.php
 | 
					
						
							|  |  |  | 	Author Tobias Koppers @sokra | 
					
						
							|  |  |  | */ | 
					
						
							| 
									
										
										
										
											2018-07-30 23:08:51 +08:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2017-01-05 13:42:36 +08:00
										 |  |  | "use strict"; | 
					
						
							| 
									
										
										
										
											2013-01-31 01:49:25 +08:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2017-01-05 13:42:36 +08:00
										 |  |  | class MergeDuplicateChunksPlugin { | 
					
						
							|  |  |  | 	apply(compiler) { | 
					
						
							| 
									
										
										
										
											2018-02-25 09:00:20 +08:00
										 |  |  | 		compiler.hooks.compilation.tap( | 
					
						
							|  |  |  | 			"MergeDuplicateChunksPlugin", | 
					
						
							|  |  |  | 			compilation => { | 
					
						
							|  |  |  | 				compilation.hooks.optimizeChunksBasic.tap( | 
					
						
							|  |  |  | 					"MergeDuplicateChunksPlugin", | 
					
						
							|  |  |  | 					chunks => { | 
					
						
							|  |  |  | 						// remember already tested chunks for performance
 | 
					
						
							|  |  |  | 						const notDuplicates = new Set(); | 
					
						
							| 
									
										
										
										
											2017-11-24 15:55:22 +08:00
										 |  |  | 
 | 
					
						
							| 
									
										
										
										
											2018-02-25 09:00:20 +08:00
										 |  |  | 						// for each chunk
 | 
					
						
							|  |  |  | 						for (const chunk of chunks) { | 
					
						
							|  |  |  | 							// track a Set of all chunk that could be duplicates
 | 
					
						
							|  |  |  | 							let possibleDuplicates; | 
					
						
							|  |  |  | 							for (const module of chunk.modulesIterable) { | 
					
						
							|  |  |  | 								if (possibleDuplicates === undefined) { | 
					
						
							|  |  |  | 									// when possibleDuplicates is not yet set,
 | 
					
						
							|  |  |  | 									// create a new Set from chunks of the current module
 | 
					
						
							|  |  |  | 									// including only chunks with the same number of modules
 | 
					
						
							|  |  |  | 									for (const dup of module.chunksIterable) { | 
					
						
							|  |  |  | 										if ( | 
					
						
							|  |  |  | 											dup !== chunk && | 
					
						
							|  |  |  | 											chunk.getNumberOfModules() === dup.getNumberOfModules() && | 
					
						
							|  |  |  | 											!notDuplicates.has(dup) | 
					
						
							|  |  |  | 										) { | 
					
						
							|  |  |  | 											// delay allocating the new Set until here, reduce memory pressure
 | 
					
						
							| 
									
										
										
										
											2018-05-29 20:50:40 +08:00
										 |  |  | 											if (possibleDuplicates === undefined) { | 
					
						
							| 
									
										
										
										
											2018-02-25 09:00:20 +08:00
										 |  |  | 												possibleDuplicates = new Set(); | 
					
						
							| 
									
										
										
										
											2018-05-29 20:50:40 +08:00
										 |  |  | 											} | 
					
						
							| 
									
										
										
										
											2018-02-25 09:00:20 +08:00
										 |  |  | 											possibleDuplicates.add(dup); | 
					
						
							|  |  |  | 										} | 
					
						
							|  |  |  | 									} | 
					
						
							|  |  |  | 									// when no chunk is possible we can break here
 | 
					
						
							|  |  |  | 									if (possibleDuplicates === undefined) break; | 
					
						
							|  |  |  | 								} else { | 
					
						
							|  |  |  | 									// validate existing possible duplicates
 | 
					
						
							|  |  |  | 									for (const dup of possibleDuplicates) { | 
					
						
							|  |  |  | 										// remove possible duplicate when module is not contained
 | 
					
						
							| 
									
										
										
										
											2018-05-29 20:50:40 +08:00
										 |  |  | 										if (!dup.containsModule(module)) { | 
					
						
							| 
									
										
										
										
											2018-02-25 09:00:20 +08:00
										 |  |  | 											possibleDuplicates.delete(dup); | 
					
						
							| 
									
										
										
										
											2018-05-29 20:50:40 +08:00
										 |  |  | 										} | 
					
						
							| 
									
										
										
										
											2018-02-25 09:00:20 +08:00
										 |  |  | 									} | 
					
						
							|  |  |  | 									// when all chunks has been removed we can break here
 | 
					
						
							|  |  |  | 									if (possibleDuplicates.size === 0) break; | 
					
						
							| 
									
										
										
										
											2017-11-24 15:55:22 +08:00
										 |  |  | 								} | 
					
						
							|  |  |  | 							} | 
					
						
							| 
									
										
										
										
											2018-02-25 09:00:20 +08:00
										 |  |  | 
 | 
					
						
							|  |  |  | 							// when we found duplicates
 | 
					
						
							|  |  |  | 							if ( | 
					
						
							|  |  |  | 								possibleDuplicates !== undefined && | 
					
						
							|  |  |  | 								possibleDuplicates.size > 0 | 
					
						
							|  |  |  | 							) { | 
					
						
							|  |  |  | 								for (const otherChunk of possibleDuplicates) { | 
					
						
							|  |  |  | 									if (otherChunk.hasRuntime() !== chunk.hasRuntime()) continue; | 
					
						
							|  |  |  | 									// merge them
 | 
					
						
							| 
									
										
										
										
											2018-05-29 20:50:40 +08:00
										 |  |  | 									if (chunk.integrate(otherChunk, "duplicate")) { | 
					
						
							| 
									
										
										
										
											2018-02-25 09:00:20 +08:00
										 |  |  | 										chunks.splice(chunks.indexOf(otherChunk), 1); | 
					
						
							| 
									
										
										
										
											2018-05-29 20:50:40 +08:00
										 |  |  | 									} | 
					
						
							| 
									
										
										
										
											2018-02-25 09:00:20 +08:00
										 |  |  | 								} | 
					
						
							| 
									
										
										
										
											2017-11-24 15:55:22 +08:00
										 |  |  | 							} | 
					
						
							|  |  |  | 
 | 
					
						
							| 
									
										
										
										
											2018-02-25 09:00:20 +08:00
										 |  |  | 							// don't check already processed chunks twice
 | 
					
						
							|  |  |  | 							notDuplicates.add(chunk); | 
					
						
							| 
									
										
										
										
											2017-11-24 15:55:22 +08:00
										 |  |  | 						} | 
					
						
							|  |  |  | 					} | 
					
						
							| 
									
										
										
										
											2018-02-25 09:00:20 +08:00
										 |  |  | 				); | 
					
						
							|  |  |  | 			} | 
					
						
							|  |  |  | 		); | 
					
						
							| 
									
										
										
										
											2017-01-05 13:42:36 +08:00
										 |  |  | 	} | 
					
						
							|  |  |  | } | 
					
						
							|  |  |  | module.exports = MergeDuplicateChunksPlugin; |