Timeline for Boolean as subtype of integer
Current License: CC BY-SA 3.0
9 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
Apr 13, 2017 at 12:32 | history | edited | CommunityBot |
replaced http://cstheory.stackexchange.com/ with https://cstheory.stackexchange.com/
|
|
Dec 3, 2011 at 14:43 | history | edited | Dave Clarke | CC BY-SA 3.0 |
added 4 characters in body
|
Dec 3, 2011 at 14:37 | comment | added | rwallace | Good answer, thanks! Typo, 'should really', you mean 'should not really'? | |
Dec 3, 2011 at 14:36 | vote | accept | rwallace | ||
Dec 3, 2011 at 10:14 | comment | added | Dave Clarke | I've incorporated your comment (and mine) into the answer. | |
Dec 3, 2011 at 10:12 | history | edited | Dave Clarke | CC BY-SA 3.0 |
added 248 characters in body
|
Dec 3, 2011 at 9:48 | comment | added | Dave Clarke | This is another option. And then you have subtype relation boolean < short < integer < long. Where + is addition-modulo-overflow. That's fairly natural, programmatically. | |
Dec 3, 2011 at 8:55 | comment | added | Peter Taylor | Surely there's a third option of making + be XOR, which is the most natural one by analogy with larger integer types. (Of course, in twos complement by the standard convention your two Boolean values are 0 and -1, but that's largely irrelevant). | |
Dec 3, 2011 at 7:35 | history | answered | Dave Clarke | CC BY-SA 3.0 |