maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

[libc++] [NFC] Remove an unused parameter from `__sift_down`. 

Differential Revision: https://reviews.llvm.org/D116382
This commit is contained in:
Arthur O'Dwyer 2021-12-29 14:17:26 -05:00
parent f24dff357b
commit 928852f156
5 changed files with 6 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
libcxx/include/__algorithm/make_heap.h
View File

@ -32,7 +32,7 @@ __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compar
// start from the first parent, there is no need to consider children
for (difference_type __start = (__n - 2) / 2; __start >= 0; --__start)
{
_VSTD::__sift_down<_Compare>(__first, __last, __comp, __n, __first + __start);
_VSTD::__sift_down<_Compare>(__first, __comp, __n, __first + __start);
}
}
}

2
libcxx/include/__algorithm/partial_sort.h
View File

@ -40,7 +40,7 @@ __partial_sort(_RandomAccessIterator __first, _RandomAccessIterator __middle, _R
if (__comp(*__i, *__first))
{
swap(*__i, *__first);
_VSTD::__sift_down<_Compare>(__first, __middle, __comp, __len, __first);
_VSTD::__sift_down<_Compare>(__first, __comp, __len, __first);
}
}
_VSTD::__sort_heap<_Compare>(__first, __middle, __comp);

2
libcxx/include/__algorithm/partial_sort_copy.h
View File

@ -40,7 +40,7 @@ __partial_sort_copy(_InputIterator __first, _InputIterator __last,
if (__comp(*__first, *__result_first))
{
*__result_first = *__first;
_VSTD::__sift_down<_Compare>(__result_first, __r, __comp, __len, __result_first);
_VSTD::__sift_down<_Compare>(__result_first, __comp, __len, __result_first);
}
_VSTD::__sort_heap<_Compare>(__result_first, __r, __comp);
}

2
libcxx/include/__algorithm/pop_heap.h
View File

@ -31,7 +31,7 @@ __pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last, _Compare
if (__len > 1)
{
swap(*__first, *--__last);
_VSTD::__sift_down<_Compare>(__first, __last, __comp, __len - 1, __first);
_VSTD::__sift_down<_Compare>(__first, __comp, __len - 1, __first);
}
}

5
libcxx/include/__algorithm/sift_down.h
View File

@ -21,8 +21,7 @@ _LIBCPP_BEGIN_NAMESPACE_STD
template <class _Compare, class _RandomAccessIterator>
_LIBCPP_CONSTEXPR_AFTER_CXX11 void
__sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/,
_Compare __comp,
__sift_down(_RandomAccessIterator __first, _Compare __comp,
typename iterator_traits<_RandomAccessIterator>::difference_type __len,
_RandomAccessIterator __start)
{
@ -46,7 +45,7 @@ __sift_down(_RandomAccessIterator __first, _RandomAccessIterator /*__last*/,
// check if we are in heap-order
if (__comp(*__child_i, *__start))
// we are, __start is larger than it's largest child
// we are, __start is larger than its largest child
return;
value_type __top(_VSTD::move(*__start));