Gecko [ touzafair.com ]

Name	Size	Permission
arborist	[ DIR ]	drwxr-xr-x
add-rm-pkg-deps.js	4.89 KB	-rw-r--r--
audit-report.js	11.99 KB	-rw-r--r--
calc-dep-flags.js	3.07 KB	-rw-r--r--
can-place-dep.js	13.94 KB	-rw-r--r--
case-insensitive-map.js	1.32 KB	-rw-r--r--
consistent-resolve.js	1.4 KB	-rw-r--r--
debug.js	1.2 KB	-rw-r--r--
deepest-nesting-target.js	691 B	-rw-r--r--
dep-valid.js	4.87 KB	-rw-r--r--
diff.js	9.57 KB	-rw-r--r--
edge.js	6.82 KB	-rw-r--r--
from-path.js	1.04 KB	-rw-r--r--
gather-dep-set.js	1.26 KB	-rw-r--r--
get-workspace-nodes.js	863 B	-rw-r--r--
index.js	353 B	-rw-r--r--
inventory.js	3.2 KB	-rw-r--r--
link.js	3.6 KB	-rw-r--r--
node.js	43.06 KB	-rw-r--r--
optional-set.js	1.32 KB	-rw-r--r--
override-resolves.js	230 B	-rw-r--r--
override-set.js	2.54 KB	-rw-r--r--
peer-entry-sets.js	2.57 KB	-rw-r--r--
place-dep.js	19.73 KB	-rw-r--r--
printable.js	5.09 KB	-rw-r--r--
query-selector-all.js	16.43 KB	-rw-r--r--
realpath.js	2.67 KB	-rw-r--r--
relpath.js	131 B	-rw-r--r--
reset-dep-flags.js	638 B	-rw-r--r--
retire-path.js	491 B	-rw-r--r--
shrinkwrap.js	37.02 KB	-rw-r--r--
signal-handling.js	2.19 KB	-rw-r--r--
signals.js	1.35 KB	-rw-r--r--
spec-from-lock.js	874 B	-rw-r--r--
tracker.js	3.29 KB	-rw-r--r--
tree-check.js	4.02 KB	-rw-r--r--
version-from-tgz.js	1.45 KB	-rw-r--r--
vuln.js	5.72 KB	-rw-r--r--
yarn-lock.js	10.05 KB	-rw-r--r--

Code Editor : printable.js

// helper function to output a clearer visualization
// of the current node and its descendents
const localeCompare = require('@isaacs/string-locale-compare')('en')
const util = require('util')
const relpath = require('./relpath.js')

