2 Copyright (c) Marshall Clow 2011-2012.
4 Distributed under the Boost Software License, Version 1.0. (See accompanying
5 file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
8 /// \file is_partitioned.hpp
9 /// \brief Tell if a sequence is partitioned
10 /// \author Marshall Clow
12 #ifndef BOOST_ALGORITHM_IS_PARTITIONED_HPP
13 #define BOOST_ALGORITHM_IS_PARTITIONED_HPP
15 #include <algorithm> // for std::is_partitioned, if available
17 #include <boost/range/begin.hpp>
18 #include <boost/range/end.hpp>
20 namespace boost { namespace algorithm {
22 #if __cplusplus >= 201103L
23 // Use the C++11 versions of is_partitioned if it is available
24 using std::is_partitioned; // Section 25.3.13
26 /// \fn is_partitioned ( InputIterator first, InputIterator last, UnaryPredicate p )
27 /// \brief Tests to see if a sequence is partitioned according to a predicate
29 /// \param first The start of the input sequence
30 /// \param last One past the end of the input sequence
31 /// \param p The predicate to test the values with
32 /// \note This function is part of the C++2011 standard library.
33 /// We will use the standard one if it is available,
34 /// otherwise we have our own implementation.
35 template <typename InputIterator, typename UnaryPredicate>
36 bool is_partitioned ( InputIterator first, InputIterator last, UnaryPredicate p )
38 // Run through the part that satisfy the predicate
39 for ( ; first != last; ++first )
42 // Now the part that does not satisfy the predicate
43 for ( ; first != last; ++first )
50 /// \fn is_partitioned ( const Range &r, UnaryPredicate p )
51 /// \brief Generates an increasing sequence of values, and stores them in the input Range.
53 /// \param r The input range
54 /// \param p The predicate to test the values with
56 template <typename Range, typename UnaryPredicate>
57 bool is_partitioned ( const Range &r, UnaryPredicate p )
59 return boost::algorithm::is_partitioned (boost::begin(r), boost::end(r), p);
65 #endif // BOOST_ALGORITHM_IS_PARTITIONED_HPP