bb84e66919
* Makefile.in (install): Some of HEADERS come from the stl dir now. * algorithm, deque, functional, iterator, list, map, memory, numeric, queue, set, stack, utility, vector: Now in stl dir. stl/: * algo.h, algobase.h, alloc.h, bvector.h, defalloc.h, deque.h, function.h, hash_map.h, hash_set.h, hashtable.h, heap.h, iterator.h, list.h, map.h, multimap.h, multiset.h, pair.h, pthread_alloc.h, rope.h, ropeimpl.h, set.h, slist.h, stack.h, stl_config.h, tempbuf.h, tree.h, type_traits.h, vector.h: Update to October 27 SGI snapshot. * algorithm, deque, functional, hash_map, hash_set, iterator, list, map, memory, numeric, pthread_alloc, queue, rope, set, slist, stack, stl_algo.h, stl_algobase.h, stl_alloc.h, stl_bvector.h, stl_construct.h, stl_deque.h, stl_function.h, stl_hash_fun.h, stl_hash_map.h, stl_hash_set.h, stl_hashtable.h, stl_heap.h, stl_iterator.h, stl_list.h, stl_map.h, stl_multimap.h, stl_multiset.h, stl_numeric.h, stl_pair.h, stl_queue.h, stl_raw_storage_iter.h, stl_relops.h, stl_rope.h, stl_set.h, stl_slist.h, stl_stack.h, stl_tempbuf.h, stl_tree.h, stl_uninitialized.h, stl_vector.h, utility, vector: New files in October 27 SGI snapshot. From-SVN: r16277
227 lines
8.0 KiB
C++
227 lines
8.0 KiB
C++
/*
|
|
*
|
|
* Copyright (c) 1994
|
|
* Hewlett-Packard Company
|
|
*
|
|
* Permission to use, copy, modify, distribute and sell this software
|
|
* and its documentation 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. Hewlett-Packard Company makes no
|
|
* representations about the suitability of this software for any
|
|
* purpose. It is provided "as is" without express or implied warranty.
|
|
*
|
|
* Copyright (c) 1997
|
|
* Silicon Graphics Computer Systems, Inc.
|
|
*
|
|
* Permission to use, copy, modify, distribute and sell this software
|
|
* and its documentation 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. Silicon Graphics makes no
|
|
* representations about the suitability of this software for any
|
|
* purpose. It is provided "as is" without express or implied warranty.
|
|
*/
|
|
|
|
/* NOTE: This is an internal header file, included by other STL headers.
|
|
* You should not attempt to use it directly.
|
|
*/
|
|
|
|
#ifndef __SGI_STL_INTERNAL_HEAP_H
|
|
#define __SGI_STL_INTERNAL_HEAP_H
|
|
|
|
__STL_BEGIN_NAMESPACE
|
|
|
|
#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)
|
|
#pragma set woff 1209
|
|
#endif
|
|
|
|
template <class RandomAccessIterator, class Distance, class T>
|
|
void __push_heap(RandomAccessIterator first, Distance holeIndex,
|
|
Distance topIndex, T value) {
|
|
Distance parent = (holeIndex - 1) / 2;
|
|
while (holeIndex > topIndex && *(first + parent) < value) {
|
|
*(first + holeIndex) = *(first + parent);
|
|
holeIndex = parent;
|
|
parent = (holeIndex - 1) / 2;
|
|
}
|
|
*(first + holeIndex) = value;
|
|
}
|
|
|
|
template <class RandomAccessIterator, class Distance, class T>
|
|
inline void __push_heap_aux(RandomAccessIterator first,
|
|
RandomAccessIterator last, Distance*, T*) {
|
|
__push_heap(first, Distance((last - first) - 1), Distance(0),
|
|
T(*(last - 1)));
|
|
}
|
|
|
|
template <class RandomAccessIterator>
|
|
inline void push_heap(RandomAccessIterator first, RandomAccessIterator last) {
|
|
__push_heap_aux(first, last, distance_type(first), value_type(first));
|
|
}
|
|
|
|
template <class RandomAccessIterator, class Distance, class T, class Compare>
|
|
void __push_heap(RandomAccessIterator first, Distance holeIndex,
|
|
Distance topIndex, T value, Compare comp) {
|
|
Distance 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 <class RandomAccessIterator, class Compare, class Distance, class T>
|
|
inline void __push_heap_aux(RandomAccessIterator first,
|
|
RandomAccessIterator last, Compare comp,
|
|
Distance*, T*) {
|
|
__push_heap(first, Distance((last - first) - 1), Distance(0),
|
|
T(*(last - 1)), comp);
|
|
}
|
|
|
|
template <class RandomAccessIterator, class Compare>
|
|
inline void push_heap(RandomAccessIterator first, RandomAccessIterator last,
|
|
Compare comp) {
|
|
__push_heap_aux(first, last, comp, distance_type(first), value_type(first));
|
|
}
|
|
|
|
template <class RandomAccessIterator, class Distance, class T>
|
|
void __adjust_heap(RandomAccessIterator first, Distance holeIndex,
|
|
Distance len, T value) {
|
|
Distance topIndex = holeIndex;
|
|
Distance 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(first, holeIndex, topIndex, value);
|
|
}
|
|
|
|
template <class RandomAccessIterator, class T, class Distance>
|
|
inline void __pop_heap(RandomAccessIterator first, RandomAccessIterator last,
|
|
RandomAccessIterator result, T value, Distance*) {
|
|
*result = *first;
|
|
__adjust_heap(first, Distance(0), Distance(last - first), value);
|
|
}
|
|
|
|
template <class RandomAccessIterator, class T>
|
|
inline void __pop_heap_aux(RandomAccessIterator first,
|
|
RandomAccessIterator last, T*) {
|
|
__pop_heap(first, last - 1, last - 1, T(*(last - 1)), distance_type(first));
|
|
}
|
|
|
|
template <class RandomAccessIterator>
|
|
inline void pop_heap(RandomAccessIterator first, RandomAccessIterator last) {
|
|
__pop_heap_aux(first, last, value_type(first));
|
|
}
|
|
|
|
template <class RandomAccessIterator, class Distance, class T, class Compare>
|
|
void __adjust_heap(RandomAccessIterator first, Distance holeIndex,
|
|
Distance len, T value, Compare comp) {
|
|
Distance topIndex = holeIndex;
|
|
Distance 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(first, holeIndex, topIndex, value, comp);
|
|
}
|
|
|
|
template <class RandomAccessIterator, class T, class Compare, class Distance>
|
|
inline void __pop_heap(RandomAccessIterator first, RandomAccessIterator last,
|
|
RandomAccessIterator result, T value, Compare comp,
|
|
Distance*) {
|
|
*result = *first;
|
|
__adjust_heap(first, Distance(0), Distance(last - first), value, comp);
|
|
}
|
|
|
|
template <class RandomAccessIterator, class T, class Compare>
|
|
inline void __pop_heap_aux(RandomAccessIterator first,
|
|
RandomAccessIterator last, T*, Compare comp) {
|
|
__pop_heap(first, last - 1, last - 1, T(*(last - 1)), comp,
|
|
distance_type(first));
|
|
}
|
|
|
|
template <class RandomAccessIterator, class Compare>
|
|
inline void pop_heap(RandomAccessIterator first, RandomAccessIterator last,
|
|
Compare comp) {
|
|
__pop_heap_aux(first, last, value_type(first), comp);
|
|
}
|
|
|
|
template <class RandomAccessIterator, class T, class Distance>
|
|
void __make_heap(RandomAccessIterator first, RandomAccessIterator last, T*,
|
|
Distance*) {
|
|
if (last - first < 2) return;
|
|
Distance len = last - first;
|
|
Distance parent = (len - 2)/2;
|
|
|
|
while (true) {
|
|
__adjust_heap(first, parent, len, T(*(first + parent)));
|
|
if (parent == 0) return;
|
|
parent--;
|
|
}
|
|
}
|
|
|
|
template <class RandomAccessIterator>
|
|
inline void make_heap(RandomAccessIterator first, RandomAccessIterator last) {
|
|
__make_heap(first, last, value_type(first), distance_type(first));
|
|
}
|
|
|
|
template <class RandomAccessIterator, class Compare, class T, class Distance>
|
|
void __make_heap(RandomAccessIterator first, RandomAccessIterator last,
|
|
Compare comp, T*, Distance*) {
|
|
if (last - first < 2) return;
|
|
Distance len = last - first;
|
|
Distance parent = (len - 2)/2;
|
|
|
|
while (true) {
|
|
__adjust_heap(first, parent, len, T(*(first + parent)), comp);
|
|
if (parent == 0) return;
|
|
parent--;
|
|
}
|
|
}
|
|
|
|
template <class RandomAccessIterator, class Compare>
|
|
inline void make_heap(RandomAccessIterator first, RandomAccessIterator last,
|
|
Compare comp) {
|
|
__make_heap(first, last, comp, value_type(first), distance_type(first));
|
|
}
|
|
|
|
template <class RandomAccessIterator>
|
|
void sort_heap(RandomAccessIterator first, RandomAccessIterator last) {
|
|
while (last - first > 1) pop_heap(first, last--);
|
|
}
|
|
|
|
template <class RandomAccessIterator, class Compare>
|
|
void sort_heap(RandomAccessIterator first, RandomAccessIterator last,
|
|
Compare comp) {
|
|
while (last - first > 1) pop_heap(first, last--, comp);
|
|
}
|
|
|
|
#if defined(__sgi) && !defined(__GNUC__) && (_MIPS_SIM != _MIPS_SIM_ABI32)
|
|
#pragma reset woff 1209
|
|
#endif
|
|
|
|
__STL_END_NAMESPACE
|
|
|
|
#endif /* __SGI_STL_INTERNAL_HEAP_H */
|
|
|
|
// Local Variables:
|
|
// mode:C++
|
|
// End:
|