On 23.08.2017 14:11, Benito van der Zander wrote:
Btw, anyone know about a BCD math implementation for Free Pascal, like
it used to be implemented in DR CBASIC? (those were the days... ;-) )
Why do BCD math if you need a predefined number of correct digits after
the "point" and a "limited" count of digits before ?
Here you could do Int64 and consider a factor of 1/10^n. Would be a lot
faster.
Seems like a candidate for type helper and overloading "*" and "div".
-Michael
_______________________________________________
fpc-pascal maillist - fpc-pascal@lists.freepascal.org
http://lists.freepascal.org/cgi-bin/mailman/listinfo/fpc-pascal
