...
 
Commits (2)
......@@ -231,7 +231,7 @@ Data *Data__readfile(Data *self, char *filename)
int err = mpz_set_str(new_node->N, current_line, 10);
if (err == -1){
__Data__iterate(head, (Data * (*)(Data *, void *))&__Data__destroy, NULL);
__Data__destroy(new_node);
__Data__destroy(new_node, NULL);
fclose(infile);
errno = EINVAL;
return NULL;
......@@ -428,7 +428,7 @@ void Test_add_small_factor(void)
CU_ASSERT(mpz_cmp_ui(node->remainder, 1) == 0);
__Data__destroy(node);
__Data__destroy(node, NULL);
}
void Test_add_small_factor_unsorted(void){
......@@ -449,7 +449,7 @@ void Test_add_small_factor_unsorted(void){
CU_ASSERT(mpz_cmp_ui(node->remainder, 1) == 0);
__Data__destroy(node);
__Data__destroy(node, NULL);
}
void Test_add_big_factor(void)
......
......@@ -24,7 +24,7 @@ uint16_t *SieveOfEratosthenes(uint32_t n)
* SieveOfEratosthenes() returns a uint16_t 0 terminated table
* containing all the primes < to a limit n.
*
* @param n the upper bound of the table to be calculated.
* @param n the upper bound of the table to be calculated should be < 2**16.
* @return a uint16_t allocated table of primes or NULL if malloc fails.
**/
{
......
279894621436729470929919969131824830945779603377
279894621436729470929919969131824830945779603377
\ No newline at end of file
103134698743850379072343040373917155822701340489356805010469029
103134698743850379072343040373917155822701340489356805010469029
\ No newline at end of file