r.bitSar(number) → number
r.bitSar(number[, number, ...]) → number
In an arithmetic shift (also referred to as signed shift), like a logical shift, the bits that slide off the end disappear (except for the last, which goes into the carry flag). But in an arithmetic shift, the spaces are filled in such a way to preserve the sign of the number being slid. For this reason, arithmetic shifts are better suited for signed numbers in two’s complement format.
r.expr(32).bitSar(3).run(conn); // Result: 4
Couldn't find what you were looking for?