Gecko [ beriskala.com ]

Name	Size	Permission	Date
enumerator	[ DIR ]	drwxr-xr-x	2026-05-05 23:08
io	[ DIR ]	drwxr-xr-x	2026-05-05 23:08
object_space	[ DIR ]	drwxr-xr-x	2026-05-05 23:08
rbs	[ DIR ]	drwxr-xr-x	2026-04-07 16:50
rubygems	[ DIR ]	drwxr-xr-x	2026-05-05 23:08
array.rbs	137.79 KB	-rw-r--r--	2026-04-07 16:50
basic_object.rbs	12.57 KB	-rw-r--r--	2026-04-07 16:50
binding.rbs	4.11 KB	-rw-r--r--	2026-04-07 16:50
builtin.rbs	7.29 KB	-rw-r--r--	2026-04-07 16:50
class.rbs	6.72 KB	-rw-r--r--	2026-04-07 16:51
comparable.rbs	5.63 KB	-rw-r--r--	2026-04-07 16:50
complex.rbs	25.1 KB	-rw-r--r--	2026-04-07 16:50
constants.rbs	1.89 KB	-rw-r--r--	2026-04-07 16:50
data.rbs	12.7 KB	-rw-r--r--	2026-04-07 16:50
dir.rbs	31.49 KB	-rw-r--r--	2026-04-07 16:50
encoding.rbs	46.41 KB	-rw-r--r--	2026-04-07 16:50
enumerable.rbs	85.7 KB	-rw-r--r--	2026-04-07 16:50
enumerator.rbs	19.37 KB	-rw-r--r--	2026-04-07 16:50
env.rbs	159 B	-rw-r--r--	2026-04-07 16:51
errno.rbs	10.71 KB	-rw-r--r--	2026-04-07 16:50
errors.rbs	18.81 KB	-rw-r--r--	2026-04-07 16:51
exception.rbs	11.58 KB	-rw-r--r--	2026-04-07 16:50
false_class.rbs	2.1 KB	-rw-r--r--	2026-04-07 16:50
fiber.rbs	19.11 KB	-rw-r--r--	2026-04-07 16:50
fiber_error.rbs	374 B	-rw-r--r--	2026-04-07 16:50
file.rbs	92.57 KB	-rw-r--r--	2026-04-07 16:50
file_test.rbs	10.2 KB	-rw-r--r--	2026-04-07 16:50
float.rbs	32.78 KB	-rw-r--r--	2026-04-07 16:50
gc.rbs	20.88 KB	-rw-r--r--	2026-04-07 16:50
global_variables.rbs	5.64 KB	-rw-r--r--	2026-04-07 16:50
hash.rbs	58.89 KB	-rw-r--r--	2026-04-07 16:50
integer.rbs	40.51 KB	-rw-r--r--	2026-04-07 16:51
io.rbs	112.18 KB	-rw-r--r--	2026-04-07 16:50
kernel.rbs	104.83 KB	-rw-r--r--	2026-04-07 16:50
marshal.rbs	7.07 KB	-rw-r--r--	2026-04-07 16:50
match_data.rbs	19.65 KB	-rw-r--r--	2026-04-07 16:50
math.rbs	20.28 KB	-rw-r--r--	2026-04-07 16:50
method.rbs	11.59 KB	-rw-r--r--	2026-04-07 16:50
module.rbs	54.2 KB	-rw-r--r--	2026-04-07 16:50
nil_class.rbs	3.97 KB	-rw-r--r--	2026-04-07 16:51
numeric.rbs	23.7 KB	-rw-r--r--	2026-04-07 16:50
object.rbs	5.03 KB	-rw-r--r--	2026-04-07 16:50
object_space.rbs	6.14 KB	-rw-r--r--	2026-04-07 16:51
proc.rbs	29.73 KB	-rw-r--r--	2026-04-07 16:50
process.rbs	77.15 KB	-rw-r--r--	2026-04-07 16:50
ractor.rbs	32.03 KB	-rw-r--r--	2026-04-07 16:50
random.rbs	7.85 KB	-rw-r--r--	2026-04-07 16:51
range.rbs	34.28 KB	-rw-r--r--	2026-04-07 16:50
rational.rbs	14.96 KB	-rw-r--r--	2026-04-07 16:50
rb_config.rbs	2.9 KB	-rw-r--r--	2026-04-07 16:50
refinement.rbs	1.42 KB	-rw-r--r--	2026-04-07 16:51
regexp.rbs	66.72 KB	-rw-r--r--	2026-04-07 16:50
ruby_vm.rbs	23.15 KB	-rw-r--r--	2026-04-07 16:51
set.rbs	19.36 KB	-rw-r--r--	2026-04-07 16:50
signal.rbs	3.59 KB	-rw-r--r--	2026-04-07 16:50
string.rbs	119.45 KB	-rw-r--r--	2026-04-07 16:51
struct.rbs	22.73 KB	-rw-r--r--	2026-04-07 16:51
symbol.rbs	12.96 KB	-rw-r--r--	2026-04-07 16:51
thread.rbs	51.52 KB	-rw-r--r--	2026-04-07 16:51
thread_group.rbs	2.35 KB	-rw-r--r--	2026-04-07 16:50
time.rbs	59.56 KB	-rw-r--r--	2026-04-07 16:50
trace_point.rbs	12.85 KB	-rw-r--r--	2026-04-07 16:50
true_class.rbs	2.23 KB	-rw-r--r--	2026-04-07 16:50
unbound_method.rbs	9.97 KB	-rw-r--r--	2026-04-07 16:50
warning.rbs	2.56 KB	-rw-r--r--	2026-04-07 16:50

Rename

# 
# An Array object is an ordered, integer-indexed collection of objects, called
# *elements*; the object represents an [array data
# structure](https://en.wikipedia.org/wiki/Array_(data_structure)).
#
# An element may be any object (even another array); elements may be any mixture
# of objects of different types.
#
# Important data structures that use arrays include:
#
# *   [Coordinate vector](https://en.wikipedia.org/wiki/Coordinate_vector).
# *   [Matrix](https://en.wikipedia.org/wiki/Matrix_(mathematics)).
# *   [Heap](https://en.wikipedia.org/wiki/Heap_(data_structure)).
# *   [Hash table](https://en.wikipedia.org/wiki/Hash_table).
# *   [Deque (double-ended
#     queue)](https://en.wikipedia.org/wiki/Double-ended_queue).
# *   [Queue](https://en.wikipedia.org/wiki/Queue_(abstract_data_type)).
# *   [Stack](https://en.wikipedia.org/wiki/Stack_(abstract_data_type)).
#
# There are also array-like data structures:
#
# *   [Associative array](https://en.wikipedia.org/wiki/Associative_array) (see
#     Hash).
# *   [Directory](https://en.wikipedia.org/wiki/Directory_(computing)) (see
#     Dir).
# *   [Environment](https://en.wikipedia.org/wiki/Environment_variable) (see
#     ENV).
# *   [Set](https://en.wikipedia.org/wiki/Set_(abstract_data_type)) (see Set).
# *   [String](https://en.wikipedia.org/wiki/String_(computer_science)) (see
#     String).
#
# ## Array Indexes
#
# Array indexing starts at 0, as in C or Java.
#
# A non-negative index is an offset from the first element:
#
# *   Index 0 indicates the first element.
# *   Index 1 indicates the second element.
# *   ...
#
# A negative index is an offset, backwards, from the end of the array:
#
# *   Index -1 indicates the last element.
# *   Index -2 indicates the next-to-last element.
# *   ...
#
# ### In-Range and Out-of-Range Indexes
#
# A non-negative index is *in range* if and only if it is smaller than the size
# of the array.  For a 3-element array:
#
# *   Indexes 0 through 2 are in range.
# *   Index 3 is out of range.
#
# A negative index is *in range* if and only if its absolute value is not larger
# than the size of the array.  For a 3-element array:
#
# *   Indexes -1 through -3 are in range.
# *   Index -4 is out of range.
#
# ### Effective Index
#
# Although the effective index into an array is always an integer, some methods
# (both within class Array and elsewhere) accept one or more non-integer
# arguments that are [integer-convertible
# objects](rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects).
#
# ## Creating Arrays
#
# You can create an Array object explicitly with:
#
# *   An [array literal](rdoc-ref:syntax/literals.rdoc@Array+Literals):
#
#         [1, 'one', :one, [2, 'two', :two]]
#
# *   A [%w or %W string-array
#     Literal](rdoc-ref:syntax/literals.rdoc@25w+and+-25W-3A+String-Array+Litera
#     ls):
#
#         %w[foo bar baz] # => ["foo", "bar", "baz"]
#         %w[1 % *]       # => ["1", "%", "*"]
#
# *   A [%i or %I symbol-array
#     Literal](rdoc-ref:syntax/literals.rdoc@25i+and+-25I-3A+Symbol-Array+Litera
#     ls):
#
#         %i[foo bar baz] # => [:foo, :bar, :baz]
#         %i[1 % *]       # => [:"1", :%, :*]
#
# *   Method Kernel#Array:
#
#         Array(["a", "b"])             # => ["a", "b"]
#         Array(1..5)                   # => [1, 2, 3, 4, 5]
#         Array(key: :value)            # => [[:key, :value]]
#         Array(nil)                    # => []
#         Array(1)                      # => [1]
#         Array({:a => "a", :b => "b"}) # => [[:a, "a"], [:b, "b"]]
#
# *   Method Array.new:
#
#         Array.new               # => []
#         Array.new(3)            # => [nil, nil, nil]
#         Array.new(4) {Hash.new} # => [{}, {}, {}, {}]
#         Array.new(3, true)      # => [true, true, true]
#
#     Note that the last example above populates the array with references to
#     the same object. This is recommended only in cases where that object is a
#     natively immutable object such as a symbol, a numeric, `nil`, `true`, or
#     `false`.
#
#     Another way to create an array with various objects, using a block; this
#     usage is safe for mutable objects such as hashes, strings or other arrays:
#
#         Array.new(4) {|i| i.to_s } # => ["0", "1", "2", "3"]
#
#     Here is a way to create a multi-dimensional array:
#
#         Array.new(3) {Array.new(3)}
#         # => [[nil, nil, nil], [nil, nil, nil], [nil, nil, nil]]
#
# A number of Ruby methods, both in the core and in the standard library,
# provide instance method `to_a`, which converts an object to an array.
#
# *   ARGF#to_a
# *   Array#to_a
# *   Enumerable#to_a
# *   Hash#to_a
# *   MatchData#to_a
# *   NilClass#to_a
# *   OptionParser#to_a
# *   Range#to_a
# *   Set#to_a
# *   Struct#to_a
# *   Time#to_a
# *   Benchmark::Tms#to_a
# *   CSV::Table#to_a
# *   Enumerator::Lazy#to_a
# *   Gem::List#to_a
# *   Gem::NameTuple#to_a
# *   Gem::Platform#to_a
# *   Gem::RequestSet::Lockfile::Tokenizer#to_a
# *   Gem::SourceList#to_a
# *   OpenSSL::X509::Extension#to_a
# *   OpenSSL::X509::Name#to_a
# *   Racc::ISet#to_a
# *   Rinda::RingFinger#to_a
# *   Ripper::Lexer::Elem#to_a
# *   RubyVM::InstructionSequence#to_a
# *   YAML::DBM#to_a
#
# ## Example Usage
#
# In addition to the methods it mixes in through the Enumerable module, the
# `Array` class has proprietary methods for accessing, searching and otherwise
# manipulating arrays.
#
# Some of the more common ones are illustrated below.
#
# ## Accessing Elements
#
# Elements in an array can be retrieved using the Array#[] method.  It can take
# a single integer argument (a numeric index), a pair of arguments (start and
# length) or a range. Negative indices start counting from the end, with -1
# being the last element.
#
#     arr = [1, 2, 3, 4, 5, 6]
#     arr[2]    #=> 3
#     arr[100]  #=> nil
#     arr[-3]   #=> 4
#     arr[2, 3] #=> [3, 4, 5]
#     arr[1..4] #=> [2, 3, 4, 5]
#     arr[1..-3] #=> [2, 3, 4]
#
# Another way to access a particular array element is by using the #at method
#
#     arr.at(0) #=> 1
#
# The #slice method works in an identical manner to Array#[].
#
# To raise an error for indices outside of the array bounds or else to provide a
# default value when that happens, you can use #fetch.
#
#     arr = ['a', 'b', 'c', 'd', 'e', 'f']
#     arr.fetch(100) #=> IndexError: index 100 outside of array bounds: -6...6
#     arr.fetch(100, "oops") #=> "oops"
#
# The special methods #first and #last will return the first and last elements
# of an array, respectively.
#
#     arr.first #=> 1
#     arr.last  #=> 6
#
# To return the first `n` elements of an array, use #take
#
#     arr.take(3) #=> [1, 2, 3]
#
# #drop does the opposite of #take, by returning the elements after `n` elements
# have been dropped:
#
#     arr.drop(3) #=> [4, 5, 6]
#
# ## Obtaining Information about an `Array`
#
# Arrays keep track of their own length at all times.  To query an array about
# the number of elements it contains, use #length, #count or #size.
#
#     browsers = ['Chrome', 'Firefox', 'Safari', 'Opera', 'IE']
#     browsers.length #=> 5
#     browsers.count #=> 5
#
# To check whether an array contains any elements at all
#
#     browsers.empty? #=> false
#
# To check whether a particular item is included in the array
#
#     browsers.include?('Konqueror') #=> false
#
# ## Adding Items to Arrays
#
# Items can be added to the end of an array by using either #push or #<<
#
#     arr = [1, 2, 3, 4]
#     arr.push(5) #=> [1, 2, 3, 4, 5]
#     arr << 6    #=> [1, 2, 3, 4, 5, 6]
#
# #unshift will add a new item to the beginning of an array.
#
#     arr.unshift(0) #=> [0, 1, 2, 3, 4, 5, 6]
#
# With #insert you can add a new element to an array at any position.
#
#     arr.insert(3, 'apple')  #=> [0, 1, 2, 'apple', 3, 4, 5, 6]
#
# Using the #insert method, you can also insert multiple values at once:
#
#     arr.insert(3, 'orange', 'pear', 'grapefruit')
#     #=> [0, 1, 2, "orange", "pear", "grapefruit", "apple", 3, 4, 5, 6]
#
# ## Removing Items from an `Array`
#
# The method #pop removes the last element in an array and returns it:
#
#     arr =  [1, 2, 3, 4, 5, 6]
#     arr.pop #=> 6
#     arr #=> [1, 2, 3, 4, 5]
#
# To retrieve and at the same time remove the first item, use #shift:
#
#     arr.shift #=> 1
#     arr #=> [2, 3, 4, 5]
#
# To delete an element at a particular index:
#
#     arr.delete_at(2) #=> 4
#     arr #=> [2, 3, 5]
#
# To delete a particular element anywhere in an array, use #delete:
#
#     arr = [1, 2, 2, 3]
#     arr.delete(2) #=> 2
#     arr #=> [1,3]
#
# A useful method if you need to remove `nil` values from an array is #compact:
#
#     arr = ['foo', 0, nil, 'bar', 7, 'baz', nil]
#     arr.compact  #=> ['foo', 0, 'bar', 7, 'baz']
#     arr          #=> ['foo', 0, nil, 'bar', 7, 'baz', nil]
#     arr.compact! #=> ['foo', 0, 'bar', 7, 'baz']
#     arr          #=> ['foo', 0, 'bar', 7, 'baz']
#
# Another common need is to remove duplicate elements from an array.
#
# It has the non-destructive #uniq, and destructive method #uniq!
#
#     arr = [2, 5, 6, 556, 6, 6, 8, 9, 0, 123, 556]
#     arr.uniq #=> [2, 5, 6, 556, 8, 9, 0, 123]
#
# ## Iterating over Arrays
#
# Like all classes that include the Enumerable module, `Array` has an each
# method, which defines what elements should be iterated over and how.  In case
# of Array's #each, all elements in the `Array` instance are yielded to the
# supplied block in sequence.
#
# Note that this operation leaves the array unchanged.
#
#     arr = [1, 2, 3, 4, 5]
#     arr.each {|a| print a -= 10, " "}
#     # prints: -9 -8 -7 -6 -5
#     #=> [1, 2, 3, 4, 5]
#
# Another sometimes useful iterator is #reverse_each which will iterate over the
# elements in the array in reverse order.
#
#     words = %w[first second third fourth fifth sixth]
#     str = ""
#     words.reverse_each {|word| str += "#{word} "}
#     p str #=> "sixth fifth fourth third second first "
#
# The #map method can be used to create a new array based on the original array,
# but with the values modified by the supplied block:
#
#     arr.map {|a| 2*a}     #=> [2, 4, 6, 8, 10]
#     arr                   #=> [1, 2, 3, 4, 5]
#     arr.map! {|a| a**2}   #=> [1, 4, 9, 16, 25]
#     arr                   #=> [1, 4, 9, 16, 25]
#
# ## Selecting Items from an `Array`
#
# Elements can be selected from an array according to criteria defined in a
# block.  The selection can happen in a destructive or a non-destructive manner.
#  While the destructive operations will modify the array they were called on,
# the non-destructive methods usually return a new array with the selected
# elements, but leave the original array unchanged.
#
# ### Non-destructive Selection
#
#     arr = [1, 2, 3, 4, 5, 6]
#     arr.select {|a| a > 3}       #=> [4, 5, 6]
#     arr.reject {|a| a < 3}       #=> [3, 4, 5, 6]
#     arr.drop_while {|a| a < 4}   #=> [4, 5, 6]
#     arr                          #=> [1, 2, 3, 4, 5, 6]
#
# ### Destructive Selection
#
# #select! and #reject! are the corresponding destructive methods to #select and
# #reject
#
# Similar to #select vs. #reject, #delete_if and #keep_if have the exact
# opposite result when supplied with the same block:
#
#     arr.delete_if {|a| a < 4}   #=> [4, 5, 6]
#     arr                         #=> [4, 5, 6]
#
#     arr = [1, 2, 3, 4, 5, 6]
#     arr.keep_if {|a| a < 4}   #=> [1, 2, 3]
#     arr                       #=> [1, 2, 3]
#
# ## What's Here
#
# First, what's elsewhere. Class `Array`:
#
# *   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.
#
# Here, class `Array` provides methods that are useful for:
#
# *   [Creating an Array](rdoc-ref:Array@Methods+for+Creating+an+Array)
# *   [Querying](rdoc-ref:Array@Methods+for+Querying)
# *   [Comparing](rdoc-ref:Array@Methods+for+Comparing)
# *   [Fetching](rdoc-ref:Array@Methods+for+Fetching)
# *   [Assigning](rdoc-ref:Array@Methods+for+Assigning)
# *   [Deleting](rdoc-ref:Array@Methods+for+Deleting)
# *   [Combining](rdoc-ref:Array@Methods+for+Combining)
# *   [Iterating](rdoc-ref:Array@Methods+for+Iterating)
# *   [Converting](rdoc-ref:Array@Methods+for+Converting)
# *   [And more....](rdoc-ref:Array@Other+Methods)
#
# ### Methods for Creating an `Array`
#
# *   ::[]: Returns a new array populated with given objects.
# *   ::new: Returns a new array.
# *   ::try_convert: Returns a new array created from a given object.
#
# See also [Creating Arrays](rdoc-ref:Array@Creating+Arrays).
#
# ### Methods for Querying
#
# *   #all?: Returns whether all elements meet a given criterion.
# *   #any?: Returns whether any element meets a given criterion.
# *   #count: Returns the count of elements that meet a given criterion.
# *   #empty?: Returns whether there are no elements.
# *   #find_index (aliased as #index): Returns the index of the first element
#     that meets a given criterion.
# *   #hash: Returns the integer hash code.
# *   #include?: Returns whether any element `==` a given object.
# *   #length (aliased as #size): Returns the count of elements.
# *   #none?: Returns whether no element `==` a given object.
# *   #one?: Returns whether exactly one element `==` a given object.
# *   #rindex: Returns the index of the last element that meets a given
#     criterion.
#
# ### Methods for Comparing
#
# *   #<=>: Returns -1, 0, or 1, as `self` is less than, equal to, or greater
#     than a given object.
# *   #==: Returns whether each element in `self` is `==` to the corresponding
#     element in a given object.
# *   #eql?: Returns whether each element in `self` is `eql?` to the
#     corresponding element in a given object.
#
# ### Methods for Fetching
#
# These methods do not modify `self`.
#
# *   #[] (aliased as #slice): Returns consecutive elements as determined by a
#     given argument.
# *   #assoc: Returns the first element that is an array whose first element
#     `==` a given object.
# *   #at: Returns the element at a given offset.
# *   #bsearch: Returns an element selected via a binary search as determined by
#     a given block.
# *   #bsearch_index: Returns the index of an element selected via a binary
#     search as determined by a given block.
# *   #compact: Returns an array containing all non-`nil` elements.
# *   #dig: Returns the object in nested objects that is specified by a given
#     index and additional arguments.
# *   #drop: Returns trailing elements as determined by a given index.
# *   #drop_while: Returns trailing elements as determined by a given block.
# *   #fetch: Returns the element at a given offset.
# *   #fetch_values: Returns elements at given offsets.
# *   #first: Returns one or more leading elements.
# *   #last: Returns one or more trailing elements.
# *   #max: Returns one or more maximum-valued elements, as determined by `#<=>`
#     or a given block.
# *   #min: Returns one or more minimum-valued elements, as determined by `#<=>`
#     or a given block.
# *   #minmax: Returns the minimum-valued and maximum-valued elements, as
#     determined by `#<=>` or a given block.
# *   #rassoc: Returns the first element that is an array whose second element
#     `==` a given object.
# *   #reject: Returns an array containing elements not rejected by a given
#     block.
# *   #reverse: Returns all elements in reverse order.
# *   #rotate: Returns all elements with some rotated from one end to the other.
# *   #sample: Returns one or more random elements.
# *   #select (aliased as #filter): Returns an array containing elements
#     selected by a given block.
# *   #shuffle: Returns elements in a random order.
# *   #sort: Returns all elements in an order determined by `#<=>` or a given
#     block.
# *   #take: Returns leading elements as determined by a given index.
# *   #take_while: Returns leading elements as determined by a given block.
# *   #uniq: Returns an array containing non-duplicate elements.
# *   #values_at: Returns the elements at given offsets.
#
# ### Methods for Assigning
#
# These methods add, replace, or reorder elements in `self`.
#
# *   #<<: Appends an element.
# *   #[]=: Assigns specified elements with a given object.
# *   #concat: Appends all elements from given arrays.
# *   #fill: Replaces specified elements with specified objects.
# *   #flatten!: Replaces each nested array in `self` with the elements from
#     that array.
# *   #initialize_copy (aliased as #replace): Replaces the content of `self`
#     with the content of a given array.
# *   #insert: Inserts given objects at a given offset; does not replace
#     elements.
# *   #push (aliased as #append): Appends elements.
# *   #reverse!: Replaces `self` with its elements reversed.
# *   #rotate!: Replaces `self` with its elements rotated.
# *   #shuffle!: Replaces `self` with its elements in random order.
# *   #sort!: Replaces `self` with its elements sorted, as determined by `#<=>`
#     or a given block.
# *   #sort_by!: Replaces `self` with its elements sorted, as determined by a
#     given block.
# *   #unshift (aliased as #prepend): Prepends leading elements.
#
# ### Methods for Deleting
#
# Each of these methods removes elements from `self`:
#
# *   #clear: Removes all elements.
# *   #compact!: Removes all `nil` elements.
# *   #delete: Removes elements equal to a given object.
# *   #delete_at: Removes the element at a given offset.
# *   #delete_if: Removes elements specified by a given block.
# *   #keep_if: Removes elements not specified by a given block.
# *   #pop: Removes and returns the last element.
# *   #reject!: Removes elements specified by a given block.
# *   #select! (aliased as #filter!): Removes elements not specified by a given
#     block.
# *   #shift:  Removes and returns the first element.
# *   #slice!: Removes and returns a sequence of elements.
# *   #uniq!: Removes duplicates.
#
# ### Methods for Combining
#
# *   #&: Returns an array containing elements found both in `self` and a given
#     array.
# *   #+: Returns an array containing all elements of `self` followed by all
#     elements of a given array.
# *   #-: Returns an array containing all elements of `self` that are not found
#     in a given array.
# *   #|: Returns an array containing all element of `self` and all elements of
#     a given array, duplicates removed.
# *   #difference: Returns an array containing all elements of `self` that are
#     not found in any of the given arrays..
# *   #intersection: Returns an array containing elements found both in `self`
#     and in each given array.
# *   #product: Returns or yields all combinations of elements from `self` and
#     given arrays.
# *   #reverse: Returns an array containing all elements of `self` in reverse
#     order.
# *   #union: Returns an array containing all elements of `self` and all
#     elements of given arrays, duplicates removed.
#
# ### Methods for Iterating
#
# *   #combination: Calls a given block with combinations of elements of `self`;
#     a combination does not use the same element more than once.
# *   #cycle: Calls a given block with each element, then does so again, for a
#     specified number of times, or forever.
# *   #each: Passes each element to a given block.
# *   #each_index: Passes each element index to a given block.
# *   #permutation: Calls a given block with permutations of elements of `self`;
#     a permutation does not use the same element more than once.
# *   #repeated_combination: Calls a given block with combinations of elements
#     of `self`; a combination may use the same element more than once.
# *   #repeated_permutation: Calls a given block with permutations of elements
#     of `self`; a permutation may use the same element more than once.
# *   #reverse_each:  Passes each element, in reverse order, to a given block.
#
# ### Methods for Converting
#
# *   #collect (aliased as #map): Returns an array containing the block
#     return-value for each element.
# *   #collect! (aliased as #map!): Replaces each element with a block
#     return-value.
# *   #flatten: Returns an array that is a recursive flattening of `self`.
# *   #inspect (aliased as #to_s): Returns a new String containing the elements.
# *   #join: Returns a newsString containing the elements joined by the field
#     separator.
# *   #to_a: Returns `self` or a new array containing all elements.
# *   #to_ary: Returns `self`.
# *   #to_h: Returns a new hash formed from the elements.
# *   #transpose: Transposes `self`, which must be an array of arrays.
# *   #zip: Returns a new array of arrays containing `self` and given arrays.
#
# ### Other Methods
#
# *   #*: Returns one of the following:
#
#     *   With integer argument `n`, a new array that is the concatenation of
#         `n` copies of `self`.
#     *   With string argument `field_separator`, a new string that is
#         equivalent to `join(field_separator)`.
#
# *   #pack: Packs the elements into a binary sequence.
# *   #sum: Returns a sum of elements according to either `+` or a given block.
#
%a{annotate:rdoc:source:from=array.c}
class Array[unchecked out Elem] < Object
  include Enumerable[Elem]

