PoolVector3Array

Vector3.

Description

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

  1. var array = [PoolVector3Array()]array[0].push_back(Vector3(12, 34, 56))print(array)  # [[]] (empty PoolVector3Array within an Array)

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

  1. var array = [PoolVector3Array()]var pool_array = array[0]pool_array.push_back(Vector3(12, 34, 56))array[0] = pool_arrayprint(array)  # [[(12, 34, 56)]] (PoolVector3Array with 1 element inside an Array)

Methods

Method Descriptions

  • PoolVector3Array PoolVector3Array ( Array from ) PoolVector3Array. Optionally, you can pass in a generic Array that will be converted.
  • append ( Vector3 vector3 ) push_back).
  • append_array ( PoolVector3Array array ) PoolVector3Array at the end of this array.
  • int count ( Vector3 value ) Returns the number of times an element is in the array.
  • bool empty ( ) true if the array is empty.
  • fill ( Vector3 vector3 ) resize to create an array with a given size and initialized elements.
  • int find ( Vector3 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 ( Vector3 value ) true if the array contains the given value. Note: This is equivalent to using the in operator.
  • int insert ( int idx, Vector3 vector3 ) idx == size()).
  • invert ( ) Reverses the order of the elements in the array.
  • push_back ( Vector3 vector3 ) Vector3 at the end.
  • 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.
  • int rfind ( Vector3 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, Vector3 vector3 ) Vector3 at the given index.
  • int size ( ) Returns the number of elements in the array.
  • sort ( ) Sorts the elements of the array in ascending order.