File Explorer

1const relpath = require('./relpath.js')2const Node = require('./node.js')3const _loadDeps = Symbol.for('Arborist.Node._loadDeps')4const _target = Symbol.for('_target')5const { dirname } = require('node:path')6// defined by Node class7const _delistFromMeta = Symbol.for('_delistFromMeta')8const _refreshLocation = Symbol.for('_refreshLocation')9class Link extends Node {10  constructor (options) {11    const { root, realpath, target, parent, fsParent, isStoreLink } = options12 13    if (!realpath && !(target && target.path)) {14      throw new TypeError('must provide realpath for Link node')15    }16 17    super({18      ...options,19      realpath: realpath || target.path,20      root: root || (parent ? parent.root21      : fsParent ? fsParent.root22      : target ? target.root23      : null),24    })25 26    this.isStoreLink = isStoreLink || false27 28    if (target) {29      this.target = target30    } else if (this.realpath === this.root.path) {31      this.target = this.root32    } else {33      this.target = new Node({34        ...options,35        path: realpath,36        parent: null,37        fsParent: null,38        root: this.root,39      })40    }41  }42 43  get version () {44    return this.target ? this.target.version : this.package.version || ''45  }46 47  get target () {48    return this[_target]49  }50 51  set target (target) {52    const current = this[_target]53    if (target === current) {54      return55    }56 57    if (!target) {58      if (current && current.linksIn) {59        current.linksIn.delete(this)60      }61      if (this.path) {62        this[_delistFromMeta]()63        this[_target] = null64        this.package = {}65        this[_refreshLocation]()66      } else {67        this[_target] = null68      }69      return70    }71 72    if (!this.path) {73      // temp node pending assignment to a tree74      // we know it's not in the inventory yet, because no path.75      if (target.path) {76        this.realpath = target.path77      } else {78        target.path = target.realpath = this.realpath79      }80      target.root = this.root81      this[_target] = target82      target.linksIn.add(this)83      this.package = target.package84      return85    }86 87    // have to refresh metadata, because either realpath or package88    // is very likely changing.89    this[_delistFromMeta]()90    this.package = target.package91    this.realpath = target.path92    this[_refreshLocation]()93 94    target.root = this.root95  }96 97  // a link always resolves to the relative path to its target98  get resolved () {99    // the path/realpath guard is there for the benefit of setting100    // these things in the "wrong" order101    return this.path && this.realpath102      ? `file:${relpath(dirname(this.path), this.realpath)}`103      : null104  }105 106  set resolved (r) {}107 108  // deps are resolved on the target, not the Link109  // so this is a no-op110  [_loadDeps] () {}111 112  // Forward overrides to the target only when a rule names a dep it needs, directly or transitively (npm/cli#9357, #9619).113  recalculateOutEdgesOverrides () {114    if (!this.target || !this.overrides) {115      return116    }117    if (!overrideMatchesSubtree(this.overrides, this.target)) {118      return119    }120    this.target.updateOverridesEdgeInAdded(this.overrides)121  }122 123  // links can't have children, only their targets can124  // fix it to an empty list so that we can still call125  // things that iterate over them, just as a no-op126  get children () {127    return new Map()128  }129 130  set children (c) {}131 132  get isLink () {133    return true134  }135}136 137// True when an override rule applies to an edge reachable from the target at any depth.138// getEdgeRule matches on name and spec, returning the set itself when nothing applies, so a non-applicable version-qualified rule doesn't flip an intermediate node to "has overrides" (npm/cli#9357).139// Not a method: runs from the Node super-constructor, before subclass private methods exist.140const overrideMatchesSubtree = (overrides, target) => {141  const seen = new Set()142  const stack = [target]143  while (stack.length) {144    const node = stack.pop()145    const resolved = node.isLink ? node.target : node146    if (seen.has(resolved)) {147      continue148    }149    seen.add(resolved)150    for (const edge of resolved.edgesOut.values()) {151      if (overrides.getEdgeRule(edge).name === edge.name) {152        return true153      }154      if (edge.to) {155        stack.push(edge.to)156      }157    }158  }159  return false160}161 162module.exports = Link163