int main(int argc, char *argv[]) {
frac_init();
Frac* frac = frac_make(2, 6);
frac_println(stdout, frac);
Frac* frac2 = frac_multiply(frac_alloc(), frac, frac);
frac_println(stdout, frac2);
Frac* frac3 = frac_add(frac_alloc(), frac2, frac);
frac_println(stdout, frac3);
Frac* frac4 = frac_divide(frac_alloc(), frac3, frac);
frac_println(stdout, frac4);
frac_free(frac4);
frac_free(frac3);
frac_free(frac2);
frac_free(frac);
// compute a summation approximation of e^x
int x = 2;
Frac* e = frac_make(0, 1);
for(int k = 0; k < 17; k++) {
Frac* term = frac_make(ipow(x, k), factorial(k));
frac_add(e, e, term);
frac_free(term);
}
frac_print(stdout, e);
printf(" ~= %lf\n", frac_approx(e));
// allocate and free a "large" number of fractions but never with
// many alive at once. A pool of only 2 fractions should be
// sufficient to satisfy this test.
for(int ii = 0; ii < 10000; ++ii) {
Frac* aFrac = frac_make(1,2);
frac_free(aFrac);
}
// then make sure nothing obviously broke
frac_println(stdout, e);
frac_free(e);
return 0;
}
static void test_fractions(CuTest *tc) {
variant a, b;
a = frac_make(120, 12000);
CuAssertIntEquals(tc, 1, a.sa[0]);
CuAssertIntEquals(tc, 100, a.sa[1]);
b = frac_make(23, 2300);
a = frac_add(a, b);
CuAssertIntEquals(tc, 1, a.sa[0]);
CuAssertIntEquals(tc, 50, a.sa[1]);
a = frac_mul(a, b);
CuAssertIntEquals(tc, 1, a.sa[0]);
CuAssertIntEquals(tc, 5000, a.sa[1]);
a = frac_div(b, b);
CuAssertIntEquals(tc, 1, a.sa[0]);
CuAssertIntEquals(tc, 1, a.sa[1]);
a = frac_sub(a, a);
CuAssertIntEquals(tc, 0, a.sa[0]);
a = frac_sub(frac_one, a);
CuAssertIntEquals(tc, 1, a.sa[0]);
CuAssertIntEquals(tc, 1, a.sa[1]);
a = frac_mul(a, frac_zero);
CuAssertIntEquals(tc, 0, a.sa[0]);
CuAssertIntEquals(tc, 1, frac_sign(frac_make(-1, -1)));
CuAssertIntEquals(tc, 1, frac_sign(frac_make(1, 1)));
CuAssertIntEquals(tc, -1, frac_sign(frac_make(-1, 1)));
CuAssertIntEquals(tc, -1, frac_sign(frac_make(1, -1)));
CuAssertIntEquals(tc, 0, frac_sign(frac_make(0, 1)));
/* we reduce large integers by calculating the gcd */
a = frac_make(480000, 3000);
CuAssertIntEquals(tc, 160, a.sa[0]);
CuAssertIntEquals(tc, 1, a.sa[1]);
/* if num is too big for a short, and the gcd is 1, we cheat: */
a = frac_make(480001, 3000);
CuAssertIntEquals(tc, 32000, a.sa[0]);
CuAssertIntEquals(tc, 200, a.sa[1]);
}
