steven/TinySTL
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

完成pop_heap

Browse Source
This commit is contained in:
邹晓航
2014-10-14 16:19:07 +08:00
parent e4b93ed49c
commit 023dd3a212
1 changed files with 22 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

37
TinySTL/Algorithm.h
View File

@@ -73,19 +73,19 @@ namespace TinySTL{
}
//********** [make_heap] ***************
//********* [Algorithm Complexity: O(N)] ****************
template<class RandomAccessIterator, class Compare>
//heap<61><70><EFBFBD><EFBFBD><EFBFBD>㷨
static void up(RandomAccessIterator first, RandomAccessIterator last, Compare comp){//[first, last]
if (first != last){
auto range = last - first + 1;
for (auto cur = last; rait > first; range /= 2){
auto parent = first + (range / 2 - 1);
if (comp(*parent, *cur))
TinySTL::swap(*parent, *cur);
cur = parent;
}
}
}
//template<class RandomAccessIterator, class Compare>
////heap<61><70><EFBFBD><EFBFBD><EFBFBD>㷨
//static void up(RandomAccessIterator first, RandomAccessIterator last, Compare comp){//[first, last]
// if (first != last){
// auto range = last - first + 1;
// for (auto cur = last; rait > first; range /= 2){
// auto parent = first + (range / 2 - 1);
// if (comp(*parent, *cur))
// TinySTL::swap(*parent, *cur);
// cur = parent;
// }
// }
//}
template<class RandomAccessIterator, class Compare>
//heap<61>½<EFBFBD><C2BD>㷨
static void down(RandomAccessIterator first, RandomAccessIterator last,
@@ -125,9 +125,16 @@ namespace TinySTL{
void push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
//********* [pop_heap] ***************
template <class RandomAccessIterator>
void pop_heap(RandomAccessIterator first, RandomAccessIterator last);
void pop_heap(RandomAccessIterator first, RandomAccessIterator last){
TinySTL::pop_heap(first, last,
TinySTL::less<typename TinySTL::iterator_traits<RandomAccessIterator>::value_type>());
}
template <class RandomAccessIterator, class Compare>
void pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
void pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp){
TinySTL::swap(*first, *(last - 1));
if (last - first >= 2)
down(first, last - 2, first, comp);
}
//********* [sort_heap] ***************
template <class RandomAccessIterator>
void sort_heap(RandomAccessIterator first, RandomAccessIterator last);