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 inline

Browse source 
add container/indexes.hpp
add tuple/indexes.hpp
This commit is contained in:
bolero-MURAKAMI 2012-04-04 22:23:41 +09:00
parent ba6482d1ec
commit c6bd230ee4
340 changed files with 1087 additions and 979 deletions
Download patch file Download diff file Expand all files Collapse all files

6
sprout/algorithm/is_heap_until.hpp
View file

@ -12,7 +12,7 @@ namespace sprout {
namespace detail {
template<typename RandomAccessIterator, typename Compare>
SPROUT_CONSTEXPR RandomAccessIterator is_heap_until_impl(
inline SPROUT_CONSTEXPR RandomAccessIterator is_heap_until_impl(
RandomAccessIterator first,
RandomAccessIterator last,
Compare comp,
@ -27,12 +27,12 @@ namespace sprout {
// 25.4.6.5 is_heap
template<typename RandomAccessIterator>
SPROUT_CONSTEXPR RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessIterator last) {
inline SPROUT_CONSTEXPR RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessIterator last) {
return sprout::is_heap_until(first, last, NS_SSCRISK_CEL_OR_SPROUT::less<decltype(*first)>());
}
template<typename RandomAccessIterator, typename Compare>
SPROUT_CONSTEXPR RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessIterator last, Compare comp) {
inline SPROUT_CONSTEXPR RandomAccessIterator is_heap_until(RandomAccessIterator first, RandomAccessIterator last, Compare comp) {
return NS_SSCRISK_CEL_OR_SPROUT::distance(first, last) < 2 ? last : sprout::detail::is_heap_until_impl(first, last, comp, 1);
}
} // namespace sprout