On 02/17/09 03:15, Christian Thalinger wrote:
On Mon, 2009-02-16 at 14:33 -0800, Xiaobin Lu wrote:
Webrev: http://webrev.invokedynamic.info/xiaobin.lu/6622432/
6622432: RFE: Performance improvements to java.math.BigDecimal
As you know, the division operation is expensive and the
On Tue, 2009-02-17 at 14:20 +0100, Rémi Forax wrote:
> > 1. Is bitCount() called often and performance critical? There is a RFE
> > (6378821) to intrinsify it and I am thinking about to implement it.
> >
> It's not related to BigInteger but the fastest multi-dispatch algorithm
> that I know re
Hi Christian,
Christian Thalinger a écrit :
On Mon, 2009-02-16 at 14:33 -0800, Xiaobin Lu wrote:
Webrev: http://webrev.invokedynamic.info/xiaobin.lu/6622432/
6622432: RFE: Performance improvements to java.math.BigDecimal
As you know, the division operation is expensive and the
On Mon, 2009-02-16 at 14:33 -0800, Xiaobin Lu wrote:
> Webrev: http://webrev.invokedynamic.info/xiaobin.lu/6622432/
>
> 6622432: RFE: Performance improvements to java.math.BigDecimal
> As you know, the division operation is expensive and the
> algorithm to compare with the ten's power array ca
Webrev: http://webrev.invokedynamic.info/xiaobin.lu/6622432/
6622432: RFE: Performance improvements to java.math.BigDecimal
Details:
This work is targeted to improve the performance of BigDecimal and
related classes. Along with the performance improvement, the
implementation of many methods h