# 
  # Returns a new array.
  #
  # With no block and no argument given, returns a new empty array:
  #
  #     Array.new # => []
  #
  # With no block and array argument given, returns a new array with the same
  # elements:
  #
  #     Array.new([:foo, 'bar', 2]) # => [:foo, "bar", 2]
  #
  # With no block and integer argument given, returns a new array containing that
  # many instances of the given `default_value`:
  #
  #     Array.new(0)    # => []
  #     Array.new(3)    # => [nil, nil, nil]
  #     Array.new(2, 3) # => [3, 3]
  #
  # With a block given, returns an array of the given `size`; calls the block with
  # each `index` in the range `(0...size)`; the element at that `index` in the
  # returned array is the blocks return value:
  #
  #     Array.new(3)  {|index| "Element #{index}" } # => ["Element 0", "Element 1", "Element 2"]
  #
  # A common pitfall for new Rubyists is providing an expression as
  # `default_value`:
  #
  #     array = Array.new(2, {})
  #     array # => [{}, {}]
  #     array[0][:a] = 1
  #     array # => [{a: 1}, {a: 1}], as array[0] and array[1] are same object
  #
  # If you want the elements of the array to be distinct, you should pass a block:
  #
  #     array = Array.new(2) { {} }
  #     array # => [{}, {}]
  #     array[0][:a] = 1
  #     array # => [{a: 1}, {}], as array[0] and array[1] are different objects
  #
  # Raises TypeError if the first argument is not either an array or an
  # [integer-convertible
  # object](rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects)).
  # Raises ArgumentError if the first argument is a negative integer.
  #
  # Related: see [Methods for Creating an
  # Array](rdoc-ref:Array@Methods+for+Creating+an+Array).
  #
  def initialize: () -> void
                | (::Array[Elem] ary) -> void
                | (int size, ?Elem val) -> void
                | (int size) { (::Integer index) -> Elem } -> void

# 
  # Returns a new array, populated with the given objects:
  #
  #     Array[1, 'a', /^A/]    # => [1, "a", /^A/]
  #     Array[]                # => []
  #     Array.[](1, 'a', /^A/) # => [1, "a", /^A/]
  #
  # Related: see [Methods for Creating an
  # Array](rdoc-ref:Array@Methods+for+Creating+an+Array).
  #
  def self.[]: [U] (*U) -> ::Array[U]

# 
  # Attempts to return an array, based on the given `object`.
  #
  # If `object` is an array, returns `object`.
  #
  # Otherwise if `object` responds to `:to_ary`. calls `object.to_ary`: if the
  # return value is an array or `nil`, returns that value; if not, raises
  # TypeError.
  #
  # Otherwise returns `nil`.
  #
  # Related: see [Methods for Creating an
  # Array](rdoc-ref:Array@Methods+for+Creating+an+Array).
  #
  def self.try_convert: [U] (untyped) -> ::Array[U]?

# 
  # Returns a new array containing the *intersection* of `self` and `other_array`;
  # that is, containing those elements found in both `self` and `other_array`:
  #
  #     [0, 1, 2, 3] & [1, 2] # => [1, 2]
  #
  # Omits duplicates:
  #
  #     [0, 1, 1, 0] & [0, 1] # => [0, 1]
  #
  # Preserves order from `self`:
  #
  #     [0, 1, 2] & [3, 2, 1, 0] # => [0, 1, 2]
  #
  # Identifies common elements using method `#eql?` (as defined in each element of
  # `self`).
  #
  # Related: see [Methods for Combining](rdoc-ref:Array@Methods+for+Combining).
  #
  def &: (::Array[untyped] | _ToAry[untyped]) -> ::Array[Elem]

# 
  # When non-negative integer argument `n` is given, returns a new array built by
  # concatenating `n` copies of `self`:
  #
  #     a = ['x', 'y']
  #     a * 3 # => ["x", "y", "x", "y", "x", "y"]
  #
  # When string argument `string_separator` is given, equivalent to
  # `self.join(string_separator)`:
  #
  #     [0, [0, 1], {foo: 0}] * ', ' # => "0, 0, 1, {foo: 0}"
  #
  def *: (string str) -> ::String
       | (int int) -> ::Array[Elem]

# 
  # Returns a new array containing all elements of `self` followed by all elements
  # of `other_array`:
  #
  #     a = [0, 1] + [2, 3]
  #     a # => [0, 1, 2, 3]
  #
  # Related: see [Methods for Combining](rdoc-ref:Array@Methods+for+Combining).
  #
  def +: [U] (_ToAry[U]) -> ::Array[Elem | U]

# 
  # Returns a new array containing only those elements of `self` that are not
  # found in `other_array`; the order from `self` is preserved:
  #
  #     [0, 1, 1, 2, 1, 1, 3, 1, 1] - [1]             # => [0, 2, 3]
  #     [0, 1, 1, 2, 1, 1, 3, 1, 1] - [3, 2, 0, :foo] # => [1, 1, 1, 1, 1, 1]
  #     [0, 1, 2] - [:foo]                            # => [0, 1, 2]
  #
  # Element are compared using method `#eql?` (as defined in each element of
  # `self`).
  #
  # Related: see [Methods for Combining](rdoc-ref:Array@Methods+for+Combining).
  #
  def -: (_ToAry[untyped]) -> ::Array[Elem]

# 
  # Appends `object` as the last element in `self`; returns `self`:
  #
  #     [:foo, 'bar', 2] << :baz # => [:foo, "bar", 2, :baz]
  #
  # Appends `object` as a single element, even if it is another array:
  #
  #     [:foo, 'bar', 2] << [3, 4] # => [:foo, "bar", 2, [3, 4]]
  #
  # Related: see [Methods for Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def <<: (Elem) -> self

# 
  # Returns -1, 0, or 1 as `self` is determined to be less than, equal to, or
  # greater than `other_array`.
  #
  # Iterates over each index `i` in `(0...self.size)`:
  #
  # *   Computes `result[i]` as `self[i] <=> other_array[i]`.
  # *   Immediately returns 1 if `result[i]` is 1:
  #
  #         [0, 1, 2] <=> [0, 0, 2] # => 1
  #
  # *   Immediately returns -1 if `result[i]` is -1:
  #
  #         [0, 1, 2] <=> [0, 2, 2] # => -1
  #
  # *   Continues if `result[i]` is 0.
  #
  # When every `result` is 0, returns `self.size <=> other_array.size` (see
  # Integer#<=>):
  #
  #     [0, 1, 2] <=> [0, 1]        # => 1
  #     [0, 1, 2] <=> [0, 1, 2]     # => 0
  #     [0, 1, 2] <=> [0, 1, 2, 3]  # => -1
  #
  # Note that when `other_array` is larger than `self`, its trailing elements do
  # not affect the result:
  #
  #     [0, 1, 2] <=> [0, 1, 2, -3] # => -1
  #     [0, 1, 2] <=> [0, 1, 2, 0]  # => -1
  #     [0, 1, 2] <=> [0, 1, 2, 3]  # => -1
  #
  # Related: see [Methods for Comparing](rdoc-ref:Array@Methods+for+Comparing).
  #
  def <=>: (untyped) -> ::Integer?

# 
  # Returns whether both:
  #
  # *   `self` and `other_array` are the same size.
  # *   Their corresponding elements are the same; that is, for each index `i` in
  #     `(0...self.size)`, `self[i] == other_array[i]`.
  #
  # Examples:
  #
  #     [:foo, 'bar', 2] == [:foo, 'bar', 2]   # => true
  #     [:foo, 'bar', 2] == [:foo, 'bar', 2.0] # => true
  #     [:foo, 'bar', 2] == [:foo, 'bar']      # => false # Different sizes.
  #     [:foo, 'bar', 2] == [:foo, 'bar', 3]   # => false # Different elements.
  #
  # This method is different from method Array#eql?, which compares elements using
  # `Object#eql?`.
  #
  # Related: see [Methods for Comparing](rdoc-ref:Array@Methods+for+Comparing).
  #
  def ==: (untyped other) -> bool

