shiftR -package:xmonad-contrib

Shift the first argument right by the specified number of bits. The result is undefined for negative shift amounts and shift amounts greater or equal to the bitSize. Some instances may throw an Overflow exception if given a negative input. Right shifts perform sign extension on signed number types; i.e. they fill the top bits with 1 if the x is negative and with 0 otherwise. An instance can define either this and shiftL or the unified shift, depending on which is more convenient for the type in question.

Bitwise Shift Right

Bitwise Shift Right

Move all elements towards the larger indexes. Elements that "fall" off the end are ignored. Empty slots are filled in with the given element. O(n).

Shift the argument right by the specified number of bits (which must be non-negative). The RL means "right, logical" (as opposed to RA for arithmetic) (although an arithmetic right shift wouldn't make sense for Word#)

Arithmetic shift-right operation Even though the shift-amount is expressed as Int#, the result is undefined for negative shift-amounts.

Safe right shift for Word#

, occasionally <math>. Move the last element to the beginning.

λ toList . shiftRight $ fromList [1,2,3]
[3,1,2]

, occasionally <math>. Move the last element to the beginning.