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

8
include/boost/algorithm/find_backward.hpp
View File

@ -18,7 +18,7 @@ namespace boost { namespace algorithm {
template<typename BidiIter, typename T>
BOOST_CXX14_CONSTEXPR
BidiIter find_backward(BidiIter first, BidiIter last, T const & x)
BidiIter find_backward(BidiIter first, BidiIter last, const T & x)
{
BidiIter it = last;
while (it != first) {
@ -30,14 +30,14 @@ BidiIter find_backward(BidiIter first, BidiIter last, T const & x)
template<typename Range, typename T>
BOOST_CXX14_CONSTEXPR
typename boost::range_iterator<Range>::type find_backward(Range & range, T const & x)
typename boost::range_iterator<Range>::type find_backward(Range & range, const T & x)
{
return ::boost::algorithm::find_backward(boost::begin(range), boost::end(range), x);
}
template<typename BidiIter, typename T>
BOOST_CXX14_CONSTEXPR
BidiIter find_not_backward(BidiIter first, BidiIter last, T const & x)
BidiIter find_not_backward(BidiIter first, BidiIter last, const T & x)
{
BidiIter it = last;
while (it != first) {
@ -49,7 +49,7 @@ BidiIter find_not_backward(BidiIter first, BidiIter last, T const & x)
template<typename Range, typename T>
BOOST_CXX14_CONSTEXPR
typename boost::range_iterator<Range>::type find_not_backward(Range & range, T const & x)
typename boost::range_iterator<Range>::type find_not_backward(Range & range, const T & x)
{
return ::boost::algorithm::find_not_backward(boost::begin(range), boost::end(range), x);
}

4
include/boost/algorithm/find_not.hpp
View File

@ -18,7 +18,7 @@ namespace boost { namespace algorithm {
template<typename InputIter, typename Sentinel, typename T>
BOOST_CXX14_CONSTEXPR
InputIter find_not(InputIter first, Sentinel last, T const & x)
InputIter find_not(InputIter first, Sentinel last, const T & x)
{
for (; first != last; ++first) {
if (*first != x)
@ -29,7 +29,7 @@ InputIter find_not(InputIter first, Sentinel last, T const & x)
template<typename Range, typename T>
BOOST_CXX14_CONSTEXPR
typename boost::range_iterator<Range>::type find_not(Range & r, T const & x)
typename boost::range_iterator<Range>::type find_not(Range & r, const T & x)
{
return ::boost::algorithm::find_not(boost::begin(r), boost::end(r), x);
}

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);