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
151
152
153
154
155
156
157
158
159
160
161
162
163
|
// Tags: JDK1.0
/* Copyright (C) 1999 Artur Biesiadowski
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. */
package gnu.testlet.java.util.BitSet;
import gnu.testlet.Testlet;
import gnu.testlet.TestHarness;
import java.util.BitSet;
public class jdk10 implements Testlet
{
TestHarness h;
public void test ( TestHarness harness )
{
h = harness;
BitSet b1, b2, b3, b4, b5;
h.checkPoint("Clone/Equals");
b1 = new BitSet();
b2 = (BitSet)b1.clone();
h.check( trulyEquals(b1,b2) );
b1 = new BitSet(100);
h.check( trulyEquals(b1,b2) );
b1.set(5);
h.check( !trulyEquals(b1,b2) );
b2 = (BitSet)b1.clone();
h.check( trulyEquals(b1,b2));
h.check(!b2.equals(null));
h.checkPoint("NegativeSize");
try {
b1 = new BitSet(-1);
h.check(false);
} catch ( NegativeArraySizeException e )
{
h.check(true);
}
h.checkPoint("Set/Clear/Get");
b1 = new BitSet();
b1.set(1);
b1.set(200);
b1.set(0);
h.check(b1.get(0));
h.check(b1.get(1));
h.check(!b1.get(2));
h.check(b1.get(200));
b1.clear(0);
h.check(!b1.get(0));
h.checkPoint("Set/Clear/Get negative index");
try {
b1.set(-1);
h.check(false);
} catch ( IndexOutOfBoundsException e )
{
h.check(true);
}
try {
b1.get(-1);
h.check(false);
} catch ( IndexOutOfBoundsException e )
{
h.check(true);
}
try {
b1.clear(-1);
h.check(false);
} catch ( IndexOutOfBoundsException e )
{
h.check(true);
}
h.checkPoint("toString");
h.check(b1.toString().equals("{1, 200}"));
b1.set(2);
b1.set(11);
h.check(b1.toString().equals("{1, 2, 11, 200}"));
b2 = new BitSet(100);
h.check(b2.toString().equals("{}"));
b2.set(1);
h.check(b2.toString().equals("{1}"));
h.checkPoint("Hashcode");
h.check(b1.hashCode() == 2260);
b3 = new BitSet();
h.check(b3.hashCode() == 1234);
h.checkPoint("And/Or/Xor");
b2.set(1);
b2.set(3);
b2.set(200);
b2.set(300);
b2.and(b1);
h.check( b2.toString().equals("{1, 200}") );
b1.set(17);
b2.set(15);
b2.or(b1);
h.check( b2.toString().equals("{1, 2, 11, 15, 17, 200}") );
b2.xor(b2);
h.check( b2.toString().equals("{}") );
b2.xor(b1);
b3.or(b1);
h.check( trulyEquals(b2,b3) );
h.checkPoint("NullPointerExceptions");
try {
b1.and(null);
h.check(false);
} catch ( NullPointerException e )
{
h.check(true);
}
try {
b1.or(null);
h.check(false);
} catch ( NullPointerException e )
{
h.check(true);
}
try {
b1.xor(null);
h.check(false);
} catch ( NullPointerException e )
{
h.check(true);
}
}
private boolean trulyEquals( BitSet b1, BitSet b2 )
{
boolean e1 = b1.equals(b2);
boolean e2 = true;
for ( int i = 0; i < 300; i++ )
{
if ( b1.get(i) != b2.get(i) )
e2 = false;
}
h.check (e1 == e2);
return e2;
}
}
|
