|
cheshirekow
v0.1.0
|
#include <mpblocks/kd_tree/euclidean/blocks/Nearest.h>
Public Types | |
| typedef Traits::Format_t | Format_t |
| typedef Traits::Node | Node_t |
| typedef Eigen::Matrix < Format_t, Traits::NDim, 1 > | Point_t |
| typedef euclidean::Nearest < Traits > | Search_t |
| typedef Nearest< Traits > | This_t |
| typedef Tree< Traits > | Tree_t |
Public Member Functions | |
| Nearest (Tree_t *tree=0) | |
| void | search (const Point_t &q) |
| void | setTree (Tree_t *tree) |
| sigc::slot< void, const Point_t & > | slot_search () |
Public Attributes | |
| sigc::signal< void, Node_t * > | sig_result |
Protected Attributes | |
| Search_t | m_search |
| Tree_t * | m_tree |
| typedef Traits::Format_t mpblocks::kd_tree::euclidean::blocks::Nearest< Traits >::Format_t |
| typedef Traits::Node mpblocks::kd_tree::euclidean::blocks::Nearest< Traits >::Node_t |
| typedef Eigen::Matrix<Format_t,Traits::NDim,1> mpblocks::kd_tree::euclidean::blocks::Nearest< Traits >::Point_t |
| typedef euclidean::Nearest<Traits> mpblocks::kd_tree::euclidean::blocks::Nearest< Traits >::Search_t |
| typedef Nearest<Traits> mpblocks::kd_tree::euclidean::blocks::Nearest< Traits >::This_t |
| typedef Tree<Traits> mpblocks::kd_tree::euclidean::blocks::Nearest< Traits >::Tree_t |
|
inline |
|
inline |
|
inline |
|
inline |
|
protected |
|
protected |
| sigc::signal<void,Node_t*> mpblocks::kd_tree::euclidean::blocks::Nearest< Traits >::sig_result |