Initializing help system before first use

bitshift

Purpose
Shift an integer by a number of bits.
Synopsis
function bitshift(i:integer, n:integer):integer
Arguments
i 
Integer to be shifted
n 
Number of bits: >0 for shifting to the left and <0 for shifting to the right
Return value
Shifted integer.
Example
In the following, i takes the value 160, j takes the value 32, and k takes the value 1: 
i:= bitshift(5, 5)
j:= bitshit(1, 5)
k:= bitshit(128, -7)
Further information
Shifting of 1 bit to the right is the same as dividing it by 2 and shifting of 1 bit to the left is the same as multiplying by 2.
Related topics
bitset, bittest, bitflip, bitneg, bitval

Parent Topic Predefined functions and procedures

© 2001-2022 Fair Isaac Corporation. All rights reserved. This documentation is the property of Fair Isaac Corporation (“FICO”). Receipt or possession of this documentation does not convey rights to disclose, reproduce, make derivative works, use, or allow others to use it except solely for internal evaluation purposes to determine whether to purchase a license to the software described in this documentation, or as otherwise set forth in a written software license agreement between you and FICO (or a FICO affiliate). Use of this documentation and the software described in it must conform strictly to the foregoing permitted uses, and no other use is permitted.