#include <CGAL/Hilbert_sort_3.h>
template<typename Traits, typename PolicyTag, typename ConcurrencyTag = Sequential_tag>
class CGAL::Hilbert_sort_3< Traits, PolicyTag, ConcurrencyTag >
The function object Hilbert_sort_3 sorts iterator ranges of Traits::Point_3 along a Hilbert curve by recursively subdividing at the median or the middle, depending on the PolicyTag(see Section Hilbert Sorting for more information on the policies).
- Template Parameters
-
|
|
| Hilbert_sort_3 (const Traits &traits=Traits()) |
| | constructs an instance with traits as traits class instance.
|
| |
|
| template<class InputPointIterator > |
| void | operator() (InputPointIterator begin, InputPointIterator end) const |
| | It sorts the range [begin, end). More...
|
| |
◆ operator()()
template<typename Traits , typename PolicyTag , typename ConcurrencyTag = Sequential_tag>
template<class InputPointIterator >
| void CGAL::Hilbert_sort_3< Traits, PolicyTag, ConcurrencyTag >::operator() |
( |
InputPointIterator |
begin, |
|
|
InputPointIterator |
end |
|
) |
| const |
It sorts the range [begin, end).
- Template Parameters
-