16 #ifndef BT_HASHED_SIMPLE_PAIR_CACHE_H 17 #define BT_HASHED_SIMPLE_PAIR_CACHE_H 72 void removeAllPairs();
74 virtual void* removeOverlappingPair(
int indexA,
int indexB);
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 int key =
static_cast<int>(((
unsigned int)indexA) | (((
unsigned int)indexB) <<16));
139 return static_cast<unsigned int>(key);
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
virtual btSimplePair * addOverlappingPair(int indexA, int indexB)
unsigned int getHash(unsigned int indexA, unsigned int indexB)
btSimplePair * internalFindPair(int proxyIdA, int proxyIdB, int hash)
int gOverlappingSimplePairs
#define SIMD_FORCE_INLINE
btSimplePairArray & getOverlappingPairArray()
virtual btSimplePair * getOverlappingPairArrayPtr()
const int BT_SIMPLE_NULL_PAIR
const btSimplePairArray & getOverlappingPairArray() const
btAlignedObjectArray< int > m_hashTable
int getNumOverlappingPairs() const
btAlignedObjectArray< btSimplePair > btSimplePairArray
int size() const
return the number of elements in the array
bool equalsPair(const btSimplePair &pair, int indexA, int indexB)
const btSimplePair * getOverlappingPairArrayPtr() const
btAlignedObjectArray< int > m_next
btSimplePairArray m_overlappingPairArray
btSimplePair(int indexA, int indexB)