> This PR optimizes `BigInteger.pow(int)` method. The primary enhancement in > `pow()` is not concerned most on execution time, but rather in memory > optimization, because the PR implementation does the "shift of the exponent" > squaring the result rather than the base, so the base is not squared like in > the current implementation, and this permits to save about half of the memory.
fabioromano1 has updated the pull request incrementally with one additional commit since the last revision: Simplified the formula for detecting overflows ------------- Changes: - all: https://git.openjdk.org/jdk/pull/24690/files - new: https://git.openjdk.org/jdk/pull/24690/files/ad49b56e..68959267 Webrevs: - full: https://webrevs.openjdk.org/?repo=jdk&pr=24690&range=47 - incr: https://webrevs.openjdk.org/?repo=jdk&pr=24690&range=46-47 Stats: 3 lines in 1 file changed: 0 ins; 2 del; 1 mod Patch: https://git.openjdk.org/jdk/pull/24690.diff Fetch: git fetch https://git.openjdk.org/jdk.git pull/24690/head:pull/24690 PR: https://git.openjdk.org/jdk/pull/24690
