East const -> west const. I regret nothing!

tzlaine · tzlaine · commit 3f2a962ace2d · 2018-05-14T19:19:52.000-05:00
diff --git a/include/boost/algorithm/find_backward.hpp b/include/boost/algorithm/find_backward.hpp
@@ -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);
 }
diff --git a/include/boost/algorithm/find_not.hpp b/include/boost/algorithm/find_not.hpp
@@ -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);
 }
diff --git a/test/find_backward_test.cpp b/test/find_backward_test.cpp
@@ -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);
diff --git a/test/find_not_test.cpp b/test/find_not_test.cpp
@@ -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);

Original file line number	Diff line number	Diff line change
`@@ -18,7 +18,7 @@ namespace boost { namespace algorithm {`
`18`	`18`
`19`	`19`	`template<typename BidiIter, typename T>`
`20`	`20`	`BOOST_CXX14_CONSTEXPR`
`21`		`-BidiIter find_backward(BidiIter first, BidiIter last, T const & x)`
	`21`	`+BidiIter find_backward(BidiIter first, BidiIter last, const T & x)`
`22`	`22`	`{`
`23`	`23`	`BidiIter it = last;`
`24`	`24`	`while (it != first) {`
`@@ -30,14 +30,14 @@ BidiIter find_backward(BidiIter first, BidiIter last, T const & x)`
`30`	`30`
`31`	`31`	`template<typename Range, typename T>`
`32`	`32`	`BOOST_CXX14_CONSTEXPR`
`33`		`-typename boost::range_iterator<Range>::type find_backward(Range & range, T const & x)`
	`33`	`+typename boost::range_iterator<Range>::type find_backward(Range & range, const T & x)`
`34`	`34`	`{`
`35`	`35`	`return ::boost::algorithm::find_backward(boost::begin(range), boost::end(range), x);`
`36`	`36`	`}`
`37`	`37`
`38`	`38`	`template<typename BidiIter, typename T>`
`39`	`39`	`BOOST_CXX14_CONSTEXPR`
`40`		`-BidiIter find_not_backward(BidiIter first, BidiIter last, T const & x)`
	`40`	`+BidiIter find_not_backward(BidiIter first, BidiIter last, const T & x)`
`41`	`41`	`{`
`42`	`42`	`BidiIter it = last;`
`43`	`43`	`while (it != first) {`
`@@ -49,7 +49,7 @@ BidiIter find_not_backward(BidiIter first, BidiIter last, T const & x)`
`49`	`49`
`50`	`50`	`template<typename Range, typename T>`
`51`	`51`	`BOOST_CXX14_CONSTEXPR`
`52`		`-typename boost::range_iterator<Range>::type find_not_backward(Range & range, T const & x)`
	`52`	`+typename boost::range_iterator<Range>::type find_not_backward(Range & range, const T & x)`
`53`	`53`	`{`
`54`	`54`	`return ::boost::algorithm::find_not_backward(boost::begin(range), boost::end(range), x);`
`55`	`55`	`}`
Original file line number	Diff line number	Diff line change
`@@ -65,7 +65,7 @@ void test_find_backward()`
`65`	`65`	`{`
`66`	`66`	`{`
`67`	`67`	`std::vector<int> v1;`
`68`		`- dist_t<std::vector<int> > const dist(v1);`
	`68`	`+ const dist_t<std::vector<int> > dist(v1);`
`69`	`69`
`70`	`70`	`for (int i = 5; i < 15; ++i)`
`71`	`71`	`v1.push_back(i);`
`@@ -89,7 +89,7 @@ void test_find_backward()`
`89`	`89`	`// With bidirectional iterators.`
`90`	`90`	`{`
`91`	`91`	`std::list<int> l1;`
`92`		`- dist_t<std::list<int> > const dist(l1);`
	`92`	`+ const dist_t<std::list<int> > dist(l1);`
