T_ANN_compare_algorithms< GeometricKernelD > Class Template Reference

#include <ANN_compare_algorithms.hpp>

Public Types
enum	Comparison_type { CONSTRUCTION , K_NEAREST_QUERY , NEAREST_QUERY , DYNAMICAL }
typedef T_ANN_compare_algorithms< GeometricKernelD >	Self
typedef GeometricKernelD::FT	FT
typedef GeometricKernelD::Point_d	Point
typedef CGAL::Random_points_in_cube_d< Point >	Generator

Public Member Functions
	T_ANN_compare_algorithms (unsigned dimension=2, const FT &box_size=100, unsigned number_of_points=10000, unsigned number_of_queries=1000)
template<class InputIterator >
	T_ANN_compare_algorithms (InputIterator begin, InputIterator end)
	~T_ANN_compare_algorithms (void)
template<class Algorithm1 , class Algorithm2 >
void	operator() (Algorithm1 &algo_1, Algorithm2 &algo_2, Comparison_type type, std::ostream &out=std::cout)

Member Typedef Documentation

FT

typedef GeometricKernelD::FT FT

Generator

typedef CGAL::Random_points_in_cube_d<Point> Generator

Point

typedef GeometricKernelD::Point_d Point

Self

typedef T_ANN_compare_algorithms<GeometricKernelD> Self

Member Enumeration Documentation

Comparison_type

enum Comparison_type

Enumerator
CONSTRUCTION
K_NEAREST_QUERY
NEAREST_QUERY
DYNAMICAL

Constructor & Destructor Documentation

T_ANN_compare_algorithms() [1/2]

T_ANN_compare_algorithms ( unsigned  dimension = 2, const FT &  box_size = 100, unsigned  number_of_points = 10000, unsigned  number_of_queries = 1000  )

inline

T_ANN_compare_algorithms() [2/2]

T_ANN_compare_algorithms ( InputIterator  begin, InputIterator  end  )

inline

~T_ANN_compare_algorithms()

~T_ANN_compare_algorithms ( void  )

inline

Member Function Documentation

operator()()

void operator() ( Algorithm1 &  algo_1, Algorithm2 &  algo_2, Comparison_type  type, std::ostream &  out = std::cout  )

inline