PoolVector2Array

Vector2s.

Description

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

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

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

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

Tutorials

  • 2D Navigation Astar Demo

    Methods

    Method Descriptions

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