Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer
 
PerlMonks  

Re^4: search for chr() fails (-lanse)

by tbone654 (Beadle)
on May 21, 2013 at 02:40 UTC ( #1034450=note: print w/replies, xml ) Need Help??


in reply to Re^3: search for chr() fails (-lanse)
in thread search for chr() fails

VERY NICE! thank you...

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://1034450]
help
Chatterbox?
[pryrt]: 1nickt, sprintf "%.16e", $v will always give enough precision to see 1 ULP (the smallest fractional part) of a standard 64bit Perl NV*
[pryrt]: (*: for systems where $Config{nvsize}==8 )
[pryrt]: Thus, that's "enough precision" to tell the difference between 1.0 and 1.0+1ULP
[pryrt]: But in what circumstance does your problem arise? When, in Perl, does the integer 1 not work identically to the floating-point NV 1.0000000000000000 e0?

How do I use this? | Other CB clients
Other Users?
Others pondering the Monastery: (15)
As of 2017-05-24 19:13 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?