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
|
/*
* Copyright (C) 2007-2010 Xagasoft, All rights reserved.
*
* This file is part of the libbu++ library and is released under the
* terms of the license contained in the file LICENSE.
*/
#ifndef BU_HEAP_H
#define BU_HEAP_H
#include <stddef.h>
#include <memory>
#include "bu/exceptionbase.h"
#include "bu/util.h"
#include "bu/queue.h"
namespace Bu
{
subExceptionDecl( HeapException );
template<typename item, typename cmpfunc=__basicLTCmp<item>, typename itemalloc=std::allocator<item> >
class Heap : public Queue<item>
{
public:
Heap() :
iSize( 7 ),
iFill( 0 ),
aItem( ia.allocate( iSize ) )
{
}
Heap( cmpfunc cmpin ) :
iSize( 7 ),
iFill( 0 ),
aItem( ia.allocate( iSize ) ),
cmp( cmpin )
{
}
Heap( int iInitialCapacity ) :
iSize( 0 ),
iFill( 0 ),
aItem( NULL )
{
for( iSize = 1; iSize < iInitialCapacity; iSize=iSize*2+1 ) { }
aItem = ia.allocate( iSize );
}
Heap( cmpfunc cmpin, int iInitialCapacity ) :
iSize( 0 ),
iFill( 0 ),
aItem( NULL ),
cmp( cmpin )
{
for( iSize = 1; iSize < iInitialCapacity; iSize=iSize*2+1 ) { }
aItem = ia.allocate( iSize );
}
virtual ~Heap()
{
for( int j = 0; j < iFill; j++ )
ia.destroy( &aItem[j] );
ia.deallocate( aItem, iSize );
aItem = NULL;
}
virtual void enqueue( const item &it )
{
item i = it; // TODO: This is a silly workaround, put the i item
// at the end.
if( iFill+1 >= iSize )
upSize();
for( int j = 0; j < iFill; )
{
if( cmp( i, aItem[j] ) )
{
Bu::swap( i, aItem[j] );
}
if( j*2+1 >= iFill )
break;
if( cmp( i, aItem[j*2+1] ) )
{
j = j*2+1;
}
else
{
j = j*2+2;
}
}
ia.construct( &aItem[iFill], i );
if( iFill > 0 )
{
for( int j = iFill; j >= 0; )
{
int k = (j-1)/2;
if( j == k )
break;
if( cmp( aItem[k], aItem[j] ) )
break;
Bu::swap( aItem[k], aItem[j] );
j = k;
}
}
iFill++;
}
virtual item &peek()
{
if( iFill == 0 )
throw HeapException("Heap empty.");
return aItem[0];
}
virtual const item &peek() const
{
if( iFill == 0 )
throw HeapException("Heap empty.");
return aItem[0];
}
virtual item dequeue()
{
if( iFill == 0 )
throw HeapException("Heap empty.");
item iRet = aItem[0];
int j;
for( j = 0; j < iFill; )
{
int k = j*2+1;
if( k+1 < iFill && cmp( aItem[k+1], aItem[k] ) )
{
if( k+1 < iFill-1 && cmp( aItem[iFill-1], aItem[k+1] ) )
break;
aItem[j] = aItem[k+1];
j = k+1;
}
else if( k < iFill )
{
if( k < iFill-1 && cmp( aItem[iFill-1], aItem[k] ) )
break;
aItem[j] = aItem[k];
j = k;
}
else
break;
}
if( j < iFill-1 )
aItem[j] = aItem[iFill-1];
ia.destroy( &aItem[iFill-1] );
iFill--;
return iRet;
}
virtual bool isEmpty() const
{
return (iFill==0);
}
virtual int getSize() const
{
return iFill;
}
/*
void print( class Formatter &f )
{
f << "graph G {" << "\n";
for( int j = 0; j < iFill; j++ )
{
if( j*2+1 < iFill )
f << " " << j << " -- " << j*2+1 << ";" << "\n";
if( j*2+2 < iFill )
f << " " << j << " -- " << j*2+2 << ";" << "\n";
}
for( int j = 0; j < iFill; j++ )
{
f << " " << j << " [label=\"" << aItem[j] << "\"];" << "\n";
}
f << "}" << "\n";
} */
private:
void upSize()
{
item *aNewItems = ia.allocate( iSize*2+1 );
// memcpy( aNewItems, aItem, sizeof(item)*iFill );
for( int j = 0; j < iFill; j++ )
{
ia.construct( &aNewItems[j], aItem[j] );
ia.destroy( &aItem[j] );
}
ia.deallocate( aItem, iSize );
aItem = aNewItems;
iSize = iSize*2+1;
}
private:
int iSize;
int iFill;
item *aItem;
cmpfunc cmp;
itemalloc ia;
};
};
#endif
|
