Re^2: Determining the minimum representable increment/decrement possible?

Is your perl compiled to use long doubles for NV?

I ask because my perl is using normal doubles and I get different results to you:

printf "% 25.32g\n", unpack 'F', pack 'b*', '1000000000000000000000000
+000000000000000000000000000011111111100';;
      0.50000000000000011
[download]

(In general I think you've hit on at least part of the solution to my quest; though it is complicated by the production of denormals; which I'm still trying to wrap my head around; so I ll get back to you once I've wrapped my brain around them.)

With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'

Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.

"Science is about questioning the status quo. Questioning authority". I knew I was on the right track :)

In the absence of evidence, opinion is indistinguishable from prejudice. Not understood.

Comment on Re^2: Determining the minimum representable increment/decrement possible? Download Code

Replies are listed 'Best First'.
Re^3: Determining the minimum representable increment/decrement possible? by ikegami (Patriarch) on Jun 15, 2016 at 20:14 UTC
I think this is due to differences in the C library. You're using a Windows build, right? I think this has been unified in 5.22.	[reply]