CGAL 4.7 - Spatial Sorting
|
#include <CGAL/Multiscale_sort.h>
The class Multiscale_sort
represents a sorting algorithm adaptor.
Given a range of n
points:
Sort
on the last (1 - ratio) * n
points, ratio * n
points, stopping when there are less than threshold
points. Creation | |
Multiscale_sort (const Sort &sort=Sort(), std::ptrdiff_t threshold=1, double ratio=0.5) | |
constructs an instance with traits as traits class instance. More... | |
Operations | |
template<class RandomAccessIterator > | |
void | operator() (RandomAccessIterator begin, RandomAccessIterator end) const |
sorts the range [begin, end) . More... | |
CGAL::Multiscale_sort< Sort >::Multiscale_sort | ( | const Sort & | sort = Sort() , |
std::ptrdiff_t | threshold = 1 , |
||
double | ratio = 0.5 |
||
) |
constructs an instance with traits
as traits class instance.
void CGAL::Multiscale_sort< Sort >::operator() | ( | RandomAccessIterator | begin, |
RandomAccessIterator | end | ||
) | const |
sorts the range [begin, end)
.
Sort::operator()(RandomAccessIterator begin, RandomAccessIterator end)
is defined.