Beefy Boxes and Bandwidth Generously Provided by pair Networks
laziness, impatience, and hubris
 
PerlMonks  

Re^5: Determining the minimum representable increment/decrement possible? (Perl's scanf broken?)

by ikegami (Patriarch)
on Jun 19, 2016 at 04:45 UTC ( [id://1166062]=note: print w/replies, xml ) Need Help??


in reply to Re^4: Determining the minimum representable increment/decrement possible? (Perl's scanf broken?)
in thread Determining the minimum representable increment/decrement possible?

Why not use the underlying CRTs sscanf() or strtod()?

I think differences in stringifications of Inf and NaN played a roll.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1166062]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others meditating upon the Monastery: (7)
As of 2024-03-29 14:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found