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