A packed [Array] of [Color]s.
An [Array] specifically designed to hold [Color]. Packs data tightly, so it saves memory for large array sizes.
Constructs an empty [PackedColorArray].
Constructs a [PackedColorArray] as a copy of the given [PackedColorArray].
Constructs a new [PackedColorArray]. 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 [PackedColorArray] 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.
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.
Returns [code]true[/code] if the array contains [code]value[/code].
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]).
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.
Changes the [Color] at the given index.
Returns the number of elements in the array.
Sorts the elements of the array in ascending order.