forked from cdmh/sorting_algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
/
introsort.detail.h
73 lines (61 loc) · 2.64 KB
/
introsort.detail.h
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
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
// Copyright (c) 2013 Craig Henderson
// https://github.com/cdmh/sorting_algorithms
#include "quicksort.detail.h"
#include "heap_sort.h"
namespace cdmh {
namespace detail {
// the heap sort uses std::make_heap and std::sort_heap, both of which only work with random access iterators.
// this functor allows us to use heap_sort or not depending on the iterator type
template<typename It, bool IsRandomIterator=std::is_same<typename std::iterator_traits<It>::iterator_category, std::random_access_iterator_tag>::value>
struct heap_sort_if_we_can
{
template<typename... Args>
bool operator()(Args...)
{
return false;
}
};
template<typename It>
struct heap_sort_if_we_can<It, true>
{
template<typename Pred>
bool operator()(It begin, It end, Pred pred)
{
heap_sort(begin, end, pred);
return true;
}
};
// detail introsort implementation takes a depth count
template<typename It, typename Pred>
inline void introsort(It begin, It end, Pred pred, size_t depth)
{
auto const size = std::distance(begin, end);
if (size <= 1)
return;
// if we've reached the depth limit, then attempt a heap sort.
// if heap sort is not available to us, then continue with quicksort algorithm
if (--depth == 0 && heap_sort_if_we_can<It>()(begin, end, pred))
return;
auto splits = detail::quicksort_splits(begin, end, pred);
introsort(begin, splits.first, pred, depth);
introsort(splits.second, end, pred, depth);
}
} // namespace detail
} // namespace cdmh
// Permission is hereby granted, free of charge, to any person obtaining a copy
// of this software and associated documentation files (the "Software"), to deal
// in the Software without restriction, including without limitation the rights
// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
// copies of the Software, and to permit persons to whom the Software is
// furnished to do so, subject to the following conditions:
//
// The above copyright notice and this permission notice shall be included in
// all copies or substantial portions of the Software.
//
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
// THE SOFTWARE.