A pooled Array of real numbers ([float]).
An Array specifically designed to hold floating-point values. 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 [PoolRealArray] or mutating a [PoolRealArray] within an [Array] or [Dictionary], changes will be lost: [codeblock] var array = [PoolRealArray()] array[0].push_back(12.34) print(array) # [[]] (empty PoolRealArray within an Array) [/codeblock] Instead, the entire [PoolRealArray] property must be [i]reassigned[/i] with [code]=[/code] for it to be changed: [codeblock] var array = [PoolRealArray()] var pool_array = array[0] pool_array.push_back(12.34) array[0] = pool_array print(array) # [[12.34]] (PoolRealArray with 1 element inside an Array) [/codeblock] [b]Note:[/b] Unlike primitive [float]s which are 64-bit, numbers stored in [PoolRealArray] are 32-bit floats. This means values stored in [PoolRealArray] have lower precision compared to primitive [float]s. If you need to store 64-bit floats in an array, use a generic Array with [float] elements as these will still be 64-bit. However, using a generic Array to store [float]s will use roughly 6 times more memory compared to a [PoolRealArray].
Constructs a new [PoolRealArray]. 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 [PoolRealArray] 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 element 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 an element at the end of 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 float at the given index.
Returns the number of elements in the array.
Sorts the elements of the array in ascending order.