Is there no case differentiation in the multiplication algo, that makes multiplication with whole numbers faster?

I prefer the bnot() method, because it's easier to read the source.

Having tons of if(b,if(1-c,if(a,0,d),1),5); things sux.

I gave up using division too.

Though /3 is shorter than *.333.