Kdtree_d< Traits > Member List

This is the complete list of members for Kdtree_d< Traits >, including all inherited members.

build(std::vector< Point > &v)	Kdtree_d< Traits >	inline
build_r(Point_ptr *arr, int left, int right, int d)	Kdtree_d< Traits >	inlineprivate
comp(const Point &a, const Point &b, int dim)	Kdtree_d< Traits >	inlineprivatestatic
delete_all()	Kdtree_d< Traits >	inline
dim	Kdtree_d< Traits >	private
dump()	Kdtree_d< Traits >	inline
get_max_element(Point_ptr *arr, int left, int right, int d)	Kdtree_d< Traits >	inlineprivatestatic
is_valid(bool verbose=false, int level=0) const	Kdtree_d< Traits >	inline
Kdtree_d(int k=2)	Kdtree_d< Traits >	inlineexplicit
list_points typedef	Kdtree_d< Traits >
List_points typedef	Kdtree_d< Traits >
malloc_node(void)	Kdtree_d< Traits >	inlineprivate
node_count	Kdtree_d< Traits >	private
p_arr_pt	Kdtree_d< Traits >	private
p_node_arr	Kdtree_d< Traits >	private
partition(Point_ptr *arr, int left, int right, Point *p_pivot, int dim)	Kdtree_d< Traits >	inlineprivatestatic
Point typedef	Kdtree_d< Traits >
Point_ptr typedef	Kdtree_d< Traits >	private
root	Kdtree_d< Traits >	private
search(std::back_insert_iterator< list_points > result, Box &rect)	Kdtree_d< Traits >	inline
size	Kdtree_d< Traits >	private
split_arr(Point_ptr *arr, int left, int right, int pos_mid, int dim)	Kdtree_d< Traits >	inlineprivatestatic
~Kdtree_d()	Kdtree_d< Traits >	inline