rbs 3.0.0.dev.2 → 3.0.0.dev.3

data/core/enumerable.rbs

@@ -2,12 +2,13 @@
 # ## What's Here
 #
 # Module Enumerable provides methods that are useful to a collection class for:
-# *   [Querying](#module-Enumerable-label-Methods+for+Querying)
-# *   [Fetching](#module-Enumerable-label-Methods+for+Fetching)
-# *   [Searching](#module-Enumerable-label-Methods+for+Searching)
-# *   [Sorting](#module-Enumerable-label-Methods+for+Sorting)
-# *   [Iterating](#module-Enumerable-label-Methods+for+Iterating)
-# *   [And more....](#module-Enumerable-label-Other+Methods)
+#
+# *   [Querying](rdoc-ref:Enumerable@Methods+for+Querying)
+# *   [Fetching](rdoc-ref:Enumerable@Methods+for+Fetching)
+# *   [Searching](rdoc-ref:Enumerable@Methods+for+Searching)
+# *   [Sorting](rdoc-ref:Enumerable@Methods+for+Sorting)
+# *   [Iterating](rdoc-ref:Enumerable@Methods+for+Iterating)
+# *   [And more....](rdoc-ref:Enumerable@Other+Methods)
 #
 #
 # ### Methods for Querying
@@ -15,25 +16,20 @@
 # These methods return information about the Enumerable other than the elements
 # themselves:
 #
-# #include?, #member?
-# :   Returns `true` if self == object, `false` otherwise.
-# #all?
-# :   Returns `true` if all elements meet a specified criterion; `false`
+# *   #include?, #member?: Returns `true` if `self == object`, `false`
 #     otherwise.
-# #any?
-# :   Returns `true` if any element meets a specified criterion; `false`
+# *   #all?: Returns `true` if all elements meet a specified criterion; `false`
 #     otherwise.
-# #none?
-# :   Returns `true` if no element meets a specified criterion; `false`
+# *   #any?: Returns `true` if any element meets a specified criterion; `false`
 #     otherwise.
-# #one?
-# :   Returns `true` if exactly one element meets a specified criterion; `false`
+# *   #none?: Returns `true` if no element meets a specified criterion; `false`
 #     otherwise.
-# #count
-# :   Returns the count of elements, based on an argument or block criterion, if
-#     given.
-# #tally
-# :   Returns a new Hash containing the counts of occurrences of each element.
+# *   #one?: Returns `true` if exactly one element meets a specified criterion;
+#     `false` otherwise.
+# *   #count: Returns the count of elements, based on an argument or block
+#     criterion, if given.
+# *   #tally: Returns a new Hash containing the counts of occurrences of each
+#     element.
 #
 #
 # ### Methods for Fetching
@@ -41,126 +37,96 @@
 # These methods return entries from the Enumerable, without modifying it:
 #
 # *Leading, trailing, or all elements*:
-# #entries, #to_a
-# :   Returns all elements.
-# #first
-# :   Returns the first element or leading elements.
-# #take
-# :   Returns a specified number of leading elements.
-# #drop
-# :   Returns a specified number of trailing elements.
-# #take_while
-# :   Returns leading elements as specified by the given block.
-# #drop_while
-# :   Returns trailing elements as specified by the given block.
+#
+# *   #entries, #to_a: Returns all elements.
+# *   #first: Returns the first element or leading elements.
+# *   #take: Returns a specified number of leading elements.
+# *   #drop: Returns a specified number of trailing elements.
+# *   #take_while: Returns leading elements as specified by the given block.
+# *   #drop_while: Returns trailing elements as specified by the given block.
 #
 #
 # *Minimum and maximum value elements*:
-# #min
-# :   Returns the elements whose values are smallest among the elements, as
-#     determined by `<=>` or a given block.
-# #max
-# :   Returns the elements whose values are largest among the elements, as
+#
+# *   #min: Returns the elements whose values are smallest among the elements,
+#     as determined by `<=>` or a given block.
+# *   #max: Returns the elements whose values are largest among the elements, as
 #     determined by `<=>` or a given block.
