leventov opened a new pull request #2: Simplify midpoint computation in solveInverseCumulativeProbability URL: https://github.com/apache/commons-statistics/pull/2 Simplifies midpoint calculation in `AbstractDiscreteDistribution.solveInverseCumulativeProbability()` by leveraging unsigned shift instruction. Not only this allows avoiding a branch, `<<< 1` is also cheaper than `/ 2` in Java, see https://lemire.me/blog/2017/05/09/signed-integer-division-by-a-power-of-two-can-be-expensive/
---------------------------------------------------------------- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. For queries about this service, please contact Infrastructure at: [email protected] With regards, Apache Git Services
