@@ -16,58 +16,58 @@ void test_fill_helper(const size_t length) {
16
16
vector<bool > result_true (length, true );
17
17
result_true.resize (length + 3 , false );
18
18
vector<bool > dest_true (length + 3 , false );
19
- fill (dest_true.begin (), prev (dest_true.end (), 3 ), true );
19
+ fill (dest_true.cbegin (), prev (dest_true.cend (), 3 ), true );
20
20
assert (dest_true == result_true);
21
21
22
22
vector<bool > result_false (length, false );
23
23
result_false.resize (length + 3 , true );
24
24
vector<bool > dest_false (length + 3 , true );
25
- fill (dest_false.begin (), prev (dest_false.end (), 3 ), false );
25
+ fill (dest_false.cbegin (), prev (dest_false.cend (), 3 ), false );
26
26
assert (dest_false == result_false);
27
27
28
28
vector<bool > result_true_n (length, true );
29
29
result_true_n.resize (length + 3 , false );
30
30
vector<bool > dest_true_n (length + 3 , false );
31
- const auto res_fill_n = fill_n (dest_true_n.begin (), length, true );
31
+ const auto res_fill_n = fill_n (dest_true_n.cbegin (), length, true );
32
32
assert (dest_true_n == result_true_n);
33
- assert (res_fill_n == prev (dest_true_n.end (), 3 ));
33
+ assert (res_fill_n == prev (dest_true_n.cend (), 3 ));
34
34
35
35
vector<bool > result_false_n (length, false );
36
36
result_false_n.resize (length + 3 , true );
37
37
vector<bool > dest_false_n (length + 3 , true );
38
- fill_n (dest_false_n.begin (), length, false );
38
+ fill_n (dest_false_n.cbegin (), length, false );
39
39
assert (dest_false_n == result_false_n);
40
40
}
41
41
42
42
// With offset
43
43
{
44
44
vector<bool > result_true (length, true );
45
45
result_true.resize (length + 3 , false );
46
- result_true.insert (result_true.begin (), false );
46
+ result_true.insert (result_true.cbegin (), false );
47
47
vector<bool > dest_true (length + 4 , false );
48
- fill (next (dest_true.begin ()), prev (dest_true.end (), 3 ), true );
48
+ fill (next (dest_true.cbegin ()), prev (dest_true.cend (), 3 ), true );
49
49
assert (dest_true == result_true);
50
50
51
51
vector<bool > result_false (length, false );
52
52
result_false.resize (length + 3 , true );
53
- result_false.insert (result_false.begin (), true );
53
+ result_false.insert (result_false.cbegin (), true );
54
54
vector<bool > dest_false (length + 4 , true );
55
- fill (next (dest_false.begin ()), prev (dest_false.end (), 3 ), false );
55
+ fill (next (dest_false.cbegin ()), prev (dest_false.cend (), 3 ), false );
56
56
assert (dest_false == result_false);
57
57
58
58
vector<bool > result_true_n (length, true );
59
59
result_true_n.resize (length + 3 , false );
60
- result_true_n.insert (result_true_n.begin (), false );
60
+ result_true_n.insert (result_true_n.cbegin (), false );
61
61
vector<bool > dest_true_n (length + 4 , false );
62
- const auto res_fill_n = fill_n (next (dest_true_n.begin ()), length, true );
62
+ const auto res_fill_n = fill_n (next (dest_true_n.cbegin ()), length, true );
63
63
assert (dest_true_n == result_true_n);
64
- assert (res_fill_n == prev (dest_true_n.end (), 3 ));
64
+ assert (res_fill_n == prev (dest_true_n.cend (), 3 ));
65
65
66
66
vector<bool > result_false_n (length, false );
67
67
result_false_n.resize (length + 3 , true );
68
- result_false_n.insert (result_false_n.begin (), true );
68
+ result_false_n.insert (result_false_n.cbegin (), true );
69
69
vector<bool > dest_false_n (length + 4 , true );
70
- fill_n (next (dest_false_n.begin ()), length, false );
70
+ fill_n (next (dest_false_n.cbegin ()), length, false );
71
71
assert (dest_false_n == result_false_n);
72
72
}
73
73
}
0 commit comments