daaezy.blogg.se

Unstable_sort_by!(&block : T -> _) : self Unstable_sort! : self unstable_sort!(&block : T, T -> U) : self forall U Sort! : self sort!(&block : T, T -> U) : self forall U Shuffle!(random : Random = Random :: DEFAULT) : self Instance methods inherited from module Comparable( Array(T)) (other : T)Ĭlamp Instance methods inherited from module Indexable::Mutable(T) =(index : Int, value : T) : Tįill(value : T, start : Int, count : Int) : self fill(value : T, range : Range) : self fill(value : T) : self fill(start : Int, count : Int, & : Int32 -> T) : self fill(range : Range, & : Int32 -> T) : self fill(*, offset : Int = 0, & : Int32 -> T) : self

The above is the same as this: set = Set( typeof( 1, 2, 3)).new You can use a special array literal syntax with other types too, as long as they define an argless This is normally known as a dynamic array. When creating an empty array you must always specify T: of Int32 # same as Array(Int32) # syntax errorĪn Array is implemented using an internal buffer of some capacityĪnd is reallocated when elements are pushed to it when more capacity In the latterĬase, T will be set to the union of the array literal elements' types. When the array is created, either by specifying T or by using an array literal. See Array literals in the language reference.Īn Array can have mixed types, meaning T will be a union of types, but these are determined new method (several are provided), or with an array literal: Array( Int32).new # => 2 is the next to last element, and so on.Īn Array can be created using the usual. Relative to the end of the array: -1 indicates the last element, An Array is an ordered, integer-indexed collection of objects of type T.Īrray indexing starts at 0.