> 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 ------------- Changes: - all: https://git.openjdk.org/jdk/pull/17291/files - new: https://git.openjdk.org/jdk/pull/17291/files/2460b066..67e3027f Webrevs: - full: https://webrevs.openjdk.org/?repo=jdk&pr=17291&range=03 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=17291&range=02-03 Stats: 14 lines in 1 file changed: 11 ins; 0 del; 3 mod Patch: https://git.openjdk.org/jdk/pull/17291.diff Fetch: git fetch https://git.openjdk.org/jdk.git pull/17291/head:pull/17291 PR: https://git.openjdk.org/jdk/pull/17291