undefined | Better HN

0 pointsSideburnsOfDoom11y ago0 comments

Well, that's not a bit-shift, it's a rotate.

0 comments

3 comments · 1 top-level

nostrebored11y ago· 2 in thread

What about circular rotates? a<<(x%32) & a>>(32-(x%32))

having worked an example to see how this could possibly work, I feel compelled to note for other people who might have wondered that a circular rotate looks like "(a << (x % 32)) | (a >> (32 - (x % 32)))"; as written, you're replacing every bit with zero.

nostrebored11y ago

a = 1111 0000 0000 1111 1111 0000 0000 1111

a << 37 == a << (37 % 32) == a << 5 == 0000 0001 1111 1110 0000 0001 1110 0000

a >> (32 - (37 % 32)) == a >> 27 == 0000 0000 0000 0000 0000 0000 0001 1110

anding the two together you get == 0000 0001 1111 1110 0000 0001 1111 1110

which is a circular rotation of the bit string...

1 more reply

j / k navigate · click thread line to collapse