PoolIntArray

    An array specifically designed to hold integer values (). Optimized for memory usage, does not fragment the memory.

    Note: This type is passed by value and not by reference. This means that when mutating a class property of type or mutating a PoolIntArray within an Array or , changes will be lost:

    Instead, the entire PoolIntArray property must be reassigned with = for it to be changed:

    1. var array = [PoolIntArray()]
    2. var pool_array = array[0]
    3. array[0] = pool_array

    Note: This type is limited to signed 32-bit integers, which means it can only take values in the interval [-2^31, 2^31 - 1], i.e. [-2147483648, 2147483647]. Exceeding those bounds will wrap around. In comparison, int uses signed 64-bit integers which can hold much larger values.

    • PoolIntArray ( Array from )

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


    • void append ( int integer )

    Appends an element at the end of the array (alias of ).


    Appends a at the end of this array.


    • count ( int value )

    Returns the number of times an element is in the array.


    • empty ( )

    Returns true if the array is empty.


    • void fill ( int integer )

    Assigns the given value to all elements in the array. This can typically be used together with to create an array with a given size and initialized elements.


    • int find ( value, int from=0 )

    Searches the array for a value and returns its index or -1 if not found. Optionally, the initial search index can be passed. Returns -1 if from is out of bounds.


    Returns true if the array contains the given value.

    Note: This is equivalent to using the operator.


    • insert ( int idx, integer )

    Inserts a new int at a given position in the array. The position must be valid, or at the end of the array (idx == size()).


    • void invert ( )

    Reverses the order of the elements in the array.


    • void push_back ( int integer )

    Appends a value to the array.


    • void remove ( idx )

    Removes an element from the array by index.


    • void resize ( int idx )

    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.

    Note: Added elements are not automatically initialized to 0 and will contain garbage, i.e. indeterminate values.


    • rfind ( int value, from=-1 )

    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.


    • void set ( int idx, integer )

    Changes the int at the given index.


    Returns the number of elements in the array.


    • void sort ( )