class ArboristNode {
  constructor (tree, path) {
    this.name = tree.name
    if (tree.packageName && tree.packageName !== this.name) {
      this.packageName = tree.packageName
    }
    if (tree.version) {
      this.version = tree.version
    }
    this.location = tree.location
    this.path = tree.path
    if (tree.realpath !== this.path) {
      this.realpath = tree.realpath
    }
    if (tree.resolved !== null) {
      this.resolved = tree.resolved
    }
    if (tree.extraneous) {
      this.extraneous = true
    }
    if (tree.dev) {
      this.dev = true
    }
    if (tree.optional) {
      this.optional = true
    }
    if (tree.devOptional && !tree.dev && !tree.optional) {
      this.devOptional = true
    }
    if (tree.peer) {
      this.peer = true
    }
    if (tree.inBundle) {
      this.bundled = true
    }
    if (tree.inDepBundle) {
      this.bundler = tree.getBundler().location
    }
    if (tree.isProjectRoot) {
      this.isProjectRoot = true
    }
    if (tree.isWorkspace) {
      this.isWorkspace = true
    }
    const bd = tree.package && tree.package.bundleDependencies
    if (bd && bd.length) {
      this.bundleDependencies = bd
    }
    if (tree.inShrinkwrap) {
      this.inShrinkwrap = true
    } else if (tree.hasShrinkwrap) {
      this.hasShrinkwrap = true
    }
    if (tree.error) {
      this.error = treeError(tree.error)
    }
    if (tree.errors && tree.errors.length) {
      this.errors = tree.errors.map(treeError)
    }

if (tree.overrides) {
      this.overrides = new Map([...tree.overrides.ruleset.values()]
        .map((override) => [override.key, override.value]))
    }

// edgesOut sorted by name
    if (tree.edgesOut.size) {
      this.edgesOut = new Map([...tree.edgesOut.entries()]
        .sort(([a], [b]) => localeCompare(a, b))
        .map(([name, edge]) => [name, new EdgeOut(edge)]))
    }

// edgesIn sorted by location
    if (tree.edgesIn.size) {
      this.edgesIn = new Set([...tree.edgesIn]
        .sort((a, b) => localeCompare(a.from.location, b.from.location))
        .map(edge => new EdgeIn(edge)))
    }

if (tree.workspaces && tree.workspaces.size) {
      this.workspaces = new Map([...tree.workspaces.entries()]
        .map(([name, path]) => [name, relpath(tree.root.realpath, path)]))
    }

// fsChildren sorted by path
    if (tree.fsChildren.size) {
      this.fsChildren = new Set([...tree.fsChildren]
        .sort(({ path: a }, { path: b }) => localeCompare(a, b))
        .map(tree => printableTree(tree, path)))
    }

// children sorted by name
    if (tree.children.size) {
      this.children = new Map([...tree.children.entries()]
        .sort(([a], [b]) => localeCompare(a, b))
        .map(([name, tree]) => [name, printableTree(tree, path)]))
    }
  }
}

class ArboristVirtualNode extends ArboristNode {
  constructor (tree, path) {
    super(tree, path)
    this.sourceReference = printableTree(tree.sourceReference, path)
  }
}

class ArboristLink extends ArboristNode {
  constructor (tree, path) {
    super(tree, path)
    this.target = printableTree(tree.target, path)
  }
}

const treeError = ({ code, path }) => ({
  code,
  ...(path ? { path } : {}),
})

// print out edges without dumping the full node all over again
// this base class will toJSON as a plain old object, but the
// util.inspect() output will be a bit cleaner
class Edge {
  constructor (edge) {
    this.type = edge.type
    this.name = edge.name
    this.spec = edge.rawSpec || '*'
    if (edge.rawSpec !== edge.spec) {
      this.override = edge.spec
    }
    if (edge.error) {
      this.error = edge.error
    }
    if (edge.peerConflicted) {
      this.peerConflicted = edge.peerConflicted
    }
  }
}

// don't care about 'from' for edges out
class EdgeOut extends Edge {
  constructor (edge) {
    super(edge)
    this.to = edge.to && edge.to.location
  }

[util.inspect.custom] () {
    return `{ ${this.type} ${this.name}@${this.spec}${
      this.override ? ` overridden:${this.override}` : ''
    }${
      this.to ? ' -> ' + this.to : ''
    }${
      this.error ? ' ' + this.error : ''
    }${
      this.peerConflicted ? ' peerConflicted' : ''
    } }`
  }
}

// don't care about 'to' for edges in
class EdgeIn extends Edge {
  constructor (edge) {
    super(edge)
    this.from = edge.from && edge.from.location
  }

[util.inspect.custom] () {
    return `{ ${this.from || '""'} ${this.type} ${this.name}@${this.spec}${
      this.error ? ' ' + this.error : ''
    }${
      this.peerConflicted ? ' peerConflicted' : ''
    } }`
  }
}

const printableTree = (tree, path = []) => {
  if (!tree) {
    return tree
  }

const Cls = tree.isLink ? ArboristLink
    : tree.sourceReference ? ArboristVirtualNode
    : ArboristNode
  if (path.includes(tree)) {
    const obj = Object.create(Cls.prototype)
    return Object.assign(obj, { location: tree.location })
  }
  path.push(tree)
  return new Cls(tree, path)
}

module.exports = printableTree

${this.title}

Code Editor : printable.js