summaryrefslogtreecommitdiff
path: root/boost/algorithm/cxx11/is_partitioned.hpp
diff options
context:
space:
mode:
Diffstat (limited to 'boost/algorithm/cxx11/is_partitioned.hpp')
-rw-r--r--boost/algorithm/cxx11/is_partitioned.hpp4
1 files changed, 0 insertions, 4 deletions
diff --git a/boost/algorithm/cxx11/is_partitioned.hpp b/boost/algorithm/cxx11/is_partitioned.hpp
index cdabd97505..cb6c71e33b 100644
--- a/boost/algorithm/cxx11/is_partitioned.hpp
+++ b/boost/algorithm/cxx11/is_partitioned.hpp
@@ -12,8 +12,6 @@
#ifndef BOOST_ALGORITHM_IS_PARTITIONED_HPP
#define BOOST_ALGORITHM_IS_PARTITIONED_HPP
-#include <algorithm> // for std::is_partitioned, if available
-
#include <boost/range/begin.hpp>
#include <boost/range/end.hpp>
@@ -26,8 +24,6 @@ namespace boost { namespace algorithm {
/// \param last One past the end of the input sequence
/// \param p The predicate to test the values with
/// \note This function is part of the C++2011 standard library.
-/// We will use the standard one if it is available,
-/// otherwise we have our own implementation.
template <typename InputIterator, typename UnaryPredicate>
bool is_partitioned ( InputIterator first, InputIterator last, UnaryPredicate p )
{