25 m_ghostPairCallback(0)
27 int initialAllocatedSize = 2;
58 : m_cleanProxy(cleanProxy),
59 m_pairCache(pairCache),
60 m_dispatcher(dispatcher)
74 CleanPairCallback cleanPairs(proxy,
this, dispatcher);
87 : m_obsoleteProxy(obsoleteProxy)
92 return ((pair.
m_pProxy0 == m_obsoleteProxy) ||
97 RemovePairCallback removeCallback(proxy);
106 int proxyId1 = proxy0->
getUid();
107 int proxyId2 = proxy1->
getUid();
151 for (i = 0; i < newCapacity; ++i)
155 for (i = 0; i < newCapacity; ++i)
160 for (i = 0; i < curHashtableSize; i++)
178 int proxyId1 = proxy0->
getUid();
179 int proxyId2 = proxy1->
getUid();
210 if (oldCapacity < newCapacity)
233 int proxyId1 = proxy0->
getUid();
234 int proxyId2 = proxy1->
getUid();
262 while (index != pairIndex)
288 if (lastPairIndex == pairIndex)
303 while (index != lastPairIndex)
334 BT_PROFILE(
"btHashedOverlappingPairCache::processAllOverlappingPairs");
368 return uidA0 > uidB0 || (uidA0 == uidB0 && uidA1 > uidB1);
381 for (
int i = 0; i < indices.
size(); i++)
387 indices[i].m_uidA0 = uidA0;
388 indices[i].m_uidA1 = uidA1;
389 indices[i].m_orgIndex = i;
394 BT_PROFILE(
"btHashedOverlappingPairCache::processAllOverlappingPairs");
396 for (i = 0; i < indices.
size();)
426 for (i = 0; i < tmpPairs.
size(); i++)
438 for (i = 0; i < tmpPairs.
size(); i++)
530 m_hasDeferredRemoval(true),
531 m_overlapFilterCallback(0),
532 m_ghostPairCallback(0)
534 int initialAllocatedSize = 2;
564 : m_cleanProxy(cleanProxy),
565 m_pairCache(pairCache),
566 m_dispatcher(dispatcher)
580 CleanPairCallback cleanPairs(proxy,
this, dispatcher);
593 : m_obsoleteProxy(obsoleteProxy)
598 return ((pair.
m_pProxy0 == m_obsoleteProxy) ||
603 RemovePairCallback removeCallback(proxy);
void push_back(const T &_Val)
virtual void processAllOverlappingPairs(btOverlapCallback *, btDispatcher *dispatcher)
virtual void cleanOverlappingPair(btBroadphasePair &pair, btDispatcher *dispatcher)=0
int findLinearSearch(const T &key) const
btBroadphasePair * internalFindPair(btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1, int hash)
btAlignedObjectArray< int > m_hashTable
btBroadphasePairArray & getOverlappingPairArray()
btOverlappingPairCallback * m_ghostPairCallback
btBroadphasePairArray m_overlappingPairArray
bool equalsPair(const btBroadphasePair &pair, int proxyId1, int proxyId2)
virtual ~btCollisionAlgorithm()
btOverlappingPairCallback * m_ghostPairCallback
void cleanProxyFromPairs(btBroadphaseProxy *proxy, btDispatcher *dispatcher)
void swap(int index0, int index1)
The btOverlappingPairCache provides an interface for overlapping pair management (add, remove, storage), used by the btBroadphaseInterface broadphases.
virtual void sortOverlappingPairs(btDispatcher *dispatcher)
virtual bool hasDeferredRemoval()
unsigned int getHash(unsigned int proxyId1, unsigned int proxyId2)
btHashedOverlappingPairCache()
btBroadphasePair * internalAddPair(btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1)
void cleanOverlappingPair(btBroadphasePair &pair, btDispatcher *dispatcher)
btBroadphasePair * addOverlappingPair(btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1)
bool needsBroadphaseCollision(btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1) const
btBroadphasePair * findPair(btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1)
int capacity() const
return the pre-allocated (reserved) elements, this is at least as large as the total number of elemen...
virtual void freeCollisionAlgorithm(void *ptr)=0
virtual bool processOverlap(btBroadphasePair &pair)=0
void * removeOverlappingPair(btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1, btDispatcher *dispatcher)
btAlignedObjectArray< int > m_next
btSortedOverlappingPairCache()
The btBroadphaseProxy is the main class that can be used with the Bullet broadphases.
btBroadphaseProxy * m_pProxy1
btCollisionAlgorithm * m_algorithm
virtual void * removeOverlappingPair(btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1, btDispatcher *dispatcher)
int size() const
return the number of elements in the array
btBroadphasePairArray m_overlappingPairArray
btBroadphaseProxy * m_pProxy0
bool operator()(const MyPairIndex &a, const MyPairIndex &b) const
virtual void sortOverlappingPairs(btDispatcher *dispatcher)
virtual btBroadphasePair * addOverlappingPair(btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1)=0
void resize(int newsize, const T &fillData=T())
void removeOverlappingPairsContainingProxy(btBroadphaseProxy *proxy, btDispatcher *dispatcher)
bool m_deterministicOverlappingPairs
virtual btBroadphasePair * addOverlappingPair(btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1)
virtual void processAllOverlappingPairs(btOverlapCallback *, btDispatcher *dispatcher)
virtual ~btSortedOverlappingPairCache()
void cleanProxyFromPairs(btBroadphaseProxy *proxy, btDispatcher *dispatcher)
The btDispatcher interface class can be used in combination with broadphase to dispatch calculations ...
T & expandNonInitializing()
btBroadphasePair * findPair(btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1)
this findPair becomes really slow.
void removeOverlappingPairsContainingProxy(btBroadphaseProxy *proxy, btDispatcher *dispatcher)
void cleanOverlappingPair(btBroadphasePair &pair, btDispatcher *dispatcher)
virtual ~btHashedOverlappingPairCache()
void quickSort(const L &CompareFunc)
virtual void * removeOverlappingPair(btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1, btDispatcher *dispatcher)=0
The btBroadphasePair class contains a pair of aabb-overlapping objects.