/*============================================================================= 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) =============================================================================*/ #ifndef SPROUT_RANGE_ALGORITHM_MINMAX_ELEMENT_HPP #define SPROUT_RANGE_ALGORITHM_MINMAX_ELEMENT_HPP #include #include #include #include #include #include namespace sprout { namespace range { namespace detail { template inline SPROUT_CONSTEXPR sprout::pair< typename sprout::range::range_return::type, typename sprout::range::range_return::type > pack_pair(Pair const& pair, ForwardRange&& range) { return { sprout::range::range_return::pack(pair.first, sprout::forward(range)), sprout::range::range_return::pack(pair.second, sprout::forward(range)) }; } template inline SPROUT_CONSTEXPR sprout::pair< typename sprout::range::range_return::type, typename sprout::range::range_return::type > pack_pair(Pair const& pair, ForwardRange&& range) { return { sprout::range::range_return::pack(pair.first, sprout::forward(range)), sprout::range::range_return::pack(pair.second, sprout::forward(range)) }; } } // namespace detail // 25.4.7 Minimum and maximum template inline SPROUT_CONSTEXPR sprout::pair< typename sprout::range::range_return::type, typename sprout::range::range_return::type > minmax_element(ForwardRange&& range) { return sprout::range::detail::pack_pair( sprout::minmax_element( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)) ), sprout::forward(range) ); } template inline SPROUT_CONSTEXPR sprout::pair< typename sprout::range::range_return::type, typename sprout::range::range_return::type > minmax_element(ForwardRange&& range, Compare comp) { return sprout::range::detail::pack_pair( sprout::minmax_element( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)), comp ), sprout::forward(range) ); } template inline SPROUT_CONSTEXPR sprout::pair< typename sprout::range::range_return::type, typename sprout::range::range_return::type > minmax_element(ForwardRange&& range) { return sprout::range::detail::pack_pair( sprout::minmax_element( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)) ), sprout::forward(range) ); } template inline SPROUT_CONSTEXPR sprout::pair< typename sprout::range::range_return::type, typename sprout::range::range_return::type > minmax_element(ForwardRange&& range, Compare comp) { return sprout::range::detail::pack_pair( sprout::minmax_element( sprout::begin(sprout::forward(range)), sprout::end(sprout::forward(range)), comp ), sprout::forward(range) ); } } // namespace range } // namespace sprout #endif // #ifndef SPROUT_RANGE_ALGORITHM_MINMAX_ELEMENT_HPP