rbs 2.2.2 → 2.3.0

data/stdlib/optparse/0/optparse.rbs

@@ -3,7 +3,7 @@
 #
 # ### New to OptionParser?
 #
-# See the [Tutorial](./doc/optparse/tutorial_rdoc.html).
+# See the [Tutorial](optparse/tutorial.rdoc).
 #
 # ### Introduction
 #
@@ -374,9 +374,8 @@
 # ### Further documentation
 #
 # The above examples, along with the accompanying
-# [Tutorial](./doc/optparse/tutorial_rdoc.html), should be enough to learn how
-# to use this class. If you have any questions, file a ticket at
-# http://bugs.ruby-lang.org.
+# [Tutorial](optparse/tutorial.rdoc), should be enough to learn how to use this
+# class. If you have any questions, file a ticket at http://bugs.ruby-lang.org.
 #
 class OptionParser
   interface _Pattern
@@ -540,12 +539,12 @@ class OptionParser
   #   - define(*params, &block)
   # -->
   # Creates an option from the given parameters `params`. See [Parameters for New
-  # Options](./doc/optparse/option_params_rdoc.html).
+  # Options](./option_params.rdoc).
   #
   # The block, if given, is the handler for the created option. When the option is
   # encountered during command-line parsing, the block is called with the argument
   # given for the option, if any. See [Option
-  # Handlers](./option_params_rdoc.html#label-Option+Handlers).
+  # Handlers](./option_params.rdoc#label-Option+Handlers).
   #
   def define: (*String params) ?{ (*untyped) -> untyped } -> untyped
             | (String params, Class | Array[String] | Hash[Symbol, untyped] | Regexp obj, ?String desc) ?{ (*untyped) -> untyped } -> untyped
@@ -557,12 +556,12 @@ class OptionParser
   #   - define_head(*params, &block)
   # -->
   # Creates an option from the given parameters `params`. See [Parameters for New
-  # Options](./doc/optparse/option_params_rdoc.html).
+  # Options](./option_params.rdoc).
   #
   # The block, if given, is the handler for the created option. When the option is
   # encountered during command-line parsing, the block is called with the argument
   # given for the option, if any. See [Option
-  # Handlers](./option_params_rdoc.html#label-Option+Handlers).
+  # Handlers](./option_params.rdoc#label-Option+Handlers).
   #
   def define_head: (*String params) ?{ (*untyped) -> untyped } -> untyped
                  | (String params, Class | Array[String] | Hash[Symbol, untyped] | Regexp obj, ?String desc) ?{ (*untyped) -> untyped } -> untyped
@@ -574,12 +573,12 @@ class OptionParser
   #   - define_tail(*params, &block)
   # -->
   # Creates an option from the given parameters `params`. See [Parameters for New
-  # Options](./doc/optparse/option_params_rdoc.html).
+  # Options](./option_params.rdoc).
   #
   # The block, if given, is the handler for the created option. When the option is
   # encountered during command-line parsing, the block is called with the argument
   # given for the option, if any. See [Option
-  # Handlers](./option_params_rdoc.html#label-Option+Handlers).
+  # Handlers](./option_params.rdoc#label-Option+Handlers).
   #
   def define_tail: (*String params) ?{ (*untyped) -> untyped } -> untyped
                  | (String params, Class | Array[String] | Hash[Symbol, untyped] | Regexp obj, ?String desc) ?{ (*untyped) -> untyped } -> untyped
@@ -646,12 +645,12 @@ class OptionParser
   #   - make_switch(params, block = nil)
   # -->
   # Creates an option from the given parameters `params`. See [Parameters for New
-  # Options](./doc/optparse/option_params_rdoc.html).
+  # Options](./option_params.rdoc).
   #
   # The block, if given, is the handler for the created option. When the option is
   # encountered during command-line parsing, the block is called with the argument
   # given for the option, if any. See [Option
-  # Handlers](./option_params_rdoc.html#label-Option+Handlers).
+  # Handlers](./option_params.rdoc#label-Option+Handlers).
   #
   def make_switch: (Array[untyped] opts, ?Proc block) -> [ untyped, untyped, untyped, untyped, untyped ]
 
