PoolIntArray

int).

Description

int). 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 PoolIntArray or mutating a PoolIntArray within an Array or Dictionary, changes will be lost:

  1. var array = [PoolIntArray()]array[0].push_back(1234)print(array)  # [[]] (empty PoolIntArray within an Array)

PoolIntArray property must be reassigned with = for it to be changed:

  1. var array = [PoolIntArray()]var pool_array = array[0]pool_array.push_back(1234)array[0] = pool_arrayprint(array)  # [[1234]] (PoolIntArray with 1 element inside an 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.

Methods

Method Descriptions

  • PoolIntArray PoolIntArray ( Array from ) PoolIntArray. Optionally, you can pass in a generic Array that will be converted.
  • append ( int integer ) push_back).
  • append_array ( PoolIntArray array ) PoolIntArray at the end of this array.
  • int count ( int value ) Returns the number of times an element is in the array.
  • bool empty ( ) true if the array is empty.
  • fill ( int integer ) resize to create an array with a given size and initialized elements.
  • int find ( int value, int from=0 ) -1 if not found. Optionally, the initial search index can be passed. Returns -1 if from is out of bounds.
  • bool has ( int value ) true if the array contains the given value. Note: This is equivalent to using the in operator.
  • int insert ( int idx, int integer ) idx == size()).
  • invert ( ) Reverses the order of the elements in the array.
  • push_back ( int integer ) Appends a value to the array.
  • remove ( int idx ) Removes an element from the array by index.
  • 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.
  • int rfind ( int value, int 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.
  • set ( int idx, int integer ) Changes the int at the given index.
  • int size ( ) Returns the number of elements in the array.
  • sort ( ) Sorts the elements of the array in ascending order.