On Wed, 7 May 2025 15:03:36 GMT, fabioromano1 <d...@openjdk.org> wrote:
>> 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: > > Removed needless brackets The large number algorithm loop in `pow()` might deserve an invariant in a comment. Did you make sure that the existing tests also cover the `unsignedLongPow()` sufficiently well? ------------- PR Comment: https://git.openjdk.org/jdk/pull/24690#issuecomment-2859115099
