Skip to main content
aboutsummaryrefslogtreecommitdiffstats
blob: ff4b790a45aaf1bafa50710b1b99a3aa9a3fcca7 (plain) (blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
/*******************************************************************************
 * Copyright (c) 2007 IBM Corporation and others.
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * which accompanies this distribution, and is available at
 * http://www.eclipse.org/legal/epl-v10.html
 *
 * Contributors:
 *     IBM Corporation - initial API and implementation
 ******************************************************************************/
package org.eclipse.core.internal.databinding;

/**
 * Created to avoid a dependency on java.util.LinkedList, see bug 205224.
 * 
 * @since 1.1
 * 
 */
public class Queue {

	static class Entry {
		Object object;

		Entry(Object o) {
			this.object = o;
		}

		Entry next;
	}

	Entry first;
	Entry last;

	/**
	 * Adds the given object to the end of the queue.
	 * 
	 * @param o
	 */
	public void enqueue(Object o) {
		Entry oldLast = last;
		last = new Entry(o);
		if (oldLast != null) {
			oldLast.next = last;
		} else {
			first = last;
		}
	}

	/**
	 * Returns the first object in the queue. The queue must not be empty.
	 * 
	 * @return the first object
	 */
	public Object dequeue() {
		Entry oldFirst = first;
		if (oldFirst == null) {
			throw new IllegalStateException();
		}
		first = oldFirst.next;
		if (first == null) {
			last = null;
		}
		oldFirst.next = null;
		return oldFirst.object;
	}

	/**
	 * Returns <code>true</code> if the list is empty.
	 * 
	 * @return <code>true</code> if the list is empty
	 */
	public boolean isEmpty() {
		return first == null;
	}
}

Back to the top