A FetchError that indicates that the reason for not being able to fetch data was that the host could not be contacted
Raised when a bad requirement is encountered
The global rubygems pool, available via the rubygems.org API. Returns instances of APISpecification.
The BestSet chooses the best available method to query a remote index.
It combines IndexSet and APISet
Used internally to indicate that a dependency conflicted with a spec that would be activated.
A set which represents the installed gems. Respects all the normal settings that control where to look for installed gems.
A GitSet represents gems that are sourced from git repositories.
This is used for gem dependency file support.
Example:
set = Gem::Resolver::GitSet.new set.add_git_gem 'rake', 'git://example/rake.git', tag: 'rake-10.1.0'
The global rubygems pool represented via the traditional source index.
A set of gems from a gem dependencies lockfile.
Resolver sets are used to look up specifications (and their dependencies) used in resolution. This set is abstract.
The SourceSet chooses the best available method to query a remote index.
Kind off like BestSet but filters the sources for gems
An absolutely silent progress reporter.
A basic dotted progress reporter.
An absolutely silent download reporter.
A progress reporter that behaves nicely with threaded downloading.
An absolutely silent IO.
This is the JSON generator implemented as a C extension. It can be configured to be used by setting
JSON.generator = JSON::Ext::Generator
with the method generator= in JSON.
For detail, see the MSDN.
— HKEY_*
Predefined key ((*handle*)). These are Integer, not Win32::Registry.
— REG_*
Registry value type.
— KEY_*
Security access mask.
— KEY_OPTIONS_*
Key options.
If the key is created newly or opened existing key. See also Registry#disposition method.
Indicates some other unhandled resolver error was encountered.
An error that occurred during the resolution process
An error caused by attempting to fulfil a dependency that was circular
@note This exception will be thrown if and only if a {Vertex} is added to a
{DependencyGraph} that has a {DependencyGraph::Vertex#path_to?} an
existing {DependencyGraph::Vertex}