Is there a path from ‘other` to `self` following edges in the dependency graph? @return whether there is a path following edges within this {#graph}
@param [Object] requirement @return [Array<Object>] the list of requirements that led to
`requirement` being required.
Search through all unresolved deps and sub-dependencies and return specs that contain the file matching path.
Returns a Ruby lighter-weight code representation of this specification, used for indexing only.
See to_ruby.
Lines that have a ‘on_ignored_nl` type token and NOT a `BEG` type seem to be a good proxy for the ability to join multiple lines into one.
This predicate method is used to determine when those two criteria have been met.
The one known case this doesn’t handle is:
Ripper.lex <<~EOM a && b || c EOM
For some reason this introduces ‘on_ignore_newline` but with BEG type
Default description for the gem install and update commands.
@return [Set<Vertex>] the vertices of {#graph} where ‘self` is a
{#descendent?}
@param [Set<Vertex>] vertices the set to add the predecessors to @return [Set<Vertex>] the vertices of {#graph} where ‘self` is a
{#descendent?}
@return [Array<Array<Object>>] The different requirement
trees that led to every requirement for the current spec.