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 coding-style

Browse source
This commit is contained in:
bolero-MURAKAMI 2012-10-06 13:53:07 +09:00
parent df3023db30
commit 5ce2cb023c
196 changed files with 1180 additions and 1787 deletions
Download patch file Download diff file Expand all files Collapse all files

17
sprout/algorithm/is_heap_until.hpp
View file

@ -12,10 +12,9 @@ namespace sprout {
namespace detail {
template<typename RandomAccessIterator, typename Compare>
inline SPROUT_CONSTEXPR RandomAccessIterator is_heap_until_impl(
RandomAccessIterator first,
RandomAccessIterator last,
Compare comp,
inline SPROUT_CONSTEXPR RandomAccessIterator
is_heap_until_impl(
RandomAccessIterator first, RandomAccessIterator last, Compare comp,
std::size_t n
)
{
@ -27,13 +26,17 @@ namespace sprout {
// 25.4.6.5 is_heap
template<typename RandomAccessIterator>
inline 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>
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);
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