# 
  # Returns elements from `self`; does not modify `self`.
  #
  # In brief:
  #
  #     a = [:foo, 'bar', 2]
  #
  #     # Single argument index: returns one element.
  #     a[0]     # => :foo          # Zero-based index.
  #     a[-1]    # => 2             # Negative index counts backwards from end.
  #
  #     # Arguments start and length: returns an array.
  #     a[1, 2]  # => ["bar", 2]
  #     a[-2, 2] # => ["bar", 2]    # Negative start counts backwards from end.
  #
  #     # Single argument range: returns an array.
  #     a[0..1]  # => [:foo, "bar"]
  #     a[0..-2] # => [:foo, "bar"] # Negative range-begin counts backwards from end.
  #     a[-2..2] # => ["bar", 2]    # Negative range-end counts backwards from end.
  #
  # When a single integer argument `index` is given, returns the element at offset
  # `index`:
  #
  #     a = [:foo, 'bar', 2]
  #     a[0] # => :foo
  #     a[2] # => 2
  #     a # => [:foo, "bar", 2]
  #
  # If `index` is negative, counts backwards from the end of `self`:
  #
  #     a = [:foo, 'bar', 2]
  #     a[-1] # => 2
  #     a[-2] # => "bar"
  #
  # If `index` is out of range, returns `nil`.
  #
  # When two Integer arguments `start` and `length` are given, returns a new
  # `Array` of size `length` containing successive elements beginning at offset
  # `start`:
  #
  #     a = [:foo, 'bar', 2]
  #     a[0, 2] # => [:foo, "bar"]
  #     a[1, 2] # => ["bar", 2]
  #
  # If `start + length` is greater than `self.length`, returns all elements from
  # offset `start` to the end:
  #
  #     a = [:foo, 'bar', 2]
  #     a[0, 4] # => [:foo, "bar", 2]
  #     a[1, 3] # => ["bar", 2]
  #     a[2, 2] # => [2]
  #
  # If `start == self.size` and `length >= 0`, returns a new empty `Array`.
  #
  # If `length` is negative, returns `nil`.
  #
  # When a single Range argument `range` is given, treats `range.min` as `start`
  # above and `range.size` as `length` above:
  #
  #     a = [:foo, 'bar', 2]
  #     a[0..1] # => [:foo, "bar"]
  #     a[1..2] # => ["bar", 2]
  #
  # Special case: If `range.start == a.size`, returns a new empty `Array`.
  #
  # If `range.end` is negative, calculates the end index from the end:
  #
  #     a = [:foo, 'bar', 2]
  #     a[0..-1] # => [:foo, "bar", 2]
  #     a[0..-2] # => [:foo, "bar"]
  #     a[0..-3] # => [:foo]
  #
  # If `range.start` is negative, calculates the start index from the end:
  #
  #     a = [:foo, 'bar', 2]
  #     a[-1..2] # => [2]
  #     a[-2..2] # => ["bar", 2]
  #     a[-3..2] # => [:foo, "bar", 2]
  #
  # If `range.start` is larger than the array size, returns `nil`.
  #
  #     a = [:foo, 'bar', 2]
  #     a[4..1] # => nil
  #     a[4..0] # => nil
  #     a[4..-1] # => nil
  #
  # When a single Enumerator::ArithmeticSequence argument `aseq` is given, returns
  # an `Array` of elements corresponding to the indexes produced by the sequence.
  #
  #     a = ['--', 'data1', '--', 'data2', '--', 'data3']
  #     a[(1..).step(2)] # => ["data1", "data2", "data3"]
  #
  # Unlike slicing with range, if the start or the end of the arithmetic sequence
  # is larger than array size, throws RangeError.
  #
  #     a = ['--', 'data1', '--', 'data2', '--', 'data3']
  #     a[(1..11).step(2)]
  #     # RangeError (((1..11).step(2)) out of range)
  #     a[(7..).step(2)]
  #     # RangeError (((7..).step(2)) out of range)
  #
  # If given a single argument, and its type is not one of the listed, tries to
  # convert it to Integer, and raises if it is impossible:
  #
  #     a = [:foo, 'bar', 2]
  #     # Raises TypeError (no implicit conversion of Symbol into Integer):
  #     a[:foo]
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def []: %a{implicitly-returns-nil} (int index) -> Elem
        | (int start, int length) -> ::Array[Elem]?
        | (::Range[::Integer?] range) -> ::Array[Elem]?

# 
  # Assigns elements in `self`, based on the given `object`; returns `object`.
  #
  # In brief:
  #
  #     a_orig = [:foo, 'bar', 2]
  #
  #     # With argument index.
  #     a = a_orig.dup
  #     a[0] = 'foo' # => "foo"
  #     a # => ["foo", "bar", 2]
  #     a = a_orig.dup
  #     a[7] = 'foo' # => "foo"
  #     a # => [:foo, "bar", 2, nil, nil, nil, nil, "foo"]
  #
  #     # With arguments start and length.
  #     a = a_orig.dup
  #     a[0, 2] = 'foo' # => "foo"
  #     a # => ["foo", 2]
  #     a = a_orig.dup
  #     a[6, 50] = 'foo' # => "foo"
  #     a # => [:foo, "bar", 2, nil, nil, nil, "foo"]
  #
  #     # With argument range.
  #     a = a_orig.dup
  #     a[0..1] = 'foo' # => "foo"
  #     a # => ["foo", 2]
  #     a = a_orig.dup
  #     a[6..50] = 'foo' # => "foo"
  #     a # => [:foo, "bar", 2, nil, nil, nil, "foo"]
  #
  # When Integer argument `index` is given, assigns `object` to an element in
  # `self`.
  #
  # If `index` is non-negative, assigns `object` the element at offset `index`:
  #
  #     a = [:foo, 'bar', 2]
  #     a[0] = 'foo' # => "foo"
  #     a # => ["foo", "bar", 2]
  #
  # If `index` is greater than `self.length`, extends the array:
  #
  #     a = [:foo, 'bar', 2]
  #     a[7] = 'foo' # => "foo"
  #     a # => [:foo, "bar", 2, nil, nil, nil, nil, "foo"]
  #
  # If `index` is negative, counts backwards from the end of the array:
  #
  #     a = [:foo, 'bar', 2]
  #     a[-1] = 'two' # => "two"
  #     a # => [:foo, "bar", "two"]
  #
  # When Integer arguments `start` and `length` are given and `object` is not an
  # `Array`, removes `length - 1` elements beginning at offset `start`, and
  # assigns `object` at offset `start`:
  #
  #     a = [:foo, 'bar', 2]
  #     a[0, 2] = 'foo' # => "foo"
  #     a # => ["foo", 2]
  #
  # If `start` is negative, counts backwards from the end of the array:
  #
  #     a = [:foo, 'bar', 2]
  #     a[-2, 2] = 'foo' # => "foo"
  #     a # => [:foo, "foo"]
  #
  # If `start` is non-negative and outside the array (` >= self.size`), extends
  # the array with `nil`, assigns `object` at offset `start`, and ignores
  # `length`:
  #
  #     a = [:foo, 'bar', 2]
  #     a[6, 50] = 'foo' # => "foo"
  #     a # => [:foo, "bar", 2, nil, nil, nil, "foo"]
  #
  # If `length` is zero, shifts elements at and following offset `start` and
  # assigns `object` at offset `start`:
  #
  #     a = [:foo, 'bar', 2]
  #     a[1, 0] = 'foo' # => "foo"
  #     a # => [:foo, "foo", "bar", 2]
  #
  # If `length` is too large for the existing array, does not extend the array:
  #
  #     a = [:foo, 'bar', 2]
  #     a[1, 5] = 'foo' # => "foo"
  #     a # => [:foo, "foo"]
  #
  # When Range argument `range` is given and `object` is not an `Array`, removes
  # `length - 1` elements beginning at offset `start`, and assigns `object` at
  # offset `start`:
  #
  #     a = [:foo, 'bar', 2]
  #     a[0..1] = 'foo' # => "foo"
  #     a # => ["foo", 2]
  #
  # if `range.begin` is negative, counts backwards from the end of the array:
  #
  #     a = [:foo, 'bar', 2]
  #     a[-2..2] = 'foo' # => "foo"
  #     a # => [:foo, "foo"]
  #
  # If the array length is less than `range.begin`, extends the array with `nil`,
  # assigns `object` at offset `range.begin`, and ignores `length`:
  #
  #     a = [:foo, 'bar', 2]
  #     a[6..50] = 'foo' # => "foo"
  #     a # => [:foo, "bar", 2, nil, nil, nil, "foo"]
  #
  # If `range.end` is zero, shifts elements at and following offset `start` and
  # assigns `object` at offset `start`:
  #
  #     a = [:foo, 'bar', 2]
  #     a[1..0] = 'foo' # => "foo"
  #     a # => [:foo, "foo", "bar", 2]
  #
  # If `range.end` is negative, assigns `object` at offset `start`, retains
  # `range.end.abs -1` elements past that, and removes those beyond:
  #
  #     a = [:foo, 'bar', 2]
  #     a[1..-1] = 'foo' # => "foo"
  #     a # => [:foo, "foo"]
  #     a = [:foo, 'bar', 2]
  #     a[1..-2] = 'foo' # => "foo"
  #     a # => [:foo, "foo", 2]
  #     a = [:foo, 'bar', 2]
  #     a[1..-3] = 'foo' # => "foo"
  #     a # => [:foo, "foo", "bar", 2]
  #     a = [:foo, 'bar', 2]
  #
  # If `range.end` is too large for the existing array, replaces array elements,
  # but does not extend the array with `nil` values:
  #
  #     a = [:foo, 'bar', 2]
  #     a[1..5] = 'foo' # => "foo"
  #     a # => [:foo, "foo"]
  #
  # Related: see [Methods for Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def []=: (int index, Elem obj) -> Elem
         | (int start, int length, Elem obj) -> Elem
         | (int start, int length, ::Array[Elem]) -> ::Array[Elem]
         | (int start, int length, nil) -> nil
         | (::Range[::Integer?], Elem obj) -> Elem
         | (::Range[::Integer?], ::Array[Elem]) -> ::Array[Elem]
         | (::Range[::Integer?], nil) -> nil

# 
  # Returns whether for every element of `self`, a given criterion is satisfied.
  #
  # With no block and no argument, returns whether every element of `self` is
  # truthy:
  #
  #     [[], {}, '', 0, 0.0, Object.new].all? # => true  # All truthy objects.
  #     [[], {}, '', 0, 0.0, nil].all?        # => false # nil is not truthy.
  #     [[], {}, '', 0, 0.0, false].all?      # => false # false is not truthy.
  #
  # With argument `object` given, returns whether `object === ele` for every
  # element `ele` in `self`:
  #
  #     [0, 0, 0].all?(0)                    # => true
  #     [0, 1, 2].all?(1)                    # => false
  #     ['food', 'fool', 'foot'].all?(/foo/) # => true
  #     ['food', 'drink'].all?(/foo/)        # => false
  #
  # With a block given, calls the block with each element in `self`; returns
  # whether the block returns only truthy values:
  #
  #     [0, 1, 2].all? { |ele| ele < 3 } # => true
  #     [0, 1, 2].all? { |ele| ele < 2 } # => false
  #
  # With both a block and argument `object` given, ignores the block and uses
  # `object` as above.
  #
  # **Special case**: returns `true` if `self` is empty (regardless of any given
  # argument or block).
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  def all?: () -> bool
          | (_Pattern[Elem] pattern) -> bool
          | () { (Elem obj) -> boolish } -> bool

# 
  # Returns whether for any element of `self`, a given criterion is satisfied.
  #
  # With no block and no argument, returns whether any element of `self` is
  # truthy:
  #
  #     [nil, false, []].any? # => true  # Array object is truthy.
  #     [nil, false, {}].any? # => true  # Hash object is truthy.
  #     [nil, false, ''].any? # => true  # String object is truthy.
  #     [nil, false].any?     # => false # Nil and false are not truthy.
  #
  # With argument `object` given, returns whether `object === ele` for any element
  # `ele` in `self`:
  #
  #     [nil, false, 0].any?(0)          # => true
  #     [nil, false, 1].any?(0)          # => false
  #     [nil, false, 'food'].any?(/foo/) # => true
  #     [nil, false, 'food'].any?(/bar/) # => false
  #
  # With a block given, calls the block with each element in `self`; returns
  # whether the block returns any truthy value:
  #
  #     [0, 1, 2].any? {|ele| ele < 1 } # => true
  #     [0, 1, 2].any? {|ele| ele < 0 } # => false
  #
  # With both a block and argument `object` given, ignores the block and uses
  # `object` as above.
  #
  # **Special case**: returns `false` if `self` is empty (regardless of any given
  # argument or block).
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  alias any? all?

# 
  # Appends each argument in `objects` to `self`; returns `self`:
  #
  #     a = [:foo, 'bar', 2] # => [:foo, "bar", 2]
  #     a.push(:baz, :bat)   # => [:foo, "bar", 2, :baz, :bat]
  #
  # Appends each argument as a single element, even if it is another array:
  #
  #     a = [:foo, 'bar', 2]               # => [:foo, "bar", 2]
  #     a.push([:baz, :bat], [:bam, :bad]) # => [:foo, "bar", 2, [:baz, :bat], [:bam, :bad]]
  #
  # Related: see [Methods for Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  alias append push

# 
  # Returns the first element `ele` in `self` such that `ele` is an array and
  # `ele[0] == object`:
  #
  #     a = [{foo: 0}, [2, 4], [4, 5, 6], [4, 5]]
  #     a.assoc(4) # => [4, 5, 6]
  #
  # Returns `nil` if no such element is found.
  #
  # Related: Array#rassoc; see also [Methods for
  # Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def assoc: (untyped) -> ::Array[untyped]?

# 
  # Returns the element of `self` specified by the given `index` or `nil` if there
  # is no such element; `index` must be an [integer-convertible
  # object](rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects).
  #
  # For non-negative `index`, returns the element of `self` at offset `index`:
  #
  #     a = [:foo, 'bar', 2]
  #     a.at(0)   # => :foo
  #     a.at(2)   # => 2
  #     a.at(2.0) # => 2
  #
  # For negative `index`, counts backwards from the end of `self`:
  #
  #     a.at(-2) # => "bar"
  #
  # Related: Array#[]; see also [Methods for
  # Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def at: %a{implicitly-returns-nil} (int index) -> Elem

# 
  # Returns the element from `self` found by a binary search, or `nil` if the
  # search found no suitable element.
  #
  # See [Binary Searching](rdoc-ref:bsearch.rdoc).
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def bsearch: () -> ::Enumerator[Elem, Elem?]
             | () { (Elem) -> (true | false) } -> Elem?
             | () { (Elem) -> ::Integer } -> Elem?

# 
  # Returns the integer index of the element from `self` found by a binary search,
  # or `nil` if the search found no suitable element.
  #
  # See [Binary Searching](rdoc-ref:bsearch.rdoc).
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def bsearch_index: () { (Elem) -> (true | false) } -> ::Integer?
                   | () { (Elem) -> ::Integer } -> ::Integer?

# 
  # Removes all elements from `self`; returns `self`:
  #
  #     a = [:foo, 'bar', 2]
  #     a.clear # => []
  #
  # Related: see [Methods for Deleting](rdoc-ref:Array@Methods+for+Deleting).
  #
  def clear: () -> self

# 
  # With a block given, calls the block with each element of `self`; returns a new
  # array whose elements are the return values from the block:
  #
  #     a = [:foo, 'bar', 2]
  #     a1 = a.map {|element| element.class }
  #     a1 # => [Symbol, String, Integer]
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: #collect!; see also [Methods for
  # Converting](rdoc-ref:Array@Methods+for+Converting).
  #
  def collect: [U] () { (Elem item) -> U } -> ::Array[U]
             | () -> ::Enumerator[Elem, ::Array[untyped]]

# 
  # With a block given, calls the block with each element of `self` and replaces
  # the element with the block's return value; returns `self`:
  #
  #     a = [:foo, 'bar', 2]
  #     a.map! { |element| element.class } # => [Symbol, String, Integer]
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: #collect; see also [Methods for
  # Converting](rdoc-ref:Array@Methods+for+Converting).
  #
  def collect!: () { (Elem item) -> Elem } -> self
              | () -> ::Enumerator[Elem, self]

# 
  # When a block and a positive [integer-convertible
  # object](rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects)
  # argument `count` (`0 < count <= self.size`) are given, calls the block with
  # each combination of `self` of size `count`; returns `self`:
  #
  #     a = %w[a b c]                                   # => ["a", "b", "c"]
  #     a.combination(2) {|combination| p combination } # => ["a", "b", "c"]
  #
  # Output:
  #
  #     ["a", "b"]
  #     ["a", "c"]
  #     ["b", "c"]
  #
  # The order of the yielded combinations is not guaranteed.
  #
  # When `count` is zero, calls the block once with a new empty array:
  #
  #     a.combination(0) {|combination| p combination }
  #     [].combination(0) {|combination| p combination }
  #
  # Output:
  #
  #     []
  #     []
  #
  # When `count` is negative or larger than `self.size` and `self` is non-empty,
  # does not call the block:
  #
  #     a.combination(-1) {|combination| fail 'Cannot happen' } # => ["a", "b", "c"]
  #     a.combination(4)  {|combination| fail 'Cannot happen' } # => ["a", "b", "c"]
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: Array#permutation; see also [Methods for
  # Iterating](rdoc-ref:Array@Methods+for+Iterating).
  #
  def combination: (int n) { (::Array[Elem]) -> void } -> self
                 | (int n) -> ::Enumerator[::Array[Elem], self]

# 
  # Returns a new array containing only the non-`nil` elements from `self`;
  # element order is preserved:
  #
  #     a = [nil, 0, nil, false, nil, '', nil, [], nil, {}]
  #     a.compact # => [0, false, "", [], {}]
  #
  # Related: Array#compact!; see also [Methods for
  # Deleting](rdoc-ref:Array@Methods+for+Deleting).
  #
  def compact: () -> ::Array[Elem]

# 
  # Removes all `nil` elements from `self`; Returns `self` if any elements are
  # removed, `nil` otherwise:
  #
  #     a = [nil, 0, nil, false, nil, '', nil, [], nil, {}]
  #     a.compact! # => [0, false, "", [], {}]
  #     a          # => [0, false, "", [], {}]
  #     a.compact! # => nil
  #
  # Related: Array#compact; see also [Methods for
  # Deleting](rdoc-ref:Array@Methods+for+Deleting).
  #
  def compact!: () -> self?

# 
  # Adds to `self` all elements from each array in `other_arrays`; returns `self`:
  #
  #     a = [0, 1]
  #     a.concat(['two', 'three'], [:four, :five], a)
  #     # => [0, 1, "two", "three", :four, :five, 0, 1]
  #
  # Related: see [Methods for Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def concat: (*::Array[Elem] arrays) -> self

