2012-04-01 13:15:09 +00:00
|
|
|
#ifndef SPROUT_ALGORITHM_MINMAX_ELEMENT_HPP
|
|
|
|
#define SPROUT_ALGORITHM_MINMAX_ELEMENT_HPP
|
|
|
|
|
2012-12-16 12:46:16 +00:00
|
|
|
#include <iterator>
|
2013-01-11 17:39:51 +00:00
|
|
|
#include <type_traits>
|
2012-04-01 13:15:09 +00:00
|
|
|
#include <sprout/config.hpp>
|
|
|
|
#include <sprout/iterator/operation.hpp>
|
2013-01-11 17:39:51 +00:00
|
|
|
#include <sprout/iterator/type_traits/is_iterator.hpp>
|
2013-02-07 14:12:57 +00:00
|
|
|
#include <sprout/utility/pair/pair.hpp>
|
|
|
|
#include <sprout/utility/pair/access.hpp>
|
2012-04-01 13:15:09 +00:00
|
|
|
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
|
|
|
|
|
|
|
|
namespace sprout {
|
|
|
|
namespace detail {
|
2012-12-16 12:46:16 +00:00
|
|
|
template<typename InputIteratorPair, typename Compare>
|
|
|
|
inline SPROUT_CONSTEXPR InputIteratorPair
|
2013-01-11 17:39:51 +00:00
|
|
|
iter_minmax_pair(InputIteratorPair const& a, InputIteratorPair const& b, Compare comp) {
|
2012-12-16 12:46:16 +00:00
|
|
|
return InputIteratorPair(
|
|
|
|
comp(*sprout::first(b), *sprout::first(a)) ? sprout::first(b) : sprout::first(a),
|
|
|
|
comp(*sprout::second(a), *sprout::second(b)) ? sprout::second(b) : sprout::second(a)
|
|
|
|
);
|
|
|
|
}
|
2013-01-11 17:39:51 +00:00
|
|
|
template<typename InputIteratorPair, typename InputIterator, typename Compare>
|
|
|
|
inline SPROUT_CONSTEXPR InputIteratorPair
|
|
|
|
iter_minmax(InputIteratorPair const& a, InputIterator b, Compare comp) {
|
|
|
|
return InputIteratorPair(
|
|
|
|
comp(*b, *sprout::first(a)) ? b : sprout::first(a),
|
|
|
|
comp(*sprout::second(a), *b) ? b : sprout::second(a)
|
|
|
|
);
|
|
|
|
}
|
2012-12-16 12:46:16 +00:00
|
|
|
|
|
|
|
template<typename RandomAccessIterator, typename Compare>
|
|
|
|
inline SPROUT_CONSTEXPR sprout::pair<RandomAccessIterator, RandomAccessIterator>
|
|
|
|
minmax_element_impl_ra(
|
|
|
|
RandomAccessIterator first, RandomAccessIterator last, Compare comp,
|
|
|
|
typename std::iterator_traits<RandomAccessIterator>::difference_type pivot
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return pivot == 0 ? sprout::pair<RandomAccessIterator, RandomAccessIterator>(first, first)
|
2013-01-11 17:39:51 +00:00
|
|
|
: sprout::detail::iter_minmax_pair(
|
2012-12-16 12:46:16 +00:00
|
|
|
sprout::detail::minmax_element_impl_ra(
|
|
|
|
first, sprout::next(first, pivot), comp,
|
|
|
|
pivot / 2
|
|
|
|
),
|
|
|
|
sprout::detail::minmax_element_impl_ra(
|
|
|
|
sprout::next(first, pivot), last, comp,
|
2013-01-03 08:01:50 +00:00
|
|
|
(sprout::distance(first, last) - pivot) / 2
|
2012-12-16 12:46:16 +00:00
|
|
|
),
|
|
|
|
comp
|
|
|
|
)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
template<typename RandomAccessIterator, typename Compare>
|
2013-01-11 17:39:51 +00:00
|
|
|
inline SPROUT_CONSTEXPR typename std::enable_if<
|
|
|
|
sprout::is_constant_distance_iterator<RandomAccessIterator>::value,
|
|
|
|
sprout::pair<RandomAccessIterator, RandomAccessIterator>
|
|
|
|
>::type
|
2012-12-16 12:46:16 +00:00
|
|
|
minmax_element(
|
|
|
|
RandomAccessIterator first, RandomAccessIterator last, Compare comp,
|
|
|
|
std::random_access_iterator_tag*
|
|
|
|
)
|
|
|
|
{
|
|
|
|
return first == last ? sprout::pair<RandomAccessIterator, RandomAccessIterator>(last, last)
|
|
|
|
: sprout::detail::minmax_element_impl_ra(
|
|
|
|
first, last, comp,
|
2013-01-03 08:01:50 +00:00
|
|
|
sprout::distance(first, last) / 2
|
2012-12-16 12:46:16 +00:00
|
|
|
)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
|
2012-04-01 13:15:09 +00:00
|
|
|
template<typename ForwardIterator, typename Compare>
|
2013-01-11 17:39:51 +00:00
|
|
|
inline SPROUT_CONSTEXPR sprout::pair<ForwardIterator, sprout::pair<ForwardIterator, ForwardIterator> >
|
|
|
|
minmax_element_impl_1(
|
|
|
|
sprout::pair<ForwardIterator, sprout::pair<ForwardIterator, ForwardIterator> > const& current,
|
|
|
|
ForwardIterator last, Compare comp, typename std::iterator_traits<ForwardIterator>::difference_type n
|
|
|
|
)
|
|
|
|
{
|
|
|
|
typedef sprout::pair<ForwardIterator, sprout::pair<ForwardIterator, ForwardIterator> > type;
|
|
|
|
return current.first == last ? current
|
|
|
|
: n == 1 ? type(sprout::next(current.first), sprout::detail::iter_minmax(current.second, current.first, comp))
|
|
|
|
: sprout::detail::minmax_element_impl_1(
|
|
|
|
sprout::detail::minmax_element_impl_1(
|
|
|
|
current,
|
|
|
|
last, comp, n / 2
|
|
|
|
),
|
|
|
|
last, comp, n - n / 2
|
|
|
|
)
|
|
|
|
;
|
|
|
|
}
|
|
|
|
template<typename ForwardIterator, typename Compare>
|
|
|
|
inline SPROUT_CONSTEXPR sprout::pair<ForwardIterator, sprout::pair<ForwardIterator, ForwardIterator> >
|
2012-10-06 04:53:07 +00:00
|
|
|
minmax_element_impl(
|
2013-01-11 17:39:51 +00:00
|
|
|
sprout::pair<ForwardIterator, sprout::pair<ForwardIterator, ForwardIterator> > const& current,
|
|
|
|
ForwardIterator last, Compare comp, typename std::iterator_traits<ForwardIterator>::difference_type n
|
2012-04-01 13:15:09 +00:00
|
|
|
)
|
|
|
|
{
|
2013-01-11 17:39:51 +00:00
|
|
|
typedef sprout::pair<ForwardIterator, sprout::pair<ForwardIterator, ForwardIterator> > type;
|
|
|
|
return current.first == last ? current
|
|
|
|
: sprout::detail::minmax_element_impl(
|
|
|
|
sprout::detail::minmax_element_impl_1(
|
|
|
|
current,
|
|
|
|
last, comp, n
|
|
|
|
),
|
|
|
|
last, comp, n * 2
|
|
|
|
)
|
2012-04-01 13:15:09 +00:00
|
|
|
;
|
|
|
|
}
|
2012-12-16 12:46:16 +00:00
|
|
|
template<typename ForwardIterator, typename Compare>
|
|
|
|
inline SPROUT_CONSTEXPR sprout::pair<ForwardIterator, ForwardIterator>
|
|
|
|
minmax_element(
|
|
|
|
ForwardIterator first, ForwardIterator last, Compare comp,
|
|
|
|
void*
|
|
|
|
)
|
|
|
|
{
|
2013-01-11 17:39:51 +00:00
|
|
|
typedef sprout::pair<ForwardIterator, sprout::pair<ForwardIterator, ForwardIterator> > type;
|
|
|
|
return first == last ? sprout::pair<ForwardIterator, ForwardIterator>(first, first)
|
|
|
|
: sprout::detail::minmax_element_impl(type(sprout::next(first), sprout::pair<ForwardIterator, ForwardIterator>(first, first)), last, comp, 1).second
|
2012-12-16 12:46:16 +00:00
|
|
|
;
|
|
|
|
}
|
2012-04-01 13:15:09 +00:00
|
|
|
} // namespace detail
|
|
|
|
|
|
|
|
// 25.4.7 Minimum and maximum
|
2012-12-16 12:46:16 +00:00
|
|
|
//
|
|
|
|
// recursion depth:
|
2013-01-11 17:39:51 +00:00
|
|
|
// O(log N)
|
2012-12-16 12:46:16 +00:00
|
|
|
//
|
2012-04-01 13:15:09 +00:00
|
|
|
template<typename ForwardIterator, typename Compare>
|
2012-12-16 12:46:16 +00:00
|
|
|
inline SPROUT_CONSTEXPR sprout::pair<ForwardIterator, ForwardIterator>
|
2012-10-06 04:53:07 +00:00
|
|
|
minmax_element(ForwardIterator first, ForwardIterator last, Compare comp) {
|
2012-12-16 12:46:16 +00:00
|
|
|
typedef typename std::iterator_traits<ForwardIterator>::iterator_category* category;
|
|
|
|
return sprout::detail::minmax_element(first, last, comp, category());
|
2012-04-01 13:15:09 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
template<typename ForwardIterator>
|
2012-12-16 12:46:16 +00:00
|
|
|
inline SPROUT_CONSTEXPR sprout::pair<ForwardIterator, ForwardIterator>
|
2012-10-06 04:53:07 +00:00
|
|
|
minmax_element(ForwardIterator first, ForwardIterator last) {
|
|
|
|
return sprout::minmax_element(
|
|
|
|
first, last,
|
|
|
|
NS_SSCRISK_CEL_OR_SPROUT::less<typename std::iterator_traits<ForwardIterator>::value_type>()
|
|
|
|
);
|
2012-04-01 13:15:09 +00:00
|
|
|
}
|
|
|
|
} // namespace sprout
|
|
|
|
|
|
|
|
#endif // #ifndef SPROUT_ALGORITHM_MINMAX_ELEMENT_HPP
|