Sprout/sprout/range/algorithm/lexicographical_compare.hpp

39 lines
1.5 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
Copyright (c) 2011-2013 Bolero MURAKAMI
Copyright (C) 2011 RiSK (sscrisk)
https://github.com/bolero-MURAKAMI/Sprout
Distributed under the Boost Software License, Version 1.0. (See accompanying
file LICENSE_1_0.txt or copy at http://www.boost.org/LICENSE_1_0.txt)
=============================================================================*/
2012-04-04 08:48:02 +00:00
#ifndef SPROUT_RANGE_ALGORITHM_LEXICOGRAPHICAL_COMPARE_HPP
#define SPROUT_RANGE_ALGORITHM_LEXICOGRAPHICAL_COMPARE_HPP
#include <sprout/config.hpp>
#include <sprout/container/functions.hpp>
#include <sprout/algorithm/lexicographical_compare.hpp>
namespace sprout {
namespace range {
// 25.4.8 Lexicographical comparison
template<typename InputRange1, typename InputRange2>
2012-10-06 04:53:07 +00:00
inline SPROUT_CONSTEXPR bool
lexicographical_compare(InputRange1 const& range1, InputRange2 const& range2) {
2012-10-06 04:53:07 +00:00
return sprout::lexicographical_compare(
sprout::begin(range1), sprout::end(range1), sprout::begin(range2), sprout::end(range2)
);
2012-04-04 08:48:02 +00:00
}
template<typename InputRange1, typename InputRange2, typename Compare>
2012-10-06 04:53:07 +00:00
inline SPROUT_CONSTEXPR bool
lexicographical_compare(InputRange1 const& range1, InputRange2 const& range2, Compare comp) {
2012-10-06 04:53:07 +00:00
return sprout::lexicographical_compare(
sprout::begin(range1), sprout::end(range1), sprout::begin(range2), sprout::end(range2), comp
);
2012-04-04 08:48:02 +00:00
}
} // namespace range
} // namespace sprout
#endif // #ifndef SPROUT_RANGE_ALGORITHM_LEXICOGRAPHICAL_COMPARE_HPP