Talk:Find first and last set bit of a long integer: Difference between revisions
Content added Content deleted
(→Errors: Maybe the '''lwb''' and '''upb''' routines can be modelled (and renamed) to ␣␣␣/␣␣␣ to avoid confusion?) |
m (→More Clarification "set bit": missing key word ZERO) |
||
Line 3: | Line 3: | ||
The example gives <pre>INT: find first & last set bit |LWB|UPB|Bits |
The example gives <pre>INT: find first & last set bit |LWB|UPB|Bits |
||
0| 33| 32|0</pre> |
0| 33| 32|0</pre> |
||
How are there any set bits in an unsigned integer? --[[User:Dgamey|Dgamey]] 03:43, 8 December 2011 (UTC) |
How are there any set bits in an unsigned integer ZERO? --[[User:Dgamey|Dgamey]] 03:43, 8 December 2011 (UTC) |
||
: I can't believe I forgot the zero! --[[User:Dgamey|Dgamey]] 03:06, 9 December 2011 (UTC) |
|||
Can you clarify? For it would be an interesting aside to see a host code sample that is not for [[wp:Two's complement|Two's complement]]. [[User:NevilleDNZ|NevilleDNZ]] 04:39, 8 December 2011 (UTC) |
Can you clarify? For it would be an interesting aside to see a host code sample that is not for [[wp:Two's complement|Two's complement]]. [[User:NevilleDNZ|NevilleDNZ]] 04:39, 8 December 2011 (UTC) |
||
:Hrm, if it's not in two's compliment, what motivates you to find ''bits'' in it to begin with? --[[User:Ledrug|Ledrug]] 04:49, 8 December 2011 (UTC) |
:Hrm, if it's not in two's compliment, what motivates you to find ''bits'' in it to begin with? --[[User:Ledrug|Ledrug]] 04:49, 8 December 2011 (UTC) |