blob: d7c2bfcd08555df923f9c107f318d6fd4443fcf8 (
plain)
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
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
|
/* LanguageTool, a natural language style checker
* Copyright (C) 2009 Daniel Naber (http://www.danielnaber.de)
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301
* USA
*/
package de.danielnaber.languagetool.tools;
import java.util.ArrayList;
import java.util.EmptyStackException;
/**
* Implements unsynchronized stack (contrary to default Java java.util.Stack,
* this one is based on ArrayList). Usage is the same as the java.util.Stack.
*
* @author Marcin Miłkowski.
*
*/
public class UnsyncStack<E> extends ArrayList<E> {
/**
* Generated automatically.
*/
private static final long serialVersionUID = -4984830372178073605L;
public UnsyncStack() {
}
/**
* Pushes an item onto the top of this stack. This has exactly the same effect
* as: <blockquote>
*
* <pre>
* add(item)
* </pre>
*
* </blockquote>
*
* @param item
* the item to be pushed onto this stack.
* @return the <code>item</code> argument.
* @see java.util.ArrayList#add
*/
public E push(E item) {
add(item);
return item;
}
/**
* Removes the object at the top of this stack and returns that object as the
* value of this function.
*
* @return The object at the top of this stack (the last item of the
* <tt>ArrayList</tt> object).
* @exception EmptyStackException
* if this stack is empty.
*/
public E pop() {
E obj;
int len = size();
obj = peek();
remove(len - 1);
return obj;
}
/**
* Looks at the object at the top of this stack without removing it from the
* stack.
*
* @return the object at the top of this stack (the last item of the
* <tt>ArrayList</tt> object).
* @exception EmptyStackException
* if this stack is empty.
*/
public E peek() {
int len = size();
if (len == 0)
throw new EmptyStackException();
return get(len - 1);
}
/**
* Tests if this stack is empty.
*
* @return <code>true</code> if and only if this stack contains no items;
* <code>false</code> otherwise.
*/
public boolean empty() {
return size() == 0;
}
/**
* Returns the 1-based position where an object is on this stack. If the
* object <tt>o</tt> occurs as an item in this stack, this method returns the
* distance from the top of the stack of the occurrence nearest the top of the
* stack; the topmost item on the stack is considered to be at distance
* <tt>1</tt>. The <tt>equals</tt> method is used to compare <tt>o</tt> to the
* items in this stack.
*
* @param o
* the desired object.
* @return the 1-based position from the top of the stack where the object is
* located; the return value <code>-1</code> indicates that the object
* is not on the stack.
*/
public int search(Object o) {
int i = lastIndexOf(o);
if (i >= 0) {
return size() - i;
}
return -1;
}
}
|