# 
  # Returns a count of specified elements.
  #
  # With no argument and no block, returns the count of all elements:
  #
  #     [0, :one, 'two', 3, 3.0].count # => 5
  #
  # With argument `object` given, returns the count of elements `==` to `object`:
  #
  #     [0, :one, 'two', 3, 3.0].count(3) # => 2
  #
  # With no argument and a block given, calls the block with each element; returns
  # the count of elements for which the block returns a truthy value:
  #
  #     [0, 1, 2, 3].count {|element| element > 1 } # => 2
  #
  # With argument `object` and a block given, issues a warning, ignores the block,
  # and returns the count of elements `==` to `object`.
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  def count: () -> ::Integer
           | (Elem obj) -> ::Integer
           | () { (Elem) -> boolish } -> ::Integer

# 
  # With a block given, may call the block, depending on the value of argument
  # `count`; `count` must be an [integer-convertible
  # object](rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects), or
  # `nil`.
  #
  # When `count` is positive, calls the block with each element, then does so
  # repeatedly, until it has done so `count` times; returns `nil`:
  #
  #     output = []
  #     [0, 1].cycle(2) {|element| output.push(element) } # => nil
  #     output # => [0, 1, 0, 1]
  #
  # When `count` is zero or negative, does not call the block:
  #
  #     [0, 1].cycle(0) {|element| fail 'Cannot happen' }  # => nil
  #     [0, 1].cycle(-1) {|element| fail 'Cannot happen' } # => nil
  #
  # When `count` is `nil`, cycles forever:
  #
  #     # Prints 0 and 1 forever.
  #     [0, 1].cycle {|element| puts element }
  #     [0, 1].cycle(nil) {|element| puts element }
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Iterating](rdoc-ref:Array@Methods+for+Iterating).
  #
  def cycle: (?int? n) { (Elem) -> void } -> nil
           | (?int? n) -> ::Enumerator[Elem, nil]

# 
  #
  def deconstruct: () -> self

# 
  # Removes zero or more elements from `self`.
  #
  # With no block given, removes from `self` each element `ele` such that `ele ==
  # object`; returns the last removed element:
  #
  #     a = [0, 1, 2, 2.0]
  #     a.delete(2) # => 2.0
  #     a           # => [0, 1]
  #
  # Returns `nil` if no elements removed:
  #
  #     a.delete(2) # => nil
  #
  # With a block given, removes from `self` each element `ele` such that `ele ==
  # object`.
  #
  # If any such elements are found, ignores the block and returns the last removed
  # element:
  #
  #     a = [0, 1, 2, 2.0]
  #     a.delete(2) {|element| fail 'Cannot happen' } # => 2.0
  #     a                                             # => [0, 1]
  #
  # If no such element is found, returns the block's return value:
  #
  #     a.delete(2) {|element| "Element #{element} not found." }
  #     # => "Element 2 not found."
  #
  # Related: see [Methods for Deleting](rdoc-ref:Array@Methods+for+Deleting).
  #
  def delete: (Elem obj) -> Elem?
            | [S, T] (S obj) { (S) -> T } -> (Elem | T)

# 
  # Removes the element of `self` at the given `index`, which must be an
  # [integer-convertible
  # object](rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects).
  #
  # When `index` is non-negative, deletes the element at offset `index`:
  #
  #     a = [:foo, 'bar', 2]
  #     a.delete_at(1) # => "bar"
  #     a # => [:foo, 2]
  #
  # When `index` is negative, counts backward from the end of the array:
  #
  #     a = [:foo, 'bar', 2]
  #     a.delete_at(-2) # => "bar"
  #     a # => [:foo, 2]
  #
  # When `index` is out of range, returns `nil`.
  #
  #     a = [:foo, 'bar', 2]
  #     a.delete_at(3)  # => nil
  #     a.delete_at(-4) # => nil
  #
  # Related: see [Methods for Deleting](rdoc-ref:Array@Methods+for+Deleting).
  #
  def delete_at: %a{implicitly-returns-nil} (int index) -> Elem

# 
  # With a block given, calls the block with each element of `self`; removes the
  # element if the block returns a truthy value; returns `self`:
  #
  #     a = [:foo, 'bar', 2, 'bat']
  #     a.delete_if {|element| element.to_s.start_with?('b') } # => [:foo, 2]
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Deleting](rdoc-ref:Array@Methods+for+Deleting).
  #
  def delete_if: () { (Elem item) -> boolish } -> self
               | () -> ::Enumerator[Elem, self]

# 
  # Returns a new array containing only those elements from `self` that are not
  # found in any of the given `other_arrays`; items are compared using `eql?`;
  # order from `self` is preserved:
  #
  #     [0, 1, 1, 2, 1, 1, 3, 1, 1].difference([1]) # => [0, 2, 3]
  #     [0, 1, 2, 3].difference([3, 0], [1, 3])     # => [2]
  #     [0, 1, 2].difference([4])                   # => [0, 1, 2]
  #     [0, 1, 2].difference                        # => [0, 1, 2]
  #
  # Returns a copy of `self` if no arguments are given.
  #
  # Related: Array#-; see also [Methods for
  # Combining](rdoc-ref:Array@Methods+for+Combining).
  #
  def difference: (*::Array[untyped] arrays) -> ::Array[Elem]

# 
  # Finds and returns the object in nested object specified by `index` and
  # `identifiers`; the nested objects may be instances of various classes. See
  # [Dig Methods](rdoc-ref:dig_methods.rdoc).
  #
  # Examples:
  #
  #     a = [:foo, [:bar, :baz, [:bat, :bam]]]
  #     a.dig(1) # => [:bar, :baz, [:bat, :bam]]
  #     a.dig(1, 2) # => [:bat, :bam]
  #     a.dig(1, 2, 0) # => :bat
  #     a.dig(1, 2, 3) # => nil
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def dig: (int idx) -> Elem?
         | (int idx, untyped, *untyped) -> untyped

# 
  # Returns a new array containing all but the first `count` element of `self`,
  # where `count` is a non-negative integer; does not modify `self`.
  #
  # Examples:
  #
  #     a = [0, 1, 2, 3, 4, 5]
  #     a.drop(0) # => [0, 1, 2, 3, 4, 5]
  #     a.drop(1) # => [1, 2, 3, 4, 5]
  #     a.drop(2) # => [2, 3, 4, 5]
  #     a.drop(9) # => []
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def drop: (int n) -> ::Array[Elem]

# 
  # With a block given, calls the block with each successive element of `self`;
  # stops if the block returns `false` or `nil`; returns a new array *omitting*
  # those elements for which the block returned a truthy value; does not modify
  # `self`:
  #
  #     a = [0, 1, 2, 3, 4, 5]
  #     a.drop_while {|element| element < 3 } # => [3, 4, 5]
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def drop_while: () { (Elem obj) -> boolish } -> ::Array[Elem]
                | () -> ::Enumerator[Elem, ::Array[Elem]]

# 
  # With a block given, iterates over the elements of `self`, passing each element
  # to the block; returns `self`:
  #
  #     a = [:foo, 'bar', 2]
  #     a.each {|element|  puts "#{element.class} #{element}" }
  #
  # Output:
  #
  #     Symbol foo
  #     String bar
  #     Integer 2
  #
  # Allows the array to be modified during iteration:
  #
  #     a = [:foo, 'bar', 2]
  #     a.each {|element| puts element; a.clear if element.to_s.start_with?('b') }
  #
  # Output:
  #
  #     foo
  #     bar
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Iterating](rdoc-ref:Array@Methods+for+Iterating).
  #
  def each: () -> ::Enumerator[Elem, self]
          | () { (Elem item) -> void } -> self

# 
  # With a block given, iterates over the elements of `self`, passing each *array
  # index* to the block; returns `self`:
  #
  #     a = [:foo, 'bar', 2]
  #     a.each_index {|index|  puts "#{index} #{a[index]}" }
  #
  # Output:
  #
  #     0 foo
  #     1 bar
  #     2 2
  #
  # Allows the array to be modified during iteration:
  #
  #     a = [:foo, 'bar', 2]
  #     a.each_index {|index| puts index; a.clear if index > 0 }
  #     a # => []
  #
  # Output:
  #
  #     0
  #     1
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Iterating](rdoc-ref:Array@Methods+for+Iterating).
  #
  def each_index: () { (::Integer index) -> void } -> self
                | () -> ::Enumerator[::Integer, self]

# 
  # Returns `true` if the count of elements in `self` is zero, `false` otherwise.
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  def empty?: () -> bool

# 
  # Returns `true` if `self` and `other_array` are the same size, and if, for each
  # index `i` in `self`, `self[i].eql?(other_array[i])`:
  #
  #     a0 = [:foo, 'bar', 2]
  #     a1 = [:foo, 'bar', 2]
  #     a1.eql?(a0) # => true
  #
  # Otherwise, returns `false`.
  #
  # This method is different from method Array#==, which compares using method
  # `Object#==`.
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  def eql?: (untyped other) -> bool

# 
  # Returns the element of `self` at offset `index` if `index` is in range;
  # `index` must be an [integer-convertible
  # object](rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects).
  #
  # With the single argument `index` and no block, returns the element at offset
  # `index`:
  #
  #     a = [:foo, 'bar', 2]
  #     a.fetch(1)   # => "bar"
  #     a.fetch(1.1) # => "bar"
  #
  # If `index` is negative, counts from the end of the array:
  #
  #     a = [:foo, 'bar', 2]
  #     a.fetch(-1) # => 2
  #     a.fetch(-2) # => "bar"
  #
  # With arguments `index` and `default_value` (which may be any object) and no
  # block, returns `default_value` if `index` is out-of-range:
  #
  #     a = [:foo, 'bar', 2]
  #     a.fetch(1, nil)  # => "bar"
  #     a.fetch(3, :foo) # => :foo
  #
  # With argument `index` and a block, returns the element at offset `index` if
  # index is in range (and the block is not called); otherwise calls the block
  # with index and returns its return value:
  #
  #     a = [:foo, 'bar', 2]
  #     a.fetch(1) {|index| raise 'Cannot happen' } # => "bar"
  #     a.fetch(50) {|index| "Value for #{index}" } # => "Value for 50"
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def fetch: (int index) -> Elem
           | [T] (int index, T default) -> (Elem | T)
           | [T] (int index) { (int index) -> T } -> (Elem | T)

# 
  # With no block given, returns a new array containing the elements of `self` at
  # the offsets specified by `indexes`. Each of the `indexes` must be an
  # [integer-convertible
  # object](rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects):
  #
  #     a = [:foo, :bar, :baz]
  #     a.fetch_values(2, 0)   # => [:baz, :foo]
  #     a.fetch_values(2.1, 0) # => [:baz, :foo]
  #     a.fetch_values         # => []
  #
  # For a negative index, counts backwards from the end of the array:
  #
  #     a.fetch_values(-2, -1) # [:bar, :baz]
  #
  # When no block is given, raises an exception if any index is out of range.
  #
  # With a block given, for each index:
  #
  # *   If the index is in range, uses an element of `self` (as above).
  # *   Otherwise, calls the block with the index and uses the block's return
  #     value.
  #
  # Example:
  #
  #     a = [:foo, :bar, :baz]
  #     a.fetch_values(1, 0, 42, 777) { |index| index.to_s }
  #     # => [:bar, :foo, "42", "777"]
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def fetch_values: (*int indexes) -> self

# 
  # Replaces selected elements in `self`; may add elements to `self`; always
  # returns `self` (never a new array).
  #
  # In brief:
  #
  #     # Non-negative start.
  #     ['a', 'b', 'c', 'd'].fill('-', 1, 2)          # => ["a", "-", "-", "d"]
  #     ['a', 'b', 'c', 'd'].fill(1, 2) {|e| e.to_s } # => ["a", "1", "2", "d"]
  #
  #     # Extends with specified values if necessary.
  #     ['a', 'b', 'c', 'd'].fill('-', 3, 2)          # => ["a", "b", "c", "-", "-"]
  #     ['a', 'b', 'c', 'd'].fill(3, 2) {|e| e.to_s } # => ["a", "b", "c", "3", "4"]
  #
  #     # Fills with nils if necessary.
  #     ['a', 'b', 'c', 'd'].fill('-', 6, 2)          # => ["a", "b", "c", "d", nil, nil, "-", "-"]
  #     ['a', 'b', 'c', 'd'].fill(6, 2) {|e| e.to_s } # => ["a", "b", "c", "d", nil, nil, "6", "7"]
  #
  #     # For negative start, counts backwards from the end.
  #     ['a', 'b', 'c', 'd'].fill('-', -3, 3)          # => ["a", "-", "-", "-"]
  #     ['a', 'b', 'c', 'd'].fill(-3, 3) {|e| e.to_s } # => ["a", "1", "2", "3"]
  #
  #     # Range.
  #     ['a', 'b', 'c', 'd'].fill('-', 1..2)          # => ["a", "-", "-", "d"]
  #     ['a', 'b', 'c', 'd'].fill(1..2) {|e| e.to_s } # => ["a", "1", "2", "d"]
  #
  # When arguments `start` and `count` are given, they select the elements of
  # `self` to be replaced; each must be an [integer-convertible
  # object](rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects) (or
  # `nil`):
  #
  # *   `start` specifies the zero-based offset of the first element to be
  #     replaced; `nil` means zero.
  # *   `count` is the number of consecutive elements to be replaced; `nil` means
  #     "all the rest."
  #
  # With argument `object` given, that one object is used for all replacements:
  #
  #     o = Object.new           # => #<Object:0x0000014e7bff7600>
  #     a = ['a', 'b', 'c', 'd'] # => ["a", "b", "c", "d"]
  #     a.fill(o, 1, 2)
  #     # => ["a", #<Object:0x0000014e7bff7600>, #<Object:0x0000014e7bff7600>, "d"]
  #
  # With a block given, the block is called once for each element to be replaced;
  # the value passed to the block is the *index* of the element to be replaced
  # (not the element itself); the block's return value replaces the element:
  #
  #     a = ['a', 'b', 'c', 'd']               # => ["a", "b", "c", "d"]
  #     a.fill(1, 2) {|element| element.to_s } # => ["a", "1", "2", "d"]
  #
  # For arguments `start` and `count`:
  #
  # *   If `start` is non-negative, replaces `count` elements beginning at offset
  #     `start`:
  #
  #         ['a', 'b', 'c', 'd'].fill('-', 0, 2) # => ["-", "-", "c", "d"]
  #         ['a', 'b', 'c', 'd'].fill('-', 1, 2) # => ["a", "-", "-", "d"]
  #         ['a', 'b', 'c', 'd'].fill('-', 2, 2) # => ["a", "b", "-", "-"]
  #
  #         ['a', 'b', 'c', 'd'].fill(0, 2) {|e| e.to_s } # => ["0", "1", "c", "d"]
  #         ['a', 'b', 'c', 'd'].fill(1, 2) {|e| e.to_s } # => ["a", "1", "2", "d"]
  #         ['a', 'b', 'c', 'd'].fill(2, 2) {|e| e.to_s } # => ["a", "b", "2", "3"]
  #
  #     Extends `self` if necessary:
  #
  #         ['a', 'b', 'c', 'd'].fill('-', 3, 2) # => ["a", "b", "c", "-", "-"]
  #         ['a', 'b', 'c', 'd'].fill('-', 4, 2) # => ["a", "b", "c", "d", "-", "-"]
  #
  #         ['a', 'b', 'c', 'd'].fill(3, 2) {|e| e.to_s } # => ["a", "b", "c", "3", "4"]
  #         ['a', 'b', 'c', 'd'].fill(4, 2) {|e| e.to_s } # => ["a", "b", "c", "d", "4", "5"]
  #
  #     Fills with `nil` if necessary:
  #
  #         ['a', 'b', 'c', 'd'].fill('-', 5, 2) # => ["a", "b", "c", "d", nil, "-", "-"]
  #         ['a', 'b', 'c', 'd'].fill('-', 6, 2) # => ["a", "b", "c", "d", nil, nil, "-", "-"]
  #
  #         ['a', 'b', 'c', 'd'].fill(5, 2) {|e| e.to_s } # => ["a", "b", "c", "d", nil, "5", "6"]
  #         ['a', 'b', 'c', 'd'].fill(6, 2) {|e| e.to_s } # => ["a", "b", "c", "d", nil, nil, "6", "7"]
  #
  #     Does nothing if `count` is non-positive:
  #
  #         ['a', 'b', 'c', 'd'].fill('-', 2, 0)    # => ["a", "b", "c", "d"]
  #         ['a', 'b', 'c', 'd'].fill('-', 2, -100) # => ["a", "b", "c", "d"]
  #         ['a', 'b', 'c', 'd'].fill('-', 6, -100) # => ["a", "b", "c", "d"]
  #
  #         ['a', 'b', 'c', 'd'].fill(2, 0) {|e| fail 'Cannot happen' }    # => ["a", "b", "c", "d"]
  #         ['a', 'b', 'c', 'd'].fill(2, -100) {|e| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
  #         ['a', 'b', 'c', 'd'].fill(6, -100) {|e| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
  #
  # *   If `start` is negative, counts backwards from the end of `self`:
  #
  #         ['a', 'b', 'c', 'd'].fill('-', -4, 3) # => ["-", "-", "-", "d"]
  #         ['a', 'b', 'c', 'd'].fill('-', -3, 3) # => ["a", "-", "-", "-"]
  #
  #         ['a', 'b', 'c', 'd'].fill(-4, 3) {|e| e.to_s } # => ["0", "1", "2", "d"]
  #         ['a', 'b', 'c', 'd'].fill(-3, 3) {|e| e.to_s } # => ["a", "1", "2", "3"]
  #
  #     Extends `self` if necessary:
  #
  #         ['a', 'b', 'c', 'd'].fill('-', -2, 3) # => ["a", "b", "-", "-", "-"]
  #         ['a', 'b', 'c', 'd'].fill('-', -1, 3) # => ["a", "b", "c", "-", "-", "-"]
  #
  #         ['a', 'b', 'c', 'd'].fill(-2, 3) {|e| e.to_s } # => ["a", "b", "2", "3", "4"]
  #         ['a', 'b', 'c', 'd'].fill(-1, 3) {|e| e.to_s } # => ["a", "b", "c", "3", "4", "5"]
  #
  #     Starts at the beginning of `self` if `start` is negative and out-of-range:
  #
  #         ['a', 'b', 'c', 'd'].fill('-', -5, 2) # => ["-", "-", "c", "d"]
  #         ['a', 'b', 'c', 'd'].fill('-', -6, 2) # => ["-", "-", "c", "d"]
  #
  #         ['a', 'b', 'c', 'd'].fill(-5, 2) {|e| e.to_s } # => ["0", "1", "c", "d"]
  #         ['a', 'b', 'c', 'd'].fill(-6, 2) {|e| e.to_s } # => ["0", "1", "c", "d"]
  #
  #     Does nothing if `count` is non-positive:
  #
  #         ['a', 'b', 'c', 'd'].fill('-', -2, 0)  # => ["a", "b", "c", "d"]
  #         ['a', 'b', 'c', 'd'].fill('-', -2, -1) # => ["a", "b", "c", "d"]
  #
  #         ['a', 'b', 'c', 'd'].fill(-2, 0) {|e| fail 'Cannot happen' }  # => ["a", "b", "c", "d"]
  #         ['a', 'b', 'c', 'd'].fill(-2, -1) {|e| fail 'Cannot happen' } # => ["a", "b", "c", "d"]
  #
  # When argument `range` is given, it must be a Range object whose members are
  # numeric; its `begin` and `end` values determine the elements of `self` to be
  # replaced:
  #
  # *   If both `begin` and `end` are positive, they specify the first and last
  #     elements to be replaced:
  #
  #         ['a', 'b', 'c', 'd'].fill('-', 1..2)          # => ["a", "-", "-", "d"]
  #         ['a', 'b', 'c', 'd'].fill(1..2) {|e| e.to_s } # => ["a", "1", "2", "d"]
  #
  #     If `end` is smaller than `begin`, replaces no elements:
  #
  #         ['a', 'b', 'c', 'd'].fill('-', 2..1)          # => ["a", "b", "c", "d"]
  #         ['a', 'b', 'c', 'd'].fill(2..1) {|e| e.to_s } # => ["a", "b", "c", "d"]
  #
  # *   If either is negative (or both are negative), counts backwards from the
  #     end of `self`:
  #
  #         ['a', 'b', 'c', 'd'].fill('-', -3..2)  # => ["a", "-", "-", "d"]
  #         ['a', 'b', 'c', 'd'].fill('-', 1..-2)  # => ["a", "-", "-", "d"]
  #         ['a', 'b', 'c', 'd'].fill('-', -3..-2) # => ["a", "-", "-", "d"]
  #
  #         ['a', 'b', 'c', 'd'].fill(-3..2) {|e| e.to_s }  # => ["a", "1", "2", "d"]
  #         ['a', 'b', 'c', 'd'].fill(1..-2) {|e| e.to_s }  # => ["a", "1", "2", "d"]
  #         ['a', 'b', 'c', 'd'].fill(-3..-2) {|e| e.to_s } # => ["a", "1", "2", "d"]
  #
  # *   If the `end` value is excluded (see Range#exclude_end?), omits the last
  #     replacement:
  #
  #         ['a', 'b', 'c', 'd'].fill('-', 1...2)  # => ["a", "-", "c", "d"]
  #         ['a', 'b', 'c', 'd'].fill('-', 1...-2) # => ["a", "-", "c", "d"]
  #
  #         ['a', 'b', 'c', 'd'].fill(1...2) {|e| e.to_s }  # => ["a", "1", "c", "d"]
  #         ['a', 'b', 'c', 'd'].fill(1...-2) {|e| e.to_s } # => ["a", "1", "c", "d"]
  #
  # *   If the range is endless (see [Endless
  #     Ranges](rdoc-ref:Range@Endless+Ranges)), replaces elements to the end of
  #     `self`:
  #
  #         ['a', 'b', 'c', 'd'].fill('-', 1..)          # => ["a", "-", "-", "-"]
  #         ['a', 'b', 'c', 'd'].fill(1..) {|e| e.to_s } # => ["a", "1", "2", "3"]
  #
  # *   If the range is beginless (see [Beginless
  #     Ranges](rdoc-ref:Range@Beginless+Ranges)), replaces elements from the
  #     beginning of `self`:
  #
  #         ['a', 'b', 'c', 'd'].fill('-', ..2)          # => ["-", "-", "-", "d"]
  #         ['a', 'b', 'c', 'd'].fill(..2) {|e| e.to_s } # => ["0", "1", "2", "d"]
  #
  # Related: see [Methods for Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def fill: (Elem obj) -> self
          | (Elem obj, int? start, ?int? length) -> self
          | (Elem obj, ::Range[::Integer] range) -> self
          | (?int? start, ?int? length) { (::Integer index) -> Elem } -> self
          | (::Range[::Integer] range) { (::Integer index) -> Elem } -> self

