feedc0de/boost_algorithm
1
0
Fork 0
forked from boostorg/algorithm
Code Pull Requests Activity

East const -> west const. I regret nothing!

Browse Source
This commit is contained in:
Zach Laine
2018-05-14 19:17:00 -05:00
parent 6b2246468e
commit 3f2a962ace
4 changed files with 16 additions and 16 deletions
Download Patch File Download Diff File Expand all files Collapse all files

16
test/find_backward_test.cpp
View File

@ -65,7 +65,7 @@ void test_find_backward()
{
{
std::vector<int> v1;
dist_t<std::vector<int> > const dist(v1);
const dist_t<std::vector<int> > dist(v1);
for (int i = 5; i < 15; ++i)
v1.push_back(i);
@ -89,7 +89,7 @@ void test_find_backward()
// With bidirectional iterators.
{
std::list<int> l1;
dist_t<std::list<int> > const dist(l1);
const dist_t<std::list<int> > dist(l1);
for (int i = 5; i < 15; ++i)
l1.push_back(i);
@ -154,7 +154,7 @@ void test_find_if_backward()
{
{
std::vector<int> v1;
dist_t<std::vector<int> > const dist(v1);
const dist_t<std::vector<int> > dist(v1);
for (int i = 5; i < 15; ++i)
v1.push_back(i);
@ -184,7 +184,7 @@ void test_find_if_backward()
// With bidirectional iterators.
{
std::list<int> l1;
dist_t<std::list<int> > const dist(l1);
const dist_t<std::list<int> > dist(l1);
for (int i = 5; i < 15; ++i)
l1.push_back(i);
@ -255,7 +255,7 @@ void test_find_if_not_backward()
{
{
std::vector<int> v1;
dist_t<std::vector<int> > const dist(v1);
const dist_t<std::vector<int> > dist(v1);
for (int i = 5; i < 15; ++i)
v1.push_back(i);
@ -289,7 +289,7 @@ void test_find_if_not_backward()
// With bidirectional iterators.
{
std::list<int> l1;
dist_t<std::list<int> > const dist(l1);
const dist_t<std::list<int> > dist(l1);
for (int i = 5; i < 15; ++i)
l1.push_back(i);
@ -352,7 +352,7 @@ void test_find_not_backward()
{
{
std::vector<int> v1;
dist_t<std::vector<int> > const dist(v1);
const dist_t<std::vector<int> > dist(v1);
for (int i = 0; i < 5; ++i)
v1.push_back(0);
@ -381,7 +381,7 @@ void test_find_not_backward()
// With bidirectional iterators.
{
std::list<int> l1;
dist_t<std::list<int> > const dist(l1);
const dist_t<std::list<int> > dist(l1);
for (int i = 0; i < 5; ++i)
l1.push_back(0);

4
test/find_not_test.cpp
View File

@ -66,7 +66,7 @@ void test_sequence()
{
{
std::vector<int> v1;
dist_t<std::vector<int> > const dist(v1);
const dist_t<std::vector<int> > dist(v1);
for (int i = 5; i < 15; ++i)
v1.push_back(i);
@ -95,7 +95,7 @@ void test_sequence()
// With bidirectional iterators.
{
std::list<int> l1;
dist_t<std::list<int> > const dist(l1);
const dist_t<std::list<int> > dist(l1);
for (int i = 5; i < 15; ++i)
l1.push_back(i);