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/calc-dep-flags.js (3148B)

const { depth } = require('treeverse')

const calcDepFlags = (tree, resetRoot = true) => {
  if (resetRoot) {
    tree.dev = false
    tree.optional = false
    tree.devOptional = false
    tree.peer = false
  }
  const ret = depth({
    tree,
    visit: node => calcDepFlagsStep(node),
    filter: node => node,
    getChildren: (node, tree) =>
      [...tree.edgesOut.values()].map(edge => edge.to),
  })
  return ret
}

const calcDepFlagsStep = (node) => {
  // This rewalk is necessary to handle cases where devDep and optional
  // or normal dependency graphs overlap deep in the dep graph.
  // Since we're only walking through deps that are not already flagged
  // as non-dev/non-optional, it's typically a very shallow traversal
  node.extraneous = false
  resetParents(node, 'extraneous')
  resetParents(node, 'dev')
  resetParents(node, 'peer')
  resetParents(node, 'devOptional')
  resetParents(node, 'optional')

// for links, map their hierarchy appropriately
  if (node.isLink) {
    node.target.dev = node.dev
    node.target.optional = node.optional
    node.target.devOptional = node.devOptional
    node.target.peer = node.peer
    return calcDepFlagsStep(node.target)
  }

node.edgesOut.forEach(({ peer, optional, dev, to }) => {
    // if the dep is missing, then its flags are already maximally unset
    if (!to) {
      return
    }

// everything with any kind of edge into it is not extraneous
    to.extraneous = false

// devOptional is the *overlap* of the dev and optional tree.
    // however, for convenience and to save an extra rewalk, we leave
    // it set when we are in *either* tree, and then omit it from the
    // package-lock if either dev or optional are set.
    const unsetDevOpt = !node.devOptional && !node.dev && !node.optional &&
      !dev && !optional

// if we are not in the devOpt tree, then we're also not in
    // either the dev or opt trees
    const unsetDev = unsetDevOpt || !node.dev && !dev
    const unsetOpt = unsetDevOpt ||
      !node.optional && !optional
    const unsetPeer = !node.peer && !peer

if (unsetPeer) {
      unsetFlag(to, 'peer')
    }

if (unsetDevOpt) {
      unsetFlag(to, 'devOptional')
    }

if (unsetDev) {
      unsetFlag(to, 'dev')
    }

if (unsetOpt) {
      unsetFlag(to, 'optional')
    }
  })

return node
}

const resetParents = (node, flag) => {
  if (node[flag]) {
    return
  }

for (let p = node; p && (p === node || p[flag]); p = p.resolveParent) {
    p[flag] = false
  }
}

// typically a short walk, since it only traverses deps that
// have the flag set.
const unsetFlag = (node, flag) => {
  if (node[flag]) {
    node[flag] = false
    depth({
      tree: node,
      visit: node => {
        node.extraneous = node[flag] = false
        if (node.isLink) {
          node.target.extraneous = node.target[flag] = false
        }
      },
      getChildren: node => [...node.target.edgesOut.values()]
        .filter(edge => edge.to && edge.to[flag] &&
          (flag !== 'peer' && edge.type === 'peer' || edge.type === 'prod'))
        .map(edge => edge.to),
    })
  }
}

module.exports = calcDepFlags

cmd: