range/algorithm/partial_sort.hpp

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_PARTIAL_SORT_HPP_INCLUDED
0010 #define BOOST_RANGE_ALGORITHM_PARTIAL_SORT_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 <algorithm>
0017
0018 namespace boost
0019 {
0020     namespace range
0021     {
0022
0023 /// \brief template function partial_sort
0024 ///
0025 /// range-based version of the partial_sort std algorithm
0026 ///
0027 /// \pre RandomAccessRange is a model of the RandomAccessRangeConcept
0028 /// \pre BinaryPredicate is a model of the BinaryPredicateConcept
0029 template<class RandomAccessRange>
0030 inline RandomAccessRange& partial_sort(RandomAccessRange& rng,
0031     BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type middle)
0032 {
0033     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
0034     std::partial_sort(boost::begin(rng), middle, boost::end(rng));
0035     return rng;
0036 }
0037
0038 /// \overload
0039 template<class RandomAccessRange>
0040 inline const RandomAccessRange& partial_sort(const RandomAccessRange& rng,
0041     BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type middle)
0042 {
0043     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
0044     std::partial_sort(boost::begin(rng), middle, boost::end(rng));
0045     return rng;
0046 }
0047
0048 /// \overload
0049 template<class RandomAccessRange, class BinaryPredicate>
0050 inline RandomAccessRange& partial_sort(RandomAccessRange& rng,
0051     BOOST_DEDUCED_TYPENAME range_iterator<RandomAccessRange>::type middle,
0052     BinaryPredicate sort_pred)
0053 {
0054     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
0055     std::partial_sort(boost::begin(rng), middle, boost::end(rng),
0056                         sort_pred);
0057     return rng;
0058 }
0059
0060 /// \overload
0061 template<class RandomAccessRange, class BinaryPredicate>
0062 inline const RandomAccessRange& partial_sort(const RandomAccessRange& rng,
0063     BOOST_DEDUCED_TYPENAME range_iterator<const RandomAccessRange>::type middle,
0064     BinaryPredicate sort_pred)
0065 {
0066     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
0067     std::partial_sort(boost::begin(rng), middle, boost::end(rng),
0068                         sort_pred);
0069     return rng;
0070 }
0071
0072     } // namespace range
0073     using range::partial_sort;
0074 } // namespace boost
0075
0076 #endif // include guard