`93`	`93`
`94`	`94`	`for (int i = 5; i < 15; ++i)`
`95`	`95`	`l1.push_back(i);`
`@@ -154,7 +154,7 @@ void test_find_if_backward()`
`154`	`154`	`{`
`155`	`155`	`{`
`156`	`156`	`std::vector<int> v1;`
`157`		`- dist_t<std::vector<int> > const dist(v1);`
	`157`	`+ const dist_t<std::vector<int> > dist(v1);`
`158`	`158`
`159`	`159`	`for (int i = 5; i < 15; ++i)`
`160`	`160`	`v1.push_back(i);`
`@@ -184,7 +184,7 @@ void test_find_if_backward()`
`184`	`184`	`// With bidirectional iterators.`
`185`	`185`	`{`
`186`	`186`	`std::list<int> l1;`
`187`		`- dist_t<std::list<int> > const dist(l1);`
	`187`	`+ const dist_t<std::list<int> > dist(l1);`
`188`	`188`
`189`	`189`	`for (int i = 5; i < 15; ++i)`
`190`	`190`	`l1.push_back(i);`
`@@ -255,7 +255,7 @@ void test_find_if_not_backward()`
`255`	`255`	`{`
`256`	`256`	`{`
`257`	`257`	`std::vector<int> v1;`
`258`		`- dist_t<std::vector<int> > const dist(v1);`
	`258`	`+ const dist_t<std::vector<int> > dist(v1);`
`259`	`259`
`260`	`260`	`for (int i = 5; i < 15; ++i)`
`261`	`261`	`v1.push_back(i);`
`@@ -289,7 +289,7 @@ void test_find_if_not_backward()`
`289`	`289`	`// With bidirectional iterators.`
`290`	`290`	`{`
`291`	`291`	`std::list<int> l1;`
`292`		`- dist_t<std::list<int> > const dist(l1);`
	`292`	`+ const dist_t<std::list<int> > dist(l1);`
`293`	`293`
`294`	`294`	`for (int i = 5; i < 15; ++i)`
`295`	`295`	`l1.push_back(i);`
`@@ -352,7 +352,7 @@ void test_find_not_backward()`
`352`	`352`	`{`
`353`	`353`	`{`
`354`	`354`	`std::vector<int> v1;`
`355`		`- dist_t<std::vector<int> > const dist(v1);`
	`355`	`+ const dist_t<std::vector<int> > dist(v1);`
`356`	`356`
`357`	`357`	`for (int i = 0; i < 5; ++i)`
`358`	`358`	`v1.push_back(0);`
`@@ -381,7 +381,7 @@ void test_find_not_backward()`
`381`	`381`	`// With bidirectional iterators.`
`382`	`382`	`{`
`383`	`383`	`std::list<int> l1;`
`384`		`- dist_t<std::list<int> > const dist(l1);`
	`384`	`+ const dist_t<std::list<int> > dist(l1);`
`385`	`385`
`386`	`386`	`for (int i = 0; i < 5; ++i)`
`387`	`387`	`l1.push_back(0);`
Original file line number	Diff line number	Diff line change
`@@ -66,7 +66,7 @@ void test_sequence()`
`66`	`66`	`{`
`67`	`67`	`{`
`68`	`68`	`std::vector<int> v1;`
`69`		`- dist_t<std::vector<int> > const dist(v1);`
	`69`	`+ const dist_t<std::vector<int> > dist(v1);`
`70`	`70`
`71`	`71`	`for (int i = 5; i < 15; ++i)`
`72`	`72`	`v1.push_back(i);`
`@@ -95,7 +95,7 @@ void test_sequence()`
`95`	`95`	`// With bidirectional iterators.`
`96`	`96`	`{`
`97`	`97`	`std::list<int> l1;`
`98`		`- dist_t<std::list<int> > const dist(l1);`
	`98`	`+ const dist_t<std::list<int> > dist(l1);`
`99`	`99`
`100`	`100`	`for (int i = 5; i < 15; ++i)`
`101`	`101`	`l1.push_back(i);`