Free Pascal - Bitwise right shift: shr

Bit shift to the right as many time shifts the input number to the right as many as the value of the second input. output bits will be lost and the input bits will be 0. bit shift to the right can be used to divide the power of 2. example 256 divided by 2 on the third: 256 we shift to the right three times and the result is 32.

shr

Description

par1 shr par2

Used keywords: shr

Input

par1 - Any integer
par2 - Any integer

Output

Result - Integers

Examples

Free Pascal

Bitwise right shift the possible of use:

x := 8 shr 1;        // x = 4
y := $ff shr 4;     // y = 15
z := (x shr 2) shr 2; // z = 0

Free Pascal

Even one example in what situations we can use the operation bitwise right shift:

i shr 2
2 shr i
32 shr ($A shr 2) shr 1

Free Pascal

Other pieces of example codes:

(32 shr 2)

2 shr 2

You can find it in the following collections: bitwise operators

Bitwise right shift in another programming language:

Differences to: