保誠-保戶業務員媒合平台
Tomas
2022-05-19 957a1f10a06fdbb76f1a0ba94fe44126c613fee3
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
/*
    MIT License http://www.opensource.org/licenses/mit-license.php
    Author Tobias Koppers @sokra
*/
"use strict";
 
const validateOptions = require("schema-utils");
const schema = require("../../schemas/plugins/optimize/OccurrenceOrderChunkIdsPlugin.json");
 
/** @typedef {import("../../declarations/plugins/optimize/OccurrenceOrderChunkIdsPlugin").OccurrenceOrderChunkIdsPluginOptions} OccurrenceOrderChunkIdsPluginOptions */
 
class OccurrenceOrderChunkIdsPlugin {
    /**
     * @param {OccurrenceOrderChunkIdsPluginOptions=} options options object
     */
    constructor(options = {}) {
        validateOptions(schema, options, "Occurrence Order Chunk Ids Plugin");
        this.options = options;
    }
 
    apply(compiler) {
        const prioritiseInitial = this.options.prioritiseInitial;
        compiler.hooks.compilation.tap(
            "OccurrenceOrderChunkIdsPlugin",
            compilation => {
                compilation.hooks.optimizeChunkOrder.tap(
                    "OccurrenceOrderChunkIdsPlugin",
                    chunks => {
                        const occursInInitialChunksMap = new Map();
                        const originalOrder = new Map();
 
                        let i = 0;
                        for (const c of chunks) {
                            let occurs = 0;
                            for (const chunkGroup of c.groupsIterable) {
                                for (const parent of chunkGroup.parentsIterable) {
                                    if (parent.isInitial()) occurs++;
                                }
                            }
                            occursInInitialChunksMap.set(c, occurs);
                            originalOrder.set(c, i++);
                        }
 
                        chunks.sort((a, b) => {
                            if (prioritiseInitial) {
                                const aEntryOccurs = occursInInitialChunksMap.get(a);
                                const bEntryOccurs = occursInInitialChunksMap.get(b);
                                if (aEntryOccurs > bEntryOccurs) return -1;
                                if (aEntryOccurs < bEntryOccurs) return 1;
                            }
                            const aOccurs = a.getNumberOfGroups();
                            const bOccurs = b.getNumberOfGroups();
                            if (aOccurs > bOccurs) return -1;
                            if (aOccurs < bOccurs) return 1;
                            const orgA = originalOrder.get(a);
                            const orgB = originalOrder.get(b);
                            return orgA - orgB;
                        });
                    }
                );
            }
        );
    }
}
 
module.exports = OccurrenceOrderChunkIdsPlugin;