A pooled Array of integers ([int]).
An Array specifically designed to hold integer values ([int]). Optimized for memory usage, does not fragment the memory. [b]Note:[/b] This type is passed by value and not by reference. This means that when [i]mutating[/i] a class property of type [PoolIntArray] or mutating a [PoolIntArray] within an [Array] or [Dictionary], changes will be lost: [codeblock] var array = [PoolIntArray()] array[0].push_back(1234) print(array) # [[]] (empty PoolIntArray within an Array) [/codeblock] Instead, the entire [PoolIntArray] property must be [i]reassigned[/i] with [code]=[/code] for it to be changed: [codeblock] var array = [PoolIntArray()] var pool_array = array[0] pool_array.push_back(1234) array[0] = pool_array print(array) # [[1234]] (PoolIntArray with 1 element inside an Array) [/codeblock] [b]Note:[/b] This type is limited to signed 32-bit integers, which means it can only take values in the interval [code][-2^31, 2^31 - 1][/code], i.e. [code][-2147483648, 2147483647][/code]. Exceeding those bounds will wrap around. In comparison, [int] uses signed 64-bit integers which can hold much larger values.
Constructs a new [PoolIntArray]. Optionally, you can pass in a generic Array that will be converted.
Appends an element at the end of the array (alias of [method push_back]).
Appends a [PoolIntArray] at the end of this array.
Returns the number of times an element is in the array.
Returns [code]true[/code] if the array is empty.
Assigns the given value to all elements in the array. This can typically be used together with [method resize] to create an array with a given size and initialized elements.
Searches the array for a value and returns its index or [code]-1[/code] if not found. Optionally, the initial search index can be passed. Returns [code]-1[/code] if [code]from[/code] is out of bounds.
Returns [code]true[/code] if the array contains the given value. [b]Note:[/b] This is equivalent to using the [code]in[/code] operator.
Inserts a new int at a given position in the array. The position must be valid, or at the end of the array ([code]idx == size()[/code]).
Reverses the order of the elements in the array.
Appends a value to the array.
Removes an element from the array by index.
Sets the size of the array. If the array is grown, reserves elements at the end of the array. If the array is shrunk, truncates the array to the new size. [b]Note:[/b] Added elements are not automatically initialized to 0 and will contain garbage, i.e. indeterminate values.
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. If the adjusted start index is out of bounds, this method searches from the end of the array.
Changes the int at the given index.
Returns the number of elements in the array.
Sorts the elements of the array in ascending order.