RFR: 8334755: Asymptotically faster implementation of square root algorithm [v28]

[Raffaello Giulietti]

On Wed, 17 Jul 2024 14:11:20 GMT, fabioromano1 <duke at openjdk.org> wrote:

>> There are no counterexamples for perfect squares if you write `long s = (long) Math.rint(Math.sqrt(x >= 0 ? x : x + 0x1p64));`.
>
> @rgiulietti Is it normal that the same code did not find counterexamples until recently, and now it finds them?

I tried on older release, they all agree.

-------------

PR Review Comment: https://git.openjdk.org/jdk/pull/19710#discussion_r1681142046