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