Queue of message pointers
![]() | MessageQueue::Append (GMessage *msg, int requestType = HARD) Append message to queue |
![]() | MessageQueue::FreeSlotsCount () Number of messages it is possible to append to queue |
![]() | MessageQueue::GetMsg (GMessage **msg, Size number) et message from queue |
![]() | MessageQueue::GetRandomMsg (GMessage **msg) Get random message from queue |
![]() | MessageQueue::IsQueueFull () Is the queue full? |
![]() | MessageQueue::MessageQueue (LogFile * queueLogFile, Size size) Message queue constructor |
![]() | MessageQueue::MsgCount () Returns the number of messages in queue |
![]() | MessageQueue::ShowMsg (GMessage **msg, Size number) Get message from queue |
![]() | MessageQueue::~MessageQueue () Message queue destructor |
![]() | methods
|
![]() | attributes
|
Queue of message pointers. Holds a queue of pointers to messages. It provides access to stored messages in FIFO order and even random access.
Size firstMsg
Size lastMsg
Size msgCount
struct Semaphore semEmpty semFull
~MessageQueue()
Err Append(GMessage *msg, int requestType = HARD)
Err GetMsg(GMessage **msg, Size number = 0)
Err GetRandomMsg(GMessage **msg)
Err ShowMsg(GMessage **msg, Size number = 0)
Size MsgCount()
Size FreeSlotsCount()
Size MessageQueue::FreeSlotsCount()
Err MessageQueue::GetMsg(GMessage **msg, Size number)
number - Index of message we want from queue.
Err MessageQueue::GetRandomMsg(GMessage **msg)
bool MessageQueue::IsQueueFull()
MessageQueue::MessageQueue(LogFile * queueLogFile, Size size)
size - Maximum number of messages in queue.
Size MessageQueue::MsgCount()
Err MessageQueue::ShowMsg(GMessage **msg, Size number)
number - Message offset in queue.
MessageQueue::~MessageQueue()
alphabetic index hierarchy of classes
generated by doc++