* Signed integer modulo a/b where the remainder is guaranteed to be in [0..b], even if a is negative. * Only supports positive dividers.
*
assert(nextPowerOf2(3) == 4); assert(nextPowerOf2(21) == 32); assert(nextPowerOf2(1000) == 1024);
See Implementation
* Signed integer modulo a/b where the remainder is guaranteed to be in [0..b], even if a is negative. * Only supports positive dividers.