16 #ifndef BT_HASHED_SIMPLE_PAIR_CACHE_H    17 #define BT_HASHED_SIMPLE_PAIR_CACHE_H    70         void removeAllPairs();
    72         virtual void*   removeOverlappingPair(
int indexA,
int indexB);
    80                 return internalAddPair(indexA,indexB);
    86                 return &m_overlappingPairArray[0];
    91                 return &m_overlappingPairArray[0];
    96                 return m_overlappingPairArray;
   101                 return m_overlappingPairArray;
   111                 return m_overlappingPairArray.
size();
   128                 int key = 
static_cast<int>(((
unsigned int)indexA) | (((
unsigned int)indexB) <<16));
   137                 return static_cast<unsigned int>(key);
   147                 int index = m_hashTable[hash];
   149                 while( index != 
BT_SIMPLE_NULL_PAIR && equalsPair(m_overlappingPairArray[index], proxyIdA, proxyIdB) == 
false)
   151                         index = m_next[index];
   161                 return &m_overlappingPairArray[index];
   170 #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)
int gOverlappingSimplePairs
#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)