File indexing completed on 2025-01-30 09:59:16
0001
0002
0003
0004
0005
0006
0007
0008
0009 #ifndef BOOST_RANGE_ALGORITHM_MERGE_HPP_INCLUDED
0010 #define BOOST_RANGE_ALGORITHM_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
0024
0025
0026
0027
0028
0029
0030
0031 template<class SinglePassRange1, class SinglePassRange2,
0032 class OutputIterator>
0033 inline OutputIterator merge(const SinglePassRange1& rng1,
0034 const SinglePassRange2& rng2,
0035 OutputIterator out)
0036 {
0037 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
0038 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
0039 return std::merge(boost::begin(rng1), boost::end(rng1),
0040 boost::begin(rng2), boost::end(rng2), out);
0041 }
0042
0043
0044 template<class SinglePassRange1, class SinglePassRange2,
0045 class OutputIterator, class BinaryPredicate>
0046 inline OutputIterator merge(const SinglePassRange1& rng1,
0047 const SinglePassRange2& rng2,
0048 OutputIterator out,
0049 BinaryPredicate pred)
0050 {
0051 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange1> ));
0052 BOOST_RANGE_CONCEPT_ASSERT(( SinglePassRangeConcept<const SinglePassRange2> ));
0053 return std::merge(boost::begin(rng1), boost::end(rng1),
0054 boost::begin(rng2), boost::end(rng2), out, pred);
0055 }
0056
0057 }
0058 using range::merge;
0059 }
0060
0061 #endif