OK, I have a lot of integers, and I want to sorta simulate floating point by treating all numbers as if they're several times smaller than they really are. However, in the end, I'll still have to divide by the number I used. Now, I heard dividing is relatively slow, so I thought it should be possible to speed it up by dividing by 256, by reading only the first 3 bytes of the int. How should I go about this?
You could look at bitshifting.......this ises the '<<' and '>>' operators
The first chapter of Randal Hydes Art of Assembly is called "Data Representation" and covers bit manipulation real well - all be it in an assembler book....but no ASM is in this chapter (Well its the first chapter on the X86 version....probably a little later in the newer versions)
Try here
Hmm... That way, I'd have to shift all bits 8 positions to the right.
What's the syntax of those operators?
( EDIT: ) OK, I looked it up. Do these things work for ints like they do for um... other things? Would N >>= 8 do the trick?
Last edited by Boksha; 04-04-2002 at 03:43 PM.
X>>=8;
MagosX.com
Give a man a fish and you feed him for a day.
Teach a man to fish and you feed him for a lifetime.
OK, that was exactly what I needed. Thank you both!
