09-05-2022, 02:05 AM
@OldMoses The math isn't as complex as you think. Let's take 10000001 as an example.
To rotate left once:
Shift the bits left once, store the result: 00000010
Take the original, shift the bits right 7 times, store the result: 00000001
OR those results:
00000010
00000001 (OR)
==========
00000011
And that's the general idea behind it.
I've personally never needed it either, but other folks did and they requested it from us. Since it was easy enough to implement (as illustrated in the example above), we went ahead and added it into the language for everyone to be able to use and enjoy.
Now, let's hope somebody out there can show us some amazing uses for it!
To rotate left once:
Shift the bits left once, store the result: 00000010
Take the original, shift the bits right 7 times, store the result: 00000001
OR those results:
00000010
00000001 (OR)
==========
00000011
And that's the general idea behind it.
I've personally never needed it either, but other folks did and they requested it from us. Since it was easy enough to implement (as illustrated in the example above), we went ahead and added it into the language for everyone to be able to use and enjoy.
Now, let's hope somebody out there can show us some amazing uses for it!