a binary heap event scheduler More...
#include <heap-scheduler.h>


Public Member Functions | |
| virtual void | Insert (const Event &ev) |
| virtual bool | IsEmpty (void) const |
| virtual Event | PeekNext (void) const |
| virtual Event | RemoveNext (void) |
| virtual void | Remove (const Event &ev) |
a binary heap event scheduler
This code started as a c++ translation of a java-based code written in 2005 to implement a heap sort. So, this binary heap is really a pretty straightforward implementation of the classic data structure. Not much to say about it.
What is smart about this code ?
| virtual void ns3::HeapScheduler::Insert | ( | const Event & | ev | ) | [virtual] |
| ev | event to store in the event list |
Implements ns3::Scheduler.
| virtual bool ns3::HeapScheduler::IsEmpty | ( | void | ) | const [virtual] |
Implements ns3::Scheduler.
| virtual Event ns3::HeapScheduler::PeekNext | ( | void | ) | const [virtual] |
This method cannot be invoked if the list is empty.
Implements ns3::Scheduler.
| virtual void ns3::HeapScheduler::Remove | ( | const Event & | ev | ) | [virtual] |
| ev | the event to remove |
This methods cannot be invoked if the list is empty.
Implements ns3::Scheduler.
| virtual Event ns3::HeapScheduler::RemoveNext | ( | void | ) | [virtual] |
This method cannot be invoked if the list is empty. Remove the next earliest event from the event list.
Implements ns3::Scheduler.
1.7.1