From 303ff13b863c95a11f8befac18ff13783ac214b1 Mon Sep 17 00:00:00 2001
From: Alexander <ZaMaZaN4iK@users.noreply.github.com>
Date: Wed, 12 Oct 2016 22:22:30 +0300
Subject: [PATCH] Delete duplicate version os is_palindrome

---
 include/boost/algorithm/is_palindrome.hpp | 41 +++++------------------
 1 file changed, 8 insertions(+), 33 deletions(-)

diff --git a/include/boost/algorithm/is_palindrome.hpp b/include/boost/algorithm/is_palindrome.hpp
index 8649ad6..bd8b9f9 100644
--- a/include/boost/algorithm/is_palindrome.hpp
+++ b/include/boost/algorithm/is_palindrome.hpp
@@ -36,7 +36,7 @@ namespace boost {  namespace algorithm {
 ///     For other sequences function will return false.
 ///     Complexity: O(N).
 template <typename BidirectionalIterator, typename Predicate>
-bool is_palindrome(BidirectionalIterator begin, BidirectionalIterator end, Predicate p )
+bool is_palindrome(BidirectionalIterator begin, BidirectionalIterator end, Predicate p)
 {
     if(begin == end)
     {
@@ -64,7 +64,7 @@ bool is_palindrome(BidirectionalIterator begin, BidirectionalIterator end, Predi
 /// \return true if the entire sequence is palindrome
 ///
 /// \param begin    The start of the input sequence
-/// \param end		One past the end of the input sequence
+/// \param end	    One past the end of the input sequence
 ///
 /// \note This function will return true for empty sequences and for palindromes.
 ///     For other sequences function will return false.
@@ -72,26 +72,8 @@ bool is_palindrome(BidirectionalIterator begin, BidirectionalIterator end, Predi
 template <typename BidirectionalIterator>
 bool is_palindrome(BidirectionalIterator begin, BidirectionalIterator end)
 {
-    if(begin == end)
-    {
-        return true;
-    }
-
-    --end;
-    while(begin != end)
-    {
-        if(!(*begin == *end))
-        {
-            return false;
-        }
-        ++begin;
-        if(begin == end)
-        {
-            break;
-        }
-        --end;
-    }
-    return true;
+    return is_palindrome(begin, end,
+                         std::equal_to<typename std::iterator_traits<BidirectionalIterator>::value_type> ());
 }
 
 /// \fn is_palindrome ( const R& range )
@@ -123,7 +105,6 @@ bool is_palindrome(const R& range, Predicate p)
     return is_palindrome(boost::begin(range), boost::end(range), p);
 }
 
-
 /// \fn is_palindrome ( const char* str )
 /// \return true if the entire sequence is palindrome
 ///
@@ -134,14 +115,11 @@ bool is_palindrome(const R& range, Predicate p)
 ///     Complexity: O(N).
 bool is_palindrome(const char* str)
 {
-    if(str == nullptr)
-    {
-	return true;
-    }
+    if(!str)
+	    return true;
     return is_palindrome(str, str + strlen(str));
 }
 
-
 /// \fn is_palindrome ( const char* str, Predicate p )
 /// \return true if the entire sequence is palindrome
 ///
@@ -154,13 +132,10 @@ bool is_palindrome(const char* str)
 template<typename Predicate>
 bool is_palindrome(const char* str, Predicate p)
 {
-    if(str == nullptr)
-    {
-	return true;
-    }
+    if(!str)
+	    return true;
     return is_palindrome(str, str + strlen(str), p);
 }
-
 }}
 
 #endif // BOOST_ALGORITHM_IS_PALINDROME_HPP