rollup 3.7.5-0 → 3.7.6-0

package/dist/bin/rollup

@@ -2,8 +2,8 @@
 
 /*
   @license
-	Rollup.js v3.7.5-0
-	Fri, 16 Dec 2022 10:54:15 GMT - commit 1ee5d10583f88926dc36b97e7b3870ee078327e2
+	Rollup.js v3.7.6-0
+	Sun, 18 Dec 2022 05:56:49 GMT - commit d226f7976dc543ff814af389e183d627d4e94ed4
 
 	https://github.com/rollup/rollup
 

package/dist/es/rollup.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.7.5-0
-	Fri, 16 Dec 2022 10:54:15 GMT - commit 1ee5d10583f88926dc36b97e7b3870ee078327e2
+	Rollup.js v3.7.6-0
+	Sun, 18 Dec 2022 05:56:49 GMT - commit d226f7976dc543ff814af389e183d627d4e94ed4
 
 	https://github.com/rollup/rollup
 

package/dist/es/shared/rollup.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.7.5-0
-	Fri, 16 Dec 2022 10:54:15 GMT - commit 1ee5d10583f88926dc36b97e7b3870ee078327e2
+	Rollup.js v3.7.6-0
+	Sun, 18 Dec 2022 05:56:49 GMT - commit d226f7976dc543ff814af389e183d627d4e94ed4
 
 	https://github.com/rollup/rollup
 
@@ -16,7 +16,7 @@ import { promises } from 'node:fs';
 import { EventEmitter } from 'node:events';
 import * as tty from 'tty';
 
-var version$1 = "3.7.5-0";
+var version$1 = "3.7.6-0";
 
 var charToInteger = {};
 var chars$1 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/=';
@@ -11775,6 +11775,15 @@ class ExportDefaultVariable extends LocalVariable {
             this.name = identifier.name;
         }
     }
+    forbidName(name) {
+        const original = this.getOriginalVariable();
+        if (original === this) {
+            super.forbidName(name);
+        }
+        else {
+            original.forbidName(name);
+        }
+    }
     getAssignedVariableName() {
         return (this.originalId && this.originalId.name) || null;
     }
@@ -12426,6 +12435,25 @@ class NamespaceVariable extends Variable {
         this.references.push(identifier);
         this.name = identifier.name;
     }
+    deoptimizePath(path) {
+        if (path.length > 1) {
+            const key = path[0];
+            if (typeof key === 'string') {
+                this.getMemberVariables()[key]?.deoptimizePath(path.slice(1));
+            }
+        }
+    }
+    deoptimizeThisOnInteractionAtPath(interaction, path, recursionTracker) {
+        if (path.length > 1 || (path.length === 1 && interaction.type === INTERACTION_CALLED)) {
+            const key = path[0];
+            if (typeof key === 'string') {
+                this.getMemberVariables()[key]?.deoptimizeThisOnInteractionAtPath(interaction, path.slice(1), recursionTracker);
+            }
+            else {
+                interaction.thisArg.deoptimizePath(UNKNOWN_PATH);
+            }
+        }
+    }
     getLiteralValueAtPath(path) {
         if (path[0] === SymbolToStringTag) {
             return 'Module';
@@ -12447,8 +12475,22 @@ class NamespaceVariable extends Variable {
         }
         return (this.memberVariables = memberVariables);
     }
-    hasEffectsOnInteractionAtPath() {
-        return false;
+    hasEffectsOnInteractionAtPath(path, interaction, context) {
+        const { type } = interaction;
+        if (path.length === 0) {
+            // This can only be a call anyway
+            return true;
+        }
+        if (path.length === 1 && type !== INTERACTION_CALLED) {
+            return type === INTERACTION_ASSIGNED;
+        }
+        const key = path[0];
+        if (typeof key !== 'string') {
+            return true;
+        }
+        const memberVariable = this.getMemberVariables()[key];
+        return (!memberVariable ||
+            memberVariable.hasEffectsOnInteractionAtPath(path.slice(1), interaction, context));
     }
     include() {
         this.included = true;
@@ -16055,15 +16097,14 @@ small ${`${chunkPartition.small.pure.size}`.padEnd(5, ' ')} ${chunkPartition.sma
   big ${`${chunkPartition.big.pure.size}`.padEnd(5, ' ')} ${chunkPartition.big.sideEffect.size}
 Unoptimized chunks contain ${getNumberOfCycles(chunkPartition)} cycles.
 `);
-    const chunkAliases = new Map();
     if (chunkPartition.small.sideEffect.size > 0) {
         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, chunkAliases);
+        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.\nGenerated chunks contain ${getNumberOfCycles(chunkPartition)} cycles.\n`);
     }
     if (chunkPartition.small.pure.size > 0) {
         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, chunkAliases);
+        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.\nGenerated chunks contain ${getNumberOfCycles(chunkPartition)} cycles.\n`);
     }
     timeEnd('optimize chunks', 3);
@@ -16088,19 +16129,20 @@ function getPartitionedChunks(chunkModulesBySignature, minChunkSize) {
     for (const [signature, modules] of Object.entries(chunkModulesBySignature)) {
         const chunkDescription = {
             dependencies: new Set(),
+            dependentChunks: new Set(),
             modules,
             pure: true,
             signature,
-            size: 0,
-            transitiveDependencies: new Set(),
-            transitiveDependentChunks: new Set()
+            size: 0
         };
         let size = 0;
         let pure = true;
         for (const module of modules) {
             chunkByModule.set(module, chunkDescription);
             pure && (pure = !module.hasEffects());
-            size += module.magicString.toString().length;
+            // Unfortunately, we cannot take tree-shaking into account here because
+            // rendering did not happen yet
+            size += module.originalCode.length;
         }
         chunkDescription.pure = pure;
         chunkDescription.size = size;
@@ -16152,25 +16194,13 @@ 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();
+            const { dependencies, modules } = chunk;
             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);
-                    for (const dependency of module.getDependenciesToBeIncluded()) {
-                        if (!(dependency instanceof ExternalModule)) {
-                            transitiveDependencyModules.add(dependency);
-                        }
+                        dependencyChunk.dependentChunks.add(chunk);
                     }
                 }
             }
@@ -16180,9 +16210,8 @@ function sortChunksAndAddDependencies(chunkLists, chunkByModule) {
 function compareChunks({ size: sizeA }, { size: sizeB }) {
     return sizeA - sizeB;
 }
-function mergeChunks(chunksToBeMerged, targetChunks, minChunkSize, chunkPartition, chunkAliases) {
+function mergeChunks(chunksToBeMerged, targetChunks, minChunkSize, chunkPartition) {
     for (const mergedChunk of chunksToBeMerged) {
-        replaceAliasedDependencies(mergedChunk, chunkAliases);
         let closestChunk = null;
         let closestChunkDistance = Infinity;
         const { signature, modules, pure, size } = mergedChunk;
@@ -16192,7 +16221,7 @@ function mergeChunks(chunksToBeMerged, targetChunks, minChunkSize, chunkPartitio
             const distance = pure
                 ? getSignatureDistance(signature, targetChunk.signature, !targetChunk.pure)
                 : getSignatureDistance(targetChunk.signature, signature, true);
-            if (distance < closestChunkDistance && isValidMerge(mergedChunk, targetChunk, chunkAliases)) {
+            if (distance < closestChunkDistance && isValidMerge(mergedChunk, targetChunk)) {
                 if (distance === 1) {
                     closestChunk = targetChunk;
                     break;
@@ -16202,58 +16231,40 @@ function mergeChunks(chunksToBeMerged, targetChunks, minChunkSize, chunkPartitio
             }
         }
         if (closestChunk) {
-            chunkAliases.set(mergedChunk, 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 } = closestChunk;
+            const { dependencies, dependentChunks } = closestChunk;
             for (const dependency of mergedChunk.dependencies) {
                 dependencies.add(dependency);
             }
-            for (const dependency of mergedChunk.transitiveDependencies) {
-                transitiveDependencies.add(dependency);
+            for (const dependentChunk of mergedChunk.dependentChunks) {
+                dependentChunks.add(dependentChunk);
+                dependentChunk.dependencies.delete(mergedChunk);
+                dependentChunk.dependencies.add(closestChunk);
             }
             dependencies.delete(closestChunk);
-            dependencies.delete(mergedChunk);
-            transitiveDependencies.delete(closestChunk);
-            transitiveDependencies.delete(mergedChunk);
             getChunksInPartition(closestChunk, minChunkSize, chunkPartition).add(closestChunk);
         }
     }
 }
-function replaceAliasedDependencies(chunk, chunkAliases) {
-    for (const [alias, aliased] of chunkAliases) {
-        if (chunk.dependencies.has(alias)) {
-            chunk.dependencies.delete(alias);
-            chunk.dependencies.add(aliased);
-        }
-        if (chunk.transitiveDependencies.has(alias)) {
-            chunk.transitiveDependencies.delete(alias);
-            chunk.transitiveDependencies.add(aliased);
-        }
-    }
-}
-// Merging will not produce cycles if
-// - no chunk is a transitive dependency of the other, or
-// - none of the direct non-merged dependencies of a chunk have the other
-//   chunk as a transitive dependency
-function isValidMerge(mergedChunk, targetChunk, chunkAliases) {
-    if (hasTransitiveDependency(mergedChunk, targetChunk)) {
-        return false;
-    }
-    replaceAliasedDependencies(targetChunk, chunkAliases);
-    return !hasTransitiveDependency(targetChunk, mergedChunk);
+// Merging will not produce cycles if none of the direct non-merged dependencies
+// of a chunk have the other chunk as a transitive dependency
+function isValidMerge(mergedChunk, targetChunk) {
+    return !(hasTransitiveDependency(mergedChunk, targetChunk) ||
+        hasTransitiveDependency(targetChunk, mergedChunk));
 }
 function hasTransitiveDependency(dependentChunk, dependencyChunk) {
-    if (!dependentChunk.transitiveDependencies.has(dependencyChunk)) {
-        return false;
-    }
-    for (const dependency of dependentChunk.dependencies) {
-        if (dependency.transitiveDependencies.has(dependencyChunk)) {
-            return true;
+    const chunksToCheck = new Set(dependentChunk.dependencies);
+    for (const { dependencies } of chunksToCheck) {
+        for (const dependency of dependencies) {
+            if (dependency === dependencyChunk) {
+                return true;
+            }
+            chunksToCheck.add(dependency);
         }
     }
     return false;
@@ -25212,23 +25223,24 @@ function handleError(error, recover = false) {
     const nameSection = name ? `${name}: ` : '';
     const pluginSection = error.plugin ? `(plugin ${error.plugin}) ` : '';
     const message = `${pluginSection}${nameSection}${error.message}`;
-    stderr(bold(red(`[!] ${bold(message.toString())}`)));
+    const outputLines = [bold(red(`[!] ${bold(message.toString())}`))];
     if (error.url) {
-        stderr(cyan(error.url));
+        outputLines.push(cyan(error.url));
     }
     if (error.loc) {
-        stderr(`${relativeId((error.loc.file || error.id))} (${error.loc.line}:${error.loc.column})`);
+        outputLines.push(`${relativeId((error.loc.file || error.id))} (${error.loc.line}:${error.loc.column})`);
     }
     else if (error.id) {
-        stderr(relativeId(error.id));
+        outputLines.push(relativeId(error.id));
     }
     if (error.frame) {
-        stderr(dim(error.frame));
+        outputLines.push(dim(error.frame));
     }
     if (error.stack) {
-        stderr(dim(error.stack));
+        outputLines.push(dim(error.stack?.replace(`${nameSection}${error.message}\n`, '')));
     }
-    stderr('');
+    outputLines.push('', '');
+    stderr(outputLines.join('\n'));
     // eslint-disable-next-line unicorn/no-process-exit
     if (!recover)
         process$1.exit(1);

package/dist/es/shared/watch.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.7.5-0
-	Fri, 16 Dec 2022 10:54:15 GMT - commit 1ee5d10583f88926dc36b97e7b3870ee078327e2
+	Rollup.js v3.7.6-0
+	Sun, 18 Dec 2022 05:56:49 GMT - commit d226f7976dc543ff814af389e183d627d4e94ed4
 
 	https://github.com/rollup/rollup
 

package/dist/loadConfigFile.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.7.5-0
-	Fri, 16 Dec 2022 10:54:15 GMT - commit 1ee5d10583f88926dc36b97e7b3870ee078327e2
+	Rollup.js v3.7.6-0
+	Sun, 18 Dec 2022 05:56:49 GMT - commit d226f7976dc543ff814af389e183d627d4e94ed4
 
 	https://github.com/rollup/rollup
 

package/dist/rollup.d.ts

@@ -19,7 +19,7 @@ export type RollupWarning = RollupLog;
 
 export interface RollupLog {
 	binding?: string;
-	cause?: Error;
+	cause?: unknown;
 	code?: string;
 	exporter?: string;
 	frame?: string;

package/dist/rollup.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.7.5-0
-	Fri, 16 Dec 2022 10:54:15 GMT - commit 1ee5d10583f88926dc36b97e7b3870ee078327e2
+	Rollup.js v3.7.6-0
+	Sun, 18 Dec 2022 05:56:49 GMT - commit d226f7976dc543ff814af389e183d627d4e94ed4
 
 	https://github.com/rollup/rollup
 

package/dist/shared/index.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.7.5-0
-	Fri, 16 Dec 2022 10:54:15 GMT - commit 1ee5d10583f88926dc36b97e7b3870ee078327e2
+	Rollup.js v3.7.6-0
+	Sun, 18 Dec 2022 05:56:49 GMT - commit d226f7976dc543ff814af389e183d627d4e94ed4
 
 	https://github.com/rollup/rollup
 

package/dist/shared/loadConfigFile.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.7.5-0
-	Fri, 16 Dec 2022 10:54:15 GMT - commit 1ee5d10583f88926dc36b97e7b3870ee078327e2
+	Rollup.js v3.7.6-0
+	Sun, 18 Dec 2022 05:56:49 GMT - commit d226f7976dc543ff814af389e183d627d4e94ed4
 
 	https://github.com/rollup/rollup
 

package/dist/shared/rollup.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.7.5-0
-	Fri, 16 Dec 2022 10:54:15 GMT - commit 1ee5d10583f88926dc36b97e7b3870ee078327e2
+	Rollup.js v3.7.6-0
+	Sun, 18 Dec 2022 05:56:49 GMT - commit d226f7976dc543ff814af389e183d627d4e94ed4
 
 	https://github.com/rollup/rollup
 
@@ -31,7 +31,7 @@ function _interopNamespaceDefault(e) {
 
 const tty__namespace = /*#__PURE__*/_interopNamespaceDefault(tty);
 
