1
0
Fork 0
mirror of https://github.com/bolero-MURAKAMI/Sprout synced 2024-12-03 21:15:42 +00:00
Sprout/sprout/range/algorithm/lower_bound.hpp

72 lines
2.3 KiB
C++
Raw Normal View History

2012-04-04 08:48:02 +00:00
#ifndef SPROUT_RANGE_ALGORITHM_LOWER_BOUND_HPP
#define SPROUT_RANGE_ALGORITHM_LOWER_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/lower_bound.hpp>
namespace sprout {
namespace range {
// Copyright (C) 2011 RiSK (sscrisk)
// 25.4.3.1 lower_bound
template<typename Range, typename T>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<Range>::type
2012-04-04 08:48:02 +00:00
lower_bound(Range&& range, T const& value) {
return sprout::range::range_return<Range>::pack(
sprout::lower_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>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<Range>::type
2012-04-04 08:48:02 +00:00
lower_bound(Range&& range, T const& value, Compare comp) {
return sprout::range::range_return<Range>::pack(
sprout::lower_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>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<Range, RetV>::type
2012-04-04 08:48:02 +00:00
lower_bound(Range&& range, T const& value) {
return sprout::range::range_return<Range, RetV>::pack(
sprout::lower_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>
inline SPROUT_CONSTEXPR typename sprout::range::range_return<Range, RetV>::type
2012-04-04 08:48:02 +00:00
lower_bound(Range&& range, T const& value, Compare comp) {
return sprout::range::range_return<Range, RetV>::pack(
sprout::lower_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_LOWER_BOUND_HPP