32 int initialAllocatedSize= 2;
55 int initialAllocatedSize= 2;
106 m_next.resize(newCapacity);
111 for (i= 0; i < newCapacity; ++i)
115 for (i = 0; i < newCapacity; ++i)
120 for(i=0;i<curHashtableSize;i++)
154 if (oldCapacity < newCapacity)
201 while (index != pairIndex)
224 if (lastPairIndex == pairIndex)
239 while (index != lastPairIndex)
int gOverlappingSimplePairs
const int BT_SIMPLE_NULL_PAIR
int size() const
return the number of elements in the array
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)