x: uN; let y = x & ((1 << k) - 1) normally, I would write something like above, but: it is not as elegant compared to (x << k) or (x >> k) when k = N, this is annoying as we have to bump 1 up to higher bit, as it down after the -1 Is there a more elegant way to say 'keep the last k bits; zero al…

I prefer this way. let y = (x << (N - k)) >> (N - k)

Get last k bits of a uN

newpavlov March 15, 2022, 10:46am 5

Another potential approach: x & !(uN::MAX.checked_shl(k).unwrap_or(0)).

Looking for feedback on bit manip techniques

Topic		Replies	Views
Bitshift and overflowing behavior help	3	2494	January 12, 2023
Effective way of removing the rightmost 1 bit in a u64 value taking care of zero help	15	2036	January 12, 2023
How to make an integer with N bits set without overflow	22	2535	November 1, 2021
Apparent arithmetic bug help	22	1128	July 11, 2020
Bit twiddling hack	12	584	September 15, 2023