PHP 8.2.30
Preview: explain-dep.js Size: 3.03 KB
/proc/thread-self/root/proc/self/root/opt/alt/alt-nodejs20/root/usr/lib/node_modules/npm/lib/utils/explain-dep.js

const { relative } = require('node:path')

const explainNode = (node, depth, chalk) =>
  printNode(node, chalk) +
  explainDependents(node, depth, chalk) +
  explainLinksIn(node, depth, chalk)

const colorType = (type, chalk) => {
  const style = type === 'extraneous' ? chalk.red
    : type === 'dev' ? chalk.blue
    : type === 'optional' ? chalk.magenta
    : type === 'peer' ? chalk.magentaBright
    : type === 'bundled' ? chalk.underline.cyan
    : type === 'workspace' ? chalk.blueBright
    : type === 'overridden' ? chalk.dim
    : /* istanbul ignore next */ s => s
  return style(type)
}

const printNode = (node, chalk) => {
  const extra = []

  for (const meta of ['extraneous', 'dev', 'optional', 'peer', 'bundled', 'overridden']) {
    if (node[meta]) {
      extra.push(` ${colorType(meta, chalk)}`)
    }
  }

  const pkgid = node.isWorkspace
    ? chalk.blueBright(`${node.name}@${node.version}`)
    : `${node.name}@${node.version}`

  return `${pkgid}${extra.join('')}` +
    (node.location ? chalk.dim(`\n${node.location}`) : '')
}

const explainLinksIn = ({ linksIn }, depth, chalk) => {
  if (!linksIn || !linksIn.length || depth <= 0) {
    return ''
  }

  const messages = linksIn.map(link => explainNode(link, depth - 1, chalk))
  const str = '\n' + messages.join('\n')
  return str.split('\n').join('\n  ')
}

const explainDependents = ({ dependents }, depth, chalk) => {
  if (!dependents || !dependents.length || depth <= 0) {
    return ''
  }

  const max = Math.ceil(depth / 2)
  const messages = dependents.slice(0, max)
    .map(edge => explainEdge(edge, depth, chalk))

  // show just the names of the first 5 deps that overflowed the list
  if (dependents.length > max) {
    let len = 0
    const maxLen = 50
    const showNames = []
    for (let i = max; i < dependents.length; i++) {
      const { from: { name: depName = 'the root project' } } = dependents[i]
      len += depName.length
      if (len >= maxLen && i < dependents.length - 1) {
        showNames.push('...')
        break
      }
      showNames.push(depName)
    }
    const show = `(${showNames.join(', ')})`
    messages.push(`${dependents.length - max} more ${show}`)
  }

  const str = '\n' + messages.join('\n')
  return str.split('\n').join('\n  ')
}

const explainEdge = ({ name, type, bundled, from, spec, rawSpec, overridden }, depth, chalk) => {
  let dep = type === 'workspace'
    ? chalk.bold(relative(from.location, spec.slice('file:'.length)))
    : `${name}@"${spec}"`
  if (overridden) {
    dep = `${colorType('overridden', chalk)} ${dep} (was "${rawSpec}")`
  }

  const fromMsg = ` from ${explainFrom(from, depth, chalk)}`

  return (type === 'prod' ? '' : `${colorType(type, chalk)} `) +
    (bundled ? `${colorType('bundled', chalk)} ` : '') +
    `${dep}${fromMsg}`
}

const explainFrom = (from, depth, chalk) => {
  if (!from.name && !from.version) {
    return 'the root project'
  }

  return printNode(from, chalk) +
    explainDependents(from, depth - 1, chalk) +
    explainLinksIn(from, depth - 1, chalk)
}

module.exports = { explainNode, printNode, explainEdge }

Directory Contents

Dirs: 0 × Files: 34

Name Size Perms Modified Actions
1.02 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
3.21 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
2.89 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
1.56 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
1.85 KB lrwxr-xr-x 2026-02-23 03:24:41
Edit Download
1.16 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
15.38 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
14.60 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
3.03 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
2.56 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
629 B lrw-r--r-- 2026-02-23 03:24:41
Edit Download
4.70 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
1.91 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
802 B lrw-r--r-- 2026-02-23 03:24:41
Edit Download
1.71 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
1.10 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
583 B lrw-r--r-- 2026-02-23 03:24:41
Edit Download
177 B lrw-r--r-- 2026-02-23 03:24:41
Edit Download
7.78 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
2.02 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
2.36 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
767 B lrw-r--r-- 2026-02-23 03:24:41
Edit Download
252 B lrw-r--r-- 2026-02-23 03:24:41
Edit Download
9.56 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
1.91 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
886 B lrw-r--r-- 2026-02-23 03:24:41
Edit Download
5.65 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
5.21 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
4.59 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
3.47 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
2.07 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download
1013 B lrw-r--r-- 2026-02-23 03:24:41
Edit Download
1023 B lrw-r--r-- 2026-02-23 03:24:41
Edit Download
11.92 KB lrw-r--r-- 2026-02-23 03:24:41
Edit Download

If ZipArchive is unavailable, a .tar will be created (no compression).