# 
  # With a block given, calls the block with each element of `self`; returns a new
  # array containing those elements of `self` for which the block returns a truthy
  # value:
  #
  #     a = [:foo, 'bar', 2, :bam]
  #     a.select {|element| element.to_s.start_with?('b') }
  #     # => ["bar", :bam]
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def filter: () { (Elem item) -> boolish } -> ::Array[Elem]
            | () -> ::Enumerator[Elem, ::Array[Elem]]

# 
  # With a block given, calls the block with each element of `self`; removes from
  # `self` those elements for which the block returns `false` or `nil`.
  #
  # Returns `self` if any elements were removed:
  #
  #     a = [:foo, 'bar', 2, :bam]
  #     a.select! {|element| element.to_s.start_with?('b') } # => ["bar", :bam]
  #
  # Returns `nil` if no elements were removed.
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Deleting](rdoc-ref:Array@Methods+for+Deleting).
  #
  def filter!: () { (Elem item) -> boolish } -> self?
             | () -> ::Enumerator[Elem, self?]

# 
  # Returns the zero-based integer index of a specified element, or `nil`.
  #
  # With only argument `object` given, returns the index of the first element
  # `element` for which `object == element`:
  #
  #     a = [:foo, 'bar', 2, 'bar']
  #     a.index('bar') # => 1
  #
  # Returns `nil` if no such element found.
  #
  # With only a block given, calls the block with each successive element; returns
  # the index of the first element for which the block returns a truthy value:
  #
  #     a = [:foo, 'bar', 2, 'bar']
  #     a.index {|element| element == 'bar' } # => 1
  #
  # Returns `nil` if the block never returns a truthy value.
  #
  # With neither an argument nor a block given, returns a new Enumerator.
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  def find_index: (untyped obj) -> ::Integer?
                | () { (Elem item) -> boolish } -> ::Integer?
                | () -> ::Enumerator[Elem, ::Integer?]

# 
  # Returns elements from `self`, or `nil`; does not modify `self`.
  #
  # With no argument given, returns the first element (if available):
  #
  #     a = [:foo, 'bar', 2]
  #     a.first # => :foo
  #     a # => [:foo, "bar", 2]
  #
  # If `self` is empty, returns `nil`.
  #
  #     [].first # => nil
  #
  # With a non-negative integer argument `count` given, returns the first `count`
  # elements (as available) in a new array:
  #
  #     a.first(0)  # => []
  #     a.first(2)  # => [:foo, "bar"]
  #     a.first(50) # => [:foo, "bar", 2]
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  def first: %a{implicitly-returns-nil} () -> Elem
           | (int n) -> ::Array[Elem]

# 
  # Returns a new array that is a recursive flattening of `self` to `depth` levels
  # of recursion; `depth` must be an [integer-convertible
  # object](rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects) or
  # `nil`. At each level of recursion:
  #
  # *   Each element that is an array is "flattened" (that is, replaced by its
  #     individual array elements).
  # *   Each element that is not an array is unchanged (even if the element is an
  #     object that has instance method `flatten`).
  #
  # With non-negative integer argument `depth`, flattens recursively through
  # `depth` levels:
  #
  #     a = [ 0, [ 1, [2, 3], 4 ], 5, {foo: 0}, Set.new([6, 7]) ]
  #     a              # => [0, [1, [2, 3], 4], 5, {:foo=>0}, #<Set: {6, 7}>]
  #     a.flatten(0)   # => [0, [1, [2, 3], 4], 5, {:foo=>0}, #<Set: {6, 7}>]
  #     a.flatten(1  ) # => [0, 1, [2, 3], 4, 5, {:foo=>0}, #<Set: {6, 7}>]
  #     a.flatten(1.1) # => [0, 1, [2, 3], 4, 5, {:foo=>0}, #<Set: {6, 7}>]
  #     a.flatten(2)   # => [0, 1, 2, 3, 4, 5, {:foo=>0}, #<Set: {6, 7}>]
  #     a.flatten(3)   # => [0, 1, 2, 3, 4, 5, {:foo=>0}, #<Set: {6, 7}>]
  #
  # With `nil` or negative `depth`, flattens all levels.
  #
  #     a.flatten     # => [0, 1, 2, 3, 4, 5, {:foo=>0}, #<Set: {6, 7}>]
  #     a.flatten(-1) # => [0, 1, 2, 3, 4, 5, {:foo=>0}, #<Set: {6, 7}>]
  #
  # Related: Array#flatten!; see also [Methods for
  # Converting](rdoc-ref:Array@Methods+for+Converting).
  #
  def flatten: (?int level) -> ::Array[untyped]

# 
  # Returns `self` as a recursively flattening of `self` to `depth` levels of
  # recursion; `depth` must be an [integer-convertible
  # object](rdoc-ref:implicit_conversion.rdoc@Integer-Convertible+Objects), or
  # `nil`. At each level of recursion:
  #
  # *   Each element that is an array is "flattened" (that is, replaced by its
  #     individual array elements).
  # *   Each element that is not an array is unchanged (even if the element is an
  #     object that has instance method `flatten`).
  #
  # Returns `nil` if no elements were flattened.
  #
  # With non-negative integer argument `depth`, flattens recursively through
  # `depth` levels:
  #
  #     a = [ 0, [ 1, [2, 3], 4 ], 5, {foo: 0}, Set.new([6, 7]) ]
  #     a                   # => [0, [1, [2, 3], 4], 5, {:foo=>0}, #<Set: {6, 7}>]
  #     a.dup.flatten!(1)   # => [0, 1, [2, 3], 4, 5, {:foo=>0}, #<Set: {6, 7}>]
  #     a.dup.flatten!(1.1) # => [0, 1, [2, 3], 4, 5, {:foo=>0}, #<Set: {6, 7}>]
  #     a.dup.flatten!(2)   # => [0, 1, 2, 3, 4, 5, {:foo=>0}, #<Set: {6, 7}>]
  #     a.dup.flatten!(3)   # => [0, 1, 2, 3, 4, 5, {:foo=>0}, #<Set: {6, 7}>]
  #
  # With `nil` or negative argument `depth`, flattens all levels:
  #
  #     a.dup.flatten!     # => [0, 1, 2, 3, 4, 5, {:foo=>0}, #<Set: {6, 7}>]
  #     a.dup.flatten!(-1) # => [0, 1, 2, 3, 4, 5, {:foo=>0}, #<Set: {6, 7}>]
  #
  # Related: Array#flatten; see also [Methods for
  # Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def flatten!: (?int level) -> self?

# 
  # Returns the integer hash value for `self`.
  #
  # Two arrays with the same content will have the same hash value (and will
  # compare using eql?):
  #
  #     ['a', 'b'].hash == ['a', 'b'].hash # => true
  #     ['a', 'b'].hash == ['a', 'c'].hash # => false
  #     ['a', 'b'].hash == ['a'].hash      # => false
  #
  def hash: () -> ::Integer

# 
  # Returns whether for some element `element` in `self`, `object == element`:
  #
  #     [0, 1, 2].include?(2)   # => true
  #     [0, 1, 2].include?(2.0) # => true
  #     [0, 1, 2].include?(2.1) # => false
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  def include?: (Elem object) -> bool

# 
  # Returns the zero-based integer index of a specified element, or `nil`.
  #
  # With only argument `object` given, returns the index of the first element
  # `element` for which `object == element`:
  #
  #     a = [:foo, 'bar', 2, 'bar']
  #     a.index('bar') # => 1
  #
  # Returns `nil` if no such element found.
  #
  # With only a block given, calls the block with each successive element; returns
  # the index of the first element for which the block returns a truthy value:
  #
  #     a = [:foo, 'bar', 2, 'bar']
  #     a.index {|element| element == 'bar' } # => 1
  #
  # Returns `nil` if the block never returns a truthy value.
  #
  # With neither an argument nor a block given, returns a new Enumerator.
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  alias index find_index

# 
  # Inserts the given `objects` as elements of `self`; returns `self`.
  #
  # When `index` is non-negative, inserts `objects` *before* the element at offset
  # `index`:
  #
  #     a = ['a', 'b', 'c']     # => ["a", "b", "c"]
  #     a.insert(1, :x, :y, :z) # => ["a", :x, :y, :z, "b", "c"]
  #
  # Extends the array if `index` is beyond the array (`index >= self.size`):
  #
  #     a = ['a', 'b', 'c']     # => ["a", "b", "c"]
  #     a.insert(5, :x, :y, :z) # => ["a", "b", "c", nil, nil, :x, :y, :z]
  #
  # When `index` is negative, inserts `objects` *after* the element at offset
  # `index + self.size`:
  #
  #     a = ['a', 'b', 'c']      # => ["a", "b", "c"]
  #     a.insert(-2, :x, :y, :z) # => ["a", "b", :x, :y, :z, "c"]
  #
  # With no `objects` given, does nothing:
  #
  #     a = ['a', 'b', 'c'] # => ["a", "b", "c"]
  #     a.insert(1)         # => ["a", "b", "c"]
  #     a.insert(50)        # => ["a", "b", "c"]
  #     a.insert(-50)       # => ["a", "b", "c"]
  #
  # Raises IndexError if `objects` are given and `index` is negative and out of
  # range.
  #
  # Related: see [Methods for Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def insert: (int index, *Elem obj) -> self

# 
  # Returns the new string formed by calling method `#inspect` on each array
  # element:
  #
  #     a = [:foo, 'bar', 2]
  #     a.inspect # => "[:foo, \"bar\", 2]"
  #
  # Related: see [Methods for Converting](rdoc-ref:Array@Methods+for+Converting).
  #
  def inspect: () -> String

# 
  # Returns whether `other_array` has at least one element that is `#eql?` to some
  # element of `self`:
  #
  #     [1, 2, 3].intersect?([3, 4, 5]) # => true
  #     [1, 2, 3].intersect?([4, 5, 6]) # => false
  #
  # Each element must correctly implement method `#hash`.
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  def intersect?: (_ToAry[untyped]) -> bool

# 
  # Returns a new array containing each element in `self` that is `#eql?` to at
  # least one element in each of the given `other_arrays`; duplicates are omitted:
  #
  #     [0, 0, 1, 1, 2, 3].intersection([0, 1, 2], [0, 1, 3]) # => [0, 1]
  #
  # Each element must correctly implement method `#hash`.
  #
  # Order from `self` is preserved:
  #
  #     [0, 1, 2].intersection([2, 1, 0]) # => [0, 1, 2]
  #
  # Returns a copy of `self` if no arguments are given.
  #
  # Related: see [Methods for Combining](rdoc-ref:Array@Methods+for+Combining).
  #
  def intersection: (*::Array[untyped] | _ToAry[untyped] other_ary) -> ::Array[Elem]

# 
  # Returns the new string formed by joining the converted elements of `self`; for
  # each element `element`:
  #
  # *   Converts recursively using `element.join(separator)` if `element` is a
  #     `kind_of?(Array)`.
  # *   Otherwise, converts using `element.to_s`.
  #
  # With no argument given, joins using the output field separator, `$,`:
  #
  #     a = [:foo, 'bar', 2]
  #     $, # => nil
  #     a.join # => "foobar2"
  #
  # With string argument `separator` given, joins using that separator:
  #
  #     a = [:foo, 'bar', 2]
  #     a.join("\n") # => "foo\nbar\n2"
  #
  # Joins recursively for nested arrays:
  #
  #     a = [:foo, [:bar, [:baz, :bat]]]
  #     a.join # => "foobarbazbat"
  #
  # Related: see [Methods for Converting](rdoc-ref:Array@Methods+for+Converting).
  #
  def join: (?string separator) -> String

# 
  # With a block given, calls the block with each element of `self`; removes the
  # element from `self` if the block does not return a truthy value:
  #
  #     a = [:foo, 'bar', 2, :bam]
  #     a.keep_if {|element| element.to_s.start_with?('b') } # => ["bar", :bam]
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Deleting](rdoc-ref:Array@Methods+for+Deleting).
  #
  def keep_if: () { (Elem item) -> boolish } -> self
             | () -> ::Enumerator[Elem, self]

# 
  # Returns elements from `self`, or `nil`; `self` is not modified.
  #
  # With no argument given, returns the last element, or `nil` if `self` is empty:
  #
  #     a = [:foo, 'bar', 2]
  #     a.last # => 2
  #     a # => [:foo, "bar", 2]
  #     [].last # => nil
  #
  # With non-negative integer argument `count` given, returns a new array
  # containing the trailing `count` elements of `self`, as available:
  #
  #     a = [:foo, 'bar', 2]
  #     a.last(2)  # => ["bar", 2]
  #     a.last(50) # => [:foo, "bar", 2]
  #     a.last(0)  # => []
  #     [].last(3) # => []
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def last: %a{implicitly-returns-nil} () -> Elem
          | (int n) -> ::Array[Elem]

# 
  # Returns the count of elements in `self`:
  #
  #     [0, 1, 2].length # => 3
  #     [].length        # => 0
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  def length: () -> ::Integer

