class Array(T)
Overview
An Array
is an ordered, integer-indexed collection of objects of type T.
Array indexing starts at 0. A negative index is assumed to be relative to the end of the array: -1 indicates the last element, -2 is the next to last element, and so on.
An Array
can be created using the usual new
method (several are provided), or with an array literal:
Array(Int32).new # => []
[1, 2, 3] # Array(Int32)
[1, "hello", 'x'] # Array(Int32 | String | Char)
An Array
can have mixed types, meaning T will be a union of types, but these are determined
when the array is created, either by specifying T or by using an array literal. In the latter
case, T will be set to the union of the array literal elements' types.
When creating an empty array you must always specify T:
[] of Int32 # same as Array(Int32)
[] # syntax error
An Array
is implemented using an internal buffer of some capacity
and is reallocated when elements are pushed to it when more capacity
is needed. This is normally known as a dynamic array.
You can use a special array literal syntax with other types too, as long as they define an argless
new
method and a #<<
method. Set
is one such type:
set = Set{1, 2, 3} # => Set{1, 2, 3}
set.class # => Set(Int32)
The above is the same as this:
set = Set(typeof(1, 2, 3)).new
set << 1
set << 2
set << 3
Included Modules
Defined in:
array.crjson/any.cr
json/to_json.cr
yaml/any.cr
yaml/to_yaml.cr
Constructors
-
.build(capacity : Int, &block) : self
Creates a new
Array
, allocating an internal buffer with the given capacity, and yielding that buffer. -
.new(size : Int, value : T)
Creates a new
Array
of the given size filled with the same value in each position. - .new(ctx : YAML::ParseContext, node : YAML::Nodes::Node)
-
.new(initial_capacity : Int)
Creates a new empty
Array
backed by a buffer that is initiallyinitial_capacity
big. - .new(pull : JSON::PullParser)
-
.new
Creates a new empty Array.
- .new(ctx : YAML::ParseContext, node : YAML::Nodes::Node, &block)
-
.new(size : Int, &block : Int32 -> T)
Creates a new
Array
of the given size and invokes the given block once for each index ofself
, assigning the block's value in that index. - .new(pull : JSON::PullParser, &block)
Class Method Summary
- .each_product(arrays : Array(Array), reuse = false, &block)
- .each_product(*arrays : Array, reuse = false, &block)
- .from_json(string_or_io, &block) : Nil
- .from_yaml(string_or_io : String | IO, &block)
- .product(arrays)
- .product(*arrays : Array)
Instance Method Summary
-
#&(other : Array(U)) forall U
Set intersection: returns a new
Array
containing elements common toself
and other, excluding any duplicates. -
#*(times : Int)
Repetition: Returns a new
Array
built by concatenating times copies ofself
. -
#+(other : Array(U)) forall U
Concatenation.
-
#-(other : Array(U)) forall U
Difference.
-
#<<(value : T)
Append.
-
#<=>(other : Array)
Combined comparison operator.
-
#==(other : Array)
Equality.
- #==(other : JSON::Any)
- #==(other : YAML::Any)
-
#[](range : Range(Int, Int))
Returns all elements that are within the given range.
-
#[](start : Int, count : Int)
Returns count or less (if there aren't enough) elements starting at the given start index.
-
#[]=(range : Range(Int, Int), value : T)
Replaces a subrange with a single value.
-
#[]=(index : Int, value : T)
Sets the given value at the given index.
-
#[]=(index : Int, count : Int, values : Array(T))
Replaces a subrange with the elements of the given array.
-
#[]=(index : Int, count : Int, value : T)
Replaces a subrange with a single value.
-
#[]=(range : Range(Int, Int), values : Array(T))
Replaces a subrange with the elements of the given array.
-
#clear
Removes all elements from self.
-
#clone
Returns a new
Array
that hasself
's elements cloned. - #combinations(size : Int = self.size)
-
#compact
Returns a copy of
self
with allnil
elements removed. -
#compact!
Removes all
nil
elements fromself
and returnsself
. -
#concat(other : Array)
Appends the elements of other to
self
, and returnsself
. -
#concat(other : Enumerable)
Appends the elements of other to
self
, and returnsself
. -
#delete(obj)
Removes all items from
self
that are equal to obj. -
#delete_at(index : Int, count : Int)
Removes count elements from
self
starting at index. -
#delete_at(index : Int)
Removes the element at index, returning that element.
-
#delete_at(range : Range(Int, Int))
Removes all elements within the given range.
-
#dup
Returns a new
Array
that has exactlyself
's elements. - #each_combination(size : Int = self.size, reuse = false, &block) : Nil
- #each_combination(size : Int = self.size, reuse = false)
-
#each_permutation(size : Int = self.size, reuse = false, &block) : Nil
Yields each possible permutation of size of
self
. -
#each_permutation(size : Int = self.size, reuse = false)
Returns an
Iterator
over each possible permutation of size ofself
. - #each_repeated_combination(size : Int = self.size, reuse = false, &block) : Nil
- #each_repeated_combination(size : Int = self.size, reuse = false)
- #each_repeated_permutation(size : Int = self.size, reuse = false, &block) : Nil
-
#fill(from : Int, count : Int, &block)
Yields each index of
self
, starting at from and just count times, to the given block and then assigns the block's value in that position. -
#fill(from : Int, &block)
Yields each index of
self
, starting at from, to the given block and then assigns the block's value in that position. -
#fill(range : Range(Int, Int), &block)
Yields each index of
self
, in the given range, to the given block and then assigns the block's value in that position. -
#fill(&block)
Yields each index of
self
to the given block and then assigns the block's value in that position. -
#fill(value : T, from : Int, count : Int)
Replaces every element in
self
, starting at from and only count times, with the given value. -
#fill(value : T, from : Int)
Replaces every element in
self
, starting at from, with the given value. -
#fill(value : T, range : Range(Int, Int))
Replaces every element in range with value.
-
#fill(value : T)
Replaces every element in
self
with the given value. -
#first(n : Int)
Returns the first n elements of the array.
-
#flatten
Returns a new
Array
that is a one-dimensional flattening ofself
(recursively). -
#insert(index : Int, object : T)
Insert object before the element at index and shifting successive elements, if any.
-
#last(n : Int)
Returns the last n elements of the array.
-
#map(&block : T -> U) forall U
Optimized version of
Enumerable#map
. -
#map!(&block)
Invokes the given block for each element of
self
, replacing the element with the value returned by the block. -
#map_with_index(&block : T, Int32 -> U) forall U
Optimized version of
Enumerable#map_with_index
. -
#map_with_index!(&block : T, Int32 -> T)
Like
#map_with_index
, but mutatesself
instead of allocating a new object. -
#permutations(size : Int = self.size)
Returns an
Array
with all possible permutations of size. -
#pop(n : Int)
Removes the last n values from
self
, at index size - 1. -
#pop
Removes the last value from
self
, at index size - 1. -
#pop(&block)
Removes the last value from
self
. -
#pop?
Like
#pop
, but returnsnil
ifself
is empty. - #pretty_print(pp) : Nil
- #product(ary : Array(U)) forall U
- #product(enumerable : Enumerable, &block)
-
#push(value : T)
Append.
-
#push(*values : T)
Append multiple values.
-
#reject!(&block)
Modifies
self
, deleting the elements in the collection for which the passed block returnstrue
. -
#reject!(pattern)
Modifies
self
, deleting the elements in the collection for whichpattern === element
. - #repeated_combinations(size : Int = self.size)
- #repeated_permutations(size : Int = self.size)
- #replace(other : Array)
-
#reverse
Returns an array with all the elements in the collection reversed.
-
#reverse!
Reverses in-place all the elements of
self
. - #rotate(n = 1)
- #rotate!(n = 1)
-
#sample(n : Int, random = Random::DEFAULT)
Returns n number of random elements from
self
, using the given random number generator. -
#select!(pattern)
Modifies
self
, keeping only the elements in the collection for whichpattern === element
. -
#select!(&block)
Modifies
self
, keeping only the elements in the collection for which the passed block returnstrue
. -
#shift(n : Int)
Removes the first n values of
self
, starting at index 0. -
#shift
Removes the first value of
self
, at index 0. - #shift(&block)
-
#shift?
Removes the first value of
self
, at index 0. -
#shuffle(random = Random::DEFAULT)
Returns an array with all the elements in the collection randomized using the given random number generator.
-
#shuffle!(random = Random::DEFAULT)
Modifies
self
by randomizing the order of elements in the collection using the given random number generator. -
#size : Int32
Returns the number of elements in the array.
-
#skip(count : Int) : Array(T)
Returns an
Array
with the first count elements removed from the original array. -
#sort : Array(T)
Returns a new array with all elements sorted based on the return value of their comparison method
#<=>
-
#sort(&block : T, T -> Int32) : Array(T)
Returns a new array with all elements sorted based on the comparator in the given block.
-
#sort! : Array(T)
Modifies
self
by sorting all elements based on the return value of their comparison method#<=>
-
#sort!(&block : T, T -> Int32) : Array(T)
Modifies
self
by sorting all elements based on the comparator in the given block. -
#sort_by(&block : T -> UNDERSCORE) : Array(T)
Returns a new array with all elements sorted.
-
#sort_by!(&block : T -> UNDERSCORE) : Array(T)
Modifies
self
by sorting all elements. -
#swap(index0, index1) : Array(T)
Swaps the elements at index0 and index1 and returns
self
. - #to_a
- #to_json(json : JSON::Builder)
- #to_s(io : IO)
-
#to_unsafe : Pointer(T)
Returns a pointer to the internal buffer where
self
's elements are stored. - #to_yaml(yaml : YAML::Nodes::Builder)
-
#transpose
Assumes that
self
is an array of arrays and transposes the rows and columns. -
#uniq
Returns a new
Array
by removing duplicate values inself
. -
#uniq(&block : T -> UNDERSCORE)
Returns a new
Array
by removing duplicate values inself
, using the block's value for comparison. -
#uniq!
Removes duplicate elements from
self
. -
#uniq!(&block)
Removes duplicate elements from
self
, using the block's value for comparison. - #unsafe_fetch(index : Int)
-
#unshift(obj : T)
Prepend.
-
#unshift(*values : T)
Prepend multiple values.
- #update(index : Int, &block)
-
#|(other : Array(U)) forall U
Set union: returns a new
Array
by joiningself
with other, excluding any duplicates, and preserving the order fromself
.
Instance methods inherited from module Comparable(Array(T))
<(other : T)
<,
<=(other : T)
<=,
<=>(other : T)
<=>,
==(other : T)
==,
>(other : T)
>,
>=(other : T)
>=
Instance methods inherited from module Indexable(T)
[](index : Int)
[],
[]?(index : Int)
[]?,
bsearch(&block)
bsearch,
bsearch_index(&block)
bsearch_index,
dig(index : Int, *subindexes)
dig,
dig?(index : Int, *subindexes)
dig?,
each(&block)each
each(*, start : Int, count : Int, &block)
each(*, within range : Range(Int, Int), &block) each, each_index(*, start : Int, count : Int, &block)
each_index(&block) : Nil
each_index each_index, empty? empty?, equals?(other, &block)
equals?(other : Indexable, &block) equals?, fetch(index, default)
fetch(index : Int, &block) fetch, first(&block)
first first, first? first?, hash(hasher) hash, index(object, offset : Int = 0)
index(offset : Int = 0, &block) index, join(separator = "") join, last
last(&block) last, last? last?, reverse_each(&block) : Nil
reverse_each reverse_each, rindex(value, offset = size - 1)
rindex(offset = size - 1, &block) rindex, sample(random = Random::DEFAULT) sample, size size, to_a to_a, unsafe_fetch(index : Int) unsafe_fetch, values_at(*indexes : Int) values_at, zip(other : Indexable(U), &block : T, U -> ) forall U
zip(other : Indexable(U)) : Array(Tuple(T, U)) forall U zip, zip?(other : Indexable(U), &block : T, U? -> ) forall U
zip?(other : Indexable(U)) : Array(Tuple(T, U?)) forall U zip?
Instance methods inherited from module Enumerable(T)
all?(&block)all?(pattern)
all? all?, any?(&block)
any?(pattern)
any? any?, chunks(&block : T -> U) forall U chunks, compact_map(&block) compact_map, count(item)
count(&block) count, cycle(&block)
cycle(n, &block) cycle, each(&block : T -> UNDERSCORE) each, each_cons(count : Int, reuse = false, &block) each_cons, each_slice(count : Int, reuse = false, &block) each_slice, each_with_index(offset = 0, &block) each_with_index, each_with_object(obj, &block) each_with_object, find(if_none = nil, &block) find, first(count : Int)
first first, first? first?, flat_map(&block : T -> Array(U) | Iterator(U) | U) forall U flat_map, grep(pattern) grep, group_by(&block : T -> U) forall U group_by, in_groups_of(size : Int, filled_up_with : U = nil) forall U
in_groups_of(size : Int, filled_up_with : U = nil, reuse = false, &block) forall U in_groups_of, includes?(obj) includes?, index(&block)
index(obj) index, index_by(&block : T -> U) forall U index_by, join(separator, io)
join(separator = "")
join(separator, io, &block)
join(separator = "", &block) join, map(&block : T -> U) forall U map, map_with_index(&block : T, Int32 -> U) forall U map_with_index, max max, max? max?, max_by(&block : T -> U) forall U max_by, max_by?(&block : T -> U) forall U max_by?, max_of(&block : T -> U) forall U max_of, max_of?(&block : T -> U) forall U max_of?, min min, min? min?, min_by(&block : T -> U) forall U min_by, min_by?(&block : T -> U) forall U min_by?, min_of(&block : T -> U) forall U min_of, min_of?(&block : T -> U) forall U min_of?, minmax minmax, minmax? minmax?, minmax_by(&block : T -> U) forall U minmax_by, minmax_by?(&block : T -> U) forall U minmax_by?, minmax_of(&block : T -> U) forall U minmax_of, minmax_of?(&block : T -> U) forall U minmax_of?, none?(&block)
none?(pattern)
none? none?, one?(&block)
one?(pattern)
one? one?, partition(&block) partition, product
product(initial : Number, &block)
product(&block)
product(initial : Number) product, reduce(memo, &block)
reduce(&block) reduce, reject(&block : T -> )
reject(type : U.class) forall U
reject(pattern) reject, select(type : U.class) forall U
select(&block : T -> )
select(pattern) select, size size, skip(count : Int) skip, skip_while(&block) skip_while, sum(initial)
sum
sum(initial, &block)
sum(&block) sum, take_while(&block) take_while, to_a to_a, to_h
to_h(&block : T -> Tuple(K, V)) forall K, V to_h, to_set to_set
Instance methods inherited from module Iterable(T)
chunk(reuse = false, &block : T -> U) forall U
chunk,
chunk_while(reuse : Bool | Array(T) = false, &block : T, T -> B) forall B
chunk_while,
cycle(n)cycle cycle, each each, each_cons(count : Int, reuse = false) each_cons, each_slice(count : Int, reuse = false) each_slice, each_with_index(offset = 0) each_with_index, each_with_object(obj) each_with_object, slice_after(reuse : Bool | Array(T) = false, &block : T -> B) forall B
slice_after(pattern, reuse : Bool | Array(T) = false) slice_after, slice_before(reuse : Bool | Array(T) = false, &block : T -> B) forall B
slice_before(pattern, reuse : Bool | Array(T) = false) slice_before, slice_when(reuse : Bool | Array(T) = false, &block : T, T -> B) forall B slice_when
Instance methods inherited from class Reference
==(other : self)==(other : JSON::Any)
==(other : YAML::Any)
==(other) ==, dup dup, hash(hasher) hash, inspect(io : IO) : Nil inspect, object_id : UInt64 object_id, pretty_print(pp) : Nil pretty_print, same?(other : Reference)
same?(other : Nil) same?, to_s(io : IO) : Nil to_s
Constructor methods inherited from class Reference
new
new
Instance methods inherited from class Object
!=(other)
!=,
!~(other)
!~,
==(other)
==,
===(other : JSON::Any)===(other : YAML::Any)
===(other) ===, =~(other) =~, class class, dup dup, hash(hasher)
hash hash, inspect(io : IO)
inspect inspect, itself itself, not_nil! not_nil!, pretty_inspect(width = 79, newline = "\n", indent = 0) : String pretty_inspect, pretty_print(pp : PrettyPrint) : Nil pretty_print, tap(&block) tap, to_json(io : IO)
to_json to_json, to_pretty_json(indent : String = " ")
to_pretty_json(io : IO, indent : String = " ") to_pretty_json, to_s
to_s(io : IO) to_s, to_yaml(io : IO)
to_yaml to_yaml, try(&block) try, unsafe_as(type : T.class) forall T unsafe_as
Constructor methods inherited from class Object
from_json(string_or_io, root : String) : selffrom_json(string_or_io) : self from_json, from_yaml(string_or_io : String | IO) : self from_yaml
Constructor Detail
Creates a new Array
, allocating an internal buffer with the given capacity,
and yielding that buffer. The given block must return the desired size of the array.
This method is unsafe, but is usually used to initialize the buffer by passing it to a C function.
Array.build(3) do |buffer|
LibSome.fill_buffer_and_return_number_of_elements_filled(buffer)
end
Creates a new Array
of the given size filled with the same value in each position.
Array.new(3, 'a') # => ['a', 'a', 'a']
ary = Array.new(3, [1])
ary # => [[1], [1], [1]]
ary[0][0] = 2
ary # => [[2], [2], [2]]
Creates a new empty Array
backed by a buffer that is initially
initial_capacity
big.
The initial_capacity is useful to avoid unnecessary reallocations of the internal buffer in case of growth. If you have an estimate of the maximum number of elements an array will hold, the array should be initialized with that capacity for improved performance.
ary = Array(Int32).new(5)
ary.size # => 0
Creates a new Array
of the given size and invokes the given block once
for each index of self
, assigning the block's value in that index.
Array.new(3) { |i| (i + 1) ** 2 } # => [1, 4, 9]
ary = Array.new(3) { [1] }
ary # => [[1], [1], [1]]
ary[0][0] = 2
ary # => [[2], [1], [1]]
Class Method Detail
Parses a String
or IO
denoting a JSON array, yielding
each of its elements to the given block. This is useful
for decoding an array and processing its elements without
creating an Array in memory, which might be expensive.
require "json"
Array(Int32).from_json("[1, 2, 3]") do |element|
puts element
end
Output:
1
2
3
To parse and get an Array
, use the block-less overload.
Instance Method Detail
Set intersection: returns a new Array
containing elements common to self
and other, excluding any duplicates. The order is preserved from self
.
[1, 1, 3, 5] & [1, 2, 3] # => [ 1, 3 ]
['a', 'b', 'b', 'z'] & ['a', 'b', 'c'] # => [ 'a', 'b' ]
See also: #uniq
.
Repetition: Returns a new Array
built by concatenating times copies of self
.
["a", "b", "c"] * 2 # => [ "a", "b", "c", "a", "b", "c" ]
Concatenation. Returns a new Array
built by concatenating self
and other.
The type of the new array is the union of the types of both the original arrays.
[1, 2] + ["a"] # => [1,2,"a"] of (Int32 | String)
[1, 2] + [2, 3] # => [1,2,2,3]
Difference. Returns a new Array
that is a copy of self
, removing any items
that appear in other. The order of self
is preserved.
[1, 2, 3] - [2, 1] # => [3]
Combined comparison operator. Returns 0 if self
equals other, 1 if
self
is greater than other and -1 if self
is smaller than other.
It compares the elements of both arrays in the same position using the
#<=>
operator. As soon as one of such comparisons returns a non-zero
value, that result is the return value of the comparison.
If all elements are equal, the comparison is based on the size of the arrays.
[8] <=> [1, 2, 3] # => 1
[2] <=> [4, 2, 3] # => -1
[1, 2] <=> [1, 2] # => 0
Equality. Returns true
if each element in self
is equal to each
corresponding element in other.
ary = [1, 2, 3]
ary == [1, 2, 3] # => true
ary == [2, 3] # => false
Returns all elements that are within the given range.
Negative indices count backward from the end of the array (-1 is the last element). Additionally, an empty array is returned when the starting index for an element range is at the end of the array.
Raises IndexError
if the starting index is out of range.
a = ["a", "b", "c", "d", "e"]
a[1..3] # => ["b", "c", "d"]
a[4..7] # => ["e"]
a[6..10] # raise IndexError
a[5..10] # => []
a[-2...-1] # => ["d"]
Returns count or less (if there aren't enough) elements starting at the given start index.
Negative indices count backward from the end of the array (-1 is the last element). Additionally, an empty array is returned when the starting index for an element range is at the end of the array.
Raises IndexError
if the starting index is out of range.
a = ["a", "b", "c", "d", "e"]
a[-3, 3] # => ["c", "d", "e"]
a[6, 1] # raise IndexError
a[1, 2] # => ["b", "c"]
a[5, 1] # => []
Replaces a subrange with a single value.
a = [1, 2, 3, 4, 5]
a[1..3] = 6
a # => [1, 6, 5]
a = [1, 2, 3, 4, 5]
a[1...1] = 6
a # => [1, 6, 2, 3, 4, 5]
Sets the given value at the given index.
Negative indices can be used to start counting from the end of the array.
Raises IndexError
if trying to set an element outside the array's range.
ary = [1, 2, 3]
ary[0] = 5
p ary # => [5,2,3]
ary[3] = 5 # raises IndexError
Replaces a subrange with the elements of the given array.
a = [1, 2, 3, 4, 5]
a[1, 3] = [6, 7, 8]
a # => [1, 6, 7, 8, 5]
a = [1, 2, 3, 4, 5]
a[1, 3] = [6, 7]
a # => [1, 6, 7, 5]
a = [1, 2, 3, 4, 5]
a[1, 3] = [6, 7, 8, 9, 10]
a # => [1, 6, 7, 8, 9, 10, 5]
Replaces a subrange with a single value. All elements in the range
index...index+count
are removed and replaced by a single element
value.
If count is zero, value is inserted at index.
Negative values of index count from the end of the array.
a = [1, 2, 3, 4, 5]
a[1, 3] = 6
a # => [1, 6, 5]
a = [1, 2, 3, 4, 5]
a[1, 0] = 6
a # => [1, 6, 2, 3, 4, 5]
Replaces a subrange with the elements of the given array.
a = [1, 2, 3, 4, 5]
a[1..3] = [6, 7, 8]
a # => [1, 6, 7, 8, 5]
a = [1, 2, 3, 4, 5]
a[1..3] = [6, 7]
a # => [1, 6, 7, 5]
a = [1, 2, 3, 4, 5]
a[1..3] = [6, 7, 8, 9, 10]
a # => [1, 6, 7, 8, 9, 10, 5]
Returns a new Array
that has self
's elements cloned.
That is, it returns a deep copy of self
.
Use #dup
if you want a shallow copy.
ary = [[1, 2], [3, 4]]
ary2 = ary.clone
ary[0][0] = 5
ary # => [[5, 2], [3, 4]]
ary2 # => [[1, 2], [3, 4]]
ary2 << [7, 8]
ary # => [[5, 2], [3, 4]]
ary2 # => [[1, 2], [3, 4], [7, 8]]
Returns a copy of self
with all nil
elements removed.
["a", nil, "b", nil, "c", nil].compact # => ["a", "b", "c"]
Removes all nil
elements from self
and returns self
.
ary = ["a", nil, "b", nil, "c"]
ary.compact!
ary # => ["a", "b", "c"]
Appends the elements of other to self
, and returns self
.
ary = ["a", "b"]
ary.concat(["c", "d"])
ary # => ["a", "b", "c", "d"]
Appends the elements of other to self
, and returns self
.
ary = ["a", "b"]
ary.concat(["c", "d"])
ary # => ["a", "b", "c", "d"]
Removes all items from self
that are equal to obj.
Returns the last found element that was equal to obj,
if any, or nil
if not found.
a = ["a", "b", "b", "b", "c"]
a.delete("b") # => "b"
a # => ["a", "c"]
a.delete("x") # => nil
a # => ["a", "c"]
Removes count elements from self
starting at index.
If the size of self
is less than count, removes values to the end of the array without error.
Returns an array of the removed elements with the original order of self
preserved.
Raises IndexError
if index is out of range.
a = ["ant", "bat", "cat", "dog"]
a.delete_at(1, 2) # => ["bat", "cat"]
a # => ["ant", "dog"]
a.delete_at(99, 1) # raises IndexError
Removes the element at index, returning that element.
Raises IndexError
if index is out of range.
a = ["ant", "bat", "cat", "dog"]
a.delete_at(2) # => "cat"
a # => ["ant", "bat", "dog"]
a.delete_at(99) # raises IndexError
Removes all elements within the given range.
Returns an array of the removed elements with the original order of self
preserved.
Raises IndexError
if the index is out of range.
a = ["ant", "bat", "cat", "dog"]
a.delete_at(1..2) # => ["bat", "cat"]
a # => ["ant", "dog"]
a.delete_at(99..100) # raises IndexError
Returns a new Array
that has exactly self
's elements.
That is, it returns a shallow copy of self
.
Use #clone
if you want a deep copy.
ary = [[1, 2], [3, 4]]
ary2 = ary.dup
ary[0][0] = 5
ary # => [[5, 2], [3, 4]]
ary2 # => [[5, 2], [3, 4]]
ary2 << [7, 8]
ary # => [[5, 2], [3, 4]]
ary2 # => [[5, 2], [3, 4], [7, 8]]
Yields each possible permutation of size of self
.
a = [1, 2, 3]
sums = [] of Int32
a.each_permutation(2) { |p| sums << p.sum } # => nil
sums # => [3, 4, 3, 5, 4, 5]
By default, a new array is created and yielded for each permutation.
If reuse is given, the array can be reused: if reuse is
an Array
, this array will be reused; if reuse if truthy,
the method will create a new array and reuse it. This can be
used to prevent many memory allocations when each slice of
interest is to be used in a read-only fashion.
Returns an Iterator
over each possible permutation of size of self
.
iter = [1, 2, 3].each_permutation
iter.next # => [1, 2, 3]
iter.next # => [1, 3, 2]
iter.next # => [2, 1, 3]
iter.next # => [2, 3, 1]
iter.next # => [3, 1, 2]
iter.next # => [3, 2, 1]
iter.next # => #<Iterator::Stop>
By default, a new array is created and returned for each permutation.
If reuse is given, the array can be reused: if reuse is
an Array
, this array will be reused; if reuse if truthy,
the method will create a new array and reuse it. This can be
used to prevent many memory allocations when each slice of
interest is to be used in a read-only fashion.
Yields each index of self
, starting at from and just count times,
to the given block and then assigns the block's value in that position. Returns self
.
Negative values of from count from the end of the array.
Raises IndexError
if from is outside the array range.
Has no effect if count is zero or negative.
a = [1, 2, 3, 4, 5, 6]
a.fill(2, 2) { |i| i * i } # => [1, 2, 4, 9, 5, 6]
Yields each index of self
, starting at from, to the given block and then assigns
the block's value in that position. Returns self
.
Negative values of from count from the end of the array.
Raises IndexError
if from is outside the array range.
a = [1, 2, 3, 4]
a.fill(2) { |i| i * i } # => [1, 2, 4, 9]
Yields each index of self
, in the given range, to the given block and then assigns
the block's value in that position. Returns self
.
a = [1, 2, 3, 4, 5, 6]
a.fill(2..3) { |i| i * i } # => [1, 2, 4, 9, 5, 6]
Yields each index of self
to the given block and then assigns
the block's value in that position. Returns self
.
a = [1, 2, 3, 4]
a.fill { |i| i * i } # => [0, 1, 4, 9]
Replaces every element in self
, starting at from and only count times,
with the given value. Returns self
.
Negative values of from count from the end of the array.
a = [1, 2, 3, 4, 5]
a.fill(9, 2, 2) # => [1, 2, 9, 9, 5]
Replaces every element in self
, starting at from, with the given value. Returns self
.
Negative values of from count from the end of the array.
a = [1, 2, 3, 4, 5]
a.fill(9, 2) # => [1, 2, 9, 9, 9]
Replaces every element in range with value. Returns self
.
Negative values of from count from the end of the array.
a = [1, 2, 3, 4, 5]
a.fill(9, 2..3) # => [1, 2, 9, 9, 5]
Replaces every element in self
with the given value. Returns self
.
a = [1, 2, 3]
a.fill(9) # => [9, 9, 9]
Returns the first n elements of the array.
[1, 2, 3].first(2) # => [1, 2]
[1, 2, 3].first(4) # => [1, 2, 3]
Returns a new Array
that is a one-dimensional flattening of self
(recursively).
That is, for every element that is an array or an iterator, extract its elements into the new array.
s = [1, 2, 3] # => [1, 2, 3]
t = [4, 5, 6, [7, 8]] # => [4, 5, 6, [7, 8]]
u = [9, [10, 11].each] # => [9, #<Indexable::ItemIterator>]
a = [s, t, u, 12, 13] # => [[1, 2, 3], [4, 5, 6, [7, 8]], 9, #<Indexable::ItemIterator>, 12, 13]
a.flatten # => [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13]
Insert object before the element at index and shifting successive elements, if any.
Returns self
.
Negative values of index count from the end of the array.
a = ["a", "b", "c"]
a.insert(0, "x") # => ["x", "a", "b", "c"]
a.insert(2, "y") # => ["x", "a", "y", "b", "c"]
a.insert(-1, "z") # => ["x", "a", "y", "b", "c", "z"]
Returns the last n elements of the array.
[1, 2, 3].last(2) # => [2, 3]
[1, 2, 3].last(4) # => [1, 2, 3]
Invokes the given block for each element of self
, replacing the element
with the value returned by the block. Returns self
.
a = [1, 2, 3]
a.map! { |x| x * x }
a # => [1, 4, 9]
Optimized version of Enumerable#map_with_index
.
Like #map_with_index
, but mutates self
instead of allocating a new object.
Returns an Array
with all possible permutations of size.
a = [1, 2, 3]
a.permutations # => [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
a.permutations(1) # => [[1],[2],[3]]
a.permutations(2) # => [[1,2],[1,3],[2,1],[2,3],[3,1],[3,2]]
a.permutations(3) # => [[1,2,3],[1,3,2],[2,1,3],[2,3,1],[3,1,2],[3,2,1]]
a.permutations(0) # => [[]]
a.permutations(4) # => []
Removes the last n values from self
, at index size - 1.
This method returns an array of the removed values, with the original order preserved.
If n is greater than the size of self
, all values will be removed from self
without raising an error.
a = ["a", "b", "c"]
a.pop(2) # => ["b", "c"]
a # => ["a"]
a = ["a", "b", "c"]
a.pop(4) # => ["a", "b", "c"]
a # => []
Removes the last value from self
, at index size - 1.
This method returns the removed value.
Raises IndexError
if array is of 0 size.
a = ["a", "b", "c"]
a.pop # => "c"
a # => ["a", "b"]
Removes the last value from self
.
If the array is empty, the given block is called.
a = [1]
a.pop { "Testing" } # => 1
a.pop { "Testing" } # => "Testing"
Append. Pushes one value to the end of self
, given that the type of the value is T
(which might be a single type or a union of types).
This method returns self
, so several calls can be chained.
See #pop
for the opposite effect.
a = ["a", "b"]
a.push("c") # => ["a", "b", "c"]
a.push(1) # Errors, because the array only accepts String.
a = ["a", "b"] of (Int32 | String)
a.push("c") # => ["a", "b", "c"]
a.push(1) # => ["a", "b", "c", 1]
Append multiple values. The same as #push
, but takes an arbitrary number
of values to push into self
. Returns self
.
a = ["a"]
a.push("b", "c") # => ["a", "b", "c"]
Modifies self
, deleting the elements in the collection for which the
passed block returns true
. Returns self
.
ary = [1, 6, 2, 4, 8]
ary.reject! { |x| x > 3 }
ary # => [1, 2]
See also: Array#reject
.
Modifies self
, deleting the elements in the collection for which
pattern === element
.
ary = [1, 6, 2, 4, 8]
ary.reject!(3..7)
ary # => [1, 2, 8]
See also: Array#select!
.
Returns an array with all the elements in the collection reversed.
a = [1, 2, 3]
a.reverse # => [3, 2, 1]
Returns n number of random elements from self
, using the given random number generator.
Raises IndexError if self
is empty.
a = [1, 2, 3]
a.sample(2) # => [2, 1]
a.sample(2, Random.new(1)) # => [1, 3]
Modifies self
, keeping only the elements in the collection for which
pattern === element
.
ary = [1, 6, 2, 4, 8]
ary.select!(3..7)
ary # => [6, 4]
See also: Array#reject!
.
Modifies self
, keeping only the elements in the collection for which the
passed block returns true
. Returns self
.
ary = [1, 6, 2, 4, 8]
ary.select! { |x| x > 3 }
ary # => [6, 4, 8]
See also: Array#select
.
Removes the first n values of self
, starting at index 0.
This method returns an array of the removed values.
If n is greater than the size of self
, all values will be removed from self
without raising an error.
a = ["a", "b", "c"]
a.shift # => "a"
a # => ["b", "c"]
a = ["a", "b", "c"]
a.shift(4) # => ["a", "b", "c"]
a # => []
Removes the first value of self
, at index 0. This method returns the removed value.
If the array is empty, it raises IndexError
.
a = ["a", "b", "c"]
a.shift # => "a"
a # => ["b", "c"]
Removes the first value of self
, at index 0. This method returns the removed value.
If the array is empty, it returns nil
without raising any error.
a = ["a", "b"]
a.shift? # => "a"
a # => ["b"]
a.shift? # => "b"
a # => []
a.shift? # => nil
a # => []
Returns an array with all the elements in the collection randomized using the given random number generator.
Modifies self
by randomizing the order of elements in the collection
using the given random number generator. Returns self
.
Returns the number of elements in the array.
[:foo, :bar].size # => 2
Returns an Array
with the first count elements removed
from the original array.
If count is bigger than the number of elements in the array, returns an empty array.
[1, 2, 3, 4, 5, 6].skip(3) # => [4, 5, 6]
Returns a new array with all elements sorted based on the return value of
their comparison method #<=>
a = [3, 1, 2]
a.sort # => [1, 2, 3]
a # => [3, 1, 2]
Returns a new array with all elements sorted based on the comparator in the given block.
The block must implement a comparison between two elements a and b,
where a < b
returns -1
, a == b
returns 0
, and a > b
returns 1
.
The comparison operator #<=>
can be used for this.
a = [3, 1, 2]
b = a.sort { |a, b| b <=> a }
b # => [3, 2, 1]
a # => [3, 1, 2]
Modifies self
by sorting all elements based on the return value of their
comparison method #<=>
a = [3, 1, 2]
a.sort!
a # => [1, 2, 3]
Modifies self
by sorting all elements based on the comparator in the given
block.
The given block must implement a comparison between two elements
a and b, where a < b
returns -1
, a == b
returns 0
,
and a > b
returns 1
.
The comparison operator #<=>
can be used for this.
a = [3, 1, 2]
a.sort! { |a, b| b <=> a }
a # => [3, 2, 1]
Returns a new array with all elements sorted. The given block is called for each element, then the comparison method #<=> is called on the object returned from the block to determine sort order.
a = %w(apple pear fig)
b = a.sort_by { |word| word.size }
b # => ["fig", "pear", "apple"]
a # => ["apple", "pear", "fig"]
Modifies self
by sorting all elements. The given block is called for
each element, then the comparison method #<=> is called on the object
returned from the block to determine sort order.
a = %w(apple pear fig)
a.sort_by! { |word| word.size }
a # => ["fig", "pear", "apple"]
Swaps the elements at index0 and index1 and returns self
.
Raises an IndexError
if either index is out of bounds.
a = ["first", "second", "third"]
a.swap(1, 2) # => ["first", "third", "second"]
a # => ["first", "third", "second"]
a.swap(0, -1) # => ["second", "third", "first"]
a # => ["second", "third", "first"]
a.swap(2, 3) # => raises "Index out of bounds (IndexError)"
Returns a pointer to the internal buffer where self
's elements are stored.
This method is unsafe because it returns a pointer, and the pointed might eventually
not be that of self
if the array grows and its internal buffer is reallocated.
ary = [1, 2, 3]
ary.to_unsafe[0] # => 1
Assumes that self
is an array of arrays and transposes the rows and columns.
a = [[:a, :b], [:c, :d], [:e, :f]]
a.transpose # => [[:a, :c, :e], [:b, :d, :f]]
a # => [[:a, :b], [:c, :d], [:e, :f]]
Returns a new Array
by removing duplicate values in self
.
a = ["a", "a", "b", "b", "c"]
a.uniq # => ["a", "b", "c"]
a # => [ "a", "a", "b", "b", "c" ]
Returns a new Array
by removing duplicate values in self
, using the block's
value for comparison.
a = [{"student", "sam"}, {"student", "george"}, {"teacher", "matz"}]
a.uniq { |s| s[0] } # => [{"student", "sam"}, {"teacher", "matz"}]
a # => [{"student", "sam"}, {"student", "george"}, {"teacher", "matz"}]
Removes duplicate elements from self
. Returns self
.
a = ["a", "a", "b", "b", "c"]
a.uniq! # => ["a", "b", "c"]
a # => ["a", "b", "c"]
Removes duplicate elements from self
, using the block's value for comparison. Returns self
.
a = [{"student", "sam"}, {"student", "george"}, {"teacher", "matz"}]
a.uniq! { |s| s[0] } # => [{"student", "sam"}, {"teacher", "matz"}]
a # => [{"student", "sam"}, {"teacher", "matz"}]
Prepend. Adds obj to the beginning of self
, given that the type of the value is T
(which might be a single type or a union of types).
This method returns self
, so several calls can be chained.
See #shift
for the opposite effect.
a = ["a", "b"]
a.unshift("c") # => ["c", "a", "b"]
a.unshift(1) # Errors, because the array only accepts String.
a = ["a", "b"] of (Int32 | String)
a.unshift("c") # => ["c", "a", "b"]
a.unshift(1) # => [1, "c", "a", "b"]
Prepend multiple values. The same as #unshift
, but takes an arbitrary number
of values to add to the array. Returns self
.