FM / lib

/home2/dakshskx/nodejs/lib/node_modules/npm/node_modules/@npmcli/arborist/lib/

/home2/dakshskx/nodejs/lib/node_modules/npm/node_modules/@npmcli/arborist/lib

Name	Size	Mode	Actions
arborist/	-	0755	rm
add-rm-pkg-deps.js	5010	0644	edit dl rm
audit-report.js	12282	0644	edit dl rm
calc-dep-flags.js	3148	0644	edit dl rm
can-place-dep.js	14273	0644	edit dl rm
case-insensitive-map.js	1356	0644	edit dl rm
consistent-resolve.js	1432	0644	edit dl rm
debug.js	1228	0644	edit dl rm
deepest-nesting-target.js	691	0644	edit dl rm
dep-valid.js	4990	0644	edit dl rm
diff.js	9798	0644	edit dl rm
edge.js	6983	0644	edit dl rm
from-path.js	1069	0644	edit dl rm
gather-dep-set.js	1286	0644	edit dl rm
get-workspace-nodes.js	863	0644	edit dl rm
index.js	353	0644	edit dl rm
inventory.js	3272	0644	edit dl rm
link.js	3691	0644	edit dl rm
node.js	44093	0644	edit dl rm
optional-set.js	1353	0644	edit dl rm
override-resolves.js	230	0644	edit dl rm
override-set.js	2603	0644	edit dl rm
peer-entry-sets.js	2632	0644	edit dl rm
place-dep.js	20207	0644	edit dl rm
printable.js	5217	0644	edit dl rm
query-selector-all.js	16827	0644	edit dl rm
realpath.js	2737	0644	edit dl rm
relpath.js	131	0644	edit dl rm
reset-dep-flags.js	638	0644	edit dl rm
retire-path.js	491	0644	edit dl rm
shrinkwrap.js	37913	0644	edit dl rm
signal-handling.js	2245	0644	edit dl rm
signals.js	1381	0644	edit dl rm
spec-from-lock.js	874	0644	edit dl rm
tracker.js	3373	0644	edit dl rm
tree-check.js	4121	0644	edit dl rm
version-from-tgz.js	1489	0644	edit dl rm
vuln.js	5858	0644	edit dl rm
yarn-lock.js	10289	0644	edit dl rm

Edit: /home2/dakshskx/nodejs/lib/node_modules/npm/node_modules/@npmcli/arborist/lib/peer-entry-sets.js (2632B)

// 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

cmd: