20#ifdef BT_DEBUG_COLLISION_PAIRS
51#ifdef BT_DEBUG_COLLISION_PAIRS
154#ifdef BT_DEBUG_COLLISION_PAIRS
const int BT_SIMPLE_NULL_PAIR
const T & btMax(const T &a, const T &b)
int size() const
return the number of elements in the array
void resize(int newsize, const T &fillData=T())
void clear()
clear the array, deallocated memory. Generally it is better to use array.resize(0),...
T & expandNonInitializing()
int capacity() const
return the pre-allocated (reserved) elements, this is at least as large as the total number of elemen...
virtual ~btHashedSimplePairCache()
btSimplePair * internalFindPair(int proxyIdA, int proxyIdB, int hash)
unsigned int getHash(unsigned int indexA, unsigned int indexB)
btSimplePair * internalAddPair(int indexA, int indexB)
btAlignedObjectArray< int > m_hashTable
btAlignedObjectArray< int > m_next
btSimplePairArray m_overlappingPairArray
btHashedSimplePairCache()
btSimplePair * findPair(int indexA, int indexB)
bool equalsPair(const btSimplePair &pair, int indexA, int indexB)
virtual void * removeOverlappingPair(int indexA, int indexB)