@atlaspack/bundler-default 2.14.5-canary.35 → 2.14.5-canary.351

package/src/bundleMerge.js

@@ -1,103 +0,0 @@
-// @flow strict-local
-
-import invariant from 'assert';
-import nullthrows from 'nullthrows';
-import type {NodeId} from '@atlaspack/graph';
-import type {Bundle, IdealBundleGraph} from './idealGraph';
-import {ContentGraph} from '@atlaspack/graph';
-
-// Returns a decimal showing the proportion source bundles are common to
-// both bundles versus the total number of source bundles.
-function scoreBundleMerge(bundleA: Bundle, bundleB: Bundle): number {
-  let sharedSourceBundles = 0;
-  let allSourceBundles = new Set([
-    ...bundleA.sourceBundles,
-    ...bundleB.sourceBundles,
-  ]);
-
-  for (let bundle of bundleB.sourceBundles) {
-    if (bundleA.sourceBundles.has(bundle)) {
-      sharedSourceBundles++;
-    }
-  }
-
-  return sharedSourceBundles / allSourceBundles.size;
-}
-
-function getMergeClusters(
-  graph: ContentGraph<NodeId>,
-  candidates: Set<NodeId>,
-): Array<Array<NodeId>> {
-  let clusters = [];
-
-  for (let candidate of candidates) {
-    let cluster: Array<NodeId> = [];
-
-    graph.traverse((nodeId) => {
-      cluster.push(nullthrows(graph.getNode(nodeId)));
-      // Remove node from candidates as it has already been processed
-      candidates.delete(nodeId);
-    }, candidate);
-
-    clusters.push(cluster);
-  }
-
-  return clusters;
-}
-
-export function findMergeCandidates(
-  bundleGraph: IdealBundleGraph,
-  bundles: Array<NodeId>,
-  threshold: number,
-): Array<Array<NodeId>> {
-  let graph = new ContentGraph<NodeId>();
-  let seen = new Set<string>();
-  let candidates = new Set<NodeId>();
-
-  // Build graph of clustered merge candidates
-  for (let bundleId of bundles) {
-    let bundle = bundleGraph.getNode(bundleId);
-    invariant(bundle && bundle !== 'root');
-    if (bundle.type !== 'js') {
-      continue;
-    }
-
-    for (let otherBundleId of bundles) {
-      if (bundleId === otherBundleId) {
-        continue;
-      }
-
-      let key = [bundleId, otherBundleId].sort().join(':');
-
-      if (seen.has(key)) {
-        continue;
-      }
-      seen.add(key);
-
-      let otherBundle = bundleGraph.getNode(otherBundleId);
-      invariant(otherBundle && otherBundle !== 'root');
-
-      let score = scoreBundleMerge(bundle, otherBundle);
-
-      if (score >= threshold) {
-        let bundleNode = graph.addNodeByContentKeyIfNeeded(
-          bundleId.toString(),
-          bundleId,
-        );
-        let otherBundleNode = graph.addNodeByContentKeyIfNeeded(
-          otherBundleId.toString(),
-          otherBundleId,
-        );
-
-        // Add edge in both directions
-        graph.addEdge(bundleNode, otherBundleNode);
-        graph.addEdge(otherBundleNode, bundleNode);
-
-        candidates.add(bundleNode);
-        candidates.add(otherBundleNode);
-      }
-    }
-  }
-
-  return getMergeClusters(graph, candidates);
-}