@@ -669,12 +668,12 @@ class OptionParser
   #   - on(*params, &block)
   # -->
   # Creates an option from the given parameters `params`. See [Parameters for New
-  # Options](./doc/optparse/option_params_rdoc.html).
+  # Options](./option_params.rdoc).
   #
   # The block, if given, is the handler for the created option. When the option is
   # encountered during command-line parsing, the block is called with the argument
   # given for the option, if any. See [Option
-  # Handlers](./option_params_rdoc.html#label-Option+Handlers).
+  # Handlers](./option_params.rdoc#label-Option+Handlers).
   #
   def on: (*String params) ?{ (*untyped) -> untyped } -> self
         | (String params, Class | Array[String] | Hash[Symbol, untyped] | Regexp obj, ?String desc) ?{ (*untyped) -> untyped } -> self
@@ -686,12 +685,12 @@ class OptionParser
   #   - on_head(*params, &block)
   # -->
   # Creates an option from the given parameters `params`. See [Parameters for New
-  # Options](./doc/optparse/option_params_rdoc.html).
+  # Options](./option_params.rdoc).
   #
   # The block, if given, is the handler for the created option. When the option is
   # encountered during command-line parsing, the block is called with the argument
   # given for the option, if any. See [Option
-  # Handlers](./option_params_rdoc.html#label-Option+Handlers).
+  # Handlers](./option_params.rdoc#label-Option+Handlers).
   #
   # The new option is added at the head of the summary.
   #
@@ -705,12 +704,12 @@ class OptionParser
   #   - on_tail(*params, &block)
   # -->
   # Creates an option from the given parameters `params`. See [Parameters for New
-  # Options](./doc/optparse/option_params_rdoc.html).
+  # Options](./option_params.rdoc).
   #
   # The block, if given, is the handler for the created option. When the option is
   # encountered during command-line parsing, the block is called with the argument
   # given for the option, if any. See [Option
-  # Handlers](./option_params_rdoc.html#label-Option+Handlers).
+  # Handlers](./option_params.rdoc#label-Option+Handlers).
   #
   # The new option is added at the tail of the summary.
   #
@@ -809,6 +808,9 @@ class OptionParser
   #
   def release: () -> untyped
 
+  # <!-- rdoc-file=lib/optparse.rb -->
+  # Release code
+  #
   def release=: (untyped) -> untyped
 
   # <!--

data/stdlib/prime/0/prime.rbs

@@ -76,9 +76,66 @@ class Prime
   # :   Upper bound of prime numbers. The iterator stops after it yields all prime
   #     numbers p <= `ubound`.
   #
-  def self?.each: (?Integer? ubound, ?PseudoPrimeGenerator generator) { (Integer) -> void } -> void
+  def self.each: (?Integer? ubound, ?PseudoPrimeGenerator generator) { (Integer) -> void } -> void
                 | (?Integer? ubound, ?PseudoPrimeGenerator generator) -> PseudoPrimeGenerator
 
