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
207
208
209
210
211
212
|
/****************************************************************************
**
** Copyright (C) 2011 Nokia Corporation and/or its subsidiary(-ies).
** All rights reserved.
** Contact: Nokia Corporation (qt-info@nokia.com)
**
** This file is part of the Qt3Support module of the Qt Toolkit.
**
** $QT_BEGIN_LICENSE:LGPL$
** No Commercial Usage
** This file contains pre-release code and may not be distributed.
** You may use this file in accordance with the terms and conditions
** contained in the Technology Preview License Agreement accompanying
** this package.
**
** GNU Lesser General Public License Usage
** Alternatively, this file may be used under the terms of the GNU Lesser
** General Public License version 2.1 as published by the Free Software
** Foundation and appearing in the file LICENSE.LGPL included in the
** packaging of this file. Please review the following information to
** ensure the GNU Lesser General Public License version 2.1 requirements
** will be met: http://www.gnu.org/licenses/old-licenses/lgpl-2.1.html.
**
** In addition, as a special exception, Nokia gives you certain additional
** rights. These rights are described in the Nokia Qt LGPL Exception
** version 1.1, included in the file LGPL_EXCEPTION.txt in this package.
**
** If you have questions regarding the use of this file, please contact
** Nokia at qt-info@nokia.com.
**
**
**
**
**
**
**
**
** $QT_END_LICENSE$
**
****************************************************************************/
#ifndef Q3TL_H
#define Q3TL_H
#include <QtCore/qalgorithms.h>
QT_BEGIN_HEADER
QT_BEGIN_NAMESPACE
QT_MODULE(Qt3SupportLight)
template <typename T, typename LessThan>
Q_OUTOFLINE_TEMPLATE void qHeapSortPushDown(T *heap, int first, int last, LessThan lessThan)
{
int r = first;
while (r <= last / 2) {
if (last == 2 * r) {
// node r has only one child
if (lessThan(heap[2 * r], heap[r]))
qSwap(heap[r], heap[2 * r]);
r = last;
} else {
// node r has two children
if (lessThan(heap[2 * r], heap[r]) && !lessThan(heap[2 * r + 1], heap[2 * r])) {
// swap with left child
qSwap(heap[r], heap[2 * r]);
r *= 2;
} else if (lessThan(heap[2 * r + 1], heap[r])
&& lessThan(heap[2 * r + 1], heap[2 * r])) {
// swap with right child
qSwap(heap[r], heap[2 * r + 1]);
r = 2 * r + 1;
} else {
r = last;
}
}
}
}
template <typename BiIterator, typename T, typename LessThan>
Q_OUTOFLINE_TEMPLATE void qHeapSortHelper(BiIterator begin, BiIterator end, const T & /* dummy */, LessThan lessThan)
{
BiIterator it = begin;
uint n = 0;
while (it != end) {
++n;
++it;
}
if (n == 0)
return;
// Create the heap
BiIterator insert = begin;
T *realheap = new T[n];
T *heap = realheap - 1;
int size = 0;
for(; insert != end; ++insert) {
heap[++size] = *insert;
int i = size;
while (i > 1 && lessThan(heap[i], heap[i / 2])) {
qSwap(heap[i], heap[i / 2]);
i /= 2;
}
}
// Now do the sorting
for (int i = n; i > 0; i--) {
*begin++ = heap[1];
if (i > 1) {
heap[1] = heap[i];
qHeapSortPushDown(heap, 1, i - 1, lessThan);
}
}
delete[] realheap;
}
template <typename BiIterator, typename T>
inline void qHeapSortHelper(BiIterator begin, BiIterator end, const T &dummy)
{
qHeapSortHelper(begin, end, dummy, qLess<T>());
}
template <typename BiIterator, typename LessThan>
inline void qHeapSort(BiIterator begin, BiIterator end, LessThan lessThan)
{
if (begin != end)
qHeapSortHelper(begin, end, *begin, lessThan);
}
template <typename BiIterator>
inline void qHeapSort(BiIterator begin, BiIterator end)
{
if (begin != end)
qHeapSortHelper(begin, end, *begin);
}
template <typename Container>
inline void qHeapSort(Container &c)
{
#ifdef Q_CC_BOR
// Work around Borland 5.5 optimizer bug
c.detach();
#endif
if (!c.empty())
qHeapSortHelper(c.begin(), c.end(), *c.begin());
}
template <typename BiIterator, typename LessThan>
void qBubbleSort(BiIterator begin, BiIterator end, LessThan lessThan)
{
// Goto last element;
BiIterator last = end;
// empty list
if (begin == end)
return;
--last;
// only one element ?
if (last == begin)
return;
// So we have at least two elements in here
while (begin != last) {
bool swapped = false;
BiIterator swapPos = begin;
BiIterator x = end;
BiIterator y = x;
y--;
do {
--x;
--y;
if (lessThan(*x, *y)) {
swapped = true;
qSwap(*x, *y);
swapPos = y;
}
} while (y != begin);
if (!swapped)
return;
begin = swapPos;
++begin;
}
}
template <typename BiIterator, typename T>
void qBubbleSortHelper(BiIterator begin, BiIterator end, T)
{
qBubbleSort(begin, end, qLess<T>());
}
template <typename BiIterator>
void qBubbleSort(BiIterator begin, BiIterator end)
{
if (begin != end)
qBubbleSortHelper(begin, end, *begin);
}
template <typename Container>
inline void qBubbleSort(Container &c)
{
qBubbleSort(c.begin(), c.end());
}
QT_END_NAMESPACE
QT_END_HEADER
#endif // Q3TL_H
|
