AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
aud.example.VerboseQueue< T > Class Template Reference

A queue that outputs messages on enqueue and dequeue. More...

+ Inheritance diagram for aud.example.VerboseQueue< T >:
+ Collaboration diagram for aud.example.VerboseQueue< T >:

Public Member Functions

 VerboseQueue ()
 
dequeue () throws NoSuchElementException
 Remove front element from queue. More...
 
void enqueue (T x)
 Enqueue element at end of queue. More...
 
- Public Member Functions inherited from aud.Queue< T >
 Queue ()
 create empty queue More...
 
 Queue (int capacity)
 create empty queue and reserve storage More...
 
boolean is_empty ()
 Is queue empty? More...
 
front ()
 Get front element of queue. More...
 
dequeue ()
 Remove front element from queue. More...
 
void enqueue (T x)
 Enqueue element at end of queue. More...
 
String toString ()
 Get string representation. More...
 
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

A queue that outputs messages on enqueue and dequeue.

On enqueue (dequeue) print the new (removed) entry to System.err. The printed message is indented by the size of the queue.

You can replace Queue in any class by VerboseQueue to trace modifications of the queue.

Definition at line 14 of file VerboseQueue.java.

Constructor & Destructor Documentation

◆ VerboseQueue()

Definition at line 18 of file VerboseQueue.java.

18{}

Member Function Documentation

◆ dequeue()

T aud.example.VerboseQueue< T >.dequeue ( ) throws NoSuchElementException

Remove front element from queue.

Requires !is_empty().

Exceptions
NoSuchElementException
Returns
removed element

Reimplemented from aud.Queue< T >.

Definition at line 20 of file VerboseQueue.java.

20 {
21 T x=super.dequeue();
22 --size_;
23 print("dequeue "+x);
24 return x;
25 }

Referenced by aud.example.IterativePreorderTraversal.level_order_traversal().

+ Here is the caller graph for this function:

◆ enqueue()

void aud.example.VerboseQueue< T >.enqueue ( x)

Enqueue element at end of queue.

Parameters
xnew element

Reimplemented from aud.Queue< T >.

Definition at line 27 of file VerboseQueue.java.

27 {
28 super.enqueue(x);
29 print("enqueue "+x);
30 ++size_;
31 }

Referenced by aud.example.IterativePreorderTraversal.level_order_traversal().

+ Here is the caller graph for this function:

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