/** * @author M. Esponda * @version 1.0 */ package datenstrukturen; public class Queue { private int head; private int tail; Object[] queue; public Queue( int max ) { head = tail = 0; queue = new Object[max]; } public Queue() { this( 100 ); } public boolean empty() { return head == tail; } public boolean full() { return head == tail+1; } public void enqueue ( Object o ) { if ( !full() ) queue[tail] = o; if ( tail==(queue.length-1) ) tail = 0; else tail++; } public Object dequeue () { if ( !empty() ) { Object o = queue[head]; if ( head == (queue.length-1) ) head = 0; else head++; return o; } else return null; } public void print() { for ( int i=0; i