PackedInt64Array

Un array empaquetado de enteros de 64 bits.

Descripción

An array specifically designed to hold 64-bit integer values. Packs data tightly, so it saves memory for large array sizes.

Note: This type stores signed 64-bit integers, which means it can take values in the interval [-2^63, 2^63 - 1], i.e. [-9223372036854775808, 9223372036854775807]. Exceeding those bounds will wrap around. If you only need to pack 32-bit integers tightly, see PackedInt32Array for a more memory-friendly alternative.

Differences between packed arrays, typed arrays, and untyped arrays: Packed arrays are generally faster to iterate on and modify compared to a typed array of the same type (e.g. PackedInt64Array versus Array[int]). Also, packed arrays consume less memory. As a downside, packed arrays are less flexible as they don't offer as many convenience methods such as Array.map(). Typed arrays are in turn faster to iterate on and modify than untyped arrays.

Note: Packed arrays are always passed by reference. To get a copy of an array that can be modified independently of the original array, use duplicate(). This is not the case for built-in properties and methods. In these cases the returned packed array is a copy, and changing it will not affect the original value. To update a built-in property of this type, modify the returned array and then assign it to the property again.

Nota

Hay diferencias notables cuando usa esta API con C#. Véase Diferencias de la API de C# con GDScript para más información.

Constructores

PackedInt64Array

PackedInt64Array()

PackedInt64Array

PackedInt64Array(from: PackedInt64Array)

PackedInt64Array

PackedInt64Array(from: Array)

Métodos

bool

append(value: int)

void

append_array(array: PackedInt64Array)

int

bsearch(value: int, before: bool = true)

void

clear()

int

count(value: int) const

PackedInt64Array

duplicate()

bool

erase(value: int)

void

fill(value: int)

int

find(value: int, from: int = 0) const

int

get(index: int) const

bool

has(value: int) const

int

insert(at_index: int, value: int)

bool

is_empty() const

bool

push_back(value: int)

void

remove_at(index: int)

int

resize(new_size: int)

void

reverse()

int

rfind(value: int, from: int = -1) const

void

set(index: int, value: int)

int

size() const

PackedInt64Array

slice(begin: int, end: int = 2147483647) const

void

sort()

PackedByteArray

to_byte_array() const

Operadores

bool

operator !=(right: PackedInt64Array)

PackedInt64Array

operator +(right: PackedInt64Array)

bool

operator ==(right: PackedInt64Array)

int

operator [](index: int)


Descripciones de Constructores

PackedInt64Array PackedInt64Array() 🔗

Construye un PackedInt64Array vacío.


PackedInt64Array PackedInt64Array(from: PackedInt64Array)

Constructs a PackedInt64Array as a copy of the given PackedInt64Array.


PackedInt64Array PackedInt64Array(from: Array)

Constructs a new PackedInt64Array. Optionally, you can pass in a generic Array that will be converted.


Descripciones de Métodos

bool append(value: int) 🔗

Concatena un elemento al final del array (alias de push_back()).


void append_array(array: PackedInt64Array) 🔗

Appends a PackedInt64Array at the end of this array.


int bsearch(value: int, before: bool = true) 🔗

Encuentra el índice de un valor existente (o el índice de inserción que mantiene el orden de clasificación, si el valor aún no está presente en el array) utilizando la búsqueda binaria. Opcionalmente, se puede pasar un especificador before. Si es false, el índice devuelto viene después de todas las entradas existentes del valor en el array.

Nota: Llamar a bsearch() en un array sin ordenar da como resultado un comportamiento inesperado.


void clear() 🔗

Limpia el array. Esto es equivalente a usar resize() con un tamaño de 0.


int count(value: int) const 🔗

Devuelve el numer de veces que un elemento es encuentra en el array.


PackedInt64Array duplicate() 🔗

Creates a copy of the array, and returns it.


bool erase(value: int) 🔗

Elimina la primera aparición de un valor del array y devuelve true. Si el valor no existe en el array, no sucede nada y se devuelve false. Para eliminar un elemento por índice, usa remove_at() en su lugar.


void fill(value: int) 🔗

Asigna el valor dado a todos los elementos del array. Esto normalmente se puede usar junto con resize() para crear un array con un tamaño dado y elementos inicializados.


int find(value: int, from: int = 0) const 🔗

Busca un valor en el array y devuelve su índice o -1 si no lo encuentra. Opcionalmente, se puede pasar el índice de búsqueda inicial.


int get(index: int) const 🔗

Returns the 64-bit integer at the given index in the array. If index out-of-bounds or negative, this method fails and returns 0.

This method is similar (but not identical) to the [] operator. Most notably, when this method fails, it doesn't pause project execution if run from the editor.


bool has(value: int) const 🔗

Returns true if the array contains value.


int insert(at_index: int, value: int) 🔗

Inserta un nuevo entero en una posición dada del array. La posición debe ser válida, o al final del array (idx == size()).


bool is_empty() const 🔗

Devuelve true si el array es vacio.


bool push_back(value: int) 🔗

Añade un valor al array.


void remove_at(index: int) 🔗

Elimina un elemento del array por indice.


int resize(new_size: int) 🔗

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. Calling resize() once and assigning the new values is faster than adding new elements one by one.

Returns @GlobalScope.OK on success, or one of the following Error constants if this method fails: @GlobalScope.ERR_INVALID_PARAMETER if the size is negative, or @GlobalScope.ERR_OUT_OF_MEMORY if allocations fail. Use size() to find the actual size of the array after resize.


void reverse() 🔗

Invierte el orden de los elementos en el array.


int rfind(value: int, from: int = -1) const 🔗

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 set(index: int, value: int) 🔗

Cambia el entero en el índice dado.


int size() const 🔗

Devuelve el numer de elementos en el array.


PackedInt64Array slice(begin: int, end: int = 2147483647) const 🔗

Returns the slice of the PackedInt64Array, from begin (inclusive) to end (exclusive), as a new PackedInt64Array.

The absolute value of begin and end will be clamped to the array size, so the default value for end makes it slice to the size of the array by default (i.e. arr.slice(1) is a shorthand for arr.slice(1, arr.size())).

If either begin or end are negative, they will be relative to the end of the array (i.e. arr.slice(0, -2) is a shorthand for arr.slice(0, arr.size() - 2)).


void sort() 🔗

Sorts the elements of the array in ascending order.


PackedByteArray to_byte_array() const 🔗

Returns a copy of the data converted to a PackedByteArray, where each element has been encoded as 8 bytes.

The size of the new array will be int64_array.size() * 8.


Descripciones de Operadores

bool operator !=(right: PackedInt64Array) 🔗

Returns true if contents of the arrays differ.


PackedInt64Array operator +(right: PackedInt64Array) 🔗

Returns a new PackedInt64Array with contents of right added at the end of this array. For better performance, consider using append_array() instead.


bool operator ==(right: PackedInt64Array) 🔗

Returns true if contents of both arrays are the same, i.e. they have all equal ints at the corresponding indices.


int operator [](index: int) 🔗

Returns the int at index index. Negative indices can be used to access the elements starting from the end. Using index out of array's bounds will result in an error.