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
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
|
/* Copyright (C) 2001 ACUNIA
This file is part of Mauve.
Mauve is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 2, or (at your option)
any later version.
Mauve 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 General Public License for more details.
You should have received a copy of the GNU General Public License
along with Mauve; see the file COPYING. If not, write to
the Free Software Foundation, 59 Temple Place - Suite 330,
Boston, MA 02111-1307, USA.
*/
// Tags: JDK1.2
package gnu.testlet.java.util.Stack;
import gnu.testlet.Testlet;
import gnu.testlet.TestHarness;
import java.util.*;
/**
* Written by ACUNIA. <br>
* <br>
* this file contains test for java.util.Stack <br>
*
*/
public class AcuniaStackTest implements Testlet
{
protected TestHarness th;
public void test (TestHarness harness)
{
th = harness;
test_empty();
test_peek();
test_pop();
test_push();
test_search();
}
/**
* implemented.
*
*/
public void test_empty(){
th.checkPoint("empty()boolean");
Stack s = new Stack();
th.check(s.empty() , "a new stack is empty");
s.push(this);
th.check(!s.empty() , "this stack is not empty");
s.pop();
th.check(s.empty() , "the stack is empty now");
}
/**
* implemented.
*
*/
public void test_peek(){
th.checkPoint("peek()java.lang.Object");
Stack s = new Stack();
try { s.peek();
th.fail("should throw EmptyStackException");
}
catch (EmptyStackException ee){ th.check(true);}
s.add("a"); s.add("b") ; s.add("c");
th.check("c".equals(s.peek()) , "top element is c, but got:"+s.peek());
s.add(null);
th.check(s.peek()== null , "top element is null");
}
/**
* implemented.
*
*/
public void test_pop(){
th.checkPoint("pop()java.lang.Object");
Stack s = new Stack();
try { s.pop();
th.fail("should throw EmptyStackException -- 1");
}
catch (EmptyStackException ee){ th.check(true);}
s.add("a"); s.add("b") ; s.add("c");
th.check("c".equals(s.pop()) , "popped element is c");
th.check(!s.contains("c") , "element should be removed -- 1");
s.add(null);
th.check(s.pop()== null , "popped element is null");
th.check(!s.contains("c") , "element should be removed -- 2");
th.check("b".equals(s.pop()) , "popped element is b");
th.check(!s.contains("b") , "element should be removed -- 3");
th.check("a".equals(s.pop()) , "popped element is a");
th.check(!s.contains("a") , "element should be removed -- 4");
try { s.pop();
th.fail("should throw EmptyStackException -- 2");
}
catch (EmptyStackException ee){ th.check(true);}
}
/**
* implemented.
*
*/
public void test_push(){
th.checkPoint("push(java.lang.Object)java.lang.Object");
Stack s = new Stack();
th.check("c".equals(s.push("c")) , "pushed element is c");
th.check(s.contains("c") , "element should be added -- 1");
th.check("b".equals(s.push("b")) , "pushed element is b");
th.check(s.contains("b") , "element should be added -- 2");
th.check("a".equals(s.push("a")) , "pushed element is a");
th.check(s.contains("a") , "element should be added -- 3");
th.check(s.push(null) == null , "null is allowed");
th.check(s.lastElement()== null ,"added on the last place");
th.check(s.toString().equals("[c, b, a, null]"), "got:"+s.toString());
}
/**
* implemented.
*
*/
public void test_search(){
th.checkPoint("search(java.lang.Object)int");
Stack s = new Stack();
try {
th.check(s.search("a") == -1 , "empty stack should'n cause problems -- 1");
th.check(s.search(null) == -1 , "empty stack should'n cause problems -- 2");
}
catch(Exception e) { th.fail("got unwanted Exception:"+e); }
s.add("a"); s.add("b"); s.add("c"); s.add("a");
s.add("a"); s.add(null); s.add(null); s.add("top");
th.check( s.search("a") == 4, "checking position -- 1" );
th.check( s.search("b") == 7, "checking position -- 2" );
th.check( s.search("c") == 6 , "checking position -- 3" );
th.check( s.search("top") == 1, "checking position -- 4" );
th.check( s.search(null) == 2, "checking position -- 5" );
th.check( s.search("ab") == -1, "checking position -- 6" );
s.pop(); s.pop(); s.pop();
th.check( s.search("a") == 1, "checking position -- 7" );
th.check( s.search(null) == -1, "checking position -- 8" );
}
}
|
