01: /*
02: * @(#)Queue.java 1.0 02/02/01
03: *
04: * Copyright (C) 2001 Gaudenz Alder
05: *
06: * This library is free software; you can redistribute it and/or
07: * modify it under the terms of the GNU Lesser General Public
08: * License as published by the Free Software Foundation; either
09: * version 2.1 of the License, or (at your option) any later version.
10: *
11: * This library is distributed in the hope that it will be useful,
12: * but WITHOUT ANY WARRANTY; without even the implied warranty of
13: * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14: * Lesser General Public License for more details.
15: *
16: * You should have received a copy of the GNU Lesser General Public
17: * License along with this library; if not, write to the Free Software
18: * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
19: *
20: */
21:
22: package hero.client.grapheditor;
23:
24: import java.util.Vector;
25:
26: /**
27: * Class to implement a simple queue of integers.
28:
29: * </p>Here is the <a href="../algorithm/shawn/Queue.java">source</a>.
30: */
31:
32: public class Queue {
33: private static int size;
34: Vector array;
35:
36: public Queue() {
37: array = new Vector();
38: }
39:
40: public int push(int item) {
41: int num;
42: array.addElement(new Integer(item));
43: num = array.size();
44: return num;
45: }
46:
47: public int pop() {
48: int item;
49: item = ((Integer) array.elementAt(0)).intValue();
50: array.removeElementAt(0);
51: return item;
52: }
53:
54: public boolean isEmpty() {
55: return (array.isEmpty());
56: }
57: }
|