12 #ifndef PRIORITY_QUEUE_HEAP_H 13 #define PRIORITY_QUEUE_HEAP_H 15 #include <sys/types.h> 28 template<
class T,
class Compare >
41 const T&
top ()
const;
62 template<
class T,
class Compare>
68 trace(
"PriorityQueue_Heap::PriorityQueue_Heap");
72 template<
class T,
class Compare>
81 template<
class T,
class Compare>
90 template<
class T,
class Compare>
101 template<
class T,
class Compare>
116 template<
class T,
class Compare>
124 template<
class T,
class Compare>
137 template<
class T,
class Compare>
152 template<
class T,
class Compare>
167 template<
class T,
class Compare>
175 template<
class T,
class Compare>
195 template<
class T,
class Compare>
202 for (i=1; i <
m_curr; i++)
219 template<
class T,
class Compare>
227 template<
class T,
class Compare>
235 T* new_chunk =
new T[newsz_];
243 template<
class T,
class Compare>
size_t m_lwm
Next free slot in array.
#define trace(s)
trace() is used to trace function call chain in C++ program.
PriorityQueue_Heap(size_t max_=0)
Class PriorityQueue_Impl.
Interface class that defines Implementor of the Bridge pattern.
PriorityQueue_Heap & operator=(const PriorityQueue_Heap &)
size_t m_curr
Array's size.
size_t m_size
Array of queued pointers.