rollup 3.6.1-0 → 3.7.0

package/dist/shared/rollup.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.6.1-0
-	Tue, 06 Dec 2022 05:39:23 GMT - commit 1bff93da4b04d4e723793dd37607ec7775ba28dd
+	Rollup.js v3.7.0
+	Thu, 08 Dec 2022 05:38:14 GMT - commit e83d53900e7ef2b71c12762a7fe7c91ef715a289
 
 	https://github.com/rollup/rollup
 
@@ -31,7 +31,7 @@ function _interopNamespaceDefault(e) {
 
 const tty__namespace = /*#__PURE__*/_interopNamespaceDefault(tty);
 
-var version$1 = "3.6.1-0";
+var version$1 = "3.7.0";
 
 function ensureArray$1(items) {
     if (Array.isArray(items)) {
@@ -2828,7 +2828,7 @@ function formatAssertions(assertions, { getObject }) {
 
 function getOrCreate(map, key, init) {
     const existing = map.get(key);
-    if (existing !== undefined) {
+    if (existing) {
         return existing;
     }
     const value = init();
@@ -5546,6 +5546,10 @@ const literalNumberMembers = assembleMemberDescriptions({
     toPrecision: returnsString,
     valueOf: returnsNumber
 }, objectMembers);
+const literalRegExpMembers = assembleMemberDescriptions({
+    exec: returnsUnknown,
+    test: returnsBoolean
+}, objectMembers);
 const literalStringMembers = assembleMemberDescriptions({
     anchor: returnsString,
     at: returnsUnknown,
@@ -5597,6 +5601,9 @@ const literalStringMembers = assembleMemberDescriptions({
     valueOf: returnsString
 }, objectMembers);
 function getLiteralMembersForValue(value) {
+    if (value instanceof RegExp) {
+        return literalRegExpMembers;
+    }
     switch (typeof value) {
         case 'boolean': {
             return literalBooleanMembers;
@@ -11770,12 +11777,7 @@ class PrivateIdentifier extends NodeBase {
 class Program extends NodeBase {
     constructor() {
         super(...arguments);
-        this.hasCachedEffect = null;
-    }
-    hasCachedEffects() {
-        return this.hasCachedEffect === null
-            ? (this.hasCachedEffect = this.hasEffects(createHasEffectsContext()))
-            : this.hasCachedEffect;
+        this.hasCachedEffect = false;
     }
     hasEffects(context) {
         // We are caching here to later more efficiently identify side-effect-free modules
@@ -13635,7 +13637,8 @@ class Module {
         return [null];
     }
     hasEffects() {
-        return this.info.moduleSideEffects === 'no-treeshake' || this.ast.hasCachedEffects();
+        return (this.info.moduleSideEffects === 'no-treeshake' ||
+            (this.ast.included && this.ast.hasEffects(createHasEffectsContext())));
     }
     include() {
         const context = createInclusionContext();
@@ -16234,138 +16237,18 @@ function getImportedBindingsPerDependency(renderedDependencies, resolveFileName)
 const QUERY_HASH_REGEX = /[#?]/;
 const resolveFileName = (dependency) => dependency.getFileName();
 
-const BYTE_UNITS = [
-	'B',
-	'kB',
-	'MB',
-	'GB',
-	'TB',
-	'PB',
-	'EB',
-	'ZB',
-	'YB',
-];
-
-const BIBYTE_UNITS = [
-	'B',
-	'kiB',
-	'MiB',
-	'GiB',
-	'TiB',
-	'PiB',
-	'EiB',
-	'ZiB',
-	'YiB',
-];
-
-const BIT_UNITS = [
-	'b',
-	'kbit',
-	'Mbit',
-	'Gbit',
-	'Tbit',
-	'Pbit',
-	'Ebit',
-	'Zbit',
-	'Ybit',
-];
-
-const BIBIT_UNITS = [
-	'b',
-	'kibit',
-	'Mibit',
-	'Gibit',
-	'Tibit',
-	'Pibit',
-	'Eibit',
-	'Zibit',
-	'Yibit',
-];
-
-/*
-Formats the given number using `Number#toLocaleString`.
-- If locale is a string, the value is expected to be a locale-key (for example: `de`).
-- If locale is true, the system default locale is used for translation.
-- If no value for locale is specified, the number is returned unmodified.
-*/
-const toLocaleString = (number, locale, options) => {
-	let result = number;
-	if (typeof locale === 'string' || Array.isArray(locale)) {
-		result = number.toLocaleString(locale, options);
-	} else if (locale === true || options !== undefined) {
-		result = number.toLocaleString(undefined, options);
-	}
-
-	return result;
-};
-
-function prettyBytes(number, options) {
-	if (!Number.isFinite(number)) {
-		throw new TypeError(`Expected a finite number, got ${typeof number}: ${number}`);
-	}
-
-	options = {
-		bits: false,
-		binary: false,
-		...options,
-	};
-
-	const UNITS = options.bits
-		? (options.binary ? BIBIT_UNITS : BIT_UNITS)
-		: (options.binary ? BIBYTE_UNITS : BYTE_UNITS);
-
-	if (options.signed && number === 0) {
-		return ` 0 ${UNITS[0]}`;
-	}
-
-	const isNegative = number < 0;
-	const prefix = isNegative ? '-' : (options.signed ? '+' : '');
-
-	if (isNegative) {
-		number = -number;
-	}
-
-	let localeOptions;
-
-	if (options.minimumFractionDigits !== undefined) {
-		localeOptions = {minimumFractionDigits: options.minimumFractionDigits};
-	}
-
-	if (options.maximumFractionDigits !== undefined) {
-		localeOptions = {maximumFractionDigits: options.maximumFractionDigits, ...localeOptions};
-	}
-
-	if (number < 1) {
-		const numberString = toLocaleString(number, options.locale, localeOptions);
-		return prefix + numberString + ' ' + UNITS[0];
-	}
-
-	const exponent = Math.min(Math.floor(options.binary ? Math.log(number) / Math.log(1024) : Math.log10(number) / 3), UNITS.length - 1);
-	number /= (options.binary ? 1024 : 1000) ** exponent;
-
-	if (!localeOptions) {
-		number = number.toPrecision(3);
-	}
-
-	const numberString = toLocaleString(Number(number), options.locale, localeOptions);
-
-	const unit = UNITS[exponent];
-
-	return prefix + numberString + ' ' + unit;
-}
-
 /**
  * Concatenate a number of iterables to a new iterable without fully evaluating
  * their iterators. Useful when e.g. working with large sets or lists and when
  * there is a chance that the iterators will not be fully exhausted.
  */
-function* concatLazy(iterables) {
+function* concatLazy(...iterables) {
     for (const iterable of iterables) {
         yield* iterable;
     }
 }
 
-function getChunkAssignments(entries, manualChunkAliasByEntry, minChunkSize) {
+function getChunkAssignments(entryModules, manualChunkAliasByEntry, minChunkSize) {
     const chunkDefinitions = [];
     const modulesInManualChunks = new Set(manualChunkAliasByEntry.keys());
     const manualChunkModulesByAlias = Object.create(null);
@@ -16375,19 +16258,53 @@ function getChunkAssignments(entries, manualChunkAliasByEntry, minChunkSize) {
     for (const [alias, modules] of Object.entries(manualChunkModulesByAlias)) {
         chunkDefinitions.push({ alias, modules });
     }
-    const alreadyLoadedModulesByDynamicEntry = getAlreadyLoadedModulesByDynamicEntry(entries);
     const assignedEntryPointsByModule = new Map();
-    for (const entry of entries) {
+    const { dependentEntryPointsByModule, dynamicEntryModules } = analyzeModuleGraph(entryModules);
+    const dynamicallyDependentEntryPointsByDynamicEntry = getDynamicDependentEntryPoints(dependentEntryPointsByModule, dynamicEntryModules);
+    const staticEntries = new Set(entryModules);
+    function assignEntryToStaticDependencies(entry, dynamicDependentEntryPoints) {
+        const modulesToHandle = new Set([entry]);
+        for (const module of modulesToHandle) {
+            const assignedEntryPoints = getOrCreate(assignedEntryPointsByModule, module, () => new Set());
+            if (dynamicDependentEntryPoints &&
+                areEntryPointsContainedOrDynamicallyDependent(dynamicDependentEntryPoints, dependentEntryPointsByModule.get(module))) {
+                continue;
+            }
+            else {
+                assignedEntryPoints.add(entry);
+            }
+            for (const dependency of module.getDependenciesToBeIncluded()) {
+                if (!(dependency instanceof ExternalModule || modulesInManualChunks.has(dependency))) {
+                    modulesToHandle.add(dependency);
+                }
+            }
+        }
+    }
+    function areEntryPointsContainedOrDynamicallyDependent(entryPoints, containedIn) {
+        const entriesToCheck = new Set(entryPoints);
+        for (const entry of entriesToCheck) {
+            if (!containedIn.has(entry)) {
+                if (staticEntries.has(entry))
+                    return false;
+                const dynamicallyDependentEntryPoints = dynamicallyDependentEntryPointsByDynamicEntry.get(entry);
+                for (const dependentEntry of dynamicallyDependentEntryPoints) {
+                    entriesToCheck.add(dependentEntry);
+                }
+            }
+        }
+        return true;
+    }
+    for (const entry of entryModules) {
         if (!modulesInManualChunks.has(entry)) {
-            assignEntryToStaticDependencies(entry, undefined, assignedEntryPointsByModule, modulesInManualChunks);
+            assignEntryToStaticDependencies(entry, null);
         }
     }
-    for (const entry of alreadyLoadedModulesByDynamicEntry.keys()) {
+    for (const entry of dynamicEntryModules) {
         if (!modulesInManualChunks.has(entry)) {
-            assignEntryToStaticDependencies(entry, alreadyLoadedModulesByDynamicEntry.get(entry), assignedEntryPointsByModule, modulesInManualChunks);
+            assignEntryToStaticDependencies(entry, dynamicallyDependentEntryPointsByDynamicEntry.get(entry));
         }
     }
-    chunkDefinitions.push(...createChunks([...entries, ...alreadyLoadedModulesByDynamicEntry.keys()], assignedEntryPointsByModule, minChunkSize));
+    chunkDefinitions.push(...createChunks([...entryModules, ...dynamicEntryModules], assignedEntryPointsByModule, minChunkSize));
     return chunkDefinitions;
 }
 function addStaticDependenciesToManualChunk(entry, manualChunkModules, modulesInManualChunks) {
@@ -16402,87 +16319,47 @@ function addStaticDependenciesToManualChunk(entry, manualChunkModules, modulesIn
         }
     }
 }
-function getAlreadyLoadedModulesByDynamicEntry(entryModules) {
-    const allModules = new Set(entryModules);
+function analyzeModuleGraph(entryModules) {
+    const dynamicEntryModules = new Set();
     const dependentEntryPointsByModule = new Map();
-    const dynamicImportsByEntry = new Map();
-    const dynamicallyDependentEntryPointsByDynamicEntry = new Map();
     const entriesToHandle = new Set(entryModules);
     for (const currentEntry of entriesToHandle) {
         const modulesToHandle = new Set([currentEntry]);
-        const dynamicImports = new Set();
-        dynamicImportsByEntry.set(currentEntry, dynamicImports);
         for (const module of modulesToHandle) {
             getOrCreate(dependentEntryPointsByModule, module, () => new Set()).add(currentEntry);
             for (const dependency of module.getDependenciesToBeIncluded()) {
                 if (!(dependency instanceof ExternalModule)) {
                     modulesToHandle.add(dependency);
-                    allModules.add(dependency);
                 }
             }
             for (const { resolution } of module.dynamicImports) {
                 if (resolution instanceof Module && resolution.includedDynamicImporters.length > 0) {
-                    dynamicImports.add(resolution);
-                    getOrCreate(dynamicallyDependentEntryPointsByDynamicEntry, resolution, () => new Set()).add(currentEntry);
+                    dynamicEntryModules.add(resolution);
                     entriesToHandle.add(resolution);
-                    allModules.add(resolution);
                 }
             }
             for (const dependency of module.implicitlyLoadedBefore) {
-                dynamicImports.add(dependency);
-                getOrCreate(dynamicallyDependentEntryPointsByDynamicEntry, dependency, () => new Set()).add(currentEntry);
+                dynamicEntryModules.add(dependency);
                 entriesToHandle.add(dependency);
-                allModules.add(dependency);
-            }
-        }
-    }
-    return buildAlreadyLoadedModulesByDynamicEntry(allModules, dependentEntryPointsByModule, dynamicImportsByEntry, dynamicallyDependentEntryPointsByDynamicEntry);
-}
-function buildAlreadyLoadedModulesByDynamicEntry(allModules, dependentEntryPointsByModule, dynamicImportsByEntry, dynamicallyDependentEntryPointsByDynamicEntry) {
-    const alreadyLoadedModulesByDynamicEntry = new Map();
-    for (const dynamicEntry of dynamicallyDependentEntryPointsByDynamicEntry.keys()) {
-        alreadyLoadedModulesByDynamicEntry.set(dynamicEntry, new Set());
-    }
-    for (const module of allModules) {
-        const dependentEntryPoints = dependentEntryPointsByModule.get(module);
-        for (const entry of dependentEntryPoints) {
-            const dynamicEntriesToHandle = [...dynamicImportsByEntry.get(entry)];
-            nextDynamicEntry: for (const dynamicEntry of dynamicEntriesToHandle) {
-                const alreadyLoadedModules = alreadyLoadedModulesByDynamicEntry.get(dynamicEntry);
-                if (alreadyLoadedModules.has(module)) {
-                    continue;
-                }
-                for (const siblingDependentEntry of dynamicallyDependentEntryPointsByDynamicEntry.get(dynamicEntry)) {
-                    if (!(dependentEntryPoints.has(siblingDependentEntry) ||
-                        alreadyLoadedModulesByDynamicEntry.get(siblingDependentEntry)?.has(module))) {
-                        continue nextDynamicEntry;
-                    }
-                }
-                alreadyLoadedModules.add(module);
-                dynamicEntriesToHandle.push(...dynamicImportsByEntry.get(dynamicEntry));
             }
         }
     }
-    return alreadyLoadedModulesByDynamicEntry;
+    return { dependentEntryPointsByModule, dynamicEntryModules };
 }
-function assignEntryToStaticDependencies(entry, alreadyLoadedModules, assignedEntryPointsByModule, modulesInManualChunks) {
-    const modulesToHandle = new Set([entry]);
-    for (const module of modulesToHandle) {
-        const assignedEntryPoints = getOrCreate(assignedEntryPointsByModule, module, () => new Set());
-        // If the module is "already loaded" for this dynamic entry, we do not need
-        // to mark it for this dynamic entry
-        if (alreadyLoadedModules?.has(module)) {
-            continue;
-        }
-        else {
-            assignedEntryPoints.add(entry);
-        }
-        for (const dependency of module.getDependenciesToBeIncluded()) {
-            if (!(dependency instanceof ExternalModule || modulesInManualChunks.has(dependency))) {
-                modulesToHandle.add(dependency);
+function getDynamicDependentEntryPoints(dependentEntryPointsByModule, dynamicEntryModules) {
+    const dynamicallyDependentEntryPointsByDynamicEntry = new Map();
+    for (const dynamicEntry of dynamicEntryModules) {
+        const dynamicDependentEntryPoints = getOrCreate(dynamicallyDependentEntryPointsByDynamicEntry, dynamicEntry, () => new Set());
+        for (const importer of [
+            ...dynamicEntry.includedDynamicImporters,
+            ...dynamicEntry.implicitlyLoadedAfter
+        ]) {
+            for (const entryPoint of dependentEntryPointsByModule.get(importer)) {
+                dynamicDependentEntryPoints.add(entryPoint);
             }
         }
     }
+    return dynamicallyDependentEntryPointsByDynamicEntry;
 }
 function createChunks(allEntryPoints, assignedEntryPointsByModule, minChunkSize) {
     const chunkModulesBySignature = getChunkModulesBySignature(assignedEntryPointsByModule, allEntryPoints);
@@ -16491,49 +16368,43 @@ function createChunks(allEntryPoints, assignedEntryPointsByModule, minChunkSize)
             alias: null,
             modules
         }))
-        : getOptimizedChunks(chunkModulesBySignature, minChunkSize).map(({ modules }) => ({
-            alias: null,
-            modules
-        }));
+        : getOptimizedChunks(chunkModulesBySignature, minChunkSize);
 }
-/**
- * This function tries to get rid of small chunks by merging them with other
- * chunks. In order to merge chunks, one must obey the following rule:
- * - When merging several chunks, at most one of the chunks can have side
- *   effects
- * - When one of the chunks has side effects, the entry points depending on that
- *   chunk need to be a super set of the entry points depending on the other
- *   chunks
- * - Pure chunks can always be merged
- * - We use the entry point dependence signature to calculate "chunk distance",
- *   i.e. how likely it is that two chunks are loaded together
- */
 function getOptimizedChunks(chunkModulesBySignature, minChunkSize) {
     timeStart('optimize chunks', 3);
-    const chunkPartition = getPartitionedChunks(chunkModulesBySignature, minChunkSize);
-    console.log(`Created ${chunkPartition.big.pure.size +
-        chunkPartition.big.sideEffect.size +
-        chunkPartition.small.pure.size +
-        chunkPartition.small.sideEffect.size} chunks
------ pure  side effects
-small ${`${chunkPartition.small.pure.size}`.padEnd(5, ' ')} ${chunkPartition.small.sideEffect.size}
-  big ${`${chunkPartition.big.pure.size}`.padEnd(5, ' ')} ${chunkPartition.big.sideEffect.size}
-`);
-    console.log(`Trying to find merge targets for ${chunkPartition.small.sideEffect.size} chunks smaller than ${prettyBytes(minChunkSize)} with side effects...`);
-    mergeChunks(chunkPartition.small.sideEffect, [chunkPartition.small.pure, chunkPartition.big.pure], minChunkSize, chunkPartition);
-    console.log(`${chunkPartition.small.sideEffect.size} chunks smaller than ${prettyBytes(minChunkSize)} with side effects remaining.\n`);
-    console.log(`Trying to find merge targets for ${chunkPartition.small.pure.size} pure chunks smaller than ${prettyBytes(minChunkSize)}...`);
-    mergeChunks(chunkPartition.small.pure, [chunkPartition.small.pure, chunkPartition.big.sideEffect, chunkPartition.big.pure], minChunkSize, chunkPartition);
-    console.log(`${chunkPartition.small.pure.size} pure chunks smaller than ${prettyBytes(minChunkSize)} remaining.\n`);
+    const { chunksToBeMerged, unmergeableChunks } = getMergeableChunks(chunkModulesBySignature, minChunkSize);
+    for (const sourceChunk of chunksToBeMerged) {
+        chunksToBeMerged.delete(sourceChunk);
+        let closestChunk = null;
+        let closestChunkDistance = Infinity;
+        const { signature, size, modules } = sourceChunk;
+        for (const targetChunk of concatLazy(chunksToBeMerged, unmergeableChunks)) {
+            const distance = getSignatureDistance(signature, targetChunk.signature, !chunksToBeMerged.has(targetChunk));
+            if (distance === 1) {
+                closestChunk = targetChunk;
+                break;
+            }
+            else if (distance < closestChunkDistance) {
+                closestChunk = targetChunk;
+                closestChunkDistance = distance;
+            }
+        }
+        if (closestChunk) {
+            closestChunk.modules.push(...modules);
+            if (chunksToBeMerged.has(closestChunk)) {
+                closestChunk.signature = mergeSignatures(signature, closestChunk.signature);
+                if ((closestChunk.size += size) > minChunkSize) {
+                    chunksToBeMerged.delete(closestChunk);
+                    unmergeableChunks.push(closestChunk);
+                }
+            }
+        }
+        else {
+            unmergeableChunks.push(sourceChunk);
+        }
+    }
     timeEnd('optimize chunks', 3);
-    const result = [
-        ...chunkPartition.small.sideEffect,
-        ...chunkPartition.small.pure,
-        ...chunkPartition.big.sideEffect,
-        ...chunkPartition.big.pure
-    ];
-    console.log(`${result.length} chunks remaining.`);
-    return result;
+    return unmergeableChunks;
 }
 const CHAR_DEPENDENT = 'X';
 const CHAR_INDEPENDENT = '_';
@@ -16555,141 +16426,28 @@ function getChunkModulesBySignature(assignedEntryPointsByModule, allEntryPoints)
     }
     return chunkModules;
 }
-function getPartitionedChunks(chunkModulesBySignature, minChunkSize) {
-    const smallPureChunks = [];
-    const bigPureChunks = [];
-    const smallSideEffectChunks = [];
-    const bigSideEffectChunks = [];
-    const chunkByModule = new Map();
+function getMergeableChunks(chunkModulesBySignature, minChunkSize) {
+    const chunksToBeMerged = new Set();
+    const unmergeableChunks = [];
+    const alias = null;
     for (const [signature, modules] of Object.entries(chunkModulesBySignature)) {
-        const chunkDescription = {
-            dependencies: new Set(),
-            modules,
-            pure: true,
-            signature,
-            size: 0,
-            transitiveDependencies: new Set(),
-            transitiveDependentChunks: new Set()
-        };
         let size = 0;
-        let pure = true;
-        for (const module of modules) {
-            chunkByModule.set(module, chunkDescription);
-            pure && (pure = !module.hasEffects());
-            size += module.magicString.toString().length;
-        }
-        chunkDescription.pure = pure;
-        chunkDescription.size = size;
-        (size < minChunkSize
-            ? pure
-                ? smallPureChunks
-                : smallSideEffectChunks
-            : pure
-                ? bigPureChunks
-                : bigSideEffectChunks).push(chunkDescription);
-    }
-    sortChunksAndAddDependencies([bigPureChunks, bigSideEffectChunks, smallPureChunks, smallSideEffectChunks], chunkByModule);
-    return {
-        big: { pure: new Set(bigPureChunks), sideEffect: new Set(bigSideEffectChunks) },
-        small: { pure: new Set(smallPureChunks), sideEffect: new Set(smallSideEffectChunks) }
-    };
-}
-function sortChunksAndAddDependencies(chunkLists, chunkByModule) {
-    for (const chunks of chunkLists) {
-        chunks.sort(compareChunks);
-        for (const chunk of chunks) {
-            const { dependencies, modules, transitiveDependencies } = chunk;
-            const transitiveDependencyModules = new Set();
+        checkModules: {
             for (const module of modules) {
-                for (const dependency of module.getDependenciesToBeIncluded()) {
-                    const dependencyChunk = chunkByModule.get(dependency);
-                    if (dependencyChunk && dependencyChunk !== chunk) {
-                        dependencies.add(dependencyChunk);
-                        transitiveDependencyModules.add(dependency);
-                    }
-                }
-            }
-            for (const module of transitiveDependencyModules) {
-                const transitiveDependency = chunkByModule.get(module);
-                if (transitiveDependency !== chunk) {
-                    transitiveDependencies.add(transitiveDependency);
-                    transitiveDependency.transitiveDependentChunks.add(chunk);
-                    for (const dependency of module.getDependenciesToBeIncluded()) {
-                        if (!(dependency instanceof ExternalModule)) {
-                            transitiveDependencyModules.add(dependency);
-                        }
-                    }
-                }
-            }
-        }
-    }
-}
-function compareChunks({ size: sizeA }, { size: sizeB }) {
-    return sizeA - sizeB;
-}
-function mergeChunks(chunksToBeMerged, targetChunks, minChunkSize, chunkPartition) {
-    for (const mergedChunk of chunksToBeMerged) {
-        let closestChunk = null;
-        let closestChunkDistance = Infinity;
-        const { signature, modules, pure, size } = mergedChunk;
-        for (const targetChunk of concatLazy(targetChunks)) {
-            if (mergedChunk === targetChunk)
-                continue;
-            const distance = pure
-                ? getSignatureDistance(signature, targetChunk.signature, !targetChunk.pure)
-                : getSignatureDistance(targetChunk.signature, signature, true);
-            if (distance < closestChunkDistance && isValidMerge(mergedChunk, targetChunk)) {
-                if (distance === 1) {
-                    closestChunk = targetChunk;
-                    break;
+                if (module.hasEffects()) {
+                    break checkModules;
                 }
-                closestChunk = targetChunk;
-                closestChunkDistance = distance;
-            }
-        }
-        if (closestChunk) {
-            chunksToBeMerged.delete(mergedChunk);
-            getChunksInPartition(closestChunk, minChunkSize, chunkPartition).delete(closestChunk);
-            closestChunk.modules.push(...modules);
-            closestChunk.size += size;
-            closestChunk.pure && (closestChunk.pure = pure);
-            closestChunk.signature = mergeSignatures(signature, closestChunk.signature);
-            const { dependencies, transitiveDependencies, transitiveDependentChunks } = closestChunk;
-            for (const dependency of mergedChunk.dependencies) {
-                dependencies.add(dependency);
-            }
-            for (const dependency of mergedChunk.transitiveDependencies) {
-                transitiveDependencies.add(dependency);
-                dependency.transitiveDependentChunks.delete(mergedChunk);
-                dependency.transitiveDependentChunks.add(closestChunk);
-            }
-            for (const dependentChunk of mergedChunk.transitiveDependentChunks) {
-                transitiveDependentChunks.add(dependentChunk);
-                if (dependentChunk.dependencies.has(mergedChunk)) {
-                    dependentChunk.dependencies.delete(mergedChunk);
-                    dependentChunk.dependencies.add(closestChunk);
+                size += module.magicString.toString().length;
+                if (size > minChunkSize) {
+                    break checkModules;
                 }
-                dependentChunk.transitiveDependencies.delete(mergedChunk);
-                dependentChunk.transitiveDependencies.add(closestChunk);
             }
-            dependencies.delete(closestChunk);
-            transitiveDependencies.delete(closestChunk);
-            transitiveDependentChunks.delete(closestChunk);
-            getChunksInPartition(closestChunk, minChunkSize, chunkPartition).add(closestChunk);
+            chunksToBeMerged.add({ alias, modules, signature, size });
+            continue;
         }
+        unmergeableChunks.push({ alias, modules, signature, size: null });
     }
-}
-// If a module is a transitive but not a direct dependency of the other chunk,
-// merging is prohibited as that would create a new cyclic dependency.
-function isValidMerge(mergedChunk, targetChunk) {
-    return ((!targetChunk.transitiveDependencies.has(mergedChunk) ||
-        targetChunk.dependencies.has(mergedChunk)) &&
-        (!mergedChunk.transitiveDependencies.has(targetChunk) ||
-            mergedChunk.dependencies.has(targetChunk)));
-}
-function getChunksInPartition(chunk, minChunkSize, chunkPartition) {
-    const subPartition = chunk.size < minChunkSize ? chunkPartition.small : chunkPartition.big;
-    return chunk.pure ? subPartition.pure : subPartition.sideEffect;
+    return { chunksToBeMerged, unmergeableChunks };
 }
 function getSignatureDistance(sourceSignature, targetSignature, enforceSubset) {
     let distance = 0;
@@ -25523,7 +25281,6 @@ exports.loadFsEvents = loadFsEvents;
 exports.mergeOptions = mergeOptions;
 exports.normalizePluginOption = normalizePluginOption;
 exports.picomatch = picomatch$1;
-exports.prettyBytes = prettyBytes;
 exports.printQuotedStringList = printQuotedStringList;
 exports.relativeId = relativeId;
 exports.rollup = rollup;

package/dist/shared/watch-cli.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.6.1-0
-	Tue, 06 Dec 2022 05:39:23 GMT - commit 1bff93da4b04d4e723793dd37607ec7775ba28dd
+	Rollup.js v3.7.0
+	Thu, 08 Dec 2022 05:38:14 GMT - commit e83d53900e7ef2b71c12762a7fe7c91ef715a289
 
 	https://github.com/rollup/rollup
 

package/dist/shared/watch.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.6.1-0
-	Tue, 06 Dec 2022 05:39:23 GMT - commit 1bff93da4b04d4e723793dd37607ec7775ba28dd
+	Rollup.js v3.7.0
+	Thu, 08 Dec 2022 05:38:14 GMT - commit e83d53900e7ef2b71c12762a7fe7c91ef715a289
 
 	https://github.com/rollup/rollup
 

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "rollup",
-  "version": "3.6.1-0",
+  "version": "3.7.0",
   "description": "Next-generation ES module bundler",
   "main": "dist/rollup.js",
   "module": "dist/es/rollup.js",