range/algorithm/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_SORT_HPP_INCLUDED
0010 #define BOOST_RANGE_ALGORITHM_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 sort
0024 ///
0025 /// range-based version of the 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& sort(RandomAccessRange& rng)
0031 {
0032     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
0033     std::sort(boost::begin(rng), boost::end(rng));
0034     return rng;
0035 }
0036
0037 /// \overload
0038 template<class RandomAccessRange>
0039 inline const RandomAccessRange& sort(const RandomAccessRange& rng)
0040 {
0041     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
0042     std::sort(boost::begin(rng), boost::end(rng));
0043     return rng;
0044 }
0045
0046 /// \overload
0047 template<class RandomAccessRange, class BinaryPredicate>
0048 inline RandomAccessRange& sort(RandomAccessRange& rng, BinaryPredicate pred)
0049 {
0050     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<RandomAccessRange> ));
0051     std::sort(boost::begin(rng), boost::end(rng), pred);
0052     return rng;
0053 }
0054
0055 /// \overload
0056 template<class RandomAccessRange, class BinaryPredicate>
0057 inline const RandomAccessRange& sort(const RandomAccessRange& rng, BinaryPredicate pred)
0058 {
0059     BOOST_RANGE_CONCEPT_ASSERT(( RandomAccessRangeConcept<const RandomAccessRange> ));
0060     std::sort(boost::begin(rng), boost::end(rng), pred);
0061     return rng;
0062 }
0063
0064     } // namespace range
0065     using range::sort;
0066 } // namespace boost
0067
0068 #endif // include guard