16 #ifndef BT_HASHED_SIMPLE_PAIR_CACHE_H 17 #define BT_HASHED_SIMPLE_PAIR_CACHE_H 46 #ifdef BT_DEBUG_COLLISION_PAIRS 47 extern int gOverlappingSimplePairs;
48 extern int gRemoveSimplePairs;
49 extern int gAddedSimplePairs;
50 extern int gFindSimplePairs;
51 #endif //BT_DEBUG_COLLISION_PAIRS 70 void removeAllPairs();
72 virtual void* removeOverlappingPair(
int indexA,
int indexB);
78 #ifdef BT_DEBUG_COLLISION_PAIRS 82 return internalAddPair(indexA,indexB);
88 return &m_overlappingPairArray[0];
93 return &m_overlappingPairArray[0];
98 return m_overlappingPairArray;
103 return m_overlappingPairArray;
113 return m_overlappingPairArray.
size();
130 unsigned int key = indexA | (indexB << 16);
149 int index = m_hashTable[hash];
151 while( index !=
BT_SIMPLE_NULL_PAIR && equalsPair(m_overlappingPairArray[index], proxyIdA, proxyIdB) ==
false)
153 index = m_next[index];
163 return &m_overlappingPairArray[index];
172 #endif //BT_HASHED_SIMPLE_PAIR_CACHE_H
const btSimplePairArray & getOverlappingPairArray() const
virtual btSimplePair * addOverlappingPair(int indexA, int indexB)
unsigned int getHash(unsigned int indexA, unsigned int indexB)
btSimplePair * internalFindPair(int proxyIdA, int proxyIdB, int hash)
#define SIMD_FORCE_INLINE
btSimplePairArray & getOverlappingPairArray()
virtual btSimplePair * getOverlappingPairArrayPtr()
const btSimplePair * getOverlappingPairArrayPtr() const
const int BT_SIMPLE_NULL_PAIR
int size() const
return the number of elements in the array
btAlignedObjectArray< int > m_hashTable
btAlignedObjectArray< btSimplePair > btSimplePairArray
bool equalsPair(const btSimplePair &pair, int indexA, int indexB)
int getNumOverlappingPairs() const
btAlignedObjectArray< int > m_next
btSimplePairArray m_overlappingPairArray
btSimplePair(int indexA, int indexB)