Array

Category: Built-In Types

Brief Description

Generic array datatype.

Methods

Description

Generic array which can contain several elements of any type, accessible by a numerical index starting at 0. Negative indices can be used to count from the back, like in Python (-1 is the last element, -2 the second to last, etc.). Example:

var array = ["One", 2, 3, "Four"]
print(array[0])   # One
print(array[2])   # 3
print(array[-1])  # Four
array[2] = "Three"
print(array[-2])  # Three

Arrays are always passed by reference.

Method Descriptions

• Array Array ( PoolColorArray from )

Constructs an array from a PoolColorArray.

• Array Array ( PoolVector3Array from )

Constructs an array from a PoolVector3Array.

• Array Array ( PoolVector2Array from )

Constructs an array from a PoolVector2Array.

• Array Array ( PoolStringArray from )

Constructs an array from a PoolStringArray.

• Array Array ( PoolRealArray from )

Constructs an array from a PoolRealArray.

• Array Array ( PoolIntArray from )

Constructs an array from a PoolIntArray.

• Array Array ( PoolByteArray from )

Constructs an array from a PoolByteArray.

• void append ( Variant value )

Appends an element at the end of the array (alias of push_back).

• Variant back ( )

Returns the last element of the array if the array is not empty.

• int bsearch ( Variant value, bool before=True )

Finds the index of an existing value (or the insertion index that maintains sorting order, if the value is not yet present in the array) using binary search. Optionally, a before specifier can be passed. If false, the returned index comes after all existing entries of the value in the array. Note that calling bsearch on an unsorted array results in unexpected behavior.

• int bsearch_custom ( Variant value, Object obj, String func, bool before=True )

Finds the index of an existing value (or the insertion index that maintains sorting order, if the value is not yet present in the array) using binary search and a custom comparison method. Optionally, a before specifier can be passed. If false, the returned index comes after all existing entries of the value in the array. The custom method receives two arguments (an element from the array and the value searched for) and must return true if the first argument is less than the second, and return false otherwise. Note that calling bsearch on an unsorted array results in unexpected behavior.

• void clear ( )

Clears the array (resizes to 0).

• int count ( Variant value )

Returns the number of times an element is in the array.

• Array duplicate ( bool deep=False )

Returns a copy of the array.

If deep is true, a deep copy is performed: all nested arrays and dictionaries are duplicated and will not be shared with the original array. If false, a shallow copy is made and references to the original nested arrays and dictionaries are kept, so that modifying a sub-array or dictionary in the copy will also impact those referenced in the source array.

• bool empty ( )

Returns true if the array is empty.

• void erase ( Variant value )

Removes the first occurrence of a value from the array.

• int find ( Variant what, int from=0 )

Searches the array for a value and returns its index or -1 if not found. Optionally, the initial search index can be passed.

• int find_last ( Variant value )

Searches the array in reverse order for a value and returns its index or -1 if not found.

• Variant front ( )

Returns the first element of the array if the array is not empty.

• bool has ( Variant value )

Returns true if the array contains the given value.

["inside", 7].has("inside") == true
["inside", 7].has("outside") == false
["inside", 7].has(7) == true
["inside", 7].has("7") == false

• int hash ( )

Returns a hashed integer value representing the array contents.

• void insert ( int position, Variant value )

Inserts a new element at a given position in the array. The position must be valid, or at the end of the array (pos == size()).

• void invert ( )

Reverses the order of the elements in the array.

• Variant max ( )

Returns the maximum value contained in the array if all elements are of comparable types. If the elements can’t be compared, null is returned.

• Variant min ( )

Returns the minimum value contained in the array if all elements are of comparable types. If the elements can’t be compared, null is returned.

• Variant pop_back ( )

Removes the last element of the array.

• Variant pop_front ( )

Removes the first element of the array.

• void push_back ( Variant value )

Appends an element at the end of the array.

• void push_front ( Variant value )

Adds an element at the beginning of the array.

• void remove ( int position )

Removes an element from the array by index.

• void resize ( int size )

Resizes the array to contain a different number of elements. If the array size is smaller, elements are cleared, if bigger, new elements are Null.

• int rfind ( Variant what, int from=-1 )

Searches the array in reverse order. Optionally, a start search index can be passed. If negative, the start index is considered relative to the end of the array.

• void shuffle ( )

Shuffles the array such that the items will have a random order. This method uses the global random number generator common to methods such as @GDScript.randi. Call @GDScript.randomize to ensure that a new seed will be used each time if you want non-reproducible shuffling.

• int size ( )

Returns the number of elements in the array.

• void sort ( )

Sorts the array. Note: strings are sorted in alphabetical, not natural order.

• void sort_custom ( Object obj, String func )

Sorts the array using a custom method. The arguments are an object that holds the method and the name of such method. The custom method receives two arguments (a pair of elements from the array) and must return true if the first argument is less than the second, and return false otherwise.

Note: you cannot randomize the return value as the heapsort algorithm expects a deterministic result. Doing so will result in unexpected behavior.

class MyCustomSorter:
    static func sort(a, b):
        if a[0] < b[0]:
            return true
        return false
var my_items = [[5, "Potato"], [9, "Rice"], [4, "Tomato"]]
my_items.sort_custom(MyCustomSorter, "sort")