BIHWrap< T, BoundsFunc > Class Template Reference

#include <BoundingIntervalHierarchyWrapper.h>

Classes
struct	MDLCallback

Public Member Functions
	BIHWrap ()
void	insert (const T &obj)
void	remove (const T &obj)
void	balance ()
template<typename RayCallback >
void	intersectRay (const G3D::Ray &ray, RayCallback &intersectCallback, float &maxDist)
template<typename IsectCallback >
void	intersectPoint (const G3D::Vector3 &point, IsectCallback &intersectCallback)

Private Types
typedef G3D::Array< const T * >	ObjArray

Private Attributes
BIH	m_tree
ObjArray	m_objects
G3D::Table< const T *, uint32 >	m_obj2Idx
G3D::Set< const T * >	m_objects_to_push
int	unbalanced_times

Member Typedef Documentation

template<class T , class BoundsFunc = BoundsTrait<T>>

typedef G3D::Array<const T*> BIHWrap< T, BoundsFunc >::ObjArray

private

Constructor & Destructor Documentation

template<class T , class BoundsFunc = BoundsTrait<T>>

BIHWrap< T, BoundsFunc >::BIHWrap ( )

inline

: unbalanced_times(0) { }

Member Function Documentation

template<class T , class BoundsFunc = BoundsTrait<T>>

void BIHWrap< T, BoundsFunc >::balance ( )

inline

 {
 if (unbalanced_times == 0)
 return;

 unbalanced_times = 0;
 m_objects.fastClear();
 m_obj2Idx.getKeys(m_objects);
 m_objects_to_push.getMembers(m_objects);
 //assert that m_obj2Idx has all the keys

 m_tree.build(m_objects, BoundsFunc::getBounds2);
 }

Here is the call graph for this function:

Here is the caller graph for this function:

template<class T , class BoundsFunc = BoundsTrait<T>>

void BIHWrap< T, BoundsFunc >::insert ( const T &  obj )

inline

 {
 ++unbalanced_times;
 m_objects_to_push.insert(&obj);
 }

Here is the call graph for this function:

template<class T , class BoundsFunc = BoundsTrait<T>>

template<typename IsectCallback >

void BIHWrap< T, BoundsFunc >::intersectPoint ( const G3D::Vector3 &  point, IsectCallback &  intersectCallback  )

inline

 {
 balance();
 MDLCallback<IsectCallback> callback(intersectCallback, m_objects.getCArray(), m_objects.size());
 m_tree.intersectPoint(point, callback);
 }

Here is the call graph for this function:

template<class T , class BoundsFunc = BoundsTrait<T>>

template<typename RayCallback >

void BIHWrap< T, BoundsFunc >::intersectRay ( const G3D::Ray &  ray, RayCallback &  intersectCallback, float &  maxDist  )

inline

 {
 balance();
 MDLCallback<RayCallback> temp_cb(intersectCallback, m_objects.getCArray(), m_objects.size());
 m_tree.intersectRay(ray, temp_cb, maxDist, true);
 }

Here is the call graph for this function:

template<class T , class BoundsFunc = BoundsTrait<T>>

void BIHWrap< T, BoundsFunc >::remove ( const T &  obj )

inline

 {
 ++unbalanced_times;
 uint32 Idx = 0;
 const T * temp;
 if (m_obj2Idx.getRemove(&obj, temp, Idx))
 m_objects[Idx] = NULL;
 else
 m_objects_to_push.remove(&obj);
 }

Here is the call graph for this function:

Member Data Documentation

template<class T , class BoundsFunc = BoundsTrait<T>>

G3D::Table<const T*, uint32> BIHWrap< T, BoundsFunc >::m_obj2Idx

private

template<class T , class BoundsFunc = BoundsTrait<T>>

ObjArray BIHWrap< T, BoundsFunc >::m_objects

private

template<class T , class BoundsFunc = BoundsTrait<T>>

G3D::Set<const T*> BIHWrap< T, BoundsFunc >::m_objects_to_push

private

template<class T , class BoundsFunc = BoundsTrait<T>>

BIH BIHWrap< T, BoundsFunc >::m_tree

private

template<class T , class BoundsFunc = BoundsTrait<T>>

int BIHWrap< T, BoundsFunc >::unbalanced_times

private

---

The documentation for this class was generated from the following file:

• src/common/Collision/BoundingIntervalHierarchyWrapper.h