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

Interface for nearest node type searches. More...

#include <mpblocks/kd_tree/NearestSearch.h>

Inheritance diagram for mpblocks::kd_tree::NearestSearchIface< 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, const Point_t &p, Node_t *n)=0
	evaluate the current point, and add the corresponding node to the result set if necessary More...
virtual bool	shouldRecurse (const Point_t &q, const HyperRect_t &h)=0
	evaluate the hyper rectangle and return true if it is possible that we must recurse into it More...
virtual	~NearestSearchIface ()
	just ensure virtualness More...

Detailed Description

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

Interface for nearest node type searches.

Definition at line 38 of file NearestSearch.h.

Member Typedef Documentation

template<class Traits>

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

Definition at line 40 of file NearestSearch.h.

template<class Traits>

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

Definition at line 42 of file NearestSearch.h.

template<class Traits>

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

Definition at line 41 of file NearestSearch.h.

template<class Traits>

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

Definition at line 45 of file NearestSearch.h.

template<class Traits>

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

Definition at line 44 of file NearestSearch.h.

Constructor & Destructor Documentation

template<class Traits>

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

inlinevirtual

just ensure virtualness

Definition at line 48 of file NearestSearch.h.

Member Function Documentation

template<class Traits>

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

pure virtual

evaluate the current point, and add the corresponding node to the result set if necessary

Implemented in mpblocks::kd_tree::euclidean::KNearestBallCenter< Traits, Allocator >, mpblocks::kd_tree::r2_s1::KNearest< Traits, Allocator >, mpblocks::kd_tree::euclidean::KNearestBall< Traits, Allocator >, mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator >, mpblocks::kd_tree::r2_s1::Nearest< Traits >, and mpblocks::kd_tree::euclidean::Nearest< Traits >.

template<class Traits>

virtual bool mpblocks::kd_tree::NearestSearchIface< Traits >::shouldRecurse ( const Point_t &  q, const HyperRect_t &  h  )

pure virtual

evaluate the hyper rectangle and return true if it is possible that we must recurse into it

Implemented in mpblocks::kd_tree::euclidean::KNearestBallCenter< Traits, Allocator >, mpblocks::kd_tree::r2_s1::KNearest< Traits, Allocator >, mpblocks::kd_tree::euclidean::KNearestBall< Traits, Allocator >, mpblocks::kd_tree::euclidean::KNearest< Traits, Allocator >, mpblocks::kd_tree::r2_s1::Nearest< Traits >, and mpblocks::kd_tree::euclidean::Nearest< Traits >.

---

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

• include/mpblocks/kd_tree/NearestSearch.h