Re:Rust's integer intrinsics are impressive
by tjalfi on Saturday June 10, 2017 @11:59AM
(#14527795)
Fortran 2008 added a number of bit twiddling intrinsics[0].
Here are a few of the scalar intrinsics for bit counting.
popcnt() - population count
leadz() - leading zero
trailz() - trailing zero
poppar() - parity
[0] ftp://ftp.nag.co.uk/sc22wg5/n1701-n1750/n1729.pdfEdited to fix formatting.
Doing it by table lookup results in questions such as "am I wasting too much cache space on this?" and "is a 64K table causing cache misses".