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
|
// 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 <set>
#include <vector>
#include <range/v3/core.hpp>
#include <range/v3/view/iota.hpp>
#include <range/v3/view/take.hpp>
#include <range/v3/view/for_each.hpp>
#include <range/v3/view/ref.hpp>
#include <range/v3/action/insert.hpp>
#include "../simple_test.hpp"
#include "../test_utils.hpp"
template<typename T>
struct vector_like : std::vector<T> {
using std::vector<T>::vector;
using typename std::vector<T>::size_type;
size_type last_reservation{};
size_type reservation_count{};
void reserve(size_type n) {
std::vector<T>::reserve(n);
last_reservation = n;
++reservation_count;
}
};
int main()
{
using namespace ranges;
{
std::vector<int> v;
auto i = insert(v, v.begin(), 42);
CHECK(i == v.begin());
::check_equal(v, {42});
insert(v, v.end(), {1,2,3});
::check_equal(v, {42,1,2,3});
insert(v, v.begin(), views::ints | views::take(3));
::check_equal(v, {0,1,2,42,1,2,3});
int rg[] = {9,8,7};
insert(v, v.begin()+3, rg);
::check_equal(v, {0,1,2,9,8,7,42,1,2,3});
insert(v, v.begin()+1, rg);
::check_equal(v, {0,9,8,7,1,2,9,8,7,42,1,2,3});
}
{
std::set<int> s;
insert(s,
views::ints|views::take(10)|views::for_each([](int i){return yield_if(i%2==0,i);}));
::check_equal(s, {0,2,4,6,8});
auto j = insert(s, 10);
CHECK(j.first == prev(s.end()));
CHECK(j.second == true);
::check_equal(s, {0,2,4,6,8,10});
insert(views::ref(s), 12);
::check_equal(s, {0,2,4,6,8,10,12});
}
{
const std::size_t N = 1024;
vector_like<int> vl;
insert(vl, vl.end(), views::iota(0, int{N}));
CHECK(vl.reservation_count == 1u);
CHECK(vl.last_reservation == N);
auto r = views::iota(0, int{2 * N});
insert(vl, vl.begin() + 42, begin(r), end(r));
CHECK(vl.reservation_count == 2u);
CHECK(vl.last_reservation == 3 * N);
int i = 42;
insert(vl, vl.end(), &i, &i + 1);
CHECK(vl.reservation_count == 3u);
CHECK(vl.last_reservation > 3 * N + 1);
}
return ::test_result();
}
|
