& unsigned should flip the bit, so unsigned unsigned is signed, etc
-
-
-
unununununsigned
- 1 more reply
New conversation -
-
-
Introducing the "short short short short short short int", which stores a single bit with 50% probability of correct retrieval.
-
Of course, there's a 50% chance an incorrect retrieval still returns the correct value, so the read value matches the stored value 75% of the time. What a deal!
- 2 more replies
New conversation -
-
-
Personaly, I'd prefer it if we could just chain the 'o's. So "long int" is 32-bit, "loooong int" is 256-bit, and so on.
Thanks. Twitter will use this to make your timeline better. UndoUndo
-
-
-
amendment: interpret mixed sequences of “short” and “long” as a binary search, rather than cancelling each other out short long int x; // 24 (or 48?) short short long long short int y; // 13
-
Short long would be 48, and long short would be 24.
End of conversation
New conversation -
-
-
A modest proposal: remove all of the integer keywords, replace them with fixed size integers
-
A modest proposal: remove all of the arithmetic types, introduce a single type instead which is just a variably-sized unum
End of conversation
New conversation -
-
-
More modest: You could just have one bit integers. Ordinary integers (and chars) can be provided by the standard library and a reasonably well optimizing compiler.
-
no numbers, just lambda
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.