I have a function which takes a fractional number, and converts it to an integer combined with a binary exponent.
For example, get_whole_number(10.5) will return => 21, 1, where
21is the integer1is the power of2you must divide the21by to get the original float number (21/(2**1) = 10.5).
So far I have this function, and it works but it is inefficient and slow:
function get_whole_number(number, exponent=0) {
if(number%1 == 0) return [number, exponent];
exponent++;
number *= 2;
if(exponent >= 500) return [Math.round(number), exponent];
return get_whole_number(number, exponent);
};
console.log(
get_whole_number(1.125).join("/2^"));
To make it faster, I wanted to replace some operations, notably number%1 and Math.round with bitwise operations.
So my question is, how do I go about replacing % 1 and round() with bitwise operators?
I was thinking that I could use:
if((number & number) == number)instead ofif(number%1 == 0)because bitwise operations ignore the fractional part of a number; but this only works sometimes.(number | number)instead ofMath.round(number)but this just truncates the value.