queue.s.r = create_Queue()
This function is used as a constructor to create an instance of
the Queue class. This class is used to provide an object-oriented
interface to a heterogenous queue datatype. Since this is a queue,
no random access is provided; this is strictly a FIFO - you "put"
at the head and "get" from the tail. If pseudo-random access is
desired, use the List or aList (associated list) class.
This function returns:
a pointer to the newly-created instance of the Queue class upon
success, or a null pointer upon failure to allocate virtual memory.
Use of this class requires the following header files:
Methods for Queue:
destroy destructor for the Queue class
free used to tell an instance of the Queue class to free
all of the virtual memory it has allocated. This is
primarily provided to support derived classes; most
application programs should NOT call this method.
Only use this method if you really know what you are
clone used to clone an instance of a Queue class, to make
another identical instance of a Queue class, including
all data. This method does its own allocation and
copying of all stored data items, so the cloned Queue
is truly independent of the Queue from which it was
put insert an item at the tail of the Queue
get remove an item from the head of the Queue
get_length find out how many items are stored in the Queue
queue = create_Queue();