-# #minmax
-# :   Returns a 2-element Array containing the smallest and largest elements.
-# #min_by
-# :   Returns the smallest element, as determined by the given block.
-# #max_by
-# :   Returns the largest element, as determined by the given block.
-# #minmax_by
-# :   Returns the smallest and largest elements, as determined by the given
-#     block.
+# *   #minmax: Returns a 2-element Array containing the smallest and largest
+#     elements.
+# *   #min_by: Returns the smallest element, as determined by the given block.
+# *   #max_by: Returns the largest element, as determined by the given block.
+# *   #minmax_by: Returns the smallest and largest elements, as determined by
+#     the given block.
 #
 #
 # *Groups, slices, and partitions*:
-# #group_by
-# :   Returns a Hash that partitions the elements into groups.
-# #partition
-# :   Returns elements partitioned into two new Arrays, as determined by the
+#
+# *   #group_by: Returns a Hash that partitions the elements into groups.
+# *   #partition: Returns elements partitioned into two new Arrays, as
+#     determined by the given block.
+# *   #slice_after: Returns a new Enumerator whose entries are a partition of
+#     `self`, based either on a given `object` or a given block.
+# *   #slice_before: Returns a new Enumerator whose entries are a partition of
+#     `self`, based either on a given `object` or a given block.
+# *   #slice_when: Returns a new Enumerator whose entries are a partition of
+#     `self` based on the given block.
+# *   #chunk: Returns elements organized into chunks as specified by the given
+#     block.
+# *   #chunk_while: Returns elements organized into chunks as specified by the
 #     given block.
-# #slice_after
-# :   Returns a new Enumerator whose entries are a partition of `self`, based
-#     either on a given `object` or a given block.
-# #slice_before
-# :   Returns a new Enumerator whose entries are a partition of `self`, based
-#     either on a given `object` or a given block.
-# #slice_when
-# :   Returns a new Enumerator whose entries are a partition of `self` based on
-#     the given block.
-# #chunk
-# :   Returns elements organized into chunks as specified by the given block.
-# #chunk_while
-# :   Returns elements organized into chunks as specified by the given block.
 #
 #
 # ### Methods for Searching and Filtering
 #
-# These methods return elements that meet a specified criterion.
+# These methods return elements that meet a specified criterion:
 #
-# #find, #detect
-# :   Returns an element selected by the block.
-# #find_all, #filter, #select
-# :   Returns elements selected by the block.
-# #find_index
-# :   Returns the index of an element selected by a given object or block.
-# #reject
-# :   Returns elements not rejected by the block.
-# #uniq
-# :   Returns elements that are not duplicates.
+# *   #find, #detect: Returns an element selected by the block.
+# *   #find_all, #filter, #select: Returns elements selected by the block.
+# *   #find_index: Returns the index of an element selected by a given object or
+#     block.
+# *   #reject: Returns elements not rejected by the block.
+# *   #uniq: Returns elements that are not duplicates.
 #
 #
 # ### Methods for Sorting
 #
-# These methods return elements in sorted order.
+# These methods return elements in sorted order:
 #
-# #sort
-# :   Returns the elements, sorted by `<=>` or the given block.
-# #sort_by
-# :   Returns the elements, sorted by the given block.
+# *   #sort: Returns the elements, sorted by `<=>` or the given block.
+# *   #sort_by: Returns the elements, sorted by the given block.
 #
 #
 # ### Methods for Iterating
 #
-# #each_entry
-# :   Calls the block with each successive element (slightly different from
-#     #each).
-# #each_with_index
-# :   Calls the block with each successive element and its index.
-# #each_with_object
-# :   Calls the block with each successive element and a given object.
-# #each_slice
-# :   Calls the block with successive non-overlapping slices.
-# #each_cons
-# :   Calls the block with successive overlapping slices. (different from
-#     #each_slice).
-# #reverse_each
-# :   Calls the block with each successive element, in reverse order.
+# *   #each_entry: Calls the block with each successive element (slightly
+#     different from #each).
+# *   #each_with_index: Calls the block with each successive element and its
+#     index.
+# *   #each_with_object: Calls the block with each successive element and a
+#     given object.
+# *   #each_slice: Calls the block with successive non-overlapping slices.
+# *   #each_cons: Calls the block with successive overlapping slices. (different
+#     from #each_slice).
+# *   #reverse_each: Calls the block with each successive element, in reverse
+#     order.
 #
 #
 # ### Other Methods
 #
-# #map, #collect
-# :   Returns objects returned by the block.
-# #filter_map
-# :   Returns truthy objects returned by the block.
-# #flat_map, #collect_concat
-# :   Returns flattened objects returned by the block.
-# #grep
-# :   Returns elements selected by a given object or objects returned by a given
-#     block.
-# #grep_v
-# :   Returns elements selected by a given object or objects returned by a given
+# *   #map, #collect: Returns objects returned by the block.
+# *   #filter_map: Returns truthy objects returned by the block.
+# *   #flat_map, #collect_concat: Returns flattened objects returned by the
 #     block.
