// Copyright Neil Groves 2009. Use, modification and // distribution is subject to the Boost Software License, Version // 1.0. (See accompanying file LICENSE_1_0.txt or copy at // http://www.boost.org/LICENSE_1_0.txt) // // // For more information, see http://www.boost.org/libs/range/ // #ifndef BOOST_RANGE_ALGORITHM_STABLE_PARTITION_HPP_INCLUDED #define BOOST_RANGE_ALGORITHM_STABLE_PARTITION_HPP_INCLUDED #include #include #include #include #include #include namespace boost { namespace range { /// \brief template function stable_partition /// /// range-based version of the stable_partition std algorithm /// /// \pre BidirectionalRange is a model of the BidirectionalRangeConcept /// \pre UnaryPredicate is a model of the UnaryPredicateConcept template inline BOOST_DEDUCED_TYPENAME range_iterator::type stable_partition(BidirectionalRange& rng, UnaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept )); return std::stable_partition(boost::begin(rng), boost::end(rng), pred); } /// \overload template inline BOOST_DEDUCED_TYPENAME range_iterator::type stable_partition(const BidirectionalRange& rng, UnaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept )); return std::stable_partition(boost::begin(rng),boost::end(rng),pred); } // range_return overloads template inline BOOST_DEDUCED_TYPENAME range_return::type stable_partition(BidirectionalRange& rng, UnaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept )); return range_return::pack( std::stable_partition(boost::begin(rng), boost::end(rng), pred), rng); } /// \overload template inline BOOST_DEDUCED_TYPENAME range_return::type stable_partition(const BidirectionalRange& rng, UnaryPredicate pred) { BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept )); return range_return::pack( std::stable_partition(boost::begin(rng),boost::end(rng),pred), rng); } } // namespace range using range::stable_partition; } // namespace boost #endif // include guard