King_DuckZ/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-11-12 21:09:01 +00:00
Code Issues Releases Wiki Activity

add minmax initializer_list version

Browse source
This commit is contained in:
bolero-MURAKAMI 2013-08-23 23:20:36 +09:00
parent 5ea46e507f
commit b500c7c993
1 changed files with 41 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

46
sprout/algorithm/minmax.hpp
View file

@ -9,24 +9,60 @@
#ifndef SPROUT_ALGORITHM_MINMAX_HPP #ifndef SPROUT_ALGORITHM_MINMAX_HPP
#define SPROUT_ALGORITHM_MINMAX_HPP #define SPROUT_ALGORITHM_MINMAX_HPP
#include <initializer_list>
#include <sprout/config.hpp> #include <sprout/config.hpp>
#include <sprout/utility/pair/pair.hpp> #include <sprout/utility/pair/pair.hpp>
#include <sprout/algorithm/minmax_element.hpp>
#include <sprout/iterator/ptr_index_iterator.hpp>
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT #include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
namespace sprout { namespace sprout {
// 25.4.7 Minimum and maximum // 25.4.7 Minimum and maximum
template<typename T, typename Compare> template<typename T, typename Compare>
inline SPROUT_CONSTEXPR sprout::pair<T, T> inline SPROUT_CONSTEXPR sprout::pair<T const&, T const&>
minmax(T const& a, T const& b, Compare comp) { minmax(T const& a, T const& b, Compare comp) {
return comp(b, a) ? sprout::pair<T, T>(b, a) : sprout::pair<T, T>(a, b); return comp(b, a) ? sprout::pair<T const&, T const&>(b, a) : sprout::pair<T const&, T const&>(a, b);
}
template<typename T>
inline SPROUT_CONSTEXPR sprout::pair<T const&, T const&>
minmax(T const& a, T const& b) {
return sprout::minmax(a, b, NS_SSCRISK_CEL_OR_SPROUT::less<T>());
}
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
#ifdef SPROUT_NO_CXX14_INITIALIZER_LIST
template<typename T, typename Compare>
inline SPROUT_CONSTEXPR sprout::pair<T, T>
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> template<typename T>
inline SPROUT_CONSTEXPR sprout::pair<T, T> inline SPROUT_CONSTEXPR sprout::pair<T, T>
minmax(T const& a, T const& b) { minmax(std::initializer_list<T> t) {
return sprout::minmax(a, b, NS_SSCRISK_CEL_OR_SPROUT::less<T>()); return sprout::minmax(t, NS_SSCRISK_CEL_OR_SPROUT::less<T>());
} }
#else // #ifdef SPROUT_NO_CXX14_INITIALIZER_LIST
template<typename T, typename Compare>
inline sprout::pair<T, T>
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::pair<T, T>
minmax(std::initializer_list<T> t) {
return sprout::minmax(t, NS_SSCRISK_CEL_OR_SPROUT::less<T>());
}
#endif // #ifdef SPROUT_NO_CXX14_INITIALIZER_LIST
} // namespace sprout } // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_MINMAX_HPP #endif // #ifndef SPROUT_ALGORITHM_MINMAX_HPP