12
12
#ifndef BOOST_ALGORITHM_IS_PERMUTATION14_HPP
13
13
#define BOOST_ALGORITHM_IS_PERMUTATION14_HPP
14
14
15
- #include < algorithm> // for std::less, tie, mismatch and is_permutation (if available)
16
- #include < utility> // for std::make_pair
15
+ #include < utility> // for std::pair
17
16
#include < functional> // for std::equal_to
18
17
#include < iterator>
19
18
@@ -31,8 +30,6 @@ namespace boost { namespace algorithm {
31
30
// / \param first2 The start of the second sequence
32
31
// / \param last1 One past the end of the second sequence
33
32
// / \note This function is part of the C++2014 standard library.
34
- // / We will use the standard one if it is available,
35
- // / otherwise we have our own implementation.
36
33
template < class ForwardIterator1 , class ForwardIterator2 >
37
34
bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1,
38
35
ForwardIterator2 first2, ForwardIterator2 last2 )
@@ -62,8 +59,6 @@ bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1,
62
59
// / \param pred The predicate to compare elements with
63
60
// /
64
61
// / \note This function is part of the C++2014 standard library.
65
- // / We will use the standard one if it is available,
66
- // / otherwise we have our own implementation.
67
62
template < class ForwardIterator1 , class ForwardIterator2 , class BinaryPredicate >
68
63
bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1,
69
64
ForwardIterator2 first2, ForwardIterator2 last2,
0 commit comments