Repository navigation
Expand file tree
/
Copy pathpqueue.tcc
More file actions
258 lines (236 loc) · 6.51 KB
/
Copy pathpqueue.tcc
File metadata and controls
258 lines (236 loc) · 6.51 KB
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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
/****************************************************************************
Copyright (C) 1995, University of California, Davis
THIS SOFTWARE IS MADE AVAILABLE, AS IS, AND THE UNIVERSITY
OF CALIFORNIA DOES NOT MAKE ANY WARRANTY ABOUT THE SOFTWARE, ITS
PERFORMANCE, ITS MERCHANTABILITY OR FITNESS FOR ANY PARTICULAR
USE, FREEDOM FROM ANY COMPUTER DISEASES OR ITS CONFORMITY TO ANY
SPECIFICATION. THE ENTIRE RISK AS TO QUALITY AND PERFORMANCE OF
THE SOFTWARE IS WITH THE USER.
Copyright of the software and supporting documentation is
owned by the University of California, and free access
is hereby granted as a license to use this software, copy this
software and prepare derivative works based upon this software.
However, any distribution of this software source code or
supporting documentation or derivative works (source code and
supporting documentation) must include this copyright notice.
****************************************************************************/
/*
20100309 bcb commented out unused variables (gcc4.2 Warnings)
20100707 mvh Merged
*/
/***************************************************************************
*
* University of California, Davis
* UCDMC DICOM Network Transport Libraries
* Version 0.1 Beta
*
* Technical Contact: mhoskin@ucdavis.edu
*
***************************************************************************/
/***********************************************************************
*
* Template P-Queue Class
*
*
*
***********************************************************************/
template <class DATATYPE>
DATATYPE & PQueue<DATATYPE> :: Push(DATATYPE &Value)
{
unsigned int Index;//, Base;
DATATYPE tdt;
Array<DATATYPE> :: Add(Value);
Index = Array<DATATYPE>::GetSize();
--Index;
while(Index)
{
if(Array<DATATYPE>::Get(Index) < Array<DATATYPE>::Get((Index-1)>>1))
{
tdt = Array<DATATYPE> :: Get(Index);
Array<DATATYPE>::Get(Index) = Array<DATATYPE>::Get((Index-1)>>1);
Array<DATATYPE>::Get((Index-1)>>1) = tdt;
Index = (Index-1) >> 1;
}
else
break;
}
return ( Value );
}
template <class DATATYPE>
DATATYPE & PQueue<DATATYPE> :: Pop()
{
DATATYPE tdt;
// DATATYPE tdt2;
// unsigned int Index;
unsigned int sorted;
unsigned int Pick;
unsigned int Child1;
unsigned int Child2;
unsigned int Hole;
if(!Array<DATATYPE>::GetSize())
return ( dt ); // error
dt = Array<DATATYPE> :: Get ( 0 );
if(Array<DATATYPE> :: GetSize() == 1)
{
Array<DATATYPE> :: RemoveAt ( 0 );
return ( dt ) ;
}
tdt = Array<DATATYPE> :: Get ( Array<DATATYPE> :: GetSize() - 1);
Array<DATATYPE> :: RemoveAt ( Array<DATATYPE> :: GetSize() - 1);
Hole = 0;
sorted = 0;
while(!sorted)
{
Child1 = 2 * Hole + 1;
Child2 = 2 * Hole + 2;
if(Child2 >= Array<DATATYPE> :: GetSize())
{
if ( Child1 >= Array<DATATYPE> :: GetSize())
{
Array<DATATYPE> :: Get(Hole) = tdt;
return ( dt );
}
if(Array<DATATYPE> :: Get ( Child1 ) < tdt)
{
Array<DATATYPE> :: Get(Hole) = Array<DATATYPE> :: Get(Child1);
Array<DATATYPE> :: Get(Child1) = tdt;
return(dt);
}
Array<DATATYPE> :: Get(Hole) = tdt;
return ( dt );
}
Pick = Child1;
if ( Array<DATATYPE> :: Get ( Child1 ) > Array<DATATYPE> :: Get(Child2))
Pick = Child2;
if ( Array<DATATYPE> :: Get ( Pick ) < tdt)
{
Array<DATATYPE> :: Get ( Hole) = Array<DATATYPE> :: Get( Pick );
Hole = Pick;
}
else
{
Array<DATATYPE> :: Get(Hole) = tdt;
return ( dt );
}
}
return ( dt );
}
template <class DATATYPE>
DATATYPE & PQueueOfPtr<DATATYPE> :: Push(DATATYPE &Value)
{
unsigned int Index;//, Base;
DATATYPE tdt;
Array<DATATYPE> :: Add(Value);
Index = Array<DATATYPE>::GetSize();
--Index;
while(Index)
{
if((*Array<DATATYPE>::Get(Index)) < (*Array<DATATYPE>::Get((Index-1)>>1)))
{
tdt = Array<DATATYPE> :: Get(Index);
Array<DATATYPE>::Get(Index) = Array<DATATYPE>::Get((Index-1)>>1);
Array<DATATYPE>::Get((Index-1)>>1) = tdt;
Index = (Index-1) >> 1;
}
else
break;
}
return ( Value );
}
template <class DATATYPE>
DATATYPE & PQueueOfPtr<DATATYPE> :: Pop()
{
DATATYPE tdt;
// DATATYPE tdt2;
// unsigned int Index;
unsigned int sorted;
unsigned int Pick;
unsigned int Child1;
unsigned int Child2;
unsigned int Hole;
if(!Array<DATATYPE>::GetSize())
return ( dt ); // error
dt = Array<DATATYPE> :: Get ( 0 );
if(Array<DATATYPE> :: GetSize() == 1)
{
Array<DATATYPE> :: RemoveAt ( 0 );
return ( dt ) ;
}
tdt = Array<DATATYPE> :: Get ( Array<DATATYPE> :: GetSize() - 1);
Array<DATATYPE> :: RemoveAt ( Array<DATATYPE> :: GetSize() - 1);
Hole = 0;
sorted = 0;
while(!sorted)
{
Child1 = 2 * Hole + 1;
Child2 = 2 * Hole + 2;
if(Child2 >= Array<DATATYPE> :: GetSize())
{
if ( Child1 >= Array<DATATYPE> :: GetSize())
{
Array<DATATYPE> :: Get(Hole) = tdt;
return ( dt );
}
if((*Array<DATATYPE> :: Get ( Child1 )) < (*tdt))
{
Array<DATATYPE> :: Get(Hole) = Array<DATATYPE> :: Get(Child1);
Array<DATATYPE> :: Get(Child1) = tdt;
return(dt);
}
Array<DATATYPE> :: Get(Hole) = tdt;
return ( dt );
}
Pick = Child1;
if ( (*Array<DATATYPE> :: Get ( Child1 )) > (*Array<DATATYPE> :: Get(Child2)))
Pick = Child2;
if ( (*Array<DATATYPE> :: Get ( Pick )) < (*tdt))
{
Array<DATATYPE> :: Get ( Hole) = Array<DATATYPE> :: Get( Pick );
Hole = Pick;
}
else
{
Array<DATATYPE> :: Get(Hole) = tdt;
return ( dt );
}
}
return ( dt );
}
#ifdef BUILD_TEST_UNITS
int
testfunc()
{
int tempint, tempint2, index;
PQueue<int> Pq;
fprintf(stderr, "[adding randum numbers]\n");fflush(stderr);
index = 0;
while(index < 1000)
{
tempint = rand();
//fprintf(stderr, "Adding: %d, ", index);fflush(stderr);
Pq.Push(tempint);
++index;
}
fprintf(stderr, "[testing Queue Size: %d]\n", Pq.GetSize());fflush(stderr);
index = 0;
tempint2 = 0;
while(Pq.GetSize())
{
tempint = Pq.Pop();
//fprintf(stderr, "%d : %d Pop : %d\n", index+1, Pq.GetSize(), tempint);
if(tempint < tempint2)
{
fprintf(stderr, "[---failed---]\n");fflush(stderr);return(0);
}
tempint2 = tempint;
++index;
}
fprintf(stderr, "[success]\n");
return ( 1 );
}
main()
{
testfunc();
return(0);
}
#endif