mirror/Sprout
1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout.git synced 2024-12-23 21:25:49 +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
Show stats Download patch file Download diff file Expand all files Collapse all files

41
libs/algorithm/test/binary_search.cpp Normal file
View file

@ -0,0 +1,41 @@
#ifndef SPROUT_LIBS_ALGORITHM_TEST_BINARY_SEARCH_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_BINARY_SEARCH_CPP
#include <sprout/algorithm/binary_search.hpp>
#include <sprout/array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_binary_search_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 7, 7, 10}};
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::binary_search(
sprout::begin(arr1),
sprout::end(arr1),
7
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::binary_search(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
7,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(!result);
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_binary_search_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_BINARY_SEARCH_CPP

45
libs/algorithm/test/equal_range.cpp Normal file
View file

@ -0,0 +1,45 @@
#ifndef SPROUT_LIBS_ALGORITHM_TEST_EQUAL_RANGE_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_EQUAL_RANGE_CPP
#include <sprout/algorithm/equal_range.hpp>
#include <sprout/array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_equal_range_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 7, 7, 10}};
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::equal_range(
sprout::begin(arr1),
sprout::end(arr1),
7
);
TESTSPR_BOTH_ASSERT(found.first == sprout::begin(arr1) + 6);
TESTSPR_BOTH_ASSERT(found.second == sprout::begin(arr1) + 9);
TESTSPR_BOTH_ASSERT(found.second - found.first == 3);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::equal_range(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
7,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(found.first == sprout::begin(arr1) + 5);
TESTSPR_BOTH_ASSERT(found.second == sprout::begin(arr1) + 5);
TESTSPR_BOTH_ASSERT(found.second - found.first == 0);
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_equal_range_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_EQUAL_RANGE_CPP

2
libs/algorithm/test/find_first_of.cpp
View file

@ -12,7 +12,7 @@ namespace testspr {
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 3>{{4, 5, 6}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 3>{{11, 12 ,13}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 3>{{11, 12, 13}};
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::find_first_of(

103
libs/algorithm/test/includes.cpp Normal file
View file

@ -0,0 +1,103 @@
#ifndef SPROUT_LIBS_ALGORITHM_TEST_INCLUDES_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_INCLUDES_CPP
#include <sprout/algorithm/includes.hpp>
#include <sprout/array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_includes_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 8, 9, 10}};
SPROUT_STATIC_CONSTEXPR auto arr2 = array<int, 3>{{4, 5, 6}};
SPROUT_STATIC_CONSTEXPR auto arr3 = array<int, 3>{{1, 2, 12}};
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::includes(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr2),
sprout::end(arr2)
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::includes(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr3),
sprout::end(arr3)
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::includes(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
sprout::begin(arr2),
sprout::end(arr2)
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::includes(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
sprout::begin(arr3),
sprout::end(arr3)
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::includes(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr2),
sprout::end(arr2),
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::includes(
sprout::begin(arr1),
sprout::end(arr1),
sprout::begin(arr3),
sprout::end(arr3),
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::includes(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
sprout::begin(arr2),
sprout::end(arr2),
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(!result);
}
{
SPROUT_STATIC_CONSTEXPR auto result = sprout::includes(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
sprout::begin(arr3),
sprout::end(arr3),
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(!result);
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_includes_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_INCLUDES_CPP

41
libs/algorithm/test/lower_bound.cpp Normal file
View file

@ -0,0 +1,41 @@
#ifndef SPROUT_LIBS_ALGORITHM_TEST_LOWER_BOUND_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_LOWER_BOUND_CPP
#include <sprout/algorithm/lower_bound.hpp>
#include <sprout/array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_lower_bound_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 7, 7, 10}};
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::lower_bound(
sprout::begin(arr1),
sprout::end(arr1),
7
);
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 6);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::lower_bound(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
7,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_lower_bound_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_LOWER_BOUND_CPP

10
libs/algorithm/test/non_modifying.cpp
View file

@ -27,6 +27,11 @@
#include "./partition_point.cpp"
#include "./is_sorted.cpp"
#include "./is_sorted_until.cpp"
#include "./lower_bound.cpp"
#include "./upper_bound.cpp"
#include "./equal_range.cpp"
#include "./binary_search.cpp"
#include "./includes.cpp"
#ifdef TESTSPR_CPP_INCLUDE_DISABLE_SPROUT_LIBS_ALGORITHM_TEST_NON_MODIFYIING_CPP
# undef TESTSPR_CPP_INCLUDE
@ -55,6 +60,11 @@ namespace testspr {
testspr::algorithm_partition_point_test();
testspr::algorithm_is_sorted_test();
testspr::algorithm_is_sorted_until_test();
testspr::algorithm_lower_bound_test();
testspr::algorithm_upper_bound_test();
testspr::algorithm_equal_range_test();
testspr::algorithm_binary_search_test();
testspr::algorithm_includes_test();
}
} // namespace testspr

41
libs/algorithm/test/upper_bound.cpp Normal file
View file

@ -0,0 +1,41 @@
#ifndef SPROUT_LIBS_ALGORITHM_TEST_UPPER_BOUND_CPP
#define SPROUT_LIBS_ALGORITHM_TEST_UPPER_BOUND_CPP
#include <sprout/algorithm/upper_bound.hpp>
#include <sprout/array.hpp>
#include <sprout/container.hpp>
#include <testspr/tools.hpp>
namespace testspr {
static void algorithm_upper_bound_test() {
using namespace sprout;
{
SPROUT_STATIC_CONSTEXPR auto arr1 = array<int, 10>{{1, 2, 3, 4, 5, 6, 7, 7, 7, 10}};
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::upper_bound(
sprout::begin(arr1),
sprout::end(arr1),
7
);
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 9);
}
{
SPROUT_STATIC_CONSTEXPR auto found = sprout::upper_bound(
sprout::begin(arr1),
sprout::begin(arr1) + 5,
7,
testspr::less<int>()
);
TESTSPR_BOTH_ASSERT(found == sprout::begin(arr1) + 5);
}
}
}
} // namespace testspr
#ifndef TESTSPR_CPP_INCLUDE
# define TESTSPR_TEST_FUNCTION testspr::algorithm_upper_bound_test
# include <testspr/include_main.hpp>
#endif
#endif // #ifndef SPROUT_LIBS_ALGORITHM_TEST_UPPER_BOUND_CPP

48
sprout/algorithm/binary_search.hpp
View file

@ -2,37 +2,37 @@
#define SPROUT_ALGORITHM_BINARY_SEARCH_HPP
#include <sprout/config.hpp>
#include <sprout/iterator/operation.hpp>
#include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT
#include <sprout/algorithm/lower_bound.hpp>
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
namespace sprout {
// Copyright (C) 2011 RiSK (sscrisk)
namespace detail {
template<typename ForwardIterator, typename T, typename Compare>
inline SPROUT_CONSTEXPR bool
binary_search_impl(ForwardIterator first, ForwardIterator last, T const& value, Compare comp) {
return (first != last && !comp(value, *first));
}
} // namespace detail
// 25.4.3.4 binary_search
template<typename ForwardIterator, typename T>
inline SPROUT_CONSTEXPR bool
binary_search(ForwardIterator first, ForwardIterator last, T const& value) {
return first == last ? false
: sprout::next(first) == last ? !(*first < value) && !(value < *first) ? true : false
: *sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2) < value
? sprout::binary_search(sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2), last, value)
: value < *sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last)) / 2
? sprout::binary_search(first, sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2), value)
: true
;
}
//
// recursion depth:
// [first, last) is RandomAccessIterator -> O(log N)
// otherwise -> O(N)
//
template<typename ForwardIterator, typename T, typename Compare>
inline SPROUT_CONSTEXPR bool
binary_search(ForwardIterator first, ForwardIterator last, T const& value, Compare comp) {
return first == last ? false
: sprout::next(first) == last ? !comp(*first, value) && !comp(value, *first) ? true : false
: comp(*sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2), value)
? sprout::binary_search(sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2), last, value)
: comp(value, *sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last)) / 2)
? sprout::binary_search(first, sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2), value)
: true
;
return sprout::detail::binary_search_impl(sprout::lower_bound(first, last, value), last, value, comp);
}
template<typename ForwardIterator, typename T>
inline SPROUT_CONSTEXPR bool
binary_search(ForwardIterator first, ForwardIterator last, T const& value) {
return sprout::binary_search(
first, last, value,
NS_SSCRISK_CEL_OR_SPROUT::less<typename std::iterator_traits<ForwardIterator>::value_type>()
);
}
} // namespace sprout

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

