= 27d567bc2d48d9f40e9ccc20ea370b15)
RolfAndreassen comments on More "Stupid" Questions - Less Wrong
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (495)
Hmm, interesting! Maybe the simplest approach would be to just implement a class with 16 (or 32, whatever) booleans, and do the underlying bit-pattern math. Then on printing, interpret as powers of two, or two's-complement, or whatever you like.
... and that is what being a big fish in a small pond feels like ;-) That is, most of them there won't even make it that far. At least, that was my experience.
(My approach was the cruder one of just taking a remainder modulo max size after each operation.)
That would work for unsigned integers, but I don't see how it gives you the classic rollover from 32767 to -32768?