A pairset array. More...

#include <btGImpactBvh.h>

Inherits btAlignedObjectArray< GIM_PAIR >.

Public Member Functions
	btPairSet ()

void	push_pair (int index1, int index2)

void	push_pair_inv (int index1, int index2)

Public Member Functions inherited from btAlignedObjectArray< GIM_PAIR >
SIMD_FORCE_INLINE 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.

	~btAlignedObjectArray ()

SIMD_FORCE_INLINE int	size () const
	return the number of elements in the array

SIMD_FORCE_INLINE const GIM_PAIR &	at (int n) const

SIMD_FORCE_INLINE GIM_PAIR &	at (int n)

SIMD_FORCE_INLINE const GIM_PAIR &	operator[] (int n) const

SIMD_FORCE_INLINE GIM_PAIR &	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.

SIMD_FORCE_INLINE void	pop_back ()

SIMD_FORCE_INLINE void	resizeNoInitialize (int newsize)

SIMD_FORCE_INLINE void	resize (int newsize, const GIM_PAIR &fillData=GIM_PAIR())

SIMD_FORCE_INLINE GIM_PAIR &	expandNonInitializing ()

SIMD_FORCE_INLINE GIM_PAIR &	expand (const GIM_PAIR &fillValue=GIM_PAIR())

SIMD_FORCE_INLINE void	push_back (const GIM_PAIR &_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()

SIMD_FORCE_INLINE 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/

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

int	findLinearSearch (const GIM_PAIR &key) const

int	findLinearSearch2 (const GIM_PAIR &key) const

void	removeAtIndex (int index)

void	remove (const GIM_PAIR &key)

void	initializeFromBuffer (void *buffer, int size, int capacity)

void	copyFromArray (const btAlignedObjectArray &otherArray)

Additional Inherited Members
Protected Member Functions inherited from btAlignedObjectArray< GIM_PAIR >
SIMD_FORCE_INLINE int	allocSize (int size)

SIMD_FORCE_INLINE void	copy (int start, int end, GIM_PAIR *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 ()