@ringozz/godot 0.1.0

package/gen/heap-types/PackedFloat32Array.ts

@@ -0,0 +1,151 @@
+// Auto-generated from extension_api.json - DO NOT EDIT
+// Generated by dev/codegen.ts
+
+import { GodotVar, _C, _R } from '../../src/runtime.ts';
+import type { PackedByteArray } from './index.ts';
+
+/**
+ * An array specifically designed to hold 32-bit floating-point values (float). Packs data tightly, so it saves memory for large array sizes.
+ * If you need to pack 64-bit floats tightly, see {@link PackedFloat64Array}.
+ * **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 {@link 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.
+ * **Note:** In a boolean context, a packed array will evaluate to `false` if it's empty. Otherwise, a packed array will always evaluate to `true`.
+ */
+export class PackedFloat32Array<T = any> extends GodotVar implements Iterable<T> {
+    constructor(...args: any[]) { super(32, ...args); }
+
+    get length(): number { return _C(this, 13608) as number; }
+
+    *[Symbol.iterator](): Iterator<T> {
+        const n = _C(this, 13608) as number;
+        for (let i = 0; i < n; i++) yield _C(this, 3652, i) as T;
+    }
+    /**
+     * Returns the 32-bit float at the given `index` in the array. If `index` is out-of-bounds or negative, this method fails and returns `0.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.
+     */
+    get(index: number): number { return _C(this, 3652, index) as number; }
+
+    /**
+     * Changes the float at the given index.
+     */
+    set(index: number, value: T): void { _C(this, 10392, index, value); }
+
+    /**
+     * Returns the number of elements in the array.
+     */
+    size(): number { return _C(this, 13608) as number; }
+
+    /**
+     * Returns `true` if the array is empty.
+     */
+    isEmpty(): boolean { return _C(this, 7931) as boolean; }
+
+    /**
+     * Appends an element at the end of the array.
+     */
+    pushBack(value: T): boolean { return _C(this, 9630, value) as boolean; }
+
+    /**
+     * Appends an element at the end of the array (alias of {@link pushBack}).
+     */
+    append(value: T): boolean { return _C(this, 1512, value) as boolean; }
+
+    /**
+     * Appends a {@link PackedFloat32Array} at the end of this array.
+     */
+    appendArray(array: PackedFloat32Array): void { _C(this, 1513, array); }
+
+    /**
+     * Removes an element from the array by index.
+     */
+    removeAt(index: number): void { _C(this, 9886, index); }
+
+    /**
+     * Inserts a new element at a given position in the array. The position must be valid, or at the end of the array (`idx == size()`).
+     */
+    insert(atIndex: number, value: T): number { return _C(this, 7631, atIndex, value) as number; }
+
+    /**
+     * Assigns the given value to all elements in the array. This can typically be used together with {@link resize} to create an array with a given size and initialized elements.
+     */
+    fill(value: T): void { _C(this, 3260, value); }
+
+    /**
+     * 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 {@link resize} once and assigning the new values is faster than adding new elements one by one.
+     * Returns {@link OK} on success, or one of the following {@link Error} constants if this method fails: {@link ERR_INVALID_PARAMETER} if the size is negative, or {@link ERR_OUT_OF_MEMORY} if allocations fail. Use {@link size} to find the actual size of the array after resize.
+     */
+    resize(newSize: number): number { return _C(this, 10077, newSize) as number; }
+
+    /**
+     * Clears the array. This is equivalent to using {@link resize} with a size of `0`.
+     */
+    clear(): void { _C(this, 2232); }
+
+    /**
+     * Returns `true` if the array contains `value`.
+     * **Note:** `NAN` doesn't behave the same as other numbers. Therefore, the results from this method may not be accurate if NaNs are included.
+     */
+    has(value: T): boolean { return _C(this, 7349, value) as boolean; }
+
+    /**
+     * Reverses the order of the elements in the array.
+     */
+    reverse(): void { _C(this, 10104); }
+
+    /**
+     * Returns the slice of the {@link PackedFloat32Array}, from `begin` (inclusive) to `end` (exclusive), as a new {@link PackedFloat32Array}.
+     * 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)`).
+     */
+    slice(begin: number, end?: number /* = 2147483647 */): PackedFloat32Array { return _C(this, 13658, begin, end) as PackedFloat32Array; }
+
+    /**
+     * Returns a copy of the data converted to a {@link PackedByteArray}, where each element has been encoded as 4 bytes.
+     * The size of the new array will be `float32_array.size() * 4`.
+     */
+    toByteArray(): PackedByteArray { return _C(this, 14289) as PackedByteArray; }
+
+    /**
+     * Sorts the elements of the array in ascending order.
+     * **Note:** `NAN` doesn't behave the same as other numbers. Therefore, the results from this method may not be accurate if NaNs are included.
+     */
+    sort(): void { _C(this, 13723); }
+
+    /**
+     * 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 `before` specifier can be passed. If `false`, the returned index comes after all existing entries of the value in the array.
+     * **Note:** Calling {@link bsearch} on an unsorted array results in unexpected behavior.
+     * **Note:** `NAN` doesn't behave the same as other numbers. Therefore, the results from this method may not be accurate if NaNs are included.
+     */
+    bsearch(value: T, before?: boolean /* = true */): number { return _C(this, 1915, value, before) as number; }
+
+    /**
+     * Creates a copy of the array, and returns it.
+     */
+    duplicate(): PackedFloat32Array { return _C(this, 2980) as PackedFloat32Array; }
+
+    /**
+     * Searches the array for a value and returns its index or `-1` if not found. Optionally, the initial search index can be passed.
+     * **Note:** `NAN` doesn't behave the same as other numbers. Therefore, the results from this method may not be accurate if NaNs are included.
+     */
+    find(value: T, from?: number /* = 0 */): number { return _C(this, 3276, value, from) as number; }
+
+    /**
+     * 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.
+     * **Note:** `NAN` doesn't behave the same as other numbers. Therefore, the results from this method may not be accurate if NaNs are included.
+     */
+    rfind(value: T, from?: number /* = -1 */): number { return _C(this, 10108, value, from) as number; }
+
+    /**
+     * Returns the number of times an element is in the array.
+     * **Note:** `NAN` doesn't behave the same as other numbers. Therefore, the results from this method may not be accurate if NaNs are included.
+     */
+    count(value: T): number { return _C(this, 2502, value) as number; }
+
+    /**
+     * Removes the first occurrence of a value from the array and returns `true`. If the value does not exist in the array, nothing happens and `false` is returned. To remove an element by index, use {@link removeAt} instead.
+     * **Note:** `NAN` doesn't behave the same as other numbers. Therefore, the results from this method may not be accurate if NaNs are included.
+     */
+    erase(value: T): boolean { return _C(this, 3154, value) as boolean; }
+
+    static readonly name = _R(32, PackedFloat32Array);
+}

