45 for (
int i = 0; i < N; i++)
70 for (
int i=0;i<numElements;i++)
73#ifndef STATIC_SIMULATION_ISLAND_OPTIMIZATION
int size() const
return the number of elements in the array
void resize(int newsize, const T &fillData=T())
void clear()
clear the array, deallocated memory. Generally it is better to use array.resize(0),...
void quickSort(const L &CompareFunc)
bool operator()(const btElement &lhs, const btElement &rhs) const
void sortIslands()
this is a special operation, destroying the content of btUnionFind.
btAlignedObjectArray< btElement > m_elements