A node in the k-d tree.
More...
#include <KDTree.hh>
|
void | search_n (const int idx0, const int nd, const unsigned int nn, double &r2, const std::vector< double > &qv, const KDTree &tree, std::priority_queue< KDTreeResult > &res) const |
void | search_r (const int idx0, const int nd, const double r2, const std::vector< double > &qv, const KDTree &tree, std::vector< KDTreeResult > &res) const |
bool | box_in_search_range (const double r2, const std::vector< double > &qv) const |
void | process_terminal_node_n (const int idx0, const int nd, const unsigned int nn, double &r2, const std::vector< double > &qv, const KDTree &tree, std::priority_queue< KDTreeResult > &res) const |
void | process_terminal_node_r (const int idx0, const int nd, const double r2, const std::vector< double > &qv, const KDTree &tree, std::vector< KDTreeResult > &res) const |
A node in the k-d tree.
Definition at line 102 of file KDTree.hh.
◆ KDTreeNode()
Garfield::KDTreeNode::KDTreeNode |
( |
int | dim | ) |
|
◆ ~KDTreeNode()
Garfield::KDTreeNode::~KDTreeNode |
( |
| ) |
|
◆ box_in_search_range()
bool Garfield::KDTreeNode::box_in_search_range |
( |
const double | r2, |
|
|
const std::vector< double > & | qv ) const |
|
private |
◆ process_terminal_node_n()
void Garfield::KDTreeNode::process_terminal_node_n |
( |
const int | idx0, |
|
|
const int | nd, |
|
|
const unsigned int | nn, |
|
|
double & | r2, |
|
|
const std::vector< double > & | qv, |
|
|
const KDTree & | tree, |
|
|
std::priority_queue< KDTreeResult > & | res ) const |
|
private |
◆ process_terminal_node_r()
void Garfield::KDTreeNode::process_terminal_node_r |
( |
const int | idx0, |
|
|
const int | nd, |
|
|
const double | r2, |
|
|
const std::vector< double > & | qv, |
|
|
const KDTree & | tree, |
|
|
std::vector< KDTreeResult > & | res ) const |
|
private |
◆ search_n()
void Garfield::KDTreeNode::search_n |
( |
const int | idx0, |
|
|
const int | nd, |
|
|
const unsigned int | nn, |
|
|
double & | r2, |
|
|
const std::vector< double > & | qv, |
|
|
const KDTree & | tree, |
|
|
std::priority_queue< KDTreeResult > & | res ) const |
|
private |
◆ search_r()
void Garfield::KDTreeNode::search_r |
( |
const int | idx0, |
|
|
const int | nd, |
|
|
const double | r2, |
|
|
const std::vector< double > & | qv, |
|
|
const KDTree & | tree, |
|
|
std::vector< KDTreeResult > & | res ) const |
|
private |
◆ KDTree
◆ box
std::vector<std::array<double, 2> > Garfield::KDTreeNode::box |
|
private |
◆ cut_dim
std::size_t Garfield::KDTreeNode::cut_dim = 0 |
|
private |
◆ cut_val
double Garfield::KDTreeNode::cut_val = 0. |
|
private |
◆ cut_val_left
double Garfield::KDTreeNode::cut_val_left = 0. |
|
private |
◆ cut_val_right
double Garfield::KDTreeNode::cut_val_right = 0. |
|
private |
◆ left
◆ m_l
int Garfield::KDTreeNode::m_l = 0 |
|
private |
◆ m_u
int Garfield::KDTreeNode::m_u = 0 |
|
private |
◆ right
The documentation for this class was generated from the following file:
- /builds/garfield/docs/source/Include/Garfield/KDTree.hh