package/gen/heap-types/PackedFloat64Array.ts

@@ -0,0 +1,152 @@
+// Auto-generated from extension_api.json - DO NOT EDIT
+// Generated by dev/codegen.ts
+
+import { GodotVar, _C, _R } from '../../src/runtime.ts';
+import type { PackedByteArray } from './index.ts';
+
+/**
+ * An array specifically designed to hold 64-bit floating-point values (double). Packs data tightly, so it saves memory for large array sizes.
+ * If you only need to pack 32-bit floats tightly, see {@link PackedFloat32Array} 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. {@link PackedFloat64Array} versus `Array[float]`). 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 {@link 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 {@link 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.
+ * **Note:** In a boolean context, a packed array will evaluate to `false` if it's empty. Otherwise, a packed array will always evaluate to `true`.
+ */
+export class PackedFloat64Array<T = any> extends GodotVar implements Iterable<T> {
+    constructor(...args: any[]) { super(33, ...args); }
+
+    get length(): number { return _C(this, 13608) as number; }
+
+    *[Symbol.iterator](): Iterator<T> {
+        const n = _C(this, 13608) as number;
+        for (let i = 0; i < n; i++) yield _C(this, 3652, i) as T;
+    }
+    /**
+     * Returns the 64-bit float at the given `index` in the array. If `index` is out-of-bounds or negative, this method fails and returns `0.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.
+     */
+    get(index: number): number { return _C(this, 3652, index) as number; }
+
+    /**
+     * Changes the float at the given index.
+     */
+    set(index: number, value: T): void { _C(this, 10392, index, value); }
+
+    /**
+     * Returns the number of elements in the array.
+     */
+    size(): number { return _C(this, 13608) as number; }
+
+    /**
+     * Returns `true` if the array is empty.
+     */
+    isEmpty(): boolean { return _C(this, 7931) as boolean; }
+
+    /**
+     * Appends an element at the end of the array.
+     */
+    pushBack(value: T): boolean { return _C(this, 9630, value) as boolean; }
+
+    /**
+     * Appends an element at the end of the array (alias of {@link pushBack}).
+     */
+    append(value: T): boolean { return _C(this, 1512, value) as boolean; }
+
+    /**
+     * Appends a {@link PackedFloat64Array} at the end of this array.
+     */
+    appendArray(array: PackedFloat64Array): void { _C(this, 1513, array); }
+
+    /**
+     * Removes an element from the array by index.
+     */
+    removeAt(index: number): void { _C(this, 9886, index); }
+
+    /**
+     * Inserts a new element at a given position in the array. The position must be valid, or at the end of the array (`idx == size()`).
+     */
+    insert(atIndex: number, value: T): number { return _C(this, 7631, atIndex, value) as number; }
+
+    /**
+     * Assigns the given value to all elements in the array. This can typically be used together with {@link resize} to create an array with a given size and initialized elements.
+     */
+    fill(value: T): void { _C(this, 3260, value); }
+
+    /**
+     * 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 {@link resize} once and assigning the new values is faster than adding new elements one by one.
+     * Returns {@link OK} on success, or one of the following {@link Error} constants if this method fails: {@link ERR_INVALID_PARAMETER} if the size is negative, or {@link ERR_OUT_OF_MEMORY} if allocations fail. Use {@link size} to find the actual size of the array after resize.
+     */
+    resize(newSize: number): number { return _C(this, 10077, newSize) as number; }
+
+    /**
+     * Clears the array. This is equivalent to using {@link resize} with a size of `0`.
+     */
+    clear(): void { _C(this, 2232); }
+
+    /**
+     * Returns `true` if the array contains `value`.
+     * **Note:** `NAN` doesn't behave the same as other numbers. Therefore, the results from this method may not be accurate if NaNs are included.
+     */
+    has(value: T): boolean { return _C(this, 7349, value) as boolean; }
+
+    /**
+     * Reverses the order of the elements in the array.
+     */
+    reverse(): void { _C(this, 10104); }
+
+    /**
+     * Returns the slice of the {@link PackedFloat64Array}, from `begin` (inclusive) to `end` (exclusive), as a new {@link PackedFloat64Array}.
+     * 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)`).
+     */
+    slice(begin: number, end?: number /* = 2147483647 */): PackedFloat64Array { return _C(this, 13658, begin, end) as PackedFloat64Array; }
+
+    /**
+     * Returns a copy of the data converted to a {@link PackedByteArray}, where each element has been encoded as 8 bytes.
+     * The size of the new array will be `float64_array.size() * 8`.
+     */
+    toByteArray(): PackedByteArray { return _C(this, 14289) as PackedByteArray; }
+
+    /**
+     * Sorts the elements of the array in ascending order.
+     * **Note:** `NAN` doesn't behave the same as other numbers. Therefore, the results from this method may not be accurate if NaNs are included.
+     */
+    sort(): void { _C(this, 13723); }
+
+    /**
+     * 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 `before` specifier can be passed. If `false`, the returned index comes after all existing entries of the value in the array.
+     * **Note:** Calling {@link bsearch} on an unsorted array results in unexpected behavior.
+     * **Note:** `NAN` doesn't behave the same as other numbers. Therefore, the results from this method may not be accurate if NaNs are included.
+     */
+    bsearch(value: T, before?: boolean /* = true */): number { return _C(this, 1915, value, before) as number; }
+
+    /**
+     * Creates a copy of the array, and returns it.
+     */
+    duplicate(): PackedFloat64Array { return _C(this, 2980) as PackedFloat64Array; }
+
+    /**
+     * Searches the array for a value and returns its index or `-1` if not found. Optionally, the initial search index can be passed.
+     * **Note:** `NAN` doesn't behave the same as other numbers. Therefore, the results from this method may not be accurate if NaNs are included.
+     */
+    find(value: T, from?: number /* = 0 */): number { return _C(this, 3276, value, from) as number; }
+
+    /**
+     * 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.
+     * **Note:** `NAN` doesn't behave the same as other numbers. Therefore, the results from this method may not be accurate if NaNs are included.
+     */
+    rfind(value: T, from?: number /* = -1 */): number { return _C(this, 10108, value, from) as number; }
+
+    /**
+     * Returns the number of times an element is in the array.
+     * **Note:** `NAN` doesn't behave the same as other numbers. Therefore, the results from this method may not be accurate if NaNs are included.
+     */
+    count(value: T): number { return _C(this, 2502, value) as number; }
+
+    /**
+     * Removes the first occurrence of a value from the array and returns `true`. If the value does not exist in the array, nothing happens and `false` is returned. To remove an element by index, use {@link removeAt} instead.
+     * **Note:** `NAN` doesn't behave the same as other numbers. Therefore, the results from this method may not be accurate if NaNs are included.
+     */
+    erase(value: T): boolean { return _C(this, 3154, value) as boolean; }
+
+    static readonly name = _R(33, PackedFloat64Array);
+}

