commons-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "" <>
Subject [math] MATH-841 gcd speed up
Date Mon, 06 Aug 2012 01:44:13 GMT

The gcd(int,int) method of ArithmeticUtils seems 2 times slower than the
naive approach using modulo operator.
Gilles tested the patch separately and found similar performance penalty.
Please check it out:

Anyone aware of an environment were the modulo operator is painfully slow ?

Gilles pointed out that my patch don't conform to CM formating style, I
will correct that as well as the javadoc (its mention of the binary gcd
algorithm) if the code change is basically approved here. Please let me

-------------------------------------------------------------------- - Microsoft® Exchange solutions from a leading provider -

To unsubscribe, e-mail:
For additional commands, e-mail:

View raw message