Compute the number of limbs required to store a 2s-complement number of bit_count bits.
Special cases bit_count == 0 to return 1. Zero-bit integers can only store the value zero
and this big integer implementation stores zero using one limb.
pub fn calcTwosCompLimbCount(bit_count: usize) usize
pub fn calcTwosCompLimbCount(bit_count: usize) usize {
return @max(@divCeil(bit_count, @bitSizeOf(Limb)), 1);
}