![]()  | 
  
    AuD
    
   Lecture 'Algorithmen und Datenstrukturen' (code examples) 
   | 
 
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... | |
Interface for an ADT queue.
Definition at line 8 of file AbstractQueue.java.
      
  | 
  protected | 
      
  | 
  abstract | 
Remove front element from queue.
Requires !is_empty(). 
| NoSuchElementException | 
Reimplemented in aud.example.VerboseQueue< T >, aud.Queue< T >, and aud.QueueDL< T >.
      
  | 
  abstract | 
Enqueue element at end of queue.
| x | new element | 
Reimplemented in aud.example.VerboseQueue< T >, aud.Queue< T >, and aud.QueueDL< T >.
      
  | 
  abstract | 
Get front element of queue.
Requires !is_empty(). 
| NoSuchElementException | 
Reimplemented in aud.Queue< T >, and aud.QueueDL< T >.
      
  | 
  abstract | 
Is queue empty?
Reimplemented in aud.Queue< T >, and aud.QueueDL< T >.
| String aud.adt.AbstractQueue< T >.toString | ( | ) | 
Reimplemented in aud.Queue< T >, and aud.QueueDL< T >.
Definition at line 36 of file AbstractQueue.java.