This directory contains following queue strategies :
     stack :    stack/qs.c 
     fifo  :    fifo/qs.c 
     fifo-lifo: fifolifo/qs.c (depending on the length of queue either fifo
                            or lifo)

     prio_fifo :priority queue, elemnets with the same priorities are managed 
                as in fifo
     prio_stack:priority queue,elements with the same priorities are managed as                 in stack strategy 
            bitvector-integer priority distinction is made in the 
            makefile by defining appropriate flags.

 
The functions provided by each strategy are :

queue  : pointer to the type QUEUE defined in queue.h
    void *Qs_Create()   : creates a queue and returns a pointer to it

    Qs_Length(queue)    : returns current length of the queue

    Qs_MaxLength(queue) : returns maximum length of the queue

    Qs_Enqueue(queue,element) : appends the envelope pointed by element 
    ENVELOPE *element;          to the queue

    Qs_DeQueue(queue,element) : removes an item from  queue, and returns it
    ENVELOPE **element;         through the parameter element.

    Qs_Empty(queue)           : returns TRUE if queue is empty

