[Snippet] Bit Manip

[Nestharus]

This resource has moved here.

--

gone

 

[Magtheridon96]

Why not use GetPowerOfTwo? :v

 

[Nestharus]

Because I'm not exactly using powers of 2

powArr[31] = -2147483648
powArr[32] = 0

They are as the description describes it

*       -   Returns a number containing bitCount bits, the first bit (excluding leading 0s) being 1
*       -   Essentially*** (but not quite) a power of 2 function (2^(bits - 1))
*       -   Range: 1 to 32

 

[Magtheridon96]

Okay, fair enough. Approved.

 

[Nestharus]

Fixed GetBitSize and GetFreeBits
Added 2 new functions

*   function Bits2String32 takes integer num returns string
*   function Bits2String takes integer num returns string
*       -   Returns string of bits making up the number
*       -   Bit2String32 returns 32 bits with leading 0s while Bits2String returns exact bits.

 

[Nestharus]

Fixed GetBitSize and GetFreeBits

 

[Almia]

how does num - num/ 2*2 operated? Does it turn to num - ((num / 2) * 2))
I was just asking.

 

[Bribe]

Yes, multiply/divide take precedence over add/subtract and are scripted to process first, left to right.

5 - 5/3*3 is the same as 5-((5/3)*3), the parenthesis are just redundant for the compiler.

 

[D.O.G.]

You can avoid "I2S" function declaring "bit0" as string.

 

[TheWrecker]

how does num - num/ 2*2 operated? Does it turn to num - ((num / 2) * 2))
I was just asking.

Yes, multiply/divide take precedence over add/subtract and are scripted to process first, left to right.

5 - 5/3*3 is the same as 5-((5/3)*3), the parenthesis are just redundant for the compiler.

whats the usage of deviding by a number and then multiplying by the same? i mean x/2*2 = x

 

[Bribe]

ModuloInteger is the built-in BJ function when you use GUI "Mod".

It basically gets the remainder of a divisor.

For example, 10/3 is 3.3333... but with modulus you work with Integers so it truncates beyond the decimal point, so 10/3 = 3.

10 - ((10/3)*3) is 1, when you work with modulus.