Beefy Boxes and Bandwidth Generously Provided by pair Networks
Come for the quick hacks, stay for the epiphanies.
 
PerlMonks  

Re^2: Detecting whether UV fits into an NV

by syphilis (Archbishop)
on Mar 04, 2020 at 07:48 UTC ( [id://11113750]=note: print w/replies, xml ) Need Help??

Help for this page

Select Code to Download


  1. or download this
    long long smallest_invalid = last_set << 52;
    to
    long long smallest_invalid = last_set << 53;
    
  2. or download this
    1844674407366955264,
    1844674407366955776,
    ...
    1844674407366963968,
    1844674407366964480,
    1844674407366964992
    
  3. or download this
    use warnings;
    use Benchmark;
    ...
    
    die "Error in at least one of the XSubs" unless $count1 == $count2;
    __END__
    
  4. or download this
    Benchmark: timing 1 iterations of uv_fits_double3, uv_fits_double_bitf
    +iddle...
    uv_fits_double3:  0 wallclock secs ( 0.44 usr +  0.00 sys =  0.44 CPU)
    + @  2.29/s (n=1)
    ...
    uv_fits_double_bitfiddle:  1 wallclock secs ( 0.94 usr +  0.00 sys =  
    +0.94 CPU) @  1.07/s (n=1)
                (warning: too few iterations for a reliable count)
    12000001 12000001
    

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others cooling their heels in the Monastery: (8)
As of 2024-04-18 15:14 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found