45         for (
int i = 0; i < N; i++) 
    70         for (
int i=0;i<numElements;i++)
    73 #ifndef STATIC_SIMULATION_ISLAND_OPTIMIZATION    75 #endif //STATIC_SIMULATION_ISLAND_OPTIMIZATION void sortIslands()
this is a special operation, destroying the content of btUnionFind. 
void clear()
clear the array, deallocated memory. Generally it is better to use array.resize(0), to reduce performance overhead of run-time memory (de)allocations. 
int size() const
return the number of elements in the array 
void resize(int newsize, const T &fillData=T())
btAlignedObjectArray< btElement > m_elements
void quickSort(const L &CompareFunc)