Anonymous user
Talk:Find first and last set bit of a long integer: Difference between revisions
Talk:Find first and last set bit of a long integer (view source)
Revision as of 03:35, 12 June 2012
, 11 years ago→More Clarification "set bit": my understanding of someone else's understanding of their understanding of my understanding. -- ~~~~
m (→More Clarification "set bit": my understanding of someone else's understanding of their understanding of my understanding. -- ~~~~) |
|||
Line 40:
::: But it is valid to say that for the REXX language (that the bits of the integer are just the bits of the characters ...) because that's the way REXX stores "integers" (well, for that matter, the way REXX stores everything). Just because the leading bit is changed from "1" to a "0" (and thereby changing a leading bit in the character which is representing a numeric digit), doesn't make it a proof that the character that represented the digit wasn't valid in the first place. If the character (say) was a 7 (if using ASCII), now it's a '17'x. If it were on an EBCDIC system, the new character would be a lowercase "w". Of course, the leading character in the number could've been a blank. -- [[User:Gerard Schildberger|Gerard Schildberger]] 19:04, 8 May 2012 (UTC)
:::: I think that that's like saying that it's reasonable to pull a bit from a stack frame because the stack frame is being used to represent the number. --[[User:Rdm|Rdm]] 18:59, 9 May 2012 (UTC)
::::: [I hope I understand your wording, but instead:] ... ''because the stack frame is being used to'' '''STORE''' ''the number''.
===Clarification===
| |||