Gecko [ c.stage.kornherr.net ]

Name	Size	Permission	Date
arborist	[ DIR ]	drwxr-xr-x	2024-07-10 10:56
add-rm-pkg-deps.js	4.89 KB	-rw-r--r--	2023-11-23 07:39
audit-report.js	11.99 KB	-rw-r--r--	2023-11-23 07:39
calc-dep-flags.js	3.07 KB	-rw-r--r--	2023-11-23 07:39
can-place-dep.js	13.94 KB	-rw-r--r--	2023-11-23 07:39
case-insensitive-map.js	1.32 KB	-rw-r--r--	2023-11-23 07:39
consistent-resolve.js	1.29 KB	-rw-r--r--	2023-11-23 07:39
debug.js	1.2 KB	-rw-r--r--	2023-11-23 07:39
deepest-nesting-target.js	691 B	-rw-r--r--	2023-11-23 07:39
dep-valid.js	4.94 KB	-rw-r--r--	2023-11-23 07:39
diff.js	9.57 KB	-rw-r--r--	2023-11-23 07:39
edge.js	6.83 KB	-rw-r--r--	2023-11-23 07:39
from-path.js	1.04 KB	-rw-r--r--	2023-11-23 07:39
gather-dep-set.js	1.26 KB	-rw-r--r--	2023-11-23 07:39
get-workspace-nodes.js	863 B	-rw-r--r--	2023-11-23 07:39
index.js	353 B	-rw-r--r--	2023-11-23 07:39
inventory.js	3.2 KB	-rw-r--r--	2023-11-23 07:39
link.js	3 KB	-rw-r--r--	2023-11-23 07:39
node.js	43.21 KB	-rw-r--r--	2023-11-23 07:39
optional-set.js	1.32 KB	-rw-r--r--	2023-11-23 07:39
override-resolves.js	230 B	-rw-r--r--	2023-11-23 07:39
override-set.js	2.42 KB	-rw-r--r--	2023-11-23 07:39
peer-entry-sets.js	2.57 KB	-rw-r--r--	2023-11-23 07:39
place-dep.js	19.7 KB	-rw-r--r--	2023-11-23 07:39
printable.js	5.09 KB	-rw-r--r--	2023-11-23 07:39
query-selector-all.js	26.17 KB	-rw-r--r--	2023-11-23 07:39
realpath.js	2.58 KB	-rw-r--r--	2023-11-23 07:39
relpath.js	131 B	-rw-r--r--	2023-11-23 07:39
reset-dep-flags.js	638 B	-rw-r--r--	2023-11-23 07:39
retire-path.js	491 B	-rw-r--r--	2023-11-23 07:39
shrinkwrap.js	36.6 KB	-rw-r--r--	2023-11-23 07:39
signal-handling.js	2.19 KB	-rw-r--r--	2023-11-23 07:39
signals.js	1.35 KB	-rw-r--r--	2023-11-23 07:39
spec-from-lock.js	874 B	-rw-r--r--	2023-11-23 07:39
tracker.js	3.29 KB	-rw-r--r--	2023-11-23 07:39
tree-check.js	4.02 KB	-rw-r--r--	2023-11-23 07:39
version-from-tgz.js	1.45 KB	-rw-r--r--	2023-11-23 07:39
vuln.js	5.93 KB	-rw-r--r--	2023-11-23 07:39
yarn-lock.js	10.58 KB	-rw-r--r--	2023-11-23 07:39

Rename

// Given a node in a tree, return all of the peer dependency sets that
// it is a part of, with the entry (top or non-peer) edges into the sets
// identified.
//
// With this information, we can determine whether it is appropriate to
// replace the entire peer set with another (and remove the old one),
// push the set deeper into the tree, and so on.
//
// Returns a Map of { edge => Set(peerNodes) },

const peerEntrySets = node => {
  // this is the union of all peer groups that the node is a part of
  // later, we identify all of the entry edges, and create a set of
  // 1 or more overlapping sets that this node is a part of.
  const unionSet = new Set([node])
  for (const node of unionSet) {
    for (const edge of node.edgesOut.values()) {
      if (edge.valid && edge.peer && edge.to) {
        unionSet.add(edge.to)
      }
    }
    for (const edge of node.edgesIn) {
      if (edge.valid && edge.peer) {
        unionSet.add(edge.from)
      }
    }
  }
  const entrySets = new Map()
  for (const peer of unionSet) {
    for (const edge of peer.edgesIn) {
      // if not valid, it doesn't matter anyway.  either it's been previously
      // peerConflicted, or it's the thing we're interested in replacing.
      if (!edge.valid) {
        continue
      }
      // this is the entry point into the peer set
      if (!edge.peer || edge.from.isTop) {
        // get the subset of peer brought in by this peer entry edge
        const sub = new Set([peer])
        for (const peer of sub) {
          for (const edge of peer.edgesOut.values()) {
            if (edge.valid && edge.peer && edge.to) {
              sub.add(edge.to)
            }
          }
        }
        // if this subset does not include the node we are focused on,
        // then it is not relevant for our purposes.  Example:
        //
        // a -> (b, c, d)
        // b -> PEER(d) b -> d -> e -> f <-> g
        // c -> PEER(f, h) c -> (f <-> g, h -> g)
        // d -> PEER(e) d -> e -> f <-> g
        // e -> PEER(f)
        // f -> PEER(g)
        // g -> PEER(f)
        // h -> PEER(g)
        //
        // The unionSet(e) will include c, but we don't actually care about
        // it.  We only expanded to the edge of the peer nodes in order to
        // find the entry edges that caused the inclusion of peer sets
        // including (e), so we want:
        //   Map{
        //     Edge(a->b) => Set(b, d, e, f, g)
        //     Edge(a->d) => Set(d, e, f, g)
        //   }
        if (sub.has(node)) {
          entrySets.set(edge, sub)
        }
      }
    }
  }

return entrySets
}

module.exports = peerEntrySets