AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
VerboseQueue.java
Go to the documentation of this file.
1package aud.example;
2
3import java.util.NoSuchElementException;
4import aud.Queue;
5
14public class VerboseQueue<T> extends Queue<T> {
15
16 int size_ = 0;
17
18 public VerboseQueue() {}
19
20 @Override public T dequeue() throws NoSuchElementException {
21 T x=super.dequeue();
22 --size_;
23 print("dequeue "+x);
24 return x;
25 }
26
27 @Override public void enqueue(T x) {
28 super.enqueue(x);
29 print("enqueue "+x);
30 ++size_;
31 }
32
33 private void print(String message) {
34 for (int i=0;i<size_;++i)
35 System.err.print(" ");
36 System.err.println(message+" => "+toString());
37 }
38
39};
Implementation of AbstractQueue as a (dynamically resized) circular buffer based on array.
Definition: Queue.java:11
String toString()
Get string representation.
Definition: Queue.java:152
A queue that outputs messages on enqueue and dequeue.
void enqueue(T x)
Enqueue element at end of queue.
T dequeue()
Remove front element from queue.
AuD lecture: Data structures, algorithms, examples.