Bullet Collision Detection & Physics Library
List of all members

#include <btGImpactBvh.h>

Inheritance diagram for GIM_BVH_TREE_NODE_ARRAY:
Inheritance graph
Collaboration diagram for GIM_BVH_TREE_NODE_ARRAY:
Collaboration graph

Additional Inherited Members

- Public Member Functions inherited from btAlignedObjectArray< GIM_BVH_TREE_NODE >
btAlignedObjectArray< GIM_BVH_TREE_NODE > & operator= (const btAlignedObjectArray< GIM_BVH_TREE_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 ()
int size () const
 return the number of elements in the array More...
const GIM_BVH_TREE_NODEat (int n) const
const GIM_BVH_TREE_NODEoperator[] (int n) const
GIM_BVH_TREE_NODEoperator[] (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_BVH_TREE_NODE &fillData=GIM_BVH_TREE_NODE())
GIM_BVH_TREE_NODEexpandNonInitializing ()
void push_back (const GIM_BVH_TREE_NODE &_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_BVH_TREE_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 GIM_BVH_TREE_NODE &key) const
 non-recursive binary search, assumes sorted array More...
int findLinearSearch (const GIM_BVH_TREE_NODE &key) const
int findLinearSearch2 (const GIM_BVH_TREE_NODE &key) const
void removeAtIndex (int index)
void remove (const GIM_BVH_TREE_NODE &key)
void initializeFromBuffer (void *buffer, int size, int capacity)
void copyFromArray (const btAlignedObjectArray &otherArray)
- Protected Member Functions inherited from btAlignedObjectArray< GIM_BVH_TREE_NODE >
int allocSize (int size)
void copy (int start, int end, GIM_BVH_TREE_NODE *dest) const
void init ()
void destroy (int first, int last)
void * allocate (int size)
void deallocate ()

Detailed Description

Definition at line 58 of file btGImpactBvh.h.

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