mpblocks::kd_tree::RangeSearchIface< Traits > Class Template Reference

#include <mpblocks/kd_tree/RangeSearch.h>

Inheritance diagram for mpblocks::kd_tree::RangeSearchIface< Traits >:

Public Types
typedef Traits::Format_t	Format_t
typedef Traits::HyperRect	HyperRect_t
typedef Traits::Node	Node_t
typedef Vector_t	Point_t
typedef Eigen::Matrix < Format_t, Traits::NDim, 1 >	Vector_t

Public Member Functions
virtual void	evaluate (const Point_t &q, Node_t *n)=0
	evalute if p is inside the range, and add n to the result set if it is More...
virtual bool	shouldRecurse (const HyperRect_t &h)=0
	return true if the hyper rectangle intersects the range More...
virtual	~RangeSearchIface ()
	just ensure virtualness More...

Detailed Description

template<class Traits>
class mpblocks::kd_tree::RangeSearchIface< Traits >

Definition at line 38 of file RangeSearch.h.

Member Typedef Documentation

template<class Traits >

typedef Traits::Format_t mpblocks::kd_tree::RangeSearchIface< Traits >::Format_t

Definition at line 40 of file RangeSearch.h.

template<class Traits >

typedef Traits::HyperRect mpblocks::kd_tree::RangeSearchIface< Traits >::HyperRect_t

Definition at line 42 of file RangeSearch.h.

template<class Traits >

typedef Traits::Node mpblocks::kd_tree::RangeSearchIface< Traits >::Node_t

Definition at line 41 of file RangeSearch.h.

template<class Traits >

typedef Vector_t mpblocks::kd_tree::RangeSearchIface< Traits >::Point_t

Definition at line 45 of file RangeSearch.h.

template<class Traits >

typedef Eigen::Matrix<Format_t,Traits::NDim,1> mpblocks::kd_tree::RangeSearchIface< Traits >::Vector_t

Definition at line 44 of file RangeSearch.h.

Constructor & Destructor Documentation

template<class Traits >

virtual mpblocks::kd_tree::RangeSearchIface< Traits >::~RangeSearchIface ( )

inlinevirtual

just ensure virtualness

Definition at line 48 of file RangeSearch.h.

Member Function Documentation

template<class Traits >

virtual void mpblocks::kd_tree::RangeSearchIface< Traits >::evaluate ( const Point_t &  q, Node_t *  n  )

pure virtual

evalute if p is inside the range, and add n to the result set if it is

Implemented in mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >.

template<class Traits >

virtual bool mpblocks::kd_tree::RangeSearchIface< Traits >::shouldRecurse ( const HyperRect_t &  h )

pure virtual

return true if the hyper rectangle intersects the range

Implemented in mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >.

---

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

• include/mpblocks/kd_tree/RangeSearch.h