Bitwise+ v1.1

Bitwise Operations for Decimals, Binary, and Hexadecimal

By BurningHot687/Raichu-Model/-Rig

If you are unfamiliar with bitwise operations, then hopefully this documentation can help you. If you still need further reading, you may go to this Wikipedia Article.

Keep in mind that version 1.1 currently only supports binary, decimal, and hexadecimal. All outputs, unless specified otherwise, are going to be in decimal. All inputs, unless specified otherwise, are assumed decimal unless there is a hexadecimal character within it. Also keep in mind Scratch has a 32 bit system and floats aren't supported yet.

Checks if the provided string is one of the alloted bases.

If the input and its assigned base are the same, then it will convert to the requested base.

Gets the bit (0 or 1) at the index of the binary representation of the input number. Index 0 refers to the least significant bit.

Signed right shift. Think of it like this:
We have a number -13 in binary:
11111111111111111111111111110011
The sign bit at the very left is 1, and let's say we shift it 3 places to the right without accounting for the sign.
00011111111111111111111111111110
That's a completely different number! (536870899)
For this reason, for each shift, we "duplicate" the sign bit and move it over to the left. After three shifts we end up with -2.
11111111111111111111111111111110
Obviously positive numbers wouldn't be affected drastically due to their sign bits being 0.

Shifts the bits left by the amount requested (1111 to 111100 if the amount was 2).

Unsigned right shift. Just shifts it to the right without caring about the sign bit:
11111111111111111111111111110011 to 00011111111111111111111111111110 or -13 to 536870899

Circular right shift:
Basically an unsigned right shift but instead of deleting bits they are looped to the 32nd bit.

Same as before but opposite direction.

Bitwise and.

Bitwise or.

Bitwise exclusive or (returns 1 if both bits are different).

Bitwise not.

Bitwise nand (0 if both inputs are on).

Bitwise nor (1 if both inputs are off).

Bitwise exclusive nor (1 if both inputs are the same).

Extras

These blocks are more experimental and definitely require updates here and there. These are meant to be used for specific-use cases.

Takes in a string and applies

"string".charCodeAt(number);

codePointAt is used for Unicode.

Takes in a number and applies

String.fromCharCode(number);

fromCodePoint is used for Unicode.

Takes in an array and turns it into a string.

Takes in an array and returns a string.

Switches the byte order of the provided number.

Takes in a hexadecimal number and returns a decimal.

Takes in a binary number and returns a decimal.

Takes in an octal number and returns a decimal.

These blocks probably won't work with extra blocks and might break normal blocks (or at least show unexpected behavior).

Changes the representation of binary numbers. Two's complement is applied to the most significant bit provided rather than the 32nd bit in dynamic mode.

Checks if you're using static or dynamic length.

And that should be all! :D