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

36 lines
1.3 KiB
C++
Raw Normal View History

2013-08-08 09:54:33 +00:00
/*=============================================================================
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)
=============================================================================*/
2012-04-01 13:15:09 +00:00
#ifndef SPROUT_ALGORITHM_MAX_HPP
#define SPROUT_ALGORITHM_MAX_HPP
2013-08-23 13:38:40 +00:00
#include <initializer_list>
2012-04-01 13:15:09 +00:00
#include <sprout/config.hpp>
2013-10-05 04:35:26 +00:00
#include <sprout/algorithm/detail/max.hpp>
2013-08-23 13:38:40 +00:00
#include <sprout/algorithm/max_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
2013-08-23 13:38:40 +00:00
template<typename T, typename Compare>
inline SPROUT_INITIALIZER_LIST_CONSTEXPR T
2013-08-23 13:38:40 +00:00
max(std::initializer_list<T> t, Compare comp) {
return *sprout::max_element(sprout::ptr_index(t.begin(), 0), sprout::ptr_index(t.begin(), t.size()), comp);
}
template<typename T>
inline SPROUT_INITIALIZER_LIST_CONSTEXPR T
2013-08-23 13:38:40 +00:00
max(std::initializer_list<T> t) {
return sprout::max(t, NS_SSCRISK_CEL_OR_SPROUT::less<T>());
}
2012-04-01 13:15:09 +00:00
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_MAX_HPP