You can not select more than 25 topics
			Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
		
		
		
		
		
			
		
			
				
					
					
						
							33 lines
						
					
					
						
							864 B
						
					
					
				
			
		
		
		
			
			
			
				
					
				
				
					
				
			
		
		
	
	
							33 lines
						
					
					
						
							864 B
						
					
					
				| #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; | |
| }
 |