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
|
// Range v3 library
//
// Copyright Eric Niebler 2014-present
//
// Use, modification and distribution is subject to the
// Boost Software License, Version 1.0. (See accompanying
// file LICENSE_1_0.txt or copy at
// http://www.boost.org/LICENSE_1_0.txt)
#include <array>
#include <random>
#include <vector>
#include <range/v3/core.hpp>
#include <range/v3/view/iota.hpp>
#include <range/v3/view/stride.hpp>
#include <range/v3/view/take.hpp>
#include <range/v3/algorithm/shuffle.hpp>
#include <range/v3/algorithm/copy.hpp>
#include <range/v3/algorithm/move.hpp>
#include <range/v3/algorithm/is_sorted.hpp>
#include <range/v3/algorithm/equal.hpp>
#include <range/v3/action/shuffle.hpp>
#include <range/v3/action/stable_sort.hpp>
#include "../simple_test.hpp"
#include "../test_utils.hpp"
#if !defined(__clang__) || !defined(_MSVC_STL_VERSION) // Avoid #890
void test_bug632()
{
const std::vector<double> scores = { 3.0, 1.0, 2.0 };
std::vector<int> indices = { 0, 1, 2 };
indices |= ranges::actions::stable_sort(
ranges::less{},
[&] (const int &x) { return scores[ (std::size_t)x ]; }
);
::check_equal( indices, {1, 2, 0} );
}
int main()
{
using namespace ranges;
std::mt19937 gen;
auto v = views::ints(0,100) | to<std::vector>();
v |= actions::shuffle(gen);
CHECK(!is_sorted(v));
auto v2 = v | copy | actions::stable_sort;
CHECK(size(v2) == size(v));
CHECK(is_sorted(v2));
CHECK(!is_sorted(v));
CPP_assert(same_as<decltype(v), decltype(v2)>);
v |= actions::stable_sort;
CHECK(is_sorted(v));
v |= actions::shuffle(gen);
CHECK(!is_sorted(v));
v = v | move | actions::stable_sort(std::less<int>());
CHECK(is_sorted(v));
CHECK(equal(v, v2));
// Container algorithms can also be called directly
// in which case they take and return by reference
shuffle(v, gen);
CHECK(!is_sorted(v));
auto & v3 = actions::stable_sort(v);
CHECK(is_sorted(v));
CHECK(&v3 == &v);
auto r = views::ref(v);
r |= actions::stable_sort;
// Can pipe a view to a "container" algorithm.
actions::stable_sort(v, std::greater<int>());
v | views::stride(2) | actions::stable_sort;
check_equal(views::take(v, 10), {1,98,3,96,5,94,7,92,9,90});
test_bug632();
return ::test_result();
}
#else // Avoid #890
int main() {}
#endif // Avoid #890
|
