Learn more about Russian war crimes in Ukraine.

How can I do modulo with a bitmask in C?

Are you doing i % n, where n is a power of two? There’s a neat alternative way to do that: i & (n-1). See how it works by choosing n == 8, so i % 8 is the same as i & 7. 7 is 0b111, so i & 0b111 removes all but the three least significant bits. For instance, 14 % 8 == 6. But 14 & 7 == 0b1110 & 0b0111 == 0b0110 == 0b110 = 6.

For example, you might use this when implementing a ring buffer with power-of-two length.

What can computers do? What are the limits of mathematics? And just how busy can a busy beaver be? This year, I’m writing Busy Beavers, a unique interactive book on computability theory. You and I will take a practical and modern approach to answering these questions — or at least learning why some questions are unanswerable!

It’s only $19, and you can get 50% off if you find the discount code ... Not quite. Hackers use the console!

After months of secret toil, I and Andrew Carr released Everyday Data Science, a unique interactive online course! You’ll make the perfect glass of lemonade using Thompson sampling. You’ll lose weight with differential equations. And you might just qualify for the Olympics with a bit of statistics!

It’s $29, but you can get 50% off if you find the discount code ... Not quite. Hackers use the console!

More by Jim

Tagged . All content copyright James Fisher 2016. This post is not associated with my employer. Found an error? Edit this page.