Chris@16: /* 
Chris@16:    Copyright (c) Marshall Clow 2011-2012.
Chris@16: 
Chris@16:    Distributed under the Boost Software License, Version 1.0. (See accompanying
Chris@16:    file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
Chris@16: */
Chris@16: 
Chris@16: /// \file  is_partitioned.hpp
Chris@16: /// \brief Tell if a sequence is partitioned
Chris@16: /// \author Marshall Clow
Chris@16: 
Chris@16: #ifndef BOOST_ALGORITHM_IS_PARTITIONED_HPP
Chris@16: #define BOOST_ALGORITHM_IS_PARTITIONED_HPP
Chris@16: 
Chris@16: #include <algorithm>    // for std::is_partitioned, if available
Chris@16: 
Chris@16: #include <boost/range/begin.hpp>
Chris@16: #include <boost/range/end.hpp>
Chris@16: 
Chris@16: namespace boost { namespace algorithm {
Chris@16: 
Chris@16: /// \fn is_partitioned ( InputIterator first, InputIterator last, UnaryPredicate p )
Chris@16: /// \brief Tests to see if a sequence is partitioned according to a predicate
Chris@16: /// 
Chris@16: /// \param first    The start of the input sequence
Chris@16: /// \param last     One past the end of the input sequence
Chris@16: /// \param p        The predicate to test the values with
Chris@16: /// \note           This function is part of the C++2011 standard library.
Chris@16: ///  We will use the standard one if it is available, 
Chris@16: ///  otherwise we have our own implementation.
Chris@16: template <typename InputIterator, typename UnaryPredicate>
Chris@16: bool is_partitioned ( InputIterator first, InputIterator last, UnaryPredicate p )
Chris@16: {
Chris@16: //  Run through the part that satisfy the predicate
Chris@16:     for ( ; first != last; ++first )
Chris@16:         if ( !p (*first))
Chris@16:             break;
Chris@16: //  Now the part that does not satisfy the predicate
Chris@16:     for ( ; first != last; ++first )
Chris@16:         if ( p (*first))
Chris@16:             return false;
Chris@16:     return true;
Chris@16: }
Chris@16: 
Chris@16: /// \fn is_partitioned ( const Range &r, UnaryPredicate p )
Chris@16: /// \brief Generates an increasing sequence of values, and stores them in the input Range.
Chris@16: /// 
Chris@16: /// \param r        The input range
Chris@16: /// \param p        The predicate to test the values with
Chris@16: ///
Chris@16: template <typename Range, typename UnaryPredicate>
Chris@16: bool is_partitioned ( const Range &r, UnaryPredicate p )
Chris@16: {
Chris@16:     return boost::algorithm::is_partitioned (boost::begin(r), boost::end(r), p);
Chris@16: }
Chris@16: 
Chris@16: 
Chris@16: }}
Chris@16: 
Chris@16: #endif  // BOOST_ALGORITHM_IS_PARTITIONED_HPP