package/gen/heap-types/PackedInt32Array.ts

@@ -0,0 +1,144 @@
+// Auto-generated from extension_api.json - DO NOT EDIT
+// Generated by dev/codegen.ts
+
+import { GodotVar, _C, _R } from '../../src/runtime.ts';
+import type { PackedByteArray } from './index.ts';
+
+/**
+ * An array specifically designed to hold 32-bit integer values. Packs data tightly, so it saves memory for large array sizes.
+ * **Note:** This type stores signed 32-bit integers, which means it can take values in the interval `[-2^31, 2^31 - 1]`, i.e. `[-2147483648, 2147483647]`. Exceeding those bounds will wrap around. In comparison, {@link int} uses signed 64-bit integers which can hold much larger values. If you need to pack 64-bit integers tightly, see {@link PackedInt64Array}.
+ * **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 {@link 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.
+ * **Note:** In a boolean context, a packed array will evaluate to `false` if it's empty. Otherwise, a packed array will always evaluate to `true`.
+ */
+export class PackedInt32Array<T = any> extends GodotVar implements Iterable<T> {
+    constructor(...args: any[]) { super(30, ...args); }
+
+    get length(): number { return _C(this, 13608) as number; }
+
+    *[Symbol.iterator](): Iterator<T> {
+        const n = _C(this, 13608) as number;
+        for (let i = 0; i < n; i++) yield _C(this, 3652, i) as T;
+    }
+    /**
+     * Returns the 32-bit integer at the given `index` in the array. If `index` is 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.
+     */
+    get(index: number): number { return _C(this, 3652, index) as number; }
+
+    /**
+     * Changes the integer at the given index.
+     */
+    set(index: number, value: T): void { _C(this, 10392, index, value); }
+
+    /**
+     * Returns the number of elements in the array.
+     */
+    size(): number { return _C(this, 13608) as number; }
+
+    /**
+     * Returns `true` if the array is empty.
+     */
+    isEmpty(): boolean { return _C(this, 7931) as boolean; }
+
+    /**
+     * Appends a value to the array.
+     */
+    pushBack(value: T): boolean { return _C(this, 9630, value) as boolean; }
+
+    /**
+     * Appends an element at the end of the array (alias of {@link pushBack}).
+     */
+    append(value: T): boolean { return _C(this, 1512, value) as boolean; }
+
+    /**
+     * Appends a {@link PackedInt32Array} at the end of this array.
+     */
+    appendArray(array: PackedInt32Array): void { _C(this, 1513, array); }
+
+    /**
+     * Removes an element from the array by index.
+     */
+    removeAt(index: number): void { _C(this, 9886, index); }
+
+    /**
+     * Inserts a new integer at a given position in the array. The position must be valid, or at the end of the array (`idx == size()`).
+     */
+    insert(atIndex: number, value: T): number { return _C(this, 7631, atIndex, value) as number; }
+
+    /**
+     * Assigns the given value to all elements in the array. This can typically be used together with {@link resize} to create an array with a given size and initialized elements.
+     */
+    fill(value: T): void { _C(this, 3260, value); }
+
+    /**
+     * 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 {@link resize} once and assigning the new values is faster than adding new elements one by one.
+     * Returns {@link OK} on success, or one of the following {@link Error} constants if this method fails: {@link ERR_INVALID_PARAMETER} if the size is negative, or {@link ERR_OUT_OF_MEMORY} if allocations fail. Use {@link size} to find the actual size of the array after resize.
+     */
+    resize(newSize: number): number { return _C(this, 10077, newSize) as number; }
+
+    /**
+     * Clears the array. This is equivalent to using {@link resize} with a size of `0`.
+     */
+    clear(): void { _C(this, 2232); }
+
+    /**
+     * Returns `true` if the array contains `value`.
+     */
+    has(value: T): boolean { return _C(this, 7349, value) as boolean; }
+
+    /**
+     * Reverses the order of the elements in the array.
+     */
+    reverse(): void { _C(this, 10104); }
+
+    /**
+     * Returns the slice of the {@link PackedInt32Array}, from `begin` (inclusive) to `end` (exclusive), as a new {@link PackedInt32Array}.
+     * 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)`).
+     */
+    slice(begin: number, end?: number /* = 2147483647 */): PackedInt32Array { return _C(this, 13658, begin, end) as PackedInt32Array; }
+
+    /**
+     * Returns a copy of the data converted to a {@link PackedByteArray}, where each element has been encoded as 4 bytes.
+     * The size of the new array will be `int32_array.size() * 4`.
+     */
+    toByteArray(): PackedByteArray { return _C(this, 14289) as PackedByteArray; }
+
+    /**
+     * Sorts the elements of the array in ascending order.
+     */
+    sort(): void { _C(this, 13723); }
+
+    /**
+     * 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 `before` specifier can be passed. If `false`, the returned index comes after all existing entries of the value in the array.
+     * **Note:** Calling {@link bsearch} on an unsorted array results in unexpected behavior.
+     */
+    bsearch(value: T, before?: boolean /* = true */): number { return _C(this, 1915, value, before) as number; }
+
+    /**
+     * Creates a copy of the array, and returns it.
+     */
+    duplicate(): PackedInt32Array { return _C(this, 2980) as PackedInt32Array; }
+
+    /**
+     * Searches the array for a value and returns its index or `-1` if not found. Optionally, the initial search index can be passed.
+     */
+    find(value: T, from?: number /* = 0 */): number { return _C(this, 3276, value, from) as number; }
+
+    /**
+     * 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.
+     */
+    rfind(value: T, from?: number /* = -1 */): number { return _C(this, 10108, value, from) as number; }
+
+    /**
+     * Returns the number of times an element is in the array.
+     */
+    count(value: T): number { return _C(this, 2502, value) as number; }
+
+    /**
+     * Removes the first occurrence of a value from the array and returns `true`. If the value does not exist in the array, nothing happens and `false` is returned. To remove an element by index, use {@link removeAt} instead.
+     */
+    erase(value: T): boolean { return _C(this, 3154, value) as boolean; }
+
+    static readonly name = _R(30, PackedInt32Array);
+}

