|
| SIMD_FORCE_INLINE btAlignedObjectArray< BT_QUANTIZED_BVH_NODE > & | operator= (const btAlignedObjectArray< BT_QUANTIZED_BVH_NODE > &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 () |
| |
| SIMD_FORCE_INLINE int | size () const |
| | return the number of elements in the array More...
|
| |
| SIMD_FORCE_INLINE const BT_QUANTIZED_BVH_NODE & | at (int n) const |
| |
| SIMD_FORCE_INLINE BT_QUANTIZED_BVH_NODE & | at (int n) |
| |
| SIMD_FORCE_INLINE const BT_QUANTIZED_BVH_NODE & | operator[] (int n) const |
| |
| SIMD_FORCE_INLINE BT_QUANTIZED_BVH_NODE & | operator[] (int n) |
| |
| SIMD_FORCE_INLINE 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...
|
| |
| SIMD_FORCE_INLINE void | pop_back () |
| |
| SIMD_FORCE_INLINE void | resizeNoInitialize (int newsize) |
| |
| SIMD_FORCE_INLINE void | resize (int newsize, const BT_QUANTIZED_BVH_NODE &fillData=BT_QUANTIZED_BVH_NODE()) |
| |
| SIMD_FORCE_INLINE BT_QUANTIZED_BVH_NODE & | expandNonInitializing () |
| |
| SIMD_FORCE_INLINE BT_QUANTIZED_BVH_NODE & | expand (const BT_QUANTIZED_BVH_NODE &fillValue=BT_QUANTIZED_BVH_NODE()) |
| |
| SIMD_FORCE_INLINE void | push_back (const BT_QUANTIZED_BVH_NODE &_Val) |
| |
| SIMD_FORCE_INLINE 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...
|
| |
| SIMD_FORCE_INLINE void | reserve (int _Count) |
| |
| void | quickSortInternal (const L &CompareFunc, int lo, int hi) |
| |
| void | quickSort (const L &CompareFunc) |
| |
| void | downHeap (BT_QUANTIZED_BVH_NODE *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 BT_QUANTIZED_BVH_NODE &key) const |
| | non-recursive binary search, assumes sorted array More...
|
| |
| int | findLinearSearch (const BT_QUANTIZED_BVH_NODE &key) const |
| |
| int | findLinearSearch2 (const BT_QUANTIZED_BVH_NODE &key) const |
| |
| void | removeAtIndex (int index) |
| |
| void | remove (const BT_QUANTIZED_BVH_NODE &key) |
| |
| void | initializeFromBuffer (void *buffer, int size, int capacity) |
| |
| void | copyFromArray (const btAlignedObjectArray &otherArray) |
| |
| SIMD_FORCE_INLINE int | allocSize (int size) |
| |
| SIMD_FORCE_INLINE void | copy (int start, int end, BT_QUANTIZED_BVH_NODE *dest) const |
| |
| SIMD_FORCE_INLINE void | init () |
| |
| SIMD_FORCE_INLINE void | destroy (int first, int last) |
| |
| SIMD_FORCE_INLINE void * | allocate (int size) |
| |
| SIMD_FORCE_INLINE void | deallocate () |
| |
Definition at line 31 of file btGImpactQuantizedBvh.h.
Public Member Functions inherited from