btSortedOverlappingPairCache maintains the objects with overlapping AABB Typically managed by the Broadphase, Axis3Sweep or btSimpleBroadphase  
 More...
#include <btOverlappingPairCache.h>
|  | 
|  | btSortedOverlappingPairCache () | 
|  | 
| virtual | ~btSortedOverlappingPairCache () | 
|  | 
| virtual void | processAllOverlappingPairs (btOverlapCallback *, btDispatcher *dispatcher) | 
|  | 
| void * | removeOverlappingPair (btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1, btDispatcher *dispatcher) | 
|  | 
| void | cleanOverlappingPair (btBroadphasePair &pair, btDispatcher *dispatcher) | 
|  | 
| btBroadphasePair * | addOverlappingPair (btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1) | 
|  | 
| btBroadphasePair * | findPair (btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1) | 
|  | this findPair becomes really slow.  More... 
 | 
|  | 
| void | cleanProxyFromPairs (btBroadphaseProxy *proxy, btDispatcher *dispatcher) | 
|  | 
| void | removeOverlappingPairsContainingProxy (btBroadphaseProxy *proxy, btDispatcher *dispatcher) | 
|  | 
| bool | needsBroadphaseCollision (btBroadphaseProxy *proxy0, btBroadphaseProxy *proxy1) const | 
|  | 
| btBroadphasePairArray & | getOverlappingPairArray () | 
|  | 
| const btBroadphasePairArray & | getOverlappingPairArray () const | 
|  | 
| btBroadphasePair * | getOverlappingPairArrayPtr () | 
|  | 
| const btBroadphasePair * | getOverlappingPairArrayPtr () const | 
|  | 
| int | getNumOverlappingPairs () const | 
|  | 
| btOverlapFilterCallback * | getOverlapFilterCallback () | 
|  | 
| void | setOverlapFilterCallback (btOverlapFilterCallback *callback) | 
|  | 
| virtual bool | hasDeferredRemoval () | 
|  | 
| virtual void | setInternalGhostPairCallback (btOverlappingPairCallback *ghostPairCallback) | 
|  | 
| virtual void | sortOverlappingPairs (btDispatcher *dispatcher) | 
|  | 
| virtual | ~btOverlappingPairCache () | 
|  | 
| virtual void | processAllOverlappingPairs (btOverlapCallback *callback, btDispatcher *dispatcher, const struct btDispatcherInfo &dispatchInfo) | 
|  | 
| virtual | ~btOverlappingPairCallback () | 
|  | 
btSortedOverlappingPairCache maintains the objects with overlapping AABB Typically managed by the Broadphase, Axis3Sweep or btSimpleBroadphase 
Definition at line 257 of file btOverlappingPairCache.h.
◆ btSortedOverlappingPairCache()
      
        
          | btSortedOverlappingPairCache::btSortedOverlappingPairCache | ( |  | ) |  | 
      
 
 
◆ ~btSortedOverlappingPairCache()
  
  | 
        
          | btSortedOverlappingPairCache::~btSortedOverlappingPairCache | ( |  | ) |  |  | virtual | 
 
 
◆ addOverlappingPair()
◆ cleanOverlappingPair()
◆ cleanProxyFromPairs()
◆ findPair()
this findPair becomes really slow. 
Either sort the list to speedup the query, or use a different solution. It is mainly used for Removing overlapping pairs. Removal could be delayed. we could keep a linked list in each proxy, and store pair in one of the proxies (with lowest memory address) Also we can use a 2D bitmap, which can be useful for a future GPU implementation 
Implements btOverlappingPairCache.
Definition at line 488 of file btOverlappingPairCache.cpp.
 
 
◆ getNumOverlappingPairs()
  
  | 
        
          | int btSortedOverlappingPairCache::getNumOverlappingPairs | ( |  | ) | const |  | inlinevirtual | 
 
 
◆ getOverlapFilterCallback()
◆ getOverlappingPairArray() [1/2]
◆ getOverlappingPairArray() [2/2]
◆ getOverlappingPairArrayPtr() [1/2]
◆ getOverlappingPairArrayPtr() [2/2]
  
  | 
        
          | const btBroadphasePair* btSortedOverlappingPairCache::getOverlappingPairArrayPtr | ( |  | ) | const |  | inlinevirtual | 
 
 
◆ hasDeferredRemoval()
  
  | 
        
          | virtual bool btSortedOverlappingPairCache::hasDeferredRemoval | ( |  | ) |  |  | inlinevirtual | 
 
 
◆ needsBroadphaseCollision()
◆ processAllOverlappingPairs()
◆ removeOverlappingPair()
◆ removeOverlappingPairsContainingProxy()
◆ setInternalGhostPairCallback()
◆ setOverlapFilterCallback()
◆ sortOverlappingPairs()
  
  | 
        
          | void btSortedOverlappingPairCache::sortOverlappingPairs | ( | btDispatcher * | dispatcher | ) |  |  | virtual | 
 
 
◆ m_blockedForChanges
  
  | 
        
          | bool btSortedOverlappingPairCache::m_blockedForChanges |  | protected | 
 
 
◆ m_ghostPairCallback
◆ m_hasDeferredRemoval
  
  | 
        
          | bool btSortedOverlappingPairCache::m_hasDeferredRemoval |  | protected | 
 
 
◆ m_overlapFilterCallback
◆ m_overlappingPairArray
The documentation for this class was generated from the following files: