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

完成make_heap

Browse Source
This commit is contained in:
邹晓航
2014-10-14 10:09:02 +08:00
parent b751d2ad4e
commit 88e63ddec2
1 changed files with 64 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

64
TinySTL/Algorithm.h
View File

@@ -66,6 +66,70 @@ namespace TinySTL{
const T& max(const T& a, const T& b, Compare comp){ const T& max(const T& a, const T& b, Compare comp){
return (copm(a, b)) ? b : a; return (copm(a, b)) ? b : a;
} }
//********** [make_heap] ***************
template<class RandomAccessIterator, class Compare>
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>
static void down(RandomAccessIterator first, RandomAccessIterator last, Compare comp){//[first, last]
if (first != last){
decltype(last - first) range = 1;
for (auto cur = first; cur < last;range = cur - first + 1){
auto child = first + (range * 2 - 1);//get the left child
if (child <= last){
if ((child + 1) <= last && *(child + 1) > *child)
child = child + 1;//right child
if (comp(*cur, *child))
TinySTL::swap(*cur, *child);
cur = child;
}
else
break;
}
}
}
template <class RandomAccessIterator>
void make_heap(RandomAccessIterator first, RandomAccessIterator last){
TinySTL::make_heap(first, last,
typename TinySTL::less<TinySTL::iterator_traits<RandomAccessIterator>::value_type>());
}
template <class RandomAccessIterator, class Compare>
void make_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp){
const auto range = last - first;
for (auto rait = first + range - 1; rait > first; --rait){
down(first, rait, comp);
}
}
//********* [push_heap] ***************
template <class RandomAccessIterator>
void push_heap(RandomAccessIterator first, RandomAccessIterator last);
template <class RandomAccessIterator, class Compare>
void push_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
//********* [pop_heap] ***************
template <class RandomAccessIterator>
void pop_heap(RandomAccessIterator first, RandomAccessIterator last);
template <class RandomAccessIterator, class Compare>
void pop_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
//********* [sort_heap] ***************
template <class RandomAccessIterator>
void sort_heap(RandomAccessIterator first, RandomAccessIterator last);
template <class RandomAccessIterator, class Compare>
void sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
//********* [is_heap] ***************
template <class RandomAccessIterator>
bool is_heap(RandomAccessIterator first, RandomAccessIterator last);
template <class RandomAccessIterator, class Compare>
bool is_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp);
} }
#endif #endif