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.)
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?