mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2025-07-04 14:14:09 +00:00
Code Issues Projects Releases Packages Wiki Activity Actions

fix recursion depth: includes

Browse source
This commit is contained in:
bolero-MURAKAMI 2012-12-15 23:48:52 +09:00
parent eea1c2bbc1
commit 0201107eec
14 changed files with 442 additions and 71 deletions
Download patch file Download diff file Expand all files Collapse all files

21
sprout/algorithm/equal_range.hpp
View file

@ -5,22 +5,31 @@
#include <sprout/algorithm/lower_bound.hpp>
#include <sprout/algorithm/upper_bound.hpp>
#include <sprout/utility/pair.hpp>
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
namespace sprout {
// Copyright (C) 2011 RiSK (sscrisk)
// 25.4.3.3 equal_range
template<typename ForwardIterator, typename T>
inline SPROUT_CONSTEXPR sprout::pair<ForwardIterator, ForwardIterator>
equal_range(ForwardIterator first, ForwardIterator last, T const& value) {
return {sprout::lower_bound(first, last, value), sprout::upper_bound(first, last, value)};
}
//
// recursion depth:
// [first, last) is RandomAccessIterator -> O(log N)
// otherwise -> O(N)
//
template<typename ForwardIterator, typename T, typename Compare>
inline SPROUT_CONSTEXPR pair<ForwardIterator, ForwardIterator>
equal_range(ForwardIterator first, ForwardIterator last, T const& value, Compare comp) {
return {sprout::lower_bound(first, last, value, comp), sprout::upper_bound(first, last, value, comp)};
}
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>()
);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_EQUAL_RANGE_HPP