# 
  # With a block given, calls the block with each element of `self`; returns a new
  # array whose elements are the return values from the block:
  #
  #     a = [:foo, 'bar', 2]
  #     a1 = a.map {|element| element.class }
  #     a1 # => [Symbol, String, Integer]
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: #collect!; see also [Methods for
  # Converting](rdoc-ref:Array@Methods+for+Converting).
  #
  alias map collect

# 
  # With a block given, calls the block with each element of `self` and replaces
  # the element with the block's return value; returns `self`:
  #
  #     a = [:foo, 'bar', 2]
  #     a.map! { |element| element.class } # => [Symbol, String, Integer]
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: #collect; see also [Methods for
  # Converting](rdoc-ref:Array@Methods+for+Converting).
  #
  alias map! collect!

# 
  # Returns one of the following:
  #
  # *   The maximum-valued element from `self`.
  # *   A new array of maximum-valued elements from `self`.
  #
  # Does not modify `self`.
  #
  # With no block given, each element in `self` must respond to method `#<=>` with
  # a numeric.
  #
  # With no argument and no block, returns the element in `self` having the
  # maximum value per method `#<=>`:
  #
  #     [1, 0, 3, 2].max # => 3
  #
  # With non-negative numeric argument `count` and no block, returns a new array
  # with at most `count` elements, in descending order, per method `#<=>`:
  #
  #     [1, 0, 3, 2].max(3)   # => [3, 2, 1]
  #     [1, 0, 3, 2].max(3.0) # => [3, 2, 1]
  #     [1, 0, 3, 2].max(9)   # => [3, 2, 1, 0]
  #     [1, 0, 3, 2].max(0)   # => []
  #
  # With a block given, the block must return a numeric.
  #
  # With a block and no argument, calls the block `self.size - 1` times to compare
  # elements; returns the element having the maximum value per the block:
  #
  #     ['0', '', '000', '00'].max {|a, b| a.size <=> b.size }
  #     # => "000"
  #
  # With non-negative numeric argument `count` and a block, returns a new array
  # with at most `count` elements, in descending order, per the block:
  #
  #     ['0', '', '000', '00'].max(2) {|a, b| a.size <=> b.size }
  #     # => ["000", "00"]
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def max: %a{implicitly-returns-nil} () -> Elem
         | %a{implicitly-returns-nil} () { (Elem a, Elem b) -> ::Integer? } -> Elem
         | (int n) -> ::Array[Elem]
         | (int n) { (Elem a, Elem b) -> ::Integer? } -> ::Array[Elem]

# 
  # Returns one of the following:
  #
  # *   The minimum-valued element from `self`.
  # *   A new array of minimum-valued elements from `self`.
  #
  # Does not modify `self`.
  #
  # With no block given, each element in `self` must respond to method `#<=>` with
  # a numeric.
  #
  # With no argument and no block, returns the element in `self` having the
  # minimum value per method `#<=>`:
  #
  #     [1, 0, 3, 2].min # => 0
  #
  # With non-negative numeric argument `count` and no block, returns a new array
  # with at most `count` elements, in ascending order, per method `#<=>`:
  #
  #     [1, 0, 3, 2].min(3)   # => [0, 1, 2]
  #     [1, 0, 3, 2].min(3.0) # => [0, 1, 2]
  #     [1, 0, 3, 2].min(9)   # => [0, 1, 2, 3]
  #     [1, 0, 3, 2].min(0)   # => []
  #
  # With a block given, the block must return a numeric.
  #
  # With a block and no argument, calls the block `self.size - 1` times to compare
  # elements; returns the element having the minimum value per the block:
  #
  #     ['0', '', '000', '00'].min {|a, b| a.size <=> b.size }
  #     # => ""
  #
  # With non-negative numeric argument `count` and a block, returns a new array
  # with at most `count` elements, in ascending order, per the block:
  #
  #     ['0', '', '000', '00'].min(2) {|a, b| a.size <=> b.size }
  #     # => ["", "0"]
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  alias min max

# 
  # Returns a 2-element array containing the minimum-valued and maximum-valued
  # elements from `self`; does not modify `self`.
  #
  # With no block given, the minimum and maximum values are determined using
  # method `#<=>`:
  #
  #     [1, 0, 3, 2].minmax # => [0, 3]
  #
  # With a block given, the block must return a numeric; the block is called
  # `self.size - 1` times to compare elements; returns the elements having the
  # minimum and maximum values per the block:
  #
  #     ['0', '', '000', '00'].minmax {|a, b| a.size <=> b.size }
  #     # => ["", "000"]
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def minmax: () -> [ Elem?, Elem? ]
            | () { (Elem a, Elem b) -> ::Integer? } -> [ Elem?, Elem? ]

# 
  # Returns `true` if no element of `self` meets a given criterion, `false`
  # otherwise.
  #
  # With no block given and no argument, returns `true` if `self` has no truthy
  # elements, `false` otherwise:
  #
  #     [nil, false].none?    # => true
  #     [nil, 0, false].none? # => false
  #     [].none?              # => true
  #
  # With argument `object` given, returns `false` if for any element `element`,
  # `object === element`; `true` otherwise:
  #
  #     ['food', 'drink'].none?(/bar/) # => true
  #     ['food', 'drink'].none?(/foo/) # => false
  #     [].none?(/foo/)                # => true
  #     [0, 1, 2].none?(3)             # => true
  #     [0, 1, 2].none?(1)             # => false
  #
  # With a block given, calls the block with each element in `self`; returns
  # `true` if the block returns no truthy value, `false` otherwise:
  #
  #     [0, 1, 2].none? {|element| element > 3 } # => true
  #     [0, 1, 2].none? {|element| element > 1 } # => false
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  alias none? all?

# 
  # Returns `true` if exactly one element of `self` meets a given criterion.
  #
  # With no block given and no argument, returns `true` if `self` has exactly one
  # truthy element, `false` otherwise:
  #
  #     [nil, 0].one? # => true
  #     [0, 0].one? # => false
  #     [nil, nil].one? # => false
  #     [].one? # => false
  #
  # With a block given, calls the block with each element in `self`; returns
  # `true` if the block a truthy value for exactly one element, `false` otherwise:
  #
  #     [0, 1, 2].one? {|element| element > 0 } # => false
  #     [0, 1, 2].one? {|element| element > 1 } # => true
  #     [0, 1, 2].one? {|element| element > 2 } # => false
  #
  # With argument `object` given, returns `true` if for exactly one element
  # `element`, `object === element`; `false` otherwise:
  #
  #     [0, 1, 2].one?(0) # => true
  #     [0, 0, 1].one?(0) # => false
  #     [1, 1, 2].one?(0) # => false
  #     ['food', 'drink'].one?(/bar/) # => false
  #     ['food', 'drink'].one?(/foo/) # => true
  #     [].one?(/foo/) # => false
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  alias one? none?

# 
  # Formats each element in `self` into a binary string; returns that string. See
  # [Packed Data](rdoc-ref:packed_data.rdoc).
  #
  def pack: (string fmt, ?buffer: String?) -> String

# 
  # Iterates over permutations of the elements of `self`; the order of
  # permutations is indeterminate.
  #
  # With a block and an in-range positive integer argument `count` (`0 < count <=
  # self.size`) given, calls the block with each permutation of `self` of size
  # `count`; returns `self`:
  #
  #     a = [0, 1, 2]
  #     perms = []
  #     a.permutation(1) {|perm| perms.push(perm) }
  #     perms # => [[0], [1], [2]]
  #
  #     perms = []
  #     a.permutation(2) {|perm| perms.push(perm) }
  #     perms # => [[0, 1], [0, 2], [1, 0], [1, 2], [2, 0], [2, 1]]
  #
  #     perms = []
  #     a.permutation(3) {|perm| perms.push(perm) }
  #     perms # => [[0, 1, 2], [0, 2, 1], [1, 0, 2], [1, 2, 0], [2, 0, 1], [2, 1, 0]]
  #
  # When `count` is zero, calls the block once with a new empty array:
  #
  #     perms = []
  #     a.permutation(0) {|perm| perms.push(perm) }
  #     perms # => [[]]
  #
  # When `count` is out of range (negative or larger than `self.size`), does not
  # call the block:
  #
  #     a.permutation(-1) {|permutation| fail 'Cannot happen' }
  #     a.permutation(4) {|permutation| fail 'Cannot happen' }
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: [Methods for Iterating](rdoc-ref:Array@Methods+for+Iterating).
  #
  def permutation: (?int n) -> ::Enumerator[::Array[Elem], ::Array[Elem]]
                 | (?int n) { (::Array[Elem] p) -> void } -> ::Array[Elem]

# 
  # Removes and returns trailing elements of `self`.
  #
  # With no argument given, removes and returns the last element, if available;
  # otherwise returns `nil`:
  #
  #     a = [:foo, 'bar', 2]
  #     a.pop  # => 2
  #     a      # => [:foo, "bar"]
  #     [].pop # => nil
  #
  # With non-negative integer argument `count` given, returns a new array
  # containing the trailing `count` elements of `self`, as available:
  #
  #     a = [:foo, 'bar', 2]
  #     a.pop(2) # => ["bar", 2]
  #     a        # => [:foo]
  #
  #     a = [:foo, 'bar', 2]
  #     a.pop(50) # => [:foo, "bar", 2]
  #     a         # => []
  #
  # Related: Array#push; see also [Methods for
  # Deleting](rdoc-ref:Array@Methods+for+Deleting).
  #
  def pop: () -> Elem?
         | (int n) -> ::Array[Elem]

# 
  # Prepends the given `objects` to `self`:
  #
  #     a = [:foo, 'bar', 2]
  #     a.unshift(:bam, :bat) # => [:bam, :bat, :foo, "bar", 2]
  #
  # Related: Array#shift; see also [Methods for
  # Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  alias prepend unshift

# 
  # Computes all combinations of elements from all the arrays, including both
  # `self` and `other_arrays`:
  #
  # *   The number of combinations is the product of the sizes of all the arrays,
  #     including both `self` and `other_arrays`.
  # *   The order of the returned combinations is indeterminate.
  #
  # With no block given, returns the combinations as an array of arrays:
  #
  #     p = [0, 1].product([2, 3])
  #     # => [[0, 2], [0, 3], [1, 2], [1, 3]]
  #     p.size # => 4
  #     p = [0, 1].product([2, 3], [4, 5])
  #     # => [[0, 2, 4], [0, 2, 5], [0, 3, 4], [0, 3, 5], [1, 2, 4], [1, 2, 5], [1, 3, 4], [1, 3,...
  #     p.size # => 8
  #
  # If `self` or any argument is empty, returns an empty array:
  #
  #     [].product([2, 3], [4, 5]) # => []
  #     [0, 1].product([2, 3], []) # => []
  #
  # If no argument is given, returns an array of 1-element arrays, each containing
  # an element of `self`:
  #
  #     a.product # => [[0], [1], [2]]
  #
  # With a block given, calls the block with each combination; returns `self`:
  #
  #     p = []
  #     [0, 1].product([2, 3]) {|combination| p.push(combination) }
  #     p # => [[0, 2], [0, 3], [1, 2], [1, 3]]
  #
  # If `self` or any argument is empty, does not call the block:
  #
  #     [].product([2, 3], [4, 5]) {|combination| fail 'Cannot happen' }
  #     # => []
  #     [0, 1].product([2, 3], []) {|combination| fail 'Cannot happen' }
  #     # => [0, 1]
  #
  # If no argument is given, calls the block with each element of `self` as a
  # 1-element array:
  #
  #     p = []
  #     [0, 1].product {|combination| p.push(combination) }
  #     p # => [[0], [1]]
  #
  # Related: see [Methods for Combining](rdoc-ref:Array@Methods+for+Combining).
  #
  def product: () -> ::Array[[ Elem ]]
             | [X] (::Array[X] other_ary) -> ::Array[[ Elem, X ]]
             | [X, Y] (::Array[X] other_ary1, ::Array[Y] other_ary2) -> ::Array[[ Elem, X, Y ]]
             | [U] (*::Array[U] other_arys) -> ::Array[::Array[Elem | U]]

# 
  # Appends each argument in `objects` to `self`; returns `self`:
  #
  #     a = [:foo, 'bar', 2] # => [:foo, "bar", 2]
  #     a.push(:baz, :bat)   # => [:foo, "bar", 2, :baz, :bat]
  #
  # Appends each argument as a single element, even if it is another array:
  #
  #     a = [:foo, 'bar', 2]               # => [:foo, "bar", 2]
  #     a.push([:baz, :bat], [:bam, :bad]) # => [:foo, "bar", 2, [:baz, :bat], [:bam, :bad]]
  #
  # Related: see [Methods for Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def push: (*Elem obj) -> self

# 
  # Returns the first element `ele` in `self` such that `ele` is an array and
  # `ele[1] == object`:
  #
  #     a = [{foo: 0}, [2, 4], [4, 5, 6], [4, 5]]
  #     a.rassoc(4) # => [2, 4]
  #     a.rassoc(5) # => [4, 5, 6]
  #
  # Returns `nil` if no such element is found.
  #
  # Related: Array#assoc; see also [Methods for
  # Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  alias rassoc assoc

# 
  # With a block given, returns a new array whose elements are all those from
  # `self` for which the block returns `false` or `nil`:
  #
  #     a = [:foo, 'bar', 2, 'bat']
  #     a1 = a.reject {|element| element.to_s.start_with?('b') }
  #     a1 # => [:foo, 2]
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  alias reject delete_if

# 
  # With a block given, calls the block with each element of `self`; removes each
  # element for which the block returns a truthy value.
  #
  # Returns `self` if any elements removed:
  #
  #     a = [:foo, 'bar', 2, 'bat']
  #     a.reject! {|element| element.to_s.start_with?('b') } # => [:foo, 2]
  #
  # Returns `nil` if no elements removed.
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Deleting](rdoc-ref:Array@Methods+for+Deleting).
  #
  def reject!: () { (Elem item) -> boolish } -> self?
             | () -> ::Enumerator[Elem, self?]

# 
  # With a block given, calls the block with each repeated combination of length
  # `size` of the elements of `self`; each combination is an array; returns
  # `self`. The order of the combinations is indeterminate.
  #
  # If a positive integer argument `size` is given, calls the block with each
  # `size`-tuple repeated combination of the elements of `self`. The number of
  # combinations is `(size+1)(size+2)/2`.
  #
  # Examples:
  #
  # *   `size` is 1:
  #
  #         c = []
  #         [0, 1, 2].repeated_combination(1) {|combination| c.push(combination) }
  #         c # => [[0], [1], [2]]
  #
  # *   `size` is 2:
  #
  #         c = []
  #         [0, 1, 2].repeated_combination(2) {|combination| c.push(combination) }
  #         c # => [[0, 0], [0, 1], [0, 2], [1, 1], [1, 2], [2, 2]]
  #
  # If `size` is zero, calls the block once with an empty array.
  #
  # If `size` is negative, does not call the block:
  #
  #     [0, 1, 2].repeated_combination(-1) {|combination| fail 'Cannot happen' }
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Combining](rdoc-ref:Array@Methods+for+Combining).
  #
  def repeated_combination: (int n) { (::Array[Elem] c) -> void } -> self
                          | (int n) -> ::Enumerator[::Array[Elem], self]

# 
  # With a block given, calls the block with each repeated permutation of length
  # `size` of the elements of `self`; each permutation is an array; returns
  # `self`. The order of the permutations is indeterminate.
  #
  # If a positive integer argument `size` is given, calls the block with each
  # `size`-tuple repeated permutation of the elements of `self`. The number of
  # permutations is `self.size**size`.
  #
  # Examples:
  #
  # *   `size` is 1:
  #
  #         p = []
  #         [0, 1, 2].repeated_permutation(1) {|permutation| p.push(permutation) }
  #         p # => [[0], [1], [2]]
  #
  # *   `size` is 2:
  #
  #         p = []
  #         [0, 1, 2].repeated_permutation(2) {|permutation| p.push(permutation) }
  #         p # => [[0, 0], [0, 1], [0, 2], [1, 0], [1, 1], [1, 2], [2, 0], [2, 1], [2, 2]]
  #
  # If `size` is zero, calls the block once with an empty array.
  #
  # If `size` is negative, does not call the block:
  #
  #     [0, 1, 2].repeated_permutation(-1) {|permutation| fail 'Cannot happen' }
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Combining](rdoc-ref:Array@Methods+for+Combining).
  #
  def repeated_permutation: (int n) { (::Array[Elem] p) -> void } -> self
                          | (int n) -> ::Enumerator[::Array[Elem], self]

# 
  # Replaces the elements of `self` with the elements of `other_array`, which must
  # be an [array-convertible
  # object](rdoc-ref:implicit_conversion.rdoc@Array-Convertible+Objects); returns
  # `self`:
  #
  #     a = ['a', 'b', 'c']   # => ["a", "b", "c"]
  #     a.replace(['d', 'e']) # => ["d", "e"]
  #
  # Related: see [Methods for Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def replace: (::Array[Elem]) -> self

# 
  # Returns a new array containing the elements of `self` in reverse order:
  #
  #     [0, 1, 2].reverse # => [2, 1, 0]
  #
  # Related: see [Methods for Combining](rdoc-ref:Array@Methods+for+Combining).
  #
  def reverse: () -> ::Array[Elem]

# 
  # Reverses the order of the elements of `self`; returns `self`:
  #
  #     a = [0, 1, 2]
  #     a.reverse! # => [2, 1, 0]
  #     a          # => [2, 1, 0]
  #
  # Related: see [Methods for Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def reverse!: () -> ::Array[Elem]

# 
  # When a block given, iterates backwards over the elements of `self`, passing,
  # in reverse order, each element to the block; returns `self`:
  #
  #     a = []
  #     [0, 1, 2].reverse_each {|element| a.push(element) }
  #     a # => [2, 1, 0]
  #
  # Allows the array to be modified during iteration:
  #
  #     a = ['a', 'b', 'c']
  #     a.reverse_each {|element| a.clear if element.start_with?('b') }
  #     a # => []
  #
  # When no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Iterating](rdoc-ref:Array@Methods+for+Iterating).
  #
  def reverse_each: () { (Elem item) -> void } -> self
                  | () -> ::Enumerator[Elem, self]

