1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
|
// Copyright (c) 2007 INRIA Sophia-Antipolis (France).
// All rights reserved.
//
// This file is part of CGAL (www.cgal.org); you can redistribute it and/or
// modify it under the terms of the GNU Lesser General Public License as
// published by the Free Software Foundation; either version 3 of the License,
// or (at your option) any later version.
//
// Licensees holding a valid commercial license may use this file in
// accordance with the commercial license agreement provided with the software.
//
// This file is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
// WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
//
// $URL: svn+ssh://scm.gforge.inria.fr/svn/cgal/branches/next/Spatial_sorting/include/CGAL/Multiscale_sort.h $
// $Id: Multiscale_sort.h 67093 2012-01-13 11:22:39Z lrineau $
//
// Author(s) : Christophe Delage
#ifndef CGAL_MULTISCALE_SORT_H
#define CGAL_MULTISCALE_SORT_H
#include <CGAL/basic.h>
#include <iterator>
#include <cstddef>
namespace CGAL {
template <class Sort>
class Multiscale_sort
{
Sort _sort;
std::ptrdiff_t _threshold;
double _ratio;
public:
Multiscale_sort (const Sort &sort = Sort(), std::ptrdiff_t threshold = 1, double ratio = 0.5)
: _sort (sort), _threshold (threshold), _ratio (ratio)
{
CGAL_precondition (0. <= ratio && ratio <= 1.);
}
template <class RandomAccessIterator>
void operator() (RandomAccessIterator begin, RandomAccessIterator end) const
{
typedef typename std::iterator_traits<RandomAccessIterator>::difference_type difference_type;
RandomAccessIterator middle = begin;
if (end - begin >= _threshold) {
middle = begin + difference_type ((end - begin) * _ratio);
this->operator() (begin, middle);
}
_sort (middle, end);
}
};
} // namespace CGAL
#endif // CGAL_MULTISCALE_SORT_H
|
