Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Power of two round up.

by Dominus (Parson)
on Dec 17, 2000 at 05:35 UTC ( [id://47091]=note: print w/replies, xml ) Need Help??


in reply to Re: Re: Power of two round up.
in thread Power of two round up.

Sure, because it has to dispatch many fewer opcodes. But if I had wanted to use the log2 x solution, I wouldn't have asked in the first place. Floating-point arithmetic gives me the heebie-jeebies.

Replies are listed 'Best First'.
Re: Re: Power of two round up.
by I0 (Priest) on Dec 18, 2000 at 22:44 UTC
    Floating-point gives me heebie-jeebies too. (in fact, a floating conversion seems to be what makes the |>> method fail for @_ = (0)
    --then again, log(0) doesn't work either, and the |>> method does work for @_=(0) if you use integer;)
    P.S. Why does an opcode fetch take longer than a transcendental function? I'm sure that part of the interpreter must have been fully optimized.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others perusing the Monastery: (6)
As of 2024-04-23 19:34 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found