16 #ifndef BT_HASHED_SIMPLE_PAIR_CACHE_H 17 #define BT_HASHED_SIMPLE_PAIR_CACHE_H 128 unsigned int key = indexA | (indexB << 16);
170 #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()
btHashedSimplePairCache()
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)
btSimplePair * findPair(int indexA, int indexB)
const btSimplePair * getOverlappingPairArrayPtr() const
virtual ~btHashedSimplePairCache()
btAlignedObjectArray< int > m_next
virtual void * removeOverlappingPair(int indexA, int indexB)
btSimplePairArray m_overlappingPairArray
btSimplePair * internalAddPair(int indexA, int indexB)
btSimplePair(int indexA, int indexB)