g++ [flags ...] file ...

#include <Queue.h>
Queue();
boolean assign(const Queue<TObject>& copy_queue);
boolean add(TObject* item);
TObject* remove(TObject* item = (TObject*)NULL);
const TObject* peek() const;
boolean clear();

// declare a character queue and add two characters into it
//
Queue<Char> queue;
Char item0(L'a');
Char item1(L'b');
queue.add(&item0);
queue.add(&item1);

// remove the top item from the queue
//
Char* item2 = new Char();
queue.remove(item2);

if(!item2->eq(item0)) {
  // error
}

T. Cormen, C. Leiserson, R. Rivest, Introduction to Algorithms, MIT Press, Boston, Massachusetts, USA, pp. 200-203, 1998.

• none.

• This example demonstrates the basic operation of a queue:

  #include <Char.h>
  #include <Queue.h>
  
  int main () {
  
    // local variables
    //
    Queue<Long> q;
    Long j;
  
    // add 10 items to the queue
    //       
    for (long i = 0; i < 10; i++) {
      j = i * 3;
      q.add(&j);
    }
  
    // see what is on the queue
    //       
    q.debug(L"after add");
  
    // pull things off the queue and print them in order
    //       
    while (q.remove(&j) != (Long*)NULL) {
      j.debug(L"pulled off queue");
    }
         
    // exit gracefully
    //
    Integral::exit();
  }

• This example demonstrates the basic operation of a queue in USER mode. Note that memory is manually allocated before adding it to the queue and deleted upon removal.

  #include <Char.h>
  #include <Queue.h>
  
  int main () {
  
    // local variables (note that the queue is set to reference mode)
    //
    Queue<Long> q(USER);
    Long* j;
  
    // add 10 items to the queue
    //       
    for (long i = 0; i < 10; i++) {
      j = new Long(i * 3);
      q.add(j);
    }
  
    // see what is on the queue
    //       
    q.debug(L"after add");
  
    // pull things off the queue and print them in order
    //       
    while ((j = q.remove()) != (Long*)NULL) {
      j->debug(L"pulled off queue");
      delete j;
    }
         
    // exit gracefully
    //
    Integral::exit();
  }

• This example demonstrates how to check if two Queues are equal:

  #include <Char.h>
  #include <Queue.h>
  
  int main () {
  
    // prepare items for the queue
    //
    Char** items = new Char*[5];
    for (long i = 0; i < 5; i++) {
       items[i] = new Char((unichar)((long)(L'a') + i));
    }
  
    // declare a queue and add items into it
    //
    Queue<Char> char_queue;
    char_queue.add(items, 5);
  
    // copy the queue
    //
    Queue<Char> copy_char_queue(char_queue);
  
    // see if these Queues are equivalent
    //
    if(!char_queue.eq(copy_char_queue)) {
      // exit with error
      //
      Integral::exit();
      
    }
  
    // clean up the memory used
    //
    for (long i = 0; i < 5; i++) {
      delete items[i]; 
    }
    delete [] items; 
    
    // exit gracefully
    //
    Integral::exit();
  }

• Unlike other classes, we have two read and write methods in dstr classes. The interface is still the same as that in other classes. The reason behind this is that we can not use "CLASS_NAME" as default argument in the read and write methods here because the data structures build the class name on the fly.