Bullet Collision Detection & Physics Library
|
The btAlignedObjectArray template class uses a subset of the stl::vector interface for its methods It is developed to replace stl::vector to avoid portability issues, including STL alignment issues to add SIMD/SSE data. More...
#include <btAlignedObjectArray.h>
Classes | |
class | less |
Public Member Functions | |
btAlignedObjectArray< T > & | operator= (const btAlignedObjectArray< T > &other) |
btAlignedObjectArray () | |
~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... | |
int | size () const |
return the number of elements in the array More... | |
const T & | at (int n) const |
T & | at (int n) |
const T & | operator[] (int n) const |
T & | 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 T &fillData=T()) |
T & | expandNonInitializing () |
T & | expand (const T &fillValue=T()) |
void | push_back (const T &_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) |
template<typename L > | |
void | quickSortInternal (const L &CompareFunc, int lo, int hi) |
template<typename L > | |
void | quickSort (const L &CompareFunc) |
template<typename L > | |
void | downHeap (T *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) |
template<typename L > | |
void | heapSort (const L &CompareFunc) |
int | findBinarySearch (const T &key) const |
non-recursive binary search, assumes sorted array More... | |
int | findLinearSearch (const T &key) const |
void | remove (const T &key) |
void | initializeFromBuffer (void *buffer, int size, int capacity) |
void | copyFromArray (const btAlignedObjectArray &otherArray) |
Protected Member Functions | |
int | allocSize (int size) |
void | copy (int start, int end, T *dest) const |
void | init () |
void | destroy (int first, int last) |
void * | allocate (int size) |
void | deallocate () |
Private Attributes | |
btAlignedAllocator< T, 16 > | m_allocator |
int | m_size |
int | m_capacity |
T * | m_data |
bool | m_ownsMemory |
The btAlignedObjectArray template class uses a subset of the stl::vector interface for its methods It is developed to replace stl::vector to avoid portability issues, including STL alignment issues to add SIMD/SSE data.
Definition at line 47 of file btAlignedObjectArray.h.
|
inline |
Definition at line 126 of file btAlignedObjectArray.h.
|
inline |
Definition at line 131 of file btAlignedObjectArray.h.
|
inline |
Generally it is best to avoid using the copy constructor of an btAlignedObjectArray, and use a (const) reference to the array instead.
Definition at line 137 of file btAlignedObjectArray.h.
|
inlineprotected |
Definition at line 102 of file btAlignedObjectArray.h.
|
inlineprotected |
Definition at line 70 of file btAlignedObjectArray.h.
|
inline |
Definition at line 154 of file btAlignedObjectArray.h.
|
inline |
Definition at line 161 of file btAlignedObjectArray.h.
|
inline |
return the pre-allocated (reserved) elements, this is at least as large as the total number of elements,see size() and reserve()
Definition at line 295 of file btAlignedObjectArray.h.
|
inline |
clear the array, deallocated memory. Generally it is better to use array.resize(0), to reduce performance overhead of run-time memory (de)allocations.
Definition at line 184 of file btAlignedObjectArray.h.
|
inlineprotected |
Definition at line 74 of file btAlignedObjectArray.h.
|
inline |
Definition at line 502 of file btAlignedObjectArray.h.
|
inlineprotected |
Definition at line 109 of file btAlignedObjectArray.h.
|
inlineprotected |
Definition at line 93 of file btAlignedObjectArray.h.
|
inline |
heap sort from http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Sort/Heap/
Definition at line 377 of file btAlignedObjectArray.h.
|
inline |
Definition at line 260 of file btAlignedObjectArray.h.
|
inline |
Definition at line 247 of file btAlignedObjectArray.h.
|
inline |
non-recursive binary search, assumes sorted array
Definition at line 446 of file btAlignedObjectArray.h.
|
inline |
Definition at line 465 of file btAlignedObjectArray.h.
|
inline |
Definition at line 423 of file btAlignedObjectArray.h.
|
inlineprotected |
Definition at line 85 of file btAlignedObjectArray.h.
|
inline |
Definition at line 493 of file btAlignedObjectArray.h.
|
inline |
Definition at line 59 of file btAlignedObjectArray.h.
|
inline |
Definition at line 168 of file btAlignedObjectArray.h.
|
inline |
Definition at line 175 of file btAlignedObjectArray.h.
|
inline |
Definition at line 193 of file btAlignedObjectArray.h.
|
inline |
Definition at line 276 of file btAlignedObjectArray.h.
|
inline |
Definition at line 365 of file btAlignedObjectArray.h.
|
inline |
Definition at line 335 of file btAlignedObjectArray.h.
|
inline |
Definition at line 481 of file btAlignedObjectArray.h.
|
inline |
Definition at line 300 of file btAlignedObjectArray.h.
|
inline |
Definition at line 220 of file btAlignedObjectArray.h.
|
inline |
resize changes the number of elements in the array.
If the new size is larger, the new elements will be constructed using the optional second argument. when the new number of elements is smaller, the destructor will be called, but memory will not be freed, to reduce performance overhead of run-time memory (de)allocations.
Definition at line 203 of file btAlignedObjectArray.h.
|
inline |
return the number of elements in the array
Definition at line 149 of file btAlignedObjectArray.h.
|
inline |
Definition at line 407 of file btAlignedObjectArray.h.
|
private |
Definition at line 49 of file btAlignedObjectArray.h.
|
private |
Definition at line 52 of file btAlignedObjectArray.h.
|
private |
Definition at line 53 of file btAlignedObjectArray.h.
|
private |
Definition at line 55 of file btAlignedObjectArray.h.
|
private |
Definition at line 51 of file btAlignedObjectArray.h.