-# #reduce, #inject
-# :   Returns the object formed by combining all elements.
-# #sum
-# :   Returns the sum of the elements, using method +++.
-# #zip
-# :   Combines each element with elements from other enumerables; returns the
-#     n-tuples or calls the block with each.
-# #cycle
-# :   Calls the block with each element, cycling repeatedly.
+# *   #grep: Returns elements selected by a given object or objects returned by
+#     a given block.
+# *   #grep_v: Returns elements selected by a given object or objects returned
+#     by a given block.
+# *   #reduce, #inject: Returns the object formed by combining all elements.
+# *   #sum: Returns the sum of the elements, using method `+`.
+# *   #zip: Combines each element with elements from other enumerables; returns
+#     the n-tuples or calls the block with each.
+# *   #cycle: Calls the block with each element, cycling repeatedly.
 #
 #
 # ## Usage
@@ -193,18 +159,32 @@
 #     [1, 2]
 #     nil
 #
-# ## Enumerable in Ruby Core Classes
-# Some Ruby classes include Enumerable:
+# ## Enumerable in Ruby Classes
+#
+# These Ruby core classes include (or extend) Enumerable:
+#
+# *   ARGF
 # *   Array
 # *   Dir
+# *   Enumerator
+# *   ENV (extends)
 # *   Hash
 # *   IO
 # *   Range
-# *   Set
 # *   Struct
 #
+#
+# These Ruby standard library classes include Enumerable:
+#
+# *   CSV
+# *   CSV::Table
+# *   CSV::Row
+# *   Set
+#
+#
 # Virtually all methods in Enumerable call method `#each` in the including
 # class:
+#
 # *   `Hash#each` yields the next key-value pair as a 2-element Array.
 # *   `Struct#each` yields the next name-value pair as a 2-element Array.
 # *   For the other classes above, `#each` yields the next object from the
@@ -212,7 +192,9 @@
 #
 #
 # ## About the Examples
+#
 # The example code snippets for the Enumerable methods:
+#
 # *   Always show the use of one or more Array-like classes (often Array
 #     itself).
 # *   Sometimes show the use of a Hash-like class. For some methods, though, the
@@ -523,8 +505,10 @@ module Enumerable[unchecked out Elem] : _Each[Elem]
   # Calls the block once for each element, passing both the element and the given
   # object:
   #
-  #     (1..4).each_with_object([]) {|i, a| a.push(i**2) } # => [1, 4, 9, 16]
-  #     h.each_with_object({}) {|element, h| k, v = *element; h[v] = k }
+  #     (1..4).each_with_object([]) {|i, a| a.push(i**2) }
+  #     # => [1, 4, 9, 16]
+  #
+  #     {foo: 0, bar: 1, baz: 2}.each_with_object({}) {|(k, v), h| h[v] = k }
   #     # => {0=>:foo, 1=>:bar, 2=>:baz}
   #
   # With no block given, returns an Enumerator.
@@ -1998,8 +1982,10 @@ module Enumerable[unchecked out Elem] : _Each[Elem]
   #     [:a2, :b2, :c2]
   #     [:a3, :b3, :c3]
   #
-  def zip: [Elem2] (::Enumerable[Elem2] enum) -> ::Array[[ Elem, Elem2 | nil ]]
-         | [U, Elem2] (::Enumerable[Elem2]) { ([ Elem, Elem2 | nil ]) -> U } -> nil
+  def zip: [Elem2] (_Each[Elem2] enum) -> Array[[ Elem, Elem2? ]]
+         | (_Each[untyped], *_Each[untyped]) -> Array[Array[untyped]]
+         | [Elem2] (_Each[Elem2]) { ([ Elem, Elem2? ]) -> void } -> nil
+         | (_Each[untyped], *_Each[untyped]) { (Array[untyped]) -> void } -> nil
 
   # <!--
   #   rdoc-file=enum.c
@@ -2112,83 +2098,134 @@ module Enumerable[unchecked out Elem] : _Each[Elem]
 
   # <!--
   #   rdoc-file=enum.c
