|  | 
|  | btPairSet () | 
|  | 
| void | push_pair (int index1, int index2) | 
|  | 
| void | push_pair_inv (int index1, int index2) | 
|  | 
| btAlignedObjectArray< GIM_PAIR > & | operator= (const btAlignedObjectArray< GIM_PAIR > &other) | 
|  | 
|  | btAlignedObjectArray () | 
|  | 
|  | btAlignedObjectArray (const btAlignedObjectArray &otherArray) | 
|  | Generally it is best to avoid using the copy constructor of an btAlignedObjectArray, and use a (const) reference to the array instead.  More... 
 | 
|  | 
|  | ~btAlignedObjectArray () | 
|  | 
| int | size () const | 
|  | return the number of elements in the array  More... 
 | 
|  | 
| const GIM_PAIR & | at (int n) const | 
|  | 
| GIM_PAIR & | at (int n) | 
|  | 
| const GIM_PAIR & | operator[] (int n) const | 
|  | 
| GIM_PAIR & | operator[] (int n) | 
|  | 
| 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.  More... 
 | 
|  | 
| void | pop_back () | 
|  | 
| void | resizeNoInitialize (int newsize) | 
|  | resize changes the number of elements in the array.  More... 
 | 
|  | 
| void | resize (int newsize, const GIM_PAIR &fillData=GIM_PAIR()) | 
|  | 
| GIM_PAIR & | expandNonInitializing () | 
|  | 
| GIM_PAIR & | expand (const GIM_PAIR &fillValue=GIM_PAIR()) | 
|  | 
| void | push_back (const GIM_PAIR &_Val) | 
|  | 
| int | capacity () const | 
|  | return the pre-allocated (reserved) elements, this is at least as large as the total number of elements,see size() and reserve()  More... 
 | 
|  | 
| void | reserve (int _Count) | 
|  | 
| void | quickSortInternal (const L &CompareFunc, int lo, int hi) | 
|  | 
| void | quickSort (const L &CompareFunc) | 
|  | 
| void | downHeap (GIM_PAIR *pArr, int k, int n, const L &CompareFunc) | 
|  | heap sort from http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Sort/Heap/  More... 
 | 
|  | 
| void | swap (int index0, int index1) | 
|  | 
| void | heapSort (const L &CompareFunc) | 
|  | 
| int | findBinarySearch (const GIM_PAIR &key) const | 
|  | non-recursive binary search, assumes sorted array  More... 
 | 
|  | 
| int | findLinearSearch (const GIM_PAIR &key) const | 
|  | 
| void | remove (const GIM_PAIR &key) | 
|  | 
| void | initializeFromBuffer (void *buffer, int size, int capacity) | 
|  | 
| void | copyFromArray (const btAlignedObjectArray &otherArray) | 
|  | 
A pairset array. 
Definition at line 59 of file btGImpactBvh.h.