C++ young 程序库——y_algorithm_heap.hpp
2005-08-14 03:20
337 查看
文件位置：young/algoithm/y_algorithm_heap.hpp
/*
The young Library
Copyright (c) 2005 by 杨桓
Permission to use, copy, modify, distribute and sell this software for any
purpose is hereby granted without fee, provided that the above copyright
notice appear in all copies and that both that copyright notice and this
permission notice appear in supporting documentation.
The author make no representations about the suitability of this software
for any purpose. It is provided "as is" without express or implied warranty.
*/
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
#ifndef __MACRO_CPLUSPLUS_YOUNG_LIBRARY_ALGORITHM_HEAP_HEADER_FILE__
#define __MACRO_CPLUSPLUS_YOUNG_LIBRARY_ALGORITHM_HEAP_HEADER_FILE__
//-----------------------------------------------------------------------------
#include "../y_iterator.hpp"
//-----------------------------------------------------------------------------
__MACRO_CPLUSPLUS_YOUNG_LIBRARY_BEGIN_NAMESPACE__
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
template< typename RandomAccessIterator >
inline
void push_heap( RandomAccessIterator first, RandomAccessIterator last )
{
typedef typename iterator_traits<RandomAccessIterator>::value_type
value_t;
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
push_heap_aux( first, diff_t((last - first) - 1),
diff_t(0), value_t(*(last - 1)) );
}
template< typename RandomAccessIterator, typename Integer, typename T >
void push_heap_aux( RandomAccessIterator first, Integer holeIndex,
Integer topIndex, T value )
{
Integer parent = (holeIndex - 1) / 2;
//没有至根节点并且新值大于父节点时，向上调整插入点索引和父节点索引
while( (holeIndex > topIndex) && (*(first + parent) < value) )
{
*(first + holeIndex) = *(first + parent);
holeIndex = parent;
parent = (holeIndex - 1) / 2;
}
*(first + holeIndex) = value;
}
template< typename RandomAccessIterator, typename StrictWeakOrdering >
inline
void push_heap( RandomAccessIterator first, RandomAccessIterator last,
StrictWeakOrdering comp )
{
typedef typename iterator_traits<RandomAccessIterator>::value_type
value_t;
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
push_heap_aux( first, diff_t((last - first) - 1),
diff_t(0), value_t(*(last - 1)), comp );
}
template< typename RandomAccessIterator, typename Integer, typename T,
typename StrictWeakOrdering >
void push_heap_aux( RandomAccessIterator first, Integer holeIndex,
Integer topIndex, T value, StrictWeakOrdering comp )
{
Integer parent = (holeIndex - 1) / 2;
while( (holeIndex > topIndex) && comp(*(first + parent), value) )
{
*(first + holeIndex) = *(first + parent);
holeIndex = parent;
parent = (holeIndex - 1) / 2;
}
*(first + holeIndex) = value;
}
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
template< typename RandomAccessIterator >
inline
void pop_heap( RandomAccessIterator first, RandomAccessIterator last )
{
typedef typename iterator_traits<RandomAccessIterator>::value_type
value_t;
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
value_t value = *(last - 1); //要调整的值
*(last - 1) = *first; //被弹出的值
adjust_heap( first, diff_t(0), diff_t(last - 1 - first), value );
}
template< typename RandomAccessIterator, typename Integer, typename T >
void adjust_heap( RandomAccessIterator first, Integer holeIndex,
Integer len, T value )
{
Integer topIndex = holeIndex;
Integer secondChild = 2 * holeIndex + 2;
while( secondChild < len ) //未越界
{
//左、右子节点哪边更大，则从哪边向下调整
if( *(first + secondChild) < *(first + secondChild - 1) )
--secondChild;
*(first + holeIndex) = *(first + secondChild);
//调整洞节点和右子节点
holeIndex = secondChild;
secondChild = 2 * (secondChild + 1);
}
//尾节点为左子节点
if( secondChild == len )
{
*(first + holeIndex) = *(first + secondChild - 1);
holeIndex = secondChild - 1;
}
push_heap_aux( first, holeIndex, topIndex, value );
}
template< typename RandomAccessIterator, typename StrictWeakOrdering >
inline
void pop_heap( RandomAccessIterator first, RandomAccessIterator last,
StrictWeakOrdering comp )
{
typedef typename iterator_traits<RandomAccessIterator>::value_type
value_t;
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
value_t value = *(last - 1);
*(last - 1) = *first;
adjust_heap( first, diff_t(0), diff_t(last - 1 - first),
value, comp );
}
template< typename RandomAccessIterator, typename Integer, typename T,
typename StrictWeakOrdering >
void adjust_heap( RandomAccessIterator first, Integer holeIndex,
Integer len, T value, StrictWeakOrdering comp )
{
Integer topIndex = holeIndex;
Integer secondChild = 2 * holeIndex + 2;
while( secondChild < len )
{
if( comp( *(first + secondChild), *(first + secondChild - 1) ) )
--secondChild;
*(first + holeIndex) = *(first + secondChild);
holeIndex = secondChild;
secondChild = 2 * (secondChild + 1);
}
if( secondChild == len )
{
*(first + holeIndex) = *(first + secondChild - 1);
holeIndex = secondChild - 1;
}
push_heap_aux( first, holeIndex, topIndex, value, comp );
}
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
template< typename RandomAccessIterator >
void make_heap( RandomAccessIterator first, RandomAccessIterator last )
{
typedef typename iterator_traits<RandomAccessIterator>::value_type
value_t;
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
if( last - first < 2 )
return;
diff_t len = last - first;
diff_t holeIndex = (len - 2) / 2; //最后一个非树叶节点的索引
while(1)
{
adjust_heap( first, holeIndex, len, value_t(*(first + holeIndex)) );
if( holeIndex == 0 )
return;
--holeIndex;
}
}
template< typename RandomAccessIterator, typename StrictWeakOrdering >
void make_heap( RandomAccessIterator first, RandomAccessIterator last,
StrictWeakOrdering comp )
{
typedef typename iterator_traits<RandomAccessIterator>::value_type
value_t;
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
if( last - first < 2 )
return;
diff_t len = last - first;
diff_t holeIndex = (len - 2) / 2;
while(1)
{
adjust_heap( first, holeIndex, len, value_t(*(first + holeIndex)), comp );
if( holeIndex == 0 )
return;
--holeIndex;
}
}
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
template< typename RandomAccessIterator >
void sort_heap( RandomAccessIterator first, RandomAccessIterator last )
{
while( (last - first) > 1 )
{
pop_heap( first, last );
--last;
}
}
template< typename RandomAccessIterator, typename StrictWeakOrdering >
void sort_heap( RandomAccessIterator first, RandomAccessIterator last,
StrictWeakOrdering comp )
{
while( (last - first) > 1 )
{
pop_heap( first, last, comp );
--last;
}
}
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
template< typename RandomAccessIterator >
bool is_heap( RandomAccessIterator first, RandomAccessIterator last )
{
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
diff_t len = last - first;
if( len < 2 )
return true;
diff_t parent = 0;
for( diff_t child = 1; child < len; ++child )
{
if( *(first + parent) < *(first + child) )
return false;
if( child % 2 == 0 )
++parent;
}
return true;
}
template< typename RandomAccessIterator, typename StrictWeakOrdering >
bool is_heap( RandomAccessIterator first, RandomAccessIterator last,
StrictWeakOrdering comp )
{
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
diff_t len = last - first;
if( len < 2 )
return true;
diff_t parent = 0;
for( diff_t child = 1; child < len; ++child )
{
if( comp(*(first + parent), *(first + child)) )
return false;
if( child % 2 == 0 )
++parent;
}
return true;
}
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
__MACRO_CPLUSPLUS_YOUNG_LIBRARY_END_NAMESPACE__
#endif
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
/*
The young Library
Copyright (c) 2005 by 杨桓
Permission to use, copy, modify, distribute and sell this software for any
purpose is hereby granted without fee, provided that the above copyright
notice appear in all copies and that both that copyright notice and this
permission notice appear in supporting documentation.
The author make no representations about the suitability of this software
for any purpose. It is provided "as is" without express or implied warranty.
*/
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
#ifndef __MACRO_CPLUSPLUS_YOUNG_LIBRARY_ALGORITHM_HEAP_HEADER_FILE__
#define __MACRO_CPLUSPLUS_YOUNG_LIBRARY_ALGORITHM_HEAP_HEADER_FILE__
//-----------------------------------------------------------------------------
#include "../y_iterator.hpp"
//-----------------------------------------------------------------------------
__MACRO_CPLUSPLUS_YOUNG_LIBRARY_BEGIN_NAMESPACE__
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
template< typename RandomAccessIterator >
inline
void push_heap( RandomAccessIterator first, RandomAccessIterator last )
{
typedef typename iterator_traits<RandomAccessIterator>::value_type
value_t;
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
push_heap_aux( first, diff_t((last - first) - 1),
diff_t(0), value_t(*(last - 1)) );
}
template< typename RandomAccessIterator, typename Integer, typename T >
void push_heap_aux( RandomAccessIterator first, Integer holeIndex,
Integer topIndex, T value )
{
Integer parent = (holeIndex - 1) / 2;
//没有至根节点并且新值大于父节点时，向上调整插入点索引和父节点索引
while( (holeIndex > topIndex) && (*(first + parent) < value) )
{
*(first + holeIndex) = *(first + parent);
holeIndex = parent;
parent = (holeIndex - 1) / 2;
}
*(first + holeIndex) = value;
}
template< typename RandomAccessIterator, typename StrictWeakOrdering >
inline
void push_heap( RandomAccessIterator first, RandomAccessIterator last,
StrictWeakOrdering comp )
{
typedef typename iterator_traits<RandomAccessIterator>::value_type
value_t;
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
push_heap_aux( first, diff_t((last - first) - 1),
diff_t(0), value_t(*(last - 1)), comp );
}
template< typename RandomAccessIterator, typename Integer, typename T,
typename StrictWeakOrdering >
void push_heap_aux( RandomAccessIterator first, Integer holeIndex,
Integer topIndex, T value, StrictWeakOrdering comp )
{
Integer parent = (holeIndex - 1) / 2;
while( (holeIndex > topIndex) && comp(*(first + parent), value) )
{
*(first + holeIndex) = *(first + parent);
holeIndex = parent;
parent = (holeIndex - 1) / 2;
}
*(first + holeIndex) = value;
}
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
template< typename RandomAccessIterator >
inline
void pop_heap( RandomAccessIterator first, RandomAccessIterator last )
{
typedef typename iterator_traits<RandomAccessIterator>::value_type
value_t;
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
value_t value = *(last - 1); //要调整的值
*(last - 1) = *first; //被弹出的值
adjust_heap( first, diff_t(0), diff_t(last - 1 - first), value );
}
template< typename RandomAccessIterator, typename Integer, typename T >
void adjust_heap( RandomAccessIterator first, Integer holeIndex,
Integer len, T value )
{
Integer topIndex = holeIndex;
Integer secondChild = 2 * holeIndex + 2;
while( secondChild < len ) //未越界
{
//左、右子节点哪边更大，则从哪边向下调整
if( *(first + secondChild) < *(first + secondChild - 1) )
--secondChild;
*(first + holeIndex) = *(first + secondChild);
//调整洞节点和右子节点
holeIndex = secondChild;
secondChild = 2 * (secondChild + 1);
}
//尾节点为左子节点
if( secondChild == len )
{
*(first + holeIndex) = *(first + secondChild - 1);
holeIndex = secondChild - 1;
}
push_heap_aux( first, holeIndex, topIndex, value );
}
template< typename RandomAccessIterator, typename StrictWeakOrdering >
inline
void pop_heap( RandomAccessIterator first, RandomAccessIterator last,
StrictWeakOrdering comp )
{
typedef typename iterator_traits<RandomAccessIterator>::value_type
value_t;
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
value_t value = *(last - 1);
*(last - 1) = *first;
adjust_heap( first, diff_t(0), diff_t(last - 1 - first),
value, comp );
}
template< typename RandomAccessIterator, typename Integer, typename T,
typename StrictWeakOrdering >
void adjust_heap( RandomAccessIterator first, Integer holeIndex,
Integer len, T value, StrictWeakOrdering comp )
{
Integer topIndex = holeIndex;
Integer secondChild = 2 * holeIndex + 2;
while( secondChild < len )
{
if( comp( *(first + secondChild), *(first + secondChild - 1) ) )
--secondChild;
*(first + holeIndex) = *(first + secondChild);
holeIndex = secondChild;
secondChild = 2 * (secondChild + 1);
}
if( secondChild == len )
{
*(first + holeIndex) = *(first + secondChild - 1);
holeIndex = secondChild - 1;
}
push_heap_aux( first, holeIndex, topIndex, value, comp );
}
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
template< typename RandomAccessIterator >
void make_heap( RandomAccessIterator first, RandomAccessIterator last )
{
typedef typename iterator_traits<RandomAccessIterator>::value_type
value_t;
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
if( last - first < 2 )
return;
diff_t len = last - first;
diff_t holeIndex = (len - 2) / 2; //最后一个非树叶节点的索引
while(1)
{
adjust_heap( first, holeIndex, len, value_t(*(first + holeIndex)) );
if( holeIndex == 0 )
return;
--holeIndex;
}
}
template< typename RandomAccessIterator, typename StrictWeakOrdering >
void make_heap( RandomAccessIterator first, RandomAccessIterator last,
StrictWeakOrdering comp )
{
typedef typename iterator_traits<RandomAccessIterator>::value_type
value_t;
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
if( last - first < 2 )
return;
diff_t len = last - first;
diff_t holeIndex = (len - 2) / 2;
while(1)
{
adjust_heap( first, holeIndex, len, value_t(*(first + holeIndex)), comp );
if( holeIndex == 0 )
return;
--holeIndex;
}
}
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
template< typename RandomAccessIterator >
void sort_heap( RandomAccessIterator first, RandomAccessIterator last )
{
while( (last - first) > 1 )
{
pop_heap( first, last );
--last;
}
}
template< typename RandomAccessIterator, typename StrictWeakOrdering >
void sort_heap( RandomAccessIterator first, RandomAccessIterator last,
StrictWeakOrdering comp )
{
while( (last - first) > 1 )
{
pop_heap( first, last, comp );
--last;
}
}
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
template< typename RandomAccessIterator >
bool is_heap( RandomAccessIterator first, RandomAccessIterator last )
{
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
diff_t len = last - first;
if( len < 2 )
return true;
diff_t parent = 0;
for( diff_t child = 1; child < len; ++child )
{
if( *(first + parent) < *(first + child) )
return false;
if( child % 2 == 0 )
++parent;
}
return true;
}
template< typename RandomAccessIterator, typename StrictWeakOrdering >
bool is_heap( RandomAccessIterator first, RandomAccessIterator last,
StrictWeakOrdering comp )
{
typedef typename iterator_traits<RandomAccessIterator>::difference_type
diff_t;
diff_t len = last - first;
if( len < 2 )
return true;
diff_t parent = 0;
for( diff_t child = 1; child < len; ++child )
{
if( comp(*(first + parent), *(first + child)) )
return false;
if( child % 2 == 0 )
++parent;
}
return true;
}
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
__MACRO_CPLUSPLUS_YOUNG_LIBRARY_END_NAMESPACE__
#endif
//-----------------------------------------------------------------------------
//-----------------------------------------------------------------------------
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- C++ young 程序库——y_optm_string.hpp 和 y_string.hpp
- C++ young 程序库——y_algorithm.hpp
- C++ young 程序库——y_functional.hpp
- C++ young 程序库——y_set.hpp 和 y_map.hpp
- C++ young 程序库——y_allocator.hpp 、y_construct.hpp 和 y_exception.hpp
- C++ young 程序库——y_list.hpp
- C++ young 程序库——y_hash_set.hpp 和 y_hash_map.hpp
- C++ young 程序库——y_iterator.hpp 和 y_type_traits.hpp
- C++ young 程序库——y_slist.hpp
- C++ young 程序库——y_numeric.hpp
- C++ young 程序库——y_pair.hpp 和 y_initialization.hpp
- C++ young 程序库——y_algorithm_base.hpp、y_algorithm_compare.hpp、y_algorithm_copy.hpp、y_algorithm_fill.hpp、y_algorithm_lower_bound.hp
- C++ young 程序库——y_char_function.hpp 和 y_char_traits.hpp
- C++ young 程序库——y_queue.hpp 和 y_stack.hpp
- C++ young 程序库——y_hash_function.hpp、y_hash_table_base.hpp 和 y_hash_table.hpp
- heap stl 各类操作 http://www.cplusplus.com/reference/algorithm/push_heap/
- c++: Boost/algorithm/string.hpp 和 curl/curl.h 编译错误
- C++ young 程序库——y_vector.hpp
- heapq( Heap queue algorithm)库
- Introduction to Algorithm - Summary of Chapter 6 - Heapsort