createBackwardCompatibleModuleSet() — vite Function Reference

Architecture documentation for the createBackwardCompatibleModuleSet() function in mixedModuleGraph.ts from the vite codebase.

Function typescript ViteCore ConfigEngine calls 4 called by 1

Entity Profile

ViteCore→ ConfigEngine→ createBackwardCompatibleModuleSet() — vite Function Reference

Dependency Diagram

graph TD
  f6405e51_2f5f_8b61_2baa_899012d93f2a["createBackwardCompatibleModuleSet()"]
  cd2f5017_5d73_e10a_7c43_22b962517f0c["mixedModuleGraph.ts"]
  f6405e51_2f5f_8b61_2baa_899012d93f2a -->|defined in| cd2f5017_5d73_e10a_7c43_22b962517f0c
  09c59943_148f_165b_467c_116c858a50ca["_wrapModuleSet()"]
  09c59943_148f_165b_467c_116c858a50ca -->|calls| f6405e51_2f5f_8b61_2baa_899012d93f2a
  1c40d8da_e1ab_2df6_f9b3_a9ddbed0bb4b["_getModuleGraph()"]
  f6405e51_2f5f_8b61_2baa_899012d93f2a -->|calls| 1c40d8da_e1ab_2df6_f9b3_a9ddbed0bb4b
  b9c8cc4b_5575_ccfe_9243_d12c9ec34e91["getModuleById()"]
  f6405e51_2f5f_8b61_2baa_899012d93f2a -->|calls| b9c8cc4b_5575_ccfe_9243_d12c9ec34e91
  b0a4d406_602a_9986_f073_0dd8b083afb9["mapIterator()"]
  f6405e51_2f5f_8b61_2baa_899012d93f2a -->|calls| b0a4d406_602a_9986_f073_0dd8b083afb9
  d8391f75_fffc_b831_70c9_fb964a1caf82["getBackwardCompatibleModuleNode()"]
  f6405e51_2f5f_8b61_2baa_899012d93f2a -->|calls| d8391f75_fffc_b831_70c9_fb964a1caf82
  style f6405e51_2f5f_8b61_2baa_899012d93f2a fill:#6366f1,stroke:#818cf8,color:#fff

Relationship Graph

Source Code

packages/vite/src/node/server/mixedModuleGraph.ts lines 544–589

function createBackwardCompatibleModuleSet(
  moduleGraph: ModuleGraph,
  prop: ModuleSetNames,
  module: EnvironmentModuleNode,
): Set<ModuleNode> {
  return {
    [Symbol.iterator]() {
      return this.keys()
    },
    has(key) {
      if (!key.id) {
        return false
      }
      const keyModule = moduleGraph
        ._getModuleGraph(module.environment)
        .getModuleById(key.id)
      return keyModule !== undefined && module[prop].has(keyModule)
    },
    values() {
      return this.keys()
    },
    keys() {
      return mapIterator(module[prop].keys(), (mod) =>
        moduleGraph.getBackwardCompatibleModuleNode(mod),
      )
    },
    get size() {
      return module[prop].size
    },
    forEach(callback, thisArg) {
      return module[prop].forEach((mod) => {
        const backwardCompatibleMod =
          moduleGraph.getBackwardCompatibleModuleNode(mod)
        callback.call(
          thisArg,
          backwardCompatibleMod,
          backwardCompatibleMod,
          this,
        )
      })
    },
    // There are several methods missing. We can implement them if downstream
    // projects are relying on them: add, clear, delete, difference, intersection,
    // sDisjointFrom, isSubsetOf, isSupersetOf, symmetricDifference, union
  } as Set<ModuleNode>
}