forked from Morwenn/cpp-sort
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathsort.h
More file actions
194 lines (178 loc) · 6.02 KB
/
Copy pathsort.h
File metadata and controls
194 lines (178 loc) · 6.02 KB
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
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
/*
* The MIT License (MIT)
*
* Copyright (c) 2015-2016 Morwenn
*
* 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.
*/
#ifndef CPPSORT_SORT_H_
#define CPPSORT_SORT_H_
////////////////////////////////////////////////////////////
// Headers
////////////////////////////////////////////////////////////
#include <type_traits>
#include <utility>
#include <cpp-sort/sorter_traits.h>
#include <cpp-sort/sorters/default_sorter.h>
namespace cppsort
{
////////////////////////////////////////////////////////////
// With default_sorter
template<typename Iterable>
auto sort(Iterable&& iterable)
-> void
{
default_sorter{}(std::forward<Iterable>(iterable));
}
template<
typename Iterable,
typename Compare,
typename = std::enable_if_t<not is_sorter_v<Iterable, Compare>>
>
auto sort(Iterable&& iterable, Compare compare)
-> void
{
default_sorter{}(std::forward<Iterable>(iterable), std::move(compare));
}
template<
typename Iterable,
typename Compare,
typename Projection,
typename = std::enable_if_t<
not is_comparison_sorter_v<Iterable, Compare, Projection> &&
not is_projection_sorter_v<Iterable, Compare, Projection> &&
not is_sorter_iterator_v<Iterable, Compare> &&
is_projection_v<Projection, Iterable, Compare>
>
>
auto sort(Iterable&& iterable, Compare compare, Projection projection)
-> void
{
default_sorter{}(std::forward<Iterable>(iterable),
std::move(compare), std::move(projection));
}
template<typename Iterator>
auto sort(Iterator first, Iterator last)
-> void
{
default_sorter{}(std::move(first), std::move(last));
}
template<
typename Iterator,
typename Func,
typename = std::enable_if_t<not is_sorter_iterator_v<Iterator, Func>>
>
auto sort(Iterator first, Iterator last, Func func)
-> void
{
default_sorter{}(std::move(first), std::move(last), std::move(func));
}
template<
typename Iterator,
typename Compare,
typename Projection,
typename = std::enable_if_t<
not is_comparison_sorter_iterator_v<Iterator, Compare, Projection> &&
not is_projection_sorter_iterator_v<Iterator, Compare, Projection>
>
>
auto sort(Iterator first, Iterator last, Compare compare, Projection projection)
-> void
{
return default_sorter{}(std::move(first), std::move(last),
std::move(compare), std::move(projection));
}
////////////////////////////////////////////////////////////
// With a given sorter
template<
typename Sorter,
typename Iterable,
typename = std::enable_if_t<is_sorter_v<Sorter, Iterable>>
>
auto sort(const Sorter& sorter, Iterable&& iterable)
-> decltype(auto)
{
return sorter(std::forward<Iterable>(iterable));
}
template<
typename Sorter,
typename Iterable,
typename Func,
typename = std::enable_if_t<
is_comparison_sorter_v<Sorter, Iterable, Func> ||
is_projection_sorter_v<Sorter, Iterable, Func>
>
>
auto sort(const Sorter& sorter, Iterable&& iterable, Func func)
-> decltype(auto)
{
return sorter(std::forward<Iterable>(iterable), std::move(func));
}
template<
typename Sorter,
typename Iterable,
typename Compare,
typename Projection
>
auto sort(const Sorter& sorter, Iterable&& iterable,
Compare compare, Projection projection)
-> decltype(auto)
{
return sorter(std::forward<Iterable>(iterable),
std::move(compare), std::move(projection));
}
template<
typename Sorter,
typename Iterator,
typename = std::enable_if_t<is_sorter_iterator_v<Sorter, Iterator>>
>
auto sort(const Sorter& sorter, Iterator first, Iterator last)
-> decltype(auto)
{
return sorter(std::move(first), std::move(last));
}
template<
typename Sorter,
typename Iterator,
typename Func,
typename = std::enable_if_t<
is_comparison_sorter_iterator_v<Sorter, Iterator, Func> ||
is_projection_sorter_iterator_v<Sorter, Iterator, Func>
>
>
auto sort(const Sorter& sorter, Iterator first, Iterator last, Func func)
-> decltype(auto)
{
return sorter(std::move(first), std::move(last), std::move(func));
}
template<
typename Sorter,
typename Iterator,
typename Compare,
typename Projection
>
auto sort(const Sorter& sorter, Iterator first, Iterator last,
Compare compare, Projection projection)
-> decltype(auto)
{
return sorter(std::move(first), std::move(last),
std::move(compare), std::move(projection));
}
}
#endif // CPPSORT_SORT_H_