#include <DataQueue.h> [code]
Inherited by Protocols::Generics::FifoQueue.
Inheritance diagram for Protocols::Generics::DataQueue:

A common problem when sending data over the network is trying to send data faster than the network or the other side can manage to transmit or process. In case the network bandwidth is saturated certain data might need to be sent with higher priority while less important data could be dropped.
DataQueue provides an abstraction for a queueing strategy. A new object that gets enqueued might be queued, or dropped. Another already queued object may be dropped to make room for the new one. Each DataQueue implementation could implement its own queueing policy.
Definition at line 44 of file DataQueue.h.
Public Member Functions | |
| virtual | ~DataQueue () |
| virtual bool | isEmpty () const =0 |
| Tells whether any elements are queued or not. | |
| virtual void | enqueue (const Data &)=0 |
| Adds a Data object to the queue. | |
| virtual Data | next () const =0 |
| virtual void | dequeue ()=0 |
| Drops the Data objects that is next() in the queue. | |
|
|
Definition at line 49 of file DataQueue.h. |
|
|
Drops the Data objects that is next() in the queue.
Implemented in Protocols::Generics::FifoQueue. |
|
|
Adds a Data object to the queue.
Implemented in Protocols::Generics::FifoQueue. |
|
|
Tells whether any elements are queued or not.
Implemented in Protocols::Generics::FifoQueue. |
|
|
Implemented in Protocols::Generics::FifoQueue. |