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
|
#include "test_MI.h"
int test_MI_plus (int iterations)
{
int error = 0;
int i;
// Check commutativity.
for (i = iterations; i > 0; i--) {
cl_I m = testrandom_I();
cl_modint_ring R = find_modint_ring(m);
cl_MI a = R->canonhom(testrandom_I());
cl_MI b = R->canonhom(testrandom_I());
ASSERT3(a+b == b+a, m,a,b);
}
// Check associativity.
for (i = iterations; i > 0; i--) {
cl_I m = testrandom_I();
cl_modint_ring R = find_modint_ring(m);
cl_MI a = R->canonhom(testrandom_I());
cl_MI b = R->canonhom(testrandom_I());
cl_MI c = R->canonhom(testrandom_I());
ASSERT4((a+b)+c == a+(b+c), m,a,b,c);
}
// Check special case 0.
for (i = iterations; i > 0; i--) {
cl_I m = testrandom_I();
cl_modint_ring R = find_modint_ring(m);
cl_MI a = R->canonhom(testrandom_I());
cl_MI z = R->zero();
ASSERT2(a+z == a, m,a);
}
return error;
}
|
