mpblocks::kd_tree::euclidean::Ball< Traits, Allocator > Class Template Reference
#include <mpblocks/kd_tree/euclidean/Ball.h>
Inheritance diagram for mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >:
Public Types | |
| typedef Allocator< Key_t > | Allocator_t |
| typedef Distance< Traits > | Distance_t |
| typedef Traits::Format_t | Format_t |
| typedef HyperRect< Traits > | HyperRect_t |
| typedef Key< Traits > | Key_t |
| typedef Key_t::Compare | KeyCompare_t |
| typedef std::vector< Node_t *, Allocator_t > | List_t |
| typedef Traits::Node | Node_t |
| typedef Eigen::Matrix < Format_t, Traits::NDim, 1 > | Point_t |
 Public Types inherited from mpblocks::kd_tree::RangeSearchIface< Traits > | |
| 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 | |
| Ball (const Point_t ¢er=Point_t::Zero(), Format_t radius=1) | |
| virtual void | evaluate (const Point_t &p, Node_t *n) |
calculates Euclidean distance from q to p, and if its less than the current best replaces the current best node with n More... | |
| void | reset () |
| void | reset (const Point_t ¢er, Format_t radius) |
| const List_t & | result () |
| virtual bool | shouldRecurse (const HyperRect_t &r) |
evaluate the Euclidean distance from q to it's closest point in r and if that distance is less than the current best distance, return true More... | |
| virtual | ~Ball () |
| Public Member Functions inherited from mpblocks::kd_tree::RangeSearchIface< Traits > | |
| virtual | ~RangeSearchIface () |
| just ensure virtualness More... | |
Protected Attributes | |
| Point_t | m_center |
| Distance_t | m_dist2Fn |
| List_t | m_list |
| Format_t | m_radius |
Detailed Description
template<class Traits, template< class > class Allocator = std::allocator>
class mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >
Member Typedef Documentation
template<class Traits , template< class > class Allocator = std::allocator>
| typedef Allocator<Key_t> mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >::Allocator_t |
template<class Traits , template< class > class Allocator = std::allocator>
| typedef Distance<Traits> mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >::Distance_t |
template<class Traits , template< class > class Allocator = std::allocator>
| typedef Traits::Format_t mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >::Format_t |
template<class Traits , template< class > class Allocator = std::allocator>
| typedef HyperRect<Traits> mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >::HyperRect_t |
template<class Traits , template< class > class Allocator = std::allocator>
| typedef Key<Traits> mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >::Key_t |
template<class Traits , template< class > class Allocator = std::allocator>
| typedef Key_t::Compare mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >::KeyCompare_t |
template<class Traits , template< class > class Allocator = std::allocator>
| typedef std::vector<Node_t*,Allocator_t> mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >::List_t |
template<class Traits , template< class > class Allocator = std::allocator>
| typedef Traits::Node mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >::Node_t |
template<class Traits , template< class > class Allocator = std::allocator>
| typedef Eigen::Matrix<Format_t,Traits::NDim,1> mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >::Point_t |
Constructor & Destructor Documentation
template<class Traits , template< class > class Allocator>
| mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >::Ball | ( | const Point_t & | center = Point_t::Zero(), |
| Format_t | radius = 1 |
||
| ) |
template<class Traits , template< class > class Allocator = std::allocator>
|
inlinevirtual |
Member Function Documentation
template<class Traits , template< class > class Allocator>
|
virtual |
calculates Euclidean distance from q to p, and if its less than the current best replaces the current best node with n
Implements mpblocks::kd_tree::RangeSearchIface< Traits >.
template<class Traits , template< class > class Allocator>
| void mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >::reset | ( | ) |
template<class Traits , template< class > class Allocator>
| void mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >::reset | ( | const Point_t & | center, |
| Format_t | radius | ||
| ) |
template<class Traits , template< class > class Allocator>
| const Ball< Traits, Allocator >::List_t & mpblocks::kd_tree::euclidean::Ball< Traits, Allocator >::result | ( | ) |
template<class Traits , template< class > class Allocator>
|
virtual |
evaluate the Euclidean distance from q to it's closest point in r and if that distance is less than the current best distance, return true
Implements mpblocks::kd_tree::RangeSearchIface< Traits >.
Member Data Documentation
template<class Traits , template< class > class Allocator = std::allocator>
|
protected |
template<class Traits , template< class > class Allocator = std::allocator>
|
protected |
template<class Traits , template< class > class Allocator = std::allocator>
|
protected |
template<class Traits , template< class > class Allocator = std::allocator>
|
protected |
The documentation for this class was generated from the following files:
