ceph/src/boost/boost/algorithm/cxx11/is_partitioned.hpp

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