rbs 3.7.0.pre.1 → 3.8.0.pre.1

data/core/rubygems/version.rbs

@@ -22,7 +22,6 @@ module Gem
   # 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:
   #
@@ -46,7 +45,6 @@ module Gem
   # 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.
   #
@@ -56,7 +54,6 @@ module Gem
   #     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.
@@ -65,14 +62,12 @@ module Gem
   # *   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
@@ -94,24 +89,29 @@ module Gem
   #     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.
   #

data/core/set.rbs

@@ -16,7 +16,6 @@
 #      set to an unreliable state.
 # *   When a string is to be stored, a frozen copy of the string is
 #      stored instead unless the original string is already frozen.
-#
 # ## Comparison
 # The comparison operators `<`, `>`, `<=`, and `>=` are implemented as
 # shorthand for the {proper_,}{subset?,superset?} methods. The `<=>`
@@ -34,13 +33,11 @@
 #
 # ## Contact
 # *   Akinori MUSHA <mailto:knu@iDaemons.org> (current maintainer)
-#
 # ## What's Here
 # First, what's elsewhere. Class Set:
 # *   Inherits from [class Object](rdoc-ref:Object@What-27s+Here).
 # *   Includes [module Enumerable](rdoc-ref:Enumerable@What-27s+Here),
 #      which provides dozens of additional methods.
-#
 # In particular, class Set does not have many methods of its own
 # for fetching or for iterating.
 # Instead, it relies on those in Enumerable.
@@ -54,7 +51,6 @@
 # *   [Converting](#class-Set-label-Methods+for+Converting)
 # *   [Iterating](#class-Set-label-Methods+for+Iterating)
 # *   [And more....](#class-Set-label-Other+Methods)
-#
 # ### Methods for Creating a Set
 # *   ::[]:
 #      Returns a new set containing the given objects.
@@ -62,7 +58,6 @@
 #      Returns a new set containing either the given objects
 #      (if no block given) or the return values from the called block
 #      (if a block given).
-#
 # ### Methods for Set Operations
 # *   [|](#method-i-7C) (aliased as #union and #+):
 #      Returns a new set containing all elements from `self`
@@ -76,7 +71,6 @@
 # *   [\^](#method-i-5E):
 #      Returns a new set containing all elements from `self`
 #      and a given enumerable except those common to both.
-#
 # ### Methods for Comparing
 # *   [<=>](#method-i-3C-3D-3E):
 #      Returns -1, 0, or 1 as `self` is less than, equal to,
@@ -87,7 +81,6 @@
 # *   #compare_by_identity?:
 #      Returns whether the set considers only identity
 #      when comparing elements.
-#
 # ### Methods for Querying
 # *   #length (aliased as #size):
 #      Returns the count of elements.
@@ -112,7 +105,6 @@
 # *   #compare_by_identity?:
 #      Returns whether the set considers only identity
 #      when comparing elements.
-#
 # ### Methods for Assigning
 # *   #add (aliased as #<<):
 #      Adds a given object to the set; returns `self`.
@@ -125,7 +117,6 @@
 # *   #replace:
 #      Replaces the contents of the set with the contents
 #      of a given enumerable.
-#
 # ### Methods for Deleting
 # *   #clear:
 #      Removes all elements in the set; returns `self`.
@@ -143,7 +134,6 @@
 #      Removes elements not specified by a given block.
 # *   #reject!
 #      Removes elements specified by a given block.
-#
 # ### Methods for Converting
 # *   #classify:
 #      Returns a hash that classifies the elements,
@@ -170,11 +160,9 @@
 #      Returns `self` if given no arguments and no block;
 #      with a block given, returns a new set consisting of block
 #      return values.
-#
 # ### Methods for Iterating
 # *   #each:
 #      Calls the block with each successive element; returns `self`.
-#
 # ### Other Methods
 # *   #reset:
 #      Resets the internal state; useful if an object
@@ -400,7 +388,7 @@ class Set[unchecked out A]
 
   # <!--
   #   rdoc-file=lib/set.rb
-  #   - delete_if() { |o| ... }
+  #   - delete_if(&block)
   # -->
   # Deletes every element of the set for which block evaluates to
   # true, and returns self. Returns an enumerator if no block is
@@ -504,7 +492,7 @@ class Set[unchecked out A]
 
   # <!--
   #   rdoc-file=lib/set.rb
-  #   - keep_if() { |o| ... }
+  #   - keep_if(&block)
   # -->
   # Deletes every element of the set for which block evaluates to
   # false, and returns self. Returns an enumerator if no block is
@@ -612,7 +600,7 @@ class Set[unchecked out A]
   #   rdoc-file=lib/set.rb
   #   - to_a()
   # -->
-  # Converts the set to an array. The order of elements is uncertain.
+  # Returns an array containing all elements in the set.
   #     Set[1, 2].to_a                    #=> [1, 2]
   #     Set[1, 'c', :s].to_a              #=> [1, "c", :s]
   #