File size: 6,533 Bytes
9897e20 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 | /*
*
* 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.
*/
#pragma once
// Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap.
template <class _RandomAccessIterator, class _Distance, class _Tp,
class _Compare>
inline void __push_heap(_RandomAccessIterator __first, _Distance __holeIndex,
_Distance __topIndex, _Tp __x, _Compare __comp) {
_Distance __parent = (__holeIndex - 1) / 2;
while (__holeIndex > __topIndex && __comp(*(__first + __parent), __x)) {
*(__first + __holeIndex) = *(__first + __parent);
__holeIndex = __parent;
__parent = (__holeIndex - 1) / 2;
}
*(__first + __holeIndex) = __x;
}
template <class _RandomAccessIterator, class _Compare>
inline void __push_heap_aux(_RandomAccessIterator __first,
_RandomAccessIterator __last, _Compare __comp) {
int hole_index = (__last - __first) - 1;
int top_index = 0;
__push_heap(__first, hole_index, top_index, *(__last - 1), __comp);
}
template <class _RandomAccessIterator, class _Compare>
inline void push_heap(_RandomAccessIterator __first,
_RandomAccessIterator __last, _Compare __comp) {
__push_heap_aux(__first, __last, __comp);
}
template <class _RandomAccessIterator, class _Distance, class _Tp>
void __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
_Distance __len, _Tp __x) {
_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, __x);
}
template <class _RandomAccessIterator, class _Tp>
inline void __pop_heap(_RandomAccessIterator __first,
_RandomAccessIterator __last,
_RandomAccessIterator __result, _Tp __x) {
*__result = *__first;
__adjust_heap(__first, 0, __last - __first, __x);
}
template <class _RandomAccessIterator>
inline void __pop_heap_aux(_RandomAccessIterator __first,
_RandomAccessIterator __last) {
__pop_heap(__first, __last - 1, __last - 1, *(__last - 1));
}
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 _Tp,
class _Compare>
void __adjust_heap(_RandomAccessIterator __first, _Distance __holeIndex,
_Distance __len, _Tp __x, _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, __x, __comp);
}
template <class _RandomAccessIterator, class _Tp, class _Compare>
inline void
__pop_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
_RandomAccessIterator __result, _Tp __x, _Compare __comp) {
*__result = *__first;
int hole_index = 0;
int len = __last - __first;
__adjust_heap(__first, hole_index, len, __x, __comp);
}
template <class _RandomAccessIterator, class _Compare>
inline void __pop_heap_aux(_RandomAccessIterator __first,
_RandomAccessIterator __last, _Compare __comp) {
__pop_heap(__first, __last - 1, __last - 1, *(__last - 1), __comp);
}
template <class _RandomAccessIterator, class _Compare>
inline void pop_heap(_RandomAccessIterator __first,
_RandomAccessIterator __last, _Compare __comp) {
__pop_heap_aux(__first, __last, __comp);
}
template <class _RandomAccessIterator>
void __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last) {
if (__last - __first < 2)
return;
int __len = __last - __first;
int __parent = (__len - 2) / 2;
while (true) {
__adjust_heap(__first, __parent, __len, *(__first + __parent));
if (__parent == 0)
return;
__parent--;
}
}
template <class _RandomAccessIterator, class _Compare>
void __make_heap(_RandomAccessIterator __first, _RandomAccessIterator __last,
_Compare __comp) {
if (__last - __first < 2)
return;
int __len = __last - __first;
int __parent = (__len - 2) / 2;
while (true) {
__adjust_heap(__first, __parent, __len, *(__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);
}
|