Logo Search packages:      
Sourcecode: blender version File versions  Download package

btAlignedObjectArray< T > Class Template Reference

#include <btAlignedObjectArray.h>

List of all members.

Detailed Description

template<typename T>
class btAlignedObjectArray< T >

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 46 of file btAlignedObjectArray.h.

Public Member Functions

 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.
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()
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.
template<typename L>
void downHeap (T *pArr, int k, int n, L CompareFunc)
 heap sort from http://www.csse.monash.edu.au/~lloyd/tildeAlgDS/Sort/Heap/
SIMD_FORCE_INLINE T & expand (const T &fillValue=T())
int findBinarySearch (const T &key) const
 non-recursive binary search, assumes sorted array
int findLinearSearch (const T &key) const
template<typename L>
void heapSort (L CompareFunc)
void initializeFromBuffer (void *buffer, int size, int capacity)
SIMD_FORCE_INLINE T & operator[] (int n)
SIMD_FORCE_INLINE const T & operator[] (int n) const
SIMD_FORCE_INLINE void pop_back ()
SIMD_FORCE_INLINE void push_back (const T &_Val)
template<typename L>
void quickSort (L CompareFunc)
template<typename L>
void quickSortInternal (L CompareFunc, int lo, int hi)
void remove (const T &key)
SIMD_FORCE_INLINE void reserve (int _Count)
SIMD_FORCE_INLINE void resize (int newsize, const T &fillData=T())
SIMD_FORCE_INLINE int size () const
 return the number of elements in the array
void swap (int index0, int index1)

Protected Member Functions

SIMD_FORCE_INLINE void * allocate (int size)
SIMD_FORCE_INLINE int allocSize (int size)
SIMD_FORCE_INLINE void copy (int start, int end, T *dest) const
SIMD_FORCE_INLINE void deallocate ()
SIMD_FORCE_INLINE void destroy (int first, int last)
SIMD_FORCE_INLINE void init ()

Private Attributes

btAlignedAllocator< T, 16 > m_allocator
int m_capacity
T * m_data
bool m_ownsMemory
int m_size


class  less

The documentation for this class was generated from the following file:

Generated by  Doxygen 1.6.0   Back to index