|
FairRoot/PandaRoot
|
This is the complete list of members for kdtree::KDTree, including all inherited members.
| bucketsize | kdtree::KDTree | privatestatic |
| build_tree() | kdtree::KDTree | private |
| build_tree_for_range(int l, int u, KDTreeNode *parent) | kdtree::KDTree | private |
| data | kdtree::KDTree | private |
| dim | kdtree::KDTree | |
| ind | kdtree::KDTree | private |
| KDTree(KDTreeArray &data_in, bool rearrange_in=true, int dim_in=-1) | kdtree::KDTree | |
| KDTreeNode class | kdtree::KDTree | friend |
| N | kdtree::KDTree | |
| n_nearest(std::vector< double > &qv, int nn, KDTreeResultVector &result) | kdtree::KDTree | |
| n_nearest_around_point(int idxin, int correltime, int nn, KDTreeResultVector &result) | kdtree::KDTree | |
| n_nearest_brute_force(std::vector< double > &qv, int nn, KDTreeResultVector &result) | kdtree::KDTree | |
| r_count(std::vector< double > &qv, double r2) | kdtree::KDTree | |
| r_count_around_point(int idxin, int correltime, double r2) | kdtree::KDTree | |
| r_nearest(std::vector< double > &qv, double r2, KDTreeResultVector &result) | kdtree::KDTree | |
| r_nearest_around_point(int idxin, int correltime, double r2, KDTreeResultVector &result) | kdtree::KDTree | |
| rearrange | kdtree::KDTree | |
| rearranged_data | kdtree::KDTree | private |
| root | kdtree::KDTree | private |
| SearchRecord class | kdtree::KDTree | friend |
| select_on_coordinate(int c, int k, int l, int u) | kdtree::KDTree | private |
| select_on_coordinate_value(int c, double alpha, int l, int u) | kdtree::KDTree | private |
| set_data(KDTreeArray &din) | kdtree::KDTree | private |
| sort_results | kdtree::KDTree | |
| spread_in_coordinate(int c, int l, int u, interval &interv) | kdtree::KDTree | private |
| the_data | kdtree::KDTree | |
| ~KDTree() | kdtree::KDTree |
1.8.5