CGAL 6.1.1 - Spatial Sorting

Loading...
Searching...
No Matches
List of all members
CGAL::Multiscale_sort< Sort > Class Template Reference
Reference Manual » Function Objects

`#include <CGAL/Multiscale_sort.h>`

## Definition

template<typename Sort>
class CGAL::Multiscale_sort< Sort >

The class `Multiscale_sort` represents a sorting algorithm adaptor.

Given a range of `n` points:

1. it applies `Sort` on the last `(1 - ratio) * n` points,
2. it recurses on the first `ratio * n` points, stopping when there are fewer 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.

## Operations
template<class InputIterator >
void | operator() (InputIterator begin, InputIterator end) const
| sorts the range `[begin, end)`.

## Member Function Documentation

## ◆ operator()()

template<typename Sort >
template<class InputIterator >

void CGAL::Multiscale_sort< Sort >::operator() | ( | InputIterator | begin,
|  | InputIterator | end
| ) |  | const

sorts the range `[begin, end)`.

`Sort::operator()(InputIterator begin, InputIterator end)` must be defined.