+  # <!--
+  #   rdoc-file=lib/prime.rb
+  #   - each(ubound = nil, generator = EratosthenesGenerator.new, &block)
+  # -->
+  # Iterates the given block over all prime numbers.
+  #
+  # ## Parameters
+  #
+  # `ubound`
+  # :   Optional. An arbitrary positive number. The upper bound of enumeration.
+  #     The method enumerates prime numbers infinitely if `ubound` is nil.
+  # `generator`
+  # :   Optional. An implementation of pseudo-prime generator.
+  #
+  #
+  # ## Return value
+  #
+  # An evaluated value of the given block at the last time. Or an enumerator which
+  # is compatible to an `Enumerator` if no block given.
+  #
+  # ## Description
+  #
+  # Calls `block` once for each prime number, passing the prime as a parameter.
+  #
+  # `ubound`
+  # :   Upper bound of prime numbers. The iterator stops after it yields all prime
+  #     numbers p <= `ubound`.
+  #
+  def each: (?Integer? ubound, ?PseudoPrimeGenerator generator) { (Integer) -> void } -> void
+          | (?Integer? ubound, ?PseudoPrimeGenerator generator) -> PseudoPrimeGenerator
+
+  # <!--
+  #   rdoc-file=lib/prime.rb
+  #   - int_from_prime_division(pd)
+  # -->
+  # Re-composes a prime factorization and returns the product.
+  #
+  # For the decomposition:
+  #
+  #     [[p_1, e_1], [p_2, e_2], ..., [p_n, e_n]],
+  #
+  # it returns:
+  #
+  #     p_1**e_1 * p_2**e_2 * ... * p_n**e_n.
+  #
+  # ## Parameters
+  # `pd`
+  # :   Array of pairs of integers. Each pair consists of a prime number -- a
+  #     prime factor -- and a natural number -- its exponent (multiplicity).
+  #
+  #
+  # ## Example
+  #     Prime.int_from_prime_division([[3, 2], [5, 1]])  #=> 45
+  #     3**2 * 5                                         #=> 45
+  #
+  def self.int_from_prime_division: (Array[[ Integer, Integer ]]) -> Integer
+
   # <!--
   #   rdoc-file=lib/prime.rb
   #   - int_from_prime_division(pd)
@@ -103,7 +160,7 @@ class Prime
   #     Prime.int_from_prime_division([[3, 2], [5, 1]])  #=> 45
   #     3**2 * 5                                         #=> 45
   #
-  def self?.int_from_prime_division: (Array[[ Integer, Integer ]]) -> Integer
+  def int_from_prime_division: (Array[[ Integer, Integer ]]) -> Integer
 
   # <!--
   #   rdoc-file=lib/prime.rb
@@ -119,7 +176,61 @@ class Prime
   # `generator`
   # :   optional. A pseudo-prime generator.
   #
-  def self?.prime?: (Integer value, ?PseudoPrimeGenerator generator) -> bool
+  def self.prime?: (Integer value, ?PseudoPrimeGenerator generator) -> bool
+
+  # <!--
+  #   rdoc-file=lib/prime.rb
+  #   - prime?(value, generator = Prime::Generator23.new)
+  # -->
+  # Returns true if `value` is a prime number, else returns false. Integer#prime?
+  # is much more performant.
+  #
+  # ## Parameters
+  #
+  # `value`
+  # :   an arbitrary integer to be checked.
+  # `generator`
+  # :   optional. A pseudo-prime generator.
+  #
+  def prime?: (Integer value, ?PseudoPrimeGenerator generator) -> bool
+
+  # <!--
+  #   rdoc-file=lib/prime.rb
+  #   - prime_division(value, generator = Prime::Generator23.new)
+  # -->
+  # Returns the factorization of `value`.
+  #
+  # For an arbitrary integer:
+  #
+  #     p_1**e_1 * p_2**e_2 * ... * p_n**e_n,
+  #
+  # prime_division returns an array of pairs of integers:
+  #
+  #     [[p_1, e_1], [p_2, e_2], ..., [p_n, e_n]].
+  #
+  # Each pair consists of a prime number -- a prime factor -- and a natural number
+  # -- its exponent (multiplicity).
+  #
+  # ## Parameters
+  # `value`
+  # :   An arbitrary integer.
+  # `generator`
+  # :   Optional. A pseudo-prime generator. `generator`.succ must return the next
+  #     pseudo-prime number in ascending order. It must generate all prime
+  #     numbers, but may also generate non-prime numbers, too.
+  #
+  #
+  # ### Exceptions
+  # `ZeroDivisionError`
+  # :   when `value` is zero.
+  #
+  #
+  # ## Example
+  #
+  #     Prime.prime_division(45)  #=> [[3, 2], [5, 1]]
+  #     3**2 * 5                  #=> 45
+  #
+  def self.prime_division: (Integer, ?PseudoPrimeGenerator generator) -> Array[[ Integer, Integer ]]
 
   # <!--
   #   rdoc-file=lib/prime.rb
