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
|
#include "test_I.h"
int test_I_div (int iterations)
{
int error = 0;
int i;
// Check floor.
for (i = iterations; i > 0; i--) {
cl_I a = testrandom_I();
cl_I b = testrandom_I();
if (b != 0) {
cl_I_div_t qr = floor2(a,b);
const cl_I& q = qr.quotient;
const cl_I& r = qr.remainder;
ASSERT2(a == q*b+r, a,b);
ASSERT2(b >= 0 ? (r >= 0 && r < b) : (r <= 0 && r > b), a,b);
}
}
// Check ceiling.
for (i = iterations; i > 0; i--) {
cl_I a = testrandom_I();
cl_I b = testrandom_I();
if (b != 0) {
cl_I_div_t qr = ceiling2(a,b);
const cl_I& q = qr.quotient;
const cl_I& r = qr.remainder;
ASSERT2(a == q*b+r, a,b);
ASSERT2(b >= 0 ? (r <= 0 && r > -b) : (r >= 0 && r < -b), a,b);
}
}
// Check truncate.
for (i = iterations; i > 0; i--) {
cl_I a = testrandom_I();
cl_I b = testrandom_I();
if (b != 0) {
cl_I_div_t qr = truncate2(a,b);
const cl_I& q = qr.quotient;
const cl_I& r = qr.remainder;
ASSERT2(a == q*b+r, a,b);
if (b >= 0)
if (a >= 0)
{ ASSERT2(r >= 0 && r < b, a,b); }
else
{ ASSERT2(r <= 0 && r > -b, a,b); }
else
if (a >= 0)
{ ASSERT2(r >= 0 && r < -b, a,b); }
else
{ ASSERT2(r <= 0 && r > b, a,b); }
}
}
// Check round.
for (i = iterations; i > 0; i--) {
cl_I a = testrandom_I();
cl_I b = testrandom_I();
if (b != 0) {
cl_I_div_t qr = round2(a,b);
const cl_I& q = qr.quotient;
const cl_I& r = qr.remainder;
ASSERT2(a == q*b+r, a,b);
ASSERT2(2*abs(r) <= abs(b), a,b);
if (2*abs(r) == abs(b))
ASSERT2(evenp(q), a,b);
}
}
return error;
}
|