package/gen/heap-types/PackedInt64Array.ts

@@ -0,0 +1,145 @@
+// Auto-generated from extension_api.json - DO NOT EDIT
+// Generated by dev/codegen.ts
+
+import { GodotVar, _C, _R } from '../../src/runtime.ts';
+import type { PackedByteArray } from './index.ts';
+
+/**
+ * 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 {@link 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. {@link 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 {@link 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 {@link 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.
+ * **Note:** In a boolean context, a packed array will evaluate to `false` if it's empty. Otherwise, a packed array will always evaluate to `true`.
+ */
+export class PackedInt64Array<T = any> extends GodotVar implements Iterable<T> {
+    constructor(...args: any[]) { super(31, ...args); }
+
+    get length(): number { return _C(this, 13608) as number; }
+
+    *[Symbol.iterator](): Iterator<T> {
+        const n = _C(this, 13608) as number;
+        for (let i = 0; i < n; i++) yield _C(this, 3652, i) as T;
+    }
+    /**
+     * Returns the 64-bit integer at the given `index` in the array. If `index` is 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.
+     */
+    get(index: number): number { return _C(this, 3652, index) as number; }
+
+    /**
+     * Changes the integer at the given index.
+     */
+    set(index: number, value: T): void { _C(this, 10392, index, value); }
+
+    /**
+     * Returns the number of elements in the array.
+     */
+    size(): number { return _C(this, 13608) as number; }
+
+    /**
+     * Returns `true` if the array is empty.
+     */
+    isEmpty(): boolean { return _C(this, 7931) as boolean; }
+
+    /**
+     * Appends a value to the array.
+     */
+    pushBack(value: T): boolean { return _C(this, 9630, value) as boolean; }
+
+    /**
+     * Appends an element at the end of the array (alias of {@link pushBack}).
+     */
+    append(value: T): boolean { return _C(this, 1512, value) as boolean; }
+
+    /**
+     * Appends a {@link PackedInt64Array} at the end of this array.
+     */
+    appendArray(array: PackedInt64Array): void { _C(this, 1513, array); }
+
+    /**
+     * Removes an element from the array by index.
+     */
+    removeAt(index: number): void { _C(this, 9886, index); }
+
+    /**
+     * Inserts a new integer at a given position in the array. The position must be valid, or at the end of the array (`idx == size()`).
+     */
+    insert(atIndex: number, value: T): number { return _C(this, 7631, atIndex, value) as number; }
+
+    /**
+     * Assigns the given value to all elements in the array. This can typically be used together with {@link resize} to create an array with a given size and initialized elements.
+     */
+    fill(value: T): void { _C(this, 3260, value); }
+
+    /**
+     * 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 {@link resize} once and assigning the new values is faster than adding new elements one by one.
+     * Returns {@link OK} on success, or one of the following {@link Error} constants if this method fails: {@link ERR_INVALID_PARAMETER} if the size is negative, or {@link ERR_OUT_OF_MEMORY} if allocations fail. Use {@link size} to find the actual size of the array after resize.
+     */
+    resize(newSize: number): number { return _C(this, 10077, newSize) as number; }
+
+    /**
+     * Clears the array. This is equivalent to using {@link resize} with a size of `0`.
+     */
+    clear(): void { _C(this, 2232); }
+
+    /**
+     * Returns `true` if the array contains `value`.
+     */
+    has(value: T): boolean { return _C(this, 7349, value) as boolean; }
+
+    /**
+     * Reverses the order of the elements in the array.
+     */
+    reverse(): void { _C(this, 10104); }
+
+    /**
+     * Returns the slice of the {@link PackedInt64Array}, from `begin` (inclusive) to `end` (exclusive), as a new {@link 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)`).
+     */
+    slice(begin: number, end?: number /* = 2147483647 */): PackedInt64Array { return _C(this, 13658, begin, end) as PackedInt64Array; }
+
+    /**
+     * Returns a copy of the data converted to a {@link PackedByteArray}, where each element has been encoded as 8 bytes.
+     * The size of the new array will be `int64_array.size() * 8`.
+     */
+    toByteArray(): PackedByteArray { return _C(this, 14289) as PackedByteArray; }
+
+    /**
+     * Sorts the elements of the array in ascending order.
+     */
+    sort(): void { _C(this, 13723); }
+
+    /**
+     * 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 `before` specifier can be passed. If `false`, the returned index comes after all existing entries of the value in the array.
+     * **Note:** Calling {@link bsearch} on an unsorted array results in unexpected behavior.
+     */
+    bsearch(value: T, before?: boolean /* = true */): number { return _C(this, 1915, value, before) as number; }
+
+    /**
+     * Creates a copy of the array, and returns it.
+     */
+    duplicate(): PackedInt64Array { return _C(this, 2980) as PackedInt64Array; }
+
+    /**
+     * Searches the array for a value and returns its index or `-1` if not found. Optionally, the initial search index can be passed.
+     */
+    find(value: T, from?: number /* = 0 */): number { return _C(this, 3276, value, from) as number; }
+
+    /**
+     * 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.
+     */
+    rfind(value: T, from?: number /* = -1 */): number { return _C(this, 10108, value, from) as number; }
+
+    /**
+     * Returns the number of times an element is in the array.
+     */
+    count(value: T): number { return _C(this, 2502, value) as number; }
+
+    /**
+     * Removes the first occurrence of a value from the array and returns `true`. If the value does not exist in the array, nothing happens and `false` is returned. To remove an element by index, use {@link removeAt} instead.
+     */
+    erase(value: T): boolean { return _C(this, 3154, value) as boolean; }
+
+    static readonly name = _R(31, PackedInt64Array);
+}