mirror of
https://github.com/bolero-MURAKAMI/Sprout.git
synced 2025-07-06 14:24:09 +00:00
porting cel/range/algoritm.hpp
This commit is contained in:
parent
cf593ffeff
commit
ba6482d1ec
51 changed files with 1908 additions and 116 deletions
71
sprout/range/algorithm/upper_bound.hpp
Normal file
71
sprout/range/algorithm/upper_bound.hpp
Normal file
|
@ -0,0 +1,71 @@
|
|||
#ifndef SPROUT_RANGE_ALGORITHM_UPPER_BOUND_HPP
|
||||
#define SPROUT_RANGE_ALGORITHM_UPPER_BOUND_HPP
|
||||
|
||||
#include <sprout/config.hpp>
|
||||
#include <sprout/container/functions.hpp>
|
||||
#include <sprout/utility/operation.hpp>
|
||||
#include <sprout/range/range_return.hpp>
|
||||
#include <sprout/algorithm/upper_bound.hpp>
|
||||
|
||||
namespace sprout {
|
||||
namespace range {
|
||||
// Copyright (C) 2011 RiSK (sscrisk)
|
||||
|
||||
// 25.4.3.2 upper_bound
|
||||
template<typename Range, typename T>
|
||||
SPROUT_CONSTEXPR typename sprout::range::range_return<Range>::type
|
||||
upper_bound(Range&& range, T const& value) {
|
||||
return sprout::range::range_return<Range>::pack(
|
||||
sprout::upper_bound(
|
||||
sprout::begin(sprout::forward<Range>(range)),
|
||||
sprout::end(sprout::forward<Range>(range)),
|
||||
value
|
||||
),
|
||||
sprout::forward<Range>(range)
|
||||
);
|
||||
}
|
||||
|
||||
template<typename Range, typename T, typename Compare>
|
||||
SPROUT_CONSTEXPR typename sprout::range::range_return<Range>::type
|
||||
upper_bound(Range&& range, T const& value, Compare comp) {
|
||||
return sprout::range::range_return<Range>::pack(
|
||||
sprout::upper_bound(
|
||||
sprout::begin(sprout::forward<Range>(range)),
|
||||
sprout::end(sprout::forward<Range>(range)),
|
||||
value,
|
||||
comp
|
||||
),
|
||||
sprout::forward<Range>(range)
|
||||
);
|
||||
}
|
||||
|
||||
template<sprout::range::range_return_value RetV, typename Range, typename T>
|
||||
SPROUT_CONSTEXPR typename sprout::range::range_return<Range, RetV>::type
|
||||
upper_bound(Range&& range, T const& value) {
|
||||
return sprout::range::range_return<Range, RetV>::pack(
|
||||
sprout::upper_bound(
|
||||
sprout::begin(sprout::forward<Range>(range)),
|
||||
sprout::end(sprout::forward<Range>(range)),
|
||||
value
|
||||
),
|
||||
sprout::forward<Range>(range)
|
||||
);
|
||||
}
|
||||
|
||||
template<sprout::range::range_return_value RetV, typename Range, typename T, typename Compare>
|
||||
SPROUT_CONSTEXPR typename sprout::range::range_return<Range, RetV>::type
|
||||
upper_bound(Range&& range, T const& value, Compare comp) {
|
||||
return sprout::range::range_return<Range, RetV>::pack(
|
||||
sprout::upper_bound(
|
||||
sprout::begin(sprout::forward<Range>(range)),
|
||||
sprout::end(sprout::forward<Range>(range)),
|
||||
value,
|
||||
comp
|
||||
),
|
||||
sprout::forward<Range>(range)
|
||||
);
|
||||
}
|
||||
} // namespace range
|
||||
} // namespace sprout
|
||||
|
||||
#endif // #ifndef SPROUT_RANGE_ALGORITHM_UPPER_BOUND_HPP
|
Loading…
Add table
Add a link
Reference in a new issue