97
sprout/algorithm/includes.hpp
View file

@ -1,33 +1,94 @@
#ifndef SPROUT_ALGORITHM_INCLUDES_HPP
#define SPROUT_ALGORITHM_INCLUDES_HPP
#include <iterator>
#include <sprout/config.hpp>
#include <sprout/iterator/operation.hpp>
#include <sprout/functional/less.hpp>
#include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT
namespace sprout {
// Copyright (C) 2011 RiSK (sscrisk)
namespace detail {
template<typename RandomAccessIterator1, typename RandomAccessIterator2, typename Compare>
inline SPROUT_CONSTEXPR RandomAccessIterator2
includes_impl_ra(
RandomAccessIterator1 first1, RandomAccessIterator1 last1, RandomAccessIterator2 first2, RandomAccessIterator2 last2, Compare comp,
typename std::iterator_traits<RandomAccessIterator1>::difference_type pivot
)
{
return first2 == last2 ? first2
: pivot == 0 ? (!comp(*first1, *first2) && !comp(*first2, *first1) ? sprout::next(first2) : first2)
: sprout::detail::includes_impl_ra(
sprout::next(first1, pivot), last1,
sprout::detail::includes_impl_ra(
first1, sprout::next(first1, pivot),
first2,
last2, comp,
pivot / 2
),
last2, comp,
(NS_SSCRISK_CEL_OR_SPROUT::distance(first1, last1) - pivot) / 2
)
;
}
template<typename RandomAccessIterator1, typename RandomAccessIterator2, typename Compare>
inline SPROUT_CONSTEXPR bool
includes(
RandomAccessIterator1 first1, RandomAccessIterator1 last1, RandomAccessIterator2 first2, RandomAccessIterator2 last2, Compare comp,
std::random_access_iterator_tag*
)
{
return first1 == last1 ? first2 == last2
: sprout::detail::includes_impl_ra(
first1, last1, first2, last2, comp,
NS_SSCRISK_CEL_OR_SPROUT::distance(first1, last1) / 2
)
== last2
;
}
// Copyright (C) 2011 RiSK (sscrisk)
template<typename InputIterator1, typename InputIterator2, typename Compare>
inline SPROUT_CONSTEXPR bool
includes_impl(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp) {
return first2 == last2 ? true
: first1 == last1 ? false
: !comp(*first1, *first2) && !comp(*first2, *first1)
? sprout::detail::includes_impl(sprout::next(first1), last1, sprout::next(first2), last2)
: sprout::detail::includes_impl(sprout::next(first1), last1, first2, last2)
;
}
template<typename InputIterator1, typename InputIterator2, typename Compare>
inline SPROUT_CONSTEXPR bool
includes(
InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp,
void*
)
{
return sprout::detail::includes_impl(first1, last1, first2, comp);
}
} //namespace detail
// 25.4.5.1 includes
template<typename InputIterator1, typename InputIterator2>
inline SPROUT_CONSTEXPR bool
includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2) {
return first2 == last2 ? true
: first1 == last1 ? false
: !(*first1 < *first2) && !(*first2 < *first1)
? sprout::includes(sprout::next(first1), last1, sprout::next(first2), last2)
: sprout::includes(sprout::next(first1), last1, first2, last2)
;
}
//
// recursion depth:
// [first, last) is RandomAccessIterator -> O(log N)
// otherwise -> O(N)
//
template<typename InputIterator1, typename InputIterator2, typename Compare>
inline SPROUT_CONSTEXPR bool
includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, Compare comp) {
return first2 == last2 ? true
: first1 == last1 ? false
: !comp(*first1, *first2) && !comp(*first2, *first1)
? sprout::includes(sprout::next(first1), last1, sprout::next(first2), last2)
: sprout::includes(sprout::next(first1), last1, first2, last2)
;
typedef typename std::iterator_traits<InputIterator1>::iterator_category* category;
return sprout::detail::includes(first1, last1, first2, last2, comp, category());
}
template<typename InputIterator1, typename InputIterator2>
inline SPROUT_CONSTEXPR bool
includes(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2) {
return sprout::includes(
first1, last1, first2, last2,
sprout::less<>()
);
}
} // namespace sprout

