1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-11-12 21:09:01 +00:00
Sprout/sprout/algorithm/minmax.hpp

55 lines
2 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
2014-01-08 07:48:12 +00:00
Copyright (c) 2011-2014 Bolero MURAKAMI
2013-08-08 09:54:33 +00:00
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)
=============================================================================*/
2012-04-01 13:15:09 +00:00
#ifndef SPROUT_ALGORITHM_MINMAX_HPP
#define SPROUT_ALGORITHM_MINMAX_HPP
2013-08-23 14:20:36 +00:00
#include <initializer_list>
2012-04-01 13:15:09 +00:00
#include <sprout/config.hpp>
2013-02-07 14:12:57 +00:00
#include <sprout/utility/pair/pair.hpp>
2013-08-23 14:20:36 +00:00
#include <sprout/algorithm/minmax_element.hpp>
#include <sprout/iterator/ptr_index_iterator.hpp>
2012-04-01 13:15:09 +00:00
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
namespace sprout {
// 25.4.7 Minimum and maximum
template<typename T, typename Compare>
2013-08-23 14:20:36 +00:00
inline SPROUT_CONSTEXPR sprout::pair<T const&, T const&>
2012-10-06 04:53:07 +00:00
minmax(T const& a, T const& b, Compare comp) {
2013-08-23 14:20:36 +00:00
return comp(b, a) ? sprout::pair<T const&, T const&>(b, a) : sprout::pair<T const&, T const&>(a, b);
2012-04-01 13:15:09 +00:00
}
template<typename T>
2013-08-23 14:20:36 +00:00
inline SPROUT_CONSTEXPR sprout::pair<T const&, T const&>
2012-10-06 04:53:07 +00:00
minmax(T const& a, T const& b) {
2012-04-01 13:15:09 +00:00
return sprout::minmax(a, b, NS_SSCRISK_CEL_OR_SPROUT::less<T>());
}
2013-08-23 14:20:36 +00:00
namespace detail {
template<typename T, typename Iterator>
inline SPROUT_CONSTEXPR sprout::pair<T, T>
minmax_impl(sprout::pair<Iterator, Iterator> const& p) {
return sprout::pair<T, T>(*p.first, *p.second);
}
} // namespace detail
template<typename T, typename Compare>
inline SPROUT_INITIALIZER_LIST_CONSTEXPR sprout::pair<T, T>
2013-08-23 14:20:36 +00:00
minmax(std::initializer_list<T> t, Compare comp) {
return sprout::detail::minmax_impl<T>(sprout::minmax_element(sprout::ptr_index(t.begin(), 0), sprout::ptr_index(t.begin(), t.size()), comp));
}
template<typename T>
inline SPROUT_INITIALIZER_LIST_CONSTEXPR sprout::pair<T, T>
2013-08-23 14:20:36 +00:00
minmax(std::initializer_list<T> t) {
return sprout::minmax(t, NS_SSCRISK_CEL_OR_SPROUT::less<T>());
}
2012-04-01 13:15:09 +00:00
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_MINMAX_HPP