@ringozz/godot 0.1.0

package/gen/heap-types/PackedStringArray.ts

@@ -0,0 +1,153 @@
+// 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 {@link String}s. Packs data tightly, so it saves memory for large array sizes.
+ * If you want to join the strings in the array, use {@link String.join}.
+ *
+ * ```text
+ *
+ * var string_array = PackedStringArray(["hello", "world"])
+ * var string = " ".join(string_array)
+ * print(string) # "hello world"
+ *
+ * ```
+ *
+ * **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 PackedStringArray} versus `Array[String]`). 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 PackedStringArray<T = any> extends GodotVar implements Iterable<T> {
+    constructor(...args: any[]) { super(34, ...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 {@link String} at the given `index` in the array. If `index` is out-of-bounds or negative, this method fails and returns an empty string.
+     * 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): string { return _C(this, 3652, index) as string; }
+
+    /**
+     * Changes the {@link String} 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 string element at 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 PackedStringArray} at the end of this array.
+     */
+    appendArray(array: PackedStringArray): 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`.
+     */
+    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 PackedStringArray}, from `begin` (inclusive) to `end` (exclusive), as a new {@link PackedStringArray}.
+     * 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 */): PackedStringArray { return _C(this, 13658, begin, end) as PackedStringArray; }
+
+    /**
+     * Returns a {@link PackedByteArray} with each string encoded as UTF-8. Strings are `null` terminated.
+     */
+    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(): PackedStringArray { return _C(this, 2980) as PackedStringArray; }
+
+    /**
+     * 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(34, PackedStringArray);
+}

package/gen/heap-types/PackedVector2Array.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 { Vector2 } from '../value-types/index.ts';
+import type { PackedByteArray } from './index.ts';
+
+/**
+ * An array specifically designed to hold {@link Vector2}. Packs data tightly, so it saves memory for large array sizes.
+ * **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 PackedVector2Array} versus `Array[Vector2]`). 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 PackedVector2Array<T = any> extends GodotVar implements Iterable<T> {
+    constructor(...args: any[]) { super(35, ...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 {@link Vector2} at the given `index` in the array. If `index` is out-of-bounds or negative, this method fails and returns `Vector2(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): Vector2 { return _C(this, 3652, index) as Vector2; }
+
+    /**
+     * Changes the {@link Vector2} 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; }
+
+    /**
+     * Inserts a {@link Vector2} at the end.
+     */
+    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 PackedVector2Array} at the end of this array.
+     */
+    appendArray(array: PackedVector2Array): 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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 PackedVector2Array}, from `begin` (inclusive) to `end` (exclusive), as a new {@link PackedVector2Array}.
+     * 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 */): PackedVector2Array { return _C(this, 13658, begin, end) as PackedVector2Array; }
+
+    /**
+     * Returns a {@link PackedByteArray} with each vector encoded as bytes.
+     */
+    toByteArray(): PackedByteArray { return _C(this, 14289) as PackedByteArray; }
+
+    /**
+     * Sorts the elements of the array in ascending order.
+     * **Note:** Vectors with `NAN` elements don't behave the same as other vectors. 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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(): PackedVector2Array { return _C(this, 2980) as PackedVector2Array; }
+
+    /**
+     * Searches the array for a value and returns its index or `-1` if not found. Optionally, the initial search index can be passed.
+     * **Note:** Vectors with `NAN` elements don't behave the same as other vectors. 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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(35, PackedVector2Array);
+}

package/gen/heap-types/PackedVector3Array.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 { Vector3 } from '../value-types/index.ts';
+import type { PackedByteArray } from './index.ts';
+
+/**
+ * An array specifically designed to hold {@link Vector3}. Packs data tightly, so it saves memory for large array sizes.
+ * **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 PackedVector3Array} versus `Array[Vector3]`). 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 PackedVector3Array<T = any> extends GodotVar implements Iterable<T> {
+    constructor(...args: any[]) { super(36, ...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 {@link Vector3} at the given `index` in the array. If `index` is out-of-bounds or negative, this method fails and returns `Vector3(0, 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): Vector3 { return _C(this, 3652, index) as Vector3; }
+
+    /**
+     * Changes the {@link Vector3} 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; }
+
+    /**
+     * Inserts a {@link Vector3} at the end.
+     */
+    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 PackedVector3Array} at the end of this array.
+     */
+    appendArray(array: PackedVector3Array): 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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 PackedVector3Array}, from `begin` (inclusive) to `end` (exclusive), as a new {@link PackedVector3Array}.
+     * 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 */): PackedVector3Array { return _C(this, 13658, begin, end) as PackedVector3Array; }
+
+    /**
+     * Returns a {@link PackedByteArray} with each vector encoded as bytes.
+     */
+    toByteArray(): PackedByteArray { return _C(this, 14289) as PackedByteArray; }
+
+    /**
+     * Sorts the elements of the array in ascending order.
+     * **Note:** Vectors with `NAN` elements don't behave the same as other vectors. 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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(): PackedVector3Array { return _C(this, 2980) as PackedVector3Array; }
+
+    /**
+     * Searches the array for a value and returns its index or `-1` if not found. Optionally, the initial search index can be passed.
+     * **Note:** Vectors with `NAN` elements don't behave the same as other vectors. 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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(36, PackedVector3Array);
+}

package/gen/heap-types/PackedVector4Array.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 { Vector4 } from '../value-types/index.ts';
+import type { PackedByteArray } from './index.ts';
+
+/**
+ * An array specifically designed to hold {@link Vector4}. Packs data tightly, so it saves memory for large array sizes.
+ * **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 PackedVector4Array} versus `Array[Vector4]`). 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 PackedVector4Array<T = any> extends GodotVar implements Iterable<T> {
+    constructor(...args: any[]) { super(38, ...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 {@link Vector4} at the given `index` in the array. If `index` is out-of-bounds or negative, this method fails and returns `Vector4(0, 0, 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): Vector4 { return _C(this, 3652, index) as Vector4; }
+
+    /**
+     * Changes the {@link Vector4} 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; }
+
+    /**
+     * Inserts a {@link Vector4} at the end.
+     */
+    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 PackedVector4Array} at the end of this array.
+     */
+    appendArray(array: PackedVector4Array): 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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 PackedVector4Array}, from `begin` (inclusive) to `end` (exclusive), as a new {@link PackedVector4Array}.
+     * 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 */): PackedVector4Array { return _C(this, 13658, begin, end) as PackedVector4Array; }
+
+    /**
+     * Returns a {@link PackedByteArray} with each vector encoded as bytes.
+     */
+    toByteArray(): PackedByteArray { return _C(this, 14289) as PackedByteArray; }
+
+    /**
+     * Sorts the elements of the array in ascending order.
+     * **Note:** Vectors with `NAN` elements don't behave the same as other vectors. 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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(): PackedVector4Array { return _C(this, 2980) as PackedVector4Array; }
+
+    /**
+     * Searches the array for a value and returns its index or `-1` if not found. Optionally, the initial search index can be passed.
+     * **Note:** Vectors with `NAN` elements don't behave the same as other vectors. 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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:** Vectors with `NAN` elements don't behave the same as other vectors. 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(38, PackedVector4Array);
+}