5
sprout/algorithm/is_sorted.hpp
View file

@ -56,6 +56,11 @@ namespace sprout {
} //namespace detail
// 25.4.1.5 is_sorted
//
// recursion depth:
// [first, last) is RandomAccessIterator -> O(log N)
// otherwise -> O(N)
//
template<typename ForwardIterator, typename Compare>
inline SPROUT_CONSTEXPR bool
is_sorted(ForwardIterator first, ForwardIterator last, Compare comp) {

5
sprout/algorithm/is_sorted_until.hpp
View file

@ -69,6 +69,11 @@ namespace sprout {
} //namespace detail
// 25.4.1.5 is_sorted
//
// recursion depth:
// [first, last) is RandomAccessIterator -> O(log N)
// otherwise -> O(N)
//
template<typename ForwardIterator, typename Compare>
inline SPROUT_CONSTEXPR ForwardIterator
is_sorted_until(ForwardIterator first, ForwardIterator last, Compare comp) {

27
sprout/algorithm/lower_bound.hpp
View file

@ -1,25 +1,21 @@
#ifndef SPROUT_ALGORITHM_LOWER_BOUND_HPP
#define SPROUT_ALGORITHM_LOWER_BOUND_HPP
#include <iterator>
#include <sprout/config.hpp>
#include <sprout/iterator/operation.hpp>
#include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
namespace sprout {
// Copyright (C) 2011 RiSK (sscrisk)
// 25.4.3.1 lower_bound
template<typename ForwardIterator, typename T>
inline SPROUT_CONSTEXPR ForwardIterator
lower_bound(ForwardIterator first, ForwardIterator last, T const& value) {
return first == last ? last
: sprout::next(first) == last ? *first < value ? last : first
: *sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2) < value
? sprout::lower_bound(sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2), last, value)
: sprout::lower_bound(first, sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2), value)
;
}
//
// recursion depth:
// [first, last) is RandomAccessIterator -> O(log N)
// otherwise -> O(N)
//
template<typename ForwardIterator, typename T, typename Compare>
inline SPROUT_CONSTEXPR ForwardIterator
lower_bound(ForwardIterator first, ForwardIterator last, T const& value, Compare comp) {
@ -30,6 +26,15 @@ namespace sprout {
: sprout::lower_bound(first, sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2), value, comp)
;
}
template<typename ForwardIterator, typename T>
inline SPROUT_CONSTEXPR ForwardIterator
lower_bound(ForwardIterator first, ForwardIterator last, T const& value) {
return sprout::lower_bound(
first, last, value,
NS_SSCRISK_CEL_OR_SPROUT::less<typename std::iterator_traits<ForwardIterator>::value_type>()
);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_LOWER_BOUND_HPP

27
sprout/algorithm/upper_bound.hpp
View file

@ -1,25 +1,21 @@
#ifndef SPROUT_ALGORITHM_UPPER_BOUND_HPP
#define SPROUT_ALGORITHM_UPPER_BOUND_HPP
#include <iterator>
#include <sprout/config.hpp>
#include <sprout/iterator/operation.hpp>
#include HDR_ITERATOR_SSCRISK_CEL_OR_SPROUT
#include HDR_FUNCTIONAL_SSCRISK_CEL_OR_SPROUT
namespace sprout {
// Copyright (C) 2011 RiSK (sscrisk)
// 25.4.3.2 upper_bound
template<typename ForwardIterator, typename T>
inline SPROUT_CONSTEXPR ForwardIterator
upper_bound(ForwardIterator first, ForwardIterator last, T const& value) {
return first == last ? last
: sprout::next(first) == last ? !(value < *first) ? last : first
: !(value < *sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2))
? upper_bound(sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2), last, value)
: sprout::upper_bound(first, sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2), value)
;
}
//
// recursion depth:
// [first, last) is RandomAccessIterator -> O(log N)
// otherwise -> O(N)
//
template<typename ForwardIterator, typename T, typename Compare>
inline SPROUT_CONSTEXPR ForwardIterator
upper_bound(ForwardIterator first, ForwardIterator last, T const& value, Compare comp) {
@ -30,6 +26,15 @@ namespace sprout {
: sprout::upper_bound(first, sprout::next(first, NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) / 2), value, comp)
;
}
template<typename ForwardIterator, typename T>
inline SPROUT_CONSTEXPR ForwardIterator
upper_bound(ForwardIterator first, ForwardIterator last, T const& value) {
return sprout::upper_bound(
first, last, value,
NS_SSCRISK_CEL_OR_SPROUT::less<typename std::iterator_traits<ForwardIterator>::value_type>()
);
}
} // namespace sprout
#endif // #ifndef SPROUT_ALGORITHM_UPPER_BOUND_HPP