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 19:04, 8 May 2012
, 12 years ago→More Clarification "set bit": added comment about validity of defining how REXX stores integers. -- ~~~~
(→More Clarification "set bit": added comment about validity of defining how REXX stores integers. -- ~~~~) |
|||
Line 38:
:: It's not valid to say that "the bits of the integer are just the bits of the characters that are used to describe (hold) the value of the integer". Proof: Change the leading bit from a 1 to a 0. The result is not a valid integer. --[[User:Rdm|Rdm]] 17:52, 8 May 2012 (UTC)
::: 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)
===Clarification===
| |||