AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
aud.adt.AbstractQueue< T > Class Template Referenceabstract

Interface for an ADT queue. More...

+ Inheritance diagram for aud.adt.AbstractQueue< T >:

Public Member Functions

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 ()
 

Protected Member Functions

 AbstractQueue ()
 create empty queue More...
 

Detailed Description

Interface for an ADT queue.

Definition at line 8 of file AbstractQueue.java.

Constructor & Destructor Documentation

◆ AbstractQueue()

create empty queue

Definition at line 11 of file AbstractQueue.java.

11{}

Member Function Documentation

◆ dequeue()

abstract T aud.adt.AbstractQueue< T >.dequeue ( )
abstract

Remove front element from queue.

Requires !is_empty().

Exceptions
NoSuchElementException
Returns
removed element

Reimplemented in aud.example.VerboseQueue< T >, aud.Queue< T >, and aud.QueueDL< T >.

◆ enqueue()

abstract void aud.adt.AbstractQueue< T >.enqueue ( x)
abstract

Enqueue element at end of queue.

Parameters
xnew element

Reimplemented in aud.example.VerboseQueue< T >, aud.Queue< T >, and aud.QueueDL< T >.

◆ front()

abstract T aud.adt.AbstractQueue< T >.front ( )
abstract

Get front element of queue.

Requires !is_empty().

Exceptions
NoSuchElementException
Returns
front element

Reimplemented in aud.Queue< T >, and aud.QueueDL< T >.

◆ is_empty()

abstract boolean aud.adt.AbstractQueue< T >.is_empty ( )
abstract

Is queue empty?

Reimplemented in aud.Queue< T >, and aud.QueueDL< T >.

◆ toString()

String aud.adt.AbstractQueue< T >.toString ( )

Reimplemented in aud.Queue< T >, and aud.QueueDL< T >.

Definition at line 36 of file AbstractQueue.java.

36{ return "AbstractQueue"; }

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