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

完成sort_heap

Browse Source
This commit is contained in:
邹晓航
2014-10-14 16:48:33 +08:00
parent 1a75d215af
commit fb63e5155b
1 changed files with 9 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files

11
TinySTL/Algorithm.h
View File

@@ -144,9 +144,16 @@ namespace TinySTL{
} }
//********* [sort_heap] *************** //********* [sort_heap] ***************
template <class RandomAccessIterator> template <class RandomAccessIterator>
void sort_heap(RandomAccessIterator first, RandomAccessIterator last); void sort_heap(RandomAccessIterator first, RandomAccessIterator last){
return TinySTL::sort_heap(first, last,
TinySTL::less<typename TinySTL::iterator_traits<RandomAccessIterator>::value_type>());
}
template <class RandomAccessIterator, class Compare> template <class RandomAccessIterator, class Compare>
void sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp); void sort_heap(RandomAccessIterator first, RandomAccessIterator last, Compare comp){
for (auto cur = last; cur != first; --cur){
TinySTL::pop_heap(first, cur, comp);
}
}
//********* [is_heap] *************** //********* [is_heap] ***************
template <class RandomAccessIterator> template <class RandomAccessIterator>
bool is_heap(RandomAccessIterator first, RandomAccessIterator last){ bool is_heap(RandomAccessIterator first, RandomAccessIterator last){