-var version$1 = "3.7.5-0";
+var version$1 = "3.7.6-0";
 
 function ensureArray$1(items) {
     if (Array.isArray(items)) {
@@ -1208,23 +1208,24 @@ function handleError(error, recover = false) {
     const nameSection = name ? `${name}: ` : '';
     const pluginSection = error.plugin ? `(plugin ${error.plugin}) ` : '';
     const message = `${pluginSection}${nameSection}${error.message}`;
-    stderr(bold(red(`[!] ${bold(message.toString())}`)));
+    const outputLines = [bold(red(`[!] ${bold(message.toString())}`))];
     if (error.url) {
-        stderr(cyan(error.url));
+        outputLines.push(cyan(error.url));
     }
     if (error.loc) {
-        stderr(`${relativeId((error.loc.file || error.id))} (${error.loc.line}:${error.loc.column})`);
+        outputLines.push(`${relativeId((error.loc.file || error.id))} (${error.loc.line}:${error.loc.column})`);
     }
     else if (error.id) {
-        stderr(relativeId(error.id));
+        outputLines.push(relativeId(error.id));
     }
     if (error.frame) {
-        stderr(dim(error.frame));
+        outputLines.push(dim(error.frame));
     }
     if (error.stack) {
-        stderr(dim(error.stack));
+        outputLines.push(dim(error.stack?.replace(`${nameSection}${error.message}\n`, '')));
     }
-    stderr('');
+    outputLines.push('', '');
+    stderr(outputLines.join('\n'));
     // eslint-disable-next-line unicorn/no-process-exit
     if (!recover)
         process$1.exit(1);
@@ -12290,6 +12291,15 @@ class ExportDefaultVariable extends LocalVariable {
             this.name = identifier.name;
         }
     }
+    forbidName(name) {
+        const original = this.getOriginalVariable();
+        if (original === this) {
+            super.forbidName(name);
+        }
+        else {
+            original.forbidName(name);
+        }
+    }
     getAssignedVariableName() {
         return (this.originalId && this.originalId.name) || null;
     }
@@ -12941,6 +12951,25 @@ class NamespaceVariable extends Variable {
         this.references.push(identifier);
         this.name = identifier.name;
     }
+    deoptimizePath(path) {
+        if (path.length > 1) {
+            const key = path[0];
+            if (typeof key === 'string') {
+                this.getMemberVariables()[key]?.deoptimizePath(path.slice(1));
+            }
+        }
+    }
+    deoptimizeThisOnInteractionAtPath(interaction, path, recursionTracker) {
+        if (path.length > 1 || (path.length === 1 && interaction.type === INTERACTION_CALLED)) {
+            const key = path[0];
+            if (typeof key === 'string') {
+                this.getMemberVariables()[key]?.deoptimizeThisOnInteractionAtPath(interaction, path.slice(1), recursionTracker);
+            }
+            else {
+                interaction.thisArg.deoptimizePath(UNKNOWN_PATH);
+            }
+        }
+    }
     getLiteralValueAtPath(path) {
         if (path[0] === SymbolToStringTag) {
             return 'Module';
@@ -12962,8 +12991,22 @@ class NamespaceVariable extends Variable {
         }
         return (this.memberVariables = memberVariables);
     }
-    hasEffectsOnInteractionAtPath() {
-        return false;
+    hasEffectsOnInteractionAtPath(path, interaction, context) {
+        const { type } = interaction;
+        if (path.length === 0) {
+            // This can only be a call anyway
+            return true;
+        }
+        if (path.length === 1 && type !== INTERACTION_CALLED) {
+            return type === INTERACTION_ASSIGNED;
+        }
+        const key = path[0];
+        if (typeof key !== 'string') {
+            return true;
+        }
+        const memberVariable = this.getMemberVariables()[key];
+        return (!memberVariable ||
+            memberVariable.hasEffectsOnInteractionAtPath(path.slice(1), interaction, context));
     }
     include() {
         this.included = true;
@@ -16570,15 +16613,14 @@ small ${`${chunkPartition.small.pure.size}`.padEnd(5, ' ')} ${chunkPartition.sma
   big ${`${chunkPartition.big.pure.size}`.padEnd(5, ' ')} ${chunkPartition.big.sideEffect.size}
 Unoptimized chunks contain ${getNumberOfCycles(chunkPartition)} cycles.
 `);
-    const chunkAliases = new Map();
     if (chunkPartition.small.sideEffect.size > 0) {
         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, chunkAliases);
+        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.\nGenerated chunks contain ${getNumberOfCycles(chunkPartition)} cycles.\n`);
     }
     if (chunkPartition.small.pure.size > 0) {
         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, chunkAliases);
+        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.\nGenerated chunks contain ${getNumberOfCycles(chunkPartition)} cycles.\n`);
     }
     timeEnd('optimize chunks', 3);
@@ -16603,19 +16645,20 @@ function getPartitionedChunks(chunkModulesBySignature, minChunkSize) {
     for (const [signature, modules] of Object.entries(chunkModulesBySignature)) {
         const chunkDescription = {
             dependencies: new Set(),
+            dependentChunks: new Set(),
             modules,
             pure: true,
             signature,
-            size: 0,
-            transitiveDependencies: new Set(),
-            transitiveDependentChunks: new Set()
+            size: 0
         };
         let size = 0;
         let pure = true;
         for (const module of modules) {
             chunkByModule.set(module, chunkDescription);
             pure && (pure = !module.hasEffects());
-            size += module.magicString.toString().length;
+            // Unfortunately, we cannot take tree-shaking into account here because
+            // rendering did not happen yet
+            size += module.originalCode.length;
         }
         chunkDescription.pure = pure;
         chunkDescription.size = size;
@@ -16667,25 +16710,13 @@ 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();
+            const { dependencies, modules } = chunk;
             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);
-                    for (const dependency of module.getDependenciesToBeIncluded()) {
-                        if (!(dependency instanceof ExternalModule)) {
-                            transitiveDependencyModules.add(dependency);
-                        }
+                        dependencyChunk.dependentChunks.add(chunk);
                     }
                 }
             }
@@ -16695,9 +16726,8 @@ function sortChunksAndAddDependencies(chunkLists, chunkByModule) {
 function compareChunks({ size: sizeA }, { size: sizeB }) {
     return sizeA - sizeB;
 }
-function mergeChunks(chunksToBeMerged, targetChunks, minChunkSize, chunkPartition, chunkAliases) {
+function mergeChunks(chunksToBeMerged, targetChunks, minChunkSize, chunkPartition) {
     for (const mergedChunk of chunksToBeMerged) {
-        replaceAliasedDependencies(mergedChunk, chunkAliases);
         let closestChunk = null;
         let closestChunkDistance = Infinity;
         const { signature, modules, pure, size } = mergedChunk;
@@ -16707,7 +16737,7 @@ function mergeChunks(chunksToBeMerged, targetChunks, minChunkSize, chunkPartitio
             const distance = pure
                 ? getSignatureDistance(signature, targetChunk.signature, !targetChunk.pure)
                 : getSignatureDistance(targetChunk.signature, signature, true);
-            if (distance < closestChunkDistance && isValidMerge(mergedChunk, targetChunk, chunkAliases)) {
+            if (distance < closestChunkDistance && isValidMerge(mergedChunk, targetChunk)) {
                 if (distance === 1) {
                     closestChunk = targetChunk;
                     break;
@@ -16717,58 +16747,40 @@ function mergeChunks(chunksToBeMerged, targetChunks, minChunkSize, chunkPartitio
             }
         }
         if (closestChunk) {
-            chunkAliases.set(mergedChunk, 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 } = closestChunk;
+            const { dependencies, dependentChunks } = closestChunk;
             for (const dependency of mergedChunk.dependencies) {
                 dependencies.add(dependency);
             }
-            for (const dependency of mergedChunk.transitiveDependencies) {
-                transitiveDependencies.add(dependency);
+            for (const dependentChunk of mergedChunk.dependentChunks) {
+                dependentChunks.add(dependentChunk);
+                dependentChunk.dependencies.delete(mergedChunk);
+                dependentChunk.dependencies.add(closestChunk);
             }
             dependencies.delete(closestChunk);
-            dependencies.delete(mergedChunk);
-            transitiveDependencies.delete(closestChunk);
-            transitiveDependencies.delete(mergedChunk);
             getChunksInPartition(closestChunk, minChunkSize, chunkPartition).add(closestChunk);
         }
     }
 }
-function replaceAliasedDependencies(chunk, chunkAliases) {
-    for (const [alias, aliased] of chunkAliases) {
-        if (chunk.dependencies.has(alias)) {
-            chunk.dependencies.delete(alias);
-            chunk.dependencies.add(aliased);
-        }
-        if (chunk.transitiveDependencies.has(alias)) {
-            chunk.transitiveDependencies.delete(alias);
-            chunk.transitiveDependencies.add(aliased);
-        }
-    }
-}
-// Merging will not produce cycles if
-// - no chunk is a transitive dependency of the other, or
-// - none of the direct non-merged dependencies of a chunk have the other
-//   chunk as a transitive dependency
-function isValidMerge(mergedChunk, targetChunk, chunkAliases) {
-    if (hasTransitiveDependency(mergedChunk, targetChunk)) {
-        return false;
-    }
-    replaceAliasedDependencies(targetChunk, chunkAliases);
-    return !hasTransitiveDependency(targetChunk, mergedChunk);
+// Merging will not produce cycles if none of the direct non-merged dependencies
+// of a chunk have the other chunk as a transitive dependency
+function isValidMerge(mergedChunk, targetChunk) {
+    return !(hasTransitiveDependency(mergedChunk, targetChunk) ||
+        hasTransitiveDependency(targetChunk, mergedChunk));
 }
 function hasTransitiveDependency(dependentChunk, dependencyChunk) {
-    if (!dependentChunk.transitiveDependencies.has(dependencyChunk)) {
-        return false;
-    }
-    for (const dependency of dependentChunk.dependencies) {
-        if (dependency.transitiveDependencies.has(dependencyChunk)) {
-            return true;
+    const chunksToCheck = new Set(dependentChunk.dependencies);
+    for (const { dependencies } of chunksToCheck) {
+        for (const dependency of dependencies) {
+            if (dependency === dependencyChunk) {
+                return true;
+            }
+            chunksToCheck.add(dependency);
         }
     }
     return false;

package/dist/shared/watch-cli.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.7.5-0
-	Fri, 16 Dec 2022 10:54:15 GMT - commit 1ee5d10583f88926dc36b97e7b3870ee078327e2
+	Rollup.js v3.7.6-0
+	Sun, 18 Dec 2022 05:56:49 GMT - commit d226f7976dc543ff814af389e183d627d4e94ed4
 
 	https://github.com/rollup/rollup
 

package/dist/shared/watch.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.7.5-0
-	Fri, 16 Dec 2022 10:54:15 GMT - commit 1ee5d10583f88926dc36b97e7b3870ee078327e2
+	Rollup.js v3.7.6-0
+	Sun, 18 Dec 2022 05:56:49 GMT - commit d226f7976dc543ff814af389e183d627d4e94ed4
 
 	https://github.com/rollup/rollup
 

package/package.json

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