27 Jun
2004
27 Jun
'04
12:18 p.m.
Tim Goetze wrote:
[Simon Jenkins]
Yes it does. And another copy of value because the one you start out with
gets destroyed. And the result, when its 1, is the integer 1 not the
float 1.0
so you either need to (...etc etc).
Tim Goetze wrote:
elegant indeed (though the exponent is not in the lowest 8 bits so it
needs another shift, no?)
8-bit exponent and no assumption about its value
made, 8 binary
'shift', 7 'or' and 1 'and' statement if i'm not badly
mistaken. and
if i'm not, a branch will probably hurt less.
Three shifts, three copys, three 'or's and an 'and':
copy = value;
value |= copy >> 4;
copy = value;
value |= copy >> 2;
copy = value;
value |= copy >> 1;
value &= 0x01;