/*============================================================================= 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) =============================================================================*/ #ifndef SPROUT_SUB_ARRAY_COMPARISON_HPP #define SPROUT_SUB_ARRAY_COMPARISON_HPP #include #include #include #include #include namespace sprout { // // operator== // operator!= // operator< // operator> // operator<= // operator>= // template inline SPROUT_CONSTEXPR bool operator==(sprout::sub_array const& lhs, sprout::sub_array const& rhs) { return sprout::equal(sprout::begin(lhs), sprout::end(lhs), sprout::begin(rhs)); } template inline SPROUT_CONSTEXPR bool operator!=(sprout::sub_array const& lhs, sprout::sub_array const& rhs) { return !(lhs == rhs); } template inline SPROUT_CONSTEXPR bool operator<(sprout::sub_array const& lhs, sprout::sub_array const& rhs) { return sprout::lexicographical_compare( sprout::begin(lhs), sprout::end(lhs), sprout::begin(rhs), sprout::end(rhs) ); } template inline SPROUT_CONSTEXPR bool operator>(sprout::sub_array const& lhs, sprout::sub_array const& rhs) { return rhs < lhs; } template inline SPROUT_CONSTEXPR bool operator<=(sprout::sub_array const& lhs, sprout::sub_array const& rhs) { return !(rhs < lhs); } template inline SPROUT_CONSTEXPR bool operator>=(sprout::sub_array const& lhs, sprout::sub_array const& rhs) { return !(lhs < rhs); } } // namespace sprout #endif // #ifndef SPROUT_SUB_ARRAY_COMPARISON_HPP