@@ -157,7 +268,7 @@ class Prime
   #     Prime.prime_division(45)  #=> [[3, 2], [5, 1]]
   #     3**2 * 5                  #=> 45
   #
-  def self?.prime_division: (Integer, ?PseudoPrimeGenerator generator) -> Array[[ Integer, Integer ]]
+  def prime_division: (Integer, ?PseudoPrimeGenerator generator) -> Array[[ Integer, Integer ]]
 
   # Returns the singleton instance.
   #

data/stdlib/rubygems/0/version.rbs

@@ -1,5 +1,163 @@
 %a{annotate:rdoc:skip}
 module Gem
+  # <!-- rdoc-file=lib/rubygems/version.rb -->
+  # The Version class processes string versions into comparable values. A version
+  # string should normally be a series of numbers separated by periods. Each part
+  # (digits separated by periods) is considered its own number, and these are used
+  # for sorting. So for instance, 3.10 sorts higher than 3.2 because ten is
+  # greater than two.
+  #
+  # If any part contains letters (currently only a-z are supported) then that
+  # version is considered prerelease. Versions with a prerelease part in the Nth
+  # part sort less than versions with N-1 parts. Prerelease parts are sorted
+  # alphabetically using the normal Ruby string sorting rules. If a prerelease
+  # part contains both letters and numbers, it will be broken into multiple parts
+  # to provide expected sort behavior (1.0.a10 becomes 1.0.a.10, and is greater
+  # than 1.0.a9).
+  #
+  # Prereleases sort between real releases (newest to oldest):
+  #
+  # 1.  1.0
+  # 2.  1.0.b1
+  # 3.  1.0.a.2
+  # 4.  0.9
+  #
+  #
+  # If you want to specify a version restriction that includes both prereleases
+  # and regular releases of the 1.x series this is the best way:
+  #
+  #     s.add_dependency 'example', '>= 1.0.0.a', '< 2.0.0'
+  #
+  # ## How Software Changes
+  #
+  # Users expect to be able to specify a version constraint that gives them some
+  # reasonable expectation that new versions of a library will work with their
+  # software if the version constraint is true, and not work with their software
+  # if the version constraint is false.  In other words, the perfect system will
+  # accept all compatible versions of the library and reject all incompatible
+  # versions.
+  #
+  # Libraries change in 3 ways (well, more than 3, but stay focused here!).
+  #
+  # 1.  The change may be an implementation detail only and have no effect on the
+  #     client software.
+  # 2.  The change may add new features, but do so in a way that client software
+  #     written to an earlier version is still compatible.
+  # 3.  The change may change the public interface of the library in such a way
+  #     that old software is no longer compatible.
+  #
+  #
+  # Some examples are appropriate at this point.  Suppose I have a Stack class
+  # that supports a `push` and a `pop` method.
+  #
+  # ### Examples of Category 1 changes:
+  #
+  # *   Switch from an array based implementation to a linked-list based
+  #     implementation.
+  # *   Provide an automatic (and transparent) backing store for large stacks.
+  #
+  #
+  # ### Examples of Category 2 changes might be:
+  #
+  # *   Add a `depth` method to return the current depth of the stack.
+  # *   Add a `top` method that returns the current top of stack (without changing
+  #     the stack).
+  # *   Change `push` so that it returns the item pushed (previously it had no
+  #     usable return value).
+  #
+  #
+  # ### Examples of Category 3 changes might be:
+  #
+  # *   Changes `pop` so that it no longer returns a value (you must use `top` to
+  #     get the top of the stack).
+  # *   Rename the methods to `push_item` and `pop_item`.
+  #
+  #
+  # ## RubyGems Rational Versioning
+  #
+  # *   Versions shall be represented by three non-negative integers, separated by
+  #     periods (e.g. 3.1.4).  The first integers is the "major" version number,
+  #     the second integer is the "minor" version number, and the third integer is
+  #     the "build" number.
+  #
+  # *   A category 1 change (implementation detail) will increment the build
+  #     number.
+  #
+  # *   A category 2 change (backwards compatible) will increment the minor
+  #     version number and reset the build number.
+  #
+  # *   A category 3 change (incompatible) will increment the major build number
+  #     and reset the minor and build numbers.
+  #
+  # *   Any "public" release of a gem should have a different version.  Normally
+  #     that means incrementing the build number.  This means a developer can
+  #     generate builds all day long, but as soon as they make a public release,
+  #     the version must be updated.
+  #
+  #
+  # ### Examples
+  #
+  # Let's work through a project lifecycle using our Stack example from above.
+  #
+  # Version 0.0.1
+  # :   The initial Stack class is release.
+  # Version 0.0.2
+  # :   Switched to a linked=list implementation because it is cooler.
+  # Version 0.1.0
+  # :   Added a `depth` method.
+  # Version 1.0.0
+  # :   Added `top` and made `pop` return nil (`pop` used to return the  old top
+  #     item).
+  # Version 1.1.0
+  # :   `push` now returns the value pushed (it used it return nil).
+  # Version 1.1.1
+  # :   Fixed a bug in the linked list implementation.
+  # Version 1.1.2
+  # :   Fixed a bug introduced in the last fix.
+  #
+  #
+  # Client A needs a stack with basic push/pop capability.  They write to the
+  # original interface (no `top`), so their version constraint looks like:
+  #
+  #     gem 'stack', '>= 0.0'
+  #
+  # Essentially, any version is OK with Client A.  An incompatible change to the
+  # library will cause them grief, but they are willing to take the chance (we
+  # call Client A optimistic).
+  #
+  # Client B is just like Client A except for two things: (1) They use the `depth`
+  # method and (2) they are worried about future incompatibilities, so they write
+  # their version constraint like this:
+  #
+  #     gem 'stack', '~> 0.1'
+  #
+  # The `depth` method was introduced in version 0.1.0, so that version or
+  # anything later is fine, as long as the version stays below version 1.0 where
+  # incompatibilities are introduced.  We call Client B pessimistic because they
+  # are worried about incompatible future changes (it is OK to be pessimistic!).
+  #
+  # ## Preventing Version Catastrophe:
+  #
+  # From: http://blog.zenspider.com/2008/10/rubygems-howto-preventing-cata.html
+  #
+  # Let's say you're depending on the fnord gem version 2.y.z. If you specify your
+  # dependency as ">= 2.0.0" then, you're good, right? What happens if fnord 3.0
+  # comes out and it isn't backwards compatible with 2.y.z? Your stuff will break
+  # as a result of using ">=". The better route is to specify your dependency with
+  # an "approximate" version specifier ("~>"). They're a tad confusing, so here is
+  # how the dependency specifiers work:
+  #
+  #     Specification From  ... To (exclusive)
+  #     ">= 3.0"      3.0   ... &infin;
+  #     "~> 3.0"      3.0   ... 4.0
+  #     "~> 3.0.0"    3.0.0 ... 3.1
+  #     "~> 3.5"      3.5   ... 4.0
+  #     "~> 3.5.0"    3.5.0 ... 3.6
+  #     "~> 3"        3.0   ... 4.0
+  #
+  # For the last example, single-digit versions are automatically extended with a
+  # zero to give a sensible result.
+  #
   class Version
     include Comparable
 
