221 lines
7.6 KiB
Ruby
Raw Normal View History

2017-08-03 00:41:51 -04:00
#: * `deps` [`--1`] [`-n`] [`--union`] [`--full-name`] [`--installed`] [`--include-build`] [`--include-optional`] [`--skip-recommended`] [`--include-requirements`] <formulae>:
2016-04-08 16:28:43 +02:00
#: Show dependencies for <formulae>. When given multiple formula arguments,
#: show the intersection of dependencies for <formulae>.
2016-04-08 16:28:43 +02:00
#:
#: If `--1` is passed, only show dependencies one level down, instead of
#: recursing.
#:
#: If `-n` is passed, show dependencies in topological order.
#:
#: If `--union` is passed, show the union of dependencies for <formulae>,
#: instead of the intersection.
#:
#: If `--full-name` is passed, list dependencies by their full name.
#:
#: If `--installed` is passed, only list those dependencies that are
#: currently installed.
2016-04-08 16:28:43 +02:00
#:
#: By default, `deps` shows required and recommended dependencies for
#: <formulae>. To include the `:build` type dependencies, pass `--include-build`.
#: Similarly, pass `--include-optional` to include `:optional` dependencies.
#: To skip `:recommended` type dependencies, pass `--skip-recommended`.
2017-08-03 00:41:51 -04:00
#: To include requirements in addition to dependencies, pass `--include-requirements`.
#:
2017-08-03 00:41:51 -04:00
#: * `deps` `--tree` [`--1`] [<filters>] [`--annotate`] (<formulae>|`--installed`):
#: Show dependencies as a tree. When given multiple formula arguments, output
#: individual trees for every formula.
#:
2017-08-03 00:41:51 -04:00
#: If `--1` is passed, only one level of children is displayed.
#:
#: If `--installed` is passed, output a tree for every installed formula.
#:
#: The <filters> placeholder is any combination of options `--include-build`,
2017-08-03 00:41:51 -04:00
#: `--include-optional`, `--skip-recommended`, and `--include-requirements` as
#: documented above.
#:
#: If `--annotate` is passed, the build, optional, and recommended dependencies
#: are marked as such in the output.
#:
#: * `deps` [<filters>] (`--installed`|`--all`):
#: Show dependencies for installed or all available formulae. Every line of
#: output starts with the formula name, followed by a colon and all direct
#: dependencies of that formula.
#:
#: The <filters> placeholder is any combination of options `--include-build`,
#: `--include-optional`, and `--skip-recommended` as documented above.
2016-04-08 16:28:43 +02:00
2017-08-03 00:41:51 -04:00
# The undocumented `--for-each` option will switch into the mode used by `deps --all`,
# but only list dependencies for specified formula, one specified formula per line.
# This is used for debugging the `--installed`/`--all` display mode.
# encoding: UTF-8
2017-05-29 18:24:52 +01:00
require "formula"
require "ostruct"
module Homebrew
2016-09-26 01:44:51 +02:00
module_function
def deps
mode = OpenStruct.new(
installed?: ARGV.include?("--installed"),
tree?: ARGV.include?("--tree"),
all?: ARGV.include?("--all"),
topo_order?: ARGV.include?("-n"),
union?: ARGV.include?("--union"),
2017-08-03 00:41:51 -04:00
for_each?: ARGV.include?("--for-each"),
)
2017-08-03 00:41:51 -04:00
if mode.tree?
if mode.installed?
puts_deps_tree Formula.installed.sort, !ARGV.one?
2017-08-03 00:41:51 -04:00
else
raise FormulaUnspecifiedError if ARGV.named.empty?
puts_deps_tree ARGV.formulae, !ARGV.one?
end
elsif mode.all?
puts_deps Formula.sort
elsif ARGV.named.empty?
raise FormulaUnspecifiedError unless mode.installed?
puts_deps Formula.installed.sort
2017-08-03 00:41:51 -04:00
elsif mode.for_each?
puts_deps ARGV.formulae
else
all_deps = deps_for_formulae(ARGV.formulae, !ARGV.one?, &(mode.union? ? :| : :&))
2017-08-03 00:41:51 -04:00
all_deps = condense_requirements(all_deps)
all_deps = all_deps.select(&:installed?) if mode.installed?
all_deps = all_deps.map(&method(:dep_display_name)).uniq
all_deps.sort! unless mode.topo_order?
puts all_deps
end
end
2017-08-03 00:41:51 -04:00
def condense_requirements(deps)
if ARGV.include?("--include-requirements")
deps
else
deps.select { |dep| dep.is_a? Dependency }
2017-08-03 00:41:51 -04:00
end
end
def dep_display_name(dep)
str = if dep.is_a? Requirement
if ARGV.include?("--include-requirements")
":#{dep.display_s}"
2017-08-03 00:41:51 -04:00
else
# This shouldn't happen, but we'll put something here to help debugging
"::#{dep.name}"
end
else
ARGV.include?("--full-name") ? dep.to_formula.full_name : dep.name
end
if ARGV.include?("--annotate")
str = "#{str} [build]" if dep.build?
str = "#{str} [optional" if dep.optional?
str = "#{str} [recommended]" if dep.recommended?
end
str
end
def deps_for_formula(f, recursive = false)
includes = []
ignores = []
2017-08-03 00:41:51 -04:00
if ARGV.include?("--include-build")
includes << "build?"
else
ignores << "build?"
end
2017-08-03 00:41:51 -04:00
if ARGV.include?("--include-optional")
includes << "optional?"
else
ignores << "optional?"
end
2017-08-03 00:41:51 -04:00
ignores << "recommended?" if ARGV.include?("--skip-recommended")
if recursive
deps = f.recursive_dependencies do |dependent, dep|
if dep.recommended?
Dependency.prune if ignores.include?("recommended?") || dependent.build.without?(dep)
elsif dep.optional?
Dependency.prune if !includes.include?("optional?") && !dependent.build.with?(dep)
elsif dep.build?
Dependency.prune unless includes.include?("build?")
end
end
reqs = f.recursive_requirements do |dependent, req|
if req.recommended?
Requirement.prune if ignores.include?("recommended?") || dependent.build.without?(req)
elsif req.optional?
Requirement.prune if !includes.include?("optional?") && !dependent.build.with?(req)
elsif req.build?
Requirement.prune unless includes.include?("build?")
end
end
else
deps = f.deps.reject do |dep|
2017-05-29 18:24:52 +01:00
ignores.any? { |ignore| dep.send(ignore) } && includes.none? { |include| dep.send(include) }
end
reqs = f.requirements.reject do |req|
2017-05-29 18:24:52 +01:00
ignores.any? { |ignore| req.send(ignore) } && includes.none? { |include| req.send(include) }
end
end
2014-02-27 12:56:42 -06:00
2017-08-03 00:41:51 -04:00
deps + reqs.to_a
end
def deps_for_formulae(formulae, recursive = false, &block)
formulae.map { |f| deps_for_formula(f, recursive) }.inject(&block)
2013-06-22 12:54:45 -05:00
end
2013-06-22 12:54:45 -05:00
def puts_deps(formulae)
formulae.each do |f|
2017-08-03 00:41:51 -04:00
deps = deps_for_formula(f)
deps = condense_requirements(deps)
deps = deps.sort_by(&:name).map(&method(:dep_display_name))
puts "#{f.full_name}: #{deps.join(" ")}"
end
2013-06-22 12:54:45 -05:00
end
2017-08-03 00:41:51 -04:00
def puts_deps_tree(formulae, recursive = false)
2013-06-22 12:54:45 -05:00
formulae.each do |f|
2017-08-03 00:41:51 -04:00
puts f.full_name
@dep_stack = []
recursive_deps_tree(f, "", recursive)
2013-06-22 12:54:45 -05:00
puts
end
end
2017-08-03 00:41:51 -04:00
def recursive_deps_tree(f, prefix, recursive)
reqs = f.requirements
deps = f.deps
dependables = reqs + deps
dependables = dependables.reject(&:optional?) unless ARGV.include?("--include-optional")
dependables = dependables.reject(&:build?) unless ARGV.include?("--include-build")
dependables = dependables.reject(&:recommended?) if ARGV.include?("--skip-recommended")
max = dependables.length - 1
@dep_stack.push f.name
dependables.each_with_index do |dep, i|
next if !ARGV.include?("--include-requirements") && dep.is_a?(Requirement)
2017-08-03 00:41:51 -04:00
tree_lines = if i == max
"└──"
else
"├──"
end
2017-08-03 00:41:51 -04:00
display_s = "#{tree_lines} #{dep_display_name(dep)}"
is_circular = @dep_stack.include?(dep.name)
display_s = "#{display_s} (CIRCULAR DEPENDENCY)" if is_circular
puts "#{prefix}#{display_s}"
next if !recursive || is_circular
prefix_addition = if i == max
" "
else
2017-08-03 00:41:51 -04:00
""
end
if dep.is_a? Dependency
recursive_deps_tree(Formulary.factory(dep.name), prefix + prefix_addition, true)
end
end
2017-08-03 00:41:51 -04:00
@dep_stack.pop
end
end