# 
  # Returns the index of the last element for which `object == element`.
  #
  # With argument `object` given, returns the index of the last such element
  # found:
  #
  #     a = [:foo, 'bar', 2, 'bar']
  #     a.rindex('bar') # => 3
  #
  # Returns `nil` if no such object found.
  #
  # With a block given, calls the block with each successive element; returns the
  # index of the last element for which the block returns a truthy value:
  #
  #     a = [:foo, 'bar', 2, 'bar']
  #     a.rindex {|element| element == 'bar' } # => 3
  #
  # Returns `nil` if the block never returns a truthy value.
  #
  # When neither an argument nor a block is given, returns a new Enumerator.
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  def rindex: (untyped obj) -> ::Integer?
            | () { (Elem item) -> boolish } -> ::Integer?
            | () -> ::Enumerator[Elem, ::Integer?]

# 
  # Returns a new array formed from `self` with elements rotated from one end to
  # the other.
  #
  # With non-negative numeric `count`, rotates elements from the beginning to the
  # end:
  #
  #     [0, 1, 2, 3].rotate(2)   # => [2, 3, 0, 1]
  #     [0, 1, 2, 3].rotate(2.1) # => [2, 3, 0, 1]
  #
  # If `count` is large, uses `count % array.size` as the count:
  #
  #     [0, 1, 2, 3].rotate(22) # => [2, 3, 0, 1]
  #
  # With a `count` of zero, rotates no elements:
  #
  #     [0, 1, 2, 3].rotate(0) # => [0, 1, 2, 3]
  #
  # With negative numeric `count`, rotates in the opposite direction, from the end
  # to the beginning:
  #
  #     [0, 1, 2, 3].rotate(-1) # => [3, 0, 1, 2]
  #
  # If `count` is small (far from zero), uses `count % array.size` as the count:
  #
  #     [0, 1, 2, 3].rotate(-21) # => [3, 0, 1, 2]
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def rotate: (?int count) -> ::Array[Elem]

# 
  # Rotates `self` in place by moving elements from one end to the other; returns
  # `self`.
  #
  # With non-negative numeric `count`, rotates `count` elements from the beginning
  # to the end:
  #
  #     [0, 1, 2, 3].rotate!(2)   # => [2, 3, 0, 1]
  #     [0, 1, 2, 3].rotate!(2.1) # => [2, 3, 0, 1]
  #
  # If `count` is large, uses `count % array.size` as the count:
  #
  #     [0, 1, 2, 3].rotate!(21) # => [1, 2, 3, 0]
  #
  # If `count` is zero, rotates no elements:
  #
  #     [0, 1, 2, 3].rotate!(0) # => [0, 1, 2, 3]
  #
  # With a negative numeric `count`, rotates in the opposite direction, from end
  # to beginning:
  #
  #     [0, 1, 2, 3].rotate!(-1) # => [3, 0, 1, 2]
  #
  # If `count` is small (far from zero), uses `count % array.size` as the count:
  #
  #     [0, 1, 2, 3].rotate!(-21) # => [3, 0, 1, 2]
  #
  # Related: see [Methods for Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def rotate!: (?int count) -> self

# 
  # Returns random elements from `self`, as selected by the object given by the
  # keyword argument `random`.
  #
  # With no argument `count` given, returns one random element from `self`:
  #
  #     a = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
  #     a.sample # => 3
  #     a.sample # => 8
  #
  # Returns `nil` if `self` is empty:
  #
  #     [].sample # => nil
  #
  # With a non-negative numeric argument `count` given, returns a new array
  # containing `count` random elements from `self`:
  #
  #     a.sample(3) # => [8, 9, 2]
  #     a.sample(6) # => [9, 6, 0, 3, 1, 4]
  #
  # The order of the result array is unrelated to the order of `self`.
  #
  # Returns a new empty `Array` if `self` is empty:
  #
  #     [].sample(4) # => []
  #
  # May return duplicates in `self`:
  #
  #     a = [1, 1, 1, 2, 2, 3]
  #     a.sample(a.size) # => [1, 1, 3, 2, 1, 2]
  #
  # Returns no more than `a.size` elements (because no new duplicates are
  # introduced):
  #
  #     a.sample(50) # => [6, 4, 1, 8, 5, 9, 0, 2, 3, 7]
  #
  # The object given with the keyword argument `random` is used as the random
  # number generator:
  #
  #     a = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10]
  #     a.sample(random: Random.new(1))     # => 6
  #     a.sample(4, random: Random.new(1))  # => [6, 10, 9, 2]
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def sample: %a{implicitly-returns-nil} (?random: _Rand rng) -> Elem
            | (int n, ?random: _Rand rng) -> ::Array[Elem]

# 
  # With a block given, calls the block with each element of `self`; returns a new
  # array containing those elements of `self` for which the block returns a truthy
  # value:
  #
  #     a = [:foo, 'bar', 2, :bam]
  #     a.select {|element| element.to_s.start_with?('b') }
  #     # => ["bar", :bam]
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def select: () { (Elem item) -> boolish } -> ::Array[Elem]
            | () -> ::Enumerator[Elem, ::Array[Elem]]

# 
  # With a block given, calls the block with each element of `self`; removes from
  # `self` those elements for which the block returns `false` or `nil`.
  #
  # Returns `self` if any elements were removed:
  #
  #     a = [:foo, 'bar', 2, :bam]
  #     a.select! {|element| element.to_s.start_with?('b') } # => ["bar", :bam]
  #
  # Returns `nil` if no elements were removed.
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Deleting](rdoc-ref:Array@Methods+for+Deleting).
  #
  def select!: () { (Elem item) -> boolish } -> self?
             | () -> ::Enumerator[Elem, self?]

# 
  # Removes and returns leading elements from `self`.
  #
  # With no argument, removes and returns one element, if available, or `nil`
  # otherwise:
  #
  #     a = [0, 1, 2, 3]
  #     a.shift  # => 0
  #     a        # => [1, 2, 3]
  #     [].shift # => nil
  #
  # With non-negative numeric argument `count` given, removes and returns the
  # first `count` elements:
  #
  #     a = [0, 1, 2, 3]
  #     a.shift(2)   # => [0, 1]
  #     a            # => [2, 3]
  #     a.shift(1.1) # => [2]
  #     a            # => [3]
  #     a.shift(0)   # => []
  #     a            # => [3]
  #
  # If `count` is large, removes and returns all elements:
  #
  #     a = [0, 1, 2, 3]
  #     a.shift(50) # => [0, 1, 2, 3]
  #     a           # => []
  #
  # If `self` is empty, returns a new empty array.
  #
  # Related: see [Methods for Deleting](rdoc-ref:Array@Methods+for+Deleting).
  #
  def shift: %a{implicitly-returns-nil} () -> Elem
           | (int n) -> ::Array[Elem]

# 
  # Returns a new array containing all elements from `self` in a random order, as
  # selected by the object given by the keyword argument `random`:
  #
  #     a =            [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
  #     a.shuffle # => [0, 8, 1, 9, 6, 3, 4, 7, 2, 5]
  #     a.shuffle # => [8, 9, 0, 5, 1, 2, 6, 4, 7, 3]
  #
  # Duplicate elements are included:
  #
  #     a =            [0, 1, 0, 1, 0, 1, 0, 1, 0, 1]
  #     a.shuffle # => [1, 0, 1, 1, 0, 0, 1, 0, 0, 1]
  #     a.shuffle # => [1, 1, 0, 0, 0, 1, 1, 0, 0, 1]
  #
  # The object given with the keyword argument `random` is used as the random
  # number generator.
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def shuffle: (?random: _Rand rng) -> ::Array[Elem]

# 
  # Shuffles all elements in `self` into a random order, as selected by the object
  # given by the keyword argument `random`. Returns `self`:
  #
  #     a =             [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
  #     a.shuffle! # => [5, 3, 8, 7, 6, 1, 9, 4, 2, 0]
  #     a.shuffle! # => [9, 4, 0, 6, 2, 8, 1, 5, 3, 7]
  #
  # Duplicate elements are included:
  #
  #     a =             [0, 1, 0, 1, 0, 1, 0, 1, 0, 1]
  #     a.shuffle! # => [1, 0, 0, 1, 1, 0, 1, 0, 0, 1]
  #     a.shuffle! # => [0, 1, 0, 1, 1, 0, 1, 0, 1, 0]
  #
  # The object given with the keyword argument `random` is used as the random
  # number generator.
  #
  # Related: see [Methods for Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def shuffle!: (?random: _Rand rng) -> self

# 
  # Returns the count of elements in `self`:
  #
  #     [0, 1, 2].length # => 3
  #     [].length        # => 0
  #
  # Related: see [Methods for Querying](rdoc-ref:Array@Methods+for+Querying).
  #
  alias size length

# 
  # Returns elements from `self`; does not modify `self`.
  #
  # In brief:
  #
  #     a = [:foo, 'bar', 2]
  #
  #     # Single argument index: returns one element.
  #     a[0]     # => :foo          # Zero-based index.
  #     a[-1]    # => 2             # Negative index counts backwards from end.
  #
  #     # Arguments start and length: returns an array.
  #     a[1, 2]  # => ["bar", 2]
  #     a[-2, 2] # => ["bar", 2]    # Negative start counts backwards from end.
  #
  #     # Single argument range: returns an array.
  #     a[0..1]  # => [:foo, "bar"]
  #     a[0..-2] # => [:foo, "bar"] # Negative range-begin counts backwards from end.
  #     a[-2..2] # => ["bar", 2]    # Negative range-end counts backwards from end.
  #
  # When a single integer argument `index` is given, returns the element at offset
  # `index`:
  #
  #     a = [:foo, 'bar', 2]
  #     a[0] # => :foo
  #     a[2] # => 2
  #     a # => [:foo, "bar", 2]
  #
  # If `index` is negative, counts backwards from the end of `self`:
  #
  #     a = [:foo, 'bar', 2]
  #     a[-1] # => 2
  #     a[-2] # => "bar"
  #
  # If `index` is out of range, returns `nil`.
  #
  # When two Integer arguments `start` and `length` are given, returns a new
  # `Array` of size `length` containing successive elements beginning at offset
  # `start`:
  #
  #     a = [:foo, 'bar', 2]
  #     a[0, 2] # => [:foo, "bar"]
  #     a[1, 2] # => ["bar", 2]
  #
  # If `start + length` is greater than `self.length`, returns all elements from
  # offset `start` to the end:
  #
  #     a = [:foo, 'bar', 2]
  #     a[0, 4] # => [:foo, "bar", 2]
  #     a[1, 3] # => ["bar", 2]
  #     a[2, 2] # => [2]
  #
  # If `start == self.size` and `length >= 0`, returns a new empty `Array`.
  #
  # If `length` is negative, returns `nil`.
  #
  # When a single Range argument `range` is given, treats `range.min` as `start`
  # above and `range.size` as `length` above:
  #
  #     a = [:foo, 'bar', 2]
  #     a[0..1] # => [:foo, "bar"]
  #     a[1..2] # => ["bar", 2]
  #
  # Special case: If `range.start == a.size`, returns a new empty `Array`.
  #
  # If `range.end` is negative, calculates the end index from the end:
  #
  #     a = [:foo, 'bar', 2]
  #     a[0..-1] # => [:foo, "bar", 2]
  #     a[0..-2] # => [:foo, "bar"]
  #     a[0..-3] # => [:foo]
  #
  # If `range.start` is negative, calculates the start index from the end:
  #
  #     a = [:foo, 'bar', 2]
  #     a[-1..2] # => [2]
  #     a[-2..2] # => ["bar", 2]
  #     a[-3..2] # => [:foo, "bar", 2]
  #
  # If `range.start` is larger than the array size, returns `nil`.
  #
  #     a = [:foo, 'bar', 2]
  #     a[4..1] # => nil
  #     a[4..0] # => nil
  #     a[4..-1] # => nil
  #
  # When a single Enumerator::ArithmeticSequence argument `aseq` is given, returns
  # an `Array` of elements corresponding to the indexes produced by the sequence.
  #
  #     a = ['--', 'data1', '--', 'data2', '--', 'data3']
  #     a[(1..).step(2)] # => ["data1", "data2", "data3"]
  #
  # Unlike slicing with range, if the start or the end of the arithmetic sequence
  # is larger than array size, throws RangeError.
  #
  #     a = ['--', 'data1', '--', 'data2', '--', 'data3']
  #     a[(1..11).step(2)]
  #     # RangeError (((1..11).step(2)) out of range)
  #     a[(7..).step(2)]
  #     # RangeError (((7..).step(2)) out of range)
  #
  # If given a single argument, and its type is not one of the listed, tries to
  # convert it to Integer, and raises if it is impossible:
  #
  #     a = [:foo, 'bar', 2]
  #     # Raises TypeError (no implicit conversion of Symbol into Integer):
  #     a[:foo]
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def slice: %a{implicitly-returns-nil} (int index) -> Elem
           | (int start, int length) -> ::Array[Elem]?
           | (::Range[::Integer] range) -> ::Array[Elem]?

# 
  # Removes and returns elements from `self`.
  #
  # With numeric argument `index` given, removes and returns the element at offset
  # `index`:
  #
  #     a = ['a', 'b', 'c', 'd']
  #     a.slice!(2)   # => "c"
  #     a             # => ["a", "b", "d"]
  #     a.slice!(2.1) # => "d"
  #     a             # => ["a", "b"]
  #
  # If `index` is negative, counts backwards from the end of `self`:
  #
  #     a = ['a', 'b', 'c', 'd']
  #     a.slice!(-2) # => "c"
  #     a            # => ["a", "b", "d"]
  #
  # If `index` is out of range, returns `nil`.
  #
  # With numeric arguments `start` and `length` given, removes `length` elements
  # from `self` beginning at zero-based offset `start`; returns the removed
  # objects in a new array:
  #
  #     a = ['a', 'b', 'c', 'd']
  #     a.slice!(1, 2)     # => ["b", "c"]
  #     a                  # => ["a", "d"]
  #     a.slice!(0.1, 1.1) # => ["a"]
  #     a                  # => ["d"]
  #
  # If `start` is negative, counts backwards from the end of `self`:
  #
  #     a = ['a', 'b', 'c', 'd']
  #     a.slice!(-2, 1) # => ["c"]
  #     a               # => ["a", "b", "d"]
  #
  # If `start` is out-of-range, returns `nil`:
  #
  #     a = ['a', 'b', 'c', 'd']
  #     a.slice!(5, 1)  # => nil
  #     a.slice!(-5, 1) # => nil
  #
  # If `start + length` exceeds the array size, removes and returns all elements
  # from offset `start` to the end:
  #
  #     a = ['a', 'b', 'c', 'd']
  #     a.slice!(2, 50) # => ["c", "d"]
  #     a               # => ["a", "b"]
  #
  # If `start == a.size` and `length` is non-negative, returns a new empty array.
  #
  # If `length` is negative, returns `nil`.
  #
  # With Range argument `range` given, treats `range.min` as `start` (as above)
  # and `range.size` as `length` (as above):
  #
  #     a = ['a', 'b', 'c', 'd']
  #     a.slice!(1..2) # => ["b", "c"]
  #     a              # => ["a", "d"]
  #
  # If `range.start == a.size`, returns a new empty array:
  #
  #     a = ['a', 'b', 'c', 'd']
  #     a.slice!(4..5) # => []
  #
  # If `range.start` is larger than the array size, returns `nil`:
  #
  #     a = ['a', 'b', 'c', 'd']
  #     a.slice!(5..6) # => nil
  #
  # If `range.start` is negative, calculates the start index by counting backwards
  # from the end of `self`:
  #
  #     a = ['a', 'b', 'c', 'd']
  #     a.slice!(-2..2) # => ["c"]
  #
  # If `range.end` is negative, calculates the end index by counting backwards
  # from the end of `self`:
  #
  #     a = ['a', 'b', 'c', 'd']
  #     a.slice!(0..-2) # => ["a", "b", "c"]
  #
  # Related: see [Methods for Deleting](rdoc-ref:Array@Methods+for+Deleting).
  #
  def slice!: %a{implicitly-returns-nil} (int index) -> Elem
            | (int start, int length) -> ::Array[Elem]?
            | (::Range[::Integer] range) -> ::Array[Elem]?

# 
  # Returns a new array containing the elements of `self`, sorted.
  #
  # With no block given, compares elements using operator `#<=>` (see Object#<=>):
  #
  #     [0, 2, 3, 1].sort # => [0, 1, 2, 3]
  #
  # With a block given, calls the block with each combination of pairs of elements
  # from `self`; for each pair `a` and `b`, the block should return a numeric:
  #
  # *   Negative when `b` is to follow `a`.
  # *   Zero when `a` and `b` are equivalent.
  # *   Positive when `a` is to follow `b`.
  #
  # Example:
  #
  #     a = [3, 2, 0, 1]
  #     a.sort {|a, b| a <=> b } # => [0, 1, 2, 3]
  #     a.sort {|a, b| b <=> a } # => [3, 2, 1, 0]
  #
  # When the block returns zero, the order for `a` and `b` is indeterminate, and
  # may be unstable.
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def sort: () -> ::Array[Elem]
          | () { (Elem a, Elem b) -> ::Integer } -> ::Array[Elem]

# 
  # Like Array#sort, but returns `self` with its elements sorted in place.
  #
  # Related: see [Methods for Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def sort!: () -> self
           | () { (Elem a, Elem b) -> ::Integer } -> self

