RFR: JDK-8323186: A faster algorithm for MutablebigInteger.divWord(long, int) [v4]
Brian Burkhalter
bpb at openjdk.org
Mon Jan 22 20:05:30 UTC 2024
On Mon, 22 Jan 2024 18:52:43 GMT, fabioromano1 <duke at openjdk.org> wrote:
>> The method `MutableBigInteger.divWord(long, int)` can use the algorithm of Hacker's Delight (2nd ed), section 9.3, the same used in `Long.divideUnsigned(long, long)` and `Long.remainderUnsigned(long, long)`, to get the computation faster.
>
> fabioromano1 has updated the pull request incrementally with one additional commit since the last revision:
>
> Update TestDivWord.java
>
> Added method to check results of divWord
test/jdk/java/math/BigInteger/TestDivWord.java line 5:
> 3: import java.util.Random;
> 4:
> 5: public class TestDivWord {
Where is this used in actually jtreg testing?
-------------
PR Review Comment: https://git.openjdk.org/jdk/pull/17291#discussion_r1462355967
More information about the core-libs-dev
mailing list