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