boostorg/algorithm
1
0
Fork 1
mirror of https://github.com/boostorg/algorithm.git synced 2025-07-06 09:16:33 +02:00
Code Issues Packages Projects Releases Wiki Activity

Merge pull request #28 from ZaMaZaN4iK/feature_branch/is_palindromic

Browse Source 
Delete duplicate version is_palindrome
This commit is contained in:
Marshall Clow
2016-10-12 16:42:14 -07:00
committed by GitHub
parent eccac19108 303ff13b86
commit 6a650ade1d
1 changed files with 4 additions and 25 deletions
Download Patch File Download Diff File Expand all files Collapse all files

25
include/boost/algorithm/is_palindrome.hpp
View File

@ -71,26 +71,8 @@ bool is_palindrome(BidirectionalIterator begin, BidirectionalIterator end, Predi
template <typename BidirectionalIterator> template <typename BidirectionalIterator>
bool is_palindrome(BidirectionalIterator begin, BidirectionalIterator end) bool is_palindrome(BidirectionalIterator begin, BidirectionalIterator end)
{ {
if(begin == end) return is_palindrome(begin, end,
{ std::equal_to<typename std::iterator_traits<BidirectionalIterator>::value_type> ());
return true;
}
--end;
while(begin != end)
{
if(!(*begin == *end))
{
return false;
}
++begin;
if(begin == end)
{
break;
}
--end;
}
return true;
} }
/// \fn is_palindrome ( const R& range ) /// \fn is_palindrome ( const R& range )
@ -122,7 +104,6 @@ bool is_palindrome(const R& range, Predicate p)
return is_palindrome(boost::begin(range), boost::end(range), p); return is_palindrome(boost::begin(range), boost::end(range), p);
} }
/// \fn is_palindrome ( const char* str ) /// \fn is_palindrome ( const char* str )
/// \return true if the entire sequence is palindrome /// \return true if the entire sequence is palindrome
/// ///
@ -138,7 +119,6 @@ bool is_palindrome(const char* str)
return is_palindrome(str, str + strlen(str)); return is_palindrome(str, str + strlen(str));
} }
/// \fn is_palindrome ( const char* str, Predicate p ) /// \fn is_palindrome ( const char* str, Predicate p )
/// \return true if the entire sequence is palindrome /// \return true if the entire sequence is palindrome
/// ///
@ -155,7 +135,6 @@ bool is_palindrome(const char* str, Predicate p)
return true; return true;
return is_palindrome(str, str + strlen(str), p); return is_palindrome(str, str + strlen(str), p);
} }
}} }}
#endif // BOOST_ALGORITHM_IS_PALINDROME_HPP #endif // BOOST_ALGORITHM_IS_PALINDROME_HPP