rollup 3.7.3-0 → 3.7.3

package/dist/shared/rollup.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.7.3-0
-	Sat, 10 Dec 2022 06:31:15 GMT - commit c2de6b987930db3403af7936d03a7302b93f929e
+	Rollup.js v3.7.3
+	Sun, 11 Dec 2022 15:24:30 GMT - commit a0d4d69092484a0879377e16425b737ec541ae55
 
 	https://github.com/rollup/rollup
 
@@ -31,7 +31,7 @@ function _interopNamespaceDefault(e) {
 
 const tty__namespace = /*#__PURE__*/_interopNamespaceDefault(tty);
 
-var version$1 = "3.7.3-0";
+var version$1 = "3.7.3";
 
 function ensureArray$1(items) {
     if (Array.isArray(items)) {
@@ -11784,12 +11784,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
@@ -13649,7 +13644,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();
@@ -15294,7 +15290,6 @@ class Chunk {
         this.entryModules = [];
         this.exportMode = 'named';
         this.facadeModule = null;
-        this.id = null;
         this.namespaceVariableName = '';
         this.variableName = '';
         this.accessedGlobalsByScope = new Map();
@@ -15385,6 +15380,25 @@ class Chunk {
         }
         return true;
     }
+    finalizeChunk(code, map, hashesByPlaceholder) {
+        const renderedChunkInfo = this.getRenderedChunkInfo();
+        const finalize = (code) => replacePlaceholders(code, hashesByPlaceholder);
+        const fileName = (this.fileName = finalize(renderedChunkInfo.fileName));
+        return {
+            ...renderedChunkInfo,
+            code,
+            dynamicImports: renderedChunkInfo.dynamicImports.map(finalize),
+            fileName,
+            implicitlyLoadedBefore: renderedChunkInfo.implicitlyLoadedBefore.map(finalize),
+            importedBindings: Object.fromEntries(Object.entries(renderedChunkInfo.importedBindings).map(([fileName, bindings]) => [
+                finalize(fileName),
+                bindings
+            ])),
+            imports: renderedChunkInfo.imports.map(finalize),
+            map,
+            referencedFiles: renderedChunkInfo.referencedFiles.map(finalize)
+        };
+    }
     generateExports() {
         this.sortedExportNames = null;
         const remainingExports = new Set(this.exports);
@@ -15477,24 +15491,6 @@ class Chunk {
         }
         return facades;
     }
-    generateOutputChunk(code, map, hashesByPlaceholder) {
-        const renderedChunkInfo = this.getRenderedChunkInfo();
-        const finalize = (code) => replacePlaceholders(code, hashesByPlaceholder);
-        return {
-            ...renderedChunkInfo,
-            code,
-            dynamicImports: renderedChunkInfo.dynamicImports.map(finalize),
-            fileName: finalize(renderedChunkInfo.fileName),
-            implicitlyLoadedBefore: renderedChunkInfo.implicitlyLoadedBefore.map(finalize),
-            importedBindings: Object.fromEntries(Object.entries(renderedChunkInfo.importedBindings).map(([fileName, bindings]) => [
-                finalize(fileName),
-                bindings
-            ])),
-            imports: renderedChunkInfo.imports.map(finalize),
-            map,
-            referencedFiles: renderedChunkInfo.referencedFiles.map(finalize)
-        };
-    }
     getChunkName() {
         return (this.name ?? (this.name = this.outputOptions.sanitizeFileName(this.getFallbackChunkName())));
     }
@@ -15502,7 +15498,7 @@ class Chunk {
         return (this.sortedExportNames ?? (this.sortedExportNames = [...this.exportsByName.keys()].sort()));
     }
     getFileName() {
-        return this.preliminaryFileName?.fileName || this.getPreliminaryFileName().fileName;
+        return this.fileName || this.getPreliminaryFileName().fileName;
     }
     getImportPath(importer) {
         return escapeId(getImportPath(importer, this.getFileName(), this.outputOptions.format === 'amd' && !this.outputOptions.amd.forceJsExtensionForImports, true));
@@ -16248,132 +16244,12 @@ 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;
     }
@@ -16514,11 +16390,47 @@ function createChunks(allEntries, assignedEntriesByModule, minChunkSize) {
             alias: null,
             modules
         }))
-        : getOptimizedChunks(chunkModulesBySignature, minChunkSize).map(({ modules }) => ({
-            alias: null,
-            modules
-        }));
+        : getOptimizedChunks(chunkModulesBySignature, minChunkSize);
 }
