Back to home page

EIC code displayed by LXR

 
 

    


File indexing completed on 2025-01-30 09:59:17

0001 //  Copyright Neil Groves 2009. Use, modification and
0002 //  distribution is subject to the Boost Software License, Version
0003 //  1.0. (See accompanying file LICENSE_1_0.txt or copy at
0004 //  http://www.boost.org/LICENSE_1_0.txt)
0005 //
0006 //
0007 // For more information, see http://www.boost.org/libs/range/
0008 //
0009 #ifndef BOOST_RANGE_ALGORITHM_STABLE_PARTITION_HPP_INCLUDED
0010 #define BOOST_RANGE_ALGORITHM_STABLE_PARTITION_HPP_INCLUDED
0011 
0012 #include <boost/concept_check.hpp>
0013 #include <boost/range/begin.hpp>
0014 #include <boost/range/end.hpp>
0015 #include <boost/range/concepts.hpp>
0016 #include <boost/range/detail/range_return.hpp>
0017 #include <algorithm>
0018 
0019 namespace boost
0020 {
0021     namespace range
0022     {
0023 
0024 /// \brief template function stable_partition
0025 ///
0026 /// range-based version of the stable_partition std algorithm
0027 ///
0028 /// \pre BidirectionalRange is a model of the BidirectionalRangeConcept
0029 /// \pre UnaryPredicate is a model of the UnaryPredicateConcept
0030 template<class BidirectionalRange, class UnaryPredicate>
0031 inline BOOST_DEDUCED_TYPENAME range_iterator<BidirectionalRange>::type
0032 stable_partition(BidirectionalRange& rng, UnaryPredicate pred)
0033 {
0034     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
0035     return std::stable_partition(boost::begin(rng), boost::end(rng), pred);
0036 }
0037 
0038 /// \overload
0039 template<class BidirectionalRange, class UnaryPredicate>
0040 inline BOOST_DEDUCED_TYPENAME range_iterator<const BidirectionalRange>::type
0041 stable_partition(const BidirectionalRange& rng, UnaryPredicate pred)
0042 {
0043     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> ));
0044     return std::stable_partition(boost::begin(rng),boost::end(rng),pred);
0045 }
0046 
0047 // range_return overloads
0048 template<range_return_value re, class BidirectionalRange, class UnaryPredicate>
0049 inline BOOST_DEDUCED_TYPENAME range_return<BidirectionalRange,re>::type
0050 stable_partition(BidirectionalRange& rng, UnaryPredicate pred)
0051 {
0052     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<BidirectionalRange> ));
0053     return range_return<BidirectionalRange,re>::pack(
0054         std::stable_partition(boost::begin(rng), boost::end(rng), pred),
0055         rng);
0056 }
0057 
0058 /// \overload
0059 template<range_return_value re, class BidirectionalRange, class UnaryPredicate>
0060 inline BOOST_DEDUCED_TYPENAME range_return<const BidirectionalRange,re>::type
0061 stable_partition(const BidirectionalRange& rng, UnaryPredicate pred)
0062 {
0063     BOOST_RANGE_CONCEPT_ASSERT(( BidirectionalRangeConcept<const BidirectionalRange> ));
0064     return range_return<const BidirectionalRange,re>::pack(
0065         std::stable_partition(boost::begin(rng),boost::end(rng),pred),
0066         rng);
0067 }
0068 
0069     } // namespace range
0070     using range::stable_partition;
0071 } // namespace boost
0072 
0073 #endif // include guard