@@ -40,7 +198,7 @@ module Gem
     # -->
     # Compares this version with `other` returning -1, 0, or 1 if the other version
     # is larger, the same, or smaller than this one. Attempts to compare to
-    # something that's not a `Gem::Version` return `nil`.
+    # something that's not a `Gem::Version` or a valid version String return `nil`.
     #
     def <=>: (untyped other) -> Integer?
 

data/steep/Gemfile.lock

@@ -1,45 +1,43 @@
 GEM
   remote: https://rubygems.org/
   specs:
-    activesupport (6.1.4.1)
+    activesupport (7.0.2.3)
       concurrent-ruby (~> 1.0, >= 1.0.2)
       i18n (>= 1.6, < 2)
       minitest (>= 5.1)
       tzinfo (~> 2.0)
-      zeitwerk (~> 2.3)
     ast (2.4.2)
-    concurrent-ruby (1.1.9)
-    ffi (1.15.4)
-    i18n (1.8.11)
+    concurrent-ruby (1.1.10)
+    ffi (1.15.5)
+    i18n (1.10.0)
       concurrent-ruby (~> 1.0)
     language_server-protocol (3.16.0.3)
-    listen (3.7.0)
+    listen (3.7.1)
       rb-fsevent (~> 0.10, >= 0.10.3)
       rb-inotify (~> 0.9, >= 0.9.10)
