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

#ifdef out the four argument versions of is_permutation when we are compiling with C++14, since they're in the standard library

Browse Source
This commit is contained in:
Marshall Clow
2014-03-19 09:11:51 -07:00
parent 848b521850
commit a4d5f17173
1 changed files with 4 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

6
include/boost/algorithm/cxx11/is_permutation.hpp
View File

@ -163,6 +163,7 @@ bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, ForwardIt
#endif #endif
#if __cplusplus <= 201103L
/// \fn is_permutation ( ForwardIterator1 first, ForwardIterator1 last, /// \fn is_permutation ( ForwardIterator1 first, ForwardIterator1 last,
/// ForwardIterator2 first2, ForwardIterator2 last2 ) /// ForwardIterator2 first2, ForwardIterator2 last2 )
/// \brief Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2 /// \brief Tests to see if the sequence [first,last) is a permutation of the sequence starting at first2
@ -171,7 +172,7 @@ bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, ForwardIt
/// \param last2 One past the end of the input sequence /// \param last2 One past the end of the input sequence
/// \param first2 The start of the second sequence /// \param first2 The start of the second sequence
/// \param last1 One past the end of the second sequence /// \param last1 One past the end of the second sequence
/// \note This function is part of the C++2011 standard library. /// \note This function is part of the C++2014 standard library.
/// We will use the standard one if it is available, /// We will use the standard one if it is available,
/// otherwise we have our own implementation. /// otherwise we have our own implementation.
template< class ForwardIterator1, class ForwardIterator2 > template< class ForwardIterator1, class ForwardIterator2 >
@ -198,7 +199,7 @@ bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1,
/// \param last2 One past the end of the second sequence /// \param last2 One past the end of the second sequence
/// \param pred The predicate to compare elements with /// \param pred The predicate to compare elements with
/// ///
/// \note This function is part of the C++2011 standard library. /// \note This function is part of the C++2014 standard library.
/// We will use the standard one if it is available, /// We will use the standard one if it is available,
/// otherwise we have our own implementation. /// otherwise we have our own implementation.
template< class ForwardIterator1, class ForwardIterator2, class BinaryPredicate > template< class ForwardIterator1, class ForwardIterator2, class BinaryPredicate >
@ -211,6 +212,7 @@ bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1,
typename std::iterator_traits<ForwardIterator1>::iterator_category (), typename std::iterator_traits<ForwardIterator1>::iterator_category (),
typename std::iterator_traits<ForwardIterator2>::iterator_category ()); typename std::iterator_traits<ForwardIterator2>::iterator_category ());
} }
#endif