A packed array of 32-bit integers. An array specifically designed to hold 32-bit integer values. Packs data tightly, so it saves memory for large array sizes. [b]Note:[/b] This type stores signed 32-bit integers, which means it can 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. If you need to pack 64-bit integers tightly, see [PackedInt64Array]. Constructs an empty [PackedInt32Array]. Constructs a [PackedInt32Array] as a copy of the given [PackedInt32Array]. Constructs a new [PackedInt32Array]. 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 [PackedInt32Array] at the end of this array. 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 [code]before[/code] specifier can be passed. If [code]false[/code], the returned index comes after all existing entries of the value in the array. [b]Note:[/b] Calling [method bsearch] on an unsorted array results in unexpected behavior. Returns the number of times an element is in the array. Creates a copy of the array, and returns it. 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]true[/code] if the array contains [code]value[/code]. Inserts a new integer at a given position in the array. The position must be valid, or at the end of the array ([code]idx == size()[/code]). Returns [code]true[/code] if the array is empty. 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. Reverses the order of the elements in the array. 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. Changes the integer at the given index. Returns the number of elements in the array. Returns the slice of the [PackedInt32Array], from [code]begin[/code] (inclusive) to [code]end[/code] (exclusive), as a new [PackedInt32Array]. The absolute value of [code]begin[/code] and [code]end[/code] will be clamped to the array size, so the default value for [code]end[/code] makes it slice to the size of the array by default (i.e. [code]arr.slice(1)[/code] is a shorthand for [code]arr.slice(1, arr.size())[/code]). If either [code]begin[/code] or [code]end[/code] are negative, they will be relative to the end of the array (i.e. [code]arr.slice(0, -2)[/code] is a shorthand for [code]arr.slice(0, arr.size() - 2)[/code]). Sorts the elements of the array in ascending order. Returns a copy of the data converted to a [PackedByteArray], where each element have been encoded as 4 bytes. The size of the new array will be [code]int32_array.size() * 4[/code].