FM / lib

/usr/local/lib/node_modules/npm/node_modules/@npmcli/arborist/lib/

/usr/local/lib/node_modules/npm/node_modules/@npmcli/arborist/lib

Name	Size	Mode	Actions
arborist/	-	0755	rm
add-rm-pkg-deps.js	5008	0644	edit dl rm
audit-report.js	9619	0644	edit dl rm
calc-dep-flags.js	3359	0644	edit dl rm
can-place-dep.js	14273	0644	edit dl rm
case-insensitive-map.js	1239	0644	edit dl rm
consistent-resolve.js	1247	0644	edit dl rm
debug.js	1282	0644	edit dl rm
deepest-nesting-target.js	691	0644	edit dl rm
dep-valid.js	5128	0644	edit dl rm
diff.js	10327	0644	edit dl rm
edge.js	9988	0644	edit dl rm
from-path.js	1095	0644	edit dl rm
gather-dep-set.js	1286	0644	edit dl rm
index.js	273	0644	edit dl rm
inventory.js	3321	0644	edit dl rm
isolated-classes.js	2717	0644	edit dl rm
link.js	3114	0644	edit dl rm
node.js	49828	0644	edit dl rm
optional-set.js	1201	0644	edit dl rm
override-resolves.js	225	0644	edit dl rm
override-set.js	8773	0644	edit dl rm
packument-cache.js	2557	0644	edit dl rm
peer-entry-sets.js	2632	0644	edit dl rm
place-dep.js	20250	0644	edit dl rm
printable.js	5222	0644	edit dl rm
query-selector-all.js	30361	0644	edit dl rm
realpath.js	2655	0644	edit dl rm
relpath.js	136	0644	edit dl rm
reset-dep-flags.js	542	0644	edit dl rm
retire-path.js	501	0644	edit dl rm
shrinkwrap.js	37721	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	2991	0644	edit dl rm
tree-check.js	4142	0644	edit dl rm
version-from-tgz.js	1488	0644	edit dl rm
vuln.js	5958	0644	edit dl rm
yarn-lock.js	10813	0644	edit dl rm

Edit: /usr/local/lib/node_modules/npm/node_modules/@npmcli/arborist/lib/gather-dep-set.js (1286B)

const gatherDepSet = (set, edgeFilter) => {
  const deps = new Set(set)

// add the full set of dependencies.  note that this loop will continue
  // as the deps set increases in size.
  for (const node of deps) {
    for (const edge of node.edgesOut.values()) {
      if (edge.to && edgeFilter(edge)) {
        deps.add(edge.to)
      }
    }
  }

// now remove all nodes in the set that have a dependent outside the set
  // if any change is made, then re-check
  // continue until no changes made, or deps set evaporates fully.
  let changed = true
  while (changed === true && deps.size > 0) {
    changed = false
    for (const dep of deps) {
      for (const edge of dep.edgesIn) {
        if (!deps.has(edge.from) && edgeFilter(edge)) {
          changed = true
          deps.delete(dep)
          break
        }
      }
    }
  }

return deps
}

module.exports = gatherDepSet

// Given a set of nodes in a tree, and a filter function to test // incoming edges to the dep set that should be ignored otherwise. // // find the set of deps that are only depended upon by nodes in the set, or // their dependencies, or edges that are ignored. // // Used when figuring out what to prune when replacing a node with a newer // version, or when an optional dep fails to install. const gatherDepSet = (set, edgeFilter) => { const deps = new Set(set) // add the full set of dependencies. note that this loop will continue // as the deps set increases in size. for (const node of deps) { for (const edge of node.edgesOut.values()) { if (edge.to && edgeFilter(edge)) { deps.add(edge.to) } } } // now remove all nodes in the set that have a dependent outside the set // if any change is made, then re-check // continue until no changes made, or deps set evaporates fully. let changed = true while (changed === true && deps.size > 0) { changed = false for (const dep of deps) { for (const edge of dep.edgesIn) { if (!deps.has(edge.from) && edgeFilter(edge)) { changed = true deps.delete(dep) break } } } } return deps } module.exports = gatherDepSet