sfof
|
Class for constructing a kd-tree. More...
#include <kdtree_class.hpp>
Classes | |
class | Kdtree_node |
Class structure for kd-tree properties. More... | |
Public Member Functions | |
class Kdtree_node * | build_kdtree (std::vector< Galaxy * >::iterator begin, std::vector< Galaxy * >::iterator end, class Point[2], int) |
void | set_Kdtree (std::vector< Galaxy > &, double) |
void | write_Kdtree (const std::string &) |
void | WalkTree (class Kdtree_node *, int) |
void | WalkTree (class Kdtree_node *, std::ofstream &) |
int | range_search (Point &, int, double, std::deque< Galaxy * > &) const |
int | range_search (Galaxy &, double, std::deque< Galaxy * > &) const |
int | range_search_loop (Kdtree_node *, class Point &, int, double, node_to_galaxy, std::deque< Galaxy * > &) const |
Public Attributes | |
class Kdtree_node * | Nodes |
class Kdtree_node * | root |
std::vector< Galaxy > | AllG |
std::vector< Galaxy * > | GalPtrs |
Point | MIN |
Point | MAX |
int | NNodes |
int | NMaxNodes |
int | NLeaves |
double | max_axis_inequality |
double | sample_area |
Private Attributes | |
Astro | astro |
Class for constructing a kd-tree.
This class constructs a kd-tree.
Kdtree::Kdtree_node * Kdtree::build_kdtree | ( | std::vector< Galaxy * >::iterator | begin, |
std::vector< Galaxy * >::iterator | end, | ||
class Point | box[2], | ||
int | depth | ||
) |
int Kdtree::range_search | ( | Point & | origin, |
int | num, | ||
double | link_r, | ||
std::deque< Galaxy * > & | GalList | ||
) | const |
int Kdtree::range_search_loop | ( | Kdtree_node * | start, |
class Point & | origin, | ||
int | num, | ||
double | radius, | ||
node_to_galaxy | status, | ||
std::deque< Galaxy * > & | GalList | ||
) | const |
void Kdtree::set_Kdtree | ( | std::vector< Galaxy > & | Gals, |
double | max_inq = 0.3 |
||
) |
void Kdtree::WalkTree | ( | class Kdtree_node * | start, |
int | mode | ||
) |
void Kdtree::WalkTree | ( | class Kdtree_node * | , |
std::ofstream & | |||
) |
void Kdtree::write_Kdtree | ( | const std::string & | output_file | ) |
std::vector<Galaxy> Kdtree::AllG |
|
private |
std::vector<Galaxy*> Kdtree::GalPtrs |
Point Kdtree::MAX |
double Kdtree::max_axis_inequality |
Point Kdtree::MIN |
int Kdtree::NLeaves |
int Kdtree::NMaxNodes |
int Kdtree::NNodes |
class Kdtree_node* Kdtree::Nodes |
class Kdtree_node * Kdtree::root |
double Kdtree::sample_area |