-  #   - chunk_while {|element, next_element| ... } -> enumerator
+  #   - enum.chunk_while {|elt_before, elt_after| bool } -> an_enumerator
   # -->
-  # The returned Enumerator uses the block to partition elements into arrays
-  # ("chunks"); it calls the block with each element and its successor; begins a
-  # new chunk if and only if the block returns a truthy value:
+  # Creates an enumerator for each chunked elements. The beginnings of chunks are
+  # defined by the block.
   #
-  # Example:
+  # This method splits each chunk using adjacent elements, *elt_before* and
+  # *elt_after*, in the receiver enumerator. This method split chunks between
+  # *elt_before* and *elt_after* where the block returns `false`.
   #
-  #     a = [1, 2, 4, 9, 10, 11, 12, 15, 16, 19, 20, 21]
-  #     e = a.chunk_while {|i, j| j == i + 1 }
-  #     e.each {|array| p array }
+  # The block is called the length of the receiver enumerator minus one.
   #
-  # Output:
+  # The result enumerator yields the chunked elements as an array. So `each`
+  # method can be called as follows:
   #
-  #     [1, 2]
-  #     [4]
-  #     [9, 10, 11, 12]
-  #     [15, 16]
-  #     [19, 20, 21]
+  #     enum.chunk_while { |elt_before, elt_after| bool }.each { |ary| ... }
+  #
+  # Other methods of the Enumerator class and Enumerable module, such as `to_a`,
+  # `map`, etc., are also usable.
+  #
+  # For example, one-by-one increasing subsequence can be chunked as follows:
+  #
+  #     a = [1,2,4,9,10,11,12,15,16,19,20,21]
+  #     b = a.chunk_while {|i, j| i+1 == j }
+  #     p b.to_a #=> [[1, 2], [4], [9, 10, 11, 12], [15, 16], [19, 20, 21]]
+  #     c = b.map {|a| a.length < 3 ? a : "#{a.first}-#{a.last}" }
+  #     p c #=> [[1, 2], [4], "9-12", [15, 16], "19-21"]
+  #     d = c.join(",")
+  #     p d #=> "1,2,4,9-12,15,16,19-21"
+  #
+  # Increasing (non-decreasing) subsequence can be chunked as follows:
+  #
+  #     a = [0, 9, 2, 2, 3, 2, 7, 5, 9, 5]
+  #     p a.chunk_while {|i, j| i <= j }.to_a
+  #     #=> [[0, 9], [2, 2, 3], [2, 7], [5, 9], [5]]
+  #
+  # Adjacent evens and odds can be chunked as follows: (Enumerable#chunk is
+  # another way to do it.)
+  #
+  #     a = [7, 5, 9, 2, 0, 7, 9, 4, 2, 0]
+  #     p a.chunk_while {|i, j| i.even? == j.even? }.to_a
+  #     #=> [[7, 5, 9], [2, 0], [7, 9], [4, 2, 0]]
+  #
+  # Enumerable#slice_when does the same, except splitting when the block returns
+  # `true` instead of `false`.
   #
   def chunk_while: () { (Elem elt_before, Elem elt_after) -> boolish } -> ::Enumerator[::Array[Elem], void]
 
   # <!--
   #   rdoc-file=enum.c
-  #   - slice_when {|element, next_element| ... } -> enumerator
+  #   - enum.slice_when {|elt_before, elt_after| bool } -> an_enumerator
   # -->
-  # The returned enumerator uses the block to partition elements into arrays
-  # ("slices"); it calls the block with each element and its successor; begins a
-  # new slice if and only if the block returns a truthy value:
+  # Creates an enumerator for each chunked elements. The beginnings of chunks are
+  # defined by the block.
   #
-  #     a = [0, 1, 2, 4, 5, 6, 8, 9]
-  #     e = a.slice_when {|i, j| j != i + 1 }
-  #     e.each {|array| p array }
+  # This method splits each chunk using adjacent elements, *elt_before* and
+  # *elt_after*, in the receiver enumerator. This method split chunks between
+  # *elt_before* and *elt_after* where the block returns `true`.
   #
