This repository was archived by the owner on May 4, 2021. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathIntzillaTest.java
More file actions
264 lines (224 loc) · 8.39 KB
/
IntzillaTest.java
File metadata and controls
264 lines (224 loc) · 8.39 KB
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
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
import java.math.BigInteger;
import java.util.Random;
public class IntzillaTest {
public static void main(String[] args) {
Random generator = new Random();
{ //start sum test
boolean sumTest = true;
for(int i = 0; i < 100; i ++){
boolean negative_b1 = generator.nextBoolean();
BigInteger b = new BigInteger(64, generator);
if(negative_b1){
BigInteger makeNegative = new BigInteger("-1");
b = b.multiply(makeNegative);
}
boolean negative_b2 = generator.nextBoolean();
BigInteger b2 = new BigInteger(64, generator);
if(negative_b2){
BigInteger makeNegative = new BigInteger("-1");
b2 = b2.multiply(makeNegative);
}
Intzilla z = new Intzilla(b.toString());
Intzilla z2 = new Intzilla(b2.toString());
if(b.add(b2).toString().equals(z.sum(z2).toString())){
//do nothing
}
else{
sumTest = false;
}
}
if(sumTest){
System.out.println("The sum method is working properly");
}
else{
System.out.println("The sum method has returned one or more" +
" incorrect answers");
}
} //end sum test
{ //start difference test
boolean differenceTest = true;
for(int i = 0; i < 100; i ++){
boolean negative_b1 = generator.nextBoolean();
BigInteger b = new BigInteger(64, generator);
if(negative_b1){
BigInteger makeNegative = new BigInteger("-1");
b = b.multiply(makeNegative);
}
boolean negative_b2 = generator.nextBoolean();
BigInteger b2 = new BigInteger(64, generator);
if(negative_b2){
BigInteger makeNegative = new BigInteger("-1");
b2 = b2.multiply(makeNegative);
}
Intzilla z = new Intzilla(b.toString());
Intzilla z2 = new Intzilla(b2.toString());
if(b.subtract(b2).toString().equals(z.difference(z2).toString())){
//do nothing
}
else{
differenceTest = false;
}
}
if(differenceTest){
System.out.println("The difference method is working properly");
}
else{
System.out.println("The difference method has returned one or more" +
" incorrect answers");
}
} //end difference test
{ //start absoluteValue test
boolean absoluteValueTest = true;
for(int i = 0; i < 100; i ++){
boolean negative_b1 = generator.nextBoolean();
BigInteger b = new BigInteger(64, generator);
if(negative_b1){
BigInteger makeNegative = new BigInteger("-1");
b = b.multiply(makeNegative);
}
Intzilla z = new Intzilla(b.toString());
if(b.abs().toString().equals(z.absoluteVaule().toString())){
//do nothing
}
else{
absoluteValueTest = false;
}
}
if(absoluteValueTest){
System.out.println("The absoluteValue method is working properly");
}
else{
System.out.println("The absoluteValue method has returned one or more" +
" incorrect answers");
}
} //end absoluteValue test
{ //start product test
boolean productTest = true;
for(int i = 0; i < 100; i ++){
boolean negative_b1 = generator.nextBoolean();
BigInteger b = new BigInteger(64, generator);
if(negative_b1){
BigInteger makeNegative = new BigInteger("-1");
b = b.multiply(makeNegative);
}
boolean negative_b2 = generator.nextBoolean();
BigInteger b2 = new BigInteger(64, generator);
if(negative_b2){
BigInteger makeNegative = new BigInteger("-1");
b2 = b2.multiply(makeNegative);
}
Intzilla z = new Intzilla(b.toString());
Intzilla z2 = new Intzilla(b2.toString());
if(b.multiply(b2).toString().equals(z.product(z2).toString())){
//do nothing
}
else{
productTest = false;
}
}
if(productTest){
System.out.println("The product method is working properly");
}
else{
System.out.println("The product method has returned one or more" +
" incorrect answers");
}
} //end product test
{ //start quotient test
boolean quotientTest = true;
for(int i = 0; i < 100; i ++){
boolean negative_b1 = generator.nextBoolean();
BigInteger b = new BigInteger(64, generator);
if(negative_b1){
BigInteger makeNegative = new BigInteger("-1");
b = b.multiply(makeNegative);
}
boolean negative_b2 = generator.nextBoolean();
BigInteger b2 = new BigInteger(32, generator);
if(negative_b2){
BigInteger makeNegative = new BigInteger("-1");
b2 = b2.multiply(makeNegative);
}
Intzilla z = new Intzilla(b.toString());
Intzilla z2 = new Intzilla(b2.toString());
if(b.divide(b2).toString().equals(z.quotient(z2).toString())){
//do nothing
}
else{
quotientTest = false;
}
}
if(quotientTest){
System.out.println("The quotient method is working properly");
}
else{
System.out.println("The quotient method has returned one or more" +
" incorrect answers");
}
} //end quotient test
{ //start remainder test
boolean remainderTest = true;
for(int i = 0; i < 100; i ++){
boolean negative_b1 = generator.nextBoolean();
BigInteger b = new BigInteger(64, generator);
if(negative_b1){
BigInteger makeNegative = new BigInteger("-1");
b = b.multiply(makeNegative);
}
boolean negative_b2 = generator.nextBoolean();
BigInteger b2 = new BigInteger(64, generator);
if(negative_b2){
BigInteger makeNegative = new BigInteger("-1");
b2 = b2.multiply(makeNegative);
}
Intzilla z = new Intzilla(b.toString());
Intzilla z2 = new Intzilla(b2.toString());
if(b.remainder(b2).toString().equals(z.remainder(z2).toString())){
//do nothing
}
else{
remainderTest = false;
}
}
if(remainderTest){
System.out.println("The remainder method is working properly");
}
else{
System.out.println("The remainder method has returned one or more" +
" incorrect answers");
}
} //end remainder test
{ //start gcd test
boolean gcdTest = true;
for(int i = 0; i < 100; i ++){
boolean negative_b1 = generator.nextBoolean();
BigInteger b = new BigInteger(64, generator);
if(negative_b1){
BigInteger makeNegative = new BigInteger("-1");
b = b.multiply(makeNegative);
}
boolean negative_b2 = generator.nextBoolean();
BigInteger b2 = new BigInteger(64, generator);
if(negative_b2){
BigInteger makeNegative = new BigInteger("-1");
b2 = b2.multiply(makeNegative);
}
Intzilla z = new Intzilla(b.toString());
Intzilla z2 = new Intzilla(b2.toString());
if(b.gcd(b2).toString().equals(Intzilla.gcd(z,z2).toString())){
//do nothing
}
else{
gcdTest = false;
}
}
if(gcdTest){
System.out.println("The gcd method is working properly");
}
else{
System.out.println("The gcd method has returned one or more" +
" incorrect answers");
}
} //end gcd test
}
}