Multiply by De Bruijn sequence and lookup index

Thu, 02 Apr 2026 00:00:00 +0000

Computing the base‑2 logarithm of an integer (more precisely: finding the index of the highest set bit) is a common operation in systems programming, graphics, data compression, and low‑level algorithms. While Rust provides methods like u32::leading_zeros(), sometimes you may want your own implementation—especially an approach that is branch‑free, fast, and works on all stable targets.

2026-04 on Andrey's Notes on Everything

Multiply by De Bruijn sequence and lookup index