-  # Output:
+  # The block is called the length of the receiver enumerator minus one.
+  #
+  # The result enumerator yields the chunked elements as an array. So `each`
+  # method can be called as follows:
+  #
+  #     enum.slice_when { |elt_before, elt_after| bool }.each { |ary| ... }
+  #
+  # Other methods of the Enumerator class and Enumerable module, such as `to_a`,
+  # `map`, etc., are also usable.
+  #
+  # For example, one-by-one increasing subsequence can be chunked as follows:
+  #
+  #     a = [1,2,4,9,10,11,12,15,16,19,20,21]
+  #     b = a.slice_when {|i, j| i+1 != j }
+  #     p b.to_a #=> [[1, 2], [4], [9, 10, 11, 12], [15, 16], [19, 20, 21]]
+  #     c = b.map {|a| a.length < 3 ? a : "#{a.first}-#{a.last}" }
+  #     p c #=> [[1, 2], [4], "9-12", [15, 16], "19-21"]
+  #     d = c.join(",")
+  #     p d #=> "1,2,4,9-12,15,16,19-21"
+  #
+  # Near elements (threshold: 6) in sorted array can be chunked as follows:
+  #
+  #     a = [3, 11, 14, 25, 28, 29, 29, 41, 55, 57]
+  #     p a.slice_when {|i, j| 6 < j - i }.to_a
+  #     #=> [[3], [11, 14], [25, 28, 29, 29], [41], [55, 57]]
+  #
+  # Increasing (non-decreasing) subsequence can be chunked as follows:
+  #
+  #     a = [0, 9, 2, 2, 3, 2, 7, 5, 9, 5]
+  #     p a.slice_when {|i, j| i > j }.to_a
+  #     #=> [[0, 9], [2, 2, 3], [2, 7], [5, 9], [5]]
   #
-  #     [0, 1, 2]
-  #     [4, 5, 6]
-  #     [8, 9]
+  # Adjacent evens and odds can be chunked as follows: (Enumerable#chunk is
+  # another way to do it.)
+  #
+  #     a = [7, 5, 9, 2, 0, 7, 9, 4, 2, 0]
+  #     p a.slice_when {|i, j| i.even? != j.even? }.to_a
+  #     #=> [[7, 5, 9], [2, 0], [7, 9], [4, 2, 0]]
+  #
+  # Paragraphs (non-empty lines with trailing empty lines) can be chunked as
+  # follows: (See Enumerable#chunk to ignore empty lines.)
+  #
+  #     lines = ["foo\n", "bar\n", "\n", "baz\n", "qux\n"]
+  #     p lines.slice_when {|l1, l2| /\A\s*\z/ =~ l1 && /\S/ =~ l2 }.to_a
+  #     #=> [["foo\n", "bar\n", "\n"], ["baz\n", "qux\n"]]
+  #
+  # Enumerable#chunk_while does the same, except splitting when the block returns
+  # `false` instead of `true`.
   #
   def slice_when: () { (Elem elt_before, Elem elt_after) -> boolish } -> ::Enumerator[::Array[Elem], void]
 
   # <!--
   #   rdoc-file=enum.c
-  #   - slice_after(pattern)       -> enumerator
-  #   - slice_after {|array| ... } -> enumerator
+  #   - enum.slice_after(pattern)       -> an_enumerator
+  #   - enum.slice_after { |elt| bool } -> an_enumerator
   # -->
-  # With argument `pattern`, returns an enumerator that uses the pattern to
-  # partition elements into arrays ("slices"). An element ends the current slice
-  # if `element === pattern`:
-  #
-  #     a = %w[foo bar fop for baz fob fog bam foy]
-  #     e = a.slice_after(/ba/) # => #<Enumerator: ...>
-  #     e.each {|array| p array }
+  # Creates an enumerator for each chunked elements. The ends of chunks are
+  # defined by *pattern* and the block.
   #
-  # Output:
-  #
-  #     ["foo", "bar"]
-  #     ["fop", "for", "baz"]
-  #     ["fob", "fog", "bam"]
-  #     ["foy"]
-  #
-  # With a block, returns an enumerator that uses the block to partition elements
-  # into arrays. An element ends the current slice if its block return is a truthy
-  # value:
+  # If *`pattern* === *elt`* returns `true` or the block returns `true` for the
+  # element, the element is end of a chunk.
   #
-  #     e = (1..20).slice_after {|i| i % 4 == 2 } # => #<Enumerator: ...>
-  #     e.each {|array| p array }
+  # The `===` and *block* is called from the first element to the last element of
+  # *enum*.
   #
-  # Output:
+  # The result enumerator yields the chunked elements as an array. So `each`
+  # method can be called as follows:
   #
