aud.QueueDL< T > Class Template Reference

Impementation of AbstractQueue based on doubly linked list DList. More...

Inheritance diagram for aud.QueueDL< T >:

Collaboration diagram for aud.QueueDL< T >:

Public Member Functions
	QueueDL ()
boolean	is_empty ()
	Is queue empty? More...
T	front ()
	Get front element of queue. More...
T	dequeue ()
	Remove front element from queue. More...
void	enqueue (T x)
	Enqueue element at end of queue. More...
String	toString ()
abstract boolean	is_empty ()
	Is queue empty? More...
abstract T	front ()
	Get front element of queue. More...
abstract T	dequeue ()
	Remove front element from queue. More...
abstract void	enqueue (T x)
	Enqueue element at end of queue. More...
String	toString ()

Additional Inherited Members
Protected Member Functions inherited from aud.adt.AbstractQueue< T >
	AbstractQueue ()
	create empty queue More...

Detailed Description

Impementation of AbstractQueue based on doubly linked list DList.

Definition at line 11 of file QueueDL.java.

Constructor & Destructor Documentation

QueueDL()

aud.QueueDL< T >.QueueDL

(

)

Definition at line 15 of file QueueDL.java.

{ data_=new DList<T>(); }

Member Function Documentation

dequeue()

T aud.QueueDL< T >.dequeue

(

)

Remove front element from queue.

Requires !is_empty().

Exceptions

NoSuchElementException

Returns

removed element

Reimplemented from aud.adt.AbstractQueue< T >.

Definition at line 30 of file QueueDL.java.

                               {
    if (data_.empty())
      throw new NoSuchElementException();
    T obj=data_.front();
    data_.pop_front();
    return obj;
  }

Referenced by aud.test.QueueTest.testInvalid_dequeueDL().

Here is the caller graph for this function:

enqueue()

void aud.QueueDL< T >.enqueue

(

T

x

)

Enqueue element at end of queue.

Parameters

x	new element

Reimplemented from aud.adt.AbstractQueue< T >.

Definition at line 38 of file QueueDL.java.

                                     {
    data_.push_back(x);
  }

front()

T aud.QueueDL< T >.front

(

)

Get front element of queue.

Requires !is_empty().

Exceptions

NoSuchElementException

Returns

front element

Reimplemented from aud.adt.AbstractQueue< T >.

Definition at line 22 of file QueueDL.java.

                             {
    if (data_.empty())
      throw new NoSuchElementException();
    return data_.front();
  }

Referenced by aud.test.QueueTest.testInvalid_frontDL().

Here is the caller graph for this function:

is_empty()

boolean aud.QueueDL< T >.is_empty

(

)

Is queue empty?

Reimplemented from aud.adt.AbstractQueue< T >.

Definition at line 19 of file QueueDL.java.

                                      {
    return data_.empty();
  }

Referenced by aud.QueueDL< T >.toString().

Here is the caller graph for this function:

toString()

String aud.QueueDL< T >.toString

(

)

Reimplemented from aud.adt.AbstractQueue< T >.

Definition at line 43 of file QueueDL.java.

                                     {
    if (is_empty())
      return "<";
 
    String s="";
    DList<T>.ForwardIterator i=data_.iterator();
    while (i.hasNext()) {
      s+=i.next().toString()+"<";
    }
    return s;
  }

References aud.QueueDL< T >.is_empty().

Here is the call graph for this function:

---

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

• QueueDL.java