Sprout/sprout/algorithm/equal_range.hpp

39 lines
1.3 KiB
C++
Raw Normal View History

2012-04-01 13:15:09 +00:00
#ifndef SPROUT_ALGORITHM_EQUAL_RANGE_HPP
#define SPROUT_ALGORITHM_EQUAL_RANGE_HPP
2013-01-10 18:17:06 +00:00
#include <iterator>
2012-04-01 13:15:09 +00:00
#include <sprout/config.hpp>
#include <sprout/algorithm/lower_bound.hpp>
#include <sprout/algorithm/upper_bound.hpp>
#include <sprout/utility/pair.hpp>
2012-12-15 14:48:52 +00:00
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
2012-04-01 13:15:09 +00:00
namespace sprout {
// Copyright (C) 2011 RiSK (sscrisk)
// 25.4.3.3 equal_range
2012-12-15 14:48:52 +00:00
//
// recursion depth:
2013-01-10 18:17:06 +00:00
// O(log N)
2012-12-15 14:48:52 +00:00
//
2012-04-01 13:15:09 +00:00
template<typename ForwardIterator, typename T, typename Compare>
2013-01-10 18:17:06 +00:00
inline SPROUT_CONSTEXPR sprout::pair<ForwardIterator, ForwardIterator>
2012-10-06 04:53:07 +00:00
equal_range(ForwardIterator first, ForwardIterator last, T const& value, Compare comp) {
2013-01-10 18:17:06 +00:00
return sprout::pair<ForwardIterator, ForwardIterator>{
sprout::lower_bound(first, last, value, comp),
sprout::upper_bound(first, last, value, comp)
};
2012-04-01 13:15:09 +00:00
}
2012-12-15 14:48:52 +00:00
template<typename ForwardIterator, typename T>
inline SPROUT_CONSTEXPR sprout::pair<ForwardIterator, ForwardIterator>
equal_range(ForwardIterator first, ForwardIterator last, T const& value) {
return sprout::equal_range(
first, last, value,
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_EQUAL_RANGE_HPP