Subversion Repositories programming

Rev

Rev 24 | Show entire file | Ignore whitespace | Details | Blame | Last modification | View Log | RSS feed

Rev 24 Rev 26
Line 2... Line 2...
2 
//11-03-2004
 2 
//11-03-2004
3 
 
 3 
 
4 
import java.util.LinkedList;
 4 
import java.util.LinkedList;
5 
 
 5 
 
6 
class Queue {
 6 
class Queue {
7 
	private LinkedList list;
 7 
    private LinkedList list;
8 
 
 8 
 
9 
	public Queue( ) { list = new LinkedList(); } //create an empty queue
 9 
    public Queue( ) { list = new LinkedList(); } //create an empty queue
10
10
11 
	//put the item at the back of the queue
 11 
    //put the item at the back of the queue
12 
	public void enqueue( Object o ) {
12 
    public void enqueue( Object o ) {
13 
		if( list.isEmpty() ) { list.add(o); }
 13 
        if( list.isEmpty() ) { list.add(o); }
14 
		else { list.addLast(o); }
14 
        else { list.addLast(o); }
15 
	}
 15 
    }
16
16
17 
	//remove the item from the front of the queue
 17 
    //remove the item from the front of the queue
18 
	public Object dequeue() { return list.removeFirst(); }
 18 
    public Object dequeue() { return list.removeFirst(); }
19 
 
 19 
 
20 
	//check if the queue is empty
 20 
    //check if the queue is empty
21 
	public boolean isEmpty() { return list.isEmpty(); }
 21 
    public boolean isEmpty() { return list.isEmpty(); }
22 
}
 22 
}
23 
 
 23