I\'m using Math.ceil( Math.abs( x ) ) inside a loop.
Math.ceil( Math.abs( x ) )
Can anyone realize any optimization for this operation? (Bitwise or what?)
You are welcom
Here's another one, which doesn't need to do any lookup:
((x >= 0 ? x : -x) + 0.5) >> 0