|
libassa 3.5.0
|
#include <PriorityQueue_STLPQ.h>
Public Member Functions | |
| ~PriorityQueue_STLPQ () | |
| void | insert (const T &) |
| T | pop () |
| const T & | top () const |
| bool | remove (const int) |
| size_t | size () |
| void | dump () |
Private Attributes | |
| priority_queue< T *, deque< T * > , Compare > | m_queue |
Definition at line 33 of file PriorityQueue_STLPQ.h.
| ASSA::PriorityQueue_STLPQ< T, Compare >::~PriorityQueue_STLPQ | ( | ) | [inline] |
| void ASSA::PriorityQueue_STLPQ< T, Compare >::dump | ( | void | ) | [inline] |
Definition at line 147 of file PriorityQueue_STLPQ.h.
References DL, ASSA::Timer::dump(), ASSA::TRACE, and trace.
{
trace("PriorityQueue_STLPQ::dump");
list<Timer*> t_list;
register Timer* t_ptr = 0;
DL((TRACE,"======TimerQueue start=======\n"));
while (m_queue.size () > 0) {
t_ptr = m_queue.top ();
t_ptr->dump ();
t_list.push_back (t_ptr);
}
DL((TRACE,"======TimerQueue end=========\n"));
list<Timer*>::iterator i;
for (i = t_list.begin (); i != t_list.end (); i++) {
m_queue.push (*i);
}
}
| void ASSA::PriorityQueue_STLPQ< T, Compare >::insert | ( | const T & | t_ | ) | [inline, virtual] |
Implements ASSA::PriorityQueue_Impl< T, Compare >.
Definition at line 67 of file PriorityQueue_STLPQ.h.
References trace.
| T ASSA::PriorityQueue_STLPQ< T, Compare >::pop | ( | ) | [inline, virtual] |
Implements ASSA::PriorityQueue_Impl< T, Compare >.
Definition at line 76 of file PriorityQueue_STLPQ.h.
References trace.
| bool ASSA::PriorityQueue_STLPQ< T, Compare >::remove | ( | const int | id_ | ) |
Definition at line 106 of file PriorityQueue_STLPQ.h.
References ASSA::Timer::getHandler(), and trace.
{
trace("PriorityQueue_STLPQ::remove");
list<Timer*> t_list;
register Timer* t_ptr = 0;
register int cnt = 0;
while (m_queue.size () > 0) {
t_ptr = m_queue.top ();
if (t_ptr->getHandler ()-> id() == id_) {
delete t_ptr;
cnt++;
}
else {
t_list.push_back (t_ptr);
}
m_queue.pop ();
}
// Restore queue
list<Timer*>::iterator i;
for (i = t_list.begin (); i != t_list.end (); i++) {
m_queue.push (*i);
}
return cnt;
}
| size_t ASSA::PriorityQueue_STLPQ< T, Compare >::size | ( | ) | [inline, virtual] |
Implements ASSA::PriorityQueue_Impl< T, Compare >.
Definition at line 139 of file PriorityQueue_STLPQ.h.
References ASSA::PriorityQueue_STLPQ< T, Compare >::size().
Referenced by ASSA::PriorityQueue_STLPQ< T, Compare >::size().
{
return m_queue.size ();
}
| const T & ASSA::PriorityQueue_STLPQ< T, Compare >::top | ( | ) | const [inline, virtual] |
Implements ASSA::PriorityQueue_Impl< T, Compare >.
Definition at line 88 of file PriorityQueue_STLPQ.h.
References trace.
priority_queue<T*, deque<T*>, Compare> ASSA::PriorityQueue_STLPQ< T, Compare >::m_queue [private] |
Definition at line 48 of file PriorityQueue_STLPQ.h.
1.7.3