Tomasz Sowa
019a902fed
the remainder from a division '%' was changed with a bitwise And operation '&'
((i % 5) == 0) was changed to: ((i & 3) == 0) - it means ((i % 4) == 0)
now the test if performed after 4 iterations (early were after 5 iterations)
we can do that when the divisor is a power of 2
changed: optimization in Factorial()
we're testing WasStopSignal() only after a few iterations
it's faster now about 4 times on GCC 4.3.3 (when stop object is provided to the factorial)
git-svn-id: svn://ttmath.org/publicrep/ttmath/trunk@161 e52654a7-88a9-db11-a3e9-0013d4bc506e
|
||
|---|---|---|
| .. | ||
| ttmath.h | ||
| ttmathbig.h | ||
| ttmathint.h | ||
| ttmathobjects.h | ||
| ttmathparser.h | ||
| ttmathtypes.h | ||
| ttmathuint.h | ||
| ttmathuint_noasm.h | ||
| ttmathuint_x86.h | ||
| ttmathuint_x86_64.h | ||