#include <Activation_Queue.h>
Collaboration diagram for ACE_Activation_Queue:

Public Methods | |
| ACE_Activation_Queue (ACE_Message_Queue<ACE_SYNCH> *new_queue = 0) | |
| Constructor. | |
| virtual | ~ACE_Activation_Queue (void) |
| Destructor. | |
| ACE_Method_Request* | dequeue (ACE_Time_Value *tv = 0) |
| Dequeue the next available <Method_Request>. | |
| int | enqueue (ACE_Method_Request *new_method_request, ACE_Time_Value *tv = 0) |
| Enqueue the <Method_Request> in priority order. The priority is determined by the <priority> method of the <new_message_request>. | |
| int | method_count (void) const |
| Get the current number of method objects in the queue. | |
| int | is_empty (void) const |
| Returns 1 if the queue is empty, 0 otherwise. | |
| int | is_full (void) const |
| Returns 1 if the queue is full, 0 otherwise. | |
| void | dump (void) const |
| Dump the state of an request. | |
Public Attributes | |
| ACE_ALLOC_HOOK_DECLARE | |
| Declare the dynamic allocation hooks. | |
Protected Attributes | |
| ACE_Message_Queue<ACE_SYNCH>* | queue_ |
| Stores the <Method_Requests>. | |
| int | delete_queue_ |
| Keeps track of whether we need to delete the queue. | |
Private Methods | |
| void | operator= (const ACE_Activation_Queue &) |
| ACE_Activation_Queue (const ACE_Activation_Queue &) | |
A <Method_Request> is inserted in the , where it is subsequently removed by the <Scheduler>, which invokes its <call> method..
|
|
Constructor.
|
|
|
Destructor.
|
|
|
|
|
|
Dequeue the next available <Method_Request>.
|
|
|
Dump the state of an request.
|
|
|
Enqueue the <Method_Request> in priority order. The priority is determined by the <priority> method of the <new_message_request>.
|
|
|
Returns 1 if the queue is empty, 0 otherwise.
|
|
|
Returns 1 if the queue is full, 0 otherwise.
|
|
|
Get the current number of method objects in the queue.
|
|
|
|
|
|
Declare the dynamic allocation hooks.
|
|
|
Keeps track of whether we need to delete the queue.
|
|
|
Stores the <Method_Requests>.
|
1.2.3 written by Dimitri van Heesch,
© 1997-2000