G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::BoundsComparator Class Reference

#include <KDTree.h>

Public Member Functions
	BoundsComparator (Vector3::Axis a)
int	operator() (Handle *A, const Handle *B) const

Public Attributes
Vector3::Axis	sortAxis

Detailed Description

template<class T, class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>
class G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::BoundsComparator

Compares bounds for strict >, <, or overlap

Constructor & Destructor Documentation

template<class T , class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>

G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::BoundsComparator::BoundsComparator ( Vector3::Axis  a )

inline

: sortAxis(a) {}

Member Function Documentation

template<class T , class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>

int G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::BoundsComparator::operator() ( Handle *  A, const Handle *  B  ) const

inline

 {
 const AABox& a = A->bounds;
 const AABox& b = B->bounds;

 if (a.high()[sortAxis] < b.low()[sortAxis]) {
 return 1;
 } else if (a.low()[sortAxis] > b.high()[sortAxis]) {
 return -1;
 } else {
 return 0;
 }
 }

Here is the call graph for this function:

Member Data Documentation

template<class T , class BoundsFunc = BoundsTrait<T>, class HashFunc = HashTrait<T>, class EqualsFunc = EqualsTrait<T>>

Vector3::Axis G3D::KDTree< T, BoundsFunc, HashFunc, EqualsFunc >::BoundsComparator::sortAxis

---

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

• dep/g3dlite/include/G3D/KDTree.h