-    minitest (5.14.4)
-    parallel (1.21.0)
-    parser (3.0.3.1)
+    minitest (5.15.0)
+    parallel (1.22.0)
+    parser (3.1.1.0)
       ast (~> 2.4.1)
-    rainbow (3.0.0)
-    rb-fsevent (0.11.0)
+    rainbow (3.1.1)
+    rb-fsevent (0.11.1)
     rb-inotify (0.10.1)
       ffi (~> 1.0)
-    rbs (1.7.1)
-    steep (0.47.0)
+    rbs (2.2.2)
+    steep (0.50.0)
       activesupport (>= 5.1)
       language_server-protocol (>= 3.15, < 4.0)
       listen (~> 3.0)
       parallel (>= 1.0.0)
       parser (>= 3.0)
       rainbow (>= 2.2.2, < 4.0)
-      rbs (~> 1.7.0)
+      rbs (>= 2.2.0)
       terminal-table (>= 2, < 4)
     terminal-table (3.0.2)
       unicode-display_width (>= 1.1.1, < 3)
     tzinfo (2.0.4)
       concurrent-ruby (~> 1.0)
     unicode-display_width (2.1.0)
-    zeitwerk (2.5.1)
 
 PLATFORMS
   ruby

metadata

@@ -1,14 +1,14 @@
 --- !ruby/object:Gem::Specification
 name: rbs
 version: !ruby/object:Gem::Version
-  version: 2.2.2
+  version: 2.3.0
 platform: ruby
 authors:
 - Soutaro Matsumoto
 autorequire:
 bindir: exe
 cert_chain: []
-date: 2022-02-22 00:00:00.000000000 Z
+date: 2022-04-01 00:00:00.000000000 Z
 dependencies: []
 description: RBS is the language for type signatures for Ruby and standard library
   definitions.
@@ -29,6 +29,7 @@ files:
 - CHANGELOG.md
 - COPYING
 - Gemfile
+- Gemfile.lock
 - README.md
 - Rakefile
 - Steepfile
@@ -171,6 +172,8 @@ files:
 - lib/rbs/prototype/rbi.rb
 - lib/rbs/prototype/runtime.rb
 - lib/rbs/repository.rb
+- lib/rbs/resolver/constant_resolver.rb
+- lib/rbs/resolver/type_name_resolver.rb
 - lib/rbs/substitution.rb
 - lib/rbs/test.rb
 - lib/rbs/test/errors.rb
@@ -228,6 +231,7 @@ files:
 - sig/errors.rbs
 - sig/location.rbs
 - sig/locator.rbs
+- sig/manifest.yaml
 - sig/members.rbs
 - sig/method_builder.rbs
 - sig/method_types.rbs
@@ -236,6 +240,9 @@ files:
 - sig/polyfill.rbs
 - sig/rbs.rbs
 - sig/repository.rbs
+- sig/resolver/constant_resolver.rbs
+- sig/resolver/context.rbs
+- sig/resolver/type_name_resolver.rbs
 - sig/substitution.rbs
 - sig/type_alias_dependency.rbs
 - sig/type_alias_regularity.rbs
@@ -373,7 +380,7 @@ required_rubygems_version: !ruby/object:Gem::Requirement
     - !ruby/object:Gem::Version
       version: '0'
 requirements: []
-rubygems_version: 3.3.6
+rubygems_version: 3.3.7
 signing_key:
 specification_version: 4
 summary: Type signature for Ruby.