>>>>> "j" == john/lori <henk@access1.net> writes:
j> Depending on exactly what you are trying to achieve, it might make
j> sense to "hard code" the math for speed. Especially for division.
j> ie build the numbers into the code. Presumably, T/H/S is more or
j> less constant. (you would need a custom routine for each possible
j> T/H/S of course) so, for example, if you know you're multiplying by
j> 63 shift 6bits and subtract (mutiply by 64 and subtract 1) no need
j> to test bits, you already know what they are.
Incidentally, multiplying by a fixed number is covered in Go64 8/2000
that got sent out last week.
--
___ . . . . . + . . o
_|___|_ + . + . + . . Per Olofsson, konstnär
o-o . . . o + MagerValp@cling.gu.se
- + + . http://www.cling.gu.se/~cl3polof/
Message was sent through the cbm-hackers mailing list
Archive generated by hypermail 2.1.1.