1 /*
2 Copyright (c) Marshall Clow 2011-2012.
3
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)
6 */
7
8 /// \file is_partitioned.hpp
9 /// \brief Tell if a sequence is partitioned
10 /// \author Marshall Clow
11
12 #ifndef BOOST_ALGORITHM_IS_PARTITIONED_HPP
13 #define BOOST_ALGORITHM_IS_PARTITIONED_HPP
14
15 #include <boost/config.hpp>
16 #include <boost/range/begin.hpp>
17 #include <boost/range/end.hpp>
18
19 namespace boost { namespace algorithm {
20
21 /// \fn is_partitioned ( InputIterator first, InputIterator last, UnaryPredicate p )
22 /// \brief Tests to see if a sequence is partitioned according to a predicate.
23 /// In other words, all the items in the sequence that satisfy the predicate are at the beginning of the sequence.
24 ///
25 /// \param first The start of the input sequence
26 /// \param last One past the end of the input sequence
27 /// \param p The predicate to test the values with
28 /// \note This function is part of the C++2011 standard library.
29 template <typename InputIterator, typename UnaryPredicate>
is_partitioned(InputIterator first,InputIterator last,UnaryPredicate p)30 BOOST_CXX14_CONSTEXPR bool is_partitioned ( InputIterator first, InputIterator last, UnaryPredicate p )
31 {
32 // Run through the part that satisfy the predicate
33 for ( ; first != last; ++first )
34 if ( !p (*first))
35 break;
36 // Now the part that does not satisfy the predicate
37 for ( ; first != last; ++first )
38 if ( p (*first))
39 return false;
40 return true;
41 }
42
43 /// \fn is_partitioned ( const Range &r, UnaryPredicate p )
44 /// \brief Tests to see if a sequence is partitioned according to a predicate.
45 /// In other words, all the items in the sequence that satisfy the predicate are at the beginning of the sequence.
46 ///
47 /// \param r The input range
48 /// \param p The predicate to test the values with
49 ///
50 template <typename Range, typename UnaryPredicate>
is_partitioned(const Range & r,UnaryPredicate p)51 BOOST_CXX14_CONSTEXPR bool is_partitioned ( const Range &r, UnaryPredicate p )
52 {
53 return boost::algorithm::is_partitioned (boost::begin(r), boost::end(r), p);
54 }
55
56
57 }}
58
59 #endif // BOOST_ALGORITHM_IS_PARTITIONED_HPP
60