fn bitReverse(r: *Mutable, a: Const, signedness: Signedness, bit_count: usize) void
[src]
r = @bitReverse(a) with 2s-complement semantics. r and a may be aliases.
Asserts the result fits in r
. Upper bound on the number of limbs needed by r is calcTwosCompLimbCount(bit_count)
.