+function getOptimizedChunks(chunkModulesBySignature, minChunkSize) {
+    timeStart('optimize chunks', 3);
+    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);
+    return unmergeableChunks;
+}
+const CHAR_DEPENDENT = 'X';
+const CHAR_INDEPENDENT = '_';
+const CHAR_CODE_DEPENDENT = CHAR_DEPENDENT.charCodeAt(0);
 function getChunkModulesBySignature(assignedEntriesByModule, allEntries) {
     const chunkModules = Object.create(null);
     for (const [module, assignedEntries] of assignedEntriesByModule) {
@@ -16536,225 +16448,28 @@ function getChunkModulesBySignature(assignedEntriesByModule, allEntries) {
     }
     return chunkModules;
 }
-/**
- * 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}
-Unoptimized chunks contain ${getNumberOfCycles(chunkPartition)} cycles.
-`);
-    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.\nGenerated chunks contain ${getNumberOfCycles(chunkPartition)} cycles.\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.\nGenerated chunks contain ${getNumberOfCycles(chunkPartition)} cycles.\n`);
-    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;
-}
-const CHAR_DEPENDENT = 'X';
-const CHAR_INDEPENDENT = '_';
-const CHAR_CODE_DEPENDENT = CHAR_DEPENDENT.charCodeAt(0);
-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 getNumberOfCycles(partition) {
-    const parents = new Set();
-    const analysedChunks = new Set();
-    let cycles = 0;
-    const analyseChunk = (chunk) => {
-        for (const dependency of chunk.dependencies) {
-            if (parents.has(dependency)) {
-                if (!analysedChunks.has(dependency)) {
-                    cycles++;
-                }
-                continue;
-            }
-            parents.add(dependency);
-            analyseChunk(dependency);
-        }
-        analysedChunks.add(chunk);
-    };
-    for (const chunk of [
-        ...partition.big.pure,
-        ...partition.big.sideEffect,
-        ...partition.small.pure,
-        ...partition.small.sideEffect
-    ]) {
-        if (!parents.has(chunk)) {
-            parents.add(chunk);
-            analyseChunk(chunk);
-        }
-    }
-    return cycles;
-}
-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);
-        }
-    }
-}
-// 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) {
-    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;
+            chunksToBeMerged.add({ alias, modules, signature, size });
+            continue;
         }
+        unmergeableChunks.push({ alias, modules, signature, size: null });
     }
-    return false;
-}
-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;
@@ -17258,14 +16973,14 @@ function addChunksToBundle(renderedChunksByPlaceholder, hashesByPlaceholder, bun
             map.file = replacePlaceholders(map.file, hashesByPlaceholder);
             updatedCode += emitSourceMapAndGetComment(finalFileName, map, pluginDriver, options);
         }
-        bundle[finalFileName] = chunk.generateOutputChunk(updatedCode, map, hashesByPlaceholder);
+        bundle[finalFileName] = chunk.finalizeChunk(updatedCode, map, hashesByPlaceholder);
     }
     for (const { chunk, code, fileName, map } of nonHashedChunksWithPlaceholders) {
         let updatedCode = hashesByPlaceholder.size > 0 ? replacePlaceholders(code, hashesByPlaceholder) : code;
         if (map) {
             updatedCode += emitSourceMapAndGetComment(fileName, map, pluginDriver, options);
         }
-        bundle[fileName] = chunk.generateOutputChunk(updatedCode, map, hashesByPlaceholder);
+        bundle[fileName] = chunk.finalizeChunk(updatedCode, map, hashesByPlaceholder);
     }
 }
 function emitSourceMapAndGetComment(fileName, map, pluginDriver, { sourcemap, sourcemapBaseUrl }) {
@@ -23808,8 +23523,7 @@ function getChunkFileName(file, facadeChunkByModule) {
         return file.fileName;
     }
     if (facadeChunkByModule) {
-        const chunk = facadeChunkByModule.get(file.module);
-        return chunk.id || chunk.getFileName();
+        return facadeChunkByModule.get(file.module).getFileName();
     }
     return error(errorChunkNotGeneratedForFileName(file.fileName || file.name));
 }
@@ -25589,7 +25303,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.7.3-0
-	Sat, 10 Dec 2022 06:31:15 GMT - commit c2de6b987930db3403af7936d03a7302b93f929e
+	Rollup.js v3.7.3
+	Sun, 11 Dec 2022 15:24:30 GMT - commit a0d4d69092484a0879377e16425b737ec541ae55
 
 	https://github.com/rollup/rollup
 

package/dist/shared/watch.js

@@ -1,7 +1,7 @@
 /*
   @license
-	Rollup.js v3.7.3-0
-	Sat, 10 Dec 2022 06:31:15 GMT - commit c2de6b987930db3403af7936d03a7302b93f929e
+	Rollup.js v3.7.3
+	Sun, 11 Dec 2022 15:24:30 GMT - commit a0d4d69092484a0879377e16425b737ec541ae55
 
 	https://github.com/rollup/rollup
 

package/package.json

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