forked from boostorg/algorithm
		
	In cxx14, remove unnecessary #include <algorithm> and correct some comments
This commit is contained in:
		@@ -13,7 +13,8 @@
 | 
			
		||||
#define BOOST_ALGORITHM_EQUAL_HPP
 | 
			
		||||
 | 
			
		||||
#include <algorithm>    // for std::equal
 | 
			
		||||
#include <functional>   // for std::equal_to
 | 
			
		||||
#include <functional>   // for std::binary_function
 | 
			
		||||
#include <iterator>
 | 
			
		||||
 | 
			
		||||
namespace boost { namespace algorithm {
 | 
			
		||||
 | 
			
		||||
 
 | 
			
		||||
@@ -12,8 +12,7 @@
 | 
			
		||||
#ifndef BOOST_ALGORITHM_IS_PERMUTATION14_HPP
 | 
			
		||||
#define BOOST_ALGORITHM_IS_PERMUTATION14_HPP
 | 
			
		||||
 | 
			
		||||
#include <algorithm>    // for std::less, tie, mismatch and is_permutation (if available)
 | 
			
		||||
#include <utility>      // for std::make_pair
 | 
			
		||||
#include <utility>      // for std::pair
 | 
			
		||||
#include <functional>   // for std::equal_to
 | 
			
		||||
#include <iterator>
 | 
			
		||||
 | 
			
		||||
@@ -31,8 +30,6 @@ namespace boost { namespace algorithm {
 | 
			
		||||
/// \param first2   The start of the second sequence
 | 
			
		||||
/// \param last1    One past the end of the second sequence
 | 
			
		||||
/// \note           This function is part of the C++2014 standard library.
 | 
			
		||||
///  We will use the standard one if it is available,
 | 
			
		||||
///     otherwise we have our own implementation.
 | 
			
		||||
template< class ForwardIterator1, class ForwardIterator2 >
 | 
			
		||||
bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1, 
 | 
			
		||||
                      ForwardIterator2 first2, ForwardIterator2 last2 )
 | 
			
		||||
@@ -62,8 +59,6 @@ bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1,
 | 
			
		||||
/// \param pred     The predicate to compare elements with
 | 
			
		||||
///
 | 
			
		||||
/// \note           This function is part of the C++2014 standard library.
 | 
			
		||||
///  We will use the standard one if it is available,
 | 
			
		||||
///     otherwise we have our own implementation.
 | 
			
		||||
template< class ForwardIterator1, class ForwardIterator2, class BinaryPredicate >
 | 
			
		||||
bool is_permutation ( ForwardIterator1 first1, ForwardIterator1 last1,
 | 
			
		||||
                      ForwardIterator2 first2, ForwardIterator2 last2, 
 | 
			
		||||
 
 | 
			
		||||
@@ -12,7 +12,6 @@
 | 
			
		||||
#ifndef BOOST_ALGORITHM_MISMATCH_HPP
 | 
			
		||||
#define BOOST_ALGORITHM_MISMATCH_HPP
 | 
			
		||||
 | 
			
		||||
#include <algorithm>    // for std::mismatch
 | 
			
		||||
#include <utility>      // for std::pair
 | 
			
		||||
 | 
			
		||||
namespace boost { namespace algorithm {
 | 
			
		||||
 
 | 
			
		||||
		Reference in New Issue
	
	Block a user