# 
  # With a block given, sorts the elements of `self` in place; returns self.
  #
  # Calls the block with each successive element; sorts elements based on the
  # values returned from the block:
  #
  #     a = ['aaaa', 'bbb', 'cc', 'd']
  #     a.sort_by! {|element| element.size }
  #     a # => ["d", "cc", "bbb", "aaaa"]
  #
  # For duplicate values returned by the block, the ordering is indeterminate, and
  # may be unstable.
  #
  # With no block given, returns a new Enumerator.
  #
  # Related: see [Methods for Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def sort_by!: [U] () { (Elem obj) -> U } -> ::Array[Elem]
              | () -> ::Enumerator[Elem, ::Array[Elem]]

# 
  # With no block given, returns the sum of `init` and all elements of `self`; for
  # array `array` and value `init`, equivalent to:
  #
  #     sum = init
  #     array.each {|element| sum += element }
  #     sum
  #
  # For example, `[e0, e1, e2].sum` returns `init + e0 + e1 + e2`.
  #
  # Examples:
  #
  #     [0, 1, 2, 3].sum                 # => 6
  #     [0, 1, 2, 3].sum(100)            # => 106
  #     ['abc', 'def', 'ghi'].sum('jkl') # => "jklabcdefghi"
  #     [[:foo, :bar], ['foo', 'bar']].sum([2, 3])
  #     # => [2, 3, :foo, :bar, "foo", "bar"]
  #
  # The `init` value and elements need not be numeric, but must all be
  # `+`-compatible:
  #
  #     # Raises TypeError: Array can't be coerced into Integer.
  #     [[:foo, :bar], ['foo', 'bar']].sum(2)
  #
  # With a block given, calls the block with each element of `self`; the block's
  # return value (instead of the element itself) is used as the addend:
  #
  #     ['zero', 1, :two].sum('Coerced and concatenated: ') {|element| element.to_s }
  #     # => "Coerced and concatenated: zero1two"
  #
  # Notes:
  #
  # *   Array#join and Array#flatten may be faster than Array#sum for an array of
  #     strings or an array of arrays.
  # *   Array#sum method may not respect method redefinition of "+" methods such
  #     as Integer#+.
  #
  def sum: (?untyped init) -> untyped
         | (?untyped init) { (Elem e) -> untyped } -> untyped

# 
  # Returns a new array containing the first `count` element of `self` (as
  # available); `count` must be a non-negative numeric; does not modify `self`:
  #
  #     a = ['a', 'b', 'c', 'd']
  #     a.take(2)   # => ["a", "b"]
  #     a.take(2.1) # => ["a", "b"]
  #     a.take(50)  # => ["a", "b", "c", "d"]
  #     a.take(0)   # => []
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def take: (int n) -> ::Array[Elem]

# 
  # With a block given, calls the block with each successive element of `self`;
  # stops iterating if the block returns `false` or `nil`; returns a new array
  # containing those elements for which the block returned a truthy value:
  #
  #     a = [0, 1, 2, 3, 4, 5]
  #     a.take_while {|element| element < 3 } # => [0, 1, 2]
  #     a.take_while {|element| true }        # => [0, 1, 2, 3, 4, 5]
  #     a.take_while {|element| false }       # => []
  #
  # With no block given, returns a new Enumerator.
  #
  # Does not modify `self`.
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def take_while: () { (Elem obj) -> boolish } -> ::Array[Elem]
                | () -> ::Enumerator[Elem, ::Array[Elem]]

# 
  # When `self` is an instance of `Array`, returns `self`.
  #
  # Otherwise, returns a new array containing the elements of `self`:
  #
  #     class MyArray < Array; end
  #     my_a = MyArray.new(['foo', 'bar', 'two'])
  #     a = my_a.to_a
  #     a # => ["foo", "bar", "two"]
  #     a.class # => Array # Not MyArray.
  #
  # Related: see [Methods for Converting](rdoc-ref:Array@Methods+for+Converting).
  #
  def to_a: () -> ::Array[Elem]

# 
  # Returns `self`.
  #
  def to_ary: () -> self

# 
  # Returns a new hash formed from `self`.
  #
  # With no block given, each element of `self` must be a 2-element sub-array;
  # forms each sub-array into a key-value pair in the new hash:
  #
  #     a = [['foo', 'zero'], ['bar', 'one'], ['baz', 'two']]
  #     a.to_h # => {"foo"=>"zero", "bar"=>"one", "baz"=>"two"}
  #     [].to_h # => {}
  #
  # With a block given, the block must return a 2-element array; calls the block
  # with each element of `self`; forms each returned array into a key-value pair
  # in the returned hash:
  #
  #     a = ['foo', :bar, 1, [2, 3], {baz: 4}]
  #     a.to_h {|element| [element, element.class] }
  #     # => {"foo"=>String, :bar=>Symbol, 1=>Integer, [2, 3]=>Array, {:baz=>4}=>Hash}
  #
  # Related: see [Methods for Converting](rdoc-ref:Array@Methods+for+Converting).
  #
  def to_h: () -> Hash[untyped, untyped]
          | [T, S] () { (Elem) -> [ T, S ] } -> Hash[T, S]

# 
  # Returns the new string formed by calling method `#inspect` on each array
  # element:
  #
  #     a = [:foo, 'bar', 2]
  #     a.inspect # => "[:foo, \"bar\", 2]"
  #
  # Related: see [Methods for Converting](rdoc-ref:Array@Methods+for+Converting).
  #
  alias to_s inspect

# 
  # Returns a new array that is `self` as a [transposed
  # matrix](https://en.wikipedia.org/wiki/Transpose):
  #
  #     a = [[:a0, :a1], [:b0, :b1], [:c0, :c1]]
  #     a.transpose # => [[:a0, :b0, :c0], [:a1, :b1, :c1]]
  #
  # The elements of `self` must all be the same size.
  #
  # Related: see [Methods for Converting](rdoc-ref:Array@Methods+for+Converting).
  #
  def transpose: () -> ::Array[::Array[untyped]]

# 
  # Returns a new array that is the union of the elements of `self` and all given
  # arrays `other_arrays`; items are compared using `eql?`:
  #
  #     [0, 1, 2, 3].union([4, 5], [6, 7]) # => [0, 1, 2, 3, 4, 5, 6, 7]
  #
  # Removes duplicates (preserving the first found):
  #
  #     [0, 1, 1].union([2, 1], [3, 1]) # => [0, 1, 2, 3]
  #
  # Preserves order (preserving the position of the first found):
  #
  #     [3, 2, 1, 0].union([5, 3], [4, 2]) # => [3, 2, 1, 0, 5, 4]
  #
  # With no arguments given, returns a copy of `self`.
  #
  # Related: see [Methods for Combining](rdoc-ref:Array@Methods+for+Combining).
  #
  def union: [T] (*::Array[T] other_arys) -> ::Array[T | Elem]

# 
  # Returns a new array containing those elements from `self` that are not
  # duplicates, the first occurrence always being retained.
  #
  # With no block given, identifies and omits duplicate elements using method
  # `eql?` to compare elements:
  #
  #     a = [0, 0, 1, 1, 2, 2]
  #     a.uniq # => [0, 1, 2]
  #
  # With a block given, calls the block for each element; identifies and omits
  # "duplicate" elements using method `eql?` to compare *block return values*;
  # that is, an element is a duplicate if its block return value is the same as
  # that of a previous element:
  #
  #     a = ['a', 'aa', 'aaa', 'b', 'bb', 'bbb']
  #     a.uniq {|element| element.size } # => ["a", "aa", "aaa"]
  #
  # Related: [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def uniq: () -> ::Array[Elem]
          | () { (Elem item) -> untyped } -> ::Array[Elem]

# 
  # Removes duplicate elements from `self`, the first occurrence always being
  # retained; returns `self` if any elements removed, `nil` otherwise.
  #
  # With no block given, identifies and removes elements using method `eql?` to
  # compare elements:
  #
  #     a = [0, 0, 1, 1, 2, 2]
  #     a.uniq! # => [0, 1, 2]
  #     a.uniq! # => nil
  #
  # With a block given, calls the block for each element; identifies and omits
  # "duplicate" elements using method `eql?` to compare *block return values*;
  # that is, an element is a duplicate if its block return value is the same as
  # that of a previous element:
  #
  #     a = ['a', 'aa', 'aaa', 'b', 'bb', 'bbb']
  #     a.uniq! {|element| element.size } # => ["a", "aa", "aaa"]
  #     a.uniq! {|element| element.size } # => nil
  #
  # Related: see [Methods for Deleting](rdoc-ref:Array@Methods+for+Deleting).
  #
  def uniq!: () -> self?
           | () { (Elem) -> untyped } -> self?

# 
  # Prepends the given `objects` to `self`:
  #
  #     a = [:foo, 'bar', 2]
  #     a.unshift(:bam, :bat) # => [:bam, :bat, :foo, "bar", 2]
  #
  # Related: Array#shift; see also [Methods for
  # Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def unshift: (*Elem obj) -> self

# 
  # Returns elements from `self` in a new array; does not modify `self`.
  #
  # The objects included in the returned array are the elements of `self` selected
  # by the given `specifiers`, each of which must be a numeric index or a Range.
  #
  # In brief:
  #
  #     a = ['a', 'b', 'c', 'd']
  #
  #     # Index specifiers.
  #     a.values_at(2, 0, 2, 0)     # => ["c", "a", "c", "a"] # May repeat.
  #     a.values_at(-4, -3, -2, -1) # => ["a", "b", "c", "d"] # Counts backwards if negative.
  #     a.values_at(-50, 50)        # => [nil, nil]           # Outside of self.
  #
  #     # Range specifiers.
  #     a.values_at(1..3)       # => ["b", "c", "d"] # From range.begin to range.end.
  #     a.values_at(1...3)      # => ["b", "c"]      # End excluded.
  #     a.values_at(3..1)       # => []              # No such elements.
  #
  #     a.values_at(-3..3)  # => ["b", "c", "d"]     # Negative range.begin counts backwards.
  #     a.values_at(-50..3)                          # Raises RangeError.
  #
  #     a.values_at(1..-2)  # => ["b", "c"]          # Negative range.end counts backwards.
  #     a.values_at(1..-50) # => []                  # No such elements.
  #
  #     # Mixture of specifiers.
  #     a.values_at(2..3, 3, 0..1, 0) # => ["c", "d", "d", "a", "b", "a"]
  #
  # With no `specifiers` given, returns a new empty array:
  #
  #     a = ['a', 'b', 'c', 'd']
  #     a.values_at # => []
  #
  # For each numeric specifier `index`, includes an element:
  #
  # *   For each non-negative numeric specifier `index` that is in-range (less
  #     than `self.size`), includes the element at offset `index`:
  #
  #         a.values_at(0, 2)     # => ["a", "c"]
  #         a.values_at(0.1, 2.9) # => ["a", "c"]
  #
  # *   For each negative numeric `index` that is in-range (greater than or equal
  #     to `- self.size`), counts backwards from the end of `self`:
  #
  #         a.values_at(-1, -4) # => ["d", "a"]
  #
  # The given indexes may be in any order, and may repeat:
  #
  #     a.values_at(2, 0, 1, 0, 2) # => ["c", "a", "b", "a", "c"]
  #
  # For each `index` that is out-of-range, includes `nil`:
  #
  #     a.values_at(4, -5) # => [nil, nil]
  #
  # For each Range specifier `range`, includes elements according to `range.begin`
  # and `range.end`:
  #
  # *   If both `range.begin` and `range.end` are non-negative and in-range (less
  #     than `self.size`), includes elements from index `range.begin` through
  #     `range.end - 1` (if `range.exclude_end?`), or through `range.end`
  #     (otherwise):
  #
  #         a.values_at(1..2)  # => ["b", "c"]
  #         a.values_at(1...2) # => ["b"]
  #
  # *   If `range.begin` is negative and in-range (greater than or equal to `-
  #     self.size`), counts backwards from the end of `self`:
  #
  #         a.values_at(-2..3) # => ["c", "d"]
  #
  # *   If `range.begin` is negative and out-of-range, raises an exception:
  #
  #         a.values_at(-5..3) # Raises RangeError.
  #
  # *   If `range.end` is positive and out-of-range, extends the returned array
  #     with `nil` elements:
  #
  #         a.values_at(1..5) # => ["b", "c", "d", nil, nil]
  #
  # *   If `range.end` is negative and in-range, counts backwards from the end of
  #     `self`:
  #
  #         a.values_at(1..-2) # => ["b", "c"]
  #
  # *   If `range.end` is negative and out-of-range, returns an empty array:
  #
  #         a.values_at(1..-5) # => []
  #
  # The given ranges may be in any order and may repeat:
  #
  #     a.values_at(2..3, 0..1, 2..3) # => ["c", "d", "a", "b", "c", "d"]
  #
  # The given specifiers may be any mixture of indexes and ranges:
  #
  #     a.values_at(3, 1..2, 0, 2..3) # => ["d", "b", "c", "a", "c", "d"]
  #
  # Related: see [Methods for Fetching](rdoc-ref:Array@Methods+for+Fetching).
  #
  def values_at: (*int | ::Range[::Integer] selector) -> ::Array[Elem?]

# 
  # With no block given, combines `self` with the collection of `other_arrays`;
  # returns a new array of sub-arrays:
  #
  #     [0, 1].zip(['zero', 'one'], [:zero, :one])
  #     # => [[0, "zero", :zero], [1, "one", :one]]
  #
  # Returned:
  #
  # *   The outer array is of size `self.size`.
  # *   Each sub-array is of size `other_arrays.size + 1`.
  # *   The *nth* sub-array contains (in order):
  #
  #     *   The *nth* element of `self`.
  #     *   The *nth* element of each of the other arrays, as available.
  #
  # Example:
  #
  #     a = [0, 1]
  #     zipped = a.zip(['zero', 'one'], [:zero, :one])
  #     # => [[0, "zero", :zero], [1, "one", :one]]
  #     zipped.size       # => 2 # Same size as a.
  #     zipped.first.size # => 3 # Size of other arrays plus 1.
  #
  # When the other arrays are all the same size as `self`, the returned sub-arrays
  # are a rearrangement containing exactly elements of all the arrays (including
  # `self`), with no omissions or additions:
  #
  #     a = [:a0, :a1, :a2, :a3]
  #     b = [:b0, :b1, :b2, :b3]
  #     c = [:c0, :c1, :c2, :c3]
  #     d = a.zip(b, c)
  #     pp d
  #     # =>
  #     [[:a0, :b0, :c0],
  #      [:a1, :b1, :c1],
  #      [:a2, :b2, :c2],
  #      [:a3, :b3, :c3]]
  #
  # When one of the other arrays is smaller than `self`, pads the corresponding
  # sub-array with `nil` elements:
  #
  #     a = [:a0, :a1, :a2, :a3]
  #     b = [:b0, :b1, :b2]
  #     c = [:c0, :c1]
  #     d = a.zip(b, c)
  #     pp d
  #     # =>
  #     [[:a0, :b0, :c0],
  #      [:a1, :b1, :c1],
  #      [:a2, :b2, nil],
  #      [:a3, nil, nil]]
  #
  # When one of the other arrays is larger than `self`, *ignores* its trailing
  # elements:
  #
  #     a = [:a0, :a1, :a2, :a3]
  #     b = [:b0, :b1, :b2, :b3, :b4]
  #     c = [:c0, :c1, :c2, :c3, :c4, :c5]
  #     d = a.zip(b, c)
  #     pp d
  #     # =>
  #     [[:a0, :b0, :c0],
  #      [:a1, :b1, :c1],
  #      [:a2, :b2, :c2],
  #      [:a3, :b3, :c3]]
  #
  # With a block given, calls the block with each of the other arrays; returns
  # `nil`:
  #
  #     d = []
  #     a = [:a0, :a1, :a2, :a3]
  #     b = [:b0, :b1, :b2, :b3]
  #     c = [:c0, :c1, :c2, :c3]
  #     a.zip(b, c) {|sub_array| d.push(sub_array.reverse) } # => nil
  #     pp d
  #     # =>
  #     [[:c0, :b0, :a0],
  #      [:c1, :b1, :a1],
  #      [:c2, :b2, :a2],
  #      [:c3, :b3, :a3]]
  #
  # For an **object** in **other_arrays** that is not actually an array, forms the
  # the "other array" as `object.to_ary`, if defined, or as `object.each.to_a`
  # otherwise.
  #
  # Related: see [Methods for Converting](rdoc-ref:Array@Methods+for+Converting).
  #
  def zip: [U] (_Each[U] arg) -> Array[[ Elem, U? ]]
         | (_Each[untyped] arg, *_Each[untyped] args) -> Array[Array[untyped]]
         | [U] (_Each[U] arg) { ([ Elem, U? ]) -> void } -> nil
         | (_Each[untyped] arg, *_Each[untyped] args) { (Array[untyped]) -> void } -> nil

# 
  # Returns the union of `self` and `other_array`; duplicates are removed; order
  # is preserved; items are compared using `eql?`:
  #
  #     [0, 1] | [2, 3] # => [0, 1, 2, 3]
  #     [0, 1, 1] | [2, 2, 3] # => [0, 1, 2, 3]
  #     [0, 1, 2] | [3, 2, 1, 0] # => [0, 1, 2, 3]
  #
  # Related: see [Methods for Combining](rdoc-ref:Array@Methods+for+Combining).
  #
  def |: [T] (::Array[T] other_ary) -> ::Array[Elem | T]

private

# 
  # Replaces the elements of `self` with the elements of `other_array`, which must
  # be an [array-convertible
  # object](rdoc-ref:implicit_conversion.rdoc@Array-Convertible+Objects); returns
  # `self`:
  #
  #     a = ['a', 'b', 'c']   # => ["a", "b", "c"]
  #     a.replace(['d', 'e']) # => ["d", "e"]
  #
  # Related: see [Methods for Assigning](rdoc-ref:Array@Methods+for+Assigning).
  #
  def initialize_copy: (self other_ary) -> void
end

interface _Rand
  def rand: (::Integer max) -> ::Integer
end

interface Array::_Pattern[T]
  def ===: (T) -> bool
end