-
Notifications
You must be signed in to change notification settings - Fork 0
/
mystl_heap.hpp
206 lines (181 loc) · 7.29 KB
/
mystl_heap.hpp
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
194
195
196
197
198
199
200
201
202
203
204
205
206
#ifndef _MYSTL_HEAP_H
#define _MYSTL_HEAP_H
#include "mystl_iterator_base.hpp"
namespace numb {
// Heap-manipulation functions: push_heap, pop_heap, make_heap, sort_heap
template <typename _RandomAccessIterator, typename _Distance, typename _Tp>
void _Push_heap(_RandomAccessIterator _first, _Distance _holeIndex,
_Distance _topIndex, _Tp _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 <typename _RandomAccessIterator>
inline void Push_heap(_RandomAccessIterator _first,
_RandomAccessIterator _last) {
typedef typename Iterator_traits<_RandomAccessIterator>::value_type
_ValueType;
typedef typename Iterator_traits<_RandomAccessIterator>::difference_type
_DistanceType;
_ValueType _value = *(_last - 1);
_Push_heap(_first, _DistanceType((_last - _first) - 1), _DistanceType(0),
_value);
}
template <typename _RandomAccessIterator, typename _Distance, typename _Tp,
typename _Compare>
void _Push_heap(_RandomAccessIterator _first, _Distance _holeIndex,
_Distance _topIndex, _Tp _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 <typename _RandomAccessIterator, typename _Compare>
inline void Push_heap(_RandomAccessIterator _first, _RandomAccessIterator _last,
_Compare _comp) {
typedef typename Iterator_traits<_RandomAccessIterator>::value_type
_ValueType;
typedef typename Iterator_traits<_RandomAccessIterator>::difference_type
_DistanceType;
_ValueType _value = *(_last - 1);
_Push_heap(_first, _DistanceType((_last - _first) - 1), _DistanceType(0),
_value, _comp);
}
template <typename _RandomAccessIterator, typename _Distance, typename _Tp>
void _Adjust_heap(_RandomAccessIterator _first, _Distance _holeIndex,
_Distance _len, _Tp _value) {
const _Distance _topIndex = _holeIndex;
_Distance _secondChild = _holeIndex;
while (_secondChild < (_len - 1) / 2) {
_secondChild = 2 * (_secondChild + 1);
if (*(_first + _secondChild) < *(_first + (_secondChild - 1)))
_secondChild--;
*(_first + _holeIndex) = *(_first + _secondChild);
_holeIndex = _secondChild;
}
if ((_len & 1) == 0 && _secondChild == (_len - 2) / 2) {
_secondChild = 2 * (_secondChild + 1);
*(_first + _holeIndex) = *(_first + (_secondChild - 1));
_holeIndex = _secondChild - 1;
}
_Push_heap(_first, _holeIndex, _topIndex, _value);
}
template <typename _RandomAccessIterator>
inline void _Pop_heap(_RandomAccessIterator _first, _RandomAccessIterator _last,
_RandomAccessIterator _result) {
typedef typename Iterator_traits<_RandomAccessIterator>::value_type
_ValueType;
typedef typename Iterator_traits<_RandomAccessIterator>::difference_type
_DistanceType;
_ValueType _value = *_result;
*_result = *_first;
_Adjust_heap(_first, _DistanceType(0), _DistanceType(_last - _first),
_value);
}
template <typename _RandomAccessIterator>
inline void Pop_heap(_RandomAccessIterator _first,
_RandomAccessIterator _last) {
typedef typename Iterator_traits<_RandomAccessIterator>::value_type
_ValueType;
if (_last - _first > 1) {
--_last;
_Pop_heap(_first, _last, _last);
}
}
template <typename _RandomAccessIterator, typename _Distance, typename _Tp,
typename _Compare>
void _Adjust_heap(_RandomAccessIterator _first, _Distance _holeIndex,
_Distance _len, _Tp _value, _Compare _comp) {
const _Distance _topIndex = _holeIndex;
_Distance _secondChild = _holeIndex;
while (_secondChild < (_len - 1) / 2) {
_secondChild = 2 * (_secondChild + 1);
if (_comp(*(_first + _secondChild), *(_first + (_secondChild - 1))))
_secondChild--;
*(_first + _holeIndex) = *(_first + _secondChild);
_holeIndex = _secondChild;
}
if ((_len & 1) == 0 && _secondChild == (_len - 2) / 2) {
_secondChild = 2 * (_secondChild + 1);
*(_first + _holeIndex) = *(_first + (_secondChild - 1));
_holeIndex = _secondChild - 1;
}
_Push_heap(_first, _holeIndex, _topIndex, _value, _comp);
}
template <typename _RandomAccessIterator, typename _Compare>
inline void _Pop_heap(_RandomAccessIterator _first, _RandomAccessIterator _last,
_RandomAccessIterator _result, _Compare _comp) {
typedef typename Iterator_traits<_RandomAccessIterator>::value_type
_ValueType;
typedef typename Iterator_traits<_RandomAccessIterator>::difference_type
_DistanceType;
_ValueType _value = *_result;
*_result = *_first;
_Adjust_heap(_first, _DistanceType(0), _DistanceType(_last - _first),
_value, _comp);
}
template <typename _RandomAccessIterator, typename _Compare>
inline void Pop_heap(_RandomAccessIterator _first, _RandomAccessIterator _last,
_Compare _comp) {
if (_last - _first > 1) {
--_last;
_Pop_heap(_first, _last, _last, _comp);
}
}
template <typename _RandomAccessIterator>
void Make_heap(_RandomAccessIterator _first, _RandomAccessIterator _last) {
typedef typename Iterator_traits<_RandomAccessIterator>::value_type
_ValueType;
typedef typename Iterator_traits<_RandomAccessIterator>::difference_type
_DistanceType;
if (_last - _first < 2) return;
const _DistanceType _len = _last - _first;
_DistanceType _parent = (_len - 2) / 2;
while (true) {
_ValueType _value = *(_first + _parent);
_Adjust_heap(_first, _parent, _len, _value);
if (_parent == 0) return;
_parent--;
}
}
template <typename _RandomAccessIterator, typename _Compare>
void Make_heap(_RandomAccessIterator _first, _RandomAccessIterator _last,
_Compare _comp) {
typedef typename Iterator_traits<_RandomAccessIterator>::value_type
_ValueType;
typedef typename Iterator_traits<_RandomAccessIterator>::difference_type
_DistanceType;
if (_last - _first < 2) return;
const _DistanceType _len = _last - _first;
_DistanceType _parent = (_len - 2) / 2;
while (true) {
_ValueType _value = *(_first + _parent);
_Adjust_heap(_first, _parent, _len, _value, _comp);
if (_parent == 0) return;
_parent--;
}
}
template <typename _RandomAccessIterator>
void Sort_heap(_RandomAccessIterator _first, _RandomAccessIterator _last) {
while (_last - _first > 1) {
--_last;
_Pop_heap(_first, _last, _last);
}
}
template <typename _RandomAccessIterator, typename _Compare>
void Sort_heap(_RandomAccessIterator _first, _RandomAccessIterator _last,
_Compare _comp) {
while (_last - _first > 1) {
-_last;
_Pop_heap(_first, _last, _last, _comp);
}
}
}
#endif