-  #     [1, 2]
-  #     [3, 4, 5, 6]
-  #     [7, 8, 9, 10]
-  #     [11, 12, 13, 14]
-  #     [15, 16, 17, 18]
-  #     [19, 20]
+  #     enum.slice_after(pattern).each { |ary| ... }
+  #     enum.slice_after { |elt| bool }.each { |ary| ... }
   #
   # Other methods of the Enumerator class and Enumerable module, such as `map`,
   # etc., are also usable.
@@ -2209,7 +2246,7 @@ module Enumerable[unchecked out Elem] : _Each[Elem]
   # <!--
   #   rdoc-file=enum.c
   #   - slice_before(pattern)       -> enumerator
-  #   - slice_before {|array| ... } -> enumerator
+  #   - slice_before {|elt| ... } -> enumerator
   # -->
   # With argument `pattern`, returns an enumerator that uses the pattern to
   # partition elements into arrays ("slices"). An element begins a new slice if

data/core/enumerator/product.rbs

@@ -0,0 +1,96 @@
+%a{annotate:rdoc:skip}
+class Enumerator[unchecked out Elem, out Return]
+  # <!-- rdoc-file=enumerator.c -->
+  # Enumerator::Product generates a Cartesian product of any number of enumerable
+  # objects.  Iterating over the product of enumerable objects is roughly
+  # equivalent to nested each_entry loops where the loop for the rightmost object
+  # is put innermost.
+  #
+  #     innings = Enumerator::Product.new(1..9, ['top', 'bottom'])
+  #
+  #     innings.each do |i, h|
+  #       p [i, h]
+  #     end
+  #     # [1, "top"]
+  #     # [1, "bottom"]
+  #     # [2, "top"]
+  #     # [2, "bottom"]
+  #     # [3, "top"]
+  #     # [3, "bottom"]
+  #     # ...
+  #     # [9, "top"]
+  #     # [9, "bottom"]
+  #
+  # The method used against each enumerable object is `each_entry` instead of
+  # `each` so that the product of N enumerable objects yields an array of exactly
+  # N elements in each iteration.
+  #
+  # When no enumerator is given, it calls a given block once yielding an empty
+  # argument list.
+  #
+  # This type of objects can be created by Enumerator.product.
+  #
+  class Product[unchecked out Elem] < Enumerator[Elem, Product[Elem]]
+    # <!--
+    #   rdoc-file=enumerator.c
+    #   - Enumerator::Product.new(*enums) -> enum
+    # -->
+    # Generates a new enumerator object that generates a Cartesian product of given
+    # enumerable objects.
+    #
+    #     e = Enumerator::Product.new(1..3, [4, 5])
+    #     e.to_a #=> [[1, 4], [1, 5], [2, 4], [2, 5], [3, 4], [3, 5]]
+    #     e.size #=> 6
+    #
+    def initialize: (*_EachEntry[Elem]) -> void
+
+    include Enumerable[Elem]
+
+    public
+
+    # <!--
+    #   rdoc-file=enumerator.c
+    #   - obj.each { |...| ... } -> obj
+    #   - obj.each -> enumerator
+    # -->
+    # Iterates over the elements of the first enumerable by calling the "each_entry"
+    # method on it with the given arguments, then proceeds to the following
+    # enumerables in sequence until all of the enumerables are exhausted.
+    #
+    # If no block is given, returns an enumerator.  Otherwise, returns self.
+    #
+    def each: () { (Array[Elem]) -> void } -> self
+
+    # <!--
+    #   rdoc-file=enumerator.c
+    #   - obj.inspect -> string
+    # -->
+    # Returns a printable version of the product enumerator.
+    #
+    def inspect: () -> String
+
+    # <!--
+    #   rdoc-file=enumerator.c
+    #   - obj.rewind -> obj
+    # -->
+    # Rewinds the product enumerator by calling the "rewind" method on each
+    # enumerable in reverse order.  Each call is performed only if the enumerable
+    # responds to the method.
+    #
+    def rewind: () -> self
+
+    # <!--
+    #   rdoc-file=enumerator.c
+    #   - obj.size -> int, Float::INFINITY or nil
+    # -->
+    # Returns the total size of the enumerator product calculated by multiplying the
+    # sizes of enumerables in the product.  If any of the enumerables reports its
+    # size as nil or Float::INFINITY, that value is returned as the size.
+    #
+    def size: () -> (Integer | Float | nil)
+
+    private
+
+    def initialize_copy: (Product[Elem]) -> void
+  end
+end