#include </usr1/tp517/Tumble/trunk/src/tumble/util.h>
Public Member Functions | |
PQueue () | |
int | size () |
bool | pop (T &val) |
void | push (const T &val, double p) |
bool | remove (const T &val) |
void | print () |
Public Attributes | |
int | sz |
PQueueEntry< T > * | front |
PQueueEntry< T > * | back |
This has behavior for inserts.
This should be used for queues that are less than 25 elements, as in devilliers vertex removal algorithm.
Definition at line 608 of file util.h.
Definition at line 613 of file util.h.
References PQueue< T >::back, PQueue< T >::front, and PQueue< T >::sz.
int PQueue< T >::size | ( | ) | [inline] |
bool PQueue< T >::pop | ( | T & | val | ) | [inline] |
Definition at line 637 of file util.h.
References PQueue< T >::back, PQueue< T >::front, PQueueEntry< T >::i, PQueueEntry< T >::next, and PQueue< T >::sz.
void PQueue< T >::push | ( | const T & | val, | |
double | p | |||
) | [inline] |
Definition at line 650 of file util.h.
References PQueue< T >::back, PQueue< T >::front, PQueueEntry< T >::next, PQueueEntry< T >::p, PQueueEntry< T >::prev, and PQueue< T >::sz.
bool PQueue< T >::remove | ( | const T & | val | ) | [inline] |
Definition at line 681 of file util.h.
References PQueue< T >::back, PQueue< T >::front, PQueueEntry< T >::i, PQueueEntry< T >::next, PQueueEntry< T >::prev, and PQueue< T >::sz.
void PQueue< T >::print | ( | ) | [inline] |
Definition at line 624 of file util.h.
References PQueue< T >::front, PQueueEntry< T >::i, PQueueEntry< T >::next, and PQueueEntry< T >::p.
Definition at line 610 of file util.h.
Referenced by PQueue< T >::pop(), PQueue< T >::PQueue(), PQueue< T >::push(), PQueue< T >::remove(), and PQueue< T >::size().
PQueueEntry<T>* PQueue< T >::front |
Definition at line 611 of file util.h.
Referenced by PQueue< T >::pop(), PQueue< T >::PQueue(), PQueue< T >::print(), PQueue< T >::push(), and PQueue< T >::remove().
PQueueEntry<T> * PQueue< T >::back |
Definition at line 611 of file util.h.
Referenced by PQueue< T >::pop(), PQueue< T >::PQueue(), PQueue< T >::push(), and PQueue< T >::remove().