Shift the bits of an integer to the right.
Bits are shifted to the right x2. Because the internal
representation of numbers is in binary format, this operation is
equivalent to dividing x1 by 2**x2.
x1 (array_like, int) – Input values.
x2 (array_like, int) – Number of bits to remove at the right of x1.
out (Tensor, None, or tuple of Tensor and None, optional) – A location into which the result is stored. If provided, it must have
a shape that the inputs broadcast to. If not provided or None,
a freshly-allocated tensor is returned. A tuple (possible only as a
keyword argument) must have length equal to the number of outputs.
where (array_like, optional) – Values of True indicate to calculate the ufunc at that position, values
of False indicate to leave the value in the output alone.
out – Return x1 with bits shifted x2 times to the right.
Shift the bits of an integer to the left.
>>> import mars.tensor as mt
>>> mt.right_shift(10, 1).execute()
>>> mt.right_shift(10, [1,2,3]).execute()
array([5, 2, 1])