CGAL::Hilbert_sort_d< Traits, PolicyTag > Class Template Reference

#include <CGAL/Hilbert_sort_d.h>

Definition

template<typename Traits, typename PolicyTag>
class CGAL::Hilbert_sort_d< Traits, PolicyTag >

The function object Hilbert_sort_d sorts iterator ranges of Traits::Point_d along a Hilbert curve by recursively subdividing at the median or the middle depending on the PolicyTag.

Template Parameters

Traits	must be a model for SpatialSortingTraits_d.
PolicyTag	is used to specify the strategy policy. Possible values are Hilbert_sort_median_policy (the default policy) or Hilbert_sort_middle_policy .

Creation
	Hilbert_sort_d (const Traits &traits=Traits())
	constructs an instance with traits as traits class instance.

Operations
template<class InputPointIterator >
void	operator() (InputPointIterator begin, InputPointIterator end) const
	It sorts the range [begin, end).

Constructor & Destructor Documentation

Hilbert_sort_d()

template<typename Traits , typename PolicyTag >

CGAL::Hilbert_sort_d< Traits, PolicyTag >::Hilbert_sort_d

(

const Traits &

traits = Traits()

)

constructs an instance with traits as traits class instance.

Member Function Documentation

operator()()

template<typename Traits , typename PolicyTag >

template<class InputPointIterator >

void CGAL::Hilbert_sort_d< Traits, PolicyTag >::operator()	(	InputPointIterator	begin,
		InputPointIterator	end
	)		const

It sorts the range [begin, end).

Template Parameters

InputPointIterator

must be a model of RandomAccessIterator with value type Traits::Point_d.