Sprout/sprout/array/comparison.hpp

52 lines
1.6 KiB
C++
Raw Normal View History

#ifndef SPROUT_ARRAY_COMPARISON_HPP
#define SPROUT_ARRAY_COMPARISON_HPP
#include <cstddef>
#include <sprout/config.hpp>
#include <sprout/array/array.hpp>
2013-01-11 19:08:44 +00:00
#include <sprout/algorithm/equal.hpp>
#include <sprout/algorithm/lexicographical_compare.hpp>
namespace sprout {
//
// operator==
// operator!=
// operator<
// operator>
// operator<=
// operator>=
//
template<typename T, std::size_t N>
2012-10-05 15:58:56 +00:00
inline SPROUT_CONSTEXPR bool
operator==(sprout::array<T, N> const& lhs, sprout::array<T, N> const& rhs) {
2013-01-11 19:08:44 +00:00
return sprout::equal(lhs.begin(), lhs.end(), rhs.begin());
}
template<typename T, std::size_t N>
2012-10-05 15:58:56 +00:00
inline SPROUT_CONSTEXPR bool
operator!=(sprout::array<T, N> const& lhs, sprout::array<T, N> const& rhs) {
return !(lhs == rhs);
}
template<typename T, std::size_t N>
2012-10-05 15:58:56 +00:00
inline SPROUT_CONSTEXPR bool
operator<(sprout::array<T, N> const& lhs, sprout::array<T, N> const& rhs) {
2013-01-11 19:08:44 +00:00
return sprout::lexicographical_compare(lhs.begin(), lhs.end(), rhs.begin(), rhs.end());
}
template<typename T, std::size_t N>
2012-10-05 15:58:56 +00:00
inline SPROUT_CONSTEXPR bool
operator>(sprout::array<T, N> const& lhs, sprout::array<T, N> const& rhs) {
return rhs < lhs;
}
template<typename T, std::size_t N>
2012-10-05 15:58:56 +00:00
inline SPROUT_CONSTEXPR bool
operator<=(sprout::array<T, N> const& lhs, sprout::array<T, N> const& rhs) {
return !(rhs < lhs);
}
template<typename T, std::size_t N>
2012-10-05 15:58:56 +00:00
inline SPROUT_CONSTEXPR bool
operator>=(sprout::array<T, N> const& lhs, sprout::array<T, N> const& rhs) {
return !(lhs < rhs);
}
} // namespace sprout
#endif // #ifndef SPROUT_ARRAY_COMPARISON_HPP