/*============================================================================= Copyright (c) 2011 RiSK (sscrisk) https://github.com/sscrisk/CEL---ConstExpr-Library Copyright (c) 2011-2019 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_ALGORITHM_MINMAX_HPP #define SPROUT_ALGORITHM_MINMAX_HPP #include #include #include #include #include #include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT namespace sprout { // 25.4.7 Minimum and maximum template inline SPROUT_CONSTEXPR sprout::pair minmax(T const& a, T const& b, Compare comp) { return comp(b, a) ? sprout::pair(b, a) : sprout::pair(a, b); } template inline SPROUT_CONSTEXPR sprout::pair minmax(T const& a, T const& b) { return sprout::minmax(a, b, NS_SSCRISK_CEL_OR_SPROUT::less()); } namespace detail { template inline SPROUT_CONSTEXPR sprout::pair minmax_impl(sprout::pair const& p) { return sprout::pair(*p.first, *p.second); } } // namespace detail template inline SPROUT_INITIALIZER_LIST_CONSTEXPR sprout::pair minmax(std::initializer_list t, Compare comp) { return sprout::detail::minmax_impl(sprout::minmax_element(sprout::ptr_index(t.begin(), 0), sprout::ptr_index(t.begin(), t.size()), comp)); } template inline SPROUT_INITIALIZER_LIST_CONSTEXPR sprout::pair minmax(std::initializer_list t) { return sprout::minmax(t, NS_SSCRISK_CEL_OR_SPROUT::less()); } } // namespace sprout #endif // #ifndef SPROUT_ALGORITHM_MINMAX_HPP