2013-08-08 09:54:33 +00:00
|
|
|
/*=============================================================================
|
|
|
|
Copyright (c) 2011-2013 Bolero MURAKAMI
|
|
|
|
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-12-21 14:32:33 +00:00
|
|
|
#ifndef SPROUT_RANGE_ALGORITHM_TRISTATE_LEXICOGRAPHICAL_COMPARE_HPP
|
|
|
|
#define SPROUT_RANGE_ALGORITHM_TRISTATE_LEXICOGRAPHICAL_COMPARE_HPP
|
|
|
|
|
|
|
|
#include <sprout/config.hpp>
|
|
|
|
#include <sprout/container/functions.hpp>
|
|
|
|
#include <sprout/algorithm/tristate_lexicographical_compare.hpp>
|
|
|
|
|
|
|
|
namespace sprout {
|
|
|
|
namespace range {
|
|
|
|
//
|
|
|
|
// tristate_lexicographical_compare
|
|
|
|
//
|
2013-08-07 13:13:03 +00:00
|
|
|
template<typename InputRange1, typename InputRange2>
|
2012-12-21 14:32:33 +00:00
|
|
|
inline SPROUT_CONSTEXPR int
|
2013-08-07 13:13:03 +00:00
|
|
|
tristate_lexicographical_compare(InputRange1 const& range1, InputRange2 const& range2) {
|
2012-12-21 14:32:33 +00:00
|
|
|
return sprout::tristate_lexicographical_compare(
|
|
|
|
sprout::begin(range1), sprout::end(range1), sprout::begin(range2), sprout::end(range2)
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
2013-08-07 13:13:03 +00:00
|
|
|
template<typename InputRange1, typename InputRange2, typename Compare>
|
2012-12-21 14:32:33 +00:00
|
|
|
inline SPROUT_CONSTEXPR int
|
2013-08-07 13:13:03 +00:00
|
|
|
tristate_lexicographical_compare(InputRange1 const& range1, InputRange2 const& range2, Compare comp) {
|
2012-12-21 14:32:33 +00:00
|
|
|
return sprout::tristate_lexicographical_compare(
|
|
|
|
sprout::begin(range1), sprout::end(range1), sprout::begin(range2), sprout::end(range2), comp
|
|
|
|
);
|
|
|
|
}
|
2012-12-21 17:53:21 +00:00
|
|
|
|
2013-08-07 13:13:03 +00:00
|
|
|
template<typename InputRange1, typename T1, typename InputRange2, typename T2>
|
2012-12-21 17:53:21 +00:00
|
|
|
inline SPROUT_CONSTEXPR int
|
2013-08-07 13:13:03 +00:00
|
|
|
tristate_lexicographical_compare(InputRange1 const& range1, T1 const& delim1, InputRange2 const& range2, T2 const& delim2) {
|
2012-12-21 17:53:21 +00:00
|
|
|
return sprout::tristate_lexicographical_compare(
|
|
|
|
sprout::begin(range1), sprout::end(range1), delim1, sprout::begin(range2), sprout::end(range2), delim2
|
|
|
|
);
|
|
|
|
}
|
|
|
|
|
2013-08-07 13:13:03 +00:00
|
|
|
template<typename InputRange1, typename T1, typename InputRange2, typename T2, typename Compare>
|
2012-12-21 17:53:21 +00:00
|
|
|
inline SPROUT_CONSTEXPR int
|
2013-08-07 13:13:03 +00:00
|
|
|
tristate_lexicographical_compare(InputRange1 const& range1, T1 const& delim1, InputRange2 const& range2, T2 const& delim2, Compare comp) {
|
2012-12-21 17:53:21 +00:00
|
|
|
return sprout::tristate_lexicographical_compare(
|
|
|
|
sprout::begin(range1), sprout::end(range1), delim1, sprout::begin(range2), sprout::end(range2), delim2, comp
|
|
|
|
);
|
|
|
|
}
|
2012-12-21 14:32:33 +00:00
|
|
|
} // namespace range
|
|
|
|
} // namespace sprout
|
|
|
|
|
|
|
|
#endif // #ifndef SPROUT_RANGE_ALGORITHM_TRISTATE_LEXICOGRAPHICAL_COMPARE_HPP
|