Re: Encrypting (and bit-shifting)

new topic     » topic index » view thread      » older message » newer message 

Pete Eberlein asks:
> What about dividing by constant powers of 2?  Is this done using a
> number of shift right's?

Only integer divide by 2 is optimized to a shift-right.
But at least when you say x = floor(y/n)
where y and n are integers,
it will optimize it to an integer divide, rather than
using a floating-point divide plus an explicit floor operation.

Regards,
  Rob Craig
  Rapid Deployment Software

new topic     » topic index » view thread      » older message » newer message

Search



Quick Links

User menu

Not signed in.

Misc Menu