Class hierarchy Compound list Compound Members

# Queue Class Reference

A classic FIFO data structure. More...

Inherits Stack.

List of all members.

## Public Members

- Queue (const unsigned flags=0)
    Default Constructor: Construct an empty queue.

- Queue (const Queue& q)
    Copy Constructor: Construct a copy of a queue.

- Queue (const Container& c)
    Construct a queue from any container.

- Queue (const Enumeration& e)
    Construct a queue from an enumeration.

- Queue (const Vector& v)
    Construct a queue from a vector.

- ~Queue ()
    Destructor.

- Queue& operator= (const Queue& q)
    Assignment: Copy a queue.

- Data peek (const int index=0)
    Retrieve the first element without removing.

- Data pop ()
    Retrieve and remove the first element.

## Detailed Description

A classic FIFO data structure.

See <DS_Stack.h> for other methods

## Member Function Documentation

### Queue::Queue(const unsigned flags=0)

Default Constructor: Construct an empty queue.

### Queue::Queue(const Queue& q)

Copy Constructor: Construct a copy of a queue.

### Queue::Queue(const Container& c)

Construct a queue from any container.

The elements are queued in the index order of the container.

### Queue::Queue(const Enumeration& e)

Construct a queue from an enumeration.

The elements are queued in the order they are enumerated.

### Queue::Queue(const Vector& v)

Construct a queue from a vector.

The elements are queued in index order.

### Queue::~Queue()

Destructor.

### Queue& Queue::operator=(const Queue& q)

Assignment: Copy a queue.

### Data Queue::peek(const int index=0)

Retrieve the first element without removing.

Reimplemented from Stack.

### Data Queue::pop()

Retrieve and remove the first element.

Note: pop() returns garbage in a destructive queue.

Reimplemented from Stack.

The documentation for this class was generated from the following file:

- DS_MemMgr.h